{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XDZEAJDAYT2TF57XWBAEB6X4EC","short_pith_number":"pith:XDZEAJDA","canonical_record":{"source":{"id":"1211.3128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-13T21:02:06Z","cross_cats_sorted":["math.CO","math.IT","math.NT","math.OC"],"title_canon_sha256":"8641ab2afac223081d3e806f4efc83a0db307123bc48412c25d638e45c07fcd4","abstract_canon_sha256":"4cbc5606a3726ed9cb181ccd24a2fb438ac9354158eac7fbadc8f4e7e05939ab"},"schema_version":"1.0"},"canonical_sha256":"b8f2402460c4f532f7f7b04040fafc20bfbeb3917e1ad2ce5940f12eaf5fa6bc","source":{"kind":"arxiv","id":"1211.3128","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3128","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3128v1","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3128","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"XDZEAJDAYT2T","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XDZEAJDAYT2TF57X","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XDZEAJDA","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XDZEAJDAYT2TF57XWBAEB6X4EC","target":"record","payload":{"canonical_record":{"source":{"id":"1211.3128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-13T21:02:06Z","cross_cats_sorted":["math.CO","math.IT","math.NT","math.OC"],"title_canon_sha256":"8641ab2afac223081d3e806f4efc83a0db307123bc48412c25d638e45c07fcd4","abstract_canon_sha256":"4cbc5606a3726ed9cb181ccd24a2fb438ac9354158eac7fbadc8f4e7e05939ab"},"schema_version":"1.0"},"canonical_sha256":"b8f2402460c4f532f7f7b04040fafc20bfbeb3917e1ad2ce5940f12eaf5fa6bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:50.796764Z","signature_b64":"srOeU2SYMdA6r5mFmGbful2XKL7PVDoevMexYaDvPP9NnxmG+9apbrjuuUkoULcxdg8cbmI1I8o7rATxSJJECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8f2402460c4f532f7f7b04040fafc20bfbeb3917e1ad2ce5940f12eaf5fa6bc","last_reissued_at":"2026-05-18T03:40:50.796072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:50.796072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.3128","source_version":1,"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:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NWcrpGpogfhnQ+8x/Zd1BPVWG5XTFnu3uYeof63f+dA8lJQBbV8nzEKSIXvK+ZnF04JubJ8tX10qivyi6sEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:21:03.675377Z"},"content_sha256":"7ea5d4c252bbf882a1d3c35e8dc171b51076848f89587f97d80523fae5aca28b","schema_version":"1.0","event_id":"sha256:7ea5d4c252bbf882a1d3c35e8dc171b51076848f89587f97d80523fae5aca28b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XDZEAJDAYT2TF57XWBAEB6X4EC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-asymptotic Upper Bounds for Deletion Correcting Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT","math.NT","math.OC"],"primary_cat":"cs.IT","authors_text":"Ankur A. Kulkarni, Negar Kiyavash","submitted_at":"2012-11-13T21:02:06Z","abstract_excerpt":"Explicit non-asymptotic upper bounds on the sizes of multiple-deletion correcting codes are presented. In particular, the largest single-deletion correcting code for $q$-ary alphabet and string length $n$ is shown to be of size at most $\\frac{q^n-q}{(q-1)(n-1)}$. An improved bound on the asymptotic rate function is obtained as a corollary. Upper bounds are also derived on sizes of codes for a constrained source that does not necessarily comprise of all strings of a particular length, and this idea is demonstrated by application to sets of run-length limited strings.\n  The problem of finding th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3128","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":""},"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:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WXDNfKsJaQmlmz1WuBtkdQXNrOBGuUplfuixKIUOjMfO1IUpYNbrsqVXLKnY7n17cw5kwz83Cf9jbbl/LUD3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:21:03.675723Z"},"content_sha256":"822210611ffb96d3b33eb6bd62980c465974b157b1bad0fd874b2e9d3a16ddd6","schema_version":"1.0","event_id":"sha256:822210611ffb96d3b33eb6bd62980c465974b157b1bad0fd874b2e9d3a16ddd6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDZEAJDAYT2TF57XWBAEB6X4EC/bundle.json","state_url":"https://pith.science/pith/XDZEAJDAYT2TF57XWBAEB6X4EC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDZEAJDAYT2TF57XWBAEB6X4EC/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-06-28T13:21:03Z","links":{"resolver":"https://pith.science/pith/XDZEAJDAYT2TF57XWBAEB6X4EC","bundle":"https://pith.science/pith/XDZEAJDAYT2TF57XWBAEB6X4EC/bundle.json","state":"https://pith.science/pith/XDZEAJDAYT2TF57XWBAEB6X4EC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDZEAJDAYT2TF57XWBAEB6X4EC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XDZEAJDAYT2TF57XWBAEB6X4EC","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":"4cbc5606a3726ed9cb181ccd24a2fb438ac9354158eac7fbadc8f4e7e05939ab","cross_cats_sorted":["math.CO","math.IT","math.NT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-13T21:02:06Z","title_canon_sha256":"8641ab2afac223081d3e806f4efc83a0db307123bc48412c25d638e45c07fcd4"},"schema_version":"1.0","source":{"id":"1211.3128","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3128","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3128v1","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3128","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"XDZEAJDAYT2T","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XDZEAJDAYT2TF57X","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XDZEAJDA","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:822210611ffb96d3b33eb6bd62980c465974b157b1bad0fd874b2e9d3a16ddd6","target":"graph","created_at":"2026-05-18T03:40:50Z","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":"Explicit non-asymptotic upper bounds on the sizes of multiple-deletion correcting codes are presented. In particular, the largest single-deletion correcting code for $q$-ary alphabet and string length $n$ is shown to be of size at most $\\frac{q^n-q}{(q-1)(n-1)}$. An improved bound on the asymptotic rate function is obtained as a corollary. Upper bounds are also derived on sizes of codes for a constrained source that does not necessarily comprise of all strings of a particular length, and this idea is demonstrated by application to sets of run-length limited strings.\n  The problem of finding th","authors_text":"Ankur A. Kulkarni, Negar Kiyavash","cross_cats":["math.CO","math.IT","math.NT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-13T21:02:06Z","title":"Non-asymptotic Upper Bounds for Deletion Correcting Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3128","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:7ea5d4c252bbf882a1d3c35e8dc171b51076848f89587f97d80523fae5aca28b","target":"record","created_at":"2026-05-18T03:40:50Z","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":"4cbc5606a3726ed9cb181ccd24a2fb438ac9354158eac7fbadc8f4e7e05939ab","cross_cats_sorted":["math.CO","math.IT","math.NT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-13T21:02:06Z","title_canon_sha256":"8641ab2afac223081d3e806f4efc83a0db307123bc48412c25d638e45c07fcd4"},"schema_version":"1.0","source":{"id":"1211.3128","kind":"arxiv","version":1}},"canonical_sha256":"b8f2402460c4f532f7f7b04040fafc20bfbeb3917e1ad2ce5940f12eaf5fa6bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8f2402460c4f532f7f7b04040fafc20bfbeb3917e1ad2ce5940f12eaf5fa6bc","first_computed_at":"2026-05-18T03:40:50.796072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:50.796072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"srOeU2SYMdA6r5mFmGbful2XKL7PVDoevMexYaDvPP9NnxmG+9apbrjuuUkoULcxdg8cbmI1I8o7rATxSJJECw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:50.796764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3128","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ea5d4c252bbf882a1d3c35e8dc171b51076848f89587f97d80523fae5aca28b","sha256:822210611ffb96d3b33eb6bd62980c465974b157b1bad0fd874b2e9d3a16ddd6"],"state_sha256":"c38e81baba2742eb2ebb2653cd2d98dd9dbcdd90eac20ed59208d94b8858758f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eS/yi8qUtR2vvMzxFspzelLSn8hc7iVMws2OTnQdx4aCAIIsdJ2J3G14CIJt6gsjhq/lbeFyufnYyR8dDtbhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T13:21:03.677715Z","bundle_sha256":"1db2798f46cebc32d154ad4d96b77b2154956bcee5bd0905ef8c0a780e0c6faf"}}