{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YISNLJ6ZMJRXZBMWQ76HIMVNOE","short_pith_number":"pith:YISNLJ6Z","canonical_record":{"source":{"id":"1605.00998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-05-03T17:49:27Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"bb2e311541b2acc948a91b23d95b5228c42bff28574aee0d15724aeac1f4fc51","abstract_canon_sha256":"cdde42d893e9980012ae71f51318ff90683e4aac501bd5fbfa5995ee371a2742"},"schema_version":"1.0"},"canonical_sha256":"c224d5a7d962637c859687fc7432ad711168fa75fafae83dfcccc12645d444ba","source":{"kind":"arxiv","id":"1605.00998","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00998","created_at":"2026-05-18T01:15:47Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00998v1","created_at":"2026-05-18T01:15:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00998","created_at":"2026-05-18T01:15:47Z"},{"alias_kind":"pith_short_12","alias_value":"YISNLJ6ZMJRX","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YISNLJ6ZMJRXZBMW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YISNLJ6Z","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YISNLJ6ZMJRXZBMWQ76HIMVNOE","target":"record","payload":{"canonical_record":{"source":{"id":"1605.00998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-05-03T17:49:27Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"bb2e311541b2acc948a91b23d95b5228c42bff28574aee0d15724aeac1f4fc51","abstract_canon_sha256":"cdde42d893e9980012ae71f51318ff90683e4aac501bd5fbfa5995ee371a2742"},"schema_version":"1.0"},"canonical_sha256":"c224d5a7d962637c859687fc7432ad711168fa75fafae83dfcccc12645d444ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:47.502032Z","signature_b64":"fICQ2PgKHDrZ7fYpHVMQpvNxqne+YE41kEUJ90Tgpg5k5yrqD4myMTaUpMisHjayRpo8cuN7X8KhB2VfFjRsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c224d5a7d962637c859687fc7432ad711168fa75fafae83dfcccc12645d444ba","last_reissued_at":"2026-05-18T01:15:47.501472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:47.501472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.00998","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-18T01:15:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qoLwm4PLmH+17fYUbWKRUuEyhedKIbXa0Xx9JUKu73CC9WCQNf7TxIz6JCw6jafZYSdTovoGWv9fVLw+94B7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:15:07.202148Z"},"content_sha256":"f7b0486a4b1767a2945598fe7acc8ec67c0a3050f69d4d33d73f3c3a9f4300e8","schema_version":"1.0","event_id":"sha256:f7b0486a4b1767a2945598fe7acc8ec67c0a3050f69d4d33d73f3c3a9f4300e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YISNLJ6ZMJRXZBMWQ76HIMVNOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blackbox: A procedure for parallel optimization of expensive black-box functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.MS","authors_text":"Paul Knysh, Yannis Korkolis","submitted_at":"2016-05-03T17:49:27Z","abstract_excerpt":"This note provides a description of a procedure that is designed to efficiently optimize expensive black-box functions. It uses the response surface methodology by incorporating radial basis functions as the response model. A simple method based on a Latin hypercube is used for initial sampling. A modified version of CORS algorithm with space rescaling is used for the subsequent sampling. The procedure is able to scale on multicore processors by performing multiple function evaluations in parallel. The source code of the procedure is written in Python."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00998","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-18T01:15:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZiZZFHbLEep7z1fwjMnezl+0OxjaZCIrrgJyAvhvZwO/JsncNr6tMi6/NM5r1R4WAjp8Viqpzd26Vv4uO+rAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:15:07.202805Z"},"content_sha256":"2250ecb42b6902345639c201eb397974fdf13a390d048afeb44d98b56f9065eb","schema_version":"1.0","event_id":"sha256:2250ecb42b6902345639c201eb397974fdf13a390d048afeb44d98b56f9065eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YISNLJ6ZMJRXZBMWQ76HIMVNOE/bundle.json","state_url":"https://pith.science/pith/YISNLJ6ZMJRXZBMWQ76HIMVNOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YISNLJ6ZMJRXZBMWQ76HIMVNOE/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-05-28T22:15:07Z","links":{"resolver":"https://pith.science/pith/YISNLJ6ZMJRXZBMWQ76HIMVNOE","bundle":"https://pith.science/pith/YISNLJ6ZMJRXZBMWQ76HIMVNOE/bundle.json","state":"https://pith.science/pith/YISNLJ6ZMJRXZBMWQ76HIMVNOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YISNLJ6ZMJRXZBMWQ76HIMVNOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YISNLJ6ZMJRXZBMWQ76HIMVNOE","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":"cdde42d893e9980012ae71f51318ff90683e4aac501bd5fbfa5995ee371a2742","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-05-03T17:49:27Z","title_canon_sha256":"bb2e311541b2acc948a91b23d95b5228c42bff28574aee0d15724aeac1f4fc51"},"schema_version":"1.0","source":{"id":"1605.00998","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00998","created_at":"2026-05-18T01:15:47Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00998v1","created_at":"2026-05-18T01:15:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00998","created_at":"2026-05-18T01:15:47Z"},{"alias_kind":"pith_short_12","alias_value":"YISNLJ6ZMJRX","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YISNLJ6ZMJRXZBMW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YISNLJ6Z","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:2250ecb42b6902345639c201eb397974fdf13a390d048afeb44d98b56f9065eb","target":"graph","created_at":"2026-05-18T01:15:47Z","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":"This note provides a description of a procedure that is designed to efficiently optimize expensive black-box functions. It uses the response surface methodology by incorporating radial basis functions as the response model. A simple method based on a Latin hypercube is used for initial sampling. A modified version of CORS algorithm with space rescaling is used for the subsequent sampling. The procedure is able to scale on multicore processors by performing multiple function evaluations in parallel. The source code of the procedure is written in Python.","authors_text":"Paul Knysh, Yannis Korkolis","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-05-03T17:49:27Z","title":"Blackbox: A procedure for parallel optimization of expensive black-box functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00998","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:f7b0486a4b1767a2945598fe7acc8ec67c0a3050f69d4d33d73f3c3a9f4300e8","target":"record","created_at":"2026-05-18T01:15:47Z","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":"cdde42d893e9980012ae71f51318ff90683e4aac501bd5fbfa5995ee371a2742","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2016-05-03T17:49:27Z","title_canon_sha256":"bb2e311541b2acc948a91b23d95b5228c42bff28574aee0d15724aeac1f4fc51"},"schema_version":"1.0","source":{"id":"1605.00998","kind":"arxiv","version":1}},"canonical_sha256":"c224d5a7d962637c859687fc7432ad711168fa75fafae83dfcccc12645d444ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c224d5a7d962637c859687fc7432ad711168fa75fafae83dfcccc12645d444ba","first_computed_at":"2026-05-18T01:15:47.501472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:47.501472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fICQ2PgKHDrZ7fYpHVMQpvNxqne+YE41kEUJ90Tgpg5k5yrqD4myMTaUpMisHjayRpo8cuN7X8KhB2VfFjRsBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:47.502032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.00998","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7b0486a4b1767a2945598fe7acc8ec67c0a3050f69d4d33d73f3c3a9f4300e8","sha256:2250ecb42b6902345639c201eb397974fdf13a390d048afeb44d98b56f9065eb"],"state_sha256":"4f01b3add3f87ab0a86be6cfd0c337f0df8ddd6273595795b9bde96919c8b68e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"84t8XUyKou4Jl5Jq9HRFmMdkswwa2yPtsdi1mY660gUP3Z6snnSJ4wJJreDqqZUNV5BgyEI6DszjvrL5b5peAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:15:07.206576Z","bundle_sha256":"f257b627a0c84945e6b246b15d7b90b2e08756798a852f1aef54eea506d7d378"}}