{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ONS5LPD6ZFPLNHVNK5B74N4CPP","short_pith_number":"pith:ONS5LPD6","schema_version":"1.0","canonical_sha256":"7365d5bc7ec95eb69ead5743fe37827bc05d4ef0e60d365762fdd6318bcf0c3f","source":{"kind":"arxiv","id":"1303.5397","version":1},"attestation_state":"computed","paper":{"title":"Reformulating Inference Problems Through Selective Conditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Eric J. Horvitz, Paul Dagum","submitted_at":"2013-03-13T12:52:03Z","abstract_excerpt":"We describe how we selectively reformulate portions of a belief network that pose difficulties for solution with a stochastic-simulation algorithm.  With employ the selective conditioning approach to target specific nodes in a belief network for decomposition, based on the contribution the nodes make to the tractability of stochastic simulation.  We review previous work on BNRAS algorithms- randomized approximation algorithms for probabilistic inference.  We show how selective conditioning can be employed to reformulate a single BNRAS problem into multiple tractable BNRAS simulation problems. "},"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":"1303.5397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-13T12:52:03Z","cross_cats_sorted":[],"title_canon_sha256":"6cb80684076a52aa41e0369213a2822049b675ac5a40b86186b746b031b844e2","abstract_canon_sha256":"2daab1612882c6d9a81bc6cee8f3341a972e0ab311fe7c2e8d5b3e93d39b1edb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:11.897250Z","signature_b64":"ApTL57KwfZSRt0X0+tV54e+4tUn4NVLKszqImxqIpNIPnZnIVhGP8+93LmrBUT3Ayz1xEJed8vg74Omidn80Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7365d5bc7ec95eb69ead5743fe37827bc05d4ef0e60d365762fdd6318bcf0c3f","last_reissued_at":"2026-05-18T03:30:11.896514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:11.896514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reformulating Inference Problems Through Selective Conditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Eric J. Horvitz, Paul Dagum","submitted_at":"2013-03-13T12:52:03Z","abstract_excerpt":"We describe how we selectively reformulate portions of a belief network that pose difficulties for solution with a stochastic-simulation algorithm.  With employ the selective conditioning approach to target specific nodes in a belief network for decomposition, based on the contribution the nodes make to the tractability of stochastic simulation.  We review previous work on BNRAS algorithms- randomized approximation algorithms for probabilistic inference.  We show how selective conditioning can be employed to reformulate a single BNRAS problem into multiple tractable BNRAS simulation problems. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5397","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":"1303.5397","created_at":"2026-05-18T03:30:11.896633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.5397v1","created_at":"2026-05-18T03:30:11.896633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5397","created_at":"2026-05-18T03:30:11.896633+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONS5LPD6ZFPL","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONS5LPD6ZFPLNHVN","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONS5LPD6","created_at":"2026-05-18T12:27:54.935989+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/ONS5LPD6ZFPLNHVNK5B74N4CPP","json":"https://pith.science/pith/ONS5LPD6ZFPLNHVNK5B74N4CPP.json","graph_json":"https://pith.science/api/pith-number/ONS5LPD6ZFPLNHVNK5B74N4CPP/graph.json","events_json":"https://pith.science/api/pith-number/ONS5LPD6ZFPLNHVNK5B74N4CPP/events.json","paper":"https://pith.science/paper/ONS5LPD6"},"agent_actions":{"view_html":"https://pith.science/pith/ONS5LPD6ZFPLNHVNK5B74N4CPP","download_json":"https://pith.science/pith/ONS5LPD6ZFPLNHVNK5B74N4CPP.json","view_paper":"https://pith.science/paper/ONS5LPD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.5397&json=true","fetch_graph":"https://pith.science/api/pith-number/ONS5LPD6ZFPLNHVNK5B74N4CPP/graph.json","fetch_events":"https://pith.science/api/pith-number/ONS5LPD6ZFPLNHVNK5B74N4CPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONS5LPD6ZFPLNHVNK5B74N4CPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONS5LPD6ZFPLNHVNK5B74N4CPP/action/storage_attestation","attest_author":"https://pith.science/pith/ONS5LPD6ZFPLNHVNK5B74N4CPP/action/author_attestation","sign_citation":"https://pith.science/pith/ONS5LPD6ZFPLNHVNK5B74N4CPP/action/citation_signature","submit_replication":"https://pith.science/pith/ONS5LPD6ZFPLNHVNK5B74N4CPP/action/replication_record"}},"created_at":"2026-05-18T03:30:11.896633+00:00","updated_at":"2026-05-18T03:30:11.896633+00:00"}