{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MZOEMO7WOT3MMIHMEMVMSNMMWF","short_pith_number":"pith:MZOEMO7W","schema_version":"1.0","canonical_sha256":"665c463bf674f6c620ec232ac9358cb14721287cc16e6fbd250c3d499e84f14d","source":{"kind":"arxiv","id":"2404.07441","version":4},"attestation_state":"computed","paper":{"title":"Near Optimal Alphabet-Soundness Tradeoff PCPs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Dor Minzer, Kai Zhe Zheng","submitted_at":"2024-04-11T02:51:35Z","abstract_excerpt":"We show that for all $\\varepsilon>0$, for sufficiently large $q\\in\\mathbb{N}$ power of $2$, for all $\\delta>0$, it is NP-hard to distinguish whether a given $2$-Prover-$1$-Round projection game with alphabet size $q$ has value at least $1-\\delta$, or value at most $1/q^{1-\\varepsilon}$. This establishes a nearly optimal alphabet-to-soundness tradeoff for $2$-query PCPs with alphabet size $q$, improving upon a result of [Chan, Journal of the ACM 2016]. Our result has the following implications:\n  1) Near optimal hardness for Quadratic Programming: it is NP-hard to approximate the value of a giv"},"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":"2404.07441","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-04-11T02:51:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2fdbd6007e1814eb4b1d953279b8c31dd31328dffebe7f8340c5b14efb395330","abstract_canon_sha256":"d025f7dfeb908ae1f0bd76d51c82b331dc87ca292538849eba352c680a51ef78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:18.451513Z","signature_b64":"hgPYxrvo16D2ZFJv/YZp64L61zBg1jdfMIQO6n3FVWsAXVTIY8ORqqRsVTgCHaqi+dSlrrmE4UkygLqUJNouBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"665c463bf674f6c620ec232ac9358cb14721287cc16e6fbd250c3d499e84f14d","last_reissued_at":"2026-05-17T23:39:18.450696Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:18.450696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near Optimal Alphabet-Soundness Tradeoff PCPs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Dor Minzer, Kai Zhe Zheng","submitted_at":"2024-04-11T02:51:35Z","abstract_excerpt":"We show that for all $\\varepsilon>0$, for sufficiently large $q\\in\\mathbb{N}$ power of $2$, for all $\\delta>0$, it is NP-hard to distinguish whether a given $2$-Prover-$1$-Round projection game with alphabet size $q$ has value at least $1-\\delta$, or value at most $1/q^{1-\\varepsilon}$. This establishes a nearly optimal alphabet-to-soundness tradeoff for $2$-query PCPs with alphabet size $q$, improving upon a result of [Chan, Journal of the ACM 2016]. Our result has the following implications:\n  1) Near optimal hardness for Quadratic Programming: it is NP-hard to approximate the value of a giv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.07441","kind":"arxiv","version":4},"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":"2404.07441","created_at":"2026-05-17T23:39:18.450841+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.07441v4","created_at":"2026-05-17T23:39:18.450841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07441","created_at":"2026-05-17T23:39:18.450841+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZOEMO7WOT3M","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZOEMO7WOT3MMIHM","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZOEMO7W","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MZOEMO7WOT3MMIHMEMVMSNMMWF","json":"https://pith.science/pith/MZOEMO7WOT3MMIHMEMVMSNMMWF.json","graph_json":"https://pith.science/api/pith-number/MZOEMO7WOT3MMIHMEMVMSNMMWF/graph.json","events_json":"https://pith.science/api/pith-number/MZOEMO7WOT3MMIHMEMVMSNMMWF/events.json","paper":"https://pith.science/paper/MZOEMO7W"},"agent_actions":{"view_html":"https://pith.science/pith/MZOEMO7WOT3MMIHMEMVMSNMMWF","download_json":"https://pith.science/pith/MZOEMO7WOT3MMIHMEMVMSNMMWF.json","view_paper":"https://pith.science/paper/MZOEMO7W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.07441&json=true","fetch_graph":"https://pith.science/api/pith-number/MZOEMO7WOT3MMIHMEMVMSNMMWF/graph.json","fetch_events":"https://pith.science/api/pith-number/MZOEMO7WOT3MMIHMEMVMSNMMWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZOEMO7WOT3MMIHMEMVMSNMMWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZOEMO7WOT3MMIHMEMVMSNMMWF/action/storage_attestation","attest_author":"https://pith.science/pith/MZOEMO7WOT3MMIHMEMVMSNMMWF/action/author_attestation","sign_citation":"https://pith.science/pith/MZOEMO7WOT3MMIHMEMVMSNMMWF/action/citation_signature","submit_replication":"https://pith.science/pith/MZOEMO7WOT3MMIHMEMVMSNMMWF/action/replication_record"}},"created_at":"2026-05-17T23:39:18.450841+00:00","updated_at":"2026-05-17T23:39:18.450841+00:00"}