{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:R4ZHX5CU2N47KR4CLNXR5HOW6B","short_pith_number":"pith:R4ZHX5CU","schema_version":"1.0","canonical_sha256":"8f327bf454d379f547825b6f1e9dd6f074c6cd4e9f5e03ec1583ebe08e893ba1","source":{"kind":"arxiv","id":"2205.13745","version":2},"attestation_state":"computed","paper":{"title":"DeepSAT: An EDA-Driven Learning Framework for SAT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Min Li, Qiang Xu, Qiuxia Lai, Sadaf Khan, Shaowei Cai, Zhengyuan Shi","submitted_at":"2022-05-27T03:20:42Z","abstract_excerpt":"We present DeepSAT, a novel end-to-end learning framework for the Boolean satisfiability (SAT) problem. Unlike existing solutions trained on random SAT instances with relatively weak supervision, we propose applying the knowledge of the well-developed electronic design automation (EDA) field for SAT solving. Specifically, we first resort to logic synthesis algorithms to pre-process SAT instances into optimized and-inverter graphs (AIGs). By doing so, the distribution diversity among various SAT instances can be dramatically reduced, which facilitates improving the generalization capability of "},"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":"2205.13745","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-05-27T03:20:42Z","cross_cats_sorted":[],"title_canon_sha256":"075ef523dd087e4beeecccbef048e54ba4d32f745e89ec0fb545389a9abeddc2","abstract_canon_sha256":"928201d7fb33059e8b47aabf55a9d014f43348fbc88d6fc672f031c1f3f91b49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:34:31.227134Z","signature_b64":"UlfNiHMy4viKpe0QlHPq8N2CDkdG88Aa8XnE/X2S20/A2WdEyiduOODf3E2UhodSl7UyvFbfXEB1rx3lnKLdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f327bf454d379f547825b6f1e9dd6f074c6cd4e9f5e03ec1583ebe08e893ba1","last_reissued_at":"2026-07-05T05:34:31.226567Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:34:31.226567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeepSAT: An EDA-Driven Learning Framework for SAT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Min Li, Qiang Xu, Qiuxia Lai, Sadaf Khan, Shaowei Cai, Zhengyuan Shi","submitted_at":"2022-05-27T03:20:42Z","abstract_excerpt":"We present DeepSAT, a novel end-to-end learning framework for the Boolean satisfiability (SAT) problem. Unlike existing solutions trained on random SAT instances with relatively weak supervision, we propose applying the knowledge of the well-developed electronic design automation (EDA) field for SAT solving. Specifically, we first resort to logic synthesis algorithms to pre-process SAT instances into optimized and-inverter graphs (AIGs). By doing so, the distribution diversity among various SAT instances can be dramatically reduced, which facilitates improving the generalization capability of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.13745","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/2205.13745/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":"2205.13745","created_at":"2026-07-05T05:34:31.226628+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.13745v2","created_at":"2026-07-05T05:34:31.226628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.13745","created_at":"2026-07-05T05:34:31.226628+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4ZHX5CU2N47","created_at":"2026-07-05T05:34:31.226628+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4ZHX5CU2N47KR4C","created_at":"2026-07-05T05:34:31.226628+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4ZHX5CU","created_at":"2026-07-05T05:34:31.226628+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/R4ZHX5CU2N47KR4CLNXR5HOW6B","json":"https://pith.science/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B.json","graph_json":"https://pith.science/api/pith-number/R4ZHX5CU2N47KR4CLNXR5HOW6B/graph.json","events_json":"https://pith.science/api/pith-number/R4ZHX5CU2N47KR4CLNXR5HOW6B/events.json","paper":"https://pith.science/paper/R4ZHX5CU"},"agent_actions":{"view_html":"https://pith.science/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B","download_json":"https://pith.science/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B.json","view_paper":"https://pith.science/paper/R4ZHX5CU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.13745&json=true","fetch_graph":"https://pith.science/api/pith-number/R4ZHX5CU2N47KR4CLNXR5HOW6B/graph.json","fetch_events":"https://pith.science/api/pith-number/R4ZHX5CU2N47KR4CLNXR5HOW6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B/action/storage_attestation","attest_author":"https://pith.science/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B/action/author_attestation","sign_citation":"https://pith.science/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B/action/citation_signature","submit_replication":"https://pith.science/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B/action/replication_record"}},"created_at":"2026-07-05T05:34:31.226628+00:00","updated_at":"2026-07-05T05:34:31.226628+00:00"}