{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070858,0.0002902605,0.0004203024,0.00009420813,0.0003127198,0.00003952966,0.0009883209,0.0003011099,0.00001236794],"category_scores_gemma":[0.0004331034,0.0002015945,0.0003752594,0.0004148691,0.0004830675,0.00005713837,0.001293145,0.0006957556,3.856509e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002665231,"about_ca_system_score_gemma":0.0001857035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003927583,"about_ca_topic_score_gemma":0.0004853224,"domain_scores_codex":[0.9979818,0.0007546474,0.0003130628,0.0005119918,0.0001654897,0.0002730251],"domain_scores_gemma":[0.9968306,0.000418704,0.0006120656,0.001545878,0.0004932621,0.00009952705],"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.0004693663,0.000732904,0.00209548,0.0008332503,0.001179165,0.0001009801,0.003795216,0.007136532,0.000480335,0.9391177,0.03334027,0.01071885],"study_design_scores_gemma":[0.001217332,0.0001217478,0.0008335194,0.0003415434,0.0005747777,0.00001207196,0.002685209,0.1801822,0.001128299,0.803322,0.008818411,0.0007628429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7707485,0.0002466278,0.1985557,0.0003458602,0.003785262,0.00156553,0.0001492465,0.0002909142,0.02431236],"genre_scores_gemma":[0.9829555,0.0001799732,0.005670199,0.00002831773,0.0002115684,0.000003059405,0.00001441919,0.00004860753,0.01088831],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2122071,"threshold_uncertainty_score":0.8220785,"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."}}