{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BVHHXOFL7WXFBWC2DQGNIR55WC","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":"84f0ff9d49965d671f15e541535dda2e1a9993109fc3c076ce4dbc4ede2d7218","cross_cats_sorted":["cs.IT","cs.NE","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-04-01T10:11:32Z","title_canon_sha256":"330632c57fdc831c56027b2531e31eb3f42c62c486b869aafe0d0e7b0d6a4359"},"schema_version":"1.0","source":{"id":"2504.00613","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.00613","created_at":"2026-06-08T01:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"2504.00613v2","created_at":"2026-06-08T01:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.00613","created_at":"2026-06-08T01:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"BVHHXOFL7WXF","created_at":"2026-06-08T01:05:00Z"},{"alias_kind":"pith_short_16","alias_value":"BVHHXOFL7WXFBWC2","created_at":"2026-06-08T01:05:00Z"},{"alias_kind":"pith_short_8","alias_value":"BVHHXOFL","created_at":"2026-06-08T01:05:00Z"}],"graph_snapshots":[{"event_id":"sha256:fcd70196bf6ce8c5c26a95de2c0bcdbb8588d87700dfd8e5f2a7df4779cdece9","target":"graph","created_at":"2026-06-08T01:05:00Z","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/2504.00613/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Franziska Weindel, Reinhard Heckel","cross_cats":["cs.IT","cs.NE","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-04-01T10:11:32Z","title":"LLM-Guided Search for Deletion-Correcting Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.00613","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:678c42ff598f98db578cabe9828422c4e1041a99c27bfe782f3cfa78e13673e7","target":"record","created_at":"2026-06-08T01:05:00Z","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":"84f0ff9d49965d671f15e541535dda2e1a9993109fc3c076ce4dbc4ede2d7218","cross_cats_sorted":["cs.IT","cs.NE","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-04-01T10:11:32Z","title_canon_sha256":"330632c57fdc831c56027b2531e31eb3f42c62c486b869aafe0d0e7b0d6a4359"},"schema_version":"1.0","source":{"id":"2504.00613","kind":"arxiv","version":2}},"canonical_sha256":"0d4e7bb8abfdae50d85a1c0cd447bdb089e23b2c8aeed4540c09b36ada3f3567","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d4e7bb8abfdae50d85a1c0cd447bdb089e23b2c8aeed4540c09b36ada3f3567","first_computed_at":"2026-06-08T01:05:00.401667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-08T01:05:00.401667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kv67i9xS6KzN6zm1NaHLQmhssbkXNbXnbL6kvJSiQTGG+2dNhU+V059nYXhinwukGeJaE9H8GWDjL89Y0NsFBg==","signature_status":"signed_v1","signed_at":"2026-06-08T01:05:00.402909Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.00613","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:678c42ff598f98db578cabe9828422c4e1041a99c27bfe782f3cfa78e13673e7","sha256:fcd70196bf6ce8c5c26a95de2c0bcdbb8588d87700dfd8e5f2a7df4779cdece9"],"state_sha256":"a60480afb9acd6ba1f58d787f4c4ec33597d5c45bfd9fe1372d3492dc1117690"}