{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ELXX3GQKLBBB5RZN5N72IJTKOU","short_pith_number":"pith:ELXX3GQK","schema_version":"1.0","canonical_sha256":"22ef7d9a0a58421ec72deb7fa4266a7530fe6423b07d0c9b5ba7b451cc21eaf7","source":{"kind":"arxiv","id":"1807.02874","version":3},"attestation_state":"computed","paper":{"title":"Bounds and Constructions for Multi-Symbol Duplication Error Correcting Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andreas Lenz, Antonia Wachter-Zeh, Niklas J\\\"unger","submitted_at":"2018-07-08T19:56:46Z","abstract_excerpt":"In this paper, we study codes correcting $t$ duplications of $\\ell$ consecutive symbols. These errors are known as tandem duplication errors, where a sequence of symbols is repeated and inserted directly after its original occurrence. Using sphere packing arguments, we derive non-asymptotic upper bounds on the cardinality of codes that correct such errors for any choice of parameters. Based on the fact that a code correcting insertions of $t$ zero-blocks can be used to correct $t$ tandem duplications, we construct codes for tandem duplication errors. We compare the cardinalities of these codes"},"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":"1807.02874","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-08T19:56:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"287bc56eb944a95c94568af909bb085401bc9f60e17dca21075bf0eaa7008590","abstract_canon_sha256":"1e81e775cb22868b19900d462ded3afbac3517cb7708de053a5ce6c3f9ab86b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:21.480943Z","signature_b64":"S6Mj64Nwq5QMdd7GYngi6Q9rZdEtsRj1m6m+E/M52jrsP17J+4hsFR4NmYWRXhsuumdrSCUoGu1l1PEVfNvlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22ef7d9a0a58421ec72deb7fa4266a7530fe6423b07d0c9b5ba7b451cc21eaf7","last_reissued_at":"2026-05-18T00:05:21.480454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:21.480454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds and Constructions for Multi-Symbol Duplication Error Correcting Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andreas Lenz, Antonia Wachter-Zeh, Niklas J\\\"unger","submitted_at":"2018-07-08T19:56:46Z","abstract_excerpt":"In this paper, we study codes correcting $t$ duplications of $\\ell$ consecutive symbols. These errors are known as tandem duplication errors, where a sequence of symbols is repeated and inserted directly after its original occurrence. Using sphere packing arguments, we derive non-asymptotic upper bounds on the cardinality of codes that correct such errors for any choice of parameters. Based on the fact that a code correcting insertions of $t$ zero-blocks can be used to correct $t$ tandem duplications, we construct codes for tandem duplication errors. We compare the cardinalities of these codes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02874","kind":"arxiv","version":3},"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":"1807.02874","created_at":"2026-05-18T00:05:21.480527+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02874v3","created_at":"2026-05-18T00:05:21.480527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02874","created_at":"2026-05-18T00:05:21.480527+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELXX3GQKLBBB","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELXX3GQKLBBB5RZN","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELXX3GQK","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25445","citing_title":"Central Limit Theorem for Mutation Systems","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ELXX3GQKLBBB5RZN5N72IJTKOU","json":"https://pith.science/pith/ELXX3GQKLBBB5RZN5N72IJTKOU.json","graph_json":"https://pith.science/api/pith-number/ELXX3GQKLBBB5RZN5N72IJTKOU/graph.json","events_json":"https://pith.science/api/pith-number/ELXX3GQKLBBB5RZN5N72IJTKOU/events.json","paper":"https://pith.science/paper/ELXX3GQK"},"agent_actions":{"view_html":"https://pith.science/pith/ELXX3GQKLBBB5RZN5N72IJTKOU","download_json":"https://pith.science/pith/ELXX3GQKLBBB5RZN5N72IJTKOU.json","view_paper":"https://pith.science/paper/ELXX3GQK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02874&json=true","fetch_graph":"https://pith.science/api/pith-number/ELXX3GQKLBBB5RZN5N72IJTKOU/graph.json","fetch_events":"https://pith.science/api/pith-number/ELXX3GQKLBBB5RZN5N72IJTKOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELXX3GQKLBBB5RZN5N72IJTKOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELXX3GQKLBBB5RZN5N72IJTKOU/action/storage_attestation","attest_author":"https://pith.science/pith/ELXX3GQKLBBB5RZN5N72IJTKOU/action/author_attestation","sign_citation":"https://pith.science/pith/ELXX3GQKLBBB5RZN5N72IJTKOU/action/citation_signature","submit_replication":"https://pith.science/pith/ELXX3GQKLBBB5RZN5N72IJTKOU/action/replication_record"}},"created_at":"2026-05-18T00:05:21.480527+00:00","updated_at":"2026-05-18T00:05:21.480527+00:00"}