{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CLWMSIL5P723QNTOL2M7BDQG2I","short_pith_number":"pith:CLWMSIL5","canonical_record":{"source":{"id":"1504.02671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-10T13:23:27Z","cross_cats_sorted":[],"title_canon_sha256":"a5f1fa3b9ffd53534398ee01493ba7787ec163a1de63d19b9e1abf0a6b53da9f","abstract_canon_sha256":"5d5af80d09ef7addc2b8d241e984749c6475439dba294706750cd32cc273ecf4"},"schema_version":"1.0"},"canonical_sha256":"12ecc9217d7ff5b8366e5e99f08e06d22d7e4bc02fa1d7dc63c4e5e84f814292","source":{"kind":"arxiv","id":"1504.02671","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02671","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02671v1","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02671","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"CLWMSIL5P723","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CLWMSIL5P723QNTO","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CLWMSIL5","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CLWMSIL5P723QNTOL2M7BDQG2I","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-10T13:23:27Z","cross_cats_sorted":[],"title_canon_sha256":"a5f1fa3b9ffd53534398ee01493ba7787ec163a1de63d19b9e1abf0a6b53da9f","abstract_canon_sha256":"5d5af80d09ef7addc2b8d241e984749c6475439dba294706750cd32cc273ecf4"},"schema_version":"1.0"},"canonical_sha256":"12ecc9217d7ff5b8366e5e99f08e06d22d7e4bc02fa1d7dc63c4e5e84f814292","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:06.897276Z","signature_b64":"cet4tGOXlrWV1hE9vpYP5FAN5PSQQx2g+nyh6/PRy/pot0Du1PVdRHq/e0wEg7M1V6jkpJf50IX4ZMMGd7F6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12ecc9217d7ff5b8366e5e99f08e06d22d7e4bc02fa1d7dc63c4e5e84f814292","last_reissued_at":"2026-05-18T02:19:06.896781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:06.896781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02671","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:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iWoG27YVCjO1H6yqmpQ/NY1mLJJ+9+DZrfRmbZuWreC5cMXnp3r79TpxxXQu/r9r7Y2dpZ/CTw3vHXqXu9eKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:51:59.336680Z"},"content_sha256":"511548633a67eb1e311f0e7f2188fe86fe2e39bf7ffcc6b327040eb55ce8a35c","schema_version":"1.0","event_id":"sha256:511548633a67eb1e311f0e7f2188fe86fe2e39bf7ffcc6b327040eb55ce8a35c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CLWMSIL5P723QNTOL2M7BDQG2I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Longest Common Extensions in Sublinear Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hjalte Wedel Vildh{\\o}j, Inge Li G{\\o}rtz, Mathias B{\\ae}k Tejs Knudsen, Moshe Lewenstein, Philip Bille","submitted_at":"2015-04-10T13:23:27Z","abstract_excerpt":"The longest common extension problem (LCE problem) is to construct a data structure for an input string $T$ of length $n$ that supports LCE$(i,j)$ queries. Such a query returns the length of the longest common prefix of the suffixes starting at positions $i$ and $j$ in $T$. This classic problem has a well-known solution that uses $O(n)$ space and $O(1)$ query time. In this paper we show that for any trade-off parameter $1 \\leq \\tau \\leq n$, the problem can be solved in $O(\\frac{n}{\\tau})$ space and $O(\\tau)$ query time. This significantly improves the previously best known time-space trade-off"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02671","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:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJ/XsOrf4HO1O2wbOBcgB9kBviMBZPbt6iS4syk2I69JMXe554n1MzDeZcP5cxvzvsC0kxFRFD4gVSsfeqM/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:51:59.337449Z"},"content_sha256":"e8bd4a3bc9edabdbe9ea545e6a50c4020153febdf4f5483dfe258aff4315d347","schema_version":"1.0","event_id":"sha256:e8bd4a3bc9edabdbe9ea545e6a50c4020153febdf4f5483dfe258aff4315d347"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLWMSIL5P723QNTOL2M7BDQG2I/bundle.json","state_url":"https://pith.science/pith/CLWMSIL5P723QNTOL2M7BDQG2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLWMSIL5P723QNTOL2M7BDQG2I/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-11T07:51:59Z","links":{"resolver":"https://pith.science/pith/CLWMSIL5P723QNTOL2M7BDQG2I","bundle":"https://pith.science/pith/CLWMSIL5P723QNTOL2M7BDQG2I/bundle.json","state":"https://pith.science/pith/CLWMSIL5P723QNTOL2M7BDQG2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLWMSIL5P723QNTOL2M7BDQG2I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CLWMSIL5P723QNTOL2M7BDQG2I","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":"5d5af80d09ef7addc2b8d241e984749c6475439dba294706750cd32cc273ecf4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-10T13:23:27Z","title_canon_sha256":"a5f1fa3b9ffd53534398ee01493ba7787ec163a1de63d19b9e1abf0a6b53da9f"},"schema_version":"1.0","source":{"id":"1504.02671","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02671","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02671v1","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02671","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"CLWMSIL5P723","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CLWMSIL5P723QNTO","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CLWMSIL5","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:e8bd4a3bc9edabdbe9ea545e6a50c4020153febdf4f5483dfe258aff4315d347","target":"graph","created_at":"2026-05-18T02:19:06Z","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 problem (LCE problem) is to construct a data structure for an input string $T$ of length $n$ that supports LCE$(i,j)$ queries. Such a query returns the length of the longest common prefix of the suffixes starting at positions $i$ and $j$ in $T$. This classic problem has a well-known solution that uses $O(n)$ space and $O(1)$ query time. In this paper we show that for any trade-off parameter $1 \\leq \\tau \\leq n$, the problem can be solved in $O(\\frac{n}{\\tau})$ space and $O(\\tau)$ query time. This significantly improves the previously best known time-space trade-off","authors_text":"Hjalte Wedel Vildh{\\o}j, Inge Li G{\\o}rtz, Mathias B{\\ae}k Tejs Knudsen, Moshe Lewenstein, Philip Bille","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-10T13:23:27Z","title":"Longest Common Extensions in Sublinear Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02671","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:511548633a67eb1e311f0e7f2188fe86fe2e39bf7ffcc6b327040eb55ce8a35c","target":"record","created_at":"2026-05-18T02:19:06Z","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":"5d5af80d09ef7addc2b8d241e984749c6475439dba294706750cd32cc273ecf4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-10T13:23:27Z","title_canon_sha256":"a5f1fa3b9ffd53534398ee01493ba7787ec163a1de63d19b9e1abf0a6b53da9f"},"schema_version":"1.0","source":{"id":"1504.02671","kind":"arxiv","version":1}},"canonical_sha256":"12ecc9217d7ff5b8366e5e99f08e06d22d7e4bc02fa1d7dc63c4e5e84f814292","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12ecc9217d7ff5b8366e5e99f08e06d22d7e4bc02fa1d7dc63c4e5e84f814292","first_computed_at":"2026-05-18T02:19:06.896781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:06.896781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cet4tGOXlrWV1hE9vpYP5FAN5PSQQx2g+nyh6/PRy/pot0Du1PVdRHq/e0wEg7M1V6jkpJf50IX4ZMMGd7F6CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:06.897276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02671","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:511548633a67eb1e311f0e7f2188fe86fe2e39bf7ffcc6b327040eb55ce8a35c","sha256:e8bd4a3bc9edabdbe9ea545e6a50c4020153febdf4f5483dfe258aff4315d347"],"state_sha256":"473287c4920848036139551277bac21f655dbd503d5ebd39748ea3286abfd954"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LhmIN3n2PP6spELgOTPpZMCMVPmUkIn8bk0ieu+KkICycMMFPehQtV3qEMFXKFqKeZc8H9NriHY/CkoTfpocDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:51:59.342051Z","bundle_sha256":"27bbb6e259655ba2ba6f31f835de487a02b173ea652d43b97f5d06eb4af0d4dc"}}