{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BQC73TMJCXXXQI4DC3P2BKHREV","short_pith_number":"pith:BQC73TMJ","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"},"canonical_sha256":"0c05fdcd8915ef78238316dfa0a8f1255566f50a1d4ac574c72c8c809297603b","source":{"kind":"arxiv","id":"1902.10935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10935","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10935v1","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10935","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"BQC73TMJCXXX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BQC73TMJCXXXQI4D","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BQC73TMJ","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BQC73TMJCXXXQI4DC3P2BKHREV","target":"record","payload":{"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"},"canonical_sha256":"0c05fdcd8915ef78238316dfa0a8f1255566f50a1d4ac574c72c8c809297603b","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"},"source_kind":"arxiv","source_id":"1902.10935","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-17T23:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sXxl/zoFj9ZCnL26rgpX0urTYWFWbcmAjuraIQYAEnoJhhy+NAvHK3taBUDJCUT0m0hShWJMSAa1qWu46ZKMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:51:56.515554Z"},"content_sha256":"59709128383ac1c9874b0abcc35577a2dd153c68981cedde076b5e07d5931a3f","schema_version":"1.0","event_id":"sha256:59709128383ac1c9874b0abcc35577a2dd153c68981cedde076b5e07d5931a3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BQC73TMJCXXXQI4DC3P2BKHREV","target":"graph","payload":{"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"},"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-17T23:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFhEwtlz8zmzqxKQYFEgugXSXgy/OzuT7GdUrj9uBRrbOJs4PorzJjviFqVn6zK174ZgfndJYP1XsWID24EBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:51:56.515918Z"},"content_sha256":"f4e41977e123b2ba656006783f6c6075dfbba15e0982635e425bba07dc0b3bcd","schema_version":"1.0","event_id":"sha256:f4e41977e123b2ba656006783f6c6075dfbba15e0982635e425bba07dc0b3bcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQC73TMJCXXXQI4DC3P2BKHREV/bundle.json","state_url":"https://pith.science/pith/BQC73TMJCXXXQI4DC3P2BKHREV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQC73TMJCXXXQI4DC3P2BKHREV/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-11T10:51:56Z","links":{"resolver":"https://pith.science/pith/BQC73TMJCXXXQI4DC3P2BKHREV","bundle":"https://pith.science/pith/BQC73TMJCXXXQI4DC3P2BKHREV/bundle.json","state":"https://pith.science/pith/BQC73TMJCXXXQI4DC3P2BKHREV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQC73TMJCXXXQI4DC3P2BKHREV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BQC73TMJCXXXQI4DC3P2BKHREV","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":"fd0ddf946d20d5f8d2368a2343615cee8a3d2730329154580bc50c929a49721a","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-28T07:35:19Z","title_canon_sha256":"3a92b0bc15e79d838d93a4c3396cf9e79f51d7be7d7420d84cc5925d0545176f"},"schema_version":"1.0","source":{"id":"1902.10935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10935","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10935v1","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10935","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"BQC73TMJCXXX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BQC73TMJCXXXQI4D","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BQC73TMJ","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:f4e41977e123b2ba656006783f6c6075dfbba15e0982635e425bba07dc0b3bcd","target":"graph","created_at":"2026-05-17T23:52:26Z","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":"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","authors_text":"Casper Benjamin Freksen, Kasper Green Larsen, Lior Kamma, Peyman Afshani","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-28T07:35:19Z","title":"Lower Bounds for Multiplication via Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10935","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:59709128383ac1c9874b0abcc35577a2dd153c68981cedde076b5e07d5931a3f","target":"record","created_at":"2026-05-17T23:52:26Z","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":"fd0ddf946d20d5f8d2368a2343615cee8a3d2730329154580bc50c929a49721a","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-28T07:35:19Z","title_canon_sha256":"3a92b0bc15e79d838d93a4c3396cf9e79f51d7be7d7420d84cc5925d0545176f"},"schema_version":"1.0","source":{"id":"1902.10935","kind":"arxiv","version":1}},"canonical_sha256":"0c05fdcd8915ef78238316dfa0a8f1255566f50a1d4ac574c72c8c809297603b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c05fdcd8915ef78238316dfa0a8f1255566f50a1d4ac574c72c8c809297603b","first_computed_at":"2026-05-17T23:52:26.333011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:26.333011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DVtIp6/Yorwl5dA0UWjOIttBE9q+ZT/IJoROvkeavo7H7N8fUGkyYszyv58quRoB9gFEDsXPaINGF/v9qDqFAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:26.333652Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59709128383ac1c9874b0abcc35577a2dd153c68981cedde076b5e07d5931a3f","sha256:f4e41977e123b2ba656006783f6c6075dfbba15e0982635e425bba07dc0b3bcd"],"state_sha256":"6e9da33625119313290aceaca2402660995a82a5b3dc1dcdd8a4eef4694368c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FOo9aIhDVfTSD7hb1ydzwVpu1FzAZvOavpAmBMSgxwbxzpAbvklYUVJBCZvcZxkRdRYheQrYnESyWCV08CBDAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:51:56.518167Z","bundle_sha256":"335cdd1be4b3af2d43d9df882853a5dedd4c4eed1ee78f81ff48084df74931e9"}}