{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OJ2HUSP6WEUQTAUIPENLVP4CHB","short_pith_number":"pith:OJ2HUSP6","canonical_record":{"source":{"id":"1809.02437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-07T12:32:32Z","cross_cats_sorted":[],"title_canon_sha256":"7219fdbd76b3a507a60485d5975ebd3965e5d03785f5e2f7445c344e4749f304","abstract_canon_sha256":"14842f50987019ecadc176825e995ab9214f29ccc7560519fea82545bb4b9f6a"},"schema_version":"1.0"},"canonical_sha256":"72747a49feb129098288791ababf82386d9420ce7ee4b815f0fe447cbe32848f","source":{"kind":"arxiv","id":"1809.02437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02437","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02437v1","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02437","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"OJ2HUSP6WEUQ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OJ2HUSP6WEUQTAUI","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OJ2HUSP6","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OJ2HUSP6WEUQTAUIPENLVP4CHB","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-07T12:32:32Z","cross_cats_sorted":[],"title_canon_sha256":"7219fdbd76b3a507a60485d5975ebd3965e5d03785f5e2f7445c344e4749f304","abstract_canon_sha256":"14842f50987019ecadc176825e995ab9214f29ccc7560519fea82545bb4b9f6a"},"schema_version":"1.0"},"canonical_sha256":"72747a49feb129098288791ababf82386d9420ce7ee4b815f0fe447cbe32848f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:17.112299Z","signature_b64":"On6DRKSklMXC8apG8t+2zdpB8OESYeiKurl8VjOtEupitNQm7a+5Li20Z2hKHYbpyOnqHOb3ruklRepPSq9KCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72747a49feb129098288791ababf82386d9420ce7ee4b815f0fe447cbe32848f","last_reissued_at":"2026-05-18T00:06:17.111828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:17.111828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02437","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:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iSi1fzmXIC9kfonDvDNFRzBjAcwg9qXE1txYvpT4PFLs7xgmjyNj6uy9vjZxkOZylpEWIe6nvFaN6drvmFbEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:41:05.134692Z"},"content_sha256":"d335026d2000ebce0580a29155c9f49c1d9278534221990d5931041e1efce6a8","schema_version":"1.0","event_id":"sha256:d335026d2000ebce0580a29155c9f49c1d9278534221990d5931041e1efce6a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OJ2HUSP6WEUQTAUIPENLVP4CHB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Largest Empty Hypersphere Metaheuristic for Robust Optimisation with Implementation Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marc Goerigk, Martin Hughes, Michael Wright","submitted_at":"2018-09-07T12:32:32Z","abstract_excerpt":"We consider box-constrained robust optimisation problems with implementation uncertainty. In this setting, the solution that a decision maker wants to implement may become perturbed. The aim is to find a solution that optimises the worst possible performance over all possible perturbances.\n  Previously, only few generic search methods have been developed for this setting. We introduce a new approach for a global search, based on placing a largest empty hypersphere. We do not assume any knowledge on the structure of the original objective function, making this approach also viable for simulatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02437","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:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xLxcpmkTuYjpNkK7BUOxbYoed67VuG2wbsUN6SJTvcrKxVpVZmcJPGLLnhhfIrqkimXMfqgayQNSdK3PDk10Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:41:05.135487Z"},"content_sha256":"01b2509172fdb52a07a31d3538b6af6acace391b837baa67e4355ee19be50d02","schema_version":"1.0","event_id":"sha256:01b2509172fdb52a07a31d3538b6af6acace391b837baa67e4355ee19be50d02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB/bundle.json","state_url":"https://pith.science/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB/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-31T09:41:05Z","links":{"resolver":"https://pith.science/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB","bundle":"https://pith.science/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB/bundle.json","state":"https://pith.science/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OJ2HUSP6WEUQTAUIPENLVP4CHB","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":"14842f50987019ecadc176825e995ab9214f29ccc7560519fea82545bb4b9f6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-07T12:32:32Z","title_canon_sha256":"7219fdbd76b3a507a60485d5975ebd3965e5d03785f5e2f7445c344e4749f304"},"schema_version":"1.0","source":{"id":"1809.02437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02437","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02437v1","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02437","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"OJ2HUSP6WEUQ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OJ2HUSP6WEUQTAUI","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OJ2HUSP6","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:01b2509172fdb52a07a31d3538b6af6acace391b837baa67e4355ee19be50d02","target":"graph","created_at":"2026-05-18T00:06:17Z","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 consider box-constrained robust optimisation problems with implementation uncertainty. In this setting, the solution that a decision maker wants to implement may become perturbed. The aim is to find a solution that optimises the worst possible performance over all possible perturbances.\n  Previously, only few generic search methods have been developed for this setting. We introduce a new approach for a global search, based on placing a largest empty hypersphere. We do not assume any knowledge on the structure of the original objective function, making this approach also viable for simulatio","authors_text":"Marc Goerigk, Martin Hughes, Michael Wright","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-07T12:32:32Z","title":"A Largest Empty Hypersphere Metaheuristic for Robust Optimisation with Implementation Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02437","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:d335026d2000ebce0580a29155c9f49c1d9278534221990d5931041e1efce6a8","target":"record","created_at":"2026-05-18T00:06:17Z","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":"14842f50987019ecadc176825e995ab9214f29ccc7560519fea82545bb4b9f6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-07T12:32:32Z","title_canon_sha256":"7219fdbd76b3a507a60485d5975ebd3965e5d03785f5e2f7445c344e4749f304"},"schema_version":"1.0","source":{"id":"1809.02437","kind":"arxiv","version":1}},"canonical_sha256":"72747a49feb129098288791ababf82386d9420ce7ee4b815f0fe447cbe32848f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72747a49feb129098288791ababf82386d9420ce7ee4b815f0fe447cbe32848f","first_computed_at":"2026-05-18T00:06:17.111828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:17.111828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"On6DRKSklMXC8apG8t+2zdpB8OESYeiKurl8VjOtEupitNQm7a+5Li20Z2hKHYbpyOnqHOb3ruklRepPSq9KCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:17.112299Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d335026d2000ebce0580a29155c9f49c1d9278534221990d5931041e1efce6a8","sha256:01b2509172fdb52a07a31d3538b6af6acace391b837baa67e4355ee19be50d02"],"state_sha256":"123cfcd836e4cbb968ca53874738290d9836c21d563bf9185f5537153afaca7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tB3suXHZRmnb/JLskhbOxmFJpgJuxf2f4qGJS/kgjGmftRYUiI/6ocowU+wj/Jp5kLLjWuTrLqgtMXsDGd8aDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:41:05.138833Z","bundle_sha256":"1ee7e8a772dd44e48a19c684a477196dbc85e9ad2b373aec17b6f4c33c500fbe"}}