{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AIIYTVH4OQG4XZTK3AGFKWKAYO","short_pith_number":"pith:AIIYTVH4","schema_version":"1.0","canonical_sha256":"021189d4fc740dcbe66ad80c555940c391e33efc9457ea6823e05f571aeecbce","source":{"kind":"arxiv","id":"1704.01311","version":1},"attestation_state":"computed","paper":{"title":"Optimal trade-offs for pattern matching with $k$ mismatches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pawe{\\l} Gawrychowski, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2017-04-05T08:45:22Z","abstract_excerpt":"Given a pattern of length $m$ and a text of length $n$, the goal in $k$-mismatch pattern matching is to compute, for every $m$-substring of the text, the exact Hamming distance to the pattern or report that it exceeds $k$. This can be solved in either $\\widetilde{O}(n \\sqrt{k})$ time as shown by Amir et al. [J. Algorithms 2004] or $\\widetilde{O}((m + k^2) \\cdot n/m)$ time due to a result of Clifford et al. [SODA 2016]. We provide a smooth time trade-off between these two bounds by designing an algorithm working in time $\\widetilde{O}( (m + k \\sqrt{m}) \\cdot n/m)$. We complement this with a mat"},"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":"1704.01311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-05T08:45:22Z","cross_cats_sorted":[],"title_canon_sha256":"ac19df0eb54e5869ffeaf1327b7f366eb41e69004aafccffe3413f918153517f","abstract_canon_sha256":"1974c40aa71d81dd44e1eb980b1f3c1178f641f0be4be48e7a57b306f48e6613"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:58.487224Z","signature_b64":"NJ+/KqLOQ83EV8/3cppsOT4pixI07XhjlF0pC5tiV/jUgrMLHu1J4K1GkEtglQ5Yj+cCQHQbyjhHKCB3BA6lCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"021189d4fc740dcbe66ad80c555940c391e33efc9457ea6823e05f571aeecbce","last_reissued_at":"2026-05-18T00:46:58.486733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:58.486733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal trade-offs for pattern matching with $k$ mismatches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pawe{\\l} Gawrychowski, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2017-04-05T08:45:22Z","abstract_excerpt":"Given a pattern of length $m$ and a text of length $n$, the goal in $k$-mismatch pattern matching is to compute, for every $m$-substring of the text, the exact Hamming distance to the pattern or report that it exceeds $k$. This can be solved in either $\\widetilde{O}(n \\sqrt{k})$ time as shown by Amir et al. [J. Algorithms 2004] or $\\widetilde{O}((m + k^2) \\cdot n/m)$ time due to a result of Clifford et al. [SODA 2016]. We provide a smooth time trade-off between these two bounds by designing an algorithm working in time $\\widetilde{O}( (m + k \\sqrt{m}) \\cdot n/m)$. We complement this with a mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01311","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.01311","created_at":"2026-05-18T00:46:58.486811+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.01311v1","created_at":"2026-05-18T00:46:58.486811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01311","created_at":"2026-05-18T00:46:58.486811+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIIYTVH4OQG4","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIIYTVH4OQG4XZTK","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIIYTVH4","created_at":"2026-05-18T12:31:05.417338+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/AIIYTVH4OQG4XZTK3AGFKWKAYO","json":"https://pith.science/pith/AIIYTVH4OQG4XZTK3AGFKWKAYO.json","graph_json":"https://pith.science/api/pith-number/AIIYTVH4OQG4XZTK3AGFKWKAYO/graph.json","events_json":"https://pith.science/api/pith-number/AIIYTVH4OQG4XZTK3AGFKWKAYO/events.json","paper":"https://pith.science/paper/AIIYTVH4"},"agent_actions":{"view_html":"https://pith.science/pith/AIIYTVH4OQG4XZTK3AGFKWKAYO","download_json":"https://pith.science/pith/AIIYTVH4OQG4XZTK3AGFKWKAYO.json","view_paper":"https://pith.science/paper/AIIYTVH4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.01311&json=true","fetch_graph":"https://pith.science/api/pith-number/AIIYTVH4OQG4XZTK3AGFKWKAYO/graph.json","fetch_events":"https://pith.science/api/pith-number/AIIYTVH4OQG4XZTK3AGFKWKAYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIIYTVH4OQG4XZTK3AGFKWKAYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIIYTVH4OQG4XZTK3AGFKWKAYO/action/storage_attestation","attest_author":"https://pith.science/pith/AIIYTVH4OQG4XZTK3AGFKWKAYO/action/author_attestation","sign_citation":"https://pith.science/pith/AIIYTVH4OQG4XZTK3AGFKWKAYO/action/citation_signature","submit_replication":"https://pith.science/pith/AIIYTVH4OQG4XZTK3AGFKWKAYO/action/replication_record"}},"created_at":"2026-05-18T00:46:58.486811+00:00","updated_at":"2026-05-18T00:46:58.486811+00:00"}