{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:JXVIRWV4LGORJM7YTZQI6L3RAN","short_pith_number":"pith:JXVIRWV4","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"},"canonical_sha256":"4dea88dabc599d14b3f89e608f2f7103562092c42bace446302bc663b5ff69d5","source":{"kind":"arxiv","id":"2005.08747","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.08747","created_at":"2026-07-05T01:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"2005.08747v1","created_at":"2026-07-05T01:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.08747","created_at":"2026-07-05T01:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"JXVIRWV4LGOR","created_at":"2026-07-05T01:03:35Z"},{"alias_kind":"pith_short_16","alias_value":"JXVIRWV4LGORJM7Y","created_at":"2026-07-05T01:03:35Z"},{"alias_kind":"pith_short_8","alias_value":"JXVIRWV4","created_at":"2026-07-05T01:03:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:JXVIRWV4LGORJM7YTZQI6L3RAN","target":"record","payload":{"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"},"canonical_sha256":"4dea88dabc599d14b3f89e608f2f7103562092c42bace446302bc663b5ff69d5","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"},"source_kind":"arxiv","source_id":"2005.08747","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:03:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WTgK3kmW5hltX8bW2FOOfctXxDHb9N1mW88SeD/Owabwicuvs2FuAEwRlKx+0ICiNJD2vUMVOr6VhZyG6aM8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:39:55.950131Z"},"content_sha256":"876788422e86400f00d7f999c54fb8f65bc4d2d24c2924f438adf92c7e034f69","schema_version":"1.0","event_id":"sha256:876788422e86400f00d7f999c54fb8f65bc4d2d24c2924f438adf92c7e034f69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:JXVIRWV4LGORJM7YTZQI6L3RAN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:03:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YYiOVMKMfjzMqq9bphHz1uoPVX6qA8j6Vw96u9Yq1KMSZZB35b8ORAs2LNZdMODMQDqZPrisIqixTMdASt5TDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:39:55.951026Z"},"content_sha256":"b3bbc845fa3d9e07871625182d188956bb65f0f71360944e8fd93907615d9020","schema_version":"1.0","event_id":"sha256:b3bbc845fa3d9e07871625182d188956bb65f0f71360944e8fd93907615d9020"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXVIRWV4LGORJM7YTZQI6L3RAN/bundle.json","state_url":"https://pith.science/pith/JXVIRWV4LGORJM7YTZQI6L3RAN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXVIRWV4LGORJM7YTZQI6L3RAN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-03T18:39:55Z","links":{"resolver":"https://pith.science/pith/JXVIRWV4LGORJM7YTZQI6L3RAN","bundle":"https://pith.science/pith/JXVIRWV4LGORJM7YTZQI6L3RAN/bundle.json","state":"https://pith.science/pith/JXVIRWV4LGORJM7YTZQI6L3RAN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXVIRWV4LGORJM7YTZQI6L3RAN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:JXVIRWV4LGORJM7YTZQI6L3RAN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ef27a2c4fc912ef2981838fae5277ff4a23b91a9951785c5503f01855a58c748","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-18T14:23:09Z","title_canon_sha256":"6123a3248959daeb8741b3e5d5d7aa42718e0b70270f556de92d04bad5af17e0"},"schema_version":"1.0","source":{"id":"2005.08747","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.08747","created_at":"2026-07-05T01:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"2005.08747v1","created_at":"2026-07-05T01:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.08747","created_at":"2026-07-05T01:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"JXVIRWV4LGOR","created_at":"2026-07-05T01:03:35Z"},{"alias_kind":"pith_short_16","alias_value":"JXVIRWV4LGORJM7Y","created_at":"2026-07-05T01:03:35Z"},{"alias_kind":"pith_short_8","alias_value":"JXVIRWV4","created_at":"2026-07-05T01:03:35Z"}],"graph_snapshots":[{"event_id":"sha256:b3bbc845fa3d9e07871625182d188956bb65f0f71360944e8fd93907615d9020","target":"graph","created_at":"2026-07-05T01:03:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.08747/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"David Gamarnik, Edward Farhi, Sam Gutmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.08747","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:876788422e86400f00d7f999c54fb8f65bc4d2d24c2924f438adf92c7e034f69","target":"record","created_at":"2026-07-05T01:03:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ef27a2c4fc912ef2981838fae5277ff4a23b91a9951785c5503f01855a58c748","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-18T14:23:09Z","title_canon_sha256":"6123a3248959daeb8741b3e5d5d7aa42718e0b70270f556de92d04bad5af17e0"},"schema_version":"1.0","source":{"id":"2005.08747","kind":"arxiv","version":1}},"canonical_sha256":"4dea88dabc599d14b3f89e608f2f7103562092c42bace446302bc663b5ff69d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4dea88dabc599d14b3f89e608f2f7103562092c42bace446302bc663b5ff69d5","first_computed_at":"2026-07-05T01:03:35.161219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:03:35.161219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4oIt0q8BpK2Xk41HssinpqGYxPtIT/u5u/3H9ZjdS1aEzUgKnXNYATgfIkQZGltQy6vXMEt0af96JzV9wIPrCw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:03:35.161703Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.08747","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:876788422e86400f00d7f999c54fb8f65bc4d2d24c2924f438adf92c7e034f69","sha256:b3bbc845fa3d9e07871625182d188956bb65f0f71360944e8fd93907615d9020"],"state_sha256":"d4d05887e0fcde91ad4290f86bb95ee6fe5b812f8f97da94d456edcd881b28ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2iNcpcG2N7Rz93Q8cK94aV/7d2g9PEYpjvIGqtOaHMn7bborHz24yz5PkNIprYD07vj7/uOrjLSVVRXKO8K1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:39:55.957076Z","bundle_sha256":"d6b693289b05ba8c93d86b774a7095307192c3f1d3f5232ff7fbca38298c9043"}}