{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZJ6OHTL4XH2ZCOAZBNMQ5NLHZL","short_pith_number":"pith:ZJ6OHTL4","canonical_record":{"source":{"id":"1302.3583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:14:40Z","cross_cats_sorted":[],"title_canon_sha256":"599e3a3f59e9f5ad3b5a9f9465f8f396276d696aef8cbdaa1f926aa04ff9c12e","abstract_canon_sha256":"3d48e8a9f00a472fd8e40a88f103b7ac766dc2050b181736e650b7316c99c1cc"},"schema_version":"1.0"},"canonical_sha256":"ca7ce3cd7cb9f59138190b590eb567caf85aa5edf06692eceb602fffb20a2ee7","source":{"kind":"arxiv","id":"1302.3583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3583","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3583v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3583","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZJ6OHTL4XH2Z","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZJ6OHTL4XH2ZCOAZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZJ6OHTL4","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZJ6OHTL4XH2ZCOAZBNMQ5NLHZL","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:14:40Z","cross_cats_sorted":[],"title_canon_sha256":"599e3a3f59e9f5ad3b5a9f9465f8f396276d696aef8cbdaa1f926aa04ff9c12e","abstract_canon_sha256":"3d48e8a9f00a472fd8e40a88f103b7ac766dc2050b181736e650b7316c99c1cc"},"schema_version":"1.0"},"canonical_sha256":"ca7ce3cd7cb9f59138190b590eb567caf85aa5edf06692eceb602fffb20a2ee7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:36.661146Z","signature_b64":"WnCA9M+SwKjIbr4Ig0fCxkRYs3EIFgckK3KCzy/MODlP9Gbg/tKqg7o24F+lKp4EdgkqVCzqt+Bgai5G5F8eBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca7ce3cd7cb9f59138190b590eb567caf85aa5edf06692eceb602fffb20a2ee7","last_reissued_at":"2026-05-18T03:33:36.660555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:36.660555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3583","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-18T03:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P1c24YWrtYTplyGVgl3EcUbRPeZSy5ESuSKr+ysvuPcNpXtUs4juAVdaMbim7195cKSqZ9NzFEK003lCWPUGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T10:21:56.336242Z"},"content_sha256":"321bfc4f3261e8b59b5eda9a86a3c8f57c2cfd6a55b817076761e033a84f0ae7","schema_version":"1.0","event_id":"sha256:321bfc4f3261e8b59b5eda9a86a3c8f57c2cfd6a55b817076761e033a84f0ae7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZJ6OHTL4XH2ZCOAZBNMQ5NLHZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Flexible Policy Construction by Information Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David L. Poole, Michael C. Horsch","submitted_at":"2013-02-13T14:14:40Z","abstract_excerpt":"We report on work towards flexible algorithms for solving decision problems represented as influence diagrams.  An algorithm is given to construct a tree structure for each decision node in an influence diagram.  Each tree represents a decision function and is constructed incrementally.  The improvements to the tree converge to the optimal decision function (neglecting computational costs) and the asymptotic behaviour is only a constant factor worse than dynamic programming techniques, counting the number of Bayesian network queries.  Empirical results show how expected utility increases with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3583","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-18T03:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sljOo0f0h5QfmOVROsMMroT+XpbprDUjhW0hPWGtYeJ939Nh4SGI4RRFnp/iag2Bse5KRVl7P4EU8q+CY0KyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T10:21:56.336600Z"},"content_sha256":"8bbc86b2f68c2895946b3b8897c498aebf7b00b0f92ec6713692628f7d87aa49","schema_version":"1.0","event_id":"sha256:8bbc86b2f68c2895946b3b8897c498aebf7b00b0f92ec6713692628f7d87aa49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJ6OHTL4XH2ZCOAZBNMQ5NLHZL/bundle.json","state_url":"https://pith.science/pith/ZJ6OHTL4XH2ZCOAZBNMQ5NLHZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJ6OHTL4XH2ZCOAZBNMQ5NLHZL/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-29T10:21:56Z","links":{"resolver":"https://pith.science/pith/ZJ6OHTL4XH2ZCOAZBNMQ5NLHZL","bundle":"https://pith.science/pith/ZJ6OHTL4XH2ZCOAZBNMQ5NLHZL/bundle.json","state":"https://pith.science/pith/ZJ6OHTL4XH2ZCOAZBNMQ5NLHZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJ6OHTL4XH2ZCOAZBNMQ5NLHZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZJ6OHTL4XH2ZCOAZBNMQ5NLHZL","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":"3d48e8a9f00a472fd8e40a88f103b7ac766dc2050b181736e650b7316c99c1cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:14:40Z","title_canon_sha256":"599e3a3f59e9f5ad3b5a9f9465f8f396276d696aef8cbdaa1f926aa04ff9c12e"},"schema_version":"1.0","source":{"id":"1302.3583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3583","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3583v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3583","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZJ6OHTL4XH2Z","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZJ6OHTL4XH2ZCOAZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZJ6OHTL4","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:8bbc86b2f68c2895946b3b8897c498aebf7b00b0f92ec6713692628f7d87aa49","target":"graph","created_at":"2026-05-18T03:33:36Z","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":"We report on work towards flexible algorithms for solving decision problems represented as influence diagrams.  An algorithm is given to construct a tree structure for each decision node in an influence diagram.  Each tree represents a decision function and is constructed incrementally.  The improvements to the tree converge to the optimal decision function (neglecting computational costs) and the asymptotic behaviour is only a constant factor worse than dynamic programming techniques, counting the number of Bayesian network queries.  Empirical results show how expected utility increases with ","authors_text":"David L. Poole, Michael C. Horsch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:14:40Z","title":"Flexible Policy Construction by Information Refinement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3583","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:321bfc4f3261e8b59b5eda9a86a3c8f57c2cfd6a55b817076761e033a84f0ae7","target":"record","created_at":"2026-05-18T03:33:36Z","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":"3d48e8a9f00a472fd8e40a88f103b7ac766dc2050b181736e650b7316c99c1cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:14:40Z","title_canon_sha256":"599e3a3f59e9f5ad3b5a9f9465f8f396276d696aef8cbdaa1f926aa04ff9c12e"},"schema_version":"1.0","source":{"id":"1302.3583","kind":"arxiv","version":1}},"canonical_sha256":"ca7ce3cd7cb9f59138190b590eb567caf85aa5edf06692eceb602fffb20a2ee7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca7ce3cd7cb9f59138190b590eb567caf85aa5edf06692eceb602fffb20a2ee7","first_computed_at":"2026-05-18T03:33:36.660555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:36.660555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WnCA9M+SwKjIbr4Ig0fCxkRYs3EIFgckK3KCzy/MODlP9Gbg/tKqg7o24F+lKp4EdgkqVCzqt+Bgai5G5F8eBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:36.661146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:321bfc4f3261e8b59b5eda9a86a3c8f57c2cfd6a55b817076761e033a84f0ae7","sha256:8bbc86b2f68c2895946b3b8897c498aebf7b00b0f92ec6713692628f7d87aa49"],"state_sha256":"030cae4584867f15279e090392348b44bed72f59c21dafe6bb73ee0f3b3fd116"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1HxeC4u+rQnaK1iI5PQ5gr26hfqFjXCvPDiel3rbJG6zgQQ6dfXPeQ48KR7bM+G97S5jO5jZv4Ne9qUG/vOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T10:21:56.338449Z","bundle_sha256":"b1e01a21059963f88be2db620851d942ff23ad80876bcc47a2b6bb9b9aab4b2d"}}