{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UP6TVB5IOZYTI5DPGH5TMDLH5D","short_pith_number":"pith:UP6TVB5I","schema_version":"1.0","canonical_sha256":"a3fd3a87a8767134746f31fb360d67e8c37d0773be1e28ee0bbfb7dc9acf33b0","source":{"kind":"arxiv","id":"1801.09159","version":2},"attestation_state":"computed","paper":{"title":"Faster Approximate(d) Text-to-Pattern L1 Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Przemys{\\l}aw Uzna\\'nski","submitted_at":"2018-01-28T00:43:49Z","abstract_excerpt":"The problem of finding \\emph{distance} between \\emph{pattern} of length $m$ and \\emph{text} of length $n$ is a typical way of generalizing pattern matching to incorporate dissimilarity score. For both Hamming and $L_1$ distances only a super linear upper bound $\\widetilde{O}(n\\sqrt{m})$ are known, which prompts the question of relaxing the problem: either by asking for $(1 \\pm \\varepsilon)$ approximate distance (every distance is reported up to a multiplicative factor), or $k$-approximated distance (distances exceeding $k$ are reported as $\\infty$). We focus on $L_1$ distance, for which we sho"},"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":"1801.09159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-28T00:43:49Z","cross_cats_sorted":[],"title_canon_sha256":"577630afb52c136554daf522a530109d4bceafd2c0d906d6274a9505653abfe3","abstract_canon_sha256":"0ee4a89fcb7e5249d712d5b1b101741ef5f2be2f68bd8f22505f0cba7df1debe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:55.716244Z","signature_b64":"9hnerJ2LGfU5pKJBFiuiY4N6LigdwL4ZIlTPrWjJGwyXqEf2e97g8cFTBBJEjaKokgvl5CjplaF9s809dI80DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3fd3a87a8767134746f31fb360d67e8c37d0773be1e28ee0bbfb7dc9acf33b0","last_reissued_at":"2026-05-18T00:16:55.715371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:55.715371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Approximate(d) Text-to-Pattern L1 Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Przemys{\\l}aw Uzna\\'nski","submitted_at":"2018-01-28T00:43:49Z","abstract_excerpt":"The problem of finding \\emph{distance} between \\emph{pattern} of length $m$ and \\emph{text} of length $n$ is a typical way of generalizing pattern matching to incorporate dissimilarity score. For both Hamming and $L_1$ distances only a super linear upper bound $\\widetilde{O}(n\\sqrt{m})$ are known, which prompts the question of relaxing the problem: either by asking for $(1 \\pm \\varepsilon)$ approximate distance (every distance is reported up to a multiplicative factor), or $k$-approximated distance (distances exceeding $k$ are reported as $\\infty$). We focus on $L_1$ distance, for which we sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09159","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":"1801.09159","created_at":"2026-05-18T00:16:55.715509+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.09159v2","created_at":"2026-05-18T00:16:55.715509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09159","created_at":"2026-05-18T00:16:55.715509+00:00"},{"alias_kind":"pith_short_12","alias_value":"UP6TVB5IOZYT","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UP6TVB5IOZYTI5DP","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UP6TVB5I","created_at":"2026-05-18T12:32:56.356000+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/UP6TVB5IOZYTI5DPGH5TMDLH5D","json":"https://pith.science/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D.json","graph_json":"https://pith.science/api/pith-number/UP6TVB5IOZYTI5DPGH5TMDLH5D/graph.json","events_json":"https://pith.science/api/pith-number/UP6TVB5IOZYTI5DPGH5TMDLH5D/events.json","paper":"https://pith.science/paper/UP6TVB5I"},"agent_actions":{"view_html":"https://pith.science/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D","download_json":"https://pith.science/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D.json","view_paper":"https://pith.science/paper/UP6TVB5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.09159&json=true","fetch_graph":"https://pith.science/api/pith-number/UP6TVB5IOZYTI5DPGH5TMDLH5D/graph.json","fetch_events":"https://pith.science/api/pith-number/UP6TVB5IOZYTI5DPGH5TMDLH5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D/action/storage_attestation","attest_author":"https://pith.science/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D/action/author_attestation","sign_citation":"https://pith.science/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D/action/citation_signature","submit_replication":"https://pith.science/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D/action/replication_record"}},"created_at":"2026-05-18T00:16:55.715509+00:00","updated_at":"2026-05-18T00:16:55.715509+00:00"}