{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:X43YLHD4N5BIKJBKXN4QTE43OO","short_pith_number":"pith:X43YLHD4","schema_version":"1.0","canonical_sha256":"bf37859c7c6f4285242abb7909939b73bbf6d7b924299c5e560a3bffaae283c6","source":{"kind":"arxiv","id":"2503.01177","version":3},"attestation_state":"computed","paper":{"title":"Scalable Connectivity for Ising Machines: Dense to Sparse","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.ET","authors_text":"Atharva Raut, Cesely Smith, Corentin Delacour, Dhruv Chinmay, Kerem Y. Camsari, M Mahmudul Hasan Sajeeb, Navid Anjum Aadit, Shuvro Chowdhury, Tathagata Srimani, Tong Wu","submitted_at":"2025-03-03T04:50:53Z","abstract_excerpt":"In recent years, hardware implementations of Ising machines have emerged as a viable alternative to quantum computing for solving hard optimization problems among other applications. Unlike quantum hardware, dense connectivity can be achieved in classical systems. However, we show that dense connectivity leads to severe frequency slowdowns and interconnect congestion scaling unfavorably with system sizes. As a scalable solution, we propose a systematic sparsification method for dense graphs by introducing copy nodes to limit the number of neighbors per graph node. In addition to solving interc"},"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":"2503.01177","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.ET","submitted_at":"2025-03-03T04:50:53Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"2835025d40e7fc63256401e92cf082ed8c0548adfbfd9ed352adfef49ca75c9c","abstract_canon_sha256":"9f355b9d25c8847b316c72c1fbaba8cdf425bdf41f3ffbab2f73bdd9af706d61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:27.792521Z","signature_b64":"HYXEkFNW4Ds1EqYDNK4M3YXlvTIHGH8/wLM6nlAWMCk1+wYQmX6WNhGI5e0phquW5DrXEB3Yp7LowcYblF90Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf37859c7c6f4285242abb7909939b73bbf6d7b924299c5e560a3bffaae283c6","last_reissued_at":"2026-07-05T11:14:27.792045Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:27.792045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Connectivity for Ising Machines: Dense to Sparse","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.ET","authors_text":"Atharva Raut, Cesely Smith, Corentin Delacour, Dhruv Chinmay, Kerem Y. Camsari, M Mahmudul Hasan Sajeeb, Navid Anjum Aadit, Shuvro Chowdhury, Tathagata Srimani, Tong Wu","submitted_at":"2025-03-03T04:50:53Z","abstract_excerpt":"In recent years, hardware implementations of Ising machines have emerged as a viable alternative to quantum computing for solving hard optimization problems among other applications. Unlike quantum hardware, dense connectivity can be achieved in classical systems. However, we show that dense connectivity leads to severe frequency slowdowns and interconnect congestion scaling unfavorably with system sizes. As a scalable solution, we propose a systematic sparsification method for dense graphs by introducing copy nodes to limit the number of neighbors per graph node. In addition to solving interc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.01177","kind":"arxiv","version":3},"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/2503.01177/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":"2503.01177","created_at":"2026-07-05T11:14:27.792100+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.01177v3","created_at":"2026-07-05T11:14:27.792100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01177","created_at":"2026-07-05T11:14:27.792100+00:00"},{"alias_kind":"pith_short_12","alias_value":"X43YLHD4N5BI","created_at":"2026-07-05T11:14:27.792100+00:00"},{"alias_kind":"pith_short_16","alias_value":"X43YLHD4N5BIKJBK","created_at":"2026-07-05T11:14:27.792100+00:00"},{"alias_kind":"pith_short_8","alias_value":"X43YLHD4","created_at":"2026-07-05T11:14:27.792100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18508","citing_title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X43YLHD4N5BIKJBKXN4QTE43OO","json":"https://pith.science/pith/X43YLHD4N5BIKJBKXN4QTE43OO.json","graph_json":"https://pith.science/api/pith-number/X43YLHD4N5BIKJBKXN4QTE43OO/graph.json","events_json":"https://pith.science/api/pith-number/X43YLHD4N5BIKJBKXN4QTE43OO/events.json","paper":"https://pith.science/paper/X43YLHD4"},"agent_actions":{"view_html":"https://pith.science/pith/X43YLHD4N5BIKJBKXN4QTE43OO","download_json":"https://pith.science/pith/X43YLHD4N5BIKJBKXN4QTE43OO.json","view_paper":"https://pith.science/paper/X43YLHD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.01177&json=true","fetch_graph":"https://pith.science/api/pith-number/X43YLHD4N5BIKJBKXN4QTE43OO/graph.json","fetch_events":"https://pith.science/api/pith-number/X43YLHD4N5BIKJBKXN4QTE43OO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X43YLHD4N5BIKJBKXN4QTE43OO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X43YLHD4N5BIKJBKXN4QTE43OO/action/storage_attestation","attest_author":"https://pith.science/pith/X43YLHD4N5BIKJBKXN4QTE43OO/action/author_attestation","sign_citation":"https://pith.science/pith/X43YLHD4N5BIKJBKXN4QTE43OO/action/citation_signature","submit_replication":"https://pith.science/pith/X43YLHD4N5BIKJBKXN4QTE43OO/action/replication_record"}},"created_at":"2026-07-05T11:14:27.792100+00:00","updated_at":"2026-07-05T11:14:27.792100+00:00"}