{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JJDGEE7XJFAFIOWUXNT7C3NXM3","short_pith_number":"pith:JJDGEE7X","schema_version":"1.0","canonical_sha256":"4a466213f74940543ad4bb67f16db766e417bcd7d0ea788a8105353284ac26f9","source":{"kind":"arxiv","id":"1906.12215","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.12215","created_at":"2026-05-17T23:41:07.206761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.12215v1","created_at":"2026-05-17T23:41:07.206761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.12215","created_at":"2026-05-17T23:41:07.206761+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJDGEE7XJFAF","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJDGEE7XJFAFIOWU","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJDGEE7X","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3","json":"https://pith.science/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3.json","graph_json":"https://pith.science/api/pith-number/JJDGEE7XJFAFIOWUXNT7C3NXM3/graph.json","events_json":"https://pith.science/api/pith-number/JJDGEE7XJFAFIOWUXNT7C3NXM3/events.json","paper":"https://pith.science/paper/JJDGEE7X"},"agent_actions":{"view_html":"https://pith.science/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3","download_json":"https://pith.science/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3.json","view_paper":"https://pith.science/paper/JJDGEE7X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.12215&json=true","fetch_graph":"https://pith.science/api/pith-number/JJDGEE7XJFAFIOWUXNT7C3NXM3/graph.json","fetch_events":"https://pith.science/api/pith-number/JJDGEE7XJFAFIOWUXNT7C3NXM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3/action/storage_attestation","attest_author":"https://pith.science/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3/action/author_attestation","sign_citation":"https://pith.science/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3/action/citation_signature","submit_replication":"https://pith.science/pith/JJDGEE7XJFAFIOWUXNT7C3NXM3/action/replication_record"}},"created_at":"2026-05-17T23:41:07.206761+00:00","updated_at":"2026-05-17T23:41:07.206761+00:00"}