{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:362ANOQ7FMXAY7WO5RDONWCO6H","short_pith_number":"pith:362ANOQ7","canonical_record":{"source":{"id":"1203.3513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"5fcf65b4f057a62c76a7001ca474c61af7ab2fe4d85fe3067aa0f1f0f6c7622c","abstract_canon_sha256":"2513c860057598213a198e7783c9aa047114615d8145d7aa8f17eb5513d61b66"},"schema_version":"1.0"},"canonical_sha256":"dfb406ba1f2b2e0c7eceec46e6d84ef1fda04067b3997c20a42686c22f33014b","source":{"kind":"arxiv","id":"1203.3513","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3513","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3513v1","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3513","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"362ANOQ7FMXA","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"362ANOQ7FMXAY7WO","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"362ANOQ7","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:362ANOQ7FMXAY7WO5RDONWCO6H","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"5fcf65b4f057a62c76a7001ca474c61af7ab2fe4d85fe3067aa0f1f0f6c7622c","abstract_canon_sha256":"2513c860057598213a198e7783c9aa047114615d8145d7aa8f17eb5513d61b66"},"schema_version":"1.0"},"canonical_sha256":"dfb406ba1f2b2e0c7eceec46e6d84ef1fda04067b3997c20a42686c22f33014b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:00.044499Z","signature_b64":"/wODbR0qQZhKlzuCeiCVpN4xjskWyJ9OuZQX0c3iC+EOdJnzkk4yH45V51LDHMZwTD4NSkd4US2GRYTC6O9vBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfb406ba1f2b2e0c7eceec46e6d84ef1fda04067b3997c20a42686c22f33014b","last_reissued_at":"2026-05-18T04:00:00.044006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:00.044006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3513","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eedq5ZiKorKNrgSDCkiE6bkN1t1wPhXC1jc980gcM9bR2eNpZFqEla015MBOfnMTPv2D7hNUn0DNKMQRrBKRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:00:31.657548Z"},"content_sha256":"7c2573be0348d4a0f2c14edbfcf4441305e16ccb4033024e417a4d7dcd91f8ad","schema_version":"1.0","event_id":"sha256:7c2573be0348d4a0f2c14edbfcf4441305e16ccb4033024e417a4d7dcd91f8ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:362ANOQ7FMXAY7WO5RDONWCO6H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic programming in in uence diagrams with decision circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Debarun Bhattacharjya, Ross D. Shachter","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"Decision circuits perform efficient evaluation of influence diagrams, building on the ad- vances in arithmetic circuits for belief net- work inference [Darwiche, 2003; Bhattachar- jya and Shachter, 2007]. We show how even more compact decision circuits can be con- structed for dynamic programming in influ- ence diagrams with separable value functions and conditionally independent subproblems. Once a decision circuit has been constructed based on the diagram's \"global\" graphical structure, it can be compiled to exploit \"lo- cal\" structure for efficient evaluation and sen- sitivity analysis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3513","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gPWioBs+HAZMc/MG9BfvE4o6kI7nytsGimqZPay+7Ip6RP438QJzMLQeyJY5hZ7IdZtFBhMjCn1WZ6b+46KYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:00:31.657897Z"},"content_sha256":"a6d498fc9fd8d065a749d99aa2f86f6dc14ee72bcf527d2c0cf6691aaf8cf29a","schema_version":"1.0","event_id":"sha256:a6d498fc9fd8d065a749d99aa2f86f6dc14ee72bcf527d2c0cf6691aaf8cf29a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/362ANOQ7FMXAY7WO5RDONWCO6H/bundle.json","state_url":"https://pith.science/pith/362ANOQ7FMXAY7WO5RDONWCO6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/362ANOQ7FMXAY7WO5RDONWCO6H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T12:00:31Z","links":{"resolver":"https://pith.science/pith/362ANOQ7FMXAY7WO5RDONWCO6H","bundle":"https://pith.science/pith/362ANOQ7FMXAY7WO5RDONWCO6H/bundle.json","state":"https://pith.science/pith/362ANOQ7FMXAY7WO5RDONWCO6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/362ANOQ7FMXAY7WO5RDONWCO6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:362ANOQ7FMXAY7WO5RDONWCO6H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2513c860057598213a198e7783c9aa047114615d8145d7aa8f17eb5513d61b66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","title_canon_sha256":"5fcf65b4f057a62c76a7001ca474c61af7ab2fe4d85fe3067aa0f1f0f6c7622c"},"schema_version":"1.0","source":{"id":"1203.3513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3513","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3513v1","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3513","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"362ANOQ7FMXA","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"362ANOQ7FMXAY7WO","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"362ANOQ7","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:a6d498fc9fd8d065a749d99aa2f86f6dc14ee72bcf527d2c0cf6691aaf8cf29a","target":"graph","created_at":"2026-05-18T04:00:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Decision circuits perform efficient evaluation of influence diagrams, building on the ad- vances in arithmetic circuits for belief net- work inference [Darwiche, 2003; Bhattachar- jya and Shachter, 2007]. We show how even more compact decision circuits can be con- structed for dynamic programming in influ- ence diagrams with separable value functions and conditionally independent subproblems. Once a decision circuit has been constructed based on the diagram's \"global\" graphical structure, it can be compiled to exploit \"lo- cal\" structure for efficient evaluation and sen- sitivity analysis.","authors_text":"Debarun Bhattacharjya, Ross D. Shachter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","title":"Dynamic programming in in uence diagrams with decision circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3513","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7c2573be0348d4a0f2c14edbfcf4441305e16ccb4033024e417a4d7dcd91f8ad","target":"record","created_at":"2026-05-18T04:00:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2513c860057598213a198e7783c9aa047114615d8145d7aa8f17eb5513d61b66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-03-15T11:17:56Z","title_canon_sha256":"5fcf65b4f057a62c76a7001ca474c61af7ab2fe4d85fe3067aa0f1f0f6c7622c"},"schema_version":"1.0","source":{"id":"1203.3513","kind":"arxiv","version":1}},"canonical_sha256":"dfb406ba1f2b2e0c7eceec46e6d84ef1fda04067b3997c20a42686c22f33014b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfb406ba1f2b2e0c7eceec46e6d84ef1fda04067b3997c20a42686c22f33014b","first_computed_at":"2026-05-18T04:00:00.044006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:00.044006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/wODbR0qQZhKlzuCeiCVpN4xjskWyJ9OuZQX0c3iC+EOdJnzkk4yH45V51LDHMZwTD4NSkd4US2GRYTC6O9vBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:00.044499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c2573be0348d4a0f2c14edbfcf4441305e16ccb4033024e417a4d7dcd91f8ad","sha256:a6d498fc9fd8d065a749d99aa2f86f6dc14ee72bcf527d2c0cf6691aaf8cf29a"],"state_sha256":"4f95a591ad1a06b020110ae41ece61438be6bff53ecfe4d88e9028ebf0217563"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jVO/VH5v5XJ6sdyUZ9hZ+PacjTS6F104xuilE986Fr2dx+FN+nWPxNCdm7jVxXdwCmOt0egjcWV+enCK8AsaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T12:00:31.659933Z","bundle_sha256":"804f7e7cc61acb0b8bad892cec979d91e8104d6b60bb78225afc61b73308c059"}}