{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UP6TVB5IOZYTI5DPGH5TMDLH5D","short_pith_number":"pith:UP6TVB5I","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"},"canonical_sha256":"a3fd3a87a8767134746f31fb360d67e8c37d0773be1e28ee0bbfb7dc9acf33b0","source":{"kind":"arxiv","id":"1801.09159","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09159","created_at":"2026-05-18T00:16:55Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09159v2","created_at":"2026-05-18T00:16:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09159","created_at":"2026-05-18T00:16:55Z"},{"alias_kind":"pith_short_12","alias_value":"UP6TVB5IOZYT","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UP6TVB5IOZYTI5DP","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UP6TVB5I","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UP6TVB5IOZYTI5DPGH5TMDLH5D","target":"record","payload":{"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"},"canonical_sha256":"a3fd3a87a8767134746f31fb360d67e8c37d0773be1e28ee0bbfb7dc9acf33b0","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"},"source_kind":"arxiv","source_id":"1801.09159","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-05-18T00:16:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iwT9xU5+agc0JHKxzkK6N3XJm/mrMimT9MiCPvPo5uK6/OBUhcw+X7nrdqW0sciu/VC8q2qOQyPh9oQc9z5ABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:16:54.842845Z"},"content_sha256":"05eb986ecddbc8965eff4aac873622249670250d1a4309603aaa4fba5ae67902","schema_version":"1.0","event_id":"sha256:05eb986ecddbc8965eff4aac873622249670250d1a4309603aaa4fba5ae67902"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UP6TVB5IOZYTI5DPGH5TMDLH5D","target":"graph","payload":{"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"},"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-18T00:16:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ftCvNC3Ba53h89PfmwHaHUuBUYGuIkeEf+tNsSTrCSWDkuenfDartq4emI3It7WCu6bUR8YYJulzLidYWK7tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:16:54.843635Z"},"content_sha256":"b3acc72d7ac9d528ad53399c89d81e929d00350aab902f013d21c14775a1853f","schema_version":"1.0","event_id":"sha256:b3acc72d7ac9d528ad53399c89d81e929d00350aab902f013d21c14775a1853f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D/bundle.json","state_url":"https://pith.science/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D/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:16:54Z","links":{"resolver":"https://pith.science/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D","bundle":"https://pith.science/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D/bundle.json","state":"https://pith.science/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UP6TVB5IOZYTI5DPGH5TMDLH5D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UP6TVB5IOZYTI5DPGH5TMDLH5D","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":"0ee4a89fcb7e5249d712d5b1b101741ef5f2be2f68bd8f22505f0cba7df1debe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-28T00:43:49Z","title_canon_sha256":"577630afb52c136554daf522a530109d4bceafd2c0d906d6274a9505653abfe3"},"schema_version":"1.0","source":{"id":"1801.09159","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09159","created_at":"2026-05-18T00:16:55Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09159v2","created_at":"2026-05-18T00:16:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09159","created_at":"2026-05-18T00:16:55Z"},{"alias_kind":"pith_short_12","alias_value":"UP6TVB5IOZYT","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UP6TVB5IOZYTI5DP","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UP6TVB5I","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:b3acc72d7ac9d528ad53399c89d81e929d00350aab902f013d21c14775a1853f","target":"graph","created_at":"2026-05-18T00:16:55Z","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":"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","authors_text":"Przemys{\\l}aw Uzna\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-28T00:43:49Z","title":"Faster Approximate(d) Text-to-Pattern L1 Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09159","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:05eb986ecddbc8965eff4aac873622249670250d1a4309603aaa4fba5ae67902","target":"record","created_at":"2026-05-18T00:16:55Z","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":"0ee4a89fcb7e5249d712d5b1b101741ef5f2be2f68bd8f22505f0cba7df1debe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-28T00:43:49Z","title_canon_sha256":"577630afb52c136554daf522a530109d4bceafd2c0d906d6274a9505653abfe3"},"schema_version":"1.0","source":{"id":"1801.09159","kind":"arxiv","version":2}},"canonical_sha256":"a3fd3a87a8767134746f31fb360d67e8c37d0773be1e28ee0bbfb7dc9acf33b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3fd3a87a8767134746f31fb360d67e8c37d0773be1e28ee0bbfb7dc9acf33b0","first_computed_at":"2026-05-18T00:16:55.715371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:55.715371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9hnerJ2LGfU5pKJBFiuiY4N6LigdwL4ZIlTPrWjJGwyXqEf2e97g8cFTBBJEjaKokgvl5CjplaF9s809dI80DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:55.716244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09159","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05eb986ecddbc8965eff4aac873622249670250d1a4309603aaa4fba5ae67902","sha256:b3acc72d7ac9d528ad53399c89d81e929d00350aab902f013d21c14775a1853f"],"state_sha256":"e0d405bddff78977709875fdb1918fac33d6991a7456cebe4f3cf0baece5e8ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XoqHYD9EgtAxvr80qJmDtaky3OeMLjQK3QK7+N8F4JSapPcutX4JwCyN1LmxR0GvzWtrHtJpEnjZDca9eFesAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:16:54.847690Z","bundle_sha256":"a41a55cdb2e67c87de030fe7c419b2d6552e897b5725f4fc58e2f1c0d101f5f8"}}