{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ELXX3GQKLBBB5RZN5N72IJTKOU","short_pith_number":"pith:ELXX3GQK","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"},"canonical_sha256":"22ef7d9a0a58421ec72deb7fa4266a7530fe6423b07d0c9b5ba7b451cc21eaf7","source":{"kind":"arxiv","id":"1807.02874","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02874","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02874v3","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02874","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"pith_short_12","alias_value":"ELXX3GQKLBBB","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ELXX3GQKLBBB5RZN","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ELXX3GQK","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ELXX3GQKLBBB5RZN5N72IJTKOU","target":"record","payload":{"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"},"canonical_sha256":"22ef7d9a0a58421ec72deb7fa4266a7530fe6423b07d0c9b5ba7b451cc21eaf7","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"},"source_kind":"arxiv","source_id":"1807.02874","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1zHNyi2CAudXSDwZmK6jFIeHzKN2sdwegtDk68W9u9Aevsc/Bm59lhNC/FHPuriQITb4jNfCVE8NXACPw826Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T10:38:19.039728Z"},"content_sha256":"db7bde799fef1b5475e6266230c696d48c0e550aa38eae943f9262f8f63fb28a","schema_version":"1.0","event_id":"sha256:db7bde799fef1b5475e6266230c696d48c0e550aa38eae943f9262f8f63fb28a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ELXX3GQKLBBB5RZN5N72IJTKOU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"slFA/W10+ZZRj14YpCO3Rs4vWn1W2aTnoODBOctrfNdvrNQaRVPf6Xb8WmtlOfG+oFS6uHQ8iMBh4HHNmXmbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T10:38:19.040053Z"},"content_sha256":"7436681e4138760430c311b6346fe67aec1fbaccbec9d84c3eae2bad62a90ae8","schema_version":"1.0","event_id":"sha256:7436681e4138760430c311b6346fe67aec1fbaccbec9d84c3eae2bad62a90ae8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ELXX3GQKLBBB5RZN5N72IJTKOU/bundle.json","state_url":"https://pith.science/pith/ELXX3GQKLBBB5RZN5N72IJTKOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ELXX3GQKLBBB5RZN5N72IJTKOU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T10:38:19Z","links":{"resolver":"https://pith.science/pith/ELXX3GQKLBBB5RZN5N72IJTKOU","bundle":"https://pith.science/pith/ELXX3GQKLBBB5RZN5N72IJTKOU/bundle.json","state":"https://pith.science/pith/ELXX3GQKLBBB5RZN5N72IJTKOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ELXX3GQKLBBB5RZN5N72IJTKOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ELXX3GQKLBBB5RZN5N72IJTKOU","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":"1e81e775cb22868b19900d462ded3afbac3517cb7708de053a5ce6c3f9ab86b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-08T19:56:46Z","title_canon_sha256":"287bc56eb944a95c94568af909bb085401bc9f60e17dca21075bf0eaa7008590"},"schema_version":"1.0","source":{"id":"1807.02874","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02874","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02874v3","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02874","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"pith_short_12","alias_value":"ELXX3GQKLBBB","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ELXX3GQKLBBB5RZN","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ELXX3GQK","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:7436681e4138760430c311b6346fe67aec1fbaccbec9d84c3eae2bad62a90ae8","target":"graph","created_at":"2026-05-18T00:05:21Z","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"},"paper":{"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","authors_text":"Andreas Lenz, Antonia Wachter-Zeh, Niklas J\\\"unger","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-08T19:56:46Z","title":"Bounds and Constructions for Multi-Symbol Duplication Error Correcting Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02874","kind":"arxiv","version":3},"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:db7bde799fef1b5475e6266230c696d48c0e550aa38eae943f9262f8f63fb28a","target":"record","created_at":"2026-05-18T00:05:21Z","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":"1e81e775cb22868b19900d462ded3afbac3517cb7708de053a5ce6c3f9ab86b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-08T19:56:46Z","title_canon_sha256":"287bc56eb944a95c94568af909bb085401bc9f60e17dca21075bf0eaa7008590"},"schema_version":"1.0","source":{"id":"1807.02874","kind":"arxiv","version":3}},"canonical_sha256":"22ef7d9a0a58421ec72deb7fa4266a7530fe6423b07d0c9b5ba7b451cc21eaf7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22ef7d9a0a58421ec72deb7fa4266a7530fe6423b07d0c9b5ba7b451cc21eaf7","first_computed_at":"2026-05-18T00:05:21.480454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:21.480454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S6Mj64Nwq5QMdd7GYngi6Q9rZdEtsRj1m6m+E/M52jrsP17J+4hsFR4NmYWRXhsuumdrSCUoGu1l1PEVfNvlDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:21.480943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.02874","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db7bde799fef1b5475e6266230c696d48c0e550aa38eae943f9262f8f63fb28a","sha256:7436681e4138760430c311b6346fe67aec1fbaccbec9d84c3eae2bad62a90ae8"],"state_sha256":"87ad5bc534cd39dc1a44100f8a74d4a90d9de90321e90e2c261235a095cf7cb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"atPFpPs/nJE6aHaWHrKrKGa/VYRFA5+ePcL35Q67T5/HCuhP5wb18oDOjBGKxx+T6a9256wJaW2EPzQVBIUQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T10:38:19.041797Z","bundle_sha256":"7f1d29d1943adaf80ea93b82c3782279f515edb94ada8a8d1cd1afe1cf63cd52"}}