{"as_of":"2026-07-17T05:33:00Z","canonical_paper_id":"1407.3144","canonical_url":"https://pith.science/paper/1407.3144/integrity","context_digest":"sha256:21708e7c09c6c862806faf8665384ca4f2f2f2397a7690d509942a303f99a621","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/1407.3144","bundle_json":"/pith/C5DVPJTTTVIRAVFP5SC5C546HV/bundle.json","citation_record":"/paper/1407.3144/citation-record","evidence":"/evidence","html":"/paper/1407.3144/integrity","integrity_json":"/paper/1407.3144/integrity.json","json":"/paper/1407.3144/integrity.json","legacy_integrity_json":"/pith/1407.3144/integrity.json","paper":"/paper/1407.3144","reference_changes":"/flags?citing=1407.3144"},"paper":{"arxiv_id":"1407.3144","latest_version":3,"primary_cat":"cs.DC","title":"Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation"},"pith_number":"pith:2014:C5DVPJTTTVIRAVFP5SC5C546HV","pith_short":"C5DVPJTTTVIRAVFP5SC5C546HV","record":{"arxiv_id":"1407.3144","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1407.3144. 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"}