{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ONMIDKX3SKOQ5FV53K6KEIDGVV","short_pith_number":"pith:ONMIDKX3","schema_version":"1.0","canonical_sha256":"735881aafb929d0e96bddabca22066ad6fde5b555460016f9e037a64dcce3739","source":{"kind":"arxiv","id":"2107.07116","version":1},"attestation_state":"computed","paper":{"title":"Transformer-based Machine Learning for Fast SAT Solvers and Logic Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Chonghan Lee, Feng Shi, Mohammad Khairul Bashar, Nikhil Shukla, Song-Chun Zhu, Vijaykrishnan Narayanan","submitted_at":"2021-07-15T04:47:35Z","abstract_excerpt":"CNF-based SAT and MaxSAT solvers are central to logic synthesis and verification systems. The increasing popularity of these constraint problems in electronic design automation encourages studies on different SAT problems and their properties for further computational efficiency. There has been both theoretical and practical success of modern Conflict-driven clause learning SAT solvers, which allows solving very large industrial instances in a relatively short amount of time. Recently, machine learning approaches provide a new dimension to solving this challenging problem. Neural symbolic mode"},"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":"2107.07116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2021-07-15T04:47:35Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"44ef106af2cf5b88b78ed5f80adc3fea129a0bf3fab6bbe0df4ad662c63a7112","abstract_canon_sha256":"37e2c345054f83bb2db6acec570ad9c456a4e126139b0e26f13b9c1c5ee4686a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:58:10.914380Z","signature_b64":"ZAzbW366sl510LgeCOSscsNlF3doS70UXoxtm3ZXTLCt2dzzRSiKBuTJMKoMTAYdM8HVqXaBWTYtt0zSFE92DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"735881aafb929d0e96bddabca22066ad6fde5b555460016f9e037a64dcce3739","last_reissued_at":"2026-07-05T02:58:10.914002Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:58:10.914002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transformer-based Machine Learning for Fast SAT Solvers and Logic Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Chonghan Lee, Feng Shi, Mohammad Khairul Bashar, Nikhil Shukla, Song-Chun Zhu, Vijaykrishnan Narayanan","submitted_at":"2021-07-15T04:47:35Z","abstract_excerpt":"CNF-based SAT and MaxSAT solvers are central to logic synthesis and verification systems. The increasing popularity of these constraint problems in electronic design automation encourages studies on different SAT problems and their properties for further computational efficiency. There has been both theoretical and practical success of modern Conflict-driven clause learning SAT solvers, which allows solving very large industrial instances in a relatively short amount of time. Recently, machine learning approaches provide a new dimension to solving this challenging problem. Neural symbolic mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.07116","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/2107.07116/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":"2107.07116","created_at":"2026-07-05T02:58:10.914064+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.07116v1","created_at":"2026-07-05T02:58:10.914064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.07116","created_at":"2026-07-05T02:58:10.914064+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONMIDKX3SKOQ","created_at":"2026-07-05T02:58:10.914064+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONMIDKX3SKOQ5FV5","created_at":"2026-07-05T02:58:10.914064+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONMIDKX3","created_at":"2026-07-05T02:58:10.914064+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.10335","citing_title":"Studying number theory with deep learning: a case study with the M\\\"obius and squarefree indicator functions","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ONMIDKX3SKOQ5FV53K6KEIDGVV","json":"https://pith.science/pith/ONMIDKX3SKOQ5FV53K6KEIDGVV.json","graph_json":"https://pith.science/api/pith-number/ONMIDKX3SKOQ5FV53K6KEIDGVV/graph.json","events_json":"https://pith.science/api/pith-number/ONMIDKX3SKOQ5FV53K6KEIDGVV/events.json","paper":"https://pith.science/paper/ONMIDKX3"},"agent_actions":{"view_html":"https://pith.science/pith/ONMIDKX3SKOQ5FV53K6KEIDGVV","download_json":"https://pith.science/pith/ONMIDKX3SKOQ5FV53K6KEIDGVV.json","view_paper":"https://pith.science/paper/ONMIDKX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.07116&json=true","fetch_graph":"https://pith.science/api/pith-number/ONMIDKX3SKOQ5FV53K6KEIDGVV/graph.json","fetch_events":"https://pith.science/api/pith-number/ONMIDKX3SKOQ5FV53K6KEIDGVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONMIDKX3SKOQ5FV53K6KEIDGVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONMIDKX3SKOQ5FV53K6KEIDGVV/action/storage_attestation","attest_author":"https://pith.science/pith/ONMIDKX3SKOQ5FV53K6KEIDGVV/action/author_attestation","sign_citation":"https://pith.science/pith/ONMIDKX3SKOQ5FV53K6KEIDGVV/action/citation_signature","submit_replication":"https://pith.science/pith/ONMIDKX3SKOQ5FV53K6KEIDGVV/action/replication_record"}},"created_at":"2026-07-05T02:58:10.914064+00:00","updated_at":"2026-07-05T02:58:10.914064+00:00"}