{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2LU4EVCRD7MRIZIMZ7ASFO7B4B","short_pith_number":"pith:2LU4EVCR","schema_version":"1.0","canonical_sha256":"d2e9c254511fd914650ccfc122bbe1e05cb7b32741e47446837206c21139d08b","source":{"kind":"arxiv","id":"1802.08663","version":1},"attestation_state":"computed","paper":{"title":"Synchronization Strings: List Decoding for Insertions and Deletions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Amirbehshad Shahrasbi, Bernhard Haeupler, Madhu Sudan","submitted_at":"2018-02-23T18:09:14Z","abstract_excerpt":"We study codes that are list-decodable under insertions and deletions. Specifically, we consider the setting where a codeword over some finite alphabet of size $q$ may suffer from $\\delta$ fraction of adversarial deletions and $\\gamma$ fraction of adversarial insertions. A code is said to be $L$-list-decodable if there is an (efficient) algorithm that, given a received word, reports a list of $L$ codewords that include the original codeword.\n  Using the concept of synchronization strings, introduced by the first two authors [STOC 2017], we show some surprising results. We show that for every $"},"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":"1802.08663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-23T18:09:14Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"31f4259b25414f0c3d34f1ff8856fb65553060967d4690be2673580ac0b91fc2","abstract_canon_sha256":"b62d32fa47e82f642f8cc73ec779078518719eafbe85278752f32d1082e7509e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:40.873963Z","signature_b64":"0I7RnhWrwthNQCe4fL8auj1XHFfQ/OpPE4ekHRLrE+81lKNxDH23qKjjC9EiZS/2hT5f/LELGKp2e6hlp09/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2e9c254511fd914650ccfc122bbe1e05cb7b32741e47446837206c21139d08b","last_reissued_at":"2026-05-18T00:22:40.873341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:40.873341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synchronization Strings: List Decoding for Insertions and Deletions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Amirbehshad Shahrasbi, Bernhard Haeupler, Madhu Sudan","submitted_at":"2018-02-23T18:09:14Z","abstract_excerpt":"We study codes that are list-decodable under insertions and deletions. Specifically, we consider the setting where a codeword over some finite alphabet of size $q$ may suffer from $\\delta$ fraction of adversarial deletions and $\\gamma$ fraction of adversarial insertions. A code is said to be $L$-list-decodable if there is an (efficient) algorithm that, given a received word, reports a list of $L$ codewords that include the original codeword.\n  Using the concept of synchronization strings, introduced by the first two authors [STOC 2017], we show some surprising results. We show that for every $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08663","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1802.08663","created_at":"2026-05-18T00:22:40.873455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08663v1","created_at":"2026-05-18T00:22:40.873455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08663","created_at":"2026-05-18T00:22:40.873455+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LU4EVCRD7MR","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LU4EVCRD7MRIZIM","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LU4EVCR","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2LU4EVCRD7MRIZIMZ7ASFO7B4B","json":"https://pith.science/pith/2LU4EVCRD7MRIZIMZ7ASFO7B4B.json","graph_json":"https://pith.science/api/pith-number/2LU4EVCRD7MRIZIMZ7ASFO7B4B/graph.json","events_json":"https://pith.science/api/pith-number/2LU4EVCRD7MRIZIMZ7ASFO7B4B/events.json","paper":"https://pith.science/paper/2LU4EVCR"},"agent_actions":{"view_html":"https://pith.science/pith/2LU4EVCRD7MRIZIMZ7ASFO7B4B","download_json":"https://pith.science/pith/2LU4EVCRD7MRIZIMZ7ASFO7B4B.json","view_paper":"https://pith.science/paper/2LU4EVCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08663&json=true","fetch_graph":"https://pith.science/api/pith-number/2LU4EVCRD7MRIZIMZ7ASFO7B4B/graph.json","fetch_events":"https://pith.science/api/pith-number/2LU4EVCRD7MRIZIMZ7ASFO7B4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LU4EVCRD7MRIZIMZ7ASFO7B4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LU4EVCRD7MRIZIMZ7ASFO7B4B/action/storage_attestation","attest_author":"https://pith.science/pith/2LU4EVCRD7MRIZIMZ7ASFO7B4B/action/author_attestation","sign_citation":"https://pith.science/pith/2LU4EVCRD7MRIZIMZ7ASFO7B4B/action/citation_signature","submit_replication":"https://pith.science/pith/2LU4EVCRD7MRIZIMZ7ASFO7B4B/action/replication_record"}},"created_at":"2026-05-18T00:22:40.873455+00:00","updated_at":"2026-05-18T00:22:40.873455+00:00"}