{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JU4KHCQFLXPUUDVLSAHSOJ66ZU","short_pith_number":"pith:JU4KHCQF","schema_version":"1.0","canonical_sha256":"4d38a38a055ddf4a0eab900f2727decd2c1f44ac0fb44fa722cdf1a5f7cbd207","source":{"kind":"arxiv","id":"2212.01156","version":1},"attestation_state":"computed","paper":{"title":"Computing the optimal BWT of very large string collections","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Cenzato, Giovanna Rosone, Veronica Guerrini, Zsuzsanna Lipt\\'ak","submitted_at":"2022-12-02T13:20:36Z","abstract_excerpt":"It is known that the exact form of the Burrows-Wheeler-Transform (BWT) of a string collection depends, in most implementations, on the input order of the strings in the collection. Reordering strings of an input collection affects the number of equal-letter runs $r$, arguably the most important parameter of BWT-based data structures, such as the FM-index or the $r$-index. Bentley, Gibney, and Thankachan [ESA 2020] introduced a linear-time algorithm for computing the permutation of the input collection which yields the minimum number of runs of the resulting BWT.\n  In this paper, we present the"},"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":"2212.01156","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-12-02T13:20:36Z","cross_cats_sorted":[],"title_canon_sha256":"4eaca032350466fd3e17f45b5e4a67810d44efdb51f97ec7c6234d2014867997","abstract_canon_sha256":"17b8b9e0b24736e56587acfc488c62c27d22ca5c877517ba054d30dd6ce94e2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:21:50.087501Z","signature_b64":"PtPEETEvpoVGoQGzgkuShFtZqSiYPOcAyurT4Kh+edrhv1i/cE/8cFgV3OweCGd+B+TEx91D9S695XkFF+5PBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d38a38a055ddf4a0eab900f2727decd2c1f44ac0fb44fa722cdf1a5f7cbd207","last_reissued_at":"2026-07-05T05:21:50.087153Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:21:50.087153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the optimal BWT of very large string collections","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Cenzato, Giovanna Rosone, Veronica Guerrini, Zsuzsanna Lipt\\'ak","submitted_at":"2022-12-02T13:20:36Z","abstract_excerpt":"It is known that the exact form of the Burrows-Wheeler-Transform (BWT) of a string collection depends, in most implementations, on the input order of the strings in the collection. Reordering strings of an input collection affects the number of equal-letter runs $r$, arguably the most important parameter of BWT-based data structures, such as the FM-index or the $r$-index. Bentley, Gibney, and Thankachan [ESA 2020] introduced a linear-time algorithm for computing the permutation of the input collection which yields the minimum number of runs of the resulting BWT.\n  In this paper, we present the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.01156","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/2212.01156/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":"2212.01156","created_at":"2026-07-05T05:21:50.087208+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.01156v1","created_at":"2026-07-05T05:21:50.087208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.01156","created_at":"2026-07-05T05:21:50.087208+00:00"},{"alias_kind":"pith_short_12","alias_value":"JU4KHCQFLXPU","created_at":"2026-07-05T05:21:50.087208+00:00"},{"alias_kind":"pith_short_16","alias_value":"JU4KHCQFLXPUUDVL","created_at":"2026-07-05T05:21:50.087208+00:00"},{"alias_kind":"pith_short_8","alias_value":"JU4KHCQF","created_at":"2026-07-05T05:21:50.087208+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/JU4KHCQFLXPUUDVLSAHSOJ66ZU","json":"https://pith.science/pith/JU4KHCQFLXPUUDVLSAHSOJ66ZU.json","graph_json":"https://pith.science/api/pith-number/JU4KHCQFLXPUUDVLSAHSOJ66ZU/graph.json","events_json":"https://pith.science/api/pith-number/JU4KHCQFLXPUUDVLSAHSOJ66ZU/events.json","paper":"https://pith.science/paper/JU4KHCQF"},"agent_actions":{"view_html":"https://pith.science/pith/JU4KHCQFLXPUUDVLSAHSOJ66ZU","download_json":"https://pith.science/pith/JU4KHCQFLXPUUDVLSAHSOJ66ZU.json","view_paper":"https://pith.science/paper/JU4KHCQF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.01156&json=true","fetch_graph":"https://pith.science/api/pith-number/JU4KHCQFLXPUUDVLSAHSOJ66ZU/graph.json","fetch_events":"https://pith.science/api/pith-number/JU4KHCQFLXPUUDVLSAHSOJ66ZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JU4KHCQFLXPUUDVLSAHSOJ66ZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JU4KHCQFLXPUUDVLSAHSOJ66ZU/action/storage_attestation","attest_author":"https://pith.science/pith/JU4KHCQFLXPUUDVLSAHSOJ66ZU/action/author_attestation","sign_citation":"https://pith.science/pith/JU4KHCQFLXPUUDVLSAHSOJ66ZU/action/citation_signature","submit_replication":"https://pith.science/pith/JU4KHCQFLXPUUDVLSAHSOJ66ZU/action/replication_record"}},"created_at":"2026-07-05T05:21:50.087208+00:00","updated_at":"2026-07-05T05:21:50.087208+00:00"}