{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NV3VLJEIO66WDNOVAIHWBGJMPL","short_pith_number":"pith:NV3VLJEI","schema_version":"1.0","canonical_sha256":"6d7755a48877bd61b5d5020f60992c7af00274aa950a455867e8a681dbf621eb","source":{"kind":"arxiv","id":"1612.00393","version":1},"attestation_state":"computed","paper":{"title":"Hypervolume-based Multi-objective Bayesian Optimization with Student-t Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ivo Couckuyt, Joachim van der Herten, Tom Dhaene","submitted_at":"2016-12-01T19:41:50Z","abstract_excerpt":"Student-$t$ processes have recently been proposed as an appealing alternative non-parameteric function prior. They feature enhanced flexibility and predictive variance. In this work the use of Student-$t$ processes are explored for multi-objective Bayesian optimization. In particular, an analytical expression for the hypervolume-based probability of improvement is developed for independent Student-$t$ process priors of the objectives. Its effectiveness is shown on a multi-objective optimization problem which is known to be difficult with traditional Gaussian processes."},"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":"1612.00393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-01T19:41:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"aded044701299134087eafeb2db5e9ea117a98be0cd82e7e178d6286673442d9","abstract_canon_sha256":"2dcc7c7861d28925b40da239b0f046fc9310b34f2b8930885c2e6e36208c56d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:05.328586Z","signature_b64":"SVQrcmeCy3PC8dg3eXhIQMT0J0RYuRarv9e1IY4pyZQRCM3KiZ82FiJ0aZjw2dYHRED/7thsa3IyuhafSjefAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d7755a48877bd61b5d5020f60992c7af00274aa950a455867e8a681dbf621eb","last_reissued_at":"2026-05-18T00:56:05.328102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:05.328102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypervolume-based Multi-objective Bayesian Optimization with Student-t Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ivo Couckuyt, Joachim van der Herten, Tom Dhaene","submitted_at":"2016-12-01T19:41:50Z","abstract_excerpt":"Student-$t$ processes have recently been proposed as an appealing alternative non-parameteric function prior. They feature enhanced flexibility and predictive variance. In this work the use of Student-$t$ processes are explored for multi-objective Bayesian optimization. In particular, an analytical expression for the hypervolume-based probability of improvement is developed for independent Student-$t$ process priors of the objectives. Its effectiveness is shown on a multi-objective optimization problem which is known to be difficult with traditional Gaussian processes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00393","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":""},"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":"1612.00393","created_at":"2026-05-18T00:56:05.328170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00393v1","created_at":"2026-05-18T00:56:05.328170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00393","created_at":"2026-05-18T00:56:05.328170+00:00"},{"alias_kind":"pith_short_12","alias_value":"NV3VLJEIO66W","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"NV3VLJEIO66WDNOV","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"NV3VLJEI","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.07306","citing_title":"Gearing Gaussian process modeling and sequential design towards stochastic simulators","ref_index":2009,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NV3VLJEIO66WDNOVAIHWBGJMPL","json":"https://pith.science/pith/NV3VLJEIO66WDNOVAIHWBGJMPL.json","graph_json":"https://pith.science/api/pith-number/NV3VLJEIO66WDNOVAIHWBGJMPL/graph.json","events_json":"https://pith.science/api/pith-number/NV3VLJEIO66WDNOVAIHWBGJMPL/events.json","paper":"https://pith.science/paper/NV3VLJEI"},"agent_actions":{"view_html":"https://pith.science/pith/NV3VLJEIO66WDNOVAIHWBGJMPL","download_json":"https://pith.science/pith/NV3VLJEIO66WDNOVAIHWBGJMPL.json","view_paper":"https://pith.science/paper/NV3VLJEI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00393&json=true","fetch_graph":"https://pith.science/api/pith-number/NV3VLJEIO66WDNOVAIHWBGJMPL/graph.json","fetch_events":"https://pith.science/api/pith-number/NV3VLJEIO66WDNOVAIHWBGJMPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NV3VLJEIO66WDNOVAIHWBGJMPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NV3VLJEIO66WDNOVAIHWBGJMPL/action/storage_attestation","attest_author":"https://pith.science/pith/NV3VLJEIO66WDNOVAIHWBGJMPL/action/author_attestation","sign_citation":"https://pith.science/pith/NV3VLJEIO66WDNOVAIHWBGJMPL/action/citation_signature","submit_replication":"https://pith.science/pith/NV3VLJEIO66WDNOVAIHWBGJMPL/action/replication_record"}},"created_at":"2026-05-18T00:56:05.328170+00:00","updated_at":"2026-05-18T00:56:05.328170+00:00"}