{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:CHDKCXTXZCMGR7H4NBLVG7KWHF","short_pith_number":"pith:CHDKCXTX","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"},"canonical_sha256":"11c6a15e77c89868fcfc6857537d5639448fa316d13ca8ba8ee142d84d82a39d","source":{"kind":"arxiv","id":"2209.11882","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.11882","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"arxiv_version","alias_value":"2209.11882v2","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.11882","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"pith_short_12","alias_value":"CHDKCXTXZCMG","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"pith_short_16","alias_value":"CHDKCXTXZCMGR7H4","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"pith_short_8","alias_value":"CHDKCXTX","created_at":"2026-07-05T07:01:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:CHDKCXTXZCMGR7H4NBLVG7KWHF","target":"record","payload":{"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"},"canonical_sha256":"11c6a15e77c89868fcfc6857537d5639448fa316d13ca8ba8ee142d84d82a39d","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"},"source_kind":"arxiv","source_id":"2209.11882","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:01:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZR5XZsu5/b2t38iXXI1+7um13Ld/b0TPzUht8J3EGkGYkMWqxznhysr9D+p2/AISOAMLrsaqlWn+I7RK1P8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T02:27:20.175911Z"},"content_sha256":"23918dcaeace89dfa2830ed0539a08e9e4f102efbdf2c1019bc1d92bb83e8044","schema_version":"1.0","event_id":"sha256:23918dcaeace89dfa2830ed0539a08e9e4f102efbdf2c1019bc1d92bb83e8044"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:CHDKCXTXZCMGR7H4NBLVG7KWHF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:01:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOHKVlB8wt7nLDGtEzTa2uXXTyfEDUeS5/hBHVKCXad9CaPD4uYbD9i0LewEMuNYqOb7JMnkU7xkgjfLGaDCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T02:27:20.176582Z"},"content_sha256":"7c97a1fb72de272cc37e544bdbc2d248a57468a7a0ed4ac3b1f99d2ff97e2838","schema_version":"1.0","event_id":"sha256:7c97a1fb72de272cc37e544bdbc2d248a57468a7a0ed4ac3b1f99d2ff97e2838"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF/bundle.json","state_url":"https://pith.science/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-12T02:27:20Z","links":{"resolver":"https://pith.science/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF","bundle":"https://pith.science/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF/bundle.json","state":"https://pith.science/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CHDKCXTXZCMGR7H4NBLVG7KWHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:CHDKCXTXZCMGR7H4NBLVG7KWHF","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":"c72db1170d34d5d3f168d25e5abe562b8409bb92f5719a6d51ac47df8a033626","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2022-09-23T22:41:56Z","title_canon_sha256":"850ab488a4eb7fbe41645feab1e38645d747745abad4c8d297bb5cdd0ffbb199"},"schema_version":"1.0","source":{"id":"2209.11882","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.11882","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"arxiv_version","alias_value":"2209.11882v2","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.11882","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"pith_short_12","alias_value":"CHDKCXTXZCMG","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"pith_short_16","alias_value":"CHDKCXTXZCMGR7H4","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"pith_short_8","alias_value":"CHDKCXTX","created_at":"2026-07-05T07:01:57Z"}],"graph_snapshots":[{"event_id":"sha256:7c97a1fb72de272cc37e544bdbc2d248a57468a7a0ed4ac3b1f99d2ff97e2838","target":"graph","created_at":"2026-07-05T07:01:57Z","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/2209.11882/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ben Graham, Gabriela Bourla, Noah Kravitz, Noga Alon, Xiaoyu He","cross_cats":["cs.DM","cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2022-09-23T22:41:56Z","title":"Logarithmically larger deletion codes of all distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.11882","kind":"arxiv","version":2},"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:23918dcaeace89dfa2830ed0539a08e9e4f102efbdf2c1019bc1d92bb83e8044","target":"record","created_at":"2026-07-05T07:01:57Z","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":"c72db1170d34d5d3f168d25e5abe562b8409bb92f5719a6d51ac47df8a033626","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2022-09-23T22:41:56Z","title_canon_sha256":"850ab488a4eb7fbe41645feab1e38645d747745abad4c8d297bb5cdd0ffbb199"},"schema_version":"1.0","source":{"id":"2209.11882","kind":"arxiv","version":2}},"canonical_sha256":"11c6a15e77c89868fcfc6857537d5639448fa316d13ca8ba8ee142d84d82a39d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11c6a15e77c89868fcfc6857537d5639448fa316d13ca8ba8ee142d84d82a39d","first_computed_at":"2026-07-05T07:01:57.382547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:01:57.382547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mXxLPnfh3+ivNzScuDJU+6vQ1DA+qOL3FQIhazIvdlvbp8/HzNrXi8c1OCpB3o3I7aRPESFnwgZQizLzqvlsCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:01:57.383063Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.11882","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23918dcaeace89dfa2830ed0539a08e9e4f102efbdf2c1019bc1d92bb83e8044","sha256:7c97a1fb72de272cc37e544bdbc2d248a57468a7a0ed4ac3b1f99d2ff97e2838"],"state_sha256":"afd637e4fb516c89d18049dffe1f58cefe159d88ff7f2ca658ac8d4541a44b0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dopdMft+H3QZB6PAwnKxAFJ+JAvSGovdWA7n2tzAjbInF14HWRmojmj45RZhhKnli1XcRkQtaMzNQyBP9mR3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T02:27:20.180372Z","bundle_sha256":"c738537528a55978f954615a1ed30351982b1eaa5cd09965a9f20a19424d155c"}}