{"as_of":"2026-07-16T07:58:00Z","canonical_paper_id":"1606.00531","canonical_url":"https://pith.science/paper/1606.00531/integrity","context_digest":"sha256:251ddbe8f1bd6d2624cc2e01dceb54d826ba39b8a31bca7e5f1b074bb31b1b2a","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/1606.00531","bundle_json":"/pith/RMM6LBGQ646SQJMNZD7JUQWB57/bundle.json","citation_record":"/paper/1606.00531/citation-record","evidence":"/evidence","html":"/paper/1606.00531/integrity","integrity_json":"/paper/1606.00531/integrity.json","json":"/paper/1606.00531/integrity.json","legacy_integrity_json":"/pith/1606.00531/integrity.json","paper":"/paper/1606.00531","reference_changes":"/flags?citing=1606.00531"},"paper":{"arxiv_id":"1606.00531","latest_version":1,"primary_cat":"cs.IT","title":"Fast and Robust Compressive Phase Retrieval with Sparse-Graph Codes"},"pith_number":"pith:2016:RMM6LBGQ646SQJMNZD7JUQWB57","pith_short":"RMM6LBGQ646SQJMNZD7JUQWB57","record":{"arxiv_id":"1606.00531","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1606.00531. 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"}