{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:IJ34LVFGNYAW7I77FRHNI3FMDK","short_pith_number":"pith:IJ34LVFG","canonical_record":{"source":{"id":"0811.3490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-21T08:52:59Z","cross_cats_sorted":[],"title_canon_sha256":"498bdd508206fbc6945ea14192f8c43d624995ccb04ac6dec47f4fb3f9dc285b","abstract_canon_sha256":"e20b07bb5cd3f56906229b6c7f04d6981430c86b4d62f16087ae4f996c1faf31"},"schema_version":"1.0"},"canonical_sha256":"4277c5d4a66e016fa3ff2c4ed46cac1a823a82ff139bcbe67922cd9a72267131","source":{"kind":"arxiv","id":"0811.3490","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.3490","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"0811.3490v2","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.3490","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"IJ34LVFGNYAW","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"IJ34LVFGNYAW7I77","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"IJ34LVFG","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:IJ34LVFGNYAW7I77FRHNI3FMDK","target":"record","payload":{"canonical_record":{"source":{"id":"0811.3490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-21T08:52:59Z","cross_cats_sorted":[],"title_canon_sha256":"498bdd508206fbc6945ea14192f8c43d624995ccb04ac6dec47f4fb3f9dc285b","abstract_canon_sha256":"e20b07bb5cd3f56906229b6c7f04d6981430c86b4d62f16087ae4f996c1faf31"},"schema_version":"1.0"},"canonical_sha256":"4277c5d4a66e016fa3ff2c4ed46cac1a823a82ff139bcbe67922cd9a72267131","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:33.479827Z","signature_b64":"wPvgK6ntnGLLoVl3LI0r0dvr5n4Fv6NencIGNGbNKBYrDn3p0+oQhU/V6ODhpwd5hB4+YowqqdVAYV2dFcBKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4277c5d4a66e016fa3ff2c4ed46cac1a823a82ff139bcbe67922cd9a72267131","last_reissued_at":"2026-05-18T04:26:33.479113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:33.479113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0811.3490","source_version":2,"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:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BRpG5AN6BAgr46PSan/rFwBNJCtSRfoEc0tQX/Ok2beR9Tm+3/2DteWOmvP0gGpI5UshjYDaPPY2wgvhNU7eBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:10:19.243940Z"},"content_sha256":"da3ebdd2d5d8cb449ac232cb8d4ba46d68a3f1b9ca17ab1e3c8316b45ab08998","schema_version":"1.0","event_id":"sha256:da3ebdd2d5d8cb449ac232cb8d4ba46d68a3f1b9ca17ab1e3c8316b45ab08998"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:IJ34LVFGNYAW7I77FRHNI3FMDK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Approximate String Matching for Short Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Philip Bille","submitted_at":"2008-11-21T08:52:59Z","abstract_excerpt":"We study the classical approximate string matching problem, that is, given strings $P$ and $Q$ and an error threshold $k$, find all ending positions of substrings of $Q$ whose edit distance to $P$ is at most $k$. Let $P$ and $Q$ have lengths $m$ and $n$, respectively. On a standard unit-cost word RAM with word size $w \\geq \\log n$ we present an algorithm using time $$ O(nk \\cdot \\min(\\frac{\\log^2 m}{\\log n},\\frac{\\log^2 m\\log w}{w}) + n) $$ When $P$ is short, namely, $m = 2^{o(\\sqrt{\\log n})}$ or $m = 2^{o(\\sqrt{w/\\log w})}$ this improves the previously best known time bounds for the problem. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.3490","kind":"arxiv","version":2},"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:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6j41O8Rb08n2D1GZRiBqeEgBj5jNQieksnyXldTtUWM4/z8b7Iq6ByP2CqRw3+6GvdbWKQj0KmfbOx/AfmMGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:10:19.244331Z"},"content_sha256":"9b99f68ae9adf9fae319457bb3cce29d4dd64ca1488fcc9440c5f1d77eeeec3a","schema_version":"1.0","event_id":"sha256:9b99f68ae9adf9fae319457bb3cce29d4dd64ca1488fcc9440c5f1d77eeeec3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJ34LVFGNYAW7I77FRHNI3FMDK/bundle.json","state_url":"https://pith.science/pith/IJ34LVFGNYAW7I77FRHNI3FMDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJ34LVFGNYAW7I77FRHNI3FMDK/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-11T09:10:19Z","links":{"resolver":"https://pith.science/pith/IJ34LVFGNYAW7I77FRHNI3FMDK","bundle":"https://pith.science/pith/IJ34LVFGNYAW7I77FRHNI3FMDK/bundle.json","state":"https://pith.science/pith/IJ34LVFGNYAW7I77FRHNI3FMDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJ34LVFGNYAW7I77FRHNI3FMDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:IJ34LVFGNYAW7I77FRHNI3FMDK","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":"e20b07bb5cd3f56906229b6c7f04d6981430c86b4d62f16087ae4f996c1faf31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-21T08:52:59Z","title_canon_sha256":"498bdd508206fbc6945ea14192f8c43d624995ccb04ac6dec47f4fb3f9dc285b"},"schema_version":"1.0","source":{"id":"0811.3490","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.3490","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"0811.3490v2","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.3490","created_at":"2026-05-18T04:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"IJ34LVFGNYAW","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"IJ34LVFGNYAW7I77","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"IJ34LVFG","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:9b99f68ae9adf9fae319457bb3cce29d4dd64ca1488fcc9440c5f1d77eeeec3a","target":"graph","created_at":"2026-05-18T04:26: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 study the classical approximate string matching problem, that is, given strings $P$ and $Q$ and an error threshold $k$, find all ending positions of substrings of $Q$ whose edit distance to $P$ is at most $k$. Let $P$ and $Q$ have lengths $m$ and $n$, respectively. On a standard unit-cost word RAM with word size $w \\geq \\log n$ we present an algorithm using time $$ O(nk \\cdot \\min(\\frac{\\log^2 m}{\\log n},\\frac{\\log^2 m\\log w}{w}) + n) $$ When $P$ is short, namely, $m = 2^{o(\\sqrt{\\log n})}$ or $m = 2^{o(\\sqrt{w/\\log w})}$ this improves the previously best known time bounds for the problem. ","authors_text":"Philip Bille","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-21T08:52:59Z","title":"Faster Approximate String Matching for Short Patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.3490","kind":"arxiv","version":2},"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:da3ebdd2d5d8cb449ac232cb8d4ba46d68a3f1b9ca17ab1e3c8316b45ab08998","target":"record","created_at":"2026-05-18T04:26: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":"e20b07bb5cd3f56906229b6c7f04d6981430c86b4d62f16087ae4f996c1faf31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-21T08:52:59Z","title_canon_sha256":"498bdd508206fbc6945ea14192f8c43d624995ccb04ac6dec47f4fb3f9dc285b"},"schema_version":"1.0","source":{"id":"0811.3490","kind":"arxiv","version":2}},"canonical_sha256":"4277c5d4a66e016fa3ff2c4ed46cac1a823a82ff139bcbe67922cd9a72267131","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4277c5d4a66e016fa3ff2c4ed46cac1a823a82ff139bcbe67922cd9a72267131","first_computed_at":"2026-05-18T04:26:33.479113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:33.479113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wPvgK6ntnGLLoVl3LI0r0dvr5n4Fv6NencIGNGbNKBYrDn3p0+oQhU/V6ODhpwd5hB4+YowqqdVAYV2dFcBKBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:33.479827Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.3490","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da3ebdd2d5d8cb449ac232cb8d4ba46d68a3f1b9ca17ab1e3c8316b45ab08998","sha256:9b99f68ae9adf9fae319457bb3cce29d4dd64ca1488fcc9440c5f1d77eeeec3a"],"state_sha256":"5b907e9ed59a933cda16bb07e58f4e3682e542f8548024ac988f073394b2c584"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ehFOoWDi5rRVz8KL1tXT1ZqlZXsCOQUmdkqN46YVTWyW2J+BoukAabwqRtaCKuaAeCl+x7RkHBfOStL4LB7qAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:10:19.246522Z","bundle_sha256":"bd85d77c492e4b764990db2f4e057d1c5361323d3ca714c013a2387f0fe6f267"}}