{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GYLR6SXGZTDQW3ORZN2B46D5SN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2214721aaf0b7974b28e32d6882f0dc3a2f33232600c4d4f23364d9547ee1c13","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-15T03:53:19Z","title_canon_sha256":"92d09d24ce208ddc1a299d0ddbf6b18ccc782941adc6654d2ae8f49909d3f42e"},"schema_version":"1.0","source":{"id":"2601.10047","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.10047","created_at":"2026-06-11T01:10:31Z"},{"alias_kind":"arxiv_version","alias_value":"2601.10047v2","created_at":"2026-06-11T01:10:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.10047","created_at":"2026-06-11T01:10:31Z"},{"alias_kind":"pith_short_12","alias_value":"GYLR6SXGZTDQ","created_at":"2026-06-11T01:10:31Z"},{"alias_kind":"pith_short_16","alias_value":"GYLR6SXGZTDQW3OR","created_at":"2026-06-11T01:10:31Z"},{"alias_kind":"pith_short_8","alias_value":"GYLR6SXG","created_at":"2026-06-11T01:10:31Z"}],"graph_snapshots":[{"event_id":"sha256:8b7206dcdb631b0959cb52992eca67f067f985e85347b0463d30251e729d4f3a","target":"graph","created_at":"2026-06-11T01:10:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2601.10047/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fernando Granha Jeronimo, Lenny Liu, Pranav Rajpal","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-15T03:53:19Z","title":"Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.10047","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7c5446001da311a96fba8a202efc424c697330570d4ed4ca389746fc40d8591c","target":"record","created_at":"2026-06-11T01:10:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2214721aaf0b7974b28e32d6882f0dc3a2f33232600c4d4f23364d9547ee1c13","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-15T03:53:19Z","title_canon_sha256":"92d09d24ce208ddc1a299d0ddbf6b18ccc782941adc6654d2ae8f49909d3f42e"},"schema_version":"1.0","source":{"id":"2601.10047","kind":"arxiv","version":2}},"canonical_sha256":"36171f4ae6ccc70b6dd1cb741e787d93621e2e9b663226e9335d8dd9e7b5efb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36171f4ae6ccc70b6dd1cb741e787d93621e2e9b663226e9335d8dd9e7b5efb8","first_computed_at":"2026-06-11T01:10:31.751252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:10:31.751252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"12S/udGM/oAFknskFaQbe6iVw7D7dwUICoDNy/+ytRP/pAETCN01W+qh/1TDCNuK2D8Sp48C11BlFTOnWP7hBg==","signature_status":"signed_v1","signed_at":"2026-06-11T01:10:31.752230Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.10047","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c5446001da311a96fba8a202efc424c697330570d4ed4ca389746fc40d8591c","sha256:8b7206dcdb631b0959cb52992eca67f067f985e85347b0463d30251e729d4f3a"],"state_sha256":"8056dc21d6508cd1712a30e99adb234702738ef98fb90022e4a39372b4d3f5a4"}