{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:A2BT5YV5JSD7RR54ZV4VBFD4XK","short_pith_number":"pith:A2BT5YV5","schema_version":"1.0","canonical_sha256":"06833ee2bd4c87f8c7bccd7950947cba8348a32f53ba05cfea257d8a20d9e404","source":{"kind":"arxiv","id":"1012.1042","version":8},"attestation_state":"computed","paper":{"title":"Accelerated Monte Carlo estimation of failure probabilities in output of monotone computer codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Nicolas Bousquet","submitted_at":"2010-12-05T21:57:08Z","abstract_excerpt":"The problem of estimating the probability p=P(g(X<0) is considered when X represents a multivariate stochastic input of a monotone function g. First, a heuristic method to bound p is formally described, involving a specialized design of numerical experiments. Then a statistical estimation of p is considered based on a sequential stochastic exploration of the input space. A maximum likelihood estimator of p based on successive dependent Bernoulli data is defined and its theoretical convergence properties are studied. Under intuitive or mild conditions, the estimation is faster and more robust t"},"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":"1012.1042","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-12-05T21:57:08Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"973d8378c45fbd0d76522797954d8e10918b2b343c1c35b87c71cb6aaeacf0b7","abstract_canon_sha256":"6bab419af5173da33b73178a9606fb0c198211626f437bab51019758ac551e38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:15.673168Z","signature_b64":"2N6cxyzCFvEH/6AlAytnq+HppEaFTbt2pIj+vkZpTIwa6oZfennp6gwlaq4Xz6A98U6ywVuqSc94WHMBlZmGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06833ee2bd4c87f8c7bccd7950947cba8348a32f53ba05cfea257d8a20d9e404","last_reissued_at":"2026-05-18T02:23:15.672470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:15.672470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Monte Carlo estimation of failure probabilities in output of monotone computer codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Nicolas Bousquet","submitted_at":"2010-12-05T21:57:08Z","abstract_excerpt":"The problem of estimating the probability p=P(g(X<0) is considered when X represents a multivariate stochastic input of a monotone function g. First, a heuristic method to bound p is formally described, involving a specialized design of numerical experiments. Then a statistical estimation of p is considered based on a sequential stochastic exploration of the input space. A maximum likelihood estimator of p based on successive dependent Bernoulli data is defined and its theoretical convergence properties are studied. Under intuitive or mild conditions, the estimation is faster and more robust t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1042","kind":"arxiv","version":8},"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":"1012.1042","created_at":"2026-05-18T02:23:15.672576+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1042v8","created_at":"2026-05-18T02:23:15.672576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1042","created_at":"2026-05-18T02:23:15.672576+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2BT5YV5JSD7","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2BT5YV5JSD7RR54","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2BT5YV5","created_at":"2026-05-18T12:26:05.355336+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/A2BT5YV5JSD7RR54ZV4VBFD4XK","json":"https://pith.science/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK.json","graph_json":"https://pith.science/api/pith-number/A2BT5YV5JSD7RR54ZV4VBFD4XK/graph.json","events_json":"https://pith.science/api/pith-number/A2BT5YV5JSD7RR54ZV4VBFD4XK/events.json","paper":"https://pith.science/paper/A2BT5YV5"},"agent_actions":{"view_html":"https://pith.science/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK","download_json":"https://pith.science/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK.json","view_paper":"https://pith.science/paper/A2BT5YV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1042&json=true","fetch_graph":"https://pith.science/api/pith-number/A2BT5YV5JSD7RR54ZV4VBFD4XK/graph.json","fetch_events":"https://pith.science/api/pith-number/A2BT5YV5JSD7RR54ZV4VBFD4XK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK/action/storage_attestation","attest_author":"https://pith.science/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK/action/author_attestation","sign_citation":"https://pith.science/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK/action/citation_signature","submit_replication":"https://pith.science/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK/action/replication_record"}},"created_at":"2026-05-18T02:23:15.672576+00:00","updated_at":"2026-05-18T02:23:15.672576+00:00"}