{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7LW4RH6OJPZSSSEQLTDLHWOUVU","short_pith_number":"pith:7LW4RH6O","schema_version":"1.0","canonical_sha256":"faedc89fce4bf32948905cc6b3d9d4ad0e4e2501e0efc07267bf54d2afe22ada","source":{"kind":"arxiv","id":"2402.07732","version":2},"attestation_state":"computed","paper":{"title":"Pattern Matching with Mismatches and Wildcards","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya","submitted_at":"2024-02-12T15:42:50Z","abstract_excerpt":"In this work, we address the problem of approximate pattern matching with wildcards. Given a pattern $P$ of length $m$ containing $D$ wildcards, a text $T$ of length $n$, and an integer $k$, our objective is to identify all fragments of $T$ within Hamming distance $k$ from $P$.\n  Our primary contribution is an algorithm with runtime $O(n+(D+k)(G+k)\\cdot n/m)$ for this problem. Here, $G \\le D$ represents the number of maximal wildcard fragments in $P$. We derive this algorithm by elaborating in a non-trivial way on the ideas presented by [Charalampopoulos et al., FOCS'20] for pattern matching w"},"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":"2402.07732","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-12T15:42:50Z","cross_cats_sorted":[],"title_canon_sha256":"0ef1d6d917b0c2d29d23b6a8014375e8bc4367f7626501217fa366775d0ef473","abstract_canon_sha256":"3c62b0c8a933115072c3273cb5b46da7942158c9832352838e6cfff032637a78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:12.796535Z","signature_b64":"rSkUTrDNcx2P4U9CLjjpiXIIWlzQQAg61T55PQ5ITOv2WM0WvA+L7FHpdmwDVAa2PjHkHwKOBhXyIEQJgcBvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faedc89fce4bf32948905cc6b3d9d4ad0e4e2501e0efc07267bf54d2afe22ada","last_reissued_at":"2026-07-05T08:21:12.796030Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:12.796030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pattern Matching with Mismatches and Wildcards","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya","submitted_at":"2024-02-12T15:42:50Z","abstract_excerpt":"In this work, we address the problem of approximate pattern matching with wildcards. Given a pattern $P$ of length $m$ containing $D$ wildcards, a text $T$ of length $n$, and an integer $k$, our objective is to identify all fragments of $T$ within Hamming distance $k$ from $P$.\n  Our primary contribution is an algorithm with runtime $O(n+(D+k)(G+k)\\cdot n/m)$ for this problem. Here, $G \\le D$ represents the number of maximal wildcard fragments in $P$. We derive this algorithm by elaborating in a non-trivial way on the ideas presented by [Charalampopoulos et al., FOCS'20] for pattern matching w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07732","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.07732/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2402.07732","created_at":"2026-07-05T08:21:12.796091+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.07732v2","created_at":"2026-07-05T08:21:12.796091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07732","created_at":"2026-07-05T08:21:12.796091+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LW4RH6OJPZS","created_at":"2026-07-05T08:21:12.796091+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LW4RH6OJPZSSSEQ","created_at":"2026-07-05T08:21:12.796091+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LW4RH6O","created_at":"2026-07-05T08:21:12.796091+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.13885","citing_title":"Quantum Pattern Matching with Wildcards","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU","json":"https://pith.science/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU.json","graph_json":"https://pith.science/api/pith-number/7LW4RH6OJPZSSSEQLTDLHWOUVU/graph.json","events_json":"https://pith.science/api/pith-number/7LW4RH6OJPZSSSEQLTDLHWOUVU/events.json","paper":"https://pith.science/paper/7LW4RH6O"},"agent_actions":{"view_html":"https://pith.science/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU","download_json":"https://pith.science/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU.json","view_paper":"https://pith.science/paper/7LW4RH6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.07732&json=true","fetch_graph":"https://pith.science/api/pith-number/7LW4RH6OJPZSSSEQLTDLHWOUVU/graph.json","fetch_events":"https://pith.science/api/pith-number/7LW4RH6OJPZSSSEQLTDLHWOUVU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU/action/storage_attestation","attest_author":"https://pith.science/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU/action/author_attestation","sign_citation":"https://pith.science/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU/action/citation_signature","submit_replication":"https://pith.science/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU/action/replication_record"}},"created_at":"2026-07-05T08:21:12.796091+00:00","updated_at":"2026-07-05T08:21:12.796091+00:00"}