{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:Y4IZ44XETUO5KRAYOF54YQPNIG","short_pith_number":"pith:Y4IZ44XE","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"},"canonical_sha256":"c7119e72e49d1dd54418717bcc41ed419d6f21adb0a350d9dc35a495347c5360","source":{"kind":"arxiv","id":"2203.00717","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.00717","created_at":"2026-07-05T04:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"2203.00717v1","created_at":"2026-07-05T04:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00717","created_at":"2026-07-05T04:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"Y4IZ44XETUO5","created_at":"2026-07-05T04:51:06Z"},{"alias_kind":"pith_short_16","alias_value":"Y4IZ44XETUO5KRAY","created_at":"2026-07-05T04:51:06Z"},{"alias_kind":"pith_short_8","alias_value":"Y4IZ44XE","created_at":"2026-07-05T04:51:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:Y4IZ44XETUO5KRAYOF54YQPNIG","target":"record","payload":{"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"},"canonical_sha256":"c7119e72e49d1dd54418717bcc41ed419d6f21adb0a350d9dc35a495347c5360","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"},"source_kind":"arxiv","source_id":"2203.00717","source_version":1,"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-05T04:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7GS82exLiqN5zT/isT0HPI2QTiAbmcDN576yWqb0P8oIAPW3SstZqMxc9QjbrzXBY/fWnI0Rri4I3ZtMw5S/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T07:10:06.967534Z"},"content_sha256":"3084fd9986ff470c845dba1ca72185dead0b1ca5340c6e6a51fbebff10b6cd2e","schema_version":"1.0","event_id":"sha256:3084fd9986ff470c845dba1ca72185dead0b1ca5340c6e6a51fbebff10b6cd2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:Y4IZ44XETUO5KRAYOF54YQPNIG","target":"graph","payload":{"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"},"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-05T04:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lS31rl8hBRmwrI7hfLatTwBojTpPPBSCRSSSdY+j6U5334yAWIydTTn+EeNzfFLLaXEsVArBKO8Qz+DgWLkcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T07:10:06.968052Z"},"content_sha256":"71981070b5d898a953b6a2ea14fe6e6161092abddf120ec43c202ee245d91dc0","schema_version":"1.0","event_id":"sha256:71981070b5d898a953b6a2ea14fe6e6161092abddf120ec43c202ee245d91dc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y4IZ44XETUO5KRAYOF54YQPNIG/bundle.json","state_url":"https://pith.science/pith/Y4IZ44XETUO5KRAYOF54YQPNIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y4IZ44XETUO5KRAYOF54YQPNIG/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-23T07:10:06Z","links":{"resolver":"https://pith.science/pith/Y4IZ44XETUO5KRAYOF54YQPNIG","bundle":"https://pith.science/pith/Y4IZ44XETUO5KRAYOF54YQPNIG/bundle.json","state":"https://pith.science/pith/Y4IZ44XETUO5KRAYOF54YQPNIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y4IZ44XETUO5KRAYOF54YQPNIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:Y4IZ44XETUO5KRAYOF54YQPNIG","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":"810049b090e5ad64619e1b8c1411615eec40979e9501530086b52a2de71a4734","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-01T19:47:16Z","title_canon_sha256":"ee781c0cd52b2ed3d92418a5436e662a343f8f74d9aa38c9b1106438e60cf9e3"},"schema_version":"1.0","source":{"id":"2203.00717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.00717","created_at":"2026-07-05T04:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"2203.00717v1","created_at":"2026-07-05T04:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00717","created_at":"2026-07-05T04:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"Y4IZ44XETUO5","created_at":"2026-07-05T04:51:06Z"},{"alias_kind":"pith_short_16","alias_value":"Y4IZ44XETUO5KRAY","created_at":"2026-07-05T04:51:06Z"},{"alias_kind":"pith_short_8","alias_value":"Y4IZ44XE","created_at":"2026-07-05T04:51:06Z"}],"graph_snapshots":[{"event_id":"sha256:71981070b5d898a953b6a2ea14fe6e6161092abddf120ec43c202ee245d91dc0","target":"graph","created_at":"2026-07-05T04:51:06Z","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/2203.00717/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexander Kliesch, Libor Caha, Robert Koenig","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-01T19:47:16Z","title":"Twisted hybrid algorithms for combinatorial optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00717","kind":"arxiv","version":1},"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:3084fd9986ff470c845dba1ca72185dead0b1ca5340c6e6a51fbebff10b6cd2e","target":"record","created_at":"2026-07-05T04:51:06Z","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":"810049b090e5ad64619e1b8c1411615eec40979e9501530086b52a2de71a4734","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-01T19:47:16Z","title_canon_sha256":"ee781c0cd52b2ed3d92418a5436e662a343f8f74d9aa38c9b1106438e60cf9e3"},"schema_version":"1.0","source":{"id":"2203.00717","kind":"arxiv","version":1}},"canonical_sha256":"c7119e72e49d1dd54418717bcc41ed419d6f21adb0a350d9dc35a495347c5360","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7119e72e49d1dd54418717bcc41ed419d6f21adb0a350d9dc35a495347c5360","first_computed_at":"2026-07-05T04:51:06.852957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:51:06.852957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XyGMTPpIHz/bXDV1tsc6BPOHHxtCnwXugLdtVjfyAjxSx4r1xGn8zbpHn7vp61leSrYxD2IkGthKhlbGgu/WCA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:51:06.853365Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.00717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3084fd9986ff470c845dba1ca72185dead0b1ca5340c6e6a51fbebff10b6cd2e","sha256:71981070b5d898a953b6a2ea14fe6e6161092abddf120ec43c202ee245d91dc0"],"state_sha256":"dc7a60a9bd7799328b6c69d16c485c091fc8bdacd539977050afd31d851336cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lc/a5ZDInQBxXNl+GeqNor08+1d2yn+wh3+g1uIk6Pq2gkprdX8wTTWaw5PYanCl1V9d6uy3u3vSb3WZmQrPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T07:10:06.971589Z","bundle_sha256":"670c3d8f932b3a8a2eba6c9574a9bd50e6c2634a97caf700c20c73809ca4013e"}}