{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NUHFCSKEH7PI4S76G6RHPLMDDO","short_pith_number":"pith:NUHFCSKE","canonical_record":{"source":{"id":"1303.6872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T16:13:03Z","cross_cats_sorted":[],"title_canon_sha256":"c8b8e6a6ddfdc6f27902b4c8d0fe63b93096380f716ed2587e3675da56e8430f","abstract_canon_sha256":"e2af106b16e51400861098d54087be4e1fbbb3034d191cf60ad0e1fb7cf1bae8"},"schema_version":"1.0"},"canonical_sha256":"6d0e5149443fde8e4bfe37a277ad831b80cb3117fe73d82da1665e5b37ef2496","source":{"kind":"arxiv","id":"1303.6872","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6872","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6872v1","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6872","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"NUHFCSKEH7PI","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NUHFCSKEH7PI4S76","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NUHFCSKE","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NUHFCSKEH7PI4S76G6RHPLMDDO","target":"record","payload":{"canonical_record":{"source":{"id":"1303.6872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T16:13:03Z","cross_cats_sorted":[],"title_canon_sha256":"c8b8e6a6ddfdc6f27902b4c8d0fe63b93096380f716ed2587e3675da56e8430f","abstract_canon_sha256":"e2af106b16e51400861098d54087be4e1fbbb3034d191cf60ad0e1fb7cf1bae8"},"schema_version":"1.0"},"canonical_sha256":"6d0e5149443fde8e4bfe37a277ad831b80cb3117fe73d82da1665e5b37ef2496","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:39.529372Z","signature_b64":"aC+cunaVEpEG8F9kG9d6d7FXt8+5mRgZ/PrTEwQJfSFXauqrbKK9d6NOFZ5pqsVfscKrU4ihA5Y0TZWOlPQvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d0e5149443fde8e4bfe37a277ad831b80cb3117fe73d82da1665e5b37ef2496","last_reissued_at":"2026-05-18T03:29:39.528754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:39.528754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.6872","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-18T03:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hOS1wD4aQv+TBSvUUyl1B5wW+7CQS89bPSqmXGIUfnF0g9ayXOyMEb0b0ivfQ5bO/NSwgA+GIgbTD8PHurOrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:48:12.392969Z"},"content_sha256":"9878bc37645b50dc51954aa7fd0050c0b2f3f6298344d5d2d4420081a643bab6","schema_version":"1.0","event_id":"sha256:9878bc37645b50dc51954aa7fd0050c0b2f3f6298344d5d2d4420081a643bab6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NUHFCSKEH7PI4S76G6RHPLMDDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Order-Preserving Suffix Trees and Their Algorithmic Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alessio Langiu, Costas S. Iliopoulos, Jakub Radoszewski, Marcin Kubica, Maxime Crochemore, Solon P. Pissis, Tomasz Kociumaka, Tomasz Walen, Wojciech Rytter","submitted_at":"2013-03-27T16:13:03Z","abstract_excerpt":"Recently Kubica et al. (Inf. Process. Let., 2013) and Kim et al. (submitted to Theor. Comp. Sci.) introduced order-preserving pattern matching. In this problem we are looking for consecutive substrings of the text that have the same \"shape\" as a given pattern. These results include a linear-time order-preserving pattern matching algorithm for polynomially-bounded alphabet and an extension of this result to pattern matching with multiple patterns. We make one step forward in the analysis and give an $O(\\frac{n\\log{n}}{\\log\\log{n}})$ time randomized algorithm constructing suffix trees in the ord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6872","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-18T03:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MEZvnPnXupIGMfJpUOUsAlpL/8im8oHCnuMgGO7UetqdnPptxXC/tngYaGo1fcvI38QiV4KP66d1W2nT5hQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:48:12.393340Z"},"content_sha256":"ddc3bce6c7b4ef3e18fec16e6a8cc771cdcbbc2d86e96c7e2dbd64428ac96b38","schema_version":"1.0","event_id":"sha256:ddc3bce6c7b4ef3e18fec16e6a8cc771cdcbbc2d86e96c7e2dbd64428ac96b38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NUHFCSKEH7PI4S76G6RHPLMDDO/bundle.json","state_url":"https://pith.science/pith/NUHFCSKEH7PI4S76G6RHPLMDDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NUHFCSKEH7PI4S76G6RHPLMDDO/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-24T07:48:12Z","links":{"resolver":"https://pith.science/pith/NUHFCSKEH7PI4S76G6RHPLMDDO","bundle":"https://pith.science/pith/NUHFCSKEH7PI4S76G6RHPLMDDO/bundle.json","state":"https://pith.science/pith/NUHFCSKEH7PI4S76G6RHPLMDDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NUHFCSKEH7PI4S76G6RHPLMDDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NUHFCSKEH7PI4S76G6RHPLMDDO","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":"e2af106b16e51400861098d54087be4e1fbbb3034d191cf60ad0e1fb7cf1bae8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T16:13:03Z","title_canon_sha256":"c8b8e6a6ddfdc6f27902b4c8d0fe63b93096380f716ed2587e3675da56e8430f"},"schema_version":"1.0","source":{"id":"1303.6872","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6872","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6872v1","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6872","created_at":"2026-05-18T03:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"NUHFCSKEH7PI","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NUHFCSKEH7PI4S76","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NUHFCSKE","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:ddc3bce6c7b4ef3e18fec16e6a8cc771cdcbbc2d86e96c7e2dbd64428ac96b38","target":"graph","created_at":"2026-05-18T03:29:39Z","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":"Recently Kubica et al. (Inf. Process. Let., 2013) and Kim et al. (submitted to Theor. Comp. Sci.) introduced order-preserving pattern matching. In this problem we are looking for consecutive substrings of the text that have the same \"shape\" as a given pattern. These results include a linear-time order-preserving pattern matching algorithm for polynomially-bounded alphabet and an extension of this result to pattern matching with multiple patterns. We make one step forward in the analysis and give an $O(\\frac{n\\log{n}}{\\log\\log{n}})$ time randomized algorithm constructing suffix trees in the ord","authors_text":"Alessio Langiu, Costas S. Iliopoulos, Jakub Radoszewski, Marcin Kubica, Maxime Crochemore, Solon P. Pissis, Tomasz Kociumaka, Tomasz Walen, Wojciech Rytter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T16:13:03Z","title":"Order-Preserving Suffix Trees and Their Algorithmic Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6872","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:9878bc37645b50dc51954aa7fd0050c0b2f3f6298344d5d2d4420081a643bab6","target":"record","created_at":"2026-05-18T03:29:39Z","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":"e2af106b16e51400861098d54087be4e1fbbb3034d191cf60ad0e1fb7cf1bae8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T16:13:03Z","title_canon_sha256":"c8b8e6a6ddfdc6f27902b4c8d0fe63b93096380f716ed2587e3675da56e8430f"},"schema_version":"1.0","source":{"id":"1303.6872","kind":"arxiv","version":1}},"canonical_sha256":"6d0e5149443fde8e4bfe37a277ad831b80cb3117fe73d82da1665e5b37ef2496","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d0e5149443fde8e4bfe37a277ad831b80cb3117fe73d82da1665e5b37ef2496","first_computed_at":"2026-05-18T03:29:39.528754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:39.528754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aC+cunaVEpEG8F9kG9d6d7FXt8+5mRgZ/PrTEwQJfSFXauqrbKK9d6NOFZ5pqsVfscKrU4ihA5Y0TZWOlPQvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:39.529372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6872","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9878bc37645b50dc51954aa7fd0050c0b2f3f6298344d5d2d4420081a643bab6","sha256:ddc3bce6c7b4ef3e18fec16e6a8cc771cdcbbc2d86e96c7e2dbd64428ac96b38"],"state_sha256":"d21f5eb5105f3b35144986b10b6808a0c32149d8018825e7933bb166d32f804e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ds5/zDEShnNLUssStzuI9EWjhDTG4TN3D+Lbk7gubnwtyC7AzEn7y9A8c1vZVyNawAhLSTQQrkJy89iXoNY9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:48:12.395284Z","bundle_sha256":"215d9ddd2f1f7bdc352ae506ba2ce1830b792015b56c01f043f8aa70db73fb71"}}