{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:P7B72FTQKR7AYIMCY6QM7VS2JZ","short_pith_number":"pith:P7B72FTQ","schema_version":"1.0","canonical_sha256":"7fc3fd1670547e0c2182c7a0cfd65a4e73ff55cd2c56c87354a5f58557bd3b59","source":{"kind":"arxiv","id":"2106.05900","version":1},"attestation_state":"computed","paper":{"title":"Classical algorithms and quantum limitations for maximum cut on high-girth graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Boaz Barak, Kunal Marwaha","submitted_at":"2021-06-10T16:28:23Z","abstract_excerpt":"We study the performance of local quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) for the maximum cut problem, and their relationship to that of classical algorithms.\n  (1) We prove that every (quantum or classical) one-local algorithm achieves on $D$-regular graphs of girth $> 5$ a maximum cut of at most $1/2 + C/\\sqrt{D}$ for $C=1/\\sqrt{2} \\approx 0.7071$. This is the first such result showing that one-local algorithms achieve a value bounded away from the true optimum for random graphs, which is $1/2 + P_*/\\sqrt{D} + o(1/\\sqrt{D})$ for $P_* \\approx 0.7632$. "},"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":"2106.05900","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-10T16:28:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"88bf8781b65e7b3627c5d4d0c95b97bf7b1cfec5a03866c166338caa6f481da1","abstract_canon_sha256":"ecd4eba2fd294f03c87e9ddd72490e8da910489c1b5cebccb348821fddb7b043"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:15:09.279088Z","signature_b64":"VSnI7WQNRilg4KoZ/zijIfZ2s9BhpdAKDdJ/ws9y3lgMM54tuFfVolMFpHaTNAjo2DMB/AYI2ycFv+ZWyDC8Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fc3fd1670547e0c2182c7a0cfd65a4e73ff55cd2c56c87354a5f58557bd3b59","last_reissued_at":"2026-07-05T04:15:09.278518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:15:09.278518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical algorithms and quantum limitations for maximum cut on high-girth graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Boaz Barak, Kunal Marwaha","submitted_at":"2021-06-10T16:28:23Z","abstract_excerpt":"We study the performance of local quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) for the maximum cut problem, and their relationship to that of classical algorithms.\n  (1) We prove that every (quantum or classical) one-local algorithm achieves on $D$-regular graphs of girth $> 5$ a maximum cut of at most $1/2 + C/\\sqrt{D}$ for $C=1/\\sqrt{2} \\approx 0.7071$. This is the first such result showing that one-local algorithms achieve a value bounded away from the true optimum for random graphs, which is $1/2 + P_*/\\sqrt{D} + o(1/\\sqrt{D})$ for $P_* \\approx 0.7632$. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.05900","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.05900/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.05900","created_at":"2026-07-05T04:15:09.278578+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.05900v1","created_at":"2026-07-05T04:15:09.278578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.05900","created_at":"2026-07-05T04:15:09.278578+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7B72FTQKR7A","created_at":"2026-07-05T04:15:09.278578+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7B72FTQKR7AYIMC","created_at":"2026-07-05T04:15:09.278578+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7B72FTQ","created_at":"2026-07-05T04:15:09.278578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08160","citing_title":"Weak Poincar\\'e Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model","ref_index":62,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P7B72FTQKR7AYIMCY6QM7VS2JZ","json":"https://pith.science/pith/P7B72FTQKR7AYIMCY6QM7VS2JZ.json","graph_json":"https://pith.science/api/pith-number/P7B72FTQKR7AYIMCY6QM7VS2JZ/graph.json","events_json":"https://pith.science/api/pith-number/P7B72FTQKR7AYIMCY6QM7VS2JZ/events.json","paper":"https://pith.science/paper/P7B72FTQ"},"agent_actions":{"view_html":"https://pith.science/pith/P7B72FTQKR7AYIMCY6QM7VS2JZ","download_json":"https://pith.science/pith/P7B72FTQKR7AYIMCY6QM7VS2JZ.json","view_paper":"https://pith.science/paper/P7B72FTQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.05900&json=true","fetch_graph":"https://pith.science/api/pith-number/P7B72FTQKR7AYIMCY6QM7VS2JZ/graph.json","fetch_events":"https://pith.science/api/pith-number/P7B72FTQKR7AYIMCY6QM7VS2JZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7B72FTQKR7AYIMCY6QM7VS2JZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7B72FTQKR7AYIMCY6QM7VS2JZ/action/storage_attestation","attest_author":"https://pith.science/pith/P7B72FTQKR7AYIMCY6QM7VS2JZ/action/author_attestation","sign_citation":"https://pith.science/pith/P7B72FTQKR7AYIMCY6QM7VS2JZ/action/citation_signature","submit_replication":"https://pith.science/pith/P7B72FTQKR7AYIMCY6QM7VS2JZ/action/replication_record"}},"created_at":"2026-07-05T04:15:09.278578+00:00","updated_at":"2026-07-05T04:15:09.278578+00:00"}