{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5FP4NUN4GPHZVYT3PCTAT5NPR5","short_pith_number":"pith:5FP4NUN4","schema_version":"1.0","canonical_sha256":"e95fc6d1bc33cf9ae27b78a609f5af8f4f4425f483bffbbe0bff08a6afd272cc","source":{"kind":"arxiv","id":"2402.10705","version":3},"attestation_state":"computed","paper":{"title":"AutoSAT: Automatically Optimize SAT Solvers via Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bingzhen Zhang, Furong Ye, Ke Wei, Shaowei Cai, Shiyu Huang, Xianyin Zhang, Yiwen Sun","submitted_at":"2024-02-16T14:04:56Z","abstract_excerpt":"Conflict-Driven Clause Learning (CDCL) is the mainstream framework for solving the Satisfiability problem (SAT), and CDCL solvers typically rely on various heuristics, which have a significant impact on their performance. Modern CDCL solvers, such as MiniSat and Kissat, commonly incorporate several heuristics and select one to use according to simple rules, requiring significant time and expert effort to fine-tune in practice. The pervasion of Large Language Models (LLMs) provides a potential solution to address this issue. However, generating a CDCL solver from scratch is not effective due to"},"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":"2402.10705","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-02-16T14:04:56Z","cross_cats_sorted":[],"title_canon_sha256":"59d4e8e646efef999feed4ee7c04fda9612954dc7cc9bd8b9a5c86631e4e84b1","abstract_canon_sha256":"d154c38c0e28b2c3e448e03fabd2ce14ce5f5410ffb3bf0a27047f6486a16605"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:55.720519Z","signature_b64":"NlNZzfe0ORHU2d7CDcoYV2UIQt3evYnXgODPSHthyKdAELYvPDlNrv7rY8V4n7gqYBov+a7MxWE9es5S4FEiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e95fc6d1bc33cf9ae27b78a609f5af8f4f4425f483bffbbe0bff08a6afd272cc","last_reissued_at":"2026-07-05T09:34:55.720002Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:55.720002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AutoSAT: Automatically Optimize SAT Solvers via Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bingzhen Zhang, Furong Ye, Ke Wei, Shaowei Cai, Shiyu Huang, Xianyin Zhang, Yiwen Sun","submitted_at":"2024-02-16T14:04:56Z","abstract_excerpt":"Conflict-Driven Clause Learning (CDCL) is the mainstream framework for solving the Satisfiability problem (SAT), and CDCL solvers typically rely on various heuristics, which have a significant impact on their performance. Modern CDCL solvers, such as MiniSat and Kissat, commonly incorporate several heuristics and select one to use according to simple rules, requiring significant time and expert effort to fine-tune in practice. The pervasion of Large Language Models (LLMs) provides a potential solution to address this issue. However, generating a CDCL solver from scratch is not effective due to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10705","kind":"arxiv","version":3},"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/2402.10705/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":"2402.10705","created_at":"2026-07-05T09:34:55.720061+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.10705v3","created_at":"2026-07-05T09:34:55.720061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10705","created_at":"2026-07-05T09:34:55.720061+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FP4NUN4GPHZ","created_at":"2026-07-05T09:34:55.720061+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FP4NUN4GPHZVYT3","created_at":"2026-07-05T09:34:55.720061+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FP4NUN4","created_at":"2026-07-05T09:34:55.720061+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25832","citing_title":"MiniOpt: Reasoning to Model and Solve General Optimization Problems with Limited Resources","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2606.25832","citing_title":"MiniOpt: Reasoning to Model and Solve General Optimization Problems with Limited Resources","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20849","citing_title":"Large Language Models for Operations Research: A Comprehensive Survey","ref_index":94,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16379","citing_title":"An Information-Theoretic Criterion for Efficient Data Synthesis","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03232","citing_title":"IC3-Evolve: Proof-/Witness-Gated Offline LLM-Driven Heuristic Evolution for IC3 Hardware Model Checking","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09186","citing_title":"Agentic MIP Research: Accelerated Constraint Handler Generation","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07872","citing_title":"PyVRP$^+$: LLM-Driven Metacognitive Heuristic Evolution for Hybrid Genetic Search in Vehicle Routing Problems","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5FP4NUN4GPHZVYT3PCTAT5NPR5","json":"https://pith.science/pith/5FP4NUN4GPHZVYT3PCTAT5NPR5.json","graph_json":"https://pith.science/api/pith-number/5FP4NUN4GPHZVYT3PCTAT5NPR5/graph.json","events_json":"https://pith.science/api/pith-number/5FP4NUN4GPHZVYT3PCTAT5NPR5/events.json","paper":"https://pith.science/paper/5FP4NUN4"},"agent_actions":{"view_html":"https://pith.science/pith/5FP4NUN4GPHZVYT3PCTAT5NPR5","download_json":"https://pith.science/pith/5FP4NUN4GPHZVYT3PCTAT5NPR5.json","view_paper":"https://pith.science/paper/5FP4NUN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.10705&json=true","fetch_graph":"https://pith.science/api/pith-number/5FP4NUN4GPHZVYT3PCTAT5NPR5/graph.json","fetch_events":"https://pith.science/api/pith-number/5FP4NUN4GPHZVYT3PCTAT5NPR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FP4NUN4GPHZVYT3PCTAT5NPR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FP4NUN4GPHZVYT3PCTAT5NPR5/action/storage_attestation","attest_author":"https://pith.science/pith/5FP4NUN4GPHZVYT3PCTAT5NPR5/action/author_attestation","sign_citation":"https://pith.science/pith/5FP4NUN4GPHZVYT3PCTAT5NPR5/action/citation_signature","submit_replication":"https://pith.science/pith/5FP4NUN4GPHZVYT3PCTAT5NPR5/action/replication_record"}},"created_at":"2026-07-05T09:34:55.720061+00:00","updated_at":"2026-07-05T09:34:55.720061+00:00"}