{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CLWMSIL5P723QNTOL2M7BDQG2I","short_pith_number":"pith:CLWMSIL5","schema_version":"1.0","canonical_sha256":"12ecc9217d7ff5b8366e5e99f08e06d22d7e4bc02fa1d7dc63c4e5e84f814292","source":{"kind":"arxiv","id":"1504.02671","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.02671","created_at":"2026-05-18T02:19:06.896874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02671v1","created_at":"2026-05-18T02:19:06.896874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02671","created_at":"2026-05-18T02:19:06.896874+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLWMSIL5P723","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLWMSIL5P723QNTO","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLWMSIL5","created_at":"2026-05-18T12:29:17.054201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CLWMSIL5P723QNTOL2M7BDQG2I","json":"https://pith.science/pith/CLWMSIL5P723QNTOL2M7BDQG2I.json","graph_json":"https://pith.science/api/pith-number/CLWMSIL5P723QNTOL2M7BDQG2I/graph.json","events_json":"https://pith.science/api/pith-number/CLWMSIL5P723QNTOL2M7BDQG2I/events.json","paper":"https://pith.science/paper/CLWMSIL5"},"agent_actions":{"view_html":"https://pith.science/pith/CLWMSIL5P723QNTOL2M7BDQG2I","download_json":"https://pith.science/pith/CLWMSIL5P723QNTOL2M7BDQG2I.json","view_paper":"https://pith.science/paper/CLWMSIL5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02671&json=true","fetch_graph":"https://pith.science/api/pith-number/CLWMSIL5P723QNTOL2M7BDQG2I/graph.json","fetch_events":"https://pith.science/api/pith-number/CLWMSIL5P723QNTOL2M7BDQG2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLWMSIL5P723QNTOL2M7BDQG2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLWMSIL5P723QNTOL2M7BDQG2I/action/storage_attestation","attest_author":"https://pith.science/pith/CLWMSIL5P723QNTOL2M7BDQG2I/action/author_attestation","sign_citation":"https://pith.science/pith/CLWMSIL5P723QNTOL2M7BDQG2I/action/citation_signature","submit_replication":"https://pith.science/pith/CLWMSIL5P723QNTOL2M7BDQG2I/action/replication_record"}},"created_at":"2026-05-18T02:19:06.896874+00:00","updated_at":"2026-05-18T02:19:06.896874+00:00"}