{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WDUMYRT4PDV4RRJK5MISJP7D3M","short_pith_number":"pith:WDUMYRT4","schema_version":"1.0","canonical_sha256":"b0e8cc467c78ebc8c52aeb1124bfe3db2817d5b9b9e84322d9a1c4144aa26b61","source":{"kind":"arxiv","id":"1101.0768","version":4},"attestation_state":"computed","paper":{"title":"Tight Cell-Probe Bounds for Online Integer Multiplication and Convolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Markus Jalsenius, Raphael Clifford","submitted_at":"2011-01-04T17:08:23Z","abstract_excerpt":"We show tight bounds for both online integer multiplication and convolution in the cell-probe model with word size w. For the multiplication problem, one pair of digits, each from one of two n digit numbers that are to be multiplied, is given as input at step i. The online algorithm outputs a single new digit from the product of the numbers before step i+1. We give a Theta((d/w)*log n) bound on average per output digit for this problem where 2^d is the maximum value of a digit. In the convolution problem, we are given a fixed vector V of length n and we consider a stream in which numbers arriv"},"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":"1101.0768","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-04T17:08:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"334d2b6b662100c123124a9adb2b53f6d27bb0b60a8fd839730c1a4a2aeb35c2","abstract_canon_sha256":"54cdef1a512b01f736819cec569b6651ad3288645fd7589319af5824615f5438"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:38.137492Z","signature_b64":"7Qatp9Kv8DIvb05WhZvI3uilR6+MgNEPzdCwwjz0j723e2Krd4Ve6XWtSJ8/JEWms+ZHECwGI/D8oG7NOnoBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0e8cc467c78ebc8c52aeb1124bfe3db2817d5b9b9e84322d9a1c4144aa26b61","last_reissued_at":"2026-05-18T04:01:38.136655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:38.136655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Cell-Probe Bounds for Online Integer Multiplication and Convolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Markus Jalsenius, Raphael Clifford","submitted_at":"2011-01-04T17:08:23Z","abstract_excerpt":"We show tight bounds for both online integer multiplication and convolution in the cell-probe model with word size w. For the multiplication problem, one pair of digits, each from one of two n digit numbers that are to be multiplied, is given as input at step i. The online algorithm outputs a single new digit from the product of the numbers before step i+1. We give a Theta((d/w)*log n) bound on average per output digit for this problem where 2^d is the maximum value of a digit. In the convolution problem, we are given a fixed vector V of length n and we consider a stream in which numbers arriv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0768","kind":"arxiv","version":4},"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":"1101.0768","created_at":"2026-05-18T04:01:38.136791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.0768v4","created_at":"2026-05-18T04:01:38.136791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0768","created_at":"2026-05-18T04:01:38.136791+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDUMYRT4PDV4","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDUMYRT4PDV4RRJK","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDUMYRT4","created_at":"2026-05-18T12:26:44.992195+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/WDUMYRT4PDV4RRJK5MISJP7D3M","json":"https://pith.science/pith/WDUMYRT4PDV4RRJK5MISJP7D3M.json","graph_json":"https://pith.science/api/pith-number/WDUMYRT4PDV4RRJK5MISJP7D3M/graph.json","events_json":"https://pith.science/api/pith-number/WDUMYRT4PDV4RRJK5MISJP7D3M/events.json","paper":"https://pith.science/paper/WDUMYRT4"},"agent_actions":{"view_html":"https://pith.science/pith/WDUMYRT4PDV4RRJK5MISJP7D3M","download_json":"https://pith.science/pith/WDUMYRT4PDV4RRJK5MISJP7D3M.json","view_paper":"https://pith.science/paper/WDUMYRT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.0768&json=true","fetch_graph":"https://pith.science/api/pith-number/WDUMYRT4PDV4RRJK5MISJP7D3M/graph.json","fetch_events":"https://pith.science/api/pith-number/WDUMYRT4PDV4RRJK5MISJP7D3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDUMYRT4PDV4RRJK5MISJP7D3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDUMYRT4PDV4RRJK5MISJP7D3M/action/storage_attestation","attest_author":"https://pith.science/pith/WDUMYRT4PDV4RRJK5MISJP7D3M/action/author_attestation","sign_citation":"https://pith.science/pith/WDUMYRT4PDV4RRJK5MISJP7D3M/action/citation_signature","submit_replication":"https://pith.science/pith/WDUMYRT4PDV4RRJK5MISJP7D3M/action/replication_record"}},"created_at":"2026-05-18T04:01:38.136791+00:00","updated_at":"2026-05-18T04:01:38.136791+00:00"}