{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BL2XN5D3HZQO6V6WEEIM24C7MU","short_pith_number":"pith:BL2XN5D3","canonical_record":{"source":{"id":"2308.15442","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-29T17:10:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5c1845b631cc9fbd2f0e412e76a818f138e25d2a91b7e395d7a83fc22cc51bcc","abstract_canon_sha256":"07444f080b3efd4e07056c4357bfba940fc5c9bffafdef420fa4030cf0b4c107"},"schema_version":"1.0"},"canonical_sha256":"0af576f47b3e60ef57d62110cd705f65081c8a022fdc6bf927b5ae1daf517ac6","source":{"kind":"arxiv","id":"2308.15442","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.15442","created_at":"2026-07-05T11:19:47Z"},{"alias_kind":"arxiv_version","alias_value":"2308.15442v4","created_at":"2026-07-05T11:19:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15442","created_at":"2026-07-05T11:19:47Z"},{"alias_kind":"pith_short_12","alias_value":"BL2XN5D3HZQO","created_at":"2026-07-05T11:19:47Z"},{"alias_kind":"pith_short_16","alias_value":"BL2XN5D3HZQO6V6W","created_at":"2026-07-05T11:19:47Z"},{"alias_kind":"pith_short_8","alias_value":"BL2XN5D3","created_at":"2026-07-05T11:19:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BL2XN5D3HZQO6V6WEEIM24C7MU","target":"record","payload":{"canonical_record":{"source":{"id":"2308.15442","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-29T17:10:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5c1845b631cc9fbd2f0e412e76a818f138e25d2a91b7e395d7a83fc22cc51bcc","abstract_canon_sha256":"07444f080b3efd4e07056c4357bfba940fc5c9bffafdef420fa4030cf0b4c107"},"schema_version":"1.0"},"canonical_sha256":"0af576f47b3e60ef57d62110cd705f65081c8a022fdc6bf927b5ae1daf517ac6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:47.990377Z","signature_b64":"W+xS/6tXzMVXhSXeQsPM3FKxHvmSUCDDj4yGxxH0+cySv1Fx7pBxJ490yd3mEQxMrryQD1T2mHJQT26pQ4bnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0af576f47b3e60ef57d62110cd705f65081c8a022fdc6bf927b5ae1daf517ac6","last_reissued_at":"2026-07-05T11:19:47.989920Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:47.989920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.15442","source_version":4,"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-05T11:19:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ah47EO8idGbhMD6Vq/m4rsXsqtrwN0/gc75oMiWghRP4mnsFaHQ1xDXZnXNaQ1kIqSVUpkdt1cBInRasib0vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:59:01.557786Z"},"content_sha256":"a846365c71ad64f6ea67d45941e0b774efc04a2b6988d85232a857ef43680fc9","schema_version":"1.0","event_id":"sha256:a846365c71ad64f6ea67d45941e0b774efc04a2b6988d85232a857ef43680fc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BL2XN5D3HZQO6V6WEEIM24C7MU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Andreas B\\\"artschi, John Golden, Luis Pedro Garc\\'ia-Pintos, Naphan Benchasattabuse, Nathan Lemons, Stephan Eidenbenz","submitted_at":"2023-08-29T17:10:20Z","abstract_excerpt":"The quantum approximate optimization algorithm, also known in its generalization as the quantum alternating operator ansatz, (QAOA) is a heuristic hybrid quantum-classical algorithm for finding high-quality approximate solutions to combinatorial optimization problems, such as maximum satisfiability. While the QAOA is well studied, theoretical results as to its runtime or approximation ratio guarantees are still relatively sparse. We provide some of the first lower bounds for the number of rounds (the dominant component of QAOA runtimes) required for the QAOA. For our main result, we (i) levera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15442","kind":"arxiv","version":4},"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/2308.15442/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-05T11:19:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GL8eAQPVzp+TdAg2NgMMXhRponqPdEj3tXeBjwKiK1P3zC0rnFLgxsUdNPwXEpB6DcJGalJ1+hYsMtZck5QlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:59:01.558684Z"},"content_sha256":"31bfdc33b090dcae201ebb6bb9889c4c60d7d47dac101bc74c901d854503fd22","schema_version":"1.0","event_id":"sha256:31bfdc33b090dcae201ebb6bb9889c4c60d7d47dac101bc74c901d854503fd22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BL2XN5D3HZQO6V6WEEIM24C7MU/bundle.json","state_url":"https://pith.science/pith/BL2XN5D3HZQO6V6WEEIM24C7MU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BL2XN5D3HZQO6V6WEEIM24C7MU/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-14T09:59:01Z","links":{"resolver":"https://pith.science/pith/BL2XN5D3HZQO6V6WEEIM24C7MU","bundle":"https://pith.science/pith/BL2XN5D3HZQO6V6WEEIM24C7MU/bundle.json","state":"https://pith.science/pith/BL2XN5D3HZQO6V6WEEIM24C7MU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BL2XN5D3HZQO6V6WEEIM24C7MU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BL2XN5D3HZQO6V6WEEIM24C7MU","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":"07444f080b3efd4e07056c4357bfba940fc5c9bffafdef420fa4030cf0b4c107","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-29T17:10:20Z","title_canon_sha256":"5c1845b631cc9fbd2f0e412e76a818f138e25d2a91b7e395d7a83fc22cc51bcc"},"schema_version":"1.0","source":{"id":"2308.15442","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.15442","created_at":"2026-07-05T11:19:47Z"},{"alias_kind":"arxiv_version","alias_value":"2308.15442v4","created_at":"2026-07-05T11:19:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15442","created_at":"2026-07-05T11:19:47Z"},{"alias_kind":"pith_short_12","alias_value":"BL2XN5D3HZQO","created_at":"2026-07-05T11:19:47Z"},{"alias_kind":"pith_short_16","alias_value":"BL2XN5D3HZQO6V6W","created_at":"2026-07-05T11:19:47Z"},{"alias_kind":"pith_short_8","alias_value":"BL2XN5D3","created_at":"2026-07-05T11:19:47Z"}],"graph_snapshots":[{"event_id":"sha256:31bfdc33b090dcae201ebb6bb9889c4c60d7d47dac101bc74c901d854503fd22","target":"graph","created_at":"2026-07-05T11:19:47Z","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/2308.15442/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The quantum approximate optimization algorithm, also known in its generalization as the quantum alternating operator ansatz, (QAOA) is a heuristic hybrid quantum-classical algorithm for finding high-quality approximate solutions to combinatorial optimization problems, such as maximum satisfiability. While the QAOA is well studied, theoretical results as to its runtime or approximation ratio guarantees are still relatively sparse. We provide some of the first lower bounds for the number of rounds (the dominant component of QAOA runtimes) required for the QAOA. For our main result, we (i) levera","authors_text":"Andreas B\\\"artschi, John Golden, Luis Pedro Garc\\'ia-Pintos, Naphan Benchasattabuse, Nathan Lemons, Stephan Eidenbenz","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-29T17:10:20Z","title":"Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15442","kind":"arxiv","version":4},"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:a846365c71ad64f6ea67d45941e0b774efc04a2b6988d85232a857ef43680fc9","target":"record","created_at":"2026-07-05T11:19:47Z","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":"07444f080b3efd4e07056c4357bfba940fc5c9bffafdef420fa4030cf0b4c107","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-29T17:10:20Z","title_canon_sha256":"5c1845b631cc9fbd2f0e412e76a818f138e25d2a91b7e395d7a83fc22cc51bcc"},"schema_version":"1.0","source":{"id":"2308.15442","kind":"arxiv","version":4}},"canonical_sha256":"0af576f47b3e60ef57d62110cd705f65081c8a022fdc6bf927b5ae1daf517ac6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0af576f47b3e60ef57d62110cd705f65081c8a022fdc6bf927b5ae1daf517ac6","first_computed_at":"2026-07-05T11:19:47.989920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:47.989920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W+xS/6tXzMVXhSXeQsPM3FKxHvmSUCDDj4yGxxH0+cySv1Fx7pBxJ490yd3mEQxMrryQD1T2mHJQT26pQ4bnAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:47.990377Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.15442","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a846365c71ad64f6ea67d45941e0b774efc04a2b6988d85232a857ef43680fc9","sha256:31bfdc33b090dcae201ebb6bb9889c4c60d7d47dac101bc74c901d854503fd22"],"state_sha256":"9c677a24ef5f179cc377a57e85c89232302721b0b2ebe89d509f0b6ceab09d89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sXFF74aYnj13+8/kUrlKkuxu9KcoRbpANBwucHrAYPX+W+S95iUNo4wjw5BqAFX4hpBlT9/vLrnyAyt4d6GPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T09:59:01.649852Z","bundle_sha256":"d149a40fe71680287988957e3d60fd997db0331d71c5c4b6f9216ddad728f216"}}