{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OWO7UONTX5FUR6U2GZPHSVEOJY","short_pith_number":"pith:OWO7UONT","schema_version":"1.0","canonical_sha256":"759dfa39b3bf4b48fa9a365e79548e4e0c4e65ba919e565374850f45b8516706","source":{"kind":"arxiv","id":"1604.05899","version":2},"attestation_state":"computed","paper":{"title":"Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.IT"],"primary_cat":"cs.IT","authors_text":"David M\\\"odinger, Johan Rosenkilde n\\'e Nielsen, Martin Bossert, Sven M\\\"uelich, Sven Puchinger","submitted_at":"2016-04-20T11:24:53Z","abstract_excerpt":"We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an $O(\\ell^3 n^{(\\omega+1)/2} \\log(n))$ decoding algorithm for $\\ell$-Interleaved Gabidulin codes of length $n$, where $\\omega$ is the matrix multiplication exponent, improving in the exponent of $n$ compared to previous results."},"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":"1604.05899","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-20T11:24:53Z","cross_cats_sorted":["cs.SC","math.IT"],"title_canon_sha256":"6fd374733efc05f42e0da0b4e1a084899c46fd284bb2a04a46bf8f3ec1e07b38","abstract_canon_sha256":"1a59da4b1b4cdddbf9742a4bf6aa15d31932138818205d67dd0eb6d6c3f85a8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:37.350874Z","signature_b64":"DSL/PtqQppS410EhN2riXbcbw4Z0R38sX6Dqj88jxgul0GnZynshvml0EBRHL61H87LPFCLhICXlTmG2uhyPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"759dfa39b3bf4b48fa9a365e79548e4e0c4e65ba919e565374850f45b8516706","last_reissued_at":"2026-05-18T01:04:37.350165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:37.350165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.IT"],"primary_cat":"cs.IT","authors_text":"David M\\\"odinger, Johan Rosenkilde n\\'e Nielsen, Martin Bossert, Sven M\\\"uelich, Sven Puchinger","submitted_at":"2016-04-20T11:24:53Z","abstract_excerpt":"We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an $O(\\ell^3 n^{(\\omega+1)/2} \\log(n))$ decoding algorithm for $\\ell$-Interleaved Gabidulin codes of length $n$, where $\\omega$ is the matrix multiplication exponent, improving in the exponent of $n$ compared to previous results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05899","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":"1604.05899","created_at":"2026-05-18T01:04:37.350278+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05899v2","created_at":"2026-05-18T01:04:37.350278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05899","created_at":"2026-05-18T01:04:37.350278+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWO7UONTX5FU","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWO7UONTX5FUR6U2","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWO7UONT","created_at":"2026-05-18T12:30:36.002864+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/OWO7UONTX5FUR6U2GZPHSVEOJY","json":"https://pith.science/pith/OWO7UONTX5FUR6U2GZPHSVEOJY.json","graph_json":"https://pith.science/api/pith-number/OWO7UONTX5FUR6U2GZPHSVEOJY/graph.json","events_json":"https://pith.science/api/pith-number/OWO7UONTX5FUR6U2GZPHSVEOJY/events.json","paper":"https://pith.science/paper/OWO7UONT"},"agent_actions":{"view_html":"https://pith.science/pith/OWO7UONTX5FUR6U2GZPHSVEOJY","download_json":"https://pith.science/pith/OWO7UONTX5FUR6U2GZPHSVEOJY.json","view_paper":"https://pith.science/paper/OWO7UONT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05899&json=true","fetch_graph":"https://pith.science/api/pith-number/OWO7UONTX5FUR6U2GZPHSVEOJY/graph.json","fetch_events":"https://pith.science/api/pith-number/OWO7UONTX5FUR6U2GZPHSVEOJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWO7UONTX5FUR6U2GZPHSVEOJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWO7UONTX5FUR6U2GZPHSVEOJY/action/storage_attestation","attest_author":"https://pith.science/pith/OWO7UONTX5FUR6U2GZPHSVEOJY/action/author_attestation","sign_citation":"https://pith.science/pith/OWO7UONTX5FUR6U2GZPHSVEOJY/action/citation_signature","submit_replication":"https://pith.science/pith/OWO7UONTX5FUR6U2GZPHSVEOJY/action/replication_record"}},"created_at":"2026-05-18T01:04:37.350278+00:00","updated_at":"2026-05-18T01:04:37.350278+00:00"}