{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TPTC5YMNAL3ILIACAZBH43GWHT","short_pith_number":"pith:TPTC5YMN","schema_version":"1.0","canonical_sha256":"9be62ee18d02f685a00206427e6cd63cc60d9376c447032cc82ec82a8afcbdbe","source":{"kind":"arxiv","id":"1404.5716","version":1},"attestation_state":"computed","paper":{"title":"List-Decoding Gabidulin Codes via Interpolation and the Euclidean Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Margreta Kuijper","submitted_at":"2014-04-23T06:24:33Z","abstract_excerpt":"We show how Gabidulin codes can be list decoded by using a parametrization approach. For this we consider a certain module in the ring of linearized polynomials and find a minimal basis for this module using the Euclidean algorithm with respect to composition of polynomials. For a given received word, our decoding algorithm computes a list of all codewords that are closest to the received word with respect to the rank metric."},"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":"1404.5716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-23T06:24:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"403602cf03b79d0c587f9fe16c9cc3990c00acc4d9d710f0eeb71fa6ac58f3a6","abstract_canon_sha256":"a5b0d9c8947c6a1a7d78d8ae700d049f37849ee17d8c34e0846a7dcecbde2359"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:28.108867Z","signature_b64":"wmKW3InDRxOX0IfiwJDmlCsah7hVpjjG3Rcu2QFoUd48S8mYd+4zsjSB5jCKkh8cFLBfZ3m59K4zSvY6w31cAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9be62ee18d02f685a00206427e6cd63cc60d9376c447032cc82ec82a8afcbdbe","last_reissued_at":"2026-05-18T02:53:28.108289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:28.108289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List-Decoding Gabidulin Codes via Interpolation and the Euclidean Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Margreta Kuijper","submitted_at":"2014-04-23T06:24:33Z","abstract_excerpt":"We show how Gabidulin codes can be list decoded by using a parametrization approach. For this we consider a certain module in the ring of linearized polynomials and find a minimal basis for this module using the Euclidean algorithm with respect to composition of polynomials. For a given received word, our decoding algorithm computes a list of all codewords that are closest to the received word with respect to the rank metric."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5716","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":"1404.5716","created_at":"2026-05-18T02:53:28.108382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5716v1","created_at":"2026-05-18T02:53:28.108382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5716","created_at":"2026-05-18T02:53:28.108382+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPTC5YMNAL3I","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPTC5YMNAL3ILIAC","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPTC5YMN","created_at":"2026-05-18T12:28:49.207871+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/TPTC5YMNAL3ILIACAZBH43GWHT","json":"https://pith.science/pith/TPTC5YMNAL3ILIACAZBH43GWHT.json","graph_json":"https://pith.science/api/pith-number/TPTC5YMNAL3ILIACAZBH43GWHT/graph.json","events_json":"https://pith.science/api/pith-number/TPTC5YMNAL3ILIACAZBH43GWHT/events.json","paper":"https://pith.science/paper/TPTC5YMN"},"agent_actions":{"view_html":"https://pith.science/pith/TPTC5YMNAL3ILIACAZBH43GWHT","download_json":"https://pith.science/pith/TPTC5YMNAL3ILIACAZBH43GWHT.json","view_paper":"https://pith.science/paper/TPTC5YMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5716&json=true","fetch_graph":"https://pith.science/api/pith-number/TPTC5YMNAL3ILIACAZBH43GWHT/graph.json","fetch_events":"https://pith.science/api/pith-number/TPTC5YMNAL3ILIACAZBH43GWHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPTC5YMNAL3ILIACAZBH43GWHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPTC5YMNAL3ILIACAZBH43GWHT/action/storage_attestation","attest_author":"https://pith.science/pith/TPTC5YMNAL3ILIACAZBH43GWHT/action/author_attestation","sign_citation":"https://pith.science/pith/TPTC5YMNAL3ILIACAZBH43GWHT/action/citation_signature","submit_replication":"https://pith.science/pith/TPTC5YMNAL3ILIACAZBH43GWHT/action/replication_record"}},"created_at":"2026-05-18T02:53:28.108382+00:00","updated_at":"2026-05-18T02:53:28.108382+00:00"}