{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VH5B5IUBLLISBGQ3PKUTWAVUJO","short_pith_number":"pith:VH5B5IUB","schema_version":"1.0","canonical_sha256":"a9fa1ea2815ad1209a1b7aa93b02b44bb179ede20845444a0491eb40f4eeaca7","source":{"kind":"arxiv","id":"2312.08748","version":3},"attestation_state":"computed","paper":{"title":"All-to-all reconfigurability with sparse and higher-order Ising machines","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.ET","cs.NE","quant-ph"],"primary_cat":"cs.DC","authors_text":"Kerem Y. Camsari, Navid Anjum Aadit, Shuvro Chowdhury, Sidharth Kannan, Srijan Nikhar","submitted_at":"2023-11-21T20:27:02Z","abstract_excerpt":"Domain-specific hardware to solve computationally hard optimization problems has generated tremendous excitement. Here, we evaluate probabilistic bit (p-bit) based Ising Machines (IM) on the 3-regular 3-Exclusive OR Satisfiability (3R3X), as a representative hard optimization problem. We first introduce a multiplexed architecture that emulates all-to-all network functionality while maintaining highly parallelized chromatic Gibbs sampling. We implement this architecture in single Field-Programmable Gate Arrays (FPGA) and show that running the adaptive parallel tempering algorithm demonstrates c"},"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":"2312.08748","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2023-11-21T20:27:02Z","cross_cats_sorted":["cs.ET","cs.NE","quant-ph"],"title_canon_sha256":"d272fb9b19126bf470350affd7442729a1f1d123f0f8cac976976d507cc91118","abstract_canon_sha256":"6d5eaee16ef229ed1b09bd6a735cfbc3a0f69a6ebd9c96eb328f09f819a68b69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:15.162685Z","signature_b64":"FWfIGMrjQdG42UVUull2ITAL60W/+8x/GXNdj0u86z60U5s6BR/GgNmFom3fXCr5825AanPqbitEAIhpx+BnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9fa1ea2815ad1209a1b7aa93b02b44bb179ede20845444a0491eb40f4eeaca7","last_reissued_at":"2026-07-05T09:22:15.162183Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:15.162183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All-to-all reconfigurability with sparse and higher-order Ising machines","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.ET","cs.NE","quant-ph"],"primary_cat":"cs.DC","authors_text":"Kerem Y. Camsari, Navid Anjum Aadit, Shuvro Chowdhury, Sidharth Kannan, Srijan Nikhar","submitted_at":"2023-11-21T20:27:02Z","abstract_excerpt":"Domain-specific hardware to solve computationally hard optimization problems has generated tremendous excitement. Here, we evaluate probabilistic bit (p-bit) based Ising Machines (IM) on the 3-regular 3-Exclusive OR Satisfiability (3R3X), as a representative hard optimization problem. We first introduce a multiplexed architecture that emulates all-to-all network functionality while maintaining highly parallelized chromatic Gibbs sampling. We implement this architecture in single Field-Programmable Gate Arrays (FPGA) and show that running the adaptive parallel tempering algorithm demonstrates c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.08748","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/2312.08748/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":"2312.08748","created_at":"2026-07-05T09:22:15.162250+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.08748v3","created_at":"2026-07-05T09:22:15.162250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.08748","created_at":"2026-07-05T09:22:15.162250+00:00"},{"alias_kind":"pith_short_12","alias_value":"VH5B5IUBLLIS","created_at":"2026-07-05T09:22:15.162250+00:00"},{"alias_kind":"pith_short_16","alias_value":"VH5B5IUBLLISBGQ3","created_at":"2026-07-05T09:22:15.162250+00:00"},{"alias_kind":"pith_short_8","alias_value":"VH5B5IUB","created_at":"2026-07-05T09:22:15.162250+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/VH5B5IUBLLISBGQ3PKUTWAVUJO","json":"https://pith.science/pith/VH5B5IUBLLISBGQ3PKUTWAVUJO.json","graph_json":"https://pith.science/api/pith-number/VH5B5IUBLLISBGQ3PKUTWAVUJO/graph.json","events_json":"https://pith.science/api/pith-number/VH5B5IUBLLISBGQ3PKUTWAVUJO/events.json","paper":"https://pith.science/paper/VH5B5IUB"},"agent_actions":{"view_html":"https://pith.science/pith/VH5B5IUBLLISBGQ3PKUTWAVUJO","download_json":"https://pith.science/pith/VH5B5IUBLLISBGQ3PKUTWAVUJO.json","view_paper":"https://pith.science/paper/VH5B5IUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.08748&json=true","fetch_graph":"https://pith.science/api/pith-number/VH5B5IUBLLISBGQ3PKUTWAVUJO/graph.json","fetch_events":"https://pith.science/api/pith-number/VH5B5IUBLLISBGQ3PKUTWAVUJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VH5B5IUBLLISBGQ3PKUTWAVUJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VH5B5IUBLLISBGQ3PKUTWAVUJO/action/storage_attestation","attest_author":"https://pith.science/pith/VH5B5IUBLLISBGQ3PKUTWAVUJO/action/author_attestation","sign_citation":"https://pith.science/pith/VH5B5IUBLLISBGQ3PKUTWAVUJO/action/citation_signature","submit_replication":"https://pith.science/pith/VH5B5IUBLLISBGQ3PKUTWAVUJO/action/replication_record"}},"created_at":"2026-07-05T09:22:15.162250+00:00","updated_at":"2026-07-05T09:22:15.162250+00:00"}