{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:E5VSSMMUVZJHDEEN4U2YTCDXPG","short_pith_number":"pith:E5VSSMMU","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"},"canonical_sha256":"276b293194ae5271908de53589887779af49c68904ec4e2e75c1b6827f634631","source":{"kind":"arxiv","id":"1407.3361","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3361","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3361v1","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3361","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"E5VSSMMUVZJH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E5VSSMMUVZJHDEEN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E5VSSMMU","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:E5VSSMMUVZJHDEEN4U2YTCDXPG","target":"record","payload":{"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"},"canonical_sha256":"276b293194ae5271908de53589887779af49c68904ec4e2e75c1b6827f634631","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"},"source_kind":"arxiv","source_id":"1407.3361","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qEBWf0X5WiWhoSG7S9POO6e1ANlMTvS4qysguD8cnzAU01GkHtyZO5wNrOfXR4xvu4n0RHSeTJS9QlguOALGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:16:06.555521Z"},"content_sha256":"4ff25359d116113d5ce97ea6b7cf09d0a844a706760562da40be6b5819773127","schema_version":"1.0","event_id":"sha256:4ff25359d116113d5ce97ea6b7cf09d0a844a706760562da40be6b5819773127"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:E5VSSMMUVZJHDEEN4U2YTCDXPG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9HWLK+hs83t0HdRS3Qa8CXhrYEK3PYi7xFaXSJ/eqb6WEt0qjjC5s8sIjFiVaKhAab69C9IGDcZYBAHryzY4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:16:06.556198Z"},"content_sha256":"9488c91551d284d12d9b5b3e152fc57683c088483c2dfa459b830eb82a46860a","schema_version":"1.0","event_id":"sha256:9488c91551d284d12d9b5b3e152fc57683c088483c2dfa459b830eb82a46860a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG/bundle.json","state_url":"https://pith.science/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T20:16:06Z","links":{"resolver":"https://pith.science/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG","bundle":"https://pith.science/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG/bundle.json","state":"https://pith.science/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5VSSMMUVZJHDEEN4U2YTCDXPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:E5VSSMMUVZJHDEEN4U2YTCDXPG","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":"3dd4c850c220050a515a290aa1d697670af1a4745fa38de1b084499c370468be","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:57:14Z","title_canon_sha256":"3f0fc4b88299f8e63e4d8abef50ae83d011ed4345970fb91385b03e136e56e54"},"schema_version":"1.0","source":{"id":"1407.3361","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3361","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3361v1","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3361","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"E5VSSMMUVZJH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E5VSSMMUVZJHDEEN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E5VSSMMU","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:9488c91551d284d12d9b5b3e152fc57683c088483c2dfa459b830eb82a46860a","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":"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).","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:57:14Z","title":"Faster polynomial multiplication over finite fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3361","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:4ff25359d116113d5ce97ea6b7cf09d0a844a706760562da40be6b5819773127","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":"3dd4c850c220050a515a290aa1d697670af1a4745fa38de1b084499c370468be","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:57:14Z","title_canon_sha256":"3f0fc4b88299f8e63e4d8abef50ae83d011ed4345970fb91385b03e136e56e54"},"schema_version":"1.0","source":{"id":"1407.3361","kind":"arxiv","version":1}},"canonical_sha256":"276b293194ae5271908de53589887779af49c68904ec4e2e75c1b6827f634631","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"276b293194ae5271908de53589887779af49c68904ec4e2e75c1b6827f634631","first_computed_at":"2026-05-18T02:47:43.179848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:43.179848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iVBEXi5VXrNTqvgbyb3bg0Pa0sl4/hcE8YYYowOyIa0JrBo8h03wmR+R4GnVzl0WMHzFL9G/pOozrk90h+Y1Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:43.180657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3361","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ff25359d116113d5ce97ea6b7cf09d0a844a706760562da40be6b5819773127","sha256:9488c91551d284d12d9b5b3e152fc57683c088483c2dfa459b830eb82a46860a"],"state_sha256":"6ed53b1c7dc897f1c216d4d2be9615a167ebf3301267d12f42eaaf7ba5610779"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3af6lM+zLJJV37XuC0sz51IJ6ckij6AyIPdrMrmF4iNi1njAsXmUSiyfN9JFv0JT8/lUPUTkjl79ieOher8dBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:16:06.559957Z","bundle_sha256":"621d94d85d07831dbec64183fd8645ed2418e65bb63628c043070fc3680deccd"}}