{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VD2YXBBW3UM3LICAZICM3FNEYJ","short_pith_number":"pith:VD2YXBBW","schema_version":"1.0","canonical_sha256":"a8f58b8436dd19b5a040ca04cd95a4c26aff362dd119d9a36e21c4c860753cde","source":{"kind":"arxiv","id":"2311.05196","version":1},"attestation_state":"computed","paper":{"title":"Solving Combinatorial Optimization Problems on Fujitsu Digital Annealer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hsiu-Chuan Hsu, Jia-Le Liao, Yu-Ting Kao","submitted_at":"2023-11-09T08:20:50Z","abstract_excerpt":"Combinatorial optimization problems are ubiquitous in various disciplines and applications. Many heuristic algorithms have been devoted to solve these types of problems. In order to increase the efficiency for finding the optimal solutions, an application-specific hardware, called digital annealer (DA) has been developed for solving combinatorial optimization problems using quadratic unconstrained binary optimization (QUBO) formulations. In this study, we formulated the number partitioning problem and the graph partitioning problem into QUBO forms and solved such problems with the DA developed"},"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":"2311.05196","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-09T08:20:50Z","cross_cats_sorted":[],"title_canon_sha256":"0a7a21c29a2c7c5cde67e7cfbcafbb3c20f142881401cd57c30e603371151e06","abstract_canon_sha256":"9d17c0cdc9d87fc82f707f2885d104d7970ddc131747373977a652557c57f90d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:55.955194Z","signature_b64":"ZVC4xcN3Y2BteRHOx0GsayXWJNOyI8E1VGY77z76cq8poNc/JskrbnchXTKmv2jDbQYUGKnv4fBJz8Uk3ftJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8f58b8436dd19b5a040ca04cd95a4c26aff362dd119d9a36e21c4c860753cde","last_reissued_at":"2026-07-05T07:10:55.954786Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:55.954786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Combinatorial Optimization Problems on Fujitsu Digital Annealer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hsiu-Chuan Hsu, Jia-Le Liao, Yu-Ting Kao","submitted_at":"2023-11-09T08:20:50Z","abstract_excerpt":"Combinatorial optimization problems are ubiquitous in various disciplines and applications. Many heuristic algorithms have been devoted to solve these types of problems. In order to increase the efficiency for finding the optimal solutions, an application-specific hardware, called digital annealer (DA) has been developed for solving combinatorial optimization problems using quadratic unconstrained binary optimization (QUBO) formulations. In this study, we formulated the number partitioning problem and the graph partitioning problem into QUBO forms and solved such problems with the DA developed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.05196","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/2311.05196/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":"2311.05196","created_at":"2026-07-05T07:10:55.954840+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.05196v1","created_at":"2026-07-05T07:10:55.954840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.05196","created_at":"2026-07-05T07:10:55.954840+00:00"},{"alias_kind":"pith_short_12","alias_value":"VD2YXBBW3UM3","created_at":"2026-07-05T07:10:55.954840+00:00"},{"alias_kind":"pith_short_16","alias_value":"VD2YXBBW3UM3LICA","created_at":"2026-07-05T07:10:55.954840+00:00"},{"alias_kind":"pith_short_8","alias_value":"VD2YXBBW","created_at":"2026-07-05T07:10:55.954840+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.22117","citing_title":"A comprehensive benchmark of an Ising machine on the Max-Cut problem","ref_index":53,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VD2YXBBW3UM3LICAZICM3FNEYJ","json":"https://pith.science/pith/VD2YXBBW3UM3LICAZICM3FNEYJ.json","graph_json":"https://pith.science/api/pith-number/VD2YXBBW3UM3LICAZICM3FNEYJ/graph.json","events_json":"https://pith.science/api/pith-number/VD2YXBBW3UM3LICAZICM3FNEYJ/events.json","paper":"https://pith.science/paper/VD2YXBBW"},"agent_actions":{"view_html":"https://pith.science/pith/VD2YXBBW3UM3LICAZICM3FNEYJ","download_json":"https://pith.science/pith/VD2YXBBW3UM3LICAZICM3FNEYJ.json","view_paper":"https://pith.science/paper/VD2YXBBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.05196&json=true","fetch_graph":"https://pith.science/api/pith-number/VD2YXBBW3UM3LICAZICM3FNEYJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VD2YXBBW3UM3LICAZICM3FNEYJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VD2YXBBW3UM3LICAZICM3FNEYJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VD2YXBBW3UM3LICAZICM3FNEYJ/action/storage_attestation","attest_author":"https://pith.science/pith/VD2YXBBW3UM3LICAZICM3FNEYJ/action/author_attestation","sign_citation":"https://pith.science/pith/VD2YXBBW3UM3LICAZICM3FNEYJ/action/citation_signature","submit_replication":"https://pith.science/pith/VD2YXBBW3UM3LICAZICM3FNEYJ/action/replication_record"}},"created_at":"2026-07-05T07:10:55.954840+00:00","updated_at":"2026-07-05T07:10:55.954840+00:00"}