{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VYLSMNUBFL57RMEG5C6TXIPGAE","short_pith_number":"pith:VYLSMNUB","schema_version":"1.0","canonical_sha256":"ae172636812afbf8b086e8bd3ba1e6011812e36d264a5292b035673f98018fe9","source":{"kind":"arxiv","id":"2306.11572","version":1},"attestation_state":"computed","paper":{"title":"Energy-efficient superparamagnetic Ising machine and its application to traveling salesman problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other","physics.app-ph"],"primary_cat":"cs.ET","authors_text":"Dong-Jun Kim, Hyunsoo Yang, Jerald Yoo, Jiaer Chen, Jia Si, Kaiming Cai, Shuhan Yang, Xuanyao Fong, Yunuo Cen, Zhaoyang Yao","submitted_at":"2023-06-20T14:40:34Z","abstract_excerpt":"The growth of artificial intelligence and IoT has created a significant computational load for solving non-deterministic polynomial-time (NP)-hard problems, which are difficult to solve using conventional computers. The Ising computer, based on the Ising model and annealing process, has been highly sought for finding approximate solutions to NP-hard problems by observing the convergence of dynamic spin states. However, it faces several challenges, including high power consumption due to artificial spins and randomness emulated by complex circuits, as well as low scalability caused by the rapid"},"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":"2306.11572","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2023-06-20T14:40:34Z","cross_cats_sorted":["cond-mat.other","physics.app-ph"],"title_canon_sha256":"2f114eca4783b668ab1ce5e99ecf14243f61927bcd290274563bf6808abc3f3c","abstract_canon_sha256":"dab1f0130864b054e058e36cfca867d4c711b2a59879340307ebd76ecf6610ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:22:21.351801Z","signature_b64":"1J0c86FQrexV+IdxXtDlD5QBmRSteS2IvS7H/Q7Rpu1TnebwWfDsq1QRT+u3wtoMApK66xf8b5iHtiJkpKOTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae172636812afbf8b086e8bd3ba1e6011812e36d264a5292b035673f98018fe9","last_reissued_at":"2026-07-05T06:22:21.351367Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:22:21.351367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Energy-efficient superparamagnetic Ising machine and its application to traveling salesman problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other","physics.app-ph"],"primary_cat":"cs.ET","authors_text":"Dong-Jun Kim, Hyunsoo Yang, Jerald Yoo, Jiaer Chen, Jia Si, Kaiming Cai, Shuhan Yang, Xuanyao Fong, Yunuo Cen, Zhaoyang Yao","submitted_at":"2023-06-20T14:40:34Z","abstract_excerpt":"The growth of artificial intelligence and IoT has created a significant computational load for solving non-deterministic polynomial-time (NP)-hard problems, which are difficult to solve using conventional computers. The Ising computer, based on the Ising model and annealing process, has been highly sought for finding approximate solutions to NP-hard problems by observing the convergence of dynamic spin states. However, it faces several challenges, including high power consumption due to artificial spins and randomness emulated by complex circuits, as well as low scalability caused by the rapid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.11572","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/2306.11572/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":"2306.11572","created_at":"2026-07-05T06:22:21.351424+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.11572v1","created_at":"2026-07-05T06:22:21.351424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.11572","created_at":"2026-07-05T06:22:21.351424+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYLSMNUBFL57","created_at":"2026-07-05T06:22:21.351424+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYLSMNUBFL57RMEG","created_at":"2026-07-05T06:22:21.351424+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYLSMNUB","created_at":"2026-07-05T06:22:21.351424+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.10317","citing_title":"Sampling from exponential distributions in the time domain with superparamagnetic tunnel junctions","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VYLSMNUBFL57RMEG5C6TXIPGAE","json":"https://pith.science/pith/VYLSMNUBFL57RMEG5C6TXIPGAE.json","graph_json":"https://pith.science/api/pith-number/VYLSMNUBFL57RMEG5C6TXIPGAE/graph.json","events_json":"https://pith.science/api/pith-number/VYLSMNUBFL57RMEG5C6TXIPGAE/events.json","paper":"https://pith.science/paper/VYLSMNUB"},"agent_actions":{"view_html":"https://pith.science/pith/VYLSMNUBFL57RMEG5C6TXIPGAE","download_json":"https://pith.science/pith/VYLSMNUBFL57RMEG5C6TXIPGAE.json","view_paper":"https://pith.science/paper/VYLSMNUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.11572&json=true","fetch_graph":"https://pith.science/api/pith-number/VYLSMNUBFL57RMEG5C6TXIPGAE/graph.json","fetch_events":"https://pith.science/api/pith-number/VYLSMNUBFL57RMEG5C6TXIPGAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYLSMNUBFL57RMEG5C6TXIPGAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYLSMNUBFL57RMEG5C6TXIPGAE/action/storage_attestation","attest_author":"https://pith.science/pith/VYLSMNUBFL57RMEG5C6TXIPGAE/action/author_attestation","sign_citation":"https://pith.science/pith/VYLSMNUBFL57RMEG5C6TXIPGAE/action/citation_signature","submit_replication":"https://pith.science/pith/VYLSMNUBFL57RMEG5C6TXIPGAE/action/replication_record"}},"created_at":"2026-07-05T06:22:21.351424+00:00","updated_at":"2026-07-05T06:22:21.351424+00:00"}