{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TATY6Z4XZWU3UIAVOAKEBEDNX7","short_pith_number":"pith:TATY6Z4X","schema_version":"1.0","canonical_sha256":"98278f6797cda9ba2015701440906dbff8ee007d6ecc9b62deda6f8d06a2b162","source":{"kind":"arxiv","id":"1805.07489","version":3},"attestation_state":"computed","paper":{"title":"Contour location via entropy reduction leveraging multiple information sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.DS","math.OC","physics.data-an"],"primary_cat":"stat.ML","authors_text":"Alexandre N. Marques, Karen E. Willcox, Remi R. Lam","submitted_at":"2018-05-19T01:36:43Z","abstract_excerpt":"We introduce an algorithm to locate contours of functions that are expensive to evaluate. The problem of locating contours arises in many applications, including classification, constrained optimization, and performance analysis of mechanical and dynamical systems (reliability, probability of failure, stability, etc.). Our algorithm locates contours using information from multiple sources, which are available in the form of relatively inexpensive, biased, and possibly noisy approximations to the original function. Considering multiple information sources can lead to significant cost savings. W"},"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":"1805.07489","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-19T01:36:43Z","cross_cats_sorted":["cs.LG","math.DS","math.OC","physics.data-an"],"title_canon_sha256":"044e2ed8947d8175014e434dc598a27defc0451ff1119315418bd3f8755e5243","abstract_canon_sha256":"45b0787eb19f6ca75abd1b273d244007b3a56a7bdc38be092aa0a46fc4d93ce9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:59.373615Z","signature_b64":"i0z3cMeWm57FrD0MR+wEHlI7EnNwL+RH4AJyu9mlChUg5YuxWe+gcXJYrHbJVL3uejDBnSNImPycDwVbxjUlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98278f6797cda9ba2015701440906dbff8ee007d6ecc9b62deda6f8d06a2b162","last_reissued_at":"2026-05-17T23:57:59.372949Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:59.372949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contour location via entropy reduction leveraging multiple information sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.DS","math.OC","physics.data-an"],"primary_cat":"stat.ML","authors_text":"Alexandre N. Marques, Karen E. Willcox, Remi R. Lam","submitted_at":"2018-05-19T01:36:43Z","abstract_excerpt":"We introduce an algorithm to locate contours of functions that are expensive to evaluate. The problem of locating contours arises in many applications, including classification, constrained optimization, and performance analysis of mechanical and dynamical systems (reliability, probability of failure, stability, etc.). Our algorithm locates contours using information from multiple sources, which are available in the form of relatively inexpensive, biased, and possibly noisy approximations to the original function. Considering multiple information sources can lead to significant cost savings. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07489","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.07489","created_at":"2026-05-17T23:57:59.373037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07489v3","created_at":"2026-05-17T23:57:59.373037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07489","created_at":"2026-05-17T23:57:59.373037+00:00"},{"alias_kind":"pith_short_12","alias_value":"TATY6Z4XZWU3","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TATY6Z4XZWU3UIAV","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TATY6Z4X","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.20959","citing_title":"Surrogate-Guided Adaptive Importance Sampling for Failure Probability Estimation","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TATY6Z4XZWU3UIAVOAKEBEDNX7","json":"https://pith.science/pith/TATY6Z4XZWU3UIAVOAKEBEDNX7.json","graph_json":"https://pith.science/api/pith-number/TATY6Z4XZWU3UIAVOAKEBEDNX7/graph.json","events_json":"https://pith.science/api/pith-number/TATY6Z4XZWU3UIAVOAKEBEDNX7/events.json","paper":"https://pith.science/paper/TATY6Z4X"},"agent_actions":{"view_html":"https://pith.science/pith/TATY6Z4XZWU3UIAVOAKEBEDNX7","download_json":"https://pith.science/pith/TATY6Z4XZWU3UIAVOAKEBEDNX7.json","view_paper":"https://pith.science/paper/TATY6Z4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07489&json=true","fetch_graph":"https://pith.science/api/pith-number/TATY6Z4XZWU3UIAVOAKEBEDNX7/graph.json","fetch_events":"https://pith.science/api/pith-number/TATY6Z4XZWU3UIAVOAKEBEDNX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TATY6Z4XZWU3UIAVOAKEBEDNX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TATY6Z4XZWU3UIAVOAKEBEDNX7/action/storage_attestation","attest_author":"https://pith.science/pith/TATY6Z4XZWU3UIAVOAKEBEDNX7/action/author_attestation","sign_citation":"https://pith.science/pith/TATY6Z4XZWU3UIAVOAKEBEDNX7/action/citation_signature","submit_replication":"https://pith.science/pith/TATY6Z4XZWU3UIAVOAKEBEDNX7/action/replication_record"}},"created_at":"2026-05-17T23:57:59.373037+00:00","updated_at":"2026-05-17T23:57:59.373037+00:00"}