{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OJ2HUSP6WEUQTAUIPENLVP4CHB","short_pith_number":"pith:OJ2HUSP6","schema_version":"1.0","canonical_sha256":"72747a49feb129098288791ababf82386d9420ce7ee4b815f0fe447cbe32848f","source":{"kind":"arxiv","id":"1809.02437","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.02437","created_at":"2026-05-18T00:06:17.111902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02437v1","created_at":"2026-05-18T00:06:17.111902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02437","created_at":"2026-05-18T00:06:17.111902+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJ2HUSP6WEUQ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJ2HUSP6WEUQTAUI","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJ2HUSP6","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB","json":"https://pith.science/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB.json","graph_json":"https://pith.science/api/pith-number/OJ2HUSP6WEUQTAUIPENLVP4CHB/graph.json","events_json":"https://pith.science/api/pith-number/OJ2HUSP6WEUQTAUIPENLVP4CHB/events.json","paper":"https://pith.science/paper/OJ2HUSP6"},"agent_actions":{"view_html":"https://pith.science/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB","download_json":"https://pith.science/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB.json","view_paper":"https://pith.science/paper/OJ2HUSP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02437&json=true","fetch_graph":"https://pith.science/api/pith-number/OJ2HUSP6WEUQTAUIPENLVP4CHB/graph.json","fetch_events":"https://pith.science/api/pith-number/OJ2HUSP6WEUQTAUIPENLVP4CHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB/action/storage_attestation","attest_author":"https://pith.science/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB/action/author_attestation","sign_citation":"https://pith.science/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB/action/citation_signature","submit_replication":"https://pith.science/pith/OJ2HUSP6WEUQTAUIPENLVP4CHB/action/replication_record"}},"created_at":"2026-05-18T00:06:17.111902+00:00","updated_at":"2026-05-18T00:06:17.111902+00:00"}