{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VY2COHCHXOJAAOG6MWLEB5HEOD","short_pith_number":"pith:VY2COHCH","schema_version":"1.0","canonical_sha256":"ae34271c47bb920038de659640f4e470d9e8876878066a8808d21a660ae02e96","source":{"kind":"arxiv","id":"1802.03932","version":1},"attestation_state":"computed","paper":{"title":"Frobenius Additive Fast Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.SC","authors_text":"Bo-Yin Yang, Chen-Mou Cheng, Ming-Shing Chen, Po-Chun Kuo, Wen-Ding Li","submitted_at":"2018-02-12T08:40:08Z","abstract_excerpt":"In ISSAC 2017, van der Hoeven and Larrieu showed that evaluating a polynomial P in GF(q)[x] of degree <n at all n-th roots of unity in GF($q^d$) can essentially be computed d-time faster than evaluating Q in GF($q^d$)[x] at all these roots, assuming GF($q^d$) contains a primitive n-th root of unity. Termed the Frobenius FFT, this discovery has a profound impact on polynomial multiplication, especially for multiplying binary polynomials, which finds ample application in coding theory and cryptography. In this paper, we show that the theory of Frobenius FFT beautifully generalizes to a class of "},"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":"1802.03932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-12T08:40:08Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2fef830a7935345784120ab5bb53f1d4c13a7d08a6aadf43c9a55213d5400e36","abstract_canon_sha256":"1e77119209df65466f4f343ab941c8eeeffb20d0451e8254a359f9dac6c09573"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:49.989651Z","signature_b64":"pWJ/mlijodcM6jWQS6AFOH+CkhEpZMqcgDwZIZ8WUy0lU8vmncJPzPlbOw7YK6osNBTxB1E2niL2zpROzTKZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae34271c47bb920038de659640f4e470d9e8876878066a8808d21a660ae02e96","last_reissued_at":"2026-05-18T00:23:49.988901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:49.988901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frobenius Additive Fast Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.SC","authors_text":"Bo-Yin Yang, Chen-Mou Cheng, Ming-Shing Chen, Po-Chun Kuo, Wen-Ding Li","submitted_at":"2018-02-12T08:40:08Z","abstract_excerpt":"In ISSAC 2017, van der Hoeven and Larrieu showed that evaluating a polynomial P in GF(q)[x] of degree <n at all n-th roots of unity in GF($q^d$) can essentially be computed d-time faster than evaluating Q in GF($q^d$)[x] at all these roots, assuming GF($q^d$) contains a primitive n-th root of unity. Termed the Frobenius FFT, this discovery has a profound impact on polynomial multiplication, especially for multiplying binary polynomials, which finds ample application in coding theory and cryptography. In this paper, we show that the theory of Frobenius FFT beautifully generalizes to a class of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03932","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":"1802.03932","created_at":"2026-05-18T00:23:49.989021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03932v1","created_at":"2026-05-18T00:23:49.989021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03932","created_at":"2026-05-18T00:23:49.989021+00:00"},{"alias_kind":"pith_short_12","alias_value":"VY2COHCHXOJA","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VY2COHCHXOJAAOG6","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VY2COHCH","created_at":"2026-05-18T12:32:59.047623+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/VY2COHCHXOJAAOG6MWLEB5HEOD","json":"https://pith.science/pith/VY2COHCHXOJAAOG6MWLEB5HEOD.json","graph_json":"https://pith.science/api/pith-number/VY2COHCHXOJAAOG6MWLEB5HEOD/graph.json","events_json":"https://pith.science/api/pith-number/VY2COHCHXOJAAOG6MWLEB5HEOD/events.json","paper":"https://pith.science/paper/VY2COHCH"},"agent_actions":{"view_html":"https://pith.science/pith/VY2COHCHXOJAAOG6MWLEB5HEOD","download_json":"https://pith.science/pith/VY2COHCHXOJAAOG6MWLEB5HEOD.json","view_paper":"https://pith.science/paper/VY2COHCH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03932&json=true","fetch_graph":"https://pith.science/api/pith-number/VY2COHCHXOJAAOG6MWLEB5HEOD/graph.json","fetch_events":"https://pith.science/api/pith-number/VY2COHCHXOJAAOG6MWLEB5HEOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VY2COHCHXOJAAOG6MWLEB5HEOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VY2COHCHXOJAAOG6MWLEB5HEOD/action/storage_attestation","attest_author":"https://pith.science/pith/VY2COHCHXOJAAOG6MWLEB5HEOD/action/author_attestation","sign_citation":"https://pith.science/pith/VY2COHCHXOJAAOG6MWLEB5HEOD/action/citation_signature","submit_replication":"https://pith.science/pith/VY2COHCHXOJAAOG6MWLEB5HEOD/action/replication_record"}},"created_at":"2026-05-18T00:23:49.989021+00:00","updated_at":"2026-05-18T00:23:49.989021+00:00"}