{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KGXCDLABWGTRAVGD7OIOMN3XSP","short_pith_number":"pith:KGXCDLAB","schema_version":"1.0","canonical_sha256":"51ae21ac01b1a71054c3fb90e6377793ec61644137a4ab4e2e6ebcda95f3b499","source":{"kind":"arxiv","id":"1311.7084","version":2},"attestation_state":"computed","paper":{"title":"Explicit rank-metric codes list-decodable with optimal redundancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Carol Wang, Venkatesan Guruswami","submitted_at":"2013-11-27T19:35:46Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1311.7084","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-27T19:35:46Z","cross_cats_sorted":["cs.CC","cs.DM","math.IT"],"title_canon_sha256":"456fafb23119caae5a9e415866cf1ba7cc4f30e3fcaea96caa5fcc67a8fa1a3a","abstract_canon_sha256":"880e870b94200ccb685cbdf55813b83c0965946a144d2597cb492143a7965c0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:47.178568Z","signature_b64":"c+mkCcBq5SwyUmNiI3x25xthqLDahR9PqwwvSjlzwl3vj3PKSOXdtwKkhOHnEfuOfBYkgEH/vbdrxsVJdJGFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51ae21ac01b1a71054c3fb90e6377793ec61644137a4ab4e2e6ebcda95f3b499","last_reissued_at":"2026-05-18T03:05:47.177729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:47.177729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit rank-metric codes list-decodable with optimal redundancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Carol Wang, Venkatesan Guruswami","submitted_at":"2013-11-27T19:35:46Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7084","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.7084","created_at":"2026-05-18T03:05:47.177831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.7084v2","created_at":"2026-05-18T03:05:47.177831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7084","created_at":"2026-05-18T03:05:47.177831+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGXCDLABWGTR","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGXCDLABWGTRAVGD","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGXCDLAB","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KGXCDLABWGTRAVGD7OIOMN3XSP","json":"https://pith.science/pith/KGXCDLABWGTRAVGD7OIOMN3XSP.json","graph_json":"https://pith.science/api/pith-number/KGXCDLABWGTRAVGD7OIOMN3XSP/graph.json","events_json":"https://pith.science/api/pith-number/KGXCDLABWGTRAVGD7OIOMN3XSP/events.json","paper":"https://pith.science/paper/KGXCDLAB"},"agent_actions":{"view_html":"https://pith.science/pith/KGXCDLABWGTRAVGD7OIOMN3XSP","download_json":"https://pith.science/pith/KGXCDLABWGTRAVGD7OIOMN3XSP.json","view_paper":"https://pith.science/paper/KGXCDLAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.7084&json=true","fetch_graph":"https://pith.science/api/pith-number/KGXCDLABWGTRAVGD7OIOMN3XSP/graph.json","fetch_events":"https://pith.science/api/pith-number/KGXCDLABWGTRAVGD7OIOMN3XSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGXCDLABWGTRAVGD7OIOMN3XSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGXCDLABWGTRAVGD7OIOMN3XSP/action/storage_attestation","attest_author":"https://pith.science/pith/KGXCDLABWGTRAVGD7OIOMN3XSP/action/author_attestation","sign_citation":"https://pith.science/pith/KGXCDLABWGTRAVGD7OIOMN3XSP/action/citation_signature","submit_replication":"https://pith.science/pith/KGXCDLABWGTRAVGD7OIOMN3XSP/action/replication_record"}},"created_at":"2026-05-18T03:05:47.177831+00:00","updated_at":"2026-05-18T03:05:47.177831+00:00"}