{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GD2EHGZV4FXEUX6SX7WW7TKYSY","short_pith_number":"pith:GD2EHGZV","schema_version":"1.0","canonical_sha256":"30f4439b35e16e4a5fd2bfed6fcd589631e517285d4ff2fe042157359bc9526a","source":{"kind":"arxiv","id":"2605.12959","version":1},"attestation_state":"computed","paper":{"title":"A detailed algorithmic study on a reuse-aware, near memory, all-digital Ising machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Jaydeep P. Kulkarni, Lizy K. John, Siddhartha Raman Sundara Raman","submitted_at":"2026-05-13T03:46:42Z","abstract_excerpt":"Recently, nature-inspired computing approaches have gained significant attention for solving difficult optimization problems, particularly through Ising machines for NP-complete applications. Existing Ising accelerators range from quantum and optical annealers to CMOS-based von-Neumann and in-memory architectures. However, many prior designs are specialized accelerators limited to specific problem classes, rely on ADC/DAC circuits, and suffer from reliability challenges due to process-variation-sensitive embedded memory technologies.\n  This paper presents SACHI, an all-digital Ising architectu"},"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":"2605.12959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2026-05-13T03:46:42Z","cross_cats_sorted":[],"title_canon_sha256":"74b5272b9fe601bba9f13756b22715cba39599085014ba32b978d51112f254a9","abstract_canon_sha256":"b8f6470086f95f097168687eb235d0c78305dbcb0271a5f6cd027bf2e86bc82f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:09.216106Z","signature_b64":"LolUMlhnYHA5O1S0gExZxDyovxdMLW5YT2DuBTwfVzAWbInre3R3WlalBz8PGVwZf7hPbmUx1yad57aFJtttBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30f4439b35e16e4a5fd2bfed6fcd589631e517285d4ff2fe042157359bc9526a","last_reissued_at":"2026-05-18T03:09:09.215324Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:09.215324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A detailed algorithmic study on a reuse-aware, near memory, all-digital Ising machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Jaydeep P. Kulkarni, Lizy K. John, Siddhartha Raman Sundara Raman","submitted_at":"2026-05-13T03:46:42Z","abstract_excerpt":"Recently, nature-inspired computing approaches have gained significant attention for solving difficult optimization problems, particularly through Ising machines for NP-complete applications. Existing Ising accelerators range from quantum and optical annealers to CMOS-based von-Neumann and in-memory architectures. However, many prior designs are specialized accelerators limited to specific problem classes, rely on ADC/DAC circuits, and suffer from reliability challenges due to process-variation-sensitive embedded memory technologies.\n  This paper presents SACHI, an all-digital Ising architectu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.12959","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":""},"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":"2605.12959","created_at":"2026-05-18T03:09:09.215457+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.12959v1","created_at":"2026-05-18T03:09:09.215457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12959","created_at":"2026-05-18T03:09:09.215457+00:00"},{"alias_kind":"pith_short_12","alias_value":"GD2EHGZV4FXE","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"GD2EHGZV4FXEUX6S","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"GD2EHGZV","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.21912","citing_title":"Emerging memory technologies at room/cryogenic temperature","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17158","citing_title":"A comprehensive study on ILP acceleration accounting for sparsity, area, energy, data movement using near-memory architecture","ref_index":53,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19405","citing_title":"A complete discussion on fully reconfigurable, digital, scalable, graph and sparsity-aware near-memory accelerator for graph neural networks","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GD2EHGZV4FXEUX6SX7WW7TKYSY","json":"https://pith.science/pith/GD2EHGZV4FXEUX6SX7WW7TKYSY.json","graph_json":"https://pith.science/api/pith-number/GD2EHGZV4FXEUX6SX7WW7TKYSY/graph.json","events_json":"https://pith.science/api/pith-number/GD2EHGZV4FXEUX6SX7WW7TKYSY/events.json","paper":"https://pith.science/paper/GD2EHGZV"},"agent_actions":{"view_html":"https://pith.science/pith/GD2EHGZV4FXEUX6SX7WW7TKYSY","download_json":"https://pith.science/pith/GD2EHGZV4FXEUX6SX7WW7TKYSY.json","view_paper":"https://pith.science/paper/GD2EHGZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.12959&json=true","fetch_graph":"https://pith.science/api/pith-number/GD2EHGZV4FXEUX6SX7WW7TKYSY/graph.json","fetch_events":"https://pith.science/api/pith-number/GD2EHGZV4FXEUX6SX7WW7TKYSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GD2EHGZV4FXEUX6SX7WW7TKYSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GD2EHGZV4FXEUX6SX7WW7TKYSY/action/storage_attestation","attest_author":"https://pith.science/pith/GD2EHGZV4FXEUX6SX7WW7TKYSY/action/author_attestation","sign_citation":"https://pith.science/pith/GD2EHGZV4FXEUX6SX7WW7TKYSY/action/citation_signature","submit_replication":"https://pith.science/pith/GD2EHGZV4FXEUX6SX7WW7TKYSY/action/replication_record"}},"created_at":"2026-05-18T03:09:09.215457+00:00","updated_at":"2026-05-18T03:09:09.215457+00:00"}