{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R5PB4SYJ32LDVYGOC4JP5IOEOA","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":"2796462bb249f80867ccebaac9ce145f24eb52f76bb6fba1542b9a6a86ee3e68","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-01T21:05:49Z","title_canon_sha256":"15aac194d13b612f9e6bdba7710f7a40ff64aa85e4d53a37be188531f4a80793"},"schema_version":"1.0","source":{"id":"1808.00566","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00566","created_at":"2026-05-18T00:08:59Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00566v2","created_at":"2026-05-18T00:08:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00566","created_at":"2026-05-18T00:08:59Z"},{"alias_kind":"pith_short_12","alias_value":"R5PB4SYJ32LD","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R5PB4SYJ32LDVYGO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R5PB4SYJ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:9af87e2319fc96bec315282695e7677ceed20dc8c106057d3dea7f5317424a51","target":"graph","created_at":"2026-05-18T00:08:59Z","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":"This paper considers structure learning from data with $n$ samples of $p$ variables, assuming that the structure is a forest, using the Chow-Liu algorithm. Specifically, for incomplete data, we construct two model selection algorithms that complete in $O(p^2)$ steps: one obtains a forest with the maximum posterior probability given the data, and the other obtains a forest that converges to the true one as $n$ increases. We show that the two forests are generally different when some values are missing. Additionally, we present estimations for benchmark data sets to demonstrate that both algorit","authors_text":"Joe Suzuki","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-01T21:05:49Z","title":"Forest Learning from Data and its Universal Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00566","kind":"arxiv","version":2},"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:e52f6ebd2a52e4ceb78e0c5a4748ec9de1364a59b28556bb83cdd74089e55a24","target":"record","created_at":"2026-05-18T00:08:59Z","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":"2796462bb249f80867ccebaac9ce145f24eb52f76bb6fba1542b9a6a86ee3e68","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-01T21:05:49Z","title_canon_sha256":"15aac194d13b612f9e6bdba7710f7a40ff64aa85e4d53a37be188531f4a80793"},"schema_version":"1.0","source":{"id":"1808.00566","kind":"arxiv","version":2}},"canonical_sha256":"8f5e1e4b09de963ae0ce1712fea1c4703a087e2bc3cac2ee8f5ca49b347872d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f5e1e4b09de963ae0ce1712fea1c4703a087e2bc3cac2ee8f5ca49b347872d9","first_computed_at":"2026-05-18T00:08:59.535154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:59.535154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tmDV7e+sn0jtwTIa1UJqFfce6UT2DtcDrC1KFxPYCpyTKS2cqJmN4xBQVud204uLujd1UkbpjJ1R/vL4j3hgDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:59.535953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.00566","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e52f6ebd2a52e4ceb78e0c5a4748ec9de1364a59b28556bb83cdd74089e55a24","sha256:9af87e2319fc96bec315282695e7677ceed20dc8c106057d3dea7f5317424a51"],"state_sha256":"f32ba821bd0bbe962b72863555ddfb81976dcde2ac1c0f6c189d947181e399c2"}