{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DUQHGZEE2JYIK7RDYCZRFGQSWP","short_pith_number":"pith:DUQHGZEE","schema_version":"1.0","canonical_sha256":"1d20736484d270857e23c0b3129a12b3c3b00cc7bae4a36b9b5632bbfe6befa0","source":{"kind":"arxiv","id":"2504.06476","version":2},"attestation_state":"computed","paper":{"title":"Accelerating Hybrid XOR$-$CNF Boolean Satisfiability Problems Natively with In-Memory Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","math.OC"],"primary_cat":"cs.ET","authors_text":"Arne Heittmann, Chan-Woo Yang, Elisabetta Valiante, Fabian B\\\"ohm, Giacomo Pedretti, Haesol Im, Ignacio Rozada, Jim Ignowski, John Paul Strachan, Masoud Mohseni, Moslem Noori, Noriyuki Kushida, Ray Beausoleil, Thomas Van Vaerenbergh, Tinish Bhattacharya, Xiangyi Zhang, Xia Sheng","submitted_at":"2025-04-08T22:41:51Z","abstract_excerpt":"The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit design, and telecommunication, solutions can often be found more efficiently by representing them with a combination of exclusive OR (XOR) and conjunctive normal form (CNF) clauses. We propose a hardware accelerator architecture that natively embeds and solves such hybrid XOR--CNF problems using in-memory computing hardware. To achieve this, we introduce an algorithm and demonstrate, both experimentally and through simula"},"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":"2504.06476","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2025-04-08T22:41:51Z","cross_cats_sorted":["cs.AR","math.OC"],"title_canon_sha256":"24eb76cc09645af2da82ee087b1c4eb05ab1604a99af10b1c6b20d61a4b73680","abstract_canon_sha256":"49b42986359c41a20741c107064e31246d729a252a56c95fa00881aa13505194"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:19.047558Z","signature_b64":"hZB0cJgUcxTWEV1avlAN0Ks5yBOhMMKhK5qVTZSVm+/l+PjSk28YZsQXUh65FSG3zBM/ZEmXueLwXNVsFscVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d20736484d270857e23c0b3129a12b3c3b00cc7bae4a36b9b5632bbfe6befa0","last_reissued_at":"2026-05-20T00:00:19.046866Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:19.046866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Hybrid XOR$-$CNF Boolean Satisfiability Problems Natively with In-Memory Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","math.OC"],"primary_cat":"cs.ET","authors_text":"Arne Heittmann, Chan-Woo Yang, Elisabetta Valiante, Fabian B\\\"ohm, Giacomo Pedretti, Haesol Im, Ignacio Rozada, Jim Ignowski, John Paul Strachan, Masoud Mohseni, Moslem Noori, Noriyuki Kushida, Ray Beausoleil, Thomas Van Vaerenbergh, Tinish Bhattacharya, Xiangyi Zhang, Xia Sheng","submitted_at":"2025-04-08T22:41:51Z","abstract_excerpt":"The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit design, and telecommunication, solutions can often be found more efficiently by representing them with a combination of exclusive OR (XOR) and conjunctive normal form (CNF) clauses. We propose a hardware accelerator architecture that natively embeds and solves such hybrid XOR--CNF problems using in-memory computing hardware. To achieve this, we introduce an algorithm and demonstrate, both experimentally and through simula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.06476","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/2504.06476/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":"2504.06476","created_at":"2026-05-20T00:00:19.046987+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.06476v2","created_at":"2026-05-20T00:00:19.046987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.06476","created_at":"2026-05-20T00:00:19.046987+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUQHGZEE2JYI","created_at":"2026-05-20T00:00:19.046987+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUQHGZEE2JYIK7RD","created_at":"2026-05-20T00:00:19.046987+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUQHGZEE","created_at":"2026-05-20T00:00:19.046987+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2504.06476","citing_title":"Accelerating Hybrid XOR$-$CNF Boolean Satisfiability Problems Natively with In-Memory Computing","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2605.07627","citing_title":"A Unified Local Light-shifts Encoding For Solving Optimization Problems on a Rydberg Annealer","ref_index":63,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DUQHGZEE2JYIK7RDYCZRFGQSWP","json":"https://pith.science/pith/DUQHGZEE2JYIK7RDYCZRFGQSWP.json","graph_json":"https://pith.science/api/pith-number/DUQHGZEE2JYIK7RDYCZRFGQSWP/graph.json","events_json":"https://pith.science/api/pith-number/DUQHGZEE2JYIK7RDYCZRFGQSWP/events.json","paper":"https://pith.science/paper/DUQHGZEE"},"agent_actions":{"view_html":"https://pith.science/pith/DUQHGZEE2JYIK7RDYCZRFGQSWP","download_json":"https://pith.science/pith/DUQHGZEE2JYIK7RDYCZRFGQSWP.json","view_paper":"https://pith.science/paper/DUQHGZEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.06476&json=true","fetch_graph":"https://pith.science/api/pith-number/DUQHGZEE2JYIK7RDYCZRFGQSWP/graph.json","fetch_events":"https://pith.science/api/pith-number/DUQHGZEE2JYIK7RDYCZRFGQSWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUQHGZEE2JYIK7RDYCZRFGQSWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUQHGZEE2JYIK7RDYCZRFGQSWP/action/storage_attestation","attest_author":"https://pith.science/pith/DUQHGZEE2JYIK7RDYCZRFGQSWP/action/author_attestation","sign_citation":"https://pith.science/pith/DUQHGZEE2JYIK7RDYCZRFGQSWP/action/citation_signature","submit_replication":"https://pith.science/pith/DUQHGZEE2JYIK7RDYCZRFGQSWP/action/replication_record"}},"created_at":"2026-05-20T00:00:19.046987+00:00","updated_at":"2026-05-20T00:00:19.046987+00:00"}