{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:P73BYTTNDBSJSGMB3G7L77DYJ4","short_pith_number":"pith:P73BYTTN","canonical_record":{"source":{"id":"1607.08342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-28T08:02:23Z","cross_cats_sorted":[],"title_canon_sha256":"e955cb9d84d0c0927e60081108e23921237139f20f954b097d3725b5faf768a9","abstract_canon_sha256":"ea6a52ede3d9d5704d28658d771701bfb725473dd55c4cae664b6ddbeaa2ce95"},"schema_version":"1.0"},"canonical_sha256":"7ff61c4e6d1864991981d9bebffc784f1744820098bb54e0d9b5732e7ca1d6f0","source":{"kind":"arxiv","id":"1607.08342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08342","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08342v1","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08342","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"pith_short_12","alias_value":"P73BYTTNDBSJ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"P73BYTTNDBSJSGMB","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"P73BYTTN","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:P73BYTTNDBSJSGMB3G7L77DYJ4","target":"record","payload":{"canonical_record":{"source":{"id":"1607.08342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-28T08:02:23Z","cross_cats_sorted":[],"title_canon_sha256":"e955cb9d84d0c0927e60081108e23921237139f20f954b097d3725b5faf768a9","abstract_canon_sha256":"ea6a52ede3d9d5704d28658d771701bfb725473dd55c4cae664b6ddbeaa2ce95"},"schema_version":"1.0"},"canonical_sha256":"7ff61c4e6d1864991981d9bebffc784f1744820098bb54e0d9b5732e7ca1d6f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:19.390390Z","signature_b64":"+QnDtdnVTSOQhhRS+oGtP3olVgboP9rc4+qd6RIFddB7SOYOWrJfHs320QRrOSQ7m2M158s0tOuAi9c/6yrCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ff61c4e6d1864991981d9bebffc784f1744820098bb54e0d9b5732e7ca1d6f0","last_reissued_at":"2026-05-18T01:10:19.389653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:19.389653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.08342","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:10:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QaFD9HFRYxigMjwdwSr3if1YX4mMPccU6waqe5yiFA08+nRK+EVvTEZrZNYVeXpvrqAso7reM3b06PCsVHJCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:12:15.890431Z"},"content_sha256":"c889a3659b01d257f5c13a1d962d9be290e685e6da507af5e1f334e397236081","schema_version":"1.0","event_id":"sha256:c889a3659b01d257f5c13a1d962d9be290e685e6da507af5e1f334e397236081"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:P73BYTTNDBSJSGMB3G7L77DYJ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Lightweight Algorithm to compute the BWT and the LCP array of a Set of Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gianluca Della Vedova, Marco Previtali, Paola Bonizzoni, Raffaella Rizzi, Serena Nicosia","submitted_at":"2016-07-28T08:02:23Z","abstract_excerpt":"Indexing of very large collections of strings such as those produced by the widespread sequencing technologies, heavily relies on multi-string generalizations of the Burrows-Wheeler Transform (BWT), and for this problem various in-memory algorithms have been proposed. The rapid growing of data that are processed routinely, such as in bioinformatics, requires a large amount of main memory, and this fact has motivated the development of algorithms, to compute the BWT, that work almost entirely in external memory. On the other hand, the related problem of computing the Longest Common Prefix (LCP)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08342","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:10:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"auTD1O1vmG01wpP15Ct8X+n92lDZ5F0AH9Zp5zAqffX1VdAbThTZUVBqmQRqG314HsUk8LeQ+yroKaYzbeb5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:12:15.890800Z"},"content_sha256":"38b44a445a15c811a5948c679761ea2aba8eda9943d4d28e416bcef9312fe44c","schema_version":"1.0","event_id":"sha256:38b44a445a15c811a5948c679761ea2aba8eda9943d4d28e416bcef9312fe44c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P73BYTTNDBSJSGMB3G7L77DYJ4/bundle.json","state_url":"https://pith.science/pith/P73BYTTNDBSJSGMB3G7L77DYJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P73BYTTNDBSJSGMB3G7L77DYJ4/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-27T23:12:15Z","links":{"resolver":"https://pith.science/pith/P73BYTTNDBSJSGMB3G7L77DYJ4","bundle":"https://pith.science/pith/P73BYTTNDBSJSGMB3G7L77DYJ4/bundle.json","state":"https://pith.science/pith/P73BYTTNDBSJSGMB3G7L77DYJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P73BYTTNDBSJSGMB3G7L77DYJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:P73BYTTNDBSJSGMB3G7L77DYJ4","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":"ea6a52ede3d9d5704d28658d771701bfb725473dd55c4cae664b6ddbeaa2ce95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-28T08:02:23Z","title_canon_sha256":"e955cb9d84d0c0927e60081108e23921237139f20f954b097d3725b5faf768a9"},"schema_version":"1.0","source":{"id":"1607.08342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08342","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08342v1","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08342","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"pith_short_12","alias_value":"P73BYTTNDBSJ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"P73BYTTNDBSJSGMB","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"P73BYTTN","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:38b44a445a15c811a5948c679761ea2aba8eda9943d4d28e416bcef9312fe44c","target":"graph","created_at":"2026-05-18T01:10:19Z","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":"Indexing of very large collections of strings such as those produced by the widespread sequencing technologies, heavily relies on multi-string generalizations of the Burrows-Wheeler Transform (BWT), and for this problem various in-memory algorithms have been proposed. The rapid growing of data that are processed routinely, such as in bioinformatics, requires a large amount of main memory, and this fact has motivated the development of algorithms, to compute the BWT, that work almost entirely in external memory. On the other hand, the related problem of computing the Longest Common Prefix (LCP)","authors_text":"Gianluca Della Vedova, Marco Previtali, Paola Bonizzoni, Raffaella Rizzi, Serena Nicosia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-28T08:02:23Z","title":"A New Lightweight Algorithm to compute the BWT and the LCP array of a Set of Strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08342","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:c889a3659b01d257f5c13a1d962d9be290e685e6da507af5e1f334e397236081","target":"record","created_at":"2026-05-18T01:10:19Z","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":"ea6a52ede3d9d5704d28658d771701bfb725473dd55c4cae664b6ddbeaa2ce95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-28T08:02:23Z","title_canon_sha256":"e955cb9d84d0c0927e60081108e23921237139f20f954b097d3725b5faf768a9"},"schema_version":"1.0","source":{"id":"1607.08342","kind":"arxiv","version":1}},"canonical_sha256":"7ff61c4e6d1864991981d9bebffc784f1744820098bb54e0d9b5732e7ca1d6f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ff61c4e6d1864991981d9bebffc784f1744820098bb54e0d9b5732e7ca1d6f0","first_computed_at":"2026-05-18T01:10:19.389653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:19.389653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+QnDtdnVTSOQhhRS+oGtP3olVgboP9rc4+qd6RIFddB7SOYOWrJfHs320QRrOSQ7m2M158s0tOuAi9c/6yrCDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:19.390390Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c889a3659b01d257f5c13a1d962d9be290e685e6da507af5e1f334e397236081","sha256:38b44a445a15c811a5948c679761ea2aba8eda9943d4d28e416bcef9312fe44c"],"state_sha256":"af73fb52d949dc74007936ad56308a23dda7e962dde814be2bfbce980c5b5b68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2rSTM3Z3dxAPU+YKhtfVPllxt8dnO4A17RRBwWh+fM5ahfYnm/gTp1q3tf1XkOpv5XhYpMHH+rDGQvzKSleBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:12:15.893271Z","bundle_sha256":"2eb1a30bb0e74de53cb65b1ff9777f2aefa03f2970a7457088333806713ecc2b"}}