{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GN2BYBGMUUFTUNZD34NQGLGAQR","short_pith_number":"pith:GN2BYBGM","canonical_record":{"source":{"id":"1807.07596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T18:33:20Z","cross_cats_sorted":[],"title_canon_sha256":"d26617b080bbaf716e53bef1ea7ae408db8e64fa182b21ff5de061a69d0a22ba","abstract_canon_sha256":"7e6a3db7e640608d74df974e8b7fb4b1da80c2ceff409b22d8f9b691dedc4d0c"},"schema_version":"1.0"},"canonical_sha256":"33741c04cca50b3a3723df1b032cc0844d16b40c82fef5bff94f0f7b34e26081","source":{"kind":"arxiv","id":"1807.07596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07596","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07596v1","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07596","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"GN2BYBGMUUFT","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GN2BYBGMUUFTUNZD","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GN2BYBGM","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GN2BYBGMUUFTUNZD34NQGLGAQR","target":"record","payload":{"canonical_record":{"source":{"id":"1807.07596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T18:33:20Z","cross_cats_sorted":[],"title_canon_sha256":"d26617b080bbaf716e53bef1ea7ae408db8e64fa182b21ff5de061a69d0a22ba","abstract_canon_sha256":"7e6a3db7e640608d74df974e8b7fb4b1da80c2ceff409b22d8f9b691dedc4d0c"},"schema_version":"1.0"},"canonical_sha256":"33741c04cca50b3a3723df1b032cc0844d16b40c82fef5bff94f0f7b34e26081","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:16.161231Z","signature_b64":"zp2eEGjL67fqpHjAAWpsGbORJYGUadugzjeEptdvLPftZY2KpkpTKxkEzKZXXMtpO9BI1J0X1ckwJLLG9366AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33741c04cca50b3a3723df1b032cc0844d16b40c82fef5bff94f0f7b34e26081","last_reissued_at":"2026-05-18T00:10:16.160586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:16.160586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.07596","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:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ixJlXIN055mlSA6OVsFF6e9wM2Ni7cTBZ43R+fOk4M/2C/tY55gx8qZ+xqToFax0sWSId+1juUViueQ1AcGbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:16:31.927329Z"},"content_sha256":"07fe3d495a8e875b999baa635753e56c6e64ec7490c7ce3421a38ec7cc8b1c7a","schema_version":"1.0","event_id":"sha256:07fe3d495a8e875b999baa635753e56c6e64ec7490c7ce3421a38ec7cc8b1c7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GN2BYBGMUUFTUNZD34NQGLGAQR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The colored longest common prefix array computed via sequential scans","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D. Verzotto, F. Garofalo, G. Rosone, M. Sciortino","submitted_at":"2018-07-19T18:33:20Z","abstract_excerpt":"Due to the increased availability of large datasets of biological sequences, the tools for sequence comparison are now relying on efficient alignment-free approaches to a greater extent. Most of the alignment-free approaches require the computation of statistics of the sequences in the dataset. Such computations become impractical in internal memory when very large collections of long sequences are considered. In this paper, we present a new conceptual data structure, the colored longest common prefix array (cLCP), that allows to efficiently tackle several problems with an alignment-free appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07596","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:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wkv8IsEU/OxA+PQ6s0INhAkIkCHErmFSjCs0tI0VSh67UwXCrC7eY/6BLANi88VArdW/o9AJSEsFCJx9cTX/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:16:31.927675Z"},"content_sha256":"7a9194d18a4ca935f44e80b0b62241382de8b8f36354a37da9a29a7bfd3080c1","schema_version":"1.0","event_id":"sha256:7a9194d18a4ca935f44e80b0b62241382de8b8f36354a37da9a29a7bfd3080c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GN2BYBGMUUFTUNZD34NQGLGAQR/bundle.json","state_url":"https://pith.science/pith/GN2BYBGMUUFTUNZD34NQGLGAQR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GN2BYBGMUUFTUNZD34NQGLGAQR/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-27T18:16:31Z","links":{"resolver":"https://pith.science/pith/GN2BYBGMUUFTUNZD34NQGLGAQR","bundle":"https://pith.science/pith/GN2BYBGMUUFTUNZD34NQGLGAQR/bundle.json","state":"https://pith.science/pith/GN2BYBGMUUFTUNZD34NQGLGAQR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GN2BYBGMUUFTUNZD34NQGLGAQR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GN2BYBGMUUFTUNZD34NQGLGAQR","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":"7e6a3db7e640608d74df974e8b7fb4b1da80c2ceff409b22d8f9b691dedc4d0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T18:33:20Z","title_canon_sha256":"d26617b080bbaf716e53bef1ea7ae408db8e64fa182b21ff5de061a69d0a22ba"},"schema_version":"1.0","source":{"id":"1807.07596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07596","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07596v1","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07596","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"GN2BYBGMUUFT","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GN2BYBGMUUFTUNZD","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GN2BYBGM","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:7a9194d18a4ca935f44e80b0b62241382de8b8f36354a37da9a29a7bfd3080c1","target":"graph","created_at":"2026-05-18T00:10:16Z","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":"Due to the increased availability of large datasets of biological sequences, the tools for sequence comparison are now relying on efficient alignment-free approaches to a greater extent. Most of the alignment-free approaches require the computation of statistics of the sequences in the dataset. Such computations become impractical in internal memory when very large collections of long sequences are considered. In this paper, we present a new conceptual data structure, the colored longest common prefix array (cLCP), that allows to efficiently tackle several problems with an alignment-free appro","authors_text":"D. Verzotto, F. Garofalo, G. Rosone, M. Sciortino","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T18:33:20Z","title":"The colored longest common prefix array computed via sequential scans"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07596","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:07fe3d495a8e875b999baa635753e56c6e64ec7490c7ce3421a38ec7cc8b1c7a","target":"record","created_at":"2026-05-18T00:10:16Z","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":"7e6a3db7e640608d74df974e8b7fb4b1da80c2ceff409b22d8f9b691dedc4d0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T18:33:20Z","title_canon_sha256":"d26617b080bbaf716e53bef1ea7ae408db8e64fa182b21ff5de061a69d0a22ba"},"schema_version":"1.0","source":{"id":"1807.07596","kind":"arxiv","version":1}},"canonical_sha256":"33741c04cca50b3a3723df1b032cc0844d16b40c82fef5bff94f0f7b34e26081","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33741c04cca50b3a3723df1b032cc0844d16b40c82fef5bff94f0f7b34e26081","first_computed_at":"2026-05-18T00:10:16.160586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:16.160586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zp2eEGjL67fqpHjAAWpsGbORJYGUadugzjeEptdvLPftZY2KpkpTKxkEzKZXXMtpO9BI1J0X1ckwJLLG9366AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:16.161231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07fe3d495a8e875b999baa635753e56c6e64ec7490c7ce3421a38ec7cc8b1c7a","sha256:7a9194d18a4ca935f44e80b0b62241382de8b8f36354a37da9a29a7bfd3080c1"],"state_sha256":"b9046cada5c95d0e706ea14d327465aee42003bed1cf65821df22cbe6c2959ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XYg625dolr8QQvwCZvbNwaP74aV6i6/3K9eFaIsISv0uwzNf5AQH+ExFKhCcvJxPws3oLfhj1wZxoymIYQPDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:16:31.929571Z","bundle_sha256":"372954621602b69c8b24e31b11cbda6567a88449857af8ef66a1867a5b66ff43"}}