{"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"}