{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YQQ6CTM4EHAXIIFLE5CUL6FPQN","short_pith_number":"pith:YQQ6CTM4","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"},"canonical_sha256":"c421e14d9c21c17420ab274545f8af8373bc7e3ecbba256dcfee40cd1638bc15","source":{"kind":"arxiv","id":"1712.03693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03693","created_at":"2026-05-18T00:28:20Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03693v1","created_at":"2026-05-18T00:28:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03693","created_at":"2026-05-18T00:28:20Z"},{"alias_kind":"pith_short_12","alias_value":"YQQ6CTM4EHAX","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YQQ6CTM4EHAXIIFL","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YQQ6CTM4","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YQQ6CTM4EHAXIIFLE5CUL6FPQN","target":"record","payload":{"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"},"canonical_sha256":"c421e14d9c21c17420ab274545f8af8373bc7e3ecbba256dcfee40cd1638bc15","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"},"source_kind":"arxiv","source_id":"1712.03693","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-18T00:28:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/HPOdznrBatmfI/1s7Sgj1j71AYLP9PFurCR+xmJ46WY017motKh7BfRqPjX/EyPBBp7taeyEQbgdmm/DaWoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:13:31.954555Z"},"content_sha256":"7bab868cd014395485777b8fbb467704aa63c881a08fff1ad8c94bec96d79f82","schema_version":"1.0","event_id":"sha256:7bab868cd014395485777b8fbb467704aa63c881a08fff1ad8c94bec96d79f82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YQQ6CTM4EHAXIIFLE5CUL6FPQN","target":"graph","payload":{"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"},"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-18T00:28:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a/zinfoP0O3HFj5jXwv7ct7wqD7RU/4gi968FzzoZ/NexF1DEaYUfsJ2HjmneXRvtgBpqFFD70uwWeU4zslqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:13:31.955310Z"},"content_sha256":"7744f3505c3afd2c8b96ea33fb10ea462ff980cf40c1fb183da3a7a5c2d79988","schema_version":"1.0","event_id":"sha256:7744f3505c3afd2c8b96ea33fb10ea462ff980cf40c1fb183da3a7a5c2d79988"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN/bundle.json","state_url":"https://pith.science/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN/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:13:31Z","links":{"resolver":"https://pith.science/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN","bundle":"https://pith.science/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN/bundle.json","state":"https://pith.science/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQQ6CTM4EHAXIIFLE5CUL6FPQN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YQQ6CTM4EHAXIIFLE5CUL6FPQN","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":"a1516d1d99bf183955ddf7b0f2a85edfac10f40412154466d7542743cb1e7ab6","cross_cats_sorted":["cs.DS","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-12-11T09:37:57Z","title_canon_sha256":"924043ee5520b9a14c40a411c8d0fe72854899d9cc2273cc291392ba34743150"},"schema_version":"1.0","source":{"id":"1712.03693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03693","created_at":"2026-05-18T00:28:20Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03693v1","created_at":"2026-05-18T00:28:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03693","created_at":"2026-05-18T00:28:20Z"},{"alias_kind":"pith_short_12","alias_value":"YQQ6CTM4EHAX","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YQQ6CTM4EHAXIIFL","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YQQ6CTM4","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:7744f3505c3afd2c8b96ea33fb10ea462ff980cf40c1fb183da3a7a5c2d79988","target":"graph","created_at":"2026-05-18T00:28:20Z","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 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}).","authors_text":"David Harvey, Joris van der Hoeven","cross_cats":["cs.DS","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-12-11T09:37:57Z","title":"Faster integer and polynomial multiplication using cyclotomic coefficient rings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03693","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:7bab868cd014395485777b8fbb467704aa63c881a08fff1ad8c94bec96d79f82","target":"record","created_at":"2026-05-18T00:28:20Z","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":"a1516d1d99bf183955ddf7b0f2a85edfac10f40412154466d7542743cb1e7ab6","cross_cats_sorted":["cs.DS","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-12-11T09:37:57Z","title_canon_sha256":"924043ee5520b9a14c40a411c8d0fe72854899d9cc2273cc291392ba34743150"},"schema_version":"1.0","source":{"id":"1712.03693","kind":"arxiv","version":1}},"canonical_sha256":"c421e14d9c21c17420ab274545f8af8373bc7e3ecbba256dcfee40cd1638bc15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c421e14d9c21c17420ab274545f8af8373bc7e3ecbba256dcfee40cd1638bc15","first_computed_at":"2026-05-18T00:28:20.354858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:20.354858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D2O+8lYizDxIUUpyHoJBoil0dvT36qhXnRowzgGJNnKSYQanM38erMlExtmsls/FvKEFkU6Msxo7yOGMV7wsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:20.355560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bab868cd014395485777b8fbb467704aa63c881a08fff1ad8c94bec96d79f82","sha256:7744f3505c3afd2c8b96ea33fb10ea462ff980cf40c1fb183da3a7a5c2d79988"],"state_sha256":"8500aec17b6db2523816c53c3e22420b0c9456177a930106ba78c3311312bbe5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VAsEWM5yiPtqnkRp3Pypktvlmgda932mhgEf8QwcbbUz7f/LpOYz7108JkDMHa/B59k2GM59iAT5Qt2xILmZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:13:31.959537Z","bundle_sha256":"6b20bd6c5bd3d395720af9129900b029c44b4d66c3c8ca376db6e393a37d33aa"}}