{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TER4CH6KNUEHYXGYQH5RW36PUJ","short_pith_number":"pith:TER4CH6K","canonical_record":{"source":{"id":"1702.01665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-02-06T15:47:28Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"2cefc9fc41bb707fd11d891ea864346c80e7f2319dbb0cbf547cc94de0e8e514","abstract_canon_sha256":"101d24d3c19db9bb231c2894ca632b3270fe35ca3b66156459e4b2375720b0b2"},"schema_version":"1.0"},"canonical_sha256":"9923c11fca6d087c5cd881fb1b6fcfa2401b787e6d37b1bccd4bddd78e1fdfd4","source":{"kind":"arxiv","id":"1702.01665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01665","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01665v1","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01665","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"pith_short_12","alias_value":"TER4CH6KNUEH","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TER4CH6KNUEHYXGY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TER4CH6K","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TER4CH6KNUEHYXGYQH5RW36PUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1702.01665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-02-06T15:47:28Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"2cefc9fc41bb707fd11d891ea864346c80e7f2319dbb0cbf547cc94de0e8e514","abstract_canon_sha256":"101d24d3c19db9bb231c2894ca632b3270fe35ca3b66156459e4b2375720b0b2"},"schema_version":"1.0"},"canonical_sha256":"9923c11fca6d087c5cd881fb1b6fcfa2401b787e6d37b1bccd4bddd78e1fdfd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:22.271562Z","signature_b64":"tmVwY7JcSRVIXGwxxwMpaNWoCW3WQqHdzAvooS/3RaLMMEcc2yBpUOPh0V5RmlhCLSJuKsztTt3hQeDuZaoqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9923c11fca6d087c5cd881fb1b6fcfa2401b787e6d37b1bccd4bddd78e1fdfd4","last_reissued_at":"2026-05-18T00:51:22.270700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:22.270700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.01665","source_version":1,"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:51:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zRK6xMfSN8NTZ1q69OQuHFaeUafym6Mxz596Lx0RIgH45l8Q0UF56mqMA/e6Q8P0a3Z/4YxZHsdDyyDihgv0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:47:41.998909Z"},"content_sha256":"bed627cf4e24fba559b6ce1eae32eaae6e38b5697d65240aec1b313d4845cf31","schema_version":"1.0","event_id":"sha256:bed627cf4e24fba559b6ce1eae32eaae6e38b5697d65240aec1b313d4845cf31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TER4CH6KNUEHYXGYQH5RW36PUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast multiplication for skew polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"cs.SC","authors_text":"IRMAR), J\\'er\\'emy Le Borgne (ENS Rennes, Xavier Caruso (IRMAR)","submitted_at":"2017-02-06T15:47:28Z","abstract_excerpt":"We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our algorithms improve the best known complexity for these problems, and reach the optimal asymptotic complexity bound for large degree. We also give an adaptation of our algorithm for polynomials of small degree. Finally, we use our methods to improve on the best known complexities for various arithmetics problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01665","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"},"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:51:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJEuX2Wi/8VAiRuv/aNMML14PGadAips2fD3FdtIRQ/gmTgjwa6jXnvmjuagSadOEonq1bl5/p88Vs7zG9uyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:47:41.999616Z"},"content_sha256":"420ea21ad213a95479c73866ca4bcd4dd8e547631ca08a29df4f85f3b4a74769","schema_version":"1.0","event_id":"sha256:420ea21ad213a95479c73866ca4bcd4dd8e547631ca08a29df4f85f3b4a74769"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TER4CH6KNUEHYXGYQH5RW36PUJ/bundle.json","state_url":"https://pith.science/pith/TER4CH6KNUEHYXGYQH5RW36PUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TER4CH6KNUEHYXGYQH5RW36PUJ/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-06-10T16:47:42Z","links":{"resolver":"https://pith.science/pith/TER4CH6KNUEHYXGYQH5RW36PUJ","bundle":"https://pith.science/pith/TER4CH6KNUEHYXGYQH5RW36PUJ/bundle.json","state":"https://pith.science/pith/TER4CH6KNUEHYXGYQH5RW36PUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TER4CH6KNUEHYXGYQH5RW36PUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TER4CH6KNUEHYXGYQH5RW36PUJ","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":"101d24d3c19db9bb231c2894ca632b3270fe35ca3b66156459e4b2375720b0b2","cross_cats_sorted":["math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-02-06T15:47:28Z","title_canon_sha256":"2cefc9fc41bb707fd11d891ea864346c80e7f2319dbb0cbf547cc94de0e8e514"},"schema_version":"1.0","source":{"id":"1702.01665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01665","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01665v1","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01665","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"pith_short_12","alias_value":"TER4CH6KNUEH","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TER4CH6KNUEHYXGY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TER4CH6K","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:420ea21ad213a95479c73866ca4bcd4dd8e547631ca08a29df4f85f3b4a74769","target":"graph","created_at":"2026-05-18T00:51:22Z","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":"We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our algorithms improve the best known complexity for these problems, and reach the optimal asymptotic complexity bound for large degree. We also give an adaptation of our algorithm for polynomials of small degree. Finally, we use our methods to improve on the best known complexities for various arithmetics problems.","authors_text":"IRMAR), J\\'er\\'emy Le Borgne (ENS Rennes, Xavier Caruso (IRMAR)","cross_cats":["math.RA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-02-06T15:47:28Z","title":"Fast multiplication for skew polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01665","kind":"arxiv","version":1},"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:bed627cf4e24fba559b6ce1eae32eaae6e38b5697d65240aec1b313d4845cf31","target":"record","created_at":"2026-05-18T00:51:22Z","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":"101d24d3c19db9bb231c2894ca632b3270fe35ca3b66156459e4b2375720b0b2","cross_cats_sorted":["math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-02-06T15:47:28Z","title_canon_sha256":"2cefc9fc41bb707fd11d891ea864346c80e7f2319dbb0cbf547cc94de0e8e514"},"schema_version":"1.0","source":{"id":"1702.01665","kind":"arxiv","version":1}},"canonical_sha256":"9923c11fca6d087c5cd881fb1b6fcfa2401b787e6d37b1bccd4bddd78e1fdfd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9923c11fca6d087c5cd881fb1b6fcfa2401b787e6d37b1bccd4bddd78e1fdfd4","first_computed_at":"2026-05-18T00:51:22.270700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:22.270700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tmVwY7JcSRVIXGwxxwMpaNWoCW3WQqHdzAvooS/3RaLMMEcc2yBpUOPh0V5RmlhCLSJuKsztTt3hQeDuZaoqAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:22.271562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bed627cf4e24fba559b6ce1eae32eaae6e38b5697d65240aec1b313d4845cf31","sha256:420ea21ad213a95479c73866ca4bcd4dd8e547631ca08a29df4f85f3b4a74769"],"state_sha256":"29d1934081cb3c1da838835004cc516ba0751b31ed2b11d6944a25917dea1c96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t4m1FDEkh3A2isQcaLdhqDNIM5dI7p6u/QlYSWJb/7qCHV6vlrmqIeCtoRB7lRtvQTj+EByFObntdnhnHwQ/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T16:47:42.003807Z","bundle_sha256":"e812530bcea073a64c1af95c01019786f22d9194e54c5d115a8445fe4cd69a13"}}