{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VTXYBVFNIWANUNB4C3B5T7URNB","short_pith_number":"pith:VTXYBVFN","schema_version":"1.0","canonical_sha256":"acef80d4ad4580da343c16c3d9fe91687311cd987d5c2d56839d1185a4b637f8","source":{"kind":"arxiv","id":"1305.5500","version":2},"attestation_state":"computed","paper":{"title":"A Characterization of Approximation Resistance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Madhur Tulsiani, Pratik Worah, Subhash Khot","submitted_at":"2013-05-23T17:52:58Z","abstract_excerpt":"A predicate f:{-1,1}^k -> {0,1} with \\rho(f) = \\frac{|f^{-1}(1)|}{2^k} is called {\\it approximation resistant} if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment that satisfies at least \\rho(f)+\\Omega(1) fraction of the constraints.\n  We present a complete characterization of approximation resistant predicates under the Unique Games Conjecture. We also present characterizations in the {\\it mixed} linear and semi-definite programming hierarchy and the Sherali-Adams linear programming hierarchy. In the former case, the characterization coincides with"},"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":"1305.5500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-23T17:52:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cfc3897c8759a02e5f65bd6d8545291c83e3a2b158b5448dffdd2d42134f2a13","abstract_canon_sha256":"a094ff5db209d9fee8c8d89229c29ee45ae3ca45717a47f3d6d13a61e6f68326"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:22.113581Z","signature_b64":"XKHYaXi8wUID7ZTdMrWD4XOzzpcg9lAnNh8yZuc5wp0f2eYOd7TH8BVHhLQqJ2Nhw6N5YnlD/Ekc+bQK+p5RAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acef80d4ad4580da343c16c3d9fe91687311cd987d5c2d56839d1185a4b637f8","last_reissued_at":"2026-05-18T03:09:22.112823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:22.112823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Characterization of Approximation Resistance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Madhur Tulsiani, Pratik Worah, Subhash Khot","submitted_at":"2013-05-23T17:52:58Z","abstract_excerpt":"A predicate f:{-1,1}^k -> {0,1} with \\rho(f) = \\frac{|f^{-1}(1)|}{2^k} is called {\\it approximation resistant} if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment that satisfies at least \\rho(f)+\\Omega(1) fraction of the constraints.\n  We present a complete characterization of approximation resistant predicates under the Unique Games Conjecture. We also present characterizations in the {\\it mixed} linear and semi-definite programming hierarchy and the Sherali-Adams linear programming hierarchy. In the former case, the characterization coincides with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5500","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":""},"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":"1305.5500","created_at":"2026-05-18T03:09:22.112939+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5500v2","created_at":"2026-05-18T03:09:22.112939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5500","created_at":"2026-05-18T03:09:22.112939+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTXYBVFNIWAN","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTXYBVFNIWANUNB4","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTXYBVFN","created_at":"2026-05-18T12:28:04.890932+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/VTXYBVFNIWANUNB4C3B5T7URNB","json":"https://pith.science/pith/VTXYBVFNIWANUNB4C3B5T7URNB.json","graph_json":"https://pith.science/api/pith-number/VTXYBVFNIWANUNB4C3B5T7URNB/graph.json","events_json":"https://pith.science/api/pith-number/VTXYBVFNIWANUNB4C3B5T7URNB/events.json","paper":"https://pith.science/paper/VTXYBVFN"},"agent_actions":{"view_html":"https://pith.science/pith/VTXYBVFNIWANUNB4C3B5T7URNB","download_json":"https://pith.science/pith/VTXYBVFNIWANUNB4C3B5T7URNB.json","view_paper":"https://pith.science/paper/VTXYBVFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5500&json=true","fetch_graph":"https://pith.science/api/pith-number/VTXYBVFNIWANUNB4C3B5T7URNB/graph.json","fetch_events":"https://pith.science/api/pith-number/VTXYBVFNIWANUNB4C3B5T7URNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTXYBVFNIWANUNB4C3B5T7URNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTXYBVFNIWANUNB4C3B5T7URNB/action/storage_attestation","attest_author":"https://pith.science/pith/VTXYBVFNIWANUNB4C3B5T7URNB/action/author_attestation","sign_citation":"https://pith.science/pith/VTXYBVFNIWANUNB4C3B5T7URNB/action/citation_signature","submit_replication":"https://pith.science/pith/VTXYBVFNIWANUNB4C3B5T7URNB/action/replication_record"}},"created_at":"2026-05-18T03:09:22.112939+00:00","updated_at":"2026-05-18T03:09:22.112939+00:00"}