{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VOMVBNO4IXARBGBEBER4GYR6DL","short_pith_number":"pith:VOMVBNO4","schema_version":"1.0","canonical_sha256":"ab9950b5dc45c11098240923c3623e1af347b0b7f0b2f25675f086c941e7d4dd","source":{"kind":"arxiv","id":"1508.05634","version":1},"attestation_state":"computed","paper":{"title":"Complexity of Anticipated Rejection Algorithms and the Darling-Mandelbrot Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Andrea Sportiello, Axel Bacher","submitted_at":"2015-08-23T18:14:03Z","abstract_excerpt":"We study in limit law the complexity of some anticipated rejection random sampling algorithms. We express this complexity in terms of a probabilistic process, the threshold sum process. We show that, under the right conditions, the complexity is linear and admits as a limit law a so-called Darling-Mandelbrot distribution, studied by Darling (Trans Am Math Soc 73:95-107, 1952) and Lew (Constr Approx 10(1):15-30, 1994). We also give an explicit form to the density of the Darling-Mandelbrot distribution and derive some of its analytic properties."},"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":"1508.05634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-23T18:14:03Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"8f785f9ae3d04a725ec4e4fa6cfabb23612a5b95e60461ef130ae37cf964870a","abstract_canon_sha256":"5668b5e4e6214cd882c13f7594f7af80c63f329183f660adfbbf686119ac5fb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:52.047387Z","signature_b64":"DrFY6nk2SVc8H3CoNrsN7iiVwFIrucxCo7svLPez5vanZFZZGHoU46FC6o0n4/Nn3kHv3Xtpo2WyzMZRlUV9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab9950b5dc45c11098240923c3623e1af347b0b7f0b2f25675f086c941e7d4dd","last_reissued_at":"2026-05-18T01:34:52.046841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:52.046841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Anticipated Rejection Algorithms and the Darling-Mandelbrot Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Andrea Sportiello, Axel Bacher","submitted_at":"2015-08-23T18:14:03Z","abstract_excerpt":"We study in limit law the complexity of some anticipated rejection random sampling algorithms. We express this complexity in terms of a probabilistic process, the threshold sum process. We show that, under the right conditions, the complexity is linear and admits as a limit law a so-called Darling-Mandelbrot distribution, studied by Darling (Trans Am Math Soc 73:95-107, 1952) and Lew (Constr Approx 10(1):15-30, 1994). We also give an explicit form to the density of the Darling-Mandelbrot distribution and derive some of its analytic properties."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05634","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":"1508.05634","created_at":"2026-05-18T01:34:52.046916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05634v1","created_at":"2026-05-18T01:34:52.046916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05634","created_at":"2026-05-18T01:34:52.046916+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOMVBNO4IXAR","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOMVBNO4IXARBGBE","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOMVBNO4","created_at":"2026-05-18T12:29:47.479230+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/VOMVBNO4IXARBGBEBER4GYR6DL","json":"https://pith.science/pith/VOMVBNO4IXARBGBEBER4GYR6DL.json","graph_json":"https://pith.science/api/pith-number/VOMVBNO4IXARBGBEBER4GYR6DL/graph.json","events_json":"https://pith.science/api/pith-number/VOMVBNO4IXARBGBEBER4GYR6DL/events.json","paper":"https://pith.science/paper/VOMVBNO4"},"agent_actions":{"view_html":"https://pith.science/pith/VOMVBNO4IXARBGBEBER4GYR6DL","download_json":"https://pith.science/pith/VOMVBNO4IXARBGBEBER4GYR6DL.json","view_paper":"https://pith.science/paper/VOMVBNO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05634&json=true","fetch_graph":"https://pith.science/api/pith-number/VOMVBNO4IXARBGBEBER4GYR6DL/graph.json","fetch_events":"https://pith.science/api/pith-number/VOMVBNO4IXARBGBEBER4GYR6DL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOMVBNO4IXARBGBEBER4GYR6DL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOMVBNO4IXARBGBEBER4GYR6DL/action/storage_attestation","attest_author":"https://pith.science/pith/VOMVBNO4IXARBGBEBER4GYR6DL/action/author_attestation","sign_citation":"https://pith.science/pith/VOMVBNO4IXARBGBEBER4GYR6DL/action/citation_signature","submit_replication":"https://pith.science/pith/VOMVBNO4IXARBGBEBER4GYR6DL/action/replication_record"}},"created_at":"2026-05-18T01:34:52.046916+00:00","updated_at":"2026-05-18T01:34:52.046916+00:00"}