{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5ZNZMW2XZN4RPJZTZMDUNFQXEW","short_pith_number":"pith:5ZNZMW2X","schema_version":"1.0","canonical_sha256":"ee5b965b57cb7917a733cb074696172588d2ff3e52d3768a37d7b6b289182972","source":{"kind":"arxiv","id":"1407.6559","version":1},"attestation_state":"computed","paper":{"title":"Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Sach, Markus Jalsenius, Raphael Clifford","submitted_at":"2014-07-24T13:01:17Z","abstract_excerpt":"We give cell-probe bounds for the computation of edit distance, Hamming distance, convolution and longest common subsequence in a stream. In this model, a fixed string of $n$ symbols is given and one $\\delta$-bit symbol arrives at a time in a stream. After each symbol arrives, the distance between the fixed string and a suffix of most recent symbols of the stream is reported. The cell-probe model is perhaps the strongest model of computation for showing data structure lower bounds, subsuming in particular the popular word-RAM model.\n  * We first give an $\\Omega((\\delta \\log n)/(w+\\log\\log n))$"},"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":"1407.6559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T13:01:17Z","cross_cats_sorted":[],"title_canon_sha256":"c68e0fe1077273a00e8c082f8d0dbd5b8dc772f1bf0861bb0c7f998fa6b245e3","abstract_canon_sha256":"eef118207f760df61ddab2c619fb35510644b51d2b98e17370522721a6b6ecf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:38.484309Z","signature_b64":"ZNR+4qlCwgXhvbWteuHFu6XAlV3cfm4ALr56jPnO2oM8uwBB6mvZ5gu71Cj/thbuOUPdGFIwr7CwqwAfdkIuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee5b965b57cb7917a733cb074696172588d2ff3e52d3768a37d7b6b289182972","last_reissued_at":"2026-05-18T02:46:38.483856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:38.483856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Sach, Markus Jalsenius, Raphael Clifford","submitted_at":"2014-07-24T13:01:17Z","abstract_excerpt":"We give cell-probe bounds for the computation of edit distance, Hamming distance, convolution and longest common subsequence in a stream. In this model, a fixed string of $n$ symbols is given and one $\\delta$-bit symbol arrives at a time in a stream. After each symbol arrives, the distance between the fixed string and a suffix of most recent symbols of the stream is reported. The cell-probe model is perhaps the strongest model of computation for showing data structure lower bounds, subsuming in particular the popular word-RAM model.\n  * We first give an $\\Omega((\\delta \\log n)/(w+\\log\\log n))$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6559","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":"1407.6559","created_at":"2026-05-18T02:46:38.483940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6559v1","created_at":"2026-05-18T02:46:38.483940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6559","created_at":"2026-05-18T02:46:38.483940+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZNZMW2XZN4R","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZNZMW2XZN4RPJZT","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZNZMW2X","created_at":"2026-05-18T12:28:16.859392+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/5ZNZMW2XZN4RPJZTZMDUNFQXEW","json":"https://pith.science/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW.json","graph_json":"https://pith.science/api/pith-number/5ZNZMW2XZN4RPJZTZMDUNFQXEW/graph.json","events_json":"https://pith.science/api/pith-number/5ZNZMW2XZN4RPJZTZMDUNFQXEW/events.json","paper":"https://pith.science/paper/5ZNZMW2X"},"agent_actions":{"view_html":"https://pith.science/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW","download_json":"https://pith.science/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW.json","view_paper":"https://pith.science/paper/5ZNZMW2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6559&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZNZMW2XZN4RPJZTZMDUNFQXEW/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZNZMW2XZN4RPJZTZMDUNFQXEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW/action/storage_attestation","attest_author":"https://pith.science/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW/action/author_attestation","sign_citation":"https://pith.science/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW/action/citation_signature","submit_replication":"https://pith.science/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW/action/replication_record"}},"created_at":"2026-05-18T02:46:38.483940+00:00","updated_at":"2026-05-18T02:46:38.483940+00:00"}