{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Z7H7LBFFSOFLHI3PJN3MS6YQW4","short_pith_number":"pith:Z7H7LBFF","canonical_record":{"source":{"id":"1104.0191","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-01T15:04:21Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"e713efbd281cfdc7b974111f4f4009c6d4edfb258597f39dd73a6e6d96ee480d","abstract_canon_sha256":"1f8b0e80a4d191a4f548f5b4c259838bb5cef6bd3d95992fb6968a89f393541d"},"schema_version":"1.0"},"canonical_sha256":"cfcff584a5938ab3a36f4b76c97b10b715137ff8794e11ecdb67dd896f164a2d","source":{"kind":"arxiv","id":"1104.0191","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0191","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0191v2","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0191","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"Z7H7LBFFSOFL","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Z7H7LBFFSOFLHI3P","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Z7H7LBFF","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Z7H7LBFFSOFLHI3PJN3MS6YQW4","target":"record","payload":{"canonical_record":{"source":{"id":"1104.0191","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-01T15:04:21Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"e713efbd281cfdc7b974111f4f4009c6d4edfb258597f39dd73a6e6d96ee480d","abstract_canon_sha256":"1f8b0e80a4d191a4f548f5b4c259838bb5cef6bd3d95992fb6968a89f393541d"},"schema_version":"1.0"},"canonical_sha256":"cfcff584a5938ab3a36f4b76c97b10b715137ff8794e11ecdb67dd896f164a2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:31.852503Z","signature_b64":"XkD9Z7F04MzvF9+6ejSpsxBNql3sYNu99ubOexG7ktBFXvUMvQlXiGqHsO0L3CupMk6ka1jJkVX32vEXMzIzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfcff584a5938ab3a36f4b76c97b10b715137ff8794e11ecdb67dd896f164a2d","last_reissued_at":"2026-05-18T00:08:31.851829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:31.851829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.0191","source_version":2,"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-18T00:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dyDKlthVC1fwAD7ew4NWOJxBeK1iJxwPUdti4UpAF7cY9ZM4FVffNH6FcJsbXqByZuFmDHqCyOMOopD9Zxj8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:21:40.429676Z"},"content_sha256":"8512549290eefc369b728c8c8442422d88725982fd16f03aef5dfa0d26156f50","schema_version":"1.0","event_id":"sha256:8512549290eefc369b728c8c8442422d88725982fd16f03aef5dfa0d26156f50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Z7H7LBFFSOFLHI3PJN3MS6YQW4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Normal form backward induction for decision trees with coherent lower previsions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Matthias C. M. Troffaes, Nathan Huntley","submitted_at":"2011-04-01T15:04:21Z","abstract_excerpt":"We examine normal form solutions of decision trees under typical choice functions induced by lower previsions. For large trees, finding such solutions is hard as very many strategies must be considered. In an earlier paper, we extended backward induction to arbitrary choice functions, yielding far more efficient solutions, and we identified simple necessary and sufficient conditions for this to work. In this paper, we show that backward induction works for maximality and E-admissibility, but not for interval dominance and Gamma-maximin. We also show that, in some situations, a computationally "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0191","kind":"arxiv","version":2},"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-18T00:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qEGlSlAqMsWamV+fysu5Zw6XgvY6Aam+GP2R4aa72sa1T+R6yahG+Ynjf/hF5ztzdkfNo4jzAZq0ouvIzslUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:21:40.430033Z"},"content_sha256":"dc7f9f0524514080c24a5ba4d91483817eb48e86ad23fd89b87e1c03102a5696","schema_version":"1.0","event_id":"sha256:dc7f9f0524514080c24a5ba4d91483817eb48e86ad23fd89b87e1c03102a5696"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7H7LBFFSOFLHI3PJN3MS6YQW4/bundle.json","state_url":"https://pith.science/pith/Z7H7LBFFSOFLHI3PJN3MS6YQW4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7H7LBFFSOFLHI3PJN3MS6YQW4/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-04T18:21:40Z","links":{"resolver":"https://pith.science/pith/Z7H7LBFFSOFLHI3PJN3MS6YQW4","bundle":"https://pith.science/pith/Z7H7LBFFSOFLHI3PJN3MS6YQW4/bundle.json","state":"https://pith.science/pith/Z7H7LBFFSOFLHI3PJN3MS6YQW4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7H7LBFFSOFLHI3PJN3MS6YQW4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Z7H7LBFFSOFLHI3PJN3MS6YQW4","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":"1f8b0e80a4d191a4f548f5b4c259838bb5cef6bd3d95992fb6968a89f393541d","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-01T15:04:21Z","title_canon_sha256":"e713efbd281cfdc7b974111f4f4009c6d4edfb258597f39dd73a6e6d96ee480d"},"schema_version":"1.0","source":{"id":"1104.0191","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0191","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0191v2","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0191","created_at":"2026-05-18T00:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"Z7H7LBFFSOFL","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Z7H7LBFFSOFLHI3P","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Z7H7LBFF","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:dc7f9f0524514080c24a5ba4d91483817eb48e86ad23fd89b87e1c03102a5696","target":"graph","created_at":"2026-05-18T00:08:31Z","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 examine normal form solutions of decision trees under typical choice functions induced by lower previsions. For large trees, finding such solutions is hard as very many strategies must be considered. In an earlier paper, we extended backward induction to arbitrary choice functions, yielding far more efficient solutions, and we identified simple necessary and sufficient conditions for this to work. In this paper, we show that backward induction works for maximality and E-admissibility, but not for interval dominance and Gamma-maximin. We also show that, in some situations, a computationally ","authors_text":"Matthias C. M. Troffaes, Nathan Huntley","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-01T15:04:21Z","title":"Normal form backward induction for decision trees with coherent lower previsions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0191","kind":"arxiv","version":2},"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:8512549290eefc369b728c8c8442422d88725982fd16f03aef5dfa0d26156f50","target":"record","created_at":"2026-05-18T00:08:31Z","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":"1f8b0e80a4d191a4f548f5b4c259838bb5cef6bd3d95992fb6968a89f393541d","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-01T15:04:21Z","title_canon_sha256":"e713efbd281cfdc7b974111f4f4009c6d4edfb258597f39dd73a6e6d96ee480d"},"schema_version":"1.0","source":{"id":"1104.0191","kind":"arxiv","version":2}},"canonical_sha256":"cfcff584a5938ab3a36f4b76c97b10b715137ff8794e11ecdb67dd896f164a2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfcff584a5938ab3a36f4b76c97b10b715137ff8794e11ecdb67dd896f164a2d","first_computed_at":"2026-05-18T00:08:31.851829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:31.851829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XkD9Z7F04MzvF9+6ejSpsxBNql3sYNu99ubOexG7ktBFXvUMvQlXiGqHsO0L3CupMk6ka1jJkVX32vEXMzIzBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:31.852503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.0191","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8512549290eefc369b728c8c8442422d88725982fd16f03aef5dfa0d26156f50","sha256:dc7f9f0524514080c24a5ba4d91483817eb48e86ad23fd89b87e1c03102a5696"],"state_sha256":"0965612a88b0cab625fd8cb3f07237d9336f5a9e407e8fe670a6d3df428a4c8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKiAkODgmf9NRu9NtMKOBwXNJwwvjaI1liO3cSOFtzx/Ssq7yBz7DruKbsxdpMJa9mL8587Lm2tKxz0uIFJ4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:21:40.432082Z","bundle_sha256":"8e162c2435716780ffd9305e522e484ad4041b9ebb4b268af03dca198a31cff3"}}