{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XPYKFWPAIRXGVWV5FVY7RKFR6P","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":"4bf9a8f62c459205ebed1b8f05a20a16bc89f4b17beae20564084baceb9521f8","cross_cats_sorted":["cs.SC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-12T07:54:52Z","title_canon_sha256":"618a7547ed51ea9cf56a9357e20f8c482df49a5bfcc2e97f6231d83546ff9ec0"},"schema_version":"1.0","source":{"id":"1407.3360","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3360","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3360v1","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3360","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"XPYKFWPAIRXG","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XPYKFWPAIRXGVWV5","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XPYKFWPA","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:4d630a1fd06f73d2625b3c37d51bb4ecbe614fc75b8fe49a96e6e63770171f80","target":"graph","created_at":"2026-05-18T02:47:43Z","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 give a new proof of F\\\"urer's bound for the cost of multiplying n-bit integers in the bit complexity model. Unlike F\\\"urer, our method does not require constructing special coefficient rings with \"fast\" roots of unity. Moreover, we prove the more explicit bound O(n log n K^(log^* n))$ with K = 8. We show that an optimised variant of F\\\"urer's algorithm achieves only K = 16, suggesting that the new algorithm is faster than F\\\"urer's by a factor of 2^(log^* n). Assuming standard conjectures about the distribution of Mersenne primes, we give yet another algorithm that achieves K = 4.","authors_text":"David Harvey, Gr\\'egoire Lecerf, Joris van der Hoeven","cross_cats":["cs.SC","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-12T07:54:52Z","title":"Even faster integer multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3360","kind":"arxiv","version":1},"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:7afc1acc37645b20544d2fcb3987c2a1d0a3b443c0fdfff8aedba7f62fe5ab42","target":"record","created_at":"2026-05-18T02:47:43Z","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":"4bf9a8f62c459205ebed1b8f05a20a16bc89f4b17beae20564084baceb9521f8","cross_cats_sorted":["cs.SC","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-12T07:54:52Z","title_canon_sha256":"618a7547ed51ea9cf56a9357e20f8c482df49a5bfcc2e97f6231d83546ff9ec0"},"schema_version":"1.0","source":{"id":"1407.3360","kind":"arxiv","version":1}},"canonical_sha256":"bbf0a2d9e0446e6adabd2d71f8a8b1f3c1bfb48caa07e0e6ec18275eac3a3b2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbf0a2d9e0446e6adabd2d71f8a8b1f3c1bfb48caa07e0e6ec18275eac3a3b2f","first_computed_at":"2026-05-18T02:47:43.189762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:43.189762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5jVen9TFhhCcJP3GZ4nlcLl5tGaiQgkujidr29NYGsSfneAw+gw/OpMk54YoCrOWPUIMU72Mk2K4scYsqSnlBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:43.190552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3360","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7afc1acc37645b20544d2fcb3987c2a1d0a3b443c0fdfff8aedba7f62fe5ab42","sha256:4d630a1fd06f73d2625b3c37d51bb4ecbe614fc75b8fe49a96e6e63770171f80"],"state_sha256":"ddc1cf08f5e5e7258f3b8b270d7eedd8a760def53a7b6bf716043633a7f1886b"}