{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:2TT7D6BHGZQMXSTEY3JKB2EXM5","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":"69c207e930321d586c9a25234177f504d10f2a57fcd301dd544f53cce62b9e73","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-03-30T13:32:34Z","title_canon_sha256":"a0db9b936496d957af34040432494ec0c0aa6f7bc728eb88dcb001007ad1fae2"},"schema_version":"1.0","source":{"id":"2303.17370","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.17370","created_at":"2026-07-05T05:56:33Z"},{"alias_kind":"arxiv_version","alias_value":"2303.17370v1","created_at":"2026-07-05T05:56:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17370","created_at":"2026-07-05T05:56:33Z"},{"alias_kind":"pith_short_12","alias_value":"2TT7D6BHGZQM","created_at":"2026-07-05T05:56:33Z"},{"alias_kind":"pith_short_16","alias_value":"2TT7D6BHGZQMXSTE","created_at":"2026-07-05T05:56:33Z"},{"alias_kind":"pith_short_8","alias_value":"2TT7D6BH","created_at":"2026-07-05T05:56:33Z"}],"graph_snapshots":[{"event_id":"sha256:b772227041240d096d2ddaf304e4ffa4d0252d5ad2148f72bb2990ede1f67798","target":"graph","created_at":"2026-07-05T05:56:33Z","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/2303.17370/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work continues the study of linear error correcting codes against adversarial insertion deletion errors (insdel errors). Previously, the work of Cheng, Guruswami, Haeupler, and Li \\cite{CGHL21} showed the existence of asymptotically good linear insdel codes that can correct arbitrarily close to $1$ fraction of errors over some constant size alphabet, or achieve rate arbitrarily close to $1/2$ even over the binary alphabet. As shown in \\cite{CGHL21}, these bounds are also the best possible. However, known explicit constructions in \\cite{CGHL21}, and subsequent improved constructions by Con","authors_text":"Kuan Cheng, Xin Li, Yu Zheng, Zhengzhong Jin, Zhide Wei","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-03-30T13:32:34Z","title":"Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.17370","kind":"arxiv","version":1},"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:d39963e1d2c06d6171355713477017d52a5b1f008b04fe45595b7472047dd541","target":"record","created_at":"2026-07-05T05:56:33Z","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":"69c207e930321d586c9a25234177f504d10f2a57fcd301dd544f53cce62b9e73","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-03-30T13:32:34Z","title_canon_sha256":"a0db9b936496d957af34040432494ec0c0aa6f7bc728eb88dcb001007ad1fae2"},"schema_version":"1.0","source":{"id":"2303.17370","kind":"arxiv","version":1}},"canonical_sha256":"d4e7f1f8273660cbca64c6d2a0e897675b263c2434113ae56cd33e52330c6bc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4e7f1f8273660cbca64c6d2a0e897675b263c2434113ae56cd33e52330c6bc4","first_computed_at":"2026-07-05T05:56:33.255551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:56:33.255551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+3+uAYUUTwb7MAWvN66u7Dg5QUkt4eQHekWYt37PLy1cXxB+cZ6/GCCFahUFK3QOrzvwZR5mgPR2fcoSjpizDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:56:33.256385Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.17370","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d39963e1d2c06d6171355713477017d52a5b1f008b04fe45595b7472047dd541","sha256:b772227041240d096d2ddaf304e4ffa4d0252d5ad2148f72bb2990ede1f67798"],"state_sha256":"9216cd8aae87e16d6df47f9c90337b3a82dfc5e2dda2cc2d081fa0f51428dab1"}