{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WY6LI4C7LKZVCQGH5JP5D4S2SC","short_pith_number":"pith:WY6LI4C7","schema_version":"1.0","canonical_sha256":"b63cb4705f5ab35140c7ea5fd1f25a90b47741b872ca8a6ede3f84106fa17b3a","source":{"kind":"arxiv","id":"1510.04728","version":3},"attestation_state":"computed","paper":{"title":"Row Reduction Applied to Decoding of Rank Metric and Subspace Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johan Rosenkilde n\\'e Nielsen, Sven Puchinger, Vladimir Sidorenko, Wenhui Li","submitted_at":"2015-10-15T22:07:44Z","abstract_excerpt":"We show that decoding of $\\ell$-Interleaved Gabidulin codes, as well as list-$\\ell$ decoding of Mahdavifar--Vardy codes can be performed by row reducing skew polynomial matrices. Inspired by row reduction of $\\F[x]$ matrices, we develop a general and flexible approach of transforming matrices over skew polynomial rings into a certain reduced form. We apply this to solve generalised shift register problems over skew polynomial rings which occur in decoding $\\ell$-Interleaved Gabidulin codes. We obtain an algorithm with complexity $O(\\ell \\mu^2)$ where $\\mu$ measures the size of the input proble"},"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":"1510.04728","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-15T22:07:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2762733f89a7459e8b3fde95e008e3432fae354b1a3c439aa9e53acf37b0e99b","abstract_canon_sha256":"aa5a0c6c36c85adafdd16603229847665178ffeb2a9237999d7a10b511c0af0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:05.115374Z","signature_b64":"F0UduSGZp41ZYZnIUvrwUUtbbAmcSqdDjOOilo2IpcoSIjcX6U78zwbaPJip+GnU/iL80OE9v8M5kKy6sRANDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b63cb4705f5ab35140c7ea5fd1f25a90b47741b872ca8a6ede3f84106fa17b3a","last_reissued_at":"2026-05-18T01:11:05.114790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:05.114790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Row Reduction Applied to Decoding of Rank Metric and Subspace Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johan Rosenkilde n\\'e Nielsen, Sven Puchinger, Vladimir Sidorenko, Wenhui Li","submitted_at":"2015-10-15T22:07:44Z","abstract_excerpt":"We show that decoding of $\\ell$-Interleaved Gabidulin codes, as well as list-$\\ell$ decoding of Mahdavifar--Vardy codes can be performed by row reducing skew polynomial matrices. Inspired by row reduction of $\\F[x]$ matrices, we develop a general and flexible approach of transforming matrices over skew polynomial rings into a certain reduced form. We apply this to solve generalised shift register problems over skew polynomial rings which occur in decoding $\\ell$-Interleaved Gabidulin codes. We obtain an algorithm with complexity $O(\\ell \\mu^2)$ where $\\mu$ measures the size of the input proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04728","kind":"arxiv","version":3},"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":"1510.04728","created_at":"2026-05-18T01:11:05.114871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04728v3","created_at":"2026-05-18T01:11:05.114871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04728","created_at":"2026-05-18T01:11:05.114871+00:00"},{"alias_kind":"pith_short_12","alias_value":"WY6LI4C7LKZV","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WY6LI4C7LKZVCQGH","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WY6LI4C7","created_at":"2026-05-18T12:29:47.479230+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/WY6LI4C7LKZVCQGH5JP5D4S2SC","json":"https://pith.science/pith/WY6LI4C7LKZVCQGH5JP5D4S2SC.json","graph_json":"https://pith.science/api/pith-number/WY6LI4C7LKZVCQGH5JP5D4S2SC/graph.json","events_json":"https://pith.science/api/pith-number/WY6LI4C7LKZVCQGH5JP5D4S2SC/events.json","paper":"https://pith.science/paper/WY6LI4C7"},"agent_actions":{"view_html":"https://pith.science/pith/WY6LI4C7LKZVCQGH5JP5D4S2SC","download_json":"https://pith.science/pith/WY6LI4C7LKZVCQGH5JP5D4S2SC.json","view_paper":"https://pith.science/paper/WY6LI4C7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04728&json=true","fetch_graph":"https://pith.science/api/pith-number/WY6LI4C7LKZVCQGH5JP5D4S2SC/graph.json","fetch_events":"https://pith.science/api/pith-number/WY6LI4C7LKZVCQGH5JP5D4S2SC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WY6LI4C7LKZVCQGH5JP5D4S2SC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WY6LI4C7LKZVCQGH5JP5D4S2SC/action/storage_attestation","attest_author":"https://pith.science/pith/WY6LI4C7LKZVCQGH5JP5D4S2SC/action/author_attestation","sign_citation":"https://pith.science/pith/WY6LI4C7LKZVCQGH5JP5D4S2SC/action/citation_signature","submit_replication":"https://pith.science/pith/WY6LI4C7LKZVCQGH5JP5D4S2SC/action/replication_record"}},"created_at":"2026-05-18T01:11:05.114871+00:00","updated_at":"2026-05-18T01:11:05.114871+00:00"}