{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QZAS27HMI66A6OKTKFIELELYG6","short_pith_number":"pith:QZAS27HM","canonical_record":{"source":{"id":"2605.04267","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-05T20:02:35Z","cross_cats_sorted":["cs.NE","math.OC"],"title_canon_sha256":"126b99590e010d4c1ebac317cce7bdd126a7281a79142dc6ab77180e6aaee1eb","abstract_canon_sha256":"9d9104f151f74875fd6637a864a303ae3bf95fa83af08e30f246fd798a563b2a"},"schema_version":"1.0"},"canonical_sha256":"86412d7cec47bc0f3953515045917837a90ebfeec9614f49d1d5133e739b94f0","source":{"kind":"arxiv","id":"2605.04267","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.04267","created_at":"2026-06-19T16:11:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.04267v2","created_at":"2026-06-19T16:11:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.04267","created_at":"2026-06-19T16:11:24Z"},{"alias_kind":"pith_short_12","alias_value":"QZAS27HMI66A","created_at":"2026-06-19T16:11:24Z"},{"alias_kind":"pith_short_16","alias_value":"QZAS27HMI66A6OKT","created_at":"2026-06-19T16:11:24Z"},{"alias_kind":"pith_short_8","alias_value":"QZAS27HM","created_at":"2026-06-19T16:11:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QZAS27HMI66A6OKTKFIELELYG6","target":"record","payload":{"canonical_record":{"source":{"id":"2605.04267","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-05T20:02:35Z","cross_cats_sorted":["cs.NE","math.OC"],"title_canon_sha256":"126b99590e010d4c1ebac317cce7bdd126a7281a79142dc6ab77180e6aaee1eb","abstract_canon_sha256":"9d9104f151f74875fd6637a864a303ae3bf95fa83af08e30f246fd798a563b2a"},"schema_version":"1.0"},"canonical_sha256":"86412d7cec47bc0f3953515045917837a90ebfeec9614f49d1d5133e739b94f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:24.098786Z","signature_b64":"4Q8i4ZiCBQyqszQV/D8TeBne/XUhae6YhmZfw4T0saBi0/fWvkR/W7Pdz/imhVX2VO42tSwC/eahdTya8y5tBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86412d7cec47bc0f3953515045917837a90ebfeec9614f49d1d5133e739b94f0","last_reissued_at":"2026-06-19T16:11:24.098368Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:24.098368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.04267","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-06-19T16:11:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uP8WdDEXexQWxIFwH13bIXnrG527wsUER+nTMpYaKE8retq7mz5lmPzbu0zS+0fwYq939PbLM9xYZIwVuvfDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T14:14:19.416766Z"},"content_sha256":"2da5c9e28d7701b5adac933759a59227adcadb2452e94108b4593659e7e15bd1","schema_version":"1.0","event_id":"sha256:2da5c9e28d7701b5adac933759a59227adcadb2452e94108b4593659e7e15bd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QZAS27HMI66A6OKTKFIELELYG6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"QUIVER: Cost-Aware Adaptive Preference Querying in Surrogate-Assisted Evolutionary Multi-Objective Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"QUIVER adaptively chooses between objective evaluations and two types of preference queries to maximize expected decision quality gain per unit cost, reaching 25% lower final utility regret than fixed strategies on hard benchmarks.","cross_cats":["cs.NE","math.OC"],"primary_cat":"cs.LG","authors_text":"Florian A. D. Burnat","submitted_at":"2026-05-05T20:02:35Z","abstract_excerpt":"Interactive multi-objective optimization systems face a budget allocation dilemma: one can spend resources on expensive objective evaluations or on eliciting decision-maker preferences that identify the relevant region of the Pareto set. Moreover, preference elicitation itself spans modalities with different information content and cognitive burden, ranging from cheap, noisy pairwise preference statements (PS) to richer but costlier indifference adjustments (IA).\n  We study cost-aware optimization under an unknown scalarization and introduce QUIVER (Query-Informed Value Estimation for Regret),"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"QUIVER achieves the lowest final utility regret on challenging WFG problems (utility regret of 2.14 on WFG4, 2.82 on WFG9: a 25% improvement over baselines), outperforming all single-modality baselines.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The synthetic decision-maker models used to simulate preference responses and costs accurately represent real human behavior and query costs in the target application domains.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"QUIVER adaptively balances cheap pairwise preference queries and costly indifference adjustments with objective evaluations to achieve lower utility regret than single-modality baselines on WFG benchmarks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"QUIVER adaptively chooses between objective evaluations and two types of preference queries to maximize expected decision quality gain per unit cost, reaching 25% lower final utility regret than fixed strategies on hard benchmarks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"89e64858c6e9910c9bdbfb6f31e3eb4348fab5f93e777bc39f76dab300128bac"},"source":{"id":"2605.04267","kind":"arxiv","version":2},"verdict":{"id":"0b567d9d-0cbb-4745-b951-8b2d1e40a255","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T18:26:24.602562Z","strongest_claim":"QUIVER achieves the lowest final utility regret on challenging WFG problems (utility regret of 2.14 on WFG4, 2.82 on WFG9: a 25% improvement over baselines), outperforming all single-modality baselines.","one_line_summary":"QUIVER adaptively balances cheap pairwise preference queries and costly indifference adjustments with objective evaluations to achieve lower utility regret than single-modality baselines on WFG benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The synthetic decision-maker models used to simulate preference responses and costs accurately represent real human behavior and query costs in the target application domains.","pith_extraction_headline":"QUIVER adaptively chooses between objective evaluations and two types of preference queries to maximize expected decision quality gain per unit cost, reaching 25% lower final utility regret than fixed strategies on hard benchmarks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.04267/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T12:35:49.050721Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:20.841947Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:39:35.947530Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"1a09f9f254ba81b53fd5aff351b4307430b0156b5259c0aa8cba0de5301c7c27"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":3,"snapshot_sha256":"c66e910d2def791730a5210f0008d98f9a4bb5fde0ea534c45cd2796eae5a05d"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"0b567d9d-0cbb-4745-b951-8b2d1e40a255"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:11:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"whn/XzPRDCWA9g9M66O/EJnBAvIXWHnKh/lsutiuicrfEBf9jpTChUAsa9GShbueUovAeJSqujrZAgThOByUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T14:14:19.417257Z"},"content_sha256":"9812787e20690fb508a36e4b20500d7bdb2af87ddee7548b0397b6f43e36aa1b","schema_version":"1.0","event_id":"sha256:9812787e20690fb508a36e4b20500d7bdb2af87ddee7548b0397b6f43e36aa1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZAS27HMI66A6OKTKFIELELYG6/bundle.json","state_url":"https://pith.science/pith/QZAS27HMI66A6OKTKFIELELYG6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZAS27HMI66A6OKTKFIELELYG6/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-07-02T14:14:19Z","links":{"resolver":"https://pith.science/pith/QZAS27HMI66A6OKTKFIELELYG6","bundle":"https://pith.science/pith/QZAS27HMI66A6OKTKFIELELYG6/bundle.json","state":"https://pith.science/pith/QZAS27HMI66A6OKTKFIELELYG6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZAS27HMI66A6OKTKFIELELYG6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QZAS27HMI66A6OKTKFIELELYG6","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":"9d9104f151f74875fd6637a864a303ae3bf95fa83af08e30f246fd798a563b2a","cross_cats_sorted":["cs.NE","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-05T20:02:35Z","title_canon_sha256":"126b99590e010d4c1ebac317cce7bdd126a7281a79142dc6ab77180e6aaee1eb"},"schema_version":"1.0","source":{"id":"2605.04267","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.04267","created_at":"2026-06-19T16:11:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.04267v2","created_at":"2026-06-19T16:11:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.04267","created_at":"2026-06-19T16:11:24Z"},{"alias_kind":"pith_short_12","alias_value":"QZAS27HMI66A","created_at":"2026-06-19T16:11:24Z"},{"alias_kind":"pith_short_16","alias_value":"QZAS27HMI66A6OKT","created_at":"2026-06-19T16:11:24Z"},{"alias_kind":"pith_short_8","alias_value":"QZAS27HM","created_at":"2026-06-19T16:11:24Z"}],"graph_snapshots":[{"event_id":"sha256:9812787e20690fb508a36e4b20500d7bdb2af87ddee7548b0397b6f43e36aa1b","target":"graph","created_at":"2026-06-19T16:11:24Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"QUIVER achieves the lowest final utility regret on challenging WFG problems (utility regret of 2.14 on WFG4, 2.82 on WFG9: a 25% improvement over baselines), outperforming all single-modality baselines."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The synthetic decision-maker models used to simulate preference responses and costs accurately represent real human behavior and query costs in the target application domains."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"QUIVER adaptively balances cheap pairwise preference queries and costly indifference adjustments with objective evaluations to achieve lower utility regret than single-modality baselines on WFG benchmarks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"QUIVER adaptively chooses between objective evaluations and two types of preference queries to maximize expected decision quality gain per unit cost, reaching 25% lower final utility regret than fixed strategies on hard benchmarks."}],"snapshot_sha256":"89e64858c6e9910c9bdbfb6f31e3eb4348fab5f93e777bc39f76dab300128bac"},"formal_canon":{"evidence_count":3,"snapshot_sha256":"c66e910d2def791730a5210f0008d98f9a4bb5fde0ea534c45cd2796eae5a05d"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T12:35:49.050721Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:20.841947Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T14:39:35.947530Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.04267/integrity.json","findings":[],"snapshot_sha256":"1a09f9f254ba81b53fd5aff351b4307430b0156b5259c0aa8cba0de5301c7c27","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Interactive multi-objective optimization systems face a budget allocation dilemma: one can spend resources on expensive objective evaluations or on eliciting decision-maker preferences that identify the relevant region of the Pareto set. Moreover, preference elicitation itself spans modalities with different information content and cognitive burden, ranging from cheap, noisy pairwise preference statements (PS) to richer but costlier indifference adjustments (IA).\n  We study cost-aware optimization under an unknown scalarization and introduce QUIVER (Query-Informed Value Estimation for Regret),","authors_text":"Florian A. D. Burnat","cross_cats":["cs.NE","math.OC"],"headline":"QUIVER adaptively chooses between objective evaluations and two types of preference queries to maximize expected decision quality gain per unit cost, reaching 25% lower final utility regret than fixed strategies on hard benchmarks.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-05T20:02:35Z","title":"QUIVER: Cost-Aware Adaptive Preference Querying in Surrogate-Assisted Evolutionary Multi-Objective Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.04267","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T18:26:24.602562Z","id":"0b567d9d-0cbb-4745-b951-8b2d1e40a255","model_set":{"reader":"grok-4.3"},"one_line_summary":"QUIVER adaptively balances cheap pairwise preference queries and costly indifference adjustments with objective evaluations to achieve lower utility regret than single-modality baselines on WFG benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"QUIVER adaptively chooses between objective evaluations and two types of preference queries to maximize expected decision quality gain per unit cost, reaching 25% lower final utility regret than fixed strategies on hard benchmarks.","strongest_claim":"QUIVER achieves the lowest final utility regret on challenging WFG problems (utility regret of 2.14 on WFG4, 2.82 on WFG9: a 25% improvement over baselines), outperforming all single-modality baselines.","weakest_assumption":"The synthetic decision-maker models used to simulate preference responses and costs accurately represent real human behavior and query costs in the target application domains."}},"verdict_id":"0b567d9d-0cbb-4745-b951-8b2d1e40a255"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2da5c9e28d7701b5adac933759a59227adcadb2452e94108b4593659e7e15bd1","target":"record","created_at":"2026-06-19T16:11:24Z","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":"9d9104f151f74875fd6637a864a303ae3bf95fa83af08e30f246fd798a563b2a","cross_cats_sorted":["cs.NE","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-05T20:02:35Z","title_canon_sha256":"126b99590e010d4c1ebac317cce7bdd126a7281a79142dc6ab77180e6aaee1eb"},"schema_version":"1.0","source":{"id":"2605.04267","kind":"arxiv","version":2}},"canonical_sha256":"86412d7cec47bc0f3953515045917837a90ebfeec9614f49d1d5133e739b94f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86412d7cec47bc0f3953515045917837a90ebfeec9614f49d1d5133e739b94f0","first_computed_at":"2026-06-19T16:11:24.098368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:11:24.098368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Q8i4ZiCBQyqszQV/D8TeBne/XUhae6YhmZfw4T0saBi0/fWvkR/W7Pdz/imhVX2VO42tSwC/eahdTya8y5tBg==","signature_status":"signed_v1","signed_at":"2026-06-19T16:11:24.098786Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.04267","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2da5c9e28d7701b5adac933759a59227adcadb2452e94108b4593659e7e15bd1","sha256:9812787e20690fb508a36e4b20500d7bdb2af87ddee7548b0397b6f43e36aa1b"],"state_sha256":"9063891e50309b2854315c702f43baa1d7b1a9b5e3091d75953a2b140ad284f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k8doaFfbtYH1uSH9k3lwbYSmcpa1C3Ks8igY6TaXCacHBTyjGUx/LhicyDUotOmhpQ3Egj/7HdNs469LEmYlDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T14:14:19.419494Z","bundle_sha256":"e892e8fc4bbf77d4546edc94914c6ddf8e9800e600e1a6be3ec6bb7c7ade79ec"}}