{"as_of":"2026-07-16T02:11:00Z","canonical_paper_id":"2009.02584","canonical_url":"https://pith.science/paper/2009.02584/integrity","context_digest":"sha256:b0554b6bcb2b05a2aca7976b5bf9a28f94ccbe571880cc3063788a1865ee2b96","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/2009.02584","bundle_json":"/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL/bundle.json","citation_record":"/paper/2009.02584/citation-record","evidence":"/evidence","html":"/paper/2009.02584/integrity","integrity_json":"/paper/2009.02584/integrity.json","json":"/paper/2009.02584/integrity.json","legacy_integrity_json":"/pith/2009.02584/integrity.json","paper":"/paper/2009.02584","reference_changes":"/flags?citing=2009.02584"},"paper":{"arxiv_id":"2009.02584","latest_version":3,"primary_cat":"cs.DS","title":"Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing"},"pith_number":"pith:2020:32WBQ4ZZ2W6T6ZB327SBIWGBPL","pith_short":"32WBQ4ZZ2W6T6ZB327SBIWGBPL","record":{"arxiv_id":"2009.02584","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:2009.02584. 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"}