{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DB4N6GA3VYKQMYYQBBQMFAZRF4","short_pith_number":"pith:DB4N6GA3","schema_version":"1.0","canonical_sha256":"1878df181bae150663100860c283312f2d322084fd67dd316a23bf87b9d02378","source":{"kind":"arxiv","id":"1404.6048","version":1},"attestation_state":"computed","paper":{"title":"List and Unique Error-Erasure Decoding of Interleaved Gabidulin Codes with Interpolation Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh, Antonia Wachter-Zeh","submitted_at":"2014-04-24T07:59:14Z","abstract_excerpt":"A new interpolation-based decoding principle for interleaved Gabidulin codes is presented. The approach consists of two steps: First, a multi-variate linearized polynomial is constructed which interpolates the coefficients of the received word and second, the roots of this polynomial have to be found. Due to the specific structure of the interpolation polynomial, both steps (interpolation and root-finding) can be accomplished by solving a linear system of equations. This decoding principle can be applied as a list decoding algorithm (where the list size is not necessarily bounded polynomially)"},"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.6048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-24T07:59:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dff340187e34c21829d78e9b4c25790d3a5dd8faf6e56d7617d23b6d6034eac1","abstract_canon_sha256":"87bb68a421d67c2335d2d2fdf6a7c44019df4e9aa5878a94753ccd679595e877"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:18.542065Z","signature_b64":"cjwLxlT132m33+sQKL4UZdCK+yXxiQFuan8J09jbxem+j/89U81vb9cop80KfLay09zr8fO6mjKSxsHP1rwaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1878df181bae150663100860c283312f2d322084fd67dd316a23bf87b9d02378","last_reissued_at":"2026-05-18T02:53:18.541390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:18.541390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List and Unique Error-Erasure Decoding of Interleaved Gabidulin Codes with Interpolation Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh, Antonia Wachter-Zeh","submitted_at":"2014-04-24T07:59:14Z","abstract_excerpt":"A new interpolation-based decoding principle for interleaved Gabidulin codes is presented. The approach consists of two steps: First, a multi-variate linearized polynomial is constructed which interpolates the coefficients of the received word and second, the roots of this polynomial have to be found. Due to the specific structure of the interpolation polynomial, both steps (interpolation and root-finding) can be accomplished by solving a linear system of equations. This decoding principle can be applied as a list decoding algorithm (where the list size is not necessarily bounded polynomially)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6048","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.6048","created_at":"2026-05-18T02:53:18.541514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6048v1","created_at":"2026-05-18T02:53:18.541514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6048","created_at":"2026-05-18T02:53:18.541514+00:00"},{"alias_kind":"pith_short_12","alias_value":"DB4N6GA3VYKQ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DB4N6GA3VYKQMYYQ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DB4N6GA3","created_at":"2026-05-18T12:28:25.294606+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/DB4N6GA3VYKQMYYQBBQMFAZRF4","json":"https://pith.science/pith/DB4N6GA3VYKQMYYQBBQMFAZRF4.json","graph_json":"https://pith.science/api/pith-number/DB4N6GA3VYKQMYYQBBQMFAZRF4/graph.json","events_json":"https://pith.science/api/pith-number/DB4N6GA3VYKQMYYQBBQMFAZRF4/events.json","paper":"https://pith.science/paper/DB4N6GA3"},"agent_actions":{"view_html":"https://pith.science/pith/DB4N6GA3VYKQMYYQBBQMFAZRF4","download_json":"https://pith.science/pith/DB4N6GA3VYKQMYYQBBQMFAZRF4.json","view_paper":"https://pith.science/paper/DB4N6GA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6048&json=true","fetch_graph":"https://pith.science/api/pith-number/DB4N6GA3VYKQMYYQBBQMFAZRF4/graph.json","fetch_events":"https://pith.science/api/pith-number/DB4N6GA3VYKQMYYQBBQMFAZRF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DB4N6GA3VYKQMYYQBBQMFAZRF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DB4N6GA3VYKQMYYQBBQMFAZRF4/action/storage_attestation","attest_author":"https://pith.science/pith/DB4N6GA3VYKQMYYQBBQMFAZRF4/action/author_attestation","sign_citation":"https://pith.science/pith/DB4N6GA3VYKQMYYQBBQMFAZRF4/action/citation_signature","submit_replication":"https://pith.science/pith/DB4N6GA3VYKQMYYQBBQMFAZRF4/action/replication_record"}},"created_at":"2026-05-18T02:53:18.541514+00:00","updated_at":"2026-05-18T02:53:18.541514+00:00"}