{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3EUT77WS26RVR234BNA3K5QRXA","short_pith_number":"pith:3EUT77WS","canonical_record":{"source":{"id":"1510.00503","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-10-02T06:41:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"13d0227377a22b428a3f99beca83c96e68fca1798c7085b03a0efd5a302a9c9b","abstract_canon_sha256":"3f07e4a770ca7a31cd16430e0d4c41cfec76ebb0e2f0e8e0b376ae9db8cbecfb"},"schema_version":"1.0"},"canonical_sha256":"d9293ffed2d7a358eb7c0b41b57611b82de99441a624e22a40f2d0a9b3904968","source":{"kind":"arxiv","id":"1510.00503","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00503","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00503v3","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00503","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"3EUT77WS26RV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3EUT77WS26RVR234","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3EUT77WS","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3EUT77WS26RVR234BNA3K5QRXA","target":"record","payload":{"canonical_record":{"source":{"id":"1510.00503","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-10-02T06:41:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"13d0227377a22b428a3f99beca83c96e68fca1798c7085b03a0efd5a302a9c9b","abstract_canon_sha256":"3f07e4a770ca7a31cd16430e0d4c41cfec76ebb0e2f0e8e0b376ae9db8cbecfb"},"schema_version":"1.0"},"canonical_sha256":"d9293ffed2d7a358eb7c0b41b57611b82de99441a624e22a40f2d0a9b3904968","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:23.286824Z","signature_b64":"QAGUQq79PLFFAr7TGRJR+1LbV2BXy/R9ZMomZJLWu34AEF6NdjweUWy51bjxYEgWCoewj8fIX1ssp+5u/c4ZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9293ffed2d7a358eb7c0b41b57611b82de99441a624e22a40f2d0a9b3904968","last_reissued_at":"2026-05-18T00:39:23.286180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:23.286180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.00503","source_version":3,"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:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VROcQEGjUw3qsh9DRgwepwiGr8ba1SIPx24Wp+fzMyDlQksqe9nSob0Gh0KAQypEctKNHWi6Xjmrg7V1twJwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:55:27.932666Z"},"content_sha256":"907a9d2ff7715f004b2ce43a538fb9564619c5e45b0d9c43e56811a7ed189c99","schema_version":"1.0","event_id":"sha256:907a9d2ff7715f004b2ce43a538fb9564619c5e45b0d9c43e56811a7ed189c99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3EUT77WS26RVR234BNA3K5QRXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bayesian approach to constrained single- and multi-objective optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Emmanuel Vazquez (L2S, GdR MASCOT-NUM), Julien Bect (L2S, Paul Feliot (L2S","submitted_at":"2015-10-02T06:41:49Z","abstract_excerpt":"This article addresses the problem of derivative-free (single- or multi-objective) optimization subject to multiple inequality constraints. Both the objective and constraint functions are assumed to be smooth, non-linear and expensive to evaluate. As a consequence, the number of evaluations that can be used to carry out the optimization is very limited, as in complex industrial design optimization problems. The method we propose to overcome this difficulty has its roots in both the Bayesian and the multi-objective optimization literatures.  More specifically, an extended domination rule is use"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00503","kind":"arxiv","version":3},"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:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+WgIFBzIAKF8V9TDBmUSD+OTv4fPNRUAQqKpb4rnRgEG2ZojDV7Rz+sEvIMVw/HJ730l+ShHGxCZ06zCM0MGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:55:27.933018Z"},"content_sha256":"14a44251ba3a102d2f0669dbce0725d88483a78778d87f9b026cc670a2a35252","schema_version":"1.0","event_id":"sha256:14a44251ba3a102d2f0669dbce0725d88483a78778d87f9b026cc670a2a35252"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3EUT77WS26RVR234BNA3K5QRXA/bundle.json","state_url":"https://pith.science/pith/3EUT77WS26RVR234BNA3K5QRXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3EUT77WS26RVR234BNA3K5QRXA/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-03T10:55:27Z","links":{"resolver":"https://pith.science/pith/3EUT77WS26RVR234BNA3K5QRXA","bundle":"https://pith.science/pith/3EUT77WS26RVR234BNA3K5QRXA/bundle.json","state":"https://pith.science/pith/3EUT77WS26RVR234BNA3K5QRXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3EUT77WS26RVR234BNA3K5QRXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3EUT77WS26RVR234BNA3K5QRXA","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":"3f07e4a770ca7a31cd16430e0d4c41cfec76ebb0e2f0e8e0b376ae9db8cbecfb","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-10-02T06:41:49Z","title_canon_sha256":"13d0227377a22b428a3f99beca83c96e68fca1798c7085b03a0efd5a302a9c9b"},"schema_version":"1.0","source":{"id":"1510.00503","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00503","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00503v3","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00503","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"3EUT77WS26RV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3EUT77WS26RVR234","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3EUT77WS","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:14a44251ba3a102d2f0669dbce0725d88483a78778d87f9b026cc670a2a35252","target":"graph","created_at":"2026-05-18T00:39:23Z","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":"This article addresses the problem of derivative-free (single- or multi-objective) optimization subject to multiple inequality constraints. Both the objective and constraint functions are assumed to be smooth, non-linear and expensive to evaluate. As a consequence, the number of evaluations that can be used to carry out the optimization is very limited, as in complex industrial design optimization problems. The method we propose to overcome this difficulty has its roots in both the Bayesian and the multi-objective optimization literatures.  More specifically, an extended domination rule is use","authors_text":"Emmanuel Vazquez (L2S, GdR MASCOT-NUM), Julien Bect (L2S, Paul Feliot (L2S","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-10-02T06:41:49Z","title":"A Bayesian approach to constrained single- and multi-objective optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00503","kind":"arxiv","version":3},"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:907a9d2ff7715f004b2ce43a538fb9564619c5e45b0d9c43e56811a7ed189c99","target":"record","created_at":"2026-05-18T00:39:23Z","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":"3f07e4a770ca7a31cd16430e0d4c41cfec76ebb0e2f0e8e0b376ae9db8cbecfb","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-10-02T06:41:49Z","title_canon_sha256":"13d0227377a22b428a3f99beca83c96e68fca1798c7085b03a0efd5a302a9c9b"},"schema_version":"1.0","source":{"id":"1510.00503","kind":"arxiv","version":3}},"canonical_sha256":"d9293ffed2d7a358eb7c0b41b57611b82de99441a624e22a40f2d0a9b3904968","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9293ffed2d7a358eb7c0b41b57611b82de99441a624e22a40f2d0a9b3904968","first_computed_at":"2026-05-18T00:39:23.286180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:23.286180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QAGUQq79PLFFAr7TGRJR+1LbV2BXy/R9ZMomZJLWu34AEF6NdjweUWy51bjxYEgWCoewj8fIX1ssp+5u/c4ZCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:23.286824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.00503","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:907a9d2ff7715f004b2ce43a538fb9564619c5e45b0d9c43e56811a7ed189c99","sha256:14a44251ba3a102d2f0669dbce0725d88483a78778d87f9b026cc670a2a35252"],"state_sha256":"aca0fb7019defe7ce674acac5ac4c169a9baf8d90b0b61af3ae671ae881dd5c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5p0yiW/i3DCeU99nP/UmQafUH37+ASbi9H60Jexizhmmot97EiZrupg0he1S2egqigEtkugFrDWMJkIUxpjEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:55:27.935097Z","bundle_sha256":"8dec26823a4e5cb683a1868ae1329bd62719744a37e1541f46ee70de9d2ec5d1"}}