{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6YFIKLDIEZ4BXY5QX3C457EOK2","short_pith_number":"pith:6YFIKLDI","schema_version":"1.0","canonical_sha256":"f60a852c6826781be3b0bec5cefc8e56a5667dc23ef9b5c1da176747453d269c","source":{"kind":"arxiv","id":"2507.22876","version":2},"attestation_state":"computed","paper":{"title":"Discovering heuristics in a complex SAT solver with large language models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Furong Ye, Ke Wei, Shaowei Cai, Yiwen Sun, Zhihan Chen","submitted_at":"2025-07-30T17:52:25Z","abstract_excerpt":"The Satisfiability problem (SAT) is fundamental in computational complexity theory and has a wide range of industrial applications. Optimizing modern SAT solvers in real-world settings is quite challenging due to their intricate architectures. While automatic configuration frameworks have been developed, they rely on manually constrained search spaces. Here we develop AutoModSAT, a framework that uses large language models (LLMs) to automatically optimize SAT solvers. AutoModSAT combines an LLM-compatible modular solver design, unsupervised prompt optimization to diversify generated functions,"},"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":"2507.22876","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-07-30T17:52:25Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"4d6a9edd1dc41789b8ed7dee4a8293b6e9ccc89ec4dd461e51d83d6887cd05d7","abstract_canon_sha256":"1aa86b04875f02ad363539d0bc404b0e827fd8703f80b4e4da51f2fb05e2c047"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:04:38.972161Z","signature_b64":"43mngobQ/Zq+OWsyEDFPJwYInpvO3lbbUbUP5sIlVG0tTCLZWxENHaXJ1a0DE2n3ns7T/69hdQfoI0WcLNblAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f60a852c6826781be3b0bec5cefc8e56a5667dc23ef9b5c1da176747453d269c","last_reissued_at":"2026-06-09T01:04:38.971683Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:04:38.971683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discovering heuristics in a complex SAT solver with large language models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Furong Ye, Ke Wei, Shaowei Cai, Yiwen Sun, Zhihan Chen","submitted_at":"2025-07-30T17:52:25Z","abstract_excerpt":"The Satisfiability problem (SAT) is fundamental in computational complexity theory and has a wide range of industrial applications. Optimizing modern SAT solvers in real-world settings is quite challenging due to their intricate architectures. While automatic configuration frameworks have been developed, they rely on manually constrained search spaces. Here we develop AutoModSAT, a framework that uses large language models (LLMs) to automatically optimize SAT solvers. AutoModSAT combines an LLM-compatible modular solver design, unsupervised prompt optimization to diversify generated functions,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22876","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/2507.22876/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":"2507.22876","created_at":"2026-06-09T01:04:38.971740+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.22876v2","created_at":"2026-06-09T01:04:38.971740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22876","created_at":"2026-06-09T01:04:38.971740+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YFIKLDIEZ4B","created_at":"2026-06-09T01:04:38.971740+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YFIKLDIEZ4BXY5Q","created_at":"2026-06-09T01:04:38.971740+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YFIKLDI","created_at":"2026-06-09T01:04:38.971740+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.16379","citing_title":"An Information-Theoretic Criterion for Efficient Data Synthesis","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2510.27176","citing_title":"Glia: A Human-Inspired AI for Automated Systems Design and Optimization","ref_index":72,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09186","citing_title":"Agentic MIP Research: Accelerated Constraint Handler Generation","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6YFIKLDIEZ4BXY5QX3C457EOK2","json":"https://pith.science/pith/6YFIKLDIEZ4BXY5QX3C457EOK2.json","graph_json":"https://pith.science/api/pith-number/6YFIKLDIEZ4BXY5QX3C457EOK2/graph.json","events_json":"https://pith.science/api/pith-number/6YFIKLDIEZ4BXY5QX3C457EOK2/events.json","paper":"https://pith.science/paper/6YFIKLDI"},"agent_actions":{"view_html":"https://pith.science/pith/6YFIKLDIEZ4BXY5QX3C457EOK2","download_json":"https://pith.science/pith/6YFIKLDIEZ4BXY5QX3C457EOK2.json","view_paper":"https://pith.science/paper/6YFIKLDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.22876&json=true","fetch_graph":"https://pith.science/api/pith-number/6YFIKLDIEZ4BXY5QX3C457EOK2/graph.json","fetch_events":"https://pith.science/api/pith-number/6YFIKLDIEZ4BXY5QX3C457EOK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YFIKLDIEZ4BXY5QX3C457EOK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YFIKLDIEZ4BXY5QX3C457EOK2/action/storage_attestation","attest_author":"https://pith.science/pith/6YFIKLDIEZ4BXY5QX3C457EOK2/action/author_attestation","sign_citation":"https://pith.science/pith/6YFIKLDIEZ4BXY5QX3C457EOK2/action/citation_signature","submit_replication":"https://pith.science/pith/6YFIKLDIEZ4BXY5QX3C457EOK2/action/replication_record"}},"created_at":"2026-06-09T01:04:38.971740+00:00","updated_at":"2026-06-09T01:04:38.971740+00:00"}