{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DL7HEUP2MAA3Y64IWTZIVQUAGU","short_pith_number":"pith:DL7HEUP2","schema_version":"1.0","canonical_sha256":"1afe7251fa6001bc7b88b4f28ac2803533add6afc0fe5c4b7da0bcf90ca22bfc","source":{"kind":"arxiv","id":"2010.11209","version":2},"attestation_state":"computed","paper":{"title":"MAXCUT QAOA performance guarantees for p >1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jonathan Wurtz, Peter J. Love","submitted_at":"2020-10-21T18:00:12Z","abstract_excerpt":"We obtain worst case performance guarantees for $p=2$ and $3$ QAOA for MAXCUT on uniform 3-regular graphs. Previous work by Farhi et al obtained a lower bound on the approximation ratio of $0.692$ for $p=1$. We find a lower bound of $0.7559$ for $p=2$, where worst case graphs are those with no cycles $\\leq 5$. This bound holds for any 3 regular graph evaluated at particular fixed parameters. We conjecture a hierarchy for all $p$, where worst case graphs have with no cycles $\\leq 2p+1$. Under this conjecture, the approximation ratio is at least $0.7924$ for all 3 regular graphs and $p=3$. In ad"},"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":"2010.11209","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-10-21T18:00:12Z","cross_cats_sorted":[],"title_canon_sha256":"80085917064004ce1da0f0a0e7d165ae3821413df596386ef7070cead70bd0cb","abstract_canon_sha256":"42c997fa227a701f8c11ce4caf1724215638dbb82953805ef50f7e512f4d2dc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:37:30.598400Z","signature_b64":"7vnK3df2Zg8bpGy4ARoV+ULmFZi67kv1UrEgwVBCxk+9N1gD/2zXCCVVuQLQPfX/LOtx39r6V7o9GvKmzAiCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1afe7251fa6001bc7b88b4f28ac2803533add6afc0fe5c4b7da0bcf90ca22bfc","last_reissued_at":"2026-07-05T02:37:30.597898Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:37:30.597898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MAXCUT QAOA performance guarantees for p >1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jonathan Wurtz, Peter J. Love","submitted_at":"2020-10-21T18:00:12Z","abstract_excerpt":"We obtain worst case performance guarantees for $p=2$ and $3$ QAOA for MAXCUT on uniform 3-regular graphs. Previous work by Farhi et al obtained a lower bound on the approximation ratio of $0.692$ for $p=1$. We find a lower bound of $0.7559$ for $p=2$, where worst case graphs are those with no cycles $\\leq 5$. This bound holds for any 3 regular graph evaluated at particular fixed parameters. We conjecture a hierarchy for all $p$, where worst case graphs have with no cycles $\\leq 2p+1$. Under this conjecture, the approximation ratio is at least $0.7924$ for all 3 regular graphs and $p=3$. In ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.11209","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.11209/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":"2010.11209","created_at":"2026-07-05T02:37:30.597966+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.11209v2","created_at":"2026-07-05T02:37:30.597966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.11209","created_at":"2026-07-05T02:37:30.597966+00:00"},{"alias_kind":"pith_short_12","alias_value":"DL7HEUP2MAA3","created_at":"2026-07-05T02:37:30.597966+00:00"},{"alias_kind":"pith_short_16","alias_value":"DL7HEUP2MAA3Y64I","created_at":"2026-07-05T02:37:30.597966+00:00"},{"alias_kind":"pith_short_8","alias_value":"DL7HEUP2","created_at":"2026-07-05T02:37:30.597966+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"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":15,"is_internal_anchor":true},{"citing_arxiv_id":"2509.13528","citing_title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DL7HEUP2MAA3Y64IWTZIVQUAGU","json":"https://pith.science/pith/DL7HEUP2MAA3Y64IWTZIVQUAGU.json","graph_json":"https://pith.science/api/pith-number/DL7HEUP2MAA3Y64IWTZIVQUAGU/graph.json","events_json":"https://pith.science/api/pith-number/DL7HEUP2MAA3Y64IWTZIVQUAGU/events.json","paper":"https://pith.science/paper/DL7HEUP2"},"agent_actions":{"view_html":"https://pith.science/pith/DL7HEUP2MAA3Y64IWTZIVQUAGU","download_json":"https://pith.science/pith/DL7HEUP2MAA3Y64IWTZIVQUAGU.json","view_paper":"https://pith.science/paper/DL7HEUP2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.11209&json=true","fetch_graph":"https://pith.science/api/pith-number/DL7HEUP2MAA3Y64IWTZIVQUAGU/graph.json","fetch_events":"https://pith.science/api/pith-number/DL7HEUP2MAA3Y64IWTZIVQUAGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DL7HEUP2MAA3Y64IWTZIVQUAGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DL7HEUP2MAA3Y64IWTZIVQUAGU/action/storage_attestation","attest_author":"https://pith.science/pith/DL7HEUP2MAA3Y64IWTZIVQUAGU/action/author_attestation","sign_citation":"https://pith.science/pith/DL7HEUP2MAA3Y64IWTZIVQUAGU/action/citation_signature","submit_replication":"https://pith.science/pith/DL7HEUP2MAA3Y64IWTZIVQUAGU/action/replication_record"}},"created_at":"2026-07-05T02:37:30.597966+00:00","updated_at":"2026-07-05T02:37:30.597966+00:00"}