{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QMK2FSCV6IMNRAN72JMJZNJF36","short_pith_number":"pith:QMK2FSCV","schema_version":"1.0","canonical_sha256":"8315a2c855f218d881bfd2589cb525df95a445aecdead839d7635083ec63d83b","source":{"kind":"arxiv","id":"1211.5433","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.5433","created_at":"2026-05-18T03:17:11.786718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.5433v3","created_at":"2026-05-18T03:17:11.786718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5433","created_at":"2026-05-18T03:17:11.786718+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMK2FSCV6IMN","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMK2FSCV6IMNRAN7","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMK2FSCV","created_at":"2026-05-18T12:27:18.751474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QMK2FSCV6IMNRAN72JMJZNJF36","json":"https://pith.science/pith/QMK2FSCV6IMNRAN72JMJZNJF36.json","graph_json":"https://pith.science/api/pith-number/QMK2FSCV6IMNRAN72JMJZNJF36/graph.json","events_json":"https://pith.science/api/pith-number/QMK2FSCV6IMNRAN72JMJZNJF36/events.json","paper":"https://pith.science/paper/QMK2FSCV"},"agent_actions":{"view_html":"https://pith.science/pith/QMK2FSCV6IMNRAN72JMJZNJF36","download_json":"https://pith.science/pith/QMK2FSCV6IMNRAN72JMJZNJF36.json","view_paper":"https://pith.science/paper/QMK2FSCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.5433&json=true","fetch_graph":"https://pith.science/api/pith-number/QMK2FSCV6IMNRAN72JMJZNJF36/graph.json","fetch_events":"https://pith.science/api/pith-number/QMK2FSCV6IMNRAN72JMJZNJF36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMK2FSCV6IMNRAN72JMJZNJF36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMK2FSCV6IMNRAN72JMJZNJF36/action/storage_attestation","attest_author":"https://pith.science/pith/QMK2FSCV6IMNRAN72JMJZNJF36/action/author_attestation","sign_citation":"https://pith.science/pith/QMK2FSCV6IMNRAN72JMJZNJF36/action/citation_signature","submit_replication":"https://pith.science/pith/QMK2FSCV6IMNRAN72JMJZNJF36/action/replication_record"}},"created_at":"2026-05-18T03:17:11.786718+00:00","updated_at":"2026-05-18T03:17:11.786718+00:00"}