{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DVEY4RE7BWQUT6MMTIEQREOPGY","short_pith_number":"pith:DVEY4RE7","schema_version":"1.0","canonical_sha256":"1d498e449f0da149f98c9a090891cf3607065b883e29c262963718cdf4889294","source":{"kind":"arxiv","id":"1304.7067","version":1},"attestation_state":"computed","paper":{"title":"Detecting regularities on grammar-compressed strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ayumi Shinohara, Hideo Bannai, Kazuyuki Narisawa, Kouji Shimohira, Masayuki Takeda, Shunsuke Inenaga, Tomohiro I, Wataru Matsubara","submitted_at":"2013-04-26T04:55:07Z","abstract_excerpt":"We solve the problems of detecting and counting various forms of regularities in a string represented as a Straight Line Program (SLP). Given an SLP of size $n$ that represents a string $s$ of length $N$, our algorithm compute all runs and squares in $s$ in $O(n^3h)$ time and $O(n^2)$ space, where $h$ is the height of the derivation tree of the SLP. We also show an algorithm to compute all gapped-palindromes in $O(n^3h + gnh\\log N)$ time and $O(n^2)$ space, where $g$ is the length of the gap. The key technique of the above solution also allows us to compute the periods and covers of the string"},"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.7067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-26T04:55:07Z","cross_cats_sorted":[],"title_canon_sha256":"6d25c845a89267ea0e1b955954327ca71a370eed2c332e497887f62e5b4e254a","abstract_canon_sha256":"9790498c9ac03127c2e91d7e59f92c280dab0688182db9f4cb0888e34e4104a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:02.663744Z","signature_b64":"CrQzfm4UKnV6ztDpbaDVKPyeSuVivwUtVbUhddlEJCLRLW7aSg5OqT93beYF/aAj//LHsdXrr/Ulf57AegJyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d498e449f0da149f98c9a090891cf3607065b883e29c262963718cdf4889294","last_reissued_at":"2026-05-18T03:27:02.663301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:02.663301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detecting regularities on grammar-compressed strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ayumi Shinohara, Hideo Bannai, Kazuyuki Narisawa, Kouji Shimohira, Masayuki Takeda, Shunsuke Inenaga, Tomohiro I, Wataru Matsubara","submitted_at":"2013-04-26T04:55:07Z","abstract_excerpt":"We solve the problems of detecting and counting various forms of regularities in a string represented as a Straight Line Program (SLP). Given an SLP of size $n$ that represents a string $s$ of length $N$, our algorithm compute all runs and squares in $s$ in $O(n^3h)$ time and $O(n^2)$ space, where $h$ is the height of the derivation tree of the SLP. We also show an algorithm to compute all gapped-palindromes in $O(n^3h + gnh\\log N)$ time and $O(n^2)$ space, where $g$ is the length of the gap. The key technique of the above solution also allows us to compute the periods and covers of the string"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7067","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.7067","created_at":"2026-05-18T03:27:02.663373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7067v1","created_at":"2026-05-18T03:27:02.663373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7067","created_at":"2026-05-18T03:27:02.663373+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVEY4RE7BWQU","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVEY4RE7BWQUT6MM","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVEY4RE7","created_at":"2026-05-18T12:27:43.054852+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/DVEY4RE7BWQUT6MMTIEQREOPGY","json":"https://pith.science/pith/DVEY4RE7BWQUT6MMTIEQREOPGY.json","graph_json":"https://pith.science/api/pith-number/DVEY4RE7BWQUT6MMTIEQREOPGY/graph.json","events_json":"https://pith.science/api/pith-number/DVEY4RE7BWQUT6MMTIEQREOPGY/events.json","paper":"https://pith.science/paper/DVEY4RE7"},"agent_actions":{"view_html":"https://pith.science/pith/DVEY4RE7BWQUT6MMTIEQREOPGY","download_json":"https://pith.science/pith/DVEY4RE7BWQUT6MMTIEQREOPGY.json","view_paper":"https://pith.science/paper/DVEY4RE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7067&json=true","fetch_graph":"https://pith.science/api/pith-number/DVEY4RE7BWQUT6MMTIEQREOPGY/graph.json","fetch_events":"https://pith.science/api/pith-number/DVEY4RE7BWQUT6MMTIEQREOPGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVEY4RE7BWQUT6MMTIEQREOPGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVEY4RE7BWQUT6MMTIEQREOPGY/action/storage_attestation","attest_author":"https://pith.science/pith/DVEY4RE7BWQUT6MMTIEQREOPGY/action/author_attestation","sign_citation":"https://pith.science/pith/DVEY4RE7BWQUT6MMTIEQREOPGY/action/citation_signature","submit_replication":"https://pith.science/pith/DVEY4RE7BWQUT6MMTIEQREOPGY/action/replication_record"}},"created_at":"2026-05-18T03:27:02.663373+00:00","updated_at":"2026-05-18T03:27:02.663373+00:00"}