{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BVHHXOFL7WXFBWC2DQGNIR55WC","short_pith_number":"pith:BVHHXOFL","schema_version":"1.0","canonical_sha256":"0d4e7bb8abfdae50d85a1c0cd447bdb089e23b2c8aeed4540c09b36ada3f3567","source":{"kind":"arxiv","id":"2504.00613","version":2},"attestation_state":"computed","paper":{"title":"LLM-Guided Search for Deletion-Correcting Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NE","math.IT"],"primary_cat":"cs.AI","authors_text":"Franziska Weindel, Reinhard Heckel","submitted_at":"2025-04-01T10:11:32Z","abstract_excerpt":"Finding deletion-correcting codes of maximum size has been an open problem for over 70 years, even for a single deletion. We adapt FunSearch, a large language model (LLM)-guided evolutionary search, to discover functions that construct deletion-correcting codes at short code lengths. For a single deletion, our search finds a function that we prove constructs the conjectured-optimal Varshamov-Tenengolts code. For multiple deletions and quaternary edit codes, the discovered functions improve on prior explicit, search-based, and neural constructions but remain empirical heuristics without new the"},"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":"2504.00613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-04-01T10:11:32Z","cross_cats_sorted":["cs.IT","cs.NE","math.IT"],"title_canon_sha256":"330632c57fdc831c56027b2531e31eb3f42c62c486b869aafe0d0e7b0d6a4359","abstract_canon_sha256":"84f0ff9d49965d671f15e541535dda2e1a9993109fc3c076ce4dbc4ede2d7218"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:05:00.402909Z","signature_b64":"Kv67i9xS6KzN6zm1NaHLQmhssbkXNbXnbL6kvJSiQTGG+2dNhU+V059nYXhinwukGeJaE9H8GWDjL89Y0NsFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d4e7bb8abfdae50d85a1c0cd447bdb089e23b2c8aeed4540c09b36ada3f3567","last_reissued_at":"2026-06-08T01:05:00.401667Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:05:00.401667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLM-Guided Search for Deletion-Correcting Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NE","math.IT"],"primary_cat":"cs.AI","authors_text":"Franziska Weindel, Reinhard Heckel","submitted_at":"2025-04-01T10:11:32Z","abstract_excerpt":"Finding deletion-correcting codes of maximum size has been an open problem for over 70 years, even for a single deletion. We adapt FunSearch, a large language model (LLM)-guided evolutionary search, to discover functions that construct deletion-correcting codes at short code lengths. For a single deletion, our search finds a function that we prove constructs the conjectured-optimal Varshamov-Tenengolts code. For multiple deletions and quaternary edit codes, the discovered functions improve on prior explicit, search-based, and neural constructions but remain empirical heuristics without new the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.00613","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/2504.00613/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":"2504.00613","created_at":"2026-06-08T01:05:00.401844+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.00613v2","created_at":"2026-06-08T01:05:00.401844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.00613","created_at":"2026-06-08T01:05:00.401844+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVHHXOFL7WXF","created_at":"2026-06-08T01:05:00.401844+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVHHXOFL7WXFBWC2","created_at":"2026-06-08T01:05:00.401844+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVHHXOFL","created_at":"2026-06-08T01:05:00.401844+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23881","citing_title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BVHHXOFL7WXFBWC2DQGNIR55WC","json":"https://pith.science/pith/BVHHXOFL7WXFBWC2DQGNIR55WC.json","graph_json":"https://pith.science/api/pith-number/BVHHXOFL7WXFBWC2DQGNIR55WC/graph.json","events_json":"https://pith.science/api/pith-number/BVHHXOFL7WXFBWC2DQGNIR55WC/events.json","paper":"https://pith.science/paper/BVHHXOFL"},"agent_actions":{"view_html":"https://pith.science/pith/BVHHXOFL7WXFBWC2DQGNIR55WC","download_json":"https://pith.science/pith/BVHHXOFL7WXFBWC2DQGNIR55WC.json","view_paper":"https://pith.science/paper/BVHHXOFL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.00613&json=true","fetch_graph":"https://pith.science/api/pith-number/BVHHXOFL7WXFBWC2DQGNIR55WC/graph.json","fetch_events":"https://pith.science/api/pith-number/BVHHXOFL7WXFBWC2DQGNIR55WC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVHHXOFL7WXFBWC2DQGNIR55WC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVHHXOFL7WXFBWC2DQGNIR55WC/action/storage_attestation","attest_author":"https://pith.science/pith/BVHHXOFL7WXFBWC2DQGNIR55WC/action/author_attestation","sign_citation":"https://pith.science/pith/BVHHXOFL7WXFBWC2DQGNIR55WC/action/citation_signature","submit_replication":"https://pith.science/pith/BVHHXOFL7WXFBWC2DQGNIR55WC/action/replication_record"}},"created_at":"2026-06-08T01:05:00.401844+00:00","updated_at":"2026-06-08T01:05:00.401844+00:00"}