{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PGJGOY4K4JLSMD2PIJ26BHC5EY","short_pith_number":"pith:PGJGOY4K","schema_version":"1.0","canonical_sha256":"799267638ae257260f4f4275e09c5d260a259230411a999f9c598b6febbfe31f","source":{"kind":"arxiv","id":"1903.12243","version":1},"attestation_state":"computed","paper":{"title":"DEEP-FRI: Sampling outside the box improves soundness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Eli Ben-Sasson, Lior Goldberg, Shubhangi Saraf, Swastik Kopparty","submitted_at":"2019-03-28T20:03:46Z","abstract_excerpt":"Motivated by the quest for scalable and succinct zero knowledge arguments, we revisit worst-case-to-average-case reductions for linear spaces, raised by [Rothblum, Vadhan, Wigderson, STOC 2013]. We first show a sharp quantitative form of a theorem which says that if an affine space $U$ is $\\delta$-far in relative Hamming distance from a linear code $V$ - this is the worst-case assumption - then most elements of $U$ are almost $\\delta$-far from $V$ - this is the average case. This leads to an optimal analysis of the soundness of the FRI protocol of [Ben-Sasson, et.al., eprint 2018] for proving "},"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":"1903.12243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-28T20:03:46Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"a8d91939f73ff63d239f55abbcedaf63d276aa12a33dab2a23fb3950c4402b86","abstract_canon_sha256":"2b06885c887cf7eba130c264c75523be823612f328d874a372824ae01575b292"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:54.493521Z","signature_b64":"SvpwpnFPv1e5nCYoQ9mpoYgFKeNpACC/+0CCuxGvQZ/qoDAfDd0/OXeCoH6m6P9rxYsVYSXSmvpZZbypnIONBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"799267638ae257260f4f4275e09c5d260a259230411a999f9c598b6febbfe31f","last_reissued_at":"2026-05-17T23:49:54.492933Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:54.492933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DEEP-FRI: Sampling outside the box improves soundness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Eli Ben-Sasson, Lior Goldberg, Shubhangi Saraf, Swastik Kopparty","submitted_at":"2019-03-28T20:03:46Z","abstract_excerpt":"Motivated by the quest for scalable and succinct zero knowledge arguments, we revisit worst-case-to-average-case reductions for linear spaces, raised by [Rothblum, Vadhan, Wigderson, STOC 2013]. We first show a sharp quantitative form of a theorem which says that if an affine space $U$ is $\\delta$-far in relative Hamming distance from a linear code $V$ - this is the worst-case assumption - then most elements of $U$ are almost $\\delta$-far from $V$ - this is the average case. This leads to an optimal analysis of the soundness of the FRI protocol of [Ben-Sasson, et.al., eprint 2018] for proving "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12243","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1903.12243","created_at":"2026-05-17T23:49:54.493032+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.12243v1","created_at":"2026-05-17T23:49:54.493032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12243","created_at":"2026-05-17T23:49:54.493032+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGJGOY4K4JLS","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGJGOY4K4JLSMD2P","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGJGOY4K","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07595","citing_title":"A Syndrome-Space Approach to Proximity Gaps and Correlated Agreement for Random Linear Codes","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PGJGOY4K4JLSMD2PIJ26BHC5EY","json":"https://pith.science/pith/PGJGOY4K4JLSMD2PIJ26BHC5EY.json","graph_json":"https://pith.science/api/pith-number/PGJGOY4K4JLSMD2PIJ26BHC5EY/graph.json","events_json":"https://pith.science/api/pith-number/PGJGOY4K4JLSMD2PIJ26BHC5EY/events.json","paper":"https://pith.science/paper/PGJGOY4K"},"agent_actions":{"view_html":"https://pith.science/pith/PGJGOY4K4JLSMD2PIJ26BHC5EY","download_json":"https://pith.science/pith/PGJGOY4K4JLSMD2PIJ26BHC5EY.json","view_paper":"https://pith.science/paper/PGJGOY4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.12243&json=true","fetch_graph":"https://pith.science/api/pith-number/PGJGOY4K4JLSMD2PIJ26BHC5EY/graph.json","fetch_events":"https://pith.science/api/pith-number/PGJGOY4K4JLSMD2PIJ26BHC5EY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGJGOY4K4JLSMD2PIJ26BHC5EY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGJGOY4K4JLSMD2PIJ26BHC5EY/action/storage_attestation","attest_author":"https://pith.science/pith/PGJGOY4K4JLSMD2PIJ26BHC5EY/action/author_attestation","sign_citation":"https://pith.science/pith/PGJGOY4K4JLSMD2PIJ26BHC5EY/action/citation_signature","submit_replication":"https://pith.science/pith/PGJGOY4K4JLSMD2PIJ26BHC5EY/action/replication_record"}},"created_at":"2026-05-17T23:49:54.493032+00:00","updated_at":"2026-05-17T23:49:54.493032+00:00"}