{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:GRTJAT6A4DRY3EJPZEBJEPFBJU","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":"78ef6ca2294a8d8c4975bd79a8f310a0f3de31837f1f70fa426e2f9016390e7d","cross_cats_sorted":["cs.ET"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-04-18T16:15:00Z","title_canon_sha256":"1f00bdee7ea4353883505fee533d84993e90cf3d2f598199bd712730a8535422"},"schema_version":"1.0","source":{"id":"2104.09503","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.09503","created_at":"2026-07-05T02:33:34Z"},{"alias_kind":"arxiv_version","alias_value":"2104.09503v1","created_at":"2026-07-05T02:33:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.09503","created_at":"2026-07-05T02:33:34Z"},{"alias_kind":"pith_short_12","alias_value":"GRTJAT6A4DRY","created_at":"2026-07-05T02:33:34Z"},{"alias_kind":"pith_short_16","alias_value":"GRTJAT6A4DRY3EJP","created_at":"2026-07-05T02:33:34Z"},{"alias_kind":"pith_short_8","alias_value":"GRTJAT6A","created_at":"2026-07-05T02:33:34Z"}],"graph_snapshots":[{"event_id":"sha256:ca8a0f224b435ca301e4d64e009e0ae798dceafd04534b3a8878e273a9963887","target":"graph","created_at":"2026-07-05T02:33:34Z","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/2104.09503/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We demonstrate that a quantum annealer can be used to solve the NP-complete problem of graph partitioning into subgraphs containing Hamiltonian cycles of constrained length. We present a method to find a partition of a given directed graph into Hamiltonian subgraphs with three or more vertices, called vertex 3-cycle cover. We formulate the problem as a quadratic unconstrained binary optimisation and run it on a D-Wave Advantage quantum annealer. We test our method on synthetic graphs constructed by adding a number of random edges to a set of disjoint cycles. We show that the probability of sol","authors_text":"Davide Vodola, Edoardo Tignone, Eugenio Cocchi","cross_cats":["cs.ET"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-04-18T16:15:00Z","title":"Graph Partitioning into Hamiltonian Subgraphs on a Quantum Annealer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.09503","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:ad05d09eae34326a995e92065b86add119a745597a77c21325ec16fcd1cdf770","target":"record","created_at":"2026-07-05T02:33:34Z","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":"78ef6ca2294a8d8c4975bd79a8f310a0f3de31837f1f70fa426e2f9016390e7d","cross_cats_sorted":["cs.ET"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-04-18T16:15:00Z","title_canon_sha256":"1f00bdee7ea4353883505fee533d84993e90cf3d2f598199bd712730a8535422"},"schema_version":"1.0","source":{"id":"2104.09503","kind":"arxiv","version":1}},"canonical_sha256":"3466904fc0e0e38d912fc902923ca14d244f38f39098266f8fee585ec0da8168","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3466904fc0e0e38d912fc902923ca14d244f38f39098266f8fee585ec0da8168","first_computed_at":"2026-07-05T02:33:34.435830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:33:34.435830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lhD8k8HAU/CneC0oZxWpB8jA3d5FhQfiyOPlgiowgpW9mvZ7IKf6I5ygkVs5P4XjSbxLhycYHPK/Orge/N0zDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:33:34.436275Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.09503","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad05d09eae34326a995e92065b86add119a745597a77c21325ec16fcd1cdf770","sha256:ca8a0f224b435ca301e4d64e009e0ae798dceafd04534b3a8878e273a9963887"],"state_sha256":"c85876ea9c67e8f02da14a407db9d2293681ab13eddee6198df6c44c13115fb9"}