{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:2TRAZBSZEWLIYIB6UQBAXQU2EW","short_pith_number":"pith:2TRAZBSZ","canonical_record":{"source":{"id":"1012.4263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-20T09:08:05Z","cross_cats_sorted":[],"title_canon_sha256":"5610f697d278e63dabd066220d2b361cd869ee9aeedc584495b405392b5644b8","abstract_canon_sha256":"2b69f89c82b7ddbea0234cf247ede6304cd0ca0e579d82f4eda6cd1692bd16f0"},"schema_version":"1.0"},"canonical_sha256":"d4e20c865925968c203ea4020bc29a25b2a2bff33d770798214a14d41e9daf86","source":{"kind":"arxiv","id":"1012.4263","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4263","created_at":"2026-05-18T04:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4263v1","created_at":"2026-05-18T04:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4263","created_at":"2026-05-18T04:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"2TRAZBSZEWLI","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2TRAZBSZEWLIYIB6","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2TRAZBSZ","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:2TRAZBSZEWLIYIB6UQBAXQU2EW","target":"record","payload":{"canonical_record":{"source":{"id":"1012.4263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-20T09:08:05Z","cross_cats_sorted":[],"title_canon_sha256":"5610f697d278e63dabd066220d2b361cd869ee9aeedc584495b405392b5644b8","abstract_canon_sha256":"2b69f89c82b7ddbea0234cf247ede6304cd0ca0e579d82f4eda6cd1692bd16f0"},"schema_version":"1.0"},"canonical_sha256":"d4e20c865925968c203ea4020bc29a25b2a2bff33d770798214a14d41e9daf86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:55.141338Z","signature_b64":"ZqcBwJKu7tTRpK+D2hh10q9cilv7FJXxE4O1LE+bTi9XSHbp3FL91KsIMeqjFJWPw85zAyNFrZwf367o2cXeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4e20c865925968c203ea4020bc29a25b2a2bff33d770798214a14d41e9daf86","last_reissued_at":"2026-05-18T04:32:55.140483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:55.140483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.4263","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-18T04:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"reJqwfQO96NH5vq4ezSngD44vHYB1wYmQqyeHX91sAp/XS0jOiYGGZTajZS34CurhtNBHDcHPiHdCOSZrHDZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:04:00.698418Z"},"content_sha256":"c2673614ca9acce4ad41330c6a9a6a12a8afd57d55ae9411d1a581251c4baa38","schema_version":"1.0","event_id":"sha256:c2673614ca9acce4ad41330c6a9a6a12a8afd57d55ae9411d1a581251c4baa38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:2TRAZBSZEWLIYIB6UQBAXQU2EW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lightweight LCP-Array Construction in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Enno Ohlebusch, Simon Gog","submitted_at":"2010-12-20T09:08:05Z","abstract_excerpt":"The suffix tree is a very important data structure in string processing, but it suffers from a huge space consumption. In large-scale applications, compressed suffix trees (CSTs) are therefore used instead. A CST consists of three (compressed) components: the suffix array, the LCP-array, and data structures for simulating navigational operations on the suffix tree. The LCP-array stores the lengths of the longest common prefixes of lexicographically adjacent suffixes, and it can be computed in linear time. In this paper, we present new LCP-array construction algorithms that are fast and very sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4263","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-18T04:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPH4Vv21E/jhV0HQ7gggJ5PyK8GJ/gZWR94VyaCkS6stYoyagAg9j5k+fAbjBgYijrU9blNNeOiENH+kYPRrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:04:00.699072Z"},"content_sha256":"848518aa19f84b02a9eda75db8955be44338019e5e232a24126c3b541e16a9aa","schema_version":"1.0","event_id":"sha256:848518aa19f84b02a9eda75db8955be44338019e5e232a24126c3b541e16a9aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW/bundle.json","state_url":"https://pith.science/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW/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-06-11T00:04:00Z","links":{"resolver":"https://pith.science/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW","bundle":"https://pith.science/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW/bundle.json","state":"https://pith.science/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:2TRAZBSZEWLIYIB6UQBAXQU2EW","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":"2b69f89c82b7ddbea0234cf247ede6304cd0ca0e579d82f4eda6cd1692bd16f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-20T09:08:05Z","title_canon_sha256":"5610f697d278e63dabd066220d2b361cd869ee9aeedc584495b405392b5644b8"},"schema_version":"1.0","source":{"id":"1012.4263","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4263","created_at":"2026-05-18T04:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4263v1","created_at":"2026-05-18T04:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4263","created_at":"2026-05-18T04:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"2TRAZBSZEWLI","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2TRAZBSZEWLIYIB6","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2TRAZBSZ","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:848518aa19f84b02a9eda75db8955be44338019e5e232a24126c3b541e16a9aa","target":"graph","created_at":"2026-05-18T04:32:55Z","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 suffix tree is a very important data structure in string processing, but it suffers from a huge space consumption. In large-scale applications, compressed suffix trees (CSTs) are therefore used instead. A CST consists of three (compressed) components: the suffix array, the LCP-array, and data structures for simulating navigational operations on the suffix tree. The LCP-array stores the lengths of the longest common prefixes of lexicographically adjacent suffixes, and it can be computed in linear time. In this paper, we present new LCP-array construction algorithms that are fast and very sp","authors_text":"Enno Ohlebusch, Simon Gog","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-20T09:08:05Z","title":"Lightweight LCP-Array Construction in Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4263","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:c2673614ca9acce4ad41330c6a9a6a12a8afd57d55ae9411d1a581251c4baa38","target":"record","created_at":"2026-05-18T04:32:55Z","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":"2b69f89c82b7ddbea0234cf247ede6304cd0ca0e579d82f4eda6cd1692bd16f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-20T09:08:05Z","title_canon_sha256":"5610f697d278e63dabd066220d2b361cd869ee9aeedc584495b405392b5644b8"},"schema_version":"1.0","source":{"id":"1012.4263","kind":"arxiv","version":1}},"canonical_sha256":"d4e20c865925968c203ea4020bc29a25b2a2bff33d770798214a14d41e9daf86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4e20c865925968c203ea4020bc29a25b2a2bff33d770798214a14d41e9daf86","first_computed_at":"2026-05-18T04:32:55.140483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:55.140483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZqcBwJKu7tTRpK+D2hh10q9cilv7FJXxE4O1LE+bTi9XSHbp3FL91KsIMeqjFJWPw85zAyNFrZwf367o2cXeDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:55.141338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.4263","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2673614ca9acce4ad41330c6a9a6a12a8afd57d55ae9411d1a581251c4baa38","sha256:848518aa19f84b02a9eda75db8955be44338019e5e232a24126c3b541e16a9aa"],"state_sha256":"8e83147d67e986e066665dabaac18e025870f0527b246b61f23b1a6e37964fb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9KOx+NQTVXQoYcUkIEeNmcWlOKqkbA4i0kn/zD85ilHaYS9c2Oz4Pf+nlUKj0qFhUvruKK8U/yAI5PhDeIPxCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:04:00.702396Z","bundle_sha256":"c9404c062bd193ca6da5a262124e495773ad3ba1acdaf29daf820e54695e2dc8"}}