{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:I3E5OXDMFPLSCCNW6UQQAVZCNH","short_pith_number":"pith:I3E5OXDM","canonical_record":{"source":{"id":"2106.05250","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-09T17:45:34Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"bd8cb95fb577991787e0c3ca0d21e4c2778f7dbfa33b65b53da03b3efe0b068e","abstract_canon_sha256":"350db2b65592222a32226dd204198e14f3b96b0526c2327ed29d599abc37fb6d"},"schema_version":"1.0"},"canonical_sha256":"46c9d75c6c2bd72109b6f52100572269f8563f209f56251137c71216bcc80775","source":{"kind":"arxiv","id":"2106.05250","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.05250","created_at":"2026-07-05T05:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"2106.05250v2","created_at":"2026-07-05T05:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.05250","created_at":"2026-07-05T05:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"I3E5OXDMFPLS","created_at":"2026-07-05T05:16:30Z"},{"alias_kind":"pith_short_16","alias_value":"I3E5OXDMFPLSCCNW","created_at":"2026-07-05T05:16:30Z"},{"alias_kind":"pith_short_8","alias_value":"I3E5OXDM","created_at":"2026-07-05T05:16:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:I3E5OXDMFPLSCCNW6UQQAVZCNH","target":"record","payload":{"canonical_record":{"source":{"id":"2106.05250","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-09T17:45:34Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"bd8cb95fb577991787e0c3ca0d21e4c2778f7dbfa33b65b53da03b3efe0b068e","abstract_canon_sha256":"350db2b65592222a32226dd204198e14f3b96b0526c2327ed29d599abc37fb6d"},"schema_version":"1.0"},"canonical_sha256":"46c9d75c6c2bd72109b6f52100572269f8563f209f56251137c71216bcc80775","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:16:30.942736Z","signature_b64":"9oExwJvDKB/js4olPnCR+NoOXv2ISsQfm2uCkjnB6WdbsgTIiQRtTa7qYqmqpBELpGc2R5H32NBqZnb0V3z8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46c9d75c6c2bd72109b6f52100572269f8563f209f56251137c71216bcc80775","last_reissued_at":"2026-07-05T05:16:30.942220Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:16:30.942220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.05250","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-05T05:16:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OGJOYN6ztZirNkWzr8XNfEwHLqPQbPvmjHY2R/HR6GpgieOTCEyZ+mNFbk6wT0tdy8hOoNKF2IbXseTuOBOvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T11:10:47.006220Z"},"content_sha256":"53779de55208daa26e5b7e02a98c85567a415afd37a54637325308d8242a5c24","schema_version":"1.0","event_id":"sha256:53779de55208daa26e5b7e02a98c85567a415afd37a54637325308d8242a5c24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:I3E5OXDMFPLSCCNW6UQQAVZCNH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The zero-rate threshold for adversarial bit-deletions is less than 1/2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Ray Li, Venkatesan Guruswami, Xiaoyu He","submitted_at":"2021-06-09T17:45:34Z","abstract_excerpt":"We prove that there exists an absolute constant $\\delta>0$ such any binary code $C\\subset\\{0,1\\}^N$ tolerating $(1/2-\\delta)N$ adversarial deletions must satisfy $|C|\\le 2^{\\text{poly}\\log N}$ and thus have rate asymptotically approaching 0. This is the first constant fraction improvement over the trivial bound that codes tolerating $N/2$ adversarial deletions must have rate going to 0 asymptotically. Equivalently, we show that there exists absolute constants $A$ and $\\delta>0$ such that any set $C\\subset\\{0,1\\}^N$ of $2^{\\log^A N}$ binary strings must contain two strings $c$ and $c'$ whose lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.05250","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/2106.05250/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-05T05:16:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/deXN2xBV2DQGh9NPV6SwC2ETUrEL4kFVBlRWtt0hXbdW3udOBSQ26U7YbroVuloPyOl/3gPOANfCDqZYtAvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T11:10:47.006611Z"},"content_sha256":"847ec15d9d43226814bfe422ac75e3d9366c93fab3f319fb3630cdea8bc3307d","schema_version":"1.0","event_id":"sha256:847ec15d9d43226814bfe422ac75e3d9366c93fab3f319fb3630cdea8bc3307d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3E5OXDMFPLSCCNW6UQQAVZCNH/bundle.json","state_url":"https://pith.science/pith/I3E5OXDMFPLSCCNW6UQQAVZCNH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3E5OXDMFPLSCCNW6UQQAVZCNH/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-06T11:10:47Z","links":{"resolver":"https://pith.science/pith/I3E5OXDMFPLSCCNW6UQQAVZCNH","bundle":"https://pith.science/pith/I3E5OXDMFPLSCCNW6UQQAVZCNH/bundle.json","state":"https://pith.science/pith/I3E5OXDMFPLSCCNW6UQQAVZCNH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3E5OXDMFPLSCCNW6UQQAVZCNH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:I3E5OXDMFPLSCCNW6UQQAVZCNH","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":"350db2b65592222a32226dd204198e14f3b96b0526c2327ed29d599abc37fb6d","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-09T17:45:34Z","title_canon_sha256":"bd8cb95fb577991787e0c3ca0d21e4c2778f7dbfa33b65b53da03b3efe0b068e"},"schema_version":"1.0","source":{"id":"2106.05250","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.05250","created_at":"2026-07-05T05:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"2106.05250v2","created_at":"2026-07-05T05:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.05250","created_at":"2026-07-05T05:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"I3E5OXDMFPLS","created_at":"2026-07-05T05:16:30Z"},{"alias_kind":"pith_short_16","alias_value":"I3E5OXDMFPLSCCNW","created_at":"2026-07-05T05:16:30Z"},{"alias_kind":"pith_short_8","alias_value":"I3E5OXDM","created_at":"2026-07-05T05:16:30Z"}],"graph_snapshots":[{"event_id":"sha256:847ec15d9d43226814bfe422ac75e3d9366c93fab3f319fb3630cdea8bc3307d","target":"graph","created_at":"2026-07-05T05:16:30Z","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/2106.05250/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that there exists an absolute constant $\\delta>0$ such any binary code $C\\subset\\{0,1\\}^N$ tolerating $(1/2-\\delta)N$ adversarial deletions must satisfy $|C|\\le 2^{\\text{poly}\\log N}$ and thus have rate asymptotically approaching 0. This is the first constant fraction improvement over the trivial bound that codes tolerating $N/2$ adversarial deletions must have rate going to 0 asymptotically. Equivalently, we show that there exists absolute constants $A$ and $\\delta>0$ such that any set $C\\subset\\{0,1\\}^N$ of $2^{\\log^A N}$ binary strings must contain two strings $c$ and $c'$ whose lo","authors_text":"Ray Li, Venkatesan Guruswami, Xiaoyu He","cross_cats":["cs.DM","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-09T17:45:34Z","title":"The zero-rate threshold for adversarial bit-deletions is less than 1/2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.05250","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:53779de55208daa26e5b7e02a98c85567a415afd37a54637325308d8242a5c24","target":"record","created_at":"2026-07-05T05:16:30Z","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":"350db2b65592222a32226dd204198e14f3b96b0526c2327ed29d599abc37fb6d","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-09T17:45:34Z","title_canon_sha256":"bd8cb95fb577991787e0c3ca0d21e4c2778f7dbfa33b65b53da03b3efe0b068e"},"schema_version":"1.0","source":{"id":"2106.05250","kind":"arxiv","version":2}},"canonical_sha256":"46c9d75c6c2bd72109b6f52100572269f8563f209f56251137c71216bcc80775","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46c9d75c6c2bd72109b6f52100572269f8563f209f56251137c71216bcc80775","first_computed_at":"2026-07-05T05:16:30.942220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:16:30.942220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9oExwJvDKB/js4olPnCR+NoOXv2ISsQfm2uCkjnB6WdbsgTIiQRtTa7qYqmqpBELpGc2R5H32NBqZnb0V3z8Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:16:30.942736Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.05250","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53779de55208daa26e5b7e02a98c85567a415afd37a54637325308d8242a5c24","sha256:847ec15d9d43226814bfe422ac75e3d9366c93fab3f319fb3630cdea8bc3307d"],"state_sha256":"1328eadfe890485955b3f21a1a8e30643b01f42b3e5750610245bc6059e12624"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j+xZsMrCsDaYyF1ABwPTRe9SMJuMXNZ2SxUZKP4CTpJnIB9V2k62F985jbrdiR3Wm1upInUGWDwGFZpvJgjnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T11:10:47.008511Z","bundle_sha256":"2bdcabe8073153c1d257b47dd466e9d3e8f9d071dec5b2d21b3eaa627cef900b"}}