{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FZAAS6IR2ERSWLX3PII7FJGXKU","short_pith_number":"pith:FZAAS6IR","schema_version":"1.0","canonical_sha256":"2e40097911d1232b2efb7a11f2a4d75500742ae6d4221e881ba2a7ed6c33cee1","source":{"kind":"arxiv","id":"1510.02882","version":5},"attestation_state":"computed","paper":{"title":"Lempel-Ziv Computation In Compressed Space (LZ-CICS)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dominik K\\\"oppl, Kunihiko Sadakane","submitted_at":"2015-10-10T07:14:09Z","abstract_excerpt":"We show that both the Lempel Ziv 77- and the 78-factorization of a text of length $n$ on an integer alphabet of size $\\sigma$ can be computed in $O(n \\lg \\lg \\sigma)$ time (linear time if we allow randomization) using $O(n \\lg \\sigma)$ bits of working space. Given that a compressed representation of the suffix tree is loaded into RAM, we can compute both factorizations in $O(n)$ time using $z \\lg n + O(n)$ bits of space, where $z$ is the number of factors."},"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":"1510.02882","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-10T07:14:09Z","cross_cats_sorted":[],"title_canon_sha256":"f563ee5ff3a8e7aadd18fdba22c21665a942f1da6ca1430f50f7a52ed5e81ac1","abstract_canon_sha256":"5eaf56227ab3b5703ac66cd532e4e217ad07ced63321220be8cf3edeae21cd99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:24.013719Z","signature_b64":"OYsyfmZ63R9ALUcZ++mcZC4rSO34TkfNZ+kAiKfZaSczqyhTQ4wxYpykgNQPoCWuJls5tW7cUnYx29fqspepDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e40097911d1232b2efb7a11f2a4d75500742ae6d4221e881ba2a7ed6c33cee1","last_reissued_at":"2026-05-18T01:13:24.013325Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:24.013325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lempel-Ziv Computation In Compressed Space (LZ-CICS)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dominik K\\\"oppl, Kunihiko Sadakane","submitted_at":"2015-10-10T07:14:09Z","abstract_excerpt":"We show that both the Lempel Ziv 77- and the 78-factorization of a text of length $n$ on an integer alphabet of size $\\sigma$ can be computed in $O(n \\lg \\lg \\sigma)$ time (linear time if we allow randomization) using $O(n \\lg \\sigma)$ bits of working space. Given that a compressed representation of the suffix tree is loaded into RAM, we can compute both factorizations in $O(n)$ time using $z \\lg n + O(n)$ bits of space, where $z$ is the number of factors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02882","kind":"arxiv","version":5},"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":"1510.02882","created_at":"2026-05-18T01:13:24.013389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.02882v5","created_at":"2026-05-18T01:13:24.013389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02882","created_at":"2026-05-18T01:13:24.013389+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZAAS6IR2ERS","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZAAS6IR2ERSWLX3","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZAAS6IR","created_at":"2026-05-18T12:29:22.688609+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/FZAAS6IR2ERSWLX3PII7FJGXKU","json":"https://pith.science/pith/FZAAS6IR2ERSWLX3PII7FJGXKU.json","graph_json":"https://pith.science/api/pith-number/FZAAS6IR2ERSWLX3PII7FJGXKU/graph.json","events_json":"https://pith.science/api/pith-number/FZAAS6IR2ERSWLX3PII7FJGXKU/events.json","paper":"https://pith.science/paper/FZAAS6IR"},"agent_actions":{"view_html":"https://pith.science/pith/FZAAS6IR2ERSWLX3PII7FJGXKU","download_json":"https://pith.science/pith/FZAAS6IR2ERSWLX3PII7FJGXKU.json","view_paper":"https://pith.science/paper/FZAAS6IR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.02882&json=true","fetch_graph":"https://pith.science/api/pith-number/FZAAS6IR2ERSWLX3PII7FJGXKU/graph.json","fetch_events":"https://pith.science/api/pith-number/FZAAS6IR2ERSWLX3PII7FJGXKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZAAS6IR2ERSWLX3PII7FJGXKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZAAS6IR2ERSWLX3PII7FJGXKU/action/storage_attestation","attest_author":"https://pith.science/pith/FZAAS6IR2ERSWLX3PII7FJGXKU/action/author_attestation","sign_citation":"https://pith.science/pith/FZAAS6IR2ERSWLX3PII7FJGXKU/action/citation_signature","submit_replication":"https://pith.science/pith/FZAAS6IR2ERSWLX3PII7FJGXKU/action/replication_record"}},"created_at":"2026-05-18T01:13:24.013389+00:00","updated_at":"2026-05-18T01:13:24.013389+00:00"}