{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MOB4B5GA73V5YMEQ5LONWM4A6V","short_pith_number":"pith:MOB4B5GA","schema_version":"1.0","canonical_sha256":"6383c0f4c0feebdc3090eadcdb3380f566f00d5a6656c1babe2d83408625e88b","source":{"kind":"arxiv","id":"1303.1494","version":1},"attestation_state":"computed","paper":{"title":"Two Procedures for Compiling Influence Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Azar Sadigh, Paul E. Lehner","submitted_at":"2013-03-06T14:22:13Z","abstract_excerpt":"Two algorithms are presented for \"compiling\" influence diagrams into a set of simple decision rules.  These decision rules define simple-to-execute, complete, consistent, and near-optimal decision procedures.  These compilation algorithms can be used to derive decision procedures for human teams solving time constrained decision 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.1494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-06T14:22:13Z","cross_cats_sorted":[],"title_canon_sha256":"f171b01e888e639fb072dba0196c8fe66d8cee630cc420e1e2cdff1c76d0c46b","abstract_canon_sha256":"dd1f4f62a51abba4f926bbeb8927fe3fa03a611aab65634f7839103c8601223f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:42.570472Z","signature_b64":"PcWGZPnu+kIm2WqqDyJGe462SGzAQkU2Nacegh9EyHg0ON7kcd+EokJcK9ioWHLF6pHTkD1V8n9luAgMf7GrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6383c0f4c0feebdc3090eadcdb3380f566f00d5a6656c1babe2d83408625e88b","last_reissued_at":"2026-05-18T03:31:42.569941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:42.569941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two Procedures for Compiling Influence Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Azar Sadigh, Paul E. Lehner","submitted_at":"2013-03-06T14:22:13Z","abstract_excerpt":"Two algorithms are presented for \"compiling\" influence diagrams into a set of simple decision rules.  These decision rules define simple-to-execute, complete, consistent, and near-optimal decision procedures.  These compilation algorithms can be used to derive decision procedures for human teams solving time constrained decision problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1494","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.1494","created_at":"2026-05-18T03:31:42.570016+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1494v1","created_at":"2026-05-18T03:31:42.570016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1494","created_at":"2026-05-18T03:31:42.570016+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOB4B5GA73V5","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOB4B5GA73V5YMEQ","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOB4B5GA","created_at":"2026-05-18T12:27:52.871228+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/MOB4B5GA73V5YMEQ5LONWM4A6V","json":"https://pith.science/pith/MOB4B5GA73V5YMEQ5LONWM4A6V.json","graph_json":"https://pith.science/api/pith-number/MOB4B5GA73V5YMEQ5LONWM4A6V/graph.json","events_json":"https://pith.science/api/pith-number/MOB4B5GA73V5YMEQ5LONWM4A6V/events.json","paper":"https://pith.science/paper/MOB4B5GA"},"agent_actions":{"view_html":"https://pith.science/pith/MOB4B5GA73V5YMEQ5LONWM4A6V","download_json":"https://pith.science/pith/MOB4B5GA73V5YMEQ5LONWM4A6V.json","view_paper":"https://pith.science/paper/MOB4B5GA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1494&json=true","fetch_graph":"https://pith.science/api/pith-number/MOB4B5GA73V5YMEQ5LONWM4A6V/graph.json","fetch_events":"https://pith.science/api/pith-number/MOB4B5GA73V5YMEQ5LONWM4A6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOB4B5GA73V5YMEQ5LONWM4A6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOB4B5GA73V5YMEQ5LONWM4A6V/action/storage_attestation","attest_author":"https://pith.science/pith/MOB4B5GA73V5YMEQ5LONWM4A6V/action/author_attestation","sign_citation":"https://pith.science/pith/MOB4B5GA73V5YMEQ5LONWM4A6V/action/citation_signature","submit_replication":"https://pith.science/pith/MOB4B5GA73V5YMEQ5LONWM4A6V/action/replication_record"}},"created_at":"2026-05-18T03:31:42.570016+00:00","updated_at":"2026-05-18T03:31:42.570016+00:00"}