{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SMO4DT2STJJMANVLQNTN2N6DAF","short_pith_number":"pith:SMO4DT2S","schema_version":"1.0","canonical_sha256":"931dc1cf529a52c036ab8366dd37c30159cfa6f89308a0720e0299b53d0010da","source":{"kind":"arxiv","id":"1801.07033","version":1},"attestation_state":"computed","paper":{"title":"On the List Decodability of Self-orthogonal Rank Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shu Liu","submitted_at":"2018-01-22T10:41:16Z","abstract_excerpt":"V. Guruswami and N. Resch prove that the list decodability of $\\mathbb{F}_q$-linear rank metric codes is as good as that of random rank metric codes in~\\cite{venkat2017}. Due to the potential applications of self-orthogonal rank metric codes, we focus on list decoding of them. In this paper, we prove that with high probability, an $\\F_q$-linear self-orthogonal rank metric code over $\\mathbb{F}_q^{n\\times m}$ of rate $R=(1-\\tau)(1-\\frac{n}{m}\\tau)-\\epsilon$ is shown to be list decodable up to fractional radius $\\tau\\in(0,1)$ and small $\\epsilon\\in(0,1)$ with list size depending on $\\tau$ and $q"},"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":"1801.07033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-22T10:41:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dcf53c7c4899f4b529e23053c759a064a7034cac78ba31aff0c668c253367dc5","abstract_canon_sha256":"2acaf62296f0b8ede476df6a9e197caf0a0a7d924529cdc914539c597fa38fe2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:22.431462Z","signature_b64":"LrIIbvgpsULnyEIsLEtD8MTLThJd2Piaznbm9yYctXAEl7ngfHPWP4wnNoRetQNBhDrfOrOISsbSZKgqoChUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"931dc1cf529a52c036ab8366dd37c30159cfa6f89308a0720e0299b53d0010da","last_reissued_at":"2026-05-18T00:25:22.430921Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:22.430921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the List Decodability of Self-orthogonal Rank Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shu Liu","submitted_at":"2018-01-22T10:41:16Z","abstract_excerpt":"V. Guruswami and N. Resch prove that the list decodability of $\\mathbb{F}_q$-linear rank metric codes is as good as that of random rank metric codes in~\\cite{venkat2017}. Due to the potential applications of self-orthogonal rank metric codes, we focus on list decoding of them. In this paper, we prove that with high probability, an $\\F_q$-linear self-orthogonal rank metric code over $\\mathbb{F}_q^{n\\times m}$ of rate $R=(1-\\tau)(1-\\frac{n}{m}\\tau)-\\epsilon$ is shown to be list decodable up to fractional radius $\\tau\\in(0,1)$ and small $\\epsilon\\in(0,1)$ with list size depending on $\\tau$ and $q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07033","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":"1801.07033","created_at":"2026-05-18T00:25:22.431005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07033v1","created_at":"2026-05-18T00:25:22.431005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07033","created_at":"2026-05-18T00:25:22.431005+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMO4DT2STJJM","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMO4DT2STJJMANVL","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMO4DT2S","created_at":"2026-05-18T12:32:53.628368+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/SMO4DT2STJJMANVLQNTN2N6DAF","json":"https://pith.science/pith/SMO4DT2STJJMANVLQNTN2N6DAF.json","graph_json":"https://pith.science/api/pith-number/SMO4DT2STJJMANVLQNTN2N6DAF/graph.json","events_json":"https://pith.science/api/pith-number/SMO4DT2STJJMANVLQNTN2N6DAF/events.json","paper":"https://pith.science/paper/SMO4DT2S"},"agent_actions":{"view_html":"https://pith.science/pith/SMO4DT2STJJMANVLQNTN2N6DAF","download_json":"https://pith.science/pith/SMO4DT2STJJMANVLQNTN2N6DAF.json","view_paper":"https://pith.science/paper/SMO4DT2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07033&json=true","fetch_graph":"https://pith.science/api/pith-number/SMO4DT2STJJMANVLQNTN2N6DAF/graph.json","fetch_events":"https://pith.science/api/pith-number/SMO4DT2STJJMANVLQNTN2N6DAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMO4DT2STJJMANVLQNTN2N6DAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMO4DT2STJJMANVLQNTN2N6DAF/action/storage_attestation","attest_author":"https://pith.science/pith/SMO4DT2STJJMANVLQNTN2N6DAF/action/author_attestation","sign_citation":"https://pith.science/pith/SMO4DT2STJJMANVLQNTN2N6DAF/action/citation_signature","submit_replication":"https://pith.science/pith/SMO4DT2STJJMANVLQNTN2N6DAF/action/replication_record"}},"created_at":"2026-05-18T00:25:22.431005+00:00","updated_at":"2026-05-18T00:25:22.431005+00:00"}