{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4I5SW6CQBF25USGJXWIC6TGUAE","short_pith_number":"pith:4I5SW6CQ","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"},"canonical_sha256":"e23b2b78500975da48c9bd902f4cd4011c73fe650d2abe4b948389a991a8be68","source":{"kind":"arxiv","id":"1702.07458","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07458","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07458v1","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07458","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"4I5SW6CQBF25","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4I5SW6CQBF25USGJ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4I5SW6CQ","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4I5SW6CQBF25USGJXWIC6TGUAE","target":"record","payload":{"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"},"canonical_sha256":"e23b2b78500975da48c9bd902f4cd4011c73fe650d2abe4b948389a991a8be68","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"},"source_kind":"arxiv","source_id":"1702.07458","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-18T00:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cb0qt2z2VoH3SzrtfZrKrU7+DgoHbUfNNazbFmpppfiopSlhAdlHdjyzxld4Efdks9IMkflDFG0+S8CTuB2eDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:36:03.662481Z"},"content_sha256":"37e8eec494043869f2a3dd29cb67bc66b66a823a6aff732d4cb1c3b9e5afebf8","schema_version":"1.0","event_id":"sha256:37e8eec494043869f2a3dd29cb67bc66b66a823a6aff732d4cb1c3b9e5afebf8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4I5SW6CQBF25USGJXWIC6TGUAE","target":"graph","payload":{"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"},"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-18T00:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FzW5VWvhbBv4+qXqOIgUp9/vWBcPKsU0zFDawsh6CSVDm0d0+fXe9GRCQ54Cewgb8H/N6Xk6fzNNMv7n6MivDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:36:03.662843Z"},"content_sha256":"ec5950821fcb8226247bfd27382144d0c5e5f3326f5f8bcd8dab7e08e0b39877","schema_version":"1.0","event_id":"sha256:ec5950821fcb8226247bfd27382144d0c5e5f3326f5f8bcd8dab7e08e0b39877"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4I5SW6CQBF25USGJXWIC6TGUAE/bundle.json","state_url":"https://pith.science/pith/4I5SW6CQBF25USGJXWIC6TGUAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4I5SW6CQBF25USGJXWIC6TGUAE/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-05-28T08:36:03Z","links":{"resolver":"https://pith.science/pith/4I5SW6CQBF25USGJXWIC6TGUAE","bundle":"https://pith.science/pith/4I5SW6CQBF25USGJXWIC6TGUAE/bundle.json","state":"https://pith.science/pith/4I5SW6CQBF25USGJXWIC6TGUAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4I5SW6CQBF25USGJXWIC6TGUAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4I5SW6CQBF25USGJXWIC6TGUAE","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":"5111db72de7061b00ef46931d287ae83a5b97eb26ec57b25e43bddcc46e33242","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T03:57:57Z","title_canon_sha256":"1522a5a46050c2df99ce7225142e4cbd19ca56f870e6c27f2144bca0ed7a571b"},"schema_version":"1.0","source":{"id":"1702.07458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07458","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07458v1","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07458","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"4I5SW6CQBF25","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4I5SW6CQBF25USGJ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4I5SW6CQ","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:ec5950821fcb8226247bfd27382144d0c5e5f3326f5f8bcd8dab7e08e0b39877","target":"graph","created_at":"2026-05-18T00:50:03Z","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 \\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","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Takaaki Nishimoto, Yuka Tanimura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T03:57:57Z","title":"Small-space encoding LCE data structure with constant-time queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07458","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:37e8eec494043869f2a3dd29cb67bc66b66a823a6aff732d4cb1c3b9e5afebf8","target":"record","created_at":"2026-05-18T00:50:03Z","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":"5111db72de7061b00ef46931d287ae83a5b97eb26ec57b25e43bddcc46e33242","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-24T03:57:57Z","title_canon_sha256":"1522a5a46050c2df99ce7225142e4cbd19ca56f870e6c27f2144bca0ed7a571b"},"schema_version":"1.0","source":{"id":"1702.07458","kind":"arxiv","version":1}},"canonical_sha256":"e23b2b78500975da48c9bd902f4cd4011c73fe650d2abe4b948389a991a8be68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e23b2b78500975da48c9bd902f4cd4011c73fe650d2abe4b948389a991a8be68","first_computed_at":"2026-05-18T00:50:03.273503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:03.273503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oKJD0uFFEQ2BGbZAhVna7O2LWVwVUmjgJAZPidbQcNTJ7pQIMBGYUjsMaWTe3HgaR77Z1prhcboaYvqXmRA4BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:03.274009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37e8eec494043869f2a3dd29cb67bc66b66a823a6aff732d4cb1c3b9e5afebf8","sha256:ec5950821fcb8226247bfd27382144d0c5e5f3326f5f8bcd8dab7e08e0b39877"],"state_sha256":"0540192bc2db8ae5267a0db80fea0ca7e9c32e428d21e69269ac8c58664a17f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ht6E3DoLRUCxBGepq/fv/IiwrLh4QcqPezCbwhXZDLY50VeNFD+e+2U6rW54iplKK1+f8Gr/9qJMN9/AcfAADQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:36:03.664950Z","bundle_sha256":"2415b321a8b423308b2176a7aebb45ff19b134a7285b7331e5d2c1b4c4c36da5"}}