{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YFFZNSIMK4ZDJDBRYSFFY6A7QO","short_pith_number":"pith:YFFZNSIM","schema_version":"1.0","canonical_sha256":"c14b96c90c5732348c31c48a5c781f838d8776fad5a761fc044c60fbe0328ff7","source":{"kind":"arxiv","id":"1806.04890","version":1},"attestation_state":"computed","paper":{"title":"$O(n \\log n)$-time text compression by LZ-style longest first substitution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akihiro Nishi, Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Yuto Nakashima","submitted_at":"2018-06-13T08:30:00Z","abstract_excerpt":"Mauer et al. [A Lempel-Ziv-style Compression Method for Repetitive Texts, PSC 2017] proposed a hybrid text compression method called LZ-LFS which has both features of Lempel-Ziv 77 factorization and longest first substitution. They showed that LZ-LFS can achieve better compression ratio for repetitive texts, compared to some state-of-the-art compression algorithms. The drawback of Mauer et al.'s method is that their LZ-LFS compression algorithm takes $O(n^2)$ time on an input string of length $n$. In this paper, we show a faster LZ-LFS compression algorithm that works in $O(n \\log n)$ time. We"},"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":"1806.04890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-13T08:30:00Z","cross_cats_sorted":[],"title_canon_sha256":"e50c4f6c072ae4fa685b96498c38d15c8e608b69f8df97068d9fef6b9d59bfcf","abstract_canon_sha256":"1f384fa8932aa103fe3d4149db04c4f0e3c8c2a118b33adb3ee351312da8b4e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:20.606438Z","signature_b64":"Cv3e2YW6J1/gGeelIYGExmYwf+iccZEQA/tFqD/fJ8yg+OhfbI1oN/FNiJQaFN2D6GG4YBgfB8Q5ygAh1U4kDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c14b96c90c5732348c31c48a5c781f838d8776fad5a761fc044c60fbe0328ff7","last_reissued_at":"2026-05-18T00:13:20.605888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:20.605888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$O(n \\log n)$-time text compression by LZ-style longest first substitution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akihiro Nishi, Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Yuto Nakashima","submitted_at":"2018-06-13T08:30:00Z","abstract_excerpt":"Mauer et al. [A Lempel-Ziv-style Compression Method for Repetitive Texts, PSC 2017] proposed a hybrid text compression method called LZ-LFS which has both features of Lempel-Ziv 77 factorization and longest first substitution. They showed that LZ-LFS can achieve better compression ratio for repetitive texts, compared to some state-of-the-art compression algorithms. The drawback of Mauer et al.'s method is that their LZ-LFS compression algorithm takes $O(n^2)$ time on an input string of length $n$. In this paper, we show a faster LZ-LFS compression algorithm that works in $O(n \\log n)$ time. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04890","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.04890","created_at":"2026-05-18T00:13:20.605959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04890v1","created_at":"2026-05-18T00:13:20.605959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04890","created_at":"2026-05-18T00:13:20.605959+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFFZNSIMK4ZD","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFFZNSIMK4ZDJDBR","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFFZNSIM","created_at":"2026-05-18T12:33:04.347982+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/YFFZNSIMK4ZDJDBRYSFFY6A7QO","json":"https://pith.science/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO.json","graph_json":"https://pith.science/api/pith-number/YFFZNSIMK4ZDJDBRYSFFY6A7QO/graph.json","events_json":"https://pith.science/api/pith-number/YFFZNSIMK4ZDJDBRYSFFY6A7QO/events.json","paper":"https://pith.science/paper/YFFZNSIM"},"agent_actions":{"view_html":"https://pith.science/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO","download_json":"https://pith.science/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO.json","view_paper":"https://pith.science/paper/YFFZNSIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04890&json=true","fetch_graph":"https://pith.science/api/pith-number/YFFZNSIMK4ZDJDBRYSFFY6A7QO/graph.json","fetch_events":"https://pith.science/api/pith-number/YFFZNSIMK4ZDJDBRYSFFY6A7QO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO/action/storage_attestation","attest_author":"https://pith.science/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO/action/author_attestation","sign_citation":"https://pith.science/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO/action/citation_signature","submit_replication":"https://pith.science/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO/action/replication_record"}},"created_at":"2026-05-18T00:13:20.605959+00:00","updated_at":"2026-05-18T00:13:20.605959+00:00"}