{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IROHP766DBJ4BC7PWHL4FS5WMB","short_pith_number":"pith:IROHP766","canonical_record":{"source":{"id":"1207.4607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T10:28:56Z","cross_cats_sorted":[],"title_canon_sha256":"37ca0bc0b569d10c870b0eb9382a6afacf655c4550bcce209bf222792cd3d867","abstract_canon_sha256":"ae7dcd3e3698dd5aaeac0289b68f8f7818157fb73d252162775e6e7bf92a3098"},"schema_version":"1.0"},"canonical_sha256":"445c77ffde1853c08befb1d7c2cbb6604e22c3e216c04a3f72639f2bb2ff05c5","source":{"kind":"arxiv","id":"1207.4607","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4607","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4607v1","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4607","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"IROHP766DBJ4","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IROHP766DBJ4BC7P","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IROHP766","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IROHP766DBJ4BC7PWHL4FS5WMB","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T10:28:56Z","cross_cats_sorted":[],"title_canon_sha256":"37ca0bc0b569d10c870b0eb9382a6afacf655c4550bcce209bf222792cd3d867","abstract_canon_sha256":"ae7dcd3e3698dd5aaeac0289b68f8f7818157fb73d252162775e6e7bf92a3098"},"schema_version":"1.0"},"canonical_sha256":"445c77ffde1853c08befb1d7c2cbb6604e22c3e216c04a3f72639f2bb2ff05c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:04.235030Z","signature_b64":"t+T2yponfPGc+rPS/rBEekllWOiLG3eToPLZHZSmLCsOtpBYiJHQ/TleU+vQNmXmYRJvwEfDFmJOh/y3mWyJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"445c77ffde1853c08befb1d7c2cbb6604e22c3e216c04a3f72639f2bb2ff05c5","last_reissued_at":"2026-05-18T03:25:04.234180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:04.234180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4607","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:25:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bGRrCmEzMUUm2mLTrCzc1zdhHK9BHdzqtBWBrjsFnLVa+3Qcl75twSDn01WDRHmao43VIJDVZufmnW4LTxPBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:59:35.388817Z"},"content_sha256":"b77f2427a545debd0806018ed754f15ee2d56eb48b75fea6e3abeedfc1ea621e","schema_version":"1.0","event_id":"sha256:b77f2427a545debd0806018ed754f15ee2d56eb48b75fea6e3abeedfc1ea621e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IROHP766DBJ4BC7PWHL4FS5WMB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient LZ78 factorization of grammar compressed text","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga","submitted_at":"2012-07-19T10:28:56Z","abstract_excerpt":"We present an efficient algorithm for computing the LZ78 factorization of a text, where the text is represented as a straight line program (SLP), which is a context free grammar in the Chomsky normal form that generates a single string. Given an SLP of size $n$ representing a text $S$ of length $N$, our algorithm computes the LZ78 factorization of $T$ in $O(n\\sqrt{N}+m\\log N)$ time and $O(n\\sqrt{N}+m)$ space, where $m$ is the number of resulting LZ78 factors. We also show how to improve the algorithm so that the $n\\sqrt{N}$ term in the time and space complexities becomes either $nL$, where $L$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4607","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:25:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NWiv4cbKj8lhuGVG8dCJo8xhq4YVS2MK4gHweUmPkImyEVdQQe83tAV+PwVN2KBb+gnAGBGcNVWPEAExKpnWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:59:35.389158Z"},"content_sha256":"48de9bf22cdc5ccf5d737455812c13182759240453f4cec6afce0ea419523354","schema_version":"1.0","event_id":"sha256:48de9bf22cdc5ccf5d737455812c13182759240453f4cec6afce0ea419523354"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IROHP766DBJ4BC7PWHL4FS5WMB/bundle.json","state_url":"https://pith.science/pith/IROHP766DBJ4BC7PWHL4FS5WMB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IROHP766DBJ4BC7PWHL4FS5WMB/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-28T05:59:35Z","links":{"resolver":"https://pith.science/pith/IROHP766DBJ4BC7PWHL4FS5WMB","bundle":"https://pith.science/pith/IROHP766DBJ4BC7PWHL4FS5WMB/bundle.json","state":"https://pith.science/pith/IROHP766DBJ4BC7PWHL4FS5WMB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IROHP766DBJ4BC7PWHL4FS5WMB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IROHP766DBJ4BC7PWHL4FS5WMB","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":"ae7dcd3e3698dd5aaeac0289b68f8f7818157fb73d252162775e6e7bf92a3098","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T10:28:56Z","title_canon_sha256":"37ca0bc0b569d10c870b0eb9382a6afacf655c4550bcce209bf222792cd3d867"},"schema_version":"1.0","source":{"id":"1207.4607","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4607","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4607v1","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4607","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"IROHP766DBJ4","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IROHP766DBJ4BC7P","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IROHP766","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:48de9bf22cdc5ccf5d737455812c13182759240453f4cec6afce0ea419523354","target":"graph","created_at":"2026-05-18T03:25:04Z","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 an efficient algorithm for computing the LZ78 factorization of a text, where the text is represented as a straight line program (SLP), which is a context free grammar in the Chomsky normal form that generates a single string. Given an SLP of size $n$ representing a text $S$ of length $N$, our algorithm computes the LZ78 factorization of $T$ in $O(n\\sqrt{N}+m\\log N)$ time and $O(n\\sqrt{N}+m)$ space, where $m$ is the number of resulting LZ78 factors. We also show how to improve the algorithm so that the $n\\sqrt{N}$ term in the time and space complexities becomes either $nL$, where $L$","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T10:28:56Z","title":"Efficient LZ78 factorization of grammar compressed text"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4607","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:b77f2427a545debd0806018ed754f15ee2d56eb48b75fea6e3abeedfc1ea621e","target":"record","created_at":"2026-05-18T03:25:04Z","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":"ae7dcd3e3698dd5aaeac0289b68f8f7818157fb73d252162775e6e7bf92a3098","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T10:28:56Z","title_canon_sha256":"37ca0bc0b569d10c870b0eb9382a6afacf655c4550bcce209bf222792cd3d867"},"schema_version":"1.0","source":{"id":"1207.4607","kind":"arxiv","version":1}},"canonical_sha256":"445c77ffde1853c08befb1d7c2cbb6604e22c3e216c04a3f72639f2bb2ff05c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"445c77ffde1853c08befb1d7c2cbb6604e22c3e216c04a3f72639f2bb2ff05c5","first_computed_at":"2026-05-18T03:25:04.234180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:04.234180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t+T2yponfPGc+rPS/rBEekllWOiLG3eToPLZHZSmLCsOtpBYiJHQ/TleU+vQNmXmYRJvwEfDFmJOh/y3mWyJBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:04.235030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4607","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b77f2427a545debd0806018ed754f15ee2d56eb48b75fea6e3abeedfc1ea621e","sha256:48de9bf22cdc5ccf5d737455812c13182759240453f4cec6afce0ea419523354"],"state_sha256":"2ec7a9916aa45fd0873f6b6d90ee5607bb126a909175d48738c4e9ae362e38a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SCLFL+dDLUxouW4wL2RuEcO4tTqoVguLI/astLj7mIWqY+c5yAvagj/m3g1jXPqLvkf5raFsq2hv+qmWVHb7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:59:35.391185Z","bundle_sha256":"619e54e3c9a2bd1cd6874b815ce6f3341ea622a8d6c2f7f10d8bc626c4ec62ac"}}