{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4ECI5GSIELAFA4WGRJLCQUK4W2","short_pith_number":"pith:4ECI5GSI","canonical_record":{"source":{"id":"1807.03705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-09T07:40:58Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"a1906c787a0787d3ffb3cec336f04e9ea621258085e19af6e88af06181720360","abstract_canon_sha256":"0c469831a460d5089d1f7f2d6f46df2a6ca8b71fd677a30798f4b764cd007132"},"schema_version":"1.0"},"canonical_sha256":"e1048e9a4822c05072c68a5628515cb6aaaccc48c9c1572b5a9b38e1dde6ee5c","source":{"kind":"arxiv","id":"1807.03705","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03705","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03705v1","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03705","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"4ECI5GSIELAF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4ECI5GSIELAFA4WG","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4ECI5GSI","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4ECI5GSIELAFA4WGRJLCQUK4W2","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-09T07:40:58Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"a1906c787a0787d3ffb3cec336f04e9ea621258085e19af6e88af06181720360","abstract_canon_sha256":"0c469831a460d5089d1f7f2d6f46df2a6ca8b71fd677a30798f4b764cd007132"},"schema_version":"1.0"},"canonical_sha256":"e1048e9a4822c05072c68a5628515cb6aaaccc48c9c1572b5a9b38e1dde6ee5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:30.857940Z","signature_b64":"HcDqVhtHSC+UlOYnJl38mTGpPxt76Y5OlZhwjSo4D6vruWplomWi73tOwpVliaJTDgF7M1VzmjM8P1eU/P3aDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1048e9a4822c05072c68a5628515cb6aaaccc48c9c1572b5a9b38e1dde6ee5c","last_reissued_at":"2026-05-18T00:08:30.857522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:30.857522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03705","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-18T00:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPDlcWXaNPsJ46wcoA2KY14BWaF7/OGryaMLq7wOBqGZZIX1s5hp+JwfvlG/jM9YiFj/Pr9Ppp22nhwhN1wLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T07:41:29.841344Z"},"content_sha256":"be65857a100afd7ead93ef270c0e00980abb26d45c678f08a9e7719485564454","schema_version":"1.0","event_id":"sha256:be65857a100afd7ead93ef270c0e00980abb26d45c678f08a9e7719485564454"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4ECI5GSIELAFA4WGRJLCQUK4W2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decision making under uncertainty using imprecise probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"math.PR","authors_text":"Matthias C. M. Troffaes","submitted_at":"2018-07-09T07:40:58Z","abstract_excerpt":"Various ways for decision making with imprecise probabilities (admissibility, maximal expected utility, maximality, E-admissibility, $\\Gamma$-maximax, $\\Gamma$-maximin, all of which are well-known from the literature) are discussed and compared. We generalize a well-known sufficient condition for existence of optimal decisions. A simple numerical example shows how these criteria can work in practice, and demonstrates their differences. Finally, we suggest an efficient approach to calculate optimal decisions under these decision criteria."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03705","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-18T00:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"on0vkzk5ey4aZUfpTrtXM4+GO6d9Z3A4558cTIAG4mmKHOEc60iNQtGepU7hT4+FIGFlHxIiomziNVXKiXqEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T07:41:29.841905Z"},"content_sha256":"9d836c8937b5255f2e9c4bb913df00f48cb60c8b08ff78b87dcc0d9a669820db","schema_version":"1.0","event_id":"sha256:9d836c8937b5255f2e9c4bb913df00f48cb60c8b08ff78b87dcc0d9a669820db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ECI5GSIELAFA4WGRJLCQUK4W2/bundle.json","state_url":"https://pith.science/pith/4ECI5GSIELAFA4WGRJLCQUK4W2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ECI5GSIELAFA4WGRJLCQUK4W2/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-05T07:41:29Z","links":{"resolver":"https://pith.science/pith/4ECI5GSIELAFA4WGRJLCQUK4W2","bundle":"https://pith.science/pith/4ECI5GSIELAFA4WGRJLCQUK4W2/bundle.json","state":"https://pith.science/pith/4ECI5GSIELAFA4WGRJLCQUK4W2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ECI5GSIELAFA4WGRJLCQUK4W2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4ECI5GSIELAFA4WGRJLCQUK4W2","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":"0c469831a460d5089d1f7f2d6f46df2a6ca8b71fd677a30798f4b764cd007132","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-09T07:40:58Z","title_canon_sha256":"a1906c787a0787d3ffb3cec336f04e9ea621258085e19af6e88af06181720360"},"schema_version":"1.0","source":{"id":"1807.03705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03705","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03705v1","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03705","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"4ECI5GSIELAF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4ECI5GSIELAFA4WG","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4ECI5GSI","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:9d836c8937b5255f2e9c4bb913df00f48cb60c8b08ff78b87dcc0d9a669820db","target":"graph","created_at":"2026-05-18T00:08:30Z","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":"Various ways for decision making with imprecise probabilities (admissibility, maximal expected utility, maximality, E-admissibility, $\\Gamma$-maximax, $\\Gamma$-maximin, all of which are well-known from the literature) are discussed and compared. We generalize a well-known sufficient condition for existence of optimal decisions. A simple numerical example shows how these criteria can work in practice, and demonstrates their differences. Finally, we suggest an efficient approach to calculate optimal decisions under these decision criteria.","authors_text":"Matthias C. M. Troffaes","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-09T07:40:58Z","title":"Decision making under uncertainty using imprecise probabilities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03705","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:be65857a100afd7ead93ef270c0e00980abb26d45c678f08a9e7719485564454","target":"record","created_at":"2026-05-18T00:08:30Z","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":"0c469831a460d5089d1f7f2d6f46df2a6ca8b71fd677a30798f4b764cd007132","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-09T07:40:58Z","title_canon_sha256":"a1906c787a0787d3ffb3cec336f04e9ea621258085e19af6e88af06181720360"},"schema_version":"1.0","source":{"id":"1807.03705","kind":"arxiv","version":1}},"canonical_sha256":"e1048e9a4822c05072c68a5628515cb6aaaccc48c9c1572b5a9b38e1dde6ee5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1048e9a4822c05072c68a5628515cb6aaaccc48c9c1572b5a9b38e1dde6ee5c","first_computed_at":"2026-05-18T00:08:30.857522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:30.857522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HcDqVhtHSC+UlOYnJl38mTGpPxt76Y5OlZhwjSo4D6vruWplomWi73tOwpVliaJTDgF7M1VzmjM8P1eU/P3aDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:30.857940Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be65857a100afd7ead93ef270c0e00980abb26d45c678f08a9e7719485564454","sha256:9d836c8937b5255f2e9c4bb913df00f48cb60c8b08ff78b87dcc0d9a669820db"],"state_sha256":"1899eec39f8458b616aa9c4c16c9ca8680e49503f9f3f88bef2cd64f5928b794"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pgax9KQdjSV8jcgiJCCyzkaIxJ0V3X0Nr2cLSopr/vMvXcz7MDZdSUg73FN/wnwT65vgJ4Mdyf8gL+Ffv2mHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T07:41:29.845028Z","bundle_sha256":"acb35747d263dc57c4b1d39a6080670a67523089bcf18ba0fbdc64fc6d045526"}}