{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JJ6ME47DSTQF23YVAR4Z4WQYDP","short_pith_number":"pith:JJ6ME47D","canonical_record":{"source":{"id":"1412.1254","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-03T10:02:47Z","cross_cats_sorted":[],"title_canon_sha256":"6e8c2e1005cca2fe2a1187c2f6b546f909af5ebd80b938a9f85777e24410a8ce","abstract_canon_sha256":"9943b67729c068f0b289335ebbe67fe5f22c81f5bda1634abcf918d9a4bf72a7"},"schema_version":"1.0"},"canonical_sha256":"4a7cc273e394e05d6f1504799e5a181bc2f6d878313f2e6e4a6ac76adc18266f","source":{"kind":"arxiv","id":"1412.1254","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1254","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1254v3","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1254","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"JJ6ME47DSTQF","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JJ6ME47DSTQF23YV","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JJ6ME47D","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JJ6ME47DSTQF23YVAR4Z4WQYDP","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1254","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-03T10:02:47Z","cross_cats_sorted":[],"title_canon_sha256":"6e8c2e1005cca2fe2a1187c2f6b546f909af5ebd80b938a9f85777e24410a8ce","abstract_canon_sha256":"9943b67729c068f0b289335ebbe67fe5f22c81f5bda1634abcf918d9a4bf72a7"},"schema_version":"1.0"},"canonical_sha256":"4a7cc273e394e05d6f1504799e5a181bc2f6d878313f2e6e4a6ac76adc18266f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:07.668569Z","signature_b64":"Soyg35Fv0CsVUcXukdNJvvJi44CZuIP9ja13PZtaWH2+AV6Ex0jiLdBpFedfHmxb6yKQ6VTlD9ukM7TIX2t7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a7cc273e394e05d6f1504799e5a181bc2f6d878313f2e6e4a6ac76adc18266f","last_reissued_at":"2026-05-18T01:37:07.668000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:07.668000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1254","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-18T01:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jtTlsVqNNSq0rF7tClvdg7RYq+2u2cPgYkb1dWzqCFSS0hs1MEdZ+vM0IyM4MXc/5TEpvMX3CtaZESEKwRe6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:50:36.167048Z"},"content_sha256":"bdaced6940276aaa40db269ced0e89c5fde0db1914ed53a4c677c5b06b8a86ba","schema_version":"1.0","event_id":"sha256:bdaced6940276aaa40db269ced0e89c5fde0db1914ed53a4c677c5b06b8a86ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JJ6ME47DSTQF23YVAR4Z4WQYDP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Longest Common Extensions in Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gad M. Landau, Inge Li Goertz, Oren Weimann, Pawel Gawrychowski, Philip Bille","submitted_at":"2014-12-03T10:02:47Z","abstract_excerpt":"The longest common extension (LCE) of two indices in a string is the length of the longest identical substrings starting at these two indices. The LCE problem asks to preprocess a string into a compact data structure that supports fast LCE queries. In this paper we generalize the LCE problem to trees and suggest a few applications of LCE in trees to tries and XML databases. Given a labeled and rooted tree $T$ of size $n$, the goal is to preprocess $T$ into a compact data structure that support the following LCE queries between subpaths and subtrees in $T$. Let $v_1$, $v_2$, $w_1$, and $w_2$ be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1254","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-18T01:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWw98/4H+rRW/mpFz0/mOdgLkpvNHswEC2oxeG11QH30lkj/rs//GEK9zMyBT6fE9pFzYZBsr2rdDSSU4fDvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:50:36.167771Z"},"content_sha256":"c9df95b62e9437dd85a51d88483810e939359c8a012796c0b912cc8b023438b6","schema_version":"1.0","event_id":"sha256:c9df95b62e9437dd85a51d88483810e939359c8a012796c0b912cc8b023438b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJ6ME47DSTQF23YVAR4Z4WQYDP/bundle.json","state_url":"https://pith.science/pith/JJ6ME47DSTQF23YVAR4Z4WQYDP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJ6ME47DSTQF23YVAR4Z4WQYDP/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-05-26T00:50:36Z","links":{"resolver":"https://pith.science/pith/JJ6ME47DSTQF23YVAR4Z4WQYDP","bundle":"https://pith.science/pith/JJ6ME47DSTQF23YVAR4Z4WQYDP/bundle.json","state":"https://pith.science/pith/JJ6ME47DSTQF23YVAR4Z4WQYDP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJ6ME47DSTQF23YVAR4Z4WQYDP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JJ6ME47DSTQF23YVAR4Z4WQYDP","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":"9943b67729c068f0b289335ebbe67fe5f22c81f5bda1634abcf918d9a4bf72a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-03T10:02:47Z","title_canon_sha256":"6e8c2e1005cca2fe2a1187c2f6b546f909af5ebd80b938a9f85777e24410a8ce"},"schema_version":"1.0","source":{"id":"1412.1254","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1254","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1254v3","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1254","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"JJ6ME47DSTQF","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JJ6ME47DSTQF23YV","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JJ6ME47D","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:c9df95b62e9437dd85a51d88483810e939359c8a012796c0b912cc8b023438b6","target":"graph","created_at":"2026-05-18T01:37:07Z","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":"The longest common extension (LCE) of two indices in a string is the length of the longest identical substrings starting at these two indices. The LCE problem asks to preprocess a string into a compact data structure that supports fast LCE queries. In this paper we generalize the LCE problem to trees and suggest a few applications of LCE in trees to tries and XML databases. Given a labeled and rooted tree $T$ of size $n$, the goal is to preprocess $T$ into a compact data structure that support the following LCE queries between subpaths and subtrees in $T$. Let $v_1$, $v_2$, $w_1$, and $w_2$ be","authors_text":"Gad M. Landau, Inge Li Goertz, Oren Weimann, Pawel Gawrychowski, Philip Bille","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-03T10:02:47Z","title":"Longest Common Extensions in Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1254","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:bdaced6940276aaa40db269ced0e89c5fde0db1914ed53a4c677c5b06b8a86ba","target":"record","created_at":"2026-05-18T01:37:07Z","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":"9943b67729c068f0b289335ebbe67fe5f22c81f5bda1634abcf918d9a4bf72a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-03T10:02:47Z","title_canon_sha256":"6e8c2e1005cca2fe2a1187c2f6b546f909af5ebd80b938a9f85777e24410a8ce"},"schema_version":"1.0","source":{"id":"1412.1254","kind":"arxiv","version":3}},"canonical_sha256":"4a7cc273e394e05d6f1504799e5a181bc2f6d878313f2e6e4a6ac76adc18266f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a7cc273e394e05d6f1504799e5a181bc2f6d878313f2e6e4a6ac76adc18266f","first_computed_at":"2026-05-18T01:37:07.668000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:07.668000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Soyg35Fv0CsVUcXukdNJvvJi44CZuIP9ja13PZtaWH2+AV6Ex0jiLdBpFedfHmxb6yKQ6VTlD9ukM7TIX2t7DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:07.668569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1254","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdaced6940276aaa40db269ced0e89c5fde0db1914ed53a4c677c5b06b8a86ba","sha256:c9df95b62e9437dd85a51d88483810e939359c8a012796c0b912cc8b023438b6"],"state_sha256":"c08bb6b4e8b38e866a29b9097c7c2234816675f887e09b398e018fb96306e7ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eYKkwCXMzChQxnV2xSlzQQIx228UeANTW8797ZztFaXk3aY/PKpSl6ptDULUd/yytsDPE3TJN2KWo/QnaCCmAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:50:36.171780Z","bundle_sha256":"e6349bf39a5041cf6a64f1bc12b70490bf3ce614de3ca2e4c5eb5a11a1d45dba"}}