{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OEU5HZ3BYR3FFP4XFAPNESTVZU","short_pith_number":"pith:OEU5HZ3B","canonical_record":{"source":{"id":"1908.07980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-21T16:43:54Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5c030feb99e3cfb2705945a76af0bfc8fd6bf82ca8fd60ab5198edd29622109b","abstract_canon_sha256":"7664eeb9796deab0c6da1f9f92bd82b5a67cb3fa28d2ec43019c17aa8e02a3ca"},"schema_version":"1.0"},"canonical_sha256":"7129d3e761c47652bf97281ed24a75cd3f9c8051c0b6d78aa8420381e3850599","source":{"kind":"arxiv","id":"1908.07980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07980","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07980v1","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07980","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"OEU5HZ3BYR3F","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"pith_short_16","alias_value":"OEU5HZ3BYR3FFP4X","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"pith_short_8","alias_value":"OEU5HZ3B","created_at":"2026-07-04T23:59:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OEU5HZ3BYR3FFP4XFAPNESTVZU","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-21T16:43:54Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5c030feb99e3cfb2705945a76af0bfc8fd6bf82ca8fd60ab5198edd29622109b","abstract_canon_sha256":"7664eeb9796deab0c6da1f9f92bd82b5a67cb3fa28d2ec43019c17aa8e02a3ca"},"schema_version":"1.0"},"canonical_sha256":"7129d3e761c47652bf97281ed24a75cd3f9c8051c0b6d78aa8420381e3850599","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:02.984000Z","signature_b64":"qy7Dd6q66sTPnlSgNewWTBqGyO+4DULVM6HG4c3l1W6/j5V15+RK61iKHJU0qqiGpAGvJ+clmk6Q2K5dRKlAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7129d3e761c47652bf97281ed24a75cd3f9c8051c0b6d78aa8420381e3850599","last_reissued_at":"2026-07-04T23:59:02.983666Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:02.983666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07980","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-07-04T23:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nnD0msjd8VzeZMUp+fQ20ZJgcDBniXsQHotE8m+FQ6R4vSarkVXaXLEUtBKFNAmIXWqNoqjeiA4CSFBPy6WpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:29:52.254291Z"},"content_sha256":"83bbe2bcc830973ce667c4eafad13e6c9f4cbf5a52099e3dd3404263b5f17aa7","schema_version":"1.0","event_id":"sha256:83bbe2bcc830973ce667c4eafad13e6c9f4cbf5a52099e3dd3404263b5f17aa7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OEU5HZ3BYR3FFP4XFAPNESTVZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A tree-based radial basis function method for noisy parallel surrogate optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Chenchao Shou, Matthew West","submitted_at":"2019-08-21T16:43:54Z","abstract_excerpt":"Parallel surrogate optimization algorithms have proven to be efficient methods for solving expensive noisy optimization problems. In this work we develop a new parallel surrogate optimization algorithm (ProSRS), using a novel tree-based \"zoom strategy\" to improve the efficiency of the algorithm. We prove that if ProSRS is run for sufficiently long, with probability converging to one there will be at least one point among all the evaluations that will be arbitrarily close to the global minimum. We compare our algorithm to several state-of-the-art Bayesian optimization algorithms on a suite of s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07980","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/1908.07980/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"},"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-07-04T23:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yMuneKAGf+qd5b7quTxz6hl8uBQOCwF6nJzBLBjRPB86+K3iJa12vZ7Yjo/T55wvNr/8TW0S2e4ghE7JY8e5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:29:52.255123Z"},"content_sha256":"e6641292693d03b7d30a9176defe7fec71c41b575fe4aaf9c00def6a3f647857","schema_version":"1.0","event_id":"sha256:e6641292693d03b7d30a9176defe7fec71c41b575fe4aaf9c00def6a3f647857"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OEU5HZ3BYR3FFP4XFAPNESTVZU/bundle.json","state_url":"https://pith.science/pith/OEU5HZ3BYR3FFP4XFAPNESTVZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OEU5HZ3BYR3FFP4XFAPNESTVZU/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-08-16T10:29:52Z","links":{"resolver":"https://pith.science/pith/OEU5HZ3BYR3FFP4XFAPNESTVZU","bundle":"https://pith.science/pith/OEU5HZ3BYR3FFP4XFAPNESTVZU/bundle.json","state":"https://pith.science/pith/OEU5HZ3BYR3FFP4XFAPNESTVZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OEU5HZ3BYR3FFP4XFAPNESTVZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OEU5HZ3BYR3FFP4XFAPNESTVZU","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":"7664eeb9796deab0c6da1f9f92bd82b5a67cb3fa28d2ec43019c17aa8e02a3ca","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-21T16:43:54Z","title_canon_sha256":"5c030feb99e3cfb2705945a76af0bfc8fd6bf82ca8fd60ab5198edd29622109b"},"schema_version":"1.0","source":{"id":"1908.07980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07980","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07980v1","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07980","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"OEU5HZ3BYR3F","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"pith_short_16","alias_value":"OEU5HZ3BYR3FFP4X","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"pith_short_8","alias_value":"OEU5HZ3B","created_at":"2026-07-04T23:59:02Z"}],"graph_snapshots":[{"event_id":"sha256:e6641292693d03b7d30a9176defe7fec71c41b575fe4aaf9c00def6a3f647857","target":"graph","created_at":"2026-07-04T23:59:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.07980/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Parallel surrogate optimization algorithms have proven to be efficient methods for solving expensive noisy optimization problems. In this work we develop a new parallel surrogate optimization algorithm (ProSRS), using a novel tree-based \"zoom strategy\" to improve the efficiency of the algorithm. We prove that if ProSRS is run for sufficiently long, with probability converging to one there will be at least one point among all the evaluations that will be arbitrarily close to the global minimum. We compare our algorithm to several state-of-the-art Bayesian optimization algorithms on a suite of s","authors_text":"Chenchao Shou, Matthew West","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-21T16:43:54Z","title":"A tree-based radial basis function method for noisy parallel surrogate optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07980","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:83bbe2bcc830973ce667c4eafad13e6c9f4cbf5a52099e3dd3404263b5f17aa7","target":"record","created_at":"2026-07-04T23:59:02Z","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":"7664eeb9796deab0c6da1f9f92bd82b5a67cb3fa28d2ec43019c17aa8e02a3ca","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-21T16:43:54Z","title_canon_sha256":"5c030feb99e3cfb2705945a76af0bfc8fd6bf82ca8fd60ab5198edd29622109b"},"schema_version":"1.0","source":{"id":"1908.07980","kind":"arxiv","version":1}},"canonical_sha256":"7129d3e761c47652bf97281ed24a75cd3f9c8051c0b6d78aa8420381e3850599","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7129d3e761c47652bf97281ed24a75cd3f9c8051c0b6d78aa8420381e3850599","first_computed_at":"2026-07-04T23:59:02.983666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:02.983666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qy7Dd6q66sTPnlSgNewWTBqGyO+4DULVM6HG4c3l1W6/j5V15+RK61iKHJU0qqiGpAGvJ+clmk6Q2K5dRKlAAA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:02.984000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83bbe2bcc830973ce667c4eafad13e6c9f4cbf5a52099e3dd3404263b5f17aa7","sha256:e6641292693d03b7d30a9176defe7fec71c41b575fe4aaf9c00def6a3f647857"],"state_sha256":"83a22e5bb8232f684fb1849eef6217a14a97be5e938c00559174b0e0624e56ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iO2xD1CYGJi/g34OzUewbbo02RjPyszA9oLu+AqU02YmP37JyZXG/AVZKG/IKQY/87DqV2LjAO4xdEQ+upZKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T10:29:52.268170Z","bundle_sha256":"6ca766438fa5936be27c6add6b9326da27b3173821f93a6bf45d0f0bcfc34d64"}}