{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JXVIRWV4LGORJM7YTZQI6L3RAN","short_pith_number":"pith:JXVIRWV4","schema_version":"1.0","canonical_sha256":"4dea88dabc599d14b3f89e608f2f7103562092c42bace446302bc663b5ff69d5","source":{"kind":"arxiv","id":"2005.08747","version":1},"attestation_state":"computed","paper":{"title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Gamarnik, Edward Farhi, Sam Gutmann","submitted_at":"2020-05-18T14:23:09Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm can be applied to search problems on graphs with a cost function that is a sum of terms corresponding to the edges. When conjugating an edge term, the QAOA unitary at depth p produces an operator that depends only on the subgraph consisting of edges that are at most p away from the edge in question. On random d-regular graphs, with d fixed and with p a small constant time log n, these neighborhoods are almost all trees and so the performance of the QAOA is determined only by how it acts on an edge in the middle of tree. Both bipartite random d-reg"},"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":"2005.08747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-18T14:23:09Z","cross_cats_sorted":[],"title_canon_sha256":"6123a3248959daeb8741b3e5d5d7aa42718e0b70270f556de92d04bad5af17e0","abstract_canon_sha256":"ef27a2c4fc912ef2981838fae5277ff4a23b91a9951785c5503f01855a58c748"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:03:35.161703Z","signature_b64":"4oIt0q8BpK2Xk41HssinpqGYxPtIT/u5u/3H9ZjdS1aEzUgKnXNYATgfIkQZGltQy6vXMEt0af96JzV9wIPrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dea88dabc599d14b3f89e608f2f7103562092c42bace446302bc663b5ff69d5","last_reissued_at":"2026-07-05T01:03:35.161219Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:03:35.161219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Gamarnik, Edward Farhi, Sam Gutmann","submitted_at":"2020-05-18T14:23:09Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm can be applied to search problems on graphs with a cost function that is a sum of terms corresponding to the edges. When conjugating an edge term, the QAOA unitary at depth p produces an operator that depends only on the subgraph consisting of edges that are at most p away from the edge in question. On random d-regular graphs, with d fixed and with p a small constant time log n, these neighborhoods are almost all trees and so the performance of the QAOA is determined only by how it acts on an edge in the middle of tree. Both bipartite random d-reg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.08747","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/2005.08747/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":"2005.08747","created_at":"2026-07-05T01:03:35.161275+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.08747v1","created_at":"2026-07-05T01:03:35.161275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.08747","created_at":"2026-07-05T01:03:35.161275+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXVIRWV4LGOR","created_at":"2026-07-05T01:03:35.161275+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXVIRWV4LGORJM7Y","created_at":"2026-07-05T01:03:35.161275+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXVIRWV4","created_at":"2026-07-05T01:03:35.161275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"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":25,"is_internal_anchor":true},{"citing_arxiv_id":"2412.15572","citing_title":"Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2507.10908","citing_title":"Optimisation-Free Recursive QAOA for the Binary Paint Shop Problem","ref_index":47,"is_internal_anchor":false},{"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":5,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19544","citing_title":"Demonstrating Real Advantage of Machine-Learning-Enhanced Monte Carlo for Combinatorial Optimization","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JXVIRWV4LGORJM7YTZQI6L3RAN","json":"https://pith.science/pith/JXVIRWV4LGORJM7YTZQI6L3RAN.json","graph_json":"https://pith.science/api/pith-number/JXVIRWV4LGORJM7YTZQI6L3RAN/graph.json","events_json":"https://pith.science/api/pith-number/JXVIRWV4LGORJM7YTZQI6L3RAN/events.json","paper":"https://pith.science/paper/JXVIRWV4"},"agent_actions":{"view_html":"https://pith.science/pith/JXVIRWV4LGORJM7YTZQI6L3RAN","download_json":"https://pith.science/pith/JXVIRWV4LGORJM7YTZQI6L3RAN.json","view_paper":"https://pith.science/paper/JXVIRWV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.08747&json=true","fetch_graph":"https://pith.science/api/pith-number/JXVIRWV4LGORJM7YTZQI6L3RAN/graph.json","fetch_events":"https://pith.science/api/pith-number/JXVIRWV4LGORJM7YTZQI6L3RAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXVIRWV4LGORJM7YTZQI6L3RAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXVIRWV4LGORJM7YTZQI6L3RAN/action/storage_attestation","attest_author":"https://pith.science/pith/JXVIRWV4LGORJM7YTZQI6L3RAN/action/author_attestation","sign_citation":"https://pith.science/pith/JXVIRWV4LGORJM7YTZQI6L3RAN/action/citation_signature","submit_replication":"https://pith.science/pith/JXVIRWV4LGORJM7YTZQI6L3RAN/action/replication_record"}},"created_at":"2026-07-05T01:03:35.161275+00:00","updated_at":"2026-07-05T01:03:35.161275+00:00"}