{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IH3NCZHOXK5NMJAUZDJM6S7TWX","short_pith_number":"pith:IH3NCZHO","schema_version":"1.0","canonical_sha256":"41f6d164eebabad62414c8d2cf4bf3b5d08d3440686a7603dc6b8f37c12ebedd","source":{"kind":"arxiv","id":"1404.5236","version":2},"attestation_state":"computed","paper":{"title":"Sum-of-squares proofs and the quest toward optimal algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG","math.OC"],"primary_cat":"cs.DS","authors_text":"Boaz Barak, David Steurer","submitted_at":"2014-04-21T16:24:13Z","abstract_excerpt":"In order to obtain the best-known guarantees, algorithms are traditionally tailored to the particular problem we want to solve. Two recent developments, the Unique Games Conjecture (UGC) and the Sum-of-Squares (SOS) method, surprisingly suggest that this tailoring is not necessary and that a single efficient algorithm could achieve best possible guarantees for a wide range of different problems.\n  The Unique Games Conjecture (UGC) is a tantalizing conjecture in computational complexity, which, if true, will shed light on the complexity of a great many problems. In particular this conjecture pr"},"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":"1404.5236","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-21T16:24:13Z","cross_cats_sorted":["cs.CC","cs.LG","math.OC"],"title_canon_sha256":"99326d7216b0407ae072f14598410e16b62ca22169e5653917b65f85d4133e99","abstract_canon_sha256":"7ecaaa354b00f71a2185b93f9187a769ad532f741ec300b4ba7813de0602489a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:00.605259Z","signature_b64":"8IPznODHdAs1++tyererq08PG/ZZJJSFdrUjVQb4Siymg76lEilHFgKnfLqi5LMBhEc33yAU++LeV9wOiO55DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41f6d164eebabad62414c8d2cf4bf3b5d08d3440686a7603dc6b8f37c12ebedd","last_reissued_at":"2026-05-18T02:51:00.604850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:00.604850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sum-of-squares proofs and the quest toward optimal algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG","math.OC"],"primary_cat":"cs.DS","authors_text":"Boaz Barak, David Steurer","submitted_at":"2014-04-21T16:24:13Z","abstract_excerpt":"In order to obtain the best-known guarantees, algorithms are traditionally tailored to the particular problem we want to solve. Two recent developments, the Unique Games Conjecture (UGC) and the Sum-of-Squares (SOS) method, surprisingly suggest that this tailoring is not necessary and that a single efficient algorithm could achieve best possible guarantees for a wide range of different problems.\n  The Unique Games Conjecture (UGC) is a tantalizing conjecture in computational complexity, which, if true, will shed light on the complexity of a great many problems. In particular this conjecture pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5236","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":"1404.5236","created_at":"2026-05-18T02:51:00.604907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5236v2","created_at":"2026-05-18T02:51:00.604907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5236","created_at":"2026-05-18T02:51:00.604907+00:00"},{"alias_kind":"pith_short_12","alias_value":"IH3NCZHOXK5N","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IH3NCZHOXK5NMJAU","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IH3NCZHO","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2606.23727","citing_title":"Certifying Quantum Optimization and Circuit Cutting by Using Quantum-Classical Moment Duality","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2605.25303","citing_title":"Algorithms with Polynomially-Improved Approximation Factors for the $2 \\rightarrow q$ Norm, and Applications","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18042","citing_title":"On efficient robust regression with subquadratic samples","ref_index":101,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IH3NCZHOXK5NMJAUZDJM6S7TWX","json":"https://pith.science/pith/IH3NCZHOXK5NMJAUZDJM6S7TWX.json","graph_json":"https://pith.science/api/pith-number/IH3NCZHOXK5NMJAUZDJM6S7TWX/graph.json","events_json":"https://pith.science/api/pith-number/IH3NCZHOXK5NMJAUZDJM6S7TWX/events.json","paper":"https://pith.science/paper/IH3NCZHO"},"agent_actions":{"view_html":"https://pith.science/pith/IH3NCZHOXK5NMJAUZDJM6S7TWX","download_json":"https://pith.science/pith/IH3NCZHOXK5NMJAUZDJM6S7TWX.json","view_paper":"https://pith.science/paper/IH3NCZHO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5236&json=true","fetch_graph":"https://pith.science/api/pith-number/IH3NCZHOXK5NMJAUZDJM6S7TWX/graph.json","fetch_events":"https://pith.science/api/pith-number/IH3NCZHOXK5NMJAUZDJM6S7TWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IH3NCZHOXK5NMJAUZDJM6S7TWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IH3NCZHOXK5NMJAUZDJM6S7TWX/action/storage_attestation","attest_author":"https://pith.science/pith/IH3NCZHOXK5NMJAUZDJM6S7TWX/action/author_attestation","sign_citation":"https://pith.science/pith/IH3NCZHOXK5NMJAUZDJM6S7TWX/action/citation_signature","submit_replication":"https://pith.science/pith/IH3NCZHOXK5NMJAUZDJM6S7TWX/action/replication_record"}},"created_at":"2026-05-18T02:51:00.604907+00:00","updated_at":"2026-05-18T02:51:00.604907+00:00"}