{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WTFDOGAHHFDJUW6BPF4C7JHHGJ","short_pith_number":"pith:WTFDOGAH","schema_version":"1.0","canonical_sha256":"b4ca37180739469a5bc179782fa4e7325cac26a987cfd1cb39fd12804526e97d","source":{"kind":"arxiv","id":"1304.7061","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.7061","created_at":"2026-05-18T03:27:02.668818+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7061v1","created_at":"2026-05-18T03:27:02.668818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7061","created_at":"2026-05-18T03:27:02.668818+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTFDOGAHHFDJ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTFDOGAHHFDJUW6B","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTFDOGAH","created_at":"2026-05-18T12:28:04.890932+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/WTFDOGAHHFDJUW6BPF4C7JHHGJ","json":"https://pith.science/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ.json","graph_json":"https://pith.science/api/pith-number/WTFDOGAHHFDJUW6BPF4C7JHHGJ/graph.json","events_json":"https://pith.science/api/pith-number/WTFDOGAHHFDJUW6BPF4C7JHHGJ/events.json","paper":"https://pith.science/paper/WTFDOGAH"},"agent_actions":{"view_html":"https://pith.science/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ","download_json":"https://pith.science/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ.json","view_paper":"https://pith.science/paper/WTFDOGAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7061&json=true","fetch_graph":"https://pith.science/api/pith-number/WTFDOGAHHFDJUW6BPF4C7JHHGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WTFDOGAHHFDJUW6BPF4C7JHHGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ/action/storage_attestation","attest_author":"https://pith.science/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ/action/author_attestation","sign_citation":"https://pith.science/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ/action/citation_signature","submit_replication":"https://pith.science/pith/WTFDOGAHHFDJUW6BPF4C7JHHGJ/action/replication_record"}},"created_at":"2026-05-18T03:27:02.668818+00:00","updated_at":"2026-05-18T03:27:02.668818+00:00"}