{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D3SEY36LCPZNWSWO3RB7GL47FS","short_pith_number":"pith:D3SEY36L","schema_version":"1.0","canonical_sha256":"1ee44c6fcb13f2db4acedc43f32f9f2cb79633da080985866761f4ea232d9618","source":{"kind":"arxiv","id":"1410.6271","version":1},"attestation_state":"computed","paper":{"title":"A General Stochastic Algorithmic Framework for Minimizing Expensive Black Box Objective Functions Based on Surrogate Models and Sensitivity Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Christine A. Shoemaker, Yilun Wang","submitted_at":"2014-10-23T07:42:18Z","abstract_excerpt":"We are focusing on bound constrained global optimization problems, whose objective functions are computationally expensive black-box functions and have multiple local minima. The recently popular Metric Stochastic Response Surface (MSRS) algorithm proposed by \\cite{Regis2007SRBF} based on adaptive or sequential learning based on response surfaces is revisited and further extended for better performance in case of higher dimensional problems. Specifically, we propose a new way to generate the candidate points which the next function evaluation point is picked from according to the metric criter"},"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":"1410.6271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-23T07:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"f6ccc848b56f105b74a184c7420614c8cb2aff62f4c56949252904cd2ff80482","abstract_canon_sha256":"be4330e7d2b8cca3d7ddc1b8528d85324c44e6da95bbb879f45a0bfd837cf7c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:31.234445Z","signature_b64":"lZ4gCZnXSCX2uM4453SR5AqFQtxPFd/VHmHDsGqoStCfRTgpeY8kth2oVnMqcmYjKmVLkK+yB5964edD0mIrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ee44c6fcb13f2db4acedc43f32f9f2cb79633da080985866761f4ea232d9618","last_reissued_at":"2026-05-18T02:39:31.233731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:31.233731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Stochastic Algorithmic Framework for Minimizing Expensive Black Box Objective Functions Based on Surrogate Models and Sensitivity Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Christine A. Shoemaker, Yilun Wang","submitted_at":"2014-10-23T07:42:18Z","abstract_excerpt":"We are focusing on bound constrained global optimization problems, whose objective functions are computationally expensive black-box functions and have multiple local minima. The recently popular Metric Stochastic Response Surface (MSRS) algorithm proposed by \\cite{Regis2007SRBF} based on adaptive or sequential learning based on response surfaces is revisited and further extended for better performance in case of higher dimensional problems. Specifically, we propose a new way to generate the candidate points which the next function evaluation point is picked from according to the metric criter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6271","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":"1410.6271","created_at":"2026-05-18T02:39:31.233845+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6271v1","created_at":"2026-05-18T02:39:31.233845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6271","created_at":"2026-05-18T02:39:31.233845+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3SEY36LCPZN","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3SEY36LCPZNWSWO","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3SEY36L","created_at":"2026-05-18T12:28:25.294606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.09943","citing_title":"Vestibular reservoir computing","ref_index":112,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D3SEY36LCPZNWSWO3RB7GL47FS","json":"https://pith.science/pith/D3SEY36LCPZNWSWO3RB7GL47FS.json","graph_json":"https://pith.science/api/pith-number/D3SEY36LCPZNWSWO3RB7GL47FS/graph.json","events_json":"https://pith.science/api/pith-number/D3SEY36LCPZNWSWO3RB7GL47FS/events.json","paper":"https://pith.science/paper/D3SEY36L"},"agent_actions":{"view_html":"https://pith.science/pith/D3SEY36LCPZNWSWO3RB7GL47FS","download_json":"https://pith.science/pith/D3SEY36LCPZNWSWO3RB7GL47FS.json","view_paper":"https://pith.science/paper/D3SEY36L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6271&json=true","fetch_graph":"https://pith.science/api/pith-number/D3SEY36LCPZNWSWO3RB7GL47FS/graph.json","fetch_events":"https://pith.science/api/pith-number/D3SEY36LCPZNWSWO3RB7GL47FS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3SEY36LCPZNWSWO3RB7GL47FS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3SEY36LCPZNWSWO3RB7GL47FS/action/storage_attestation","attest_author":"https://pith.science/pith/D3SEY36LCPZNWSWO3RB7GL47FS/action/author_attestation","sign_citation":"https://pith.science/pith/D3SEY36LCPZNWSWO3RB7GL47FS/action/citation_signature","submit_replication":"https://pith.science/pith/D3SEY36LCPZNWSWO3RB7GL47FS/action/replication_record"}},"created_at":"2026-05-18T02:39:31.233845+00:00","updated_at":"2026-05-18T02:39:31.233845+00:00"}