{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QO3PFRC6N3SMBBIUBICXCFCJEA","short_pith_number":"pith:QO3PFRC6","schema_version":"1.0","canonical_sha256":"83b6f2c45e6ee4c085140a05711449201b04654428b8e33ef8f4d8ea840866e4","source":{"kind":"arxiv","id":"2406.03722","version":1},"attestation_state":"computed","paper":{"title":"Offline Multi-Objective Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.LG","authors_text":"Chao Qian, Ke Xue, Rong-Xi Tan, Xiaobin Huang","submitted_at":"2024-06-06T03:35:09Z","abstract_excerpt":"Offline optimization aims to maximize a black-box objective function with a static dataset and has wide applications. In addition to the objective function being black-box and expensive to evaluate, numerous complex real-world problems entail optimizing multiple conflicting objectives, i.e., multi-objective optimization (MOO). Nevertheless, offline MOO has not progressed as much as offline single-objective optimization (SOO), mainly due to the lack of benchmarks like Design-Bench for SOO. To bridge this gap, we propose a first benchmark for offline MOO, covering a range of problems from synthe"},"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":"2406.03722","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-06T03:35:09Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"d6725d10bd3e1a76910cd4a16cf811ecd0e1c5f6033eaa4bde5e9736d9f4c4b1","abstract_canon_sha256":"3c6ae8803e24a57da435b98a722869d361c95a4b648907b4dbdad1945ab6d813"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:15.279442Z","signature_b64":"qToGk7Vu3+Y6pld3ewxwYpnxTJqgtjE4hOZwng4eI2RSkkLbHDGz44esLpKFIdxmvwlx+DdNqN5GBiVvy5lgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83b6f2c45e6ee4c085140a05711449201b04654428b8e33ef8f4d8ea840866e4","last_reissued_at":"2026-07-05T08:28:15.278992Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:15.278992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Offline Multi-Objective Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.LG","authors_text":"Chao Qian, Ke Xue, Rong-Xi Tan, Xiaobin Huang","submitted_at":"2024-06-06T03:35:09Z","abstract_excerpt":"Offline optimization aims to maximize a black-box objective function with a static dataset and has wide applications. In addition to the objective function being black-box and expensive to evaluate, numerous complex real-world problems entail optimizing multiple conflicting objectives, i.e., multi-objective optimization (MOO). Nevertheless, offline MOO has not progressed as much as offline single-objective optimization (SOO), mainly due to the lack of benchmarks like Design-Bench for SOO. To bridge this gap, we propose a first benchmark for offline MOO, covering a range of problems from synthe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.03722","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.03722/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":"2406.03722","created_at":"2026-07-05T08:28:15.279051+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.03722v1","created_at":"2026-07-05T08:28:15.279051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.03722","created_at":"2026-07-05T08:28:15.279051+00:00"},{"alias_kind":"pith_short_12","alias_value":"QO3PFRC6N3SM","created_at":"2026-07-05T08:28:15.279051+00:00"},{"alias_kind":"pith_short_16","alias_value":"QO3PFRC6N3SMBBIU","created_at":"2026-07-05T08:28:15.279051+00:00"},{"alias_kind":"pith_short_8","alias_value":"QO3PFRC6","created_at":"2026-07-05T08:28:15.279051+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04468","citing_title":"ParetoPilot: Zero-Surrogate Offline Multi-Objective Optimization via Infer-Perturb-Guide Diffusion","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QO3PFRC6N3SMBBIUBICXCFCJEA","json":"https://pith.science/pith/QO3PFRC6N3SMBBIUBICXCFCJEA.json","graph_json":"https://pith.science/api/pith-number/QO3PFRC6N3SMBBIUBICXCFCJEA/graph.json","events_json":"https://pith.science/api/pith-number/QO3PFRC6N3SMBBIUBICXCFCJEA/events.json","paper":"https://pith.science/paper/QO3PFRC6"},"agent_actions":{"view_html":"https://pith.science/pith/QO3PFRC6N3SMBBIUBICXCFCJEA","download_json":"https://pith.science/pith/QO3PFRC6N3SMBBIUBICXCFCJEA.json","view_paper":"https://pith.science/paper/QO3PFRC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.03722&json=true","fetch_graph":"https://pith.science/api/pith-number/QO3PFRC6N3SMBBIUBICXCFCJEA/graph.json","fetch_events":"https://pith.science/api/pith-number/QO3PFRC6N3SMBBIUBICXCFCJEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QO3PFRC6N3SMBBIUBICXCFCJEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QO3PFRC6N3SMBBIUBICXCFCJEA/action/storage_attestation","attest_author":"https://pith.science/pith/QO3PFRC6N3SMBBIUBICXCFCJEA/action/author_attestation","sign_citation":"https://pith.science/pith/QO3PFRC6N3SMBBIUBICXCFCJEA/action/citation_signature","submit_replication":"https://pith.science/pith/QO3PFRC6N3SMBBIUBICXCFCJEA/action/replication_record"}},"created_at":"2026-07-05T08:28:15.279051+00:00","updated_at":"2026-07-05T08:28:15.279051+00:00"}