{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YN2M7QTGA45HOXBHYBSUHR4IE2","short_pith_number":"pith:YN2M7QTG","schema_version":"1.0","canonical_sha256":"c374cfc266073a775c27c06543c78826ae47c8c21f44c360485736a63c597fa3","source":{"kind":"arxiv","id":"1304.2346","version":1},"attestation_state":"computed","paper":{"title":"A Method for Using Belief Networks as Influence Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gregory F. Cooper","submitted_at":"2013-03-27T19:42:15Z","abstract_excerpt":"This paper demonstrates a method for using belief-network algorithms to solve influence diagram problems. In particular, both exact and approximation belief-network algorithms may be applied to solve influence-diagram problems. More generally, knowing the relationship between belief-network and influence-diagram problems may be useful in the design and development of more efficient influence diagram algorithms."},"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.2346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:42:15Z","cross_cats_sorted":[],"title_canon_sha256":"58e447b0cb62f8f76d7aec841dfd20dc5e7736171b8279b81d3a43e7e1d4ef5e","abstract_canon_sha256":"70cbe9917e4a4c7f50a47f438e15dd9de5f04da67006efb7ac745341e5f2106c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:32.554676Z","signature_b64":"Vw/2uy4fQs9LR7nePI7YkyUFXbDzbPuIMOuqMg0lSF7AqZnwbRgSsBJY1Nd+/K1Xr1ViMfnB0SZWeyMeYnVKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c374cfc266073a775c27c06543c78826ae47c8c21f44c360485736a63c597fa3","last_reissued_at":"2026-05-18T03:28:32.553935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:32.553935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Method for Using Belief Networks as Influence Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gregory F. Cooper","submitted_at":"2013-03-27T19:42:15Z","abstract_excerpt":"This paper demonstrates a method for using belief-network algorithms to solve influence diagram problems. In particular, both exact and approximation belief-network algorithms may be applied to solve influence-diagram problems. More generally, knowing the relationship between belief-network and influence-diagram problems may be useful in the design and development of more efficient influence diagram algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2346","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.2346","created_at":"2026-05-18T03:28:32.554060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2346v1","created_at":"2026-05-18T03:28:32.554060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2346","created_at":"2026-05-18T03:28:32.554060+00:00"},{"alias_kind":"pith_short_12","alias_value":"YN2M7QTGA45H","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YN2M7QTGA45HOXBH","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YN2M7QTG","created_at":"2026-05-18T12:28:06.772260+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/YN2M7QTGA45HOXBHYBSUHR4IE2","json":"https://pith.science/pith/YN2M7QTGA45HOXBHYBSUHR4IE2.json","graph_json":"https://pith.science/api/pith-number/YN2M7QTGA45HOXBHYBSUHR4IE2/graph.json","events_json":"https://pith.science/api/pith-number/YN2M7QTGA45HOXBHYBSUHR4IE2/events.json","paper":"https://pith.science/paper/YN2M7QTG"},"agent_actions":{"view_html":"https://pith.science/pith/YN2M7QTGA45HOXBHYBSUHR4IE2","download_json":"https://pith.science/pith/YN2M7QTGA45HOXBHYBSUHR4IE2.json","view_paper":"https://pith.science/paper/YN2M7QTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2346&json=true","fetch_graph":"https://pith.science/api/pith-number/YN2M7QTGA45HOXBHYBSUHR4IE2/graph.json","fetch_events":"https://pith.science/api/pith-number/YN2M7QTGA45HOXBHYBSUHR4IE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YN2M7QTGA45HOXBHYBSUHR4IE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YN2M7QTGA45HOXBHYBSUHR4IE2/action/storage_attestation","attest_author":"https://pith.science/pith/YN2M7QTGA45HOXBHYBSUHR4IE2/action/author_attestation","sign_citation":"https://pith.science/pith/YN2M7QTGA45HOXBHYBSUHR4IE2/action/citation_signature","submit_replication":"https://pith.science/pith/YN2M7QTGA45HOXBHYBSUHR4IE2/action/replication_record"}},"created_at":"2026-05-18T03:28:32.554060+00:00","updated_at":"2026-05-18T03:28:32.554060+00:00"}