{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:V6WS4CI6YHY34MMYXF4N3VWQJ7","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":"84e1e6262da92adb4ca224083a999e2e227889c0dc483e12e9b25c09d90d4433","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-15T14:13:02Z","title_canon_sha256":"8992622db30b66bb8131ecb533382086f917858aa2596602a7798d795193a13c"},"schema_version":"1.0","source":{"id":"1202.3311","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3311","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3311v1","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3311","created_at":"2026-05-18T03:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"V6WS4CI6YHY3","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"V6WS4CI6YHY34MMY","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"V6WS4CI6","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:cfa49deb2344f0cda8cd14a2c013d78412e7ef525b0bca99cf8a128bd36d8adf","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 calculating $q$-gram frequencies on strings represented in compressed form, namely, as a straight line program (SLP). Given an SLP $\\mathcal{T}$ of size $n$ that represents string $T$, the algorithm computes the occurrence frequencies of all $q$-grams in $T$, by reducing the problem to the weighted $q$-gram frequencies problem on a trie-like structure of size $m = |T|-\\mathit{dup}(q,\\mathcal{T})$, where $\\mathit{dup}(q,\\mathcal{T})$ is a quantity that represents the amount of redundancy that the SLP captures with respect to $q$-grams. The reduced problem c","authors_text":"Hideo Bannai, Keisuke Goto, Masayuki Takeda, Shunsuke Inenaga","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-15T14:13:02Z","title":"Speeding-up $q$-gram mining on grammar-based compressed texts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3311","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:620443ffbda88d775ad10a2d84a5b32fbda5517bc058f6fc8684cbdd2adf7024","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":"84e1e6262da92adb4ca224083a999e2e227889c0dc483e12e9b25c09d90d4433","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-15T14:13:02Z","title_canon_sha256":"8992622db30b66bb8131ecb533382086f917858aa2596602a7798d795193a13c"},"schema_version":"1.0","source":{"id":"1202.3311","kind":"arxiv","version":1}},"canonical_sha256":"afad2e091ec1f1be3198b978ddd6d04fecf27e990fe1fb435d579362a10cca4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afad2e091ec1f1be3198b978ddd6d04fecf27e990fe1fb435d579362a10cca4f","first_computed_at":"2026-05-18T03:25:04.349823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:04.349823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tInwQQIPL2v689VWClbWMQjtagAGCsBn1LMAGfW0G7G5IAXCt2wsNffB/oyNBeeqOkDCYlE1WPxQIwHcPJ3iCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:04.350353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3311","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:620443ffbda88d775ad10a2d84a5b32fbda5517bc058f6fc8684cbdd2adf7024","sha256:cfa49deb2344f0cda8cd14a2c013d78412e7ef525b0bca99cf8a128bd36d8adf"],"state_sha256":"a51d6a2b34317b52eaea5a8199df5d4359b69750f0a937a33a6c742a0f648beb"}