{"as_of":"2026-07-20T14:39:00Z","canonical_paper_id":"HXZG7KIM","canonical_url":"https://pith.science/paper/HXZG7KIM/integrity","context_digest":"sha256:781cb322f8b7f4fc4d0cfbb7a66f6022372aed11c0329756ae35d504d88567b3","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/1706.05151","bundle_json":"/pith/HXZG7KIMQELTKHKRBSPMYLU6MU/bundle.json","citation_record":"/paper/HXZG7KIM/citation-record","evidence":"/evidence","html":"/paper/HXZG7KIM/integrity","integrity_json":"/paper/HXZG7KIM/integrity.json","json":"/paper/HXZG7KIM/integrity.json","legacy_integrity_json":"/pith/HXZG7KIM/integrity.json","paper":"/paper/HXZG7KIM","reference_changes":"/flags?citing=HXZG7KIM"},"paper":{"arxiv_id":"1706.05151","latest_version":1,"primary_cat":"cs.DC","title":"Distributed-Memory Parallel Algorithms for Counting and Listing Triangles in Big Graphs"},"pith_number":"pith:2017:HXZG7KIMQELTKHKRBSPMYLU6MU","pith_short":"HXZG7KIMQELTKHKRBSPMYLU6MU","record":{"arxiv_id":"1706.05151","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1706.05151. 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"}