{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:7LW4RH6OJPZSSSEQLTDLHWOUVU","short_pith_number":"pith:7LW4RH6O","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"},"canonical_sha256":"faedc89fce4bf32948905cc6b3d9d4ad0e4e2501e0efc07267bf54d2afe22ada","source":{"kind":"arxiv","id":"2402.07732","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.07732","created_at":"2026-07-05T08:21:12Z"},{"alias_kind":"arxiv_version","alias_value":"2402.07732v2","created_at":"2026-07-05T08:21:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07732","created_at":"2026-07-05T08:21:12Z"},{"alias_kind":"pith_short_12","alias_value":"7LW4RH6OJPZS","created_at":"2026-07-05T08:21:12Z"},{"alias_kind":"pith_short_16","alias_value":"7LW4RH6OJPZSSSEQ","created_at":"2026-07-05T08:21:12Z"},{"alias_kind":"pith_short_8","alias_value":"7LW4RH6O","created_at":"2026-07-05T08:21:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:7LW4RH6OJPZSSSEQLTDLHWOUVU","target":"record","payload":{"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"},"canonical_sha256":"faedc89fce4bf32948905cc6b3d9d4ad0e4e2501e0efc07267bf54d2afe22ada","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"},"source_kind":"arxiv","source_id":"2402.07732","source_version":2,"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-07-05T08:21:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"POwQgmiMU52rNjZGvvUnyqFAeONlNy6ivw5D51yiPxz/EfBy2Af7zhIsUOhtY/T9ep5wL561fgOMoDSUBrjiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:29:56.545587Z"},"content_sha256":"8ab76fd802211cc3b84472dbc30a0e80e9de560f7cd1ec1f933237f822de6c56","schema_version":"1.0","event_id":"sha256:8ab76fd802211cc3b84472dbc30a0e80e9de560f7cd1ec1f933237f822de6c56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:7LW4RH6OJPZSSSEQLTDLHWOUVU","target":"graph","payload":{"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"},"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-07-05T08:21:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Kn2SX4yi1ipRHioyp5OwYTkxgcWNjgD8XwHEUpISdf9Fn6hjUK2TRafdpPTSQzHcoNo6IIttFhtdoy1iZ6LDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:29:56.546663Z"},"content_sha256":"dd1b5188623a33b7e4dfd9ef8e94753c8d89d2fc68baa830ce443f9ee85e6001","schema_version":"1.0","event_id":"sha256:dd1b5188623a33b7e4dfd9ef8e94753c8d89d2fc68baa830ce443f9ee85e6001"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU/bundle.json","state_url":"https://pith.science/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU/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-08-15T15:29:56Z","links":{"resolver":"https://pith.science/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU","bundle":"https://pith.science/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU/bundle.json","state":"https://pith.science/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LW4RH6OJPZSSSEQLTDLHWOUVU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7LW4RH6OJPZSSSEQLTDLHWOUVU","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":"3c62b0c8a933115072c3273cb5b46da7942158c9832352838e6cfff032637a78","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-12T15:42:50Z","title_canon_sha256":"0ef1d6d917b0c2d29d23b6a8014375e8bc4367f7626501217fa366775d0ef473"},"schema_version":"1.0","source":{"id":"2402.07732","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.07732","created_at":"2026-07-05T08:21:12Z"},{"alias_kind":"arxiv_version","alias_value":"2402.07732v2","created_at":"2026-07-05T08:21:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07732","created_at":"2026-07-05T08:21:12Z"},{"alias_kind":"pith_short_12","alias_value":"7LW4RH6OJPZS","created_at":"2026-07-05T08:21:12Z"},{"alias_kind":"pith_short_16","alias_value":"7LW4RH6OJPZSSSEQ","created_at":"2026-07-05T08:21:12Z"},{"alias_kind":"pith_short_8","alias_value":"7LW4RH6O","created_at":"2026-07-05T08:21:12Z"}],"graph_snapshots":[{"event_id":"sha256:dd1b5188623a33b7e4dfd9ef8e94753c8d89d2fc68baa830ce443f9ee85e6001","target":"graph","created_at":"2026-07-05T08:21:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.07732/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-12T15:42:50Z","title":"Pattern Matching with Mismatches and Wildcards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07732","kind":"arxiv","version":2},"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:8ab76fd802211cc3b84472dbc30a0e80e9de560f7cd1ec1f933237f822de6c56","target":"record","created_at":"2026-07-05T08:21:12Z","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":"3c62b0c8a933115072c3273cb5b46da7942158c9832352838e6cfff032637a78","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-12T15:42:50Z","title_canon_sha256":"0ef1d6d917b0c2d29d23b6a8014375e8bc4367f7626501217fa366775d0ef473"},"schema_version":"1.0","source":{"id":"2402.07732","kind":"arxiv","version":2}},"canonical_sha256":"faedc89fce4bf32948905cc6b3d9d4ad0e4e2501e0efc07267bf54d2afe22ada","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faedc89fce4bf32948905cc6b3d9d4ad0e4e2501e0efc07267bf54d2afe22ada","first_computed_at":"2026-07-05T08:21:12.796030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:21:12.796030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rSkUTrDNcx2P4U9CLjjpiXIIWlzQQAg61T55PQ5ITOv2WM0WvA+L7FHpdmwDVAa2PjHkHwKOBhXyIEQJgcBvDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:21:12.796535Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.07732","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ab76fd802211cc3b84472dbc30a0e80e9de560f7cd1ec1f933237f822de6c56","sha256:dd1b5188623a33b7e4dfd9ef8e94753c8d89d2fc68baa830ce443f9ee85e6001"],"state_sha256":"5256b3f62144a0cecd66726b4958fc2786e86722de009399302776e53b397ec5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pOHnv8D1o/jKT5t1Icvfg9sB5hdU1LhWouWKyRkRpybQ9saln/0weM91eEHULYiTC0PJOikbn4HRIiqrEgTBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T15:29:56.556540Z","bundle_sha256":"8fb353d6151121243d75727dad6e2f0a6deee5030fb148e5c008a2931f43ff61"}}