{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KGXCDLABWGTRAVGD7OIOMN3XSP","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":"880e870b94200ccb685cbdf55813b83c0965946a144d2597cb492143a7965c0f","cross_cats_sorted":["cs.CC","cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-27T19:35:46Z","title_canon_sha256":"456fafb23119caae5a9e415866cf1ba7cc4f30e3fcaea96caa5fcc67a8fa1a3a"},"schema_version":"1.0","source":{"id":"1311.7084","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7084","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7084v2","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7084","created_at":"2026-05-18T03:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"KGXCDLABWGTR","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KGXCDLABWGTRAVGD","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KGXCDLAB","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:7be3945e2260aa46db4931ab26318614b278fea170df1e0236f8e1366cd69971","target":"graph","created_at":"2026-05-18T03:05:47Z","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 construct an explicit family of linear rank-metric codes over any field ${\\mathbb F}_h$ that enables efficient list decoding up to a fraction $\\rho$ of errors in the rank metric with a rate of $1-\\rho-\\epsilon$, for any desired $\\rho \\in (0,1)$ and $\\epsilon > 0$. Previously, a Monte Carlo construction of such codes was known, but this is in fact the first explicit construction of positive rate rank-metric codes for list decoding beyond the unique decoding radius.\n  Our codes are subcodes of the well-known Gabidulin codes, which encode linearized polynomials of low degree via their values a","authors_text":"Carol Wang, Venkatesan Guruswami","cross_cats":["cs.CC","cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-27T19:35:46Z","title":"Explicit rank-metric codes list-decodable with optimal redundancy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7084","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:2c1f2682d1a33418c6c9a67c3c7f243558f5757283c7b4f3a034f14dd4da7f26","target":"record","created_at":"2026-05-18T03:05:47Z","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":"880e870b94200ccb685cbdf55813b83c0965946a144d2597cb492143a7965c0f","cross_cats_sorted":["cs.CC","cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-27T19:35:46Z","title_canon_sha256":"456fafb23119caae5a9e415866cf1ba7cc4f30e3fcaea96caa5fcc67a8fa1a3a"},"schema_version":"1.0","source":{"id":"1311.7084","kind":"arxiv","version":2}},"canonical_sha256":"51ae21ac01b1a71054c3fb90e6377793ec61644137a4ab4e2e6ebcda95f3b499","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51ae21ac01b1a71054c3fb90e6377793ec61644137a4ab4e2e6ebcda95f3b499","first_computed_at":"2026-05-18T03:05:47.177729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:47.177729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c+mkCcBq5SwyUmNiI3x25xthqLDahR9PqwwvSjlzwl3vj3PKSOXdtwKkhOHnEfuOfBYkgEH/vbdrxsVJdJGFBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:47.178568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.7084","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c1f2682d1a33418c6c9a67c3c7f243558f5757283c7b4f3a034f14dd4da7f26","sha256:7be3945e2260aa46db4931ab26318614b278fea170df1e0236f8e1366cd69971"],"state_sha256":"724193dabd240f87b61f3e122bc759d505fcbf0806364dccbef9e108361f22dc"}