{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4PXPMWVEMVKFVNKQNNPMKGVGML","short_pith_number":"pith:4PXPMWVE","canonical_record":{"source":{"id":"1403.4890","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-03-19T17:36:37Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"f682910bf89d051e4555677f3ef18d8695f70c9a2d32109f638e659a26ba535b","abstract_canon_sha256":"024beb6a2a90d30a18aba561c9289984f43f99a7f0a9bf04f64a7c76fce377c7"},"schema_version":"1.0"},"canonical_sha256":"e3eef65aa465545ab5506b5ec51aa662da645e8f53d0c70c79988e9d61a51b4b","source":{"kind":"arxiv","id":"1403.4890","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4890","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4890v3","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4890","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"pith_short_12","alias_value":"4PXPMWVEMVKF","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4PXPMWVEMVKFVNKQ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4PXPMWVE","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4PXPMWVEMVKFVNKQNNPMKGVGML","target":"record","payload":{"canonical_record":{"source":{"id":"1403.4890","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-03-19T17:36:37Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"f682910bf89d051e4555677f3ef18d8695f70c9a2d32109f638e659a26ba535b","abstract_canon_sha256":"024beb6a2a90d30a18aba561c9289984f43f99a7f0a9bf04f64a7c76fce377c7"},"schema_version":"1.0"},"canonical_sha256":"e3eef65aa465545ab5506b5ec51aa662da645e8f53d0c70c79988e9d61a51b4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:49.198382Z","signature_b64":"mBVGAPq5LIDbjTY4pkhaGIp42q0lzJINdnCKv/wXGAOlWiQPUYUc3gjFtY64GlEvQYTeXJXxw2URn4I80n1+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3eef65aa465545ab5506b5ec51aa662da645e8f53d0c70c79988e9d61a51b4b","last_reissued_at":"2026-05-18T02:25:49.197994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:49.197994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.4890","source_version":3,"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-18T02:25:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ErXeQRSzBflw8aRcTR9fQbBOxEVZktsaFnWCRa61MnB9qg7Vg2IAwi23HYtiWVUTwa+QRaC0xYrKhbtRMLSRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:36:14.257600Z"},"content_sha256":"f36fa215205928e37bb810277dd9ec964330f74216c68ea4a404cae6e55c5507","schema_version":"1.0","event_id":"sha256:f36fa215205928e37bb810277dd9ec964330f74216c68ea4a404cae6e55c5507"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4PXPMWVEMVKFVNKQNNPMKGVGML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modeling an Augmented Lagrangian for Blackbox Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Garth Wells, Genetha A. Gray, Herbert K.H. Lee, Pritam Ranjan, Robert B. Gramacy, Sebastien Le Digabel, Stefan M. Wild","submitted_at":"2014-03-19T17:36:37Z","abstract_excerpt":"Constrained blackbox optimization is a difficult problem, with most approaches coming from the mathematical programming literature. The statistical literature is sparse, especially in addressing problems with nontrivial constraints. This situation is unfortunate because statistical methods have many attractive properties: global scope, handling noisy objectives, sensitivity analysis, and so forth. To narrow that gap, we propose a combination of response surface modeling, expected improvement, and the augmented Lagrangian numerical optimization framework. This hybrid approach allows the statist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4890","kind":"arxiv","version":3},"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-18T02:25:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4j8XSZp5Uw+TjvCSkH78WvFuuAouAdNHPlVv1mqPftapLjhdrilD5VBt6Pg1ZwEX8GzE7NA+nQsQSCP076PEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:36:14.257939Z"},"content_sha256":"43095112e6de380afe83e21e154171ba2ec4d44c7bcd5df7c7adcbf5a1aace45","schema_version":"1.0","event_id":"sha256:43095112e6de380afe83e21e154171ba2ec4d44c7bcd5df7c7adcbf5a1aace45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PXPMWVEMVKFVNKQNNPMKGVGML/bundle.json","state_url":"https://pith.science/pith/4PXPMWVEMVKFVNKQNNPMKGVGML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PXPMWVEMVKFVNKQNNPMKGVGML/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-07T02:36:14Z","links":{"resolver":"https://pith.science/pith/4PXPMWVEMVKFVNKQNNPMKGVGML","bundle":"https://pith.science/pith/4PXPMWVEMVKFVNKQNNPMKGVGML/bundle.json","state":"https://pith.science/pith/4PXPMWVEMVKFVNKQNNPMKGVGML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PXPMWVEMVKFVNKQNNPMKGVGML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4PXPMWVEMVKFVNKQNNPMKGVGML","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":"024beb6a2a90d30a18aba561c9289984f43f99a7f0a9bf04f64a7c76fce377c7","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-03-19T17:36:37Z","title_canon_sha256":"f682910bf89d051e4555677f3ef18d8695f70c9a2d32109f638e659a26ba535b"},"schema_version":"1.0","source":{"id":"1403.4890","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4890","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4890v3","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4890","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"pith_short_12","alias_value":"4PXPMWVEMVKF","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4PXPMWVEMVKFVNKQ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4PXPMWVE","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:43095112e6de380afe83e21e154171ba2ec4d44c7bcd5df7c7adcbf5a1aace45","target":"graph","created_at":"2026-05-18T02:25:49Z","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 blackbox optimization is a difficult problem, with most approaches coming from the mathematical programming literature. The statistical literature is sparse, especially in addressing problems with nontrivial constraints. This situation is unfortunate because statistical methods have many attractive properties: global scope, handling noisy objectives, sensitivity analysis, and so forth. To narrow that gap, we propose a combination of response surface modeling, expected improvement, and the augmented Lagrangian numerical optimization framework. This hybrid approach allows the statist","authors_text":"Garth Wells, Genetha A. Gray, Herbert K.H. Lee, Pritam Ranjan, Robert B. Gramacy, Sebastien Le Digabel, Stefan M. Wild","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-03-19T17:36:37Z","title":"Modeling an Augmented Lagrangian for Blackbox Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4890","kind":"arxiv","version":3},"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:f36fa215205928e37bb810277dd9ec964330f74216c68ea4a404cae6e55c5507","target":"record","created_at":"2026-05-18T02:25:49Z","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":"024beb6a2a90d30a18aba561c9289984f43f99a7f0a9bf04f64a7c76fce377c7","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-03-19T17:36:37Z","title_canon_sha256":"f682910bf89d051e4555677f3ef18d8695f70c9a2d32109f638e659a26ba535b"},"schema_version":"1.0","source":{"id":"1403.4890","kind":"arxiv","version":3}},"canonical_sha256":"e3eef65aa465545ab5506b5ec51aa662da645e8f53d0c70c79988e9d61a51b4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3eef65aa465545ab5506b5ec51aa662da645e8f53d0c70c79988e9d61a51b4b","first_computed_at":"2026-05-18T02:25:49.197994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:49.197994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mBVGAPq5LIDbjTY4pkhaGIp42q0lzJINdnCKv/wXGAOlWiQPUYUc3gjFtY64GlEvQYTeXJXxw2URn4I80n1+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:49.198382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4890","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f36fa215205928e37bb810277dd9ec964330f74216c68ea4a404cae6e55c5507","sha256:43095112e6de380afe83e21e154171ba2ec4d44c7bcd5df7c7adcbf5a1aace45"],"state_sha256":"d9e682bbb16314d96401b4a92270e175a9ab551b98d7338e8878b6e31e943236"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D7XAAiUMTAMXtbRI9E/YFZAVspMC7AwQ+rTFgEX9sel2WDm8x3l6IT8aATJPEgCk9z9GJY2Z4/Anx6yfWcqfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T02:36:14.259996Z","bundle_sha256":"9dedf3c3186fb3ea4e0161d0b42e2cc152ca3a0036a635289776124922dfa1ec"}}