{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":102,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":102,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"b413ce38b3ec","filters":{"venue":"Statistics and Computing"}},"results":[{"id":"W1513873506","doi":"10.1023/a:1008923215028","title":"Annealed importance sampling","year":2001,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":1225,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Mathematics; Sampling (signal processing); Markov chain Monte Carlo; Simulated annealing; Applied mathematics; Slice sampling; Autocorrelation; Markov chain mixing time; Sequence (biology); Mathematical optimization; Algorithm; Variable-order Markov model; Statistical physics; Statistics; Computer science; Markov model; Bayesian probability; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.02817825423091845,"gpt":0.3042159619191862,"spread":0.2760377076882677,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003037114,0.00009698753,0.0001309866,0.00003449643,0.0001832662,0.0001472421,0.0002106573,0.00002851691,0.000004811731],"category_scores_gemma":[0.00003831325,0.00009142861,0.00001543042,0.0001453439,0.00002479811,0.00007832657,0.0001449109,0.00009684648,0.000002790916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008535255,"about_ca_system_score_gemma":0.0000213027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009558441,"about_ca_topic_score_gemma":0.000003839426,"domain_scores_codex":[0.9991692,0.00003501304,0.0001812501,0.0002734818,0.0001038256,0.0002371957],"domain_scores_gemma":[0.9994213,0.0001575674,0.00007391885,0.000207942,0.00005098171,0.00008830702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.534551e-7,0.000007061827,0.001247941,0.000007289827,0.000004352194,0.00003664851,0.0002050173,0.00002086721,0.0000503104,0.5157412,0.0002366218,0.4824417],"study_design_scores_gemma":[0.0002168428,0.00004150359,0.006223345,0.00002389247,0.000005067437,0.0001264454,0.0000117707,0.6799998,0.00002159022,0.3100245,0.003088773,0.0002164663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007272054,0.0002930914,0.9900172,0.000142899,0.0001751459,0.00005219457,0.000004703539,0.00007339964,0.001969357],"genre_scores_gemma":[0.2229621,0.0000436396,0.7765596,0.0002930668,0.00007120952,5.718973e-7,0.00000187093,0.000005272868,0.00006266254],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.679979,"threshold_uncertainty_score":0.3728351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148178414","doi":"10.1007/s11222-007-9028-9","title":"On population-based simulation for static inference","year":2007,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":207,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Markov chain Monte Carlo; Inference; Population; Markov chain; Bayesian inference; Computer science; Monte Carlo method; Sampling (signal processing); Statistics; Algorithm; Bayesian probability; Mathematics; Applied mathematics; Artificial intelligence; Sociology","retraction":null,"screen_n_in":null,"score":{"opus":0.02437224421377677,"gpt":0.3512340842917407,"spread":0.326861840077964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005433388,0.0000869306,0.0001021198,0.0000651029,0.0001650676,0.00009416461,0.000106883,0.00002952984,0.000001146907],"category_scores_gemma":[0.0002690718,0.00008199173,0.00001390915,0.0001048039,0.00001049828,0.00004649907,0.00002721035,0.00005767151,6.615288e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001696098,"about_ca_system_score_gemma":0.00002784102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000153783,"about_ca_topic_score_gemma":0.000005656918,"domain_scores_codex":[0.9992528,0.00002833748,0.0002045547,0.0002113318,0.0001164896,0.0001865162],"domain_scores_gemma":[0.9972296,0.002391302,0.00009390586,0.0001361089,0.00008748206,0.00006155332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006880323,0.000010121,0.0001636079,0.00001884386,0.000002184769,0.000001453897,0.00008389113,0.01953709,0.000005833374,0.6222907,0.00003731276,0.3578421],"study_design_scores_gemma":[0.0002656304,0.00007269792,0.003735252,0.00001761801,0.000002834749,2.684552e-7,0.000001575487,0.7447798,0.00002024291,0.2509853,0.00003954575,0.00007915006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003960921,0.000009452252,0.9954791,0.00005791274,0.0001528126,0.0001721831,0.00001658846,0.0000431609,0.0001078738],"genre_scores_gemma":[0.496882,1.607481e-7,0.5028064,0.0002726085,0.00001914374,7.128949e-7,0.000008473411,0.00000333478,0.000007095207],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7252427,"threshold_uncertainty_score":0.3343526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141954357","doi":"10.1007/s11222-016-9636-3","title":"On optimal multiple changepoint algorithms for large data","year":2016,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":191,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University and Génome Québec Innovation Centre","funders":"Division of Mathematical Sciences; Engineering and Physical Sciences Research Council; Isaac Newton Institute for Mathematical Sciences","keywords":"Dynamic programming; Pruning; Computer science; Algorithm; Quadratic growth; Segmentation; Market segmentation; Mathematical optimization; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04544760114604016,"gpt":0.3237773195000501,"spread":0.27832971835401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001388846,0.00007041523,0.0000610708,0.00001586817,0.00009818561,0.00001759203,0.0001137731,0.00003704236,0.000005581911],"category_scores_gemma":[0.0001403949,0.00005081514,0.00001063447,0.0000167682,0.00001621201,0.000001590249,0.000150696,0.00001956936,0.000001892921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004228289,"about_ca_system_score_gemma":0.00001871785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001629053,"about_ca_topic_score_gemma":0.000004477645,"domain_scores_codex":[0.9993981,0.00001444008,0.00009859628,0.0002886051,0.00005536576,0.0001448554],"domain_scores_gemma":[0.9995376,0.00005446091,0.00005397384,0.000264266,0.0000441619,0.00004557211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001816216,0.0001212204,0.0005841603,0.00004895483,0.000053157,0.000002325389,0.00009511984,0.00003107695,0.2447132,0.01866117,0.09096047,0.6445475],"study_design_scores_gemma":[0.007339788,0.001499548,0.006112367,0.0002026307,0.00004931964,0.00001780377,0.000344491,0.3251132,0.08645383,0.003315699,0.5686367,0.0009146925],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02673674,0.0001198638,0.9716559,0.000157186,0.0001578981,0.000111663,0.0009998144,0.000007010257,0.0000539096],"genre_scores_gemma":[0.949622,0.00006247389,0.0491537,0.0001937503,0.0002445943,0.000007602302,0.0004295645,0.00001262982,0.0002737312],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9228852,"threshold_uncertainty_score":0.2072181,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W194034371","doi":"10.1007/s11222-011-9272-x","title":"Model-based clustering, classification, and discriminant analysis via mixtures of multivariate t-distributions","year":2011,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"University of Washington","keywords":"Cluster analysis; Mixture model; Linear discriminant analysis; Covariance; Mathematics; Pattern recognition (psychology); Artificial intelligence; Multivariate statistics; Multivariate normal distribution; Gaussian; Covariance matrix; Principal component analysis; Statistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04787592351643025,"gpt":0.2987753486290899,"spread":0.2508994251126597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000281157,0.0001115714,0.0002112613,0.0001004898,0.0001602663,0.00004688162,0.0001736848,0.00003993945,0.000001544294],"category_scores_gemma":[0.00003101174,0.00009721716,0.00003414421,0.000235347,0.00008673535,0.00005368568,0.0001394711,0.00007222845,1.261418e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007485261,"about_ca_system_score_gemma":0.00003029948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001215565,"about_ca_topic_score_gemma":0.00002533528,"domain_scores_codex":[0.9991223,0.00007028395,0.0002654757,0.0002866687,0.00009454894,0.0001607754],"domain_scores_gemma":[0.9992904,0.0001006481,0.0001619717,0.0002487998,0.0001150488,0.00008312005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006733356,0.00007357227,0.001006274,0.00006372903,0.000103068,0.000004538189,0.001876089,0.0009209714,0.001538249,0.8451337,0.00003124187,0.1492418],"study_design_scores_gemma":[0.0001296672,0.00002902093,0.0222449,0.00001209793,0.0001097359,0.000002183416,0.000007282641,0.9169793,0.0002577238,0.06011564,0.000004918546,0.0001075465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002729045,0.00007915936,0.996793,0.0000351935,0.00004485125,0.000067148,0.0000632485,0.00002402896,0.0001642744],"genre_scores_gemma":[0.4995837,0.000003887978,0.5003741,0.00001825629,0.000004239608,9.685488e-7,0.000007414913,0.000002468064,0.000004911665],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9160583,"threshold_uncertainty_score":0.3964401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146960149","doi":"10.1007/s11222-010-9192-1","title":"Towards optimal scaling of metropolis-coupled Markov chain Monte Carlo","year":2010,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":139,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Parallel tempering; Metropolis–Hastings algorithm; Markov chain Monte Carlo; Monte Carlo method; Scaling; Markov chain; Random walk; Statistical physics; Mathematics; Mathematical optimization; Work (physics); Hybrid Monte Carlo; Applied mathematics; Computer science; Algorithm; Statistics; Physics; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.02539699512440044,"gpt":0.334028828772443,"spread":0.3086318336480425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001179132,0.0001917432,0.000427356,0.00009333686,0.0001389991,0.0000494276,0.0001493924,0.00009260619,0.00001804696],"category_scores_gemma":[0.0009621762,0.0001754779,0.0000637878,0.000118905,0.0001230866,0.00002707883,0.0001774891,0.0003032557,3.411957e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001440028,"about_ca_system_score_gemma":0.00004848362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002956309,"about_ca_topic_score_gemma":0.00007099527,"domain_scores_codex":[0.9986593,0.00007516014,0.0004616062,0.0002548749,0.0002385191,0.0003106122],"domain_scores_gemma":[0.9984688,0.0006978585,0.0002447778,0.0002614681,0.0002007814,0.0001263051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007270997,0.0001600737,0.001091724,0.0008430083,0.0001881901,0.00005094241,0.003793646,0.0001928948,0.01207285,0.6370547,0.001334443,0.3431448],"study_design_scores_gemma":[0.0008161325,0.000116028,0.0005299135,0.00009578754,0.0001079794,0.00002744705,0.00101084,0.9841341,0.001648177,0.01061511,0.0005098127,0.0003886363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5275712,0.00006421452,0.4707214,0.00002592871,0.0003276041,0.0001123399,0.00007413271,0.00002950737,0.001073734],"genre_scores_gemma":[0.511427,0.000009157909,0.488328,0.00001887835,0.000113981,0.000001365889,0.000002550736,0.00001928781,0.00007983926],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9839413,"threshold_uncertainty_score":0.7155783,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014306350","doi":"10.1007/s11222-010-9175-2","title":"Extending mixtures of multivariate t-factor analyzers","year":2010,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bayesian information criterion; Cluster analysis; Model selection; Multivariate statistics; Curse of dimensionality; Mixture model; Information Criteria; Expectation–maximization algorithm; Mathematics; Computer science; Statistics; Maximum likelihood","retraction":null,"screen_n_in":null,"score":{"opus":0.01289836342498767,"gpt":0.2963991425847564,"spread":0.2835007791597687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002796798,0.0001035924,0.0001716839,0.00006765704,0.0001117188,0.000081256,0.0002555086,0.00004591068,0.000005859259],"category_scores_gemma":[0.00009893282,0.00009006667,0.00002571554,0.0001224136,0.00005270778,0.00006814759,0.0001650793,0.00018494,5.701468e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003131262,"about_ca_system_score_gemma":0.00002595619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004082179,"about_ca_topic_score_gemma":0.000005700022,"domain_scores_codex":[0.9991943,0.0000473041,0.0002088611,0.0002393771,0.0001225555,0.000187605],"domain_scores_gemma":[0.9992345,0.0002763735,0.0001296517,0.0002227157,0.00005296512,0.00008376814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001013753,0.0000107999,0.0001993525,0.00001481802,0.00001095094,0.000006620906,0.0004397115,0.000005217829,0.0191437,0.5448049,0.00004479828,0.4353181],"study_design_scores_gemma":[0.0003126677,0.0000549071,0.01141681,0.00003124712,0.00001292989,0.0000249806,0.000009028856,0.8369298,0.00554389,0.1449541,0.0004549629,0.0002546998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02835454,0.00005817916,0.9706005,0.00003922575,0.0004299376,0.00004864431,0.00001512082,0.00003217701,0.0004217135],"genre_scores_gemma":[0.4751455,0.000003469835,0.5247736,0.00002726285,0.00003178213,2.091145e-7,7.949167e-7,0.000003547289,0.00001385813],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8369246,"threshold_uncertainty_score":0.3672812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059147320","doi":"10.1007/s11222-010-9201-4","title":"Efficient Monte Carlo simulation via the generalized splitting method","year":2010,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":119,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Markov chain Monte Carlo; Rejection sampling; Monte Carlo method; Slice sampling; Importance sampling; Algorithm; Sampling (signal processing); Convergence (economics); Computer science; Monte Carlo integration; Hybrid Monte Carlo; Mathematical optimization; Monte Carlo method in statistical physics; Markov chain; Mathematics; Applied mathematics; Statistics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.0669149933626771,"gpt":0.4079838723290267,"spread":0.3410688789663496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004533569,0.00009858784,0.0001717062,0.0000455333,0.0006000167,0.0002720435,0.0002596058,0.00004778062,0.00002060121],"category_scores_gemma":[0.001701433,0.00005738566,0.00003790734,0.0001928823,0.00009664309,0.00002418589,0.0001877032,0.0002344592,0.000008532203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007289828,"about_ca_system_score_gemma":0.00002716803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001498745,"about_ca_topic_score_gemma":0.00006569641,"domain_scores_codex":[0.998275,0.0002434081,0.0004508208,0.0003295729,0.0005009165,0.0002003093],"domain_scores_gemma":[0.9949422,0.004209527,0.0001980522,0.0003286069,0.0002537085,0.00006790551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004794205,0.000009918691,0.0004596673,0.000002349044,0.000004028933,0.000001071619,0.0009919206,0.7165545,0.0002241104,0.02153223,0.00004146804,0.2601739],"study_design_scores_gemma":[0.0001330253,0.00001164534,0.002910609,0.000003179153,0.000008355833,0.000003747177,0.00009414474,0.9159015,0.00002302599,0.08025339,0.0005810817,0.00007627077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3862831,0.00003160165,0.6130626,0.0001224525,0.0002799272,0.00008925606,0.00001483762,0.00001359011,0.0001026795],"genre_scores_gemma":[0.7471059,6.437327e-7,0.2526458,0.00009718202,0.00009377221,7.775061e-7,6.26828e-7,0.000004575303,0.00005072661],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3608228,"threshold_uncertainty_score":0.4614904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050627451","doi":"10.1007/s11222-006-8451-7","title":"Practical Bayesian estimation of a finite beta mixture through gibbs sampling and its applications","year":2006,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Gibbs sampling; Posterior probability; Mixture model; Estimator; Histogram; Bayesian probability; Artificial intelligence; Beta distribution; Pattern recognition (psychology); Mathematics; Computer science; Sampling (signal processing); Conditional probability distribution; Statistics; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.02906756747162057,"gpt":0.333769758462675,"spread":0.3047021909910544,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002570776,0.0001117214,0.0001698613,0.00003754934,0.0001834084,0.0001105036,0.0001086681,0.00005498102,0.000001211947],"category_scores_gemma":[0.00006398759,0.0001072426,0.00001574926,0.000158219,0.0000422574,0.0001452108,0.0001311931,0.0001237018,6.02352e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006478454,"about_ca_system_score_gemma":0.00004024402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000298823,"about_ca_topic_score_gemma":0.0000035604,"domain_scores_codex":[0.9990912,0.00005890342,0.0002703802,0.0002815413,0.0001300627,0.0001678826],"domain_scores_gemma":[0.9987881,0.0007539222,0.0001608381,0.0001625845,0.00008732847,0.0000472563],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001049139,0.00002029768,0.00002755808,0.00005274521,0.000006432906,0.000002273517,0.0001915144,0.0004825162,0.00008987442,0.8747104,0.00007232679,0.124343],"study_design_scores_gemma":[0.0001104302,0.0000244131,0.0004496107,0.00002427226,0.00001486679,0.00002275691,0.000005676688,0.7312534,0.0001708637,0.2674717,0.0003549151,0.00009703719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003585105,0.0003375218,0.9981812,0.0003675786,0.00004352867,0.000159698,0.00003196905,0.00003480943,0.0004851496],"genre_scores_gemma":[0.312583,0.00001804495,0.6872697,0.00005650343,0.00004346935,0.000002916571,0.000009432907,0.000005235762,0.00001166876],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7307709,"threshold_uncertainty_score":0.4373228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160327809","doi":"10.1007/s11222-007-9037-8","title":"Particle methods for maximum likelihood estimation in latent variable models","year":2007,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Expectation–maximization algorithm; Latent variable; Monte Carlo method; Maximum likelihood sequence estimation; Latent variable model; Markov chain Monte Carlo; Particle filter; Maximum likelihood; Mathematics; Algorithm; Computer science; Estimation theory; Likelihood function; Statistics; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.02673516853381572,"gpt":0.3430897622378254,"spread":0.3163545937040096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00313184,0.0001033284,0.0001636325,0.00005384159,0.0001142734,0.0001141925,0.00016025,0.00004704346,8.361919e-7],"category_scores_gemma":[0.00009461955,0.000100509,0.0000166832,0.0001990901,0.00001711623,0.0001430795,0.000117096,0.00008881458,4.699396e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002353942,"about_ca_system_score_gemma":0.00003472497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000336997,"about_ca_topic_score_gemma":0.000005718068,"domain_scores_codex":[0.9988686,0.00009446996,0.0003035949,0.000283846,0.00008138538,0.0003681094],"domain_scores_gemma":[0.9988465,0.0007417419,0.00007968656,0.0001672042,0.00007243481,0.00009239038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002723326,0.00001468242,0.00001779875,0.00001508136,0.000002906542,0.000001941119,0.0003104236,0.001325136,0.0001215001,0.4549484,0.00001369469,0.5432257],"study_design_scores_gemma":[0.0001702929,0.00002680446,0.0001114757,0.00001231947,0.000003236698,0.000003808459,0.0000044274,0.5239567,0.0002442715,0.4753635,0.00003591746,0.00006723077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004344648,0.0002094116,0.9985854,0.00007499186,0.0001880346,0.0001905671,0.000005747073,0.00004269891,0.0002686699],"genre_scores_gemma":[0.1002617,0.000006363803,0.8995356,0.0001478345,0.00002240471,0.000003601238,0.000002954965,0.000007887227,0.00001169373],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5431585,"threshold_uncertainty_score":0.4098637,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987302087","doi":"10.1007/s11222-006-9009-4","title":"Acceleration of the Multiple-Try Metropolis algorithm using antithetic and stratified sampling","year":2007,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Stratified sampling; Metropolis–Hastings algorithm; Rejection sampling; Acceleration; Algorithm; Sampling (signal processing); Monte Carlo method; Mathematics; Gaussian; Set (abstract data type); Computer science; Extension (predicate logic); Markov chain Monte Carlo; Mathematical optimization; Statistics; Hybrid Monte Carlo","retraction":null,"screen_n_in":null,"score":{"opus":0.08714820365819681,"gpt":0.3653813848639381,"spread":0.2782331812057413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000484622,0.00009092969,0.000153885,0.00004093512,0.0001853998,0.00005766984,0.00004969709,0.00004067577,0.00001053107],"category_scores_gemma":[0.0004430893,0.00006422849,0.00001867897,0.000098073,0.00007941796,0.00004248353,0.00004864795,0.00009401132,1.922398e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001465836,"about_ca_system_score_gemma":0.00001507267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003176606,"about_ca_topic_score_gemma":0.00002155315,"domain_scores_codex":[0.9991954,0.00003269935,0.000374898,0.0001154181,0.0001595649,0.0001220307],"domain_scores_gemma":[0.9988821,0.0006720899,0.0002031411,0.00009986652,0.0001068469,0.00003597495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004764076,0.0000530305,0.0005548321,0.000249984,0.00002007663,4.819107e-7,0.001140155,0.00001318208,0.003802479,0.9139354,0.00002754607,0.08019804],"study_design_scores_gemma":[0.0002154256,0.00002345726,0.001756224,0.00009832107,0.00003124203,0.00001004702,0.0007687298,0.7709197,0.003870622,0.2222019,0.00001212277,0.00009215762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3191681,0.00001437669,0.6804137,0.00001141353,0.00004599562,0.000115003,0.00001607012,0.00001002604,0.0002053851],"genre_scores_gemma":[0.5051946,0.000001935159,0.4947469,0.0000139334,0.00002328212,2.219461e-7,0.000002330032,0.000005713116,0.0000110764],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7709066,"threshold_uncertainty_score":0.2619162,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001848173","doi":"10.1007/s11222-011-9308-2","title":"Markov chain importance sampling with applications to rare event probability estimation","year":2011,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Markov chain Monte Carlo; Rejection sampling; Monte Carlo method; Rare events; Markov chain; Slice sampling; Importance sampling; Computer science; Sampling (signal processing); Hybrid Monte Carlo; Metropolis–Hastings algorithm; Algorithm; Event (particle physics); Markov chain mixing time; Mathematics; Mathematical optimization; Markov model; Markov property; Statistics; Machine learning; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.1278202200407663,"gpt":0.3684812816761235,"spread":0.2406610616353572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001581346,0.0001066104,0.0001738482,0.000058421,0.0003085738,0.0001021782,0.0002235851,0.00003073853,0.00003086502],"category_scores_gemma":[0.0003734553,0.00007668169,0.00001751835,0.0003055487,0.00008125111,0.00007729079,0.0001253219,0.00008971571,0.00001275741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002813001,"about_ca_system_score_gemma":0.00005957556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004518301,"about_ca_topic_score_gemma":0.0001081356,"domain_scores_codex":[0.9984442,0.00006561918,0.0004557718,0.0004576906,0.000382055,0.0001946508],"domain_scores_gemma":[0.9985812,0.0004775818,0.0001780619,0.0003718181,0.0002625366,0.0001287727],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005244327,0.0001131104,0.04412161,0.00004589758,0.00001164018,0.000002742551,0.003576604,0.01211258,0.00001349779,0.2179535,0.0001684613,0.7218279],"study_design_scores_gemma":[0.0001243552,0.00009116449,0.06354837,0.00002686606,0.00000877093,0.000006587196,0.0002207192,0.2818102,0.00001900839,0.6537486,0.0002385332,0.0001568332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1058799,0.00003080875,0.8929861,0.0001019439,0.00003244686,0.0004724594,0.00006585026,0.00002914373,0.0004014196],"genre_scores_gemma":[0.5403473,0.000001014687,0.4595445,0.00005195451,0.0000135244,0.00001501332,0.000004795246,0.000003690696,0.00001820093],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7216711,"threshold_uncertainty_score":0.3126989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979619742","doi":"10.1007/s11222-012-9373-1","title":"Split Hamiltonian Monte Carlo","year":2013,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Monte Carlo method; Hamiltonian (control theory); Gaussian; Mathematics; Statistical physics; Applied mathematics; Quadratic equation; Hybrid Monte Carlo; Hamiltonian mechanics; Computation; Mathematical optimization; Algorithm; Physics; Markov chain Monte Carlo; Quantum mechanics; Statistics; Phase space; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03487638221484857,"gpt":0.3229034758441773,"spread":0.2880270936293287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003017674,0.000133814,0.000211358,0.00003554089,0.0001457425,0.0001028537,0.00008269768,0.00004440666,0.00003065814],"category_scores_gemma":[0.0002351416,0.0001189151,0.00002721447,0.0000552907,0.00004591866,0.00003228493,0.0001085198,0.0001210098,6.123637e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001510126,"about_ca_system_score_gemma":0.00001508521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002197395,"about_ca_topic_score_gemma":0.00003311995,"domain_scores_codex":[0.9991164,0.0000621013,0.0002444505,0.0001987717,0.0001240314,0.0002542973],"domain_scores_gemma":[0.998997,0.0005080716,0.00009028182,0.0001856251,0.000106205,0.0001127831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004153858,0.00004646242,0.001509895,0.0002576193,0.00005505088,0.00002454279,0.001989952,0.00001861237,0.0002844479,0.499785,0.02592351,0.4701007],"study_design_scores_gemma":[0.001271904,0.0002429206,0.01008053,0.0002479223,0.0001147207,0.00006636616,0.001858957,0.6961021,0.0001559181,0.2702886,0.01849522,0.001074748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4771444,0.0001854237,0.5127135,0.0001383811,0.0002853058,0.0002967179,0.00004620867,0.00008685474,0.009103265],"genre_scores_gemma":[0.4845373,0.00001224948,0.5141945,0.0001135273,0.00009143423,0.000004161339,0.000001697075,0.00001835127,0.001026763],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6960835,"threshold_uncertainty_score":0.4849218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066380414","doi":"10.1007/s11222-010-9204-1","title":"Flexible mixture modeling via the multivariate t distribution with the Box-Cox transformation: an alternative to the skew-t distribution","year":2010,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institutes of Health; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Outlier; Mixture model; Power transform; Cluster analysis; Skewness; Transformation (genetics); Multivariate statistics; Mathematics; Data transformation; Expectation–maximization algorithm; Multivariate normal distribution; Skew; Computer science; Model selection; Algorithm; Data mining; Artificial intelligence; Statistics; Consistency (knowledge bases)","retraction":null,"screen_n_in":null,"score":{"opus":0.01278373676822267,"gpt":0.2756803613818765,"spread":0.2628966246136538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009918873,0.0001692219,0.0001248308,0.00001313865,0.001197483,0.0004688871,0.000599666,0.00004829039,0.000001444217],"category_scores_gemma":[0.00003419575,0.00007790115,0.00002507601,0.0002406765,0.00007591419,0.0002035712,0.0001221987,0.0004399642,0.000001883629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001775761,"about_ca_system_score_gemma":0.00004081225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001820012,"about_ca_topic_score_gemma":0.0001216963,"domain_scores_codex":[0.998777,0.0001814042,0.0002070963,0.0002931635,0.0002612073,0.0002800673],"domain_scores_gemma":[0.9989659,0.0002308397,0.0001025634,0.0004146729,0.0001972963,0.00008873618],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001258406,0.00001838913,0.000004587675,0.000006886364,0.00001777955,0.00000206327,0.005761362,0.008427161,0.0001875969,0.7047727,0.0002228189,0.2805661],"study_design_scores_gemma":[0.0001668858,0.00007350153,0.0002767004,0.0000141299,0.00001795985,0.00002945031,0.00008625595,0.9473038,0.0002911975,0.04999432,0.001610994,0.0001348056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006125862,0.00002695017,0.988108,0.004746877,0.0003081279,0.00035713,0.0002118707,0.00005125836,0.00006394674],"genre_scores_gemma":[0.7446383,0.000003294023,0.254739,0.0003421988,0.0001750526,0.000009421159,0.00007704686,0.000006634616,0.000008983687],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9388766,"threshold_uncertainty_score":0.9210189,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042221696","doi":"10.1007/s11222-008-9051-5","title":"Metropolis–Hastings algorithms with adaptive proposals","year":2008,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Marsden Fund; Royal Society","keywords":"Metropolis–Hastings algorithm; Markov chain Monte Carlo; Rejection sampling; Algorithm; Markov chain; Gibbs sampling; Computer science; Convergence (economics); Sampling (signal processing); Mathematics; Univariate; Monte Carlo method; Mathematical optimization; Artificial intelligence; Hybrid Monte Carlo; Bayesian probability; Machine learning; Statistics; Multivariate statistics; Filter (signal processing)","retraction":null,"screen_n_in":null,"score":{"opus":0.07367654801908341,"gpt":0.3306847149384586,"spread":0.2570081669193752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003448445,0.0001710819,0.000287419,0.00005426895,0.0003066283,0.00003020035,0.00007594837,0.0000395621,0.000006004313],"category_scores_gemma":[0.0002455052,0.0001309395,0.00002189127,0.0001203865,0.0001596192,0.00003158637,0.00008420494,0.000152766,9.479433e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002304364,"about_ca_system_score_gemma":0.00005128267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007264117,"about_ca_topic_score_gemma":0.00001784122,"domain_scores_codex":[0.9989434,0.0000781176,0.0002364416,0.0002513297,0.0002135875,0.0002770579],"domain_scores_gemma":[0.9987751,0.0006583171,0.0001445828,0.0001423931,0.0001719211,0.0001077174],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009672727,0.0001747261,0.00248734,0.0002757079,0.0002114663,0.0004895938,0.005340903,0.00003275068,0.0001818514,0.8032398,0.007786617,0.1796825],"study_design_scores_gemma":[0.005219639,0.003377576,0.002161072,0.0007770792,0.0004409889,0.002098416,0.007246378,0.8164572,0.002040048,0.1520148,0.005505188,0.002661697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06476201,0.00008272879,0.9310781,0.00002204091,0.00007608564,0.0001740084,0.00004925569,0.00006411764,0.003691654],"genre_scores_gemma":[0.2773771,0.00001322241,0.7220798,0.00004680071,0.0001027378,0.00000249508,0.00000346415,0.0000234414,0.0003508755],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8164244,"threshold_uncertainty_score":0.5339559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005218877","doi":"10.1007/s11222-011-9234-3","title":"Smooth functional tempering for nonlinear differential equation models","year":2011,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Statistical Methods and Bayesian Inference","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Simon Fraser University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Applied mathematics; Differential equation; Mathematics; Parallel tempering; Markov chain Monte Carlo; Smoothing; Robustness (evolution); Nonlinear system; Mathematical optimization; Markov chain; Computer science; Population; Convergence (economics); Monte Carlo method; Algorithm; Mathematical analysis; Statistics; Physics; Hybrid Monte Carlo","retraction":null,"screen_n_in":null,"score":{"opus":0.1762751780668598,"gpt":0.3451306417402916,"spread":0.1688554636734318,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001955797,0.0001119234,0.0001699046,0.00003300571,0.0001781729,0.00004227354,0.00005073424,0.00004073617,0.00006678995],"category_scores_gemma":[0.0003358994,0.000101012,0.00002380274,0.00003712872,0.00004568146,0.00003754974,0.00004812171,0.00007652932,0.000001138736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001093331,"about_ca_system_score_gemma":0.00002164258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001575541,"about_ca_topic_score_gemma":0.000002864006,"domain_scores_codex":[0.9992143,0.0000320533,0.000257439,0.0001925527,0.0001166126,0.0001870614],"domain_scores_gemma":[0.998643,0.001005004,0.00009480455,0.00008491168,0.0001092693,0.0000630592],"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.00002070158,0.00003553056,0.00006273538,0.00008490808,0.00001261908,0.000001069911,0.0003234562,0.000004697081,0.00006845059,0.8911359,0.0001198951,0.10813],"study_design_scores_gemma":[0.000170864,0.00004938471,0.00054401,0.00002061963,0.00002063918,0.000001306054,0.00003529416,0.4369629,0.00005636982,0.5620424,0.00001618414,0.00008003557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006708179,0.000008527372,0.9920884,0.000006357882,0.0002098757,0.0001514995,0.0002117739,0.00003679234,0.0005785425],"genre_scores_gemma":[0.2517215,0.000002260837,0.7480929,0.00001610368,0.000112406,0.000005654978,0.00001864044,0.00001320574,0.0000173706],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4369582,"threshold_uncertainty_score":0.411915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071044073","doi":"10.1007/s11222-008-9054-2","title":"Output-sensitive algorithms for Tukey depth and related problems","year":2008,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of New Brunswick","funders":"","keywords":"Algorithm; Outlier; Point (geometry); Value (mathematics); Mathematics; Set (abstract data type); Tukey's range test; Computer science; Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02651983249288943,"gpt":0.2418397095160761,"spread":0.2153198770231866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005760834,0.0001130887,0.0001480274,0.00003861442,0.0001572825,0.00002561802,0.00002721873,0.00004523535,4.909531e-7],"category_scores_gemma":[0.0000257816,0.0001157642,0.00001338103,0.00004459056,0.00005832831,0.00002299877,0.00003235357,0.00008965157,6.991251e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009451354,"about_ca_system_score_gemma":0.000006461504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001940345,"about_ca_topic_score_gemma":0.000003607189,"domain_scores_codex":[0.9994647,0.000009650052,0.0001513999,0.0001459147,0.00005552178,0.0001728099],"domain_scores_gemma":[0.9996254,0.0001665457,0.00003036865,0.00006603505,0.00006284948,0.00004873475],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002130557,0.00006435478,0.002486397,0.0003624576,0.0004437122,0.0003014014,0.009398344,0.023065,0.003914594,0.03233004,0.0281877,0.8994247],"study_design_scores_gemma":[0.0002774849,0.0000686955,0.004878132,0.00007269443,0.00001788325,0.0001531469,0.00005224866,0.9863747,0.0009624946,0.006124471,0.0008202849,0.0001977128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09457297,0.0004004138,0.9031295,0.0000147531,0.0001561753,0.0001997062,0.00004260824,0.0003274006,0.001156468],"genre_scores_gemma":[0.8685849,0.0001354705,0.1311283,0.00002551523,0.00004081177,0.000001973786,0.0000162741,0.00002228039,0.0000444606],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9633098,"threshold_uncertainty_score":0.4720725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2621140902","doi":"10.1007/s11222-017-9758-2","title":"Supervised functional principal component analysis","year":2017,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Functional principal component analysis; Principal component analysis; Functional data analysis; Computer science; Independent component analysis; Regression analysis; Regression; Artificial intelligence; Variable (mathematics); Principal component regression; Pattern recognition (psychology); Linear regression; Component (thermodynamics); Machine learning; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02890103905285795,"gpt":0.294458014746836,"spread":0.265556975693978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008297245,0.0001107751,0.0002265474,0.00007698051,0.0007216146,0.0002082298,0.0001531422,0.00004035106,0.0008129934],"category_scores_gemma":[0.00008454977,0.0001069355,0.00005830891,0.00009644785,0.0000930938,0.00003198324,0.000146977,0.0001139688,0.000006591989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002238996,"about_ca_system_score_gemma":0.00001759083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000139107,"about_ca_topic_score_gemma":0.00002074733,"domain_scores_codex":[0.9992319,0.000005369786,0.0001765522,0.0002329336,0.0001658628,0.0001873336],"domain_scores_gemma":[0.9993123,0.0001106537,0.0001451288,0.0002863563,0.00006132762,0.00008426726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0000670075,0.0002681547,0.8896593,0.0002568217,0.00417467,0.00007860962,0.0004107948,0.001251873,0.01385881,0.0516281,0.001457936,0.03688794],"study_design_scores_gemma":[0.001021205,0.00002913917,0.5449036,0.0000161052,0.002464107,0.00001113297,0.0003255229,0.4412401,0.005890371,0.002353092,0.001224168,0.0005213973],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.752703,0.000172821,0.2364208,0.0000678353,0.00006907814,0.00001825354,0.0001257577,0.00004017554,0.0103823],"genre_scores_gemma":[0.9899752,0.00001844348,0.009146119,0.000032146,0.0001290014,8.2977e-7,0.00008500245,0.000007411396,0.0006058428],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4399882,"threshold_uncertainty_score":0.8901708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113328396","doi":"10.1007/s11222-011-9301-9","title":"Interacting multiple try algorithms with different proposal distributions","year":2011,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain Monte Carlo; Exploit; Extension (predicate logic); Monte Carlo method; Markov chain; Class (philosophy); Population; Selection (genetic algorithm)","retraction":null,"screen_n_in":null,"score":{"opus":0.06591323379604168,"gpt":0.3268388600126755,"spread":0.2609256262166338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002136522,0.0001466848,0.000201966,0.00002840552,0.0002076408,0.00004287645,0.00006855079,0.00003287741,0.0000103806],"category_scores_gemma":[0.0003117958,0.0001066059,0.00002201801,0.00005034356,0.00005889548,0.00002870179,0.0001005483,0.0001687171,4.502336e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002055752,"about_ca_system_score_gemma":0.0000209328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004643248,"about_ca_topic_score_gemma":0.00006332197,"domain_scores_codex":[0.9991664,0.00007095529,0.0002267119,0.000200857,0.000109211,0.0002258743],"domain_scores_gemma":[0.9988694,0.0006845937,0.0001324654,0.0001365547,0.00008792902,0.00008911201],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000117333,0.0005099805,0.0224814,0.0004755434,0.0002020041,0.0001290095,0.00939573,0.000003593798,0.0003214742,0.6204279,0.001097676,0.3448384],"study_design_scores_gemma":[0.004599623,0.001531918,0.01854224,0.001225728,0.0004931556,0.0003560335,0.009532029,0.8202724,0.005023808,0.1352389,0.001207897,0.001976279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1837515,0.00001611073,0.8147808,0.00001172989,0.000138319,0.0001344196,0.00009650215,0.00004604902,0.001024614],"genre_scores_gemma":[0.5293062,0.000002241859,0.4705598,0.000006786047,0.00004510851,0.000002994026,0.00001295022,0.00001193782,0.00005204732],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8202688,"threshold_uncertainty_score":0.4347263,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072372110","doi":"10.1007/s11222-011-9248-x","title":"On-line changepoint detection and parameter estimation with application to genomic data","year":2011,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Centre National de la Recherche Scientifique; Pacific Institute for the Mathematical Sciences","keywords":"Computer science; Algorithm; Partition (number theory); Bayesian probability; Particle filter; Context (archaeology); Expectation–maximization algorithm; Data mining; Maximum likelihood; Mathematics; Artificial intelligence; Kalman filter; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0381693865443931,"gpt":0.2856644862224921,"spread":0.247495099678099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007899643,0.00006390826,0.00004892151,0.00002599856,0.00007071547,0.00001833811,0.00005596368,0.00002722111,0.000001556891],"category_scores_gemma":[0.00002601437,0.00005558553,0.000002842283,0.00003373528,0.00001908509,0.000002186215,0.00008595331,0.00002945781,0.000001712268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004429355,"about_ca_system_score_gemma":0.000009103695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001886636,"about_ca_topic_score_gemma":0.00002620274,"domain_scores_codex":[0.9995265,0.00001363652,0.00008380192,0.0002601137,0.00004451176,0.00007142538],"domain_scores_gemma":[0.9996402,0.0000105158,0.00005361922,0.0002192601,0.00002979432,0.00004656322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001593384,0.00003409247,0.0003405124,0.00002597442,0.00001839481,5.645111e-7,0.0002643147,0.0004519,0.1331069,0.001507082,0.000243416,0.8638476],"study_design_scores_gemma":[0.0007468711,0.001482577,0.03878734,0.00004591908,0.00004296242,0.00002575183,0.0001708855,0.897153,0.05545569,0.00353052,0.002176559,0.0003819108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2460425,0.00003044611,0.7536977,0.00001981202,0.00002390948,0.0001061525,0.00002230407,0.000005149603,0.00005200091],"genre_scores_gemma":[0.9203097,0.00001708646,0.07933965,0.0001505667,0.00003900659,0.000008137475,0.0001142565,0.000007780069,0.0000138283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8967011,"threshold_uncertainty_score":0.2266712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976442863","doi":"10.1007/s11222-012-9364-2","title":"Orthogonal Stiefel manifold optimization for eigen-decomposed covariance parameter estimation in mixture models","year":2012,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Stiefel manifold; Covariance; Benchmark (surveying); Cluster analysis; Algorithm; Mathematics; Manifold (fluid mechanics); Computer science; Estimation of covariance matrices; Current (fluid); Covariance matrix; Applied mathematics; Mathematical optimization; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02465779730929114,"gpt":0.286071470354152,"spread":0.2614136730448609,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006213306,0.0001557118,0.0002010583,0.00008141193,0.0001431852,0.0001402092,0.0001848932,0.00007947077,0.000002216204],"category_scores_gemma":[0.00006664147,0.0001534492,0.00002578132,0.0001549493,0.00001745039,0.0003661699,0.00009750746,0.000121568,6.310782e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002606314,"about_ca_system_score_gemma":0.00003165996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008674611,"about_ca_topic_score_gemma":0.000002520178,"domain_scores_codex":[0.9988128,0.00008519825,0.0003069931,0.0002943213,0.0001389773,0.0003617028],"domain_scores_gemma":[0.9990631,0.0004393726,0.000135153,0.0001813563,0.00008056252,0.0001004492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007020745,0.00003610123,0.00008213576,0.00003942887,0.000007539507,0.000001761172,0.0005126082,0.1186156,0.00001509871,0.7160504,0.00008792117,0.1645444],"study_design_scores_gemma":[0.0003379146,0.00003043386,0.0005021183,0.00003031642,0.000007679019,0.00001080525,0.000004639815,0.840591,0.00002011031,0.158275,0.00002965151,0.0001604061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009969004,0.000240923,0.997892,0.00006808094,0.0003052527,0.0002830456,0.00003765257,0.00004240324,0.0001337145],"genre_scores_gemma":[0.3088975,0.00001034132,0.690816,0.0001715642,0.00005135717,0.00000729062,0.0000243774,0.000009652066,0.00001189686],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7219754,"threshold_uncertainty_score":0.6257478,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112995480","doi":"10.1007/s11222-015-9577-2","title":"Approximating cross-validatory predictive evaluation in Bayesian latent variable models with integrated IS and WAIC","year":2015,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Statistical Methods and Bayesian Inference","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saskatchewan Health; University of Saskatchewan","funders":"","keywords":"Markov chain Monte Carlo; Bayesian probability; Latent variable; Mathematics; Posterior probability; Computer science; Logistic regression; Statistics; Artificial intelligence; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.09200036493050348,"gpt":0.36984197461487,"spread":0.2778416096843666,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001692126,0.0001685028,0.000286041,0.00006716837,0.0001066194,0.0001566386,0.00006252426,0.00006463133,0.00001723593],"category_scores_gemma":[0.000816236,0.0001360313,0.000006923453,0.0001512986,0.0001161789,0.0001019408,0.00007610906,0.0002005212,5.290396e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006784185,"about_ca_system_score_gemma":0.0001527641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001190855,"about_ca_topic_score_gemma":0.00001095736,"domain_scores_codex":[0.9985104,0.0002033014,0.0003944461,0.0003192587,0.0003260344,0.00024658],"domain_scores_gemma":[0.9984295,0.0007833547,0.0001650581,0.0001267113,0.0003606804,0.0001346767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006681775,0.00007082211,0.007607066,0.0002219467,0.00003916944,0.00001261543,0.004250363,0.001013269,0.00001429629,0.9123048,0.0001506814,0.0742482],"study_design_scores_gemma":[0.0004476774,0.00008784318,0.0006633315,0.0001208695,0.00002712995,0.000007054681,0.0002415623,0.5246273,0.000009843296,0.4736708,0.000002206481,0.00009442497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03590795,0.00005927391,0.9624167,0.00001333923,0.0000465158,0.0003066065,0.0001372637,0.00002918239,0.001083185],"genre_scores_gemma":[0.3924831,0.000002244674,0.6074343,0.00002644999,0.00001544858,0.00000784531,0.00001092248,0.0000124004,0.000007290924],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.523614,"threshold_uncertainty_score":0.5547195,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W172874229","doi":"10.1023/a:1020750810409","title":"Marginal and hazard ratio specific random data generation: Applications to semi-parametric bootstrapping","year":2002,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Statistical Methods and Bayesian Inference","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Covariate; Censoring (clinical trials); Statistics; Bootstrapping (finance); Estimator; Event (particle physics); Mathematics; Parametric statistics; Computer science; Econometrics","retraction":null,"screen_n_in":null,"score":{"opus":0.1842801634588534,"gpt":0.3748533784005708,"spread":0.1905732149417174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004311133,0.0001540431,0.0002650907,0.00009262695,0.0003269625,0.0002598797,0.000166341,0.00004187772,0.0001031487],"category_scores_gemma":[0.0005270579,0.0001490779,0.00001070795,0.000265538,0.00007358182,0.00005502941,0.0001871238,0.0001374128,0.00001156929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001368402,"about_ca_system_score_gemma":0.00001183609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005014106,"about_ca_topic_score_gemma":0.000004857242,"domain_scores_codex":[0.998693,0.00008448868,0.0003717057,0.0004401502,0.0001806492,0.0002300117],"domain_scores_gemma":[0.997623,0.001657706,0.0001022519,0.0003767354,0.00008353985,0.0001568283],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005389408,0.00003671677,0.0001832234,0.00007731984,0.00001974903,0.0000078745,0.0001736904,0.00001261854,0.0001484032,0.5916974,0.01171989,0.3959177],"study_design_scores_gemma":[0.0006601432,0.00006794797,0.0008657218,0.00005094591,0.00005313394,0.00004143869,0.00007778841,0.8202537,0.00003217806,0.1696393,0.00793802,0.0003197266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001371552,0.000373919,0.9965287,0.0001703731,0.00008180585,0.0003596116,0.0003355178,0.00003604833,0.0007424685],"genre_scores_gemma":[0.1338813,0.00012501,0.8654892,0.00009561963,0.0002838983,0.00001139615,0.00003911329,0.00001471552,0.00005970224],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.820241,"threshold_uncertainty_score":0.6079221,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125731394","doi":"10.1023/b:stco.0000009417.88960.81","title":"On the Deng-Lin random number generators and related methods","year":2003,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Killam Trusts","keywords":"Random number generation; Implementation; Simple (philosophy); Mathematics; Point (geometry); Algorithm; Computer science; Random effects model; Theoretical computer science; Programming language; Meta-analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01349654663365051,"gpt":0.2957573214591511,"spread":0.2822607748255005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001160367,0.0001172013,0.0001305056,0.00002976025,0.0002993688,0.0002005745,0.0001280771,0.00003438911,0.00002448263],"category_scores_gemma":[0.0004049842,0.00008662136,0.00001734347,0.0001757258,0.00006222594,0.00005416221,0.00007812554,0.0001724038,0.00001016589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001566623,"about_ca_system_score_gemma":0.00003103955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001237758,"about_ca_topic_score_gemma":9.923551e-7,"domain_scores_codex":[0.998789,0.0004329837,0.0002010192,0.000263692,0.0001338654,0.0001794701],"domain_scores_gemma":[0.9979793,0.001627397,0.00008739658,0.000183807,0.00005643137,0.00006564549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004510216,0.00001275352,0.00009400993,0.000007688115,0.00001607447,0.000013598,0.0004435664,0.000458094,0.0005302885,0.9214407,0.0007169497,0.0762618],"study_design_scores_gemma":[0.0008796657,0.00005210368,0.0005978742,0.00002843922,0.00001370969,0.00006184239,0.00003772775,0.8000494,0.001535466,0.1959789,0.000574239,0.0001906072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04164523,0.0001214204,0.9565135,0.0001397602,0.000260557,0.0001003501,0.000003645046,0.00004209757,0.00117347],"genre_scores_gemma":[0.5053358,0.00001370603,0.4942666,0.0003189921,0.00001709613,0.000001439011,0.000001350505,0.000007300842,0.00003767635],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7995913,"threshold_uncertainty_score":0.3532316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W146817024","doi":"10.1023/a:1008980332240","title":"Hierarchical priors for Bayesian CART shrinkage","year":2000,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Chicago; National Science Foundation","keywords":"Prior probability; Tree (set theory); Shrinkage; Computer science; Bayesian probability; Artificial intelligence; Mathematics; Machine learning; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01002268414004388,"gpt":0.264471543213006,"spread":0.2544488590729621,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000135244,0.00007629711,0.00009449615,0.00002287449,0.00026489,0.0001797553,0.0002511675,0.00002133218,0.00001146251],"category_scores_gemma":[0.00001593885,0.00007461207,0.00001519532,0.00009156992,0.00003735823,0.00005652758,0.000082055,0.00006930769,0.000006628136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000062096,"about_ca_system_score_gemma":0.00002553485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001521394,"about_ca_topic_score_gemma":0.000002327383,"domain_scores_codex":[0.9992994,0.00001236036,0.000146029,0.0002626479,0.00008281918,0.0001967397],"domain_scores_gemma":[0.9994693,0.0001874447,0.0000285687,0.000204183,0.00002664263,0.00008385934],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[5.14441e-7,0.00001112285,0.00002785524,0.000006955777,0.000003341388,0.000001759345,0.0002313212,0.00002648808,0.000007638004,0.2221899,0.001123975,0.7763691],"study_design_scores_gemma":[0.0001631444,0.00005357648,0.001403886,0.00001129168,0.00000412166,0.00001038924,0.00001735597,0.9562016,0.00001426413,0.01676037,0.02525387,0.0001061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004072968,0.00002826238,0.9942715,0.0002757444,0.00005595761,0.000109571,0.0001172671,0.00006256898,0.001006202],"genre_scores_gemma":[0.1350209,0.00001027181,0.8644885,0.0001401236,0.00007896681,0.000006637983,0.00002785252,0.000006302091,0.0002204615],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9561751,"threshold_uncertainty_score":0.3042592,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026051189","doi":"10.1007/s11222-011-9304-6","title":"A novel and fast methodology for simultaneous multiple structural break estimation and variable selection for nonstationary time series models","year":2011,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Autoregressive model; Series (stratigraphy); STAR model; Selection (genetic algorithm); Time series; Piecewise; Computation; Feature selection; Model selection; Mathematics; Algorithm; Piecewise linear function; Mathematical optimization; Computer science; Applied mathematics; Autoregressive integrated moving average; Statistics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0249671943517806,"gpt":0.244382111863802,"spread":0.2194149175120214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001260238,0.00009368643,0.0001433364,0.00003771409,0.0001703183,0.00003662506,0.0000163186,0.00004661383,0.000001524435],"category_scores_gemma":[0.0001011292,0.00009719961,0.000008033887,0.00003352549,0.00002400057,0.0000773009,0.00001031203,0.00003865372,1.268523e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001152582,"about_ca_system_score_gemma":0.000007703228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007877973,"about_ca_topic_score_gemma":0.00003106958,"domain_scores_codex":[0.9995384,0.00001543881,0.0001587851,0.0001306253,0.00003163227,0.0001251041],"domain_scores_gemma":[0.9991559,0.000666316,0.00004118724,0.00002852522,0.00007217006,0.00003586998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002331473,0.00001122641,0.00008888332,0.0005903152,0.0001306681,7.850019e-7,0.003593102,0.697302,0.01703308,0.05229254,0.00007014922,0.2286541],"study_design_scores_gemma":[0.0006186845,0.0001098921,0.00009905201,0.00001272399,0.00002426203,0.0000889131,0.0001288818,0.9838217,0.0001163187,0.01483442,0.00003597401,0.000109133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02026361,0.00006121353,0.9788656,0.000003446368,0.0001239696,0.0003032252,0.0002585175,0.00007145298,0.00004902912],"genre_scores_gemma":[0.5037438,0.000001507311,0.4961657,0.0000056657,0.00002170364,0.00001064499,0.00002118283,0.000009327647,0.00002049454],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4834802,"threshold_uncertainty_score":0.3963685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090142805","doi":"10.1007/s11222-012-9357-1","title":"Estimating mixed-effects differential equation models","year":2012,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; Ottawa Hospital; McGill University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ode; Ordinary differential equation; Applied mathematics; Mathematics; Smoothing; Smoothing spline; Mathematical optimization; Spline (mechanical); Differential equation; Statistics; Spline interpolation; Mathematical analysis; Bilinear interpolation","retraction":null,"screen_n_in":null,"score":{"opus":0.02088113994297148,"gpt":0.2727585510340687,"spread":0.2518774110910972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001509062,0.0001294218,0.0001343291,0.00005794099,0.0002583953,0.00013191,0.000147343,0.00003154976,0.000001886051],"category_scores_gemma":[0.0001197133,0.0001306876,0.00001490666,0.0001328068,0.00002926131,0.0004458547,0.0002388962,0.00009797484,0.000005111126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003121117,"about_ca_system_score_gemma":0.00001353663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007243745,"about_ca_topic_score_gemma":3.546316e-7,"domain_scores_codex":[0.9990352,0.00006175462,0.0001900743,0.000226606,0.0001791989,0.000307179],"domain_scores_gemma":[0.9991573,0.0003530121,0.0001303337,0.0001532222,0.00009310326,0.0001130223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000112373,0.0000490473,0.0002243711,0.00003765156,0.00001223661,0.000002574694,0.00123109,0.1516244,0.00008547025,0.411882,0.00004059085,0.4348094],"study_design_scores_gemma":[0.0002436715,0.00002325212,0.001626171,0.00002300898,0.000006484926,0.000008003226,0.00001436057,0.9771222,0.0001302847,0.02064474,0.00000555776,0.0001522622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002711957,0.00007886311,0.9957641,0.000012635,0.001003124,0.0001321052,0.000006019609,0.0001125596,0.0001786758],"genre_scores_gemma":[0.4601684,0.000001574188,0.5396786,0.00002599501,0.0001008862,0.000002084861,0.000006323709,0.000006633115,0.000009473698],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8254978,"threshold_uncertainty_score":0.5329286,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2338693761","doi":"10.1007/s11222-016-9697-3","title":"Automated selection of r for the r largest order statistics approach with adjustment for sequential testing","year":2016,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Environment and Climate Change Canada","funders":"Division of Mathematical Sciences; Environment and Climate Change Canada; University of Connecticut; National Science Foundation","keywords":"Maxima; Statistics; Estimator; Mathematics; Order statistic; Test statistic; Statistical hypothesis testing; Asymptotic distribution; Statistic; Parametric statistics; Model selection; Nonparametric statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04880142413432242,"gpt":0.256712178531766,"spread":0.2079107543974436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004312207,0.0001024825,0.0002154322,0.00004255362,0.0002437226,0.00003049081,0.00006322833,0.00003793959,0.00000332781],"category_scores_gemma":[0.0003984517,0.000071191,0.00001737976,0.0001110194,0.0000543965,0.00003551084,0.00002553345,0.00004137264,5.608126e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002862686,"about_ca_system_score_gemma":0.00004039215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001540942,"about_ca_topic_score_gemma":0.00002601882,"domain_scores_codex":[0.9991346,0.000007402939,0.0003850312,0.0002297119,0.00003154621,0.0002116819],"domain_scores_gemma":[0.9986193,0.0007430677,0.0002973489,0.00008368561,0.0002294308,0.00002712742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001116601,0.00009678474,0.0242898,0.000357116,0.0001147331,2.195e-7,0.000370879,0.006328773,0.0001175302,0.8651974,0.0009671789,0.1020479],"study_design_scores_gemma":[0.0007576086,0.0002168138,0.009603557,0.00003081329,0.00002371506,0.000001745205,0.00002922266,0.9723829,0.00002608491,0.01632739,0.000481891,0.000118234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01372934,0.0001831579,0.9833822,0.00003195995,0.0001218505,0.0004215794,0.00203441,0.00003502079,0.00006042763],"genre_scores_gemma":[0.5205353,0.00001628499,0.4792788,0.00001360499,0.0000700478,0.00001667768,0.00002357657,0.00001365218,0.00003208865],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9660541,"threshold_uncertainty_score":0.2903084,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2199283642","doi":"10.1007/s11222-016-9688-4","title":"Quasi-random numbers for copula models","year":2016,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Copula (linguistics); Importance sampling; Random number generation; Monte Carlo method; Computer science; Multivariate t-distribution; Mathematics; Multivariate statistics; Econometrics; Multivariate normal distribution; Algorithm; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0599004494514206,"gpt":0.3336830163889332,"spread":0.2737825669375126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002850698,0.00009097205,0.0001708119,0.00002229686,0.0001062153,0.00003982133,0.00004839768,0.00003396717,0.00004212404],"category_scores_gemma":[0.0005252851,0.0000570646,0.00002700477,0.00002886728,0.0000362895,0.00005192932,0.00002101036,0.00003082089,0.000005164609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001422566,"about_ca_system_score_gemma":0.0000119319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003750125,"about_ca_topic_score_gemma":0.000005330311,"domain_scores_codex":[0.9993198,0.0000231559,0.0002717241,0.0001353983,0.0001079145,0.0001419954],"domain_scores_gemma":[0.9982869,0.001365864,0.0001004486,0.00009081163,0.0001023559,0.00005359236],"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.0000117775,0.0000425193,0.000005484048,0.000103534,0.000009460828,2.349664e-7,0.0002920968,0.000001113785,0.00004142301,0.9625362,0.003743001,0.03321316],"study_design_scores_gemma":[0.0005701293,0.00004559808,0.000002548558,0.00006494264,0.00001144857,0.000002052391,0.00006392392,0.2894284,0.00007280624,0.7093744,0.0002917133,0.00007200553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007110331,0.000008349464,0.9898248,0.0002015637,0.00006502456,0.0002522557,0.00007755267,0.00004751909,0.002412635],"genre_scores_gemma":[0.3322491,0.000005869285,0.6669737,0.00006791442,0.00005132357,0.00001100985,0.000007395729,0.00001454113,0.0006191382],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3251388,"threshold_uncertainty_score":0.2327027,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129677775","doi":"10.1007/s11222-011-9232-5","title":"Decrypting classical cipher text using Markov chain Monte Carlo","year":2011,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain Monte Carlo; Computer science; Markov chain; Algorithm; Transposition (logic); Cipher; Theoretical computer science; Mathematics; Artificial intelligence; Machine learning; Bayesian probability; Encryption","retraction":null,"screen_n_in":null,"score":{"opus":0.03401946711079033,"gpt":0.2587742742807753,"spread":0.224754807169985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002600285,0.0001562608,0.0001799785,0.00005315484,0.0003429845,0.0001735585,0.0003534566,0.00005065843,0.00001315907],"category_scores_gemma":[0.00004369227,0.000141418,0.00002399257,0.0001396024,0.00005749816,0.00017123,0.0007342267,0.0001648089,0.000004606336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002138344,"about_ca_system_score_gemma":0.00004042421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001957055,"about_ca_topic_score_gemma":0.000007275495,"domain_scores_codex":[0.9987472,0.00006146904,0.0002638951,0.0003895415,0.0001962577,0.000341689],"domain_scores_gemma":[0.9992287,0.0001352958,0.0001292485,0.0002935113,0.00007350958,0.000139797],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007274388,0.00007347823,0.00290424,0.00003535053,0.0000291555,0.0001386083,0.002747823,0.0002613653,0.0002626664,0.1011782,0.001228027,0.8911338],"study_design_scores_gemma":[0.0001913691,0.00004490228,0.004970099,0.00005840334,0.000007326108,0.00003084348,0.00007212332,0.9906717,0.00003645283,0.003170167,0.0005487131,0.0001978906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03551392,0.0001444493,0.9629647,0.00002006363,0.0003206232,0.00007067138,0.00001413527,0.00007345179,0.0008780563],"genre_scores_gemma":[0.4236952,0.000005382582,0.5761012,0.00007317483,0.00008340999,5.17707e-7,0.000001563216,0.00000864524,0.00003079842],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9904103,"threshold_uncertainty_score":0.5766858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141313754","doi":"10.1007/s11222-012-9339-3","title":"Robust model-based sampling designs","year":2012,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Australian Research Council; Australian National University","keywords":"Mathematics; Minimax; Robustness (evolution); Population; Mean squared error; Sample size determination; Neighbourhood (mathematics); Statistics; Optimal design; Linear model; Mathematical optimization; Population variance; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.4559566454812878,"gpt":0.4775928154674137,"spread":0.02163616998612594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002801111,0.0001213143,0.0001933949,0.00009139572,0.000262689,0.0002245084,0.0002029667,0.00003882771,0.00005481567],"category_scores_gemma":[0.0009724064,0.0001010499,0.00002788286,0.0002020309,0.00007915271,0.0001109979,0.0001205025,0.0001021748,0.00002870085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002319019,"about_ca_system_score_gemma":0.00003866682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007721799,"about_ca_topic_score_gemma":4.678021e-7,"domain_scores_codex":[0.9983573,0.0001786257,0.0003683702,0.000259303,0.0004912707,0.0003451595],"domain_scores_gemma":[0.997099,0.002262115,0.0001340521,0.0002067551,0.0001124543,0.0001855642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003310499,0.0001255435,0.01029522,0.00001555018,0.00001470934,0.000004166036,0.001642318,0.4560186,0.007525954,0.135443,0.00212306,0.3867588],"study_design_scores_gemma":[0.0001409084,0.00003262409,0.001540184,0.000008947227,0.000006316453,0.000003086741,0.0002081629,0.9811274,0.0006935208,0.01592543,0.0001755663,0.0001378115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01793959,0.000234665,0.9799839,0.00002039641,0.0002408226,0.00007908244,0.00002797671,0.00002796298,0.001445554],"genre_scores_gemma":[0.4755082,6.62387e-7,0.5242782,0.0001120414,0.00004735559,6.95702e-7,0.000001797797,0.000007263812,0.0000437876],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5251089,"threshold_uncertainty_score":0.4120695,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3014919713","doi":"10.1007/s11222-021-10012-y","title":"A robust and efficient algorithm to find profile likelihood confidence intervals","year":2021,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Statistical Methods and Bayesian Inference","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Canada Excellence Research Chairs, Government of Canada; University of Alberta","keywords":"Likelihood function; Confidence interval; Estimator; Confidence distribution; Range (aeronautics); Function (biology); Confidence region; Benchmark (surveying); Expectation–maximization algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0498995997530108,"gpt":0.342029639112509,"spread":0.2921300393594982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003817925,0.0001421789,0.0002755501,0.00003403411,0.0001503711,0.0001572608,0.0000664581,0.00004044392,0.00009030035],"category_scores_gemma":[0.00159346,0.0001324916,0.0000155401,0.0001267638,0.00006528896,0.00001286314,0.0002333334,0.0001353467,0.0000066793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001315422,"about_ca_system_score_gemma":0.00005542038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001719405,"about_ca_topic_score_gemma":0.000005165183,"domain_scores_codex":[0.9988024,0.0001036107,0.0003063132,0.0003422274,0.0001660173,0.0002793832],"domain_scores_gemma":[0.9976557,0.001739587,0.00007821542,0.0001472851,0.0001966802,0.0001825379],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003268888,0.00004414625,0.00008071517,0.000142864,0.00001567666,0.00006497862,0.0006960153,0.000004621882,0.0002167784,0.4397424,0.0007139778,0.5582745],"study_design_scores_gemma":[0.000349584,0.0001683283,0.00581109,0.0004242719,0.0000519069,0.000094826,0.0005708447,0.37743,0.0005761,0.6140504,0.0001369305,0.0003356695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01163535,0.0001021754,0.9871191,0.0001141447,0.0001363172,0.0001503405,0.0002773433,0.00002668284,0.0004385603],"genre_scores_gemma":[0.0391389,0.000007415075,0.9605284,0.0001669013,0.00005607758,0.000004369654,0.000005956478,0.0000139142,0.0000780674],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5579389,"threshold_uncertainty_score":0.5402849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2886379631","doi":"10.1007/s11222-019-09863-3","title":"Weight-preserving simulated tempering","year":2019,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Tempering; Parallel tempering; Limit (mathematics); Inverse; Mode (computer interface); Algorithm; Computer science; Mathematical optimization; Inverse problem; Mathematics; Artificial intelligence; Markov chain Monte Carlo; Bayesian probability; Materials science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03143586418334571,"gpt":0.3309175520846992,"spread":0.2994816879013535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004121427,0.0001200875,0.0002135134,0.00004048925,0.0001038222,0.00005900634,0.00009495387,0.00004399855,0.00004335832],"category_scores_gemma":[0.0002396137,0.0001097139,0.00002379208,0.00007015494,0.00001643941,0.00002940043,0.0001921263,0.0001248031,4.060807e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001372113,"about_ca_system_score_gemma":0.0000128419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000246041,"about_ca_topic_score_gemma":0.000004496016,"domain_scores_codex":[0.9991595,0.00006000012,0.0002289572,0.0002049516,0.0001248838,0.0002216968],"domain_scores_gemma":[0.9986838,0.0008943829,0.00008743042,0.000201167,0.00006664336,0.00006663421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003972808,0.00009000979,0.02158199,0.001561608,0.0001681537,0.00006888161,0.003670135,0.001104402,0.007576619,0.826613,0.004548135,0.1329773],"study_design_scores_gemma":[0.0007096083,0.00007771444,0.0006233382,0.0002056482,0.00003168137,0.00001241455,0.0004104572,0.9501303,0.0003932867,0.04239661,0.004640399,0.000368514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6962853,0.00008599118,0.295351,0.00002122264,0.0002902615,0.0001469906,0.00001489841,0.00006834509,0.007736049],"genre_scores_gemma":[0.7384996,0.000008596505,0.2606992,0.00004319641,0.00007003569,3.449351e-7,0.000003588772,0.00002047144,0.0006549261],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9490259,"threshold_uncertainty_score":0.4474002,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019783744","doi":"10.1023/b:stco.0000009413.87656.ef","title":"On the Value of derivative evaluations and random walk suppression in Markov Chain Monte Carlo algorithms","year":2003,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Children's & Women's Health Centre of British Columbia; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain Monte Carlo; Random walk; Markov chain; Algorithm; Metropolis–Hastings algorithm; Univariate; Monte Carlo method; Computer science; Multivariate statistics; Mathematics; Statistics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.03947410229074172,"gpt":0.3532025686948865,"spread":0.3137284664041448,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001925193,0.0001272548,0.0002596617,0.00005768463,0.0001411773,0.00002452171,0.00005669649,0.0000429777,0.000006642056],"category_scores_gemma":[0.002578179,0.00008862244,0.00002233749,0.000102375,0.00007707953,0.00001574766,0.0000540938,0.000146533,1.084512e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001750091,"about_ca_system_score_gemma":0.00002931372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004326514,"about_ca_topic_score_gemma":0.00001823052,"domain_scores_codex":[0.9985558,0.0006004518,0.000314899,0.0001816507,0.0001837171,0.0001634753],"domain_scores_gemma":[0.9947637,0.004801445,0.000151193,0.0001526383,0.00008869576,0.00004233028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005159491,0.00009081619,0.0006803967,0.0001552374,0.00004641076,0.000009539734,0.006417863,0.0004251515,0.0003225865,0.9181948,0.0006886946,0.07291687],"study_design_scores_gemma":[0.002629289,0.0001668501,0.001555056,0.0003883388,0.00005664846,0.000008406141,0.002325832,0.7940826,0.0007783739,0.1976339,0.0001349948,0.0002397586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4904996,0.0002635395,0.5068962,0.00009016049,0.0001321213,0.0004252521,0.0000625194,0.000009287085,0.001621261],"genre_scores_gemma":[0.7804636,0.00003995226,0.2193464,0.00004730411,0.00001310727,0.000007300837,0.000001790043,0.00001217258,0.00006840299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7936574,"threshold_uncertainty_score":0.3613918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023897752","doi":"10.1007/s11222-005-1308-7","title":"Importance sampling with the generalized exponential power density","year":2005,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Exponential function; Credence; Context (archaeology); Applied mathematics; Logarithm; Probability density function; Monte Carlo method; Statistical physics; Density estimation; Exponential family; Importance sampling; Statistics; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01619264440647443,"gpt":0.2693408045406934,"spread":0.253148160134219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003580739,0.0001097179,0.0001261397,0.00001880181,0.0003126964,0.0001893344,0.0002366536,0.00002090494,0.000004305492],"category_scores_gemma":[0.00001264063,0.00007062564,0.00001638721,0.00009004906,0.00004966451,0.00007542918,0.0001536853,0.0001200111,0.000001757492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001028877,"about_ca_system_score_gemma":0.0000277113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001190374,"about_ca_topic_score_gemma":0.00002086521,"domain_scores_codex":[0.9991642,0.00005994015,0.0001430263,0.0002630016,0.0001489995,0.0002208682],"domain_scores_gemma":[0.9994042,0.0001330973,0.00009063516,0.0002480499,0.00006190243,0.0000621146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007226791,0.00001534836,0.0003099584,0.000006202188,0.00002014708,0.00001745594,0.001176027,0.0002352578,0.0003464576,0.6755316,0.001010602,0.3213238],"study_design_scores_gemma":[0.0008402427,0.0001173945,0.01173398,0.00003481531,0.00002940865,0.0001623389,0.00004223833,0.9303247,0.0005018553,0.04970589,0.005988774,0.0005183613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07218991,0.0001357555,0.9265655,0.0006328807,0.00008818427,0.00007030331,0.000003353932,0.00004037099,0.0002737492],"genre_scores_gemma":[0.4220691,0.000004713253,0.5773476,0.0004734636,0.00007049945,6.140734e-7,8.958834e-7,0.000004306236,0.00002883357],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9300895,"threshold_uncertainty_score":0.288003,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1532747171","doi":"10.1023/a:1008991527785","title":"Efficient use of exact samples","year":2000,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain Monte Carlo; Markov chain; Estimator; Computer science; Sampling (signal processing); Stationary distribution; Algorithm; Event (particle physics); Sample (material); Mathematics; Distribution (mathematics); Monte Carlo method; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.09316534972048257,"gpt":0.3471805281522496,"spread":0.2540151784317671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002743741,0.00007890295,0.0001746965,0.00002475636,0.00006442011,0.00002477378,0.000040025,0.00002374687,0.0000469316],"category_scores_gemma":[0.0002433537,0.00006915336,0.00002169152,0.00004871711,0.00004332027,0.000006378466,0.00003102553,0.0000536659,4.83831e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000586951,"about_ca_system_score_gemma":0.00001055872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004890892,"about_ca_topic_score_gemma":0.000005500679,"domain_scores_codex":[0.9993677,0.00005930587,0.0002211266,0.0001192715,0.0001013406,0.0001312262],"domain_scores_gemma":[0.9985502,0.001161849,0.00007152705,0.0001239556,0.00004741264,0.00004505222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002129497,0.00009124888,0.0006727065,0.0002231947,0.00003416295,0.00001057626,0.001304542,0.001252641,0.0002880241,0.2831661,0.001828661,0.7111068],"study_design_scores_gemma":[0.0007783347,0.000196016,0.0033376,0.0002591271,0.00009801219,0.0000255486,0.0003273922,0.9495891,0.0004834813,0.03146556,0.01298257,0.0004572585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5723938,0.00003625916,0.4264852,0.000006683806,0.00003808483,0.00005820369,0.00007163745,0.00001445435,0.0008955986],"genre_scores_gemma":[0.4802746,0.0000129666,0.5194464,0.00002028516,0.00002436708,3.501784e-7,0.000002801841,0.000008129071,0.0002100609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9483365,"threshold_uncertainty_score":0.2819993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4221124979","doi":"10.1007/s11222-021-10066-y","title":"Sparse functional partial least squares regression with a locally sparse slope function","year":2022,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; FPInnovations; Brock University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Partial least squares regression; Functional data analysis; Mathematics; Chemometrics; Regularization (linguistics); Applied mathematics; Least-squares function approximation; Algorithm; Generalized least squares; Function (biology); Mathematical optimization; Computer science; Statistics; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.0193744584787349,"gpt":0.2488822960684803,"spread":0.2295078375897454,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001101508,0.0001605652,0.0001865507,0.00007405073,0.000689126,0.00006620451,0.00007890855,0.0000327358,0.002243042],"category_scores_gemma":[0.00003152176,0.0001395447,0.00002703214,0.0002700544,0.00007237008,0.00003592996,0.0001478027,0.0002840789,0.000004076502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000582423,"about_ca_system_score_gemma":0.00007121877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005361427,"about_ca_topic_score_gemma":0.00001038185,"domain_scores_codex":[0.9988357,0.00002411757,0.0002091981,0.0003254653,0.0003568883,0.0002485888],"domain_scores_gemma":[0.9994361,0.0001199828,0.0001536476,0.0001402405,0.00006277292,0.00008728416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.009485492,0.002812378,0.1928107,0.001485332,0.002493353,0.001151864,0.002947794,0.1257183,0.06621615,0.1192695,0.08205806,0.3935511],"study_design_scores_gemma":[0.008177479,0.002483111,0.02445133,0.0002781245,0.001897811,0.0007277691,0.01369266,0.8749087,0.02283866,0.008270283,0.0395859,0.002688125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3595198,0.0005549391,0.6355882,0.00009311186,0.0002169272,0.00006643677,0.0001775577,0.0001131665,0.003669837],"genre_scores_gemma":[0.9951899,0.000008263539,0.003477929,0.0001238769,0.0002140317,0.000008358574,0.000159079,0.00001968854,0.000798843],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7491904,"threshold_uncertainty_score":0.998669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3156595930","doi":"10.1007/s11222-022-10080-8","title":"Optimal scaling of random walk Metropolis algorithms using Bayesian large-sample asymptotics","year":2022,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Mathematics; Scaling; Algorithm; Limit (mathematics); Applied mathematics; Random walk; Sample (material); Dimension (graph theory); Product (mathematics); Scaling limit; Mathematical optimization; Mathematical analysis; Statistics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04183109047495914,"gpt":0.3489249357384459,"spread":0.3070938452634867,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001559712,0.0001726552,0.0004542576,0.0001142971,0.0005427164,0.00004195135,0.0001421212,0.0000369057,0.00004486451],"category_scores_gemma":[0.0007278127,0.0001786925,0.00007242003,0.0001985373,0.00005804959,0.0000235783,0.0004249735,0.0002304377,7.916793e-9],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006222208,"about_ca_system_score_gemma":0.0000551093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001646099,"about_ca_topic_score_gemma":0.000006563477,"domain_scores_codex":[0.9982586,0.0002738809,0.0005143116,0.0002540713,0.0003385253,0.0003606421],"domain_scores_gemma":[0.9973066,0.001977079,0.0003035618,0.00020158,0.0001155729,0.00009558129],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002718639,0.0006977967,0.002920815,0.001328508,0.0006168757,0.0001383875,0.01268338,0.04369866,0.001262959,0.7668226,0.001610123,0.167948],"study_design_scores_gemma":[0.001237149,0.00009006959,0.00001401543,0.00003146959,0.0001043949,0.00002219555,0.00245575,0.9830335,0.000166714,0.01197807,0.0006569383,0.0002096855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08838481,0.0001602062,0.9100862,0.00001154124,0.0002765276,0.0001570975,0.000713144,0.00002824841,0.000182202],"genre_scores_gemma":[0.3278177,0.000007431314,0.6719934,0.00002824105,0.00008033214,0.000001691277,0.00002145044,0.00002688562,0.00002279177],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9393349,"threshold_uncertainty_score":0.7286869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385147727","doi":"10.1007/s11222-023-10277-5","title":"Flexible non-parametric regression models for compositional response data with zeros","year":2023,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"University of Crete","keywords":"Parametric statistics; Regression; Mathematics; Regression analysis; Multivariate adaptive regression splines; Semiparametric regression; Compositional data; Statistics; Nonparametric regression; Computer science; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05072143245733438,"gpt":0.3062973118426755,"spread":0.2555758793853411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006325733,0.0001053419,0.0001305375,0.00008321724,0.000348318,0.0001387689,0.0004768698,0.00003426288,0.00000134979],"category_scores_gemma":[0.0001372076,0.0000861859,0.000009885381,0.0004389083,0.00004190543,0.0001251417,0.0006210141,0.00008281261,0.000003353037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008218743,"about_ca_system_score_gemma":0.00006416617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006068961,"about_ca_topic_score_gemma":3.276722e-7,"domain_scores_codex":[0.9989846,0.00003377731,0.00015478,0.0004100394,0.0001693054,0.0002475478],"domain_scores_gemma":[0.9983517,0.0009565616,0.00008756272,0.0004119352,0.0001258578,0.0000664179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009878222,0.0002103922,0.001032176,0.0007685242,0.0001516344,0.0002722593,0.001936294,0.2990156,0.007108935,0.398022,0.1054612,0.1850332],"study_design_scores_gemma":[0.0003354926,0.00009743709,0.00106238,0.00006744213,0.000005057215,0.00002169379,0.00003282066,0.9621145,0.000368608,0.03475716,0.001011799,0.0001256262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01179162,0.00002357757,0.9868237,0.0006311503,0.00007781974,0.0001293755,0.0001582894,0.0001115822,0.0002528572],"genre_scores_gemma":[0.6166577,0.000004533356,0.3826922,0.00006819786,0.00003300347,0.000003737087,0.0001930012,0.000002975775,0.0003446521],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6630989,"threshold_uncertainty_score":0.3514559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133406420","doi":"10.1023/b:stco.0000039483.71153.8d","title":"Automatic polynomial wavelet regression","year":2004,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Polynomial regression; Wavelet; Mathematics; Polynomial; Regression; Artificial intelligence; Pattern recognition (psychology); Computer science; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01492591909867814,"gpt":0.2863038019676651,"spread":0.271377882868987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002941184,0.0000992045,0.000131049,0.00005145726,0.000234582,0.0002139377,0.0002124426,0.00002936121,0.000004396088],"category_scores_gemma":[0.00006975628,0.00008373064,0.00001685088,0.0001190175,0.00003621844,0.00009362402,0.0001914499,0.0001009371,0.000009782254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002086701,"about_ca_system_score_gemma":0.00005470694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003273912,"about_ca_topic_score_gemma":9.790213e-7,"domain_scores_codex":[0.9991989,0.00005449283,0.0001754961,0.0002163824,0.0001481533,0.0002066481],"domain_scores_gemma":[0.9994902,0.0001480364,0.00007248964,0.0001771143,0.00004092677,0.00007126061],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002109799,0.00001809229,0.00002245744,0.0000244858,0.000006236092,0.00007965399,0.0007901121,0.00008892151,0.0008005332,0.0726042,0.0008499334,0.9247133],"study_design_scores_gemma":[0.00149643,0.0001599804,0.004231588,0.0001916928,0.00001128815,0.0001449779,0.0000359153,0.8945746,0.002294077,0.095842,0.0006729529,0.0003444594],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03126262,0.00009404897,0.967499,0.000189109,0.0002989664,0.00004571229,0.000003316212,0.00009057505,0.0005166854],"genre_scores_gemma":[0.3837505,0.00000353673,0.6159786,0.0001751026,0.00005711483,2.796231e-7,0.000001458802,0.00000428678,0.0000291513],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9243688,"threshold_uncertainty_score":0.3414436,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385666969","doi":"10.1007/s11222-023-10287-3","title":"Neural networks for scalar input and functional output","year":2023,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Machine Learning in Materials Science","field":"Materials Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Simon Fraser University","funders":"","keywords":"Scalar (mathematics); Smoothness; Artificial neural network; Computer science; Representation (politics); Mathematics; Nonlinear system; Algorithm; Dimension (graph theory); Scaling; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.02001032203728729,"gpt":0.2705938394816081,"spread":0.2505835174443208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006843539,0.00008907133,0.0001213715,0.00003832068,0.0003818424,0.0002272283,0.00006938635,0.00002779753,0.00002586342],"category_scores_gemma":[0.0002090702,0.00008119962,0.00000922801,0.0000886459,0.0001108453,0.00004498412,0.0001712701,0.00005828014,0.000009373989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000569727,"about_ca_system_score_gemma":0.00001130363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001817111,"about_ca_topic_score_gemma":0.000002587064,"domain_scores_codex":[0.9991344,0.00004488232,0.000165766,0.0002652157,0.0001265153,0.0002631986],"domain_scores_gemma":[0.9993103,0.0004267555,0.00007309392,0.0000748837,0.00005002154,0.0000649295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001245332,0.00003885657,0.02085511,0.0004762559,0.00001836425,0.00003813206,0.001220011,0.6387163,0.05844913,0.09310739,0.02266023,0.1642957],"study_design_scores_gemma":[0.0001626581,0.00005093158,0.03088622,0.00001042374,0.000005282337,0.000009577186,0.00002520951,0.9654685,0.00007404485,0.002823203,0.0003854469,0.00009853804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4422895,0.00003225592,0.5566278,0.0001088866,0.0007037822,0.00008324319,0.00004708844,0.00007895387,0.00002853274],"genre_scores_gemma":[0.9534492,0.000005499456,0.04597855,0.0001447578,0.0002501069,0.000004256219,0.00002770471,0.0000111449,0.0001287209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5111598,"threshold_uncertainty_score":0.3311225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1534178884","doi":"10.1023/a:1026509916251","title":"Mean likelihood estimators","year":2001,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Statistics Education and Methodologies","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Statistics Canada; Western University","funders":"","keywords":"Estimator; Statistics; Mathematics; Exponential family; Mean squared error; Applied mathematics; Bayes estimator; Negative binomial distribution; Binomial (polynomial); Bayes' theorem; M-estimator; Computer science; Bayesian probability; Poisson distribution","retraction":null,"screen_n_in":null,"score":{"opus":0.1125180172437987,"gpt":0.4092721382161505,"spread":0.2967541209723518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004082421,0.000111229,0.0001671554,0.00005043893,0.0001626769,0.00006064364,0.00007414723,0.00003331626,0.00007026194],"category_scores_gemma":[0.001266003,0.0001038693,0.00001472606,0.00009013065,0.00005914034,0.00001741651,0.00005941563,0.00009577491,0.00001340839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001435614,"about_ca_system_score_gemma":0.00003697483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001812545,"about_ca_topic_score_gemma":0.00001225015,"domain_scores_codex":[0.9991878,0.00006830785,0.0002258031,0.0001726154,0.0001182253,0.0002272037],"domain_scores_gemma":[0.9977757,0.001816125,0.00009932675,0.0001329524,0.00008288289,0.00009301883],"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.000005008219,0.00003300572,0.003029909,0.00005133612,0.00001872169,0.0000171626,0.001241682,0.000003971659,0.00002137194,0.8501228,0.01525103,0.130204],"study_design_scores_gemma":[0.0002521834,0.00004636403,0.00433826,0.00003458427,0.00003691307,0.0000629385,0.0008628664,0.01597826,0.00004465503,0.9727927,0.005345416,0.0002048061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04556825,0.00008086523,0.9509886,0.00008498772,0.0005173259,0.00007858055,0.00004874185,0.00009380451,0.002538831],"genre_scores_gemma":[0.2029929,0.00004515602,0.7964138,0.0001107921,0.00008906564,0.000001631464,0.000008970321,0.00001575546,0.0003219053],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1574246,"threshold_uncertainty_score":0.4235668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970936118","doi":"10.1007/s11222-007-9036-9","title":"Complement to a comparative analysis of heuristics for the p-median problem","year":2007,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristics; Complement (music); Heuristic; Mathematics; Variable neighborhood search; Artificial neural network; Series (stratigraphy); Evolutionary algorithm; Mathematical optimization; Artificial intelligence; Algorithm; Computer science; Metaheuristic","retraction":null,"screen_n_in":null,"score":{"opus":0.04780510852779223,"gpt":0.3155114913702974,"spread":0.2677063828425051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007507058,0.00009647667,0.0002032635,0.0002175582,0.0002315,0.00006968629,0.0001239823,0.00001178972,0.00003917194],"category_scores_gemma":[0.00005777688,0.00007670057,0.00004042752,0.0006423329,0.00004333393,0.00003474037,0.0001272299,0.00003739595,0.000005901727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001205844,"about_ca_system_score_gemma":0.000006208517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007619864,"about_ca_topic_score_gemma":0.003138445,"domain_scores_codex":[0.9990847,0.000004363506,0.0003769413,0.0001657606,0.0001684491,0.0001997987],"domain_scores_gemma":[0.9992602,0.0002268222,0.0001046315,0.0001265796,0.0002653801,0.00001632927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005844252,0.0001068045,0.008398444,0.0003455723,0.0008140827,0.000001044307,0.00164859,0.03930899,0.00003111942,0.8625346,0.01412714,0.07262517],"study_design_scores_gemma":[0.0002329113,0.00002442215,0.0690967,0.00001357734,0.0005880535,4.917752e-8,0.002000405,0.8781095,0.000005818468,0.002857939,0.04692997,0.0001406178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01853343,0.00002325578,0.9786584,0.0006220035,0.000162409,0.0005083433,0.00007741382,0.0000174116,0.001397372],"genre_scores_gemma":[0.9649673,0.000002723898,0.03405572,0.0007050347,0.0001153644,0.000006840368,0.00009325286,0.000004357079,0.00004944834],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9464338,"threshold_uncertainty_score":0.3127759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3174807046","doi":"10.1007/s11222-021-10032-8","title":"Bayesian inference for continuous-time hidden Markov models with an unknown number of states","year":2021,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":true},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inference; Reversible-jump Markov chain Monte Carlo; Markov chain Monte Carlo; Computer science; Bayesian inference; Cluster analysis; State space; Hidden Markov model; Bayesian probability; Algorithm; Context (archaeology); Mathematics; Machine learning; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0123870337463591,"gpt":0.2849827437581099,"spread":0.2725957100117508,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003296404,0.0001588014,0.0003218968,0.00002917517,0.0001293018,0.0001562199,0.000244064,0.00004663856,0.000007730439],"category_scores_gemma":[0.0000409279,0.0001389417,0.00002499589,0.000139377,0.0000648097,0.0001860254,0.0001612325,0.00009015686,5.732045e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008712705,"about_ca_system_score_gemma":0.0001383994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002870334,"about_ca_topic_score_gemma":0.00001245732,"domain_scores_codex":[0.9987672,0.0001077981,0.0002792792,0.0004055451,0.0001608064,0.0002793897],"domain_scores_gemma":[0.9985415,0.00049144,0.0001505034,0.0003123645,0.0003825603,0.0001216417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001213268,0.00004307876,0.0001733322,0.00006593239,0.00002687866,0.00002002992,0.0007226104,0.0001734542,0.00009262954,0.5958934,0.00009664455,0.4026799],"study_design_scores_gemma":[0.0002910464,0.0001117655,0.000080669,0.00005147812,0.00001369557,0.00002724309,0.00002439178,0.6905078,0.0002830166,0.3084009,0.00005854735,0.0001494427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004018265,0.00006955701,0.9945565,0.0000707155,0.00005994382,0.000130214,0.00008790264,0.00003969733,0.0009672291],"genre_scores_gemma":[0.187528,0.00001388868,0.8121266,0.00009741531,0.00002966444,0.000002913542,0.00002659358,0.0000127264,0.0001621933],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6903343,"threshold_uncertainty_score":0.5665877,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033036691","doi":"10.1007/s11222-011-9278-4","title":"Estimating curves and derivatives with parametric penalized spline smoothing","year":2011,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"","keywords":"Smoothing spline; Smoothing; Nonparametric statistics; Parametric statistics; Spline (mechanical); Thin plate spline; Mathematics; Functional data analysis; Semiparametric model; Mathematical optimization; Function (biology); Parametric model; Nonparametric regression; Applied mathematics; Computer science; Econometrics; Statistics; Spline interpolation; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1083247700227626,"gpt":0.3590536582647492,"spread":0.2507288882419866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004737941,0.0001600595,0.0002993413,0.00005659875,0.0001912781,0.00005635319,0.00006759517,0.00002852173,0.00004418944],"category_scores_gemma":[0.002454758,0.0001221629,0.00000948128,0.0001582991,0.000158503,0.00004030802,0.00009634869,0.0001507744,6.633084e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006116632,"about_ca_system_score_gemma":0.00002000917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005746257,"about_ca_topic_score_gemma":0.000003476917,"domain_scores_codex":[0.9989943,0.0000891946,0.0002983598,0.0002478075,0.0001476084,0.0002227157],"domain_scores_gemma":[0.996941,0.002559342,0.0001843149,0.0001127874,0.0001040803,0.00009851148],"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.00002968063,0.00006462673,0.006585812,0.001119405,0.00005931701,0.00003594498,0.00222738,0.000004684978,0.00003093551,0.8342198,0.0001713628,0.1554511],"study_design_scores_gemma":[0.0005273803,0.0002905692,0.01833156,0.0009988224,0.00009496554,0.00004935783,0.0002748882,0.2810887,0.00007937649,0.6979207,0.0000129787,0.0003307204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08618274,0.0002686073,0.9123016,0.00001765091,0.00004087761,0.000127224,0.00002713942,0.00004136128,0.0009927963],"genre_scores_gemma":[0.27947,0.00002811306,0.720379,0.00007175084,0.00002132026,0.000002102058,0.000002184294,0.00001379624,0.00001168282],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.281084,"threshold_uncertainty_score":0.4981659,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146848251","doi":"10.1023/a:1008943611855","title":"A permutation procedure for testing the equality of pattern hypotheses across groups involving correlation or covariance matrices","year":2000,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Sample size determination; Monte Carlo method; Statistics; Group (periodic table); Covariance matrix; Permutation (music); Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.05337529749215734,"gpt":0.3341030535837392,"spread":0.2807277560915818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003765923,0.0000677032,0.00009392556,0.00001043254,0.0004226931,0.0001913431,0.00007631583,0.00001140152,0.00004512983],"category_scores_gemma":[0.0001321869,0.00004538042,0.00001579557,0.000127999,0.00008442425,0.00008896481,0.00002957043,0.00005263384,0.000001117575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005172272,"about_ca_system_score_gemma":0.00005289973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002637405,"about_ca_topic_score_gemma":0.00002016328,"domain_scores_codex":[0.9993146,0.00003332335,0.0001979499,0.0001477699,0.0001302866,0.0001760416],"domain_scores_gemma":[0.9986477,0.001007665,0.0001274456,0.00007256603,0.0001173575,0.00002719721],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000873594,0.00006535075,0.1156477,0.0003214769,0.00003759132,6.828573e-7,0.008136035,0.005167173,0.0003573189,0.02720665,0.0003409408,0.8426318],"study_design_scores_gemma":[0.0005016834,0.0001158819,0.07002439,0.0001446619,0.00001994692,0.000001712973,0.006605756,0.8906377,0.0001972286,0.03146263,0.0001312495,0.0001571429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5066493,0.00004134206,0.4926052,0.0000159571,0.00003171793,0.0001597737,0.0003229878,0.000005896509,0.0001678131],"genre_scores_gemma":[0.9915673,0.000002137826,0.008130564,0.00001501982,0.00009396395,0.000008549595,0.00004446823,0.000005754912,0.0001323008],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8854706,"threshold_uncertainty_score":0.3251056,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1534769976","doi":"10.1023/a:1024226918553","title":"Numerical optimization and surface estimation with imprecise function evaluations","year":2003,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; University of British Columbia","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Hessian matrix; Mathematical optimization; Computer science; Quadratic equation; Variety (cybernetics); Function (biology); Class (philosophy); Mathematics; Algorithm; Artificial intelligence; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.008731772407130528,"gpt":0.251082748410638,"spread":0.2423509760035075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001580363,0.00008293056,0.00008141375,0.0000265921,0.0002325067,0.0002414305,0.00005603125,0.00002236133,0.000006294089],"category_scores_gemma":[0.00005255283,0.00007133786,0.000004345627,0.0001853478,0.00002781964,0.0001781953,0.00002598884,0.00005813749,0.000001380394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000095378,"about_ca_system_score_gemma":0.0000561236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007434845,"about_ca_topic_score_gemma":9.998266e-7,"domain_scores_codex":[0.9993598,0.0000401275,0.0001269742,0.000219707,0.000131831,0.0001215956],"domain_scores_gemma":[0.9995525,0.0001017206,0.00007849318,0.00009973282,0.0001080006,0.00005948801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004628156,0.00002689693,0.001500043,0.0000449332,0.00001140227,0.000002610283,0.0003971185,0.3827404,0.00001831165,0.4250115,0.00006674097,0.1901754],"study_design_scores_gemma":[0.000188355,0.0001132993,0.002282209,0.00002075641,0.00001092805,0.00002316945,0.00001957839,0.9815471,0.00002602999,0.01564647,0.00002250541,0.00009956853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003367185,0.0000758836,0.9959629,0.00006613469,0.00006048784,0.00007937343,0.000002687757,0.00003969705,0.0003456644],"genre_scores_gemma":[0.502542,0.00000680709,0.4974082,0.00002481368,0.000003880652,6.443828e-7,0.000003121019,0.000002654624,0.000007882678],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5988067,"threshold_uncertainty_score":0.2909074,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2976033080","doi":"10.1007/s11222-019-09899-5","title":"Adaptive step-size selection for state-space probabilistic differential equation solvers","year":2019,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Selection (genetic algorithm); State space; Probabilistic logic; Applied mathematics; Space (punctuation); Differential equation; Computer science; Mathematical optimization; Algorithm; Theoretical computer science; Mathematical analysis; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04945765908105304,"gpt":0.2971784337226182,"spread":0.2477207746415651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008388908,0.0001545766,0.0002567298,0.00007724059,0.0001936317,0.0002108867,0.0001550956,0.00005174624,0.00005492116],"category_scores_gemma":[0.00203632,0.0001261815,0.00003876167,0.0002073431,0.00005207147,0.00007869887,0.00006836639,0.0001095805,0.00002290268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005691482,"about_ca_system_score_gemma":0.00007893342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002692632,"about_ca_topic_score_gemma":0.00001186353,"domain_scores_codex":[0.9983532,0.00007534648,0.0004037828,0.0004393615,0.0004474731,0.0002808402],"domain_scores_gemma":[0.9949577,0.004238344,0.0001980512,0.0001545087,0.0003665939,0.00008481489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003232058,0.0001222768,0.00372983,0.0001809676,0.0001009057,0.000002263437,0.001720966,0.369812,0.001186219,0.4643956,0.006629588,0.1517963],"study_design_scores_gemma":[0.0004720993,0.0002571997,0.002989039,0.00002358633,0.00001856868,0.000002050288,0.0001705724,0.9241088,0.00002415832,0.07149714,0.0002731377,0.0001636228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05352789,0.00001904266,0.9450492,0.00003089255,0.0005730132,0.0005340965,0.00008433111,0.00004605099,0.0001354388],"genre_scores_gemma":[0.8335468,0.000001852989,0.1656297,0.00001546677,0.00007050833,0.000006958552,0.000008894808,0.0000136598,0.0007061989],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7800189,"threshold_uncertainty_score":0.5145534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4312115622","doi":"10.1007/s11222-022-10190-3","title":"Sparse logistic functional principal component analysis for binary data","year":2022,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Renmin University of China","keywords":"Principal component analysis; Binary data; Binary number; Computer science; Minification; Consistency (knowledge bases); Component (thermodynamics); Algorithm; Bernoulli's principle; Mathematical optimization; Bernoulli distribution; Functional principal component analysis; Mathematics; Data mining; Pattern recognition (psychology); Artificial intelligence; Statistics; Random variable","retraction":null,"screen_n_in":null,"score":{"opus":0.3349671313957799,"gpt":0.4151122394743477,"spread":0.08014510807856784,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009288428,0.0001259659,0.0002995058,0.00009057189,0.0005529211,0.00004902162,0.0002257331,0.00001878099,0.000265445],"category_scores_gemma":[0.001074942,0.000122914,0.00003456501,0.0002244377,0.0000747531,0.00001740722,0.0007784817,0.0001574619,0.000001117306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000322329,"about_ca_system_score_gemma":0.00004789301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003046009,"about_ca_topic_score_gemma":0.000007685893,"domain_scores_codex":[0.9986287,0.000137261,0.0003521828,0.0003838552,0.0002607296,0.0002372378],"domain_scores_gemma":[0.9955148,0.003810186,0.0001601098,0.0003541022,0.00007840178,0.00008237213],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004632556,0.0001367786,0.002081793,0.0000981251,0.0002759378,0.0000159012,0.0001043219,0.002414493,0.00002787372,0.9726458,0.004213909,0.01793878],"study_design_scores_gemma":[0.0002535166,0.0001239202,0.01119944,0.000004408669,0.0003610298,0.000006599065,0.000124233,0.7560575,9.724921e-7,0.2302968,0.001429394,0.0001421497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01393259,0.00004535208,0.9810558,0.00005457017,0.0002387805,0.0001830515,0.004302375,0.0000319822,0.000155499],"genre_scores_gemma":[0.4295671,0.000002013762,0.5697295,0.00006360597,0.0000583696,0.00001037127,0.0005026773,0.000009896194,0.00005650449],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.753643,"threshold_uncertainty_score":0.5012288,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403558230","doi":"10.1007/s11222-024-10501-w","title":"Functional autoencoder for smoothing and representation learning","year":2024,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Image Processing and 3D Reconstruction","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Autoencoder; Smoothing; Representation (politics); Artificial intelligence; Computer science; Feature learning; Pattern recognition (psychology); Functional data analysis; Machine learning; Mathematics; Deep learning; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.01745208203611701,"gpt":0.2771719733766146,"spread":0.2597198913404976,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001825256,0.00005388711,0.00005661835,0.00005301751,0.0003076793,0.0005618924,0.00003315203,0.00001936818,0.00000123575],"category_scores_gemma":[0.00005720094,0.00005180427,0.00000945835,0.00007990009,0.00002935413,0.0001730782,0.00005118956,0.00009099095,9.502879e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007046474,"about_ca_system_score_gemma":0.0000362911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008593577,"about_ca_topic_score_gemma":5.945745e-7,"domain_scores_codex":[0.9994893,0.00001650173,0.000103801,0.0002243881,0.00006732869,0.00009865622],"domain_scores_gemma":[0.9996079,0.000250723,0.00002989179,0.00003695105,0.00004869395,0.0000258045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001164543,0.000001771238,0.0002931541,0.00009297229,0.000008125236,0.000002509847,0.0007209368,0.0007007185,0.0001059151,0.1042408,0.0003999125,0.893432],"study_design_scores_gemma":[0.00007821034,0.00002131475,0.0009652779,0.00005096045,0.00000598924,0.00006206409,0.0000723491,0.9637834,0.00005802829,0.03424339,0.0005942491,0.00006469931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004139866,0.0005043366,0.9942973,0.0001796822,0.0005417105,0.00004025746,0.000002454638,0.0001240483,0.0001703588],"genre_scores_gemma":[0.4658305,0.0000134426,0.5337624,0.00003082965,0.0001122787,0.000001765568,0.000005979688,0.000005076701,0.000237722],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9630827,"threshold_uncertainty_score":0.5418341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2280270471","doi":"10.1007/s11222-016-9641-6","title":"Mixture models: building a parameter space","year":2016,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Space (punctuation); Parameter space; Mixture model; Mathematics; Computer science; Applied mathematics; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01936795463846525,"gpt":0.2714557642212007,"spread":0.2520878095827354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003262143,0.0001427568,0.0001703337,0.00005268644,0.0001462153,0.0001566493,0.0002847353,0.00005292424,0.000002756527],"category_scores_gemma":[0.00007468563,0.00009541875,0.00002663751,0.0001093241,0.00004525104,0.0001752119,0.00027212,0.00009226635,0.000002698441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001482208,"about_ca_system_score_gemma":0.0000269994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009354204,"about_ca_topic_score_gemma":0.00000122973,"domain_scores_codex":[0.9989085,0.00007819918,0.0001764097,0.0003838394,0.0001469595,0.0003061348],"domain_scores_gemma":[0.9989184,0.0005389689,0.00008061268,0.0002818078,0.00006370754,0.0001164598],"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":[8.604093e-7,0.000004463673,0.00001367189,0.000006514449,0.000005612847,0.00001057944,0.0001520301,0.00001089719,0.0003687446,0.5894294,0.0004186189,0.4095786],"study_design_scores_gemma":[0.000159492,0.00002807239,0.00005880297,0.00005087987,0.000004483707,0.00002586181,0.000002491663,0.425355,0.0002230875,0.5733413,0.0006103512,0.0001401759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001782538,0.000224884,0.9962482,0.0006684301,0.0002208386,0.00006923927,0.00001397334,0.00008304266,0.0006888727],"genre_scores_gemma":[0.2995619,0.00002646626,0.7000446,0.0001947757,0.00005608345,0.000001011242,2.898235e-7,0.000007751354,0.0001071414],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4253441,"threshold_uncertainty_score":0.3891064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}