{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UIP26T7HPOXDSPPDR3CDHNAPOS","short_pith_number":"pith:UIP26T7H","canonical_record":{"source":{"id":"1310.1448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-05T06:10:43Z","cross_cats_sorted":[],"title_canon_sha256":"4d5a82ae748ea09f4f91bbef34f9244cac32c0d763f7974cf1278a008368ce87","abstract_canon_sha256":"f6d753cefdc2d01a49047d27fbbe99e6746e7cd6d5bd2a65d2115c574648c6aa"},"schema_version":"1.0"},"canonical_sha256":"a21faf4fe77bae393de38ec433b40f748d462c7eb631fe3699be44b8c64270c0","source":{"kind":"arxiv","id":"1310.1448","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1448","created_at":"2026-05-18T03:11:11Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1448v1","created_at":"2026-05-18T03:11:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1448","created_at":"2026-05-18T03:11:11Z"},{"alias_kind":"pith_short_12","alias_value":"UIP26T7HPOXD","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UIP26T7HPOXDSPPD","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UIP26T7H","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UIP26T7HPOXDSPPDR3CDHNAPOS","target":"record","payload":{"canonical_record":{"source":{"id":"1310.1448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-05T06:10:43Z","cross_cats_sorted":[],"title_canon_sha256":"4d5a82ae748ea09f4f91bbef34f9244cac32c0d763f7974cf1278a008368ce87","abstract_canon_sha256":"f6d753cefdc2d01a49047d27fbbe99e6746e7cd6d5bd2a65d2115c574648c6aa"},"schema_version":"1.0"},"canonical_sha256":"a21faf4fe77bae393de38ec433b40f748d462c7eb631fe3699be44b8c64270c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:11.992498Z","signature_b64":"hj6S2v1fjimABf/v6WAVh8PBJcea15Hvm+wtfxuegQTYHc+MZA9SGyH2aBLmBFJ9rHQS+hmW96rSoUtp1mU0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a21faf4fe77bae393de38ec433b40f748d462c7eb631fe3699be44b8c64270c0","last_reissued_at":"2026-05-18T03:11:11.992008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:11.992008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.1448","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-18T03:11:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sp+Xe716o0Rm3DsTciZjRKxrd1jYwqSj9uLm7x3rpt9DK5xi4+CTH4Buts3Dmhb54C2Jg352/Jvhdd1E/uD6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:19:02.252297Z"},"content_sha256":"539c0255f847e5e6660ef1dcbcd4a4c9bca499eec46497bdd90070d4b92c6e66","schema_version":"1.0","event_id":"sha256:539c0255f847e5e6660ef1dcbcd4a4c9bca499eec46497bdd90070d4b92c6e66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UIP26T7HPOXDSPPDR3CDHNAPOS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space Efficient Linear Time Lempel-Ziv Factorization on Constant~Size~Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Keisuke Goto","submitted_at":"2013-10-05T06:10:43Z","abstract_excerpt":"We present a new algorithm for computing the Lempel-Ziv Factorization (LZ77) of a given string of length $N$ in linear time, that utilizes only $N\\log N + O(1)$ bits of working space, i.e., a single integer array, for constant size integer alphabets. This greatly improves the previous best space requirement for linear time LZ77 factorization (K\\\"arkk\\\"ainen et al. CPM 2013), which requires two integer arrays of length $N$. Computational experiments show that despite the added complexity of the algorithm, the speed of the algorithm is only around twice as slow as previous fastest linear time al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1448","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-18T03:11:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXrgk++zoJxSCf835miw0zBUZValW8fb4l6C5lJCAQMFCk39BFnJmI9VWPRHDJSWvAgBBiFmRYOSJ61+0jHsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:19:02.253007Z"},"content_sha256":"ebc7318d5bf862719602692c52e3b3a1c026f87add6d51b8951a7901b539018e","schema_version":"1.0","event_id":"sha256:ebc7318d5bf862719602692c52e3b3a1c026f87add6d51b8951a7901b539018e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIP26T7HPOXDSPPDR3CDHNAPOS/bundle.json","state_url":"https://pith.science/pith/UIP26T7HPOXDSPPDR3CDHNAPOS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIP26T7HPOXDSPPDR3CDHNAPOS/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-28T17:19:02Z","links":{"resolver":"https://pith.science/pith/UIP26T7HPOXDSPPDR3CDHNAPOS","bundle":"https://pith.science/pith/UIP26T7HPOXDSPPDR3CDHNAPOS/bundle.json","state":"https://pith.science/pith/UIP26T7HPOXDSPPDR3CDHNAPOS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIP26T7HPOXDSPPDR3CDHNAPOS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UIP26T7HPOXDSPPDR3CDHNAPOS","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":"f6d753cefdc2d01a49047d27fbbe99e6746e7cd6d5bd2a65d2115c574648c6aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-05T06:10:43Z","title_canon_sha256":"4d5a82ae748ea09f4f91bbef34f9244cac32c0d763f7974cf1278a008368ce87"},"schema_version":"1.0","source":{"id":"1310.1448","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1448","created_at":"2026-05-18T03:11:11Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1448v1","created_at":"2026-05-18T03:11:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1448","created_at":"2026-05-18T03:11:11Z"},{"alias_kind":"pith_short_12","alias_value":"UIP26T7HPOXD","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UIP26T7HPOXDSPPD","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UIP26T7H","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:ebc7318d5bf862719602692c52e3b3a1c026f87add6d51b8951a7901b539018e","target":"graph","created_at":"2026-05-18T03:11:11Z","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":"We present a new algorithm for computing the Lempel-Ziv Factorization (LZ77) of a given string of length $N$ in linear time, that utilizes only $N\\log N + O(1)$ bits of working space, i.e., a single integer array, for constant size integer alphabets. This greatly improves the previous best space requirement for linear time LZ77 factorization (K\\\"arkk\\\"ainen et al. CPM 2013), which requires two integer arrays of length $N$. Computational experiments show that despite the added complexity of the algorithm, the speed of the algorithm is only around twice as slow as previous fastest linear time al","authors_text":"Hideo Bannai, Keisuke Goto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-05T06:10:43Z","title":"Space Efficient Linear Time Lempel-Ziv Factorization on Constant~Size~Alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1448","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:539c0255f847e5e6660ef1dcbcd4a4c9bca499eec46497bdd90070d4b92c6e66","target":"record","created_at":"2026-05-18T03:11:11Z","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":"f6d753cefdc2d01a49047d27fbbe99e6746e7cd6d5bd2a65d2115c574648c6aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-05T06:10:43Z","title_canon_sha256":"4d5a82ae748ea09f4f91bbef34f9244cac32c0d763f7974cf1278a008368ce87"},"schema_version":"1.0","source":{"id":"1310.1448","kind":"arxiv","version":1}},"canonical_sha256":"a21faf4fe77bae393de38ec433b40f748d462c7eb631fe3699be44b8c64270c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a21faf4fe77bae393de38ec433b40f748d462c7eb631fe3699be44b8c64270c0","first_computed_at":"2026-05-18T03:11:11.992008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:11.992008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hj6S2v1fjimABf/v6WAVh8PBJcea15Hvm+wtfxuegQTYHc+MZA9SGyH2aBLmBFJ9rHQS+hmW96rSoUtp1mU0Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:11.992498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1448","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:539c0255f847e5e6660ef1dcbcd4a4c9bca499eec46497bdd90070d4b92c6e66","sha256:ebc7318d5bf862719602692c52e3b3a1c026f87add6d51b8951a7901b539018e"],"state_sha256":"5faea9e79a3fd4170638bbb6d1b4ebe07acd68303159de1181e338b0c7da142c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ki8Xkr2rJYSlseGiFB7nYJUBmvJeNsjo5kCzvPwtt8D+wU5rKsj0BLN572RDWusBn21r9RxuRj7awPzVPjoXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:19:02.256659Z","bundle_sha256":"c31789c9af943dbea24469b4f252565abf34c613a3d6563dbc73e58ee5101607"}}