{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LZOHGNPWF25XRTZMN63XZS7756","short_pith_number":"pith:LZOHGNPW","schema_version":"1.0","canonical_sha256":"5e5c7335f62ebb78cf2c6fb77ccbffefaa7472f3292f7ec6b19ab72802c504b5","source":{"kind":"arxiv","id":"1508.00731","version":2},"attestation_state":"computed","paper":{"title":"The k-mismatch problem revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Allyx Fontaine, Benjamin Sach, Ely Porat, Rapha\\\"el Clifford, Tatiana Starikovskaya","submitted_at":"2015-08-04T11:07:50Z","abstract_excerpt":"We revisit the complexity of one of the most basic problems in pattern matching. In the k-mismatch problem we must compute the Hamming distance between a pattern of length m and every m-length substring of a text of length n, as long as that Hamming distance is at most k. Where the Hamming distance is greater than k at some alignment of the pattern and text, we simply output \"No\".\n  We study this problem in both the standard offline setting and also as a streaming problem. In the streaming k-mismatch problem the text arrives one symbol at a time and we must give an output before processing any"},"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":"1508.00731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-04T11:07:50Z","cross_cats_sorted":[],"title_canon_sha256":"c83468837263564b2b69e7aa4257baa1b08c9e4ae8bdd57b2dee99b31ff5cf18","abstract_canon_sha256":"2d032bbbdf5aabf428e598f524eb2daeb9a50a4d98265ced852620e463849f97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:41.546500Z","signature_b64":"SOtQP3I8sIN4MkBrDnx7rh60mh6Cxu3uMhl0l9n7gl2DJ6HjmazX+UTKRjza78lmdgaw5//sROwZFvkKLCAFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e5c7335f62ebb78cf2c6fb77ccbffefaa7472f3292f7ec6b19ab72802c504b5","last_reissued_at":"2026-05-18T01:34:41.546121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:41.546121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The k-mismatch problem revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Allyx Fontaine, Benjamin Sach, Ely Porat, Rapha\\\"el Clifford, Tatiana Starikovskaya","submitted_at":"2015-08-04T11:07:50Z","abstract_excerpt":"We revisit the complexity of one of the most basic problems in pattern matching. In the k-mismatch problem we must compute the Hamming distance between a pattern of length m and every m-length substring of a text of length n, as long as that Hamming distance is at most k. Where the Hamming distance is greater than k at some alignment of the pattern and text, we simply output \"No\".\n  We study this problem in both the standard offline setting and also as a streaming problem. In the streaming k-mismatch problem the text arrives one symbol at a time and we must give an output before processing any"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00731","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.00731","created_at":"2026-05-18T01:34:41.546171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.00731v2","created_at":"2026-05-18T01:34:41.546171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00731","created_at":"2026-05-18T01:34:41.546171+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZOHGNPWF25X","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZOHGNPWF25XRTZM","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZOHGNPW","created_at":"2026-05-18T12:29:29.992203+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/LZOHGNPWF25XRTZMN63XZS7756","json":"https://pith.science/pith/LZOHGNPWF25XRTZMN63XZS7756.json","graph_json":"https://pith.science/api/pith-number/LZOHGNPWF25XRTZMN63XZS7756/graph.json","events_json":"https://pith.science/api/pith-number/LZOHGNPWF25XRTZMN63XZS7756/events.json","paper":"https://pith.science/paper/LZOHGNPW"},"agent_actions":{"view_html":"https://pith.science/pith/LZOHGNPWF25XRTZMN63XZS7756","download_json":"https://pith.science/pith/LZOHGNPWF25XRTZMN63XZS7756.json","view_paper":"https://pith.science/paper/LZOHGNPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.00731&json=true","fetch_graph":"https://pith.science/api/pith-number/LZOHGNPWF25XRTZMN63XZS7756/graph.json","fetch_events":"https://pith.science/api/pith-number/LZOHGNPWF25XRTZMN63XZS7756/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZOHGNPWF25XRTZMN63XZS7756/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZOHGNPWF25XRTZMN63XZS7756/action/storage_attestation","attest_author":"https://pith.science/pith/LZOHGNPWF25XRTZMN63XZS7756/action/author_attestation","sign_citation":"https://pith.science/pith/LZOHGNPWF25XRTZMN63XZS7756/action/citation_signature","submit_replication":"https://pith.science/pith/LZOHGNPWF25XRTZMN63XZS7756/action/replication_record"}},"created_at":"2026-05-18T01:34:41.546171+00:00","updated_at":"2026-05-18T01:34:41.546171+00:00"}