{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5ZNZMW2XZN4RPJZTZMDUNFQXEW","short_pith_number":"pith:5ZNZMW2X","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"},"canonical_sha256":"ee5b965b57cb7917a733cb074696172588d2ff3e52d3768a37d7b6b289182972","source":{"kind":"arxiv","id":"1407.6559","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6559","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6559v1","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6559","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"pith_short_12","alias_value":"5ZNZMW2XZN4R","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5ZNZMW2XZN4RPJZT","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5ZNZMW2X","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5ZNZMW2XZN4RPJZTZMDUNFQXEW","target":"record","payload":{"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"},"canonical_sha256":"ee5b965b57cb7917a733cb074696172588d2ff3e52d3768a37d7b6b289182972","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"},"source_kind":"arxiv","source_id":"1407.6559","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:46:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mg8OhR3GDMCjjwMOiSVDNDHxh19NnrYspPL4/sHa3lWaeJr4QPfKAc1tL8oPbahVAmMg6v9EvPt4zbRAw7PbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:09:31.058799Z"},"content_sha256":"5ca21bb5d845deadba2a8aec7ad0dc779317bc272b90f6b8708cc3e9258edb8c","schema_version":"1.0","event_id":"sha256:5ca21bb5d845deadba2a8aec7ad0dc779317bc272b90f6b8708cc3e9258edb8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5ZNZMW2XZN4RPJZTZMDUNFQXEW","target":"graph","payload":{"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"},"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:46:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5PhwdA0yHVEukKMpaTcJ6YDRUZz/A1QNRQxlQUFttgZtMD9/fDBb8nRNZ9WxPpIB1NyDmDAWSRehVnbPax+eDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:09:31.059158Z"},"content_sha256":"77e56704af097ea6f6d071ff258629651d595ef0df1031a8a07d00da7217a270","schema_version":"1.0","event_id":"sha256:77e56704af097ea6f6d071ff258629651d595ef0df1031a8a07d00da7217a270"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW/bundle.json","state_url":"https://pith.science/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW/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-28T04:09:31Z","links":{"resolver":"https://pith.science/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW","bundle":"https://pith.science/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW/bundle.json","state":"https://pith.science/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZNZMW2XZN4RPJZTZMDUNFQXEW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5ZNZMW2XZN4RPJZTZMDUNFQXEW","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":"eef118207f760df61ddab2c619fb35510644b51d2b98e17370522721a6b6ecf2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T13:01:17Z","title_canon_sha256":"c68e0fe1077273a00e8c082f8d0dbd5b8dc772f1bf0861bb0c7f998fa6b245e3"},"schema_version":"1.0","source":{"id":"1407.6559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6559","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6559v1","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6559","created_at":"2026-05-18T02:46:38Z"},{"alias_kind":"pith_short_12","alias_value":"5ZNZMW2XZN4R","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5ZNZMW2XZN4RPJZT","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5ZNZMW2X","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:77e56704af097ea6f6d071ff258629651d595ef0df1031a8a07d00da7217a270","target":"graph","created_at":"2026-05-18T02:46:38Z","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 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))$","authors_text":"Benjamin Sach, Markus Jalsenius, Raphael Clifford","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T13:01:17Z","title":"Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6559","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:5ca21bb5d845deadba2a8aec7ad0dc779317bc272b90f6b8708cc3e9258edb8c","target":"record","created_at":"2026-05-18T02:46:38Z","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":"eef118207f760df61ddab2c619fb35510644b51d2b98e17370522721a6b6ecf2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T13:01:17Z","title_canon_sha256":"c68e0fe1077273a00e8c082f8d0dbd5b8dc772f1bf0861bb0c7f998fa6b245e3"},"schema_version":"1.0","source":{"id":"1407.6559","kind":"arxiv","version":1}},"canonical_sha256":"ee5b965b57cb7917a733cb074696172588d2ff3e52d3768a37d7b6b289182972","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee5b965b57cb7917a733cb074696172588d2ff3e52d3768a37d7b6b289182972","first_computed_at":"2026-05-18T02:46:38.483856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:38.483856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZNR+4qlCwgXhvbWteuHFu6XAlV3cfm4ALr56jPnO2oM8uwBB6mvZ5gu71Cj/thbuOUPdGFIwr7CwqwAfdkIuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:38.484309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ca21bb5d845deadba2a8aec7ad0dc779317bc272b90f6b8708cc3e9258edb8c","sha256:77e56704af097ea6f6d071ff258629651d595ef0df1031a8a07d00da7217a270"],"state_sha256":"24a3c6cae7e591aac2520af1908e045a0b1d2c138542a03672b464ca69b2a0f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZWzEaPeT5hUiQYVKWFpydqrrrC+GI33u/aOfUY2In1esyLLrDgNVdJeA7W0Vlo+IIe30K+ZAcagd9PeNtUgDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:09:31.061167Z","bundle_sha256":"037ef188a72d0b97d629b33b2351d6860f1c7436da5ffd6f462f620a06448962"}}