{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:27UBLZ45IS4ZLIIMNQOZKWA3BR","short_pith_number":"pith:27UBLZ45","schema_version":"1.0","canonical_sha256":"d7e815e79d44b995a10c6c1d95581b0c4d010f63a8acc84ef7b9ed8fe1ae2629","source":{"kind":"arxiv","id":"2408.03113","version":5},"attestation_state":"computed","paper":{"title":"Codes Correcting Two Bursts of Exactly $b$ Deletions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Ohad Elishco, Wenjun Yu, Yubo Sun, Zuo Ye","submitted_at":"2024-08-06T11:38:57Z","abstract_excerpt":"In this paper, we investigate codes designed to correct two bursts of deletions, where each burst has a length of exactly $b$, where $b>1$. The previous best construction, achieved through the syndrome compression technique, had a redundancy of at most $7\\log n+O\\left(\\log n/\\log\\log n\\right)$ bits. In contrast, our work introduces a novel approach for constructing $q$-ary codes that attain a redundancy of at most $5\\log n+O(\\log\\log n)$ bits for all $b>1$ and $q\\ge2$. Additionally, for the case where $b=1$, we present a new construction of $q$-ary two-deletion correcting codes with a redundan"},"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":"2408.03113","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-06T11:38:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6a7f8b003f66bbb0703df5d6b9170dd8a38fdaf81fcc4cc58a6aa93bc78dc959","abstract_canon_sha256":"b8c8173e31ddaf6987afa836751f54ca37560b9e9846da15f9bccc60b45059d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:00.974493Z","signature_b64":"kn+5kLMQI+Tu8NK+dM5Y+6e/aun4a0FZUxvcxAIoTr/kmg2S134Cjeenv+TAYoFDIhudX7douemgtW/I9gEqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7e815e79d44b995a10c6c1d95581b0c4d010f63a8acc84ef7b9ed8fe1ae2629","last_reissued_at":"2026-07-05T12:06:00.973982Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:00.973982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Codes Correcting Two Bursts of Exactly $b$ Deletions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Ohad Elishco, Wenjun Yu, Yubo Sun, Zuo Ye","submitted_at":"2024-08-06T11:38:57Z","abstract_excerpt":"In this paper, we investigate codes designed to correct two bursts of deletions, where each burst has a length of exactly $b$, where $b>1$. The previous best construction, achieved through the syndrome compression technique, had a redundancy of at most $7\\log n+O\\left(\\log n/\\log\\log n\\right)$ bits. In contrast, our work introduces a novel approach for constructing $q$-ary codes that attain a redundancy of at most $5\\log n+O(\\log\\log n)$ bits for all $b>1$ and $q\\ge2$. Additionally, for the case where $b=1$, we present a new construction of $q$-ary two-deletion correcting codes with a redundan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03113","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.03113/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2408.03113","created_at":"2026-07-05T12:06:00.974035+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.03113v5","created_at":"2026-07-05T12:06:00.974035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03113","created_at":"2026-07-05T12:06:00.974035+00:00"},{"alias_kind":"pith_short_12","alias_value":"27UBLZ45IS4Z","created_at":"2026-07-05T12:06:00.974035+00:00"},{"alias_kind":"pith_short_16","alias_value":"27UBLZ45IS4ZLIIM","created_at":"2026-07-05T12:06:00.974035+00:00"},{"alias_kind":"pith_short_8","alias_value":"27UBLZ45","created_at":"2026-07-05T12:06:00.974035+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04797","citing_title":"Correcting Bursty/Localized Deletions: A New Error-Position-Estimation Code","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/27UBLZ45IS4ZLIIMNQOZKWA3BR","json":"https://pith.science/pith/27UBLZ45IS4ZLIIMNQOZKWA3BR.json","graph_json":"https://pith.science/api/pith-number/27UBLZ45IS4ZLIIMNQOZKWA3BR/graph.json","events_json":"https://pith.science/api/pith-number/27UBLZ45IS4ZLIIMNQOZKWA3BR/events.json","paper":"https://pith.science/paper/27UBLZ45"},"agent_actions":{"view_html":"https://pith.science/pith/27UBLZ45IS4ZLIIMNQOZKWA3BR","download_json":"https://pith.science/pith/27UBLZ45IS4ZLIIMNQOZKWA3BR.json","view_paper":"https://pith.science/paper/27UBLZ45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.03113&json=true","fetch_graph":"https://pith.science/api/pith-number/27UBLZ45IS4ZLIIMNQOZKWA3BR/graph.json","fetch_events":"https://pith.science/api/pith-number/27UBLZ45IS4ZLIIMNQOZKWA3BR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/27UBLZ45IS4ZLIIMNQOZKWA3BR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/27UBLZ45IS4ZLIIMNQOZKWA3BR/action/storage_attestation","attest_author":"https://pith.science/pith/27UBLZ45IS4ZLIIMNQOZKWA3BR/action/author_attestation","sign_citation":"https://pith.science/pith/27UBLZ45IS4ZLIIMNQOZKWA3BR/action/citation_signature","submit_replication":"https://pith.science/pith/27UBLZ45IS4ZLIIMNQOZKWA3BR/action/replication_record"}},"created_at":"2026-07-05T12:06:00.974035+00:00","updated_at":"2026-07-05T12:06:00.974035+00:00"}