{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3FCVMQJRTS5QNEUIHA44KM33AS","short_pith_number":"pith:3FCVMQJR","canonical_record":{"source":{"id":"1305.0160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-01T12:51:45Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"a872be44d49b99ef1165083958714c1e490d1d17f5302b4a40e8814c2e6879d9","abstract_canon_sha256":"c910910cbdb33749e8232bce6ba126e17871444bfaa84806ef089e03a2f8373b"},"schema_version":"1.0"},"canonical_sha256":"d9455641319cbb0692883839c5337b049a37e4c51d485c3f4c19710036817a2c","source":{"kind":"arxiv","id":"1305.0160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0160","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0160v1","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0160","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"pith_short_12","alias_value":"3FCVMQJRTS5Q","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3FCVMQJRTS5QNEUI","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3FCVMQJR","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3FCVMQJRTS5QNEUIHA44KM33AS","target":"record","payload":{"canonical_record":{"source":{"id":"1305.0160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-01T12:51:45Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"a872be44d49b99ef1165083958714c1e490d1d17f5302b4a40e8814c2e6879d9","abstract_canon_sha256":"c910910cbdb33749e8232bce6ba126e17871444bfaa84806ef089e03a2f8373b"},"schema_version":"1.0"},"canonical_sha256":"d9455641319cbb0692883839c5337b049a37e4c51d485c3f4c19710036817a2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:41.808861Z","signature_b64":"HtTVox2fevJKgBt2FQFuftDTmN3N/3BifhYLKKOUnPPFg5ZzV49L7KktqtyBreGFaaGyVXK+zp1SONfkcCLpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9455641319cbb0692883839c5337b049a37e4c51d485c3f4c19710036817a2c","last_reissued_at":"2026-05-18T03:26:41.808133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:41.808133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.0160","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-18T03:26:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ot26PcNBNj31Ucusu4wZxwzmqKoaFSkAdd+l2WjATS47CfuUEsVixlcRuBm+XWLjYre2wvQYwNCitxcnL8LGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:07:46.603278Z"},"content_sha256":"4b2913a9bd9e401a25ea174608c6de525a348ea54305fcbf60b15166beabaa94","schema_version":"1.0","event_id":"sha256:4b2913a9bd9e401a25ea174608c6de525a348ea54305fcbf60b15166beabaa94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3FCVMQJRTS5QNEUIHA44KM33AS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lightweight LCP Construction for Next-Generation Sequencing Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Anthony J. Cox, Giovanna Rosone, Marinella Sciortino, Markus J. Bauer","submitted_at":"2013-05-01T12:51:45Z","abstract_excerpt":"The advent of \"next-generation\" DNA sequencing (NGS) technologies has meant that collections of hundreds of millions of DNA sequences are now commonplace in bioinformatics. Knowing the longest common prefix array (LCP) of such a collection would facilitate the rapid computation of maximal exact matches, shortest unique substrings and shortest absent words. CPU-efficient algorithms for computing the LCP of a string have been described in the literature, but require the presence in RAM of large data structures. This prevents such methods from being feasible for NGS datasets.\n  In this paper we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0160","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-18T03:26:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8xAjbYhif3Ip2xzQllDdVZdTWumLXsTGW0LM0SIEYNlYMor0mdD2OVQHbewDrfoSl3gIjfb08Xv+C6p5v7TBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:07:46.603880Z"},"content_sha256":"df5fb4023947aa6e57f808632df128f6075f8575ef2a02970f80b434ccccddaa","schema_version":"1.0","event_id":"sha256:df5fb4023947aa6e57f808632df128f6075f8575ef2a02970f80b434ccccddaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FCVMQJRTS5QNEUIHA44KM33AS/bundle.json","state_url":"https://pith.science/pith/3FCVMQJRTS5QNEUIHA44KM33AS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FCVMQJRTS5QNEUIHA44KM33AS/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:07:46Z","links":{"resolver":"https://pith.science/pith/3FCVMQJRTS5QNEUIHA44KM33AS","bundle":"https://pith.science/pith/3FCVMQJRTS5QNEUIHA44KM33AS/bundle.json","state":"https://pith.science/pith/3FCVMQJRTS5QNEUIHA44KM33AS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FCVMQJRTS5QNEUIHA44KM33AS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3FCVMQJRTS5QNEUIHA44KM33AS","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":"c910910cbdb33749e8232bce6ba126e17871444bfaa84806ef089e03a2f8373b","cross_cats_sorted":["q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-01T12:51:45Z","title_canon_sha256":"a872be44d49b99ef1165083958714c1e490d1d17f5302b4a40e8814c2e6879d9"},"schema_version":"1.0","source":{"id":"1305.0160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0160","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0160v1","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0160","created_at":"2026-05-18T03:26:41Z"},{"alias_kind":"pith_short_12","alias_value":"3FCVMQJRTS5Q","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3FCVMQJRTS5QNEUI","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3FCVMQJR","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:df5fb4023947aa6e57f808632df128f6075f8575ef2a02970f80b434ccccddaa","target":"graph","created_at":"2026-05-18T03:26: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":"The advent of \"next-generation\" DNA sequencing (NGS) technologies has meant that collections of hundreds of millions of DNA sequences are now commonplace in bioinformatics. Knowing the longest common prefix array (LCP) of such a collection would facilitate the rapid computation of maximal exact matches, shortest unique substrings and shortest absent words. CPU-efficient algorithms for computing the LCP of a string have been described in the literature, but require the presence in RAM of large data structures. This prevents such methods from being feasible for NGS datasets.\n  In this paper we p","authors_text":"Anthony J. Cox, Giovanna Rosone, Marinella Sciortino, Markus J. Bauer","cross_cats":["q-bio.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-01T12:51:45Z","title":"Lightweight LCP Construction for Next-Generation Sequencing Datasets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0160","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:4b2913a9bd9e401a25ea174608c6de525a348ea54305fcbf60b15166beabaa94","target":"record","created_at":"2026-05-18T03:26: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":"c910910cbdb33749e8232bce6ba126e17871444bfaa84806ef089e03a2f8373b","cross_cats_sorted":["q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-01T12:51:45Z","title_canon_sha256":"a872be44d49b99ef1165083958714c1e490d1d17f5302b4a40e8814c2e6879d9"},"schema_version":"1.0","source":{"id":"1305.0160","kind":"arxiv","version":1}},"canonical_sha256":"d9455641319cbb0692883839c5337b049a37e4c51d485c3f4c19710036817a2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9455641319cbb0692883839c5337b049a37e4c51d485c3f4c19710036817a2c","first_computed_at":"2026-05-18T03:26:41.808133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:41.808133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HtTVox2fevJKgBt2FQFuftDTmN3N/3BifhYLKKOUnPPFg5ZzV49L7KktqtyBreGFaaGyVXK+zp1SONfkcCLpCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:41.808861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b2913a9bd9e401a25ea174608c6de525a348ea54305fcbf60b15166beabaa94","sha256:df5fb4023947aa6e57f808632df128f6075f8575ef2a02970f80b434ccccddaa"],"state_sha256":"2d08dc07958bc2e7e6ba7b6adcd2fb46352611a6e6cfdaa4efd0cfa7bfac1c7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/qVDppUlhl89h0c3nSGKD1fO/xRSsuEX0Y9KDdmQincvKr9NOLAK+mM20x1Y5TUdW1NIWkmM/wNiT/5l6p4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:07:46.607028Z","bundle_sha256":"1e1289c66c8bd848675113efd337758bd1360b64e70dd1711769132f742eb7e7"}}