{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JJDGEE7XJFAFIOWUXNT7C3NXM3","short_pith_number":"pith:JJDGEE7X","canonical_record":{"source":{"id":"1906.12215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-28T13:42:32Z","cross_cats_sorted":["cs.DS","stat.CO"],"title_canon_sha256":"8691b4df651140f766e2a36106f25bf0b91cbb4b6ee7f3367f3b64caab953b33","abstract_canon_sha256":"b7cf24651b49b852004f19bcfbba1ddda9c791e1945a0f271afa34147f50e6c1"},"schema_version":"1.0"},"canonical_sha256":"4a466213f74940543ad4bb67f16db766e417bcd7d0ea788a8105353284ac26f9","source":{"kind":"arxiv","id":"1906.12215","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.12215","created_at":"2026-05-17T23:41:07Z"},{"alias_kind":"arxiv_version","alias_value":"1906.12215v1","created_at":"2026-05-17T23:41:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.12215","created_at":"2026-05-17T23:41:07Z"},{"alias_kind":"pith_short_12","alias_value":"JJDGEE7XJFAF","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JJDGEE7XJFAFIOWU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JJDGEE7X","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JJDGEE7XJFAFIOWUXNT7C3NXM3","target":"record","payload":{"canonical_record":{"source":{"id":"1906.12215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-28T13:42:32Z","cross_cats_sorted":["cs.DS","stat.CO"],"title_canon_sha256":"8691b4df651140f766e2a36106f25bf0b91cbb4b6ee7f3367f3b64caab953b33","abstract_canon_sha256":"b7cf24651b49b852004f19bcfbba1ddda9c791e1945a0f271afa34147f50e6c1"},"schema_version":"1.0"},"canonical_sha256":"4a466213f74940543ad4bb67f16db766e417bcd7d0ea788a8105353284ac26f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:07.207411Z","signature_b64":"sOH/Bu8egTk7krX18EIFSzEq6DnEzPFZcif1ipYtIlKqhJ2SxR/PGjAXTYIR/bGAx2Rb2YlaVSGUz3c5Cha8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a466213f74940543ad4bb67f16db766e417bcd7d0ea788a8105353284ac26f9","last_reissued_at":"2026-05-17T23:41:07.206623Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:07.206623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.12215","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-17T23:41:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m8R0RqpHLCKB/F9WeNPQjHss3f8DlcbHZWH5S1bt+HKtdghbWzANGxsP4nFoUcJnjQjFM1F49POZPsBTYwb5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:43:51.492183Z"},"content_sha256":"aaed8c93071d2c1cdd7714b9e8987b7c6149dbd53f22ed1bd1293dd05e75f095","schema_version":"1.0","event_id":"sha256:aaed8c93071d2c1cdd7714b9e8987b7c6149dbd53f22ed1bd1293dd05e75f095"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JJDGEE7XJFAFIOWUXNT7C3NXM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving and benchmarking of algorithms for decision making with lower previsions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.CO"],"primary_cat":"math.OC","authors_text":"Camila C. S. Caiado, Matthias C. M. Troffaes, Nawapon Nakharutai","submitted_at":"2019-06-28T13:42:32Z","abstract_excerpt":"Maximality, interval dominance, and E-admissibility are three well-known criteria for decision making under severe uncertainty using lower previsions. We present a new fast algorithm for finding maximal gambles. We compare its performance to existing algorithms, one proposed by Troffaes and Hable (2014), and one by Jansen, Augustin, and Schollmeyer (2017). To do so, we develop a new method for generating random decision problems with pre-specified ratios of maximal and interval dominant gambles. Based on earlier work, we present efficient ways to find common feasible starting points in these a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.12215","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-17T23:41:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kCGOHvWK6S+fBqSFnKw6wJrcNtdkbXkn9d52OwCnmPnjBY0QF9WIiAybEslsvIwY3kLfYc6mAJie7J4nyV2ZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:43:51.492543Z"},"content_sha256":"717dc18843e09098f4ef74fac84f18306d494ebdfff64ea0f8632cdbd8674351","schema_version":"1.0","event_id":"sha256:717dc18843e09098f4ef74fac84f18306d494ebdfff64ea0f8632cdbd8674351"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3/bundle.json","state_url":"https://pith.science/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3/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-04T21:43:51Z","links":{"resolver":"https://pith.science/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3","bundle":"https://pith.science/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3/bundle.json","state":"https://pith.science/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JJDGEE7XJFAFIOWUXNT7C3NXM3","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":"b7cf24651b49b852004f19bcfbba1ddda9c791e1945a0f271afa34147f50e6c1","cross_cats_sorted":["cs.DS","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-28T13:42:32Z","title_canon_sha256":"8691b4df651140f766e2a36106f25bf0b91cbb4b6ee7f3367f3b64caab953b33"},"schema_version":"1.0","source":{"id":"1906.12215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.12215","created_at":"2026-05-17T23:41:07Z"},{"alias_kind":"arxiv_version","alias_value":"1906.12215v1","created_at":"2026-05-17T23:41:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.12215","created_at":"2026-05-17T23:41:07Z"},{"alias_kind":"pith_short_12","alias_value":"JJDGEE7XJFAF","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JJDGEE7XJFAFIOWU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JJDGEE7X","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:717dc18843e09098f4ef74fac84f18306d494ebdfff64ea0f8632cdbd8674351","target":"graph","created_at":"2026-05-17T23:41:07Z","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":"Maximality, interval dominance, and E-admissibility are three well-known criteria for decision making under severe uncertainty using lower previsions. We present a new fast algorithm for finding maximal gambles. We compare its performance to existing algorithms, one proposed by Troffaes and Hable (2014), and one by Jansen, Augustin, and Schollmeyer (2017). To do so, we develop a new method for generating random decision problems with pre-specified ratios of maximal and interval dominant gambles. Based on earlier work, we present efficient ways to find common feasible starting points in these a","authors_text":"Camila C. S. Caiado, Matthias C. M. Troffaes, Nawapon Nakharutai","cross_cats":["cs.DS","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-28T13:42:32Z","title":"Improving and benchmarking of algorithms for decision making with lower previsions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.12215","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:aaed8c93071d2c1cdd7714b9e8987b7c6149dbd53f22ed1bd1293dd05e75f095","target":"record","created_at":"2026-05-17T23:41:07Z","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":"b7cf24651b49b852004f19bcfbba1ddda9c791e1945a0f271afa34147f50e6c1","cross_cats_sorted":["cs.DS","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-28T13:42:32Z","title_canon_sha256":"8691b4df651140f766e2a36106f25bf0b91cbb4b6ee7f3367f3b64caab953b33"},"schema_version":"1.0","source":{"id":"1906.12215","kind":"arxiv","version":1}},"canonical_sha256":"4a466213f74940543ad4bb67f16db766e417bcd7d0ea788a8105353284ac26f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a466213f74940543ad4bb67f16db766e417bcd7d0ea788a8105353284ac26f9","first_computed_at":"2026-05-17T23:41:07.206623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:07.206623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sOH/Bu8egTk7krX18EIFSzEq6DnEzPFZcif1ipYtIlKqhJ2SxR/PGjAXTYIR/bGAx2Rb2YlaVSGUz3c5Cha8AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:07.207411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.12215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaed8c93071d2c1cdd7714b9e8987b7c6149dbd53f22ed1bd1293dd05e75f095","sha256:717dc18843e09098f4ef74fac84f18306d494ebdfff64ea0f8632cdbd8674351"],"state_sha256":"929a0ceb5d42471eee72bb00003da825c0a7a72bbdc9ef08cb01c731a77eb02f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m0F1660H0IKKHtoh11v5Y8iCvsmYLQMGTAI1E5KeEekBUvI+0h4y3RhcehU9+o5m8eQdh1U0r1gAnd7iF402AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:43:51.494508Z","bundle_sha256":"c28f240e2056b9b9a5698bfec4e5c91c5d5a53215abd4ff0f5995271a546e7b4"}}