{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L2OAPOEY2B55KRAT4XHUFEERVV","short_pith_number":"pith:L2OAPOEY","canonical_record":{"source":{"id":"1809.10482","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-27T12:22:04Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"903634399f3a71e7c6e09eb714824986e0cd10baafbda260937f0233b2b30909","abstract_canon_sha256":"a9a7ef0774df513d5bd093ff49cd19219d3f969ea4ec361d4dc1cec76ae63e79"},"schema_version":"1.0"},"canonical_sha256":"5e9c07b898d07bd54413e5cf429091ad5cacf9a268f21b5b71f66a8871929b3d","source":{"kind":"arxiv","id":"1809.10482","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10482","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10482v4","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10482","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"pith_short_12","alias_value":"L2OAPOEY2B55","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L2OAPOEY2B55KRAT","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L2OAPOEY","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L2OAPOEY2B55KRAT4XHUFEERVV","target":"record","payload":{"canonical_record":{"source":{"id":"1809.10482","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-27T12:22:04Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"903634399f3a71e7c6e09eb714824986e0cd10baafbda260937f0233b2b30909","abstract_canon_sha256":"a9a7ef0774df513d5bd093ff49cd19219d3f969ea4ec361d4dc1cec76ae63e79"},"schema_version":"1.0"},"canonical_sha256":"5e9c07b898d07bd54413e5cf429091ad5cacf9a268f21b5b71f66a8871929b3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:41.516080Z","signature_b64":"niwsOmdzmYDkRJxK/TZHD38sAiZxNifU9XtNZF7T1uog38BkOWBeHsB+UgK3Xh+QW2L8PoSagLJ7PcinGgeEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e9c07b898d07bd54413e5cf429091ad5cacf9a268f21b5b71f66a8871929b3d","last_reissued_at":"2026-05-17T23:40:41.515451Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:41.515451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.10482","source_version":4,"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-17T23:40:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ldeOieVYTAccnPCQ5ViOt1zThxtXmQ1nNr1PPt3J+/VkwFVnGsjk9QHPrEj3Rkb8ArNu7492wUgE+QTeVhRXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:48:04.617390Z"},"content_sha256":"7555f0510107f85bf859998ff1922210d36bb02c041955aef6ad8ede26a2b65f","schema_version":"1.0","event_id":"sha256:7555f0510107f85bf859998ff1922210d36bb02c041955aef6ad8ede26a2b65f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L2OAPOEY2B55KRAT4XHUFEERVV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Budgeted Multi-Objective Optimization with a Focus on the Central Part of the Pareto Front -- Extended Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Benoit Enaux, David Gaudrie, Rodolphe Le Riche, Victor Picheny, Vincent Herbert","submitted_at":"2018-09-27T12:22:04Z","abstract_excerpt":"Optimizing nonlinear systems involving expensive computer experiments with regard to conflicting objectives is a common challenge. When the number of experiments is severely restricted and/or when the number of objectives increases, uncovering the whole set of Pareto optimal solutions is out of reach, even for surrogate-based approaches: the proposed solutions are sub-optimal or do not cover the front well. As non-compromising optimal solutions have usually little point in applications, this work restricts the search to solutions that are close to the Pareto front center. The article starts by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10482","kind":"arxiv","version":4},"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-17T23:40:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"558WNApfIkNy65QHa0GqxZJX186s8vQ7eNu7JMzNmvikoQ3bKEYQwdEXULpXkuTVQ4PHPYFltuI6CPhbDo8xCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:48:04.617751Z"},"content_sha256":"bd41a3ec0d8d75f2f0514bb0bff3b368f23757c4531ddb92e9c9d578efad4428","schema_version":"1.0","event_id":"sha256:bd41a3ec0d8d75f2f0514bb0bff3b368f23757c4531ddb92e9c9d578efad4428"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2OAPOEY2B55KRAT4XHUFEERVV/bundle.json","state_url":"https://pith.science/pith/L2OAPOEY2B55KRAT4XHUFEERVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2OAPOEY2B55KRAT4XHUFEERVV/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-06-04T21:48:04Z","links":{"resolver":"https://pith.science/pith/L2OAPOEY2B55KRAT4XHUFEERVV","bundle":"https://pith.science/pith/L2OAPOEY2B55KRAT4XHUFEERVV/bundle.json","state":"https://pith.science/pith/L2OAPOEY2B55KRAT4XHUFEERVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2OAPOEY2B55KRAT4XHUFEERVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L2OAPOEY2B55KRAT4XHUFEERVV","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":"a9a7ef0774df513d5bd093ff49cd19219d3f969ea4ec361d4dc1cec76ae63e79","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-27T12:22:04Z","title_canon_sha256":"903634399f3a71e7c6e09eb714824986e0cd10baafbda260937f0233b2b30909"},"schema_version":"1.0","source":{"id":"1809.10482","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10482","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10482v4","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10482","created_at":"2026-05-17T23:40:41Z"},{"alias_kind":"pith_short_12","alias_value":"L2OAPOEY2B55","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L2OAPOEY2B55KRAT","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L2OAPOEY","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:bd41a3ec0d8d75f2f0514bb0bff3b368f23757c4531ddb92e9c9d578efad4428","target":"graph","created_at":"2026-05-17T23:40: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":"Optimizing nonlinear systems involving expensive computer experiments with regard to conflicting objectives is a common challenge. When the number of experiments is severely restricted and/or when the number of objectives increases, uncovering the whole set of Pareto optimal solutions is out of reach, even for surrogate-based approaches: the proposed solutions are sub-optimal or do not cover the front well. As non-compromising optimal solutions have usually little point in applications, this work restricts the search to solutions that are close to the Pareto front center. The article starts by","authors_text":"Benoit Enaux, David Gaudrie, Rodolphe Le Riche, Victor Picheny, Vincent Herbert","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-27T12:22:04Z","title":"Budgeted Multi-Objective Optimization with a Focus on the Central Part of the Pareto Front -- Extended Version"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10482","kind":"arxiv","version":4},"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:7555f0510107f85bf859998ff1922210d36bb02c041955aef6ad8ede26a2b65f","target":"record","created_at":"2026-05-17T23:40: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":"a9a7ef0774df513d5bd093ff49cd19219d3f969ea4ec361d4dc1cec76ae63e79","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-27T12:22:04Z","title_canon_sha256":"903634399f3a71e7c6e09eb714824986e0cd10baafbda260937f0233b2b30909"},"schema_version":"1.0","source":{"id":"1809.10482","kind":"arxiv","version":4}},"canonical_sha256":"5e9c07b898d07bd54413e5cf429091ad5cacf9a268f21b5b71f66a8871929b3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e9c07b898d07bd54413e5cf429091ad5cacf9a268f21b5b71f66a8871929b3d","first_computed_at":"2026-05-17T23:40:41.515451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:41.515451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"niwsOmdzmYDkRJxK/TZHD38sAiZxNifU9XtNZF7T1uog38BkOWBeHsB+UgK3Xh+QW2L8PoSagLJ7PcinGgeEAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:41.516080Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10482","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7555f0510107f85bf859998ff1922210d36bb02c041955aef6ad8ede26a2b65f","sha256:bd41a3ec0d8d75f2f0514bb0bff3b368f23757c4531ddb92e9c9d578efad4428"],"state_sha256":"0a0ebe44f90a9fc90b97e1a7096e35ce00cd56d722243494414637ddfc52163e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYJW627bBtKQyIMw9GXANsGzNfVouXxOtKIYNN/vMGbhhon9nzmN1Qw9KmOZSxyR8+I5ZGKC6VId+lf6fLolCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:48:04.619675Z","bundle_sha256":"c98017040db2fbb716e167637831008bf47a56097aac0450265f98da13f340bb"}}