{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XHHOCW5ZJJTPV6ZWCAJ2CDU23O","short_pith_number":"pith:XHHOCW5Z","canonical_record":{"source":{"id":"1605.04098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-13T09:42:10Z","cross_cats_sorted":[],"title_canon_sha256":"2d4c59fd4c827d5c2132146f81a6fb6df1c10548e0e322351213478b0e1920e2","abstract_canon_sha256":"cea31a6a6225faef2196c27d78e6a9d1d486bcb3271609dd0b2defd7e92cce51"},"schema_version":"1.0"},"canonical_sha256":"b9cee15bb94a66fafb361013a10e9adbaabba224cf0cd557e6542238e342c6fb","source":{"kind":"arxiv","id":"1605.04098","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04098","created_at":"2026-05-18T01:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04098v1","created_at":"2026-05-18T01:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04098","created_at":"2026-05-18T01:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"XHHOCW5ZJJTP","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XHHOCW5ZJJTPV6ZW","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XHHOCW5Z","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XHHOCW5ZJJTPV6ZWCAJ2CDU23O","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-13T09:42:10Z","cross_cats_sorted":[],"title_canon_sha256":"2d4c59fd4c827d5c2132146f81a6fb6df1c10548e0e322351213478b0e1920e2","abstract_canon_sha256":"cea31a6a6225faef2196c27d78e6a9d1d486bcb3271609dd0b2defd7e92cce51"},"schema_version":"1.0"},"canonical_sha256":"b9cee15bb94a66fafb361013a10e9adbaabba224cf0cd557e6542238e342c6fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:54.344386Z","signature_b64":"hscVi3q5feyj1ZKhnI6IXH3NBYcBAy9w8iqI+2LkyIGf/S6x7/gIjhEdCcOgdQBM6nRLvNpx+WHU7XTpKEWmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9cee15bb94a66fafb361013a10e9adbaabba224cf0cd557e6542238e342c6fb","last_reissued_at":"2026-05-18T01:14:54.343757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:54.343757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04098","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-18T01:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/1AzH0jf3rVk49us7o9UCXMeX7R721t5T6CcuPOGoSu6Id34XopS0uPaF0ZDCX1xTvwWXmY1LuRGy8vYadKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:52:05.625545Z"},"content_sha256":"3d0658b83d50652ba475ff505a14ab89176cec4a5abaa1446d98f69ee8d5e2e2","schema_version":"1.0","event_id":"sha256:3d0658b83d50652ba475ff505a14ab89176cec4a5abaa1446d98f69ee8d5e2e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XHHOCW5ZJJTPV6ZWCAJ2CDU23O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lightweight LCP Construction for Very Large Collections of Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anthony J. Cox, Fabio Garofalo, Giovanna Rosone, Marinella Sciortino","submitted_at":"2016-05-13T09:42:10Z","abstract_excerpt":"The longest common prefix array is a very advantageous data structure that, combined with the suffix array and the Burrows-Wheeler transform, allows to efficiently compute some combinatorial properties of a string useful in several applications, especially in biological contexts. Nowadays, the input data for many problems are big collections of strings, for instance the data coming from \"next-generation\" DNA sequencing (NGS) technologies. In this paper we present the first lightweight algorithm (called extLCP) for the simultaneous computation of the longest common prefix array and the Burrows-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04098","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-18T01:14:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ntfzlp5fzaLTO9UJL0Riw2njVly3Q7UQUpmDWjAo2EIFLe/NjTHFQCCu1wuXGsbpn21YOxemWAotT2hD3P8EAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:52:05.625901Z"},"content_sha256":"afe305ed9ea85ed79d5ca1a9d3b31bbcfd6298475a44d52bfff60c2fdac4d3b2","schema_version":"1.0","event_id":"sha256:afe305ed9ea85ed79d5ca1a9d3b31bbcfd6298475a44d52bfff60c2fdac4d3b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHHOCW5ZJJTPV6ZWCAJ2CDU23O/bundle.json","state_url":"https://pith.science/pith/XHHOCW5ZJJTPV6ZWCAJ2CDU23O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHHOCW5ZJJTPV6ZWCAJ2CDU23O/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-12T09:52:05Z","links":{"resolver":"https://pith.science/pith/XHHOCW5ZJJTPV6ZWCAJ2CDU23O","bundle":"https://pith.science/pith/XHHOCW5ZJJTPV6ZWCAJ2CDU23O/bundle.json","state":"https://pith.science/pith/XHHOCW5ZJJTPV6ZWCAJ2CDU23O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHHOCW5ZJJTPV6ZWCAJ2CDU23O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XHHOCW5ZJJTPV6ZWCAJ2CDU23O","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":"cea31a6a6225faef2196c27d78e6a9d1d486bcb3271609dd0b2defd7e92cce51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-13T09:42:10Z","title_canon_sha256":"2d4c59fd4c827d5c2132146f81a6fb6df1c10548e0e322351213478b0e1920e2"},"schema_version":"1.0","source":{"id":"1605.04098","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04098","created_at":"2026-05-18T01:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04098v1","created_at":"2026-05-18T01:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04098","created_at":"2026-05-18T01:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"XHHOCW5ZJJTP","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XHHOCW5ZJJTPV6ZW","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XHHOCW5Z","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:afe305ed9ea85ed79d5ca1a9d3b31bbcfd6298475a44d52bfff60c2fdac4d3b2","target":"graph","created_at":"2026-05-18T01:14:54Z","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 longest common prefix array is a very advantageous data structure that, combined with the suffix array and the Burrows-Wheeler transform, allows to efficiently compute some combinatorial properties of a string useful in several applications, especially in biological contexts. Nowadays, the input data for many problems are big collections of strings, for instance the data coming from \"next-generation\" DNA sequencing (NGS) technologies. In this paper we present the first lightweight algorithm (called extLCP) for the simultaneous computation of the longest common prefix array and the Burrows-","authors_text":"Anthony J. Cox, Fabio Garofalo, Giovanna Rosone, Marinella Sciortino","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-13T09:42:10Z","title":"Lightweight LCP Construction for Very Large Collections of Strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04098","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:3d0658b83d50652ba475ff505a14ab89176cec4a5abaa1446d98f69ee8d5e2e2","target":"record","created_at":"2026-05-18T01:14:54Z","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":"cea31a6a6225faef2196c27d78e6a9d1d486bcb3271609dd0b2defd7e92cce51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-13T09:42:10Z","title_canon_sha256":"2d4c59fd4c827d5c2132146f81a6fb6df1c10548e0e322351213478b0e1920e2"},"schema_version":"1.0","source":{"id":"1605.04098","kind":"arxiv","version":1}},"canonical_sha256":"b9cee15bb94a66fafb361013a10e9adbaabba224cf0cd557e6542238e342c6fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9cee15bb94a66fafb361013a10e9adbaabba224cf0cd557e6542238e342c6fb","first_computed_at":"2026-05-18T01:14:54.343757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:54.343757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hscVi3q5feyj1ZKhnI6IXH3NBYcBAy9w8iqI+2LkyIGf/S6x7/gIjhEdCcOgdQBM6nRLvNpx+WHU7XTpKEWmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:54.344386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04098","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d0658b83d50652ba475ff505a14ab89176cec4a5abaa1446d98f69ee8d5e2e2","sha256:afe305ed9ea85ed79d5ca1a9d3b31bbcfd6298475a44d52bfff60c2fdac4d3b2"],"state_sha256":"e115ee28cb8955d460b3ad079052fb3a98e413cf61f4f27e74a8334dd4c15413"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOlNA61wOGHuhcA06eYn9j9P5z0L3l0TnmVu6fnTmaDXlpe5mrYgkmNXK2OZCaGkfTMW5XbIgs9rPHrQQQH0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:52:05.627985Z","bundle_sha256":"6bf20b7556bb9503ad4936224496dd48e3ae79a10c5cd7e5a89df2dd105c8367"}}