{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:B23TI4NXSHBH6UTEZFOEVH7TEW","short_pith_number":"pith:B23TI4NX","schema_version":"1.0","canonical_sha256":"0eb73471b791c27f5264c95c4a9ff325b8598d6883298851ae3011ce8f68ee5f","source":{"kind":"arxiv","id":"1502.05700","version":2},"attestation_state":"computed","paper":{"title":"Scalable Bayesian Optimization Using Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Jasper Snoek, Kevin Swersky, Md. Mostofa Ali Patwary, Nadathur Satish, Narayanan Sundaram, Oren Rippel, Prabhat, Ryan Kiros, Ryan P. Adams","submitted_at":"2015-02-19T20:51:27Z","abstract_excerpt":"Bayesian optimization is an effective methodology for the global optimization of functions with expensive evaluations. It relies on querying a distribution over functions defined by a relatively cheap surrogate model. An accurate model for this distribution over functions is critical to the effectiveness of the approach, and is typically fit using Gaussian processes (GPs). However, since GPs scale cubically with the number of observations, it has been challenging to handle objectives whose optimization requires many evaluations, and as such, massively parallelizing the optimization.\n  In this "},"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":"1502.05700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-19T20:51:27Z","cross_cats_sorted":[],"title_canon_sha256":"d2b04b4b98f19ecc7b77f4d30aa8f1cc3ebedc10ef25afdc807f2521c1728d8a","abstract_canon_sha256":"ec27c443a2b001196a096931285979ff3384fa5146e78212108ae48a13ce3c7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:01.746453Z","signature_b64":"s+VwW52FSL4c/n+tMhOUCmeDL3diT42DO5lzlZTOBkQO/J5tW8EPHp7SNRBFP8kS4ruLKSsQPnD4vTqSrmcIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eb73471b791c27f5264c95c4a9ff325b8598d6883298851ae3011ce8f68ee5f","last_reissued_at":"2026-05-18T01:37:01.746015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:01.746015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Bayesian Optimization Using Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Jasper Snoek, Kevin Swersky, Md. Mostofa Ali Patwary, Nadathur Satish, Narayanan Sundaram, Oren Rippel, Prabhat, Ryan Kiros, Ryan P. Adams","submitted_at":"2015-02-19T20:51:27Z","abstract_excerpt":"Bayesian optimization is an effective methodology for the global optimization of functions with expensive evaluations. It relies on querying a distribution over functions defined by a relatively cheap surrogate model. An accurate model for this distribution over functions is critical to the effectiveness of the approach, and is typically fit using Gaussian processes (GPs). However, since GPs scale cubically with the number of observations, it has been challenging to handle objectives whose optimization requires many evaluations, and as such, massively parallelizing the optimization.\n  In this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05700","kind":"arxiv","version":2},"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":"1502.05700","created_at":"2026-05-18T01:37:01.746085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05700v2","created_at":"2026-05-18T01:37:01.746085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05700","created_at":"2026-05-18T01:37:01.746085+00:00"},{"alias_kind":"pith_short_12","alias_value":"B23TI4NXSHBH","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B23TI4NXSHBH6UTE","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B23TI4NX","created_at":"2026-05-18T12:29:14.074870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.02345","citing_title":"Low Rank Based Subspace Inference for the Laplace Approximation of Bayesian Neural Networks","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2605.07565","citing_title":"Ensemble Distributionally Robust Bayesian Optimisation","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B23TI4NXSHBH6UTEZFOEVH7TEW","json":"https://pith.science/pith/B23TI4NXSHBH6UTEZFOEVH7TEW.json","graph_json":"https://pith.science/api/pith-number/B23TI4NXSHBH6UTEZFOEVH7TEW/graph.json","events_json":"https://pith.science/api/pith-number/B23TI4NXSHBH6UTEZFOEVH7TEW/events.json","paper":"https://pith.science/paper/B23TI4NX"},"agent_actions":{"view_html":"https://pith.science/pith/B23TI4NXSHBH6UTEZFOEVH7TEW","download_json":"https://pith.science/pith/B23TI4NXSHBH6UTEZFOEVH7TEW.json","view_paper":"https://pith.science/paper/B23TI4NX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05700&json=true","fetch_graph":"https://pith.science/api/pith-number/B23TI4NXSHBH6UTEZFOEVH7TEW/graph.json","fetch_events":"https://pith.science/api/pith-number/B23TI4NXSHBH6UTEZFOEVH7TEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B23TI4NXSHBH6UTEZFOEVH7TEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B23TI4NXSHBH6UTEZFOEVH7TEW/action/storage_attestation","attest_author":"https://pith.science/pith/B23TI4NXSHBH6UTEZFOEVH7TEW/action/author_attestation","sign_citation":"https://pith.science/pith/B23TI4NXSHBH6UTEZFOEVH7TEW/action/citation_signature","submit_replication":"https://pith.science/pith/B23TI4NXSHBH6UTEZFOEVH7TEW/action/replication_record"}},"created_at":"2026-05-18T01:37:01.746085+00:00","updated_at":"2026-05-18T01:37:01.746085+00:00"}