{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:OGUWTNNUXPTTPI4GO33FSILNJI","short_pith_number":"pith:OGUWTNNU","canonical_record":{"source":{"id":"0707.3407","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2007-07-23T16:26:24Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"15f53995cf191097dd49d2ae791287555490e20c6dc450fd130b1498741ee4b4","abstract_canon_sha256":"c86501cfb13f4bef8bd079039c4d4a48648d09f9b196277c2eab17acee498cff"},"schema_version":"1.0"},"canonical_sha256":"71a969b5b4bbe737a38676f659216d4a202d690407ddae0ff561bfaab2483bb4","source":{"kind":"arxiv","id":"0707.3407","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.3407","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"arxiv_version","alias_value":"0707.3407v4","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.3407","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"pith_short_12","alias_value":"OGUWTNNUXPTT","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"OGUWTNNUXPTTPI4G","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"OGUWTNNU","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:OGUWTNNUXPTTPI4GO33FSILNJI","target":"record","payload":{"canonical_record":{"source":{"id":"0707.3407","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2007-07-23T16:26:24Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"15f53995cf191097dd49d2ae791287555490e20c6dc450fd130b1498741ee4b4","abstract_canon_sha256":"c86501cfb13f4bef8bd079039c4d4a48648d09f9b196277c2eab17acee498cff"},"schema_version":"1.0"},"canonical_sha256":"71a969b5b4bbe737a38676f659216d4a202d690407ddae0ff561bfaab2483bb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:15.490228Z","signature_b64":"Kd6xMLoHKRqmBuLWJyLt1J+60JVjEUpTvwSzBZHRNUTHTPofRjrGUC3K9ecEG0UUl3/NmCQFoPeuiL7vqQdxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71a969b5b4bbe737a38676f659216d4a202d690407ddae0ff561bfaab2483bb4","last_reissued_at":"2026-05-18T04:09:15.489687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:15.489687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0707.3407","source_version":4,"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:09:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bnMwiTCgXv5L1xPxp8DGHFDuzCpiR8CYy7GiL4aL5gcf/C2xq8+TkIDrrCo2FcLTGwziQns4gKJw4W4/zI4LDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:52:07.779202Z"},"content_sha256":"323c99ddf7874de784224faf636591dc5d4a7581178e51be491a39c8b0bbd2ec","schema_version":"1.0","event_id":"sha256:323c99ddf7874de784224faf636591dc5d4a7581178e51be491a39c8b0bbd2ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:OGUWTNNUXPTTPI4GO33FSILNJI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster subsequence recognition in compressed strings","license":"","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Alexander Tiskin","submitted_at":"2007-07-23T16:26:24Z","abstract_excerpt":"Computation on compressed strings is one of the key approaches to processing massive data sets. We consider local subsequence recognition problems on strings compressed by straight-line programs (SLP), which is closely related to Lempel--Ziv compression. For an SLP-compressed text of length $\\bar m$, and an uncompressed pattern of length $n$, C{\\'e}gielski et al. gave an algorithm for local subsequence recognition running in time $O(\\bar mn^2 \\log n)$. We improve the running time to $O(\\bar mn^{1.5})$. Our algorithm can also be used to compute the longest common subsequence between a compresse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.3407","kind":"arxiv","version":4},"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:09:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpPob+TClpUEkh2KAnPcTTbfZIZ2gFWbzikbXbexpZkE7T0lJyLriey/y+kyNBMfPwg4nStRTSCBSseeHfiMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:52:07.779561Z"},"content_sha256":"1a6c3f8471960408a01f375f681cb0bd23a27affa2fd730f36b30f492b3c654f","schema_version":"1.0","event_id":"sha256:1a6c3f8471960408a01f375f681cb0bd23a27affa2fd730f36b30f492b3c654f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OGUWTNNUXPTTPI4GO33FSILNJI/bundle.json","state_url":"https://pith.science/pith/OGUWTNNUXPTTPI4GO33FSILNJI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OGUWTNNUXPTTPI4GO33FSILNJI/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-07-03T09:52:07Z","links":{"resolver":"https://pith.science/pith/OGUWTNNUXPTTPI4GO33FSILNJI","bundle":"https://pith.science/pith/OGUWTNNUXPTTPI4GO33FSILNJI/bundle.json","state":"https://pith.science/pith/OGUWTNNUXPTTPI4GO33FSILNJI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OGUWTNNUXPTTPI4GO33FSILNJI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:OGUWTNNUXPTTPI4GO33FSILNJI","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":"c86501cfb13f4bef8bd079039c4d4a48648d09f9b196277c2eab17acee498cff","cross_cats_sorted":["cs.CC","cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2007-07-23T16:26:24Z","title_canon_sha256":"15f53995cf191097dd49d2ae791287555490e20c6dc450fd130b1498741ee4b4"},"schema_version":"1.0","source":{"id":"0707.3407","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.3407","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"arxiv_version","alias_value":"0707.3407v4","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.3407","created_at":"2026-05-18T04:09:15Z"},{"alias_kind":"pith_short_12","alias_value":"OGUWTNNUXPTT","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"OGUWTNNUXPTTPI4G","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"OGUWTNNU","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:1a6c3f8471960408a01f375f681cb0bd23a27affa2fd730f36b30f492b3c654f","target":"graph","created_at":"2026-05-18T04:09:15Z","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":"Computation on compressed strings is one of the key approaches to processing massive data sets. We consider local subsequence recognition problems on strings compressed by straight-line programs (SLP), which is closely related to Lempel--Ziv compression. For an SLP-compressed text of length $\\bar m$, and an uncompressed pattern of length $n$, C{\\'e}gielski et al. gave an algorithm for local subsequence recognition running in time $O(\\bar mn^2 \\log n)$. We improve the running time to $O(\\bar mn^{1.5})$. Our algorithm can also be used to compute the longest common subsequence between a compresse","authors_text":"Alexander Tiskin","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2007-07-23T16:26:24Z","title":"Faster subsequence recognition in compressed strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.3407","kind":"arxiv","version":4},"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:323c99ddf7874de784224faf636591dc5d4a7581178e51be491a39c8b0bbd2ec","target":"record","created_at":"2026-05-18T04:09:15Z","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":"c86501cfb13f4bef8bd079039c4d4a48648d09f9b196277c2eab17acee498cff","cross_cats_sorted":["cs.CC","cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2007-07-23T16:26:24Z","title_canon_sha256":"15f53995cf191097dd49d2ae791287555490e20c6dc450fd130b1498741ee4b4"},"schema_version":"1.0","source":{"id":"0707.3407","kind":"arxiv","version":4}},"canonical_sha256":"71a969b5b4bbe737a38676f659216d4a202d690407ddae0ff561bfaab2483bb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71a969b5b4bbe737a38676f659216d4a202d690407ddae0ff561bfaab2483bb4","first_computed_at":"2026-05-18T04:09:15.489687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:15.489687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kd6xMLoHKRqmBuLWJyLt1J+60JVjEUpTvwSzBZHRNUTHTPofRjrGUC3K9ecEG0UUl3/NmCQFoPeuiL7vqQdxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:15.490228Z","signed_message":"canonical_sha256_bytes"},"source_id":"0707.3407","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:323c99ddf7874de784224faf636591dc5d4a7581178e51be491a39c8b0bbd2ec","sha256:1a6c3f8471960408a01f375f681cb0bd23a27affa2fd730f36b30f492b3c654f"],"state_sha256":"7ccf0444b00ffc3b6803241546ccf85af4e353e19da8e2d888b40f03debcc1e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lVP4EUu1i+XMXvmHlXAGQJx4scm/ZmakEL5Ddo4hVKhrLvpVjHEc6cs9VzT2In9+T80SD4wZ8ICrXHZDkzPoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T09:52:07.781483Z","bundle_sha256":"9d22a9df21323882f4a4a4e20f70940e3a732ae1cf914c37559a64cc89aa3c1c"}}