{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:576EXHOVP666C4SA7DUX7RBBI3","short_pith_number":"pith:576EXHOV","schema_version":"1.0","canonical_sha256":"effc4b9dd57fbde17240f8e97fc42146d26bdb037c2aabb1ced898ecbf638242","source":{"kind":"arxiv","id":"1304.1526","version":1},"attestation_state":"computed","paper":{"title":"Simulation Approaches to General Probabilistic Inference on Belief Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mark Alan Peot, Ross D. Shachter","submitted_at":"2013-03-27T19:40:16Z","abstract_excerpt":"A number of algorithms have been developed to solve probabilistic inference problems on belief networks.  These algorithms can be divided into two main groups: exact techniques which exploit the conditional independence revealed when the graph structure is relatively sparse, and probabilistic sampling techniques which exploit the \"conductance\" of an embedded Markov chain when the conditional probabilities have non-extreme values.  In this paper, we investigate a family of \"forward\" Monte Carlo sampling techniques similar to Logic Sampling [Henrion, 1988] which appear to perform well even in so"},"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.1526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:40:16Z","cross_cats_sorted":[],"title_canon_sha256":"7e9df1481ff408aafd019ffa74a59561a23627908c4b78f373e77ebcc2dc78a5","abstract_canon_sha256":"b982202022c74f0d582a7765d00c3720f3311346d962a9508eb75c0b6777d907"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:55.505487Z","signature_b64":"2S++f7kuxM0pt3AlHdxyqgyg6U5aTcFfT5rvrwrPVmDMM5ugNn0P1SMode0GHKll2FXD5Hj7txMQjbDYYcYXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"effc4b9dd57fbde17240f8e97fc42146d26bdb037c2aabb1ced898ecbf638242","last_reissued_at":"2026-05-18T03:28:55.505025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:55.505025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulation Approaches to General Probabilistic Inference on Belief Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mark Alan Peot, Ross D. Shachter","submitted_at":"2013-03-27T19:40:16Z","abstract_excerpt":"A number of algorithms have been developed to solve probabilistic inference problems on belief networks.  These algorithms can be divided into two main groups: exact techniques which exploit the conditional independence revealed when the graph structure is relatively sparse, and probabilistic sampling techniques which exploit the \"conductance\" of an embedded Markov chain when the conditional probabilities have non-extreme values.  In this paper, we investigate a family of \"forward\" Monte Carlo sampling techniques similar to Logic Sampling [Henrion, 1988] which appear to perform well even in so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1526","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.1526","created_at":"2026-05-18T03:28:55.505080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1526v1","created_at":"2026-05-18T03:28:55.505080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1526","created_at":"2026-05-18T03:28:55.505080+00:00"},{"alias_kind":"pith_short_12","alias_value":"576EXHOVP666","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"576EXHOVP666C4SA","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"576EXHOV","created_at":"2026-05-18T12:27:34.582898+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/576EXHOVP666C4SA7DUX7RBBI3","json":"https://pith.science/pith/576EXHOVP666C4SA7DUX7RBBI3.json","graph_json":"https://pith.science/api/pith-number/576EXHOVP666C4SA7DUX7RBBI3/graph.json","events_json":"https://pith.science/api/pith-number/576EXHOVP666C4SA7DUX7RBBI3/events.json","paper":"https://pith.science/paper/576EXHOV"},"agent_actions":{"view_html":"https://pith.science/pith/576EXHOVP666C4SA7DUX7RBBI3","download_json":"https://pith.science/pith/576EXHOVP666C4SA7DUX7RBBI3.json","view_paper":"https://pith.science/paper/576EXHOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1526&json=true","fetch_graph":"https://pith.science/api/pith-number/576EXHOVP666C4SA7DUX7RBBI3/graph.json","fetch_events":"https://pith.science/api/pith-number/576EXHOVP666C4SA7DUX7RBBI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/576EXHOVP666C4SA7DUX7RBBI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/576EXHOVP666C4SA7DUX7RBBI3/action/storage_attestation","attest_author":"https://pith.science/pith/576EXHOVP666C4SA7DUX7RBBI3/action/author_attestation","sign_citation":"https://pith.science/pith/576EXHOVP666C4SA7DUX7RBBI3/action/citation_signature","submit_replication":"https://pith.science/pith/576EXHOVP666C4SA7DUX7RBBI3/action/replication_record"}},"created_at":"2026-05-18T03:28:55.505080+00:00","updated_at":"2026-05-18T03:28:55.505080+00:00"}