{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UD4JVA5B7TWCJ6XGVH6JNKHMVX","short_pith_number":"pith:UD4JVA5B","schema_version":"1.0","canonical_sha256":"a0f89a83a1fcec24fae6a9fc96a8ecadc5be561e9dc3d5c4f8d05ca59ecda6f5","source":{"kind":"arxiv","id":"1710.11516","version":1},"attestation_state":"computed","paper":{"title":"On the List-Decodability of Random Linear Rank-Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nicolas Resch, Venkatesan Guruswami","submitted_at":"2017-10-31T14:42:39Z","abstract_excerpt":"The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an $\\mathbb{F}_q$-linear rank-metric code over $\\mathbb{F}_q^{m \\times n}$ of rate $R = (1-\\rho)(1-\\frac{n}{m}\\rho)-\\varepsilon$ is shown to be (with high probability) list-decodable up to fractional radius $\\rho \\in (0,1)$ with lists of size at most $\\frac{C_{\\rho,q}}{\\varepsilon}$, where $C_{\\rho,q}$ is a constant depending only on $\\rho$ and $q$. This matches the bound for random rank-metric codes (up to constant factors). The proof adapts the approach of Guruswami, H\\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":"1710.11516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-31T14:42:39Z","cross_cats_sorted":[],"title_canon_sha256":"ebdb80049debe151a7d21eb0ea0919642e43f2b1a7e83bd32cbcb25499c5533c","abstract_canon_sha256":"cb664993d42898866aa98d4fb27c8c691c1c08326067bd119712f1fc840f12c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:37.088988Z","signature_b64":"LTHuGtChXV2UKH6cUErEQBRgPn8FEdpqOREp5tbmaPLuHc4zsgGBkx9D+2fajlj/wmdKAjLG3vNpIVaEZiV1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0f89a83a1fcec24fae6a9fc96a8ecadc5be561e9dc3d5c4f8d05ca59ecda6f5","last_reissued_at":"2026-05-18T00:31:37.088379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:37.088379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the List-Decodability of Random Linear Rank-Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nicolas Resch, Venkatesan Guruswami","submitted_at":"2017-10-31T14:42:39Z","abstract_excerpt":"The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an $\\mathbb{F}_q$-linear rank-metric code over $\\mathbb{F}_q^{m \\times n}$ of rate $R = (1-\\rho)(1-\\frac{n}{m}\\rho)-\\varepsilon$ is shown to be (with high probability) list-decodable up to fractional radius $\\rho \\in (0,1)$ with lists of size at most $\\frac{C_{\\rho,q}}{\\varepsilon}$, where $C_{\\rho,q}$ is a constant depending only on $\\rho$ and $q$. This matches the bound for random rank-metric codes (up to constant factors). The proof adapts the approach of Guruswami, H\\a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11516","kind":"arxiv","version":1},"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":"1710.11516","created_at":"2026-05-18T00:31:37.088479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.11516v1","created_at":"2026-05-18T00:31:37.088479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11516","created_at":"2026-05-18T00:31:37.088479+00:00"},{"alias_kind":"pith_short_12","alias_value":"UD4JVA5B7TWC","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UD4JVA5B7TWCJ6XG","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UD4JVA5B","created_at":"2026-05-18T12:31:46.661854+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/UD4JVA5B7TWCJ6XGVH6JNKHMVX","json":"https://pith.science/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX.json","graph_json":"https://pith.science/api/pith-number/UD4JVA5B7TWCJ6XGVH6JNKHMVX/graph.json","events_json":"https://pith.science/api/pith-number/UD4JVA5B7TWCJ6XGVH6JNKHMVX/events.json","paper":"https://pith.science/paper/UD4JVA5B"},"agent_actions":{"view_html":"https://pith.science/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX","download_json":"https://pith.science/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX.json","view_paper":"https://pith.science/paper/UD4JVA5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.11516&json=true","fetch_graph":"https://pith.science/api/pith-number/UD4JVA5B7TWCJ6XGVH6JNKHMVX/graph.json","fetch_events":"https://pith.science/api/pith-number/UD4JVA5B7TWCJ6XGVH6JNKHMVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX/action/storage_attestation","attest_author":"https://pith.science/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX/action/author_attestation","sign_citation":"https://pith.science/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX/action/citation_signature","submit_replication":"https://pith.science/pith/UD4JVA5B7TWCJ6XGVH6JNKHMVX/action/replication_record"}},"created_at":"2026-05-18T00:31:37.088479+00:00","updated_at":"2026-05-18T00:31:37.088479+00:00"}