{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:U2MDP5LB7U7INF5M3Y4AM7ISPB","short_pith_number":"pith:U2MDP5LB","canonical_record":{"source":{"id":"1709.03489","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-11T17:50:49Z","cross_cats_sorted":[],"title_canon_sha256":"803964ae75dd1a710de8ef140cf11aaec1cb59778372c219c321365ed0c45d83","abstract_canon_sha256":"68382debb8aec5efc61633b2bbd4ab54cc1b6779f092f48e00c902642bebe2fc"},"schema_version":"1.0"},"canonical_sha256":"a69837f561fd3e8697acde38067d12787e0e9791c8e92607ede03ba7f9b87b03","source":{"kind":"arxiv","id":"1709.03489","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03489","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03489v2","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03489","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"U2MDP5LB7U7I","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U2MDP5LB7U7INF5M","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U2MDP5LB","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:U2MDP5LB7U7INF5M3Y4AM7ISPB","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03489","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-11T17:50:49Z","cross_cats_sorted":[],"title_canon_sha256":"803964ae75dd1a710de8ef140cf11aaec1cb59778372c219c321365ed0c45d83","abstract_canon_sha256":"68382debb8aec5efc61633b2bbd4ab54cc1b6779f092f48e00c902642bebe2fc"},"schema_version":"1.0"},"canonical_sha256":"a69837f561fd3e8697acde38067d12787e0e9791c8e92607ede03ba7f9b87b03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:29.442130Z","signature_b64":"ra40klnLNvG8PKZ3aI8QEKemgHC/al+qjtDqEVh7HTwOnKYDNIY5HZQkgPPMXOqPEFVs8zMnnNt/OCT7QnNzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a69837f561fd3e8697acde38067d12787e0e9791c8e92607ede03ba7f9b87b03","last_reissued_at":"2026-05-17T23:52:29.441579Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:29.441579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03489","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-05-17T23:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nXWExvEwzzhjI5wjIPydAw3244YL+sFlS8nSQ2KJz4WXt/BfYc33tbP7u1VGmoepeywxHVxYgtzhezhDk86rBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T00:57:15.996875Z"},"content_sha256":"64bc897235820ece6e7620a1e7f4095e544fdab5d4795a8dcc5cc8f31be2dfc8","schema_version":"1.0","event_id":"sha256:64bc897235820ece6e7620a1e7f4095e544fdab5d4795a8dcc5cc8f31be2dfc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:U2MDP5LB7U7INF5M3Y4AM7ISPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bryan O'Gorman, Davide Venturelli, Eleanor G. Rieffel, Rupak Biswas, Stuart Hadfield, Zhihui Wang","submitted_at":"2017-09-11T17:50:49Z","abstract_excerpt":"The next few years will be exciting as prototype universal quantum processors emerge, enabling implementation of a wider variety of algorithms. Of particular interest are quantum heuristics, which require experimentation on quantum hardware for their evaluation, and which have the potential to significantly expand the breadth of quantum computing applications. A leading candidate is Farhi et al.'s Quantum Approximate Optimization Algorithm, which alternates between applying a cost-function-based Hamiltonian and a mixing Hamiltonian. Here, we extend this framework to allow alternation between m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03489","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":""},"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:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/jTrMiX+J28AT3EMQHUVWcvUQWauTwxHoxiedfamTXUm60ZBRMHjOqTIJGPCIo23BPmfN2hzoAzZ2WnlTlmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T00:57:15.997250Z"},"content_sha256":"c794d89379dced7e539cb6ace43dbf7d14bd0f722ce86c4c22a665f8e69a3aff","schema_version":"1.0","event_id":"sha256:c794d89379dced7e539cb6ace43dbf7d14bd0f722ce86c4c22a665f8e69a3aff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U2MDP5LB7U7INF5M3Y4AM7ISPB/bundle.json","state_url":"https://pith.science/pith/U2MDP5LB7U7INF5M3Y4AM7ISPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U2MDP5LB7U7INF5M3Y4AM7ISPB/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-12T00:57:16Z","links":{"resolver":"https://pith.science/pith/U2MDP5LB7U7INF5M3Y4AM7ISPB","bundle":"https://pith.science/pith/U2MDP5LB7U7INF5M3Y4AM7ISPB/bundle.json","state":"https://pith.science/pith/U2MDP5LB7U7INF5M3Y4AM7ISPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U2MDP5LB7U7INF5M3Y4AM7ISPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:U2MDP5LB7U7INF5M3Y4AM7ISPB","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":"68382debb8aec5efc61633b2bbd4ab54cc1b6779f092f48e00c902642bebe2fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-11T17:50:49Z","title_canon_sha256":"803964ae75dd1a710de8ef140cf11aaec1cb59778372c219c321365ed0c45d83"},"schema_version":"1.0","source":{"id":"1709.03489","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03489","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03489v2","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03489","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"U2MDP5LB7U7I","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U2MDP5LB7U7INF5M","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U2MDP5LB","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:c794d89379dced7e539cb6ace43dbf7d14bd0f722ce86c4c22a665f8e69a3aff","target":"graph","created_at":"2026-05-17T23:52:29Z","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 next few years will be exciting as prototype universal quantum processors emerge, enabling implementation of a wider variety of algorithms. Of particular interest are quantum heuristics, which require experimentation on quantum hardware for their evaluation, and which have the potential to significantly expand the breadth of quantum computing applications. A leading candidate is Farhi et al.'s Quantum Approximate Optimization Algorithm, which alternates between applying a cost-function-based Hamiltonian and a mixing Hamiltonian. Here, we extend this framework to allow alternation between m","authors_text":"Bryan O'Gorman, Davide Venturelli, Eleanor G. Rieffel, Rupak Biswas, Stuart Hadfield, Zhihui Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-11T17:50:49Z","title":"From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03489","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:64bc897235820ece6e7620a1e7f4095e544fdab5d4795a8dcc5cc8f31be2dfc8","target":"record","created_at":"2026-05-17T23:52:29Z","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":"68382debb8aec5efc61633b2bbd4ab54cc1b6779f092f48e00c902642bebe2fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-11T17:50:49Z","title_canon_sha256":"803964ae75dd1a710de8ef140cf11aaec1cb59778372c219c321365ed0c45d83"},"schema_version":"1.0","source":{"id":"1709.03489","kind":"arxiv","version":2}},"canonical_sha256":"a69837f561fd3e8697acde38067d12787e0e9791c8e92607ede03ba7f9b87b03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a69837f561fd3e8697acde38067d12787e0e9791c8e92607ede03ba7f9b87b03","first_computed_at":"2026-05-17T23:52:29.441579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:29.441579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ra40klnLNvG8PKZ3aI8QEKemgHC/al+qjtDqEVh7HTwOnKYDNIY5HZQkgPPMXOqPEFVs8zMnnNt/OCT7QnNzDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:29.442130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03489","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64bc897235820ece6e7620a1e7f4095e544fdab5d4795a8dcc5cc8f31be2dfc8","sha256:c794d89379dced7e539cb6ace43dbf7d14bd0f722ce86c4c22a665f8e69a3aff"],"state_sha256":"1667d35ec87851e56b8e849c8afbf0695517fedac7763570936c0f9e48c68c76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qogODIsv7ulJSfPHy3Swk4fCFbulHiB46ZTChTUjne5TsOg3SyzOmFmiL2g0Iul+3/oz0oztfC4WTKfgq+HECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T00:57:16.001162Z","bundle_sha256":"6e5d56f35ed96c5e8fe54153aab58247e0aa5ec0bf02de1d9bef889c8db72d44"}}