{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BQC73TMJCXXXQI4DC3P2BKHREV","short_pith_number":"pith:BQC73TMJ","schema_version":"1.0","canonical_sha256":"0c05fdcd8915ef78238316dfa0a8f1255566f50a1d4ac574c72c8c809297603b","source":{"kind":"arxiv","id":"1902.10935","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds for Multiplication via Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Casper Benjamin Freksen, Kasper Green Larsen, Lior Kamma, Peyman Afshani","submitted_at":"2019-02-28T07:35:19Z","abstract_excerpt":"Multiplication is one of the most fundamental computational problems, yet its true complexity remains elusive. The best known upper bound, by F\\\"{u}rer, shows that two $n$-bit numbers can be multiplied via a boolean circuit of size $O(n \\lg n \\cdot 4^{\\lg^*n})$, where $\\lg^*n$ is the very slowly growing iterated logarithm. In this work, we prove that if a central conjecture in the area of network coding is true, then any constant degree boolean circuit for multiplication must have size $\\Omega(n \\lg n)$, thus almost completely settling the complexity of multiplication circuits. We additionally"},"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":"1902.10935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-28T07:35:19Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3a92b0bc15e79d838d93a4c3396cf9e79f51d7be7d7420d84cc5925d0545176f","abstract_canon_sha256":"fd0ddf946d20d5f8d2368a2343615cee8a3d2730329154580bc50c929a49721a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:26.333652Z","signature_b64":"DVtIp6/Yorwl5dA0UWjOIttBE9q+ZT/IJoROvkeavo7H7N8fUGkyYszyv58quRoB9gFEDsXPaINGF/v9qDqFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c05fdcd8915ef78238316dfa0a8f1255566f50a1d4ac574c72c8c809297603b","last_reissued_at":"2026-05-17T23:52:26.333011Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:26.333011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Multiplication via Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Casper Benjamin Freksen, Kasper Green Larsen, Lior Kamma, Peyman Afshani","submitted_at":"2019-02-28T07:35:19Z","abstract_excerpt":"Multiplication is one of the most fundamental computational problems, yet its true complexity remains elusive. The best known upper bound, by F\\\"{u}rer, shows that two $n$-bit numbers can be multiplied via a boolean circuit of size $O(n \\lg n \\cdot 4^{\\lg^*n})$, where $\\lg^*n$ is the very slowly growing iterated logarithm. In this work, we prove that if a central conjecture in the area of network coding is true, then any constant degree boolean circuit for multiplication must have size $\\Omega(n \\lg n)$, thus almost completely settling the complexity of multiplication circuits. We additionally"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10935","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":"1902.10935","created_at":"2026-05-17T23:52:26.333097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10935v1","created_at":"2026-05-17T23:52:26.333097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10935","created_at":"2026-05-17T23:52:26.333097+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQC73TMJCXXX","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQC73TMJCXXXQI4D","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQC73TMJ","created_at":"2026-05-18T12:33:12.712433+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/BQC73TMJCXXXQI4DC3P2BKHREV","json":"https://pith.science/pith/BQC73TMJCXXXQI4DC3P2BKHREV.json","graph_json":"https://pith.science/api/pith-number/BQC73TMJCXXXQI4DC3P2BKHREV/graph.json","events_json":"https://pith.science/api/pith-number/BQC73TMJCXXXQI4DC3P2BKHREV/events.json","paper":"https://pith.science/paper/BQC73TMJ"},"agent_actions":{"view_html":"https://pith.science/pith/BQC73TMJCXXXQI4DC3P2BKHREV","download_json":"https://pith.science/pith/BQC73TMJCXXXQI4DC3P2BKHREV.json","view_paper":"https://pith.science/paper/BQC73TMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10935&json=true","fetch_graph":"https://pith.science/api/pith-number/BQC73TMJCXXXQI4DC3P2BKHREV/graph.json","fetch_events":"https://pith.science/api/pith-number/BQC73TMJCXXXQI4DC3P2BKHREV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQC73TMJCXXXQI4DC3P2BKHREV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQC73TMJCXXXQI4DC3P2BKHREV/action/storage_attestation","attest_author":"https://pith.science/pith/BQC73TMJCXXXQI4DC3P2BKHREV/action/author_attestation","sign_citation":"https://pith.science/pith/BQC73TMJCXXXQI4DC3P2BKHREV/action/citation_signature","submit_replication":"https://pith.science/pith/BQC73TMJCXXXQI4DC3P2BKHREV/action/replication_record"}},"created_at":"2026-05-17T23:52:26.333097+00:00","updated_at":"2026-05-17T23:52:26.333097+00:00"}