{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GRTJAT6A4DRY3EJPZEBJEPFBJU","short_pith_number":"pith:GRTJAT6A","schema_version":"1.0","canonical_sha256":"3466904fc0e0e38d912fc902923ca14d244f38f39098266f8fee585ec0da8168","source":{"kind":"arxiv","id":"2104.09503","version":1},"attestation_state":"computed","paper":{"title":"Graph Partitioning into Hamiltonian Subgraphs on a Quantum Annealer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Davide Vodola, Edoardo Tignone, Eugenio Cocchi","submitted_at":"2021-04-18T16:15:00Z","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"},"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":"2104.09503","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-04-18T16:15:00Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"1f00bdee7ea4353883505fee533d84993e90cf3d2f598199bd712730a8535422","abstract_canon_sha256":"78ef6ca2294a8d8c4975bd79a8f310a0f3de31837f1f70fa426e2f9016390e7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:33:34.436275Z","signature_b64":"lhD8k8HAU/CneC0oZxWpB8jA3d5FhQfiyOPlgiowgpW9mvZ7IKf6I5ygkVs5P4XjSbxLhycYHPK/Orge/N0zDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3466904fc0e0e38d912fc902923ca14d244f38f39098266f8fee585ec0da8168","last_reissued_at":"2026-07-05T02:33:34.435830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:33:34.435830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Partitioning into Hamiltonian Subgraphs on a Quantum Annealer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Davide Vodola, Edoardo Tignone, Eugenio Cocchi","submitted_at":"2021-04-18T16:15:00Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.09503","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/2104.09503/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":"2104.09503","created_at":"2026-07-05T02:33:34.435884+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.09503v1","created_at":"2026-07-05T02:33:34.435884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.09503","created_at":"2026-07-05T02:33:34.435884+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRTJAT6A4DRY","created_at":"2026-07-05T02:33:34.435884+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRTJAT6A4DRY3EJP","created_at":"2026-07-05T02:33:34.435884+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRTJAT6A","created_at":"2026-07-05T02:33:34.435884+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.20397","citing_title":"VESPA: Towards un(Human)supervised Open-World Pointcloud Labeling for Autonomous Driving","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GRTJAT6A4DRY3EJPZEBJEPFBJU","json":"https://pith.science/pith/GRTJAT6A4DRY3EJPZEBJEPFBJU.json","graph_json":"https://pith.science/api/pith-number/GRTJAT6A4DRY3EJPZEBJEPFBJU/graph.json","events_json":"https://pith.science/api/pith-number/GRTJAT6A4DRY3EJPZEBJEPFBJU/events.json","paper":"https://pith.science/paper/GRTJAT6A"},"agent_actions":{"view_html":"https://pith.science/pith/GRTJAT6A4DRY3EJPZEBJEPFBJU","download_json":"https://pith.science/pith/GRTJAT6A4DRY3EJPZEBJEPFBJU.json","view_paper":"https://pith.science/paper/GRTJAT6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.09503&json=true","fetch_graph":"https://pith.science/api/pith-number/GRTJAT6A4DRY3EJPZEBJEPFBJU/graph.json","fetch_events":"https://pith.science/api/pith-number/GRTJAT6A4DRY3EJPZEBJEPFBJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRTJAT6A4DRY3EJPZEBJEPFBJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRTJAT6A4DRY3EJPZEBJEPFBJU/action/storage_attestation","attest_author":"https://pith.science/pith/GRTJAT6A4DRY3EJPZEBJEPFBJU/action/author_attestation","sign_citation":"https://pith.science/pith/GRTJAT6A4DRY3EJPZEBJEPFBJU/action/citation_signature","submit_replication":"https://pith.science/pith/GRTJAT6A4DRY3EJPZEBJEPFBJU/action/replication_record"}},"created_at":"2026-07-05T02:33:34.435884+00:00","updated_at":"2026-07-05T02:33:34.435884+00:00"}