{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RDK4BPVRNCVYDWRRPF3AL7DEOP","short_pith_number":"pith:RDK4BPVR","schema_version":"1.0","canonical_sha256":"88d5c0beb168ab81da31797605fc6473d65987dbfdeb8764c5ad6acbcd044074","source":{"kind":"arxiv","id":"1412.6935","version":1},"attestation_state":"computed","paper":{"title":"Time Bounds for Streaming Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Benjamin Sach, Markus Jalsenius, Raphael Clifford","submitted_at":"2014-12-22T11:35:53Z","abstract_excerpt":"We give tight cell-probe bounds for the time to compute convolution, multiplication and Hamming distance in a stream. The cell probe model is a particularly strong computational model and subsumes, for example, the popular word RAM model.\n  We first consider online convolution where the task is to output the inner product between a fixed $n$-dimensional vector and a vector of the $n$ most recent values from a stream. One symbol of the stream arrives at a time and the each output must be computed before the next symbols arrives.\n  Next we show bounds for online multiplication where the stream c"},"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":"1412.6935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-22T11:35:53Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7034fe6dd650e3814bff3461278c5ad6065d6e4c05c5c74eeaedf6600b0a6897","abstract_canon_sha256":"5c3cccd0bf7ac96de99ef2fc5254acc4ef3bda2837fba39bf929b4a37dcce545"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:45.951826Z","signature_b64":"/6AZlqgde3k2IiSVY9RBRHCPqe/3BMJ0XNB+DuY1Tjly31fLJbXmXAxCrY1eL1fGP+q+OBWYCij2a4ZcgvNLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88d5c0beb168ab81da31797605fc6473d65987dbfdeb8764c5ad6acbcd044074","last_reissued_at":"2026-05-18T02:30:45.951379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:45.951379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time Bounds for Streaming Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Benjamin Sach, Markus Jalsenius, Raphael Clifford","submitted_at":"2014-12-22T11:35:53Z","abstract_excerpt":"We give tight cell-probe bounds for the time to compute convolution, multiplication and Hamming distance in a stream. The cell probe model is a particularly strong computational model and subsumes, for example, the popular word RAM model.\n  We first consider online convolution where the task is to output the inner product between a fixed $n$-dimensional vector and a vector of the $n$ most recent values from a stream. One symbol of the stream arrives at a time and the each output must be computed before the next symbols arrives.\n  Next we show bounds for online multiplication where the stream c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6935","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":"1412.6935","created_at":"2026-05-18T02:30:45.951443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6935v1","created_at":"2026-05-18T02:30:45.951443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6935","created_at":"2026-05-18T02:30:45.951443+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDK4BPVRNCVY","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDK4BPVRNCVYDWRR","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDK4BPVR","created_at":"2026-05-18T12:28:46.137349+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/RDK4BPVRNCVYDWRRPF3AL7DEOP","json":"https://pith.science/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP.json","graph_json":"https://pith.science/api/pith-number/RDK4BPVRNCVYDWRRPF3AL7DEOP/graph.json","events_json":"https://pith.science/api/pith-number/RDK4BPVRNCVYDWRRPF3AL7DEOP/events.json","paper":"https://pith.science/paper/RDK4BPVR"},"agent_actions":{"view_html":"https://pith.science/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP","download_json":"https://pith.science/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP.json","view_paper":"https://pith.science/paper/RDK4BPVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6935&json=true","fetch_graph":"https://pith.science/api/pith-number/RDK4BPVRNCVYDWRRPF3AL7DEOP/graph.json","fetch_events":"https://pith.science/api/pith-number/RDK4BPVRNCVYDWRRPF3AL7DEOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP/action/storage_attestation","attest_author":"https://pith.science/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP/action/author_attestation","sign_citation":"https://pith.science/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP/action/citation_signature","submit_replication":"https://pith.science/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP/action/replication_record"}},"created_at":"2026-05-18T02:30:45.951443+00:00","updated_at":"2026-05-18T02:30:45.951443+00:00"}