{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VTXYBVFNIWANUNB4C3B5T7URNB","short_pith_number":"pith:VTXYBVFN","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"},"canonical_sha256":"acef80d4ad4580da343c16c3d9fe91687311cd987d5c2d56839d1185a4b637f8","source":{"kind":"arxiv","id":"1305.5500","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5500","created_at":"2026-05-18T03:09:22Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5500v2","created_at":"2026-05-18T03:09:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5500","created_at":"2026-05-18T03:09:22Z"},{"alias_kind":"pith_short_12","alias_value":"VTXYBVFNIWAN","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VTXYBVFNIWANUNB4","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VTXYBVFN","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VTXYBVFNIWANUNB4C3B5T7URNB","target":"record","payload":{"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"},"canonical_sha256":"acef80d4ad4580da343c16c3d9fe91687311cd987d5c2d56839d1185a4b637f8","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"},"source_kind":"arxiv","source_id":"1305.5500","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZUvrwLMAyjnk+xRBpVoiE8ZapnzBvC2h/6ANLjYJrxNnPyhdO3CHkDzeSxso6cki9diJsdQYCTKiH+XN/LPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:14:23.918092Z"},"content_sha256":"f72b1ca3aa5ed28aeb26014f8c35181f245fa93ccf4e71593f4b3ab656a11ba3","schema_version":"1.0","event_id":"sha256:f72b1ca3aa5ed28aeb26014f8c35181f245fa93ccf4e71593f4b3ab656a11ba3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VTXYBVFNIWANUNB4C3B5T7URNB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SWGURKciIOnAfZm8a0MU5Kpuo+zgaDs1vML0cjEf1nmSjMeQ2mBOlBL7PBcgEPJU6w1UIj7u9ENOrnJbZ6mtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:14:23.918455Z"},"content_sha256":"108f0ce0911b9923f9f4e8ef6ba258c0da70cd190615de860f0389b786c0cf47","schema_version":"1.0","event_id":"sha256:108f0ce0911b9923f9f4e8ef6ba258c0da70cd190615de860f0389b786c0cf47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTXYBVFNIWANUNB4C3B5T7URNB/bundle.json","state_url":"https://pith.science/pith/VTXYBVFNIWANUNB4C3B5T7URNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTXYBVFNIWANUNB4C3B5T7URNB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T18:14:23Z","links":{"resolver":"https://pith.science/pith/VTXYBVFNIWANUNB4C3B5T7URNB","bundle":"https://pith.science/pith/VTXYBVFNIWANUNB4C3B5T7URNB/bundle.json","state":"https://pith.science/pith/VTXYBVFNIWANUNB4C3B5T7URNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTXYBVFNIWANUNB4C3B5T7URNB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VTXYBVFNIWANUNB4C3B5T7URNB","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":"a094ff5db209d9fee8c8d89229c29ee45ae3ca45717a47f3d6d13a61e6f68326","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-23T17:52:58Z","title_canon_sha256":"cfc3897c8759a02e5f65bd6d8545291c83e3a2b158b5448dffdd2d42134f2a13"},"schema_version":"1.0","source":{"id":"1305.5500","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5500","created_at":"2026-05-18T03:09:22Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5500v2","created_at":"2026-05-18T03:09:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5500","created_at":"2026-05-18T03:09:22Z"},{"alias_kind":"pith_short_12","alias_value":"VTXYBVFNIWAN","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VTXYBVFNIWANUNB4","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VTXYBVFN","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:108f0ce0911b9923f9f4e8ef6ba258c0da70cd190615de860f0389b786c0cf47","target":"graph","created_at":"2026-05-18T03:09:22Z","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"},"paper":{"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","authors_text":"Madhur Tulsiani, Pratik Worah, Subhash Khot","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-23T17:52:58Z","title":"A Characterization of Approximation Resistance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5500","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:f72b1ca3aa5ed28aeb26014f8c35181f245fa93ccf4e71593f4b3ab656a11ba3","target":"record","created_at":"2026-05-18T03:09:22Z","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":"a094ff5db209d9fee8c8d89229c29ee45ae3ca45717a47f3d6d13a61e6f68326","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-23T17:52:58Z","title_canon_sha256":"cfc3897c8759a02e5f65bd6d8545291c83e3a2b158b5448dffdd2d42134f2a13"},"schema_version":"1.0","source":{"id":"1305.5500","kind":"arxiv","version":2}},"canonical_sha256":"acef80d4ad4580da343c16c3d9fe91687311cd987d5c2d56839d1185a4b637f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acef80d4ad4580da343c16c3d9fe91687311cd987d5c2d56839d1185a4b637f8","first_computed_at":"2026-05-18T03:09:22.112823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:22.112823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XKHYaXi8wUID7ZTdMrWD4XOzzpcg9lAnNh8yZuc5wp0f2eYOd7TH8BVHhLQqJ2Nhw6N5YnlD/Ekc+bQK+p5RAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:22.113581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5500","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f72b1ca3aa5ed28aeb26014f8c35181f245fa93ccf4e71593f4b3ab656a11ba3","sha256:108f0ce0911b9923f9f4e8ef6ba258c0da70cd190615de860f0389b786c0cf47"],"state_sha256":"1c335c7c7bc5a99dc2253f61c43d00bfd28b48fd0d89f144d9d0587b4e33fcce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ljxXxrhtuTBmT1bL2AisX+PsUDbY7Pl0dMyo+OHmNNHpgWp/JcBtst0ziBX2Q2Zithiu0edlnEaIh+NLF9iyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T18:14:23.920407Z","bundle_sha256":"ffef8b09e7394584e9fc3202dda57a37ee4149502825b81b18fe2aef73953b17"}}