{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TXYSNFNBYBEQ5IYRQLLDKTBL3C","short_pith_number":"pith:TXYSNFNB","schema_version":"1.0","canonical_sha256":"9df12695a1c0490ea31182d6354c2bd8a723e174a475cc9cb059a290ab42d16e","source":{"kind":"arxiv","id":"2403.19446","version":2},"attestation_state":"computed","paper":{"title":"Logic Optimization Meets SAT: A Novel Framework for Circuit-SAT Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hui-Ling Zhen, Jiaying Zhu, Mingxuan Yuan, Qiang Xu, Sadaf Khan, Tiebing Tang, Zhengyuan Shi, Zhufei Chu","submitted_at":"2024-03-28T14:15:50Z","abstract_excerpt":"The Circuit Satisfiability (CSAT) problem, a variant of the Boolean Satisfiability (SAT) problem, plays a critical role in integrated circuit design and verification. However, existing SAT solvers, optimized for Conjunctive Normal Form (CNF), often struggle with the intrinsic complexity of circuit structures when directly applied to CSAT instances. To address this challenge, we propose a novel preprocessing framework that leverages advanced logic synthesis techniques and a reinforcement learning (RL) agent to optimize CSAT problem instances. The framework introduces a cost-customized Look-Up 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":"2403.19446","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-03-28T14:15:50Z","cross_cats_sorted":[],"title_canon_sha256":"d7a489cedc03bf03b08383dc2bf9821cdcdaa8ed6f1860619f92c1379689bdbd","abstract_canon_sha256":"a096022ace0967360eaa913aee34f7a95c4bb7fea07e1f6d8dfd32bf238df30d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:35.742665Z","signature_b64":"EYlLnMnxr+RRWXgGhshc9/epbLMm1u3z+U0aRZlmfIQMJGcEmBdo1jhRWXlEa9YLXZEOL4lvICGEObmt4zBRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9df12695a1c0490ea31182d6354c2bd8a723e174a475cc9cb059a290ab42d16e","last_reissued_at":"2026-07-05T11:30:35.741999Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:35.741999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logic Optimization Meets SAT: A Novel Framework for Circuit-SAT Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hui-Ling Zhen, Jiaying Zhu, Mingxuan Yuan, Qiang Xu, Sadaf Khan, Tiebing Tang, Zhengyuan Shi, Zhufei Chu","submitted_at":"2024-03-28T14:15:50Z","abstract_excerpt":"The Circuit Satisfiability (CSAT) problem, a variant of the Boolean Satisfiability (SAT) problem, plays a critical role in integrated circuit design and verification. However, existing SAT solvers, optimized for Conjunctive Normal Form (CNF), often struggle with the intrinsic complexity of circuit structures when directly applied to CSAT instances. To address this challenge, we propose a novel preprocessing framework that leverages advanced logic synthesis techniques and a reinforcement learning (RL) agent to optimize CSAT problem instances. The framework introduces a cost-customized Look-Up T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.19446","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/2403.19446/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":"2403.19446","created_at":"2026-07-05T11:30:35.742083+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.19446v2","created_at":"2026-07-05T11:30:35.742083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.19446","created_at":"2026-07-05T11:30:35.742083+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXYSNFNBYBEQ","created_at":"2026-07-05T11:30:35.742083+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXYSNFNBYBEQ5IYR","created_at":"2026-07-05T11:30:35.742083+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXYSNFNB","created_at":"2026-07-05T11:30:35.742083+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/TXYSNFNBYBEQ5IYRQLLDKTBL3C","json":"https://pith.science/pith/TXYSNFNBYBEQ5IYRQLLDKTBL3C.json","graph_json":"https://pith.science/api/pith-number/TXYSNFNBYBEQ5IYRQLLDKTBL3C/graph.json","events_json":"https://pith.science/api/pith-number/TXYSNFNBYBEQ5IYRQLLDKTBL3C/events.json","paper":"https://pith.science/paper/TXYSNFNB"},"agent_actions":{"view_html":"https://pith.science/pith/TXYSNFNBYBEQ5IYRQLLDKTBL3C","download_json":"https://pith.science/pith/TXYSNFNBYBEQ5IYRQLLDKTBL3C.json","view_paper":"https://pith.science/paper/TXYSNFNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.19446&json=true","fetch_graph":"https://pith.science/api/pith-number/TXYSNFNBYBEQ5IYRQLLDKTBL3C/graph.json","fetch_events":"https://pith.science/api/pith-number/TXYSNFNBYBEQ5IYRQLLDKTBL3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXYSNFNBYBEQ5IYRQLLDKTBL3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXYSNFNBYBEQ5IYRQLLDKTBL3C/action/storage_attestation","attest_author":"https://pith.science/pith/TXYSNFNBYBEQ5IYRQLLDKTBL3C/action/author_attestation","sign_citation":"https://pith.science/pith/TXYSNFNBYBEQ5IYRQLLDKTBL3C/action/citation_signature","submit_replication":"https://pith.science/pith/TXYSNFNBYBEQ5IYRQLLDKTBL3C/action/replication_record"}},"created_at":"2026-07-05T11:30:35.742083+00:00","updated_at":"2026-07-05T11:30:35.742083+00:00"}