{"as_of":"2026-07-14T11:31:00Z","canonical_paper_id":"2001.10751","canonical_url":"https://pith.science/paper/2001.10751/integrity","context_digest":"sha256:71fd90b0445c940d9d8dba9e04d2b9eb5559ff31836439547d487cfa095123bd","coverage_summary":[],"findings":[],"findings_empty_copy":"No checks are listed for this paper yet.","findings_observation_state":"no_listed_checks","links":{"arxiv":"https://arxiv.org/abs/2001.10751","bundle_json":"/pith/IPMV5QKR5GW7UK6KDGGYOOLD37/bundle.json","citation_record":"/paper/2001.10751/citation-record","evidence":"/evidence","html":"/paper/2001.10751/integrity","integrity_json":"/paper/2001.10751/integrity.json","json":"/paper/2001.10751/integrity.json","legacy_integrity_json":"/pith/2001.10751/integrity.json","paper":"/paper/2001.10751","reference_changes":"/flags?citing=2001.10751"},"paper":{"arxiv_id":"2001.10751","latest_version":1,"primary_cat":"cs.DS","title":"New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs"},"pith_number":"pith:2020:IPMV5QKR5GW7UK6KDGGYOOLD37","pith_short":"IPMV5QKR5GW7UK6KDGGYOOLD37","record":{"arxiv_id":"2001.10751","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:2001.10751. No listed check completed, so this record makes no findings claim.","counts":{"completed":0,"failed":0,"listed":0,"not_collected":0,"not_requested":0,"partial":0,"public_findings_from_completed":0,"skipped":0,"unavailable":0,"withheld":0},"coverage":[],"observed_at":null,"refusal":"This is a record of named checks, not a clean-status claim or a paper verdict.","schema":"pith.integrity.v1"},"schema":"pith.paper-integrity-record.v1","species":"LEDGER"}