{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:O6IGIIUCN2COZ5ARRXMZR4XDDP","short_pith_number":"pith:O6IGIIUC","canonical_record":{"source":{"id":"1509.06167","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-21T10:02:39Z","cross_cats_sorted":[],"title_canon_sha256":"a96a32c7f9fdd0e0b4a502f00cd2f59aed3289061324b0d8c79e58b610071607","abstract_canon_sha256":"8c4ee265f1ee7e60b157dc46b1194b45db91f4238ce5c39ee858840997eefe82"},"schema_version":"1.0"},"canonical_sha256":"77906422826e84ecf4118dd998f2e31bfd6c3b9058a08c3d59f956d4446b2b80","source":{"kind":"arxiv","id":"1509.06167","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06167","created_at":"2026-05-18T01:31:52Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06167v2","created_at":"2026-05-18T01:31:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06167","created_at":"2026-05-18T01:31:52Z"},{"alias_kind":"pith_short_12","alias_value":"O6IGIIUCN2CO","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O6IGIIUCN2COZ5AR","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O6IGIIUC","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:O6IGIIUCN2COZ5ARRXMZR4XDDP","target":"record","payload":{"canonical_record":{"source":{"id":"1509.06167","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-21T10:02:39Z","cross_cats_sorted":[],"title_canon_sha256":"a96a32c7f9fdd0e0b4a502f00cd2f59aed3289061324b0d8c79e58b610071607","abstract_canon_sha256":"8c4ee265f1ee7e60b157dc46b1194b45db91f4238ce5c39ee858840997eefe82"},"schema_version":"1.0"},"canonical_sha256":"77906422826e84ecf4118dd998f2e31bfd6c3b9058a08c3d59f956d4446b2b80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:52.620930Z","signature_b64":"cWeLGicNBzReR/AhEjcGuHkMZyWXapcT+GqHdoJiyo4qeysiI9pb6B6K9BwnnQ1ppN/el+Bw4GA5TOkg8eSTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77906422826e84ecf4118dd998f2e31bfd6c3b9058a08c3d59f956d4446b2b80","last_reissued_at":"2026-05-18T01:31:52.620360Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:52.620360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.06167","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-18T01:31:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kehWBVy+7TwztZO8jjvwKxZs1muMOOU8OE2Gb5ztXQIy0CtXSOoxO8QoCJRQsEKfPwuGla32ZVtpLyA7n8+RDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:50:09.191681Z"},"content_sha256":"2aa08621727c68536d1001809eee8d4948488b6bb8a673face119659f4914f52","schema_version":"1.0","event_id":"sha256:2aa08621727c68536d1001809eee8d4948488b6bb8a673face119659f4914f52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:O6IGIIUCN2COZ5ARRXMZR4XDDP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Query in the Suffix Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrej Brodnik, Matev\\v{z} Jekovec","submitted_at":"2015-09-21T10:02:39Z","abstract_excerpt":"Given the query string of length $m$, we explore a parallel query in a static suffix tree based data structure for $p \\ll n$, where $p$ is the number of processors and $n$ is the length of the text. We present three results on CREW PRAM. The parallel query in the suffix trie requires $O(m + p)$ work, $O(m/p + \\lg p)$ time and $O(n^2)$ space in the worst case. We extend the same technique to the suffix tree where we show it is, by design, inherently sequential in the worst case. Finally we perform the parallel query using an interleaved approach and achieve $O(m \\lg p)$ work, $O(\\frac{m}{p} \\lg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06167","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-18T01:31:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Ey6K9dZ3C4GQcyYkgPZTjtNedfjaVoFMtPXl7DEZU3wJ/DeYZte8Q+uFlIyTA2MAb2ieK7MzqHtC0bTEkGhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:50:09.192159Z"},"content_sha256":"fb90050d8d0188f95f33b464038ff2f835687460cab5f7d936fbf0b3d3e5fc64","schema_version":"1.0","event_id":"sha256:fb90050d8d0188f95f33b464038ff2f835687460cab5f7d936fbf0b3d3e5fc64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6IGIIUCN2COZ5ARRXMZR4XDDP/bundle.json","state_url":"https://pith.science/pith/O6IGIIUCN2COZ5ARRXMZR4XDDP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6IGIIUCN2COZ5ARRXMZR4XDDP/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-22T13:50:09Z","links":{"resolver":"https://pith.science/pith/O6IGIIUCN2COZ5ARRXMZR4XDDP","bundle":"https://pith.science/pith/O6IGIIUCN2COZ5ARRXMZR4XDDP/bundle.json","state":"https://pith.science/pith/O6IGIIUCN2COZ5ARRXMZR4XDDP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6IGIIUCN2COZ5ARRXMZR4XDDP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:O6IGIIUCN2COZ5ARRXMZR4XDDP","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":"8c4ee265f1ee7e60b157dc46b1194b45db91f4238ce5c39ee858840997eefe82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-21T10:02:39Z","title_canon_sha256":"a96a32c7f9fdd0e0b4a502f00cd2f59aed3289061324b0d8c79e58b610071607"},"schema_version":"1.0","source":{"id":"1509.06167","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06167","created_at":"2026-05-18T01:31:52Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06167v2","created_at":"2026-05-18T01:31:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06167","created_at":"2026-05-18T01:31:52Z"},{"alias_kind":"pith_short_12","alias_value":"O6IGIIUCN2CO","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O6IGIIUCN2COZ5AR","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O6IGIIUC","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:fb90050d8d0188f95f33b464038ff2f835687460cab5f7d936fbf0b3d3e5fc64","target":"graph","created_at":"2026-05-18T01:31:52Z","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 the query string of length $m$, we explore a parallel query in a static suffix tree based data structure for $p \\ll n$, where $p$ is the number of processors and $n$ is the length of the text. We present three results on CREW PRAM. The parallel query in the suffix trie requires $O(m + p)$ work, $O(m/p + \\lg p)$ time and $O(n^2)$ space in the worst case. We extend the same technique to the suffix tree where we show it is, by design, inherently sequential in the worst case. Finally we perform the parallel query using an interleaved approach and achieve $O(m \\lg p)$ work, $O(\\frac{m}{p} \\lg","authors_text":"Andrej Brodnik, Matev\\v{z} Jekovec","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-21T10:02:39Z","title":"Parallel Query in the Suffix Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06167","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:2aa08621727c68536d1001809eee8d4948488b6bb8a673face119659f4914f52","target":"record","created_at":"2026-05-18T01:31:52Z","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":"8c4ee265f1ee7e60b157dc46b1194b45db91f4238ce5c39ee858840997eefe82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-21T10:02:39Z","title_canon_sha256":"a96a32c7f9fdd0e0b4a502f00cd2f59aed3289061324b0d8c79e58b610071607"},"schema_version":"1.0","source":{"id":"1509.06167","kind":"arxiv","version":2}},"canonical_sha256":"77906422826e84ecf4118dd998f2e31bfd6c3b9058a08c3d59f956d4446b2b80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77906422826e84ecf4118dd998f2e31bfd6c3b9058a08c3d59f956d4446b2b80","first_computed_at":"2026-05-18T01:31:52.620360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:52.620360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cWeLGicNBzReR/AhEjcGuHkMZyWXapcT+GqHdoJiyo4qeysiI9pb6B6K9BwnnQ1ppN/el+Bw4GA5TOkg8eSTBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:52.620930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06167","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2aa08621727c68536d1001809eee8d4948488b6bb8a673face119659f4914f52","sha256:fb90050d8d0188f95f33b464038ff2f835687460cab5f7d936fbf0b3d3e5fc64"],"state_sha256":"fec210add61a4f9b2a32128d52b84b4687662134fa8db2fb274fd0982c388d1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lJl3az6sRWMw375Kg3I7enLVNCEvDB+xot4XMwhwkCzPMjSgwMqui7LzGzsEPoJhp/99wt1BfJ4yZnbz5e40CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:50:09.194140Z","bundle_sha256":"523df659f5ca0735323fa1a0c84214c8ed44663e3449eb28a05c2dba6dbc24b2"}}