{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OAFXHSMV52U5CPWBVCIRIZTVEW","short_pith_number":"pith:OAFXHSMV","schema_version":"1.0","canonical_sha256":"700b73c995eea9d13ec1a8911466752592ed1623ae2d98207d755c1a743d2498","source":{"kind":"arxiv","id":"2306.04850","version":1},"attestation_state":"computed","paper":{"title":"Longest Common Prefix Arrays for Succinct k-Spectra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elena Biagi, Jarno N. Alanko, Simon J. Puglisi","submitted_at":"2023-06-08T00:57:24Z","abstract_excerpt":"The k-spectrum of a string is the set of all distinct substrings of length k occurring in the string. K-spectra have many applications in bioinformatics including pseudoalignment and genome assembly. The Spectral Burrows-Wheeler Transform (SBWT) has been recently introduced as an algorithmic tool to efficiently represent and query these objects. The longest common prefix (LCP) array for a k-spectrum is an array of length n that stores the length of the longest common prefix of adjacent k-mers as they occur in lexicographical order. The LCP array has at least two important applications, namely "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2306.04850","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-06-08T00:57:24Z","cross_cats_sorted":[],"title_canon_sha256":"c7199e78c618ed8680d19b35b94116edac12dd63a755d43e45edabae1d845ea9","abstract_canon_sha256":"a3fcc5761d0f29a140a9604db4813afc11b65a58b87ee3feeaedcb0dd6e61dca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:18:42.684650Z","signature_b64":"PuU716YLSMUoM4nntPt2GOCfZXWM1cgdUfb8ZiVOfkMnv5mGSZotH7N7P58g3StnCEvaYFyf5W8N03G1+DQOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"700b73c995eea9d13ec1a8911466752592ed1623ae2d98207d755c1a743d2498","last_reissued_at":"2026-07-05T06:18:42.684260Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:18:42.684260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Longest Common Prefix Arrays for Succinct k-Spectra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elena Biagi, Jarno N. Alanko, Simon J. Puglisi","submitted_at":"2023-06-08T00:57:24Z","abstract_excerpt":"The k-spectrum of a string is the set of all distinct substrings of length k occurring in the string. K-spectra have many applications in bioinformatics including pseudoalignment and genome assembly. The Spectral Burrows-Wheeler Transform (SBWT) has been recently introduced as an algorithmic tool to efficiently represent and query these objects. The longest common prefix (LCP) array for a k-spectrum is an array of length n that stores the length of the longest common prefix of adjacent k-mers as they occur in lexicographical order. The LCP array has at least two important applications, namely "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.04850","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.04850/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2306.04850","created_at":"2026-07-05T06:18:42.684321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.04850v1","created_at":"2026-07-05T06:18:42.684321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.04850","created_at":"2026-07-05T06:18:42.684321+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAFXHSMV52U5","created_at":"2026-07-05T06:18:42.684321+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAFXHSMV52U5CPWB","created_at":"2026-07-05T06:18:42.684321+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAFXHSMV","created_at":"2026-07-05T06:18:42.684321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OAFXHSMV52U5CPWBVCIRIZTVEW","json":"https://pith.science/pith/OAFXHSMV52U5CPWBVCIRIZTVEW.json","graph_json":"https://pith.science/api/pith-number/OAFXHSMV52U5CPWBVCIRIZTVEW/graph.json","events_json":"https://pith.science/api/pith-number/OAFXHSMV52U5CPWBVCIRIZTVEW/events.json","paper":"https://pith.science/paper/OAFXHSMV"},"agent_actions":{"view_html":"https://pith.science/pith/OAFXHSMV52U5CPWBVCIRIZTVEW","download_json":"https://pith.science/pith/OAFXHSMV52U5CPWBVCIRIZTVEW.json","view_paper":"https://pith.science/paper/OAFXHSMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.04850&json=true","fetch_graph":"https://pith.science/api/pith-number/OAFXHSMV52U5CPWBVCIRIZTVEW/graph.json","fetch_events":"https://pith.science/api/pith-number/OAFXHSMV52U5CPWBVCIRIZTVEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAFXHSMV52U5CPWBVCIRIZTVEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAFXHSMV52U5CPWBVCIRIZTVEW/action/storage_attestation","attest_author":"https://pith.science/pith/OAFXHSMV52U5CPWBVCIRIZTVEW/action/author_attestation","sign_citation":"https://pith.science/pith/OAFXHSMV52U5CPWBVCIRIZTVEW/action/citation_signature","submit_replication":"https://pith.science/pith/OAFXHSMV52U5CPWBVCIRIZTVEW/action/replication_record"}},"created_at":"2026-07-05T06:18:42.684321+00:00","updated_at":"2026-07-05T06:18:42.684321+00:00"}