{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W5FLI5KVJ7OBNNI7YBYEZZHEAA","short_pith_number":"pith:W5FLI5KV","canonical_record":{"source":{"id":"1708.09746","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-08-31T14:30:44Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"98ea9e95b5c1bf07d689810c209284faa915793b8aed1b89b0781c8f92962c9e","abstract_canon_sha256":"0e67941d9d38a9ce34e599a8664815d47d50223d1ef23c5c2d3964db26adccfa"},"schema_version":"1.0"},"canonical_sha256":"b74ab475554fdc16b51fc0704ce4e4001183c03469644642ca0b2f55ef699187","source":{"kind":"arxiv","id":"1708.09746","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09746","created_at":"2026-05-18T00:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09746v3","created_at":"2026-05-18T00:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09746","created_at":"2026-05-18T00:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"W5FLI5KVJ7OB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W5FLI5KVJ7OBNNI7","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W5FLI5KV","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W5FLI5KVJ7OBNNI7YBYEZZHEAA","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09746","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-08-31T14:30:44Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"98ea9e95b5c1bf07d689810c209284faa915793b8aed1b89b0781c8f92962c9e","abstract_canon_sha256":"0e67941d9d38a9ce34e599a8664815d47d50223d1ef23c5c2d3964db26adccfa"},"schema_version":"1.0"},"canonical_sha256":"b74ab475554fdc16b51fc0704ce4e4001183c03469644642ca0b2f55ef699187","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:45.748615Z","signature_b64":"+teOdP+OC8cqu1/x/kUDdtHkONvJ80TuFx8dhpnV9qMTRtGuoW1AVnL9ncV7kBE9Q74zvjYKHJ0HF4ogtKOLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b74ab475554fdc16b51fc0704ce4e4001183c03469644642ca0b2f55ef699187","last_reissued_at":"2026-05-18T00:26:45.748014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:45.748014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09746","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:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Knhi60VN+z5g95GaYGv5wbjHidcPbNtNBjT24Zn+FVbsJ2DMIPsHgXti6sq+XtvjHLzBydfT3zhfyoPltfv7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:35:44.382968Z"},"content_sha256":"0ba44dac0348225a4b18e9b8305db4f8c0778d24507dfec6bd39d61c38cc8cc0","schema_version":"1.0","event_id":"sha256:0ba44dac0348225a4b18e9b8305db4f8c0778d24507dfec6bd39d61c38cc8cc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W5FLI5KVJ7OBNNI7YBYEZZHEAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Multiplication for Long Binary Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.SC","authors_text":"Bo-Yin Yang, Chen-Mou Cheng, Ming-Shing Chen, Po-Chun Kuo, Wen-Ding Li","submitted_at":"2017-08-31T14:30:44Z","abstract_excerpt":"We set new speed records for multiplying long polynomials over finite fields of characteristic two. Our multiplication algorithm is based on an additive FFT (Fast Fourier Transform) by Lin, Chung, and Huang in 2014 comparing to previously best results based on multiplicative FFTs. Both methods have similar complexity for arithmetic operations on underlying finite field; however, our implementation shows that the additive FFT has less overhead. For further optimization, we employ a tower field construction because the multipliers in the additive FFT naturally fall into small subfields, which le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09746","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:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QMAdxCdRzo4CK1YEhsYN8HJxy9bIo0nKpGO1P3GvFtgNTgw1LqoZzXBN0PX4j5iPNDVdApVNZYphWYWjPB1ICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:35:44.383337Z"},"content_sha256":"006d5c624cd66d6fe763420330af5da0c6f07f5a9b8c96e034d591d4cbb9dab3","schema_version":"1.0","event_id":"sha256:006d5c624cd66d6fe763420330af5da0c6f07f5a9b8c96e034d591d4cbb9dab3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5FLI5KVJ7OBNNI7YBYEZZHEAA/bundle.json","state_url":"https://pith.science/pith/W5FLI5KVJ7OBNNI7YBYEZZHEAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5FLI5KVJ7OBNNI7YBYEZZHEAA/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-05T15:35:44Z","links":{"resolver":"https://pith.science/pith/W5FLI5KVJ7OBNNI7YBYEZZHEAA","bundle":"https://pith.science/pith/W5FLI5KVJ7OBNNI7YBYEZZHEAA/bundle.json","state":"https://pith.science/pith/W5FLI5KVJ7OBNNI7YBYEZZHEAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5FLI5KVJ7OBNNI7YBYEZZHEAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W5FLI5KVJ7OBNNI7YBYEZZHEAA","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":"0e67941d9d38a9ce34e599a8664815d47d50223d1ef23c5c2d3964db26adccfa","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-08-31T14:30:44Z","title_canon_sha256":"98ea9e95b5c1bf07d689810c209284faa915793b8aed1b89b0781c8f92962c9e"},"schema_version":"1.0","source":{"id":"1708.09746","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09746","created_at":"2026-05-18T00:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09746v3","created_at":"2026-05-18T00:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09746","created_at":"2026-05-18T00:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"W5FLI5KVJ7OB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W5FLI5KVJ7OBNNI7","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W5FLI5KV","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:006d5c624cd66d6fe763420330af5da0c6f07f5a9b8c96e034d591d4cbb9dab3","target":"graph","created_at":"2026-05-18T00:26:45Z","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 set new speed records for multiplying long polynomials over finite fields of characteristic two. Our multiplication algorithm is based on an additive FFT (Fast Fourier Transform) by Lin, Chung, and Huang in 2014 comparing to previously best results based on multiplicative FFTs. Both methods have similar complexity for arithmetic operations on underlying finite field; however, our implementation shows that the additive FFT has less overhead. For further optimization, we employ a tower field construction because the multipliers in the additive FFT naturally fall into small subfields, which le","authors_text":"Bo-Yin Yang, Chen-Mou Cheng, Ming-Shing Chen, Po-Chun Kuo, Wen-Ding Li","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-08-31T14:30:44Z","title":"Faster Multiplication for Long Binary Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09746","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:0ba44dac0348225a4b18e9b8305db4f8c0778d24507dfec6bd39d61c38cc8cc0","target":"record","created_at":"2026-05-18T00:26:45Z","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":"0e67941d9d38a9ce34e599a8664815d47d50223d1ef23c5c2d3964db26adccfa","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-08-31T14:30:44Z","title_canon_sha256":"98ea9e95b5c1bf07d689810c209284faa915793b8aed1b89b0781c8f92962c9e"},"schema_version":"1.0","source":{"id":"1708.09746","kind":"arxiv","version":3}},"canonical_sha256":"b74ab475554fdc16b51fc0704ce4e4001183c03469644642ca0b2f55ef699187","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b74ab475554fdc16b51fc0704ce4e4001183c03469644642ca0b2f55ef699187","first_computed_at":"2026-05-18T00:26:45.748014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:45.748014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+teOdP+OC8cqu1/x/kUDdtHkONvJ80TuFx8dhpnV9qMTRtGuoW1AVnL9ncV7kBE9Q74zvjYKHJ0HF4ogtKOLBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:45.748615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09746","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ba44dac0348225a4b18e9b8305db4f8c0778d24507dfec6bd39d61c38cc8cc0","sha256:006d5c624cd66d6fe763420330af5da0c6f07f5a9b8c96e034d591d4cbb9dab3"],"state_sha256":"73cdfe6339c30ec3dc835ddc82d72da1318cd4b406757549aa91563bda248554"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V27cQva8Vu5Nb5PbH+AeuCrkXMf9wmeNUjKvsdqGkmiLWAxjY7aQt3IXNlwF6HoBCjxv7M69iMI0G5FHF2O/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:35:44.385466Z","bundle_sha256":"f4240fd94230d03ee5cc0fc16230c1e584a38c53e7d4ad68e0c9649d4a6f3f07"}}