{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DPTN4BSDW6Q7YZCRFO2ZNXQHD6","short_pith_number":"pith:DPTN4BSD","schema_version":"1.0","canonical_sha256":"1be6de0643b7a1fc64512bb596de071fa0e6f2517cc5074c600f444982bed28c","source":{"kind":"arxiv","id":"1607.04446","version":3},"attestation_state":"computed","paper":{"title":"Online Grammar Compression for Frequent Pattern Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Sakamoto, I Tomohiro, Shouhei Fukunaga, Yoshimasa Takabatake","submitted_at":"2016-07-15T10:42:20Z","abstract_excerpt":"Various grammar compression algorithms have been proposed in the last decade. A grammar compression is a restricted CFG deriving the string deterministically. An efficient grammar compression develops a smaller CFG by finding duplicated patterns and removing them. This process is just a frequent pattern discovery by grammatical inference. While we can get any frequent pattern in linear time using a preprocessed string, a huge working space is required for longer patterns, and the whole string must be loaded into the memory preliminarily. We propose an online algorithm approximating this proble"},"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":"1607.04446","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-15T10:42:20Z","cross_cats_sorted":[],"title_canon_sha256":"d0159db561903858db719112f2d38143258c33f5d95f4a9618d85d11e7ebcab7","abstract_canon_sha256":"bd15eb9486ae2915148c6c55dd9f430230cda23fd603e71b3d2fd6281563c050"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:40.448479Z","signature_b64":"GySbplNH5ea90JNDDj4us5+HeVDaYy2jHyJkaspwk7WQWUJqd61OXMZIqfqhfOV3Ikm5l9yZGcvQfmAr1EdQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1be6de0643b7a1fc64512bb596de071fa0e6f2517cc5074c600f444982bed28c","last_reissued_at":"2026-05-18T01:06:40.447889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:40.447889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Grammar Compression for Frequent Pattern Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Sakamoto, I Tomohiro, Shouhei Fukunaga, Yoshimasa Takabatake","submitted_at":"2016-07-15T10:42:20Z","abstract_excerpt":"Various grammar compression algorithms have been proposed in the last decade. A grammar compression is a restricted CFG deriving the string deterministically. An efficient grammar compression develops a smaller CFG by finding duplicated patterns and removing them. This process is just a frequent pattern discovery by grammatical inference. While we can get any frequent pattern in linear time using a preprocessed string, a huge working space is required for longer patterns, and the whole string must be loaded into the memory preliminarily. We propose an online algorithm approximating this proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04446","kind":"arxiv","version":3},"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":"1607.04446","created_at":"2026-05-18T01:06:40.447963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04446v3","created_at":"2026-05-18T01:06:40.447963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04446","created_at":"2026-05-18T01:06:40.447963+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPTN4BSDW6Q7","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPTN4BSDW6Q7YZCR","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPTN4BSD","created_at":"2026-05-18T12:30:12.583610+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/DPTN4BSDW6Q7YZCRFO2ZNXQHD6","json":"https://pith.science/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6.json","graph_json":"https://pith.science/api/pith-number/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/graph.json","events_json":"https://pith.science/api/pith-number/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/events.json","paper":"https://pith.science/paper/DPTN4BSD"},"agent_actions":{"view_html":"https://pith.science/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6","download_json":"https://pith.science/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6.json","view_paper":"https://pith.science/paper/DPTN4BSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04446&json=true","fetch_graph":"https://pith.science/api/pith-number/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/graph.json","fetch_events":"https://pith.science/api/pith-number/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/action/storage_attestation","attest_author":"https://pith.science/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/action/author_attestation","sign_citation":"https://pith.science/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/action/citation_signature","submit_replication":"https://pith.science/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/action/replication_record"}},"created_at":"2026-05-18T01:06:40.447963+00:00","updated_at":"2026-05-18T01:06:40.447963+00:00"}