{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:E5VSSMMUVZJHDEEN4U2YTCDXPG","short_pith_number":"pith:E5VSSMMU","schema_version":"1.0","canonical_sha256":"276b293194ae5271908de53589887779af49c68904ec4e2e75c1b6827f634631","source":{"kind":"arxiv","id":"1407.3361","version":1},"attestation_state":"computed","paper":{"title":"Faster polynomial multiplication over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.NT"],"primary_cat":"cs.CC","authors_text":"David Harvey, Gr\\'egoire Lecerf, Joris van der Hoeven","submitted_at":"2014-07-12T07:57:14Z","abstract_excerpt":"Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated logarithm. This is the first known F\\\"urer-type complexity bound for F_p[X], and improves on the previously best known bound M_p(n) = O(n log n log log n log p)."},"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":"1407.3361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-12T07:57:14Z","cross_cats_sorted":["cs.SC","math.NT"],"title_canon_sha256":"3f0fc4b88299f8e63e4d8abef50ae83d011ed4345970fb91385b03e136e56e54","abstract_canon_sha256":"3dd4c850c220050a515a290aa1d697670af1a4745fa38de1b084499c370468be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:43.180657Z","signature_b64":"iVBEXi5VXrNTqvgbyb3bg0Pa0sl4/hcE8YYYowOyIa0JrBo8h03wmR+R4GnVzl0WMHzFL9G/pOozrk90h+Y1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"276b293194ae5271908de53589887779af49c68904ec4e2e75c1b6827f634631","last_reissued_at":"2026-05-18T02:47:43.179848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:43.179848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster polynomial multiplication over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.NT"],"primary_cat":"cs.CC","authors_text":"David Harvey, Gr\\'egoire Lecerf, Joris van der Hoeven","submitted_at":"2014-07-12T07:57:14Z","abstract_excerpt":"Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated logarithm. This is the first known F\\\"urer-type complexity bound for F_p[X], and improves on the previously best known bound M_p(n) = O(n log n log log n log p)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3361","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":"1407.3361","created_at":"2026-05-18T02:47:43.179972+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3361v1","created_at":"2026-05-18T02:47:43.179972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3361","created_at":"2026-05-18T02:47:43.179972+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5VSSMMUVZJH","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5VSSMMUVZJHDEEN","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5VSSMMU","created_at":"2026-05-18T12:28:25.294606+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/E5VSSMMUVZJHDEEN4U2YTCDXPG","json":"https://pith.science/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG.json","graph_json":"https://pith.science/api/pith-number/E5VSSMMUVZJHDEEN4U2YTCDXPG/graph.json","events_json":"https://pith.science/api/pith-number/E5VSSMMUVZJHDEEN4U2YTCDXPG/events.json","paper":"https://pith.science/paper/E5VSSMMU"},"agent_actions":{"view_html":"https://pith.science/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG","download_json":"https://pith.science/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG.json","view_paper":"https://pith.science/paper/E5VSSMMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3361&json=true","fetch_graph":"https://pith.science/api/pith-number/E5VSSMMUVZJHDEEN4U2YTCDXPG/graph.json","fetch_events":"https://pith.science/api/pith-number/E5VSSMMUVZJHDEEN4U2YTCDXPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG/action/storage_attestation","attest_author":"https://pith.science/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG/action/author_attestation","sign_citation":"https://pith.science/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG/action/citation_signature","submit_replication":"https://pith.science/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG/action/replication_record"}},"created_at":"2026-05-18T02:47:43.179972+00:00","updated_at":"2026-05-18T02:47:43.179972+00:00"}