{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SNN6XUPNKLYLKXGLRQ3IFLSEXJ","short_pith_number":"pith:SNN6XUPN","canonical_record":{"source":{"id":"1501.04001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-16T14:55:47Z","cross_cats_sorted":[],"title_canon_sha256":"1c58c46ddd357871482944cf9cf2a9a4ea2a279039042fb7ead176583917e5ba","abstract_canon_sha256":"1cba65d0c7fb8c974563c6adfe9ddbf95cdadfff83f18d93da4c76a2cdf9dd58"},"schema_version":"1.0"},"canonical_sha256":"935bebd1ed52f0b55ccb8c3682ae44ba4f484049ef05059f0487aadf97abdc39","source":{"kind":"arxiv","id":"1501.04001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04001","created_at":"2026-05-18T02:29:16Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04001v1","created_at":"2026-05-18T02:29:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04001","created_at":"2026-05-18T02:29:16Z"},{"alias_kind":"pith_short_12","alias_value":"SNN6XUPNKLYL","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SNN6XUPNKLYLKXGL","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SNN6XUPN","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SNN6XUPNKLYLKXGLRQ3IFLSEXJ","target":"record","payload":{"canonical_record":{"source":{"id":"1501.04001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-16T14:55:47Z","cross_cats_sorted":[],"title_canon_sha256":"1c58c46ddd357871482944cf9cf2a9a4ea2a279039042fb7ead176583917e5ba","abstract_canon_sha256":"1cba65d0c7fb8c974563c6adfe9ddbf95cdadfff83f18d93da4c76a2cdf9dd58"},"schema_version":"1.0"},"canonical_sha256":"935bebd1ed52f0b55ccb8c3682ae44ba4f484049ef05059f0487aadf97abdc39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:16.527419Z","signature_b64":"Y6+kDmMORNHOuhMHZdNb++SDbhryzQ15v2q22SGabPLIBPazR3kuOo7bZhZNcDHXhancTyovsq99XxFtB1jJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"935bebd1ed52f0b55ccb8c3682ae44ba4f484049ef05059f0487aadf97abdc39","last_reissued_at":"2026-05-18T02:29:16.527030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:16.527030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.04001","source_version":1,"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-18T02:29:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2ZwW0axB77meq9XdakdB1d6KRWDxWNQlwaQwvImjlOM1mIddqn15Qz86x89ChVT/wHPhUs+x/Y6j1J8c4JFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:41:36.569693Z"},"content_sha256":"2d7790cc34aecd02c35cef8c17a095a584af1aab266230856638b474e9f93e98","schema_version":"1.0","event_id":"sha256:2d7790cc34aecd02c35cef8c17a095a584af1aab266230856638b474e9f93e98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SNN6XUPNKLYLKXGLRQ3IFLSEXJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for the Order Preserving Pattern Matching Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"O\\u{g}uzhan K\\\"ulekci, Simone Faro","submitted_at":"2015-01-16T14:55:47Z","abstract_excerpt":"Given a pattern x of length m and a text y of length n, both over an ordered alphabet, the order-preserving pattern matching problem consists in finding all substrings of the text with the same relative order as the pattern. It is an approximate variant of the well known exact pattern matching problem which has gained attention in recent years. This interesting problem finds applications in a lot of fields as time series analysis, like share prices on stock markets, weather data analysis or to musical melody matching. In this paper we present two new filtering approaches which turn out to be m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04001","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"},"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-18T02:29:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r8UcXdLvP9hqIz3Dgz1cJHr7nRAJA9Y+f4RpjmPhRRJv3ikOTM3MJCMsGRjs9KDpdqybGtfqWPAzTNovuz4SBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:41:36.570045Z"},"content_sha256":"d87774238d68a56c9dd49490b9c31a92f2be6483ee1be3e911f43d74826c0744","schema_version":"1.0","event_id":"sha256:d87774238d68a56c9dd49490b9c31a92f2be6483ee1be3e911f43d74826c0744"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SNN6XUPNKLYLKXGLRQ3IFLSEXJ/bundle.json","state_url":"https://pith.science/pith/SNN6XUPNKLYLKXGLRQ3IFLSEXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SNN6XUPNKLYLKXGLRQ3IFLSEXJ/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-21T23:41:36Z","links":{"resolver":"https://pith.science/pith/SNN6XUPNKLYLKXGLRQ3IFLSEXJ","bundle":"https://pith.science/pith/SNN6XUPNKLYLKXGLRQ3IFLSEXJ/bundle.json","state":"https://pith.science/pith/SNN6XUPNKLYLKXGLRQ3IFLSEXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SNN6XUPNKLYLKXGLRQ3IFLSEXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SNN6XUPNKLYLKXGLRQ3IFLSEXJ","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":"1cba65d0c7fb8c974563c6adfe9ddbf95cdadfff83f18d93da4c76a2cdf9dd58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-16T14:55:47Z","title_canon_sha256":"1c58c46ddd357871482944cf9cf2a9a4ea2a279039042fb7ead176583917e5ba"},"schema_version":"1.0","source":{"id":"1501.04001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04001","created_at":"2026-05-18T02:29:16Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04001v1","created_at":"2026-05-18T02:29:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04001","created_at":"2026-05-18T02:29:16Z"},{"alias_kind":"pith_short_12","alias_value":"SNN6XUPNKLYL","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SNN6XUPNKLYLKXGL","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SNN6XUPN","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:d87774238d68a56c9dd49490b9c31a92f2be6483ee1be3e911f43d74826c0744","target":"graph","created_at":"2026-05-18T02:29:16Z","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 pattern x of length m and a text y of length n, both over an ordered alphabet, the order-preserving pattern matching problem consists in finding all substrings of the text with the same relative order as the pattern. It is an approximate variant of the well known exact pattern matching problem which has gained attention in recent years. This interesting problem finds applications in a lot of fields as time series analysis, like share prices on stock markets, weather data analysis or to musical melody matching. In this paper we present two new filtering approaches which turn out to be m","authors_text":"O\\u{g}uzhan K\\\"ulekci, Simone Faro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-16T14:55:47Z","title":"Efficient Algorithms for the Order Preserving Pattern Matching Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04001","kind":"arxiv","version":1},"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:2d7790cc34aecd02c35cef8c17a095a584af1aab266230856638b474e9f93e98","target":"record","created_at":"2026-05-18T02:29:16Z","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":"1cba65d0c7fb8c974563c6adfe9ddbf95cdadfff83f18d93da4c76a2cdf9dd58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-16T14:55:47Z","title_canon_sha256":"1c58c46ddd357871482944cf9cf2a9a4ea2a279039042fb7ead176583917e5ba"},"schema_version":"1.0","source":{"id":"1501.04001","kind":"arxiv","version":1}},"canonical_sha256":"935bebd1ed52f0b55ccb8c3682ae44ba4f484049ef05059f0487aadf97abdc39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"935bebd1ed52f0b55ccb8c3682ae44ba4f484049ef05059f0487aadf97abdc39","first_computed_at":"2026-05-18T02:29:16.527030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:16.527030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y6+kDmMORNHOuhMHZdNb++SDbhryzQ15v2q22SGabPLIBPazR3kuOo7bZhZNcDHXhancTyovsq99XxFtB1jJAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:16.527419Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.04001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d7790cc34aecd02c35cef8c17a095a584af1aab266230856638b474e9f93e98","sha256:d87774238d68a56c9dd49490b9c31a92f2be6483ee1be3e911f43d74826c0744"],"state_sha256":"4be2444ebf6a52cd8ad455a3ee88eecdb05f9e418d8affe490df4c5c3ff38093"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/PRRB67bYf1LMpoXxGiTvfmy+lFlK4Ct4HVP7W53oBzwZJyJnBbIbO+yUwReXSFIeU55tzeVTgXMjNOVYBYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:41:36.572010Z","bundle_sha256":"ba02b591d6b194d443b27f694ecfb98924f69a9c98d7db3bd5ec28b8551f23b4"}}