{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UYORINR7LO7N5ZELH7NG5QFJ3W","short_pith_number":"pith:UYORINR7","canonical_record":{"source":{"id":"1401.3429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T04:46:37Z","cross_cats_sorted":[],"title_canon_sha256":"aee21887a153409e195e00401d0e9f9ac3d9fe5a33cdda58b58d15bff4404c58","abstract_canon_sha256":"447c8acfdca3489ae82376b9b4339f843c970b3791bfebfeaa02f467d503a859"},"schema_version":"1.0"},"canonical_sha256":"a61d14363f5bbedee48b3fda6ec0a9dd90731d6942c6fafa9cf884b00288486e","source":{"kind":"arxiv","id":"1401.3429","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3429","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3429v1","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3429","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"UYORINR7LO7N","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UYORINR7LO7N5ZEL","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UYORINR7","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UYORINR7LO7N5ZELH7NG5QFJ3W","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T04:46:37Z","cross_cats_sorted":[],"title_canon_sha256":"aee21887a153409e195e00401d0e9f9ac3d9fe5a33cdda58b58d15bff4404c58","abstract_canon_sha256":"447c8acfdca3489ae82376b9b4339f843c970b3791bfebfeaa02f467d503a859"},"schema_version":"1.0"},"canonical_sha256":"a61d14363f5bbedee48b3fda6ec0a9dd90731d6942c6fafa9cf884b00288486e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:09.262413Z","signature_b64":"HIXW8YHcGpeRxplYnIisY7zSgsJ2QhIUUpx5sdRfRseXtvZm3bhDuuH2yAOZrdLepfVHbyLxxrwy+Dvtyo98Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a61d14363f5bbedee48b3fda6ec0a9dd90731d6942c6fafa9cf884b00288486e","last_reissued_at":"2026-05-18T03:02:09.261544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:09.261544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3429","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-18T03:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SUvNcdg3/4cBwS0NW7QVRW514bZsGtuecIDr4K3Yk3175hx9OJP6JgaDyA9WXJsuIaiFpHmYExI9WGrvUdObDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:07:10.225996Z"},"content_sha256":"8aadc889537514b67c688bff40e3b1144f7610e1da3296601d7d8a3540d7ffca","schema_version":"1.0","event_id":"sha256:8aadc889537514b67c688bff40e3b1144f7610e1da3296601d7d8a3540d7ffca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UYORINR7LO7N5ZELH7NG5QFJ3W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Latent Tree Models and Approximate Inference in Bayesian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Nevin L. Zhang, Tao Chen, Yi Wang","submitted_at":"2014-01-15T04:46:37Z","abstract_excerpt":"We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and when online, make inference with the LTM instead of the original BN. Because LTMs are tree-structured, inference takes linear time. In the meantime, they can represent complex relationship among leaf nodes and hence the approximation accuracy is often good. Empirical evidence shows that our method can achieve good approximation accuracy at low online computational cost."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3429","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-18T03:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YtrerE6ym0jMkV62vPAZgeB/LXxg7pTHI7KZ/BUfbZUYe9XxmzKa5wMD9mbleIJQmf/+UC6rcprBi7w4/QBdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:07:10.226598Z"},"content_sha256":"fb7d7dc56b5263ddfc42cb5755fa67c8e8ac3c389df1744d1060e192acc7e178","schema_version":"1.0","event_id":"sha256:fb7d7dc56b5263ddfc42cb5755fa67c8e8ac3c389df1744d1060e192acc7e178"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UYORINR7LO7N5ZELH7NG5QFJ3W/bundle.json","state_url":"https://pith.science/pith/UYORINR7LO7N5ZELH7NG5QFJ3W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UYORINR7LO7N5ZELH7NG5QFJ3W/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-07T00:07:10Z","links":{"resolver":"https://pith.science/pith/UYORINR7LO7N5ZELH7NG5QFJ3W","bundle":"https://pith.science/pith/UYORINR7LO7N5ZELH7NG5QFJ3W/bundle.json","state":"https://pith.science/pith/UYORINR7LO7N5ZELH7NG5QFJ3W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UYORINR7LO7N5ZELH7NG5QFJ3W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UYORINR7LO7N5ZELH7NG5QFJ3W","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":"447c8acfdca3489ae82376b9b4339f843c970b3791bfebfeaa02f467d503a859","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T04:46:37Z","title_canon_sha256":"aee21887a153409e195e00401d0e9f9ac3d9fe5a33cdda58b58d15bff4404c58"},"schema_version":"1.0","source":{"id":"1401.3429","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3429","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3429v1","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3429","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"UYORINR7LO7N","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UYORINR7LO7N5ZEL","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UYORINR7","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:fb7d7dc56b5263ddfc42cb5755fa67c8e8ac3c389df1744d1060e192acc7e178","target":"graph","created_at":"2026-05-18T03:02:09Z","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":"We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and when online, make inference with the LTM instead of the original BN. Because LTMs are tree-structured, inference takes linear time. In the meantime, they can represent complex relationship among leaf nodes and hence the approximation accuracy is often good. Empirical evidence shows that our method can achieve good approximation accuracy at low online computational cost.","authors_text":"Nevin L. Zhang, Tao Chen, Yi Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T04:46:37Z","title":"Latent Tree Models and Approximate Inference in Bayesian Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3429","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:8aadc889537514b67c688bff40e3b1144f7610e1da3296601d7d8a3540d7ffca","target":"record","created_at":"2026-05-18T03:02:09Z","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":"447c8acfdca3489ae82376b9b4339f843c970b3791bfebfeaa02f467d503a859","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T04:46:37Z","title_canon_sha256":"aee21887a153409e195e00401d0e9f9ac3d9fe5a33cdda58b58d15bff4404c58"},"schema_version":"1.0","source":{"id":"1401.3429","kind":"arxiv","version":1}},"canonical_sha256":"a61d14363f5bbedee48b3fda6ec0a9dd90731d6942c6fafa9cf884b00288486e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a61d14363f5bbedee48b3fda6ec0a9dd90731d6942c6fafa9cf884b00288486e","first_computed_at":"2026-05-18T03:02:09.261544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:09.261544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HIXW8YHcGpeRxplYnIisY7zSgsJ2QhIUUpx5sdRfRseXtvZm3bhDuuH2yAOZrdLepfVHbyLxxrwy+Dvtyo98Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:09.262413Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3429","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8aadc889537514b67c688bff40e3b1144f7610e1da3296601d7d8a3540d7ffca","sha256:fb7d7dc56b5263ddfc42cb5755fa67c8e8ac3c389df1744d1060e192acc7e178"],"state_sha256":"baa73a597697b947f3ffc44cf79f437cc17e55e8d0021b0bfa42d64d4d4f9706"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IxJsQB+yc+9z7dZa0k4gp5RtAYBMD8+B6WJs6gBBG/UfvoHGe5N9mqUrbxA+GNKXoR5quR8GZNhMNnGdO/tiAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T00:07:10.229668Z","bundle_sha256":"05aae8c7320d1800e72125bc65e7ccedd4814260426182dd2a4ebe4a9a248c09"}}