{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ENUE7IB6OWKK275EDRZB7JHHTH","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":"0b4d45effccebede27697224d648a182a39b007ec8bba18475378da6f1a7311d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-03T13:55:27Z","title_canon_sha256":"ce58ac7eeaabd320fa82a00a742ee1a586bc1d2ba5dfd635593d7843c751163a"},"schema_version":"1.0","source":{"id":"1707.00552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00552","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00552v1","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00552","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"ENUE7IB6OWKK","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ENUE7IB6OWKK275E","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ENUE7IB6","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:a466efb98d368d9ec579ee895858a27c4f6ae460c32edf70c0b67511b2da47e2","target":"graph","created_at":"2026-05-18T00:41:03Z","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":"In 1990, Tiet\\\"av\\\"ainen showed that if the only information we know about a linear code is its dual distance $d$, then its covering radius $R$ is at most $\\frac{n}{2}-(\\frac{1}{2}-o(1))\\sqrt{dn}$. While Tiet\\\"av\\\"ainen's bound was later improved for large values of $d$, it is still the best known upper bound for small values including the $d = o(n)$ regime. Tiet\\\"av\\\"ainen's bound holds also for $(d-1)$-wise independent probability distributions on $\\{0,1\\}^n$, of which linear codes with dual distance $d$ are special cases. We show that Tiet\\\"av\\\"ainen's bound on $R-\\frac{n}{2}$ is asymptotic","authors_text":"Louay Bazzi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-03T13:55:27Z","title":"On the tightness of Tiet\\\"av\\\"ainen's bound for distributions with limited independence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00552","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:449f1c5945fd2e136a5ee1193c399f689573de7d5378a6d9f107060c9d443755","target":"record","created_at":"2026-05-18T00:41:03Z","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":"0b4d45effccebede27697224d648a182a39b007ec8bba18475378da6f1a7311d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-03T13:55:27Z","title_canon_sha256":"ce58ac7eeaabd320fa82a00a742ee1a586bc1d2ba5dfd635593d7843c751163a"},"schema_version":"1.0","source":{"id":"1707.00552","kind":"arxiv","version":1}},"canonical_sha256":"23684fa03e7594ad7fa41c721fa4e799ee315608c0ecd5863c27d352252b4868","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23684fa03e7594ad7fa41c721fa4e799ee315608c0ecd5863c27d352252b4868","first_computed_at":"2026-05-18T00:41:03.039639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:03.039639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0R4bq0b+/XBjouqekvo6HRJdl11wtTDqDOhhNsw/0riGfwtUVhUw+4SDsZIItvZK2w/Su8s/YEzGS/8Mgi2QDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:03.040451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:449f1c5945fd2e136a5ee1193c399f689573de7d5378a6d9f107060c9d443755","sha256:a466efb98d368d9ec579ee895858a27c4f6ae460c32edf70c0b67511b2da47e2"],"state_sha256":"404c7a4d16986c18f0fceee763ab3b6d0f6a70b667708910500166f5d5ee6b06"}