{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3OMU45GUULL6WIMBUB5UHOOQJO","short_pith_number":"pith:3OMU45GU","schema_version":"1.0","canonical_sha256":"db994e74d4a2d7eb2181a07b43b9d04ba0b72d0a0531d80b26e62c091db5e065","source":{"kind":"arxiv","id":"1512.06520","version":3},"attestation_state":"computed","paper":{"title":"Fast Operations on Linearized Polynomials and their Applications in Coding Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SC","authors_text":"Antonia Wachter-Zeh, Sven Puchinger","submitted_at":"2015-12-21T08:26:14Z","abstract_excerpt":"This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial degree $s$, independent of the underlying field extension degree~$m$. We show that our multiplication algorithm is faster than all known ones when $s \\leq m$. Using a result by Caruso and Le Borgne (2017), this immediately implies a sub-quadratic division algorithm for linearized polynomials for arbitrary polynomial degree $s$. Also, we propose algorithms wi"},"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":"1512.06520","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-12-21T08:26:14Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"bef985a24e3363e8d7dee21b571c4625b84d2616af0fb65431d118d39a736b32","abstract_canon_sha256":"49524b6c1f152b998bc69468d3d809a1b8422cacc01c9e98740c9ba8201abc90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:33.813629Z","signature_b64":"FzrDjshmcsJ7VFkTWJ49QZYh4AunP2Q+3dJg/IdcTTadKWRqsLvIYGwgOUxWYj3OGWlh0Vuf1NxFdGsg0NUnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db994e74d4a2d7eb2181a07b43b9d04ba0b72d0a0531d80b26e62c091db5e065","last_reissued_at":"2026-05-18T00:40:33.812842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:33.812842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Operations on Linearized Polynomials and their Applications in Coding Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SC","authors_text":"Antonia Wachter-Zeh, Sven Puchinger","submitted_at":"2015-12-21T08:26:14Z","abstract_excerpt":"This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial degree $s$, independent of the underlying field extension degree~$m$. We show that our multiplication algorithm is faster than all known ones when $s \\leq m$. Using a result by Caruso and Le Borgne (2017), this immediately implies a sub-quadratic division algorithm for linearized polynomials for arbitrary polynomial degree $s$. Also, we propose algorithms wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06520","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":"1512.06520","created_at":"2026-05-18T00:40:33.812973+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06520v3","created_at":"2026-05-18T00:40:33.812973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06520","created_at":"2026-05-18T00:40:33.812973+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OMU45GUULL6","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OMU45GUULL6WIMB","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OMU45GU","created_at":"2026-05-18T12:29:02.477457+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/3OMU45GUULL6WIMBUB5UHOOQJO","json":"https://pith.science/pith/3OMU45GUULL6WIMBUB5UHOOQJO.json","graph_json":"https://pith.science/api/pith-number/3OMU45GUULL6WIMBUB5UHOOQJO/graph.json","events_json":"https://pith.science/api/pith-number/3OMU45GUULL6WIMBUB5UHOOQJO/events.json","paper":"https://pith.science/paper/3OMU45GU"},"agent_actions":{"view_html":"https://pith.science/pith/3OMU45GUULL6WIMBUB5UHOOQJO","download_json":"https://pith.science/pith/3OMU45GUULL6WIMBUB5UHOOQJO.json","view_paper":"https://pith.science/paper/3OMU45GU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06520&json=true","fetch_graph":"https://pith.science/api/pith-number/3OMU45GUULL6WIMBUB5UHOOQJO/graph.json","fetch_events":"https://pith.science/api/pith-number/3OMU45GUULL6WIMBUB5UHOOQJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OMU45GUULL6WIMBUB5UHOOQJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OMU45GUULL6WIMBUB5UHOOQJO/action/storage_attestation","attest_author":"https://pith.science/pith/3OMU45GUULL6WIMBUB5UHOOQJO/action/author_attestation","sign_citation":"https://pith.science/pith/3OMU45GUULL6WIMBUB5UHOOQJO/action/citation_signature","submit_replication":"https://pith.science/pith/3OMU45GUULL6WIMBUB5UHOOQJO/action/replication_record"}},"created_at":"2026-05-18T00:40:33.812973+00:00","updated_at":"2026-05-18T00:40:33.812973+00:00"}