{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LGXFOAHT7HFP2NMNA4FN3WJ7XY","short_pith_number":"pith:LGXFOAHT","schema_version":"1.0","canonical_sha256":"59ae5700f3f9cafd358d070addd93fbe39d78eddaa3b3f4ad42bf728ac1c1e2a","source":{"kind":"arxiv","id":"1409.7089","version":2},"attestation_state":"computed","paper":{"title":"A density-matching approach for optimization under uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.OC","authors_text":"Geoffrey Parks, Gianluca Iaccarino, Paul Constantine, Pranay Seshadri","submitted_at":"2014-09-24T20:35:16Z","abstract_excerpt":"Modern computers enable methods for design optimization that account for uncertainty in the system---so-called optimization under uncertainty. We propose a metric for OUU that measures the distance between a designer-specified probability density function of the system response the target and system response's density function at a given design. We study an OUU formulation that minimizes this distance metric over all designs. We discretize the objective function with numerical quadrature and approximate the response density function with a Gaussian kernel density estimate. We offer heuristics "},"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":"1409.7089","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-24T20:35:16Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"6c0a58c63a527a29005a0b2bc1e7c39080fd701c6e81504d9527ab507f805835","abstract_canon_sha256":"9e534ff6fccc3a3faa0683b99694e81cf6a854e40021574855cb7f6ae087707a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:40.163510Z","signature_b64":"ThE1REUwzfXwNi9adLw8cHIt5KRXcxw5LlQb2ofEDohi7R3Npyq8SaowkmDecBmvuqvgUMALGpe1itK0sGMnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59ae5700f3f9cafd358d070addd93fbe39d78eddaa3b3f4ad42bf728ac1c1e2a","last_reissued_at":"2026-05-18T01:35:40.162754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:40.162754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A density-matching approach for optimization under uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.OC","authors_text":"Geoffrey Parks, Gianluca Iaccarino, Paul Constantine, Pranay Seshadri","submitted_at":"2014-09-24T20:35:16Z","abstract_excerpt":"Modern computers enable methods for design optimization that account for uncertainty in the system---so-called optimization under uncertainty. We propose a metric for OUU that measures the distance between a designer-specified probability density function of the system response the target and system response's density function at a given design. We study an OUU formulation that minimizes this distance metric over all designs. We discretize the objective function with numerical quadrature and approximate the response density function with a Gaussian kernel density estimate. We offer heuristics "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7089","kind":"arxiv","version":2},"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":"1409.7089","created_at":"2026-05-18T01:35:40.162893+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7089v2","created_at":"2026-05-18T01:35:40.162893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7089","created_at":"2026-05-18T01:35:40.162893+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGXFOAHT7HFP","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGXFOAHT7HFP2NMN","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGXFOAHT","created_at":"2026-05-18T12:28:38.356838+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/LGXFOAHT7HFP2NMNA4FN3WJ7XY","json":"https://pith.science/pith/LGXFOAHT7HFP2NMNA4FN3WJ7XY.json","graph_json":"https://pith.science/api/pith-number/LGXFOAHT7HFP2NMNA4FN3WJ7XY/graph.json","events_json":"https://pith.science/api/pith-number/LGXFOAHT7HFP2NMNA4FN3WJ7XY/events.json","paper":"https://pith.science/paper/LGXFOAHT"},"agent_actions":{"view_html":"https://pith.science/pith/LGXFOAHT7HFP2NMNA4FN3WJ7XY","download_json":"https://pith.science/pith/LGXFOAHT7HFP2NMNA4FN3WJ7XY.json","view_paper":"https://pith.science/paper/LGXFOAHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7089&json=true","fetch_graph":"https://pith.science/api/pith-number/LGXFOAHT7HFP2NMNA4FN3WJ7XY/graph.json","fetch_events":"https://pith.science/api/pith-number/LGXFOAHT7HFP2NMNA4FN3WJ7XY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGXFOAHT7HFP2NMNA4FN3WJ7XY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGXFOAHT7HFP2NMNA4FN3WJ7XY/action/storage_attestation","attest_author":"https://pith.science/pith/LGXFOAHT7HFP2NMNA4FN3WJ7XY/action/author_attestation","sign_citation":"https://pith.science/pith/LGXFOAHT7HFP2NMNA4FN3WJ7XY/action/citation_signature","submit_replication":"https://pith.science/pith/LGXFOAHT7HFP2NMNA4FN3WJ7XY/action/replication_record"}},"created_at":"2026-05-18T01:35:40.162893+00:00","updated_at":"2026-05-18T01:35:40.162893+00:00"}