{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RDK4BPVRNCVYDWRRPF3AL7DEOP","short_pith_number":"pith:RDK4BPVR","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"},"canonical_sha256":"88d5c0beb168ab81da31797605fc6473d65987dbfdeb8764c5ad6acbcd044074","source":{"kind":"arxiv","id":"1412.6935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6935","created_at":"2026-05-18T02:30:45Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6935v1","created_at":"2026-05-18T02:30:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6935","created_at":"2026-05-18T02:30:45Z"},{"alias_kind":"pith_short_12","alias_value":"RDK4BPVRNCVY","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RDK4BPVRNCVYDWRR","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RDK4BPVR","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RDK4BPVRNCVYDWRRPF3AL7DEOP","target":"record","payload":{"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"},"canonical_sha256":"88d5c0beb168ab81da31797605fc6473d65987dbfdeb8764c5ad6acbcd044074","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"},"source_kind":"arxiv","source_id":"1412.6935","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-18T02:30:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qjrYB2/eKDlLtHS/rjAjelcDqQcNLxpRGusO484KXu00mGVfdo5Tfv5uhMe9K8STJ+55pKX7TrziddoynTkRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:14:27.841021Z"},"content_sha256":"2f7623cc68d832c5c944232893b38cb63f62ac84c0346fffdedec94d2046540a","schema_version":"1.0","event_id":"sha256:2f7623cc68d832c5c944232893b38cb63f62ac84c0346fffdedec94d2046540a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RDK4BPVRNCVYDWRRPF3AL7DEOP","target":"graph","payload":{"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"},"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-18T02:30:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGfK9RnBvQRMrbZK0HXrFH1f8z95cVp7TtwOk6yjZZzv3nqiDJriUE5m45xUHt/HDyIkob7Po7uQcG11Gu+/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:14:27.841719Z"},"content_sha256":"21ab0d5980dd84fbb6a75b3cd5329a2f347ac3752f043847f5eb3aeb74bbc4fb","schema_version":"1.0","event_id":"sha256:21ab0d5980dd84fbb6a75b3cd5329a2f347ac3752f043847f5eb3aeb74bbc4fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP/bundle.json","state_url":"https://pith.science/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP/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-05-25T23:14:27Z","links":{"resolver":"https://pith.science/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP","bundle":"https://pith.science/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP/bundle.json","state":"https://pith.science/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDK4BPVRNCVYDWRRPF3AL7DEOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RDK4BPVRNCVYDWRRPF3AL7DEOP","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":"5c3cccd0bf7ac96de99ef2fc5254acc4ef3bda2837fba39bf929b4a37dcce545","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-22T11:35:53Z","title_canon_sha256":"7034fe6dd650e3814bff3461278c5ad6065d6e4c05c5c74eeaedf6600b0a6897"},"schema_version":"1.0","source":{"id":"1412.6935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6935","created_at":"2026-05-18T02:30:45Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6935v1","created_at":"2026-05-18T02:30:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6935","created_at":"2026-05-18T02:30:45Z"},{"alias_kind":"pith_short_12","alias_value":"RDK4BPVRNCVY","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RDK4BPVRNCVYDWRR","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RDK4BPVR","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:21ab0d5980dd84fbb6a75b3cd5329a2f347ac3752f043847f5eb3aeb74bbc4fb","target":"graph","created_at":"2026-05-18T02:30:45Z","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":"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","authors_text":"Benjamin Sach, Markus Jalsenius, Raphael Clifford","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-22T11:35:53Z","title":"Time Bounds for Streaming Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6935","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:2f7623cc68d832c5c944232893b38cb63f62ac84c0346fffdedec94d2046540a","target":"record","created_at":"2026-05-18T02:30:45Z","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":"5c3cccd0bf7ac96de99ef2fc5254acc4ef3bda2837fba39bf929b4a37dcce545","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-22T11:35:53Z","title_canon_sha256":"7034fe6dd650e3814bff3461278c5ad6065d6e4c05c5c74eeaedf6600b0a6897"},"schema_version":"1.0","source":{"id":"1412.6935","kind":"arxiv","version":1}},"canonical_sha256":"88d5c0beb168ab81da31797605fc6473d65987dbfdeb8764c5ad6acbcd044074","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88d5c0beb168ab81da31797605fc6473d65987dbfdeb8764c5ad6acbcd044074","first_computed_at":"2026-05-18T02:30:45.951379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:45.951379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/6AZlqgde3k2IiSVY9RBRHCPqe/3BMJ0XNB+DuY1Tjly31fLJbXmXAxCrY1eL1fGP+q+OBWYCij2a4ZcgvNLDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:45.951826Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f7623cc68d832c5c944232893b38cb63f62ac84c0346fffdedec94d2046540a","sha256:21ab0d5980dd84fbb6a75b3cd5329a2f347ac3752f043847f5eb3aeb74bbc4fb"],"state_sha256":"763904a8826b674f031f0a69fe65d3bc93e27897df5c9e687678a04ad49507d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7Xb4G66V0gFJB8Ttdp/jWRiRiMSbX9n/ZFrbR5VSNSSfPGg9bdmwCohkMhEREM28S2C8xm6IANhiUARL7PaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:14:27.845530Z","bundle_sha256":"03717a0ccdcb49b312c5f737d16274de5559ef7a948f4e053be71fe79d25a3ca"}}