{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4I5SW6CQBF25USGJXWIC6TGUAE","short_pith_number":"pith:4I5SW6CQ","schema_version":"1.0","canonical_sha256":"e23b2b78500975da48c9bd902f4cd4011c73fe650d2abe4b948389a991a8be68","source":{"kind":"arxiv","id":"1702.07458","version":1},"attestation_state":"computed","paper":{"title":"Small-space encoding LCE data structure with constant-time queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Takaaki Nishimoto, Yuka Tanimura","submitted_at":"2017-02-24T03:57:57Z","abstract_excerpt":"The \\emph{longest common extension} (\\emph{LCE}) problem is to preprocess a given string $w$ of length $n$ so that the length of the longest common prefix between suffixes of $w$ that start at any two given positions is answered quickly. In this paper, we present a data structure of $O(z \\tau^2 + \\frac{n}{\\tau})$ words of space which answers LCE queries in $O(1)$ time and can be built in $O(n \\log \\sigma)$ time, where $1 \\leq \\tau \\leq \\sqrt{n}$ is a parameter, $z$ is the size of the Lempel-Ziv 77 factorization of $w$ and $\\sigma$ is the alphabet size. This is an \\emph{encoding} data structure"},"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":"1702.07458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T03:57:57Z","cross_cats_sorted":[],"title_canon_sha256":"1522a5a46050c2df99ce7225142e4cbd19ca56f870e6c27f2144bca0ed7a571b","abstract_canon_sha256":"5111db72de7061b00ef46931d287ae83a5b97eb26ec57b25e43bddcc46e33242"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:03.274009Z","signature_b64":"oKJD0uFFEQ2BGbZAhVna7O2LWVwVUmjgJAZPidbQcNTJ7pQIMBGYUjsMaWTe3HgaR77Z1prhcboaYvqXmRA4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e23b2b78500975da48c9bd902f4cd4011c73fe650d2abe4b948389a991a8be68","last_reissued_at":"2026-05-18T00:50:03.273503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:03.273503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small-space encoding LCE data structure with constant-time queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Takaaki Nishimoto, Yuka Tanimura","submitted_at":"2017-02-24T03:57:57Z","abstract_excerpt":"The \\emph{longest common extension} (\\emph{LCE}) problem is to preprocess a given string $w$ of length $n$ so that the length of the longest common prefix between suffixes of $w$ that start at any two given positions is answered quickly. In this paper, we present a data structure of $O(z \\tau^2 + \\frac{n}{\\tau})$ words of space which answers LCE queries in $O(1)$ time and can be built in $O(n \\log \\sigma)$ time, where $1 \\leq \\tau \\leq \\sqrt{n}$ is a parameter, $z$ is the size of the Lempel-Ziv 77 factorization of $w$ and $\\sigma$ is the alphabet size. This is an \\emph{encoding} data structure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07458","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":"1702.07458","created_at":"2026-05-18T00:50:03.273582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07458v1","created_at":"2026-05-18T00:50:03.273582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07458","created_at":"2026-05-18T00:50:03.273582+00:00"},{"alias_kind":"pith_short_12","alias_value":"4I5SW6CQBF25","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4I5SW6CQBF25USGJ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4I5SW6CQ","created_at":"2026-05-18T12:30:58.224056+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/4I5SW6CQBF25USGJXWIC6TGUAE","json":"https://pith.science/pith/4I5SW6CQBF25USGJXWIC6TGUAE.json","graph_json":"https://pith.science/api/pith-number/4I5SW6CQBF25USGJXWIC6TGUAE/graph.json","events_json":"https://pith.science/api/pith-number/4I5SW6CQBF25USGJXWIC6TGUAE/events.json","paper":"https://pith.science/paper/4I5SW6CQ"},"agent_actions":{"view_html":"https://pith.science/pith/4I5SW6CQBF25USGJXWIC6TGUAE","download_json":"https://pith.science/pith/4I5SW6CQBF25USGJXWIC6TGUAE.json","view_paper":"https://pith.science/paper/4I5SW6CQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07458&json=true","fetch_graph":"https://pith.science/api/pith-number/4I5SW6CQBF25USGJXWIC6TGUAE/graph.json","fetch_events":"https://pith.science/api/pith-number/4I5SW6CQBF25USGJXWIC6TGUAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4I5SW6CQBF25USGJXWIC6TGUAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4I5SW6CQBF25USGJXWIC6TGUAE/action/storage_attestation","attest_author":"https://pith.science/pith/4I5SW6CQBF25USGJXWIC6TGUAE/action/author_attestation","sign_citation":"https://pith.science/pith/4I5SW6CQBF25USGJXWIC6TGUAE/action/citation_signature","submit_replication":"https://pith.science/pith/4I5SW6CQBF25USGJXWIC6TGUAE/action/replication_record"}},"created_at":"2026-05-18T00:50:03.273582+00:00","updated_at":"2026-05-18T00:50:03.273582+00:00"}