{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:53ZWHT56LS5MRPYJLW6BOYGNUY","short_pith_number":"pith:53ZWHT56","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"},"canonical_sha256":"eef363cfbe5cbac8bf095dbc1760cda610d1a8d3308fab2a302623931a91f46f","source":{"kind":"arxiv","id":"1810.01676","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01676","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01676v3","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01676","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"53ZWHT56LS5M","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"53ZWHT56LS5MRPYJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"53ZWHT56","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:53ZWHT56LS5MRPYJLW6BOYGNUY","target":"record","payload":{"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"},"canonical_sha256":"eef363cfbe5cbac8bf095dbc1760cda610d1a8d3308fab2a302623931a91f46f","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"},"source_kind":"arxiv","source_id":"1810.01676","source_version":3,"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-05-17T23:39:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5EpUDCNuFfDTI1xHi/jWSiFLnOc4RP6o7qLNkI6uw6KhyH/UQ6Lo3vLt7gcsojsG9wBNhbUfixqrASDBMC+rDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:11:55.718596Z"},"content_sha256":"2e3561841a67e0bf5c011add862e23ee85e74a11f9c60ec9c71a81f9c5a6e40d","schema_version":"1.0","event_id":"sha256:2e3561841a67e0bf5c011add862e23ee85e74a11f9c60ec9c71a81f9c5a6e40d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:53ZWHT56LS5MRPYJLW6BOYGNUY","target":"graph","payload":{"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"},"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-05-17T23:39:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NYd0SSA8SWa8Q2s6JKBcIsMLC22dzf30CmuTqD/Mw5XreFlOCeQc+wmFyD7/a8XYZjTxtZUnoPC9dMBiX965Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:11:55.719272Z"},"content_sha256":"a55e30c625242d8f42768b0834d89b9c52c5a56cc23e8d8c82ac466959fbba6f","schema_version":"1.0","event_id":"sha256:a55e30c625242d8f42768b0834d89b9c52c5a56cc23e8d8c82ac466959fbba6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/53ZWHT56LS5MRPYJLW6BOYGNUY/bundle.json","state_url":"https://pith.science/pith/53ZWHT56LS5MRPYJLW6BOYGNUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/53ZWHT56LS5MRPYJLW6BOYGNUY/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-06-09T06:11:55Z","links":{"resolver":"https://pith.science/pith/53ZWHT56LS5MRPYJLW6BOYGNUY","bundle":"https://pith.science/pith/53ZWHT56LS5MRPYJLW6BOYGNUY/bundle.json","state":"https://pith.science/pith/53ZWHT56LS5MRPYJLW6BOYGNUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/53ZWHT56LS5MRPYJLW6BOYGNUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:53ZWHT56LS5MRPYJLW6BOYGNUY","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":"d9b739474909b31e67c77d68eb27431a50a9c59421ed6d81fdf73f3c848b225a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-03T10:38:59Z","title_canon_sha256":"b15dbe21516befe5f95830eb7610afc43c3a799d4cc6ef62f589fe28f89824df"},"schema_version":"1.0","source":{"id":"1810.01676","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01676","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01676v3","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01676","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"53ZWHT56LS5M","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"53ZWHT56LS5MRPYJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"53ZWHT56","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:a55e30c625242d8f42768b0834d89b9c52c5a56cc23e8d8c82ac466959fbba6f","target":"graph","created_at":"2026-05-17T23:39:58Z","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"},"paper":{"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","authors_text":"Jan Studen\\'y, Przemys{\\l}aw Uzna\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-03T10:38:59Z","title":"Approximating Approximate Pattern Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01676","kind":"arxiv","version":3},"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:2e3561841a67e0bf5c011add862e23ee85e74a11f9c60ec9c71a81f9c5a6e40d","target":"record","created_at":"2026-05-17T23:39:58Z","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":"d9b739474909b31e67c77d68eb27431a50a9c59421ed6d81fdf73f3c848b225a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-03T10:38:59Z","title_canon_sha256":"b15dbe21516befe5f95830eb7610afc43c3a799d4cc6ef62f589fe28f89824df"},"schema_version":"1.0","source":{"id":"1810.01676","kind":"arxiv","version":3}},"canonical_sha256":"eef363cfbe5cbac8bf095dbc1760cda610d1a8d3308fab2a302623931a91f46f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eef363cfbe5cbac8bf095dbc1760cda610d1a8d3308fab2a302623931a91f46f","first_computed_at":"2026-05-17T23:39:58.132008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:58.132008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lQcqobhOb7+CAQ861926em460S0b5Ikv8S0ifbx+pNHQ73xgYrbUPZTDXAWarn2S49n4Bxg7rrn1MRWsjnoTBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:58.132613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01676","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e3561841a67e0bf5c011add862e23ee85e74a11f9c60ec9c71a81f9c5a6e40d","sha256:a55e30c625242d8f42768b0834d89b9c52c5a56cc23e8d8c82ac466959fbba6f"],"state_sha256":"257fe9d2609ac27efc81ee672ca34cb29d6715cc334d6a95bd4250a3e51ca877"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FxrlAGyIQlUWNRIP2vKv+MIyBMaY1FSW6nkX69Lkv/BoJv8SHBRpskMbHdZl3ydhvQawWWLyRSBPW9kr4nESBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:11:55.723381Z","bundle_sha256":"ba7eb9b599ffa0e94634c1a8dc9c67b804ddb6a3051bb42753128dea1c1e7c74"}}