{"as_of":"2026-07-17T11:54:00Z","canonical_paper_id":"1508.04485","canonical_url":"https://pith.science/paper/1508.04485/integrity","context_digest":"sha256:5dbab4d02404d1a4e0df9d6109c6814184a6d8e46f55441c6e6804bd880e7ed3","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/1508.04485","bundle_json":"/pith/4QAR2R4HYAKDKM6Q2QEZLHJEIC/bundle.json","citation_record":"/paper/1508.04485/citation-record","evidence":"/evidence","html":"/paper/1508.04485/integrity","integrity_json":"/paper/1508.04485/integrity.json","json":"/paper/1508.04485/integrity.json","legacy_integrity_json":"/pith/1508.04485/integrity.json","paper":"/paper/1508.04485","reference_changes":"/flags?citing=1508.04485"},"paper":{"arxiv_id":"1508.04485","latest_version":1,"primary_cat":"cs.IT","title":"SAFFRON: A Fast, Efficient, and Robust Framework for Group Testing based on Sparse-Graph Codes"},"pith_number":"pith:2015:4QAR2R4HYAKDKM6Q2QEZLHJEIC","pith_short":"4QAR2R4HYAKDKM6Q2QEZLHJEIC","record":{"arxiv_id":"1508.04485","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1508.04485. 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"}