{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:67SOLY3OACGJ5EK5QFT7GC2NNE","short_pith_number":"pith:67SOLY3O","schema_version":"1.0","canonical_sha256":"f7e4e5e36e008c9e915d8167f30b4d6902f2b729486b197a3a4139270f2f1026","source":{"kind":"arxiv","id":"2110.02481","version":2},"attestation_state":"computed","paper":{"title":"Massively Parallel Probabilistic Computing with Sparse Ising Machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.DC"],"primary_cat":"cs.ET","authors_text":"Andrea Grimaldi, Giovanni Finocchio, John M. Martinis, Kerem Y. Camsari, Luke Theogarajan, Mario Carpentieri, Navid Anjum Aadit","submitted_at":"2021-10-06T03:25:39Z","abstract_excerpt":"Inspired by the developments in quantum computing, building domain-specific classical hardware to solve computationally hard problems has received increasing attention. Here, by introducing systematic sparsification techniques, we demonstrate a massively parallel architecture: the sparse Ising Machine (sIM). Exploiting sparsity, sIM achieves ideal parallelism: its key figure of merit - flips per second - scales linearly with the number of probabilistic bits (p-bit) in the system. This makes sIM up to 6 orders of magnitude faster than a CPU implementing standard Gibbs sampling. Compared to opti"},"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":"2110.02481","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2021-10-06T03:25:39Z","cross_cats_sorted":["cond-mat.dis-nn","cs.DC"],"title_canon_sha256":"b2c84d61cfca05ea74e2f862bb7d462767df5921783c6c21fdf4bc593730d870","abstract_canon_sha256":"052234b9849dd39470e2cf06de979130564c7be704db4315ca6664a1e83f5fed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:28.096494Z","signature_b64":"RGQxskbsN91M6Hc69CvYbw5uEdNl/CcoEN1FzYUj3T5CXPyeZ8QtwMiPwlcj2/aD5njRJrNo7kkgKuT3H+0+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7e4e5e36e008c9e915d8167f30b4d6902f2b729486b197a3a4139270f2f1026","last_reissued_at":"2026-07-05T04:28:28.095956Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:28.095956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Massively Parallel Probabilistic Computing with Sparse Ising Machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.DC"],"primary_cat":"cs.ET","authors_text":"Andrea Grimaldi, Giovanni Finocchio, John M. Martinis, Kerem Y. Camsari, Luke Theogarajan, Mario Carpentieri, Navid Anjum Aadit","submitted_at":"2021-10-06T03:25:39Z","abstract_excerpt":"Inspired by the developments in quantum computing, building domain-specific classical hardware to solve computationally hard problems has received increasing attention. Here, by introducing systematic sparsification techniques, we demonstrate a massively parallel architecture: the sparse Ising Machine (sIM). Exploiting sparsity, sIM achieves ideal parallelism: its key figure of merit - flips per second - scales linearly with the number of probabilistic bits (p-bit) in the system. This makes sIM up to 6 orders of magnitude faster than a CPU implementing standard Gibbs sampling. Compared to opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.02481","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/2110.02481/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":"2110.02481","created_at":"2026-07-05T04:28:28.096030+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.02481v2","created_at":"2026-07-05T04:28:28.096030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.02481","created_at":"2026-07-05T04:28:28.096030+00:00"},{"alias_kind":"pith_short_12","alias_value":"67SOLY3OACGJ","created_at":"2026-07-05T04:28:28.096030+00:00"},{"alias_kind":"pith_short_16","alias_value":"67SOLY3OACGJ5EK5","created_at":"2026-07-05T04:28:28.096030+00:00"},{"alias_kind":"pith_short_8","alias_value":"67SOLY3O","created_at":"2026-07-05T04:28:28.096030+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/67SOLY3OACGJ5EK5QFT7GC2NNE","json":"https://pith.science/pith/67SOLY3OACGJ5EK5QFT7GC2NNE.json","graph_json":"https://pith.science/api/pith-number/67SOLY3OACGJ5EK5QFT7GC2NNE/graph.json","events_json":"https://pith.science/api/pith-number/67SOLY3OACGJ5EK5QFT7GC2NNE/events.json","paper":"https://pith.science/paper/67SOLY3O"},"agent_actions":{"view_html":"https://pith.science/pith/67SOLY3OACGJ5EK5QFT7GC2NNE","download_json":"https://pith.science/pith/67SOLY3OACGJ5EK5QFT7GC2NNE.json","view_paper":"https://pith.science/paper/67SOLY3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.02481&json=true","fetch_graph":"https://pith.science/api/pith-number/67SOLY3OACGJ5EK5QFT7GC2NNE/graph.json","fetch_events":"https://pith.science/api/pith-number/67SOLY3OACGJ5EK5QFT7GC2NNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67SOLY3OACGJ5EK5QFT7GC2NNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67SOLY3OACGJ5EK5QFT7GC2NNE/action/storage_attestation","attest_author":"https://pith.science/pith/67SOLY3OACGJ5EK5QFT7GC2NNE/action/author_attestation","sign_citation":"https://pith.science/pith/67SOLY3OACGJ5EK5QFT7GC2NNE/action/citation_signature","submit_replication":"https://pith.science/pith/67SOLY3OACGJ5EK5QFT7GC2NNE/action/replication_record"}},"created_at":"2026-07-05T04:28:28.096030+00:00","updated_at":"2026-07-05T04:28:28.096030+00:00"}