{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SC43ILBO6SQ4SQO74NAKX7IBSE","short_pith_number":"pith:SC43ILBO","schema_version":"1.0","canonical_sha256":"90b9b42c2ef4a1c941dfe340abfd01913b3e6cf809286f51387ba0eb8a4f3df5","source":{"kind":"arxiv","id":"1801.08653","version":2},"attestation_state":"computed","paper":{"title":"Efficient Combinatorial Optimization Using Quantum Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Georg Hahn, Guillaume Chapuis, Guillaume Rizk, Hristo N. Djidjev","submitted_at":"2018-01-26T02:12:23Z","abstract_excerpt":"The recent availability of the first commercial quantum computers has provided a promising tool to tackle NP hard problems which can only be solved heuristically with present techniques. However, it is unclear if the current state of quantum computing already provides a quantum advantage over the current state of the art in classical computing. This article assesses the performance of the D-Wave 2X quantum annealer on two NP hard graph problems, in particular clique finding and graph partitioning. For this, we provide formulations as Qubo and Ising Hamiltonians suitable for the quantum anneale"},"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":"1801.08653","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-26T02:12:23Z","cross_cats_sorted":[],"title_canon_sha256":"604efa49271f9e54e3acb1db3b3fa0575c945646d11c5270615614126f4e19ce","abstract_canon_sha256":"44e252681a8fde16ce2034e143115f001f5d48677e0e7fd181c59994f565bdbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:41.697649Z","signature_b64":"2Uwj+FIWuBPBwt+Q09DfKbZRZZqkxyhmyPwg2N+Fh/5tVNS43FvATb7J/tzNqirWZVS1Kv8dlzEhXvdFTUiZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90b9b42c2ef4a1c941dfe340abfd01913b3e6cf809286f51387ba0eb8a4f3df5","last_reissued_at":"2026-05-18T00:24:41.697056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:41.697056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Combinatorial Optimization Using Quantum Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Georg Hahn, Guillaume Chapuis, Guillaume Rizk, Hristo N. Djidjev","submitted_at":"2018-01-26T02:12:23Z","abstract_excerpt":"The recent availability of the first commercial quantum computers has provided a promising tool to tackle NP hard problems which can only be solved heuristically with present techniques. However, it is unclear if the current state of quantum computing already provides a quantum advantage over the current state of the art in classical computing. This article assesses the performance of the D-Wave 2X quantum annealer on two NP hard graph problems, in particular clique finding and graph partitioning. For this, we provide formulations as Qubo and Ising Hamiltonians suitable for the quantum anneale"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08653","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1801.08653","created_at":"2026-05-18T00:24:41.697142+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.08653v2","created_at":"2026-05-18T00:24:41.697142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08653","created_at":"2026-05-18T00:24:41.697142+00:00"},{"alias_kind":"pith_short_12","alias_value":"SC43ILBO6SQ4","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"SC43ILBO6SQ4SQO7","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"SC43ILBO","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2409.07501","citing_title":"A compact QUBO encoding of computational logic formulae demonstrated on cryptography constructions","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15510","citing_title":"A QUBO Formulation Framework for Kinematic Structure-Based Robot Design Optimization: A Robotic Hand Case Study","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SC43ILBO6SQ4SQO74NAKX7IBSE","json":"https://pith.science/pith/SC43ILBO6SQ4SQO74NAKX7IBSE.json","graph_json":"https://pith.science/api/pith-number/SC43ILBO6SQ4SQO74NAKX7IBSE/graph.json","events_json":"https://pith.science/api/pith-number/SC43ILBO6SQ4SQO74NAKX7IBSE/events.json","paper":"https://pith.science/paper/SC43ILBO"},"agent_actions":{"view_html":"https://pith.science/pith/SC43ILBO6SQ4SQO74NAKX7IBSE","download_json":"https://pith.science/pith/SC43ILBO6SQ4SQO74NAKX7IBSE.json","view_paper":"https://pith.science/paper/SC43ILBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.08653&json=true","fetch_graph":"https://pith.science/api/pith-number/SC43ILBO6SQ4SQO74NAKX7IBSE/graph.json","fetch_events":"https://pith.science/api/pith-number/SC43ILBO6SQ4SQO74NAKX7IBSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SC43ILBO6SQ4SQO74NAKX7IBSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SC43ILBO6SQ4SQO74NAKX7IBSE/action/storage_attestation","attest_author":"https://pith.science/pith/SC43ILBO6SQ4SQO74NAKX7IBSE/action/author_attestation","sign_citation":"https://pith.science/pith/SC43ILBO6SQ4SQO74NAKX7IBSE/action/citation_signature","submit_replication":"https://pith.science/pith/SC43ILBO6SQ4SQO74NAKX7IBSE/action/replication_record"}},"created_at":"2026-05-18T00:24:41.697142+00:00","updated_at":"2026-05-18T00:24:41.697142+00:00"}