{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:K7SVJWKUCV4IWMQZWWGILGFGNP","short_pith_number":"pith:K7SVJWKU","schema_version":"1.0","canonical_sha256":"57e554d95415788b3219b58c8598a66bd72cc089f5166aaf302c3123cdeb3888","source":{"kind":"arxiv","id":"2601.09037","version":2},"attestation_state":"computed","paper":{"title":"Probabilistic Computers for MIMO Detection: From Sparsification to 2D Parallel Tempering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.DC"],"primary_cat":"cs.ET","authors_text":"Corentin Delacour, Kerem Y. Camsari, Kevin Callahan-Coray, M Mahmudul Hasan Sajeeb, Sanjay Seshan, Tathagata Srimani","submitted_at":"2026-01-14T00:01:58Z","abstract_excerpt":"Probabilistic computers built from p-bits offer a promising path for combinatorial optimization, but the dense connectivity required by real-world problems scales poorly in hardware. Here, we address this through graph sparsification with auxiliary copy variables and demonstrate two fully on-chip parallel tempering solvers on an FPGA. Targeting MIMO detection, a dense, NP-hard problem central to wireless communications, we first fit 11 temperature replicas of a 128-node sparsified system (1,408 p-bits) on-chip and achieve bit error rates significantly below conventional linear detectors on $64"},"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":"2601.09037","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2026-01-14T00:01:58Z","cross_cats_sorted":["cond-mat.dis-nn","cs.DC"],"title_canon_sha256":"60ce17c8275619aa744ffb4e20a5fbea908197747817314a8516c26ce36c991f","abstract_canon_sha256":"79a17fa00152b13f12b8509a386fb172c212b9792a4c4597a7f99a343582b78b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:40.834950Z","signature_b64":"tB17FMP2GGXbC8X/wjmeg72wXRgWBLJ4c3Rw6ugXSu5Ts5urAruJcEWnQDlh73KQib8ydmdkG6DOEoU5ySfsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57e554d95415788b3219b58c8598a66bd72cc089f5166aaf302c3123cdeb3888","last_reissued_at":"2026-06-02T01:03:40.834389Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:40.834389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Computers for MIMO Detection: From Sparsification to 2D Parallel Tempering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.DC"],"primary_cat":"cs.ET","authors_text":"Corentin Delacour, Kerem Y. Camsari, Kevin Callahan-Coray, M Mahmudul Hasan Sajeeb, Sanjay Seshan, Tathagata Srimani","submitted_at":"2026-01-14T00:01:58Z","abstract_excerpt":"Probabilistic computers built from p-bits offer a promising path for combinatorial optimization, but the dense connectivity required by real-world problems scales poorly in hardware. Here, we address this through graph sparsification with auxiliary copy variables and demonstrate two fully on-chip parallel tempering solvers on an FPGA. Targeting MIMO detection, a dense, NP-hard problem central to wireless communications, we first fit 11 temperature replicas of a 128-node sparsified system (1,408 p-bits) on-chip and achieve bit error rates significantly below conventional linear detectors on $64"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.09037","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/2601.09037/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":"2601.09037","created_at":"2026-06-02T01:03:40.834452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.09037v2","created_at":"2026-06-02T01:03:40.834452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.09037","created_at":"2026-06-02T01:03:40.834452+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7SVJWKUCV4I","created_at":"2026-06-02T01:03:40.834452+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7SVJWKUCV4IWMQZ","created_at":"2026-06-02T01:03:40.834452+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7SVJWKU","created_at":"2026-06-02T01:03:40.834452+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.11626","citing_title":"Performance of QUBO-Formulated MIMO Detection Under Hardware Precision Constraints","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K7SVJWKUCV4IWMQZWWGILGFGNP","json":"https://pith.science/pith/K7SVJWKUCV4IWMQZWWGILGFGNP.json","graph_json":"https://pith.science/api/pith-number/K7SVJWKUCV4IWMQZWWGILGFGNP/graph.json","events_json":"https://pith.science/api/pith-number/K7SVJWKUCV4IWMQZWWGILGFGNP/events.json","paper":"https://pith.science/paper/K7SVJWKU"},"agent_actions":{"view_html":"https://pith.science/pith/K7SVJWKUCV4IWMQZWWGILGFGNP","download_json":"https://pith.science/pith/K7SVJWKUCV4IWMQZWWGILGFGNP.json","view_paper":"https://pith.science/paper/K7SVJWKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.09037&json=true","fetch_graph":"https://pith.science/api/pith-number/K7SVJWKUCV4IWMQZWWGILGFGNP/graph.json","fetch_events":"https://pith.science/api/pith-number/K7SVJWKUCV4IWMQZWWGILGFGNP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7SVJWKUCV4IWMQZWWGILGFGNP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7SVJWKUCV4IWMQZWWGILGFGNP/action/storage_attestation","attest_author":"https://pith.science/pith/K7SVJWKUCV4IWMQZWWGILGFGNP/action/author_attestation","sign_citation":"https://pith.science/pith/K7SVJWKUCV4IWMQZWWGILGFGNP/action/citation_signature","submit_replication":"https://pith.science/pith/K7SVJWKUCV4IWMQZWWGILGFGNP/action/replication_record"}},"created_at":"2026-06-02T01:03:40.834452+00:00","updated_at":"2026-06-02T01:03:40.834452+00:00"}