{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GKS3YQDJPFPSU2MZV6NGNW5XD2","short_pith_number":"pith:GKS3YQDJ","canonical_record":{"source":{"id":"1801.07449","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T09:25:19Z","cross_cats_sorted":[],"title_canon_sha256":"534da7bc5f237efe63f621598a041819a53c432e7962e16ddc28b209adc0092a","abstract_canon_sha256":"efcf4fa67d2e2121e84c993b89071e9f6a7a2f262bee628874fece18fb145378"},"schema_version":"1.0"},"canonical_sha256":"32a5bc4069795f2a6999af9a66dbb71eb9a238428d986574a21762075992efa6","source":{"kind":"arxiv","id":"1801.07449","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07449","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07449v3","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07449","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"pith_short_12","alias_value":"GKS3YQDJPFPS","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GKS3YQDJPFPSU2MZ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GKS3YQDJ","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GKS3YQDJPFPSU2MZV6NGNW5XD2","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07449","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T09:25:19Z","cross_cats_sorted":[],"title_canon_sha256":"534da7bc5f237efe63f621598a041819a53c432e7962e16ddc28b209adc0092a","abstract_canon_sha256":"efcf4fa67d2e2121e84c993b89071e9f6a7a2f262bee628874fece18fb145378"},"schema_version":"1.0"},"canonical_sha256":"32a5bc4069795f2a6999af9a66dbb71eb9a238428d986574a21762075992efa6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:25.214078Z","signature_b64":"8sXzOQKKXPQQsZok/+mBL7mYQIo645YIs5kE2uFp/NyVNSlq7/8nQdxPCbem5YKURqoWiK1jW5taUiHHXXpVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32a5bc4069795f2a6999af9a66dbb71eb9a238428d986574a21762075992efa6","last_reissued_at":"2026-05-18T00:06:25.213477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:25.213477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07449","source_version":3,"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-18T00:06:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5aFvEpt9xFnIfrEfbMdKpRgyrW8P9nvae1A4CpcflPmRNLF+sEtNR6kHsI5vYjsMvRjjw5ukydaeomUbNEgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:23:09.942898Z"},"content_sha256":"019bb3a36163384f0e402d4171b2615378f32a990abc3103a6c35476f35df9c9","schema_version":"1.0","event_id":"sha256:019bb3a36163384f0e402d4171b2615378f32a990abc3103a6c35476f35df9c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GKS3YQDJPFPSU2MZV6NGNW5XD2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sliding Suffix Tree using LCA","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":"2018-01-23T09:25:19Z","abstract_excerpt":"We consider a sliding window $W$ over a stream of characters from some alphabet of constant size. The user wants to perform deterministic substring matching on the current sliding window content and obtain positions of the matches. We present an indexed version of the sliding window using the suffix tree, the link tree and the lowest common ancestor. The data structure of size $\\Theta(|W|)$ has optimal time queries $\\Theta(m+occ)$ and amortized constant time updates, where $m$ is the length of the query string and $occ$ is the number of its occurrences."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07449","kind":"arxiv","version":3},"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-18T00:06:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RnFuXlTQSYqQrI+7BW3LAH23EB4kygcrmtivxfzE3ERksCpSe4L0RDJgwawOrhgXVa8oAfzNrKlBLTjkCfqhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:23:09.943240Z"},"content_sha256":"4d1378adf7d14908ffa3527c712efe45349b207d044a154fb51f4544a7797a56","schema_version":"1.0","event_id":"sha256:4d1378adf7d14908ffa3527c712efe45349b207d044a154fb51f4544a7797a56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKS3YQDJPFPSU2MZV6NGNW5XD2/bundle.json","state_url":"https://pith.science/pith/GKS3YQDJPFPSU2MZV6NGNW5XD2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKS3YQDJPFPSU2MZV6NGNW5XD2/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:23:09Z","links":{"resolver":"https://pith.science/pith/GKS3YQDJPFPSU2MZV6NGNW5XD2","bundle":"https://pith.science/pith/GKS3YQDJPFPSU2MZV6NGNW5XD2/bundle.json","state":"https://pith.science/pith/GKS3YQDJPFPSU2MZV6NGNW5XD2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKS3YQDJPFPSU2MZV6NGNW5XD2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GKS3YQDJPFPSU2MZV6NGNW5XD2","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":"efcf4fa67d2e2121e84c993b89071e9f6a7a2f262bee628874fece18fb145378","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T09:25:19Z","title_canon_sha256":"534da7bc5f237efe63f621598a041819a53c432e7962e16ddc28b209adc0092a"},"schema_version":"1.0","source":{"id":"1801.07449","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07449","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07449v3","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07449","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"pith_short_12","alias_value":"GKS3YQDJPFPS","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GKS3YQDJPFPSU2MZ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GKS3YQDJ","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:4d1378adf7d14908ffa3527c712efe45349b207d044a154fb51f4544a7797a56","target":"graph","created_at":"2026-05-18T00:06:25Z","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":"We consider a sliding window $W$ over a stream of characters from some alphabet of constant size. The user wants to perform deterministic substring matching on the current sliding window content and obtain positions of the matches. We present an indexed version of the sliding window using the suffix tree, the link tree and the lowest common ancestor. The data structure of size $\\Theta(|W|)$ has optimal time queries $\\Theta(m+occ)$ and amortized constant time updates, where $m$ is the length of the query string and $occ$ is the number of its occurrences.","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":"2018-01-23T09:25:19Z","title":"Sliding Suffix Tree using LCA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07449","kind":"arxiv","version":3},"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:019bb3a36163384f0e402d4171b2615378f32a990abc3103a6c35476f35df9c9","target":"record","created_at":"2026-05-18T00:06:25Z","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":"efcf4fa67d2e2121e84c993b89071e9f6a7a2f262bee628874fece18fb145378","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-23T09:25:19Z","title_canon_sha256":"534da7bc5f237efe63f621598a041819a53c432e7962e16ddc28b209adc0092a"},"schema_version":"1.0","source":{"id":"1801.07449","kind":"arxiv","version":3}},"canonical_sha256":"32a5bc4069795f2a6999af9a66dbb71eb9a238428d986574a21762075992efa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32a5bc4069795f2a6999af9a66dbb71eb9a238428d986574a21762075992efa6","first_computed_at":"2026-05-18T00:06:25.213477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:25.213477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8sXzOQKKXPQQsZok/+mBL7mYQIo645YIs5kE2uFp/NyVNSlq7/8nQdxPCbem5YKURqoWiK1jW5taUiHHXXpVAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:25.214078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07449","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:019bb3a36163384f0e402d4171b2615378f32a990abc3103a6c35476f35df9c9","sha256:4d1378adf7d14908ffa3527c712efe45349b207d044a154fb51f4544a7797a56"],"state_sha256":"d3df76a7cd050dca01149616617bb72a0c9632f92b426df6343bb43c34b402ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RAILTnDplzkqrXCUg/okJq3Lstw639/XoJNXA2Hqaq3NNTiTjiVQ59XJSenWLV0+D8rD6CZ/gBYvsS/7JhHzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:23:09.945169Z","bundle_sha256":"e52065c2efc936d1622bacc524ca4467c9444cd49f5e9d0323ea049db81dbd41"}}