{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LJ7UVUQNRDAWT6VN22WZDUJ3UK","short_pith_number":"pith:LJ7UVUQN","schema_version":"1.0","canonical_sha256":"5a7f4ad20d88c169faadd6ad91d13ba2a97bf3bc70d72c0ada767344f320c7f4","source":{"kind":"arxiv","id":"2401.11231","version":1},"attestation_state":"computed","paper":{"title":"Two-Insertion/Deletion/Substitution Correcting Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yuhang Pi, Zhifang Zhang","submitted_at":"2024-01-20T13:46:16Z","abstract_excerpt":"In recent years, the emergence of DNA storage systems has led to a widespread focus on the research of codes correcting insertions, deletions, and classic substitutions. During the initial investigation, Levenshtein discovered the VT codes are precisely capable of correcting single insertion/deletion and then extended the VT construction to single-insertion/deletion/substitution ($1$-ins/del/sub) correcting codes. Inspired by this, we generalize the recent findings of $1$-del $1$-sub correcting codes with redundancy $6\\log_{2}n+O(1)$ to more general $2$-ins/del/sub correcting codes without inc"},"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":"2401.11231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-20T13:46:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9a6ad9bd976dc307a870a922dfef23cb31cc1c3f11380f2596c6a6c368cf1754","abstract_canon_sha256":"1d50c57a5db9ab9ac80171e916c4c034dfa5d806c63a3326ccf4b1b9a9adf929"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:47.649744Z","signature_b64":"a9PNu0kCnjOeI7CzWdgEKM6vbsGUmjAYMAtsyvvX6TG5PzfX9PtYEJM34IVBHN0YRHD0W8w6XR1f/P/X3oFyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a7f4ad20d88c169faadd6ad91d13ba2a97bf3bc70d72c0ada767344f320c7f4","last_reissued_at":"2026-07-05T07:35:47.649298Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:47.649298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Insertion/Deletion/Substitution Correcting Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yuhang Pi, Zhifang Zhang","submitted_at":"2024-01-20T13:46:16Z","abstract_excerpt":"In recent years, the emergence of DNA storage systems has led to a widespread focus on the research of codes correcting insertions, deletions, and classic substitutions. During the initial investigation, Levenshtein discovered the VT codes are precisely capable of correcting single insertion/deletion and then extended the VT construction to single-insertion/deletion/substitution ($1$-ins/del/sub) correcting codes. Inspired by this, we generalize the recent findings of $1$-del $1$-sub correcting codes with redundancy $6\\log_{2}n+O(1)$ to more general $2$-ins/del/sub correcting codes without inc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11231","kind":"arxiv","version":1},"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/2401.11231/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":"2401.11231","created_at":"2026-07-05T07:35:47.649364+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.11231v1","created_at":"2026-07-05T07:35:47.649364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11231","created_at":"2026-07-05T07:35:47.649364+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJ7UVUQNRDAW","created_at":"2026-07-05T07:35:47.649364+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJ7UVUQNRDAWT6VN","created_at":"2026-07-05T07:35:47.649364+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJ7UVUQN","created_at":"2026-07-05T07:35:47.649364+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04806","citing_title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LJ7UVUQNRDAWT6VN22WZDUJ3UK","json":"https://pith.science/pith/LJ7UVUQNRDAWT6VN22WZDUJ3UK.json","graph_json":"https://pith.science/api/pith-number/LJ7UVUQNRDAWT6VN22WZDUJ3UK/graph.json","events_json":"https://pith.science/api/pith-number/LJ7UVUQNRDAWT6VN22WZDUJ3UK/events.json","paper":"https://pith.science/paper/LJ7UVUQN"},"agent_actions":{"view_html":"https://pith.science/pith/LJ7UVUQNRDAWT6VN22WZDUJ3UK","download_json":"https://pith.science/pith/LJ7UVUQNRDAWT6VN22WZDUJ3UK.json","view_paper":"https://pith.science/paper/LJ7UVUQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.11231&json=true","fetch_graph":"https://pith.science/api/pith-number/LJ7UVUQNRDAWT6VN22WZDUJ3UK/graph.json","fetch_events":"https://pith.science/api/pith-number/LJ7UVUQNRDAWT6VN22WZDUJ3UK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJ7UVUQNRDAWT6VN22WZDUJ3UK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJ7UVUQNRDAWT6VN22WZDUJ3UK/action/storage_attestation","attest_author":"https://pith.science/pith/LJ7UVUQNRDAWT6VN22WZDUJ3UK/action/author_attestation","sign_citation":"https://pith.science/pith/LJ7UVUQNRDAWT6VN22WZDUJ3UK/action/citation_signature","submit_replication":"https://pith.science/pith/LJ7UVUQNRDAWT6VN22WZDUJ3UK/action/replication_record"}},"created_at":"2026-07-05T07:35:47.649364+00:00","updated_at":"2026-07-05T07:35:47.649364+00:00"}