{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:UWVWSVKCLO4L4APEJIEK6KWSXZ","short_pith_number":"pith:UWVWSVKC","canonical_record":{"source":{"id":"2208.06909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-08-14T20:39:48Z","cross_cats_sorted":[],"title_canon_sha256":"2a94da8e21702a803e722d0c6786f4cc206cd14aecd33657040b0aa05c9c5720","abstract_canon_sha256":"6711494c4bd1384ab96e038973fb5ecd90af025d920c4d502f925489ccbb940c"},"schema_version":"1.0"},"canonical_sha256":"a5ab6955425bb8be01e44a08af2ad2be574ee87faa5ce2b9317b22e4b6696cfd","source":{"kind":"arxiv","id":"2208.06909","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.06909","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"arxiv_version","alias_value":"2208.06909v1","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.06909","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"pith_short_12","alias_value":"UWVWSVKCLO4L","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"pith_short_16","alias_value":"UWVWSVKCLO4L4APE","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"pith_short_8","alias_value":"UWVWSVKC","created_at":"2026-07-05T04:48:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:UWVWSVKCLO4L4APEJIEK6KWSXZ","target":"record","payload":{"canonical_record":{"source":{"id":"2208.06909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-08-14T20:39:48Z","cross_cats_sorted":[],"title_canon_sha256":"2a94da8e21702a803e722d0c6786f4cc206cd14aecd33657040b0aa05c9c5720","abstract_canon_sha256":"6711494c4bd1384ab96e038973fb5ecd90af025d920c4d502f925489ccbb940c"},"schema_version":"1.0"},"canonical_sha256":"a5ab6955425bb8be01e44a08af2ad2be574ee87faa5ce2b9317b22e4b6696cfd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:48:21.972031Z","signature_b64":"07oThIoAtSC+zi6hRwSORyyRH71NGSjS77lgn6hqScjlYHjtxjxe3r+QGot5gIWAGApbph+a4ivlkvGl6N1YAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5ab6955425bb8be01e44a08af2ad2be574ee87faa5ce2b9317b22e4b6696cfd","last_reissued_at":"2026-07-05T04:48:21.971477Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:48:21.971477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.06909","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-05T04:48:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cm8WeDmX83fnEJTS8HGG/MdzPfRZy9uWswHkHwP9xkOPSWvjKOzOtcka2/nAbpmlT7kB8Sk4nN0slkCKyXKfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:27:20.777016Z"},"content_sha256":"4bf36a21643f3ab206e41de4cc77f8d7c83e712366026ca0f77b3880031602a0","schema_version":"1.0","event_id":"sha256:4bf36a21643f3ab206e41de4cc77f8d7c83e712366026ca0f77b3880031602a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:UWVWSVKCLO4L4APEJIEK6KWSXZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving boolean satisfiability problems with the quantum approximate optimization algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro, Sami Boulebnane","submitted_at":"2022-08-14T20:39:48Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is one of the most prominent proposed applications for near-term quantum computing. Here we study the ability of QAOA to solve hard constraint satisfaction problems, as opposed to optimization problems. We focus on the fundamental boolean satisfiability problem, in the form of random $k$-SAT. We develop analytic bounds on the average success probability of QAOA over random boolean formulae at the satisfiability threshold, as the number of variables $n$ goes to infinity. The bounds hold for fixed parameters and when $k$ is a power of 2. We c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.06909","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/2208.06909/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:48:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nfPZp79pDwqxAvOgl3q9AT4ItC9zcF7QQBvcHOmviB4bhPAjAsDPuHQt7Yz+M1pS6s7rQx3ADfEJucjzqSvLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:27:20.777627Z"},"content_sha256":"0f93edc0a10b4d0e62a1ecd1d1631f2b32d3bcf2372c44c4eb30b453ca870e94","schema_version":"1.0","event_id":"sha256:0f93edc0a10b4d0e62a1ecd1d1631f2b32d3bcf2372c44c4eb30b453ca870e94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWVWSVKCLO4L4APEJIEK6KWSXZ/bundle.json","state_url":"https://pith.science/pith/UWVWSVKCLO4L4APEJIEK6KWSXZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWVWSVKCLO4L4APEJIEK6KWSXZ/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-10T09:27:20Z","links":{"resolver":"https://pith.science/pith/UWVWSVKCLO4L4APEJIEK6KWSXZ","bundle":"https://pith.science/pith/UWVWSVKCLO4L4APEJIEK6KWSXZ/bundle.json","state":"https://pith.science/pith/UWVWSVKCLO4L4APEJIEK6KWSXZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWVWSVKCLO4L4APEJIEK6KWSXZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:UWVWSVKCLO4L4APEJIEK6KWSXZ","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":"6711494c4bd1384ab96e038973fb5ecd90af025d920c4d502f925489ccbb940c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-08-14T20:39:48Z","title_canon_sha256":"2a94da8e21702a803e722d0c6786f4cc206cd14aecd33657040b0aa05c9c5720"},"schema_version":"1.0","source":{"id":"2208.06909","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.06909","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"arxiv_version","alias_value":"2208.06909v1","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.06909","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"pith_short_12","alias_value":"UWVWSVKCLO4L","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"pith_short_16","alias_value":"UWVWSVKCLO4L4APE","created_at":"2026-07-05T04:48:21Z"},{"alias_kind":"pith_short_8","alias_value":"UWVWSVKC","created_at":"2026-07-05T04:48:21Z"}],"graph_snapshots":[{"event_id":"sha256:0f93edc0a10b4d0e62a1ecd1d1631f2b32d3bcf2372c44c4eb30b453ca870e94","target":"graph","created_at":"2026-07-05T04:48:21Z","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/2208.06909/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 one of the most prominent proposed applications for near-term quantum computing. Here we study the ability of QAOA to solve hard constraint satisfaction problems, as opposed to optimization problems. We focus on the fundamental boolean satisfiability problem, in the form of random $k$-SAT. We develop analytic bounds on the average success probability of QAOA over random boolean formulae at the satisfiability threshold, as the number of variables $n$ goes to infinity. The bounds hold for fixed parameters and when $k$ is a power of 2. We c","authors_text":"Ashley Montanaro, Sami Boulebnane","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-08-14T20:39:48Z","title":"Solving boolean satisfiability problems with the quantum approximate optimization algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.06909","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:4bf36a21643f3ab206e41de4cc77f8d7c83e712366026ca0f77b3880031602a0","target":"record","created_at":"2026-07-05T04:48:21Z","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":"6711494c4bd1384ab96e038973fb5ecd90af025d920c4d502f925489ccbb940c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-08-14T20:39:48Z","title_canon_sha256":"2a94da8e21702a803e722d0c6786f4cc206cd14aecd33657040b0aa05c9c5720"},"schema_version":"1.0","source":{"id":"2208.06909","kind":"arxiv","version":1}},"canonical_sha256":"a5ab6955425bb8be01e44a08af2ad2be574ee87faa5ce2b9317b22e4b6696cfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5ab6955425bb8be01e44a08af2ad2be574ee87faa5ce2b9317b22e4b6696cfd","first_computed_at":"2026-07-05T04:48:21.971477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:48:21.971477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"07oThIoAtSC+zi6hRwSORyyRH71NGSjS77lgn6hqScjlYHjtxjxe3r+QGot5gIWAGApbph+a4ivlkvGl6N1YAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:48:21.972031Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.06909","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4bf36a21643f3ab206e41de4cc77f8d7c83e712366026ca0f77b3880031602a0","sha256:0f93edc0a10b4d0e62a1ecd1d1631f2b32d3bcf2372c44c4eb30b453ca870e94"],"state_sha256":"d19774ff1e2cbf5eab3faddf685b911ee1d9983793b7a9aa9a53ff207d3d373e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hxcTSekqtiOiHMymzdMB8BZdA+WYub9z+t9faqnFSYZU8V1iMPZqLL5o0Puxa09LdmTfcBeCJI6EpzRiavWVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T09:27:20.782583Z","bundle_sha256":"10a49676baa3b362dd6d12a131362c055ad4e38d6977cb164196ef022a801d89"}}