{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JCJ4PNCBVYMIFELVOB76LAKHP6","short_pith_number":"pith:JCJ4PNCB","schema_version":"1.0","canonical_sha256":"4893c7b441ae18829175707fe581477fb7b00a84860efe92ffdc8abb73a350da","source":{"kind":"arxiv","id":"2606.25313","version":1},"attestation_state":"computed","paper":{"title":"Programmable Probabilistic Computer with 1,000,000 p-bits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.DC","authors_text":"Andrew Seawright, Clayton Thomas, Forrest Brewer, Jason Twigg, Kerem Y. Camsari, Kevin Callahan-Coray, Kyle Lee, Navid Anjum Aadit, Saleh Bunaiyan, Sanjay Seshan, Shuvro Chowdhury, Tathagata Srimani, Xiuqi Zhang","submitted_at":"2026-06-24T02:26:33Z","abstract_excerpt":"Probabilistic computers built from p-bits have been proposed as hardware accelerators for sampling and optimizing Ising models, but existing systems have been confined to a single chip, capped by its capacity and memory bandwidth. Here we break this limit by networking FPGAs into a single Ising machine far larger than any one device could hold, realizing a programmable probabilistic computer with one million p-bits. The machine performs Gibbs sampling at over a trillion flips per second while keeping every coupling weight in local on-chip memory. During execution, devices exchange nothing but "},"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":"2606.25313","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-24T02:26:33Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"59f6dae6edd1feeefb8ca4bd95163323e2e342db9c0ef8086d5c8a4490759293","abstract_canon_sha256":"618aa5eb84548c80a7f0a15181e9f00b2cf4939f694b61b11df0e5128bae8c96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:18:01.782559Z","signature_b64":"yKG3xv5O/llcIBr4Ov52LXffSZe4U6Mz4kTDLntQPU7J3rW1TUAE70nD/opPuL7WlQYLVsiBgeEEAkemNahjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4893c7b441ae18829175707fe581477fb7b00a84860efe92ffdc8abb73a350da","last_reissued_at":"2026-06-25T01:18:01.782133Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:18:01.782133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Programmable Probabilistic Computer with 1,000,000 p-bits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.DC","authors_text":"Andrew Seawright, Clayton Thomas, Forrest Brewer, Jason Twigg, Kerem Y. Camsari, Kevin Callahan-Coray, Kyle Lee, Navid Anjum Aadit, Saleh Bunaiyan, Sanjay Seshan, Shuvro Chowdhury, Tathagata Srimani, Xiuqi Zhang","submitted_at":"2026-06-24T02:26:33Z","abstract_excerpt":"Probabilistic computers built from p-bits have been proposed as hardware accelerators for sampling and optimizing Ising models, but existing systems have been confined to a single chip, capped by its capacity and memory bandwidth. Here we break this limit by networking FPGAs into a single Ising machine far larger than any one device could hold, realizing a programmable probabilistic computer with one million p-bits. The machine performs Gibbs sampling at over a trillion flips per second while keeping every coupling weight in local on-chip memory. During execution, devices exchange nothing but "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25313","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/2606.25313/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":"2606.25313","created_at":"2026-06-25T01:18:01.782198+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.25313v1","created_at":"2026-06-25T01:18:01.782198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25313","created_at":"2026-06-25T01:18:01.782198+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCJ4PNCBVYMI","created_at":"2026-06-25T01:18:01.782198+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCJ4PNCBVYMIFELV","created_at":"2026-06-25T01:18:01.782198+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCJ4PNCB","created_at":"2026-06-25T01:18:01.782198+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/JCJ4PNCBVYMIFELVOB76LAKHP6","json":"https://pith.science/pith/JCJ4PNCBVYMIFELVOB76LAKHP6.json","graph_json":"https://pith.science/api/pith-number/JCJ4PNCBVYMIFELVOB76LAKHP6/graph.json","events_json":"https://pith.science/api/pith-number/JCJ4PNCBVYMIFELVOB76LAKHP6/events.json","paper":"https://pith.science/paper/JCJ4PNCB"},"agent_actions":{"view_html":"https://pith.science/pith/JCJ4PNCBVYMIFELVOB76LAKHP6","download_json":"https://pith.science/pith/JCJ4PNCBVYMIFELVOB76LAKHP6.json","view_paper":"https://pith.science/paper/JCJ4PNCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.25313&json=true","fetch_graph":"https://pith.science/api/pith-number/JCJ4PNCBVYMIFELVOB76LAKHP6/graph.json","fetch_events":"https://pith.science/api/pith-number/JCJ4PNCBVYMIFELVOB76LAKHP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCJ4PNCBVYMIFELVOB76LAKHP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCJ4PNCBVYMIFELVOB76LAKHP6/action/storage_attestation","attest_author":"https://pith.science/pith/JCJ4PNCBVYMIFELVOB76LAKHP6/action/author_attestation","sign_citation":"https://pith.science/pith/JCJ4PNCBVYMIFELVOB76LAKHP6/action/citation_signature","submit_replication":"https://pith.science/pith/JCJ4PNCBVYMIFELVOB76LAKHP6/action/replication_record"}},"created_at":"2026-06-25T01:18:01.782198+00:00","updated_at":"2026-06-25T01:18:01.782198+00:00"}