{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JM6UTXEKOWAUM67WD74ONRCA5A","short_pith_number":"pith:JM6UTXEK","schema_version":"1.0","canonical_sha256":"4b3d49dc8a7581467bf61ff8e6c440e80fb2fc415ca71976c7293887a2f33dea","source":{"kind":"arxiv","id":"1305.6095","version":1},"attestation_state":"computed","paper":{"title":"Faster Compact On-Line Lempel-Ziv Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Jun'ichi Yamamoto, Masayuki Takeda, Shunsuke Inenaga, Tomohiro I","submitted_at":"2013-05-27T02:35:15Z","abstract_excerpt":"We present a new on-line algorithm for computing the Lempel-Ziv factorization of a string that runs in $O(N\\log N)$ time and uses only $O(N\\log\\sigma)$ bits of working space, where $N$ is the length of the string and $\\sigma$ is the size of the alphabet. This is a notable improvement compared to the performance of previous on-line algorithms using the same order of working space but running in either $O(N\\log^3N)$ time (Okanohara & Sadakane 2009) or $O(N\\log^2N)$ time (Starikovskaya 2012). The key to our new algorithm is in the utilization of an elegant but less popular index structure called "},"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":"1305.6095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-27T02:35:15Z","cross_cats_sorted":[],"title_canon_sha256":"d704c2e7ad37b17759035ee01c8fbf77c7ee9b403728619cc19f541f7c31c30a","abstract_canon_sha256":"400c937b4c4772c0418cee7eb164726a367d8be9678603c81c1a7535841eb4c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:52.964012Z","signature_b64":"ltckLIHXSxwYr0INNp//CBDOA76qbrFhhnx5PxFF8L1fk5UteYCDSH8LHtsGyeVBHm2W8UiFqXvqXIh8QqGpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b3d49dc8a7581467bf61ff8e6c440e80fb2fc415ca71976c7293887a2f33dea","last_reissued_at":"2026-05-18T03:24:52.963228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:52.963228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Compact On-Line Lempel-Ziv Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Jun'ichi Yamamoto, Masayuki Takeda, Shunsuke Inenaga, Tomohiro I","submitted_at":"2013-05-27T02:35:15Z","abstract_excerpt":"We present a new on-line algorithm for computing the Lempel-Ziv factorization of a string that runs in $O(N\\log N)$ time and uses only $O(N\\log\\sigma)$ bits of working space, where $N$ is the length of the string and $\\sigma$ is the size of the alphabet. This is a notable improvement compared to the performance of previous on-line algorithms using the same order of working space but running in either $O(N\\log^3N)$ time (Okanohara & Sadakane 2009) or $O(N\\log^2N)$ time (Starikovskaya 2012). The key to our new algorithm is in the utilization of an elegant but less popular index structure called "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6095","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":"1305.6095","created_at":"2026-05-18T03:24:52.963367+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.6095v1","created_at":"2026-05-18T03:24:52.963367+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6095","created_at":"2026-05-18T03:24:52.963367+00:00"},{"alias_kind":"pith_short_12","alias_value":"JM6UTXEKOWAU","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JM6UTXEKOWAUM67W","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JM6UTXEK","created_at":"2026-05-18T12:27:49.015174+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/JM6UTXEKOWAUM67WD74ONRCA5A","json":"https://pith.science/pith/JM6UTXEKOWAUM67WD74ONRCA5A.json","graph_json":"https://pith.science/api/pith-number/JM6UTXEKOWAUM67WD74ONRCA5A/graph.json","events_json":"https://pith.science/api/pith-number/JM6UTXEKOWAUM67WD74ONRCA5A/events.json","paper":"https://pith.science/paper/JM6UTXEK"},"agent_actions":{"view_html":"https://pith.science/pith/JM6UTXEKOWAUM67WD74ONRCA5A","download_json":"https://pith.science/pith/JM6UTXEKOWAUM67WD74ONRCA5A.json","view_paper":"https://pith.science/paper/JM6UTXEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.6095&json=true","fetch_graph":"https://pith.science/api/pith-number/JM6UTXEKOWAUM67WD74ONRCA5A/graph.json","fetch_events":"https://pith.science/api/pith-number/JM6UTXEKOWAUM67WD74ONRCA5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JM6UTXEKOWAUM67WD74ONRCA5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JM6UTXEKOWAUM67WD74ONRCA5A/action/storage_attestation","attest_author":"https://pith.science/pith/JM6UTXEKOWAUM67WD74ONRCA5A/action/author_attestation","sign_citation":"https://pith.science/pith/JM6UTXEKOWAUM67WD74ONRCA5A/action/citation_signature","submit_replication":"https://pith.science/pith/JM6UTXEKOWAUM67WD74ONRCA5A/action/replication_record"}},"created_at":"2026-05-18T03:24:52.963367+00:00","updated_at":"2026-05-18T03:24:52.963367+00:00"}