{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SV6MFEUPMIO43B6OFSUP6IVH7R","short_pith_number":"pith:SV6MFEUP","schema_version":"1.0","canonical_sha256":"957cc2928f621dcd87ce2ca8ff22a7fc514d661894373b2e995c1682706c8e6d","source":{"kind":"arxiv","id":"1705.09438","version":1},"attestation_state":"computed","paper":{"title":"Duel and sweep algorithm for order-preserving pattern matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ayumi Shinohara, Davaajav Jargalsaikhan, Diptarama, Ryo Yoshinaka","submitted_at":"2017-05-26T05:40:54Z","abstract_excerpt":"Given a text $T$ and a pattern $P$ over alphabet $\\Sigma$, the classic exact matching problem searches for all occurrences of pattern $P$ in text $T$. Unlike exact matching problem, order-preserving pattern matching (OPPM) considers the relative order of elements, rather than their real values. In this paper, we propose an efficient algorithm for OPPM problem using the \"duel-and-sweep\" paradigm. Our algorithm runs in $O(n + m\\log m)$ time in general and $O(n + m)$ time under an assumption that the characters in a string can be sorted in linear time with respect to the string size. We also perf"},"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":"1705.09438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T05:40:54Z","cross_cats_sorted":[],"title_canon_sha256":"8d67ed2f73bb6a4094aa9ad7a9aaa34ebd1b5e0706efd9d0d5d233ab491c6d10","abstract_canon_sha256":"aa2dbe996f30f2bdb5d9e6ca010a291b851e9e336027a7184b08c0a07254b44f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:38.714789Z","signature_b64":"KwOpQSrr8DplGng4eP+XyUSo3WrhRR12UkvnZnfKwQkNgUEKTixyULg5z/sXNeFKdeCxVMFnowYtOtPcth/qDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"957cc2928f621dcd87ce2ca8ff22a7fc514d661894373b2e995c1682706c8e6d","last_reissued_at":"2026-05-18T00:43:38.714330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:38.714330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Duel and sweep algorithm for order-preserving pattern matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ayumi Shinohara, Davaajav Jargalsaikhan, Diptarama, Ryo Yoshinaka","submitted_at":"2017-05-26T05:40:54Z","abstract_excerpt":"Given a text $T$ and a pattern $P$ over alphabet $\\Sigma$, the classic exact matching problem searches for all occurrences of pattern $P$ in text $T$. Unlike exact matching problem, order-preserving pattern matching (OPPM) considers the relative order of elements, rather than their real values. In this paper, we propose an efficient algorithm for OPPM problem using the \"duel-and-sweep\" paradigm. Our algorithm runs in $O(n + m\\log m)$ time in general and $O(n + m)$ time under an assumption that the characters in a string can be sorted in linear time with respect to the string size. We also perf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09438","kind":"arxiv","version":1},"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":"1705.09438","created_at":"2026-05-18T00:43:38.714393+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09438v1","created_at":"2026-05-18T00:43:38.714393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09438","created_at":"2026-05-18T00:43:38.714393+00:00"},{"alias_kind":"pith_short_12","alias_value":"SV6MFEUPMIO4","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SV6MFEUPMIO43B6O","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SV6MFEUP","created_at":"2026-05-18T12:31:43.269735+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/SV6MFEUPMIO43B6OFSUP6IVH7R","json":"https://pith.science/pith/SV6MFEUPMIO43B6OFSUP6IVH7R.json","graph_json":"https://pith.science/api/pith-number/SV6MFEUPMIO43B6OFSUP6IVH7R/graph.json","events_json":"https://pith.science/api/pith-number/SV6MFEUPMIO43B6OFSUP6IVH7R/events.json","paper":"https://pith.science/paper/SV6MFEUP"},"agent_actions":{"view_html":"https://pith.science/pith/SV6MFEUPMIO43B6OFSUP6IVH7R","download_json":"https://pith.science/pith/SV6MFEUPMIO43B6OFSUP6IVH7R.json","view_paper":"https://pith.science/paper/SV6MFEUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09438&json=true","fetch_graph":"https://pith.science/api/pith-number/SV6MFEUPMIO43B6OFSUP6IVH7R/graph.json","fetch_events":"https://pith.science/api/pith-number/SV6MFEUPMIO43B6OFSUP6IVH7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SV6MFEUPMIO43B6OFSUP6IVH7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SV6MFEUPMIO43B6OFSUP6IVH7R/action/storage_attestation","attest_author":"https://pith.science/pith/SV6MFEUPMIO43B6OFSUP6IVH7R/action/author_attestation","sign_citation":"https://pith.science/pith/SV6MFEUPMIO43B6OFSUP6IVH7R/action/citation_signature","submit_replication":"https://pith.science/pith/SV6MFEUPMIO43B6OFSUP6IVH7R/action/replication_record"}},"created_at":"2026-05-18T00:43:38.714393+00:00","updated_at":"2026-05-18T00:43:38.714393+00:00"}