{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SMDXVQDR2MNNYRQLMCJ4UYCCG2","short_pith_number":"pith:SMDXVQDR","schema_version":"1.0","canonical_sha256":"93077ac071d31adc460b6093ca604236b4e2101423db6ed1e555cc043d5584af","source":{"kind":"arxiv","id":"1302.6824","version":1},"attestation_state":"computed","paper":{"title":"From Influence Diagrams to Junction Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Finn Verner Jensen, Frank Jensen, Soren L. Dittmer","submitted_at":"2013-02-27T14:17:42Z","abstract_excerpt":"We present an approach to the solution of decision problems formulated as influence diagrams.  This approach involves a special triangulation of the underlying graph, the construction of a junction tree with special properties, and a message passing algorithm operating on the junction tree for computation of expected utilities and optimal decision policies."},"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":"1302.6824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-27T14:17:42Z","cross_cats_sorted":[],"title_canon_sha256":"461c3ae706e0e1b009270fb7b0f635389834e0644a67f7a3525c35b0c4c423b2","abstract_canon_sha256":"2f80440f01d49618ee00ea50bc22683bf774a0afbe324e099087a822128951de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:18.555519Z","signature_b64":"Pz1kgEkWMxDqpKFSODH1Ii+djZR5OVgimNtsdd01JEBx4zWlAo12Zk9iIy/RuGXWWqawJe97shU3kIR7xxuVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93077ac071d31adc460b6093ca604236b4e2101423db6ed1e555cc043d5584af","last_reissued_at":"2026-05-18T03:32:18.555070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:18.555070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Influence Diagrams to Junction Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Finn Verner Jensen, Frank Jensen, Soren L. Dittmer","submitted_at":"2013-02-27T14:17:42Z","abstract_excerpt":"We present an approach to the solution of decision problems formulated as influence diagrams.  This approach involves a special triangulation of the underlying graph, the construction of a junction tree with special properties, and a message passing algorithm operating on the junction tree for computation of expected utilities and optimal decision policies."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6824","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":"1302.6824","created_at":"2026-05-18T03:32:18.555132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6824v1","created_at":"2026-05-18T03:32:18.555132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6824","created_at":"2026-05-18T03:32:18.555132+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMDXVQDR2MNN","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMDXVQDR2MNNYRQL","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMDXVQDR","created_at":"2026-05-18T12:27:59.945178+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/SMDXVQDR2MNNYRQLMCJ4UYCCG2","json":"https://pith.science/pith/SMDXVQDR2MNNYRQLMCJ4UYCCG2.json","graph_json":"https://pith.science/api/pith-number/SMDXVQDR2MNNYRQLMCJ4UYCCG2/graph.json","events_json":"https://pith.science/api/pith-number/SMDXVQDR2MNNYRQLMCJ4UYCCG2/events.json","paper":"https://pith.science/paper/SMDXVQDR"},"agent_actions":{"view_html":"https://pith.science/pith/SMDXVQDR2MNNYRQLMCJ4UYCCG2","download_json":"https://pith.science/pith/SMDXVQDR2MNNYRQLMCJ4UYCCG2.json","view_paper":"https://pith.science/paper/SMDXVQDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6824&json=true","fetch_graph":"https://pith.science/api/pith-number/SMDXVQDR2MNNYRQLMCJ4UYCCG2/graph.json","fetch_events":"https://pith.science/api/pith-number/SMDXVQDR2MNNYRQLMCJ4UYCCG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMDXVQDR2MNNYRQLMCJ4UYCCG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMDXVQDR2MNNYRQLMCJ4UYCCG2/action/storage_attestation","attest_author":"https://pith.science/pith/SMDXVQDR2MNNYRQLMCJ4UYCCG2/action/author_attestation","sign_citation":"https://pith.science/pith/SMDXVQDR2MNNYRQLMCJ4UYCCG2/action/citation_signature","submit_replication":"https://pith.science/pith/SMDXVQDR2MNNYRQLMCJ4UYCCG2/action/replication_record"}},"created_at":"2026-05-18T03:32:18.555132+00:00","updated_at":"2026-05-18T03:32:18.555132+00:00"}