{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C7VLQXMTU4G2CR2ZMMODDKMEML","short_pith_number":"pith:C7VLQXMT","schema_version":"1.0","canonical_sha256":"17eab85d93a70da14759631c31a98462d2e72b30d756ddad3036872f85c23014","source":{"kind":"arxiv","id":"1601.05205","version":2},"attestation_state":"computed","paper":{"title":"An Alternative Decoding Method for Gabidulin Codes in Characteristic Zero","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David M\\\"odinger, Martin Bossert, Sven M\\\"uelich, Sven Puchinger","submitted_at":"2016-01-20T09:04:42Z","abstract_excerpt":"Gabidulin codes, originally defined over finite fields, are an important class of rank metric codes with various applications. Recently, their definition was generalized to certain fields of characteristic zero and a Welch--Berlekamp like algorithm with complexity $O(n^3)$ was given. We propose a new application of Gabidulin codes over infinite fields: low-rank matrix recovery. Also, an alternative decoding approach is presented based on a Gao type key equation, reducing the complexity to at least $O(n^2)$. This method immediately connects the decoding problem to well-studied problems, which h"},"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":"1601.05205","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T09:04:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3ceb6752529ec4f04af5fe15bd19166e718cdc2b39da3982bcb6a560473bd8d1","abstract_canon_sha256":"4ebd0555f6aae7cc609b31f715cd1b3f267d75d8377b7c5248d0fca8a2053ce1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:32.903137Z","signature_b64":"ZXVvdcgyfG7oWCWE25uBElfo7whRd8vaoLf0gnNo9g2BsilafVFlEbxCeJ6+5gFp1HSCvsh+qTxW1FOWFF2DCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17eab85d93a70da14759631c31a98462d2e72b30d756ddad3036872f85c23014","last_reissued_at":"2026-05-18T01:16:32.902418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:32.902418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Alternative Decoding Method for Gabidulin Codes in Characteristic Zero","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David M\\\"odinger, Martin Bossert, Sven M\\\"uelich, Sven Puchinger","submitted_at":"2016-01-20T09:04:42Z","abstract_excerpt":"Gabidulin codes, originally defined over finite fields, are an important class of rank metric codes with various applications. Recently, their definition was generalized to certain fields of characteristic zero and a Welch--Berlekamp like algorithm with complexity $O(n^3)$ was given. We propose a new application of Gabidulin codes over infinite fields: low-rank matrix recovery. Also, an alternative decoding approach is presented based on a Gao type key equation, reducing the complexity to at least $O(n^2)$. This method immediately connects the decoding problem to well-studied problems, which h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05205","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":"1601.05205","created_at":"2026-05-18T01:16:32.902523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05205v2","created_at":"2026-05-18T01:16:32.902523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05205","created_at":"2026-05-18T01:16:32.902523+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7VLQXMTU4G2","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7VLQXMTU4G2CR2Z","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7VLQXMT","created_at":"2026-05-18T12:30:09.641336+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/C7VLQXMTU4G2CR2ZMMODDKMEML","json":"https://pith.science/pith/C7VLQXMTU4G2CR2ZMMODDKMEML.json","graph_json":"https://pith.science/api/pith-number/C7VLQXMTU4G2CR2ZMMODDKMEML/graph.json","events_json":"https://pith.science/api/pith-number/C7VLQXMTU4G2CR2ZMMODDKMEML/events.json","paper":"https://pith.science/paper/C7VLQXMT"},"agent_actions":{"view_html":"https://pith.science/pith/C7VLQXMTU4G2CR2ZMMODDKMEML","download_json":"https://pith.science/pith/C7VLQXMTU4G2CR2ZMMODDKMEML.json","view_paper":"https://pith.science/paper/C7VLQXMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05205&json=true","fetch_graph":"https://pith.science/api/pith-number/C7VLQXMTU4G2CR2ZMMODDKMEML/graph.json","fetch_events":"https://pith.science/api/pith-number/C7VLQXMTU4G2CR2ZMMODDKMEML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7VLQXMTU4G2CR2ZMMODDKMEML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7VLQXMTU4G2CR2ZMMODDKMEML/action/storage_attestation","attest_author":"https://pith.science/pith/C7VLQXMTU4G2CR2ZMMODDKMEML/action/author_attestation","sign_citation":"https://pith.science/pith/C7VLQXMTU4G2CR2ZMMODDKMEML/action/citation_signature","submit_replication":"https://pith.science/pith/C7VLQXMTU4G2CR2ZMMODDKMEML/action/replication_record"}},"created_at":"2026-05-18T01:16:32.902523+00:00","updated_at":"2026-05-18T01:16:32.902523+00:00"}