{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EPZ6DBRFVS2SR47CIRR4NGM4YS","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":"fff619c9c6deab84fc2cff473c7fad27fa85e5a64c570d1434de0da86ffae000","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-05-05T08:31:25Z","title_canon_sha256":"45989470e5c23b805a2a94769ccd7c9145ab4e1f6fba92382cb9bb78d75753d2"},"schema_version":"1.0","source":{"id":"2505.02452","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.02452","created_at":"2026-07-05T10:58:37Z"},{"alias_kind":"arxiv_version","alias_value":"2505.02452v1","created_at":"2026-07-05T10:58:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.02452","created_at":"2026-07-05T10:58:37Z"},{"alias_kind":"pith_short_12","alias_value":"EPZ6DBRFVS2S","created_at":"2026-07-05T10:58:37Z"},{"alias_kind":"pith_short_16","alias_value":"EPZ6DBRFVS2SR47C","created_at":"2026-07-05T10:58:37Z"},{"alias_kind":"pith_short_8","alias_value":"EPZ6DBRF","created_at":"2026-07-05T10:58:37Z"}],"graph_snapshots":[{"event_id":"sha256:8ced096be341612a58f9443c15cd7977a53bee67b02bef874cd4a0f48fdf31f1","target":"graph","created_at":"2026-07-05T10:58:37Z","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/2505.02452/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we consider the problem of efficient decoding of codes from insertions and deletions. Most of the known efficient codes are codes with synchronization strings which allow one to reduce the problem of decoding insertions and deletions to that of decoding substitution and erasures. Our new approach, presented in this paper, reduces the problem of decoding insertions and deletions to that of list recovery. Specifically, any \\((\\rho, 2\\rho n + 1, L)\\)-list-recoverable code is a \\((\\rho, L)\\)-list decodable insdel code. As an example, we apply this technique to Reed-Solomon (RS) codes","authors_text":"Anisha Banerjee, Antonia Wachter-Zeh, Eitan Yaakobi, Roni Con","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.02452","kind":"arxiv","version":1},"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:e7299335312d9de9857276d709a1a71842e2678055858e9250db6be4f2bc6f0c","target":"record","created_at":"2026-07-05T10:58:37Z","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":"fff619c9c6deab84fc2cff473c7fad27fa85e5a64c570d1434de0da86ffae000","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-05-05T08:31:25Z","title_canon_sha256":"45989470e5c23b805a2a94769ccd7c9145ab4e1f6fba92382cb9bb78d75753d2"},"schema_version":"1.0","source":{"id":"2505.02452","kind":"arxiv","version":1}},"canonical_sha256":"23f3e18625acb528f3e24463c6999cc4acd103ff21f9db94bc9a12218727ca61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23f3e18625acb528f3e24463c6999cc4acd103ff21f9db94bc9a12218727ca61","first_computed_at":"2026-07-05T10:58:37.266298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:58:37.266298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9XY8uSnPkw3zY5lo/25SyUZ8ZFsytwT1LujQs2Syy/mMjPKcXvo4Ts5epPIQbaFBvzXOkHONbmeWaDpglruZAg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:58:37.266817Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.02452","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7299335312d9de9857276d709a1a71842e2678055858e9250db6be4f2bc6f0c","sha256:8ced096be341612a58f9443c15cd7977a53bee67b02bef874cd4a0f48fdf31f1"],"state_sha256":"af91ada5c9c44e6fa19a775ff1975edb7ae92a41cc8cc75336a3c739a6c75969"}