{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5M4UOZSBIRAL4YPIGFS34QCKSE","short_pith_number":"pith:5M4UOZSB","schema_version":"1.0","canonical_sha256":"eb394766414440be61e83165be404a91071a7a44ef1234a7e34043090e840d2e","source":{"kind":"arxiv","id":"1504.00834","version":1},"attestation_state":"computed","paper":{"title":"The complexity of computation in bit streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Benjamin Sach, Markus Jalsenius, Raphael Clifford","submitted_at":"2015-04-03T13:10:58Z","abstract_excerpt":"We revisit the complexity of online computation in the cell probe model. We consider a class of problems where we are first given a fixed pattern or vector $F$ of $n$ symbols and then one symbol arrives at a time in a stream. After each symbol has arrived we must output some function of $F$ and the $n$-length suffix of the arriving stream. Cell probe bounds of $\\Omega(\\delta\\lg{n}/w)$ have previously been shown for both convolution and Hamming distance in this setting, where $\\delta$ is the size of a symbol in bits and $w\\in\\Omega(\\lg{n})$ is the cell size in bits. However, when $\\delta$ is a "},"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":"1504.00834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-03T13:10:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f04a1486e99d4423c6730aefbf494aa3aa99d5655bf9d1264260526400ea04a1","abstract_canon_sha256":"f2cb81272879d5adff8cd885254c32e1f27951517bef5671fdd395542e74b12e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:36.931721Z","signature_b64":"ohPnItOBe2xoXaBlAwjK2UeeZvijb7xm9ObTWCnfQ04+Y/YB3Os3LeH+ynR5M/eN3FXGIo0AkGbIWsNE2OelAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb394766414440be61e83165be404a91071a7a44ef1234a7e34043090e840d2e","last_reissued_at":"2026-05-18T02:19:36.931153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:36.931153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of computation in bit streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Benjamin Sach, Markus Jalsenius, Raphael Clifford","submitted_at":"2015-04-03T13:10:58Z","abstract_excerpt":"We revisit the complexity of online computation in the cell probe model. We consider a class of problems where we are first given a fixed pattern or vector $F$ of $n$ symbols and then one symbol arrives at a time in a stream. After each symbol has arrived we must output some function of $F$ and the $n$-length suffix of the arriving stream. Cell probe bounds of $\\Omega(\\delta\\lg{n}/w)$ have previously been shown for both convolution and Hamming distance in this setting, where $\\delta$ is the size of a symbol in bits and $w\\in\\Omega(\\lg{n})$ is the cell size in bits. However, when $\\delta$ is a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00834","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":"1504.00834","created_at":"2026-05-18T02:19:36.931232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00834v1","created_at":"2026-05-18T02:19:36.931232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00834","created_at":"2026-05-18T02:19:36.931232+00:00"},{"alias_kind":"pith_short_12","alias_value":"5M4UOZSBIRAL","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5M4UOZSBIRAL4YPI","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5M4UOZSB","created_at":"2026-05-18T12:29:05.191682+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/5M4UOZSBIRAL4YPIGFS34QCKSE","json":"https://pith.science/pith/5M4UOZSBIRAL4YPIGFS34QCKSE.json","graph_json":"https://pith.science/api/pith-number/5M4UOZSBIRAL4YPIGFS34QCKSE/graph.json","events_json":"https://pith.science/api/pith-number/5M4UOZSBIRAL4YPIGFS34QCKSE/events.json","paper":"https://pith.science/paper/5M4UOZSB"},"agent_actions":{"view_html":"https://pith.science/pith/5M4UOZSBIRAL4YPIGFS34QCKSE","download_json":"https://pith.science/pith/5M4UOZSBIRAL4YPIGFS34QCKSE.json","view_paper":"https://pith.science/paper/5M4UOZSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00834&json=true","fetch_graph":"https://pith.science/api/pith-number/5M4UOZSBIRAL4YPIGFS34QCKSE/graph.json","fetch_events":"https://pith.science/api/pith-number/5M4UOZSBIRAL4YPIGFS34QCKSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5M4UOZSBIRAL4YPIGFS34QCKSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5M4UOZSBIRAL4YPIGFS34QCKSE/action/storage_attestation","attest_author":"https://pith.science/pith/5M4UOZSBIRAL4YPIGFS34QCKSE/action/author_attestation","sign_citation":"https://pith.science/pith/5M4UOZSBIRAL4YPIGFS34QCKSE/action/citation_signature","submit_replication":"https://pith.science/pith/5M4UOZSBIRAL4YPIGFS34QCKSE/action/replication_record"}},"created_at":"2026-05-18T02:19:36.931232+00:00","updated_at":"2026-05-18T02:19:36.931232+00:00"}