{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YFFZNSIMK4ZDJDBRYSFFY6A7QO","short_pith_number":"pith:YFFZNSIM","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"},"canonical_sha256":"c14b96c90c5732348c31c48a5c781f838d8776fad5a761fc044c60fbe0328ff7","source":{"kind":"arxiv","id":"1806.04890","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04890","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04890v1","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04890","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"YFFZNSIMK4ZD","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YFFZNSIMK4ZDJDBR","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YFFZNSIM","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YFFZNSIMK4ZDJDBRYSFFY6A7QO","target":"record","payload":{"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"},"canonical_sha256":"c14b96c90c5732348c31c48a5c781f838d8776fad5a761fc044c60fbe0328ff7","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"},"source_kind":"arxiv","source_id":"1806.04890","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-18T00:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ircyGMpn0clHZHyFifuglu3tvEsM1psH8o11HNX1xMPfVrccKfjXYlntkY+34Ir9uEQE9YPIdyiX7DwK3jlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:13:19.247787Z"},"content_sha256":"9249a7242aa77a48e16440808af472a508a3f3958593b71f42413b7c1a2e3243","schema_version":"1.0","event_id":"sha256:9249a7242aa77a48e16440808af472a508a3f3958593b71f42413b7c1a2e3243"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YFFZNSIMK4ZDJDBRYSFFY6A7QO","target":"graph","payload":{"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"},"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-18T00:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lwishxUzl4EYmpF3A+zs1jF3xvVxiL80xrVLv6z/DX2m+bIisOZJ1pzXfi56GfmZ6q4sRrVymd3tZ14sv50WCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:13:19.248135Z"},"content_sha256":"c027b52362f83fb05ab1a8dbacd87ec2f7032847fbf32c814578645e7c9da80d","schema_version":"1.0","event_id":"sha256:c027b52362f83fb05ab1a8dbacd87ec2f7032847fbf32c814578645e7c9da80d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO/bundle.json","state_url":"https://pith.science/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO/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-05-28T14:13:19Z","links":{"resolver":"https://pith.science/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO","bundle":"https://pith.science/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO/bundle.json","state":"https://pith.science/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFFZNSIMK4ZDJDBRYSFFY6A7QO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YFFZNSIMK4ZDJDBRYSFFY6A7QO","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":"1f384fa8932aa103fe3d4149db04c4f0e3c8c2a118b33adb3ee351312da8b4e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-13T08:30:00Z","title_canon_sha256":"e50c4f6c072ae4fa685b96498c38d15c8e608b69f8df97068d9fef6b9d59bfcf"},"schema_version":"1.0","source":{"id":"1806.04890","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04890","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04890v1","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04890","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"YFFZNSIMK4ZD","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YFFZNSIMK4ZDJDBR","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YFFZNSIM","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:c027b52362f83fb05ab1a8dbacd87ec2f7032847fbf32c814578645e7c9da80d","target":"graph","created_at":"2026-05-18T00:13:20Z","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":"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","authors_text":"Akihiro Nishi, Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Yuto Nakashima","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-13T08:30:00Z","title":"$O(n \\log n)$-time text compression by LZ-style longest first substitution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04890","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:9249a7242aa77a48e16440808af472a508a3f3958593b71f42413b7c1a2e3243","target":"record","created_at":"2026-05-18T00:13:20Z","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":"1f384fa8932aa103fe3d4149db04c4f0e3c8c2a118b33adb3ee351312da8b4e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-13T08:30:00Z","title_canon_sha256":"e50c4f6c072ae4fa685b96498c38d15c8e608b69f8df97068d9fef6b9d59bfcf"},"schema_version":"1.0","source":{"id":"1806.04890","kind":"arxiv","version":1}},"canonical_sha256":"c14b96c90c5732348c31c48a5c781f838d8776fad5a761fc044c60fbe0328ff7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c14b96c90c5732348c31c48a5c781f838d8776fad5a761fc044c60fbe0328ff7","first_computed_at":"2026-05-18T00:13:20.605888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:20.605888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cv3e2YW6J1/gGeelIYGExmYwf+iccZEQA/tFqD/fJ8yg+OhfbI1oN/FNiJQaFN2D6GG4YBgfB8Q5ygAh1U4kDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:20.606438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04890","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9249a7242aa77a48e16440808af472a508a3f3958593b71f42413b7c1a2e3243","sha256:c027b52362f83fb05ab1a8dbacd87ec2f7032847fbf32c814578645e7c9da80d"],"state_sha256":"d91b5eb862a1645c55137a3839e647dd6871a4a137fc5b0a4cf15db310dc360b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4iPX6yUXLI8ewmUH59/l2ItqBmgjViNSW4kPcec8ypQRrM+MuqIv9wHweUGza5W6LwNw2CIJ5+U/ReblNOsAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:13:19.250063Z","bundle_sha256":"e0a1f0ebddce5594d0139cc35ab1715db11374b4ded63cf52d0bc2a18b2966b1"}}