{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4WOTVACV3CXZOAIX2ZLPWSYBYD","short_pith_number":"pith:4WOTVACV","canonical_record":{"source":{"id":"1902.02967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-08T08:06:40Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3913659412ca08ecaca2b55cd376501c59d9f3dbf481f48c9b93b6824fae51e4","abstract_canon_sha256":"0aa7aef0a6e05d774cafc36daa0e0974ac50e21a982e9bf45653b93182b53190"},"schema_version":"1.0"},"canonical_sha256":"e59d3a8055d8af970117d656fb4b01c0cf1e8f43aa055d984cd746a4c988f6dd","source":{"kind":"arxiv","id":"1902.02967","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02967","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02967v1","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02967","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"pith_short_12","alias_value":"4WOTVACV3CXZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4WOTVACV3CXZOAIX","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4WOTVACV","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4WOTVACV3CXZOAIX2ZLPWSYBYD","target":"record","payload":{"canonical_record":{"source":{"id":"1902.02967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-08T08:06:40Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3913659412ca08ecaca2b55cd376501c59d9f3dbf481f48c9b93b6824fae51e4","abstract_canon_sha256":"0aa7aef0a6e05d774cafc36daa0e0974ac50e21a982e9bf45653b93182b53190"},"schema_version":"1.0"},"canonical_sha256":"e59d3a8055d8af970117d656fb4b01c0cf1e8f43aa055d984cd746a4c988f6dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:28.720470Z","signature_b64":"1hALYdrWYwUNXw8KeiShd4d5w0REJfWhAANGVhUO8tBsmzp8VTNOubNFjvYowsX7y/y6GM+yyhilIKEiBoyBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e59d3a8055d8af970117d656fb4b01c0cf1e8f43aa055d984cd746a4c988f6dd","last_reissued_at":"2026-05-17T23:54:28.719817Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:28.719817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.02967","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-17T23:54:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwPoNvOMTjc+PCaWBDGDzaQpVdvGCBlQcuB/yLc7JTu3M6px3KaCMgzOBkj/4cIB6Ao5eMZY8jcAZw6AyQClBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:23:23.400054Z"},"content_sha256":"ed1ef6f473c9dabaab8ff2e295d924b84788c35e314ce51da1caeac75a50941f","schema_version":"1.0","event_id":"sha256:ed1ef6f473c9dabaab8ff2e295d924b84788c35e314ce51da1caeac75a50941f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4WOTVACV3CXZOAIX2ZLPWSYBYD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generic reductions for in-place polynomial multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.SC","authors_text":"Bruno Grenet (ECO), Daniel Roche, Pascal Giorgi (ECO)","submitted_at":"2019-02-08T08:06:40Z","abstract_excerpt":"The polynomial multiplication problem has attracted considerable attention since the early days of computer algebra, and several algorithms have been designed to achieve the best possible time complexity. More recently, efforts have been made to improve the space complexity, developing modified versions of a few specific algorithms to use no extra space while keeping the same asymptotic running time. In this work, we broaden the scope in two regards. First, we ask whether an arbitrary multiplication algorithm can be performed in-place generically. Second, we consider two important variants whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02967","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-17T23:54:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7dTmxOSDAzofrOF1iYD/lYOHsauTs6z1l5YVD3jn6GkJamIJQFRb3t2AJQU4FUqMV3LPqMplNPm1SK9Q6kL1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:23:23.400675Z"},"content_sha256":"12db8e54e252a176204c9421c98e095446f0951fe2ece919d91d8ab3556c022d","schema_version":"1.0","event_id":"sha256:12db8e54e252a176204c9421c98e095446f0951fe2ece919d91d8ab3556c022d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4WOTVACV3CXZOAIX2ZLPWSYBYD/bundle.json","state_url":"https://pith.science/pith/4WOTVACV3CXZOAIX2ZLPWSYBYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4WOTVACV3CXZOAIX2ZLPWSYBYD/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-05T23:23:23Z","links":{"resolver":"https://pith.science/pith/4WOTVACV3CXZOAIX2ZLPWSYBYD","bundle":"https://pith.science/pith/4WOTVACV3CXZOAIX2ZLPWSYBYD/bundle.json","state":"https://pith.science/pith/4WOTVACV3CXZOAIX2ZLPWSYBYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4WOTVACV3CXZOAIX2ZLPWSYBYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4WOTVACV3CXZOAIX2ZLPWSYBYD","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":"0aa7aef0a6e05d774cafc36daa0e0974ac50e21a982e9bf45653b93182b53190","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-08T08:06:40Z","title_canon_sha256":"3913659412ca08ecaca2b55cd376501c59d9f3dbf481f48c9b93b6824fae51e4"},"schema_version":"1.0","source":{"id":"1902.02967","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02967","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02967v1","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02967","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"pith_short_12","alias_value":"4WOTVACV3CXZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4WOTVACV3CXZOAIX","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4WOTVACV","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:12db8e54e252a176204c9421c98e095446f0951fe2ece919d91d8ab3556c022d","target":"graph","created_at":"2026-05-17T23:54:28Z","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":"The polynomial multiplication problem has attracted considerable attention since the early days of computer algebra, and several algorithms have been designed to achieve the best possible time complexity. More recently, efforts have been made to improve the space complexity, developing modified versions of a few specific algorithms to use no extra space while keeping the same asymptotic running time. In this work, we broaden the scope in two regards. First, we ask whether an arbitrary multiplication algorithm can be performed in-place generically. Second, we consider two important variants whi","authors_text":"Bruno Grenet (ECO), Daniel Roche, Pascal Giorgi (ECO)","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-08T08:06:40Z","title":"Generic reductions for in-place polynomial multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02967","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:ed1ef6f473c9dabaab8ff2e295d924b84788c35e314ce51da1caeac75a50941f","target":"record","created_at":"2026-05-17T23:54:28Z","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":"0aa7aef0a6e05d774cafc36daa0e0974ac50e21a982e9bf45653b93182b53190","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-08T08:06:40Z","title_canon_sha256":"3913659412ca08ecaca2b55cd376501c59d9f3dbf481f48c9b93b6824fae51e4"},"schema_version":"1.0","source":{"id":"1902.02967","kind":"arxiv","version":1}},"canonical_sha256":"e59d3a8055d8af970117d656fb4b01c0cf1e8f43aa055d984cd746a4c988f6dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e59d3a8055d8af970117d656fb4b01c0cf1e8f43aa055d984cd746a4c988f6dd","first_computed_at":"2026-05-17T23:54:28.719817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:28.719817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1hALYdrWYwUNXw8KeiShd4d5w0REJfWhAANGVhUO8tBsmzp8VTNOubNFjvYowsX7y/y6GM+yyhilIKEiBoyBDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:28.720470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.02967","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed1ef6f473c9dabaab8ff2e295d924b84788c35e314ce51da1caeac75a50941f","sha256:12db8e54e252a176204c9421c98e095446f0951fe2ece919d91d8ab3556c022d"],"state_sha256":"0581658b482341b2d5f64dd6c2de5b766e9046a413e34d19776715e65eb18911"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dcHLLOdSsam0VWVhhXpcg7c3y1GmfOhdMWavTObf0jE466GJv1Rl3uCmy4MtOQErrEEeRyUcOhcjvSnAGdk6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:23:23.404649Z","bundle_sha256":"2688d2aaa6c888a81355a9002a0a63260f1468750baef3f9bad2840fa82d2363"}}