{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DPTN4BSDW6Q7YZCRFO2ZNXQHD6","short_pith_number":"pith:DPTN4BSD","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"},"canonical_sha256":"1be6de0643b7a1fc64512bb596de071fa0e6f2517cc5074c600f444982bed28c","source":{"kind":"arxiv","id":"1607.04446","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04446","created_at":"2026-05-18T01:06:40Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04446v3","created_at":"2026-05-18T01:06:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04446","created_at":"2026-05-18T01:06:40Z"},{"alias_kind":"pith_short_12","alias_value":"DPTN4BSDW6Q7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DPTN4BSDW6Q7YZCR","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DPTN4BSD","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DPTN4BSDW6Q7YZCRFO2ZNXQHD6","target":"record","payload":{"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"},"canonical_sha256":"1be6de0643b7a1fc64512bb596de071fa0e6f2517cc5074c600f444982bed28c","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"},"source_kind":"arxiv","source_id":"1607.04446","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:06:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wip1NrWG8rv2/C0L1WJ2FzRQpbkh0HdrqllU1DhTFDKM30ANrh4C2WNt80t+S0apZA8xJEAMngggVH8bFECaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:14:25.210897Z"},"content_sha256":"fee93ba25ec29d1318760345412c52592a57161f0b7f37eec92acfc50ba105f0","schema_version":"1.0","event_id":"sha256:fee93ba25ec29d1318760345412c52592a57161f0b7f37eec92acfc50ba105f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DPTN4BSDW6Q7YZCRFO2ZNXQHD6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:06:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cDHR6xpmKLyt0AgOoiG60D/8LsvcF2x0+FKrpo1d03wvD9p+/hT+Uxw3xnHQcoPoaDE0wLWgwwhzPRd+tB5VBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:14:25.211228Z"},"content_sha256":"62f63cc2ea59ef14f17d0108b3a46ef44e8b1181c38d7b7e607a16fc19e62b26","schema_version":"1.0","event_id":"sha256:62f63cc2ea59ef14f17d0108b3a46ef44e8b1181c38d7b7e607a16fc19e62b26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/bundle.json","state_url":"https://pith.science/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T15:14:25Z","links":{"resolver":"https://pith.science/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6","bundle":"https://pith.science/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/bundle.json","state":"https://pith.science/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPTN4BSDW6Q7YZCRFO2ZNXQHD6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DPTN4BSDW6Q7YZCRFO2ZNXQHD6","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":"bd15eb9486ae2915148c6c55dd9f430230cda23fd603e71b3d2fd6281563c050","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-15T10:42:20Z","title_canon_sha256":"d0159db561903858db719112f2d38143258c33f5d95f4a9618d85d11e7ebcab7"},"schema_version":"1.0","source":{"id":"1607.04446","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04446","created_at":"2026-05-18T01:06:40Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04446v3","created_at":"2026-05-18T01:06:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04446","created_at":"2026-05-18T01:06:40Z"},{"alias_kind":"pith_short_12","alias_value":"DPTN4BSDW6Q7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DPTN4BSDW6Q7YZCR","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DPTN4BSD","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:62f63cc2ea59ef14f17d0108b3a46ef44e8b1181c38d7b7e607a16fc19e62b26","target":"graph","created_at":"2026-05-18T01:06:40Z","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":"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","authors_text":"Hiroshi Sakamoto, I Tomohiro, Shouhei Fukunaga, Yoshimasa Takabatake","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-15T10:42:20Z","title":"Online Grammar Compression for Frequent Pattern Discovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04446","kind":"arxiv","version":3},"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:fee93ba25ec29d1318760345412c52592a57161f0b7f37eec92acfc50ba105f0","target":"record","created_at":"2026-05-18T01:06:40Z","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":"bd15eb9486ae2915148c6c55dd9f430230cda23fd603e71b3d2fd6281563c050","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-15T10:42:20Z","title_canon_sha256":"d0159db561903858db719112f2d38143258c33f5d95f4a9618d85d11e7ebcab7"},"schema_version":"1.0","source":{"id":"1607.04446","kind":"arxiv","version":3}},"canonical_sha256":"1be6de0643b7a1fc64512bb596de071fa0e6f2517cc5074c600f444982bed28c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1be6de0643b7a1fc64512bb596de071fa0e6f2517cc5074c600f444982bed28c","first_computed_at":"2026-05-18T01:06:40.447889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:40.447889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GySbplNH5ea90JNDDj4us5+HeVDaYy2jHyJkaspwk7WQWUJqd61OXMZIqfqhfOV3Ikm5l9yZGcvQfmAr1EdQBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:40.448479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04446","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fee93ba25ec29d1318760345412c52592a57161f0b7f37eec92acfc50ba105f0","sha256:62f63cc2ea59ef14f17d0108b3a46ef44e8b1181c38d7b7e607a16fc19e62b26"],"state_sha256":"90de8f0d46fdb7c7d07b6d3a83d8ca02c2760b038c995e80c0270b955976b941"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OmOMKplYbVItmEjznqUWaEnrwDKJ36inIamB7vWyPDH8oXVi62BDSIvvtZMUk6+jza1mGTjlMUMZzaV8R7dJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T15:14:25.213039Z","bundle_sha256":"5ce10dd28b1c94f72bc0101f53a4f5af0b6d26d678d259c1ea01241ab1c50d3e"}}