{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZU6KBIDF77E4XFOEEV34Q52EZP","short_pith_number":"pith:ZU6KBIDF","canonical_record":{"source":{"id":"1508.07741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-08-31T09:42:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7dff4a0ba12deb8308421d9a95f6ed68f60545348e449828121c4216d4b986e9","abstract_canon_sha256":"d7ff1e7bbbdefb0a0990f377c71befa432004e092308d7ff717d2a949650cd63"},"schema_version":"1.0"},"canonical_sha256":"cd3ca0a065ffc9cb95c42577c87744cbe26b1109af65febe2ecf6ffcd7218828","source":{"kind":"arxiv","id":"1508.07741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07741","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07741v1","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07741","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZU6KBIDF77E4","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZU6KBIDF77E4XFOE","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZU6KBIDF","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZU6KBIDF77E4XFOEEV34Q52EZP","target":"record","payload":{"canonical_record":{"source":{"id":"1508.07741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-08-31T09:42:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7dff4a0ba12deb8308421d9a95f6ed68f60545348e449828121c4216d4b986e9","abstract_canon_sha256":"d7ff1e7bbbdefb0a0990f377c71befa432004e092308d7ff717d2a949650cd63"},"schema_version":"1.0"},"canonical_sha256":"cd3ca0a065ffc9cb95c42577c87744cbe26b1109af65febe2ecf6ffcd7218828","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:31.503779Z","signature_b64":"zClLSgUry6U75X5Y9pWJgDEjYRK+D9Ye3rYvt1J/ynuMA+g2FUYqL9cqThX2mHuLSO2WTVsnsxS0NFH8CoN6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd3ca0a065ffc9cb95c42577c87744cbe26b1109af65febe2ecf6ffcd7218828","last_reissued_at":"2026-05-18T01:34:31.503421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:31.503421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.07741","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:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zbEQWMcoUvms7N1pIamtAF0kMmlIPxzIjDXxKHxWiaywghmgER1VqjpTr8y4cH2T8P+OMsTFtVzQVbpFsHRsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T09:43:23.069469Z"},"content_sha256":"849da4638381bd71619ca12bcc634cfcbe486b217e8fc30af05fa5cb410d1798","schema_version":"1.0","event_id":"sha256:849da4638381bd71619ca12bcc634cfcbe486b217e8fc30af05fa5cb410d1798"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZU6KBIDF77E4XFOEEV34Q52EZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model Guided Sampling Optimization for Low-dimensional Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.NE","authors_text":"Lukas Bajer, Martin Holena","submitted_at":"2015-08-31T09:42:33Z","abstract_excerpt":"Optimization of very expensive black-box functions requires utilization of maximum information gathered by the process of optimization. Model Guided Sampling Optimization (MGSO) forms a more robust alternative to Jones' Gaussian-process-based EGO algorithm. Instead of EGO's maximizing expected improvement, the MGSO uses sampling the probability of improvement which is shown to be helpful against trapping in local minima. Further, the MGSO can reach close-to-optimum solutions faster than standard optimization algorithms on low dimensional or smooth problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07741","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:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QWiaQJuyrLlr6LvV7AXlM2/895nAXwSoBYD/Cw6cyRIXZ7B/62YAesBIPKgFwLFsloOc3HsBCN3FopAwMs5IAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T09:43:23.069821Z"},"content_sha256":"a10026ed73e281f019635938dc3723162b1a2437e7740a17a6fcbfd6ec6c665e","schema_version":"1.0","event_id":"sha256:a10026ed73e281f019635938dc3723162b1a2437e7740a17a6fcbfd6ec6c665e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZU6KBIDF77E4XFOEEV34Q52EZP/bundle.json","state_url":"https://pith.science/pith/ZU6KBIDF77E4XFOEEV34Q52EZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZU6KBIDF77E4XFOEEV34Q52EZP/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-21T09:43:23Z","links":{"resolver":"https://pith.science/pith/ZU6KBIDF77E4XFOEEV34Q52EZP","bundle":"https://pith.science/pith/ZU6KBIDF77E4XFOEEV34Q52EZP/bundle.json","state":"https://pith.science/pith/ZU6KBIDF77E4XFOEEV34Q52EZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZU6KBIDF77E4XFOEEV34Q52EZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZU6KBIDF77E4XFOEEV34Q52EZP","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":"d7ff1e7bbbdefb0a0990f377c71befa432004e092308d7ff717d2a949650cd63","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-08-31T09:42:33Z","title_canon_sha256":"7dff4a0ba12deb8308421d9a95f6ed68f60545348e449828121c4216d4b986e9"},"schema_version":"1.0","source":{"id":"1508.07741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07741","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07741v1","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07741","created_at":"2026-05-18T01:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZU6KBIDF77E4","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZU6KBIDF77E4XFOE","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZU6KBIDF","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:a10026ed73e281f019635938dc3723162b1a2437e7740a17a6fcbfd6ec6c665e","target":"graph","created_at":"2026-05-18T01:34:31Z","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":"Optimization of very expensive black-box functions requires utilization of maximum information gathered by the process of optimization. Model Guided Sampling Optimization (MGSO) forms a more robust alternative to Jones' Gaussian-process-based EGO algorithm. Instead of EGO's maximizing expected improvement, the MGSO uses sampling the probability of improvement which is shown to be helpful against trapping in local minima. Further, the MGSO can reach close-to-optimum solutions faster than standard optimization algorithms on low dimensional or smooth problems.","authors_text":"Lukas Bajer, Martin Holena","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-08-31T09:42:33Z","title":"Model Guided Sampling Optimization for Low-dimensional Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07741","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:849da4638381bd71619ca12bcc634cfcbe486b217e8fc30af05fa5cb410d1798","target":"record","created_at":"2026-05-18T01:34:31Z","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":"d7ff1e7bbbdefb0a0990f377c71befa432004e092308d7ff717d2a949650cd63","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-08-31T09:42:33Z","title_canon_sha256":"7dff4a0ba12deb8308421d9a95f6ed68f60545348e449828121c4216d4b986e9"},"schema_version":"1.0","source":{"id":"1508.07741","kind":"arxiv","version":1}},"canonical_sha256":"cd3ca0a065ffc9cb95c42577c87744cbe26b1109af65febe2ecf6ffcd7218828","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd3ca0a065ffc9cb95c42577c87744cbe26b1109af65febe2ecf6ffcd7218828","first_computed_at":"2026-05-18T01:34:31.503421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:31.503421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zClLSgUry6U75X5Y9pWJgDEjYRK+D9Ye3rYvt1J/ynuMA+g2FUYqL9cqThX2mHuLSO2WTVsnsxS0NFH8CoN6Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:31.503779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.07741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:849da4638381bd71619ca12bcc634cfcbe486b217e8fc30af05fa5cb410d1798","sha256:a10026ed73e281f019635938dc3723162b1a2437e7740a17a6fcbfd6ec6c665e"],"state_sha256":"3a2274bd388c7178cbe4815bc8c39f56cfd22f458fcbfb9bd7def03c6ebae890"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pYE5JGAtPitJgGLkNAqqyjg2zp7ylrPGXi0ynyapSu4v5PdeW/j/BENGX3BVJ2+paGTbdx/4qt1Nujcy7G/KDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T09:43:23.071681Z","bundle_sha256":"07a4e168bf9af9eb85681d78990804d6e763408402d563575dba0e5f3cce28d4"}}