{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SHQT277G74WE3RFGXX7Y7Q4NWV","short_pith_number":"pith:SHQT277G","canonical_record":{"source":{"id":"1810.10482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-24T16:38:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9383bb941434e0efd4d87c66ad1d423fc43e377da4840a3d69ead6aebe49859e","abstract_canon_sha256":"b4f338b38f25e519cb207d9f4a136fadea394bfbc6d3ad20e7407de70299d181"},"schema_version":"1.0"},"canonical_sha256":"91e13d7fe6ff2c4dc4a6bdff8fc38db5647513962b93b1cd2c06941fc50b9bc0","source":{"kind":"arxiv","id":"1810.10482","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10482","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10482v1","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10482","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"pith_short_12","alias_value":"SHQT277G74WE","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SHQT277G74WE3RFG","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SHQT277G","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SHQT277G74WE3RFGXX7Y7Q4NWV","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-24T16:38:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9383bb941434e0efd4d87c66ad1d423fc43e377da4840a3d69ead6aebe49859e","abstract_canon_sha256":"b4f338b38f25e519cb207d9f4a136fadea394bfbc6d3ad20e7407de70299d181"},"schema_version":"1.0"},"canonical_sha256":"91e13d7fe6ff2c4dc4a6bdff8fc38db5647513962b93b1cd2c06941fc50b9bc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:22.955251Z","signature_b64":"Irh+EKxv0rRIB2u2J3heZj1rSswLyRkNNFNev3EBXRBvz3ayr2eZby8Q4LqYhW4abQX9YR4Tg+GyzVYf0utEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91e13d7fe6ff2c4dc4a6bdff8fc38db5647513962b93b1cd2c06941fc50b9bc0","last_reissued_at":"2026-05-18T00:02:22.954686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:22.954686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10482","source_version":1,"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:02:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N0uETr72Wcnrjk9D+SHypfPsXvhvc1uNAq9ay2vzyKgPVTBr7aDnCDsJ9QWJU69VYUfA6CmI5lqkRoxG+mPXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:44:07.585099Z"},"content_sha256":"ea3569e0d04741361f8065e189bf8894655a45f792e15b05e87e567201eb0eb9","schema_version":"1.0","event_id":"sha256:ea3569e0d04741361f8065e189bf8894655a45f792e15b05e87e567201eb0eb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SHQT277G74WE3RFGXX7Y7Q4NWV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Noisy Blackbox Optimization with Multi-Fidelity Queries: A Tree Search Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kirthevasan Kandasamy, Rajat Sen, Sanjay Shakkottai","submitted_at":"2018-10-24T16:38:07Z","abstract_excerpt":"We study the problem of black-box optimization of a noisy function in the presence of low-cost approximations or fidelities, which is motivated by problems like hyper-parameter tuning. In hyper-parameter tuning evaluating the black-box function at a point involves training a learning algorithm on a large data-set at a particular hyper-parameter and evaluating the validation error. Even a single such evaluation can be prohibitively expensive. Therefore, it is beneficial to use low-cost approximations, like training the learning algorithm on a sub-sampled version of the whole data-set. These low"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10482","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"},"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:02:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1w77y5cfK7fVZS8Vobu2xVMW2I6Uo4oSZCrPgAICb1PZ2KXe8qJGUxiEHGwkDJ0zADDJF3fkaAmtbzKh0apGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:44:07.585807Z"},"content_sha256":"63e7d3b23ccd6f62e6ef348d29332eb9380749d8d035c1e0c5f70e390934c495","schema_version":"1.0","event_id":"sha256:63e7d3b23ccd6f62e6ef348d29332eb9380749d8d035c1e0c5f70e390934c495"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHQT277G74WE3RFGXX7Y7Q4NWV/bundle.json","state_url":"https://pith.science/pith/SHQT277G74WE3RFGXX7Y7Q4NWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHQT277G74WE3RFGXX7Y7Q4NWV/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-07T21:44:07Z","links":{"resolver":"https://pith.science/pith/SHQT277G74WE3RFGXX7Y7Q4NWV","bundle":"https://pith.science/pith/SHQT277G74WE3RFGXX7Y7Q4NWV/bundle.json","state":"https://pith.science/pith/SHQT277G74WE3RFGXX7Y7Q4NWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHQT277G74WE3RFGXX7Y7Q4NWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SHQT277G74WE3RFGXX7Y7Q4NWV","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":"b4f338b38f25e519cb207d9f4a136fadea394bfbc6d3ad20e7407de70299d181","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-24T16:38:07Z","title_canon_sha256":"9383bb941434e0efd4d87c66ad1d423fc43e377da4840a3d69ead6aebe49859e"},"schema_version":"1.0","source":{"id":"1810.10482","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10482","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10482v1","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10482","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"pith_short_12","alias_value":"SHQT277G74WE","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SHQT277G74WE3RFG","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SHQT277G","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:63e7d3b23ccd6f62e6ef348d29332eb9380749d8d035c1e0c5f70e390934c495","target":"graph","created_at":"2026-05-18T00:02:22Z","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":"We study the problem of black-box optimization of a noisy function in the presence of low-cost approximations or fidelities, which is motivated by problems like hyper-parameter tuning. In hyper-parameter tuning evaluating the black-box function at a point involves training a learning algorithm on a large data-set at a particular hyper-parameter and evaluating the validation error. Even a single such evaluation can be prohibitively expensive. Therefore, it is beneficial to use low-cost approximations, like training the learning algorithm on a sub-sampled version of the whole data-set. These low","authors_text":"Kirthevasan Kandasamy, Rajat Sen, Sanjay Shakkottai","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-24T16:38:07Z","title":"Noisy Blackbox Optimization with Multi-Fidelity Queries: A Tree Search Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10482","kind":"arxiv","version":1},"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:ea3569e0d04741361f8065e189bf8894655a45f792e15b05e87e567201eb0eb9","target":"record","created_at":"2026-05-18T00:02:22Z","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":"b4f338b38f25e519cb207d9f4a136fadea394bfbc6d3ad20e7407de70299d181","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-24T16:38:07Z","title_canon_sha256":"9383bb941434e0efd4d87c66ad1d423fc43e377da4840a3d69ead6aebe49859e"},"schema_version":"1.0","source":{"id":"1810.10482","kind":"arxiv","version":1}},"canonical_sha256":"91e13d7fe6ff2c4dc4a6bdff8fc38db5647513962b93b1cd2c06941fc50b9bc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91e13d7fe6ff2c4dc4a6bdff8fc38db5647513962b93b1cd2c06941fc50b9bc0","first_computed_at":"2026-05-18T00:02:22.954686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:22.954686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Irh+EKxv0rRIB2u2J3heZj1rSswLyRkNNFNev3EBXRBvz3ayr2eZby8Q4LqYhW4abQX9YR4Tg+GyzVYf0utEAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:22.955251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10482","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea3569e0d04741361f8065e189bf8894655a45f792e15b05e87e567201eb0eb9","sha256:63e7d3b23ccd6f62e6ef348d29332eb9380749d8d035c1e0c5f70e390934c495"],"state_sha256":"5886bbe44c32d88c5acc01919a7f1fb86f40b2ed7be307b82e096bc5c96e5897"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6CrXNJjz+022E7+IvhGe7rDXw+5G8I2khsXxgdZCgS5z8sXyipMzHNBFjS7oSyKWkmyawzFW9hb8sNzjzsFrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:44:07.589604Z","bundle_sha256":"12b2c6d3412e0369bc1a462f66e683dd1315b84f072e32dbcbf5280935883b05"}}