{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:V6WS4CI6YHY34MMYXF4N3VWQJ7","short_pith_number":"pith:V6WS4CI6","schema_version":"1.0","canonical_sha256":"afad2e091ec1f1be3198b978ddd6d04fecf27e990fe1fb435d579362a10cca4f","source":{"kind":"arxiv","id":"1202.3311","version":1},"attestation_state":"computed","paper":{"title":"Speeding-up $q$-gram mining on grammar-based compressed texts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Keisuke Goto, Masayuki Takeda, Shunsuke Inenaga","submitted_at":"2012-02-15T14:13:02Z","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"},"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":"1202.3311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-15T14:13:02Z","cross_cats_sorted":[],"title_canon_sha256":"8992622db30b66bb8131ecb533382086f917858aa2596602a7798d795193a13c","abstract_canon_sha256":"84e1e6262da92adb4ca224083a999e2e227889c0dc483e12e9b25c09d90d4433"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:04.350353Z","signature_b64":"tInwQQIPL2v689VWClbWMQjtagAGCsBn1LMAGfW0G7G5IAXCt2wsNffB/oyNBeeqOkDCYlE1WPxQIwHcPJ3iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afad2e091ec1f1be3198b978ddd6d04fecf27e990fe1fb435d579362a10cca4f","last_reissued_at":"2026-05-18T03:25:04.349823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:04.349823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speeding-up $q$-gram mining on grammar-based compressed texts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Keisuke Goto, Masayuki Takeda, Shunsuke Inenaga","submitted_at":"2012-02-15T14:13:02Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3311","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":"1202.3311","created_at":"2026-05-18T03:25:04.349899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3311v1","created_at":"2026-05-18T03:25:04.349899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3311","created_at":"2026-05-18T03:25:04.349899+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6WS4CI6YHY3","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6WS4CI6YHY34MMY","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6WS4CI6","created_at":"2026-05-18T12:27:25.539911+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/V6WS4CI6YHY34MMYXF4N3VWQJ7","json":"https://pith.science/pith/V6WS4CI6YHY34MMYXF4N3VWQJ7.json","graph_json":"https://pith.science/api/pith-number/V6WS4CI6YHY34MMYXF4N3VWQJ7/graph.json","events_json":"https://pith.science/api/pith-number/V6WS4CI6YHY34MMYXF4N3VWQJ7/events.json","paper":"https://pith.science/paper/V6WS4CI6"},"agent_actions":{"view_html":"https://pith.science/pith/V6WS4CI6YHY34MMYXF4N3VWQJ7","download_json":"https://pith.science/pith/V6WS4CI6YHY34MMYXF4N3VWQJ7.json","view_paper":"https://pith.science/paper/V6WS4CI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3311&json=true","fetch_graph":"https://pith.science/api/pith-number/V6WS4CI6YHY34MMYXF4N3VWQJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/V6WS4CI6YHY34MMYXF4N3VWQJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6WS4CI6YHY34MMYXF4N3VWQJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6WS4CI6YHY34MMYXF4N3VWQJ7/action/storage_attestation","attest_author":"https://pith.science/pith/V6WS4CI6YHY34MMYXF4N3VWQJ7/action/author_attestation","sign_citation":"https://pith.science/pith/V6WS4CI6YHY34MMYXF4N3VWQJ7/action/citation_signature","submit_replication":"https://pith.science/pith/V6WS4CI6YHY34MMYXF4N3VWQJ7/action/replication_record"}},"created_at":"2026-05-18T03:25:04.349899+00:00","updated_at":"2026-05-18T03:25:04.349899+00:00"}