{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4DQJ2NTJSEFAGVALOQDMSZA3HF","short_pith_number":"pith:4DQJ2NTJ","canonical_record":{"source":{"id":"1110.2893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-13T11:13:48Z","cross_cats_sorted":[],"title_canon_sha256":"045663c7c0cfd9e622d7090044ba3d4aaa83c4d39955162b592a2e6e59ce5c03","abstract_canon_sha256":"f7228e6c76135497088aee33274cf72ea54dee2c4c60d6df6fb784ece8be5c27"},"schema_version":"1.0"},"canonical_sha256":"e0e09d3669910a03540b7406c9641b394ef68d1aafd49c2543f6a1963b8e09fc","source":{"kind":"arxiv","id":"1110.2893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2893","created_at":"2026-05-18T04:11:06Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2893v1","created_at":"2026-05-18T04:11:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2893","created_at":"2026-05-18T04:11:06Z"},{"alias_kind":"pith_short_12","alias_value":"4DQJ2NTJSEFA","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4DQJ2NTJSEFAGVAL","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4DQJ2NTJ","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4DQJ2NTJSEFAGVALOQDMSZA3HF","target":"record","payload":{"canonical_record":{"source":{"id":"1110.2893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-13T11:13:48Z","cross_cats_sorted":[],"title_canon_sha256":"045663c7c0cfd9e622d7090044ba3d4aaa83c4d39955162b592a2e6e59ce5c03","abstract_canon_sha256":"f7228e6c76135497088aee33274cf72ea54dee2c4c60d6df6fb784ece8be5c27"},"schema_version":"1.0"},"canonical_sha256":"e0e09d3669910a03540b7406c9641b394ef68d1aafd49c2543f6a1963b8e09fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:06.723063Z","signature_b64":"VfZKpN5e8DL+FeVS/NP+fUeGhEq7+Lua3qc5yYK65GD9XeL3AOGpmrbF6JOgI+rF/8Yoc5HuvQj3/XkSbzlRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0e09d3669910a03540b7406c9641b394ef68d1aafd49c2543f6a1963b8e09fc","last_reissued_at":"2026-05-18T04:11:06.722294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:06.722294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.2893","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:11:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XwLo0bWhhhBgOeVWDI/khevdFZ0hiRkzbO27+XdofZu8Wzu4b5A0iAyPZnlLsx8Us+VKebcdjtJPXC9c+bbrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:29:30.490549Z"},"content_sha256":"f8f3b59e675a577af3f1da2f96f9f358b99746ea26174d3069046f4b9e5bcf59","schema_version":"1.0","event_id":"sha256:f8f3b59e675a577af3f1da2f96f9f358b99746ea26174d3069046f4b9e5bcf59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4DQJ2NTJSEFAGVALOQDMSZA3HF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"String Matching with Variable Length Gaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Kofoed Wind, Hjalte Wedel Vildh{\\o}j, Inge Li Goertz, Philip Bille","submitted_at":"2011-10-13T11:13:48Z","abstract_excerpt":"We consider string matching with variable length gaps. Given a string $T$ and a pattern $P$ consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending positions of substrings in $T$ that match $P$. This problem is a basic primitive in computational biology applications. Let $m$ and $n$ be the lengths of $P$ and $T$, respectively, and let $k$ be the number of strings in $P$. We present a new algorithm achieving time $O(n\\log k + m +\\alpha)$ and space $O(m + A)$, where $A$ is the sum of the lower bounds of the len"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2893","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:11:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UTo0OCLU21DzAPCmhxQMklQQcqjoH/UwOKkg/Ix3WpvFXpMebBYIjceSFPBbQTgqLfxpGZ87u8g5qE687SEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:29:30.490895Z"},"content_sha256":"581cd1f5a58f1d12239cb142b4bd2397e1a866fa6b9b901cc6e320947dcf1cde","schema_version":"1.0","event_id":"sha256:581cd1f5a58f1d12239cb142b4bd2397e1a866fa6b9b901cc6e320947dcf1cde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF/bundle.json","state_url":"https://pith.science/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF/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-06-03T11:29:30Z","links":{"resolver":"https://pith.science/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF","bundle":"https://pith.science/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF/bundle.json","state":"https://pith.science/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DQJ2NTJSEFAGVALOQDMSZA3HF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4DQJ2NTJSEFAGVALOQDMSZA3HF","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":"f7228e6c76135497088aee33274cf72ea54dee2c4c60d6df6fb784ece8be5c27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-13T11:13:48Z","title_canon_sha256":"045663c7c0cfd9e622d7090044ba3d4aaa83c4d39955162b592a2e6e59ce5c03"},"schema_version":"1.0","source":{"id":"1110.2893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2893","created_at":"2026-05-18T04:11:06Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2893v1","created_at":"2026-05-18T04:11:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2893","created_at":"2026-05-18T04:11:06Z"},{"alias_kind":"pith_short_12","alias_value":"4DQJ2NTJSEFA","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4DQJ2NTJSEFAGVAL","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4DQJ2NTJ","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:581cd1f5a58f1d12239cb142b4bd2397e1a866fa6b9b901cc6e320947dcf1cde","target":"graph","created_at":"2026-05-18T04:11:06Z","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 consider string matching with variable length gaps. Given a string $T$ and a pattern $P$ consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending positions of substrings in $T$ that match $P$. This problem is a basic primitive in computational biology applications. Let $m$ and $n$ be the lengths of $P$ and $T$, respectively, and let $k$ be the number of strings in $P$. We present a new algorithm achieving time $O(n\\log k + m +\\alpha)$ and space $O(m + A)$, where $A$ is the sum of the lower bounds of the len","authors_text":"David Kofoed Wind, Hjalte Wedel Vildh{\\o}j, Inge Li Goertz, Philip Bille","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-13T11:13:48Z","title":"String Matching with Variable Length Gaps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2893","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:f8f3b59e675a577af3f1da2f96f9f358b99746ea26174d3069046f4b9e5bcf59","target":"record","created_at":"2026-05-18T04:11:06Z","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":"f7228e6c76135497088aee33274cf72ea54dee2c4c60d6df6fb784ece8be5c27","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-13T11:13:48Z","title_canon_sha256":"045663c7c0cfd9e622d7090044ba3d4aaa83c4d39955162b592a2e6e59ce5c03"},"schema_version":"1.0","source":{"id":"1110.2893","kind":"arxiv","version":1}},"canonical_sha256":"e0e09d3669910a03540b7406c9641b394ef68d1aafd49c2543f6a1963b8e09fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0e09d3669910a03540b7406c9641b394ef68d1aafd49c2543f6a1963b8e09fc","first_computed_at":"2026-05-18T04:11:06.722294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:06.722294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VfZKpN5e8DL+FeVS/NP+fUeGhEq7+Lua3qc5yYK65GD9XeL3AOGpmrbF6JOgI+rF/8Yoc5HuvQj3/XkSbzlRBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:06.723063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8f3b59e675a577af3f1da2f96f9f358b99746ea26174d3069046f4b9e5bcf59","sha256:581cd1f5a58f1d12239cb142b4bd2397e1a866fa6b9b901cc6e320947dcf1cde"],"state_sha256":"3b40460fe09f5e46f467afee1ca3ab123bc66ee0a6b3ebc97670741d10c8a761"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8WCMAjbM8xUe5Oo9YrWCF2lZ4k5W0NNupGXdK9DqjETsdDB3jJmQDDn2U8xaWOukEfQDOOsD8kXOwNBHFSKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:29:30.492815Z","bundle_sha256":"f8a66f634907d2af2437b23b82af36ff82d3a98e6b8b4fd2911d9ddd82d0b0c5"}}