{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":83,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":83,"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":"dd146784d1e0","filters":{"venue":"Journal of Computational and Graphical Statistics"}},"results":[{"id":"W2080972498","doi":"10.1080/10618600.2000.10474879","title":"Markov Chain Sampling Methods for Dirichlet Process Mixture Models","year":2000,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":2212,"is_retracted":false,"has_abstract":true,"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":"Gibbs sampling; Dirichlet distribution; Hierarchical Dirichlet process; Markov chain Monte Carlo; Metropolis–Hastings algorithm; Markov chain; Dirichlet process; Mathematics; Prior probability; Conjugate prior; Computer science; Sampling (signal processing); Mathematical optimization; Applied mathematics; Statistics; Bayesian probability","retraction":null,"screen_n_in":null,"score":{"opus":0.02605654607133213,"gpt":0.3550975326748263,"spread":0.3290409866034942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054532,0.0001490798,0.000317417,0.0001293733,0.0001577878,0.0001299352,0.0003163076,0.00008485125,0.00001255237],"category_scores_gemma":[0.0001024154,0.0001148823,0.00009654633,0.0002752469,0.00007231227,0.0002832073,0.00002537238,0.0002461946,2.506947e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001035848,"about_ca_system_score_gemma":0.00009096467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.270688e-7,"about_ca_topic_score_gemma":3.06515e-7,"domain_scores_codex":[0.9986115,0.0001755477,0.0005095894,0.0002039827,0.0002955334,0.0002038791],"domain_scores_gemma":[0.9975937,0.001422531,0.000222535,0.00008576601,0.0004787429,0.000196707],"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.00004749068,0.00005001666,0.000008689816,0.00003801357,0.00003641401,0.000005503342,0.0001999221,0.01033575,0.000009194619,0.3817591,0.0004257402,0.6070842],"study_design_scores_gemma":[0.0002977845,0.000112482,0.0002847928,0.00001846716,0.00001606414,0.00009059925,0.000002083708,0.4208212,0.000005446339,0.5772555,0.001009269,0.00008626935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007547858,0.0005908089,0.9968912,0.001351629,0.0001305515,0.0001196621,0.0000493186,0.00001377339,0.00009827616],"genre_scores_gemma":[0.01772333,0.00011491,0.9812755,0.0006920618,0.0001310016,0.000004498093,0.000006813851,0.000009536401,0.0000423416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6069979,"threshold_uncertainty_score":0.4684763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047978125","doi":"10.1198/jcgs.2009.06134","title":"Examples of Adaptive MCMC","year":2009,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1078,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain Monte Carlo; Metropolis–Hastings algorithm; Gibbs sampling; Markov chain; Computer science; Algorithm; Logarithm; Dimension (graph theory); Multivariate statistics; Mathematics; Artificial intelligence; Machine learning; Bayesian probability","retraction":null,"screen_n_in":null,"score":{"opus":0.05855318414416023,"gpt":0.3456207258929976,"spread":0.2870675417488374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004795981,0.0000830967,0.0002875466,0.0001058386,0.00003816824,0.00001144114,0.00006726487,0.00004265496,0.000008886655],"category_scores_gemma":[0.0004461674,0.00006225816,0.00007019271,0.0001098691,0.00009010966,0.00004261683,0.00001125109,0.0001447257,9.723732e-9],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000070275,"about_ca_system_score_gemma":0.00004084712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001554516,"about_ca_topic_score_gemma":0.000001538852,"domain_scores_codex":[0.9989315,0.00009363394,0.0004973593,0.00006343063,0.0003276519,0.00008647561],"domain_scores_gemma":[0.9973207,0.001684264,0.0003808489,0.00004083948,0.0004754041,0.00009800933],"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.0001148359,0.0001365027,0.0002480379,0.00002931106,0.00005239222,0.00002214842,0.0001702353,0.0002223871,0.00006997374,0.9606035,0.002333751,0.03599695],"study_design_scores_gemma":[0.000472597,0.0006655096,0.0126106,0.00004586666,0.00004960059,0.00007654084,0.00006158901,0.003702119,0.00002926292,0.9817947,0.0004203719,0.00007125843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1041341,0.0001908342,0.8949464,0.0002847784,0.00006243341,0.00004422226,0.0000662048,0.000003548427,0.0002674117],"genre_scores_gemma":[0.4915061,0.00003933818,0.5083071,0.00007982179,0.00004916126,1.37263e-7,0.000001712046,0.00000298188,0.00001360942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.387372,"threshold_uncertainty_score":0.2538814,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4237780050","doi":"10.2307/1390653","title":"Markov Chain Sampling Methods for Dirichlet Process Mixture Models","year":2000,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":508,"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","keywords":"Dirichlet process; Markov chain; Mathematics; Dirichlet distribution; Sampling (signal processing); Slice sampling; Markov chain Monte Carlo; Hierarchical Dirichlet process; Computer science; Markov renewal process; Applied mathematics; Statistics; Econometrics; Statistical physics; Markov model; Variable-order Markov model; Bayesian probability; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02605654607133213,"gpt":0.3550975326748263,"spread":0.3290409866034942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054532,0.0001490798,0.000317417,0.0001293733,0.0001577878,0.0001299352,0.0003163076,0.00008485125,0.00001255237],"category_scores_gemma":[0.0001024154,0.0001148823,0.00009654633,0.0002752469,0.00007231227,0.0002832073,0.00002537238,0.0002461946,2.506947e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001035848,"about_ca_system_score_gemma":0.00009096467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.270688e-7,"about_ca_topic_score_gemma":3.06515e-7,"domain_scores_codex":[0.9986115,0.0001755477,0.0005095894,0.0002039827,0.0002955334,0.0002038791],"domain_scores_gemma":[0.9975937,0.001422531,0.000222535,0.00008576601,0.0004787429,0.000196707],"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.00004749068,0.00005001666,0.000008689816,0.00003801357,0.00003641401,0.000005503342,0.0001999221,0.01033575,0.000009194619,0.3817591,0.0004257402,0.6070842],"study_design_scores_gemma":[0.0002977845,0.000112482,0.0002847928,0.00001846716,0.00001606414,0.00009059925,0.000002083708,0.4208212,0.000005446339,0.5772555,0.001009269,0.00008626935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007547858,0.0005908089,0.9968912,0.001351629,0.0001305515,0.0001196621,0.0000493186,0.00001377339,0.00009827616],"genre_scores_gemma":[0.01772333,0.00011491,0.9812755,0.0006920618,0.0001310016,0.000004498093,0.000006813851,0.000009536401,0.0000423416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6069979,"threshold_uncertainty_score":0.4684763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162021827","doi":"10.1198/1061860043001","title":"A Split-Merge Markov chain Monte Carlo Procedure for the Dirichlet Process Mixture Model","year":2004,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":475,"is_retracted":false,"has_abstract":true,"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":"Gibbs sampling; Markov chain Monte Carlo; Metropolis–Hastings algorithm; Hierarchical Dirichlet process; Dirichlet distribution; Rejection sampling; Dirichlet process; Markov chain; Slice sampling; Computer science; Algorithm; Monte Carlo method; Merge (version control); Hybrid Monte Carlo; Mathematics; Bayesian probability; Artificial intelligence; Latent Dirichlet allocation; Machine learning; Statistics; Topic model","retraction":null,"screen_n_in":null,"score":{"opus":0.01124520141011327,"gpt":0.2784303576061979,"spread":0.2671851561960846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000533215,0.0001602078,0.0002509512,0.0000929427,0.0002325008,0.0001246344,0.0004054726,0.00007843803,8.961514e-7],"category_scores_gemma":[0.0001547017,0.0000978698,0.0001029805,0.0002779221,0.0001035469,0.0001900417,0.00004586494,0.0003021274,1.571832e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001764943,"about_ca_system_score_gemma":0.000251496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002483643,"about_ca_topic_score_gemma":0.000004454103,"domain_scores_codex":[0.9986659,0.00004307498,0.000430394,0.0001939945,0.0004587141,0.0002078824],"domain_scores_gemma":[0.9982944,0.0005357487,0.0002871034,0.00009981736,0.0006210398,0.0001619088],"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.00007410368,0.0001033606,0.00004695313,0.00009069731,0.00007770558,0.00001857869,0.0006759507,0.1643252,0.000007320963,0.8034155,0.001639788,0.02952489],"study_design_scores_gemma":[0.0004559327,0.0001078303,0.0009492292,0.00002413578,0.00002496358,0.00009606746,0.000006923928,0.4646638,0.000003281443,0.5334821,0.0001080475,0.00007762013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004489921,0.000765975,0.9869781,0.007298457,0.0001393472,0.0002099695,0.00009284593,0.00001156237,0.00001378097],"genre_scores_gemma":[0.3112903,0.00006376345,0.6876686,0.0008304665,0.0001061962,0.000008544285,0.000002019278,0.000007758885,0.00002239802],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3068003,"threshold_uncertainty_score":0.3991015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4250766106","doi":"10.1198/jcgs.2011.09224","title":"Functional Boxplots","year":2011,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":417,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"King Abdullah University of Science and Technology; University of Windsor; National Science Foundation","keywords":"Functional data analysis; Outlier; Computer science; Generalization; Exploratory data analysis; Anomaly detection; Envelope (radar); Artificial intelligence; Statistics; Data mining; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.1505638811360017,"gpt":0.3748389603369975,"spread":0.2242750792009958,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003409146,0.000103926,0.0002408389,0.00009389988,0.00008107496,0.00001366067,0.00006262342,0.00004678668,0.0001389129],"category_scores_gemma":[0.0006602133,0.00007866404,0.0000553319,0.00009850151,0.0001543946,0.00009328518,0.00002297177,0.0002112126,0.000001838851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009258873,"about_ca_system_score_gemma":0.00004202575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001376376,"about_ca_topic_score_gemma":9.236361e-7,"domain_scores_codex":[0.9988468,0.00007415766,0.0004974521,0.00009758372,0.0003571881,0.000126807],"domain_scores_gemma":[0.9974412,0.001642062,0.0002613053,0.00004370527,0.0004344843,0.0001772216],"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.0001092022,0.0001326334,0.0002794518,0.00002512809,0.00005127006,0.00004390517,0.000109365,0.00009071273,0.000008122581,0.9810767,0.00238399,0.01568949],"study_design_scores_gemma":[0.000444681,0.0002534416,0.02416473,0.00001882415,0.00005180869,0.0001751733,0.00002265829,0.00237622,0.000009887646,0.9720933,0.0002965262,0.00009272834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009713349,0.00006508465,0.9895315,0.0001008357,0.0001591983,0.00004166462,0.00007345768,0.000008812672,0.0003060668],"genre_scores_gemma":[0.1995237,0.00002520217,0.8002076,0.000120023,0.0000760995,9.392591e-7,0.00000315541,0.00000921431,0.00003405915],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1898104,"threshold_uncertainty_score":0.3207827,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003144493","doi":"10.1198/jcgs.2010.08111","title":"Combining Mixture Components for Clustering","year":2010,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":348,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development; National Institute of Biomedical Imaging and Bioengineering; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health","keywords":"Mixture model; Cluster analysis; Mathematics; Determining the number of clusters in a data set; Gaussian; Entropy (arrow of time); Piecewise; Cluster (spacecraft); Computer science; Statistics; Correlation clustering; CURE data clustering algorithm; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01577668605565137,"gpt":0.280924284971499,"spread":0.2651475989158477,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004665871,0.00009165982,0.0002030378,0.0001014583,0.0001262737,0.0001100951,0.0002381401,0.00006197485,0.000002374549],"category_scores_gemma":[0.0001015722,0.00007283157,0.00006240654,0.0001065524,0.00006594029,0.0001494417,0.00005604078,0.0003089091,2.48159e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003724058,"about_ca_system_score_gemma":0.00003890878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001102164,"about_ca_topic_score_gemma":0.000002284105,"domain_scores_codex":[0.9991261,0.00004425117,0.0003422043,0.0001142129,0.0002442923,0.000128986],"domain_scores_gemma":[0.9984448,0.0007855499,0.0002186642,0.00006470796,0.0003360366,0.0001502328],"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.00002969821,0.00006147537,0.0002309514,0.00002821711,0.0000366881,0.00001673255,0.0001437094,0.0003278636,0.0006863637,0.901702,0.001062051,0.09567425],"study_design_scores_gemma":[0.0004287992,0.0001330915,0.006401922,0.00001377224,0.00001109799,0.0001912329,0.000001415737,0.2819791,0.00001807441,0.7092867,0.001456692,0.0000780667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008619989,0.0000482209,0.9895879,0.001023947,0.0005816144,0.00006354139,0.00003137148,0.000008646407,0.00003476546],"genre_scores_gemma":[0.3087418,0.000006323152,0.6908777,0.0002702254,0.00008890734,8.255747e-7,0.000004089084,0.000003878346,0.00000629058],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3001218,"threshold_uncertainty_score":0.2969985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072240935","doi":"10.1198/106186008x321068","title":"Adjusted Empirical Likelihood and its Properties","year":2008,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":207,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"ASL Environmental Sciences (Canada); University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Empirical likelihood; Likelihood function; Restricted maximum likelihood; Mathematics; Maximization; Expectation–maximization algorithm; Likelihood principle; Statistics; Mathematical optimization; Econometrics; Maximum likelihood; Computer science; Quasi-maximum likelihood; Confidence interval","retraction":null,"screen_n_in":null,"score":{"opus":0.1560701957070837,"gpt":0.353252275367028,"spread":0.1971820796599443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002870651,0.0001217793,0.0003186315,0.0000928977,0.0001431908,0.00002537334,0.0000658033,0.00006322092,0.0000301178],"category_scores_gemma":[0.001740959,0.00008362722,0.000036974,0.0001287168,0.0002164377,0.0000645746,0.00003588423,0.0002608035,0.000001249819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008237195,"about_ca_system_score_gemma":0.00008228958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001517929,"about_ca_topic_score_gemma":9.076595e-7,"domain_scores_codex":[0.998683,0.0001242187,0.0005310097,0.0001103375,0.0004017413,0.000149677],"domain_scores_gemma":[0.997012,0.001982647,0.000210445,0.00003571213,0.0005342379,0.0002249663],"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.0002526931,0.0004053893,0.009742261,0.0002672649,0.000161111,0.0002714604,0.0008564467,0.00005926362,0.00008694334,0.9518283,0.005875467,0.03019341],"study_design_scores_gemma":[0.0005886345,0.0004237986,0.07890843,0.00005685447,0.00005116689,0.0008371325,0.0000298005,0.01574652,0.00001802974,0.9029619,0.0002543553,0.0001234136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4956645,0.0005471708,0.5028055,0.0006796296,0.00007915303,0.00006960484,0.00006733573,0.000009477792,0.0000776383],"genre_scores_gemma":[0.6463267,0.0001707286,0.3532394,0.0001738507,0.00006529036,9.370223e-7,0.000001336651,0.000007038806,0.00001478338],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1506621,"threshold_uncertainty_score":0.3410219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138868843","doi":"10.1198/106186002317375631","title":"A Brief History of the Mosaic Display","year":2002,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Mosaic; Computer science; Computer graphics (images); Artificial intelligence; Geography; Archaeology","retraction":null,"screen_n_in":null,"score":{"opus":0.01885865524218231,"gpt":0.2492495687104026,"spread":0.2303909134682203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001385392,0.00005804724,0.0001273428,0.00007093872,0.00004076496,0.00002721325,0.0002887294,0.0000230879,0.00002838767],"category_scores_gemma":[0.0001099907,0.00003794231,0.000052026,0.0002003413,0.0001508483,0.0001320716,0.00006285147,0.0001125494,9.291475e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002224372,"about_ca_system_score_gemma":0.00005511633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002169787,"about_ca_topic_score_gemma":0.000001114872,"domain_scores_codex":[0.9990587,0.00005449847,0.0003505974,0.0000680231,0.0004005658,0.00006763265],"domain_scores_gemma":[0.9990362,0.000246294,0.0003066243,0.00008010258,0.0002572095,0.00007359595],"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.000003290317,0.0001203389,0.001325086,0.00001903202,0.00003015274,0.000009264965,0.0002553166,0.001681836,0.000008902462,0.9230759,0.06520429,0.008266618],"study_design_scores_gemma":[0.0004732675,0.0001278666,0.02476968,0.00003402927,0.00002595456,0.000116331,0.000006497917,0.7420222,0.000003413633,0.1816608,0.05067055,0.00008946952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001848731,0.0004047993,0.9962597,0.001000285,0.000269962,0.00002229437,0.00005113663,0.000003781292,0.0001392694],"genre_scores_gemma":[0.8904844,0.0002042042,0.1071035,0.001563923,0.00007629446,3.47464e-7,0.00000783097,0.000006426413,0.0005530462],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8891562,"threshold_uncertainty_score":0.1547243,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2416022617","doi":"10.1080/10618600.2016.1195273","title":"Locally Sparse Estimator for Functional Linear Regression Models","year":2016,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Toronto","funders":"","keywords":"Mathematics; Estimator; Linear model; Linear regression; Computer science; Statistics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1097634670549549,"gpt":0.3628663477227261,"spread":0.2531028806677713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000496712,0.0001339388,0.0003060582,0.00009517387,0.0001151069,0.00002244529,0.00008091988,0.00007381436,0.00005417769],"category_scores_gemma":[0.002283183,0.00007393936,0.00007846395,0.00008339613,0.0001847105,0.0000997011,0.00002556273,0.0001264493,0.000001341288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001736626,"about_ca_system_score_gemma":0.0001038763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.044529e-7,"about_ca_topic_score_gemma":5.439691e-7,"domain_scores_codex":[0.9985852,0.00007436312,0.0006142315,0.0001330651,0.0004368939,0.0001562307],"domain_scores_gemma":[0.9910969,0.007430661,0.0003426403,0.00005626839,0.000873033,0.000200504],"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.0002763591,0.00009904731,0.0002023139,0.00005243677,0.00004603802,0.00001101589,0.00001442633,0.00059912,0.00005197779,0.95148,0.005941184,0.0412261],"study_design_scores_gemma":[0.001042055,0.0003672912,0.003294529,0.0001514619,0.00005105915,0.00007919611,0.000006037466,0.09821142,0.00001639201,0.8963519,0.00032239,0.0001062482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007970904,0.0000503532,0.9903328,0.0009700311,0.0001885473,0.00009427008,0.0003510907,0.000009225252,0.00003270685],"genre_scores_gemma":[0.1439615,0.00003171954,0.855663,0.0001147906,0.0001669652,0.000003682396,0.000004854691,0.00001230152,0.00004116477],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1359906,"threshold_uncertainty_score":0.301516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053652664","doi":"10.1080/10618600.2013.841584","title":"Parallel Bayesian Additive Regression Trees","year":2014,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Acadia University","funders":"Office of Science; U.S. Department of Energy","keywords":"Markov chain Monte Carlo; Computer science; Bayesian probability; Boosting (machine learning); Approximate Bayesian computation; Bayesian inference; Inference; Computation; Machine learning; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.007996393648830565,"gpt":0.2454976015265561,"spread":0.2375012078777256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002186912,0.0001099097,0.000203586,0.0001227798,0.000123236,0.000133729,0.0002752533,0.00004696703,0.00001434145],"category_scores_gemma":[0.0001401353,0.00007571774,0.00004724539,0.0002057882,0.0001041129,0.000250544,0.0000558119,0.000190709,0.00000225358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007893298,"about_ca_system_score_gemma":0.00007269059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001666933,"about_ca_topic_score_gemma":0.000002214156,"domain_scores_codex":[0.9988847,0.00007508211,0.0003696555,0.0001375593,0.0003974826,0.0001355416],"domain_scores_gemma":[0.998534,0.0005623002,0.0003106119,0.00007058605,0.0003434714,0.0001790294],"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.00002551592,0.00005464186,0.0005793546,0.00001400488,0.00001975851,0.00002632467,0.0001010541,0.0008142871,0.000003347766,0.8625697,0.00253023,0.1332617],"study_design_scores_gemma":[0.0003711856,0.000306753,0.05063203,0.0000519885,0.000008859745,0.000142721,0.000006699973,0.1411783,0.000005108753,0.805434,0.001766793,0.0000955595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001181286,0.0000841874,0.9966915,0.001683465,0.0001164692,0.00002591214,0.00001735504,0.00001063045,0.0001892535],"genre_scores_gemma":[0.5968732,0.0000485135,0.402731,0.0002585811,0.00007125547,5.146971e-7,0.000003545736,0.000002844259,0.00001056192],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5956919,"threshold_uncertainty_score":0.308768,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050605581","doi":"10.1198/1061860031220","title":"Feature Extraction for Nonparametric Discriminant Analysis","year":2003,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"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; National Institutes of Health; National Science Foundation","keywords":"Linear discriminant analysis; Pattern recognition (psychology); Optimal discriminant analysis; Kernel Fisher discriminant analysis; Multiple discriminant analysis; Mathematics; Artificial intelligence; Discriminant; Dimensionality reduction; Nonparametric statistics; Curse of dimensionality; Projection pursuit; Parametric statistics; Gaussian; Statistics; Computer science; Facial recognition system","retraction":null,"screen_n_in":null,"score":{"opus":0.01434330132293588,"gpt":0.2887800612265566,"spread":0.2744367599036208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002716637,0.00007333754,0.0001777113,0.0003784398,0.0001126005,0.00009673467,0.0000940559,0.00004764285,0.000005091514],"category_scores_gemma":[0.0002212805,0.00005391878,0.000105496,0.0007120033,0.00003088809,0.0002088712,0.00001021526,0.0001274422,6.994949e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009244658,"about_ca_system_score_gemma":0.00003975729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.352325e-7,"about_ca_topic_score_gemma":0.000001337947,"domain_scores_codex":[0.9992209,0.00005523824,0.0002321699,0.000110307,0.0002816978,0.00009967618],"domain_scores_gemma":[0.9984632,0.0007465727,0.0002364318,0.00004723332,0.0004029048,0.0001037186],"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.0001027914,0.0004161792,0.00415861,0.00006922675,0.0006319643,0.00004877678,0.0001992237,0.02635634,0.0002121051,0.8508772,0.02033427,0.09659328],"study_design_scores_gemma":[0.0007637118,0.0003673611,0.07601929,0.00001911765,0.0003164696,0.0001516519,0.00003301206,0.1916443,0.00009669215,0.7229342,0.007491765,0.000162328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01259214,0.0001544977,0.986118,0.0008523383,0.0001714549,0.00004960756,0.00003279906,0.000004954343,0.00002421002],"genre_scores_gemma":[0.4476545,0.00004872292,0.5521119,0.0001212868,0.00002350818,0.000001537559,0.00001130099,0.000002148203,0.00002507268],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4350623,"threshold_uncertainty_score":0.2198744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144832675","doi":"10.1080/10618600.2013.844700","title":"Bayesian Estimation of Discrete Multivariate Latent Structure Models With Structural Zeros","year":2013,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Memorial University of Newfoundland; National Science Foundation","keywords":"Categorical variable; Local independence; Conditional independence; Latent class model; Mathematics; Posterior probability; Bayesian probability; Latent variable; Econometrics; Computer science; Latent variable model; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.008773760577415121,"gpt":0.2503721420045232,"spread":0.241598381427108,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001376353,0.0001393978,0.0002799453,0.0001227433,0.00007884826,0.0001032778,0.0002091145,0.00005850392,0.00001025084],"category_scores_gemma":[0.00002821515,0.00008804619,0.00004607117,0.0001924409,0.0001147453,0.0005323456,0.00004559337,0.0002139724,1.708572e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001002745,"about_ca_system_score_gemma":0.00006325052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002273609,"about_ca_topic_score_gemma":0.000001392384,"domain_scores_codex":[0.9986929,0.0000944288,0.0004808153,0.0001434493,0.0004492934,0.0001390668],"domain_scores_gemma":[0.998563,0.0002671989,0.0004236436,0.00008968484,0.0004972904,0.0001592174],"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.00003317025,0.00002054543,0.0002645449,0.00003688566,0.00007240046,0.00001101562,0.0003125053,0.2534422,0.0001095599,0.6571018,0.00006054361,0.08853485],"study_design_scores_gemma":[0.0002942358,0.0001397194,0.01608103,0.00002078713,0.00001284502,0.00007519321,0.000001747942,0.4970749,0.00001829503,0.4862209,8.599129e-7,0.00005952542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03648087,0.00005652913,0.9627703,0.0004422833,0.00007560087,0.0001052294,0.00005406095,0.000006841257,0.000008250144],"genre_scores_gemma":[0.499469,0.000003664776,0.5004547,0.00004722048,0.00001505362,4.7758e-7,0.000004387447,0.00000344509,0.000002101192],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4629881,"threshold_uncertainty_score":0.3590419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037392129","doi":"10.1198/jcgs.2011.10021","title":"Penalized Nonlinear Least Squares Estimation of Time-Varying Parameters in Ordinary Differential Equations","year":2011,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"National Cancer Institute; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; National Institute of Allergy and Infectious Diseases; King Abdullah University of Science and Technology","keywords":"Ode; Ordinary differential equation; Applied mathematics; Nonlinear system; Mathematics; Non-linear least squares; Ordinary least squares; Least-squares function approximation; Function (biology); Mathematical optimization; Polynomial; Estimation theory; Algorithm; Differential equation; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02496376213044871,"gpt":0.2653934609609376,"spread":0.2404296988304889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008210022,0.00007607848,0.0001865161,0.0001266698,0.00004452401,0.00001396619,0.00004959352,0.00002360903,0.000229384],"category_scores_gemma":[0.00001485191,0.000063618,0.00005728244,0.0001246921,0.0000813865,0.00009259192,0.00001126234,0.0001521332,0.000001046877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004643504,"about_ca_system_score_gemma":0.00003144456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003153304,"about_ca_topic_score_gemma":5.64202e-7,"domain_scores_codex":[0.9991742,0.00005729432,0.0004353995,0.00006806576,0.0001855835,0.00007940167],"domain_scores_gemma":[0.999241,0.0002643157,0.000266593,0.00002778936,0.0001335855,0.00006670761],"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.0006867458,0.0009903751,0.006665721,0.00005124193,0.0002163107,0.00001559644,0.0007040714,0.8045516,0.0001189234,0.081094,0.0003537403,0.1045517],"study_design_scores_gemma":[0.000711705,0.0001480542,0.009877947,0.00004157049,0.00003497249,0.000007565417,0.00002302454,0.8348039,0.00004035621,0.1542345,0.000005783162,0.00007065909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3288831,0.00001515718,0.6708991,0.0000307776,0.00004905356,0.00003581251,0.0000400545,0.0000015048,0.00004540451],"genre_scores_gemma":[0.9046039,0.000005197202,0.09528717,0.0000110488,0.00003897704,9.661253e-7,0.00003629953,0.000004382226,0.00001208496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5757207,"threshold_uncertainty_score":0.2594267,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007402758","doi":"10.1198/106186001317114901","title":"Computational Algorithms for Censored-Data Problems Using Intersection Graphs","year":2001,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Censoring (clinical trials); Mathematics; Algorithm; Bivariate analysis; Intersection (aeronautics); Intersection graph; Graph; Nonparametric statistics; Computer science; Mathematical optimization; Discrete mathematics; Statistics; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.05423319711498033,"gpt":0.3320901280037434,"spread":0.2778569308887631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006836241,0.0001406142,0.0002576222,0.0002414161,0.0001870386,0.0001573276,0.0004169651,0.00006734417,0.000003520767],"category_scores_gemma":[0.00009990378,0.0001178538,0.00007401053,0.0003409556,0.0001065813,0.0004572747,0.0001092785,0.0002028847,2.930445e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002189191,"about_ca_system_score_gemma":0.0001102636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006768539,"about_ca_topic_score_gemma":0.000002287989,"domain_scores_codex":[0.9984704,0.0001009409,0.0005724918,0.0002510243,0.000419735,0.000185425],"domain_scores_gemma":[0.9979511,0.0007063116,0.000371521,0.0001280543,0.0006785521,0.0001644083],"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.00006212935,0.0001591739,0.0004614774,0.00004466229,0.000122384,0.0000349173,0.000180084,0.05837135,0.0000206262,0.7454051,0.001480579,0.1936575],"study_design_scores_gemma":[0.0004011035,0.0001383076,0.001567462,0.00002088673,0.00001938739,0.0004290204,0.000003778672,0.500366,8.256669e-7,0.496426,0.0005517068,0.0000755339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003287562,0.0001997331,0.995171,0.0006550979,0.0003840639,0.0001323319,0.0001395685,0.00001462522,0.0000160136],"genre_scores_gemma":[0.07841685,0.00005016488,0.9210658,0.0002460568,0.0001593336,0.00000128634,0.00004527769,0.000008545439,0.000006665371],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4419946,"threshold_uncertainty_score":0.4805937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964782536","doi":"10.1198/106186008x343785","title":"The Fast-τ Estimator for Regression","year":2008,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Estimator; Resampling; Heuristic; Mathematics; Computer science; Regression; Algorithm; Extremum estimator; Bootstrapping (finance); M-estimator; Statistics; Mathematical optimization; Econometrics","retraction":null,"screen_n_in":null,"score":{"opus":0.08631111371913629,"gpt":0.4154602009907002,"spread":0.3291490872715639,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003935179,0.00009587901,0.0002228958,0.00003900323,0.0004663355,0.00002135283,0.00008506477,0.00003930297,0.000003492565],"category_scores_gemma":[0.002058197,0.00005259296,0.00006350962,0.00006723258,0.0002517181,0.00005323534,0.00001901829,0.0001616913,2.488175e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000915489,"about_ca_system_score_gemma":0.00005616897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.202152e-7,"about_ca_topic_score_gemma":5.777451e-7,"domain_scores_codex":[0.9989251,0.00006489519,0.0004737706,0.0000821611,0.0003174497,0.0001366175],"domain_scores_gemma":[0.9899259,0.009094951,0.0003022551,0.00004861926,0.0004980259,0.0001302633],"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.0001414847,0.00004984219,0.00006925848,0.00002838431,0.00003213768,0.00002113217,0.00005895061,0.0004089616,0.000008225336,0.9569866,0.00654136,0.03565364],"study_design_scores_gemma":[0.0005136868,0.0002385104,0.001724163,0.00002800187,0.00002982198,0.0002388952,0.00002050555,0.03357888,0.00000578652,0.9610131,0.0025397,0.00006893098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005498856,0.0001857096,0.9932901,0.0006500804,0.000136049,0.00009642319,0.0001129137,0.000005560764,0.00002432678],"genre_scores_gemma":[0.05934463,0.0001424964,0.9402639,0.00007050734,0.00009743868,0.00000362851,0.000003328421,0.00001004449,0.00006408285],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05384578,"threshold_uncertainty_score":0.3586723,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998269350","doi":"10.1198/jcgs.2011.09189","title":"Conditional Logistic Regression With Longitudinal Follow-up and Individual-Level Random Coefficients: A Stable and Efficient Two-Step Estimation Method","year":2011,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Genetic and phenotypic traits in livestock","field":"Biochemistry, Genetics and Molecular Biology","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Parks Canada","keywords":"Statistics; Expectation–maximization algorithm; Mathematics; Likelihood function; Dimension (graph theory); Population; Computer science; Selection (genetic algorithm); Logistic regression; Random effects model; Econometrics; Estimation theory; Maximum likelihood; Artificial intelligence; Meta-analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04198617404020803,"gpt":0.2938342448776107,"spread":0.2518480708374027,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003085959,0.0001381758,0.0001996496,0.00007396565,0.0001392452,0.00003459316,0.00005905124,0.00006360345,0.00001196582],"category_scores_gemma":[0.0001144788,0.00009799102,0.00002551267,0.00007035665,0.0002909703,0.00000672489,0.00004571643,0.0001252377,1.59048e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004108643,"about_ca_system_score_gemma":0.00007015294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007163715,"about_ca_topic_score_gemma":0.000004626789,"domain_scores_codex":[0.9989963,0.00009217553,0.0003057418,0.0001826602,0.0002973826,0.0001257215],"domain_scores_gemma":[0.9990852,0.0002133381,0.0002318717,0.00004764831,0.0002751711,0.0001467878],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.01178703,0.001885734,0.06966396,0.0004334263,0.001686799,0.00008921681,0.001870038,0.3495182,0.000874163,0.4876118,0.003208526,0.07137109],"study_design_scores_gemma":[0.009300341,0.002824928,0.7683485,0.0001132843,0.000333313,0.0009842726,0.0001165135,0.04809262,0.0001490769,0.1693191,0.00009855534,0.0003194932],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2775593,0.0003227081,0.7217458,0.00002738609,0.00005366544,0.00007515287,0.0001980491,0.000001681544,0.00001615125],"genre_scores_gemma":[0.5861755,0.00001506239,0.4136476,0.00004366649,0.00002780854,0.000001599218,0.00007262434,0.000005119135,0.00001101043],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6986845,"threshold_uncertainty_score":0.3995958,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108273125","doi":"10.1080/10618600.2012.679223","title":"Stochastic Stepwise Ensembles for Variable Selection","year":2012,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Statistics; Feature selection; Selection (genetic algorithm); Mathematics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06160899670397949,"gpt":0.3520442986589162,"spread":0.2904353019549367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006926739,0.0001045832,0.0002589223,0.00009164606,0.0001135479,0.00003261063,0.00005397949,0.00005720813,0.00004595017],"category_scores_gemma":[0.00241123,0.00008102207,0.00004485972,0.0001354461,0.00007714592,0.00008665913,0.0000138759,0.0001568343,6.875529e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001617905,"about_ca_system_score_gemma":0.00005554794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001692302,"about_ca_topic_score_gemma":4.279611e-7,"domain_scores_codex":[0.9988989,0.00008224518,0.0004708453,0.0000727115,0.0002782829,0.0001969747],"domain_scores_gemma":[0.992516,0.006433994,0.000274256,0.00002998608,0.0005493612,0.0001963422],"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.00008609794,0.0001398153,0.0003842731,0.00007461813,0.00005345708,9.18707e-7,0.00006756154,0.0005173319,0.00004123212,0.9882304,0.002384264,0.008020014],"study_design_scores_gemma":[0.0005016265,0.0003099816,0.00711477,0.00003494721,0.0001061908,0.0001410631,0.00002087285,0.02666089,0.000006132322,0.9646336,0.0003711204,0.00009879213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01136975,0.0001037464,0.9878906,0.0001242028,0.0002137589,0.000101365,0.0001525265,0.000007266241,0.000036753],"genre_scores_gemma":[0.2319288,0.00000459398,0.7677376,0.00009099336,0.0002034569,0.000002699233,0.000004300001,0.000008716274,0.00001887939],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2205591,"threshold_uncertainty_score":0.3303984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992601594","doi":"10.1080/10618600.2015.1005213","title":"Tweedie’s Compound Poisson Model With Grouped Elastic Net","year":2015,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Poisson distribution; Mathematics; Library science; Statistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06901214203725027,"gpt":0.3349939212535888,"spread":0.2659817792163386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006524216,0.00014745,0.0003545123,0.0001195915,0.00006786632,0.00005363957,0.00009405854,0.00005965171,0.00000276421],"category_scores_gemma":[0.000414783,0.0001011414,0.00004860521,0.0001355119,0.000142674,0.00008820045,0.00002926439,0.0002653561,4.274148e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002605462,"about_ca_system_score_gemma":0.0001320757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004277567,"about_ca_topic_score_gemma":0.00001082519,"domain_scores_codex":[0.9985515,0.0001010615,0.0004798087,0.0001113815,0.0006002365,0.0001560388],"domain_scores_gemma":[0.9972541,0.001260692,0.0003339904,0.00006035411,0.0007599574,0.0003308557],"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.0005624917,0.0002687446,0.001285729,0.00009880475,0.0001739933,0.0001653086,0.0005456446,0.03110663,0.0000155141,0.9496614,0.0130795,0.00303621],"study_design_scores_gemma":[0.001428666,0.0005905012,0.00110207,0.00004547656,0.0001005824,0.0003406387,0.0000810373,0.2705889,0.000001364105,0.7250999,0.0004925016,0.0001283574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1332457,0.00009385864,0.8657525,0.0004355189,0.00009879976,0.00006307507,0.0000574637,0.000008866391,0.0002442054],"genre_scores_gemma":[0.4588026,0.0000116479,0.5408974,0.0001218692,0.00009465301,8.228598e-7,0.00000770612,0.00001173743,0.00005157216],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3255568,"threshold_uncertainty_score":0.4124426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1763412770","doi":"10.1080/10618600.2015.1043010","title":"Reinforced Angle-Based Multicategory Support Vector Machines","year":2015,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation; National Institutes of Health; National Cancer Institute; National Institute of Biomedical Imaging and Bioengineering; National Center for Research Resources; National Institute of Mental Health","keywords":"Support vector machine; Coordinate descent; Quadratic programming; Consistency (knowledge bases); Binary classification; Computer science; Machine learning; Dual (grammatical number); Mathematical optimization; Artificial intelligence; Quadratic equation; Sequential quadratic programming; Class (philosophy); Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02332503040802232,"gpt":0.2674244320768154,"spread":0.2440994016687931,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002798532,0.00008958985,0.0001587341,0.0001421447,0.00006239901,0.00008995703,0.0001771835,0.00004442065,0.00001448286],"category_scores_gemma":[0.0001673087,0.0000670971,0.00004550046,0.0001690563,0.00007129837,0.0002267235,0.00003656944,0.0001532579,0.000008263471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001118039,"about_ca_system_score_gemma":0.0001639242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003528985,"about_ca_topic_score_gemma":6.463268e-7,"domain_scores_codex":[0.9989101,0.00005682491,0.0003607068,0.000099007,0.0004604452,0.0001129374],"domain_scores_gemma":[0.9985371,0.0003628927,0.000212625,0.00005988156,0.0005677242,0.000259778],"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.0006013295,0.0004826768,0.005415683,0.000139495,0.0001705032,0.0006309489,0.001014719,0.115492,0.000503187,0.630499,0.1199223,0.1251281],"study_design_scores_gemma":[0.001611802,0.000601334,0.01258682,0.00002720372,0.00001814839,0.0001459545,0.00001580899,0.7363041,0.00008779982,0.2465359,0.001911266,0.0001538673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01651537,0.00004560248,0.9814196,0.001576044,0.0002933648,0.00003992119,0.00002609039,0.00001551231,0.00006848051],"genre_scores_gemma":[0.6631099,0.000007011144,0.3360122,0.0007296518,0.00008592536,0.000001019048,0.00002362317,0.000004314849,0.0000263108],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6465945,"threshold_uncertainty_score":0.273614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1607933843","doi":"10.1080/10618600.2016.1237363","title":"Divide-and-Conquer With Sequential Monte Carlo","year":2016,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Vetenskapsrådet","keywords":"Divide and conquer algorithms; Computer science; Probabilistic logic; Graphical model; Inference; Monte Carlo method; Algorithm; Class (philosophy); Theoretical computer science; Machine learning; Artificial intelligence; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.007713407732557479,"gpt":0.222033098086382,"spread":0.2143196903538245,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001326227,0.00009212769,0.0001563266,0.00008361196,0.00007956648,0.0001172245,0.0001584467,0.00003082845,0.000007677155],"category_scores_gemma":[0.00003937891,0.00004857021,0.00002200912,0.0001208636,0.0001637796,0.0002993917,0.0000549564,0.00009891707,9.486499e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000812065,"about_ca_system_score_gemma":0.00009764926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004031295,"about_ca_topic_score_gemma":0.000003448143,"domain_scores_codex":[0.999127,0.00003124612,0.0002662561,0.0001258745,0.0003282696,0.0001213424],"domain_scores_gemma":[0.9989585,0.0003215816,0.0001904264,0.00005125921,0.0003231158,0.0001551388],"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.00005180361,0.00004637296,0.008718745,0.00003007667,0.0000706908,0.0001447913,0.0001266912,0.0003065553,0.00003248298,0.8678696,0.0007036934,0.1218985],"study_design_scores_gemma":[0.0008652377,0.0005022351,0.1009965,0.0000923375,0.00002298772,0.0006894494,0.000003322009,0.006846672,0.00001509137,0.8889593,0.0008637823,0.0001430464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02966106,0.0001230908,0.966702,0.003365252,0.00006331795,0.00002594048,0.00002379976,0.000007263822,0.000028209],"genre_scores_gemma":[0.8595331,0.000070121,0.1401435,0.0001823716,0.00004747566,5.416572e-7,3.091675e-7,0.000003181014,0.00001939841],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8298721,"threshold_uncertainty_score":0.1980636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087043468","doi":"10.1198/106186007x257025","title":"On Using Truncated Sequential Probability Ratio Test Boundaries for Monte Carlo Implementation of Hypothesis Tests","year":2007,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"National Institutes of Health; University of Lethbridge","keywords":"Resampling; Monte Carlo method; Mathematics; Estimator; Sequential probability ratio test; Minimax; Statistical hypothesis testing; Algorithm; Optimal stopping; Boundary (topology); Statistics; Computer science; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.117921852029038,"gpt":0.4014752359088856,"spread":0.2835533838798476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001192344,0.0001277451,0.0003471022,0.0001266933,0.0001640079,0.00006177341,0.00006862223,0.00005729783,0.00002693547],"category_scores_gemma":[0.006617922,0.0001014565,0.00007345065,0.0001592107,0.0003066272,0.00007470159,0.00001431187,0.000133118,9.565474e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004258739,"about_ca_system_score_gemma":0.000201063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002438176,"about_ca_topic_score_gemma":0.00003860866,"domain_scores_codex":[0.9982044,0.00008744847,0.0009915462,0.0001194128,0.0004363053,0.0001609186],"domain_scores_gemma":[0.98182,0.01637842,0.0006514285,0.00005357781,0.0009884121,0.0001081805],"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.0003880606,0.0003388631,0.004950316,0.0002540872,0.0001179478,0.000009501608,0.0002960481,0.0007658717,0.000633074,0.9656165,0.0004311855,0.0261986],"study_design_scores_gemma":[0.0008019606,0.0008694979,0.06240564,0.00004458361,0.0001122184,0.00002451555,0.00006672682,0.01201629,0.0003474416,0.9231907,0.00002134954,0.00009912784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3694115,0.000009845499,0.6298332,0.0000780613,0.00006919351,0.000148886,0.0004412596,0.000003356484,0.000004718487],"genre_scores_gemma":[0.5048931,0.00000162512,0.4950232,0.00003441458,0.00003663213,0.000001083132,0.000002690753,0.000005973275,0.000001303471],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1354816,"threshold_uncertainty_score":0.7922749,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3213258851","doi":"10.1080/10618600.2021.1999825","title":"Mixtures of Matrix-Variate Contaminated Normal Distributions","year":2021,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Random variate; Cluster analysis; Computer science; Expectation–maximization algorithm; Data mining; Matrix (chemical analysis); Data Matrix; Algorithm; Artificial intelligence; Statistics; Mathematics; Maximum likelihood; Random variable","retraction":null,"screen_n_in":null,"score":{"opus":0.00868830389333632,"gpt":0.275012658105719,"spread":0.2663243542123827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003107089,0.00008497441,0.0002441337,0.0000822509,0.00007722945,0.00005839425,0.0001637487,0.00005370959,0.0000121145],"category_scores_gemma":[0.0001656473,0.00006911039,0.00007397868,0.0003123717,0.00009257728,0.0001350356,0.00006611187,0.000190583,3.347132e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007826875,"about_ca_system_score_gemma":0.000158102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003140288,"about_ca_topic_score_gemma":0.000001313858,"domain_scores_codex":[0.9988381,0.0001485965,0.0004775735,0.000106639,0.0003142048,0.0001148451],"domain_scores_gemma":[0.9980315,0.0005899434,0.000288883,0.00007297185,0.0008904549,0.000126272],"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.00001534971,0.00009643014,0.000309057,0.00002344657,0.00006015415,0.0001174657,0.00006959437,0.0003444777,0.000279963,0.9788769,0.0006885961,0.01911851],"study_design_scores_gemma":[0.0005633092,0.0001493947,0.03916145,0.00003076989,0.00003806601,0.0004760034,0.000004290132,0.03808928,0.0004227038,0.9205288,0.0004433398,0.00009256488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007304056,0.0005105906,0.9908609,0.0009130321,0.0001723809,0.00002431493,0.0001597092,0.000005183512,0.00004987627],"genre_scores_gemma":[0.3833255,0.0000522267,0.6164835,0.00007761236,0.00002989797,2.414029e-7,0.00001335748,0.000002101242,0.00001557596],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3760214,"threshold_uncertainty_score":0.281824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2256665692","doi":"10.1080/10618600.2012.723569","title":"An Adaptive Interacting Wang–Landau Algorithm for Automatic Density Exploration","year":2012,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Algorithm; Artificial intelligence; Statistical physics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.07624063086788722,"gpt":0.3818334136523043,"spread":0.305592782784417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001056357,0.0001102782,0.0002650188,0.0001038731,0.0001265542,0.00004407428,0.00005810687,0.00005375774,0.000006074295],"category_scores_gemma":[0.0005734207,0.00008630865,0.00006872655,0.00007882809,0.00004971303,0.0003578574,0.00001515463,0.0001656317,3.512363e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002376196,"about_ca_system_score_gemma":0.0000348092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002140738,"about_ca_topic_score_gemma":0.000002914296,"domain_scores_codex":[0.9988604,0.0001592527,0.0004735286,0.00007724095,0.0002739933,0.0001556161],"domain_scores_gemma":[0.9961054,0.002687902,0.0004148527,0.00004716922,0.0005522947,0.0001924197],"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.0001792458,0.0005777957,0.00105256,0.0001453718,0.0002187794,0.00001517194,0.002427157,0.0003300493,0.00006684643,0.3240481,0.002890035,0.6680489],"study_design_scores_gemma":[0.0006580438,0.0005906207,0.002087933,0.00005790168,0.0001103581,0.0001146161,0.000476615,0.4773149,0.00003447163,0.5181554,0.0002645536,0.0001345517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07671965,0.00005448379,0.9226328,0.0001052665,0.0002856462,0.000112035,0.00006454003,0.000009937238,0.00001565826],"genre_scores_gemma":[0.351652,0.000007437527,0.6480037,0.00005405606,0.00025237,0.000002661828,0.00001326504,0.000008308767,0.000006163054],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6679143,"threshold_uncertainty_score":0.3519564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090439194","doi":"10.1080/10618600.2000.10474890","title":"Users, Programmers, and Statistical Software","year":2000,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Software analytics; Software engineering; Software; Programmer; Software construction; Data science; Software development; Human–computer interaction; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.009443144865113733,"gpt":0.2565643840606938,"spread":0.24712123919558,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002501104,0.0001114801,0.0001968991,0.0001076053,0.00009617242,0.0001852018,0.0002349172,0.00004692112,0.00003435783],"category_scores_gemma":[0.0001289581,0.0000915655,0.00002314985,0.000178292,0.0002138303,0.0002633937,0.00006415017,0.0002049374,0.000001870477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008904783,"about_ca_system_score_gemma":0.00005885748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007035044,"about_ca_topic_score_gemma":0.000001351747,"domain_scores_codex":[0.9988611,0.00006411462,0.000371903,0.0001606034,0.0003865912,0.0001556854],"domain_scores_gemma":[0.998702,0.0006980972,0.000131261,0.00008328272,0.0001755734,0.0002097786],"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.00002836007,0.0000811953,0.003542553,0.00001895865,0.0000350446,0.0001184217,0.00008512578,0.00007378098,0.000001050765,0.2887788,0.007645368,0.6995914],"study_design_scores_gemma":[0.0005269334,0.0007158358,0.1075243,0.00004087714,0.00002865811,0.0007925289,0.00000767933,0.02034842,0.000003106231,0.8602011,0.009623846,0.0001866925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01463795,0.0001489885,0.9842725,0.0006202273,0.00004077185,0.00005260686,0.0001628836,0.00003648927,0.00002754026],"genre_scores_gemma":[0.1177413,0.000142196,0.8818188,0.0002252658,0.00003344523,0.000001075783,0.00002143819,0.00000533202,0.0000111113],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6994047,"threshold_uncertainty_score":0.3733933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4286608159","doi":"10.1080/10618600.2022.2104858","title":"Using CVX to Construct Optimal Designs for Biomedical Studies with Multiple Objectives","year":2022,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Optimal design; Computer science; Construct (python library); MATLAB; Mathematical optimization; Code (set theory); Software; Machine learning; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.2339448673563404,"gpt":0.4839443142539315,"spread":0.2499994468975911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002056245,0.000124478,0.0003991605,0.0003890104,0.0004380133,0.00009186889,0.0002238464,0.00002333477,0.00003961183],"category_scores_gemma":[0.00255231,0.00008388057,0.00007225209,0.0006237481,0.0004304701,0.0001151792,0.0001294585,0.0001897651,4.238599e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005742309,"about_ca_system_score_gemma":0.0001873653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000241047,"about_ca_topic_score_gemma":6.379551e-7,"domain_scores_codex":[0.9970542,0.0003815986,0.0006969559,0.000219124,0.001478717,0.0001694591],"domain_scores_gemma":[0.9891087,0.009327639,0.0003828406,0.00005823507,0.0008965426,0.0002260297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.005860433,0.0007425734,0.01339082,0.00003784764,0.000804018,0.000281982,0.004218376,0.7910551,0.00384621,0.1090946,0.007655417,0.06301258],"study_design_scores_gemma":[0.003233661,0.007583769,0.01281401,0.00003477433,0.0001079927,0.00147756,0.008808469,0.3583436,0.0001594839,0.604031,0.003037565,0.0003681441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1512464,0.0002196519,0.8475373,0.0003230651,0.0002070712,0.0001634403,0.0002949728,0.000003539832,0.000004465706],"genre_scores_gemma":[0.4028029,0.000002271979,0.5969809,0.0001531256,0.00004152838,0.000005137897,0.000002357093,0.000005664824,0.0000061274],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4949364,"threshold_uncertainty_score":0.3420551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972260379","doi":"10.1198/jcgs.2011.10106","title":"Local-EM and the EMS Algorithm","year":2011,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Spatial and Panel Data Analysis","field":"Economics, Econometrics and Finance","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Context (archaeology); Expectation–maximization algorithm; Piecewise; Computer science; Mathematics; Likelihood function; Maximum likelihood; Statistics; Estimation theory","retraction":null,"screen_n_in":null,"score":{"opus":0.02567015972734874,"gpt":0.2066089216628644,"spread":0.1809387619355156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004034136,0.00006718936,0.0002517419,0.0001023743,0.00008842272,0.00004255119,0.00008180606,0.0000325141,0.0001031286],"category_scores_gemma":[0.00007447587,0.00004572975,0.00005401312,0.000126347,0.0002668006,0.0000757249,0.00002590301,0.0001322314,0.000006596952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004502469,"about_ca_system_score_gemma":0.000008428118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001173649,"about_ca_topic_score_gemma":0.00001078884,"domain_scores_codex":[0.9992864,0.00002169438,0.0004680735,0.00008526253,0.00006050481,0.00007806038],"domain_scores_gemma":[0.999162,0.0003005194,0.0003262929,0.00004182415,0.00008853833,0.00008079613],"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.00007073815,0.00004731897,0.004894617,0.000008697174,0.0001635724,0.00001670357,0.0005098972,0.000154371,5.085639e-8,0.929671,0.0007930488,0.06366997],"study_design_scores_gemma":[0.0006952151,0.00007746204,0.1175556,0.000004618309,0.00002785813,0.00005412893,0.00006000757,0.06189849,3.301799e-7,0.8182507,0.001311981,0.00006365389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01164644,0.001291914,0.9860327,0.0003541432,0.0001071571,0.00002969979,0.0003265222,0.000002012393,0.0002094709],"genre_scores_gemma":[0.9307897,0.000566931,0.06811664,0.0004064664,0.00007042867,8.483816e-7,0.00001674035,0.000005051606,0.00002716829],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9191433,"threshold_uncertainty_score":0.1864805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2325530052","doi":"10.1080/10618600.2017.1385468","title":"Fast and Exact Simulation of Complex-Valued Stationary Gaussian Processes Through Embedding Circulant Matrix","year":2017,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"Air Force Office of Scientific Research; Agence Nationale de la Recherche","keywords":"Circulant matrix; Gaussian; Embedding; Applied mathematics; Covariance matrix; Matrix (chemical analysis); Covariance function; Mathematics; Gaussian noise; Function (biology); Statistical physics; Covariance; Simple (philosophy); Gaussian process; Algorithm; Computer science; Mathematical optimization; Physics; Artificial intelligence; Statistics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.05722692399551344,"gpt":0.3258920297182836,"spread":0.2686651057227702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003100325,0.00009717371,0.0003439141,0.0001138423,0.0002848088,0.00009526445,0.00009705231,0.00005264573,0.00001805338],"category_scores_gemma":[0.0004986072,0.00009506414,0.00004194365,0.00006833401,0.000169974,0.0003325404,0.00003273823,0.0001259869,8.079309e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001309323,"about_ca_system_score_gemma":0.00004610424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003976051,"about_ca_topic_score_gemma":0.000005858936,"domain_scores_codex":[0.9988853,0.0000150917,0.0007496389,0.0001346942,0.0001105203,0.0001047024],"domain_scores_gemma":[0.9981886,0.0003306585,0.001054327,0.0000693508,0.000292206,0.00006486381],"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.000153216,0.0001420769,0.1164804,0.0003782504,0.00009766639,0.00001374241,0.0009310506,0.3322322,0.000008982337,0.5433713,0.00009527613,0.006095739],"study_design_scores_gemma":[0.0003117348,0.00006967074,0.2258606,0.00002965604,0.000008520376,0.000008724915,0.00002107416,0.389482,5.862212e-7,0.3840418,0.0001078699,0.00005768195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2735066,0.0005616063,0.7251197,0.0002053884,0.00006348951,0.0000539232,0.0004126968,0.000002480527,0.00007410043],"genre_scores_gemma":[0.9096625,0.0002353667,0.08997206,0.00003066755,0.00006085983,5.191908e-7,0.0000245495,0.000007110251,0.000006362515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6361559,"threshold_uncertainty_score":0.3876603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018198263","doi":"10.1080/10618600.2013.837828","title":"The Conditional-Potts Clustering Model","year":2013,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Cluster analysis; Mathematics; Adjacency list; Posterior probability; Bayesian inference; Correlation clustering; Computer science; Algorithm; Bayesian probability; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.009403747627858285,"gpt":0.2532570640417436,"spread":0.2438533164138853,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009733869,0.00005158017,0.00005740515,0.00002587352,0.0001282857,0.00004718111,0.00006965896,0.00003421572,0.000008302644],"category_scores_gemma":[0.00005371703,0.00003353897,0.00002972184,0.00003809857,0.00009068225,0.000005106868,0.00002365988,0.00007152081,0.000001393861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000367058,"about_ca_system_score_gemma":0.00004912014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.119954e-7,"about_ca_topic_score_gemma":0.000001474981,"domain_scores_codex":[0.9994608,0.00002643964,0.0002119579,0.00006370885,0.0001690752,0.00006800565],"domain_scores_gemma":[0.9993796,0.00006415089,0.0001338021,0.00004100625,0.0003098678,0.00007156753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003378101,0.0002240682,0.003512804,0.00005278205,0.0003030104,0.000006673868,0.0001305707,0.35638,0.05782501,0.205865,0.2857303,0.08963203],"study_design_scores_gemma":[0.0007181714,0.000242484,0.07619515,0.00001390827,0.0000188152,0.00009504526,0.00006098787,0.2793194,0.0003285151,0.6284047,0.01446462,0.000138238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08289775,0.0003329417,0.9151035,0.001431251,0.00007878478,0.00004874537,0.00002238018,0.000001367134,0.00008328944],"genre_scores_gemma":[0.9803034,0.0002329196,0.01883851,0.0003631405,0.0000977965,0.000003924222,0.00002985483,0.000004320014,0.0001261391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8974056,"threshold_uncertainty_score":0.136768,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2804134309","doi":"10.1080/10618600.2018.1476250","title":"Optimal Designs for Multi-Response Nonlinear Regression Models With Several Factors via Semidefinite Programming","year":2018,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"National Institute of General Medical Sciences","keywords":"Semidefinite programming; Optimal design; Mathematical optimization; Mathematics; Bivariate analysis; Design matrix; Linear model; Nonlinear system; Computation; Linear programming; Computer science; Algorithm; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1938160092220134,"gpt":0.4467397048701585,"spread":0.252923695648145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002496606,0.0002014476,0.0004003927,0.0003117153,0.0002948001,0.000221944,0.0002537929,0.00008695722,0.00002138564],"category_scores_gemma":[0.001317297,0.0001179191,0.0001067212,0.0004225798,0.0004663178,0.0003634457,0.00005290154,0.0002126936,0.000001768068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002769415,"about_ca_system_score_gemma":0.000147791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003409093,"about_ca_topic_score_gemma":0.000001687737,"domain_scores_codex":[0.9969905,0.000436464,0.0008433437,0.0002658185,0.001224332,0.0002395178],"domain_scores_gemma":[0.9915367,0.00577978,0.0006167866,0.00009448654,0.001684423,0.0002877924],"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.05962659,0.002547831,0.01489476,0.00008320979,0.0007400046,0.0003450356,0.00806698,0.6738756,0.006850563,0.04490759,0.004035939,0.1840259],"study_design_scores_gemma":[0.001579019,0.003300902,0.008169041,0.00004808635,0.00003706234,0.000160656,0.0002232073,0.9000634,0.0003654366,0.08538292,0.0004717951,0.0001984553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2421737,0.00005021818,0.757296,0.0001060659,0.0001083108,0.0001513397,0.0001043328,0.000007186588,0.00000292207],"genre_scores_gemma":[0.3173365,0.000002620706,0.6824673,0.00007400275,0.00007038446,0.000002400078,0.000007271189,0.00001198742,0.00002756417],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2261878,"threshold_uncertainty_score":0.4808599,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165084744","doi":"10.1198/1061860032283","title":"Multivariate Normal Probabilities: Implementing an Old Idea of Plackett's","year":2003,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Probability and Statistical Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Multivariate statistics; Multivariate normal distribution; Computation; Multivariate analysis; Computer science; Key (lock); Statistics; Mathematics; Econometrics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.05978480149004771,"gpt":0.3718175089624559,"spread":0.3120327074724081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001900611,0.0001284632,0.0003639823,0.0001282409,0.0001296388,0.00004590159,0.0001289701,0.0000642425,0.0001323144],"category_scores_gemma":[0.004722155,0.0001025391,0.00007099474,0.0001820971,0.0002962017,0.0001658247,0.00003818825,0.0003203505,5.741742e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002273514,"about_ca_system_score_gemma":0.0001623362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001547082,"about_ca_topic_score_gemma":0.00001701492,"domain_scores_codex":[0.997555,0.0003312538,0.0009785717,0.0001394083,0.0007225715,0.0002732231],"domain_scores_gemma":[0.9937332,0.004706591,0.0003848358,0.00008689002,0.0008497349,0.000238792],"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.0001155023,0.0003488519,0.002999653,0.0002618701,0.00006937602,0.00001735116,0.0003972212,0.000283833,0.00003747537,0.9921293,0.0002244968,0.003115093],"study_design_scores_gemma":[0.000850155,0.000585812,0.01292128,0.00004293927,0.00004083734,0.00006126515,0.0001494563,0.00742741,0.00004170073,0.9775286,0.0002432155,0.000107308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3670906,0.00003271042,0.6320961,0.0001104339,0.00004679603,0.0001326807,0.0002880293,0.000005738964,0.0001969035],"genre_scores_gemma":[0.6019069,0.000008189842,0.3979951,0.0000304186,0.00002470156,0.00000155388,0.00000806328,0.000007405351,0.00001764966],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2348163,"threshold_uncertainty_score":0.5653202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4297019279","doi":"10.1080/10618600.2022.2127738","title":"Beyond Linear Dynamic Functional Connectivity: A Vine Copula Change Point Model","year":2022,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Alberta Health","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Computer science; Vine copula; Inference; Copula (linguistics); Dynamic functional connectivity; Sliding window protocol; Artificial intelligence; Functional magnetic resonance imaging; Machine learning; Algorithm; Econometrics; Mathematics; Window (computing); Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.04210046127206046,"gpt":0.2764977541417614,"spread":0.2343972928697009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004582168,0.0001623339,0.0002954437,0.0002703012,0.0006477706,0.00003374858,0.0001190965,0.00003266451,0.0000992196],"category_scores_gemma":[0.001759466,0.0001501532,0.00009817108,0.0003757492,0.0002254862,0.0001997019,0.000183832,0.000530762,0.000002343049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009149541,"about_ca_system_score_gemma":0.0001153616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004017227,"about_ca_topic_score_gemma":0.000006779705,"domain_scores_codex":[0.9979078,0.0002041054,0.0004299211,0.0002692443,0.0009974833,0.0001914888],"domain_scores_gemma":[0.9940303,0.005162319,0.0003307248,0.00006415629,0.0002773817,0.0001351328],"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.001214392,0.001015521,0.002425177,0.00006469887,0.0001501647,0.0003081767,0.0004694187,0.4740029,0.001669843,0.4966717,0.01558522,0.006422748],"study_design_scores_gemma":[0.0008348672,0.0005802879,0.01761782,0.000006199754,0.00003138677,0.0006882505,0.00004140051,0.4791177,0.00001528534,0.5000108,0.0009099251,0.000146054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3720172,0.0002685451,0.6048123,0.02006937,0.0009266438,0.0002485568,0.001512142,0.00003348137,0.0001117624],"genre_scores_gemma":[0.9822314,0.00004013669,0.01134065,0.006108173,0.000154858,0.00001964749,0.00002518217,0.00001675746,0.00006318853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6102142,"threshold_uncertainty_score":0.6123068,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4312132359","doi":"10.1080/10618600.2022.2156522","title":"Probabilistic <i>K</i> -means with Local Alignment for Clustering and Motif Discovery in Functional Data","year":2022,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"National Stroke Foundation","keywords":"Cluster analysis; Motif (music); Probabilistic logic; Computer science; Artificial intelligence; Computational biology; Data mining; Biology; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01269211404567806,"gpt":0.2268257154592397,"spread":0.2141336014135616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002667909,0.00006952637,0.000109061,0.0000371047,0.00009318856,0.00002989038,0.00007965149,0.0000226307,0.000002474659],"category_scores_gemma":[0.00001753018,0.00005618651,0.00001496393,0.00004519605,0.00009625552,0.000009899079,0.0001482423,0.0001051907,2.049739e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001094969,"about_ca_system_score_gemma":0.00007041859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002388283,"about_ca_topic_score_gemma":0.00002658403,"domain_scores_codex":[0.9993463,0.00002393069,0.0002614431,0.0001121351,0.0001657414,0.00009049544],"domain_scores_gemma":[0.9996134,0.00009506016,0.0001235008,0.00005816896,0.00005802332,0.00005182066],"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.001405323,0.0001863316,0.003476381,0.000122525,0.0001599301,0.00001740933,0.00008317551,0.9501332,0.0001030523,0.02104072,0.004423768,0.0188482],"study_design_scores_gemma":[0.003255196,0.002132542,0.03002578,0.00003170873,0.00007103279,0.0006275616,0.0002525512,0.8462753,0.000004938486,0.1080399,0.009030926,0.0002525042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07091541,0.0002167226,0.9279339,0.0002497223,0.00006510627,0.00009700861,0.0005149542,6.268695e-7,0.000006587791],"genre_scores_gemma":[0.9638294,0.00004226078,0.03536487,0.000269089,0.00007605035,0.000005432372,0.0003920626,0.000006373672,0.00001448979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8929139,"threshold_uncertainty_score":0.229122,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034304555","doi":"10.1198/106186001317243412","title":"CriSP: A Tool for Bump Hunting","year":2001,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Smoothing; Bootstrapping (finance); Test statistic; Mathematics; Resampling; Statistic; Function (biology); Statistics; Statistical hypothesis testing; Algorithm; Computer science; Econometrics","retraction":null,"screen_n_in":null,"score":{"opus":0.07553251069649514,"gpt":0.4139923701140274,"spread":0.3384598594175323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005235657,0.0001103752,0.0002988362,0.00008449053,0.0001252018,0.00003840647,0.00007054995,0.00004965159,0.00001964987],"category_scores_gemma":[0.002110751,0.00008674691,0.00007585107,0.0001055462,0.00009127793,0.00008725677,0.00001931325,0.0001715705,3.832891e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001128918,"about_ca_system_score_gemma":0.00003726948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.862105e-7,"about_ca_topic_score_gemma":0.000001190534,"domain_scores_codex":[0.9987782,0.00005629062,0.0005927456,0.0001087057,0.0002946313,0.0001694823],"domain_scores_gemma":[0.9936892,0.005284603,0.000308444,0.00004307064,0.0005556456,0.000118993],"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.0001366911,0.00009254296,0.000465495,0.00006873807,0.00004721484,0.00002991234,0.00005339304,0.0006651316,0.00002057636,0.9525841,0.001337472,0.04449873],"study_design_scores_gemma":[0.000734527,0.0002628608,0.003140346,0.00003654185,0.00006475831,0.0001686177,0.00002086923,0.02859089,0.000003204685,0.9644016,0.002465567,0.0001102193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02457736,0.00006807331,0.9745168,0.0004364736,0.0001076861,0.0001065556,0.0001344975,0.000007969017,0.00004459209],"genre_scores_gemma":[0.1138642,0.00004681437,0.8856764,0.0001957671,0.000154581,0.000003102599,0.000005466532,0.00001236686,0.000041257],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08928688,"threshold_uncertainty_score":0.3537436,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2954648680","doi":"10.1080/10618600.2020.1840995","title":"Likelihood Evaluation of Jump-Diffusion Models Using Deterministic Nonlinear Filters","year":2020,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":10,"is_retracted":false,"has_abstract":true,"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; Simon Fraser University; Nvidia","keywords":"Stochastic volatility; Jump; Mathematics; Likelihood function; Particle filter; Jump diffusion; Nonlinear system; Volatility (finance); Econometrics; Applied mathematics; Maximum likelihood; Kalman filter; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.1026985356034712,"gpt":0.2840610577331085,"spread":0.1813625221296373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006135019,0.00008828247,0.0003270423,0.0001276482,0.00006590861,0.00002381184,0.00007731505,0.00005636186,0.00002278417],"category_scores_gemma":[0.000346318,0.00009008209,0.00007679537,0.000165047,0.00006523731,0.0001340813,0.00002631935,0.0001507696,0.000001062066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002226909,"about_ca_system_score_gemma":0.00008182103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000195324,"about_ca_topic_score_gemma":0.000001745089,"domain_scores_codex":[0.998669,0.00003175083,0.0008735971,0.0001285424,0.0001943188,0.0001027724],"domain_scores_gemma":[0.9986296,0.0001696222,0.000616393,0.00003943244,0.0004258023,0.0001191289],"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.0002507701,0.0002463195,0.01550169,0.0001724134,0.0001096302,0.00001115616,0.001338357,0.8112098,0.00007541227,0.1486508,0.0001565359,0.02227716],"study_design_scores_gemma":[0.0004314038,0.0001269879,0.005452579,0.00001708712,0.00002778217,0.000005137317,0.00001446657,0.6012698,0.00000193607,0.3925706,0.00002766274,0.00005451789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4457541,0.0003940556,0.5533535,0.0001481408,0.00006591835,0.0000450773,0.0002170011,0.000001620005,0.00002053545],"genre_scores_gemma":[0.8907819,0.00008067719,0.1089049,0.0001223112,0.00008891369,3.534687e-7,0.00001338884,0.000007064123,4.657724e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4450278,"threshold_uncertainty_score":0.3673441,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009789458","doi":"10.1198/106186007x208966","title":"Testing Uniformity of a Spatial Point Pattern","year":2007,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Point process; Computer science; Point (geometry); Statistics; Mathematics; Econometrics; Artificial intelligence; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.009024007963942805,"gpt":0.219514538467081,"spread":0.2104905305031382,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002039793,0.00005684314,0.000117646,0.00008960144,0.00002639993,0.00001171278,0.00003626697,0.00002914499,0.000009626334],"category_scores_gemma":[0.00006657774,0.00004758858,0.00001955953,0.00007836043,0.00003438022,0.00004945152,0.000008017275,0.0001115771,1.559365e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007453277,"about_ca_system_score_gemma":0.00001241627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001205735,"about_ca_topic_score_gemma":0.000007023108,"domain_scores_codex":[0.9993458,0.000006067869,0.0003543561,0.00003363003,0.0001864674,0.00007366174],"domain_scores_gemma":[0.9992607,0.0003080364,0.0001250528,0.00001762517,0.0002255611,0.00006299539],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00003545622,0.0000527409,0.02636737,0.0002509331,0.00005728558,0.00003116209,0.0001503738,0.732161,0.00003918289,0.00368463,0.000103512,0.2370664],"study_design_scores_gemma":[0.0003824738,0.0001446048,0.5846214,0.00005036111,0.00002102492,0.00006924252,0.00001380254,0.3494022,0.0001739834,0.06498394,0.00005325031,0.00008374792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1821759,0.00004159064,0.817592,0.00001873258,0.00006623704,0.00001715595,0.00002011469,0.000006310254,0.00006196171],"genre_scores_gemma":[0.9065512,0.00001153638,0.09335507,0.00001904172,0.00005241684,8.2324e-8,0.000005047786,0.000004861349,7.610226e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7243753,"threshold_uncertainty_score":0.1940606,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970792239","doi":"10.1198/jcgs.2009.07118","title":"Boosting for Correlated Binary Classification","year":2010,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Boosting (machine learning); Gradient boosting; Computer science; Gradient descent; Stochastic gradient descent; Binary number; Binary classification; Binary data; Source code; Machine learning; Artificial intelligence; Data mining; Algorithm; Mathematics; Random forest; Support vector machine; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.01301706500930886,"gpt":0.2825035728589893,"spread":0.2694865078496804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001736102,0.00006029686,0.00007961751,0.00006024308,0.00008399265,0.0000212518,0.0000604699,0.00007969145,0.000006701523],"category_scores_gemma":[0.000200608,0.00005071736,0.0000385971,0.00006556279,0.00007099541,0.000004334382,0.00001233982,0.000127267,3.575074e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002524142,"about_ca_system_score_gemma":0.00006644188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.882784e-7,"about_ca_topic_score_gemma":0.000001253866,"domain_scores_codex":[0.9994358,0.00002012789,0.0002570477,0.00009454714,0.0001236658,0.00006874152],"domain_scores_gemma":[0.9991655,0.00008982049,0.0002214336,0.00004646147,0.0003983158,0.00007852032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0005773412,0.0002078433,0.008848035,0.0000489528,0.00009506905,0.000003428064,0.00006072013,0.001884294,0.8206529,0.08463801,0.02969407,0.05328932],"study_design_scores_gemma":[0.003604542,0.001755458,0.6081862,0.000050218,0.0001188771,0.0002851172,0.0001497108,0.08119591,0.004786322,0.1828048,0.1166155,0.0004472665],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4959912,0.0001120145,0.5028365,0.000568515,0.0003235727,0.00007148484,0.00004724813,0.000002610424,0.00004681936],"genre_scores_gemma":[0.9461194,0.0000469338,0.05333269,0.0001473684,0.0001938439,0.000003298264,0.0001045875,0.000006544485,0.00004530516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8158666,"threshold_uncertainty_score":0.2068194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4237076065","doi":"10.1198/jcgs.2011.09166b","title":"Comment","year":2011,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Perspective (graphical); Relation (database); Computer science; Cognition; Table (database); Psychology; Cognitive psychology; Artificial intelligence; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.03274139259601863,"gpt":0.2892028001394387,"spread":0.2564614075434201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000195171,0.00005551751,0.0001083269,0.0001012731,0.00005519636,0.00005319506,0.0002060961,0.00001944257,0.00002288797],"category_scores_gemma":[0.00004660081,0.00004334652,0.0000277097,0.0001661236,0.00005896126,0.0001687513,0.00005490491,0.00008615742,0.000002756063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000497433,"about_ca_system_score_gemma":0.00003419019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001729536,"about_ca_topic_score_gemma":4.413131e-7,"domain_scores_codex":[0.9992651,0.0000376488,0.0002984403,0.00006463125,0.0002619133,0.00007231226],"domain_scores_gemma":[0.9992471,0.0001459562,0.0001734021,0.00005183215,0.0002637069,0.0001180578],"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.000005080226,0.00008338589,0.0009537993,0.000005250586,0.00002135987,0.0000239964,0.0001562505,0.00006873106,7.287808e-7,0.9840953,0.006867814,0.007718326],"study_design_scores_gemma":[0.000360032,0.000228223,0.02749178,0.00001223524,0.00001359846,0.0001015214,0.00001528866,0.09006613,0.00000821402,0.8722765,0.009343857,0.00008261421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006975202,0.00004225537,0.9977356,0.001208244,0.0001042923,0.00001557354,0.00001934555,0.000006830106,0.0001702912],"genre_scores_gemma":[0.3302591,0.00006065183,0.6672439,0.002384145,0.0000312487,1.932483e-7,0.000007042834,0.000002887284,0.00001083631],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3304917,"threshold_uncertainty_score":0.176762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385963506","doi":"10.1080/10618600.2023.2233581","title":"Functional Nonlinear Learning","year":2023,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Metabolomics and Mass Spectrometry Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Functional principal component analysis; Functional data analysis; Principal component analysis; Computer science; Multivariate statistics; Generalization; Nonlinear system; Artificial intelligence; Representation (politics); Pattern recognition (psychology); Data mining; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01122446183980309,"gpt":0.2531441275216021,"spread":0.2419196656817991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002042566,0.00006217304,0.0001124357,0.00009743939,0.00009408715,0.00001660301,0.00003717469,0.00003571009,0.00001324473],"category_scores_gemma":[0.000196597,0.00005083888,0.00004499182,0.0001518408,0.00006683906,0.000002454714,0.00003917727,0.000115642,0.000003405762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002220455,"about_ca_system_score_gemma":0.00003263396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.977433e-7,"about_ca_topic_score_gemma":8.835448e-7,"domain_scores_codex":[0.9994127,0.00002842493,0.0002061716,0.00007909597,0.0001831989,0.00009041879],"domain_scores_gemma":[0.9994922,0.00009129127,0.0001110816,0.00002300224,0.0002198161,0.0000626005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.001482767,0.0005791701,0.1330018,0.0002049639,0.002377454,0.000261419,0.0002509147,0.1638674,0.05821094,0.3161339,0.2459101,0.07771918],"study_design_scores_gemma":[0.001850759,0.001496439,0.6660939,0.00001739434,0.00008704775,0.0002758816,0.0001383005,0.01637243,0.0004706318,0.177028,0.13585,0.0003192569],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8051842,0.0005347203,0.1930962,0.0007280292,0.0002573706,0.00003256424,0.00006020705,0.000006482975,0.0001002037],"genre_scores_gemma":[0.9646617,0.001142306,0.03314974,0.0001631383,0.0004283217,8.990888e-7,0.0001481278,0.000009190337,0.0002965649],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5330921,"threshold_uncertainty_score":0.207315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4283370965","doi":"10.1080/10618600.2022.2069780","title":"Analytic Permutation Testing for Functional Data ANOVA","year":2022,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Sheridan College; Lakehead University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Permutation (music); Resampling; Univariate; Nonparametric statistics; Statistical hypothesis testing; Mathematics; Omnibus test; Multiple comparisons problem; Sample size determination; Algorithm; Parametric statistics; Computer science; Multivariate statistics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.07933935138083462,"gpt":0.3144627546212596,"spread":0.235123403240425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009461688,0.0000760304,0.000142326,0.0002172393,0.0003071488,0.000115749,0.0003931969,0.00001945022,0.00001034593],"category_scores_gemma":[0.0003691847,0.00007174582,0.00003247623,0.0004214243,0.0000471975,0.000356155,0.0002183011,0.0002137663,2.572768e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002432042,"about_ca_system_score_gemma":0.0002098201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002311194,"about_ca_topic_score_gemma":9.40562e-7,"domain_scores_codex":[0.9986665,0.0001022245,0.0004233124,0.0001712118,0.000539361,0.00009735694],"domain_scores_gemma":[0.9974571,0.001437086,0.0003544049,0.0001173788,0.0005623794,0.00007165818],"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.00005651959,0.0001616036,0.001714014,0.00002204291,0.00006941507,0.00001823765,0.0001722067,0.0754923,0.0000530195,0.8767698,0.01118213,0.03428869],"study_design_scores_gemma":[0.0003233072,0.0003555995,0.01971537,0.000003592681,0.00001570614,0.0002097465,0.000016887,0.5592211,0.000002032803,0.4179466,0.002122148,0.00006786256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004906419,0.00006642214,0.9930161,0.001517075,0.0001433153,0.00008643379,0.0002126691,0.00002248267,0.00002910865],"genre_scores_gemma":[0.4456058,0.000002257937,0.5536304,0.0005766546,0.00005408503,0.000003846793,0.00011024,0.000004302761,0.00001249029],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4837288,"threshold_uncertainty_score":0.2925709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3131114373","doi":"10.1080/10618600.2022.2110883","title":"Cross-Validated Loss-based Covariance Matrix Estimator Selection in High Dimensions","year":2022,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Single-cell and spatial transcriptomics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"National Institute on Deafness and Other Communication Disorders; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; National Science Foundation","keywords":"Estimator; Curse of dimensionality; Covariance matrix; Dimensionality reduction; Estimation of covariance matrices; Mathematics; Sample size determination; Covariance; Model selection; Selection (genetic algorithm); Computer science; Mathematical optimization; Statistics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.007898124488251633,"gpt":0.2743379380396968,"spread":0.2664398135514452,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002155761,0.00008600136,0.0001404977,0.00009411207,0.0001751218,0.0000307382,0.00007621526,0.00004722011,0.00003772123],"category_scores_gemma":[0.00006576311,0.00008291747,0.00004255402,0.0001872526,0.00008936405,0.00000503324,0.00002458527,0.0002140471,3.052928e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000182064,"about_ca_system_score_gemma":0.0001362974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002102643,"about_ca_topic_score_gemma":0.00000860544,"domain_scores_codex":[0.9991138,0.00006713767,0.0003438955,0.0001227941,0.0002417013,0.0001106822],"domain_scores_gemma":[0.9994498,0.00009401234,0.0001565275,0.00003101656,0.000195049,0.00007357928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0009801124,0.0004424708,0.09248175,0.000030856,0.0000644043,0.00007911171,0.0000191639,0.8680578,0.02335933,0.01309808,0.0007168619,0.0006699915],"study_design_scores_gemma":[0.008959905,0.003484304,0.6101967,0.00004591594,0.0001024743,0.0007677798,0.00002674014,0.2638311,0.003359212,0.102375,0.006214586,0.000636333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7207197,0.0001141924,0.2786434,0.0001808435,0.0001211562,0.00004177459,0.0001747301,0.000002404313,0.000001831172],"genre_scores_gemma":[0.94922,0.00001962547,0.05033803,0.0002044179,0.00005537969,0.000002497316,0.0001332088,0.000008862068,0.00001796108],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6042268,"threshold_uncertainty_score":0.3381276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962861789","doi":"10.1080/10618600.2019.1598872","title":"Adaptive Incremental Mixture Markov Chain Monte Carlo","year":2019,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; Eunice Kennedy Shriver National Institute of Child Health and Human Development; Center for Advanced Study in the Behavioral Sciences, Stanford University; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Insight SFI Research Centre for Data Analytics; Science Foundation Ireland; National Institutes of Health; National Science Foundation","keywords":"Markov chain Monte Carlo; Computer science; Kernel (algebra); Mixture model; Gaussian process; Mathematics; Bayesian probability; Semiparametric regression; Algorithm; Mathematical optimization; Parametric statistics; Artificial intelligence; Gaussian; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02149832176227343,"gpt":0.298824804278164,"spread":0.2773264825158905,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006914425,0.0001541313,0.0003707395,0.0001351055,0.00006541178,0.00003563233,0.0001078099,0.00008293347,0.00004186924],"category_scores_gemma":[0.000230191,0.0001185202,0.0001064463,0.0001349099,0.00008399425,0.00007883243,0.000048276,0.0003346457,1.57804e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000290541,"about_ca_system_score_gemma":0.00005737293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006963016,"about_ca_topic_score_gemma":0.000008050381,"domain_scores_codex":[0.9984925,0.0001728176,0.0005262424,0.0001311244,0.0005165594,0.0001607992],"domain_scores_gemma":[0.9978099,0.00117766,0.0003732555,0.00006997736,0.000402397,0.0001667982],"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.001057151,0.0004984923,0.01087675,0.0003381289,0.0006905555,0.0002677001,0.001067308,0.001809975,0.0002580273,0.911483,0.02855194,0.04310098],"study_design_scores_gemma":[0.003244444,0.001509448,0.01639331,0.000210032,0.0001954076,0.00050245,0.0005962853,0.0806874,0.00002713064,0.8927224,0.00343602,0.0004756929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5644001,0.0003655451,0.4332092,0.0005377532,0.0004183269,0.0002195311,0.0002375448,0.00001188042,0.0006001731],"genre_scores_gemma":[0.638027,0.00003944606,0.3614358,0.000201623,0.0001149617,0.000001032009,0.000004319825,0.00001232637,0.000163509],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07887742,"threshold_uncertainty_score":0.4833114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2234615877","doi":"10.1080/10618600.2018.1546593","title":"A General Hybrid Clustering Technique","year":2018,"lang":"en","type":"preprint","venue":"Journal of Computational and Graphical Statistics","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Division of Mathematical Sciences; Defense Threat Reduction Agency","keywords":"Cluster analysis; Single-linkage clustering; Complete-linkage clustering; Dendrogram; Complete linkage; Correlation clustering; CURE data clustering algorithm; Series (stratigraphy); Regular polygon; Mathematics; k-medians clustering; Computer science; Joins; Hamming distance; Combinatorics; Data mining; Artificial intelligence; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02095527728633263,"gpt":0.3180252457379465,"spread":0.2970699684516139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004794802,0.0002255996,0.0004116924,0.0003622977,0.0001293503,0.0002753068,0.0008002981,0.0001192886,0.000005068393],"category_scores_gemma":[0.0001833595,0.0001990292,0.0001023391,0.0001825113,0.000233837,0.0001625088,0.001429167,0.0009745506,0.000001778034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006271652,"about_ca_system_score_gemma":0.0002671473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005981103,"about_ca_topic_score_gemma":0.000001008335,"domain_scores_codex":[0.9977556,0.0001281861,0.0006910656,0.0003118791,0.0008541744,0.0002590764],"domain_scores_gemma":[0.9974967,0.0005151413,0.000521305,0.0002030143,0.001010951,0.0002528754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002214491,0.0005804367,0.0005051073,0.001827019,0.0008219169,0.003528405,0.0005879726,0.4636712,0.0002495759,0.1350822,0.01333325,0.3795914],"study_design_scores_gemma":[0.0002066919,0.0002135841,0.002268786,0.0001257287,0.00001088725,0.0006708865,9.514941e-7,0.4556902,0.00004104571,0.5403001,0.0003179582,0.0001531873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002689292,0.0002295926,0.9956621,0.0005470749,0.000578626,0.0001612413,0.00008034919,0.0000284393,0.00002331358],"genre_scores_gemma":[0.03935481,0.0001356047,0.9598658,0.0001514838,0.0004263087,0.000008999169,0.00001292948,0.00001581883,0.00002824824],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4052179,"threshold_uncertainty_score":0.8116174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389126399","doi":"10.1080/10618600.2023.2289532","title":"Model-Based Smoothing with Integrated Wiener Processes and Overlapping Splines","year":2023,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Centre for Global Health Research; St. Michael's Hospital; University of Waterloo; University of Toronto","funders":"","keywords":"Smoothing; Computer science; Smoothing spline; Econometrics; Mathematics; Mathematical optimization; Algorithm; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05858149059133981,"gpt":0.3136698684505276,"spread":0.2550883778591878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007950642,0.0001000769,0.0002223193,0.0002982623,0.000116126,0.0001487481,0.0001127458,0.00003910603,0.000004459665],"category_scores_gemma":[0.001853053,0.0000575083,0.00002078411,0.0008272425,0.0001701435,0.0001325019,0.00002141776,0.0001591161,9.147705e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007181172,"about_ca_system_score_gemma":0.0002123615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001711198,"about_ca_topic_score_gemma":0.00000318363,"domain_scores_codex":[0.9985337,0.00003683752,0.0004454934,0.0001400702,0.0007291299,0.0001147794],"domain_scores_gemma":[0.9959745,0.00266947,0.0002097282,0.00004441114,0.0009796374,0.0001222634],"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.00007666212,0.00002399227,0.002325285,0.00004421479,0.0000226173,0.00003871699,0.0001062437,0.9631642,0.00002088109,0.02880477,0.0007615492,0.004610849],"study_design_scores_gemma":[0.0002668515,0.00009783763,0.01067199,0.00005659899,0.00001387536,0.00003227606,0.00003856921,0.6674014,9.32189e-7,0.3212313,0.0001254928,0.00006287359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09389721,0.0001150106,0.9053048,0.0005348693,0.00004764629,0.00003622214,0.00004135749,0.00001452077,0.000008289324],"genre_scores_gemma":[0.8010091,0.00002378562,0.1987886,0.0001055047,0.0000323434,8.555892e-7,0.000006278859,0.000006159136,0.00002748271],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7071118,"threshold_uncertainty_score":0.234512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983531885","doi":"10.1198/106186002510","title":"On Markov chain Monte Carlo Algorithms for Computing Conditional Expectations Based on Sufficient Statistics","year":2002,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Memorial University of Newfoundland; National Science Foundation","keywords":"Mathematics; Markov chain Monte Carlo; Statistic; Monte Carlo method; Statistics; Sufficient statistic; Markov chain; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05024182247687973,"gpt":0.3371637433066434,"spread":0.2869219208297637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006376427,0.000234018,0.0004250367,0.0003127808,0.0002985017,0.00007371981,0.0001211529,0.00008781227,0.00004216154],"category_scores_gemma":[0.001543226,0.0001983226,0.0001420103,0.0001867759,0.0001591815,0.00004093461,0.00001784633,0.0003297985,2.04572e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000615677,"about_ca_system_score_gemma":0.00005461809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001393934,"about_ca_topic_score_gemma":0.000002483856,"domain_scores_codex":[0.9977224,0.0001980422,0.0008224167,0.0002193233,0.0007822833,0.0002554778],"domain_scores_gemma":[0.9869704,0.01131012,0.0005478135,0.00009534626,0.000842399,0.0002339585],"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.0002250291,0.001030384,0.0001175383,0.0001538601,0.0001397517,0.00008760754,0.000522006,0.08809371,0.000003943334,0.850912,0.03932834,0.0193858],"study_design_scores_gemma":[0.001595744,0.001041304,0.0007068024,0.00007643483,0.00006466985,0.0000307372,0.0001174587,0.7543796,0.000002856903,0.2414398,0.0003655451,0.0001790385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0153521,0.00007632696,0.9808771,0.0006314616,0.0003265301,0.000254834,0.002355052,0.00001550056,0.0001110779],"genre_scores_gemma":[0.4054681,0.000008649223,0.5937901,0.0004384908,0.0001570543,0.00000623212,0.00005679789,0.00002095506,0.00005361472],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6662859,"threshold_uncertainty_score":0.808736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044676318","doi":"10.1080/10618600.2012.681237","title":"The Generalized Ridge Trace Plot: Visualizing Bias<i>and</i>Precision","year":2012,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Plot (graphics); Univariate; Covariance; Mathematics; TRACE (psycholinguistics); Statistics; Ridge; Bivariate analysis; Algorithm; Multivariate statistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1215097228925973,"gpt":0.4251971058374141,"spread":0.3036873829448168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001390692,0.000133601,0.0002883701,0.00006092093,0.000305778,0.00006633917,0.00008194259,0.00005547427,0.000007019034],"category_scores_gemma":[0.002067543,0.00008015369,0.00005755199,0.0001072445,0.0001978708,0.0001381555,0.00004387564,0.000263696,5.87988e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001260838,"about_ca_system_score_gemma":0.00002549713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001656601,"about_ca_topic_score_gemma":8.340696e-7,"domain_scores_codex":[0.998329,0.0002633754,0.0006284063,0.00009327668,0.0004554979,0.0002304452],"domain_scores_gemma":[0.9886767,0.01037089,0.000356336,0.0000567665,0.0002770623,0.0002622966],"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.00009184748,0.00007757161,0.0002602543,0.00002592877,0.00004435448,0.000007527815,0.0002044552,0.0001451097,0.00003510946,0.9437299,0.001115257,0.05426272],"study_design_scores_gemma":[0.0005495758,0.00013805,0.005241473,0.00003299715,0.00006797199,0.0001739555,0.00003584381,0.01621367,0.00001482048,0.9731907,0.00423185,0.0001090632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07763135,0.001239706,0.9203196,0.0004235093,0.0001941482,0.00007231534,0.00008760388,0.000007549406,0.00002418059],"genre_scores_gemma":[0.2364615,0.0003747581,0.7628497,0.0001009329,0.0001721918,0.000001716372,0.000002786991,0.00001334212,0.00002306395],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1588302,"threshold_uncertainty_score":0.3268573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005955505","doi":"10.1198/106186005x47291","title":"Distance Measures and Smoothing Methodology for Imputing Features of Documents","year":2005,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":4,"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":"","keywords":"Categorical variable; Smoothing; Computer science; Class (philosophy); Missing data; Distance measures; Data mining; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.03319004123874491,"gpt":0.3298004024824565,"spread":0.2966103612437116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006880171,0.00007135922,0.0001934726,0.00009845273,0.00008551833,0.00005581469,0.000148973,0.00003941608,7.743675e-7],"category_scores_gemma":[0.0003176929,0.00005531895,0.00003967429,0.0001187066,0.0001129492,0.0001778011,0.00003842063,0.0001142546,3.99759e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009339701,"about_ca_system_score_gemma":0.00003710301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002530934,"about_ca_topic_score_gemma":0.000001239547,"domain_scores_codex":[0.9990848,0.00008070692,0.0003910032,0.0001022747,0.0002494562,0.00009174709],"domain_scores_gemma":[0.9978772,0.001202478,0.000360193,0.00004352574,0.0004505684,0.00006600713],"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.00003691645,0.00003178402,0.0003316287,0.00003581122,0.00003137947,0.000001632986,0.0001891734,0.0001141917,0.0003681272,0.6593113,0.0002807276,0.3392674],"study_design_scores_gemma":[0.0005713487,0.0003013251,0.0432875,0.00004510124,0.0000268541,0.0001278351,0.00002720748,0.02884952,0.001477576,0.9229331,0.00224021,0.0001123926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001894661,0.0007825027,0.9956866,0.001483805,0.00005179042,0.00005595845,0.00001627747,0.00000830065,0.00002014224],"genre_scores_gemma":[0.4232526,0.00008093037,0.5765318,0.00008984684,0.00003397534,6.067899e-7,0.000001108689,0.000001940963,0.000007249869],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4213579,"threshold_uncertainty_score":0.2255841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386608500","doi":"10.1080/10618600.2023.2257258","title":"Clustering Sequence Data with Mixture Markov Chains with Covariates Using Multiple Simplex Constrained Optimization Routine (MSiCOR)","year":2023,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":4,"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":"National Institute of Neurological Disorders and Stroke","keywords":"Expectation–maximization algorithm; Cluster analysis; Computer science; Covariate; Context (archaeology); Maximization; Simplex; Markov chain; Mixture model; Mathematical optimization; Data mining; Artificial intelligence; Machine learning; Mathematics; Statistics; Maximum likelihood","retraction":null,"screen_n_in":null,"score":{"opus":0.04511387327722369,"gpt":0.3033294974391578,"spread":0.2582156241619341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005502633,0.0001551469,0.0002614376,0.0001725756,0.0001788472,0.0001768068,0.0003654921,0.00005344625,0.000003696627],"category_scores_gemma":[0.0001177494,0.0001065412,0.00002070715,0.0006329356,0.0001572076,0.0003830329,0.0001550458,0.0002196166,1.431567e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001505822,"about_ca_system_score_gemma":0.0001870782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000101473,"about_ca_topic_score_gemma":0.000009802628,"domain_scores_codex":[0.9986154,0.0001187936,0.0003738122,0.0002498882,0.0004409658,0.0002010961],"domain_scores_gemma":[0.9981696,0.0007674664,0.0003339569,0.0001677168,0.0004049179,0.0001563641],"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.0001663153,0.00005676716,0.001995737,0.0000637843,0.0001411138,0.0003313609,0.0002416607,0.8960236,0.0000539092,0.06648555,0.0001971357,0.03424305],"study_design_scores_gemma":[0.000921295,0.0002215618,0.003262686,0.00008025047,0.00003701221,0.0006411871,0.00001269163,0.9712538,0.000002416761,0.02337944,0.00003563079,0.0001520214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003847301,0.00003411484,0.9948973,0.0007881108,0.00007367859,0.00009484927,0.0002288793,0.00002921664,0.000006534907],"genre_scores_gemma":[0.2329947,0.00002712189,0.7666654,0.0001629227,0.0000554694,5.178877e-7,0.00008097281,0.000008779545,0.000004121146],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2291474,"threshold_uncertainty_score":0.4344625,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4398162108","doi":"10.1080/10618600.2024.2335182","title":"Dynamic Survival Prediction Using Sparse Longitudinal Images via Multi-Dimensional Functional Principal Component Analysis","year":2024,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"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","keywords":"Principal component analysis; Functional principal component analysis; Component (thermodynamics); Computer science; Pattern recognition (psychology); Artificial intelligence; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.09073121337460423,"gpt":0.36224534566664,"spread":0.2715141322920358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000849931,0.0002158381,0.0004953867,0.0004648627,0.0001780432,0.0001219188,0.00008500875,0.00008944834,0.0001733185],"category_scores_gemma":[0.0004238775,0.0001698454,0.0002029163,0.0005812718,0.0002625619,0.0001285306,0.00005602698,0.0004458689,0.00000240449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007129784,"about_ca_system_score_gemma":0.0001295088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001322008,"about_ca_topic_score_gemma":0.000008906603,"domain_scores_codex":[0.9975037,0.0002101852,0.0009173864,0.0002631932,0.0008921968,0.0002133693],"domain_scores_gemma":[0.9954074,0.003378901,0.0002765445,0.00007366487,0.0006288138,0.0002346656],"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.0005787844,0.001494444,0.04046692,0.0006617213,0.006165935,0.0009101066,0.0002004789,0.1987568,0.001297378,0.7287965,0.001328862,0.01934209],"study_design_scores_gemma":[0.0002736991,0.00010828,0.1894429,0.00004434598,0.0006493012,0.000187336,0.000006709367,0.5089927,0.00000319859,0.300173,0.00001957024,0.00009894236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.152755,0.0002314289,0.8455327,0.0001251251,0.0005444703,0.00006870974,0.0007149312,0.00002146244,0.000006134557],"genre_scores_gemma":[0.4874488,0.0000149908,0.5123681,0.00001763847,0.00008211629,0.000001007709,0.00004373239,0.00001095504,0.00001268877],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4286235,"threshold_uncertainty_score":0.6926094,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406865792","doi":"10.1080/10618600.2025.2459287","title":"Online Kernel-Based Mode Learning","year":2025,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Artificial intelligence; Online learning; Kernel (algebra); Machine learning; Theoretical computer science; Mathematics; World Wide Web; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.007858430918642127,"gpt":0.2722409042906839,"spread":0.2643824733720417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005965998,0.00007395892,0.0001360338,0.0001402697,0.00003944227,0.00001646494,0.00005480594,0.00003227895,0.000004697525],"category_scores_gemma":[0.00007474536,0.00006705469,0.00002879091,0.0001250171,0.00005471991,0.00004252494,0.00001156702,0.0002659914,2.188134e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001926562,"about_ca_system_score_gemma":0.00002318659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.581917e-7,"about_ca_topic_score_gemma":0.000001027655,"domain_scores_codex":[0.9994826,0.00001737704,0.0002483451,0.00004713911,0.0001300031,0.00007450227],"domain_scores_gemma":[0.9994035,0.0003120646,0.00005582089,0.00002299893,0.0001591024,0.00004651512],"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.00001910772,0.0000358289,0.0008301106,0.00005186904,0.00003600213,0.0000160553,0.00001028135,0.944155,0.0001269699,0.0415611,0.0006549121,0.01250271],"study_design_scores_gemma":[0.0002458707,0.00007910981,0.02116817,0.00007723594,0.00001393654,0.000009557405,0.000005002466,0.6499489,0.00006040266,0.3264243,0.001901984,0.0000654893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03914196,0.0001570216,0.9603354,0.0001203381,0.00007264133,0.0000226056,0.00005158843,0.00004663185,0.00005183092],"genre_scores_gemma":[0.6486278,0.00003907728,0.3512176,0.00006178048,0.00002436258,4.241287e-7,0.00001250526,0.000005596713,0.00001079442],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6094859,"threshold_uncertainty_score":0.2734411,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021405587","doi":"10.1198/106186002718","title":"Detecting Clusters and Nonlinearity in Three-Dimensional Dynamic Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Cluster (spacecraft); Nonlinear system; Computer science; Diagonal; Artificial intelligence; Mathematics; Pattern recognition (psychology); Data mining; Physics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.05252146627871698,"gpt":0.356511468138576,"spread":0.303990001859859,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004304372,0.0001264604,0.0003119614,0.0001655467,0.00009538604,0.00002687888,0.00005294492,0.00006371013,0.00001822003],"category_scores_gemma":[0.0008198803,0.0001030183,0.00004162658,0.0001600466,0.0001799681,0.00008845748,0.00003712423,0.0003754052,2.828127e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000163012,"about_ca_system_score_gemma":0.00001358608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004671414,"about_ca_topic_score_gemma":0.00005384845,"domain_scores_codex":[0.9987013,0.00009148415,0.0005754672,0.0001392274,0.0003302894,0.0001621926],"domain_scores_gemma":[0.9959331,0.003443638,0.0002378134,0.00004102848,0.0001918936,0.0001524873],"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.0002106969,0.00050591,0.004553381,0.0002388029,0.0001191176,0.0003142125,0.0003155421,0.0109164,0.00004547125,0.7724802,0.0002468581,0.2100534],"study_design_scores_gemma":[0.0004903541,0.0001171704,0.009235727,0.00003702941,0.00001895768,0.0001329974,0.000008848792,0.3878638,4.561238e-7,0.6020119,0.00001121215,0.00007166575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2313269,0.0002139013,0.7679649,0.0003001295,0.00005801156,0.00005819283,0.00006204377,0.000004753876,0.00001119819],"genre_scores_gemma":[0.4419195,0.00003482207,0.5579473,0.00007262283,0.00001359198,5.969085e-7,0.000001417366,0.000006622902,0.00000352817],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3769473,"threshold_uncertainty_score":0.4200963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}