{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:V6SBTQ5BARZ5LDX2DTDPZPUDGX","short_pith_number":"pith:V6SBTQ5B","schema_version":"1.0","canonical_sha256":"afa419c3a10473d58efa1cc6fcbe8335c33f1907ed0fdb8ff250b7f750e85f22","source":{"kind":"arxiv","id":"1910.13483","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1910.13483","created_at":"2026-07-05T02:54:12.625641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.13483v2","created_at":"2026-07-05T02:54:12.625641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.13483","created_at":"2026-07-05T02:54:12.625641+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6SBTQ5BARZ5","created_at":"2026-07-05T02:54:12.625641+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6SBTQ5BARZ5LDX2","created_at":"2026-07-05T02:54:12.625641+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6SBTQ5B","created_at":"2026-07-05T02:54:12.625641+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX","json":"https://pith.science/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX.json","graph_json":"https://pith.science/api/pith-number/V6SBTQ5BARZ5LDX2DTDPZPUDGX/graph.json","events_json":"https://pith.science/api/pith-number/V6SBTQ5BARZ5LDX2DTDPZPUDGX/events.json","paper":"https://pith.science/paper/V6SBTQ5B"},"agent_actions":{"view_html":"https://pith.science/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX","download_json":"https://pith.science/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX.json","view_paper":"https://pith.science/paper/V6SBTQ5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.13483&json=true","fetch_graph":"https://pith.science/api/pith-number/V6SBTQ5BARZ5LDX2DTDPZPUDGX/graph.json","fetch_events":"https://pith.science/api/pith-number/V6SBTQ5BARZ5LDX2DTDPZPUDGX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX/action/storage_attestation","attest_author":"https://pith.science/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX/action/author_attestation","sign_citation":"https://pith.science/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX/action/citation_signature","submit_replication":"https://pith.science/pith/V6SBTQ5BARZ5LDX2DTDPZPUDGX/action/replication_record"}},"created_at":"2026-07-05T02:54:12.625641+00:00","updated_at":"2026-07-05T02:54:12.625641+00:00"}