{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3JP4UQQ4QG36522YL4Y5KNVU4Y","short_pith_number":"pith:3JP4UQQ4","canonical_record":{"source":{"id":"1301.6709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"c312dfcc94e7b04e682248e9948f3a35fba69914cde8c9eb21b37b15fc7430a2","abstract_canon_sha256":"6f3042b6a94b17eff4ab5fb6b89bfa4835c3243882f814e0b636b1904c07328c"},"schema_version":"1.0"},"canonical_sha256":"da5fca421c81b7eeeb585f31d536b4e60e55cf323a902941811feb5fb1dcb845","source":{"kind":"arxiv","id":"1301.6709","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6709","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6709v1","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6709","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"pith_short_12","alias_value":"3JP4UQQ4QG36","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3JP4UQQ4QG36522Y","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3JP4UQQ4","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3JP4UQQ4QG36522YL4Y5KNVU4Y","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"c312dfcc94e7b04e682248e9948f3a35fba69914cde8c9eb21b37b15fc7430a2","abstract_canon_sha256":"6f3042b6a94b17eff4ab5fb6b89bfa4835c3243882f814e0b636b1904c07328c"},"schema_version":"1.0"},"canonical_sha256":"da5fca421c81b7eeeb585f31d536b4e60e55cf323a902941811feb5fb1dcb845","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:12.823638Z","signature_b64":"TmqL1NC+13DBMWcsTreDRgGG/8thEaV4T3o/401JGJoICK+EjVbtJBQcpvZZ1mBg4nZUWQQGr7zxZlG2dyyfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da5fca421c81b7eeeb585f31d536b4e60e55cf323a902941811feb5fb1dcb845","last_reissued_at":"2026-05-18T03:35:12.822938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:12.822938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6709","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:35:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pGewQsF9nbJWlgGNMxk7npa2ftWnS9NX2SLpmDtLnUGpN3YnMJKtJbxAXzLuzusRE006RlaIR82/qoqAr7JsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:29:41.290887Z"},"content_sha256":"75bce14b495a7a108e73e6ca2b0b078922748e6b404c18c914842e3bf2976fac","schema_version":"1.0","event_id":"sha256:75bce14b495a7a108e73e6ca2b0b078922748e6b404c18c914842e3bf2976fac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3JP4UQQ4QG36522YL4Y5KNVU4Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General Algorithm for Approximate Inference and its Application to Hybrid Bayes Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Daphne Koller, Dragomir Anguelov, Uri Lerner","submitted_at":"2013-01-23T15:58:59Z","abstract_excerpt":"The clique tree algorithm is the standard method for doing  inference in Bayesian networks. It works by manipulating clique potentials - distributions over the variables in a clique. While this approach works well for many networks, it is limited by the need to maintain an exact representation of the clique potentials. This paper presents a new unified approach that combines approximate inference and the clique tree algorithm, thereby circumventing this limitation. Many known approximate inference algorithms can be viewed as instances of this approach. The algorithm essentially does clique tre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6709","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:35:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NgdrGZi4bz1eNrMOLQk624DvCB133mP3EDXSxWIXlO2YYZRUpy7Qt5BMQXZ8+eFtsvuUdHqkMbj/XoH9ypIuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:29:41.291223Z"},"content_sha256":"59af8b94144fb830a12ca0fa17951e795eadc858748f528bc4052552cb8c6bdc","schema_version":"1.0","event_id":"sha256:59af8b94144fb830a12ca0fa17951e795eadc858748f528bc4052552cb8c6bdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JP4UQQ4QG36522YL4Y5KNVU4Y/bundle.json","state_url":"https://pith.science/pith/3JP4UQQ4QG36522YL4Y5KNVU4Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JP4UQQ4QG36522YL4Y5KNVU4Y/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-30T23:29:41Z","links":{"resolver":"https://pith.science/pith/3JP4UQQ4QG36522YL4Y5KNVU4Y","bundle":"https://pith.science/pith/3JP4UQQ4QG36522YL4Y5KNVU4Y/bundle.json","state":"https://pith.science/pith/3JP4UQQ4QG36522YL4Y5KNVU4Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JP4UQQ4QG36522YL4Y5KNVU4Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3JP4UQQ4QG36522YL4Y5KNVU4Y","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":"6f3042b6a94b17eff4ab5fb6b89bfa4835c3243882f814e0b636b1904c07328c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:58:59Z","title_canon_sha256":"c312dfcc94e7b04e682248e9948f3a35fba69914cde8c9eb21b37b15fc7430a2"},"schema_version":"1.0","source":{"id":"1301.6709","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6709","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6709v1","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6709","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"pith_short_12","alias_value":"3JP4UQQ4QG36","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3JP4UQQ4QG36522Y","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3JP4UQQ4","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:59af8b94144fb830a12ca0fa17951e795eadc858748f528bc4052552cb8c6bdc","target":"graph","created_at":"2026-05-18T03:35:12Z","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":"The clique tree algorithm is the standard method for doing  inference in Bayesian networks. It works by manipulating clique potentials - distributions over the variables in a clique. While this approach works well for many networks, it is limited by the need to maintain an exact representation of the clique potentials. This paper presents a new unified approach that combines approximate inference and the clique tree algorithm, thereby circumventing this limitation. Many known approximate inference algorithms can be viewed as instances of this approach. The algorithm essentially does clique tre","authors_text":"Daphne Koller, Dragomir Anguelov, Uri Lerner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:58:59Z","title":"A General Algorithm for Approximate Inference and its Application to Hybrid Bayes Nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6709","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:75bce14b495a7a108e73e6ca2b0b078922748e6b404c18c914842e3bf2976fac","target":"record","created_at":"2026-05-18T03:35:12Z","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":"6f3042b6a94b17eff4ab5fb6b89bfa4835c3243882f814e0b636b1904c07328c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:58:59Z","title_canon_sha256":"c312dfcc94e7b04e682248e9948f3a35fba69914cde8c9eb21b37b15fc7430a2"},"schema_version":"1.0","source":{"id":"1301.6709","kind":"arxiv","version":1}},"canonical_sha256":"da5fca421c81b7eeeb585f31d536b4e60e55cf323a902941811feb5fb1dcb845","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da5fca421c81b7eeeb585f31d536b4e60e55cf323a902941811feb5fb1dcb845","first_computed_at":"2026-05-18T03:35:12.822938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:12.822938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TmqL1NC+13DBMWcsTreDRgGG/8thEaV4T3o/401JGJoICK+EjVbtJBQcpvZZ1mBg4nZUWQQGr7zxZlG2dyyfCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:12.823638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6709","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75bce14b495a7a108e73e6ca2b0b078922748e6b404c18c914842e3bf2976fac","sha256:59af8b94144fb830a12ca0fa17951e795eadc858748f528bc4052552cb8c6bdc"],"state_sha256":"e6c714e3bfe16cfedb1f73a7dfbac3d38aa674105649d822a6017b82c19f31c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLEgHvUSKm7kvbgnmNihrtub1EL5BUOZsps5wmQB9ZPO8aFaWHJxjBNnDe85cZ9gBOsxjSYdLQ7Z1S+nSbueCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T23:29:41.294017Z","bundle_sha256":"7b34bbb957c1282a54b27f34863dd2b4629ecc054d2cc0faed58731eea353792"}}