{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:RQIERL3TYE2UPUXR24MMXFIEHW","short_pith_number":"pith:RQIERL3T","canonical_record":{"source":{"id":"2204.10306","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-04-21T17:40:39Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","cs.DS","math-ph","math.MP"],"title_canon_sha256":"a62beda3c8e11dffdae449d676492be4efdff5479afd60e4e1ca93c375e6f6f0","abstract_canon_sha256":"f8b831ec6eb755d2f53cdfb82c3f5afad6cb4e8fe4e0cc8ce5e9a4fbb726148f"},"schema_version":"1.0"},"canonical_sha256":"8c1048af73c13547d2f1d718cb95043d8f8465360c77b4a4ff0257bc72c6acb9","source":{"kind":"arxiv","id":"2204.10306","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.10306","created_at":"2026-07-05T06:31:58Z"},{"alias_kind":"arxiv_version","alias_value":"2204.10306v2","created_at":"2026-07-05T06:31:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.10306","created_at":"2026-07-05T06:31:58Z"},{"alias_kind":"pith_short_12","alias_value":"RQIERL3TYE2U","created_at":"2026-07-05T06:31:58Z"},{"alias_kind":"pith_short_16","alias_value":"RQIERL3TYE2UPUXR","created_at":"2026-07-05T06:31:58Z"},{"alias_kind":"pith_short_8","alias_value":"RQIERL3T","created_at":"2026-07-05T06:31:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:RQIERL3TYE2UPUXR24MMXFIEHW","target":"record","payload":{"canonical_record":{"source":{"id":"2204.10306","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-04-21T17:40:39Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","cs.DS","math-ph","math.MP"],"title_canon_sha256":"a62beda3c8e11dffdae449d676492be4efdff5479afd60e4e1ca93c375e6f6f0","abstract_canon_sha256":"f8b831ec6eb755d2f53cdfb82c3f5afad6cb4e8fe4e0cc8ce5e9a4fbb726148f"},"schema_version":"1.0"},"canonical_sha256":"8c1048af73c13547d2f1d718cb95043d8f8465360c77b4a4ff0257bc72c6acb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:58.966726Z","signature_b64":"U7cRff4Y/FKN5rLNH4a/ZaYVJudPM4m4KHadyQnSqOV6FyZ5CPXal3qenTmaZ9cptzmWD4vN5EArffy3L2KZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c1048af73c13547d2f1d718cb95043d8f8465360c77b4a4ff0257bc72c6acb9","last_reissued_at":"2026-07-05T06:31:58.966285Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:58.966285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.10306","source_version":2,"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-05T06:31:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C0ZBHaIbMe6Otre24udR47/abLqYLKoHyjDhw1qL1DHq5nxb2mRxb9CJjBcKY8OlOxJ04uCPjbM8eVgWRfyeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T09:37:41.676424Z"},"content_sha256":"201ca3be4f20267237fd48f2de58e1cea8c14ac380c3a3c20924c8ba672be897","schema_version":"1.0","event_id":"sha256:201ca3be4f20267237fd48f2de58e1cea8c14ac380c3a3c20924c8ba672be897"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:RQIERL3TYE2UPUXR24MMXFIEHW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.CC","cs.DS","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"David Gamarnik, Joao Basso, Leo Zhou, Song Mei","submitted_at":"2022-04-21T17:40:39Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a general purpose quantum algorithm designed for combinatorial optimization. We analyze its expected performance and prove concentration properties at any constant level (number of layers) on ensembles of random combinatorial optimization problems in the infinite size limit. These ensembles include mixed spin models and Max-$q$-XORSAT on sparse random hypergraphs. Our analysis can be understood via a saddle-point approximation of a sum-over-paths integral. This is made rigorous by proving a generalization of the multinomial theorem, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.10306","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/2204.10306/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-05T06:31:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGXBKJjXT31S5akK6cqjqUbDGOnkocYAZu6cYiY8GJReMD9onP3xHBSPAZDSwnsX8WDJGddoNZCh7ijpz6fyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T09:37:41.676817Z"},"content_sha256":"076fe83f4258c39148d02c08503007c7791b108bce56914b5fc076a7582dc485","schema_version":"1.0","event_id":"sha256:076fe83f4258c39148d02c08503007c7791b108bce56914b5fc076a7582dc485"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQIERL3TYE2UPUXR24MMXFIEHW/bundle.json","state_url":"https://pith.science/pith/RQIERL3TYE2UPUXR24MMXFIEHW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQIERL3TYE2UPUXR24MMXFIEHW/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-14T09:37:41Z","links":{"resolver":"https://pith.science/pith/RQIERL3TYE2UPUXR24MMXFIEHW","bundle":"https://pith.science/pith/RQIERL3TYE2UPUXR24MMXFIEHW/bundle.json","state":"https://pith.science/pith/RQIERL3TYE2UPUXR24MMXFIEHW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQIERL3TYE2UPUXR24MMXFIEHW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:RQIERL3TYE2UPUXR24MMXFIEHW","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":"f8b831ec6eb755d2f53cdfb82c3f5afad6cb4e8fe4e0cc8ce5e9a4fbb726148f","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","cs.DS","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-04-21T17:40:39Z","title_canon_sha256":"a62beda3c8e11dffdae449d676492be4efdff5479afd60e4e1ca93c375e6f6f0"},"schema_version":"1.0","source":{"id":"2204.10306","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.10306","created_at":"2026-07-05T06:31:58Z"},{"alias_kind":"arxiv_version","alias_value":"2204.10306v2","created_at":"2026-07-05T06:31:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.10306","created_at":"2026-07-05T06:31:58Z"},{"alias_kind":"pith_short_12","alias_value":"RQIERL3TYE2U","created_at":"2026-07-05T06:31:58Z"},{"alias_kind":"pith_short_16","alias_value":"RQIERL3TYE2UPUXR","created_at":"2026-07-05T06:31:58Z"},{"alias_kind":"pith_short_8","alias_value":"RQIERL3T","created_at":"2026-07-05T06:31:58Z"}],"graph_snapshots":[{"event_id":"sha256:076fe83f4258c39148d02c08503007c7791b108bce56914b5fc076a7582dc485","target":"graph","created_at":"2026-07-05T06:31:58Z","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/2204.10306/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a general purpose quantum algorithm designed for combinatorial optimization. We analyze its expected performance and prove concentration properties at any constant level (number of layers) on ensembles of random combinatorial optimization problems in the infinite size limit. These ensembles include mixed spin models and Max-$q$-XORSAT on sparse random hypergraphs. Our analysis can be understood via a saddle-point approximation of a sum-over-paths integral. This is made rigorous by proving a generalization of the multinomial theorem, whic","authors_text":"David Gamarnik, Joao Basso, Leo Zhou, Song Mei","cross_cats":["cond-mat.stat-mech","cs.CC","cs.DS","math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-04-21T17:40:39Z","title":"Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.10306","kind":"arxiv","version":2},"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:201ca3be4f20267237fd48f2de58e1cea8c14ac380c3a3c20924c8ba672be897","target":"record","created_at":"2026-07-05T06:31:58Z","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":"f8b831ec6eb755d2f53cdfb82c3f5afad6cb4e8fe4e0cc8ce5e9a4fbb726148f","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","cs.DS","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-04-21T17:40:39Z","title_canon_sha256":"a62beda3c8e11dffdae449d676492be4efdff5479afd60e4e1ca93c375e6f6f0"},"schema_version":"1.0","source":{"id":"2204.10306","kind":"arxiv","version":2}},"canonical_sha256":"8c1048af73c13547d2f1d718cb95043d8f8465360c77b4a4ff0257bc72c6acb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c1048af73c13547d2f1d718cb95043d8f8465360c77b4a4ff0257bc72c6acb9","first_computed_at":"2026-07-05T06:31:58.966285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:31:58.966285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U7cRff4Y/FKN5rLNH4a/ZaYVJudPM4m4KHadyQnSqOV6FyZ5CPXal3qenTmaZ9cptzmWD4vN5EArffy3L2KZCg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:31:58.966726Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.10306","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:201ca3be4f20267237fd48f2de58e1cea8c14ac380c3a3c20924c8ba672be897","sha256:076fe83f4258c39148d02c08503007c7791b108bce56914b5fc076a7582dc485"],"state_sha256":"d827615f7003084f41db09a8ea3573cedd0d68436911e92812916143faeaaf76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9mjd1ZC7gd70CCKuaA5zfaaOo6oIfmZ/TISSVbjjRuFUVKK0BFzC/yWXSpankWuIlUrXgJhgNaDHJ+P9VKCsBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T09:37:41.679324Z","bundle_sha256":"d49ddcd91204e9b1bf5692500bdbd8e517fd46911fd676766bcf6bbc0535bcd9"}}