{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:KSVSPCVVARZWUUTBN4EH2O6VNY","short_pith_number":"pith:KSVSPCVV","canonical_record":{"source":{"id":"2110.14206","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-27T06:35:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"672d8c4fb2c96420e99c42946114c9082e096fe5d1649bacfac898e2dc92515a","abstract_canon_sha256":"591ec46b3177031b21927230cd39c8b4ec2eb36afa9c9d074aeea328a693ee86"},"schema_version":"1.0"},"canonical_sha256":"54ab278ab504736a52616f087d3bd56e3cf5b2eb270bae8ab9f7093df63a0a17","source":{"kind":"arxiv","id":"2110.14206","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.14206","created_at":"2026-07-05T04:38:11Z"},{"alias_kind":"arxiv_version","alias_value":"2110.14206v3","created_at":"2026-07-05T04:38:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.14206","created_at":"2026-07-05T04:38:11Z"},{"alias_kind":"pith_short_12","alias_value":"KSVSPCVVARZW","created_at":"2026-07-05T04:38:11Z"},{"alias_kind":"pith_short_16","alias_value":"KSVSPCVVARZWUUTB","created_at":"2026-07-05T04:38:11Z"},{"alias_kind":"pith_short_8","alias_value":"KSVSPCVV","created_at":"2026-07-05T04:38:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:KSVSPCVVARZWUUTBN4EH2O6VNY","target":"record","payload":{"canonical_record":{"source":{"id":"2110.14206","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-27T06:35:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"672d8c4fb2c96420e99c42946114c9082e096fe5d1649bacfac898e2dc92515a","abstract_canon_sha256":"591ec46b3177031b21927230cd39c8b4ec2eb36afa9c9d074aeea328a693ee86"},"schema_version":"1.0"},"canonical_sha256":"54ab278ab504736a52616f087d3bd56e3cf5b2eb270bae8ab9f7093df63a0a17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:38:11.812132Z","signature_b64":"3XRzV4CKoHOJE1pLxQrtbE8KeZYsBzP20gZi8wTmI4Ph7TvXkLSmJ2XgMLZlwRQLUhwC2K7hf4h4SAh3wMsBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54ab278ab504736a52616f087d3bd56e3cf5b2eb270bae8ab9f7093df63a0a17","last_reissued_at":"2026-07-05T04:38:11.811627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:38:11.811627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.14206","source_version":3,"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-05T04:38:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qGBcrdDhR3ITsxpv/XQnS19jwXnmlb8ATEbNyee2wK/KpBUElrNUIVZAHIHl8L/XTPxFGbwZwnFbBm61xU9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:16:49.673638Z"},"content_sha256":"790a6e19d3b1a5b3eb19df0e9a00f8fdfdcd59bed34ded6c3eab50f25041816b","schema_version":"1.0","event_id":"sha256:790a6e19d3b1a5b3eb19df0e9a00f8fdfdcd59bed34ded6c3eab50f25041816b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:KSVSPCVVARZWUUTBN4EH2O6VNY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Benjamin Villalonga, Edward Farhi, Joao Basso, Kunal Marwaha, Leo Zhou","submitted_at":"2021-10-27T06:35:59Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) finds approximate solutions to combinatorial optimization problems. Its performance monotonically improves with its depth $p$. We apply the QAOA to MaxCut on large-girth $D$-regular graphs. We give an iterative formula to evaluate performance for any $D$ at any depth $p$. Looking at random $D$-regular graphs, at optimal parameters and as $D$ goes to infinity, we find that the $p=11$ QAOA beats all classical algorithms (known to the authors) that are free of unproven conjectures. While the iterative formula for these $D$-regular graphs is de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.14206","kind":"arxiv","version":3},"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/2110.14206/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-05T04:38:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZJ/wueTi8lK3YvbvNnMDB2owotJU/1ujRLEmTChKE5At2I3ihtpn+hVf+eGk76QhoW1EQeHJZYmWC27rjQ5zCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:16:49.674015Z"},"content_sha256":"06cd56c0b6d10623dbc5eef2fff47d09e6dd84bc0aacbf3c2a953167a08936df","schema_version":"1.0","event_id":"sha256:06cd56c0b6d10623dbc5eef2fff47d09e6dd84bc0aacbf3c2a953167a08936df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KSVSPCVVARZWUUTBN4EH2O6VNY/bundle.json","state_url":"https://pith.science/pith/KSVSPCVVARZWUUTBN4EH2O6VNY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KSVSPCVVARZWUUTBN4EH2O6VNY/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-07-07T11:16:49Z","links":{"resolver":"https://pith.science/pith/KSVSPCVVARZWUUTBN4EH2O6VNY","bundle":"https://pith.science/pith/KSVSPCVVARZWUUTBN4EH2O6VNY/bundle.json","state":"https://pith.science/pith/KSVSPCVVARZWUUTBN4EH2O6VNY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KSVSPCVVARZWUUTBN4EH2O6VNY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:KSVSPCVVARZWUUTBN4EH2O6VNY","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":"591ec46b3177031b21927230cd39c8b4ec2eb36afa9c9d074aeea328a693ee86","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-27T06:35:59Z","title_canon_sha256":"672d8c4fb2c96420e99c42946114c9082e096fe5d1649bacfac898e2dc92515a"},"schema_version":"1.0","source":{"id":"2110.14206","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.14206","created_at":"2026-07-05T04:38:11Z"},{"alias_kind":"arxiv_version","alias_value":"2110.14206v3","created_at":"2026-07-05T04:38:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.14206","created_at":"2026-07-05T04:38:11Z"},{"alias_kind":"pith_short_12","alias_value":"KSVSPCVVARZW","created_at":"2026-07-05T04:38:11Z"},{"alias_kind":"pith_short_16","alias_value":"KSVSPCVVARZWUUTB","created_at":"2026-07-05T04:38:11Z"},{"alias_kind":"pith_short_8","alias_value":"KSVSPCVV","created_at":"2026-07-05T04:38:11Z"}],"graph_snapshots":[{"event_id":"sha256:06cd56c0b6d10623dbc5eef2fff47d09e6dd84bc0aacbf3c2a953167a08936df","target":"graph","created_at":"2026-07-05T04:38:11Z","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/2110.14206/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) finds approximate solutions to combinatorial optimization problems. Its performance monotonically improves with its depth $p$. We apply the QAOA to MaxCut on large-girth $D$-regular graphs. We give an iterative formula to evaluate performance for any $D$ at any depth $p$. Looking at random $D$-regular graphs, at optimal parameters and as $D$ goes to infinity, we find that the $p=11$ QAOA beats all classical algorithms (known to the authors) that are free of unproven conjectures. While the iterative formula for these $D$-regular graphs is de","authors_text":"Benjamin Villalonga, Edward Farhi, Joao Basso, Kunal Marwaha, Leo Zhou","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-27T06:35:59Z","title":"The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.14206","kind":"arxiv","version":3},"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:790a6e19d3b1a5b3eb19df0e9a00f8fdfdcd59bed34ded6c3eab50f25041816b","target":"record","created_at":"2026-07-05T04:38:11Z","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":"591ec46b3177031b21927230cd39c8b4ec2eb36afa9c9d074aeea328a693ee86","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-27T06:35:59Z","title_canon_sha256":"672d8c4fb2c96420e99c42946114c9082e096fe5d1649bacfac898e2dc92515a"},"schema_version":"1.0","source":{"id":"2110.14206","kind":"arxiv","version":3}},"canonical_sha256":"54ab278ab504736a52616f087d3bd56e3cf5b2eb270bae8ab9f7093df63a0a17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54ab278ab504736a52616f087d3bd56e3cf5b2eb270bae8ab9f7093df63a0a17","first_computed_at":"2026-07-05T04:38:11.811627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:38:11.811627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3XRzV4CKoHOJE1pLxQrtbE8KeZYsBzP20gZi8wTmI4Ph7TvXkLSmJ2XgMLZlwRQLUhwC2K7hf4h4SAh3wMsBAg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:38:11.812132Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.14206","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:790a6e19d3b1a5b3eb19df0e9a00f8fdfdcd59bed34ded6c3eab50f25041816b","sha256:06cd56c0b6d10623dbc5eef2fff47d09e6dd84bc0aacbf3c2a953167a08936df"],"state_sha256":"4e064d0668d050961cfb6f0ca5edf5ffc9d9682c12d7b6d28bd7fe4ee32bf33a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TN5bNeNoxDX9v47rWb7RyAI7cET9KuEMP884B3TVAR6A8U8c7fSmvimD+KponYrUq1BYQgie/os0fXwOjklQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:16:49.675985Z","bundle_sha256":"de55911fbbf289d1606dcea32ea6306a6396efb93c49bf3e47e45f868a1066a5"}}