{"as_of":"2026-07-15T03:56:00Z","canonical_paper_id":"CWBXHGSL","canonical_url":"https://pith.science/paper/CWBXHGSL/integrity","context_digest":"sha256:0c4f74d9f4130c389ac183eee724e72b33cbb6ee53f4631b5db6ece821a8be4a","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.10801","bundle_json":"/pith/CWBXHGSLRH3TMUPH2T4V46FMC3/bundle.json","citation_record":"/paper/CWBXHGSL/citation-record","evidence":"/evidence","html":"/paper/CWBXHGSL/integrity","integrity_json":"/paper/CWBXHGSL/integrity.json","json":"/paper/CWBXHGSL/integrity.json","legacy_integrity_json":"/pith/CWBXHGSL/integrity.json","paper":"/paper/CWBXHGSL","reference_changes":"/flags?citing=CWBXHGSL"},"paper":{"arxiv_id":"2001.10801","latest_version":2,"primary_cat":"cs.DS","title":"Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds"},"pith_number":"pith:2020:CWBXHGSLRH3TMUPH2T4V46FMC3","pith_short":"CWBXHGSLRH3TMUPH2T4V46FMC3","record":{"arxiv_id":"2001.10801","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:2001.10801. 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"}