{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2DOUDBLRZF5TNNHPR3E2ZP322A","short_pith_number":"pith:2DOUDBLR","schema_version":"1.0","canonical_sha256":"d0dd418571c97b36b4ef8ec9acbf7ad00555c5eb19a0e90b7ed1d366bbc821ac","source":{"kind":"arxiv","id":"1502.06780","version":1},"attestation_state":"computed","paper":{"title":"Large deviations principle for the Adaptive Multilevel Splitting Algorithm in an idealized setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Charles-Edouard Br\\'ehier","submitted_at":"2015-02-24T12:21:02Z","abstract_excerpt":"The Adaptive Multilevel Splitting (AMS) algorithm is a powerful and versatile method for the simulation of rare events. It is based on an interacting (via a mutation-selection procedure) system of replicas, and depends on two integer parameters: n $\\in$ N * the size of the system and the number k $\\in$ {1, . . . , n -- 1} of the replicas that are eliminated and resampled at each iteration. In an idealized setting, we analyze the performance of this algorithm in terms of a Large Deviations Principle when n goes to infinity, for the estimation of the (small) probability P(X \\textgreater{} a) whe"},"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":"1502.06780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-02-24T12:21:02Z","cross_cats_sorted":[],"title_canon_sha256":"a33dd294bed42a1d0029509e6c3287c9f5030e49acca8034c5829b506674840c","abstract_canon_sha256":"a9061b491ba5588b8674473d7ab940e88fe93b9f87a2b4ead18339eb77d8f21e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:28.656454Z","signature_b64":"vdXJxT+Zt8jKsXf6w82JO9ujd5HFLggoAJotiBog7NNlu+8KG4TZhLjRgG9qkaznRlHnVlZwhQhCIW+4cX2aBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0dd418571c97b36b4ef8ec9acbf7ad00555c5eb19a0e90b7ed1d366bbc821ac","last_reissued_at":"2026-05-18T02:26:28.655449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:28.655449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large deviations principle for the Adaptive Multilevel Splitting Algorithm in an idealized setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Charles-Edouard Br\\'ehier","submitted_at":"2015-02-24T12:21:02Z","abstract_excerpt":"The Adaptive Multilevel Splitting (AMS) algorithm is a powerful and versatile method for the simulation of rare events. It is based on an interacting (via a mutation-selection procedure) system of replicas, and depends on two integer parameters: n $\\in$ N * the size of the system and the number k $\\in$ {1, . . . , n -- 1} of the replicas that are eliminated and resampled at each iteration. In an idealized setting, we analyze the performance of this algorithm in terms of a Large Deviations Principle when n goes to infinity, for the estimation of the (small) probability P(X \\textgreater{} a) whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06780","kind":"arxiv","version":1},"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":"1502.06780","created_at":"2026-05-18T02:26:28.655560+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.06780v1","created_at":"2026-05-18T02:26:28.655560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06780","created_at":"2026-05-18T02:26:28.655560+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DOUDBLRZF5T","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DOUDBLRZF5TNNHP","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DOUDBLR","created_at":"2026-05-18T12:28:59.999130+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/2DOUDBLRZF5TNNHPR3E2ZP322A","json":"https://pith.science/pith/2DOUDBLRZF5TNNHPR3E2ZP322A.json","graph_json":"https://pith.science/api/pith-number/2DOUDBLRZF5TNNHPR3E2ZP322A/graph.json","events_json":"https://pith.science/api/pith-number/2DOUDBLRZF5TNNHPR3E2ZP322A/events.json","paper":"https://pith.science/paper/2DOUDBLR"},"agent_actions":{"view_html":"https://pith.science/pith/2DOUDBLRZF5TNNHPR3E2ZP322A","download_json":"https://pith.science/pith/2DOUDBLRZF5TNNHPR3E2ZP322A.json","view_paper":"https://pith.science/paper/2DOUDBLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.06780&json=true","fetch_graph":"https://pith.science/api/pith-number/2DOUDBLRZF5TNNHPR3E2ZP322A/graph.json","fetch_events":"https://pith.science/api/pith-number/2DOUDBLRZF5TNNHPR3E2ZP322A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DOUDBLRZF5TNNHPR3E2ZP322A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DOUDBLRZF5TNNHPR3E2ZP322A/action/storage_attestation","attest_author":"https://pith.science/pith/2DOUDBLRZF5TNNHPR3E2ZP322A/action/author_attestation","sign_citation":"https://pith.science/pith/2DOUDBLRZF5TNNHPR3E2ZP322A/action/citation_signature","submit_replication":"https://pith.science/pith/2DOUDBLRZF5TNNHPR3E2ZP322A/action/replication_record"}},"created_at":"2026-05-18T02:26:28.655560+00:00","updated_at":"2026-05-18T02:26:28.655560+00:00"}