{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GNRHFJW5KWHTHZ3OEZL3P744OA","short_pith_number":"pith:GNRHFJW5","canonical_record":{"source":{"id":"1805.06632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.RM","submitted_at":"2018-05-17T07:37:33Z","cross_cats_sorted":["cs.AI","cs.IR","math.OC"],"title_canon_sha256":"85a0c7f9eb0e0f6bf77151a9b4177f689f01f5329eb851e86b6eaf3f75ee9ecb","abstract_canon_sha256":"9466e882105a308280ce4143f86187eca298df02febcb0530834db9a83cbe453"},"schema_version":"1.0"},"canonical_sha256":"336272a6dd558f33e76e2657b7ff9c702396ce0ea56f2e4b48a7545d73f2f37b","source":{"kind":"arxiv","id":"1805.06632","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06632","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06632v1","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06632","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"GNRHFJW5KWHT","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GNRHFJW5KWHTHZ3O","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GNRHFJW5","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GNRHFJW5KWHTHZ3OEZL3P744OA","target":"record","payload":{"canonical_record":{"source":{"id":"1805.06632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.RM","submitted_at":"2018-05-17T07:37:33Z","cross_cats_sorted":["cs.AI","cs.IR","math.OC"],"title_canon_sha256":"85a0c7f9eb0e0f6bf77151a9b4177f689f01f5329eb851e86b6eaf3f75ee9ecb","abstract_canon_sha256":"9466e882105a308280ce4143f86187eca298df02febcb0530834db9a83cbe453"},"schema_version":"1.0"},"canonical_sha256":"336272a6dd558f33e76e2657b7ff9c702396ce0ea56f2e4b48a7545d73f2f37b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:41.455622Z","signature_b64":"mTWAtpLrWdx/v7fB6F1WhirtRxr93IUPtJEn9sMcDOQOhDLu10PqxPmx1lw1ufOUrhD6QfnksODKv9UNJkRXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"336272a6dd558f33e76e2657b7ff9c702396ce0ea56f2e4b48a7545d73f2f37b","last_reissued_at":"2026-05-18T00:15:41.455092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:41.455092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.06632","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:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qDU2QVVeWJMGJIr8hoXWVV7LPvCYvhSoaBAB5TVK5aK2D6FlUssygD56DNXUJC5fAQOQQh0y8QfS5t5J6FjOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:36:02.846683Z"},"content_sha256":"f71031d655a456a0abaa16e5419a6d9534872818043f438af3e3b90989a019a6","schema_version":"1.0","event_id":"sha256:f71031d655a456a0abaa16e5419a6d9534872818043f438af3e3b90989a019a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GNRHFJW5KWHTHZ3OEZL3P744OA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Preference Elicitation and Robust Optimization with Multi-Attribute Quasi-Concave Choice Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR","math.OC"],"primary_cat":"q-fin.RM","authors_text":"Huifu Xu, Wenjie Huang, William B. Haskell","submitted_at":"2018-05-17T07:37:33Z","abstract_excerpt":"Decision maker's preferences are often captured by some choice functions which are used to rank prospects. In this paper, we consider ambiguity in choice functions over a multi-attribute prospect space. Our main result is a robust preference model where the optimal decision is based on the worst-case choice function from an ambiguity set constructed through preference elicitation with pairwise comparisons of prospects. Differing from existing works in the area, our focus is on quasi-concave choice functions rather than concave functions and this enables us to cover a wide range of utility/risk"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06632","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:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kWrpOBnwc/wWSRMhirDfFSPetsGbDuOxjLYc19Z9Dug79ciskQEq+ppU9dvebJFCWhEmkaleZ5lw+qPIVXu3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:36:02.847027Z"},"content_sha256":"cb4a794382e7ccd52b6d9aea1e38616de0eaa458dab1f5d84165b2b020ec6b49","schema_version":"1.0","event_id":"sha256:cb4a794382e7ccd52b6d9aea1e38616de0eaa458dab1f5d84165b2b020ec6b49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNRHFJW5KWHTHZ3OEZL3P744OA/bundle.json","state_url":"https://pith.science/pith/GNRHFJW5KWHTHZ3OEZL3P744OA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNRHFJW5KWHTHZ3OEZL3P744OA/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-05-28T07:36:02Z","links":{"resolver":"https://pith.science/pith/GNRHFJW5KWHTHZ3OEZL3P744OA","bundle":"https://pith.science/pith/GNRHFJW5KWHTHZ3OEZL3P744OA/bundle.json","state":"https://pith.science/pith/GNRHFJW5KWHTHZ3OEZL3P744OA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNRHFJW5KWHTHZ3OEZL3P744OA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GNRHFJW5KWHTHZ3OEZL3P744OA","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":"9466e882105a308280ce4143f86187eca298df02febcb0530834db9a83cbe453","cross_cats_sorted":["cs.AI","cs.IR","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.RM","submitted_at":"2018-05-17T07:37:33Z","title_canon_sha256":"85a0c7f9eb0e0f6bf77151a9b4177f689f01f5329eb851e86b6eaf3f75ee9ecb"},"schema_version":"1.0","source":{"id":"1805.06632","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06632","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06632v1","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06632","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"GNRHFJW5KWHT","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GNRHFJW5KWHTHZ3O","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GNRHFJW5","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:cb4a794382e7ccd52b6d9aea1e38616de0eaa458dab1f5d84165b2b020ec6b49","target":"graph","created_at":"2026-05-18T00:15:41Z","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":"Decision maker's preferences are often captured by some choice functions which are used to rank prospects. In this paper, we consider ambiguity in choice functions over a multi-attribute prospect space. Our main result is a robust preference model where the optimal decision is based on the worst-case choice function from an ambiguity set constructed through preference elicitation with pairwise comparisons of prospects. Differing from existing works in the area, our focus is on quasi-concave choice functions rather than concave functions and this enables us to cover a wide range of utility/risk","authors_text":"Huifu Xu, Wenjie Huang, William B. Haskell","cross_cats":["cs.AI","cs.IR","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.RM","submitted_at":"2018-05-17T07:37:33Z","title":"Preference Elicitation and Robust Optimization with Multi-Attribute Quasi-Concave Choice Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06632","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:f71031d655a456a0abaa16e5419a6d9534872818043f438af3e3b90989a019a6","target":"record","created_at":"2026-05-18T00:15:41Z","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":"9466e882105a308280ce4143f86187eca298df02febcb0530834db9a83cbe453","cross_cats_sorted":["cs.AI","cs.IR","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.RM","submitted_at":"2018-05-17T07:37:33Z","title_canon_sha256":"85a0c7f9eb0e0f6bf77151a9b4177f689f01f5329eb851e86b6eaf3f75ee9ecb"},"schema_version":"1.0","source":{"id":"1805.06632","kind":"arxiv","version":1}},"canonical_sha256":"336272a6dd558f33e76e2657b7ff9c702396ce0ea56f2e4b48a7545d73f2f37b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"336272a6dd558f33e76e2657b7ff9c702396ce0ea56f2e4b48a7545d73f2f37b","first_computed_at":"2026-05-18T00:15:41.455092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:41.455092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mTWAtpLrWdx/v7fB6F1WhirtRxr93IUPtJEn9sMcDOQOhDLu10PqxPmx1lw1ufOUrhD6QfnksODKv9UNJkRXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:41.455622Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06632","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f71031d655a456a0abaa16e5419a6d9534872818043f438af3e3b90989a019a6","sha256:cb4a794382e7ccd52b6d9aea1e38616de0eaa458dab1f5d84165b2b020ec6b49"],"state_sha256":"41810d736db7d18b4b8bcfd4d0b8b9f5d82b37505d8e4daf4e26276ea21df819"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y8h6KQsfce/JeROVpEob58t3QFhsiWeAZPySDSSgPmWHNSbkQ8jjaMhG8jz7b4UDf02tNY/hrZRFx19qdUduAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:36:02.848989Z","bundle_sha256":"3b863d62b9608422daab1beb14e63688ab4703e41e2add30ba98563415833268"}}