{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:V6SBTQ5BARZ5LDX2DTDPZPUDGX","short_pith_number":"pith:V6SBTQ5B","canonical_record":{"source":{"id":"1910.13483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-10-29T19:14:00Z","cross_cats_sorted":[],"title_canon_sha256":"a102a71bfc34e70a6c7c9e9bd49531688de9bbb9e7073bea72e0d5d51dae4fba","abstract_canon_sha256":"086542f02cbe0fc808059b37e0710c5cdd519a3354f2f891c050e4ef742ab406"},"schema_version":"1.0"},"canonical_sha256":"afa419c3a10473d58efa1cc6fcbe8335c33f1907ed0fdb8ff250b7f750e85f22","source":{"kind":"arxiv","id":"1910.13483","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.13483","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"arxiv_version","alias_value":"1910.13483v2","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.13483","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"pith_short_12","alias_value":"V6SBTQ5BARZ5","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"pith_short_16","alias_value":"V6SBTQ5BARZ5LDX2","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"pith_short_8","alias_value":"V6SBTQ5B","created_at":"2026-07-05T02:54:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:V6SBTQ5BARZ5LDX2DTDPZPUDGX","target":"record","payload":{"canonical_record":{"source":{"id":"1910.13483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-10-29T19:14:00Z","cross_cats_sorted":[],"title_canon_sha256":"a102a71bfc34e70a6c7c9e9bd49531688de9bbb9e7073bea72e0d5d51dae4fba","abstract_canon_sha256":"086542f02cbe0fc808059b37e0710c5cdd519a3354f2f891c050e4ef742ab406"},"schema_version":"1.0"},"canonical_sha256":"afa419c3a10473d58efa1cc6fcbe8335c33f1907ed0fdb8ff250b7f750e85f22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:54:12.626016Z","signature_b64":"f+FBFIgrpBtb/TRfCt6zUrqSrEUJZKVQsaXc1IzfJZv7QUsqzN+apuvYtTWoNPASQSPPBMmwn44JAAzF8q5YDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afa419c3a10473d58efa1cc6fcbe8335c33f1907ed0fdb8ff250b7f750e85f22","last_reissued_at":"2026-07-05T02:54:12.625572Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:54:12.625572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.13483","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-05T02:54:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MmPHAzbCjetIxlhrDq4mOo85OHFTzjVrSZBnjui4PKc8wIleaOsCQiKITSIXO+WZA8ol5q2E7nAZQIh3IbMWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:09:12.785255Z"},"content_sha256":"429fc6ae5cae17cbb495eb3dda74c32b3ea2ca78fb49dd8fc221a69901285035","schema_version":"1.0","event_id":"sha256:429fc6ae5cae17cbb495eb3dda74c32b3ea2ca78fb49dd8fc221a69901285035"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:V6SBTQ5BARZ5LDX2DTDPZPUDGX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas B\\\"artschi, Jeremy Cook, Stephan Eidenbenz","submitted_at":"2019-10-29T19:14:00Z","abstract_excerpt":"The Quantum Alternating Operator Ansatz is a generalization of the Quantum Approximate Optimization Algorithm (QAOA) designed for finding approximate solutions to combinatorial optimization problems with hard constraints. In this paper, we study Maximum $k$-Vertex Cover under this ansatz due to its modest complexity, while still being more complex than the well studied problems of Max-Cut and Max E3-LIN2.\n  Our approach includes (i) a performance comparison between easy-to-prepare classical states and Dicke states as starting states, (ii) a performance comparison between two $XY$-Hamiltonian m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.13483","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/1910.13483/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-05T02:54:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IWXqczo9Nu3mnVF8JHoHtFuFeeOxKRr6jkud/l1J1vs/9VuTlyL+t+J3HsUS6sSA1NOBBlJR/IJUEKtkqSfFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:09:12.786072Z"},"content_sha256":"23e644cd077bd5db1c0ecb8acc1e13d0227d5517b98de1a171f80412272e5a94","schema_version":"1.0","event_id":"sha256:23e644cd077bd5db1c0ecb8acc1e13d0227d5517b98de1a171f80412272e5a94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX/bundle.json","state_url":"https://pith.science/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX/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-04T19:09:12Z","links":{"resolver":"https://pith.science/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX","bundle":"https://pith.science/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX/bundle.json","state":"https://pith.science/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:V6SBTQ5BARZ5LDX2DTDPZPUDGX","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":"086542f02cbe0fc808059b37e0710c5cdd519a3354f2f891c050e4ef742ab406","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-10-29T19:14:00Z","title_canon_sha256":"a102a71bfc34e70a6c7c9e9bd49531688de9bbb9e7073bea72e0d5d51dae4fba"},"schema_version":"1.0","source":{"id":"1910.13483","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.13483","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"arxiv_version","alias_value":"1910.13483v2","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.13483","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"pith_short_12","alias_value":"V6SBTQ5BARZ5","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"pith_short_16","alias_value":"V6SBTQ5BARZ5LDX2","created_at":"2026-07-05T02:54:12Z"},{"alias_kind":"pith_short_8","alias_value":"V6SBTQ5B","created_at":"2026-07-05T02:54:12Z"}],"graph_snapshots":[{"event_id":"sha256:23e644cd077bd5db1c0ecb8acc1e13d0227d5517b98de1a171f80412272e5a94","target":"graph","created_at":"2026-07-05T02:54:12Z","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/1910.13483/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Quantum Alternating Operator Ansatz is a generalization of the Quantum Approximate Optimization Algorithm (QAOA) designed for finding approximate solutions to combinatorial optimization problems with hard constraints. In this paper, we study Maximum $k$-Vertex Cover under this ansatz due to its modest complexity, while still being more complex than the well studied problems of Max-Cut and Max E3-LIN2.\n  Our approach includes (i) a performance comparison between easy-to-prepare classical states and Dicke states as starting states, (ii) a performance comparison between two $XY$-Hamiltonian m","authors_text":"Andreas B\\\"artschi, Jeremy Cook, Stephan Eidenbenz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-10-29T19:14:00Z","title":"The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.13483","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:429fc6ae5cae17cbb495eb3dda74c32b3ea2ca78fb49dd8fc221a69901285035","target":"record","created_at":"2026-07-05T02:54:12Z","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":"086542f02cbe0fc808059b37e0710c5cdd519a3354f2f891c050e4ef742ab406","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-10-29T19:14:00Z","title_canon_sha256":"a102a71bfc34e70a6c7c9e9bd49531688de9bbb9e7073bea72e0d5d51dae4fba"},"schema_version":"1.0","source":{"id":"1910.13483","kind":"arxiv","version":2}},"canonical_sha256":"afa419c3a10473d58efa1cc6fcbe8335c33f1907ed0fdb8ff250b7f750e85f22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afa419c3a10473d58efa1cc6fcbe8335c33f1907ed0fdb8ff250b7f750e85f22","first_computed_at":"2026-07-05T02:54:12.625572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:54:12.625572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f+FBFIgrpBtb/TRfCt6zUrqSrEUJZKVQsaXc1IzfJZv7QUsqzN+apuvYtTWoNPASQSPPBMmwn44JAAzF8q5YDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:54:12.626016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.13483","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:429fc6ae5cae17cbb495eb3dda74c32b3ea2ca78fb49dd8fc221a69901285035","sha256:23e644cd077bd5db1c0ecb8acc1e13d0227d5517b98de1a171f80412272e5a94"],"state_sha256":"2e7572808e76cd6d01a8d9ddfdad302509562045b0e1f89e13dd37be4e306018"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nHv/iSn9320faJ2Mvl2Lt8HwgI0ofIwb4qg3L8K8RwgBqQTKKVpPLPqmfcIEkTjynjOhAqElBz6waQoF1k7ZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T19:09:12.792402Z","bundle_sha256":"6443a8c5a4e5b82833287fd83f35c66746f595fbfe4a338fbc32496cbea88885"}}