{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CRVNEZKN5DIY7K2DKDKVB2ORLA","short_pith_number":"pith:CRVNEZKN","schema_version":"1.0","canonical_sha256":"146ad2654de8d18fab4350d550e9d1580e6d7fc33df158eed3ceb6d2c3f5ac18","source":{"kind":"arxiv","id":"1304.2377","version":1},"attestation_state":"computed","paper":{"title":"Updating Probabilities in Multiply-Connected Belief Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gregory F. Cooper, Jaap Suermondt","submitted_at":"2013-03-27T19:45:15Z","abstract_excerpt":"This paper focuses on probability updates in multiply-connected belief networks. Pearl has designed the method of conditioning, which enables us to apply his algorithm for belief updates in singly-connected networks to multiply-connected belief networks by selecting a loop-cutset for the network and instantiating these loop-cutset nodes. We discuss conditions that need to be satisfied by the selected nodes. We present a heuristic algorithm for finding a loop-cutset that satisfies these conditions."},"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":"1304.2377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:45:15Z","cross_cats_sorted":[],"title_canon_sha256":"e629e11ebd3b8b4e6f34bca35c101665b01f41715a4af9a404cf9fd781cc5423","abstract_canon_sha256":"1ee7bfe786f6685778d40a2fc1195b927dcab47186b3c5d80ad6933976ba946d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:32.276474Z","signature_b64":"LEF93pTOkx3yWou1y2eiRji0Yqk2wUsPA8HEFqhpoGd18kgakkjFVlDoi/4jl+w6vzQ4ZHZ9sbqWnxZf5QhqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"146ad2654de8d18fab4350d550e9d1580e6d7fc33df158eed3ceb6d2c3f5ac18","last_reissued_at":"2026-05-18T03:28:32.275778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:32.275778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Updating Probabilities in Multiply-Connected Belief Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gregory F. Cooper, Jaap Suermondt","submitted_at":"2013-03-27T19:45:15Z","abstract_excerpt":"This paper focuses on probability updates in multiply-connected belief networks. Pearl has designed the method of conditioning, which enables us to apply his algorithm for belief updates in singly-connected networks to multiply-connected belief networks by selecting a loop-cutset for the network and instantiating these loop-cutset nodes. We discuss conditions that need to be satisfied by the selected nodes. We present a heuristic algorithm for finding a loop-cutset that satisfies these conditions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2377","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.2377","created_at":"2026-05-18T03:28:32.275907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2377v1","created_at":"2026-05-18T03:28:32.275907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2377","created_at":"2026-05-18T03:28:32.275907+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRVNEZKN5DIY","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRVNEZKN5DIY7K2D","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRVNEZKN","created_at":"2026-05-18T12:27:40.988391+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/CRVNEZKN5DIY7K2DKDKVB2ORLA","json":"https://pith.science/pith/CRVNEZKN5DIY7K2DKDKVB2ORLA.json","graph_json":"https://pith.science/api/pith-number/CRVNEZKN5DIY7K2DKDKVB2ORLA/graph.json","events_json":"https://pith.science/api/pith-number/CRVNEZKN5DIY7K2DKDKVB2ORLA/events.json","paper":"https://pith.science/paper/CRVNEZKN"},"agent_actions":{"view_html":"https://pith.science/pith/CRVNEZKN5DIY7K2DKDKVB2ORLA","download_json":"https://pith.science/pith/CRVNEZKN5DIY7K2DKDKVB2ORLA.json","view_paper":"https://pith.science/paper/CRVNEZKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2377&json=true","fetch_graph":"https://pith.science/api/pith-number/CRVNEZKN5DIY7K2DKDKVB2ORLA/graph.json","fetch_events":"https://pith.science/api/pith-number/CRVNEZKN5DIY7K2DKDKVB2ORLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRVNEZKN5DIY7K2DKDKVB2ORLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRVNEZKN5DIY7K2DKDKVB2ORLA/action/storage_attestation","attest_author":"https://pith.science/pith/CRVNEZKN5DIY7K2DKDKVB2ORLA/action/author_attestation","sign_citation":"https://pith.science/pith/CRVNEZKN5DIY7K2DKDKVB2ORLA/action/citation_signature","submit_replication":"https://pith.science/pith/CRVNEZKN5DIY7K2DKDKVB2ORLA/action/replication_record"}},"created_at":"2026-05-18T03:28:32.275907+00:00","updated_at":"2026-05-18T03:28:32.275907+00:00"}