{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:27UBLZ45IS4ZLIIMNQOZKWA3BR","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":"b8c8173e31ddaf6987afa836751f54ca37560b9e9846da15f9bccc60b45059d6","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-06T11:38:57Z","title_canon_sha256":"6a7f8b003f66bbb0703df5d6b9170dd8a38fdaf81fcc4cc58a6aa93bc78dc959"},"schema_version":"1.0","source":{"id":"2408.03113","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.03113","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"2408.03113v5","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03113","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"27UBLZ45IS4Z","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"pith_short_16","alias_value":"27UBLZ45IS4ZLIIM","created_at":"2026-07-05T12:06:00Z"},{"alias_kind":"pith_short_8","alias_value":"27UBLZ45","created_at":"2026-07-05T12:06:00Z"}],"graph_snapshots":[{"event_id":"sha256:c7bbda6b1771a6e7a5112479a414d523f244cec7272575dd7907afe56b632f3e","target":"graph","created_at":"2026-07-05T12:06:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.03113/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gennian Ge, Ohad Elishco, Wenjun Yu, Yubo Sun, Zuo Ye","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-06T11:38:57Z","title":"Codes Correcting Two Bursts of Exactly $b$ Deletions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03113","kind":"arxiv","version":5},"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:25c2c6970058bffcb66b8db6fd466980d699131f0961c517ee5c81a8282e565d","target":"record","created_at":"2026-07-05T12:06:00Z","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":"b8c8173e31ddaf6987afa836751f54ca37560b9e9846da15f9bccc60b45059d6","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-08-06T11:38:57Z","title_canon_sha256":"6a7f8b003f66bbb0703df5d6b9170dd8a38fdaf81fcc4cc58a6aa93bc78dc959"},"schema_version":"1.0","source":{"id":"2408.03113","kind":"arxiv","version":5}},"canonical_sha256":"d7e815e79d44b995a10c6c1d95581b0c4d010f63a8acc84ef7b9ed8fe1ae2629","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7e815e79d44b995a10c6c1d95581b0c4d010f63a8acc84ef7b9ed8fe1ae2629","first_computed_at":"2026-07-05T12:06:00.973982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:06:00.973982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kn+5kLMQI+Tu8NK+dM5Y+6e/aun4a0FZUxvcxAIoTr/kmg2S134Cjeenv+TAYoFDIhudX7douemgtW/I9gEqAA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:06:00.974493Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.03113","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25c2c6970058bffcb66b8db6fd466980d699131f0961c517ee5c81a8282e565d","sha256:c7bbda6b1771a6e7a5112479a414d523f244cec7272575dd7907afe56b632f3e"],"state_sha256":"0f1b87c84a1ac7f8c36e76dab0d542040a1d44276237cdab6e75a7ca2ab5f528"}