{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QMK2FSCV6IMNRAN72JMJZNJF36","short_pith_number":"pith:QMK2FSCV","canonical_record":{"source":{"id":"1211.5433","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-23T08:30:45Z","cross_cats_sorted":[],"title_canon_sha256":"4f68a1f0b68998cf21f4220d900e37fd108380d0d6e43bcb92a1330cb0d1d9d9","abstract_canon_sha256":"f537b61131919c6130d8bf722da63cae8fd1dee7828e2e8282fa2b5280fee613"},"schema_version":"1.0"},"canonical_sha256":"8315a2c855f218d881bfd2589cb525df95a445aecdead839d7635083ec63d83b","source":{"kind":"arxiv","id":"1211.5433","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5433","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5433v3","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5433","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"QMK2FSCV6IMN","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QMK2FSCV6IMNRAN7","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QMK2FSCV","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QMK2FSCV6IMNRAN72JMJZNJF36","target":"record","payload":{"canonical_record":{"source":{"id":"1211.5433","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-23T08:30:45Z","cross_cats_sorted":[],"title_canon_sha256":"4f68a1f0b68998cf21f4220d900e37fd108380d0d6e43bcb92a1330cb0d1d9d9","abstract_canon_sha256":"f537b61131919c6130d8bf722da63cae8fd1dee7828e2e8282fa2b5280fee613"},"schema_version":"1.0"},"canonical_sha256":"8315a2c855f218d881bfd2589cb525df95a445aecdead839d7635083ec63d83b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:11.787411Z","signature_b64":"AQoIYJTV8KLRS4x5xEEsaq5rIOSzw/GfoEx9ViZOZ6oUO2qPy4ZMCFkmEd46tQc9hAcw78JLgCufpSVlEHjQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8315a2c855f218d881bfd2589cb525df95a445aecdead839d7635083ec63d83b","last_reissued_at":"2026-05-18T03:17:11.786576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:11.786576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.5433","source_version":3,"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-18T03:17:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GrMtaaYuqGbhypW0Br+EXNPmIeCj92uINwCDqEkbu8mHdIyR7MZhJy0pFLgtq72xhckPC3Z+S08ZnN1CRchoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:46:45.171831Z"},"content_sha256":"b4d91de2a3fcddd936527e18ae2864a589203bc0c342c8599f73c7cec4b455ea","schema_version":"1.0","event_id":"sha256:b4d91de2a3fcddd936527e18ae2864a589203bc0c342c8599f73c7cec4b455ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QMK2FSCV6IMNRAN72JMJZNJF36","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate pattern matching with k-mismatches in packed text","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski","submitted_at":"2012-11-23T08:30:45Z","abstract_excerpt":"Given strings $P$ of length $m$ and $T$ of length $n$ over an alphabet of size $\\sigma$, the string matching with $k$-mismatches problem is to find the positions of all the substrings in $T$ that are at Hamming distance at most $k$ from $P$. If $T$ can be read only one character at the time the best known bounds are $O(n\\sqrt{k\\log k})$ and $O(n + n\\sqrt{k/w}\\log k)$ in the word-RAM model with word length $w$. In the RAM models (including $AC^0$ and word-RAM) it is possible to read up to $\\floor{w / \\log \\sigma}$ characters in constant time if the characters of $T$ are encoded using $\\ceil{\\lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5433","kind":"arxiv","version":3},"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-18T03:17:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0qt4w59ueBOacyGUPnPFhPY7U4aGcslEHPCPC6el0yc87jftfzA9rQgt0VuUhBBFnBNS+VFfujEpXRGEuGcoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:46:45.172174Z"},"content_sha256":"ec17d316c7494aa511d0abd6120077e82e0b963e7540eb5941fa172c8d8e12fc","schema_version":"1.0","event_id":"sha256:ec17d316c7494aa511d0abd6120077e82e0b963e7540eb5941fa172c8d8e12fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMK2FSCV6IMNRAN72JMJZNJF36/bundle.json","state_url":"https://pith.science/pith/QMK2FSCV6IMNRAN72JMJZNJF36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMK2FSCV6IMNRAN72JMJZNJF36/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-01T03:46:45Z","links":{"resolver":"https://pith.science/pith/QMK2FSCV6IMNRAN72JMJZNJF36","bundle":"https://pith.science/pith/QMK2FSCV6IMNRAN72JMJZNJF36/bundle.json","state":"https://pith.science/pith/QMK2FSCV6IMNRAN72JMJZNJF36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMK2FSCV6IMNRAN72JMJZNJF36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QMK2FSCV6IMNRAN72JMJZNJF36","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":"f537b61131919c6130d8bf722da63cae8fd1dee7828e2e8282fa2b5280fee613","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-23T08:30:45Z","title_canon_sha256":"4f68a1f0b68998cf21f4220d900e37fd108380d0d6e43bcb92a1330cb0d1d9d9"},"schema_version":"1.0","source":{"id":"1211.5433","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5433","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5433v3","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5433","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"QMK2FSCV6IMN","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QMK2FSCV6IMNRAN7","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QMK2FSCV","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:ec17d316c7494aa511d0abd6120077e82e0b963e7540eb5941fa172c8d8e12fc","target":"graph","created_at":"2026-05-18T03:17:11Z","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":"Given strings $P$ of length $m$ and $T$ of length $n$ over an alphabet of size $\\sigma$, the string matching with $k$-mismatches problem is to find the positions of all the substrings in $T$ that are at Hamming distance at most $k$ from $P$. If $T$ can be read only one character at the time the best known bounds are $O(n\\sqrt{k\\log k})$ and $O(n + n\\sqrt{k/w}\\log k)$ in the word-RAM model with word length $w$. In the RAM models (including $AC^0$ and word-RAM) it is possible to read up to $\\floor{w / \\log \\sigma}$ characters in constant time if the characters of $T$ are encoded using $\\ceil{\\lo","authors_text":"Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-23T08:30:45Z","title":"Approximate pattern matching with k-mismatches in packed text"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5433","kind":"arxiv","version":3},"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:b4d91de2a3fcddd936527e18ae2864a589203bc0c342c8599f73c7cec4b455ea","target":"record","created_at":"2026-05-18T03:17:11Z","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":"f537b61131919c6130d8bf722da63cae8fd1dee7828e2e8282fa2b5280fee613","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-23T08:30:45Z","title_canon_sha256":"4f68a1f0b68998cf21f4220d900e37fd108380d0d6e43bcb92a1330cb0d1d9d9"},"schema_version":"1.0","source":{"id":"1211.5433","kind":"arxiv","version":3}},"canonical_sha256":"8315a2c855f218d881bfd2589cb525df95a445aecdead839d7635083ec63d83b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8315a2c855f218d881bfd2589cb525df95a445aecdead839d7635083ec63d83b","first_computed_at":"2026-05-18T03:17:11.786576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:11.786576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AQoIYJTV8KLRS4x5xEEsaq5rIOSzw/GfoEx9ViZOZ6oUO2qPy4ZMCFkmEd46tQc9hAcw78JLgCufpSVlEHjQBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:11.787411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5433","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4d91de2a3fcddd936527e18ae2864a589203bc0c342c8599f73c7cec4b455ea","sha256:ec17d316c7494aa511d0abd6120077e82e0b963e7540eb5941fa172c8d8e12fc"],"state_sha256":"dd36cda152cbc420145c6ec189b77ba30d799b4c90d9da5e93a49f0538f35475"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xbLld0Md+fRMZIGvqF+9C6+Z35wHwsSU3hyIRejIwsikAmdf2W+gA9r2AepCTlTkUzOE9esKKTdJ35rBdpVDCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:46:45.174176Z","bundle_sha256":"8233e7df06a8533bbb9b7aeab90db757edb1d540d3943122f4ffb64965bc2b79"}}