{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3OMU45GUULL6WIMBUB5UHOOQJO","short_pith_number":"pith:3OMU45GU","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"},"canonical_sha256":"db994e74d4a2d7eb2181a07b43b9d04ba0b72d0a0531d80b26e62c091db5e065","source":{"kind":"arxiv","id":"1512.06520","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06520","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06520v3","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06520","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"3OMU45GUULL6","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3OMU45GUULL6WIMB","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3OMU45GU","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3OMU45GUULL6WIMBUB5UHOOQJO","target":"record","payload":{"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"},"canonical_sha256":"db994e74d4a2d7eb2181a07b43b9d04ba0b72d0a0531d80b26e62c091db5e065","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"},"source_kind":"arxiv","source_id":"1512.06520","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y9Wf45Ohy6QFn3lxsa4Qi0/bmImHsUlrlM0BT5E5yFuP6OZaqklI8088sDT8hCn1M9Zwlv6/gbWu/szpa8TIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:32:11.024291Z"},"content_sha256":"8a2aea14c9a71f2d15946fc649e9e3f97d8eab88f019d6619c92108852ff8c17","schema_version":"1.0","event_id":"sha256:8a2aea14c9a71f2d15946fc649e9e3f97d8eab88f019d6619c92108852ff8c17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3OMU45GUULL6WIMBUB5UHOOQJO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zcoxsAiEk83S6R/lRb2mTCDKkRvPWxz0TiUCoXU9DLNCDQUj2V4SxFY7lPq8l4WozNit606t3JreQo+2Qt5zAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:32:11.024728Z"},"content_sha256":"1fe01cd802843aaeb86d1199712fac4bb47c0ab7c3cee70180cf5aa7ef5fd086","schema_version":"1.0","event_id":"sha256:1fe01cd802843aaeb86d1199712fac4bb47c0ab7c3cee70180cf5aa7ef5fd086"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3OMU45GUULL6WIMBUB5UHOOQJO/bundle.json","state_url":"https://pith.science/pith/3OMU45GUULL6WIMBUB5UHOOQJO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3OMU45GUULL6WIMBUB5UHOOQJO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T07:32:11Z","links":{"resolver":"https://pith.science/pith/3OMU45GUULL6WIMBUB5UHOOQJO","bundle":"https://pith.science/pith/3OMU45GUULL6WIMBUB5UHOOQJO/bundle.json","state":"https://pith.science/pith/3OMU45GUULL6WIMBUB5UHOOQJO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3OMU45GUULL6WIMBUB5UHOOQJO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3OMU45GUULL6WIMBUB5UHOOQJO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"49524b6c1f152b998bc69468d3d809a1b8422cacc01c9e98740c9ba8201abc90","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-12-21T08:26:14Z","title_canon_sha256":"bef985a24e3363e8d7dee21b571c4625b84d2616af0fb65431d118d39a736b32"},"schema_version":"1.0","source":{"id":"1512.06520","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06520","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06520v3","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06520","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"3OMU45GUULL6","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3OMU45GUULL6WIMB","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3OMU45GU","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:1fe01cd802843aaeb86d1199712fac4bb47c0ab7c3cee70180cf5aa7ef5fd086","target":"graph","created_at":"2026-05-18T00:40:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Antonia Wachter-Zeh, Sven Puchinger","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-12-21T08:26:14Z","title":"Fast Operations on Linearized Polynomials and their Applications in Coding Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06520","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8a2aea14c9a71f2d15946fc649e9e3f97d8eab88f019d6619c92108852ff8c17","target":"record","created_at":"2026-05-18T00:40:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"49524b6c1f152b998bc69468d3d809a1b8422cacc01c9e98740c9ba8201abc90","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-12-21T08:26:14Z","title_canon_sha256":"bef985a24e3363e8d7dee21b571c4625b84d2616af0fb65431d118d39a736b32"},"schema_version":"1.0","source":{"id":"1512.06520","kind":"arxiv","version":3}},"canonical_sha256":"db994e74d4a2d7eb2181a07b43b9d04ba0b72d0a0531d80b26e62c091db5e065","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db994e74d4a2d7eb2181a07b43b9d04ba0b72d0a0531d80b26e62c091db5e065","first_computed_at":"2026-05-18T00:40:33.812842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:33.812842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FzrDjshmcsJ7VFkTWJ49QZYh4AunP2Q+3dJg/IdcTTadKWRqsLvIYGwgOUxWYj3OGWlh0Vuf1NxFdGsg0NUnCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:33.813629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06520","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a2aea14c9a71f2d15946fc649e9e3f97d8eab88f019d6619c92108852ff8c17","sha256:1fe01cd802843aaeb86d1199712fac4bb47c0ab7c3cee70180cf5aa7ef5fd086"],"state_sha256":"783a2b57f5b11e3fedab2624fba8eabaf430b1cee0d350422b7050bd6906dbbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OYA/1c6Om11+Qos44bAky2SGtx1lKRCRm2QVsrrgffB4w2aTz76F6x5e5mNA3jtGtVxVk0J4WRVNbcerriECCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:32:11.028140Z","bundle_sha256":"067239e79c4dcc6ac64e8bbc4764bcde446228ba64d7747ff453fdecc9ee320f"}}