{"as_of":"2026-07-16T21:16:00Z","canonical_paper_id":"GYLR6SXG","canonical_url":"https://pith.science/paper/GYLR6SXG/integrity","context_digest":"sha256:87d4ef9dd06bfc536120d31b9f7f84ea7749b823292ee4aa46e9d51c1968cb6c","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/2601.10047","bundle_json":"/pith/GYLR6SXGZTDQW3ORZN2B46D5SN/bundle.json","citation_record":"/paper/GYLR6SXG/citation-record","evidence":"/evidence","html":"/paper/GYLR6SXG/integrity","integrity_json":"/paper/GYLR6SXG/integrity.json","json":"/paper/GYLR6SXG/integrity.json","legacy_integrity_json":"/pith/GYLR6SXG/integrity.json","paper":"/paper/GYLR6SXG","reference_changes":"/flags?citing=GYLR6SXG"},"paper":{"arxiv_id":"2601.10047","latest_version":2,"primary_cat":"cs.IT","title":"Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs"},"pith_number":"pith:2026:GYLR6SXGZTDQW3ORZN2B46D5SN","pith_short":"GYLR6SXGZTDQW3ORZN2B46D5SN","record":{"arxiv_id":"2601.10047","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:2601.10047. 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"}