{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YQQ6CTM4EHAXIIFLE5CUL6FPQN","short_pith_number":"pith:YQQ6CTM4","schema_version":"1.0","canonical_sha256":"c421e14d9c21c17420ab274545f8af8373bc7e3ecbba256dcfee40cd1638bc15","source":{"kind":"arxiv","id":"1712.03693","version":1},"attestation_state":"computed","paper":{"title":"Faster integer and polynomial multiplication using cyclotomic coefficient rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.NT"],"primary_cat":"cs.SC","authors_text":"David Harvey, Joris van der Hoeven","submitted_at":"2017-12-11T09:37:57Z","abstract_excerpt":"We present an algorithm that computes the product of two n-bit integers in O(n log n (4\\sqrt 2)^{log^* n}) bit operations. Previously, the best known bound was O(n log n 6^{log^* n}). We also prove that for a fixed prime p, polynomials in F_p[X] of degree n may be multiplied in O(n log n 4^{log^* n}) bit operations; the previous best bound was O(n log n 8^{log^* n})."},"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":"1712.03693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-12-11T09:37:57Z","cross_cats_sorted":["cs.DS","math.NT"],"title_canon_sha256":"924043ee5520b9a14c40a411c8d0fe72854899d9cc2273cc291392ba34743150","abstract_canon_sha256":"a1516d1d99bf183955ddf7b0f2a85edfac10f40412154466d7542743cb1e7ab6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:20.355560Z","signature_b64":"D2O+8lYizDxIUUpyHoJBoil0dvT36qhXnRowzgGJNnKSYQanM38erMlExtmsls/FvKEFkU6Msxo7yOGMV7wsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c421e14d9c21c17420ab274545f8af8373bc7e3ecbba256dcfee40cd1638bc15","last_reissued_at":"2026-05-18T00:28:20.354858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:20.354858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster integer and polynomial multiplication using cyclotomic coefficient rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.NT"],"primary_cat":"cs.SC","authors_text":"David Harvey, Joris van der Hoeven","submitted_at":"2017-12-11T09:37:57Z","abstract_excerpt":"We present an algorithm that computes the product of two n-bit integers in O(n log n (4\\sqrt 2)^{log^* n}) bit operations. Previously, the best known bound was O(n log n 6^{log^* n}). We also prove that for a fixed prime p, polynomials in F_p[X] of degree n may be multiplied in O(n log n 4^{log^* n}) bit operations; the previous best bound was O(n log n 8^{log^* n})."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03693","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":"1712.03693","created_at":"2026-05-18T00:28:20.354950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.03693v1","created_at":"2026-05-18T00:28:20.354950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03693","created_at":"2026-05-18T00:28:20.354950+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQQ6CTM4EHAX","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQQ6CTM4EHAXIIFL","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQQ6CTM4","created_at":"2026-05-18T12:31:56.362134+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/YQQ6CTM4EHAXIIFLE5CUL6FPQN","json":"https://pith.science/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN.json","graph_json":"https://pith.science/api/pith-number/YQQ6CTM4EHAXIIFLE5CUL6FPQN/graph.json","events_json":"https://pith.science/api/pith-number/YQQ6CTM4EHAXIIFLE5CUL6FPQN/events.json","paper":"https://pith.science/paper/YQQ6CTM4"},"agent_actions":{"view_html":"https://pith.science/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN","download_json":"https://pith.science/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN.json","view_paper":"https://pith.science/paper/YQQ6CTM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.03693&json=true","fetch_graph":"https://pith.science/api/pith-number/YQQ6CTM4EHAXIIFLE5CUL6FPQN/graph.json","fetch_events":"https://pith.science/api/pith-number/YQQ6CTM4EHAXIIFLE5CUL6FPQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN/action/storage_attestation","attest_author":"https://pith.science/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN/action/author_attestation","sign_citation":"https://pith.science/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN/action/citation_signature","submit_replication":"https://pith.science/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN/action/replication_record"}},"created_at":"2026-05-18T00:28:20.354950+00:00","updated_at":"2026-05-18T00:28:20.354950+00:00"}