{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:476IM2NMMM3MSHKJFHKMJL7P3W","short_pith_number":"pith:476IM2NM","canonical_record":{"source":{"id":"1302.6562","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-26T20:12:59Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"876bccddd8be677c0d45c3a289b8336942e61587d410b0df3798c75a2f8b1eee","abstract_canon_sha256":"2f7f3c99d55c13b3fea3905713191a638da58d4dc6fa66637592629339735e7c"},"schema_version":"1.0"},"canonical_sha256":"e7fc8669ac6336c91d4929d4c4afefddbaa7f82610ce6a49f85c43ff00e297e4","source":{"kind":"arxiv","id":"1302.6562","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6562","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6562v2","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6562","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"476IM2NMMM3M","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"476IM2NMMM3MSHKJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"476IM2NM","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:476IM2NMMM3MSHKJFHKMJL7P3W","target":"record","payload":{"canonical_record":{"source":{"id":"1302.6562","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-26T20:12:59Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"876bccddd8be677c0d45c3a289b8336942e61587d410b0df3798c75a2f8b1eee","abstract_canon_sha256":"2f7f3c99d55c13b3fea3905713191a638da58d4dc6fa66637592629339735e7c"},"schema_version":"1.0"},"canonical_sha256":"e7fc8669ac6336c91d4929d4c4afefddbaa7f82610ce6a49f85c43ff00e297e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:24.545007Z","signature_b64":"cNhyzdhIhWShFG3UcDu41COsYXryACzkLNVcEgHnaEbj6L+ywMF6D6MSG/SrMTbZrZsG2NtFUyP3u9gfJkQgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7fc8669ac6336c91d4929d4c4afefddbaa7f82610ce6a49f85c43ff00e297e4","last_reissued_at":"2026-05-18T03:17:24.544176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:24.544176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.6562","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-05-18T03:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LEAa0OZn6Kadd8NX9k30iyu4HsgWKWr2trhXZeiBJdbiMnyqEDv410I4d2o2HorfuIJm9e/iYigauH0AYofKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:25:43.951034Z"},"content_sha256":"8fbc3a692f531744bfcc1ba98bf135c1ec13c2283feed22035beb529085e79ac","schema_version":"1.0","event_id":"sha256:8fbc3a692f531744bfcc1ba98bf135c1ec13c2283feed22035beb529085e79ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:476IM2NMMM3MSHKJFHKMJL7P3W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Cullina, Negar Kiyavash","submitted_at":"2013-02-26T20:12:59Z","abstract_excerpt":"We consider deletion correcting codes over a q-ary alphabet. It is well known that any code capable of correcting s deletions can also correct any combination of s total insertions and deletions. To obtain asymptotic upper bounds on code size, we apply a packing argument to channels that perform different mixtures of insertions and deletions. Even though the set of codes is identical for all of these channels, the bounds that we obtain vary. Prior to this work, only the bounds corresponding to the all insertion case and the all deletion case were known. We recover these as special cases. The b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6562","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":""},"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-05-18T03:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YtjXOoh5Kxt9LQQLZIeS2WOqtrA8TfxvW9ANLvcAnU4UjlGhsGHLBhMH54lzLdIERjgRxWrG8K/1fyaO6RNFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:25:43.951526Z"},"content_sha256":"7434437c1c6b6e92e1266ac8cbae1d370251edf0fa267f7cfec31a73eb764b96","schema_version":"1.0","event_id":"sha256:7434437c1c6b6e92e1266ac8cbae1d370251edf0fa267f7cfec31a73eb764b96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/476IM2NMMM3MSHKJFHKMJL7P3W/bundle.json","state_url":"https://pith.science/pith/476IM2NMMM3MSHKJFHKMJL7P3W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/476IM2NMMM3MSHKJFHKMJL7P3W/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-05-31T21:25:43Z","links":{"resolver":"https://pith.science/pith/476IM2NMMM3MSHKJFHKMJL7P3W","bundle":"https://pith.science/pith/476IM2NMMM3MSHKJFHKMJL7P3W/bundle.json","state":"https://pith.science/pith/476IM2NMMM3MSHKJFHKMJL7P3W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/476IM2NMMM3MSHKJFHKMJL7P3W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:476IM2NMMM3MSHKJFHKMJL7P3W","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":"2f7f3c99d55c13b3fea3905713191a638da58d4dc6fa66637592629339735e7c","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-26T20:12:59Z","title_canon_sha256":"876bccddd8be677c0d45c3a289b8336942e61587d410b0df3798c75a2f8b1eee"},"schema_version":"1.0","source":{"id":"1302.6562","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6562","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6562v2","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6562","created_at":"2026-05-18T03:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"476IM2NMMM3M","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"476IM2NMMM3MSHKJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"476IM2NM","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:7434437c1c6b6e92e1266ac8cbae1d370251edf0fa267f7cfec31a73eb764b96","target":"graph","created_at":"2026-05-18T03:17:24Z","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"},"paper":{"abstract_excerpt":"We consider deletion correcting codes over a q-ary alphabet. It is well known that any code capable of correcting s deletions can also correct any combination of s total insertions and deletions. To obtain asymptotic upper bounds on code size, we apply a packing argument to channels that perform different mixtures of insertions and deletions. Even though the set of codes is identical for all of these channels, the bounds that we obtain vary. Prior to this work, only the bounds corresponding to the all insertion case and the all deletion case were known. We recover these as special cases. The b","authors_text":"Daniel Cullina, Negar Kiyavash","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-26T20:12:59Z","title":"An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6562","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:8fbc3a692f531744bfcc1ba98bf135c1ec13c2283feed22035beb529085e79ac","target":"record","created_at":"2026-05-18T03:17:24Z","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":"2f7f3c99d55c13b3fea3905713191a638da58d4dc6fa66637592629339735e7c","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-26T20:12:59Z","title_canon_sha256":"876bccddd8be677c0d45c3a289b8336942e61587d410b0df3798c75a2f8b1eee"},"schema_version":"1.0","source":{"id":"1302.6562","kind":"arxiv","version":2}},"canonical_sha256":"e7fc8669ac6336c91d4929d4c4afefddbaa7f82610ce6a49f85c43ff00e297e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7fc8669ac6336c91d4929d4c4afefddbaa7f82610ce6a49f85c43ff00e297e4","first_computed_at":"2026-05-18T03:17:24.544176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:24.544176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cNhyzdhIhWShFG3UcDu41COsYXryACzkLNVcEgHnaEbj6L+ywMF6D6MSG/SrMTbZrZsG2NtFUyP3u9gfJkQgBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:24.545007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.6562","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fbc3a692f531744bfcc1ba98bf135c1ec13c2283feed22035beb529085e79ac","sha256:7434437c1c6b6e92e1266ac8cbae1d370251edf0fa267f7cfec31a73eb764b96"],"state_sha256":"2c06fdf9da3222d87f75e8bb9a7cc745f6fa7edd2fc789000a2d574575600319"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nVKDEfpeDoUkZCaJcHHYjDanokNNtpy6YT09laBPptGLFpyFqyV5DvMV+hnj5IER46K/s8iDMVTxAbKcytHhAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:25:43.953831Z","bundle_sha256":"af8c4e12355b852b0343047a2274934b73b6c686fe7500e99561051855441672"}}