{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HY5FOSB2OD4OWUP26SULCM65FH","short_pith_number":"pith:HY5FOSB2","canonical_record":{"source":{"id":"1507.06175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-22T13:20:28Z","cross_cats_sorted":["cs.DM","cs.DS","math.IT"],"title_canon_sha256":"5d8ca2246b1da59ebd2db8ee43a580f57c09d76c6de7cbb5b35d59b3ff66ff14","abstract_canon_sha256":"c094cb3a741b06e90b8dcc57d67475bf472fb7a8f99a25d053efeb0fe3d2aa98"},"schema_version":"1.0"},"canonical_sha256":"3e3a57483a70f8eb51faf4a8b133dd29c3e276e22f7a3f0f6549ac83123b1f81","source":{"kind":"arxiv","id":"1507.06175","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06175","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06175v2","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06175","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"HY5FOSB2OD4O","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HY5FOSB2OD4OWUP2","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HY5FOSB2","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HY5FOSB2OD4OWUP26SULCM65FH","target":"record","payload":{"canonical_record":{"source":{"id":"1507.06175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-22T13:20:28Z","cross_cats_sorted":["cs.DM","cs.DS","math.IT"],"title_canon_sha256":"5d8ca2246b1da59ebd2db8ee43a580f57c09d76c6de7cbb5b35d59b3ff66ff14","abstract_canon_sha256":"c094cb3a741b06e90b8dcc57d67475bf472fb7a8f99a25d053efeb0fe3d2aa98"},"schema_version":"1.0"},"canonical_sha256":"3e3a57483a70f8eb51faf4a8b133dd29c3e276e22f7a3f0f6549ac83123b1f81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:53.757287Z","signature_b64":"BhZUDk+FavZoqs9nwK/Zw/QfuZ6BwQOkB1YyTDSDwFx6jwibQ3cJNozAYRdjsgQJ8xjTfPdFw/C2Lquis9kDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e3a57483a70f8eb51faf4a8b133dd29c3e276e22f7a3f0f6549ac83123b1f81","last_reissued_at":"2026-05-17T23:45:53.756860Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:53.756860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.06175","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-17T23:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TLPegaPVdH9dpAeAF3KeNrWh7txBNxxSuj4mPllwsR73eha1LlbK+T/qMZ7Mfm0+msrHFxILITkp+6pQefQ4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:53:10.748912Z"},"content_sha256":"2762bcebc177cf358e8f77ac40bfbdb0db682c7e93578d7d948a8d3ae56d1301","schema_version":"1.0","event_id":"sha256:2762bcebc177cf358e8f77ac40bfbdb0db682c7e93578d7d948a8d3ae56d1301"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HY5FOSB2OD4OWUP26SULCM65FH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Low-Redundancy Codes for Correcting Multiple Deletions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Joshua Brakensiek, Samuel Zbarsky, Venkatesan Guruswami","submitted_at":"2015-07-22T13:20:28Z","abstract_excerpt":"We consider the problem of constructing binary codes to recover from $k$-bit deletions with efficient encoding/decoding, for a fixed $k$. The single deletion case is well understood, with the Varshamov-Tenengolts-Levenshtein code from 1965 giving an asymptotically optimal construction with $\\approx 2^n/n$ codewords of length $n$, i.e., at most $\\log n$ bits of redundancy. However, even for the case of two deletions, there was no known explicit construction with redundancy less than $n^{\\Omega(1)}$.\n  For any fixed $k$, we construct a binary code with $c_k \\log n$ redundancy that can be decoded"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06175","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-17T23:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qqufh/Qi3TOe1WbiO1vphn1qXj2RJ6kYuKGQRQWD/fv/H4QEmXykbZBeuDhTs1aEcKEQbBPr0K8SAZSFDSTvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:53:10.749271Z"},"content_sha256":"2c2c5a25eb376e9d2a6582e8a4a795882aff15fca17c2e99f0cee0b76b46892a","schema_version":"1.0","event_id":"sha256:2c2c5a25eb376e9d2a6582e8a4a795882aff15fca17c2e99f0cee0b76b46892a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HY5FOSB2OD4OWUP26SULCM65FH/bundle.json","state_url":"https://pith.science/pith/HY5FOSB2OD4OWUP26SULCM65FH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HY5FOSB2OD4OWUP26SULCM65FH/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-09T14:53:10Z","links":{"resolver":"https://pith.science/pith/HY5FOSB2OD4OWUP26SULCM65FH","bundle":"https://pith.science/pith/HY5FOSB2OD4OWUP26SULCM65FH/bundle.json","state":"https://pith.science/pith/HY5FOSB2OD4OWUP26SULCM65FH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HY5FOSB2OD4OWUP26SULCM65FH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HY5FOSB2OD4OWUP26SULCM65FH","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":"c094cb3a741b06e90b8dcc57d67475bf472fb7a8f99a25d053efeb0fe3d2aa98","cross_cats_sorted":["cs.DM","cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-22T13:20:28Z","title_canon_sha256":"5d8ca2246b1da59ebd2db8ee43a580f57c09d76c6de7cbb5b35d59b3ff66ff14"},"schema_version":"1.0","source":{"id":"1507.06175","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06175","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06175v2","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06175","created_at":"2026-05-17T23:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"HY5FOSB2OD4O","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HY5FOSB2OD4OWUP2","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HY5FOSB2","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:2c2c5a25eb376e9d2a6582e8a4a795882aff15fca17c2e99f0cee0b76b46892a","target":"graph","created_at":"2026-05-17T23:45:53Z","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 the problem of constructing binary codes to recover from $k$-bit deletions with efficient encoding/decoding, for a fixed $k$. The single deletion case is well understood, with the Varshamov-Tenengolts-Levenshtein code from 1965 giving an asymptotically optimal construction with $\\approx 2^n/n$ codewords of length $n$, i.e., at most $\\log n$ bits of redundancy. However, even for the case of two deletions, there was no known explicit construction with redundancy less than $n^{\\Omega(1)}$.\n  For any fixed $k$, we construct a binary code with $c_k \\log n$ redundancy that can be decoded","authors_text":"Joshua Brakensiek, Samuel Zbarsky, Venkatesan Guruswami","cross_cats":["cs.DM","cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-22T13:20:28Z","title":"Efficient Low-Redundancy Codes for Correcting Multiple Deletions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06175","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:2762bcebc177cf358e8f77ac40bfbdb0db682c7e93578d7d948a8d3ae56d1301","target":"record","created_at":"2026-05-17T23:45:53Z","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":"c094cb3a741b06e90b8dcc57d67475bf472fb7a8f99a25d053efeb0fe3d2aa98","cross_cats_sorted":["cs.DM","cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-22T13:20:28Z","title_canon_sha256":"5d8ca2246b1da59ebd2db8ee43a580f57c09d76c6de7cbb5b35d59b3ff66ff14"},"schema_version":"1.0","source":{"id":"1507.06175","kind":"arxiv","version":2}},"canonical_sha256":"3e3a57483a70f8eb51faf4a8b133dd29c3e276e22f7a3f0f6549ac83123b1f81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e3a57483a70f8eb51faf4a8b133dd29c3e276e22f7a3f0f6549ac83123b1f81","first_computed_at":"2026-05-17T23:45:53.756860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:53.756860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BhZUDk+FavZoqs9nwK/Zw/QfuZ6BwQOkB1YyTDSDwFx6jwibQ3cJNozAYRdjsgQJ8xjTfPdFw/C2Lquis9kDCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:53.757287Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06175","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2762bcebc177cf358e8f77ac40bfbdb0db682c7e93578d7d948a8d3ae56d1301","sha256:2c2c5a25eb376e9d2a6582e8a4a795882aff15fca17c2e99f0cee0b76b46892a"],"state_sha256":"a6b21550bac4d3fc0e83b50eea1d6a5aa24578fd28c3d97bcb6c2705988e0464"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7bJcFVMIqlLmT+CN0ex92GJHP9UtIsXe05cCP7LO26pU9U0E0yV8PJMwltP+2s0X5ZBsSZJAlNPSIs1sfD22Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:53:10.751262Z","bundle_sha256":"af24c558b9ebb72295e013f6ab50f4967e30b7d51015ebccde67ea9502c7f127"}}