{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZXKIUT5XXQKTJBOS453G7WXC5L","short_pith_number":"pith:ZXKIUT5X","schema_version":"1.0","canonical_sha256":"cdd48a4fb7bc153485d2e7766fdae2ead188ff6a284c7407b7fe44e58f220102","source":{"kind":"arxiv","id":"1601.07670","version":2},"attestation_state":"computed","paper":{"title":"Deterministic sub-linear space LCE data structures with efficient construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Simon J. Puglisi, Tomohiro I, Yuka Tanimura","submitted_at":"2016-01-28T07:14:19Z","abstract_excerpt":"Given a string $S$ of $n$ symbols, a longest common extension query $\\mathsf{LCE}(i,j)$ asks for the length of the longest common prefix of the $i$th and $j$th suffixes of $S$. LCE queries have several important applications in string processing, perhaps most notably to suffix sorting. Recently, Bille et al. (J. Discrete Algorithms 25:42-50, 2014, Proc. CPM 2015: 65-76) described several data structures for answering LCE queries that offers a space-time trade-off between data structure size and query time. In particular, for a parameter $1 \\leq \\tau \\leq n$, their best deterministic solution i"},"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":"1601.07670","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-28T07:14:19Z","cross_cats_sorted":[],"title_canon_sha256":"de54f5d0e8e37dd4ac6a7045bc82255f5e0ea581c8aad907b46b7738f6fccddd","abstract_canon_sha256":"91ca8070628a2deecc82cb38f561e391c2224dd86c09cd692858a108a949fe35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:41.534593Z","signature_b64":"2ZdHLDaZRx0uQqMWEMb98uhfXFm8JeMtxANE/RFhBTPOxr6/dUvCKsCTRJf+bq5xxc0SG8S6Tp7fsH1X+DF1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdd48a4fb7bc153485d2e7766fdae2ead188ff6a284c7407b7fe44e58f220102","last_reissued_at":"2026-05-18T01:21:41.533965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:41.533965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic sub-linear space LCE data structures with efficient construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Simon J. Puglisi, Tomohiro I, Yuka Tanimura","submitted_at":"2016-01-28T07:14:19Z","abstract_excerpt":"Given a string $S$ of $n$ symbols, a longest common extension query $\\mathsf{LCE}(i,j)$ asks for the length of the longest common prefix of the $i$th and $j$th suffixes of $S$. LCE queries have several important applications in string processing, perhaps most notably to suffix sorting. Recently, Bille et al. (J. Discrete Algorithms 25:42-50, 2014, Proc. CPM 2015: 65-76) described several data structures for answering LCE queries that offers a space-time trade-off between data structure size and query time. In particular, for a parameter $1 \\leq \\tau \\leq n$, their best deterministic solution i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07670","kind":"arxiv","version":2},"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":"1601.07670","created_at":"2026-05-18T01:21:41.534059+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07670v2","created_at":"2026-05-18T01:21:41.534059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07670","created_at":"2026-05-18T01:21:41.534059+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXKIUT5XXQKT","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXKIUT5XXQKTJBOS","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXKIUT5X","created_at":"2026-05-18T12:30:55.937587+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/ZXKIUT5XXQKTJBOS453G7WXC5L","json":"https://pith.science/pith/ZXKIUT5XXQKTJBOS453G7WXC5L.json","graph_json":"https://pith.science/api/pith-number/ZXKIUT5XXQKTJBOS453G7WXC5L/graph.json","events_json":"https://pith.science/api/pith-number/ZXKIUT5XXQKTJBOS453G7WXC5L/events.json","paper":"https://pith.science/paper/ZXKIUT5X"},"agent_actions":{"view_html":"https://pith.science/pith/ZXKIUT5XXQKTJBOS453G7WXC5L","download_json":"https://pith.science/pith/ZXKIUT5XXQKTJBOS453G7WXC5L.json","view_paper":"https://pith.science/paper/ZXKIUT5X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07670&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXKIUT5XXQKTJBOS453G7WXC5L/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXKIUT5XXQKTJBOS453G7WXC5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXKIUT5XXQKTJBOS453G7WXC5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXKIUT5XXQKTJBOS453G7WXC5L/action/storage_attestation","attest_author":"https://pith.science/pith/ZXKIUT5XXQKTJBOS453G7WXC5L/action/author_attestation","sign_citation":"https://pith.science/pith/ZXKIUT5XXQKTJBOS453G7WXC5L/action/citation_signature","submit_replication":"https://pith.science/pith/ZXKIUT5XXQKTJBOS453G7WXC5L/action/replication_record"}},"created_at":"2026-05-18T01:21:41.534059+00:00","updated_at":"2026-05-18T01:21:41.534059+00:00"}