{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Y37Y4IRINWOGDDXFCECMI6JTZK","short_pith_number":"pith:Y37Y4IRI","schema_version":"1.0","canonical_sha256":"c6ff8e22286d9c618ee51104c47933cab7e335fbf4799a2f94dcf3aef944f6ff","source":{"kind":"arxiv","id":"1505.03424","version":2},"attestation_state":"computed","paper":{"title":"Beating the random assignment on constraint satisfaction problems of bounded degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ankur Moitra, Aravindan Vijayaraghavan, Boaz Barak, David Steurer, David Witmer, John Wright, Luca Trevisan, Oded Regev, Prasad Raghavendra, Ryan O'Donnell","submitted_at":"2015-05-13T15:27:16Z","abstract_excerpt":"We show that for any odd $k$ and any instance of the Max-kXOR constraint satisfaction problem, there is an efficient algorithm that finds an assignment satisfying at least a $\\frac{1}{2} + \\Omega(1/\\sqrt{D})$ fraction of constraints, where $D$ is a bound on the number of constraints that each variable occurs in. This improves both qualitatively and quantitatively on the recent work of Farhi, Goldstone, and Gutmann (2014), which gave a \\emph{quantum} algorithm to find an assignment satisfying a $\\frac{1}{2} + \\Omega(D^{-3/4})$ fraction of the equations.\n  For arbitrary constraint satisfaction p"},"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":"1505.03424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-13T15:27:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"be8085a05e078758924bfccec80d650512c04ce4898eaa22f15a50ddee411ae7","abstract_canon_sha256":"78a9e2201010e1256072ea807e124bd18c3b78e5124b40b4b3f6155cf7f4bb99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:30.134470Z","signature_b64":"knc0t+QaMOxuGuJwpuDUdnHIwoxOt/lwzQfQKDYoH30Wftyb5p4qTl+lMStAC8unHiOAHZlNpouYH8G6rQNLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6ff8e22286d9c618ee51104c47933cab7e335fbf4799a2f94dcf3aef944f6ff","last_reissued_at":"2026-05-18T01:35:30.133810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:30.133810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beating the random assignment on constraint satisfaction problems of bounded degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ankur Moitra, Aravindan Vijayaraghavan, Boaz Barak, David Steurer, David Witmer, John Wright, Luca Trevisan, Oded Regev, Prasad Raghavendra, Ryan O'Donnell","submitted_at":"2015-05-13T15:27:16Z","abstract_excerpt":"We show that for any odd $k$ and any instance of the Max-kXOR constraint satisfaction problem, there is an efficient algorithm that finds an assignment satisfying at least a $\\frac{1}{2} + \\Omega(1/\\sqrt{D})$ fraction of constraints, where $D$ is a bound on the number of constraints that each variable occurs in. This improves both qualitatively and quantitatively on the recent work of Farhi, Goldstone, and Gutmann (2014), which gave a \\emph{quantum} algorithm to find an assignment satisfying a $\\frac{1}{2} + \\Omega(D^{-3/4})$ fraction of the equations.\n  For arbitrary constraint satisfaction p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03424","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":"1505.03424","created_at":"2026-05-18T01:35:30.133942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.03424v2","created_at":"2026-05-18T01:35:30.133942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03424","created_at":"2026-05-18T01:35:30.133942+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y37Y4IRINWOG","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y37Y4IRINWOGDDXF","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y37Y4IRI","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.23138","citing_title":"Classical State Preparation for Variational Quantum Algorithms via Reinforcement Learning","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y37Y4IRINWOGDDXFCECMI6JTZK","json":"https://pith.science/pith/Y37Y4IRINWOGDDXFCECMI6JTZK.json","graph_json":"https://pith.science/api/pith-number/Y37Y4IRINWOGDDXFCECMI6JTZK/graph.json","events_json":"https://pith.science/api/pith-number/Y37Y4IRINWOGDDXFCECMI6JTZK/events.json","paper":"https://pith.science/paper/Y37Y4IRI"},"agent_actions":{"view_html":"https://pith.science/pith/Y37Y4IRINWOGDDXFCECMI6JTZK","download_json":"https://pith.science/pith/Y37Y4IRINWOGDDXFCECMI6JTZK.json","view_paper":"https://pith.science/paper/Y37Y4IRI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.03424&json=true","fetch_graph":"https://pith.science/api/pith-number/Y37Y4IRINWOGDDXFCECMI6JTZK/graph.json","fetch_events":"https://pith.science/api/pith-number/Y37Y4IRINWOGDDXFCECMI6JTZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y37Y4IRINWOGDDXFCECMI6JTZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y37Y4IRINWOGDDXFCECMI6JTZK/action/storage_attestation","attest_author":"https://pith.science/pith/Y37Y4IRINWOGDDXFCECMI6JTZK/action/author_attestation","sign_citation":"https://pith.science/pith/Y37Y4IRINWOGDDXFCECMI6JTZK/action/citation_signature","submit_replication":"https://pith.science/pith/Y37Y4IRINWOGDDXFCECMI6JTZK/action/replication_record"}},"created_at":"2026-05-18T01:35:30.133942+00:00","updated_at":"2026-05-18T01:35:30.133942+00:00"}