{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KCUM7Z3TR6WHQNZCNUTD7OPY7P","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":"e4d4a4ce099af83806e9b41264178f869ace380983f10edd365a5d5e254377a8","cross_cats_sorted":["cs.ET","math-ph","math.MP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-24T18:49:07Z","title_canon_sha256":"f64f503845b932ed48e23a46989983e0fc8c0930fcb5354d4c8a63cf4de2935b"},"schema_version":"1.0","source":{"id":"2404.16135","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.16135","created_at":"2026-07-05T10:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"2404.16135v2","created_at":"2026-07-05T10:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.16135","created_at":"2026-07-05T10:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"KCUM7Z3TR6WH","created_at":"2026-07-05T10:41:12Z"},{"alias_kind":"pith_short_16","alias_value":"KCUM7Z3TR6WHQNZC","created_at":"2026-07-05T10:41:12Z"},{"alias_kind":"pith_short_8","alias_value":"KCUM7Z3T","created_at":"2026-07-05T10:41:12Z"}],"graph_snapshots":[{"event_id":"sha256:6de277119d1338d030a4c5e0ae0cceeb7b729dac6048af78ea61c704c5f93d67","target":"graph","created_at":"2026-07-05T10:41: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/2404.16135/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational advantages. To address this we present a variational quantum algorithm for solving combinatorial optimization problems with linear-depth circuits. Our algorithm uses an ansatz composed of Hamiltonian generators designed to control each term in the target combinatorial function, along with parameter updates following a modified version of quantum imaginary tim","authors_text":"Ananth Kaushik, Martin Roetteler, Phillip C. Lotshaw, Titus D. Morris","cross_cats":["cs.ET","math-ph","math.MP"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-24T18:49:07Z","title":"Performant near-term quantum combinatorial optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.16135","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:8b9aff21069c9a3c49ba713998b3ed13ce4e26fc980a0947f57aa8eaf0cf88e5","target":"record","created_at":"2026-07-05T10:41: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":"e4d4a4ce099af83806e9b41264178f869ace380983f10edd365a5d5e254377a8","cross_cats_sorted":["cs.ET","math-ph","math.MP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-24T18:49:07Z","title_canon_sha256":"f64f503845b932ed48e23a46989983e0fc8c0930fcb5354d4c8a63cf4de2935b"},"schema_version":"1.0","source":{"id":"2404.16135","kind":"arxiv","version":2}},"canonical_sha256":"50a8cfe7738fac7837226d263fb9f8fbc159d8128bd35cbfa3e45323f8074c04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50a8cfe7738fac7837226d263fb9f8fbc159d8128bd35cbfa3e45323f8074c04","first_computed_at":"2026-07-05T10:41:12.446262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:41:12.446262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oohmN+BNWJHj+f0PDC0XIMrHbhqAYjJzSYwyfYy40SAgiyQzxPO/iESKzJpmFAP7xJbLeUQlRsQANcdE4F2aDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:41:12.446757Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.16135","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b9aff21069c9a3c49ba713998b3ed13ce4e26fc980a0947f57aa8eaf0cf88e5","sha256:6de277119d1338d030a4c5e0ae0cceeb7b729dac6048af78ea61c704c5f93d67"],"state_sha256":"1d7943bba019bc8b5b061c03a8a3c6f5e4ea89d324295807930a0c35dfcc06d5"}