{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5M4UOZSBIRAL4YPIGFS34QCKSE","short_pith_number":"pith:5M4UOZSB","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"},"canonical_sha256":"eb394766414440be61e83165be404a91071a7a44ef1234a7e34043090e840d2e","source":{"kind":"arxiv","id":"1504.00834","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00834","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00834v1","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00834","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"5M4UOZSBIRAL","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5M4UOZSBIRAL4YPI","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5M4UOZSB","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5M4UOZSBIRAL4YPIGFS34QCKSE","target":"record","payload":{"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"},"canonical_sha256":"eb394766414440be61e83165be404a91071a7a44ef1234a7e34043090e840d2e","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"},"source_kind":"arxiv","source_id":"1504.00834","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:19:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cCD79ja9FWuxpNTxAQIAyxFGOwvRTDPIBB7woJ8m4ynKWSPs3m7HcslyhZ0Jg2NeNjJahb4iTUEJChT48mz8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T22:17:09.124733Z"},"content_sha256":"33669452a04a75c901e61a5ab775466e4586a5ebbe5e28b450415e99de2ff42b","schema_version":"1.0","event_id":"sha256:33669452a04a75c901e61a5ab775466e4586a5ebbe5e28b450415e99de2ff42b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5M4UOZSBIRAL4YPIGFS34QCKSE","target":"graph","payload":{"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"},"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:19:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LYSFuZ5fNQDD2lIPNVFbrHPOdFGm5hbV8lHJrNLuDIBzICFL1KR7TRoDkeAS6u6iS1rQ/A4jc0X1aSH4DPVLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T22:17:09.125336Z"},"content_sha256":"7ec211386d4e7e976e6019a3e4f19d3ba7f6394d5d47c4420f9b5941e4995611","schema_version":"1.0","event_id":"sha256:7ec211386d4e7e976e6019a3e4f19d3ba7f6394d5d47c4420f9b5941e4995611"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5M4UOZSBIRAL4YPIGFS34QCKSE/bundle.json","state_url":"https://pith.science/pith/5M4UOZSBIRAL4YPIGFS34QCKSE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5M4UOZSBIRAL4YPIGFS34QCKSE/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-24T22:17:09Z","links":{"resolver":"https://pith.science/pith/5M4UOZSBIRAL4YPIGFS34QCKSE","bundle":"https://pith.science/pith/5M4UOZSBIRAL4YPIGFS34QCKSE/bundle.json","state":"https://pith.science/pith/5M4UOZSBIRAL4YPIGFS34QCKSE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5M4UOZSBIRAL4YPIGFS34QCKSE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5M4UOZSBIRAL4YPIGFS34QCKSE","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":"f2cb81272879d5adff8cd885254c32e1f27951517bef5671fdd395542e74b12e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-03T13:10:58Z","title_canon_sha256":"f04a1486e99d4423c6730aefbf494aa3aa99d5655bf9d1264260526400ea04a1"},"schema_version":"1.0","source":{"id":"1504.00834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00834","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00834v1","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00834","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"5M4UOZSBIRAL","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5M4UOZSBIRAL4YPI","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5M4UOZSB","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:7ec211386d4e7e976e6019a3e4f19d3ba7f6394d5d47c4420f9b5941e4995611","target":"graph","created_at":"2026-05-18T02:19:36Z","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 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 ","authors_text":"Benjamin Sach, Markus Jalsenius, Raphael Clifford","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-03T13:10:58Z","title":"The complexity of computation in bit streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00834","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:33669452a04a75c901e61a5ab775466e4586a5ebbe5e28b450415e99de2ff42b","target":"record","created_at":"2026-05-18T02:19:36Z","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":"f2cb81272879d5adff8cd885254c32e1f27951517bef5671fdd395542e74b12e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-03T13:10:58Z","title_canon_sha256":"f04a1486e99d4423c6730aefbf494aa3aa99d5655bf9d1264260526400ea04a1"},"schema_version":"1.0","source":{"id":"1504.00834","kind":"arxiv","version":1}},"canonical_sha256":"eb394766414440be61e83165be404a91071a7a44ef1234a7e34043090e840d2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb394766414440be61e83165be404a91071a7a44ef1234a7e34043090e840d2e","first_computed_at":"2026-05-18T02:19:36.931153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:36.931153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ohPnItOBe2xoXaBlAwjK2UeeZvijb7xm9ObTWCnfQ04+Y/YB3Os3LeH+ynR5M/eN3FXGIo0AkGbIWsNE2OelAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:36.931721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33669452a04a75c901e61a5ab775466e4586a5ebbe5e28b450415e99de2ff42b","sha256:7ec211386d4e7e976e6019a3e4f19d3ba7f6394d5d47c4420f9b5941e4995611"],"state_sha256":"83b0661685c63c003b1b03342e65bfd072d2b9a22748b19884872a9ba49bafc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X2zdF7oympD0Lds8pjVQnq90r75FbLNH8W32Ns1hM9sYdQJXzl609fgZqwvypDEQCWh2yG1QimtHUlbsNqztAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T22:17:09.128707Z","bundle_sha256":"7164577219b08d1b7370ae10efbd2273c792bd154e0bc23d82f9308bfc5e02ef"}}