{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZXKIUT5XXQKTJBOS453G7WXC5L","short_pith_number":"pith:ZXKIUT5X","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"},"canonical_sha256":"cdd48a4fb7bc153485d2e7766fdae2ead188ff6a284c7407b7fe44e58f220102","source":{"kind":"arxiv","id":"1601.07670","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07670","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07670v2","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07670","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZXKIUT5XXQKT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZXKIUT5XXQKTJBOS","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZXKIUT5X","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZXKIUT5XXQKTJBOS453G7WXC5L","target":"record","payload":{"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"},"canonical_sha256":"cdd48a4fb7bc153485d2e7766fdae2ead188ff6a284c7407b7fe44e58f220102","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"},"source_kind":"arxiv","source_id":"1601.07670","source_version":2,"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-18T01:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gqOtRSVBpY2ift9pzfbk2AslQEX6A1+KUdrOAjZjT7el/UxmFST9hMOztbQc30udIYB2i8we3pnSgP40XYfsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:45:41.523879Z"},"content_sha256":"56447b69a918e3a9062f5a6783c8faaadc59ae189543e9a9afdd7db933561d0c","schema_version":"1.0","event_id":"sha256:56447b69a918e3a9062f5a6783c8faaadc59ae189543e9a9afdd7db933561d0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZXKIUT5XXQKTJBOS453G7WXC5L","target":"graph","payload":{"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"},"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-18T01:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fiGbJ+8S4GH+Rl233/k7AF7vek3m65VKLqCvYZLsilv73rzyO50+hGw/J1d4pbzeMOIrEyBqDA/1tmtZqhVCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:45:41.524227Z"},"content_sha256":"84f5447db5f5f28af0cdac7156794f62f7d7c3aac8f98f4b53f2ae675c3b82da","schema_version":"1.0","event_id":"sha256:84f5447db5f5f28af0cdac7156794f62f7d7c3aac8f98f4b53f2ae675c3b82da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXKIUT5XXQKTJBOS453G7WXC5L/bundle.json","state_url":"https://pith.science/pith/ZXKIUT5XXQKTJBOS453G7WXC5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXKIUT5XXQKTJBOS453G7WXC5L/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-28T06:45:41Z","links":{"resolver":"https://pith.science/pith/ZXKIUT5XXQKTJBOS453G7WXC5L","bundle":"https://pith.science/pith/ZXKIUT5XXQKTJBOS453G7WXC5L/bundle.json","state":"https://pith.science/pith/ZXKIUT5XXQKTJBOS453G7WXC5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXKIUT5XXQKTJBOS453G7WXC5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZXKIUT5XXQKTJBOS453G7WXC5L","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":"91ca8070628a2deecc82cb38f561e391c2224dd86c09cd692858a108a949fe35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-28T07:14:19Z","title_canon_sha256":"de54f5d0e8e37dd4ac6a7045bc82255f5e0ea581c8aad907b46b7738f6fccddd"},"schema_version":"1.0","source":{"id":"1601.07670","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07670","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07670v2","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07670","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZXKIUT5XXQKT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZXKIUT5XXQKTJBOS","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZXKIUT5X","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:84f5447db5f5f28af0cdac7156794f62f7d7c3aac8f98f4b53f2ae675c3b82da","target":"graph","created_at":"2026-05-18T01:21:41Z","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":"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","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Simon J. Puglisi, Tomohiro I, Yuka Tanimura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-28T07:14:19Z","title":"Deterministic sub-linear space LCE data structures with efficient construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07670","kind":"arxiv","version":2},"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:56447b69a918e3a9062f5a6783c8faaadc59ae189543e9a9afdd7db933561d0c","target":"record","created_at":"2026-05-18T01:21:41Z","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":"91ca8070628a2deecc82cb38f561e391c2224dd86c09cd692858a108a949fe35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-28T07:14:19Z","title_canon_sha256":"de54f5d0e8e37dd4ac6a7045bc82255f5e0ea581c8aad907b46b7738f6fccddd"},"schema_version":"1.0","source":{"id":"1601.07670","kind":"arxiv","version":2}},"canonical_sha256":"cdd48a4fb7bc153485d2e7766fdae2ead188ff6a284c7407b7fe44e58f220102","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdd48a4fb7bc153485d2e7766fdae2ead188ff6a284c7407b7fe44e58f220102","first_computed_at":"2026-05-18T01:21:41.533965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:41.533965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2ZdHLDaZRx0uQqMWEMb98uhfXFm8JeMtxANE/RFhBTPOxr6/dUvCKsCTRJf+bq5xxc0SG8S6Tp7fsH1X+DF1Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:41.534593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07670","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56447b69a918e3a9062f5a6783c8faaadc59ae189543e9a9afdd7db933561d0c","sha256:84f5447db5f5f28af0cdac7156794f62f7d7c3aac8f98f4b53f2ae675c3b82da"],"state_sha256":"96d9ba1147a91fbb78723d6bbf9d579725b7a2305482d7bcdb48e1a56c26f134"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eqeVrpxp8vvuR3HZCND6DN7P4w04O4dtt5/OJ8NJ1eqA9mwSU0KOPsAmOHw3S/C31oyWrrRKFISI1YhHPOVABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:45:41.526406Z","bundle_sha256":"e70b59b8ccc329b10c8be144d7973badfd4c5226b9ec7fc4c0bfb5835f4b5a84"}}