{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:M3UYOVNUWWAW6CEFWUPSF5R3RO","short_pith_number":"pith:M3UYOVNU","schema_version":"1.0","canonical_sha256":"66e98755b4b5816f0885b51f22f63b8ba55b4d83f2efb4be650a4796f4bc1fe0","source":{"kind":"arxiv","id":"2410.11198","version":2},"attestation_state":"computed","paper":{"title":"Performance of Domain-Wall Encoding in Digital Ising Machine","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Kotaro Takahashi, Shuta Kikuchi, Shu Tanaka","submitted_at":"2024-10-15T02:30:31Z","abstract_excerpt":"To tackle combinatorial optimization problems using an Ising machine, the objective function and constraints must be mapped onto a quadratic unconstrained binary optimization (QUBO) model. While QUBO involves binary variables, combinatorial optimization problems frequently include integer variables, which require encoding by binary variables. This process, known as binary-integer encoding, includes various methods, one of which is domain-wall encoding - a recently proposed approach. Experiments on a quantum annealing machine have demonstrated that domain-wall encoding outperforms the commonly "},"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":"2410.11198","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2024-10-15T02:30:31Z","cross_cats_sorted":[],"title_canon_sha256":"5afcd96179e584e06ece5366e52cf9018ec4f0a313a6bafee4c5dd653c7a27d9","abstract_canon_sha256":"2d113306572918b46c9b7173558a8f230856c2cc55ba315db70181bf66d7dc0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:02:24.832795Z","signature_b64":"yIBTHuOzQQGJTk1p2stm+TIzBNEMizl8x+0PVblF6/g4o5Fzvfdcgyf4HQnlxb4kuhXeFloKBAoFAA2oZrfyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66e98755b4b5816f0885b51f22f63b8ba55b4d83f2efb4be650a4796f4bc1fe0","last_reissued_at":"2026-07-05T10:02:24.832388Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:02:24.832388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance of Domain-Wall Encoding in Digital Ising Machine","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Kotaro Takahashi, Shuta Kikuchi, Shu Tanaka","submitted_at":"2024-10-15T02:30:31Z","abstract_excerpt":"To tackle combinatorial optimization problems using an Ising machine, the objective function and constraints must be mapped onto a quadratic unconstrained binary optimization (QUBO) model. While QUBO involves binary variables, combinatorial optimization problems frequently include integer variables, which require encoding by binary variables. This process, known as binary-integer encoding, includes various methods, one of which is domain-wall encoding - a recently proposed approach. Experiments on a quantum annealing machine have demonstrated that domain-wall encoding outperforms the commonly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.11198","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.11198/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":"2410.11198","created_at":"2026-07-05T10:02:24.832445+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.11198v2","created_at":"2026-07-05T10:02:24.832445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.11198","created_at":"2026-07-05T10:02:24.832445+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3UYOVNUWWAW","created_at":"2026-07-05T10:02:24.832445+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3UYOVNUWWAW6CEF","created_at":"2026-07-05T10:02:24.832445+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3UYOVNU","created_at":"2026-07-05T10:02:24.832445+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23188","citing_title":"Stage-dependent integer-binary encoding in factorization-machine black-box optimization","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M3UYOVNUWWAW6CEFWUPSF5R3RO","json":"https://pith.science/pith/M3UYOVNUWWAW6CEFWUPSF5R3RO.json","graph_json":"https://pith.science/api/pith-number/M3UYOVNUWWAW6CEFWUPSF5R3RO/graph.json","events_json":"https://pith.science/api/pith-number/M3UYOVNUWWAW6CEFWUPSF5R3RO/events.json","paper":"https://pith.science/paper/M3UYOVNU"},"agent_actions":{"view_html":"https://pith.science/pith/M3UYOVNUWWAW6CEFWUPSF5R3RO","download_json":"https://pith.science/pith/M3UYOVNUWWAW6CEFWUPSF5R3RO.json","view_paper":"https://pith.science/paper/M3UYOVNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.11198&json=true","fetch_graph":"https://pith.science/api/pith-number/M3UYOVNUWWAW6CEFWUPSF5R3RO/graph.json","fetch_events":"https://pith.science/api/pith-number/M3UYOVNUWWAW6CEFWUPSF5R3RO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3UYOVNUWWAW6CEFWUPSF5R3RO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3UYOVNUWWAW6CEFWUPSF5R3RO/action/storage_attestation","attest_author":"https://pith.science/pith/M3UYOVNUWWAW6CEFWUPSF5R3RO/action/author_attestation","sign_citation":"https://pith.science/pith/M3UYOVNUWWAW6CEFWUPSF5R3RO/action/citation_signature","submit_replication":"https://pith.science/pith/M3UYOVNUWWAW6CEFWUPSF5R3RO/action/replication_record"}},"created_at":"2026-07-05T10:02:24.832445+00:00","updated_at":"2026-07-05T10:02:24.832445+00:00"}