{"id":"W2951501645","doi":"10.48550/arxiv.1511.02273","title":"The expected bit complexity of the von Neumann rejection algorithm","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Infimum and supremum; Random variate; Mathematics; Von Neumann architecture; Rectangle; Oracle; Extension (predicate logic); Discrete mathematics; Algorithm; Function (biology); Quadtree; Bit (key); Random function; Computer science; Pure mathematics; Random variable","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005836706,0.0006048523,0.001079065,0.0007969391,0.0009373208,0.003319112,0.002552459,0.001935671,0.006330808],"category_scores_gemma":[0.04569265,0.0006180745,0.0008729721,0.0009777569,0.003036709,0.007321112,0.002523244,0.002908783,0.001086533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002425365,"about_ca_system_score_gemma":0.002197864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000927461,"about_ca_topic_score_gemma":0.0006541131,"domain_scores_codex":[0.9937238,0.002545343,0.0003305656,0.0008652517,0.001756869,0.000778248],"domain_scores_gemma":[0.9653531,0.02758302,0.001188635,0.003813883,0.00152798,0.0005332474],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001123948,0.0001295426,0.002967724,0.0002571881,0.00007739804,0.0001637876,0.0002817955,0.2135064,0.008463036,0.7207759,0.003800736,0.04845262],"study_design_scores_gemma":[0.00006322478,0.00006086463,0.0003091433,0.00002942859,0.00001880181,0.00007301423,0.00001819417,0.6846702,0.00415779,0.3095172,0.00105536,0.00002683452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1588024,0.0006228764,0.8210526,0.00270787,0.00008915797,0.0001853981,0.0005006819,0.0009365488,0.01510248],"genre_scores_gemma":[0.7953221,0.000481068,0.1957312,0.0005330722,0.0001676993,0.0005416865,0.0006218239,0.0004484682,0.006152933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006330808,"threshold_uncertainty_score":0.03086782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2744333413684254,"score_gpt":0.2682303999394957,"score_spread":0.006202941428929742,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}