{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JM6UTXEKOWAUM67WD74ONRCA5A","short_pith_number":"pith:JM6UTXEK","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"},"canonical_sha256":"4b3d49dc8a7581467bf61ff8e6c440e80fb2fc415ca71976c7293887a2f33dea","source":{"kind":"arxiv","id":"1305.6095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6095","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6095v1","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6095","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"pith_short_12","alias_value":"JM6UTXEKOWAU","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JM6UTXEKOWAUM67W","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JM6UTXEK","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JM6UTXEKOWAUM67WD74ONRCA5A","target":"record","payload":{"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"},"canonical_sha256":"4b3d49dc8a7581467bf61ff8e6c440e80fb2fc415ca71976c7293887a2f33dea","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"},"source_kind":"arxiv","source_id":"1305.6095","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:24:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tdnz88GyBliDy0I8RB2RkpTgfKLlcdNzPTAFtECV0+VGIOPk0C8rardwZQuKJ10ZcjvYKh7AXZNGg+lWSCCXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:53:41.038374Z"},"content_sha256":"29191e033bf67c690e0aa066a4c8508d0e4de6caf7da1b7705d7ba20a39a2378","schema_version":"1.0","event_id":"sha256:29191e033bf67c690e0aa066a4c8508d0e4de6caf7da1b7705d7ba20a39a2378"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JM6UTXEKOWAUM67WD74ONRCA5A","target":"graph","payload":{"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"},"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:24:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oP8/EIW8If/jYmYOR5gmxw8ikGIJPRt+0VD7t7MbBKVlUMnb3twoeoEnx5qkn01Pp8wADPUdvGG+BfdiF1B4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:53:41.038724Z"},"content_sha256":"65786985435801e9869d6272a14be982a7f2d6f6907e8f561a9a8b5bb2b1a4c7","schema_version":"1.0","event_id":"sha256:65786985435801e9869d6272a14be982a7f2d6f6907e8f561a9a8b5bb2b1a4c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JM6UTXEKOWAUM67WD74ONRCA5A/bundle.json","state_url":"https://pith.science/pith/JM6UTXEKOWAUM67WD74ONRCA5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JM6UTXEKOWAUM67WD74ONRCA5A/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-28T07:53:41Z","links":{"resolver":"https://pith.science/pith/JM6UTXEKOWAUM67WD74ONRCA5A","bundle":"https://pith.science/pith/JM6UTXEKOWAUM67WD74ONRCA5A/bundle.json","state":"https://pith.science/pith/JM6UTXEKOWAUM67WD74ONRCA5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JM6UTXEKOWAUM67WD74ONRCA5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JM6UTXEKOWAUM67WD74ONRCA5A","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":"400c937b4c4772c0418cee7eb164726a367d8be9678603c81c1a7535841eb4c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-27T02:35:15Z","title_canon_sha256":"d704c2e7ad37b17759035ee01c8fbf77c7ee9b403728619cc19f541f7c31c30a"},"schema_version":"1.0","source":{"id":"1305.6095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6095","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6095v1","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6095","created_at":"2026-05-18T03:24:52Z"},{"alias_kind":"pith_short_12","alias_value":"JM6UTXEKOWAU","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JM6UTXEKOWAUM67W","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JM6UTXEK","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:65786985435801e9869d6272a14be982a7f2d6f6907e8f561a9a8b5bb2b1a4c7","target":"graph","created_at":"2026-05-18T03:24:52Z","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 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 ","authors_text":"Hideo Bannai, Jun'ichi Yamamoto, Masayuki Takeda, Shunsuke Inenaga, Tomohiro I","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-27T02:35:15Z","title":"Faster Compact On-Line Lempel-Ziv Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6095","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:29191e033bf67c690e0aa066a4c8508d0e4de6caf7da1b7705d7ba20a39a2378","target":"record","created_at":"2026-05-18T03:24:52Z","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":"400c937b4c4772c0418cee7eb164726a367d8be9678603c81c1a7535841eb4c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-27T02:35:15Z","title_canon_sha256":"d704c2e7ad37b17759035ee01c8fbf77c7ee9b403728619cc19f541f7c31c30a"},"schema_version":"1.0","source":{"id":"1305.6095","kind":"arxiv","version":1}},"canonical_sha256":"4b3d49dc8a7581467bf61ff8e6c440e80fb2fc415ca71976c7293887a2f33dea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b3d49dc8a7581467bf61ff8e6c440e80fb2fc415ca71976c7293887a2f33dea","first_computed_at":"2026-05-18T03:24:52.963228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:24:52.963228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ltckLIHXSxwYr0INNp//CBDOA76qbrFhhnx5PxFF8L1fk5UteYCDSH8LHtsGyeVBHm2W8UiFqXvqXIh8QqGpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:24:52.964012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29191e033bf67c690e0aa066a4c8508d0e4de6caf7da1b7705d7ba20a39a2378","sha256:65786985435801e9869d6272a14be982a7f2d6f6907e8f561a9a8b5bb2b1a4c7"],"state_sha256":"207e6cb319b9b0894b6bd9c1ccfff71fdf23f1eb10a6d27632d672ce7ee816d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Syus3IyGybNs1E363+0HueaAyCAq1d5bf3FBWcqCMOluhzVuFhG/NOsIkM5vMvQARXLgrtL9lV1WDoprHrkEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:53:41.040629Z","bundle_sha256":"475f4c3ba7247ae5bba4068e87ceb857c75e097099038bd6465398ed5a50554b"}}