{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7IDH2FVNFZ7JUDJSNV2MVLI2IN","short_pith_number":"pith:7IDH2FVN","schema_version":"1.0","canonical_sha256":"fa067d16ad2e7e9a0d326d74caad1a436e21258d35d60b6b261db7693af6ed61","source":{"kind":"arxiv","id":"2006.04655","version":2},"attestation_state":"computed","paper":{"title":"Random Hypervolume Scalarizations for Provable Multi-Objective Black Box Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Golovin, Qiuyi Zhang","submitted_at":"2020-06-08T15:00:30Z","abstract_excerpt":"Single-objective black box optimization (also known as zeroth-order optimization) is the process of minimizing a scalar objective $f(x)$, given evaluations at adaptively chosen inputs $x$. In this paper, we consider multi-objective optimization, where $f(x)$ outputs a vector of possibly competing objectives and the goal is to converge to the Pareto frontier. Quantitatively, we wish to maximize the standard hypervolume indicator metric, which measures the dominated hypervolume of the entire set of chosen inputs. In this paper, we introduce a novel scalarization function, which we term the hyper"},"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":"2006.04655","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-08T15:00:30Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"827b6960cb24d5208cf49bf5967e3b75a20c058e88e92c6c9ac5b765d5fa2a34","abstract_canon_sha256":"f21736e9a4ee3da24eb99114e1d9f5512e8c150cf00944213424574934f350b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:08.132630Z","signature_b64":"/p3/3/Zs+e83REm8ScqMVTmQXCnT6sUAp1Zcd4pUvMXtS2rIy/CGCYfX1PDqmQ+V7hcj/SJPVqYA7k3siHBjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa067d16ad2e7e9a0d326d74caad1a436e21258d35d60b6b261db7693af6ed61","last_reissued_at":"2026-07-05T01:09:08.132150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:08.132150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Hypervolume Scalarizations for Provable Multi-Objective Black Box Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Golovin, Qiuyi Zhang","submitted_at":"2020-06-08T15:00:30Z","abstract_excerpt":"Single-objective black box optimization (also known as zeroth-order optimization) is the process of minimizing a scalar objective $f(x)$, given evaluations at adaptively chosen inputs $x$. In this paper, we consider multi-objective optimization, where $f(x)$ outputs a vector of possibly competing objectives and the goal is to converge to the Pareto frontier. Quantitatively, we wish to maximize the standard hypervolume indicator metric, which measures the dominated hypervolume of the entire set of chosen inputs. In this paper, we introduce a novel scalarization function, which we term the hyper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.04655","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.04655/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2006.04655","created_at":"2026-07-05T01:09:08.132207+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.04655v2","created_at":"2026-07-05T01:09:08.132207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.04655","created_at":"2026-07-05T01:09:08.132207+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IDH2FVNFZ7J","created_at":"2026-07-05T01:09:08.132207+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IDH2FVNFZ7JUDJS","created_at":"2026-07-05T01:09:08.132207+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IDH2FVN","created_at":"2026-07-05T01:09:08.132207+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.21397","citing_title":"Enabling Pareto-Stationarity Exploration in Multi-Objective Reinforcement Learning: A Multi-Objective Weighted-Chebyshev Actor-Critic Approach","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7IDH2FVNFZ7JUDJSNV2MVLI2IN","json":"https://pith.science/pith/7IDH2FVNFZ7JUDJSNV2MVLI2IN.json","graph_json":"https://pith.science/api/pith-number/7IDH2FVNFZ7JUDJSNV2MVLI2IN/graph.json","events_json":"https://pith.science/api/pith-number/7IDH2FVNFZ7JUDJSNV2MVLI2IN/events.json","paper":"https://pith.science/paper/7IDH2FVN"},"agent_actions":{"view_html":"https://pith.science/pith/7IDH2FVNFZ7JUDJSNV2MVLI2IN","download_json":"https://pith.science/pith/7IDH2FVNFZ7JUDJSNV2MVLI2IN.json","view_paper":"https://pith.science/paper/7IDH2FVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.04655&json=true","fetch_graph":"https://pith.science/api/pith-number/7IDH2FVNFZ7JUDJSNV2MVLI2IN/graph.json","fetch_events":"https://pith.science/api/pith-number/7IDH2FVNFZ7JUDJSNV2MVLI2IN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IDH2FVNFZ7JUDJSNV2MVLI2IN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IDH2FVNFZ7JUDJSNV2MVLI2IN/action/storage_attestation","attest_author":"https://pith.science/pith/7IDH2FVNFZ7JUDJSNV2MVLI2IN/action/author_attestation","sign_citation":"https://pith.science/pith/7IDH2FVNFZ7JUDJSNV2MVLI2IN/action/citation_signature","submit_replication":"https://pith.science/pith/7IDH2FVNFZ7JUDJSNV2MVLI2IN/action/replication_record"}},"created_at":"2026-07-05T01:09:08.132207+00:00","updated_at":"2026-07-05T01:09:08.132207+00:00"}