{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GGTOPSB25334OQ73KCSKIFSTMH","short_pith_number":"pith:GGTOPSB2","canonical_record":{"source":{"id":"1907.09631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-13T22:41:43Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"21b10056fefb75bdf4b973bef91217083dd673cb245367477aeca7ef1bbdfeb4","abstract_canon_sha256":"1b74235bc5cc712b09f50ec842260e113f43c232e840a421f5d4412218ae384b"},"schema_version":"1.0"},"canonical_sha256":"31a6e7c83aeef7c743fb50a4a4165361cd2009776c2be77d440b214059fa0d2b","source":{"kind":"arxiv","id":"1907.09631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09631","created_at":"2026-05-17T23:39:50Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09631v1","created_at":"2026-05-17T23:39:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09631","created_at":"2026-05-17T23:39:50Z"},{"alias_kind":"pith_short_12","alias_value":"GGTOPSB25334","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GGTOPSB25334OQ73","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GGTOPSB2","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GGTOPSB25334OQ73KCSKIFSTMH","target":"record","payload":{"canonical_record":{"source":{"id":"1907.09631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-13T22:41:43Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"21b10056fefb75bdf4b973bef91217083dd673cb245367477aeca7ef1bbdfeb4","abstract_canon_sha256":"1b74235bc5cc712b09f50ec842260e113f43c232e840a421f5d4412218ae384b"},"schema_version":"1.0"},"canonical_sha256":"31a6e7c83aeef7c743fb50a4a4165361cd2009776c2be77d440b214059fa0d2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:50.567455Z","signature_b64":"/gV1FWsuseDYCZ9XhSm/yaWeBoeKkfxBAYEGzNVbCl2UoiNnXrCXFOuKiE62Z/whvSaiLwTOQA2ptYqSr/HIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31a6e7c83aeef7c743fb50a4a4165361cd2009776c2be77d440b214059fa0d2b","last_reissued_at":"2026-05-17T23:39:50.566993Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:50.566993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.09631","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-05-17T23:39:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"82zOabwyiMwr+oCvQay+HgAeux4OjuoMpU84M6JNxj3Yun1ggTbbU7pzCeusXx51vjtk38x0vqKa3Sslr1INAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:04:24.170204Z"},"content_sha256":"9a25eae9403c3da69fe4ff92df3e8eeaa3c53cbe1f2b8bd6596143d796576c55","schema_version":"1.0","event_id":"sha256:9a25eae9403c3da69fe4ff92df3e8eeaa3c53cbe1f2b8bd6596143d796576c55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GGTOPSB25334OQ73KCSKIFSTMH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Quantum Approximate Optimization Algorithm under Realistic Noise in Superconducting Qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Abdullah Ash-Saki, Mahabubul Alam, Swaroop Ghosh","submitted_at":"2019-07-13T22:41:43Z","abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is a promising quantum-classical hybrid technique to solve combinatorial optimization problems in near-term gate-based noisy quantum devices. In QAOA, the objective is a function of the quantum state, which itself is a function of the gate parameters of a multi-level parameterized quantum circuit (PQC). A classical optimizer varies the continuous gate parameters to generate distributions (quantum state) with significant support to the optimal solution. Even at the lowest circuit depth, QAOA offers non-trivial provable performance guarantee "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09631","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":""},"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-05-17T23:39:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"39x3+wDBAbgZnvJhTgRtIukesPTVZCzXyMcmiNob3ykkyM+VZN/9KTve/5ZqyPg9L+i5yF8bHl9qmW2hAuwoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:04:24.170900Z"},"content_sha256":"29e0ce3da00fd6e5696a621a18558ee00833a88d63170d194e39c1403e9b02a8","schema_version":"1.0","event_id":"sha256:29e0ce3da00fd6e5696a621a18558ee00833a88d63170d194e39c1403e9b02a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGTOPSB25334OQ73KCSKIFSTMH/bundle.json","state_url":"https://pith.science/pith/GGTOPSB25334OQ73KCSKIFSTMH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGTOPSB25334OQ73KCSKIFSTMH/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-05-25T23:04:24Z","links":{"resolver":"https://pith.science/pith/GGTOPSB25334OQ73KCSKIFSTMH","bundle":"https://pith.science/pith/GGTOPSB25334OQ73KCSKIFSTMH/bundle.json","state":"https://pith.science/pith/GGTOPSB25334OQ73KCSKIFSTMH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGTOPSB25334OQ73KCSKIFSTMH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GGTOPSB25334OQ73KCSKIFSTMH","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":"1b74235bc5cc712b09f50ec842260e113f43c232e840a421f5d4412218ae384b","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-13T22:41:43Z","title_canon_sha256":"21b10056fefb75bdf4b973bef91217083dd673cb245367477aeca7ef1bbdfeb4"},"schema_version":"1.0","source":{"id":"1907.09631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09631","created_at":"2026-05-17T23:39:50Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09631v1","created_at":"2026-05-17T23:39:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09631","created_at":"2026-05-17T23:39:50Z"},{"alias_kind":"pith_short_12","alias_value":"GGTOPSB25334","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GGTOPSB25334OQ73","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GGTOPSB2","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:29e0ce3da00fd6e5696a621a18558ee00833a88d63170d194e39c1403e9b02a8","target":"graph","created_at":"2026-05-17T23:39:50Z","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"},"paper":{"abstract_excerpt":"The quantum approximate optimization algorithm (QAOA) is a promising quantum-classical hybrid technique to solve combinatorial optimization problems in near-term gate-based noisy quantum devices. In QAOA, the objective is a function of the quantum state, which itself is a function of the gate parameters of a multi-level parameterized quantum circuit (PQC). A classical optimizer varies the continuous gate parameters to generate distributions (quantum state) with significant support to the optimal solution. Even at the lowest circuit depth, QAOA offers non-trivial provable performance guarantee ","authors_text":"Abdullah Ash-Saki, Mahabubul Alam, Swaroop Ghosh","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-13T22:41:43Z","title":"Analysis of Quantum Approximate Optimization Algorithm under Realistic Noise in Superconducting Qubits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09631","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:9a25eae9403c3da69fe4ff92df3e8eeaa3c53cbe1f2b8bd6596143d796576c55","target":"record","created_at":"2026-05-17T23:39:50Z","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":"1b74235bc5cc712b09f50ec842260e113f43c232e840a421f5d4412218ae384b","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-13T22:41:43Z","title_canon_sha256":"21b10056fefb75bdf4b973bef91217083dd673cb245367477aeca7ef1bbdfeb4"},"schema_version":"1.0","source":{"id":"1907.09631","kind":"arxiv","version":1}},"canonical_sha256":"31a6e7c83aeef7c743fb50a4a4165361cd2009776c2be77d440b214059fa0d2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31a6e7c83aeef7c743fb50a4a4165361cd2009776c2be77d440b214059fa0d2b","first_computed_at":"2026-05-17T23:39:50.566993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:50.566993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/gV1FWsuseDYCZ9XhSm/yaWeBoeKkfxBAYEGzNVbCl2UoiNnXrCXFOuKiE62Z/whvSaiLwTOQA2ptYqSr/HIAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:50.567455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a25eae9403c3da69fe4ff92df3e8eeaa3c53cbe1f2b8bd6596143d796576c55","sha256:29e0ce3da00fd6e5696a621a18558ee00833a88d63170d194e39c1403e9b02a8"],"state_sha256":"36a08cce34d60dc28184adc90ed9f33b0422172b05dc523629d1b16da8cc0f98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TsoctdIhON2yneSXg6bQuZ8cZt4h5wwjkeTpdIjy6zEQ1jK9bExAECx2o2DJq7AqFZffuiyV4Z3AoaEPgEEKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:04:24.174199Z","bundle_sha256":"9abdb73fd78934fa2e27d9d97cf868ca82ac014c2bb9f3f727fa8b2175b2eeb0"}}