{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":12,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":12,"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":"48d19ed0378d","filters":{"venue":"Journal of Machine Learning Research"}},"results":[{"id":"W2126046032","doi":"","title":"SPMF: a Java open-source pattern mining library","year":2014,"lang":"en","type":"article","venue":"Journal of Machine Learning Research","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":417,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Moncton","funders":"","keywords":"Computer science; Java; Source code; License; Interface (matter); MIT License; Open source; Documentation; Database transaction; Implementation; Data mining; Database; Programming language; Information retrieval; World Wide Web; Operating system; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.05115801282898343,"gpt":0.3570069714406174,"spread":0.305848958611634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005018271,0.000114593,0.0002462483,0.0003919954,0.000451391,0.001378133,0.003738106,0.0000542594,0.0001044629],"category_scores_gemma":[0.0007992554,0.00009259699,0.00007156381,0.0007593492,0.0000678936,0.001361014,0.002111179,0.001394405,0.0001007136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002597163,"about_ca_system_score_gemma":0.0001535082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000921299,"about_ca_topic_score_gemma":0.000002911434,"domain_scores_codex":[0.9973193,0.0007322135,0.0004276059,0.0002851557,0.0008231597,0.0004125808],"domain_scores_gemma":[0.9977609,0.0009889345,0.000285602,0.0005058801,0.0002117429,0.000246937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001061745,0.00009738193,0.01270113,0.00001394591,0.00002147702,0.00003078669,0.0008678123,0.000398739,0.0002445677,0.001093274,0.01479633,0.9697239],"study_design_scores_gemma":[0.0006001992,0.0006044717,0.005083202,0.0001387083,0.000003883837,0.0002117979,0.0001303058,0.4226753,0.0002204645,0.0006229889,0.5695646,0.0001440724],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09662678,0.000472334,0.8714099,0.01865081,0.0002279282,0.000200379,0.000004058285,0.0001200842,0.01228775],"genre_scores_gemma":[0.799513,0.000119474,0.189574,0.0004894206,0.0007891075,0.00001079802,0.000009761105,0.00005479464,0.009439611],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9695799,"threshold_uncertainty_score":0.9996585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2490023472","doi":"10.5555/2946645.3007063","title":"Are random forests truly the best classifiers","year":2016,"lang":"en","type":"article","venue":"Journal of Machine Learning Research","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Genomics; University of Toronto","funders":"","keywords":"Random forest; Support vector machine; Random subspace method; Artificial intelligence; Machine learning; Computer science; Classifier (UML); Artificial neural network; Pattern recognition (psychology); Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.08091568562646898,"gpt":0.3714797027783613,"spread":0.2905640171518924,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.009731015,0.0001475032,0.0002725107,0.0004709224,0.0006662366,0.0003689397,0.002173047,0.00008771069,0.00005798731],"category_scores_gemma":[0.008756197,0.00006847439,0.000161089,0.0007111454,0.0002283755,0.0006363401,0.0003690451,0.001906703,0.0002066385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001157196,"about_ca_system_score_gemma":0.0001851734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000479245,"about_ca_topic_score_gemma":0.00004838485,"domain_scores_codex":[0.9950869,0.002123189,0.0005166531,0.000285434,0.001487763,0.0005000231],"domain_scores_gemma":[0.9945799,0.003091868,0.0007610859,0.0006452409,0.0007103069,0.0002115689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004557591,0.0001871516,0.426748,0.00003523226,0.000101808,0.000185274,0.0007025235,0.0007787752,0.00331368,0.007901537,0.01276345,0.5468268],"study_design_scores_gemma":[0.006458111,0.001444164,0.3588566,0.0006174521,0.000030177,0.0007393955,0.0006161663,0.0545474,0.0005055121,0.006710047,0.5690522,0.000422758],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2470242,0.002830813,0.5610548,0.1817753,0.001015578,0.0004486849,0.000006687007,0.0001537965,0.005690136],"genre_scores_gemma":[0.9937351,0.000316445,0.001241814,0.00009478956,0.00038783,0.000006135961,9.166591e-7,0.00001859829,0.004198316],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7467109,"threshold_uncertainty_score":0.9995935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146250995","doi":"10.5555/2627435.2697064","title":"Recursive teaching dimension, VC-dimension and sample compression","year":2014,"lang":"en","type":"article","venue":"Journal of Machine Learning Research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; University of Alberta","funders":"","keywords":"Dimension (graph theory); VC dimension; Intersection (aeronautics); Mathematics; Matching (statistics); Concept class; Class (philosophy); Bounded function; Sample (material); Theoretical computer science; Discrete mathematics; Computer science; Algorithm; Combinatorics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02693260769113972,"gpt":0.345164434175636,"spread":0.3182318264844963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.01115484,0.000196795,0.0004006775,0.0006561186,0.001083063,0.0003269939,0.0008330618,0.0001052771,0.00002780347],"category_scores_gemma":[0.006953037,0.0001459786,0.0001027246,0.0003838959,0.0001150051,0.0004690214,0.0007943188,0.004100969,0.00002089076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006078812,"about_ca_system_score_gemma":0.0000738665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003491336,"about_ca_topic_score_gemma":0.000004333811,"domain_scores_codex":[0.9939112,0.003267958,0.0005172269,0.0003900715,0.001375379,0.0005381677],"domain_scores_gemma":[0.9941788,0.004112975,0.0004136602,0.0003822812,0.0005668779,0.0003454275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002409238,0.0003747457,0.05462037,0.0001330123,0.0001019319,0.0001687,0.007592945,0.01447337,0.01606786,0.02086479,0.006828056,0.8785333],"study_design_scores_gemma":[0.001867021,0.002812125,0.01208025,0.0006415533,0.00001604046,0.0006498626,0.0002372836,0.8718269,0.0008282845,0.01402705,0.09462915,0.0003844673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5955049,0.00172995,0.3899291,0.009969783,0.000737942,0.0002095333,0.000001259,0.000147422,0.001770198],"genre_scores_gemma":[0.9018227,0.0001171426,0.09698966,0.0001229367,0.0003922635,0.000001305292,0.000002224596,0.0000253029,0.000526475],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8781489,"threshold_uncertainty_score":0.9981966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2185184584","doi":"","title":"A characterization of linkage-based hierarchical clustering","year":2016,"lang":"en","type":"article","venue":"Journal of Machine Learning Research","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":50,"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":"Linkage (software); Hierarchical clustering of networks; Hierarchical clustering; Computer science; Class (philosophy); Cluster analysis; Complete linkage; Locality; Hierarchical database model; Mathematics; Artificial intelligence; Algorithm; Data mining; Canopy clustering algorithm; Correlation clustering","retraction":null,"screen_n_in":null,"score":{"opus":0.04192133453023034,"gpt":0.3573990556538818,"spread":0.3154777211236515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005287281,0.0001296966,0.0003198446,0.001032698,0.0001859718,0.0001063119,0.001475027,0.00009024832,0.00005025783],"category_scores_gemma":[0.002681607,0.00008555382,0.0001268387,0.0009162197,0.0002010292,0.0006055057,0.0006535628,0.00141445,0.0000203427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001716473,"about_ca_system_score_gemma":0.0003522251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001119775,"about_ca_topic_score_gemma":0.000002105087,"domain_scores_codex":[0.9955961,0.001117472,0.0006368512,0.0002640732,0.001839898,0.0005455668],"domain_scores_gemma":[0.9963267,0.001491388,0.0003742478,0.0004108526,0.001156663,0.0002401183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002055946,0.0001210176,0.00348348,0.00009219984,0.0000284213,0.0001394695,0.0002993578,0.002284849,0.6611133,0.0002828685,0.00001106137,0.3319384],"study_design_scores_gemma":[0.004362864,0.003872809,0.024979,0.001520208,0.000007467831,0.0003573688,0.00002870997,0.8356362,0.1171471,0.001535756,0.0101556,0.0003969591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2119449,0.00006394974,0.7835779,0.004069295,0.0001161477,0.00009692478,0.00000189564,0.00002937504,0.00009963896],"genre_scores_gemma":[0.9575171,0.000108575,0.04138668,0.00002270611,0.0002126433,0.000004225592,0.000001015389,0.00002547294,0.0007215927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8333514,"threshold_uncertainty_score":0.6145158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159136633","doi":"10.5555/2627435.2750354","title":"Efficient learning and planning with compressed predictive states","year":2014,"lang":"en","type":"article","venue":"Journal of Machine Learning Research","topic":"Reinforcement Learning in Robotics","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":"McGill University","funders":"","keywords":"Computer science; Reinforcement learning; Artificial intelligence; Observable; A priori and a posteriori; Dimensionality reduction; Machine learning; Curse of dimensionality","retraction":null,"screen_n_in":null,"score":{"opus":0.0249183959460578,"gpt":0.331304983517485,"spread":0.3063865875714272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.005894953,0.0001819664,0.000341643,0.0006333191,0.0006205583,0.0004457496,0.0007378692,0.00006792065,0.00001393811],"category_scores_gemma":[0.002185107,0.0001332722,0.00005125783,0.0005861575,0.0002047649,0.00022323,0.0004703248,0.003118607,0.000009896463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000080681,"about_ca_system_score_gemma":0.0001076706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000222164,"about_ca_topic_score_gemma":4.209511e-7,"domain_scores_codex":[0.9957034,0.001343142,0.0004425854,0.0002948857,0.001645549,0.000570457],"domain_scores_gemma":[0.9959605,0.00223669,0.0004558372,0.0002106442,0.0008819324,0.0002544201],"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.0001315104,0.00002716824,0.05697921,0.0000376587,0.0000519098,0.00005595272,0.002530865,0.9361988,0.000260343,0.0004711334,0.00006811733,0.003187376],"study_design_scores_gemma":[0.001011535,0.002984463,0.007667805,0.0002789267,0.00000966031,0.0001517915,0.0004611005,0.9808924,0.0001317663,0.00008085598,0.006186198,0.0001434924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1893721,0.0003850899,0.8081517,0.0004733903,0.00008708872,0.000105579,1.394694e-7,0.00006202696,0.00136288],"genre_scores_gemma":[0.9846391,0.00005298628,0.01452557,0.00002490605,0.0001487018,0.000002234473,0.000001510804,0.00002565146,0.0005793448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.795267,"threshold_uncertainty_score":0.9991812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397184916","doi":"","title":"Hybrid orthogonal projection and estimation (HOPE): a new framework to learn neural networks","year":2016,"lang":"en","type":"article","venue":"Journal of Machine Learning Research","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":16,"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":"MNIST database; Computer science; Artificial intelligence; TIMIT; Unsupervised learning; Projection (relational algebra); Artificial neural network; Machine learning; Feature (linguistics); Generative model; Pattern recognition (psychology); Generative grammar; Hidden Markov model; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04822904721375278,"gpt":0.353960200129276,"spread":0.3057311529155232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003099784,0.0001044078,0.0001831749,0.0005684133,0.0002590099,0.0003109138,0.0004054925,0.00006214664,0.0001210865],"category_scores_gemma":[0.004281899,0.00006797117,0.00007015526,0.0004905472,0.00004415295,0.0005466442,0.0001984045,0.00105058,0.00004278532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007364948,"about_ca_system_score_gemma":0.0001300702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003422932,"about_ca_topic_score_gemma":0.00000563678,"domain_scores_codex":[0.9976577,0.0006302999,0.0003260068,0.000228281,0.0008154119,0.0003422909],"domain_scores_gemma":[0.9977841,0.001263771,0.0001633901,0.0001582435,0.0003055201,0.0003249683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009675166,0.00002505432,0.004252437,0.000004402797,0.00001481548,0.00004947079,0.0001478602,0.001349839,0.0002360122,0.0004023325,0.001190724,0.9922303],"study_design_scores_gemma":[0.000784846,0.001424884,0.01575617,0.0003942277,0.000008919439,0.001337306,0.0000324718,0.9597686,0.0006181842,0.006664558,0.01299008,0.0002197917],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1796078,0.0001739421,0.8075784,0.01213501,0.0001878615,0.0001099133,3.017155e-7,0.00003599912,0.0001707706],"genre_scores_gemma":[0.9035174,0.0001196107,0.09455599,0.0001594739,0.0004596113,0.000004647287,3.500604e-7,0.00001517912,0.001167752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9920105,"threshold_uncertainty_score":0.5126143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2465040775","doi":"10.5555/3122009.3122040","title":"Preference-based teaching","year":2017,"lang":"en","type":"article","venue":"Journal of Machine Learning Research","topic":"Machine Learning and Algorithms","field":"Computer Science","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 Regina","funders":"","keywords":"Class (philosophy); Mathematics; Dimension (graph theory); Closure (psychology); Preference; Operator (biology); Euclidean geometry; Discrete mathematics; Concept class; Algebra over a field; Combinatorics; Pure mathematics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.12414997380128,"gpt":0.4013568101094664,"spread":0.2772068363081864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.01212998,0.0001654085,0.000325498,0.0005902577,0.002516149,0.001550212,0.004007208,0.00009070366,0.00005967609],"category_scores_gemma":[0.007962771,0.0001259615,0.0001775877,0.0001587501,0.0001597011,0.0008243326,0.0006986922,0.005379361,0.00006701217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008097903,"about_ca_system_score_gemma":0.0003435297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002954596,"about_ca_topic_score_gemma":0.000007688515,"domain_scores_codex":[0.9955482,0.00150457,0.0004539441,0.0003008446,0.001616103,0.0005762952],"domain_scores_gemma":[0.9966276,0.0008566614,0.0007083597,0.0009295003,0.0006014372,0.0002764952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001174501,0.0003425251,0.146476,0.00008611986,0.00008734466,0.0005943952,0.001271005,0.0103901,0.001779648,0.01045334,0.004313689,0.8240884],"study_design_scores_gemma":[0.001854317,0.001678723,0.05339543,0.0003567036,0.000009866111,0.0002202559,0.00005218337,0.8129829,0.0006642715,0.002801527,0.1256615,0.0003224014],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2770174,0.001430405,0.6157677,0.04416674,0.001963647,0.0003473019,0.000002263964,0.0002837362,0.05902082],"genre_scores_gemma":[0.9611134,0.00002958594,0.03518218,0.00005553258,0.0005251078,0.000002076293,7.274988e-7,0.00001967956,0.003071727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.823766,"threshold_uncertainty_score":0.9994863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2946302343","doi":"","title":"Robust Estimation of Derivatives Using Locally Weighted Least Absolute Deviation Regression","year":2019,"lang":"en","type":"article","venue":"Journal of Machine Learning Research","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Least absolute deviations; Mathematics; Absolute deviation; Mean absolute error; Regression; Estimation; Robust regression; Statistics; Standard deviation; Linear regression; Computer science; Mean squared error; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.2541103090533701,"gpt":0.500195041705714,"spread":0.2460847326523439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004376187,0.0001176765,0.0003977948,0.0003608659,0.0001426471,0.00003029596,0.0001886725,0.00008623613,0.0001348869],"category_scores_gemma":[0.006652079,0.00008465416,0.00008319756,0.0003565545,0.00008444099,0.000291281,0.00009188566,0.001086979,0.000005697804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001141012,"about_ca_system_score_gemma":0.0001331705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000159606,"about_ca_topic_score_gemma":0.0000016396,"domain_scores_codex":[0.9969366,0.0009987768,0.0006718499,0.0001480979,0.0009830536,0.0002616499],"domain_scores_gemma":[0.9954461,0.002607177,0.0007214977,0.0001538095,0.0009726702,0.00009875064],"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.001674256,0.0005633013,0.007355062,0.001539245,0.0002198283,0.000061,0.002601948,0.560499,0.1126606,0.05390102,0.0002168315,0.2587079],"study_design_scores_gemma":[0.0007300103,0.0005237049,0.001435416,0.0009299477,0.0000213673,0.0000408275,0.0001892543,0.899099,0.002065381,0.09477329,0.00009447465,0.00009734698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3696548,0.0001340517,0.6297181,0.0001283998,0.00004749868,0.000115222,0.000001632658,0.000006611367,0.0001936657],"genre_scores_gemma":[0.5046512,0.00003246724,0.4950263,0.000002915766,0.00004171517,5.711843e-7,0.000001487659,0.00001838891,0.0002249119],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3386,"threshold_uncertainty_score":0.7963639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964112145","doi":"","title":"Weak convergence properties of constrained emphatic temporal-difference learning with constant and slowly diminishing stepsize","year":2016,"lang":"en","type":"article","venue":"Journal of Machine Learning Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Iterated function; Convergence (economics); Markov decision process; Markov chain; Mathematics; Weak convergence; Constant (computer programming); Ergodic theory; Applied mathematics; Divergence (linguistics); Rate of convergence; Limit (mathematics); Stochastic approximation; Markov process; Mathematical optimization; Computer science; Key (lock); Mathematical analysis; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05478746984954716,"gpt":0.3014922333272734,"spread":0.2467047634777262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005013146,0.0002394544,0.0005455358,0.0005090158,0.0003824595,0.0002781364,0.001053195,0.00008988054,0.00004224577],"category_scores_gemma":[0.004463488,0.0001364396,0.00007918409,0.0005774282,0.0009105948,0.0007533361,0.0004775556,0.001490702,0.000007703147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009295855,"about_ca_system_score_gemma":0.0005817413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006953876,"about_ca_topic_score_gemma":0.000005393544,"domain_scores_codex":[0.9952306,0.001184055,0.0008706066,0.0003528706,0.001765835,0.0005960707],"domain_scores_gemma":[0.9955349,0.001737736,0.0009328045,0.000330327,0.00120448,0.0002597593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000763562,0.0001354273,0.714509,0.0006088418,0.0003305523,0.0002741014,0.005765186,0.03568071,0.1920551,0.007446728,0.0000590596,0.04237182],"study_design_scores_gemma":[0.01358927,0.02173246,0.04688054,0.01806772,0.0001332882,0.003037219,0.005186555,0.8441844,0.03958356,0.0009523251,0.004825151,0.001827525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6905428,0.000757149,0.3055547,0.002142891,0.0001099103,0.0002313389,6.458457e-7,0.00005140738,0.0006091964],"genre_scores_gemma":[0.9850425,0.0004383789,0.01229681,0.0000148091,0.00004251771,0.000003441208,3.225768e-7,0.00002421499,0.002136998],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8085037,"threshold_uncertainty_score":0.6476443,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2586119848","doi":"","title":"Blending learning and inference in conditional random fields","year":2016,"lang":"en","type":"article","venue":"Journal of Machine Learning Research","topic":"Advanced Image and Video Retrieval 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":"Inference; Conditional random field; Conditional probability distribution; Approximate inference; Artificial intelligence; Computer science; Machine learning; Random variable; Structured prediction; Set (abstract data type); Mathematics; Conditional probability; Exponential family; Algorithm; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04452678542633241,"gpt":0.4150474173640054,"spread":0.3705206319376729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004025817,0.00008444914,0.0002058064,0.0005868389,0.0001744241,0.0001149805,0.0004083619,0.00006142072,0.00005418157],"category_scores_gemma":[0.007135104,0.0000546816,0.0000454615,0.0004170458,0.0001008086,0.0008432222,0.0002879553,0.00145202,0.000006690723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006676032,"about_ca_system_score_gemma":0.00009794442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001366523,"about_ca_topic_score_gemma":0.00000338112,"domain_scores_codex":[0.997995,0.0006022983,0.0003304526,0.0001715598,0.0005994784,0.0003012074],"domain_scores_gemma":[0.9956856,0.003636696,0.0001662557,0.00009201479,0.000317175,0.000102303],"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.0003456359,0.00008318608,0.2621181,0.00004659869,0.00003009353,0.0005013337,0.0007754797,0.0005701208,0.02434456,0.01050566,0.0002172593,0.700462],"study_design_scores_gemma":[0.02929961,0.01259531,0.1315242,0.005412842,0.00002660523,0.002226527,0.0006694227,0.1097284,0.1145752,0.4068151,0.1852461,0.001880791],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06858215,0.000932098,0.9273162,0.002493783,0.00004122877,0.00006912098,3.350304e-7,0.00003398065,0.0005311274],"genre_scores_gemma":[0.9888924,0.001623892,0.008705841,0.00002264177,0.00007299629,0.000002133199,2.708823e-7,0.000006782934,0.0006730899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9203102,"threshold_uncertainty_score":0.8541902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3008911943","doi":"","title":"Distributed feature screening via componentwise debiasing","year":2020,"lang":"en","type":"article","venue":"Journal of Machine Learning Research","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Estimator; Computer science; Feature (linguistics); Statistic; Component (thermodynamics); Range (aeronautics); Measure (data warehouse); Convergence (economics); Distributive property; Function (biology); Algorithm; Big data; Data mining; Mathematics; Mathematical optimization; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.2633586722264855,"gpt":0.4710831888186636,"spread":0.2077245165921781,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003891894,0.0001334645,0.0004078096,0.0001481556,0.0002870404,0.0001186802,0.0003832889,0.00008936533,0.0002655899],"category_scores_gemma":[0.02939388,0.0001011787,0.000124013,0.0005275692,0.0001056358,0.00009754055,0.0001842541,0.003241934,0.00001479283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004922176,"about_ca_system_score_gemma":0.00006306011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002097151,"about_ca_topic_score_gemma":0.000001214542,"domain_scores_codex":[0.996443,0.001430281,0.0004598674,0.0001650494,0.001098121,0.0004037084],"domain_scores_gemma":[0.9936718,0.004867288,0.0002923208,0.0001192272,0.0006630538,0.0003863296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004193027,0.0008443107,0.1272923,0.00145269,0.0008038551,0.003101089,0.006568081,0.003111495,0.08409219,0.0330228,0.05419161,0.6813266],"study_design_scores_gemma":[0.005450014,0.005118141,0.03957131,0.001642382,0.0002084368,0.0009836288,0.001580668,0.7293015,0.004613745,0.1438705,0.06669187,0.0009678871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08639812,0.0004170723,0.9017749,0.01074327,0.00006368812,0.0001118021,0.00001349766,0.0000352489,0.0004423281],"genre_scores_gemma":[0.6793402,0.00002733696,0.3201138,0.00008865773,0.0003215549,8.329815e-7,0.000004566801,0.00002719723,0.00007583371],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7261899,"threshold_uncertainty_score":0.9990577,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037218554","doi":"","title":"Statistical guarantees for local graph clustering","year":2020,"lang":"en","type":"article","venue":"Journal of Machine Learning Research","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":0,"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":"PageRank; Cluster analysis; Computer science; Graph; Theoretical computer science; Cluster (spacecraft); Clustering coefficient; Path (computing); Mathematics; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.07959760419103978,"gpt":0.4021193523576084,"spread":0.3225217481665686,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00375259,0.0001498341,0.0003534206,0.0004140692,0.0003721083,0.0002901518,0.001649796,0.00007167174,0.00003420198],"category_scores_gemma":[0.00407974,0.0001258543,0.0001351494,0.000834947,0.0002119862,0.0004775063,0.0008077099,0.002264995,0.00002103394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001137093,"about_ca_system_score_gemma":0.0002312321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001891345,"about_ca_topic_score_gemma":0.000004131235,"domain_scores_codex":[0.9961278,0.0006182205,0.0005413266,0.0003476861,0.001623561,0.0007413942],"domain_scores_gemma":[0.9960088,0.002185058,0.0001704242,0.000231223,0.0009485182,0.0004559831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001169283,0.0001735594,0.001399828,0.0004959559,0.0001563398,0.001004158,0.003039659,0.2559769,0.005681234,0.006058795,0.002874413,0.7219698],"study_design_scores_gemma":[0.001123063,0.002350006,0.0003855236,0.0000642637,0.000003707228,0.0001875514,0.0001837236,0.9766591,0.0004849478,0.002508081,0.01591122,0.0001388184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002342616,0.0004900371,0.989072,0.007599811,0.0001222159,0.0001878666,0.000004630324,0.00005220953,0.0001286197],"genre_scores_gemma":[0.7185916,0.0001091944,0.2805055,0.00014071,0.0004257492,0.000009695871,0.0000020032,0.00003625361,0.0001793254],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.721831,"threshold_uncertainty_score":0.9840402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}