{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LR7GLCKGM3IFTC4KEPRH64FDWZ","short_pith_number":"pith:LR7GLCKG","schema_version":"1.0","canonical_sha256":"5c7e65894666d0598b8a23e27f70a3b67ccec0f85e785b655bd2d7127f659d88","source":{"kind":"arxiv","id":"2407.12762","version":2},"attestation_state":"computed","paper":{"title":"Quasi-Linear Size PCPs with Small Soundness from HDX","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dor Minzer, Mitali Bafna, Nikhil Vyas","submitted_at":"2024-07-17T17:39:42Z","abstract_excerpt":"We construct 2-query, quasi-linear size probabilistically checkable proofs (PCPs) with arbitrarily small constant soundness, improving upon Dinur's 2-query quasi-linear size PCPs with soundness $1-\\Omega(1)$. As an immediate corollary, we get that under the exponential time hypothesis, for all $\\epsilon>0$ no approximation algorithm for $3$-SAT can obtain an approximation ratio of $7/8+\\epsilon$ in time $2^{n/\\log^C n}$, where $C$ is a constant depending on $\\epsilon$. Our result builds on a recent line of independent works by Bafna, Lifshitz and Minzer, and Dikstein, Dinur and Lubotzky, that "},"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":"2407.12762","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-07-17T17:39:42Z","cross_cats_sorted":[],"title_canon_sha256":"588c1e4c8adc02fd43a9c0e7ae3e77e9b6fbb06550cddf7b72741a8a780adc7d","abstract_canon_sha256":"0e952c88e39578e05e66940271ad11cd957e64487140d3e39bcfc644fe51f032"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:32.291250Z","signature_b64":"o8uhpDJ5m9mv/uDzMsjmRs8rvqb0NcCscRIMljpouvZGj4Hb81GN/9+yM7cksKNqdptle5BUppAeGflO8AL0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c7e65894666d0598b8a23e27f70a3b67ccec0f85e785b655bd2d7127f659d88","last_reissued_at":"2026-07-05T09:32:32.290728Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:32.290728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-Linear Size PCPs with Small Soundness from HDX","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dor Minzer, Mitali Bafna, Nikhil Vyas","submitted_at":"2024-07-17T17:39:42Z","abstract_excerpt":"We construct 2-query, quasi-linear size probabilistically checkable proofs (PCPs) with arbitrarily small constant soundness, improving upon Dinur's 2-query quasi-linear size PCPs with soundness $1-\\Omega(1)$. As an immediate corollary, we get that under the exponential time hypothesis, for all $\\epsilon>0$ no approximation algorithm for $3$-SAT can obtain an approximation ratio of $7/8+\\epsilon$ in time $2^{n/\\log^C n}$, where $C$ is a constant depending on $\\epsilon$. Our result builds on a recent line of independent works by Bafna, Lifshitz and Minzer, and Dikstein, Dinur and Lubotzky, that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.12762","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/2407.12762/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":"2407.12762","created_at":"2026-07-05T09:32:32.290787+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.12762v2","created_at":"2026-07-05T09:32:32.290787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.12762","created_at":"2026-07-05T09:32:32.290787+00:00"},{"alias_kind":"pith_short_12","alias_value":"LR7GLCKGM3IF","created_at":"2026-07-05T09:32:32.290787+00:00"},{"alias_kind":"pith_short_16","alias_value":"LR7GLCKGM3IFTC4K","created_at":"2026-07-05T09:32:32.290787+00:00"},{"alias_kind":"pith_short_8","alias_value":"LR7GLCKG","created_at":"2026-07-05T09:32:32.290787+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22173","citing_title":"A Simple Sub-Polynomial Degree Coboundary Expander","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LR7GLCKGM3IFTC4KEPRH64FDWZ","json":"https://pith.science/pith/LR7GLCKGM3IFTC4KEPRH64FDWZ.json","graph_json":"https://pith.science/api/pith-number/LR7GLCKGM3IFTC4KEPRH64FDWZ/graph.json","events_json":"https://pith.science/api/pith-number/LR7GLCKGM3IFTC4KEPRH64FDWZ/events.json","paper":"https://pith.science/paper/LR7GLCKG"},"agent_actions":{"view_html":"https://pith.science/pith/LR7GLCKGM3IFTC4KEPRH64FDWZ","download_json":"https://pith.science/pith/LR7GLCKGM3IFTC4KEPRH64FDWZ.json","view_paper":"https://pith.science/paper/LR7GLCKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.12762&json=true","fetch_graph":"https://pith.science/api/pith-number/LR7GLCKGM3IFTC4KEPRH64FDWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LR7GLCKGM3IFTC4KEPRH64FDWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LR7GLCKGM3IFTC4KEPRH64FDWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LR7GLCKGM3IFTC4KEPRH64FDWZ/action/storage_attestation","attest_author":"https://pith.science/pith/LR7GLCKGM3IFTC4KEPRH64FDWZ/action/author_attestation","sign_citation":"https://pith.science/pith/LR7GLCKGM3IFTC4KEPRH64FDWZ/action/citation_signature","submit_replication":"https://pith.science/pith/LR7GLCKGM3IFTC4KEPRH64FDWZ/action/replication_record"}},"created_at":"2026-07-05T09:32:32.290787+00:00","updated_at":"2026-07-05T09:32:32.290787+00:00"}