{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q65ATA3RTSDKF4LFS2OLW4LRSB","short_pith_number":"pith:Q65ATA3R","schema_version":"1.0","canonical_sha256":"87ba0983719c86a2f165969cbb7171905d2f0df6eac8ce1107d1ba2729f118ed","source":{"kind":"arxiv","id":"1707.00052","version":2},"attestation_state":"computed","paper":{"title":"Bounds on Codes Correcting Tandem and Palindromic Duplications","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, Eitan Yaakobi","submitted_at":"2017-06-30T21:44:42Z","abstract_excerpt":"In this work, we derive upper bounds on the cardinality of tandem duplication and palindromic deletion correcting codes by deriving the generalized sphere packing bound for these error types. We first prove that an upper bound for tandem deletions is also an upper bound for inserting the respective type of duplications. Therefore, we derive the bounds based on these special deletions as this results in tighter bounds. We determine the spheres for tandem and palindromic duplications/deletions and the number of words with a specific sphere size. Our upper bounds on the cardinality directly imply"},"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":"1707.00052","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-30T21:44:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b5ddbe8f51db1f658afc377253d78713ce6205c5f368d152a651bc58979f0b5","abstract_canon_sha256":"854b909e7dc8553c99bbf8d7f9be404cd53b77225777336e30639875146522f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:56.916870Z","signature_b64":"50O1j8fveXRmsU5tTnc5ntIFV/rqvmaJR7A+S+jj/qAX2nNWQd+IcXkMm4aXm1gmUBfuM9qG1a1o+9SQRZbmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87ba0983719c86a2f165969cbb7171905d2f0df6eac8ce1107d1ba2729f118ed","last_reissued_at":"2026-05-18T00:25:56.916298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:56.916298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on Codes Correcting Tandem and Palindromic Duplications","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, Eitan Yaakobi","submitted_at":"2017-06-30T21:44:42Z","abstract_excerpt":"In this work, we derive upper bounds on the cardinality of tandem duplication and palindromic deletion correcting codes by deriving the generalized sphere packing bound for these error types. We first prove that an upper bound for tandem deletions is also an upper bound for inserting the respective type of duplications. Therefore, we derive the bounds based on these special deletions as this results in tighter bounds. We determine the spheres for tandem and palindromic duplications/deletions and the number of words with a specific sphere size. Our upper bounds on the cardinality directly imply"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00052","kind":"arxiv","version":2},"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":"1707.00052","created_at":"2026-05-18T00:25:56.916397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00052v2","created_at":"2026-05-18T00:25:56.916397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00052","created_at":"2026-05-18T00:25:56.916397+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q65ATA3RTSDK","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q65ATA3RTSDKF4LF","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q65ATA3R","created_at":"2026-05-18T12:31:37.085036+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":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q65ATA3RTSDKF4LFS2OLW4LRSB","json":"https://pith.science/pith/Q65ATA3RTSDKF4LFS2OLW4LRSB.json","graph_json":"https://pith.science/api/pith-number/Q65ATA3RTSDKF4LFS2OLW4LRSB/graph.json","events_json":"https://pith.science/api/pith-number/Q65ATA3RTSDKF4LFS2OLW4LRSB/events.json","paper":"https://pith.science/paper/Q65ATA3R"},"agent_actions":{"view_html":"https://pith.science/pith/Q65ATA3RTSDKF4LFS2OLW4LRSB","download_json":"https://pith.science/pith/Q65ATA3RTSDKF4LFS2OLW4LRSB.json","view_paper":"https://pith.science/paper/Q65ATA3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00052&json=true","fetch_graph":"https://pith.science/api/pith-number/Q65ATA3RTSDKF4LFS2OLW4LRSB/graph.json","fetch_events":"https://pith.science/api/pith-number/Q65ATA3RTSDKF4LFS2OLW4LRSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q65ATA3RTSDKF4LFS2OLW4LRSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q65ATA3RTSDKF4LFS2OLW4LRSB/action/storage_attestation","attest_author":"https://pith.science/pith/Q65ATA3RTSDKF4LFS2OLW4LRSB/action/author_attestation","sign_citation":"https://pith.science/pith/Q65ATA3RTSDKF4LFS2OLW4LRSB/action/citation_signature","submit_replication":"https://pith.science/pith/Q65ATA3RTSDKF4LFS2OLW4LRSB/action/replication_record"}},"created_at":"2026-05-18T00:25:56.916397+00:00","updated_at":"2026-05-18T00:25:56.916397+00:00"}