{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6ZWJNJRBZKQ5OPIB45FO3A3KLE","short_pith_number":"pith:6ZWJNJRB","schema_version":"1.0","canonical_sha256":"f66c96a621caa1d73d01e74aed836a593a7ab22ac4ea71c2434b646d31b69e5c","source":{"kind":"arxiv","id":"1706.00148","version":2},"attestation_state":"computed","paper":{"title":"Order preserving pattern matching on trees and DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Temma Nakamura","submitted_at":"2017-06-01T01:58:59Z","abstract_excerpt":"The order preserving pattern matching (OPPM) problem is, given a pattern string $p$ and a text string $t$, find all substrings of $t$ which have the same relative orders as $p$. In this paper, we consider two variants of the OPPM problem where a set of text strings is given as a tree or a DAG. We show that the OPPM problem for a single pattern $p$ of length $m$ and a text tree $T$ of size $N$ can be solved in $O(m+N)$ time if the characters of $p$ are drawn from an integer alphabet of polynomial size. The time complexity becomes $O(m \\log m + N)$ if the pattern $p$ is over a general ordered al"},"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":"1706.00148","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-01T01:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"9f1d7124f064488d4310c8201d412844208385dbda3458b5ad5381a6ae652570","abstract_canon_sha256":"c8d3b2dccc32360c073f39fed73ccf0f1b3123123f35d28fdd83ffceba3ba497"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:34.425103Z","signature_b64":"g0SOKoWf23kpAQ6J382qjI9SG972ylUOkmqVBm6bmatSOWMZBFFiFZb8+NN0aDCkLobjYxej0otZwXBPOOTEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f66c96a621caa1d73d01e74aed836a593a7ab22ac4ea71c2434b646d31b69e5c","last_reissued_at":"2026-05-18T00:39:34.424235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:34.424235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Order preserving pattern matching on trees and DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Temma Nakamura","submitted_at":"2017-06-01T01:58:59Z","abstract_excerpt":"The order preserving pattern matching (OPPM) problem is, given a pattern string $p$ and a text string $t$, find all substrings of $t$ which have the same relative orders as $p$. In this paper, we consider two variants of the OPPM problem where a set of text strings is given as a tree or a DAG. We show that the OPPM problem for a single pattern $p$ of length $m$ and a text tree $T$ of size $N$ can be solved in $O(m+N)$ time if the characters of $p$ are drawn from an integer alphabet of polynomial size. The time complexity becomes $O(m \\log m + N)$ if the pattern $p$ is over a general ordered al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00148","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":"1706.00148","created_at":"2026-05-18T00:39:34.424365+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00148v2","created_at":"2026-05-18T00:39:34.424365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00148","created_at":"2026-05-18T00:39:34.424365+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZWJNJRBZKQ5","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZWJNJRBZKQ5OPIB","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZWJNJRB","created_at":"2026-05-18T12:31:03.183658+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/6ZWJNJRBZKQ5OPIB45FO3A3KLE","json":"https://pith.science/pith/6ZWJNJRBZKQ5OPIB45FO3A3KLE.json","graph_json":"https://pith.science/api/pith-number/6ZWJNJRBZKQ5OPIB45FO3A3KLE/graph.json","events_json":"https://pith.science/api/pith-number/6ZWJNJRBZKQ5OPIB45FO3A3KLE/events.json","paper":"https://pith.science/paper/6ZWJNJRB"},"agent_actions":{"view_html":"https://pith.science/pith/6ZWJNJRBZKQ5OPIB45FO3A3KLE","download_json":"https://pith.science/pith/6ZWJNJRBZKQ5OPIB45FO3A3KLE.json","view_paper":"https://pith.science/paper/6ZWJNJRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00148&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZWJNJRBZKQ5OPIB45FO3A3KLE/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZWJNJRBZKQ5OPIB45FO3A3KLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZWJNJRBZKQ5OPIB45FO3A3KLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZWJNJRBZKQ5OPIB45FO3A3KLE/action/storage_attestation","attest_author":"https://pith.science/pith/6ZWJNJRBZKQ5OPIB45FO3A3KLE/action/author_attestation","sign_citation":"https://pith.science/pith/6ZWJNJRBZKQ5OPIB45FO3A3KLE/action/citation_signature","submit_replication":"https://pith.science/pith/6ZWJNJRBZKQ5OPIB45FO3A3KLE/action/replication_record"}},"created_at":"2026-05-18T00:39:34.424365+00:00","updated_at":"2026-05-18T00:39:34.424365+00:00"}