{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M3BV323A25KRXLU44CSWGJUMBB","short_pith_number":"pith:M3BV323A","schema_version":"1.0","canonical_sha256":"66c35deb60d7551bae9ce0a563268c08783acaffafc8dfc405afc04fe8a66912","source":{"kind":"arxiv","id":"1802.07932","version":1},"attestation_state":"computed","paper":{"title":"Faster integer multiplication using short lattice vectors","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":"2018-02-22T08:01:59Z","abstract_excerpt":"We prove that $n$-bit integers may be multiplied in $O(n \\log n \\, 4^{\\log^* n})$ bit operations. This complexity bound had been achieved previously by several authors, assuming various unproved number-theoretic hypotheses. Our proof is unconditional, and depends in an essential way on Minkowski's theorem concerning lattice vectors in symmetric convex sets."},"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":"1802.07932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-22T08:01:59Z","cross_cats_sorted":["cs.DS","math.NT"],"title_canon_sha256":"3546d7595ce62aee13d9bb963304dee47aad0762ddcbc8f79b5a14adf575c14a","abstract_canon_sha256":"e22f3cf3e77217dd98495062b81a52145254914f1783240f20646b33c2afeba5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:11.607403Z","signature_b64":"y1B0RyA3sdFKDExkTQ18GUdl83psnN0BJpO4nwI1t9OxUkESJ4EzjXfGAGvuxyrCfqr1pRCKN94m2OiwcTWTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66c35deb60d7551bae9ce0a563268c08783acaffafc8dfc405afc04fe8a66912","last_reissued_at":"2026-05-17T23:54:11.606760Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:11.606760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster integer multiplication using short lattice vectors","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":"2018-02-22T08:01:59Z","abstract_excerpt":"We prove that $n$-bit integers may be multiplied in $O(n \\log n \\, 4^{\\log^* n})$ bit operations. This complexity bound had been achieved previously by several authors, assuming various unproved number-theoretic hypotheses. Our proof is unconditional, and depends in an essential way on Minkowski's theorem concerning lattice vectors in symmetric convex sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07932","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":"1802.07932","created_at":"2026-05-17T23:54:11.606863+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07932v1","created_at":"2026-05-17T23:54:11.606863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07932","created_at":"2026-05-17T23:54:11.606863+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3BV323A25KR","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3BV323A25KRXLU4","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3BV323A","created_at":"2026-05-18T12:32:37.024351+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/M3BV323A25KRXLU44CSWGJUMBB","json":"https://pith.science/pith/M3BV323A25KRXLU44CSWGJUMBB.json","graph_json":"https://pith.science/api/pith-number/M3BV323A25KRXLU44CSWGJUMBB/graph.json","events_json":"https://pith.science/api/pith-number/M3BV323A25KRXLU44CSWGJUMBB/events.json","paper":"https://pith.science/paper/M3BV323A"},"agent_actions":{"view_html":"https://pith.science/pith/M3BV323A25KRXLU44CSWGJUMBB","download_json":"https://pith.science/pith/M3BV323A25KRXLU44CSWGJUMBB.json","view_paper":"https://pith.science/paper/M3BV323A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07932&json=true","fetch_graph":"https://pith.science/api/pith-number/M3BV323A25KRXLU44CSWGJUMBB/graph.json","fetch_events":"https://pith.science/api/pith-number/M3BV323A25KRXLU44CSWGJUMBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3BV323A25KRXLU44CSWGJUMBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3BV323A25KRXLU44CSWGJUMBB/action/storage_attestation","attest_author":"https://pith.science/pith/M3BV323A25KRXLU44CSWGJUMBB/action/author_attestation","sign_citation":"https://pith.science/pith/M3BV323A25KRXLU44CSWGJUMBB/action/citation_signature","submit_replication":"https://pith.science/pith/M3BV323A25KRXLU44CSWGJUMBB/action/replication_record"}},"created_at":"2026-05-17T23:54:11.606863+00:00","updated_at":"2026-05-17T23:54:11.606863+00:00"}