{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:W3XGAUXGSIKYG6OPL6S5ZQUFYY","short_pith_number":"pith:W3XGAUXG","canonical_record":{"source":{"id":"1605.04611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-15T22:30:28Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"ae05cc4e197780c5710bf599004e5a4d9842518e6f1cf9285fa0c9f4147cb5fc","abstract_canon_sha256":"a4013956c935b62e0cfed189c34260d64c0cf7d3e67d2cf66ac30b314cf55979"},"schema_version":"1.0"},"canonical_sha256":"b6ee6052e692158379cf5fa5dcc285c6175de92c7eb8d0b7e719fe5dbdc4993e","source":{"kind":"arxiv","id":"1605.04611","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04611","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04611v1","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04611","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"W3XGAUXGSIKY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W3XGAUXGSIKYG6OP","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W3XGAUXG","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:W3XGAUXGSIKYG6OPL6S5ZQUFYY","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-15T22:30:28Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"ae05cc4e197780c5710bf599004e5a4d9842518e6f1cf9285fa0c9f4147cb5fc","abstract_canon_sha256":"a4013956c935b62e0cfed189c34260d64c0cf7d3e67d2cf66ac30b314cf55979"},"schema_version":"1.0"},"canonical_sha256":"b6ee6052e692158379cf5fa5dcc285c6175de92c7eb8d0b7e719fe5dbdc4993e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:46.722548Z","signature_b64":"s61QcspYiz1M1oFpEtYisP75aRTsIeZ8T9oUigrDYaiVNC8iMjkVh2aCPxZ+S8hEi5EH2Bpv480KC2n7f15+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6ee6052e692158379cf5fa5dcc285c6175de92c7eb8d0b7e719fe5dbdc4993e","last_reissued_at":"2026-05-18T01:14:46.721553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:46.721553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04611","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-18T01:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v3O2nwIiT0ZnjZE8KSEHTbEsl98p2tGB8TcBkawsUKAe2ZcBKYGmLYpIRybMqPK83RL/TBNXzqz+WU7EDuxmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:03:28.561961Z"},"content_sha256":"fec00742d6fb3f057ead16b4e60f5e6e94e3cf4dd7522ee5a351d41db7b4ac77","schema_version":"1.0","event_id":"sha256:fec00742d6fb3f057ead16b4e60f5e6e94e3cf4dd7522ee5a351d41db7b4ac77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:W3XGAUXGSIKYG6OPL6S5ZQUFYY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Ray Li, Venkatesan Guruswami","submitted_at":"2016-05-15T22:30:28Z","abstract_excerpt":"This work constructs codes that are efficiently decodable from a constant fraction of \\emph{worst-case} insertion and deletion errors in three parameter settings: (i) Binary codes with rate approaching 1; (ii) Codes with constant rate for error fraction approaching 1 over fixed alphabet size; and (iii) Constant rate codes over an alphabet of size $k$ for error fraction approaching $(k-1)/(k+1)$. When errors are constrained to deletions alone, efficiently decodable codes in each of these regimes were constructed recently. We complete the picture by constructing similar codes that are efficientl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04611","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-18T01:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"syvPKOjyVflh803xrnbHSzMxcN0WqvA0NBR1Oq7XEqWKLqzRg4GT0HxIWDPoJt61HhCuW1EUWj4FUTzzyW7hCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:03:28.562632Z"},"content_sha256":"0e43f0e12337b11f0a3a6cf3d35dc2d7f811c5f51a89a91f7746ea4bb4a85d7b","schema_version":"1.0","event_id":"sha256:0e43f0e12337b11f0a3a6cf3d35dc2d7f811c5f51a89a91f7746ea4bb4a85d7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3XGAUXGSIKYG6OPL6S5ZQUFYY/bundle.json","state_url":"https://pith.science/pith/W3XGAUXGSIKYG6OPL6S5ZQUFYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3XGAUXGSIKYG6OPL6S5ZQUFYY/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-27T03:03:28Z","links":{"resolver":"https://pith.science/pith/W3XGAUXGSIKYG6OPL6S5ZQUFYY","bundle":"https://pith.science/pith/W3XGAUXGSIKYG6OPL6S5ZQUFYY/bundle.json","state":"https://pith.science/pith/W3XGAUXGSIKYG6OPL6S5ZQUFYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3XGAUXGSIKYG6OPL6S5ZQUFYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:W3XGAUXGSIKYG6OPL6S5ZQUFYY","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":"a4013956c935b62e0cfed189c34260d64c0cf7d3e67d2cf66ac30b314cf55979","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-15T22:30:28Z","title_canon_sha256":"ae05cc4e197780c5710bf599004e5a4d9842518e6f1cf9285fa0c9f4147cb5fc"},"schema_version":"1.0","source":{"id":"1605.04611","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04611","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04611v1","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04611","created_at":"2026-05-18T01:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"W3XGAUXGSIKY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W3XGAUXGSIKYG6OP","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W3XGAUXG","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:0e43f0e12337b11f0a3a6cf3d35dc2d7f811c5f51a89a91f7746ea4bb4a85d7b","target":"graph","created_at":"2026-05-18T01:14:46Z","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":"This work constructs codes that are efficiently decodable from a constant fraction of \\emph{worst-case} insertion and deletion errors in three parameter settings: (i) Binary codes with rate approaching 1; (ii) Codes with constant rate for error fraction approaching 1 over fixed alphabet size; and (iii) Constant rate codes over an alphabet of size $k$ for error fraction approaching $(k-1)/(k+1)$. When errors are constrained to deletions alone, efficiently decodable codes in each of these regimes were constructed recently. We complete the picture by constructing similar codes that are efficientl","authors_text":"Ray Li, Venkatesan Guruswami","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-15T22:30:28Z","title":"Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04611","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:fec00742d6fb3f057ead16b4e60f5e6e94e3cf4dd7522ee5a351d41db7b4ac77","target":"record","created_at":"2026-05-18T01:14:46Z","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":"a4013956c935b62e0cfed189c34260d64c0cf7d3e67d2cf66ac30b314cf55979","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-15T22:30:28Z","title_canon_sha256":"ae05cc4e197780c5710bf599004e5a4d9842518e6f1cf9285fa0c9f4147cb5fc"},"schema_version":"1.0","source":{"id":"1605.04611","kind":"arxiv","version":1}},"canonical_sha256":"b6ee6052e692158379cf5fa5dcc285c6175de92c7eb8d0b7e719fe5dbdc4993e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6ee6052e692158379cf5fa5dcc285c6175de92c7eb8d0b7e719fe5dbdc4993e","first_computed_at":"2026-05-18T01:14:46.721553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:46.721553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s61QcspYiz1M1oFpEtYisP75aRTsIeZ8T9oUigrDYaiVNC8iMjkVh2aCPxZ+S8hEi5EH2Bpv480KC2n7f15+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:46.722548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04611","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fec00742d6fb3f057ead16b4e60f5e6e94e3cf4dd7522ee5a351d41db7b4ac77","sha256:0e43f0e12337b11f0a3a6cf3d35dc2d7f811c5f51a89a91f7746ea4bb4a85d7b"],"state_sha256":"907027e35c7a8be6e55f835a2a667ef8b8a85e9be645db94ae3a39d7de63e61a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YoI54XHkij+KNH8TbJ+j4UP5MwCQlkdZzCoOf7Pva/qXSg0gciD8EzfoEkZzJ4JCsdhRE2ColeA5ijeWSZSFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:03:28.565903Z","bundle_sha256":"9db1d4824a14b28c59304da4d30187fc3783d7131c9580ee6e0df6eed3b377b7"}}