{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:CHDKCXTXZCMGR7H4NBLVG7KWHF","short_pith_number":"pith:CHDKCXTX","schema_version":"1.0","canonical_sha256":"11c6a15e77c89868fcfc6857537d5639448fa316d13ca8ba8ee142d84d82a39d","source":{"kind":"arxiv","id":"2209.11882","version":2},"attestation_state":"computed","paper":{"title":"Logarithmically larger deletion codes of all distances","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Ben Graham, Gabriela Bourla, Noah Kravitz, Noga Alon, Xiaoyu He","submitted_at":"2022-09-23T22:41:56Z","abstract_excerpt":"The deletion distance between two binary words $u,v \\in \\{0,1\\}^n$ is the smallest $k$ such that $u$ and $v$ share a common subsequence of length $n-k$. A set $C$ of binary words of length $n$ is called a $k$-deletion code if every pair of distinct words in $C$ has deletion distance greater than $k$. In 1965, Levenshtein initiated the study of deletion codes by showing that, for $k\\ge 1$ fixed and $n$ going to infinity, a $k$-deletion code $C\\subseteq \\{0,1\\}^n$ of maximum size satisfies $\\Omega_k(2^n/n^{2k}) \\leq |C| \\leq O_k( 2^n/n^k)$. We make the first asymptotic improvement to these bound"},"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":"2209.11882","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2022-09-23T22:41:56Z","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"title_canon_sha256":"850ab488a4eb7fbe41645feab1e38645d747745abad4c8d297bb5cdd0ffbb199","abstract_canon_sha256":"c72db1170d34d5d3f168d25e5abe562b8409bb92f5719a6d51ac47df8a033626"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:01:57.383063Z","signature_b64":"mXxLPnfh3+ivNzScuDJU+6vQ1DA+qOL3FQIhazIvdlvbp8/HzNrXi8c1OCpB3o3I7aRPESFnwgZQizLzqvlsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11c6a15e77c89868fcfc6857537d5639448fa316d13ca8ba8ee142d84d82a39d","last_reissued_at":"2026-07-05T07:01:57.382547Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:01:57.382547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logarithmically larger deletion codes of all distances","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Ben Graham, Gabriela Bourla, Noah Kravitz, Noga Alon, Xiaoyu He","submitted_at":"2022-09-23T22:41:56Z","abstract_excerpt":"The deletion distance between two binary words $u,v \\in \\{0,1\\}^n$ is the smallest $k$ such that $u$ and $v$ share a common subsequence of length $n-k$. A set $C$ of binary words of length $n$ is called a $k$-deletion code if every pair of distinct words in $C$ has deletion distance greater than $k$. In 1965, Levenshtein initiated the study of deletion codes by showing that, for $k\\ge 1$ fixed and $n$ going to infinity, a $k$-deletion code $C\\subseteq \\{0,1\\}^n$ of maximum size satisfies $\\Omega_k(2^n/n^{2k}) \\leq |C| \\leq O_k( 2^n/n^k)$. We make the first asymptotic improvement to these bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.11882","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.11882/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":"2209.11882","created_at":"2026-07-05T07:01:57.382613+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.11882v2","created_at":"2026-07-05T07:01:57.382613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.11882","created_at":"2026-07-05T07:01:57.382613+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHDKCXTXZCMG","created_at":"2026-07-05T07:01:57.382613+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHDKCXTXZCMGR7H4","created_at":"2026-07-05T07:01:57.382613+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHDKCXTX","created_at":"2026-07-05T07:01:57.382613+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF","json":"https://pith.science/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF.json","graph_json":"https://pith.science/api/pith-number/CHDKCXTXZCMGR7H4NBLVG7KWHF/graph.json","events_json":"https://pith.science/api/pith-number/CHDKCXTXZCMGR7H4NBLVG7KWHF/events.json","paper":"https://pith.science/paper/CHDKCXTX"},"agent_actions":{"view_html":"https://pith.science/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF","download_json":"https://pith.science/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF.json","view_paper":"https://pith.science/paper/CHDKCXTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.11882&json=true","fetch_graph":"https://pith.science/api/pith-number/CHDKCXTXZCMGR7H4NBLVG7KWHF/graph.json","fetch_events":"https://pith.science/api/pith-number/CHDKCXTXZCMGR7H4NBLVG7KWHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF/action/storage_attestation","attest_author":"https://pith.science/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF/action/author_attestation","sign_citation":"https://pith.science/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF/action/citation_signature","submit_replication":"https://pith.science/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF/action/replication_record"}},"created_at":"2026-07-05T07:01:57.382613+00:00","updated_at":"2026-07-05T07:01:57.382613+00:00"}