{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GYLR6SXGZTDQW3ORZN2B46D5SN","short_pith_number":"pith:GYLR6SXG","schema_version":"1.0","canonical_sha256":"36171f4ae6ccc70b6dd1cb741e787d93621e2e9b663226e9335d8dd9e7b5efb8","source":{"kind":"arxiv","id":"2601.10047","version":2},"attestation_state":"computed","paper":{"title":"Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Fernando Granha Jeronimo, Lenny Liu, Pranav Rajpal","submitted_at":"2026-01-15T03:53:19Z","abstract_excerpt":"A collection of sets satisfies a $(\\delta,\\varepsilon)$-proximity gap with respect to some property if for every set in the collection, either (i) all members of the set are $\\delta$-close to the property in (relative) Hamming distance, or (ii) only a small $\\varepsilon$-fraction of members are $\\delta$-close to the property.\n  In a seminal work, Ben-Sasson \\textit{et al.}\\ showed that the collection of affine subspaces exhibits a $(\\delta,\\varepsilon)$-proximity gap with respect to the property of being Reed--Solomon (RS) codewords with $\\delta$ up to the so-called Johnson bound for list deco"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2601.10047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-15T03:53:19Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"92d09d24ce208ddc1a299d0ddbf6b18ccc782941adc6654d2ae8f49909d3f42e","abstract_canon_sha256":"2214721aaf0b7974b28e32d6882f0dc3a2f33232600c4d4f23364d9547ee1c13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:31.752230Z","signature_b64":"12S/udGM/oAFknskFaQbe6iVw7D7dwUICoDNy/+ytRP/pAETCN01W+qh/1TDCNuK2D8Sp48C11BlFTOnWP7hBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36171f4ae6ccc70b6dd1cb741e787d93621e2e9b663226e9335d8dd9e7b5efb8","last_reissued_at":"2026-06-11T01:10:31.751252Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:31.751252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Fernando Granha Jeronimo, Lenny Liu, Pranav Rajpal","submitted_at":"2026-01-15T03:53:19Z","abstract_excerpt":"A collection of sets satisfies a $(\\delta,\\varepsilon)$-proximity gap with respect to some property if for every set in the collection, either (i) all members of the set are $\\delta$-close to the property in (relative) Hamming distance, or (ii) only a small $\\varepsilon$-fraction of members are $\\delta$-close to the property.\n  In a seminal work, Ben-Sasson \\textit{et al.}\\ showed that the collection of affine subspaces exhibits a $(\\delta,\\varepsilon)$-proximity gap with respect to the property of being Reed--Solomon (RS) codewords with $\\delta$ up to the so-called Johnson bound for list deco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.10047","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.10047/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2601.10047","created_at":"2026-06-11T01:10:31.751438+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.10047v2","created_at":"2026-06-11T01:10:31.751438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.10047","created_at":"2026-06-11T01:10:31.751438+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYLR6SXGZTDQ","created_at":"2026-06-11T01:10:31.751438+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYLR6SXGZTDQW3OR","created_at":"2026-06-11T01:10:31.751438+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYLR6SXG","created_at":"2026-06-11T01:10:31.751438+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.12216","citing_title":"Angle Between Two Vectors over Finite Fields and an Application to Projective Unique Decoding","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.07595","citing_title":"A Syndrome-Space Approach to Proximity Gaps and Correlated Agreement for Random Linear Codes","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GYLR6SXGZTDQW3ORZN2B46D5SN","json":"https://pith.science/pith/GYLR6SXGZTDQW3ORZN2B46D5SN.json","graph_json":"https://pith.science/api/pith-number/GYLR6SXGZTDQW3ORZN2B46D5SN/graph.json","events_json":"https://pith.science/api/pith-number/GYLR6SXGZTDQW3ORZN2B46D5SN/events.json","paper":"https://pith.science/paper/GYLR6SXG"},"agent_actions":{"view_html":"https://pith.science/pith/GYLR6SXGZTDQW3ORZN2B46D5SN","download_json":"https://pith.science/pith/GYLR6SXGZTDQW3ORZN2B46D5SN.json","view_paper":"https://pith.science/paper/GYLR6SXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.10047&json=true","fetch_graph":"https://pith.science/api/pith-number/GYLR6SXGZTDQW3ORZN2B46D5SN/graph.json","fetch_events":"https://pith.science/api/pith-number/GYLR6SXGZTDQW3ORZN2B46D5SN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYLR6SXGZTDQW3ORZN2B46D5SN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYLR6SXGZTDQW3ORZN2B46D5SN/action/storage_attestation","attest_author":"https://pith.science/pith/GYLR6SXGZTDQW3ORZN2B46D5SN/action/author_attestation","sign_citation":"https://pith.science/pith/GYLR6SXGZTDQW3ORZN2B46D5SN/action/citation_signature","submit_replication":"https://pith.science/pith/GYLR6SXGZTDQW3ORZN2B46D5SN/action/replication_record"}},"created_at":"2026-06-11T01:10:31.751438+00:00","updated_at":"2026-06-11T01:10:31.751438+00:00"}