{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Y5K6FD3WNVHZCDFFGSPELNW6V2","short_pith_number":"pith:Y5K6FD3W","schema_version":"1.0","canonical_sha256":"c755e28f766d4f910ca5349e45b6deae875009bd1a3649997f9e54376c27e3f7","source":{"kind":"arxiv","id":"2411.01028","version":1},"attestation_state":"computed","paper":{"title":"SKI-SAT: A CMOS-compatible Hardware for Solving SAT Problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmet Yusuf Salim, Bart Selman, Henry Kautz, Sel\\c{c}uk K\\\"ose, Zeljko Ignjatovic","submitted_at":"2024-11-01T20:59:51Z","abstract_excerpt":"Nature-inspired computation is receiving increasing attention. Various Ising machine implementations have recently been proven to be effective in solving numerous combinatorial optimization problems including maximum cut, low density parity check (LDPC) decoding, and Boolean satisfiability (SAT) problems. In this paper, a novel method is presented to solve SAT or MAX-SAT problems with a CMOS circuit implementation. The technique solves a SAT problem by mapping the SAT variables onto quantized capacitor voltages generated by an array of nodes that interact through a network of coupling units. T"},"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":"2411.01028","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-01T20:59:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"da793572b405cd75f93200d4f54ebd9a0b8065cc0acf34ed4c08d8fb28cd91c7","abstract_canon_sha256":"0f12131233bfadd5c873c9c1450fb7d49f1373edab3db53ac734ebc34c442536"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:54.415877Z","signature_b64":"zWySIv338wdgXe5eUgvero8TKiuS/BBAjFd8RPTVulcx/QiVrUG29bEAk9fGdid7VR9FtEc2KqIUSsK5JlX+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c755e28f766d4f910ca5349e45b6deae875009bd1a3649997f9e54376c27e3f7","last_reissued_at":"2026-07-05T09:29:54.415368Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:54.415368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SKI-SAT: A CMOS-compatible Hardware for Solving SAT Problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmet Yusuf Salim, Bart Selman, Henry Kautz, Sel\\c{c}uk K\\\"ose, Zeljko Ignjatovic","submitted_at":"2024-11-01T20:59:51Z","abstract_excerpt":"Nature-inspired computation is receiving increasing attention. Various Ising machine implementations have recently been proven to be effective in solving numerous combinatorial optimization problems including maximum cut, low density parity check (LDPC) decoding, and Boolean satisfiability (SAT) problems. In this paper, a novel method is presented to solve SAT or MAX-SAT problems with a CMOS circuit implementation. The technique solves a SAT problem by mapping the SAT variables onto quantized capacitor voltages generated by an array of nodes that interact through a network of coupling units. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.01028","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/2411.01028/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":"2411.01028","created_at":"2026-07-05T09:29:54.415428+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.01028v1","created_at":"2026-07-05T09:29:54.415428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01028","created_at":"2026-07-05T09:29:54.415428+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5K6FD3WNVHZ","created_at":"2026-07-05T09:29:54.415428+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5K6FD3WNVHZCDFF","created_at":"2026-07-05T09:29:54.415428+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5K6FD3W","created_at":"2026-07-05T09:29:54.415428+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/Y5K6FD3WNVHZCDFFGSPELNW6V2","json":"https://pith.science/pith/Y5K6FD3WNVHZCDFFGSPELNW6V2.json","graph_json":"https://pith.science/api/pith-number/Y5K6FD3WNVHZCDFFGSPELNW6V2/graph.json","events_json":"https://pith.science/api/pith-number/Y5K6FD3WNVHZCDFFGSPELNW6V2/events.json","paper":"https://pith.science/paper/Y5K6FD3W"},"agent_actions":{"view_html":"https://pith.science/pith/Y5K6FD3WNVHZCDFFGSPELNW6V2","download_json":"https://pith.science/pith/Y5K6FD3WNVHZCDFFGSPELNW6V2.json","view_paper":"https://pith.science/paper/Y5K6FD3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.01028&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5K6FD3WNVHZCDFFGSPELNW6V2/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5K6FD3WNVHZCDFFGSPELNW6V2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5K6FD3WNVHZCDFFGSPELNW6V2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5K6FD3WNVHZCDFFGSPELNW6V2/action/storage_attestation","attest_author":"https://pith.science/pith/Y5K6FD3WNVHZCDFFGSPELNW6V2/action/author_attestation","sign_citation":"https://pith.science/pith/Y5K6FD3WNVHZCDFFGSPELNW6V2/action/citation_signature","submit_replication":"https://pith.science/pith/Y5K6FD3WNVHZCDFFGSPELNW6V2/action/replication_record"}},"created_at":"2026-07-05T09:29:54.415428+00:00","updated_at":"2026-07-05T09:29:54.415428+00:00"}