{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:A2BT5YV5JSD7RR54ZV4VBFD4XK","short_pith_number":"pith:A2BT5YV5","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"},"canonical_sha256":"06833ee2bd4c87f8c7bccd7950947cba8348a32f53ba05cfea257d8a20d9e404","source":{"kind":"arxiv","id":"1012.1042","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.1042","created_at":"2026-05-18T02:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"1012.1042v8","created_at":"2026-05-18T02:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1042","created_at":"2026-05-18T02:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"A2BT5YV5JSD7","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"A2BT5YV5JSD7RR54","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"A2BT5YV5","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:A2BT5YV5JSD7RR54ZV4VBFD4XK","target":"record","payload":{"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"},"canonical_sha256":"06833ee2bd4c87f8c7bccd7950947cba8348a32f53ba05cfea257d8a20d9e404","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"},"source_kind":"arxiv","source_id":"1012.1042","source_version":8,"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:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BgJIWEB1sNKf80UfyOwLn0RGIx6ifZQgxcFmlY0PfZp/67f3eNxZAlWCRuTZhEjb9rD0RNqGAyuEwG0ez5nsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:21:40.173915Z"},"content_sha256":"ec4cdd81f91f826fcb445d04210edda7518bff313596a5988712c673020531a2","schema_version":"1.0","event_id":"sha256:ec4cdd81f91f826fcb445d04210edda7518bff313596a5988712c673020531a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:A2BT5YV5JSD7RR54ZV4VBFD4XK","target":"graph","payload":{"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"},"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:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BEqxzLJQz9Nv/S8IHXVWqK7aRY/mXbQ4FeunGLfZzhc8Vof1KuVn7eXosJRf5tw9mSRnOtz1jUGq+ugUpOL9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:21:40.174591Z"},"content_sha256":"f3858c6ede5bfe222886c6382ec133ac24c63b0b29d7fa594f57fea2791f47b9","schema_version":"1.0","event_id":"sha256:f3858c6ede5bfe222886c6382ec133ac24c63b0b29d7fa594f57fea2791f47b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK/bundle.json","state_url":"https://pith.science/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK/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-05-26T20:21:40Z","links":{"resolver":"https://pith.science/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK","bundle":"https://pith.science/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK/bundle.json","state":"https://pith.science/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2BT5YV5JSD7RR54ZV4VBFD4XK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:A2BT5YV5JSD7RR54ZV4VBFD4XK","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":"6bab419af5173da33b73178a9606fb0c198211626f437bab51019758ac551e38","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-12-05T21:57:08Z","title_canon_sha256":"973d8378c45fbd0d76522797954d8e10918b2b343c1c35b87c71cb6aaeacf0b7"},"schema_version":"1.0","source":{"id":"1012.1042","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.1042","created_at":"2026-05-18T02:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"1012.1042v8","created_at":"2026-05-18T02:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1042","created_at":"2026-05-18T02:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"A2BT5YV5JSD7","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"A2BT5YV5JSD7RR54","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"A2BT5YV5","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:f3858c6ede5bfe222886c6382ec133ac24c63b0b29d7fa594f57fea2791f47b9","target":"graph","created_at":"2026-05-18T02:23:15Z","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":"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","authors_text":"Nicolas Bousquet","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-12-05T21:57:08Z","title":"Accelerated Monte Carlo estimation of failure probabilities in output of monotone computer codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1042","kind":"arxiv","version":8},"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:ec4cdd81f91f826fcb445d04210edda7518bff313596a5988712c673020531a2","target":"record","created_at":"2026-05-18T02:23:15Z","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":"6bab419af5173da33b73178a9606fb0c198211626f437bab51019758ac551e38","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-12-05T21:57:08Z","title_canon_sha256":"973d8378c45fbd0d76522797954d8e10918b2b343c1c35b87c71cb6aaeacf0b7"},"schema_version":"1.0","source":{"id":"1012.1042","kind":"arxiv","version":8}},"canonical_sha256":"06833ee2bd4c87f8c7bccd7950947cba8348a32f53ba05cfea257d8a20d9e404","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06833ee2bd4c87f8c7bccd7950947cba8348a32f53ba05cfea257d8a20d9e404","first_computed_at":"2026-05-18T02:23:15.672470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:15.672470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2N6cxyzCFvEH/6AlAytnq+HppEaFTbt2pIj+vkZpTIwa6oZfennp6gwlaq4Xz6A98U6ywVuqSc94WHMBlZmGBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:15.673168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.1042","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec4cdd81f91f826fcb445d04210edda7518bff313596a5988712c673020531a2","sha256:f3858c6ede5bfe222886c6382ec133ac24c63b0b29d7fa594f57fea2791f47b9"],"state_sha256":"66220b9c66a836c3da101ebb9050b47a8c3d44867d62c426eac978ad413c13e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+j94PKdjNNSSScQV9HTzf4FQTM3F/oZJ2HfSRtZs+IgLVnp+kfPMX933ZUx9twGEeLjjnybzKWkquBbzOZtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:21:40.179297Z","bundle_sha256":"b131ab41b00612331611c617c69db30799624ee0aa085b81743fdca5abb63e3e"}}