{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WTFDOGAHHFDJUW6BPF4C7JHHGJ","short_pith_number":"pith:WTFDOGAH","canonical_record":{"source":{"id":"1304.7061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-26T04:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"1743be3f0e08dcd47ee0f1cd942e926f503269fe5a090e038d1335b2a4e08ca0","abstract_canon_sha256":"ff4cd415b59388f7a448bcf5b69555dc5d3935fff1c1c568cba10d3039eb9019"},"schema_version":"1.0"},"canonical_sha256":"b4ca37180739469a5bc179782fa4e7325cac26a987cfd1cb39fd12804526e97d","source":{"kind":"arxiv","id":"1304.7061","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7061","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7061v1","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7061","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"WTFDOGAHHFDJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WTFDOGAHHFDJUW6B","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WTFDOGAH","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WTFDOGAHHFDJUW6BPF4C7JHHGJ","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-26T04:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"1743be3f0e08dcd47ee0f1cd942e926f503269fe5a090e038d1335b2a4e08ca0","abstract_canon_sha256":"ff4cd415b59388f7a448bcf5b69555dc5d3935fff1c1c568cba10d3039eb9019"},"schema_version":"1.0"},"canonical_sha256":"b4ca37180739469a5bc179782fa4e7325cac26a987cfd1cb39fd12804526e97d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:02.669155Z","signature_b64":"fKTyWGB/bbtm+N1MhmMxtjl5Fl6vGXOYPLIXB4qnb8TYoAoOiBwnENVmovAOPZa9HM4nI+hTEQzdyVy7nedZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4ca37180739469a5bc179782fa4e7325cac26a987cfd1cb39fd12804526e97d","last_reissued_at":"2026-05-18T03:27:02.668764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:02.668764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7061","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:27:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIazZ+yRbb8xhK0ZhBM1HgGvk8kSbj5s9/T1TYYAVaG+fOwTck93Nv145AaVtbCPIpMaAXQpGdmEh8sOPEFlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:28:05.717112Z"},"content_sha256":"cbd193a882a5475c37462b50c96c7f17ee871d193691bbf833fa079e26b6853e","schema_version":"1.0","event_id":"sha256:cbd193a882a5475c37462b50c96c7f17ee871d193691bbf833fa079e26b6853e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WTFDOGAHHFDJUW6BPF4C7JHHGJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Lyndon 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, Tomohiro I, Yuto Nakashima","submitted_at":"2013-04-26T04:04:54Z","abstract_excerpt":"We present an algorithm for computing the Lyndon factorization of a string that is given in grammar compressed form, namely, a Straight Line Program (SLP). The algorithm runs in $O(n^4 + mn^3h)$ time and $O(n^2)$ space, where $m$ is the size of the Lyndon factorization, $n$ is the size of the SLP, and $h$ is the height of the derivation tree of the SLP. Since the length of the decompressed string can be exponentially large w.r.t. $n, m$ and $h$, our result is the first polynomial time solution when the string is given as SLP."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7061","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:27:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7iaAVK9Kgz1Rcb37ad3+HJJ7g+AUi1SD2s9cCIm//0fusfSiQe1VcZzM7mDtO8NpFHFbSHbFWppdiOwDP+ItAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:28:05.717486Z"},"content_sha256":"97206e365afb95d4175c2a75753c306a832c0c89745ae09be4c144db42f95068","schema_version":"1.0","event_id":"sha256:97206e365afb95d4175c2a75753c306a832c0c89745ae09be4c144db42f95068"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ/bundle.json","state_url":"https://pith.science/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ/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-28T15:28:05Z","links":{"resolver":"https://pith.science/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ","bundle":"https://pith.science/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ/bundle.json","state":"https://pith.science/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WTFDOGAHHFDJUW6BPF4C7JHHGJ","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":"ff4cd415b59388f7a448bcf5b69555dc5d3935fff1c1c568cba10d3039eb9019","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-26T04:04:54Z","title_canon_sha256":"1743be3f0e08dcd47ee0f1cd942e926f503269fe5a090e038d1335b2a4e08ca0"},"schema_version":"1.0","source":{"id":"1304.7061","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7061","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7061v1","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7061","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"WTFDOGAHHFDJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WTFDOGAHHFDJUW6B","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WTFDOGAH","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:97206e365afb95d4175c2a75753c306a832c0c89745ae09be4c144db42f95068","target":"graph","created_at":"2026-05-18T03:27:02Z","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 algorithm for computing the Lyndon factorization of a string that is given in grammar compressed form, namely, a Straight Line Program (SLP). The algorithm runs in $O(n^4 + mn^3h)$ time and $O(n^2)$ space, where $m$ is the size of the Lyndon factorization, $n$ is the size of the SLP, and $h$ is the height of the derivation tree of the SLP. Since the length of the decompressed string can be exponentially large w.r.t. $n, m$ and $h$, our result is the first polynomial time solution when the string is given as SLP.","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Tomohiro I, Yuto Nakashima","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-26T04:04:54Z","title":"Efficient Lyndon factorization of grammar compressed text"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7061","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:cbd193a882a5475c37462b50c96c7f17ee871d193691bbf833fa079e26b6853e","target":"record","created_at":"2026-05-18T03:27:02Z","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":"ff4cd415b59388f7a448bcf5b69555dc5d3935fff1c1c568cba10d3039eb9019","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-26T04:04:54Z","title_canon_sha256":"1743be3f0e08dcd47ee0f1cd942e926f503269fe5a090e038d1335b2a4e08ca0"},"schema_version":"1.0","source":{"id":"1304.7061","kind":"arxiv","version":1}},"canonical_sha256":"b4ca37180739469a5bc179782fa4e7325cac26a987cfd1cb39fd12804526e97d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4ca37180739469a5bc179782fa4e7325cac26a987cfd1cb39fd12804526e97d","first_computed_at":"2026-05-18T03:27:02.668764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:02.668764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fKTyWGB/bbtm+N1MhmMxtjl5Fl6vGXOYPLIXB4qnb8TYoAoOiBwnENVmovAOPZa9HM4nI+hTEQzdyVy7nedZAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:02.669155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7061","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbd193a882a5475c37462b50c96c7f17ee871d193691bbf833fa079e26b6853e","sha256:97206e365afb95d4175c2a75753c306a832c0c89745ae09be4c144db42f95068"],"state_sha256":"66ef5c976b4a179ecc2276f2dc2656caac78dfd231782d37086bd7d4228cab83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YtoyS/idwffYsAECeiNExx6iJTBwkWZb8u19Tuqo5qEiP6Lif1AymMf1TV9xhm0L66Vi3ZsBaVvJtq/PaG5+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:28:05.719429Z","bundle_sha256":"509c2685e55defc867d42f82b078e8d8d0a3d06da2f0d80542918481aca01ae9"}}