{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R5PB4SYJ32LDVYGOC4JP5IOEOA","short_pith_number":"pith:R5PB4SYJ","schema_version":"1.0","canonical_sha256":"8f5e1e4b09de963ae0ce1712fea1c4703a087e2bc3cac2ee8f5ca49b347872d9","source":{"kind":"arxiv","id":"1808.00566","version":2},"attestation_state":"computed","paper":{"title":"Forest Learning from Data and its Universal Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joe Suzuki","submitted_at":"2018-08-01T21:05:49Z","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"},"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":"1808.00566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-01T21:05:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"15aac194d13b612f9e6bdba7710f7a40ff64aa85e4d53a37be188531f4a80793","abstract_canon_sha256":"2796462bb249f80867ccebaac9ce145f24eb52f76bb6fba1542b9a6a86ee3e68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:59.535953Z","signature_b64":"tmDV7e+sn0jtwTIa1UJqFfce6UT2DtcDrC1KFxPYCpyTKS2cqJmN4xBQVud204uLujd1UkbpjJ1R/vL4j3hgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f5e1e4b09de963ae0ce1712fea1c4703a087e2bc3cac2ee8f5ca49b347872d9","last_reissued_at":"2026-05-18T00:08:59.535154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:59.535154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forest Learning from Data and its Universal Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joe Suzuki","submitted_at":"2018-08-01T21:05:49Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00566","kind":"arxiv","version":2},"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":"1808.00566","created_at":"2026-05-18T00:08:59.535285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00566v2","created_at":"2026-05-18T00:08:59.535285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00566","created_at":"2026-05-18T00:08:59.535285+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5PB4SYJ32LD","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5PB4SYJ32LDVYGO","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5PB4SYJ","created_at":"2026-05-18T12:32:50.500415+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/R5PB4SYJ32LDVYGOC4JP5IOEOA","json":"https://pith.science/pith/R5PB4SYJ32LDVYGOC4JP5IOEOA.json","graph_json":"https://pith.science/api/pith-number/R5PB4SYJ32LDVYGOC4JP5IOEOA/graph.json","events_json":"https://pith.science/api/pith-number/R5PB4SYJ32LDVYGOC4JP5IOEOA/events.json","paper":"https://pith.science/paper/R5PB4SYJ"},"agent_actions":{"view_html":"https://pith.science/pith/R5PB4SYJ32LDVYGOC4JP5IOEOA","download_json":"https://pith.science/pith/R5PB4SYJ32LDVYGOC4JP5IOEOA.json","view_paper":"https://pith.science/paper/R5PB4SYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00566&json=true","fetch_graph":"https://pith.science/api/pith-number/R5PB4SYJ32LDVYGOC4JP5IOEOA/graph.json","fetch_events":"https://pith.science/api/pith-number/R5PB4SYJ32LDVYGOC4JP5IOEOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5PB4SYJ32LDVYGOC4JP5IOEOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5PB4SYJ32LDVYGOC4JP5IOEOA/action/storage_attestation","attest_author":"https://pith.science/pith/R5PB4SYJ32LDVYGOC4JP5IOEOA/action/author_attestation","sign_citation":"https://pith.science/pith/R5PB4SYJ32LDVYGOC4JP5IOEOA/action/citation_signature","submit_replication":"https://pith.science/pith/R5PB4SYJ32LDVYGOC4JP5IOEOA/action/replication_record"}},"created_at":"2026-05-18T00:08:59.535285+00:00","updated_at":"2026-05-18T00:08:59.535285+00:00"}