{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VIJ5CH426H45JUY5XCLYJWMPMD","short_pith_number":"pith:VIJ5CH42","canonical_record":{"source":{"id":"1512.09251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-31T10:30:21Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"608d242b448e06bc49e3ad031d7ee89d031e23fe4a49ab0aaaddccac406d8b17","abstract_canon_sha256":"a988e55435cc60c7dde8c65db349f51fbc5ea75b289aaf7c1d6289b0828959cb"},"schema_version":"1.0"},"canonical_sha256":"aa13d11f9af1f9d4d31db89784d98f60c38aee751a42769254a4c5cf9ecc6c59","source":{"kind":"arxiv","id":"1512.09251","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09251","created_at":"2026-05-18T01:23:32Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09251v1","created_at":"2026-05-18T01:23:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09251","created_at":"2026-05-18T01:23:32Z"},{"alias_kind":"pith_short_12","alias_value":"VIJ5CH426H45","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VIJ5CH426H45JUY5","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VIJ5CH42","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VIJ5CH426H45JUY5XCLYJWMPMD","target":"record","payload":{"canonical_record":{"source":{"id":"1512.09251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-31T10:30:21Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"608d242b448e06bc49e3ad031d7ee89d031e23fe4a49ab0aaaddccac406d8b17","abstract_canon_sha256":"a988e55435cc60c7dde8c65db349f51fbc5ea75b289aaf7c1d6289b0828959cb"},"schema_version":"1.0"},"canonical_sha256":"aa13d11f9af1f9d4d31db89784d98f60c38aee751a42769254a4c5cf9ecc6c59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:32.875053Z","signature_b64":"9LTrjfiT4IVMkZPrdM8HOj7egztpFi3DsYZgAn06jId+t3XQIViG7kRNMxH8VxJkabrQz5+HKZJYZiRDq/I+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa13d11f9af1f9d4d31db89784d98f60c38aee751a42769254a4c5cf9ecc6c59","last_reissued_at":"2026-05-18T01:23:32.874412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:32.874412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.09251","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:23:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NwpPjmPxPNdZp33Q25+/7nyGiHY3X3153H/ta+U/o68tzAD2ukcqtLW8LV7MqNSThVAWU+8kVE2TI+NbiFTODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:57:21.218771Z"},"content_sha256":"7fda71c4013a5f18cd754a5b182eff8b2fc57a69734d4abf2f31985ef0c7749d","schema_version":"1.0","event_id":"sha256:7fda71c4013a5f18cd754a5b182eff8b2fc57a69734d4abf2f31985ef0c7749d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VIJ5CH426H45JUY5XCLYJWMPMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving the G-problems in less than 500 iterations: Improved efficient constrained optimization by surrogate modeling and adaptive parameter control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"math.OC","authors_text":"Michael Emmerich, Samineh Bagheri, Thomas B\\\"ack, Wolfgang Konen","submitted_at":"2015-12-31T10:30:21Z","abstract_excerpt":"Constrained optimization of high-dimensional numerical problems plays an important role in many scientific and industrial applications. Function evaluations in many industrial applications are severely limited and no analytical information about objective function and constraint functions is available. For such expensive black-box optimization tasks, the constraint optimization algorithm COBRA was proposed, making use of RBF surrogate modeling for both the objective and the constraint functions. COBRA has shown remarkable success in solving reliably complex benchmark problems in less than 500 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09251","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:23:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PYkUvdFA6ZZ3ToOSMBra13/OVu9aBZcBq/1dtPIizKiSDqBWAFadKdr2LVuGKKL2q+0oJFbOkhI5MWxne9nyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:57:21.219132Z"},"content_sha256":"932c052c1fa0d1bebbce3606c4d38c416016658e339eff196d2b38c34c160be5","schema_version":"1.0","event_id":"sha256:932c052c1fa0d1bebbce3606c4d38c416016658e339eff196d2b38c34c160be5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIJ5CH426H45JUY5XCLYJWMPMD/bundle.json","state_url":"https://pith.science/pith/VIJ5CH426H45JUY5XCLYJWMPMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIJ5CH426H45JUY5XCLYJWMPMD/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-24T02:57:21Z","links":{"resolver":"https://pith.science/pith/VIJ5CH426H45JUY5XCLYJWMPMD","bundle":"https://pith.science/pith/VIJ5CH426H45JUY5XCLYJWMPMD/bundle.json","state":"https://pith.science/pith/VIJ5CH426H45JUY5XCLYJWMPMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIJ5CH426H45JUY5XCLYJWMPMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VIJ5CH426H45JUY5XCLYJWMPMD","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":"a988e55435cc60c7dde8c65db349f51fbc5ea75b289aaf7c1d6289b0828959cb","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-31T10:30:21Z","title_canon_sha256":"608d242b448e06bc49e3ad031d7ee89d031e23fe4a49ab0aaaddccac406d8b17"},"schema_version":"1.0","source":{"id":"1512.09251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09251","created_at":"2026-05-18T01:23:32Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09251v1","created_at":"2026-05-18T01:23:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09251","created_at":"2026-05-18T01:23:32Z"},{"alias_kind":"pith_short_12","alias_value":"VIJ5CH426H45","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VIJ5CH426H45JUY5","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VIJ5CH42","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:932c052c1fa0d1bebbce3606c4d38c416016658e339eff196d2b38c34c160be5","target":"graph","created_at":"2026-05-18T01:23:32Z","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":"Constrained optimization of high-dimensional numerical problems plays an important role in many scientific and industrial applications. Function evaluations in many industrial applications are severely limited and no analytical information about objective function and constraint functions is available. For such expensive black-box optimization tasks, the constraint optimization algorithm COBRA was proposed, making use of RBF surrogate modeling for both the objective and the constraint functions. COBRA has shown remarkable success in solving reliably complex benchmark problems in less than 500 ","authors_text":"Michael Emmerich, Samineh Bagheri, Thomas B\\\"ack, Wolfgang Konen","cross_cats":["cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-31T10:30:21Z","title":"Solving the G-problems in less than 500 iterations: Improved efficient constrained optimization by surrogate modeling and adaptive parameter control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09251","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:7fda71c4013a5f18cd754a5b182eff8b2fc57a69734d4abf2f31985ef0c7749d","target":"record","created_at":"2026-05-18T01:23:32Z","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":"a988e55435cc60c7dde8c65db349f51fbc5ea75b289aaf7c1d6289b0828959cb","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-31T10:30:21Z","title_canon_sha256":"608d242b448e06bc49e3ad031d7ee89d031e23fe4a49ab0aaaddccac406d8b17"},"schema_version":"1.0","source":{"id":"1512.09251","kind":"arxiv","version":1}},"canonical_sha256":"aa13d11f9af1f9d4d31db89784d98f60c38aee751a42769254a4c5cf9ecc6c59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa13d11f9af1f9d4d31db89784d98f60c38aee751a42769254a4c5cf9ecc6c59","first_computed_at":"2026-05-18T01:23:32.874412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:32.874412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9LTrjfiT4IVMkZPrdM8HOj7egztpFi3DsYZgAn06jId+t3XQIViG7kRNMxH8VxJkabrQz5+HKZJYZiRDq/I+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:32.875053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.09251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fda71c4013a5f18cd754a5b182eff8b2fc57a69734d4abf2f31985ef0c7749d","sha256:932c052c1fa0d1bebbce3606c4d38c416016658e339eff196d2b38c34c160be5"],"state_sha256":"897c418c343bc1cc544dcdb903ed20879be771935b96e28dbc6cf589a77ba908"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VTKywrzr5sebko3WHtbmWZxwTZhRvm3trUQ2Mjq6KVkS1Fxqpmvp4WrR5QEj6MMo0F3mcZyx0+duOkHCT0OyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T02:57:21.221126Z","bundle_sha256":"c746caa346acbaf3c53c40c9022ae35e594dd7ef84dcd467a44efaaafd52db7f"}}