{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VKU6GLHMANDB6JLL2TN5AF7RCH","short_pith_number":"pith:VKU6GLHM","canonical_record":{"source":{"id":"1708.00847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-08-02T17:43:29Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"de1acb31c685f4b1915f7488119da6209c4bd7d9db3efc530c7edb23cca37e1f","abstract_canon_sha256":"14bcfdb0803e17e0f3e0df78c2d9442aa83067caf15749487750a29486690dba"},"schema_version":"1.0"},"canonical_sha256":"aaa9e32cec03461f256bd4dbd017f111fe1f3f7ffd879300fb6420ac8ef04f25","source":{"kind":"arxiv","id":"1708.00847","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00847","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00847v1","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00847","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"VKU6GLHMANDB","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VKU6GLHMANDB6JLL","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VKU6GLHM","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VKU6GLHMANDB6JLL2TN5AF7RCH","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-08-02T17:43:29Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"de1acb31c685f4b1915f7488119da6209c4bd7d9db3efc530c7edb23cca37e1f","abstract_canon_sha256":"14bcfdb0803e17e0f3e0df78c2d9442aa83067caf15749487750a29486690dba"},"schema_version":"1.0"},"canonical_sha256":"aaa9e32cec03461f256bd4dbd017f111fe1f3f7ffd879300fb6420ac8ef04f25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:44.469640Z","signature_b64":"fiQUEzAAk29LqWMEdND5KXB4xCbIiPzLvqK+HQRY/Hu/a3Fw81wPn2utIT7tcIpmGA0a7U4VaLsO45Sq5E8wBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaa9e32cec03461f256bd4dbd017f111fe1f3f7ffd879300fb6420ac8ef04f25","last_reissued_at":"2026-05-18T00:38:44.469010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:44.469010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00847","source_version":1,"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-18T00:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"24D+/pmR8HTVHXI/L5oQRd3m+O68numq2jgIVBDfi6Hv93FXiNgmPwG4CriTGhZZys355pe+q3Sbmzvr0//sCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:59:21.083185Z"},"content_sha256":"0bf0e60d107f34686a1693863c5a1cfc6fcd79b293087c483b59cc4aa7b84b9a","schema_version":"1.0","event_id":"sha256:0bf0e60d107f34686a1693863c5a1cfc6fcd79b293087c483b59cc4aa7b84b9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VKU6GLHMANDB6JLL2TN5AF7RCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Latent tree models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Piotr Zwiernik","submitted_at":"2017-08-02T17:43:29Z","abstract_excerpt":"Latent tree models are graphical models defined on trees, in which only a subset of variables is observed. They were first discussed by Judea Pearl as tree-decomposable distributions to generalise star-decomposable distributions such as the latent class model. Latent tree models, or their submodels, are widely used in: phylogenetic analysis, network tomography, computer vision, causal modeling, and data clustering. They also contain other well-known classes of models like hidden Markov models, Brownian motion tree model, the Ising model on a tree, and many popular models used in phylogenetics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00847","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"},"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-18T00:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fb3zQB72A1vqGZ5iwbaQaJcqrcSa8uv7UIMTEoK+NGYndqfp++njfj2UA8TygG5lzHu+wxzC+QzeJiwbY6xEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:59:21.083659Z"},"content_sha256":"68e53cc84d73bc4d63edb0b82e12715f28b3f1b9b0b45a21fd0a8e29b5a218f9","schema_version":"1.0","event_id":"sha256:68e53cc84d73bc4d63edb0b82e12715f28b3f1b9b0b45a21fd0a8e29b5a218f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKU6GLHMANDB6JLL2TN5AF7RCH/bundle.json","state_url":"https://pith.science/pith/VKU6GLHMANDB6JLL2TN5AF7RCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKU6GLHMANDB6JLL2TN5AF7RCH/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-05-25T09:59:21Z","links":{"resolver":"https://pith.science/pith/VKU6GLHMANDB6JLL2TN5AF7RCH","bundle":"https://pith.science/pith/VKU6GLHMANDB6JLL2TN5AF7RCH/bundle.json","state":"https://pith.science/pith/VKU6GLHMANDB6JLL2TN5AF7RCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKU6GLHMANDB6JLL2TN5AF7RCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VKU6GLHMANDB6JLL2TN5AF7RCH","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":"14bcfdb0803e17e0f3e0df78c2d9442aa83067caf15749487750a29486690dba","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-08-02T17:43:29Z","title_canon_sha256":"de1acb31c685f4b1915f7488119da6209c4bd7d9db3efc530c7edb23cca37e1f"},"schema_version":"1.0","source":{"id":"1708.00847","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00847","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00847v1","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00847","created_at":"2026-05-18T00:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"VKU6GLHMANDB","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VKU6GLHMANDB6JLL","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VKU6GLHM","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:68e53cc84d73bc4d63edb0b82e12715f28b3f1b9b0b45a21fd0a8e29b5a218f9","target":"graph","created_at":"2026-05-18T00:38:44Z","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":"Latent tree models are graphical models defined on trees, in which only a subset of variables is observed. They were first discussed by Judea Pearl as tree-decomposable distributions to generalise star-decomposable distributions such as the latent class model. Latent tree models, or their submodels, are widely used in: phylogenetic analysis, network tomography, computer vision, causal modeling, and data clustering. They also contain other well-known classes of models like hidden Markov models, Brownian motion tree model, the Ising model on a tree, and many popular models used in phylogenetics.","authors_text":"Piotr Zwiernik","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-08-02T17:43:29Z","title":"Latent tree models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00847","kind":"arxiv","version":1},"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:0bf0e60d107f34686a1693863c5a1cfc6fcd79b293087c483b59cc4aa7b84b9a","target":"record","created_at":"2026-05-18T00:38:44Z","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":"14bcfdb0803e17e0f3e0df78c2d9442aa83067caf15749487750a29486690dba","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-08-02T17:43:29Z","title_canon_sha256":"de1acb31c685f4b1915f7488119da6209c4bd7d9db3efc530c7edb23cca37e1f"},"schema_version":"1.0","source":{"id":"1708.00847","kind":"arxiv","version":1}},"canonical_sha256":"aaa9e32cec03461f256bd4dbd017f111fe1f3f7ffd879300fb6420ac8ef04f25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aaa9e32cec03461f256bd4dbd017f111fe1f3f7ffd879300fb6420ac8ef04f25","first_computed_at":"2026-05-18T00:38:44.469010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:44.469010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fiQUEzAAk29LqWMEdND5KXB4xCbIiPzLvqK+HQRY/Hu/a3Fw81wPn2utIT7tcIpmGA0a7U4VaLsO45Sq5E8wBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:44.469640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00847","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bf0e60d107f34686a1693863c5a1cfc6fcd79b293087c483b59cc4aa7b84b9a","sha256:68e53cc84d73bc4d63edb0b82e12715f28b3f1b9b0b45a21fd0a8e29b5a218f9"],"state_sha256":"209c1b495b3b56f7ddaa9969279c220f3dfd67518359f237079116f0be02e4ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"duFRuNBpqajzZYuLP56DV+qR4JPxV80eYytccB6ltoyxuP8+68Js5L0ABF+fMz3nQ/JeU4ONnpwExsVSkkWuCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:59:21.086345Z","bundle_sha256":"d27930dc7875dbdf7096a2475f6bd9764243e4ea89125ff6fbc6b24a73766a3d"}}