{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:B7VW3MZ2MMO4UNUZQHOI2SXHKW","short_pith_number":"pith:B7VW3MZ2","schema_version":"1.0","canonical_sha256":"0feb6db33a631dca369981dc8d4ae755b6cadde5d13359fd2d2d23a223404622","source":{"kind":"arxiv","id":"1611.05359","version":2},"attestation_state":"computed","paper":{"title":"Longest Common Extensions with Recompression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tomohiro I","submitted_at":"2016-11-16T16:54:04Z","abstract_excerpt":"Given two positions $i$ and $j$ in a string $T$ of length $N$, a longest common extension (LCE) query asks for the length of the longest common prefix between suffixes beginning at $i$ and $j$. A compressed LCE data structure is a data structure that stores $T$ in a compressed form while supporting fast LCE queries. In this article we show that the recompression technique is a powerful tool for compressed LCE data structures. We present a new compressed LCE data structure of size $O(z \\lg (N/z))$ that supports LCE queries in $O(\\lg N)$ time, where $z$ is the size of Lempel-Ziv 77 factorization"},"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":"1611.05359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-16T16:54:04Z","cross_cats_sorted":[],"title_canon_sha256":"6371a5e48943b7a5209a6b1caac4eba42fe629a49b930ef144b1e8a40f46ede3","abstract_canon_sha256":"c1260f696efb6b948ce5b26eae90959121250c5727c4c92e15db88ba798f9694"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:36.939842Z","signature_b64":"jGDO0LYY+ecKgQCqfANlGkykuvI1kagI/EmDaeh2+lvkcexIh1mlSseCKR1f8GTKMTDNsEX6shLIBO9tsjnvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0feb6db33a631dca369981dc8d4ae755b6cadde5d13359fd2d2d23a223404622","last_reissued_at":"2026-05-18T00:57:36.939350Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:36.939350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Longest Common Extensions with Recompression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tomohiro I","submitted_at":"2016-11-16T16:54:04Z","abstract_excerpt":"Given two positions $i$ and $j$ in a string $T$ of length $N$, a longest common extension (LCE) query asks for the length of the longest common prefix between suffixes beginning at $i$ and $j$. A compressed LCE data structure is a data structure that stores $T$ in a compressed form while supporting fast LCE queries. In this article we show that the recompression technique is a powerful tool for compressed LCE data structures. We present a new compressed LCE data structure of size $O(z \\lg (N/z))$ that supports LCE queries in $O(\\lg N)$ time, where $z$ is the size of Lempel-Ziv 77 factorization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05359","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":"1611.05359","created_at":"2026-05-18T00:57:36.939434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05359v2","created_at":"2026-05-18T00:57:36.939434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05359","created_at":"2026-05-18T00:57:36.939434+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7VW3MZ2MMO4","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7VW3MZ2MMO4UNUZ","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7VW3MZ2","created_at":"2026-05-18T12:30:07.202191+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/B7VW3MZ2MMO4UNUZQHOI2SXHKW","json":"https://pith.science/pith/B7VW3MZ2MMO4UNUZQHOI2SXHKW.json","graph_json":"https://pith.science/api/pith-number/B7VW3MZ2MMO4UNUZQHOI2SXHKW/graph.json","events_json":"https://pith.science/api/pith-number/B7VW3MZ2MMO4UNUZQHOI2SXHKW/events.json","paper":"https://pith.science/paper/B7VW3MZ2"},"agent_actions":{"view_html":"https://pith.science/pith/B7VW3MZ2MMO4UNUZQHOI2SXHKW","download_json":"https://pith.science/pith/B7VW3MZ2MMO4UNUZQHOI2SXHKW.json","view_paper":"https://pith.science/paper/B7VW3MZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05359&json=true","fetch_graph":"https://pith.science/api/pith-number/B7VW3MZ2MMO4UNUZQHOI2SXHKW/graph.json","fetch_events":"https://pith.science/api/pith-number/B7VW3MZ2MMO4UNUZQHOI2SXHKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7VW3MZ2MMO4UNUZQHOI2SXHKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7VW3MZ2MMO4UNUZQHOI2SXHKW/action/storage_attestation","attest_author":"https://pith.science/pith/B7VW3MZ2MMO4UNUZQHOI2SXHKW/action/author_attestation","sign_citation":"https://pith.science/pith/B7VW3MZ2MMO4UNUZQHOI2SXHKW/action/citation_signature","submit_replication":"https://pith.science/pith/B7VW3MZ2MMO4UNUZQHOI2SXHKW/action/replication_record"}},"created_at":"2026-05-18T00:57:36.939434+00:00","updated_at":"2026-05-18T00:57:36.939434+00:00"}