{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5CL3GG6SKFQXWUGOG3U7NMDJOM","short_pith_number":"pith:5CL3GG6S","schema_version":"1.0","canonical_sha256":"e897b31bd251617b50ce36e9f6b0697328694b7e21d1f7e13a66aa152718f57e","source":{"kind":"arxiv","id":"2502.06789","version":1},"attestation_state":"computed","paper":{"title":"Information-theoretic Bayesian Optimization: Survey and Tutorial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eduardo C. Garrido-Merch\\'an","submitted_at":"2025-01-22T10:54:15Z","abstract_excerpt":"Several scenarios require the optimization of non-convex black-box functions, that are noisy expensive to evaluate functions with unknown analytical expression, whose gradients are hence not accessible. For example, the hyper-parameter tuning problem of machine learning models. Bayesian optimization is a class of methods with state-of-the-art performance delivering a solution to this problem in real scenarios. It uses an iterative process that employs a probabilistic surrogate model, typically a Gaussian process, of the objective function to be optimized computing a posterior predictive distri"},"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":"2502.06789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-22T10:54:15Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"431a93d607181d16d05d63b60d5323920d040bf4b793a62aaf6e324862bedbee","abstract_canon_sha256":"2c45fabd4a06a2b8c13af2ba10c53637cb754f7158f0dcd8cc90103351ea1e84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:12:27.876805Z","signature_b64":"1KNtfNjoKiG2ED3BkHKNZjEWUQ5jYtqd+Ihp5xlSs6/vzeFk1Xdj1vt+7vkLZhSTF1/i9hoNJQBvhe36+iQDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e897b31bd251617b50ce36e9f6b0697328694b7e21d1f7e13a66aa152718f57e","last_reissued_at":"2026-07-05T10:12:27.876312Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:12:27.876312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information-theoretic Bayesian Optimization: Survey and Tutorial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eduardo C. Garrido-Merch\\'an","submitted_at":"2025-01-22T10:54:15Z","abstract_excerpt":"Several scenarios require the optimization of non-convex black-box functions, that are noisy expensive to evaluate functions with unknown analytical expression, whose gradients are hence not accessible. For example, the hyper-parameter tuning problem of machine learning models. Bayesian optimization is a class of methods with state-of-the-art performance delivering a solution to this problem in real scenarios. It uses an iterative process that employs a probabilistic surrogate model, typically a Gaussian process, of the objective function to be optimized computing a posterior predictive distri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06789","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/2502.06789/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":"2502.06789","created_at":"2026-07-05T10:12:27.876380+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.06789v1","created_at":"2026-07-05T10:12:27.876380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06789","created_at":"2026-07-05T10:12:27.876380+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CL3GG6SKFQX","created_at":"2026-07-05T10:12:27.876380+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CL3GG6SKFQXWUGO","created_at":"2026-07-05T10:12:27.876380+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CL3GG6S","created_at":"2026-07-05T10:12:27.876380+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00284","citing_title":"Generative AI for Industrial Contour Detection: A Language-Guided Vision System","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5CL3GG6SKFQXWUGOG3U7NMDJOM","json":"https://pith.science/pith/5CL3GG6SKFQXWUGOG3U7NMDJOM.json","graph_json":"https://pith.science/api/pith-number/5CL3GG6SKFQXWUGOG3U7NMDJOM/graph.json","events_json":"https://pith.science/api/pith-number/5CL3GG6SKFQXWUGOG3U7NMDJOM/events.json","paper":"https://pith.science/paper/5CL3GG6S"},"agent_actions":{"view_html":"https://pith.science/pith/5CL3GG6SKFQXWUGOG3U7NMDJOM","download_json":"https://pith.science/pith/5CL3GG6SKFQXWUGOG3U7NMDJOM.json","view_paper":"https://pith.science/paper/5CL3GG6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.06789&json=true","fetch_graph":"https://pith.science/api/pith-number/5CL3GG6SKFQXWUGOG3U7NMDJOM/graph.json","fetch_events":"https://pith.science/api/pith-number/5CL3GG6SKFQXWUGOG3U7NMDJOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CL3GG6SKFQXWUGOG3U7NMDJOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CL3GG6SKFQXWUGOG3U7NMDJOM/action/storage_attestation","attest_author":"https://pith.science/pith/5CL3GG6SKFQXWUGOG3U7NMDJOM/action/author_attestation","sign_citation":"https://pith.science/pith/5CL3GG6SKFQXWUGOG3U7NMDJOM/action/citation_signature","submit_replication":"https://pith.science/pith/5CL3GG6SKFQXWUGOG3U7NMDJOM/action/replication_record"}},"created_at":"2026-07-05T10:12:27.876380+00:00","updated_at":"2026-07-05T10:12:27.876380+00:00"}