{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:K6G3MUANT4JDORCIYTDGAIBEQB","short_pith_number":"pith:K6G3MUAN","schema_version":"1.0","canonical_sha256":"578db6500d9f12374448c4c6602024805e21c1613c016f61085ecd0f6b869a5e","source":{"kind":"arxiv","id":"2411.11298","version":1},"attestation_state":"computed","paper":{"title":"On the compressiveness of the Burrows-Wheeler transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Hideo Bannai, Tomohiro I, Yuto Nakashima","submitted_at":"2024-11-18T05:48:55Z","abstract_excerpt":"The Burrows-Wheeler transform (BWT) is a reversible transform that converts a string $w$ into another string $\\mathsf{BWT}(w)$. The size of the run-length encoded BWT (RLBWT) can be interpreted as a measure of repetitiveness in the class of representations called dictionary compression which are essentially representations based on copy and paste operations. In this paper, we shed new light on the compressiveness of BWT and the bijective BWT (BBWT). We first extend previous results on the relations of their run-length compressed sizes $r$ and $r_B$. We also show that the so-called ``clustering"},"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":"2411.11298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-11-18T05:48:55Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2de1638d03a89b8a4b642a082892d20209c9eba93a089142ade9fcfaee6950a5","abstract_canon_sha256":"09518cd425db8dff61b4554ae25e86d0af0a0481175bb94b1a748f618f6f7426"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:36:54.170375Z","signature_b64":"J33WKcZj8ceXirI7WhwPhe/leA+q4QvuguwrJqalNwL5k91aqA0zuqjP03yBI56eIyanjsA2ESVQHoMzpNCjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"578db6500d9f12374448c4c6602024805e21c1613c016f61085ecd0f6b869a5e","last_reissued_at":"2026-07-05T09:36:54.169938Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:36:54.169938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the compressiveness of the Burrows-Wheeler transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Hideo Bannai, Tomohiro I, Yuto Nakashima","submitted_at":"2024-11-18T05:48:55Z","abstract_excerpt":"The Burrows-Wheeler transform (BWT) is a reversible transform that converts a string $w$ into another string $\\mathsf{BWT}(w)$. The size of the run-length encoded BWT (RLBWT) can be interpreted as a measure of repetitiveness in the class of representations called dictionary compression which are essentially representations based on copy and paste operations. In this paper, we shed new light on the compressiveness of BWT and the bijective BWT (BBWT). We first extend previous results on the relations of their run-length compressed sizes $r$ and $r_B$. We also show that the so-called ``clustering"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11298","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/2411.11298/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":"2411.11298","created_at":"2026-07-05T09:36:54.169981+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.11298v1","created_at":"2026-07-05T09:36:54.169981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11298","created_at":"2026-07-05T09:36:54.169981+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6G3MUANT4JD","created_at":"2026-07-05T09:36:54.169981+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6G3MUANT4JDORCI","created_at":"2026-07-05T09:36:54.169981+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6G3MUAN","created_at":"2026-07-05T09:36:54.169981+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04926","citing_title":"Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K6G3MUANT4JDORCIYTDGAIBEQB","json":"https://pith.science/pith/K6G3MUANT4JDORCIYTDGAIBEQB.json","graph_json":"https://pith.science/api/pith-number/K6G3MUANT4JDORCIYTDGAIBEQB/graph.json","events_json":"https://pith.science/api/pith-number/K6G3MUANT4JDORCIYTDGAIBEQB/events.json","paper":"https://pith.science/paper/K6G3MUAN"},"agent_actions":{"view_html":"https://pith.science/pith/K6G3MUANT4JDORCIYTDGAIBEQB","download_json":"https://pith.science/pith/K6G3MUANT4JDORCIYTDGAIBEQB.json","view_paper":"https://pith.science/paper/K6G3MUAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.11298&json=true","fetch_graph":"https://pith.science/api/pith-number/K6G3MUANT4JDORCIYTDGAIBEQB/graph.json","fetch_events":"https://pith.science/api/pith-number/K6G3MUANT4JDORCIYTDGAIBEQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6G3MUANT4JDORCIYTDGAIBEQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6G3MUANT4JDORCIYTDGAIBEQB/action/storage_attestation","attest_author":"https://pith.science/pith/K6G3MUANT4JDORCIYTDGAIBEQB/action/author_attestation","sign_citation":"https://pith.science/pith/K6G3MUANT4JDORCIYTDGAIBEQB/action/citation_signature","submit_replication":"https://pith.science/pith/K6G3MUANT4JDORCIYTDGAIBEQB/action/replication_record"}},"created_at":"2026-07-05T09:36:54.169981+00:00","updated_at":"2026-07-05T09:36:54.169981+00:00"}