{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4WBSUYODFLG6632WQH5EVSLWMK","short_pith_number":"pith:4WBSUYOD","schema_version":"1.0","canonical_sha256":"e5832a61c32acdef6f5681fa4ac9766298b91ee599d637798a92944dfb769e05","source":{"kind":"arxiv","id":"1304.1530","version":1},"attestation_state":"computed","paper":{"title":"Automated Construction of Sparse Bayesian Networks from Unstructured Probabilistic Models and Domain Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alice M. Agogino, Sampath Srinivas, Stuart Russell","submitted_at":"2013-03-27T19:40:38Z","abstract_excerpt":"An algorithm for automated construction of a sparse Bayesian network given an unstructured probabilistic model and causal domain information from an expert has been developed and implemented.  The goal is to obtain a network that explicitly reveals as much information regarding conditional independence as possible.  The network is built incrementally adding one node at a time.  The expert's information and a greedy heuristic that tries to keep the number of arcs added at each step to a minimum are used to guide the search for the next node to add.  The probabilistic model is a predicate that c"},"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.1530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:40:38Z","cross_cats_sorted":[],"title_canon_sha256":"a0b3539a75d65321dc26efb3b2fdcda2b8d5c552b01741c1e1da9ca531e3b310","abstract_canon_sha256":"f1c6309d171bcdb66e65da50d96a1fe11661d13a831815fcd486626af815037d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:55.483996Z","signature_b64":"nTqP8C1YwbpuJTxmEiHXxfPNzzuMT6nbJSB3VJOqha020QfYmcQpaqVj2klFsfmUE9+RVYEusq7lBkgFGR5zDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5832a61c32acdef6f5681fa4ac9766298b91ee599d637798a92944dfb769e05","last_reissued_at":"2026-05-18T03:28:55.483574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:55.483574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Construction of Sparse Bayesian Networks from Unstructured Probabilistic Models and Domain Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alice M. Agogino, Sampath Srinivas, Stuart Russell","submitted_at":"2013-03-27T19:40:38Z","abstract_excerpt":"An algorithm for automated construction of a sparse Bayesian network given an unstructured probabilistic model and causal domain information from an expert has been developed and implemented.  The goal is to obtain a network that explicitly reveals as much information regarding conditional independence as possible.  The network is built incrementally adding one node at a time.  The expert's information and a greedy heuristic that tries to keep the number of arcs added at each step to a minimum are used to guide the search for the next node to add.  The probabilistic model is a predicate that c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1530","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.1530","created_at":"2026-05-18T03:28:55.483630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1530v1","created_at":"2026-05-18T03:28:55.483630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1530","created_at":"2026-05-18T03:28:55.483630+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WBSUYODFLG6","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WBSUYODFLG6632W","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WBSUYOD","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/4WBSUYODFLG6632WQH5EVSLWMK","json":"https://pith.science/pith/4WBSUYODFLG6632WQH5EVSLWMK.json","graph_json":"https://pith.science/api/pith-number/4WBSUYODFLG6632WQH5EVSLWMK/graph.json","events_json":"https://pith.science/api/pith-number/4WBSUYODFLG6632WQH5EVSLWMK/events.json","paper":"https://pith.science/paper/4WBSUYOD"},"agent_actions":{"view_html":"https://pith.science/pith/4WBSUYODFLG6632WQH5EVSLWMK","download_json":"https://pith.science/pith/4WBSUYODFLG6632WQH5EVSLWMK.json","view_paper":"https://pith.science/paper/4WBSUYOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1530&json=true","fetch_graph":"https://pith.science/api/pith-number/4WBSUYODFLG6632WQH5EVSLWMK/graph.json","fetch_events":"https://pith.science/api/pith-number/4WBSUYODFLG6632WQH5EVSLWMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WBSUYODFLG6632WQH5EVSLWMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WBSUYODFLG6632WQH5EVSLWMK/action/storage_attestation","attest_author":"https://pith.science/pith/4WBSUYODFLG6632WQH5EVSLWMK/action/author_attestation","sign_citation":"https://pith.science/pith/4WBSUYODFLG6632WQH5EVSLWMK/action/citation_signature","submit_replication":"https://pith.science/pith/4WBSUYODFLG6632WQH5EVSLWMK/action/replication_record"}},"created_at":"2026-05-18T03:28:55.483630+00:00","updated_at":"2026-05-18T03:28:55.483630+00:00"}