{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CDPQSBHDZBCBENQ24HH5SWKGXB","short_pith_number":"pith:CDPQSBHD","schema_version":"1.0","canonical_sha256":"10df0904e3c84412361ae1cfd95946b87186b7791fe3ab102f266d6f65095726","source":{"kind":"arxiv","id":"2406.18130","version":1},"attestation_state":"computed","paper":{"title":"Designing Unit Ising Models for Logic Gate Simulation through Integer Linear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Koji Nakano, Shunsuke Tsukiyama, Takumi Kato, Xiaotian Li, Yasuaki Ito, Yuya Kawamata","submitted_at":"2024-06-26T07:31:19Z","abstract_excerpt":"An Ising model is defined by a quadratic objective function known as the Hamiltonian, composed of spin variables that can take values of either $-1$ or $+1$. The goal is to assign spin values to these variables in a way that minimizes the value of the Hamiltonian. Ising models are instrumental in tackling many combinatorial optimization problems, leading to significant research in developing solvers for them. Notably, D-Wave Systems has pioneered the creation of quantum annealers, programmable solvers based on quantum mechanics, for these models. This paper introduces unit Ising models, where "},"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":"2406.18130","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2024-06-26T07:31:19Z","cross_cats_sorted":[],"title_canon_sha256":"5a9e7a19a08d5c2f80f95bd42a3883b69d45ffb3a4043281654236144a5d39de","abstract_canon_sha256":"3960129ef948290a3b9a017e30f0c3e467bc31d5c75cecc9340bcd2caad4caee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:55.634159Z","signature_b64":"O6CXTBqOLJ03vfS1PLlD4adOdVzhLm6mjR37cEVeD3OAY64FNpF+a8Xb8ArGuPXhqHSwf7o3fghU+DsIRXRpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10df0904e3c84412361ae1cfd95946b87186b7791fe3ab102f266d6f65095726","last_reissued_at":"2026-07-05T08:36:55.633808Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:55.633808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Designing Unit Ising Models for Logic Gate Simulation through Integer Linear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Koji Nakano, Shunsuke Tsukiyama, Takumi Kato, Xiaotian Li, Yasuaki Ito, Yuya Kawamata","submitted_at":"2024-06-26T07:31:19Z","abstract_excerpt":"An Ising model is defined by a quadratic objective function known as the Hamiltonian, composed of spin variables that can take values of either $-1$ or $+1$. The goal is to assign spin values to these variables in a way that minimizes the value of the Hamiltonian. Ising models are instrumental in tackling many combinatorial optimization problems, leading to significant research in developing solvers for them. Notably, D-Wave Systems has pioneered the creation of quantum annealers, programmable solvers based on quantum mechanics, for these models. This paper introduces unit Ising models, where "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.18130","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/2406.18130/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":"2406.18130","created_at":"2026-07-05T08:36:55.633866+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.18130v1","created_at":"2026-07-05T08:36:55.633866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.18130","created_at":"2026-07-05T08:36:55.633866+00:00"},{"alias_kind":"pith_short_12","alias_value":"CDPQSBHDZBCB","created_at":"2026-07-05T08:36:55.633866+00:00"},{"alias_kind":"pith_short_16","alias_value":"CDPQSBHDZBCBENQ2","created_at":"2026-07-05T08:36:55.633866+00:00"},{"alias_kind":"pith_short_8","alias_value":"CDPQSBHD","created_at":"2026-07-05T08:36:55.633866+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.12626","citing_title":"Geometric Theory of Ising Machines","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CDPQSBHDZBCBENQ24HH5SWKGXB","json":"https://pith.science/pith/CDPQSBHDZBCBENQ24HH5SWKGXB.json","graph_json":"https://pith.science/api/pith-number/CDPQSBHDZBCBENQ24HH5SWKGXB/graph.json","events_json":"https://pith.science/api/pith-number/CDPQSBHDZBCBENQ24HH5SWKGXB/events.json","paper":"https://pith.science/paper/CDPQSBHD"},"agent_actions":{"view_html":"https://pith.science/pith/CDPQSBHDZBCBENQ24HH5SWKGXB","download_json":"https://pith.science/pith/CDPQSBHDZBCBENQ24HH5SWKGXB.json","view_paper":"https://pith.science/paper/CDPQSBHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.18130&json=true","fetch_graph":"https://pith.science/api/pith-number/CDPQSBHDZBCBENQ24HH5SWKGXB/graph.json","fetch_events":"https://pith.science/api/pith-number/CDPQSBHDZBCBENQ24HH5SWKGXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CDPQSBHDZBCBENQ24HH5SWKGXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CDPQSBHDZBCBENQ24HH5SWKGXB/action/storage_attestation","attest_author":"https://pith.science/pith/CDPQSBHDZBCBENQ24HH5SWKGXB/action/author_attestation","sign_citation":"https://pith.science/pith/CDPQSBHDZBCBENQ24HH5SWKGXB/action/citation_signature","submit_replication":"https://pith.science/pith/CDPQSBHDZBCBENQ24HH5SWKGXB/action/replication_record"}},"created_at":"2026-07-05T08:36:55.633866+00:00","updated_at":"2026-07-05T08:36:55.633866+00:00"}