{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LVFMF2U7NSLO2SCEDLH2TAKTSB","short_pith_number":"pith:LVFMF2U7","canonical_record":{"source":{"id":"1106.4412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-22T10:39:48Z","cross_cats_sorted":[],"title_canon_sha256":"35f4386534fe82f2c841bd8f1e077058205bc71fb263fa1c7555183f2d0f52be","abstract_canon_sha256":"2abb1211b425d29abd78a10aca77983bf3841e18757522918a181b36ccdd2cdc"},"schema_version":"1.0"},"canonical_sha256":"5d4ac2ea9f6c96ed48441acfa981539044a028a9a663a8bc053a2f5b3c74d709","source":{"kind":"arxiv","id":"1106.4412","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4412","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4412v1","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4412","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"LVFMF2U7NSLO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LVFMF2U7NSLO2SCE","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LVFMF2U7","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LVFMF2U7NSLO2SCEDLH2TAKTSB","target":"record","payload":{"canonical_record":{"source":{"id":"1106.4412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-22T10:39:48Z","cross_cats_sorted":[],"title_canon_sha256":"35f4386534fe82f2c841bd8f1e077058205bc71fb263fa1c7555183f2d0f52be","abstract_canon_sha256":"2abb1211b425d29abd78a10aca77983bf3841e18757522918a181b36ccdd2cdc"},"schema_version":"1.0"},"canonical_sha256":"5d4ac2ea9f6c96ed48441acfa981539044a028a9a663a8bc053a2f5b3c74d709","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:33.024334Z","signature_b64":"nQQXCFgKk8Tn0BWDSVOLZRzQP423JGf3mEzeOtOgCRTJWmCG6TpbaA3k6H9c1SkhAYPNVbYJp5FAD+fI0mWOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d4ac2ea9f6c96ed48441acfa981539044a028a9a663a8bc053a2f5b3c74d709","last_reissued_at":"2026-05-18T04:19:33.023946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:33.023946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.4412","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-18T04:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p3MuJQpgwmqv0SIR1sb9DuxcRZPQTQqITds4S9oMArh4JJ9QnzDPWD7VkOThBx1Zd7mhFqaExDsTDEga/Cw8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T00:17:04.923684Z"},"content_sha256":"cc76fc18c51048189273ba223d15c32dabae486b27dbe030b8ad5a0bbf51ac52","schema_version":"1.0","event_id":"sha256:cc76fc18c51048189273ba223d15c32dabae486b27dbe030b8ad5a0bbf51ac52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LVFMF2U7NSLO2SCEDLH2TAKTSB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space Lower Bounds for Online Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Sach, Ely Porat, Markus Jalsenius, Raphael Clifford","submitted_at":"2011-06-22T10:39:48Z","abstract_excerpt":"We present space lower bounds for online pattern matching under a number of different distance measures. Given a pattern of length m and a text that arrives one character at a time, the online pattern matching problem is to report the distance between the pattern and a sliding window of the text as soon as the new character arrives. We require that the correct answer is given at each position with constant probability. We give Omega(m) bit space lower bounds for L_1, L_2, L_\\infty, Hamming, edit and swap distances as well as for any algorithm that computes the cross-correlation/convolution. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4412","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-18T04:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbJUwefYW7GTQ5vOjHb4MP21pSpM91aYQuMJ349KRk7iczx9ovlVluphr/CIeB/mZgsh+wZz5kU+9XFCLFPWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T00:17:04.924163Z"},"content_sha256":"b95fa413a08a76901e3d13b3dc809a46e8f7642f51fdc864b793670d01e797a5","schema_version":"1.0","event_id":"sha256:b95fa413a08a76901e3d13b3dc809a46e8f7642f51fdc864b793670d01e797a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LVFMF2U7NSLO2SCEDLH2TAKTSB/bundle.json","state_url":"https://pith.science/pith/LVFMF2U7NSLO2SCEDLH2TAKTSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LVFMF2U7NSLO2SCEDLH2TAKTSB/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-25T00:17:04Z","links":{"resolver":"https://pith.science/pith/LVFMF2U7NSLO2SCEDLH2TAKTSB","bundle":"https://pith.science/pith/LVFMF2U7NSLO2SCEDLH2TAKTSB/bundle.json","state":"https://pith.science/pith/LVFMF2U7NSLO2SCEDLH2TAKTSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LVFMF2U7NSLO2SCEDLH2TAKTSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LVFMF2U7NSLO2SCEDLH2TAKTSB","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":"2abb1211b425d29abd78a10aca77983bf3841e18757522918a181b36ccdd2cdc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-22T10:39:48Z","title_canon_sha256":"35f4386534fe82f2c841bd8f1e077058205bc71fb263fa1c7555183f2d0f52be"},"schema_version":"1.0","source":{"id":"1106.4412","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4412","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4412v1","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4412","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"LVFMF2U7NSLO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LVFMF2U7NSLO2SCE","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LVFMF2U7","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:b95fa413a08a76901e3d13b3dc809a46e8f7642f51fdc864b793670d01e797a5","target":"graph","created_at":"2026-05-18T04:19:33Z","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 present space lower bounds for online pattern matching under a number of different distance measures. Given a pattern of length m and a text that arrives one character at a time, the online pattern matching problem is to report the distance between the pattern and a sliding window of the text as soon as the new character arrives. We require that the correct answer is given at each position with constant probability. We give Omega(m) bit space lower bounds for L_1, L_2, L_\\infty, Hamming, edit and swap distances as well as for any algorithm that computes the cross-correlation/convolution. We","authors_text":"Benjamin Sach, Ely Porat, Markus Jalsenius, Raphael Clifford","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-22T10:39:48Z","title":"Space Lower Bounds for Online Pattern Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4412","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:cc76fc18c51048189273ba223d15c32dabae486b27dbe030b8ad5a0bbf51ac52","target":"record","created_at":"2026-05-18T04:19:33Z","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":"2abb1211b425d29abd78a10aca77983bf3841e18757522918a181b36ccdd2cdc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-22T10:39:48Z","title_canon_sha256":"35f4386534fe82f2c841bd8f1e077058205bc71fb263fa1c7555183f2d0f52be"},"schema_version":"1.0","source":{"id":"1106.4412","kind":"arxiv","version":1}},"canonical_sha256":"5d4ac2ea9f6c96ed48441acfa981539044a028a9a663a8bc053a2f5b3c74d709","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d4ac2ea9f6c96ed48441acfa981539044a028a9a663a8bc053a2f5b3c74d709","first_computed_at":"2026-05-18T04:19:33.023946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:33.023946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nQQXCFgKk8Tn0BWDSVOLZRzQP423JGf3mEzeOtOgCRTJWmCG6TpbaA3k6H9c1SkhAYPNVbYJp5FAD+fI0mWOCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:33.024334Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.4412","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc76fc18c51048189273ba223d15c32dabae486b27dbe030b8ad5a0bbf51ac52","sha256:b95fa413a08a76901e3d13b3dc809a46e8f7642f51fdc864b793670d01e797a5"],"state_sha256":"597f8004b1778e5fdcd8db6097c3b8b6592f2dd1b32a7051045fc4a70e0bce4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4TkwXj+alOJihqy/Y4zhb6N3Baqqv8ejfYIKN6S3kjA+XyHj1QWi9VxkAYftSp7p3aX8H6TZJS+jqna0rMGQCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T00:17:04.927876Z","bundle_sha256":"2c7382890a406dd267e67e0695ff4fff1956a19ec456efe3e9df2732d9f56a48"}}