{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PBIODSM63EYPONFGVPDWOXJQTX","short_pith_number":"pith:PBIODSM6","schema_version":"1.0","canonical_sha256":"7850e1c99ed930f734a6abc7675d309dcdc0d74c30fc308c8ce90d7d30ef1d9a","source":{"kind":"arxiv","id":"1803.11301","version":1},"attestation_state":"computed","paper":{"title":"Multiplying boolean Polynomials with Frobenius Partitions in Additive Fast Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Bo-Yin Yang, Chen-Mou Cheng, Ming-Shing Chen, Po-Chun Kuo, Wen-Ding Li","submitted_at":"2018-03-30T01:09:30Z","abstract_excerpt":"We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for evaluation with additive FFT and a high order element under Frobenius map of $\\mathbb{F}_{2}$. With the high order element, we can derive more values of the polynomials under Frobenius map. Besides, we also adapt the additive FFT to efficiently evaluate polynomials at the set with an encoding process.\n  For the implementation, we reorder the computations in the additive FFT for reducing the number of mem"},"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":"1803.11301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-03-30T01:09:30Z","cross_cats_sorted":[],"title_canon_sha256":"ece9590fbc7c343bc702b60767c5be9ebdc5732c1e58ee397aa22a9b00f6bd10","abstract_canon_sha256":"d65f0730b4c67638760785de6674dc3d8d809417180c9017672e6d4de2c03f50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:44.104475Z","signature_b64":"eLrKLzltVxVUfaVwTidWKQre3f4hKCFmrMuTL6XkmsRKoXSyAgmCZbXgCnGuRLScizUVR23SxR3KdcLdwdB1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7850e1c99ed930f734a6abc7675d309dcdc0d74c30fc308c8ce90d7d30ef1d9a","last_reissued_at":"2026-05-18T00:19:44.103856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:44.103856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiplying boolean Polynomials with Frobenius Partitions in Additive Fast Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Bo-Yin Yang, Chen-Mou Cheng, Ming-Shing Chen, Po-Chun Kuo, Wen-Ding Li","submitted_at":"2018-03-30T01:09:30Z","abstract_excerpt":"We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for evaluation with additive FFT and a high order element under Frobenius map of $\\mathbb{F}_{2}$. With the high order element, we can derive more values of the polynomials under Frobenius map. Besides, we also adapt the additive FFT to efficiently evaluate polynomials at the set with an encoding process.\n  For the implementation, we reorder the computations in the additive FFT for reducing the number of mem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11301","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.11301","created_at":"2026-05-18T00:19:44.103947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.11301v1","created_at":"2026-05-18T00:19:44.103947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11301","created_at":"2026-05-18T00:19:44.103947+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBIODSM63EYP","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBIODSM63EYPONFG","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBIODSM6","created_at":"2026-05-18T12:32:43.782077+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/PBIODSM63EYPONFGVPDWOXJQTX","json":"https://pith.science/pith/PBIODSM63EYPONFGVPDWOXJQTX.json","graph_json":"https://pith.science/api/pith-number/PBIODSM63EYPONFGVPDWOXJQTX/graph.json","events_json":"https://pith.science/api/pith-number/PBIODSM63EYPONFGVPDWOXJQTX/events.json","paper":"https://pith.science/paper/PBIODSM6"},"agent_actions":{"view_html":"https://pith.science/pith/PBIODSM63EYPONFGVPDWOXJQTX","download_json":"https://pith.science/pith/PBIODSM63EYPONFGVPDWOXJQTX.json","view_paper":"https://pith.science/paper/PBIODSM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.11301&json=true","fetch_graph":"https://pith.science/api/pith-number/PBIODSM63EYPONFGVPDWOXJQTX/graph.json","fetch_events":"https://pith.science/api/pith-number/PBIODSM63EYPONFGVPDWOXJQTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBIODSM63EYPONFGVPDWOXJQTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBIODSM63EYPONFGVPDWOXJQTX/action/storage_attestation","attest_author":"https://pith.science/pith/PBIODSM63EYPONFGVPDWOXJQTX/action/author_attestation","sign_citation":"https://pith.science/pith/PBIODSM63EYPONFGVPDWOXJQTX/action/citation_signature","submit_replication":"https://pith.science/pith/PBIODSM63EYPONFGVPDWOXJQTX/action/replication_record"}},"created_at":"2026-05-18T00:19:44.103947+00:00","updated_at":"2026-05-18T00:19:44.103947+00:00"}