{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:Y4IZ44XETUO5KRAYOF54YQPNIG","short_pith_number":"pith:Y4IZ44XE","schema_version":"1.0","canonical_sha256":"c7119e72e49d1dd54418717bcc41ed419d6f21adb0a350d9dc35a495347c5360","source":{"kind":"arxiv","id":"2203.00717","version":1},"attestation_state":"computed","paper":{"title":"Twisted hybrid algorithms for combinatorial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Kliesch, Libor Caha, Robert Koenig","submitted_at":"2022-03-01T19:47:16Z","abstract_excerpt":"Proposed hybrid algorithms encode a combinatorial cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. Classical processing is typically only used for the choice of variational parameters following gradient descent. As a consequence, these approaches are limited by the descriptive power of the associated states.\n  We argue that for certain combinatorial optimization problems, such algorithms can be hybridized further, thus harnessing the power of efficient non-local classical processing. Specifically, we consider combinin"},"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":"2203.00717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-01T19:47:16Z","cross_cats_sorted":[],"title_canon_sha256":"ee781c0cd52b2ed3d92418a5436e662a343f8f74d9aa38c9b1106438e60cf9e3","abstract_canon_sha256":"810049b090e5ad64619e1b8c1411615eec40979e9501530086b52a2de71a4734"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:51:06.853365Z","signature_b64":"XyGMTPpIHz/bXDV1tsc6BPOHHxtCnwXugLdtVjfyAjxSx4r1xGn8zbpHn7vp61leSrYxD2IkGthKhlbGgu/WCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7119e72e49d1dd54418717bcc41ed419d6f21adb0a350d9dc35a495347c5360","last_reissued_at":"2026-07-05T04:51:06.852957Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:51:06.852957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Twisted hybrid algorithms for combinatorial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Kliesch, Libor Caha, Robert Koenig","submitted_at":"2022-03-01T19:47:16Z","abstract_excerpt":"Proposed hybrid algorithms encode a combinatorial cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. Classical processing is typically only used for the choice of variational parameters following gradient descent. As a consequence, these approaches are limited by the descriptive power of the associated states.\n  We argue that for certain combinatorial optimization problems, such algorithms can be hybridized further, thus harnessing the power of efficient non-local classical processing. Specifically, we consider combinin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00717","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.00717/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":"2203.00717","created_at":"2026-07-05T04:51:06.853013+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.00717v1","created_at":"2026-07-05T04:51:06.853013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00717","created_at":"2026-07-05T04:51:06.853013+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4IZ44XETUO5","created_at":"2026-07-05T04:51:06.853013+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4IZ44XETUO5KRAY","created_at":"2026-07-05T04:51:06.853013+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4IZ44XE","created_at":"2026-07-05T04:51:06.853013+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/Y4IZ44XETUO5KRAYOF54YQPNIG","json":"https://pith.science/pith/Y4IZ44XETUO5KRAYOF54YQPNIG.json","graph_json":"https://pith.science/api/pith-number/Y4IZ44XETUO5KRAYOF54YQPNIG/graph.json","events_json":"https://pith.science/api/pith-number/Y4IZ44XETUO5KRAYOF54YQPNIG/events.json","paper":"https://pith.science/paper/Y4IZ44XE"},"agent_actions":{"view_html":"https://pith.science/pith/Y4IZ44XETUO5KRAYOF54YQPNIG","download_json":"https://pith.science/pith/Y4IZ44XETUO5KRAYOF54YQPNIG.json","view_paper":"https://pith.science/paper/Y4IZ44XE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.00717&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4IZ44XETUO5KRAYOF54YQPNIG/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4IZ44XETUO5KRAYOF54YQPNIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4IZ44XETUO5KRAYOF54YQPNIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4IZ44XETUO5KRAYOF54YQPNIG/action/storage_attestation","attest_author":"https://pith.science/pith/Y4IZ44XETUO5KRAYOF54YQPNIG/action/author_attestation","sign_citation":"https://pith.science/pith/Y4IZ44XETUO5KRAYOF54YQPNIG/action/citation_signature","submit_replication":"https://pith.science/pith/Y4IZ44XETUO5KRAYOF54YQPNIG/action/replication_record"}},"created_at":"2026-07-05T04:51:06.853013+00:00","updated_at":"2026-07-05T04:51:06.853013+00:00"}