{"meta":{"query_hash":"48d19ed0378d","filters":{"venue":"Journal of Machine Learning Research"},"cohort_total":12,"direct_labels_cover":0,"predictions_cover":12,"exported":12,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/48d19ed0378d","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05115801282898343,"score_gpt":0.35700697144061744,"score_spread":0.305848958611634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126046032","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029102103,0.00083012163,0.649344,0.00034843065,0.00020330439,0.0004698611,0.0550875,0.2852024,0.0056041474],"genre_scores_gemma":[0.011630879,0.00093620166,0.8173952,0.0004749344,0.000118597396,0.0013193496,0.13848923,0.019465825,0.010169804],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99806744,0.00014748507,0.00034401464,0.0005070489,0.0007903407,0.0001437532],"domain_scores_gemma":[0.9972995,0.0011168094,0.0002865419,0.00042032698,0.0007168239,0.00016008863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001503976,0.0024224229,0.0015759583,0.00640036,0.0009745544,0.0027548857,0.004373354,0.001179383,0.029925544],"category_scores_gemma":[0.008411132,0.0017220557,0.0027279283,0.0055305106,0.00040516243,0.004108985,0.0021540842,0.0016448676,0.031749774],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037549398,0.00024465105,0.0054694344,0.0024685268,0.0003552765,0.00056327105,0.00024023112,0.0038666308,0.00868571,0.0058636116,0.38710243,0.5847647],"study_design_scores_gemma":[0.00033854533,0.00018911494,0.008706733,0.0005702608,0.00026914102,0.0030961165,0.00017944633,0.07574019,0.031025892,0.032677248,0.84691906,0.00028822964],"about_ca_topic_score_codex":0.0030374192,"about_ca_topic_score_gemma":0.004064546,"teacher_disagreement_score":0.029925544,"about_ca_system_score_codex":0.0006285683,"about_ca_system_score_gemma":0.0027230382,"threshold_uncertainty_score":0.10011095},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026932607691139716,"score_gpt":0.345164434175636,"score_spread":0.3182318264844963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146250995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26312155,0.0036195954,0.69336563,0.0030054483,0.000107108564,0.00021324394,0.0016465703,0.001184783,0.033736072],"genre_scores_gemma":[0.9083623,0.0012014556,0.083185464,0.00042193785,0.00024646812,0.00038883137,0.0011250763,0.00023356508,0.0048347786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971269,0.0007582843,0.00013885382,0.000690925,0.00087431195,0.00041085316],"domain_scores_gemma":[0.9694579,0.022734417,0.0015828785,0.004043048,0.0010311595,0.0011505554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024905268,0.00076723425,0.0012127138,0.0021699776,0.0013372501,0.0040163468,0.0019409187,0.0014691323,0.005919273],"category_scores_gemma":[0.024057852,0.00048693188,0.0010055145,0.0020550839,0.0046582217,0.0076483926,0.0028811344,0.0035915424,0.00052858493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014045424,0.0000676516,0.002921507,0.0001802225,0.000033716216,0.000084753585,0.0002631845,0.035371687,0.0015165298,0.91391677,0.002597356,0.042906243],"study_design_scores_gemma":[0.00003549369,0.00007136706,0.001074096,0.000061134546,0.00002521206,0.00023438483,0.000071709,0.13506198,0.002217383,0.8558816,0.005220465,0.000045283443],"about_ca_topic_score_codex":0.0009872763,"about_ca_topic_score_gemma":0.0009988087,"teacher_disagreement_score":0.005919273,"about_ca_system_score_codex":0.0032153334,"about_ca_system_score_gemma":0.0012452353,"threshold_uncertainty_score":0.02332896},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0249183959460578,"score_gpt":0.331304983517485,"score_spread":0.30638658757142717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159136633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009767411,0.00014130655,0.9876452,0.00025378334,0.000021618354,0.00003966036,0.0001056526,0.0004894075,0.0015360288],"genre_scores_gemma":[0.6970861,0.0003666247,0.29874808,0.00021754841,0.00007314551,0.00031320337,0.0005853173,0.00017686392,0.0024331363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935013,0.00022210804,0.000035641755,0.00013563693,0.00018730988,0.00006918975],"domain_scores_gemma":[0.9969933,0.0021859906,0.00026075382,0.0002964257,0.0001880986,0.00007538916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010261993,0.0009278636,0.0010285862,0.00053637195,0.00037464662,0.00094837503,0.0013524804,0.0011043325,0.0024051366],"category_scores_gemma":[0.006623545,0.0007307275,0.00063332065,0.0006720937,0.0015036294,0.002236263,0.0017753841,0.0022095933,0.00029672674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059290756,0.00002287417,0.00018136675,0.000048825088,0.000013479001,0.000048991882,0.000064559725,0.945515,0.0006830539,0.031121122,0.0007127859,0.021528732],"study_design_scores_gemma":[0.0000050639037,0.00000817096,0.000018639856,0.000004436293,0.000001732015,0.0000056085987,0.000004447311,0.9857195,0.00023637226,0.013818709,0.00017470968,0.0000026621199],"about_ca_topic_score_codex":0.0067225057,"about_ca_topic_score_gemma":0.006948614,"teacher_disagreement_score":0.0067225057,"about_ca_system_score_codex":0.0011131369,"about_ca_system_score_gemma":0.0016629606,"threshold_uncertainty_score":0.013366759},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04192133453023034,"score_gpt":0.3573990556538818,"score_spread":0.31547772112365147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185184584","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008078279,0.00039904908,0.9850124,0.00038335953,0.000034314515,0.00008463912,0.00015441643,0.0002731132,0.005580434],"genre_scores_gemma":[0.39553988,0.0012317589,0.5911429,0.0010167824,0.00050399173,0.00066767895,0.0013008008,0.0005275722,0.00806861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951126,0.0012607281,0.00022447263,0.0010436588,0.002071574,0.00028703397],"domain_scores_gemma":[0.9856655,0.005817783,0.0018264215,0.0025013196,0.0035807064,0.00060817716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004536599,0.000711996,0.00089122227,0.003547776,0.002222597,0.0031734717,0.002721125,0.0020261623,0.0043216357],"category_scores_gemma":[0.023411307,0.0005683326,0.0009671164,0.0038049226,0.0031712218,0.0055297106,0.0040653297,0.002317522,0.0018637681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000840675,0.00008691362,0.0032289233,0.00028111046,0.00010818184,0.0001877139,0.0009206968,0.06947049,0.005950893,0.8064811,0.008557828,0.10464202],"study_design_scores_gemma":[0.000033508768,0.00013236301,0.0018386095,0.00009583523,0.00004501681,0.0005751984,0.00038141763,0.31308493,0.004435547,0.6485292,0.030782267,0.00006617315],"about_ca_topic_score_codex":0.0012510361,"about_ca_topic_score_gemma":0.0011288632,"teacher_disagreement_score":0.004536599,"about_ca_system_score_codex":0.0017985703,"about_ca_system_score_gemma":0.0017266654,"threshold_uncertainty_score":0.023992121},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.048229047213752776,"score_gpt":0.353960200129276,"score_spread":0.3057311529155232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397184916","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011929155,0.00013948158,0.99816376,0.00010396377,0.000011766979,0.000010033501,0.000033976416,0.00013981985,0.0002042446],"genre_scores_gemma":[0.25868666,0.0009708275,0.73349667,0.00053284946,0.00027448116,0.00046255157,0.00067902874,0.00025726587,0.0046396246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974879,0.001461324,0.000086951164,0.0004326163,0.0004001085,0.00013108527],"domain_scores_gemma":[0.9973972,0.0015829768,0.00021379402,0.00038339512,0.00031249598,0.000110172914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00389743,0.0014206986,0.0014049379,0.001125424,0.00050818536,0.0013586036,0.0032466731,0.0018551905,0.0017100208],"category_scores_gemma":[0.007084669,0.0010706318,0.0014509956,0.0014208244,0.0020234846,0.0034749103,0.0031136554,0.0033905744,0.0006189697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001194381,0.0000845525,0.0015792502,0.00016366047,0.0002293617,0.00011503197,0.00016890022,0.69865113,0.0020328278,0.14478765,0.0029844749,0.14908361],"study_design_scores_gemma":[0.0000049859186,0.000023471037,0.00007920357,0.000009076288,0.000007924168,0.000018244638,0.000005705551,0.9628166,0.0002577311,0.03606269,0.0007051979,0.00000919879],"about_ca_topic_score_codex":0.0036919478,"about_ca_topic_score_gemma":0.004726877,"teacher_disagreement_score":0.00389743,"about_ca_system_score_codex":0.00087584736,"about_ca_system_score_gemma":0.0011806795,"threshold_uncertainty_score":0.020611823},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12414997380127998,"score_gpt":0.40135681010946644,"score_spread":0.27720683630818643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465040775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058840975,0.00039090746,0.8788213,0.0026901765,0.00011139077,0.00015891556,0.00064537174,0.00061681867,0.057724163],"genre_scores_gemma":[0.85632646,0.00029128353,0.12176227,0.00044329866,0.00014504277,0.00029484893,0.00039252185,0.00011977646,0.02022453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948467,0.0018482186,0.00024911552,0.0011948609,0.0012235659,0.0006375417],"domain_scores_gemma":[0.98566806,0.0071900436,0.0013258437,0.0031012634,0.0012069419,0.0015078101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031434977,0.0006732454,0.0010408236,0.00092598767,0.0014132882,0.0047651846,0.003291069,0.002326942,0.020122826],"category_scores_gemma":[0.017984156,0.0005407924,0.0011761256,0.001527893,0.0038749122,0.012206366,0.0032931704,0.0036859715,0.0020897365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103748185,0.00006383675,0.00057603535,0.000071841925,0.000018417008,0.00008191791,0.00025974412,0.018898396,0.0008541955,0.9615421,0.0012977481,0.016231911],"study_design_scores_gemma":[0.000040507304,0.00008925926,0.0003113301,0.000024929777,0.00002188329,0.00017965041,0.00012555957,0.14940856,0.0011878613,0.84148777,0.007089612,0.000033022687],"about_ca_topic_score_codex":0.0015481005,"about_ca_topic_score_gemma":0.0018543395,"teacher_disagreement_score":0.020122826,"about_ca_system_score_codex":0.0037595388,"about_ca_system_score_gemma":0.0014762348,"threshold_uncertainty_score":0.067317545},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08091568562646898,"score_gpt":0.37147970277836134,"score_spread":0.2905640171518924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490023472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28106698,0.08437066,0.4143722,0.11539673,0.010061593,0.00045837555,0.014157876,0.004089523,0.07602616],"genre_scores_gemma":[0.82904553,0.0076143974,0.13107443,0.0140101155,0.0033287653,0.00026682657,0.0066136224,0.0013281574,0.006718055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9757118,0.013246091,0.0012502312,0.003669101,0.005083793,0.0010389383],"domain_scores_gemma":[0.93806493,0.040652815,0.0025928663,0.009441436,0.007903337,0.0013445598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.032703884,0.0012059308,0.0023184712,0.0022354277,0.0017373147,0.0049352637,0.0014754849,0.0031910555,0.0035390733],"category_scores_gemma":[0.11922996,0.00068505283,0.0018883223,0.0020848745,0.0017688122,0.011309499,0.000942665,0.0039053743,0.0045869173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030062736,0.00038927753,0.05076744,0.0014458828,0.0017522319,0.0002793353,0.0008955449,0.02337026,0.0024257018,0.05884807,0.21443053,0.64238954],"study_design_scores_gemma":[0.00084175356,0.0014992742,0.028167661,0.002883185,0.0015124459,0.0013260801,0.0026940878,0.14825314,0.01326493,0.6103843,0.18880041,0.00037266535],"about_ca_topic_score_codex":0.0018749385,"about_ca_topic_score_gemma":0.004684045,"teacher_disagreement_score":0.032703884,"about_ca_system_score_codex":0.001288601,"about_ca_system_score_gemma":0.0019194941,"threshold_uncertainty_score":0.17295676},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04452678542633241,"score_gpt":0.41504741736400536,"score_spread":0.37052063193767293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586119848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018004462,0.00005631792,0.99774003,0.000051974366,0.000006081361,0.00001543956,0.000008365341,0.00016558172,0.00015585597],"genre_scores_gemma":[0.16180395,0.00024281192,0.8355654,0.00021491971,0.000096695425,0.00018498335,0.0001931646,0.0002862309,0.0014118544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945892,0.0027873556,0.00030823113,0.00096685806,0.0009878039,0.00036052626],"domain_scores_gemma":[0.9846394,0.01227682,0.00059471146,0.0014537078,0.0007590811,0.0002761839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012778644,0.0014376211,0.0025374312,0.0013974606,0.0006651271,0.0020970402,0.002936924,0.0023779427,0.0022422064],"category_scores_gemma":[0.028654108,0.0013593775,0.0018903526,0.0013957536,0.0031978062,0.005714582,0.005268631,0.004219022,0.00072733714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020146891,0.00016417324,0.0014939858,0.00019027873,0.0001323668,0.000091791655,0.000244621,0.6682025,0.0033453132,0.14115484,0.001205602,0.18357301],"study_design_scores_gemma":[0.000011996533,0.000023182107,0.00010545614,0.000011484032,0.000009786384,0.000019783807,0.000006634137,0.9386956,0.000895941,0.059833184,0.00037624256,0.000010820254],"about_ca_topic_score_codex":0.004235767,"about_ca_topic_score_gemma":0.004692204,"teacher_disagreement_score":0.012778644,"about_ca_system_score_codex":0.0022591958,"about_ca_system_score_gemma":0.0022908573,"threshold_uncertainty_score":0.0675807},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2541103090533701,"score_gpt":0.500195041705714,"score_spread":0.24608473265234393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946302343","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008200849,0.000120536504,0.9910527,0.00003474843,0.00002103719,0.0000060212124,0.000018484025,0.00033176274,0.00021389061],"genre_scores_gemma":[0.3675678,0.00036093453,0.62741613,0.000063732434,0.00007335949,0.000058037785,0.0003125945,0.00070887123,0.0034386106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990791,0.00032638415,0.00004828061,0.00021309049,0.00027866257,0.000054522945],"domain_scores_gemma":[0.9981477,0.00083432475,0.00024502882,0.00033959304,0.00038321444,0.00005012218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013977016,0.00087624224,0.0012679658,0.0007703178,0.00034853164,0.0011717761,0.0011247424,0.0008915569,0.0011422945],"category_scores_gemma":[0.0069277748,0.0005862036,0.00087800226,0.0008718308,0.0006020158,0.0017526544,0.001075785,0.0018266349,0.0007577383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037274283,0.00011870452,0.0018883545,0.00023079349,0.00028842269,0.00016784908,0.00012114183,0.6381451,0.05186022,0.03125278,0.002643944,0.27290997],"study_design_scores_gemma":[0.0000048493116,0.000021284151,0.000284655,0.000005184236,0.000010341085,0.000020046027,0.0000040151626,0.99228,0.0040448178,0.0028877377,0.00042609873,0.000011057436],"about_ca_topic_score_codex":0.0026448283,"about_ca_topic_score_gemma":0.0026129433,"teacher_disagreement_score":0.0026448283,"about_ca_system_score_codex":0.0004292369,"about_ca_system_score_gemma":0.0011096611,"threshold_uncertainty_score":0.0073918104},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05478746984954716,"score_gpt":0.3014922333272734,"score_spread":0.2467047634777262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964112145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032825395,0.00027494863,0.9640053,0.000345799,0.000037880054,0.00005851728,0.00005684409,0.00011310534,0.0022822341],"genre_scores_gemma":[0.7757737,0.00054939365,0.21744907,0.00045276177,0.000077840814,0.0004724268,0.00026536174,0.00017048467,0.0047889403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982431,0.0005964383,0.00012785206,0.0004022361,0.00047981367,0.00015064726],"domain_scores_gemma":[0.98508215,0.010890375,0.0009459664,0.00077797304,0.0017790209,0.00052440213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059929797,0.0011278898,0.0013852662,0.001114993,0.0005666818,0.0015305505,0.0020281891,0.0018186684,0.0028015797],"category_scores_gemma":[0.038796928,0.00056163693,0.0010949089,0.00065078,0.0030318177,0.0030020415,0.0027448575,0.0026916144,0.0004023402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021771023,0.0001017542,0.0026691833,0.0002440151,0.00009709453,0.00018202518,0.00021978174,0.72633827,0.003662004,0.24487782,0.00069169234,0.020698627],"study_design_scores_gemma":[0.000011119582,0.0000346737,0.0000865622,0.000013988802,0.000004547766,0.000017875269,0.0000075875405,0.9717881,0.00047269676,0.027373685,0.00018018397,0.000008965323],"about_ca_topic_score_codex":0.0029481032,"about_ca_topic_score_gemma":0.001475567,"teacher_disagreement_score":0.0059929797,"about_ca_system_score_codex":0.0015212955,"about_ca_system_score_gemma":0.0016951673,"threshold_uncertainty_score":0.031694293},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.26335867222648546,"score_gpt":0.47108318881866357,"score_spread":0.2077245165921781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008911943","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007133901,0.00010179157,0.99157083,0.00007137059,0.000017200358,0.000029272836,0.00003572137,0.00054304785,0.00049687235],"genre_scores_gemma":[0.37073007,0.00024792936,0.6234143,0.00031665413,0.00008740453,0.00029687386,0.00046943402,0.0003508951,0.004086376],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857044,0.00044154804,0.00008500529,0.00029134544,0.0004907257,0.00012098786],"domain_scores_gemma":[0.9945305,0.002768892,0.00045317676,0.0012270508,0.0008649133,0.00015562524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026697246,0.0010042666,0.0015401336,0.0013743785,0.0007262764,0.0011501422,0.0017356351,0.0011136698,0.0033059306],"category_scores_gemma":[0.012578154,0.00047670328,0.0009066979,0.0015104582,0.0014074402,0.00212485,0.0022233562,0.0012194797,0.0011045249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096182816,0.00017926558,0.0054162624,0.00041481195,0.00024257386,0.0004395288,0.00046044416,0.38311055,0.029713992,0.099022724,0.0072093653,0.47282863],"study_design_scores_gemma":[0.000027908494,0.000056202778,0.00038767362,0.000013065324,0.000015768104,0.00007630839,0.000021373344,0.9718346,0.006206846,0.020223882,0.0011119494,0.000024364099],"about_ca_topic_score_codex":0.0019585402,"about_ca_topic_score_gemma":0.00241895,"teacher_disagreement_score":0.0033059306,"about_ca_system_score_codex":0.000636986,"about_ca_system_score_gemma":0.0014692729,"threshold_uncertainty_score":0.014119029},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07959760419103978,"score_gpt":0.4021193523576084,"score_spread":0.3225217481665686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037218554","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021576412,0.0004912241,0.96994007,0.0009031841,0.000048935497,0.00006773396,0.00049413653,0.0029347248,0.0035435306],"genre_scores_gemma":[0.7298564,0.0009105541,0.25802267,0.0008749522,0.00044170942,0.0004970606,0.002374311,0.0013528971,0.0056694653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929463,0.002320331,0.00025038767,0.0017539718,0.0021382272,0.0005908761],"domain_scores_gemma":[0.943094,0.03330391,0.004735878,0.012493761,0.004877054,0.0014953522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057116533,0.001690186,0.0022759172,0.0023371074,0.0013007363,0.0025823442,0.0043925177,0.0025784222,0.0052499287],"category_scores_gemma":[0.05561022,0.0010812161,0.0011757341,0.0031155623,0.0027530456,0.0059633916,0.003997232,0.0034595975,0.0028240962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047030157,0.0001261815,0.0022532966,0.00039410577,0.00011110423,0.00021551082,0.0002498368,0.78001076,0.0043674856,0.13556764,0.010935086,0.06529866],"study_design_scores_gemma":[0.00003277632,0.000068392685,0.0003210048,0.000016730659,0.000009598919,0.00006197731,0.000029229977,0.9230369,0.0010678818,0.07426909,0.0010711696,0.00001531713],"about_ca_topic_score_codex":0.002202871,"about_ca_topic_score_gemma":0.0029231107,"teacher_disagreement_score":0.0057116533,"about_ca_system_score_codex":0.0022948594,"about_ca_system_score_gemma":0.0027037004,"threshold_uncertainty_score":0.030206501},"labels":[],"label_agreement":null}]}