{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:53ZWHT56LS5MRPYJLW6BOYGNUY","short_pith_number":"pith:53ZWHT56","schema_version":"1.0","canonical_sha256":"eef363cfbe5cbac8bf095dbc1760cda610d1a8d3308fab2a302623931a91f46f","source":{"kind":"arxiv","id":"1810.01676","version":3},"attestation_state":"computed","paper":{"title":"Approximating Approximate Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jan Studen\\'y, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2018-10-03T10:38:59Z","abstract_excerpt":"Given a text $T$ of length $n$ and a pattern $P$ of length $m$, the approximate pattern matching problem asks for computation of a particular \\emph{distance} function between $P$ and every $m$-substring of $T$. We consider a $(1\\pm\\varepsilon)$ multiplicative approximation variant of this problem, for $\\ell_p$ distance function. In this paper, we describe two $(1+\\varepsilon)$-approximate algorithms with a runtime of $\\widetilde{O}(\\frac{n}{\\varepsilon})$ for all (constant) non-negative values of $p$. For constant $p \\ge 1$ we show a deterministic $(1+\\varepsilon)$-approximation algorithm. Pre"},"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":"1810.01676","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-03T10:38:59Z","cross_cats_sorted":[],"title_canon_sha256":"b15dbe21516befe5f95830eb7610afc43c3a799d4cc6ef62f589fe28f89824df","abstract_canon_sha256":"d9b739474909b31e67c77d68eb27431a50a9c59421ed6d81fdf73f3c848b225a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:58.132613Z","signature_b64":"lQcqobhOb7+CAQ861926em460S0b5Ikv8S0ifbx+pNHQ73xgYrbUPZTDXAWarn2S49n4Bxg7rrn1MRWsjnoTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eef363cfbe5cbac8bf095dbc1760cda610d1a8d3308fab2a302623931a91f46f","last_reissued_at":"2026-05-17T23:39:58.132008Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:58.132008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Approximate Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jan Studen\\'y, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2018-10-03T10:38:59Z","abstract_excerpt":"Given a text $T$ of length $n$ and a pattern $P$ of length $m$, the approximate pattern matching problem asks for computation of a particular \\emph{distance} function between $P$ and every $m$-substring of $T$. We consider a $(1\\pm\\varepsilon)$ multiplicative approximation variant of this problem, for $\\ell_p$ distance function. In this paper, we describe two $(1+\\varepsilon)$-approximate algorithms with a runtime of $\\widetilde{O}(\\frac{n}{\\varepsilon})$ for all (constant) non-negative values of $p$. For constant $p \\ge 1$ we show a deterministic $(1+\\varepsilon)$-approximation algorithm. Pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01676","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":"1810.01676","created_at":"2026-05-17T23:39:58.132104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01676v3","created_at":"2026-05-17T23:39:58.132104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01676","created_at":"2026-05-17T23:39:58.132104+00:00"},{"alias_kind":"pith_short_12","alias_value":"53ZWHT56LS5M","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"53ZWHT56LS5MRPYJ","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"53ZWHT56","created_at":"2026-05-18T12:32:05.422762+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/53ZWHT56LS5MRPYJLW6BOYGNUY","json":"https://pith.science/pith/53ZWHT56LS5MRPYJLW6BOYGNUY.json","graph_json":"https://pith.science/api/pith-number/53ZWHT56LS5MRPYJLW6BOYGNUY/graph.json","events_json":"https://pith.science/api/pith-number/53ZWHT56LS5MRPYJLW6BOYGNUY/events.json","paper":"https://pith.science/paper/53ZWHT56"},"agent_actions":{"view_html":"https://pith.science/pith/53ZWHT56LS5MRPYJLW6BOYGNUY","download_json":"https://pith.science/pith/53ZWHT56LS5MRPYJLW6BOYGNUY.json","view_paper":"https://pith.science/paper/53ZWHT56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01676&json=true","fetch_graph":"https://pith.science/api/pith-number/53ZWHT56LS5MRPYJLW6BOYGNUY/graph.json","fetch_events":"https://pith.science/api/pith-number/53ZWHT56LS5MRPYJLW6BOYGNUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53ZWHT56LS5MRPYJLW6BOYGNUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53ZWHT56LS5MRPYJLW6BOYGNUY/action/storage_attestation","attest_author":"https://pith.science/pith/53ZWHT56LS5MRPYJLW6BOYGNUY/action/author_attestation","sign_citation":"https://pith.science/pith/53ZWHT56LS5MRPYJLW6BOYGNUY/action/citation_signature","submit_replication":"https://pith.science/pith/53ZWHT56LS5MRPYJLW6BOYGNUY/action/replication_record"}},"created_at":"2026-05-17T23:39:58.132104+00:00","updated_at":"2026-05-17T23:39:58.132104+00:00"}