{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6YFIKLDIEZ4BXY5QX3C457EOK2","short_pith_number":"pith:6YFIKLDI","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"},"canonical_sha256":"f60a852c6826781be3b0bec5cefc8e56a5667dc23ef9b5c1da176747453d269c","source":{"kind":"arxiv","id":"2507.22876","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.22876","created_at":"2026-06-09T01:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"2507.22876v2","created_at":"2026-06-09T01:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22876","created_at":"2026-06-09T01:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"6YFIKLDIEZ4B","created_at":"2026-06-09T01:04:38Z"},{"alias_kind":"pith_short_16","alias_value":"6YFIKLDIEZ4BXY5Q","created_at":"2026-06-09T01:04:38Z"},{"alias_kind":"pith_short_8","alias_value":"6YFIKLDI","created_at":"2026-06-09T01:04:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6YFIKLDIEZ4BXY5QX3C457EOK2","target":"record","payload":{"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"},"canonical_sha256":"f60a852c6826781be3b0bec5cefc8e56a5667dc23ef9b5c1da176747453d269c","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"},"source_kind":"arxiv","source_id":"2507.22876","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-09T01:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTFzwqI9PVVurIfKTmezU73ElUTi2GPkHRnnW/TI4QC4MeQTYenl3bKud4poZZrOTMl0Dl0t5Gn+bGmJs+LmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:56:24.846010Z"},"content_sha256":"449b97e8ef4d409db064bf72e9c76b0331c4e862b54b5271bed7be8ecb45133e","schema_version":"1.0","event_id":"sha256:449b97e8ef4d409db064bf72e9c76b0331c4e862b54b5271bed7be8ecb45133e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6YFIKLDIEZ4BXY5QX3C457EOK2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-09T01:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5xvd3GNAypVr3xdUbX1YKAgl9E8lIk8s7MBCO/nywqAmMljausYrSGGDfg2PeNsYq6x7HMuk9Uwp6DeqLFd1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:56:24.846711Z"},"content_sha256":"4ef2c62cdef01c98f9abfb54615a478edd4b726cd20121923970f7e122a42126","schema_version":"1.0","event_id":"sha256:4ef2c62cdef01c98f9abfb54615a478edd4b726cd20121923970f7e122a42126"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YFIKLDIEZ4BXY5QX3C457EOK2/bundle.json","state_url":"https://pith.science/pith/6YFIKLDIEZ4BXY5QX3C457EOK2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YFIKLDIEZ4BXY5QX3C457EOK2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T13:56:24Z","links":{"resolver":"https://pith.science/pith/6YFIKLDIEZ4BXY5QX3C457EOK2","bundle":"https://pith.science/pith/6YFIKLDIEZ4BXY5QX3C457EOK2/bundle.json","state":"https://pith.science/pith/6YFIKLDIEZ4BXY5QX3C457EOK2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YFIKLDIEZ4BXY5QX3C457EOK2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6YFIKLDIEZ4BXY5QX3C457EOK2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1aa86b04875f02ad363539d0bc404b0e827fd8703f80b4e4da51f2fb05e2c047","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-07-30T17:52:25Z","title_canon_sha256":"4d6a9edd1dc41789b8ed7dee4a8293b6e9ccc89ec4dd461e51d83d6887cd05d7"},"schema_version":"1.0","source":{"id":"2507.22876","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.22876","created_at":"2026-06-09T01:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"2507.22876v2","created_at":"2026-06-09T01:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22876","created_at":"2026-06-09T01:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"6YFIKLDIEZ4B","created_at":"2026-06-09T01:04:38Z"},{"alias_kind":"pith_short_16","alias_value":"6YFIKLDIEZ4BXY5Q","created_at":"2026-06-09T01:04:38Z"},{"alias_kind":"pith_short_8","alias_value":"6YFIKLDI","created_at":"2026-06-09T01:04:38Z"}],"graph_snapshots":[{"event_id":"sha256:4ef2c62cdef01c98f9abfb54615a478edd4b726cd20121923970f7e122a42126","target":"graph","created_at":"2026-06-09T01:04:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.22876/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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,","authors_text":"Furong Ye, Ke Wei, Shaowei Cai, Yiwen Sun, Zhihan Chen","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-07-30T17:52:25Z","title":"Discovering heuristics in a complex SAT solver with large language models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22876","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:449b97e8ef4d409db064bf72e9c76b0331c4e862b54b5271bed7be8ecb45133e","target":"record","created_at":"2026-06-09T01:04:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1aa86b04875f02ad363539d0bc404b0e827fd8703f80b4e4da51f2fb05e2c047","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-07-30T17:52:25Z","title_canon_sha256":"4d6a9edd1dc41789b8ed7dee4a8293b6e9ccc89ec4dd461e51d83d6887cd05d7"},"schema_version":"1.0","source":{"id":"2507.22876","kind":"arxiv","version":2}},"canonical_sha256":"f60a852c6826781be3b0bec5cefc8e56a5667dc23ef9b5c1da176747453d269c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f60a852c6826781be3b0bec5cefc8e56a5667dc23ef9b5c1da176747453d269c","first_computed_at":"2026-06-09T01:04:38.971683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:04:38.971683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"43mngobQ/Zq+OWsyEDFPJwYInpvO3lbbUbUP5sIlVG0tTCLZWxENHaXJ1a0DE2n3ns7T/69hdQfoI0WcLNblAQ==","signature_status":"signed_v1","signed_at":"2026-06-09T01:04:38.972161Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.22876","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:449b97e8ef4d409db064bf72e9c76b0331c4e862b54b5271bed7be8ecb45133e","sha256:4ef2c62cdef01c98f9abfb54615a478edd4b726cd20121923970f7e122a42126"],"state_sha256":"f0dfea19366b3140dbe2d2959ff6b1454f3035035099e31e521393a859a5c3d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOcoSPsUl0rLBrsA9Hp/H/P5qmycGl3HRnSRA24tkdlZkYQIrwvj/+JcuEfkueccVOZMja/ccoJg4EZQ74VKBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:56:24.850861Z","bundle_sha256":"5397ccd55a2db7ef4a3b1ccca743aab3820ff88f3096dd548aa41d59d1b8b071"}}