{"meta":{"query_hash":"bd88de5e8e3e","filters":{"topic":"Machine Learning and Algorithms"},"cohort_total":587,"direct_labels_cover":1,"predictions_cover":587,"exported":587,"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/bd88de5e8e3e","api":"https://metacan.xera.ac/api/v1/cohort?topic=Machine+Learning+and+Algorithms"},"results":[{"id":"W115868610","doi":"10.1007/978-3-319-04921-2_43","title":"Distinguishing Pattern Languages with Membership Examples","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematical proof; Computer science; Dimension (graph theory); Formal language; Relevance (law); Theoretical computer science; Artificial intelligence; Natural language processing; Programming language; Mathematics; Pure mathematics","score_opus":0.014603815730506373,"score_gpt":0.24604043617381732,"score_spread":0.23143662044331095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115868610","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.053985965,0.0007034844,0.893029,0.0015474962,0.00023242335,0.00011649458,0.00036281324,0.0019928408,0.04802956],"genre_scores_gemma":[0.5070909,0.0008782579,0.45321712,0.0007353882,0.00036578305,0.00021402465,0.0018854955,0.0009643973,0.034648556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831283,0.00036695495,0.00016072408,0.00043630856,0.000564133,0.00015900149],"domain_scores_gemma":[0.9954196,0.0030801282,0.00018654433,0.000810161,0.00036197586,0.0001416445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012750687,0.00056883495,0.000696775,0.0014019608,0.0008257952,0.0026749705,0.0015029237,0.0012066087,0.0084536085],"category_scores_gemma":[0.008351662,0.0007290276,0.0011566614,0.0014916387,0.0019698697,0.010221445,0.0040930347,0.0040778844,0.0031279738],"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.00019820163,0.00008240365,0.0012145224,0.00036798703,0.000025655667,0.00023896624,0.0008518423,0.0030384455,0.008136298,0.6416766,0.01005218,0.33411694],"study_design_scores_gemma":[0.000011396304,0.000031467225,0.0002606883,0.000055735276,0.000013476789,0.0004792172,0.00014508022,0.017922377,0.0065949867,0.957922,0.016542884,0.000020524032],"about_ca_topic_score_codex":0.00018465299,"about_ca_topic_score_gemma":0.00023518984,"teacher_disagreement_score":0.0084536085,"about_ca_system_score_codex":0.0005507098,"about_ca_system_score_gemma":0.00053546275,"threshold_uncertainty_score":0.028280139},"labels":[],"label_agreement":null},{"id":"W120286951","doi":"","title":"Optimistic active learning using mutual information","year":2007,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":161,"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":"Computer science; Exploit; Discriminative model; Classifier (UML); Artificial intelligence; Mutual information; Machine learning; Partition (number theory); Labeled data; Data mining; Pattern recognition (psychology); Mathematics","score_opus":0.009377063046125823,"score_gpt":0.2622407538792871,"score_spread":0.25286369083316124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120286951","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.016892092,0.0006048789,0.9776078,0.00058123056,0.000039997994,0.00007560448,0.00007870655,0.00074316846,0.0033765761],"genre_scores_gemma":[0.8028415,0.0004929626,0.19079618,0.00050425885,0.00024692158,0.00036881425,0.000450621,0.00019264416,0.004106163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99480045,0.0025264388,0.00022402225,0.00067772425,0.0014445032,0.00032681518],"domain_scores_gemma":[0.98463434,0.011223084,0.0009898931,0.0016244629,0.0011255159,0.00040273668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077005164,0.0015547806,0.0023655377,0.0015512479,0.001092253,0.003164441,0.0043716184,0.001980122,0.0028694689],"category_scores_gemma":[0.018928284,0.0012787867,0.0009132865,0.0013329211,0.002365954,0.0062234504,0.004891334,0.0030176812,0.00083223445],"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.0010318233,0.0002403795,0.0033303967,0.0002679293,0.00020420675,0.00019257229,0.0006235348,0.71174747,0.003214977,0.10452896,0.0056025586,0.16901524],"study_design_scores_gemma":[0.000025684276,0.000040090526,0.000100072495,0.000010728171,0.000016583981,0.00003053596,0.000017047558,0.9658792,0.0012895938,0.03181699,0.00075931306,0.000014102776],"about_ca_topic_score_codex":0.0019377853,"about_ca_topic_score_gemma":0.0018141632,"teacher_disagreement_score":0.0077005164,"about_ca_system_score_codex":0.0018554307,"about_ca_system_score_gemma":0.0015718171,"threshold_uncertainty_score":0.040724695},"labels":[],"label_agreement":null},{"id":"W133303900","doi":"10.1007/978-3-642-30217-6_20","title":"Active Learning with c-Certainty","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Active learning (machine learning); Artificial intelligence; Noise (video); Quality (philosophy); Certainty; Machine learning; Mathematics; Image (mathematics)","score_opus":0.009740076895240963,"score_gpt":0.23420238277689034,"score_spread":0.2244623058816494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133303900","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.0016643133,0.0011484089,0.98480624,0.0005135182,0.00024003255,0.000032041808,0.000078167424,0.00054876733,0.010968472],"genre_scores_gemma":[0.33355507,0.0026403083,0.6225148,0.00082838576,0.0017126306,0.0003537992,0.00069216033,0.0006683376,0.037034523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803525,0.0005464551,0.00012303959,0.00038482156,0.00081218756,0.00009825489],"domain_scores_gemma":[0.9928203,0.0045998455,0.00022630846,0.0012835022,0.0008856296,0.00018443106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030528218,0.00094272464,0.0011954865,0.001095163,0.0007100005,0.002760447,0.002807992,0.0021146666,0.010803487],"category_scores_gemma":[0.017267618,0.0005436772,0.00076741964,0.0013806847,0.0016798083,0.0043999017,0.0028011147,0.0045470395,0.0031089108],"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.00014737262,0.000070100825,0.00028009273,0.00027601683,0.00006052181,0.0000611211,0.00009210731,0.07764699,0.0013445644,0.48145932,0.015847124,0.42271474],"study_design_scores_gemma":[0.000035603916,0.00005054887,0.000087949695,0.00006145068,0.00001926826,0.00009579043,0.000011772634,0.54926205,0.0026460798,0.42948455,0.018219482,0.000025524008],"about_ca_topic_score_codex":0.0013496681,"about_ca_topic_score_gemma":0.0011795469,"teacher_disagreement_score":0.010803487,"about_ca_system_score_codex":0.0009729193,"about_ca_system_score_gemma":0.0009839878,"threshold_uncertainty_score":0.036141276},"labels":[],"label_agreement":null},{"id":"W133418326","doi":"10.1007/978-3-642-20712-9_3","title":"Learning Read-Constant Polynomials of Constant Degree Modulo Composites","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Constant (computer programming); Modulo; Degree (music); Computer science; Mathematics; Discrete mathematics; Physics; Acoustics; Programming language","score_opus":0.022795506466090375,"score_gpt":0.24358928026509788,"score_spread":0.2207937737990075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133418326","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.19809376,0.0012985334,0.7406521,0.002043327,0.0004154477,0.00008915635,0.0006526199,0.0037563422,0.05299866],"genre_scores_gemma":[0.80537224,0.00076900056,0.15470323,0.00046107944,0.0004664562,0.000062836254,0.0014589365,0.0007487421,0.03595744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936634,0.00009247827,0.000023820752,0.00023891564,0.00017675501,0.00010167703],"domain_scores_gemma":[0.997531,0.0012379836,0.0001712751,0.0005890595,0.0003128334,0.00015792118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060882804,0.00060360495,0.00058319874,0.0006210337,0.0006619579,0.0017521674,0.000949664,0.0006153877,0.014304117],"category_scores_gemma":[0.006748645,0.0003602693,0.0006833536,0.00083025,0.0013169057,0.004553169,0.0017962628,0.0025182983,0.0035447145],"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.00045346105,0.0001396667,0.0036947483,0.00042218994,0.000050249335,0.00022808283,0.00084127975,0.027161673,0.012449695,0.49021092,0.019183524,0.44516444],"study_design_scores_gemma":[0.000048695667,0.00009520338,0.0009209929,0.00007604187,0.000033839537,0.00022830462,0.00028135156,0.08656565,0.008568333,0.884163,0.01898976,0.000028895756],"about_ca_topic_score_codex":0.0006401299,"about_ca_topic_score_gemma":0.0012895904,"teacher_disagreement_score":0.014304117,"about_ca_system_score_codex":0.00078799593,"about_ca_system_score_gemma":0.00065794203,"threshold_uncertainty_score":0.0478521},"labels":[],"label_agreement":null},{"id":"W1480181950","doi":"10.1007/978-3-540-78831-7_12","title":"Cybernetics and Learning Automata","year":2009,"lang":"en","type":"book-chapter","venue":"Springer handbooks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Cybernetics; Automaton; Computer science; Probabilistic automaton; Learning automata; Probabilistic logic; Finite-state machine; Artificial intelligence; Action (physics); Automata theory; Field (mathematics); Theoretical computer science; Stochastic cellular automaton; Machine learning; Algorithm; Mathematics","score_opus":0.010008588687095064,"score_gpt":0.21524688304423836,"score_spread":0.2052382943571433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480181950","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049441135,0.12917484,0.3343024,0.0071827713,0.0058497465,0.00006399278,0.0005836749,0.001212613,0.51668584],"genre_scores_gemma":[0.1515925,0.1275565,0.12742099,0.002488249,0.006463316,0.0004929184,0.0013439442,0.00077550136,0.5818661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998485,0.000035710713,0.000009824933,0.000032348144,0.00006432116,0.000009346281],"domain_scores_gemma":[0.99966395,0.00019786341,0.000017075437,0.00005955385,0.000049755447,0.000011773228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021104437,0.0009040052,0.0009923351,0.0012861014,0.00042236852,0.0019999288,0.0006899896,0.000942268,0.022588022],"category_scores_gemma":[0.000945696,0.00037734967,0.00034908182,0.001658666,0.0013192974,0.00355991,0.0006463271,0.001780765,0.0067015076],"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.00000594472,0.00001786946,0.00009683235,0.00033927016,0.000014243366,0.00005070535,0.0001242559,0.004951869,0.0005125277,0.77623636,0.062512666,0.15513746],"study_design_scores_gemma":[0.0000030707847,0.000008683583,0.00012734879,0.000106515676,0.000007390368,0.00012547371,0.000038164468,0.007590183,0.00034790527,0.7547816,0.23685315,0.000010437487],"about_ca_topic_score_codex":0.0007035593,"about_ca_topic_score_gemma":0.0010694814,"teacher_disagreement_score":0.022588022,"about_ca_system_score_codex":0.00073024444,"about_ca_system_score_gemma":0.00054103066,"threshold_uncertainty_score":0.075564444},"labels":[],"label_agreement":null},{"id":"W1483994939","doi":"10.1007/978-3-540-74958-5_15","title":"Decision Tree Instability and Active Learning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decision tree; Computer science; Stability (learning theory); Tree (set theory); Machine learning; Context (archaeology); Incremental decision tree; Active learning (machine learning); Artificial intelligence; Domain (mathematical analysis); ID3 algorithm; Instability; Decision tree learning; Mathematics","score_opus":0.01589490901043121,"score_gpt":0.27164184557573773,"score_spread":0.2557469365653065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483994939","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.03400282,0.005345859,0.933785,0.0023708718,0.0004978336,0.00005260681,0.000089527064,0.00035739466,0.023498166],"genre_scores_gemma":[0.8460893,0.0033900402,0.113723285,0.0006015704,0.0014088152,0.00015549987,0.00026785157,0.00029069383,0.03407295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892634,0.00034943808,0.00005959129,0.00016644744,0.0004172617,0.00008093563],"domain_scores_gemma":[0.98915046,0.008215084,0.00072259543,0.0007665676,0.0008335866,0.00031181102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023435694,0.00049964816,0.00090934965,0.0011565363,0.00065127254,0.0020646201,0.0014703905,0.0017217671,0.004154178],"category_scores_gemma":[0.020336524,0.00039121686,0.00049882795,0.0013100217,0.0019378563,0.0047358433,0.0015174551,0.003731073,0.00079311436],"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.00010143133,0.00008374597,0.0007938294,0.0001434675,0.000040995805,0.00011970891,0.0001870946,0.08259212,0.002518195,0.78398323,0.0075106025,0.12192555],"study_design_scores_gemma":[0.0000117537265,0.00002494218,0.00016476415,0.000018090615,0.000009249507,0.00008265187,0.000014615298,0.30566186,0.0013456619,0.6895683,0.003087705,0.000010399491],"about_ca_topic_score_codex":0.0004585445,"about_ca_topic_score_gemma":0.00034114622,"teacher_disagreement_score":0.004154178,"about_ca_system_score_codex":0.0007933869,"about_ca_system_score_gemma":0.00040130923,"threshold_uncertainty_score":0.013897121},"labels":[],"label_agreement":null},{"id":"W1485139153","doi":"10.1007/978-3-540-87987-9_28","title":"Active Learning of Group-Structured Environments","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Group (periodic table); Point (geometry); Representation (politics); Artificial intelligence; Abelian group; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.008662601399326899,"score_gpt":0.22151907109138627,"score_spread":0.21285646969205937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485139153","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.018267764,0.00039642095,0.9768282,0.00017852013,0.000042706375,0.000027618153,0.000046418645,0.00023407022,0.0039781746],"genre_scores_gemma":[0.70889837,0.000982523,0.2694029,0.00016968325,0.0002702709,0.00031159443,0.00053328346,0.00022481478,0.019206552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991691,0.00039949073,0.000025837731,0.0001575386,0.00016202142,0.00008599281],"domain_scores_gemma":[0.9930621,0.0054260828,0.00028313044,0.0006204329,0.00029945804,0.00030872645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015891524,0.00062328944,0.0009998131,0.0007784242,0.00062836526,0.0016237019,0.0025902584,0.0013994464,0.0042944304],"category_scores_gemma":[0.008335708,0.0006062661,0.0006356921,0.0009091114,0.0018203208,0.004365523,0.0029284733,0.0023065512,0.00066002965],"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.00023908872,0.00014868636,0.0009493579,0.00020315604,0.00008705,0.00007924458,0.00046186364,0.4262685,0.0018680582,0.43396336,0.0049985773,0.13073304],"study_design_scores_gemma":[0.000021521368,0.000034814064,0.00009059443,0.000013341707,0.0000077221475,0.00001866591,0.000030914434,0.6965654,0.0004721062,0.30135778,0.001380144,0.000007021848],"about_ca_topic_score_codex":0.0008575954,"about_ca_topic_score_gemma":0.001272001,"teacher_disagreement_score":0.0042944304,"about_ca_system_score_codex":0.00052088604,"about_ca_system_score_gemma":0.0004353122,"threshold_uncertainty_score":0.014366269},"labels":[],"label_agreement":null},{"id":"W149581298","doi":"","title":"Robust support vector machine training via convex outlier ablation","year":2006,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":150,"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; University of Waterloo","funders":"","keywords":"Support vector machine; Outlier; Hinge loss; Anomaly detection; Margin (machine learning); Computer science; Pattern recognition (psychology); Margin classifier; Artificial intelligence; Boosting (machine learning); Sensitivity (control systems); Robustness (evolution); Machine learning; Data mining; Engineering","score_opus":0.019884220749863193,"score_gpt":0.225768737818676,"score_spread":0.20588451706881283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W149581298","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.005685358,0.000046697172,0.99334055,0.00008462049,0.000008120728,0.000013226512,0.000013185392,0.0003867293,0.00042150688],"genre_scores_gemma":[0.47848347,0.00016354944,0.51801753,0.00019622115,0.0000725071,0.00024737915,0.00026479654,0.0003095928,0.0022449556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980506,0.00082687446,0.00009103381,0.00026271964,0.000641206,0.00012770532],"domain_scores_gemma":[0.99639183,0.0020197397,0.00043897776,0.00053284573,0.00051646907,0.000100146164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026619378,0.0010735047,0.0015471786,0.0005590634,0.00035145268,0.0009603593,0.0015903292,0.0015545838,0.0014914235],"category_scores_gemma":[0.012390662,0.00058883405,0.00060948764,0.00086382264,0.0010730318,0.0017997074,0.002065034,0.002333468,0.00087833946],"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.00017491203,0.000086660846,0.0005700959,0.00008583766,0.000049316775,0.00011983503,0.00008015025,0.8425806,0.0096127475,0.0239865,0.0021376067,0.12051567],"study_design_scores_gemma":[0.000004810975,0.000017023336,0.000029447423,0.000002300738,0.0000013901456,0.000011913479,0.0000030118922,0.99341583,0.0014383544,0.004861305,0.000211548,0.0000030010685],"about_ca_topic_score_codex":0.0006182398,"about_ca_topic_score_gemma":0.00052675186,"teacher_disagreement_score":0.0026619378,"about_ca_system_score_codex":0.00042634155,"about_ca_system_score_gemma":0.0008412893,"threshold_uncertainty_score":0.014077842},"labels":[],"label_agreement":null},{"id":"W1498435869","doi":"10.1007/11551263_10","title":"On Utilizing Stochastic Learning Weak Estimators for Training and Classification of Patterns with Non-stationary Distributions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Carleton University","funders":"","keywords":"Estimator; Computer science; Multinomial distribution; Convergence (economics); Variance (accounting); Artificial intelligence; Distribution (mathematics); Pattern recognition (psychology); Mathematics; Applied mathematics; Statistics","score_opus":0.021720192421590442,"score_gpt":0.2710095178746387,"score_spread":0.24928932545304822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498435869","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.003934304,0.00018542787,0.9953915,0.0000826414,0.000024446208,0.000022428227,0.000019181572,0.00016993503,0.00017011793],"genre_scores_gemma":[0.12237713,0.0007359903,0.8729065,0.0004081493,0.00026051124,0.00022563501,0.0005180551,0.00020593636,0.0023620925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976554,0.001004884,0.00026230625,0.00037532768,0.00057462166,0.00012731797],"domain_scores_gemma":[0.981753,0.013640138,0.0006647083,0.0017400507,0.0019326034,0.00026946535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008417541,0.0013313789,0.0021698072,0.0016841055,0.0006650422,0.0020813944,0.0027607596,0.002520007,0.0017297576],"category_scores_gemma":[0.028034845,0.00094915874,0.0013275525,0.0020739755,0.0019707454,0.0042395713,0.0038756798,0.0025271033,0.00091985683],"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.00038512613,0.00017968727,0.0038108006,0.00023930956,0.00021009213,0.000109768574,0.00020958942,0.2473475,0.011788799,0.056281753,0.0035835914,0.675854],"study_design_scores_gemma":[0.000013135844,0.0000514244,0.00034211655,0.00001730634,0.00002212527,0.00003987843,0.000015276826,0.9698111,0.0019036577,0.027048726,0.00072307495,0.0000121827925],"about_ca_topic_score_codex":0.0020701687,"about_ca_topic_score_gemma":0.0026305616,"teacher_disagreement_score":0.008417541,"about_ca_system_score_codex":0.0005828831,"about_ca_system_score_gemma":0.0010866636,"threshold_uncertainty_score":0.0445168},"labels":[],"label_agreement":null},{"id":"W1504713652","doi":"10.1007/bfb0038204","title":"Evaluating programs formed by example: An informational heuristic","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Heuristic; Computer science; Artificial intelligence","score_opus":0.03192598122241707,"score_gpt":0.2999805624111859,"score_spread":0.26805458118876885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504713652","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.11605278,0.00037950615,0.84961194,0.0014722435,0.000082360624,0.00040848608,0.0002975564,0.0027810752,0.028914046],"genre_scores_gemma":[0.51797384,0.00019004002,0.47529373,0.00034767418,0.00010482143,0.00019196575,0.00069652713,0.00054347183,0.004657824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930952,0.0033215447,0.00041913104,0.0010012381,0.0016744103,0.00048840285],"domain_scores_gemma":[0.96771103,0.025531206,0.00072431314,0.0038136658,0.0017365329,0.0004832619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005967172,0.0010294149,0.0013674794,0.0024643734,0.0013854022,0.0034535679,0.0031812477,0.0028638723,0.012539156],"category_scores_gemma":[0.047208276,0.0009348084,0.001919368,0.0020243071,0.002590813,0.010923976,0.0041129496,0.0020905132,0.0011046308],"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.0017275977,0.00084669096,0.005702144,0.0006569781,0.00025105532,0.00048487802,0.0011339532,0.086799994,0.005509426,0.28324038,0.014698479,0.5989484],"study_design_scores_gemma":[0.00018989321,0.00034855102,0.0012201237,0.00017054593,0.00036928465,0.00035530693,0.00052118767,0.59842324,0.014142239,0.37665597,0.007538811,0.000064811065],"about_ca_topic_score_codex":0.0018608229,"about_ca_topic_score_gemma":0.0043052933,"teacher_disagreement_score":0.012539156,"about_ca_system_score_codex":0.0017403482,"about_ca_system_score_gemma":0.0024112219,"threshold_uncertainty_score":0.041947603},"labels":[],"label_agreement":null},{"id":"W1505843021","doi":"10.1186/1471-2105-16-s5-s7","title":"Isomorphism and similarity for 2-generation pedigrees","year":2015,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Pedigree chart; Isomorphism (crystallography); Combinatorics; Partition (number theory); Integer (computer science); Mathematics; Computer science; Property (philosophy); Time complexity; Theoretical computer science; Biology; Genetics","score_opus":0.09091666958478403,"score_gpt":0.2843398320754851,"score_spread":0.19342316249070104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505843021","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.24791752,0.00099619,0.7432004,0.0023491073,0.000060454662,0.00013235451,0.0011360656,0.00041592584,0.0037919537],"genre_scores_gemma":[0.74324065,0.0006227567,0.24982238,0.00046656808,0.00022360576,0.00018433435,0.0029750112,0.00013242304,0.00233229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99475163,0.0024332465,0.0002357539,0.0015346163,0.0006822234,0.00036259904],"domain_scores_gemma":[0.960825,0.032344542,0.002155832,0.0031426798,0.0008333581,0.00069844886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005660244,0.00060686964,0.0018217431,0.002253234,0.001191772,0.0021101928,0.0027081512,0.002164947,0.0035931075],"category_scores_gemma":[0.03599507,0.00062050985,0.0014062109,0.0032166494,0.002539376,0.0074874205,0.002693808,0.0024926055,0.00041167458],"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.0006184895,0.00061735255,0.021466099,0.00066970976,0.00032686457,0.001394412,0.0017080286,0.30937555,0.0030688492,0.45099768,0.009294573,0.20046237],"study_design_scores_gemma":[0.000055393826,0.000093963354,0.0022928715,0.000030329988,0.000039219987,0.0005636403,0.00018926944,0.28255987,0.0010069597,0.7103043,0.0028341564,0.000029961198],"about_ca_topic_score_codex":0.0015818661,"about_ca_topic_score_gemma":0.0013683927,"teacher_disagreement_score":0.005660244,"about_ca_system_score_codex":0.0016091105,"about_ca_system_score_gemma":0.0010765223,"threshold_uncertainty_score":0.029934645},"labels":[],"label_agreement":null},{"id":"W1506128430","doi":"","title":"Compact, convex upper bound iteration for approximate POMDP planning","year":2006,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"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; University of Alberta","funders":"","keywords":"Partially observable Markov decision process; Mathematical optimization; Markov decision process; Upper and lower bounds; Bellman equation; Bounded function; Computer science; Piecewise; Heuristic; Linear programming; Convex optimization; Semidefinite programming; Time horizon; Mathematics; Function (biology); Regular polygon; Markov process","score_opus":0.013385925600307741,"score_gpt":0.2710485755621948,"score_spread":0.25766264996188704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506128430","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.0039803884,0.00008418248,0.99409795,0.00007141559,0.000010126334,0.000023488701,0.000022887438,0.0002213408,0.001488245],"genre_scores_gemma":[0.46786135,0.00029277732,0.5277713,0.00011854021,0.000041595224,0.00043953114,0.00024256947,0.00025012056,0.0029821447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982376,0.0006035686,0.000083705876,0.00025244945,0.0006887818,0.00013394425],"domain_scores_gemma":[0.9955525,0.0032438643,0.00030601423,0.00045448297,0.00031223916,0.00013083618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026468567,0.001216844,0.0015967176,0.000613738,0.0005096804,0.0015068909,0.0013577783,0.0011129571,0.0021835517],"category_scores_gemma":[0.0100954035,0.00081159873,0.00089149526,0.000757198,0.0020582117,0.001926214,0.0019212362,0.0027493446,0.0005014074],"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.00006375741,0.00003040685,0.0001578273,0.000050010607,0.000012756944,0.000029634966,0.00006369579,0.9447373,0.0006321865,0.03686451,0.00050403544,0.016853908],"study_design_scores_gemma":[0.0000036068705,0.000009284661,0.000008347438,0.0000037388702,0.0000010670393,0.0000036932995,0.0000031113395,0.9913771,0.00019549398,0.008207978,0.00018474327,0.0000017727609],"about_ca_topic_score_codex":0.0031078337,"about_ca_topic_score_gemma":0.0027959994,"teacher_disagreement_score":0.0031078337,"about_ca_system_score_codex":0.0016549109,"about_ca_system_score_gemma":0.0016951462,"threshold_uncertainty_score":0.013998091},"labels":[],"label_agreement":null},{"id":"W1507093685","doi":"10.1007/978-3-642-02614-0_36","title":"Confidence Measures in Recognizing Handwritten Mathematical Symbols","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Pattern recognition (psychology); Support vector machine; Artificial intelligence; Computer science; Convex hull; Binary number; Binary classification; Value (mathematics); Regular polygon; Machine learning; Mathematics; Arithmetic","score_opus":0.021565232613731167,"score_gpt":0.26016761515751885,"score_spread":0.23860238254378768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507093685","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.09615205,0.0051672277,0.89391136,0.00033654008,0.00016014425,0.00004123684,0.0002841917,0.0007659219,0.003181368],"genre_scores_gemma":[0.8036343,0.0018320769,0.19023521,0.00010783193,0.00036580066,0.00009330849,0.0007587764,0.00019179595,0.0027809588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803823,0.00042132268,0.00022163716,0.0003396238,0.0008558416,0.00012344733],"domain_scores_gemma":[0.97525513,0.020235041,0.0014531388,0.0010747368,0.00172686,0.00025517016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029686226,0.0005938075,0.00089641387,0.0019922801,0.00028465607,0.0022506744,0.0015648544,0.0012194982,0.0022834712],"category_scores_gemma":[0.03287552,0.00042914975,0.0004927518,0.0019041861,0.0010557008,0.004334567,0.0012370569,0.0019395524,0.00057927397],"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.00056528085,0.00012541118,0.0089485515,0.00041563902,0.000108100365,0.00013967778,0.00023496417,0.1156895,0.007525102,0.04702081,0.0037955197,0.8154315],"study_design_scores_gemma":[0.000018467383,0.00012283283,0.0045291353,0.000110979214,0.000039497525,0.00023168005,0.00007000112,0.9221118,0.007650941,0.06353749,0.0015276418,0.000049546477],"about_ca_topic_score_codex":0.0016795787,"about_ca_topic_score_gemma":0.0011286906,"teacher_disagreement_score":0.0029686226,"about_ca_system_score_codex":0.0006082489,"about_ca_system_score_gemma":0.00043465933,"threshold_uncertainty_score":0.015699744},"labels":[],"label_agreement":null},{"id":"W1512936184","doi":"","title":"Hierarchical Label Queries with Data-Dependent Partitions","year":2015,"lang":"en","type":"article","venue":"MPG.PuRe (Max Planck Society)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"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":"Cluster analysis; Computer science; Parametrization (atmospheric modeling); Noise (video); Sample complexity; Sample (material); Underpinning; Artificial intelligence; Hierarchical clustering; Data mining; Machine learning; Engineering","score_opus":0.05144693421518554,"score_gpt":0.2823871369623231,"score_spread":0.23094020274713756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512936184","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.0380183,0.00027654562,0.9575336,0.0009366014,0.00003226774,0.00017226514,0.0004090458,0.0009244674,0.0016968251],"genre_scores_gemma":[0.5422117,0.00023693153,0.4474057,0.00065810676,0.00022736685,0.00062479544,0.0020859472,0.0005148508,0.0060345503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9882587,0.0058337655,0.00049520965,0.002518918,0.0021555712,0.0007378802],"domain_scores_gemma":[0.9539592,0.030876964,0.0022727402,0.009788581,0.002132679,0.00096980325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0127914995,0.0012222339,0.0019620173,0.0015381273,0.0020142137,0.00400559,0.0047987932,0.00440697,0.0047011604],"category_scores_gemma":[0.04823886,0.0009590563,0.0012262593,0.0026904177,0.0036125719,0.0089990385,0.007438787,0.003573508,0.0014555556],"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.0020579358,0.00049622694,0.005155431,0.00043504307,0.0001166406,0.00038063485,0.0026056683,0.3243318,0.01035055,0.48414734,0.01634695,0.15357581],"study_design_scores_gemma":[0.000109343644,0.00007405062,0.00044964268,0.000028919736,0.000021422058,0.0000933115,0.00018924515,0.7709806,0.0032286705,0.22197664,0.0028140147,0.00003424009],"about_ca_topic_score_codex":0.0029654414,"about_ca_topic_score_gemma":0.004031107,"teacher_disagreement_score":0.0127914995,"about_ca_system_score_codex":0.0032992407,"about_ca_system_score_gemma":0.0025182492,"threshold_uncertainty_score":0.06764871},"labels":[],"label_agreement":null},{"id":"W1513731467","doi":"10.1007/978-3-540-24840-8_23","title":"Average Case Self-Duality of Monotone Boolean Functions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Monotone polygon; Duality (order theory); Mathematics; Complete Boolean algebra; Boolean function; Discrete mathematics; Pure mathematics; Two-element Boolean algebra; Algebra over a field","score_opus":0.01148410318037559,"score_gpt":0.24643895343132025,"score_spread":0.23495485025094465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513731467","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.3310338,0.0036716259,0.45443118,0.0026185878,0.00045696666,0.000056909346,0.00038271004,0.0002713769,0.2070768],"genre_scores_gemma":[0.94631034,0.0012466107,0.030822782,0.0003288423,0.00063602644,0.000072287854,0.00021397157,0.00011794025,0.020251164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986512,0.0004708594,0.00006286543,0.00019403105,0.00038635585,0.00023470863],"domain_scores_gemma":[0.9959715,0.0026256808,0.00027586645,0.00030275964,0.00048654634,0.00033762655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022182614,0.0005642876,0.0011414319,0.0016673116,0.0011335128,0.004055374,0.0014691659,0.0013320347,0.006547622],"category_scores_gemma":[0.009037397,0.00062150654,0.0010619188,0.0013997762,0.00223165,0.006203411,0.0014020095,0.0029029248,0.0005989681],"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.000038073526,0.000022311602,0.00011576591,0.000031111773,0.0000057312845,0.000038827493,0.000051086576,0.001955445,0.00036307794,0.99233127,0.0011640603,0.0038833015],"study_design_scores_gemma":[0.00000857975,0.000010950542,0.00008099469,0.000007368327,0.000004289987,0.00012503186,0.00001956555,0.019594371,0.00024316338,0.97905236,0.000847297,0.0000059567446],"about_ca_topic_score_codex":0.00044998646,"about_ca_topic_score_gemma":0.00038717611,"teacher_disagreement_score":0.006547622,"about_ca_system_score_codex":0.0017423367,"about_ca_system_score_gemma":0.00061865913,"threshold_uncertainty_score":0.021903992},"labels":[],"label_agreement":null},{"id":"W1519196800","doi":"10.1016/s0004-3702(02)00209-6","title":"Learning cost-sensitive active classifiers☆☆This extends the short conference paper [19].","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":164,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Classifier (UML); Computer science; Artificial intelligence; Machine learning; Pattern recognition (psychology)","score_opus":0.0815979204633624,"score_gpt":0.30553699911299526,"score_spread":0.22393907864963286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519196800","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.00675571,0.0015560976,0.9839626,0.0015520744,0.00078519096,0.00013549459,0.00015768122,0.00035586784,0.0047392813],"genre_scores_gemma":[0.4956595,0.004454439,0.4391664,0.003345904,0.0054430948,0.0005983348,0.0016675775,0.0008565962,0.04880807],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981059,0.00064438983,0.000112625734,0.0004500662,0.00054774806,0.00013917746],"domain_scores_gemma":[0.9940597,0.0032711478,0.0002400755,0.0010446367,0.0011001982,0.00028428246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030495536,0.0017874116,0.0023676967,0.00123157,0.0008768698,0.0021898346,0.0044448925,0.0026882947,0.009035569],"category_scores_gemma":[0.012703107,0.0008396059,0.0011678131,0.0016534745,0.0014578223,0.0051360405,0.0026305253,0.004336819,0.0026396848],"study_design_candidate":"bench_or_experimental","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.0005279341,0.0004914178,0.001440494,0.0005707774,0.000457907,0.0001554267,0.00023087655,0.16981363,0.005667005,0.11531538,0.027987432,0.6773417],"study_design_scores_gemma":[0.000050359355,0.00019562844,0.00032925978,0.00005638845,0.0001030066,0.00011635723,0.000020738793,0.8976774,0.003764231,0.08457016,0.013069014,0.000047396115],"about_ca_topic_score_codex":0.0028301682,"about_ca_topic_score_gemma":0.0030475075,"teacher_disagreement_score":0.009035569,"about_ca_system_score_codex":0.0010869193,"about_ca_system_score_gemma":0.0012564032,"threshold_uncertainty_score":0.030226946},"labels":[],"label_agreement":null},{"id":"W1521450751","doi":"","title":"Teaching Dimensions based on Cooperative Learning.","year":2008,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":17,"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":"Computer science; Monomial; Exploit; Coding (social sciences); Dimension (graph theory); Class (philosophy); Monotonic function; Theoretical computer science; Sample complexity; Artificial intelligence; Mathematics; Discrete mathematics","score_opus":0.013728372755027769,"score_gpt":0.2518058443209487,"score_spread":0.23807747156592093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521450751","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.039423697,0.00045980111,0.95105535,0.0007060524,0.00003421791,0.00020758934,0.00012866009,0.00034707395,0.007637535],"genre_scores_gemma":[0.6405477,0.00026550516,0.3539836,0.00025444172,0.00006125195,0.00074489077,0.00020145069,0.000087227105,0.0038539239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99384356,0.0031837795,0.00029130338,0.0011045074,0.001214782,0.00036207304],"domain_scores_gemma":[0.9738139,0.017447427,0.0016542104,0.0044436594,0.0013443955,0.0012963983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006229142,0.00063968013,0.0011420241,0.0008751479,0.0010959505,0.0020557842,0.0022990403,0.0013867345,0.0039213854],"category_scores_gemma":[0.027827224,0.0005532923,0.001072808,0.000781766,0.0034431953,0.00450981,0.0054012537,0.0022950058,0.00053907436],"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.00040328898,0.00033298152,0.0046235085,0.00042259047,0.00015786309,0.0001227177,0.0014485565,0.11527452,0.008329418,0.7078278,0.003227805,0.15782894],"study_design_scores_gemma":[0.00008865547,0.0002906147,0.0013926894,0.00005602105,0.000069806876,0.00016419277,0.00022510922,0.5371538,0.0043434124,0.44982344,0.006350554,0.00004170498],"about_ca_topic_score_codex":0.0011050185,"about_ca_topic_score_gemma":0.0016518978,"teacher_disagreement_score":0.006229142,"about_ca_system_score_codex":0.0023995645,"about_ca_system_score_gemma":0.001594744,"threshold_uncertainty_score":0.03294325},"labels":[],"label_agreement":null},{"id":"W1526144783","doi":"10.1007/11564096_59","title":"Active Learning in Partially Observable Markov Decision Processes","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":73,"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":"Partially observable Markov decision process; Markov decision process; Observable; Computer science; Process (computing); Markov process; Mathematical optimization; Decision problem; Artificial intelligence; Decision process; Markov chain; Markov model; Machine learning; Mathematics; Algorithm; Engineering; Management science; Statistics","score_opus":0.013629442293768801,"score_gpt":0.2560121948938667,"score_spread":0.24238275260009787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526144783","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.012406171,0.0022906056,0.97947454,0.00059848005,0.00008777907,0.000037796475,0.000060673916,0.00022315077,0.0048207077],"genre_scores_gemma":[0.7597335,0.0037597888,0.22717743,0.00024481124,0.00038796445,0.00034529643,0.00026910548,0.000109429144,0.00797262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986945,0.00068103115,0.000054123633,0.00021828408,0.00024303209,0.00010904971],"domain_scores_gemma":[0.99268687,0.006604554,0.00025735347,0.00014270443,0.00017661754,0.00013197663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025938891,0.0009912386,0.0013505599,0.0006403939,0.0006429615,0.0017721824,0.0015465682,0.001736069,0.002260913],"category_scores_gemma":[0.007850461,0.00089997967,0.00086298556,0.0010832234,0.0021856169,0.002603168,0.0017043639,0.0027397652,0.0003081673],"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.00011321729,0.00007334983,0.0005651047,0.00020241647,0.00006461769,0.00012780084,0.0001935875,0.7504304,0.00054686284,0.20791933,0.0012986592,0.038464703],"study_design_scores_gemma":[0.000022107055,0.00001889343,0.000046080157,0.000014388641,0.0000076007213,0.000010498072,0.000010542497,0.88200754,0.00017657458,0.11691499,0.0007650074,0.0000057547845],"about_ca_topic_score_codex":0.003932287,"about_ca_topic_score_gemma":0.0030797045,"teacher_disagreement_score":0.003932287,"about_ca_system_score_codex":0.0015278471,"about_ca_system_score_gemma":0.0011717555,"threshold_uncertainty_score":0.013717949},"labels":[],"label_agreement":null},{"id":"W1528086278","doi":"","title":"Modelling Sparse Dynamical Systems with Compressed Predictive State Representations","year":2013,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":37,"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":"Observability; Computer science; Artificial intelligence; Exploit; Dynamical systems theory; Domain (mathematical analysis); Compressed sensing; Sparse approximation; Feature selection; Machine learning; Mathematics","score_opus":0.013465345670646781,"score_gpt":0.23251051927190586,"score_spread":0.21904517360125908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528086278","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.022863744,0.00019980797,0.97519445,0.0002363219,0.00002096944,0.00003509323,0.00014502414,0.00034067858,0.0009639562],"genre_scores_gemma":[0.7776803,0.0004930559,0.21862043,0.00014700407,0.000097068376,0.00020301872,0.0008390187,0.00008131292,0.0018388458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959344,0.0001593949,0.000022264327,0.00007331322,0.000115934825,0.000035642137],"domain_scores_gemma":[0.9973828,0.0019310287,0.00025869397,0.00025078838,0.00013937351,0.000037284255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007902883,0.00069724926,0.00072914123,0.0004540488,0.0002555448,0.0008271293,0.0010109816,0.00092630275,0.0013573329],"category_scores_gemma":[0.0062056575,0.00043933108,0.0005090054,0.0006903529,0.00087648357,0.0017980874,0.0011184418,0.0017388469,0.00027948926],"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.00005432882,0.000021772714,0.00041212453,0.0000509588,0.00001532099,0.00006667949,0.00006132664,0.9497027,0.0011134949,0.018803282,0.0006156934,0.0290823],"study_design_scores_gemma":[0.0000027897804,0.0000067963174,0.000037428366,0.0000030248257,0.0000016301473,0.000009287268,0.000002960606,0.99260724,0.00021849635,0.006995515,0.00011237547,0.0000024641429],"about_ca_topic_score_codex":0.0036882244,"about_ca_topic_score_gemma":0.0032476627,"teacher_disagreement_score":0.0036882244,"about_ca_system_score_codex":0.0005308904,"about_ca_system_score_gemma":0.00058276445,"threshold_uncertainty_score":0.007333517},"labels":[],"label_agreement":null},{"id":"W1530688466","doi":"","title":"Learning with the Set Covering Machine","year":2001,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":23,"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":"Generalization; Computer science; Set (abstract data type); Artificial intelligence; Support vector machine; Function (biology); Machine learning; Generalization error; Boolean function; Online machine learning; Training set; Algorithm; Data set; Computational learning theory; Compression (physics); Theoretical computer science; Active learning (machine learning); Artificial neural network; Mathematics","score_opus":0.007440832810229832,"score_gpt":0.22368328769929505,"score_spread":0.2162424548890652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530688466","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.007983022,0.0007950803,0.987862,0.00038767804,0.00010340704,0.000038271995,0.00010753779,0.00052465446,0.0021983155],"genre_scores_gemma":[0.38884917,0.0020697073,0.6010732,0.000703103,0.0007717295,0.00036159455,0.001060427,0.00015564563,0.0049555157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748105,0.0010958376,0.00008769674,0.00043375784,0.00074877305,0.00015283661],"domain_scores_gemma":[0.9972874,0.0014620639,0.00020212069,0.0006724919,0.0002713779,0.00010456345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020054937,0.00090845587,0.0017946083,0.0012446009,0.0005972343,0.0018049912,0.0017246996,0.0017837504,0.0029507899],"category_scores_gemma":[0.008994707,0.00052320684,0.0011787073,0.0018987871,0.0016810946,0.0044505256,0.0030072453,0.00181605,0.001277197],"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.00020931092,0.00010011062,0.0017096443,0.00030012874,0.00020118988,0.00020695072,0.00023574478,0.24211515,0.00307507,0.23699516,0.015649056,0.49920246],"study_design_scores_gemma":[0.000018604584,0.00008160607,0.00022094912,0.000023740611,0.000020225345,0.00013727511,0.000014595332,0.7921165,0.0014790668,0.19810325,0.007764385,0.000019796338],"about_ca_topic_score_codex":0.0005531729,"about_ca_topic_score_gemma":0.0003226127,"teacher_disagreement_score":0.0029507899,"about_ca_system_score_codex":0.0007110145,"about_ca_system_score_gemma":0.0005469525,"threshold_uncertainty_score":0.01060617},"labels":[],"label_agreement":null},{"id":"W1533076956","doi":"10.1007/3-540-45486-1_25","title":"Neural ARX Models and PAC Learning","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Stability (learning theory); Artificial neural network; Artificial intelligence; Sigmoid function; Machine learning","score_opus":0.014195892399732549,"score_gpt":0.23774396600253747,"score_spread":0.22354807360280493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533076956","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.010975801,0.006316794,0.9267438,0.0021865927,0.0005342331,0.000023058927,0.00020952716,0.0009273886,0.052082732],"genre_scores_gemma":[0.5517899,0.010391241,0.22268449,0.0011382353,0.0018188376,0.00019501417,0.0010723745,0.0007467606,0.21016319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965596,0.00013026783,0.000014114214,0.00006394868,0.00010286839,0.000032967975],"domain_scores_gemma":[0.9990402,0.0005795014,0.00007501133,0.00015791928,0.00011498485,0.00003246131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095227204,0.00064721226,0.0010149045,0.0004531367,0.00043468646,0.0020279614,0.0016677649,0.0015347726,0.011037181],"category_scores_gemma":[0.004096002,0.0004539088,0.0005177971,0.0009169421,0.001039517,0.004013864,0.0009663132,0.002912152,0.002807227],"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.00004070488,0.000025757832,0.00025824626,0.00007963034,0.000032289205,0.000054461514,0.00004672475,0.14257807,0.00042437628,0.7615343,0.011154367,0.08377104],"study_design_scores_gemma":[0.000007259195,0.00001624395,0.0001046898,0.000016358974,0.000009731114,0.00006899205,0.000012976,0.5055444,0.00033504184,0.48564252,0.0082298545,0.000011778759],"about_ca_topic_score_codex":0.0015362288,"about_ca_topic_score_gemma":0.0011902382,"teacher_disagreement_score":0.011037181,"about_ca_system_score_codex":0.00062972016,"about_ca_system_score_gemma":0.00043712376,"threshold_uncertainty_score":0.03692299},"labels":[],"label_agreement":null},{"id":"W1537261216","doi":"10.1109/ccece.2015.7129498","title":"Learning to reason in a Probably Approximately Correct manner","year":2015,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Acadia University","funders":"","keywords":"Truth table; Computer science; Knowledge base; Boolean function; Context (archaeology); Artificial intelligence; Task (project management); Table (database); Machine learning; Data mining; Algorithm","score_opus":0.021057838046768782,"score_gpt":0.26150463488655173,"score_spread":0.24044679683978296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537261216","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.03207124,0.00015066678,0.9642344,0.0010101652,0.000025787996,0.000058237147,0.0001472677,0.0009603188,0.0013419271],"genre_scores_gemma":[0.46056923,0.00027156665,0.53535426,0.0006757495,0.000082896244,0.000114027025,0.000916937,0.00014279774,0.0018725486],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967579,0.0011221451,0.00024655287,0.0009689229,0.0007230019,0.00018143455],"domain_scores_gemma":[0.9893406,0.006848825,0.00068942714,0.0020800142,0.00090161385,0.00013946854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037868908,0.00089162996,0.0009400858,0.00086009956,0.00056239567,0.002150767,0.0022104597,0.001593287,0.0021806154],"category_scores_gemma":[0.023616413,0.00078618346,0.001213903,0.00057788764,0.0019026552,0.006792161,0.0019761776,0.0025479272,0.0008202349],"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.000643814,0.00052860496,0.008571612,0.0008112932,0.0005046616,0.0008514098,0.0017229911,0.41159627,0.020019794,0.11145493,0.008606425,0.43468827],"study_design_scores_gemma":[0.000070491,0.00012166912,0.0006977937,0.00005216889,0.00007623624,0.00031018778,0.00019207325,0.8238248,0.009908394,0.16105331,0.0036562246,0.00003661694],"about_ca_topic_score_codex":0.0025030416,"about_ca_topic_score_gemma":0.0041725165,"teacher_disagreement_score":0.0037868908,"about_ca_system_score_codex":0.0009519377,"about_ca_system_score_gemma":0.0016620497,"threshold_uncertainty_score":0.02002722},"labels":[],"label_agreement":null},{"id":"W1540462025","doi":"10.21427/d79p5s","title":"Inside the Selection Box: Visualising active learning selection strategies","year":2010,"lang":"en","type":"article","venue":"Arrow - TU Dublin (Technological University Dublin)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science Foundation Ireland; Canada Millennium Scholarship Foundation","keywords":"Selection (genetic algorithm); Computer science; Active learning (machine learning); Machine learning; Artificial intelligence; Key (lock)","score_opus":0.00891897734960887,"score_gpt":0.23154303290995315,"score_spread":0.22262405556034429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540462025","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.021465791,0.00071626913,0.94491076,0.0020094148,0.00038916967,0.00023565421,0.0009483597,0.011883434,0.017441139],"genre_scores_gemma":[0.25979608,0.0011824085,0.7178114,0.00078127946,0.00015304926,0.00071428355,0.0011882891,0.0048724357,0.013500755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990251,0.0004758047,0.000070581984,0.00009771509,0.00026017675,0.00007058158],"domain_scores_gemma":[0.98901933,0.009214071,0.00024482358,0.0006135805,0.0006353441,0.0002727027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031063298,0.0012354285,0.00071241177,0.0018060233,0.00065874826,0.003322998,0.0011533167,0.0016310448,0.017123187],"category_scores_gemma":[0.013481118,0.00048574834,0.0007687521,0.0010620898,0.0010382229,0.004062448,0.00254453,0.0019479358,0.0029989502],"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.0023252247,0.0004197442,0.0050609987,0.002509721,0.0001661108,0.0018428139,0.026453698,0.09445444,0.057575487,0.18233839,0.1054937,0.5213597],"study_design_scores_gemma":[0.0005096174,0.00042264521,0.004261557,0.0014165154,0.00010294284,0.0008779694,0.0039941776,0.38418946,0.040146336,0.18182462,0.38190365,0.00035055532],"about_ca_topic_score_codex":0.0015879702,"about_ca_topic_score_gemma":0.0015108256,"teacher_disagreement_score":0.017123187,"about_ca_system_score_codex":0.00042662473,"about_ca_system_score_gemma":0.00079117407,"threshold_uncertainty_score":0.057282805},"labels":[],"label_agreement":null},{"id":"W1541017766","doi":"10.1007/978-3-642-15880-3_30","title":"Asking Generalized Queries to Ambiguous Oracle","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Oracle; Computer science; Probabilistic logic; Set (abstract data type); Construct (python library); Theoretical computer science; Artificial intelligence; Machine learning","score_opus":0.011156877252388862,"score_gpt":0.25354382179337587,"score_spread":0.242386944540987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541017766","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.16667476,0.0020872273,0.75365615,0.013604631,0.00079680514,0.00034019913,0.0018192998,0.007104481,0.053916447],"genre_scores_gemma":[0.8379189,0.0011363961,0.13185716,0.0031142167,0.0010561092,0.00023856474,0.003006441,0.0013747948,0.020297395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923396,0.0032041832,0.00047662054,0.0013714143,0.0016373375,0.00097085716],"domain_scores_gemma":[0.9805259,0.014751764,0.00041543518,0.002994527,0.0008404492,0.0004719459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003861912,0.0012998229,0.0028414582,0.0007641733,0.0019483615,0.00523132,0.0028859426,0.0044643665,0.011584852],"category_scores_gemma":[0.023333555,0.0010415011,0.0019530281,0.0018968054,0.0038537888,0.014225174,0.0075566475,0.006318878,0.0023654103],"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.0017180492,0.00028831707,0.0046693045,0.001369359,0.00031607985,0.0030259516,0.0048520635,0.040068325,0.015451531,0.67981803,0.073592894,0.17482999],"study_design_scores_gemma":[0.000086461754,0.000053793567,0.0005890647,0.00006501776,0.00008557196,0.00068434235,0.0008634685,0.07041291,0.0037940675,0.90986454,0.013445969,0.00005478538],"about_ca_topic_score_codex":0.0017239001,"about_ca_topic_score_gemma":0.0016316964,"teacher_disagreement_score":0.011584852,"about_ca_system_score_codex":0.0019469629,"about_ca_system_score_gemma":0.0012511499,"threshold_uncertainty_score":0.03875518},"labels":[],"label_agreement":null},{"id":"W1542499968","doi":"10.1007/978-3-642-13529-3_22","title":"Improving Co-training with Agreement-Based Sampling","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Co-training; Sampling (signal processing); Training (meteorology); Artificial intelligence; Machine learning; Training set; Process (computing); Data sampling; Pattern recognition (psychology); Data mining; Semi-supervised learning; Computer vision","score_opus":0.020738141482419998,"score_gpt":0.2622375231549632,"score_spread":0.24149938167254317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542499968","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.017442493,0.000528128,0.97520185,0.00035375994,0.00024298255,0.0001747021,0.00014770296,0.0040285503,0.0018797665],"genre_scores_gemma":[0.39536688,0.00025567482,0.5893586,0.0011364046,0.0006000084,0.000684702,0.002217742,0.0019222888,0.008457724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98415816,0.008791352,0.00084362854,0.002315328,0.0027056138,0.0011857899],"domain_scores_gemma":[0.921352,0.053834774,0.001400997,0.014826217,0.0067834356,0.0018025668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012625508,0.0024781558,0.0050594006,0.0020874913,0.0021239785,0.0023361193,0.0084919175,0.0058221146,0.011324858],"category_scores_gemma":[0.057769135,0.0019312403,0.0022913206,0.0030539043,0.0023260345,0.0070098103,0.0079588285,0.00719041,0.006334736],"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.0031960977,0.0012422826,0.007344182,0.00036582354,0.0005630931,0.0002772966,0.0004207147,0.28469706,0.007356769,0.019669624,0.024873333,0.6499937],"study_design_scores_gemma":[0.00009573432,0.000116226955,0.00022025523,0.000016025368,0.000043960354,0.000073605064,0.000034051565,0.98753977,0.0020212708,0.009065786,0.00075966486,0.000013764519],"about_ca_topic_score_codex":0.0057862317,"about_ca_topic_score_gemma":0.010148833,"teacher_disagreement_score":0.012625508,"about_ca_system_score_codex":0.0012438216,"about_ca_system_score_gemma":0.0032459185,"threshold_uncertainty_score":0.06677085},"labels":[],"label_agreement":null},{"id":"W1547503210","doi":"10.21427/1hkq-vf87","title":"Back to the Future:Knowledge Light Case Base Cookery","year":2021,"lang":"en","type":"article","venue":"Arrow@dit (Dublin Institute of Technology)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science Foundation Ireland; Canada Millennium Scholarship Foundation","keywords":"Recipe; WordNet; Computer science; Adaptation (eye); Domain (mathematical analysis); Similarity (geometry); Artificial intelligence; Ingredient; Representation (politics); Knowledge base; Case-based reasoning; Natural language processing; Information retrieval; Mathematics; Food science","score_opus":0.010630674019755124,"score_gpt":0.24966887463715362,"score_spread":0.2390382006173985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547503210","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.10366513,0.004631186,0.64249325,0.026861817,0.0011114475,0.0015386203,0.008086627,0.0067633577,0.2048486],"genre_scores_gemma":[0.43222442,0.0020631521,0.532887,0.0017561067,0.00015241315,0.00039380605,0.005087486,0.00044193995,0.024993747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965557,0.0017024684,0.00018846286,0.0003561321,0.0009925445,0.0002047445],"domain_scores_gemma":[0.99083763,0.006522154,0.00028442775,0.0014635943,0.00059448543,0.00029768402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004386781,0.0005417606,0.00042416347,0.00252662,0.0013673863,0.0062590498,0.002662913,0.0029108925,0.02323448],"category_scores_gemma":[0.016460206,0.00048432828,0.00084509683,0.0021685616,0.0017540584,0.0057296925,0.0031019964,0.0020796985,0.0034448497],"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.0010179988,0.0009888038,0.004760847,0.00070353743,0.00011115331,0.0101017635,0.0024251076,0.06256968,0.0023677568,0.26992118,0.098596014,0.5464362],"study_design_scores_gemma":[0.00039058685,0.00016321524,0.0014834786,0.0009917208,0.00010401201,0.0040556975,0.0021221535,0.26110655,0.009003039,0.29482105,0.4256085,0.00014998906],"about_ca_topic_score_codex":0.007842157,"about_ca_topic_score_gemma":0.011805281,"teacher_disagreement_score":0.02323448,"about_ca_system_score_codex":0.0024685853,"about_ca_system_score_gemma":0.0016178123,"threshold_uncertainty_score":0.07772708},"labels":[],"label_agreement":null},{"id":"W1547922676","doi":"10.1109/lics.2015.70","title":"A Canonical Form for Weighted Automata and Applications to Approximate Minimization","year":2015,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hankel matrix; Quantum finite automata; Singular value decomposition; Automaton; Series (stratigraphy); Finite-state machine; Algorithm; Canonical form; Discrete mathematics; Automata theory; Computer science; Theoretical computer science; Pure mathematics","score_opus":0.023585902564041247,"score_gpt":0.29241351285767603,"score_spread":0.2688276102936348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547922676","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.004023366,0.00024273444,0.99309194,0.00018833083,0.000071999544,0.000025894686,0.000041950494,0.00011971138,0.0021941438],"genre_scores_gemma":[0.20217997,0.0013489729,0.7862651,0.0003167243,0.0003506109,0.00043921976,0.00043781663,0.00053946435,0.008122056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801,0.0006556362,0.00015698772,0.00051340554,0.0005262692,0.00013775306],"domain_scores_gemma":[0.9970392,0.0015694776,0.00021209134,0.00040482378,0.0006618361,0.000112683934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021237836,0.0011419719,0.0010526753,0.0014274925,0.0008397183,0.0020411382,0.0017312223,0.0013790092,0.0057344995],"category_scores_gemma":[0.011787371,0.0007143636,0.0017329613,0.001749438,0.0024670358,0.004145212,0.002355819,0.0029519321,0.0015913593],"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.000027139185,0.000032263393,0.00040678802,0.000112841546,0.000029815437,0.000059225116,0.00020598232,0.08894027,0.0018402204,0.859775,0.0013961094,0.047174394],"study_design_scores_gemma":[0.0000061829255,0.000033946926,0.00005813816,0.0000323072,0.0000099484005,0.000043286724,0.0000421697,0.384538,0.0010787802,0.60998106,0.0041605895,0.00001573286],"about_ca_topic_score_codex":0.0018032892,"about_ca_topic_score_gemma":0.0019945665,"teacher_disagreement_score":0.0057344995,"about_ca_system_score_codex":0.0011742042,"about_ca_system_score_gemma":0.001036766,"threshold_uncertainty_score":0.019183815},"labels":[],"label_agreement":null},{"id":"W1549466950","doi":"10.1609/aaai.v24i1.7754","title":"Simultaneous Elicitation of Preference Features and Utility","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":23,"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":"Regret; Preference elicitation; Computer science; Heuristic; Set (abstract data type); Preference; Expected utility hypothesis; Focus (optics); Minimax; Feature (linguistics); Machine learning; Artificial intelligence; Utility theory; Mathematical optimization; Mathematics; Mathematical economics","score_opus":0.043598398824235475,"score_gpt":0.29006350051815694,"score_spread":0.24646510169392147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549466950","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.035610978,0.00029099206,0.9553388,0.0010393284,0.00003061969,0.0005133042,0.00020336793,0.00021312531,0.006759442],"genre_scores_gemma":[0.6288834,0.0002917886,0.36741543,0.00035626796,0.0000714713,0.0011198837,0.00027705787,0.000059377937,0.0015254258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9633097,0.026353972,0.0017735733,0.0024622488,0.0051602484,0.00094033644],"domain_scores_gemma":[0.93189484,0.05369841,0.0030411007,0.007173925,0.0033323423,0.00085933955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020746222,0.0015377839,0.0019617418,0.0011642628,0.00076732895,0.0031562515,0.002123437,0.002089143,0.0047524297],"category_scores_gemma":[0.07563871,0.00081232213,0.0012536693,0.0020435406,0.001862477,0.006510392,0.004600914,0.0036582383,0.00057391217],"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.0017680561,0.00082951563,0.0040904223,0.0015425398,0.00041597447,0.00039836043,0.0033753032,0.10199647,0.016404968,0.4750785,0.00592104,0.38817888],"study_design_scores_gemma":[0.0003196148,0.00070673693,0.0022085644,0.00018736222,0.00015725354,0.00026838144,0.0008413079,0.37350202,0.012188823,0.6006153,0.008824668,0.00017992227],"about_ca_topic_score_codex":0.00070120784,"about_ca_topic_score_gemma":0.0010649464,"teacher_disagreement_score":0.020746222,"about_ca_system_score_codex":0.0020202834,"about_ca_system_score_gemma":0.0017776019,"threshold_uncertainty_score":0.10971779},"labels":[],"label_agreement":null},{"id":"W1555335063","doi":"10.1007/978-3-540-30463-0_42","title":"New Bounds and Approximations for the Error of Linear Classifiers","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Classifier (UML); Curse of dimensionality; Computation; Approximation error; Mathematics; Algorithm; Word error rate; Mean squared prediction error; Bayes error rate; Applied mathematics; Approximations of π; Computer science; Artificial intelligence; Statistics; Support vector machine; Bayes classifier","score_opus":0.021532263334467967,"score_gpt":0.27153473300027414,"score_spread":0.2500024696658062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555335063","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.0023514535,0.010492063,0.97790456,0.0010195868,0.000784706,0.00005518072,0.00022661797,0.0005324276,0.0066333795],"genre_scores_gemma":[0.106012456,0.01429271,0.8386069,0.0025759602,0.0061399788,0.0011379807,0.0019349618,0.002547341,0.02675178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9723292,0.009653956,0.0017756722,0.0040454734,0.010463187,0.0017325765],"domain_scores_gemma":[0.8117834,0.1577305,0.0045599104,0.012028036,0.011750302,0.002147907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.032973677,0.007291659,0.005891881,0.0084899785,0.002031284,0.008905709,0.01285862,0.008908003,0.011824671],"category_scores_gemma":[0.20824358,0.0038404525,0.0045546587,0.007702773,0.008942319,0.022149853,0.01218664,0.023520445,0.005630887],"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.00062260986,0.000278549,0.0019875779,0.0014261567,0.0004883189,0.00027732036,0.0007101598,0.22974096,0.0030340515,0.51903147,0.02873614,0.21366666],"study_design_scores_gemma":[0.000030371582,0.00007944764,0.00057957554,0.0003873592,0.00015848658,0.00022756151,0.000072527095,0.6479847,0.0015328662,0.34063712,0.008224765,0.00008527886],"about_ca_topic_score_codex":0.0041920003,"about_ca_topic_score_gemma":0.004461818,"teacher_disagreement_score":0.032973677,"about_ca_system_score_codex":0.008177287,"about_ca_system_score_gemma":0.0027102395,"threshold_uncertainty_score":0.17438358},"labels":[],"label_agreement":null},{"id":"W1557692463","doi":"10.1007/3-540-45435-7_20","title":"On the Proper Learning of Axis Parallel Concepts","year":2002,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Learnability; Equivalence (formal languages); Mathematics; Oracle; Time complexity; Polynomial; Combinatorics; Concept class; Discrete mathematics; Constant (computer programming); Disjunctive normal form; Binary decision diagram; Computer science; Algorithm; Artificial intelligence","score_opus":0.01622434892193078,"score_gpt":0.2566282629044358,"score_spread":0.24040391398250502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557692463","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.035626166,0.0011446303,0.9520815,0.001509132,0.00023251204,0.00006864834,0.00016204348,0.00039279554,0.008782661],"genre_scores_gemma":[0.55858046,0.0023487916,0.42187968,0.0010885667,0.0008028678,0.0002885364,0.0013086142,0.00040625088,0.013296302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973145,0.00108395,0.0001953319,0.00068537774,0.0005416704,0.00017908789],"domain_scores_gemma":[0.9829705,0.011367742,0.0008579521,0.002368702,0.001805119,0.0006300109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053139897,0.00087342714,0.0016203722,0.0015683948,0.0013887256,0.0025248611,0.002537308,0.001637602,0.008808477],"category_scores_gemma":[0.03648674,0.00081216655,0.001201857,0.0020098083,0.005021724,0.011842067,0.0063620033,0.0042231353,0.0011822234],"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.00034165572,0.00007401948,0.001696107,0.00022704115,0.00005369888,0.000068275906,0.00041608853,0.028968543,0.0007407425,0.83153737,0.0070284544,0.1288479],"study_design_scores_gemma":[0.000025347248,0.0000344737,0.00021330737,0.00003208504,0.000009374423,0.000025395617,0.000057002166,0.11301865,0.0003195247,0.8840297,0.002226747,0.000008429738],"about_ca_topic_score_codex":0.002371304,"about_ca_topic_score_gemma":0.0015159566,"teacher_disagreement_score":0.008808477,"about_ca_system_score_codex":0.0012493999,"about_ca_system_score_gemma":0.0014713114,"threshold_uncertainty_score":0.029467225},"labels":[],"label_agreement":null},{"id":"W1562227633","doi":"10.4230/lipics.cp.2021.43","title":"Bayesian Optimization With Censored Response Data","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":22,"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 British Columbia","funders":"","keywords":"Computer science; Function (biology); Bayesian probability; Algorithm; Minification; Parametric statistics; Mathematical optimization; Value (mathematics); Bayesian optimization; Mathematics; Artificial intelligence; Machine learning; Statistics","score_opus":0.05255227598145423,"score_gpt":0.19291010099323916,"score_spread":0.14035782501178493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562227633","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.009388717,0.00070536754,0.9873497,0.00077940105,0.000044794877,0.000060272116,0.00014856031,0.00047415512,0.0010490918],"genre_scores_gemma":[0.4600807,0.0013634161,0.5281545,0.0012233267,0.00035569357,0.0006740458,0.001155321,0.00075209694,0.006240918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98975813,0.0068691517,0.00030257576,0.001776472,0.00082266785,0.00047108374],"domain_scores_gemma":[0.9596172,0.03374708,0.0019212393,0.0029876162,0.0011259323,0.0006008974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013053174,0.0023612294,0.0046371887,0.0013318635,0.0008505308,0.0031518242,0.0037552353,0.0043962398,0.0034462283],"category_scores_gemma":[0.048938192,0.0019324356,0.001957018,0.0017284976,0.0030855192,0.004468851,0.0028925212,0.0061339657,0.0012369816],"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.00038134682,0.00013221618,0.0011439527,0.00025468328,0.00018553625,0.00011027161,0.00010966104,0.9081153,0.00060845556,0.054628707,0.0028054242,0.03152443],"study_design_scores_gemma":[0.000042738495,0.000039574774,0.00015624239,0.000030829742,0.000018309514,0.00002057236,0.00001156122,0.93044084,0.00039706466,0.06817566,0.00064818066,0.000018377654],"about_ca_topic_score_codex":0.004173876,"about_ca_topic_score_gemma":0.002961035,"teacher_disagreement_score":0.013053174,"about_ca_system_score_codex":0.002328068,"about_ca_system_score_gemma":0.0024913882,"threshold_uncertainty_score":0.06903261},"labels":[],"label_agreement":null},{"id":"W1562418542","doi":"10.1007/11564096_20","title":"Learning and Classifying Under Hard Budgets","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Classifier (UML); Purchasing; Feature (linguistics); Artificial intelligence; Machine learning; Variety (cybernetics)","score_opus":0.01588892784920567,"score_gpt":0.2573441023372715,"score_spread":0.24145517448806583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562418542","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.15656196,0.0026997873,0.80215746,0.008726089,0.00049320346,0.00013829613,0.0013873173,0.0009095009,0.026926436],"genre_scores_gemma":[0.75831944,0.0033801207,0.18147126,0.0011788349,0.002307347,0.00046368325,0.00334631,0.0005586478,0.04897433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816054,0.000646745,0.000115654424,0.00046123753,0.00035606223,0.00025981158],"domain_scores_gemma":[0.9882641,0.008604867,0.00084376574,0.0013113432,0.0005156882,0.0004603252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030022513,0.00093225704,0.0017710009,0.0013955714,0.0007181512,0.0035553426,0.0019900629,0.0018746913,0.008150267],"category_scores_gemma":[0.022042532,0.00061983184,0.000745573,0.0021311184,0.0019215286,0.010241751,0.002302049,0.0030427433,0.0012832577],"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.0005828316,0.000184175,0.006089951,0.00040142902,0.00010568447,0.00015457558,0.00034901078,0.10479706,0.0015241954,0.47401488,0.037623793,0.37417242],"study_design_scores_gemma":[0.000024488309,0.000038248207,0.0006230632,0.000044960852,0.000016255239,0.000059619313,0.00008081785,0.2541636,0.00074768974,0.74071467,0.0034754856,0.000011166321],"about_ca_topic_score_codex":0.0012916907,"about_ca_topic_score_gemma":0.0009909633,"teacher_disagreement_score":0.008150267,"about_ca_system_score_codex":0.0012790309,"about_ca_system_score_gemma":0.00096441485,"threshold_uncertainty_score":0.02726543},"labels":[],"label_agreement":null},{"id":"W1576063399","doi":"10.1007/11750321_22","title":"Alternative Measures of Computational Complexity with Applications to Agnostic Learning","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computational complexity theory; Bounded function; Task (project management); Hierarchy; Structural complexity theory; Measure (data warehouse); Time complexity; Asymptotic computational complexity; Theoretical computer science; Polynomial hierarchy; Perspective (graphical); Set (abstract data type); Quantum complexity theory; Worst-case complexity; Computational resource; Probably approximately correct learning; Descriptive complexity theory; Artificial intelligence; Computational learning theory; Complexity class; Algorithm; Mathematics; Data mining; Active learning (machine learning)","score_opus":0.028155274433189915,"score_gpt":0.27320665951605355,"score_spread":0.24505138508286364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576063399","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.0242592,0.0023696553,0.9586481,0.002471803,0.0003190977,0.00009542605,0.00029980054,0.00025278114,0.011284214],"genre_scores_gemma":[0.5609161,0.0033818001,0.42091134,0.0011475624,0.0024973813,0.00082158035,0.0007975551,0.0003472378,0.009179388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99010974,0.004700926,0.0006306175,0.0013178147,0.0027870864,0.0004538606],"domain_scores_gemma":[0.871739,0.0987377,0.0069695823,0.013160955,0.0067514023,0.0026414162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012702055,0.0022003592,0.0022152406,0.007578496,0.0012538657,0.0070549245,0.0052801166,0.0048817373,0.006550768],"category_scores_gemma":[0.08675927,0.0009957606,0.0021196886,0.008511138,0.008360517,0.022862272,0.0066372985,0.008175636,0.00068817934],"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.00004769135,0.00006094241,0.0008149332,0.000078387384,0.00003995866,0.000020143281,0.00007695214,0.01240517,0.00018088853,0.96600115,0.001385288,0.018888503],"study_design_scores_gemma":[0.0000104769,0.000034588535,0.0005665496,0.000032288368,0.00002139176,0.00005094071,0.000044078493,0.09499764,0.00015798082,0.9028852,0.0011643961,0.000034606546],"about_ca_topic_score_codex":0.00066861283,"about_ca_topic_score_gemma":0.00076525216,"teacher_disagreement_score":0.012702055,"about_ca_system_score_codex":0.0038427534,"about_ca_system_score_gemma":0.0014939159,"threshold_uncertainty_score":0.067175746},"labels":[],"label_agreement":null},{"id":"W1576444319","doi":"10.3233/ida-2012-0549","title":"Improving multi-view semi-supervised learning with agreement-based sampling","year":2012,"lang":"en","type":"article","venue":"Intelligent Data Analysis","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Machine learning; Semi-supervised learning; Computer science; Co-training; Artificial intelligence; Supervised learning; Sampling (signal processing); Set (abstract data type); Relation (database); Independence (probability theory); Unsupervised learning; Quality (philosophy); Instance-based learning; Data mining; Mathematics; Artificial neural network; Statistics","score_opus":0.07268107837048085,"score_gpt":0.32335071251491004,"score_spread":0.2506696341444292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576444319","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.0058002206,0.00023199187,0.9924523,0.00010429097,0.000045444573,0.00006722162,0.00005713175,0.00091709517,0.0003243399],"genre_scores_gemma":[0.34360525,0.00034895015,0.6494132,0.00061596505,0.0004251166,0.0005046791,0.0024015652,0.0006810443,0.0020042583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9840853,0.008666559,0.0009338726,0.002411938,0.0033329942,0.000569362],"domain_scores_gemma":[0.93903804,0.039487023,0.0023580801,0.009452324,0.008447405,0.001217224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016162856,0.0024317629,0.0060334164,0.0022968822,0.0016779278,0.00294609,0.006437096,0.0038320906,0.0030796006],"category_scores_gemma":[0.056331854,0.0015305519,0.0028180478,0.0026225045,0.0021804431,0.0063607516,0.005766747,0.004867542,0.002256926],"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.0012798246,0.00068324426,0.0054894984,0.00048875576,0.00082517706,0.00026628553,0.00066631765,0.53643787,0.00493687,0.021120267,0.011615456,0.41619042],"study_design_scores_gemma":[0.000031436026,0.00005267296,0.00013505408,0.000009251284,0.000019269237,0.000030374407,0.00001808331,0.99292386,0.00063112564,0.0058465907,0.0002910649,0.000011208882],"about_ca_topic_score_codex":0.004297629,"about_ca_topic_score_gemma":0.004268992,"teacher_disagreement_score":0.016162856,"about_ca_system_score_codex":0.0011189241,"about_ca_system_score_gemma":0.0027541271,"threshold_uncertainty_score":0.085478365},"labels":[],"label_agreement":null},{"id":"W1581046800","doi":"10.1609/socs.v2i1.18198","title":"Improved Prediction of IDA*'s Performance via Epsilon-Truncation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Alberta Innovates; University of Regina","keywords":"Discretization; Truncation (statistics); Discretization error; Computer science; Line (geometry); Truncation error; Mean squared prediction error; Algorithm; Mathematics; Applied mathematics; Artificial intelligence; Machine learning; Econometrics; Statistics; Mathematical analysis","score_opus":0.009396174356073185,"score_gpt":0.23573789032832695,"score_spread":0.22634171597225378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581046800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63278604,0.0018921735,0.33985823,0.0033421088,0.00053281337,0.0001254845,0.0015143704,0.005792713,0.014156103],"genre_scores_gemma":[0.9510117,0.000191882,0.046281226,0.00024247209,0.00005096139,0.000066936904,0.00068486313,0.00015691377,0.0013129304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867404,0.00036641167,0.00007093474,0.0003096175,0.0002911107,0.00028790554],"domain_scores_gemma":[0.98116195,0.01346148,0.0007487374,0.0025085304,0.0014080649,0.0007113337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041699274,0.001087445,0.0012351366,0.0008368878,0.00080401736,0.001241053,0.0021866413,0.0014658602,0.00270238],"category_scores_gemma":[0.021221219,0.0005415548,0.00055500865,0.0006117139,0.0009242429,0.0025426005,0.0014716674,0.0036904362,0.0010295832],"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.000599042,0.00013881033,0.008727341,0.00009369493,0.000041040945,0.00006555885,0.00012797884,0.93243545,0.0018042189,0.0067339954,0.0068833507,0.042349506],"study_design_scores_gemma":[0.0000117016025,0.00002918528,0.00031483328,0.0000084257845,0.0000035492812,0.00001027001,0.000011891557,0.99531305,0.0009339503,0.0031599258,0.00019569875,0.000007424986],"about_ca_topic_score_codex":0.008211786,"about_ca_topic_score_gemma":0.008216257,"teacher_disagreement_score":0.008211786,"about_ca_system_score_codex":0.0018875954,"about_ca_system_score_gemma":0.0027311137,"threshold_uncertainty_score":0.022052944},"labels":[],"label_agreement":null},{"id":"W1589292348","doi":"","title":"Representing systems with hidden state","year":2006,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"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":"Automaton; Computer science; Duality (order theory); State (computer science); Representation (politics); Theoretical computer science; Automata theory; Learning automata; Work (physics); Artificial intelligence; Algorithm; Mathematical optimization; Mathematics; Discrete mathematics","score_opus":0.004409397221767384,"score_gpt":0.20152241247876362,"score_spread":0.19711301525699623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589292348","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.01480999,0.0002565621,0.98085576,0.00060391164,0.00006737677,0.000024158655,0.00015578295,0.0003077272,0.0029187906],"genre_scores_gemma":[0.75106525,0.0007924168,0.23986742,0.00032537838,0.00022860288,0.00024827625,0.0006272497,0.00013655788,0.0067088604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988111,0.00043400147,0.000076285396,0.00025762583,0.0002664184,0.00015449525],"domain_scores_gemma":[0.9961384,0.0027751492,0.00036526984,0.00041356523,0.00020223853,0.00010537654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017798897,0.0007813117,0.00091636565,0.0008139066,0.00066171546,0.0025183668,0.0016004728,0.001732468,0.00501095],"category_scores_gemma":[0.0077202283,0.0005355939,0.001224533,0.001112103,0.0022834754,0.005132231,0.0025342156,0.0026050431,0.0006602977],"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.00006552705,0.000028926079,0.00039687977,0.00007705805,0.00003304943,0.00010873344,0.00019097641,0.39735624,0.0007406958,0.5871736,0.0006973958,0.013130992],"study_design_scores_gemma":[0.000009934052,0.00001320432,0.000031157648,0.000010477872,0.00000779529,0.000011267217,0.000016740016,0.7190066,0.0004014532,0.27950415,0.0009791701,0.000008163086],"about_ca_topic_score_codex":0.0022294417,"about_ca_topic_score_gemma":0.002278787,"teacher_disagreement_score":0.00501095,"about_ca_system_score_codex":0.001203228,"about_ca_system_score_gemma":0.00097194,"threshold_uncertainty_score":0.01676333},"labels":[],"label_agreement":null},{"id":"W158976495","doi":"","title":"Unsupervised and semi-supervised multi-class support vector machines","year":2005,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":152,"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":"Support vector machine; Machine learning; Artificial intelligence; Computer science; Generalization; Semidefinite programming; Unsupervised learning; Class (philosophy); Semi-supervised learning; Classifier (UML); Supervised learning; Structured support vector machine; Margin classifier; Pattern recognition (psychology); Artificial neural network; Mathematical optimization; Mathematics","score_opus":0.013434633042601476,"score_gpt":0.2518975854423464,"score_spread":0.23846295239974494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158976495","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.0029041315,0.00012389063,0.99510694,0.00012028729,0.000031659172,0.000037968333,0.00006487088,0.00024781117,0.001362537],"genre_scores_gemma":[0.1570479,0.00034781088,0.83565664,0.0002751051,0.0002684472,0.00037153394,0.0009166944,0.00024278031,0.0048730397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712914,0.0010341288,0.00017223126,0.00064052857,0.0008847027,0.00013927348],"domain_scores_gemma":[0.9932956,0.0027200468,0.0008766483,0.0014577325,0.0014277349,0.00022220443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002831575,0.00106852,0.001151416,0.0009396014,0.0005159552,0.0015760605,0.0023979032,0.0012565606,0.0033477466],"category_scores_gemma":[0.009819808,0.0005459314,0.001049706,0.0010506726,0.0012383402,0.0029249834,0.0019401495,0.0026097468,0.0017879887],"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.0002259132,0.00038568757,0.0019855588,0.0003954934,0.00016578127,0.00018322158,0.0002869972,0.28442815,0.009589868,0.10858417,0.012387954,0.58138126],"study_design_scores_gemma":[0.000010049503,0.000050495393,0.0002514425,0.00001886756,0.000008775285,0.00010234571,0.00001595279,0.9597104,0.0033638948,0.0329909,0.0034598154,0.000017108236],"about_ca_topic_score_codex":0.00033518553,"about_ca_topic_score_gemma":0.00076001993,"teacher_disagreement_score":0.0033477466,"about_ca_system_score_codex":0.00040072663,"about_ca_system_score_gemma":0.0006823182,"threshold_uncertainty_score":0.014975011},"labels":[],"label_agreement":null},{"id":"W1594239811","doi":"10.1007/3-540-40992-0_16","title":"Self-duality of Bounded Monotone Boolean Functions and Related Problems","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bounded function; Monotone polygon; Duality (order theory); Mathematics; Boolean function; Combinatorics; Discrete mathematics; Constant (computer programming); Polynomial; Time complexity; Domain (mathematical analysis); Computer science; Mathematical analysis","score_opus":0.009432030036658372,"score_gpt":0.2288723471613917,"score_spread":0.21944031712473333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594239811","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.22046779,0.014697414,0.5272895,0.0074409954,0.0008895201,0.000088710185,0.0004045506,0.00021612256,0.22850542],"genre_scores_gemma":[0.89074653,0.0063937954,0.05991661,0.0012124979,0.0016517602,0.00018079646,0.0004139486,0.0001395027,0.03934463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989066,0.00044364858,0.000049472186,0.00017156168,0.00028579967,0.00014292187],"domain_scores_gemma":[0.99656725,0.0024795777,0.00021963495,0.00018939315,0.00033213297,0.00021188502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001887846,0.00058517174,0.0012300877,0.0015741519,0.0013818337,0.0034402937,0.0013908804,0.001524393,0.0051083853],"category_scores_gemma":[0.0061763166,0.00062222604,0.0011883157,0.0020371547,0.0032510213,0.0065407488,0.0018449454,0.003567706,0.00046942444],"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.000019395515,0.000020177455,0.00005160106,0.000035104225,0.000003825743,0.000016323722,0.000053021176,0.0007499494,0.00014578439,0.99437296,0.0009442146,0.0035876401],"study_design_scores_gemma":[0.000008483322,0.0000068360055,0.00004167275,0.000008197012,0.0000030572594,0.000041867384,0.000025475936,0.0049241497,0.00011488891,0.99360025,0.0012217549,0.000003454583],"about_ca_topic_score_codex":0.00056804914,"about_ca_topic_score_gemma":0.00037964,"teacher_disagreement_score":0.0051083853,"about_ca_system_score_codex":0.0020621342,"about_ca_system_score_gemma":0.00073778565,"threshold_uncertainty_score":0.017089248},"labels":[],"label_agreement":null},{"id":"W1596584299","doi":"10.21427/9w8z-hc83","title":"Sweetening the Dataset : Using Active Learning to Label Unlabelled Datasets","year":2021,"lang":"en","type":"article","venue":"Arrow@dit (Dublin Institute of Technology)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science Foundation Ireland; Canada Millennium Scholarship Foundation","keywords":"Computer science; Machine learning; Artificial intelligence; Active learning (machine learning); Set (abstract data type); Focus (optics); Supervised learning; Expert system; Training set; Artificial neural network","score_opus":0.02440303009430266,"score_gpt":0.2971462182489404,"score_spread":0.2727431881546377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596584299","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.031563926,0.0010787927,0.93521655,0.0019490895,0.0009360993,0.0009817537,0.0067494866,0.012190526,0.009333689],"genre_scores_gemma":[0.08491795,0.0003784854,0.8877905,0.0012966488,0.00029406967,0.0010688818,0.020169435,0.0008615865,0.0032224073],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9872602,0.0057632797,0.00078812597,0.0026023975,0.003131372,0.0004545642],"domain_scores_gemma":[0.96432894,0.016898064,0.0021550723,0.011628532,0.00395519,0.0010341284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014668898,0.0022008135,0.0017448773,0.0061311177,0.0021121607,0.006237699,0.0069438647,0.0057718484,0.0028245596],"category_scores_gemma":[0.03396606,0.0011976293,0.002073054,0.004672386,0.0022079695,0.0073034554,0.0065672724,0.0066317264,0.0033062007],"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.0011466068,0.0015385002,0.00772241,0.00095320115,0.00035998368,0.00045460652,0.0010288149,0.06186679,0.0134978825,0.021752207,0.09439973,0.79527926],"study_design_scores_gemma":[0.00029945007,0.00045695688,0.0031231253,0.0003066208,0.00013771256,0.00042534265,0.0005500471,0.79294574,0.029902346,0.07529261,0.09634205,0.00021798676],"about_ca_topic_score_codex":0.0024149215,"about_ca_topic_score_gemma":0.0074612186,"teacher_disagreement_score":0.014668898,"about_ca_system_score_codex":0.0018090964,"about_ca_system_score_gemma":0.0014851856,"threshold_uncertainty_score":0.07757747},"labels":[],"label_agreement":null},{"id":"W1599956645","doi":"10.21427/d7q89w","title":"Off to a Good Start: Using Clustering to Select the Initial Training Set in Active Learning","year":2010,"lang":"en","type":"article","venue":"Arrow - TU Dublin (Technological University Dublin)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science Foundation Ireland; Canada Millennium Scholarship Foundation","keywords":"Cluster analysis; Computer science; Artificial intelligence; Set (abstract data type); Selection (genetic algorithm); Task (project management); Machine learning; Process (computing); Nondeterministic algorithm; Sample (material); Data mining; Algorithm; Engineering","score_opus":0.038365751123520524,"score_gpt":0.27322552306462233,"score_spread":0.2348597719411018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599956645","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.027886555,0.0003113543,0.96966153,0.0003145792,0.000034060326,0.000079690086,0.000024197716,0.0005221413,0.0011659358],"genre_scores_gemma":[0.52138084,0.0001947376,0.47593716,0.00032792083,0.000040941522,0.00022982096,0.00014707909,0.00020487518,0.0015366307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957098,0.0022069905,0.00024118209,0.0007306656,0.00090473867,0.00020662989],"domain_scores_gemma":[0.98297644,0.010680715,0.0010756362,0.0031056253,0.0018976686,0.00026400608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008088598,0.0007712873,0.001065801,0.0011294311,0.001319078,0.002148249,0.0023625721,0.002511701,0.0011671754],"category_scores_gemma":[0.021529818,0.0008559296,0.00065548794,0.001377747,0.0024340358,0.003658242,0.0022915406,0.0022792816,0.00088433956],"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.0008523669,0.00036310958,0.004847033,0.00027180885,0.0001570461,0.00017770521,0.0010060559,0.5362195,0.01889899,0.041448668,0.0027441839,0.39301363],"study_design_scores_gemma":[0.000050608338,0.00015199112,0.00058501115,0.000040281087,0.00002057757,0.00007790432,0.00010441226,0.950217,0.015303137,0.031603947,0.001797413,0.000047772242],"about_ca_topic_score_codex":0.0020398449,"about_ca_topic_score_gemma":0.003430243,"teacher_disagreement_score":0.008088598,"about_ca_system_score_codex":0.0012513483,"about_ca_system_score_gemma":0.0010320541,"threshold_uncertainty_score":0.04277712},"labels":[],"label_agreement":null},{"id":"W160007757","doi":"","title":"Learning in the Limit with Adversarial Disturbances.","year":2008,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"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":"Disturbance (geology); Generalization; Limit (mathematics); Computer science; Noise (video); Decision maker; Artificial intelligence; Position (finance); Data point; Process (computing); Binary number; Mathematical optimization; Mathematics","score_opus":0.009667311698577555,"score_gpt":0.20466691857732316,"score_spread":0.19499960687874562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160007757","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.041322883,0.0017399663,0.94869804,0.0021490073,0.00014124466,0.00008434088,0.00021133949,0.00024376814,0.0054094833],"genre_scores_gemma":[0.9292234,0.0017063515,0.05837354,0.0008122545,0.000301789,0.0003413136,0.0003372048,0.00014347935,0.008760691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944351,0.0030156283,0.00019667365,0.00085985934,0.00092426443,0.000568402],"domain_scores_gemma":[0.9304202,0.05700257,0.005479076,0.0029851927,0.002425563,0.0016873272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010073811,0.0021847954,0.0019262936,0.0012347609,0.0007440623,0.003193685,0.0026718953,0.0035623296,0.0021919913],"category_scores_gemma":[0.072959624,0.0009078325,0.0011105859,0.0012586778,0.0056725433,0.0064323037,0.003908683,0.0037891814,0.0005239225],"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.00023773531,0.00008553812,0.0018751506,0.00015477659,0.00014405743,0.00039541058,0.00014455381,0.84141594,0.0009924441,0.14463788,0.0014719164,0.0084445765],"study_design_scores_gemma":[0.000017035383,0.00004131953,0.00018975542,0.000019284042,0.000014285475,0.0000519853,0.000019600728,0.9357918,0.00026166477,0.06327223,0.0003097381,0.000011301841],"about_ca_topic_score_codex":0.0031314625,"about_ca_topic_score_gemma":0.0015696782,"teacher_disagreement_score":0.010073811,"about_ca_system_score_codex":0.0027211872,"about_ca_system_score_gemma":0.0010653305,"threshold_uncertainty_score":0.053276062},"labels":[],"label_agreement":null},{"id":"W1603208670","doi":"10.1007/978-3-642-15883-4_11","title":"Learning with Randomized Majority Votes","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Margin (machine learning); AdaBoost; Computer science; Empirical evidence; Majority rule; Weighted Majority Algorithm; Empirical research; Randomized experiment; Randomized controlled trial; Mathematics; Artificial intelligence; Machine learning; Algorithm; Statistics; Generalization error; Stability (learning theory); Medicine; Support vector machine","score_opus":0.005866368125662548,"score_gpt":0.2232179220996483,"score_spread":0.21735155397398576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603208670","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.005188914,0.0012473748,0.9783716,0.0011807935,0.00044590252,0.00012658119,0.00032079624,0.0015871678,0.011530782],"genre_scores_gemma":[0.32744586,0.0012676087,0.60933954,0.0017197604,0.0015952579,0.00097566756,0.0025096305,0.0009957468,0.054150958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942386,0.0029532432,0.0002957609,0.0011728038,0.00096629333,0.0003732599],"domain_scores_gemma":[0.99301237,0.0041652704,0.00022406704,0.0019314212,0.0005033241,0.00016352872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005241163,0.0016026977,0.0029376992,0.0012751526,0.0015402128,0.0031679554,0.0045149205,0.0032151085,0.016408127],"category_scores_gemma":[0.017300226,0.0013571151,0.0018793598,0.0018209361,0.0021570658,0.007436185,0.0059064305,0.0037583034,0.007543314],"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.00077733747,0.00021302469,0.0007944506,0.00047150778,0.00026398903,0.00008548412,0.00018426064,0.11917103,0.0015590497,0.25482452,0.0505123,0.571143],"study_design_scores_gemma":[0.00012732108,0.00007781274,0.00013231144,0.00006675574,0.0000489235,0.00007139559,0.000032301352,0.5610761,0.001841818,0.42732173,0.009175086,0.00002839043],"about_ca_topic_score_codex":0.0009920672,"about_ca_topic_score_gemma":0.0016306171,"teacher_disagreement_score":0.016408127,"about_ca_system_score_codex":0.0010946316,"about_ca_system_score_gemma":0.0015495103,"threshold_uncertainty_score":0.054890633},"labels":[],"label_agreement":null},{"id":"W1606549853","doi":"10.1109/icsmc.2005.1571740","title":"A Multi-Neighborhood and Multi-Operator Strategy for the Uncapacitated Exam Proximity Problem","year":2006,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Operator (biology); Computer science; Diversification (marketing strategy); Local search (optimization); Mathematical optimization; Process (computing); Artificial intelligence; Mathematics","score_opus":0.026896320957142703,"score_gpt":0.263869040352259,"score_spread":0.2369727193951163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606549853","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.018439254,0.00011214732,0.97871333,0.00013916845,0.000028928553,0.00009260704,0.00002889701,0.00013139163,0.0023141762],"genre_scores_gemma":[0.3892193,0.00012122599,0.60470027,0.0001411291,0.00004825736,0.00042047407,0.00012276205,0.000116290634,0.005110239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993765,0.00027562023,0.000029633267,0.00009615895,0.00017482552,0.000047285725],"domain_scores_gemma":[0.99894553,0.0005949825,0.00008942813,0.00011578391,0.00013370796,0.00012052822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013891773,0.0007078619,0.0010856905,0.0008390561,0.00060577627,0.00078596093,0.0016953633,0.0014704654,0.003166048],"category_scores_gemma":[0.0044085705,0.00028262328,0.0006721965,0.00079513947,0.00070708216,0.0013011056,0.0017758522,0.0011384896,0.00038320522],"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.00017296348,0.00028718996,0.0011660532,0.00021016125,0.000066709756,0.00041091838,0.00021769528,0.6895417,0.0070100604,0.099339426,0.0055843126,0.19599281],"study_design_scores_gemma":[0.000024659856,0.00014188046,0.00012946792,0.000010018833,0.000008489988,0.00009836362,0.000022660512,0.9827194,0.0008143339,0.014876231,0.0011429379,0.000011590437],"about_ca_topic_score_codex":0.0010482441,"about_ca_topic_score_gemma":0.0013601397,"teacher_disagreement_score":0.003166048,"about_ca_system_score_codex":0.000505452,"about_ca_system_score_gemma":0.0009364666,"threshold_uncertainty_score":0.010591507},"labels":[],"label_agreement":null},{"id":"W1606763436","doi":"10.1007/978-3-642-15567-3_28","title":"A Continuous Max-Flow Approach to Potts Model","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Potts model; Computer science; Simplex; Perimeter; Regular polygon; Computation; Flow (mathematics); Mathematical optimization; Algorithm; Mathematics; Combinatorics; Geometry; Statistical physics","score_opus":0.01228348521606565,"score_gpt":0.23347144439569484,"score_spread":0.2211879591796292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606763436","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.004873342,0.0005505878,0.979619,0.00071014266,0.00020370234,0.0000382098,0.00017666737,0.00017549527,0.013652832],"genre_scores_gemma":[0.5567391,0.0027047608,0.36266375,0.00070712465,0.0010129093,0.00041719043,0.00086193864,0.00063863833,0.07425462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995888,0.00017160928,0.000017824854,0.00007962084,0.00010171246,0.000040335988],"domain_scores_gemma":[0.99929786,0.0004014971,0.000046107725,0.00007356795,0.000103395796,0.00007755746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011938136,0.0009363172,0.0013873932,0.0008296718,0.0007600268,0.0019247265,0.0027579556,0.0019550824,0.010923085],"category_scores_gemma":[0.0038570522,0.00064129353,0.001418518,0.0011353635,0.0012896612,0.0035830732,0.0019827054,0.0033059462,0.0014464236],"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.000035925917,0.000041720043,0.00010617013,0.00007954717,0.00002679746,0.000072946415,0.000061751445,0.2693559,0.0005130354,0.7061956,0.005210604,0.018299952],"study_design_scores_gemma":[0.0000066358725,0.00001163524,0.000023754592,0.000007633517,0.000006670923,0.000013242407,0.0000071868067,0.72389317,0.00010466295,0.27399346,0.0019238075,0.000008131946],"about_ca_topic_score_codex":0.0036261894,"about_ca_topic_score_gemma":0.002357954,"teacher_disagreement_score":0.010923085,"about_ca_system_score_codex":0.0014920514,"about_ca_system_score_gemma":0.0011978123,"threshold_uncertainty_score":0.036541343},"labels":[],"label_agreement":null},{"id":"W1629495025","doi":"10.48550/arxiv.1206.4647","title":"Active Learning for Matching Problems","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"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":"Matching (statistics); Computer science; Active learning (machine learning); Probabilistic logic; Selection (genetic algorithm); Machine learning; Preference; Preference learning; Artificial intelligence; Mathematics","score_opus":0.04868786213904355,"score_gpt":0.19046620298302697,"score_spread":0.1417783408439834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1629495025","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.002321075,0.00043990678,0.995618,0.00034012416,0.000028592745,0.000054202294,0.00003797827,0.00011110075,0.0010490282],"genre_scores_gemma":[0.41976744,0.0019708301,0.5674298,0.00089448475,0.0006615667,0.001233104,0.0007436537,0.00025290326,0.0070463107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99312544,0.0040656286,0.00035456946,0.0011394423,0.0010229798,0.00029189407],"domain_scores_gemma":[0.9700753,0.025672799,0.0010547508,0.0015740694,0.0011646758,0.00045840783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008923188,0.0016002442,0.0026653556,0.0020526492,0.0010907935,0.0029293855,0.0035258182,0.0035113152,0.0036517668],"category_scores_gemma":[0.034574896,0.00096517225,0.001501752,0.0028355387,0.0030618238,0.006421147,0.0034813643,0.0059367567,0.00088560523],"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.00018301164,0.0002743089,0.0012773951,0.0005175851,0.00021348524,0.000109045024,0.00027934354,0.54975545,0.0016680037,0.26638743,0.005022198,0.17431277],"study_design_scores_gemma":[0.000020839869,0.000030476873,0.00006272909,0.000016025882,0.000009145695,0.000021745369,0.000013867155,0.8550053,0.0003518016,0.1435278,0.000931019,0.000009161636],"about_ca_topic_score_codex":0.0014293268,"about_ca_topic_score_gemma":0.0012486379,"teacher_disagreement_score":0.008923188,"about_ca_system_score_codex":0.0018538233,"about_ca_system_score_gemma":0.001268217,"threshold_uncertainty_score":0.047190905},"labels":[],"label_agreement":null},{"id":"W1658325260","doi":"10.1109/cmpsac.1993.404242","title":"Using computational learning theory to analyze the testing complexity of program segments","year":2002,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"McGill University","funders":"","keywords":"Correctness; Dimension (graph theory); Class (philosophy); Computer science; Construct (python library); VC dimension; Theoretical computer science; Program analysis; Measure (data warehouse); Code (set theory); Programming language; Concept class; Artificial intelligence; Algorithm; Mathematics; Set (abstract data type); Data mining; Combinatorics","score_opus":0.12044457434717476,"score_gpt":0.3380968159551505,"score_spread":0.21765224160797575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1658325260","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.21924265,0.0009947406,0.77113515,0.0023230975,0.000056502726,0.00022195528,0.0006200657,0.00076828396,0.00463764],"genre_scores_gemma":[0.7612033,0.000605225,0.23347014,0.0004902472,0.00022170883,0.00053071236,0.0016758237,0.00025876204,0.0015441215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99208105,0.0030991444,0.00048710674,0.0012345345,0.0022218316,0.0008763127],"domain_scores_gemma":[0.81816924,0.1644705,0.0059004715,0.0069602896,0.003176096,0.0013234521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008036783,0.0016220772,0.0017647982,0.004268816,0.0011394183,0.0033675567,0.002840475,0.0020381352,0.00303226],"category_scores_gemma":[0.07720729,0.0009079276,0.0023910291,0.003407101,0.0050956537,0.009214331,0.0027227132,0.004357437,0.00027770246],"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.00029408914,0.00036224435,0.014975528,0.00033252063,0.00023485883,0.00011611584,0.00024290591,0.81869,0.0020052893,0.10360704,0.0016042542,0.057535198],"study_design_scores_gemma":[0.000017862194,0.000055060635,0.0009769942,0.000016618558,0.000020345178,0.000029933066,0.000026593583,0.9128275,0.00090478256,0.084846675,0.00026347316,0.000014135441],"about_ca_topic_score_codex":0.0053803176,"about_ca_topic_score_gemma":0.0047156983,"teacher_disagreement_score":0.008036783,"about_ca_system_score_codex":0.0056859963,"about_ca_system_score_gemma":0.0037965812,"threshold_uncertainty_score":0.04250306},"labels":[],"label_agreement":null},{"id":"W167277932","doi":"","title":"Dual search in permutation state spaces","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":21,"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":"Dual (grammatical number); Duality (order theory); State (computer science); Permutation (music); Computer science; Symmetry (geometry); Search algorithm; Theoretical computer science; Mathematics; Algorithm; Combinatorics; Physics","score_opus":0.07908508805931216,"score_gpt":0.35123582287096733,"score_spread":0.2721507348116552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167277932","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.07672142,0.00033068305,0.9152165,0.0004581094,0.0000613005,0.00010407012,0.000117826276,0.0003891426,0.006600983],"genre_scores_gemma":[0.7558869,0.0002708267,0.23874977,0.00023324555,0.000042069187,0.00031013868,0.00026298585,0.00012344579,0.0041205874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786526,0.0010914075,0.0001266173,0.00031326074,0.00036597165,0.00023750801],"domain_scores_gemma":[0.993634,0.0044313828,0.0005197538,0.0007798184,0.00040186677,0.0002330809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027472838,0.0005384317,0.0012561124,0.0012298983,0.00095854513,0.0022359393,0.0011346678,0.0011657337,0.0048399977],"category_scores_gemma":[0.013228609,0.00049201254,0.0010296651,0.0010985935,0.002411184,0.004003034,0.0027625167,0.0020307677,0.0006666728],"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.00048077985,0.00018657625,0.0017927589,0.0001617869,0.0000637415,0.00017025151,0.00022022675,0.2969679,0.0039491793,0.60473466,0.002154932,0.08911719],"study_design_scores_gemma":[0.00005886414,0.000103651335,0.0001139769,0.000014648671,0.000014335013,0.00005869927,0.000032108797,0.69116986,0.0019257371,0.30503374,0.0014526782,0.000021803196],"about_ca_topic_score_codex":0.0011703282,"about_ca_topic_score_gemma":0.001022603,"teacher_disagreement_score":0.0048399977,"about_ca_system_score_codex":0.0012142134,"about_ca_system_score_gemma":0.0014922376,"threshold_uncertainty_score":0.016191363},"labels":[],"label_agreement":null},{"id":"W167710240","doi":"","title":"The alpha-reliable shortest path problem.","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Alpha (finance); Path (computing); Shortest path problem; Mathematics; Combinatorics; Computer science; Statistics; Graph; Computer network","score_opus":0.04682918372997396,"score_gpt":0.343110913445022,"score_spread":0.296281729715048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167710240","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.09476851,0.0069080708,0.8331184,0.007775564,0.0011565229,0.0002882838,0.00468348,0.00091119984,0.050389938],"genre_scores_gemma":[0.73029566,0.005776505,0.23191398,0.0005438937,0.001259053,0.00044940764,0.003995752,0.0003929497,0.025372798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980907,0.0007202361,0.00012028883,0.00037088085,0.00045854793,0.00023937626],"domain_scores_gemma":[0.98787564,0.007910853,0.0011666785,0.0013378599,0.0011020117,0.0006069677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028193332,0.0011559878,0.0014397447,0.0013920683,0.0011602594,0.0021632325,0.002181857,0.0021155102,0.010007579],"category_scores_gemma":[0.02450563,0.0006024474,0.0006623662,0.0024363801,0.0014931025,0.005800354,0.0019470832,0.002340639,0.0022522856],"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.0011133859,0.0001725502,0.0020123126,0.0009964667,0.00022013529,0.00033900133,0.00028573084,0.30678642,0.0015011479,0.38723537,0.07093908,0.22839844],"study_design_scores_gemma":[0.00008676693,0.00010864023,0.00050747115,0.0000932341,0.000050494178,0.00026423167,0.00012314133,0.26366255,0.00087637553,0.7211393,0.013068098,0.000019707704],"about_ca_topic_score_codex":0.0013693463,"about_ca_topic_score_gemma":0.0013068278,"teacher_disagreement_score":0.010007579,"about_ca_system_score_codex":0.0010207735,"about_ca_system_score_gemma":0.0016016909,"threshold_uncertainty_score":0.033478737},"labels":[],"label_agreement":null},{"id":"W169484840","doi":"10.20381/ruor-19633","title":"Feature selection with a general hybrid algorithm","year":2004,"lang":"en","type":"dissertation","venue":"uO Research (University of Ottawa)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":23,"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":"Feature selection; Classifier (UML); Artificial intelligence; Computer science; Algorithm; Weighting; Feature (linguistics); Machine learning; Heuristic; Filter (signal processing); Statistical classification; Selection (genetic algorithm); Pattern recognition (psychology); Data mining","score_opus":0.012729899053237324,"score_gpt":0.27625424087351935,"score_spread":0.263524341820282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W169484840","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.005418351,0.00018377819,0.99170613,0.00007499966,0.000045881803,0.000119310964,0.000044099022,0.0013956615,0.0010117213],"genre_scores_gemma":[0.115531,0.00017956526,0.8782433,0.00019277076,0.00009361251,0.00057563453,0.00041955037,0.0001730628,0.004591484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986994,0.0002649488,0.000105273524,0.00033975337,0.0004667964,0.00012374371],"domain_scores_gemma":[0.99900514,0.00040015302,0.000056198154,0.00016393658,0.00034194245,0.000032682332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021567128,0.0012673803,0.0013912037,0.0028789146,0.00063852686,0.0014825447,0.0024092568,0.0018244697,0.004975202],"category_scores_gemma":[0.0031776603,0.0006276264,0.0014897174,0.0026470353,0.0007130485,0.0014943733,0.0014517073,0.0009919754,0.0018743272],"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.00034323626,0.00014174027,0.0013887507,0.00013080433,0.00020954266,0.000114854076,0.00008757041,0.21336506,0.008946789,0.012048705,0.0044738282,0.7587491],"study_design_scores_gemma":[0.00007441429,0.00010998957,0.00027185632,0.000012595504,0.000029966332,0.00010285707,0.000015056253,0.9875137,0.0025017317,0.005611183,0.0037422052,0.00001453208],"about_ca_topic_score_codex":0.0025675066,"about_ca_topic_score_gemma":0.0022347867,"teacher_disagreement_score":0.004975202,"about_ca_system_score_codex":0.00067289005,"about_ca_system_score_gemma":0.00082685426,"threshold_uncertainty_score":0.016643703},"labels":[],"label_agreement":null},{"id":"W1721236287","doi":"10.1007/978-3-540-27868-9_70","title":"A New Family of Weak Estimators for Training in Non-stationary Distributions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Carleton University","funders":"","keywords":"Estimator; Multinomial distribution; Computer science; Convergence (economics); Variance (accounting); Binomial distribution; Variation (astronomy); Stationary distribution; Negative binomial distribution; Algorithm; Artificial intelligence; Mathematics; Machine learning; Statistics","score_opus":0.016506037305955804,"score_gpt":0.26917458906531094,"score_spread":0.25266855175935515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1721236287","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.0008960775,0.00036540715,0.99811125,0.00007348171,0.000058755322,0.00001974989,0.00003269278,0.00013842185,0.0003041944],"genre_scores_gemma":[0.047252193,0.002304824,0.94010514,0.0005903954,0.0007912677,0.000531118,0.0007681842,0.00061290554,0.0070439926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99479705,0.0025317713,0.00037092512,0.000744623,0.0013356213,0.00021996316],"domain_scores_gemma":[0.9778657,0.015156083,0.00093425263,0.0026012256,0.0028547319,0.00058817054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01586003,0.003363088,0.0027223665,0.0029060426,0.0009465551,0.0025793298,0.0045623807,0.0034241423,0.0038267553],"category_scores_gemma":[0.05464956,0.0016939492,0.0023354094,0.0026527187,0.0023662478,0.006160581,0.005847027,0.0056139985,0.0023043128],"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.00047021292,0.00020781423,0.0036276986,0.00077053683,0.000507985,0.00022234971,0.00031184856,0.09850209,0.014154415,0.2692235,0.011434144,0.6005674],"study_design_scores_gemma":[0.00005713525,0.00025596915,0.00076079555,0.0001481888,0.00014382304,0.00039013184,0.000037305945,0.8321476,0.0050231144,0.1484271,0.012545816,0.000063046646],"about_ca_topic_score_codex":0.0006910276,"about_ca_topic_score_gemma":0.00089833554,"teacher_disagreement_score":0.01586003,"about_ca_system_score_codex":0.00089420873,"about_ca_system_score_gemma":0.0012850919,"threshold_uncertainty_score":0.08387691},"labels":[],"label_agreement":null},{"id":"W173834591","doi":"10.2991/978-94-6239-027-0_15","title":"Representing Implicit Knowledge via Hypergraphs","year":2014,"lang":"en","type":"book-chapter","venue":"Atlantis thinking machines","topic":"Machine Learning and Algorithms","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":"Pyrogenesis (Canada)","funders":"","keywords":"Computer science","score_opus":0.009567577712998244,"score_gpt":0.24485638875175073,"score_spread":0.2352888110387525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173834591","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.005767939,0.0022962329,0.90673316,0.0033759926,0.0002483644,0.000060778588,0.00047063504,0.001058307,0.0799886],"genre_scores_gemma":[0.2720508,0.008640727,0.59585667,0.0017506612,0.0007349747,0.0004378817,0.0023849884,0.0010686783,0.11707466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987286,0.0005994725,0.00007459834,0.00026675308,0.00026561582,0.0000649398],"domain_scores_gemma":[0.9968077,0.0019342949,0.00014588333,0.00070270174,0.00031086773,0.000098515484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014756486,0.00081899465,0.00048261712,0.0019969759,0.0014209611,0.0058459104,0.0017177116,0.0019535192,0.01887022],"category_scores_gemma":[0.006206193,0.00076700625,0.00087899336,0.002917542,0.003575493,0.018656917,0.0029428478,0.0032841503,0.0041418495],"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.000011605943,0.00000979926,0.000106759246,0.00008186546,0.000013103057,0.000054818694,0.00038820025,0.00479013,0.00035970786,0.95252776,0.0049265926,0.036729682],"study_design_scores_gemma":[0.000004661258,0.000003608278,0.0000494183,0.00005363682,0.000011166231,0.00004860405,0.00006254653,0.012938968,0.00044530968,0.93483204,0.05153979,0.000010287325],"about_ca_topic_score_codex":0.0028820937,"about_ca_topic_score_gemma":0.0042364667,"teacher_disagreement_score":0.01887022,"about_ca_system_score_codex":0.0017747325,"about_ca_system_score_gemma":0.0009274853,"threshold_uncertainty_score":0.0631271},"labels":[],"label_agreement":null},{"id":"W174024601","doi":"","title":"Approximate Predictive Representations of Partially Observable Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"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":"Observable; Simple (philosophy); Computer science; Artificial intelligence; Theoretical computer science; Machine learning; Algorithm","score_opus":0.014256861106843403,"score_gpt":0.2645208873064751,"score_spread":0.25026402619963173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174024601","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.024404107,0.00022558801,0.97268337,0.00031559868,0.00002227066,0.000019815458,0.00022243249,0.00044164763,0.0016652682],"genre_scores_gemma":[0.86039037,0.0004275529,0.1362136,0.000096990305,0.00007079915,0.00015445989,0.00067034137,0.00007896062,0.0018969949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954104,0.00017409225,0.000025466577,0.00007658536,0.00013615291,0.000046636822],"domain_scores_gemma":[0.9980344,0.0012735777,0.00018222701,0.00030956857,0.00014973298,0.000050401395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081758096,0.0006474964,0.00095989095,0.00055603933,0.0003206967,0.00151199,0.0015392285,0.0010177599,0.002455108],"category_scores_gemma":[0.007073411,0.00042393003,0.00043344678,0.0010169351,0.0009872952,0.0030766625,0.0013359993,0.0016069112,0.00029952664],"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.00005828559,0.000014834794,0.0003882926,0.000048990758,0.000014885187,0.00005244435,0.000059691356,0.89996,0.00047623448,0.081576824,0.0006105636,0.016738936],"study_design_scores_gemma":[0.000002709475,0.0000032314686,0.00002666056,0.0000025739544,0.0000014747494,0.0000040829923,0.0000031941986,0.97689146,0.000072691444,0.022877755,0.00011242523,0.0000017087663],"about_ca_topic_score_codex":0.0037358871,"about_ca_topic_score_gemma":0.003415537,"teacher_disagreement_score":0.0037358871,"about_ca_system_score_codex":0.00088882487,"about_ca_system_score_gemma":0.00061298825,"threshold_uncertainty_score":0.008213162},"labels":[],"label_agreement":null},{"id":"W1766937764","doi":"10.1007/11503415_27","title":"Mind Change Efficient Learning","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Computer science; Class (philosophy); Order (exchange); Set (abstract data type); Point (geometry); Property (philosophy); Artificial intelligence; Theoretical computer science; Algorithm; Mathematics; Epistemology; Pure mathematics; Programming language","score_opus":0.018525096014301995,"score_gpt":0.2533129706236302,"score_spread":0.23478787460932818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1766937764","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.037091587,0.0023087787,0.7379439,0.0050504887,0.0008311607,0.000079728976,0.0002221787,0.0017481727,0.21472402],"genre_scores_gemma":[0.602742,0.0017897903,0.21070878,0.0011796831,0.0005294751,0.00013157888,0.00048356465,0.00073371665,0.18170139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997247,0.000050934865,0.000009363134,0.00009014419,0.00009111575,0.000033637265],"domain_scores_gemma":[0.99910295,0.0003506465,0.000050445393,0.0003068661,0.0001285727,0.000060414226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045800567,0.00038248967,0.00034635462,0.0003685928,0.000373029,0.0011234772,0.0009244904,0.00075796765,0.01756224],"category_scores_gemma":[0.0029262018,0.0002656309,0.00036868753,0.00037440046,0.0010368881,0.0026570545,0.0011814868,0.0018566649,0.0031133636],"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.000085954714,0.00008410125,0.00042532556,0.00013788152,0.00005032645,0.00006780759,0.00019117832,0.015838074,0.005095792,0.622684,0.027469585,0.32786998],"study_design_scores_gemma":[0.000015550557,0.000039934872,0.00060325564,0.000022426013,0.000021679065,0.00011880094,0.000043232714,0.07222768,0.003759474,0.8838605,0.0392752,0.000012129141],"about_ca_topic_score_codex":0.0003697417,"about_ca_topic_score_gemma":0.00058048,"teacher_disagreement_score":0.01756224,"about_ca_system_score_codex":0.00051941525,"about_ca_system_score_gemma":0.00034796412,"threshold_uncertainty_score":0.058751523},"labels":[],"label_agreement":null},{"id":"W1790582767","doi":"","title":"Agnostic Online Learning.","year":2009,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":93,"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":"Learnability; Regret; Margin (machine learning); VC dimension; Computer science; Class (philosophy); Dimension (graph theory); Characterization (materials science); Sample complexity; Theoretical computer science; Probably approximately correct learning; Artificial intelligence; Mathematics; Discrete mathematics; Machine learning; Stability (learning theory); Algorithmic learning theory; Combinatorics","score_opus":0.007886918989418094,"score_gpt":0.25589413389608406,"score_spread":0.24800721490666597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1790582767","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.026892388,0.0008497362,0.96129245,0.0016639264,0.000093497154,0.00012213169,0.00033598952,0.00041426742,0.00833562],"genre_scores_gemma":[0.8482614,0.00088273163,0.13682298,0.0016095135,0.00055411574,0.0004627828,0.000870145,0.00018304925,0.010353267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99467045,0.002412915,0.00014089186,0.0011916695,0.0011161062,0.0004679545],"domain_scores_gemma":[0.96537936,0.02587055,0.0029733123,0.004153744,0.00080800994,0.0008151336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005645711,0.001776898,0.0017841749,0.0009898145,0.00071467983,0.002483967,0.0037500851,0.0028245957,0.006113456],"category_scores_gemma":[0.032194644,0.0010219193,0.0014890437,0.0012601352,0.002738706,0.0074308026,0.0038022704,0.005644486,0.0010256051],"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.00050558354,0.00070023135,0.0029225808,0.00046935448,0.00029207405,0.00025110625,0.0002112794,0.4820926,0.0015792927,0.4283594,0.008264,0.07435251],"study_design_scores_gemma":[0.000034668254,0.0001153511,0.00027791012,0.000022095364,0.000031223113,0.00010173681,0.000014847572,0.7470548,0.0006135053,0.2502641,0.0014542777,0.000015582456],"about_ca_topic_score_codex":0.00084026944,"about_ca_topic_score_gemma":0.0009474385,"teacher_disagreement_score":0.006113456,"about_ca_system_score_codex":0.0025329683,"about_ca_system_score_gemma":0.0011368851,"threshold_uncertainty_score":0.029857695},"labels":[],"label_agreement":null},{"id":"W1809345383","doi":"10.1007/978-3-642-20847-8_33","title":"Asking Generalized Queries with Minimum Cost","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Information retrieval","score_opus":0.016921607349679728,"score_gpt":0.23915437323266225,"score_spread":0.22223276588298252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809345383","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.0959602,0.0022048997,0.85815305,0.0074651036,0.0005733316,0.0006264765,0.002819557,0.00785094,0.024346516],"genre_scores_gemma":[0.53043103,0.0011712624,0.43924472,0.0020951168,0.0013608908,0.0005243645,0.00530213,0.0019011057,0.01796936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98972744,0.0033812437,0.0007365403,0.002177452,0.0027688253,0.0012084617],"domain_scores_gemma":[0.9805197,0.012387779,0.00056088,0.005100249,0.0008789174,0.000552572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033005315,0.0020957952,0.0051707937,0.0010788122,0.0016916463,0.0049865665,0.0049285893,0.0051500914,0.014523044],"category_scores_gemma":[0.022082696,0.0014951441,0.0030871697,0.003029462,0.002559418,0.014318027,0.0067875753,0.0054156925,0.0034077321],"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.0038188016,0.00062743266,0.0032110596,0.0031867188,0.00066504604,0.0010008576,0.0022204553,0.108711086,0.024239901,0.33568776,0.11846802,0.3981629],"study_design_scores_gemma":[0.000289681,0.00017145985,0.00062430784,0.00007873147,0.00018663477,0.0006637387,0.00046188032,0.23918198,0.00423821,0.74301237,0.011018386,0.00007252039],"about_ca_topic_score_codex":0.0019383885,"about_ca_topic_score_gemma":0.0033519794,"teacher_disagreement_score":0.014523044,"about_ca_system_score_codex":0.0021437174,"about_ca_system_score_gemma":0.0019640585,"threshold_uncertainty_score":0.04858446},"labels":[],"label_agreement":null},{"id":"W1828852835","doi":"10.1109/sfcs.1994.365705","title":"On learning discretized geometric concepts","year":2002,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":20,"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 Calgary","funders":"","keywords":"Discretization; Oracle; Bounded function; Counterexample; Constant (computer programming); Time complexity; Polynomial; Equivalence (formal languages); Computer science; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Combinatorics; Mathematical analysis","score_opus":0.013224286849097041,"score_gpt":0.25750832481032554,"score_spread":0.2442840379612285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828852835","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.010236395,0.00021439353,0.98741364,0.0002110254,0.000031234515,0.000044527096,0.00009269258,0.0005718655,0.0011842126],"genre_scores_gemma":[0.2234819,0.00043094746,0.77111053,0.0003508271,0.00012078627,0.0003381662,0.0010054399,0.00016438357,0.0029969667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977368,0.0006857555,0.00011806579,0.00071212224,0.0005854602,0.00016174582],"domain_scores_gemma":[0.9932922,0.004701581,0.00040450497,0.00082632486,0.0005519652,0.00022346726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018556515,0.0008468029,0.0012243289,0.00096785655,0.000739844,0.001471114,0.0030153894,0.0013888446,0.006753141],"category_scores_gemma":[0.01426063,0.00059131853,0.0009416133,0.001940144,0.0025481016,0.0069118165,0.003049145,0.0030652755,0.0014324044],"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.00059634825,0.00023653536,0.0023381212,0.0004278538,0.00007407192,0.0001524027,0.0004486712,0.3256528,0.004984183,0.27306613,0.006804868,0.385218],"study_design_scores_gemma":[0.00005815532,0.0001388865,0.00030630874,0.00003684642,0.000012987671,0.00011985994,0.00008693442,0.82854277,0.0023902466,0.16452502,0.0037646918,0.00001723533],"about_ca_topic_score_codex":0.0027234384,"about_ca_topic_score_gemma":0.001977984,"teacher_disagreement_score":0.006753141,"about_ca_system_score_codex":0.0017287633,"about_ca_system_score_gemma":0.0010930096,"threshold_uncertainty_score":0.022591531},"labels":[],"label_agreement":null},{"id":"W1838099784","doi":"","title":"A New Generalized Error Path Algorithm for Model Selection","year":2015,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hyperparameter optimization; Piecewise; Regularization (linguistics); Model selection; Algorithm; Computer science; Path (computing); Generalization; Mathematics; Mathematical optimization; Quadratic equation; Search algorithm; Support vector machine; Artificial intelligence","score_opus":0.06930398399980568,"score_gpt":0.3347133790024918,"score_spread":0.2654093950026861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1838099784","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.0014602579,0.00017145011,0.99752337,0.000107694126,0.000023632998,0.000038514794,0.000040446586,0.0003297619,0.00030488102],"genre_scores_gemma":[0.07775911,0.00032270784,0.9177146,0.0003692898,0.00007502678,0.000602285,0.000710655,0.0003524751,0.0020938038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972567,0.0013617087,0.00014072828,0.00053398666,0.00056909194,0.00013779041],"domain_scores_gemma":[0.9958521,0.0027978919,0.0002911451,0.00034270386,0.00060766476,0.000108508124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00461034,0.0020307784,0.0022197478,0.0024025273,0.00091966585,0.0013679418,0.0028840934,0.0027939954,0.0044206735],"category_scores_gemma":[0.012727566,0.0010908211,0.0018120196,0.002471089,0.001304014,0.0025042123,0.002912954,0.0034879525,0.0013441676],"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.00016591148,0.00010491044,0.0014037677,0.0002047569,0.00024510844,0.00018487593,0.00012822809,0.6734585,0.0023257148,0.046654485,0.007566436,0.2675573],"study_design_scores_gemma":[0.000026681962,0.000046301982,0.00006658647,0.0000128563215,0.0000115497705,0.00004735527,0.0000064507326,0.9857949,0.0003476042,0.012295671,0.0013346123,0.000009404738],"about_ca_topic_score_codex":0.0040518474,"about_ca_topic_score_gemma":0.0034893584,"teacher_disagreement_score":0.00461034,"about_ca_system_score_codex":0.00092953286,"about_ca_system_score_gemma":0.0028889752,"threshold_uncertainty_score":0.024382114},"labels":[],"label_agreement":null},{"id":"W1851724702","doi":"","title":"State Complexity: Recent Results and Open Problems","year":2004,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Computer science; Open research; Theoretical computer science; Algorithm; World Wide Web","score_opus":0.0496346177391194,"score_gpt":0.2940333217176931,"score_spread":0.2443987039785737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851724702","genre_codex":"review","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.038250953,0.38766456,0.37144297,0.060393933,0.0034972103,0.0001511382,0.0011552714,0.0009325596,0.13651146],"genre_scores_gemma":[0.4711224,0.37324157,0.10008897,0.0064622937,0.027550964,0.00047889366,0.0026574,0.0006830101,0.017714372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956448,0.00090563874,0.00032102058,0.0010288003,0.0016036787,0.00049614144],"domain_scores_gemma":[0.96244544,0.03133046,0.0011446658,0.0017569001,0.0024793707,0.0008432051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055169524,0.001687893,0.0026142125,0.004842647,0.0025598162,0.007068794,0.0034647093,0.0035615258,0.009507283],"category_scores_gemma":[0.023627652,0.0010002047,0.0020802033,0.009255154,0.0071230773,0.026580658,0.0043616593,0.010247156,0.0020436156],"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.00013457946,0.00014729188,0.000872334,0.001772893,0.00008644808,0.000111583904,0.00031053627,0.0105337575,0.00032533263,0.8408335,0.0145776225,0.13029417],"study_design_scores_gemma":[0.000013070117,0.000028214927,0.00031662462,0.0001647118,0.00003054636,0.00011001793,0.00012992886,0.013650584,0.0002974436,0.96316475,0.022069434,0.000024617104],"about_ca_topic_score_codex":0.0019560242,"about_ca_topic_score_gemma":0.0010601812,"teacher_disagreement_score":0.009507283,"about_ca_system_score_codex":0.0045702313,"about_ca_system_score_gemma":0.0021099418,"threshold_uncertainty_score":0.033159494},"labels":[],"label_agreement":null},{"id":"W1877234769","doi":"","title":"Open Problem: Recursive Teaching Dimension Versus VC Dimension","year":2015,"lang":"en","type":"article","venue":"Conference on Learning Theory","topic":"Machine Learning and Algorithms","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 Regina","funders":"","keywords":"Concept class; Dimension (graph theory); Conjecture; Mathematics; Class (philosophy); VC dimension; Bounded function; Upper and lower bounds; Exponential function; Discrete mathematics; Function (biology); Combinatorics; Kolmogorov complexity; Algebra over a field; Pure mathematics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.06272562214348579,"score_gpt":0.3247416508144249,"score_spread":0.2620160286709391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1877234769","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.1737038,0.015548423,0.674739,0.076271914,0.0013323391,0.00032571686,0.0039687953,0.0031139012,0.050996076],"genre_scores_gemma":[0.8442106,0.0061986633,0.12374061,0.007108111,0.0056663426,0.00082114915,0.0019604713,0.001176575,0.009117487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9884416,0.003264446,0.00055993063,0.003667941,0.0025689323,0.0014971229],"domain_scores_gemma":[0.72655326,0.24439593,0.005278309,0.013602883,0.005294489,0.004875196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009538388,0.0014600841,0.0039243684,0.0017649201,0.0026338776,0.007852738,0.0061907535,0.005595141,0.014400157],"category_scores_gemma":[0.1229985,0.0011743171,0.0021531188,0.0027132935,0.008274892,0.023015784,0.006275609,0.01061029,0.002409345],"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.0010084014,0.00039705264,0.00534264,0.0011719954,0.0001753208,0.00019414777,0.00078751426,0.039789915,0.002477741,0.76998985,0.0378364,0.14082901],"study_design_scores_gemma":[0.00009344932,0.00010607925,0.0013222675,0.00016687304,0.00003979596,0.0003267125,0.00020189925,0.10908803,0.0014425925,0.8800422,0.00709113,0.00007902711],"about_ca_topic_score_codex":0.0019407758,"about_ca_topic_score_gemma":0.0010929722,"teacher_disagreement_score":0.014400157,"about_ca_system_score_codex":0.0050562313,"about_ca_system_score_gemma":0.0032960079,"threshold_uncertainty_score":0.050444365},"labels":[],"label_agreement":null},{"id":"W1907753270","doi":"","title":"A Bayesian concept learning approach to crowdsourcing","year":2011,"lang":"en","type":"article","venue":"VBN Forskningsportal (Aalborg Universitet)","topic":"Machine Learning and Algorithms","field":"Computer Science","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 Toronto; University of Regina","funders":"","keywords":"Crowdsourcing; Bayesian probability; Computer science; Machine learning; Artificial intelligence; World Wide Web","score_opus":0.01105767588516493,"score_gpt":0.1919609125268615,"score_spread":0.18090323664169658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1907753270","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.0011507955,0.00018993388,0.99552,0.0005897011,0.000042187625,0.00007128187,0.000082413666,0.00008859336,0.0022651325],"genre_scores_gemma":[0.22124645,0.0011189666,0.7632121,0.0006948925,0.0004991007,0.00095267984,0.00039138453,0.00014133095,0.011743059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937815,0.0026392748,0.00023612671,0.0010556219,0.0020058812,0.00028163864],"domain_scores_gemma":[0.9900947,0.0065723327,0.0006035033,0.00087384245,0.0014393246,0.00041630943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007050397,0.0013819634,0.0017737477,0.002695788,0.0015890321,0.0030666238,0.005985511,0.0028704721,0.0074387477],"category_scores_gemma":[0.02091938,0.0012503148,0.0018177667,0.0031297302,0.0030836714,0.0052081966,0.003629225,0.0042018667,0.0020735285],"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.00006558218,0.000111616835,0.00072725385,0.00020062675,0.000097275886,0.00016135993,0.0005311866,0.35957965,0.0008994975,0.55976576,0.005823163,0.072036944],"study_design_scores_gemma":[0.000019977308,0.00002712065,0.00011287744,0.000037938986,0.00001683773,0.000056450648,0.00003068955,0.7370387,0.0003296732,0.2560795,0.006213502,0.000036720245],"about_ca_topic_score_codex":0.013443703,"about_ca_topic_score_gemma":0.010706988,"teacher_disagreement_score":0.013443703,"about_ca_system_score_codex":0.0033060247,"about_ca_system_score_gemma":0.003415047,"threshold_uncertainty_score":0.03728652},"labels":[],"label_agreement":null},{"id":"W1907964890","doi":"10.1007/978-3-540-27868-9_27","title":"Improving Probabilistic Automata Learning with Additional Knowledge","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Automaton; Grammar induction; Probabilistic logic; Inference; Artificial intelligence; Cluster analysis; Learning automata; Task (project management); Machine learning; Natural language processing; Rule-based machine translation","score_opus":0.008600264750054234,"score_gpt":0.2271526474379097,"score_spread":0.21855238268785546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1907964890","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.011385522,0.00074859266,0.9759576,0.0005369922,0.00028202424,0.00005679759,0.00016743294,0.00475994,0.006105196],"genre_scores_gemma":[0.28228253,0.00071398204,0.7023969,0.000833214,0.00052227,0.00026081034,0.0010680616,0.0009459722,0.010976248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967063,0.00086567545,0.00022581137,0.00083184685,0.0011570998,0.00021311399],"domain_scores_gemma":[0.9802801,0.012102914,0.00040166144,0.0054964107,0.0014725073,0.00024640004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002692152,0.0016105374,0.0026244859,0.0010741062,0.00088296254,0.0018804282,0.0048797526,0.0031577956,0.0134797795],"category_scores_gemma":[0.019567316,0.0011526336,0.0020075925,0.0016730243,0.0015154463,0.010028187,0.00527935,0.0050845603,0.004419079],"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.00036850493,0.00033684444,0.0010200562,0.00046222066,0.00019092885,0.00011056419,0.00011710761,0.24832328,0.006427135,0.06248437,0.013835914,0.6663231],"study_design_scores_gemma":[0.000031578,0.000057955735,0.00012522176,0.000023650764,0.000061356826,0.00007979081,0.000013070973,0.8892478,0.003327255,0.104021505,0.0029960403,0.000014851793],"about_ca_topic_score_codex":0.0018270505,"about_ca_topic_score_gemma":0.0036197088,"teacher_disagreement_score":0.0134797795,"about_ca_system_score_codex":0.0011131072,"about_ca_system_score_gemma":0.0014572664,"threshold_uncertainty_score":0.04509431},"labels":[],"label_agreement":null},{"id":"W1938992549","doi":"10.1109/ismvl.1996.508330","title":"New interpolation algorithms for multiple-valued Reed-Muller forms","year":2002,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Interpolation (computer graphics); Algorithm; Mathematics; Boolean function; Probabilistic logic; Polarity (international relations); Probabilistic analysis of algorithms; Quadratic equation; Computer science; Artificial intelligence","score_opus":0.029919785038788577,"score_gpt":0.27409550699765756,"score_spread":0.24417572195886897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1938992549","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.0028254685,0.000065127046,0.9952668,0.00006191968,0.000019036504,0.000030046924,0.000030009696,0.0003255185,0.0013760278],"genre_scores_gemma":[0.07452932,0.00020087961,0.9209896,0.000075384334,0.00008553331,0.00015599214,0.00019270617,0.0003038145,0.003466841],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985917,0.0003545166,0.00009889663,0.0002293953,0.0006240001,0.00010136314],"domain_scores_gemma":[0.998216,0.00085567246,0.0001756909,0.00033504778,0.00035623807,0.00006136331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018255634,0.0006727303,0.0007557577,0.0011877606,0.0005526775,0.001025952,0.0014103693,0.0006226615,0.0075233094],"category_scores_gemma":[0.008012634,0.00046564054,0.0009169648,0.0012233123,0.0009379109,0.0030935777,0.002111157,0.0021327587,0.0020673403],"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.00016223933,0.00008061518,0.00045825247,0.0002064214,0.000025752966,0.000053301374,0.00023815424,0.086032204,0.008468815,0.414985,0.003790273,0.48549888],"study_design_scores_gemma":[0.000059607402,0.00010360995,0.00013756426,0.000043137086,0.000013739086,0.00013952325,0.00005035484,0.7031217,0.009436867,0.2731277,0.013721475,0.000044737943],"about_ca_topic_score_codex":0.00044921116,"about_ca_topic_score_gemma":0.00073668506,"teacher_disagreement_score":0.0075233094,"about_ca_system_score_codex":0.000816542,"about_ca_system_score_gemma":0.000754158,"threshold_uncertainty_score":0.025167942},"labels":[],"label_agreement":null},{"id":"W1956666728","doi":"10.1007/11889205_17","title":"Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Algorithm; Parametric statistics; Novelty; Machine learning; Local search (optimization); Artificial intelligence; Mathematics","score_opus":0.007564657004435706,"score_gpt":0.2255491661934901,"score_spread":0.2179845091890544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956666728","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.02909838,0.0005501824,0.96473753,0.00026819942,0.00010540177,0.000057094836,0.00007667608,0.0023337996,0.0027727326],"genre_scores_gemma":[0.72638553,0.00026515345,0.2698191,0.00014434387,0.00021185006,0.00021549177,0.00029557646,0.00060135365,0.002061557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913133,0.003974086,0.00041438072,0.0016154031,0.0019297628,0.0007530387],"domain_scores_gemma":[0.962976,0.024615336,0.002078506,0.007698261,0.002195411,0.0004365092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008953182,0.0012990908,0.0017624098,0.0013264378,0.0008037787,0.002309574,0.0035420407,0.0019972953,0.0036712913],"category_scores_gemma":[0.056920536,0.0008768402,0.000979027,0.0013243513,0.001898834,0.004180431,0.0024299326,0.002891226,0.001084961],"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.0006742442,0.00024103728,0.002314074,0.00012210586,0.000081458806,0.000046668552,0.00009292603,0.7361171,0.004783698,0.04727403,0.0036467132,0.20460594],"study_design_scores_gemma":[0.000024414725,0.00004386519,0.00023418329,0.0000089408595,0.000008285843,0.00001556645,0.000006586185,0.97816443,0.0012408822,0.019922553,0.0003195026,0.000010817193],"about_ca_topic_score_codex":0.0020741897,"about_ca_topic_score_gemma":0.0017635376,"teacher_disagreement_score":0.008953182,"about_ca_system_score_codex":0.001550641,"about_ca_system_score_gemma":0.0023634443,"threshold_uncertainty_score":0.047349513},"labels":[],"label_agreement":null},{"id":"W1956860503","doi":"","title":"Learnability of Solutions to Conjunctive Queries: The Full Dichotomy","year":2015,"lang":"en","type":"article","venue":"Conference on Learning Theory","topic":"Machine Learning and Algorithms","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":"McMaster University","funders":"","keywords":"Learnability; Property (philosophy); Theoretical computer science; Computer science; Conjunctive query; Mathematics; Discrete mathematics; Space (punctuation); Artificial intelligence; Algebra over a field; Relational database; Pure mathematics; Information retrieval","score_opus":0.0490561778058568,"score_gpt":0.28727856831801274,"score_spread":0.23822239051215593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956860503","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.18075533,0.0013127333,0.7841576,0.010869131,0.0000790034,0.00012724758,0.00048406483,0.00072898436,0.02148599],"genre_scores_gemma":[0.9180982,0.00069972855,0.07452991,0.0010689427,0.00030319477,0.00022815341,0.0006984681,0.00018571399,0.0041877166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9894721,0.0039870986,0.0005619491,0.0023068162,0.0030393559,0.0006327274],"domain_scores_gemma":[0.95741236,0.03371097,0.0017650959,0.0042023635,0.0020253162,0.0008839433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00998201,0.00077150087,0.0013358752,0.0017162118,0.001687129,0.0039041743,0.0031850424,0.002572785,0.0055995365],"category_scores_gemma":[0.058664173,0.00079571665,0.0021635331,0.001469487,0.009063,0.019194882,0.0076239873,0.0057372083,0.0006172342],"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.00014265787,0.000096849864,0.0014749946,0.00022765744,0.000045355275,0.000093362294,0.0009819039,0.008629328,0.0010260167,0.9520817,0.0015922931,0.033607908],"study_design_scores_gemma":[0.00002403145,0.000029653036,0.00024308753,0.000023130176,0.000014378079,0.00006627188,0.00010840157,0.03193244,0.00061445223,0.9661687,0.00076552737,0.000009957447],"about_ca_topic_score_codex":0.0012778303,"about_ca_topic_score_gemma":0.00087607524,"teacher_disagreement_score":0.00998201,"about_ca_system_score_codex":0.0022352247,"about_ca_system_score_gemma":0.0013775707,"threshold_uncertainty_score":0.052790523},"labels":[],"label_agreement":null},{"id":"W1961366647","doi":"","title":"Convex Structure Learning in Log-Linear Models: Beyond Pairwise Potentials","year":2010,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":64,"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 British Columbia","funders":"","keywords":"Pairwise comparison; Subroutine; Regularization (linguistics); Projection (relational algebra); Mathematics; Constraint (computer-aided design); Mathematical optimization; Computer science; Algorithm; Applied mathematics; Artificial intelligence","score_opus":0.008306696626368059,"score_gpt":0.23780858932012602,"score_spread":0.22950189269375795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1961366647","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.017796725,0.00041715847,0.9792762,0.0008042762,0.00001939855,0.000033174176,0.00004860767,0.00033649808,0.0012679875],"genre_scores_gemma":[0.6345219,0.000863492,0.35832304,0.0006298698,0.00023049545,0.0002429468,0.00053573353,0.00036482528,0.0042876815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717975,0.0018773188,0.000058769274,0.0002731364,0.00048640498,0.00012470345],"domain_scores_gemma":[0.9861232,0.010766747,0.00077012583,0.0013311696,0.00059156487,0.00041722873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004106607,0.0015704436,0.0018815948,0.00085541396,0.000853717,0.0019051905,0.0028475,0.0024133963,0.002190955],"category_scores_gemma":[0.02093441,0.00074596284,0.0010628995,0.0014292166,0.0022300654,0.006368991,0.0041860407,0.004479615,0.0007604698],"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.00010645443,0.00012453074,0.0009408626,0.00012079202,0.00007262512,0.00012408914,0.00014303168,0.84159255,0.0014594895,0.082476944,0.0024494678,0.07038926],"study_design_scores_gemma":[0.0000033998865,0.000014954765,0.000041190826,0.0000036359388,0.0000019972936,0.0000103978,0.000005336315,0.96366984,0.00020811512,0.03588701,0.00015059809,0.0000034864656],"about_ca_topic_score_codex":0.002770224,"about_ca_topic_score_gemma":0.0041284417,"teacher_disagreement_score":0.004106607,"about_ca_system_score_codex":0.0013332271,"about_ca_system_score_gemma":0.0011567264,"threshold_uncertainty_score":0.021718085},"labels":[],"label_agreement":null},{"id":"W1964505066","doi":"10.1007/s10994-008-5087-1","title":"Guest editor’s introduction: special issue on inductive transfer learning","year":2008,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Inductive transfer; Computer science; Transfer of learning; Multi-task learning; Artificial intelligence; Generalization; Task (project management); Heuristics; Machine learning; Representation (politics); Similarity (geometry); Transfer of training; Instance-based learning; Sequence learning; Active learning (machine learning); Robot learning; Knowledge management; Mathematics","score_opus":0.008890312988525221,"score_gpt":0.2275228686149516,"score_spread":0.2186325556264264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964505066","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007688312,0.0031280548,0.0012700388,0.03169038,0.9622361,0.000012921795,0.00007140413,0.00009292405,0.0014213644],"genre_scores_gemma":[0.00095543027,0.0023127291,0.000759431,0.0151221715,0.96872073,0.00002435492,0.00008772082,0.00014139863,0.011876033],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99723405,0.0005446592,0.0004009317,0.00054864556,0.0010628288,0.00020885034],"domain_scores_gemma":[0.98130244,0.0050378726,0.0012645819,0.0010383856,0.0094873775,0.0018694372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005073758,0.0022003937,0.0028331694,0.003228454,0.0015562219,0.0042591654,0.0028228585,0.0061847544,0.03294037],"category_scores_gemma":[0.021829449,0.0008742107,0.0019204901,0.0015134253,0.0012549321,0.0036483712,0.0017777779,0.010948987,0.018386796],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00003544115,0.000014801315,0.00006269522,0.00014435124,0.000016509697,0.00006660386,0.0000047504777,0.000047297133,0.00011269061,0.00036246647,0.9885852,0.010547235],"study_design_scores_gemma":[0.000052328523,0.00005700917,0.0008590209,0.00026256774,0.000070103546,0.0005065184,0.000021789594,0.00079851726,0.0004554021,0.002873141,0.99400747,0.000036231708],"about_ca_topic_score_codex":0.0006132708,"about_ca_topic_score_gemma":0.0019097243,"teacher_disagreement_score":0.03294037,"about_ca_system_score_codex":0.0011487199,"about_ca_system_score_gemma":0.0014215432,"threshold_uncertainty_score":0.11019647},"labels":[],"label_agreement":null},{"id":"W1965529758","doi":"10.1016/j.dam.2007.07.023","title":"Self-duality of bounded monotone boolean functions and related problems","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Mathematics; Duality (order theory); Monotone polygon; Bounded function; Boolean function; Disjunctive normal form; Discrete mathematics; Combinatorics; Function (biology); Maximum satisfiability problem; Parity function; Boolean expression","score_opus":0.008905465639928068,"score_gpt":0.24209905899356418,"score_spread":0.23319359335363612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965529758","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.3421203,0.0063473675,0.53900665,0.0068851947,0.0006107777,0.00008489959,0.00038563204,0.00020853842,0.104350634],"genre_scores_gemma":[0.92864704,0.0025832157,0.04332376,0.0009508245,0.00093152514,0.00013199815,0.00034328445,0.000111087575,0.022977266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849916,0.0006839946,0.00006388065,0.00020315057,0.0003623582,0.00018740453],"domain_scores_gemma":[0.99293035,0.004972837,0.00050634675,0.00030857604,0.0007493018,0.00053259375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002873651,0.00063972623,0.0013711988,0.002025666,0.0014496276,0.0034502607,0.0016496519,0.0017442228,0.0050800466],"category_scores_gemma":[0.010840576,0.0005935766,0.0012019239,0.0018662747,0.0036391146,0.0061841276,0.0024459672,0.0034909304,0.00038422688],"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.000033289125,0.000027729568,0.0001052972,0.00003794797,0.0000060728507,0.000025669833,0.00007021615,0.0011478332,0.00019163861,0.99483705,0.0007564467,0.0027609558],"study_design_scores_gemma":[0.000013662753,0.000011358373,0.00006778331,0.00000805447,0.0000042349134,0.000049835253,0.00003686123,0.0134197585,0.00014756604,0.98548746,0.0007485211,0.0000048559914],"about_ca_topic_score_codex":0.00064289506,"about_ca_topic_score_gemma":0.00042314228,"teacher_disagreement_score":0.0050800466,"about_ca_system_score_codex":0.0020122651,"about_ca_system_score_gemma":0.0008525285,"threshold_uncertainty_score":0.016994417},"labels":[],"label_agreement":null},{"id":"W1966252274","doi":"10.1016/j.ic.2005.09.003","title":"Learning expressions and programs over monoids","year":2005,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Aperiodic graph; Monoid; Learnability; Mathematics; Connection (principal bundle); Class (philosophy); Group (periodic table); Algebraic number; Discrete mathematics; Algebra over a field; Computer science; Combinatorics; Pure mathematics; Artificial intelligence","score_opus":0.007052188450019767,"score_gpt":0.25162136488855247,"score_spread":0.2445691764385327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966252274","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.058101386,0.0009807195,0.931017,0.0014048626,0.00008169143,0.00006491071,0.0004646105,0.0010313111,0.0068535157],"genre_scores_gemma":[0.61237025,0.0015240781,0.36998907,0.00056646625,0.0002672413,0.00026688777,0.0013844866,0.00042529663,0.013206246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736744,0.00097131863,0.00027320135,0.0006815804,0.00053731195,0.00016918803],"domain_scores_gemma":[0.98992467,0.0076795085,0.0005325364,0.0008140727,0.0008304772,0.00021871887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002510502,0.00062339014,0.0006820868,0.0018429812,0.0010114792,0.0036780143,0.0013980796,0.0010680987,0.0046012877],"category_scores_gemma":[0.017563688,0.00086934835,0.0010674502,0.0027829714,0.0026404131,0.011279286,0.0030378655,0.0022936196,0.00085358147],"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.000108555214,0.000038517064,0.0016802029,0.00019760939,0.000034356723,0.00011717843,0.0008323444,0.012357333,0.0011633398,0.8826859,0.0026045227,0.098180145],"study_design_scores_gemma":[0.0000105196195,0.000018737697,0.0001702158,0.000047608508,0.0000238793,0.00008452675,0.0001005965,0.03794035,0.0012533193,0.95529425,0.0050420025,0.000013987122],"about_ca_topic_score_codex":0.001403894,"about_ca_topic_score_gemma":0.0012101047,"teacher_disagreement_score":0.0046012877,"about_ca_system_score_codex":0.001400501,"about_ca_system_score_gemma":0.0010084127,"threshold_uncertainty_score":0.0153928995},"labels":[],"label_agreement":null},{"id":"W1968263669","doi":"10.1109/ijcnn.2014.6889963","title":"A practical SIM learning formulation with margin capacity control","year":2014,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Thomson Reuters (Canada)","funders":"","keywords":"Margin (machine learning); Function (biology); Lipschitz continuity; Regression; Artificial intelligence; Discrete mathematics; Computer science; Linear regression; Mathematics; Combinatorics; Machine learning; Pure mathematics; Statistics","score_opus":0.012720755555664168,"score_gpt":0.25092845960499227,"score_spread":0.23820770404932812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968263669","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.0056251553,0.00036178032,0.9895427,0.0011793923,0.000041617273,0.000059311515,0.00024717895,0.00032299667,0.0026198186],"genre_scores_gemma":[0.56790835,0.0010355094,0.40314227,0.0013151147,0.00057322194,0.0009110575,0.001980153,0.00037316984,0.022761077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984036,0.00059450895,0.00007805276,0.0005001226,0.0002852061,0.000138488],"domain_scores_gemma":[0.99589527,0.002726552,0.00031191861,0.00033835653,0.00056107563,0.00016682956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044393945,0.0014745923,0.0020195127,0.00078812207,0.00044879684,0.0018656275,0.002841068,0.003304889,0.007854536],"category_scores_gemma":[0.010139275,0.0008623432,0.0010642258,0.0011721741,0.0017938645,0.0029972016,0.0030155857,0.0036158399,0.0011905562],"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.00014934722,0.00007184028,0.0006469567,0.00021455322,0.00004606793,0.00012994694,0.00006798368,0.8564996,0.00049797894,0.09726829,0.0054684463,0.038938925],"study_design_scores_gemma":[0.000010127987,0.000027965893,0.00004093979,0.000007938637,0.000004514056,0.000014930825,0.0000071582745,0.98087984,0.00015610042,0.0183045,0.0005413828,0.0000045794873],"about_ca_topic_score_codex":0.003785997,"about_ca_topic_score_gemma":0.0036084994,"teacher_disagreement_score":0.007854536,"about_ca_system_score_codex":0.0020613503,"about_ca_system_score_gemma":0.0022760655,"threshold_uncertainty_score":0.026276112},"labels":[],"label_agreement":null},{"id":"W1968541942","doi":"10.1007/s00454-004-1108-4","title":"Covering Things with Things","year":2004,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fonds De La Recherche Scientifique - FNRS","keywords":"Mathematics; Combinatorics; Dimension (graph theory); Running time; Time complexity; Discrete mathematics; Computational geometry; Notation; Algorithm","score_opus":0.005501027611406248,"score_gpt":0.22838803611212843,"score_spread":0.22288700850072218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968541942","genre_codex":"other","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.016477387,0.010004802,0.27360007,0.024197707,0.0047703343,0.00010552015,0.000910284,0.0010918952,0.6688421],"genre_scores_gemma":[0.5626434,0.010208813,0.095575,0.009725685,0.0043922,0.0004222369,0.0023360394,0.0014610846,0.31323552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862695,0.00050601957,0.00006079721,0.00039018554,0.00028619333,0.00012979253],"domain_scores_gemma":[0.9984573,0.00048147346,0.000073524716,0.00064361386,0.00018407221,0.00016000937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007192581,0.00083603576,0.00085709704,0.001424336,0.0033022685,0.0054422165,0.000782045,0.001593287,0.03771838],"category_scores_gemma":[0.004439026,0.000499505,0.0010940504,0.0020483083,0.0063243867,0.01274187,0.0055184723,0.003626136,0.008194515],"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.000004780768,0.0000016901057,0.000039556344,0.000020362035,0.000004290135,0.000021000442,0.00023180079,0.0001231741,0.00007728945,0.9857465,0.007936304,0.0057933205],"study_design_scores_gemma":[0.0000023356988,0.0000040673276,0.000051582407,0.000014955622,0.0000049736846,0.00008787535,0.00018001044,0.0002750242,0.00006742554,0.9032963,0.096010916,0.0000045573593],"about_ca_topic_score_codex":0.00087329483,"about_ca_topic_score_gemma":0.00075682974,"teacher_disagreement_score":0.03771838,"about_ca_system_score_codex":0.00112493,"about_ca_system_score_gemma":0.00060335186,"threshold_uncertainty_score":0.12618059},"labels":[],"label_agreement":null},{"id":"W1971324060","doi":"10.1007/pl00011676","title":"Parallel and Sequential Algorithms for Data Mining Using Inductive Logic","year":2001,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); Queen's University","funders":"","keywords":"Computer science; Inductive logic programming; Algorithm; Data mining; Artificial intelligence","score_opus":0.09966565189006675,"score_gpt":0.33770732626556443,"score_spread":0.23804167437549767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971324060","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.0029701754,0.00037514145,0.9938308,0.000234148,0.00005884591,0.00010815413,0.00008015616,0.00076835154,0.0015741646],"genre_scores_gemma":[0.0631979,0.00051974965,0.93123806,0.00022146056,0.00023812264,0.00037417584,0.00051303685,0.00018789218,0.0035096938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534875,0.0014019227,0.00043842226,0.0009614877,0.0016092723,0.00024011578],"domain_scores_gemma":[0.98508644,0.01046018,0.0004107839,0.002330694,0.0014974966,0.00021442458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006658421,0.0012576891,0.001628465,0.0032928446,0.0018954824,0.002954239,0.0033026955,0.0011573546,0.007881403],"category_scores_gemma":[0.019797703,0.0011188462,0.0022038994,0.004046678,0.0022990087,0.006034729,0.0032039327,0.0030435536,0.0025066074],"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.0005970395,0.0003777491,0.0025917355,0.0005831955,0.00026995843,0.00017378587,0.0003038859,0.07629567,0.0034756945,0.16132808,0.008006992,0.7459961],"study_design_scores_gemma":[0.00013565234,0.00009630648,0.00040276072,0.00005178773,0.00012516954,0.0002285492,0.00007631966,0.439181,0.004065546,0.54617023,0.009438873,0.000027774935],"about_ca_topic_score_codex":0.0029898384,"about_ca_topic_score_gemma":0.0053814505,"teacher_disagreement_score":0.007881403,"about_ca_system_score_codex":0.0016074192,"about_ca_system_score_gemma":0.0033089044,"threshold_uncertainty_score":0.03521353},"labels":[],"label_agreement":null},{"id":"W1972531982","doi":"10.1016/j.dam.2004.05.002","title":"Saturated systems of homogeneous boxes and the logical analysis of numerical data","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Mathematics; Homogeneous; Algorithm; Combinatorics","score_opus":0.019098772404859816,"score_gpt":0.26120398441800796,"score_spread":0.24210521201314814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972531982","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.04586048,0.0008959898,0.9457301,0.0010781777,0.000098190976,0.000059246016,0.00021599222,0.00032449997,0.0057372744],"genre_scores_gemma":[0.6933693,0.0013286979,0.29505318,0.00061687356,0.00048774682,0.00033905986,0.0005780893,0.00026317392,0.007963882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949963,0.0025600742,0.0004152132,0.00081301125,0.0008307825,0.00038459073],"domain_scores_gemma":[0.9735738,0.019503063,0.0015915799,0.0028008025,0.0019254369,0.0006052662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062915925,0.0007172136,0.0015987265,0.0030204454,0.0020387482,0.00524037,0.0023059698,0.0015057062,0.0057930853],"category_scores_gemma":[0.028930511,0.0013837426,0.002649873,0.0026867893,0.010054362,0.011940023,0.005657132,0.002485729,0.00070992135],"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.000039999755,0.000008097695,0.00029117224,0.000061066145,0.000022654607,0.00004835228,0.00019691818,0.0046123797,0.00046164545,0.9905543,0.0002997151,0.003403715],"study_design_scores_gemma":[0.0000131775705,0.000010304266,0.000099883844,0.00001687795,0.000020818583,0.000025492454,0.00004730023,0.02674459,0.000526056,0.9712388,0.0012429138,0.000013888813],"about_ca_topic_score_codex":0.0040031993,"about_ca_topic_score_gemma":0.0026441377,"teacher_disagreement_score":0.0062915925,"about_ca_system_score_codex":0.0023199255,"about_ca_system_score_gemma":0.002487432,"threshold_uncertainty_score":0.033273578},"labels":[],"label_agreement":null},{"id":"W1979353897","doi":"10.1007/s10479-011-0850-2","title":"A new column generation algorithm for Logical Analysis of Data","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Theory of computation; Computer science; Column (typography); Column generation; Algorithm; Mathematics; Mathematical optimization","score_opus":0.6416303804554536,"score_gpt":0.5226771941018385,"score_spread":0.11895318635361507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979353897","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.0019264203,0.00013320903,0.99468094,0.00012713572,0.000081484664,0.00008601942,0.00025254415,0.0022412986,0.0004708926],"genre_scores_gemma":[0.018835582,0.000107452324,0.97819126,0.00014263358,0.00010572733,0.00015792013,0.0009065794,0.0002910055,0.001262007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998102,0.00040040846,0.00020424071,0.00036627706,0.0007975222,0.00012951427],"domain_scores_gemma":[0.9949839,0.002600197,0.00022343792,0.00078900246,0.0012413509,0.00016206279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019700984,0.0014799619,0.0014086195,0.004418987,0.0011012906,0.002734556,0.002229777,0.0010135025,0.010395837],"category_scores_gemma":[0.009030148,0.0007665348,0.0019433877,0.0038478752,0.0009653102,0.0032493656,0.0021798685,0.0026799352,0.0036541389],"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.00037680633,0.00019890166,0.0012772505,0.00025124397,0.00012704018,0.000187853,0.000115110626,0.025851974,0.011240008,0.025748942,0.023635559,0.9109893],"study_design_scores_gemma":[0.00014140125,0.0001370478,0.00051014114,0.000059618826,0.00011540624,0.00035358962,0.000060557046,0.8991768,0.010923569,0.075378545,0.013085638,0.00005766437],"about_ca_topic_score_codex":0.0028239794,"about_ca_topic_score_gemma":0.0043469486,"teacher_disagreement_score":0.010395837,"about_ca_system_score_codex":0.00089409074,"about_ca_system_score_gemma":0.0024663752,"threshold_uncertainty_score":0.034777522},"labels":[],"label_agreement":null},{"id":"W1981403153","doi":"10.1016/j.tcs.2008.02.021","title":"Learning recursive functions: A survey","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Learnability; Randomness; Algorithmic learning theory; Computer science; Set (abstract data type); Limit (mathematics); Focus (optics); Function (biology); Field (mathematics); Artificial intelligence; Mathematics; Theoretical computer science; Active learning (machine learning); Pure mathematics; Statistics","score_opus":0.014483351408562984,"score_gpt":0.2498447219833575,"score_spread":0.2353613705747945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981403153","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008431903,0.4651053,0.51041347,0.0022224567,0.0003831068,0.00007957675,0.00020795809,0.0006757956,0.012480432],"genre_scores_gemma":[0.1278394,0.57236385,0.28446597,0.0014702609,0.0035469327,0.00021026918,0.0012715302,0.0003873828,0.00844442],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982235,0.00044246326,0.00017684474,0.0005541833,0.0004986437,0.000104476705],"domain_scores_gemma":[0.9920294,0.0059601474,0.0001865425,0.0008623072,0.0008411069,0.00012058743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003943026,0.0011945689,0.0025897436,0.0025919606,0.0007620528,0.0031026716,0.0023976066,0.0019563735,0.003591375],"category_scores_gemma":[0.010824477,0.0010670801,0.0011879151,0.00487794,0.0013466259,0.007674208,0.0020207365,0.0027382828,0.0026679833],"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.000056275476,0.00014289925,0.0029733225,0.0015561876,0.000079684825,0.00004174384,0.00017210675,0.0070454394,0.00071514625,0.06641752,0.007431623,0.91336817],"study_design_scores_gemma":[0.000079203775,0.0005243714,0.00648793,0.0018011263,0.00033573376,0.0017360101,0.00046267602,0.15434675,0.0068258033,0.4323143,0.3949212,0.00016484264],"about_ca_topic_score_codex":0.0016237498,"about_ca_topic_score_gemma":0.0014875443,"teacher_disagreement_score":0.003943026,"about_ca_system_score_codex":0.00096998713,"about_ca_system_score_gemma":0.0014545082,"threshold_uncertainty_score":0.020852983},"labels":[],"label_agreement":null},{"id":"W1985833509","doi":"10.1089/cmb.2010.0123","title":"Finding Nearly Optimal GDT Scores","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Institute of General Medical Sciences; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computation; Conjecture; Heuristic; Mathematics; Algorithm; Statistics; Combinatorics; Set (abstract data type); Computer science; Mathematical optimization","score_opus":0.0318057403196908,"score_gpt":0.28878150794754465,"score_spread":0.25697576762785385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985833509","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.3560329,0.0013868299,0.62219536,0.0010643693,0.00017486363,0.00021968443,0.0023769503,0.007480662,0.0090684155],"genre_scores_gemma":[0.5531987,0.0002651087,0.43820897,0.0003555275,0.000056004734,0.00019375856,0.0052508325,0.0009265328,0.0015446417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960663,0.0007935733,0.00031856305,0.0010938817,0.0011555158,0.0005722442],"domain_scores_gemma":[0.9946473,0.00292426,0.00040292778,0.0008571038,0.0008416959,0.00032661873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034643074,0.0015138268,0.0023406735,0.004012408,0.0010331401,0.002094256,0.0019520192,0.0017255323,0.0039314856],"category_scores_gemma":[0.02013908,0.00078462856,0.0013289403,0.002414695,0.0017167347,0.0024949329,0.0027500207,0.0014043141,0.0017277013],"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.0014623747,0.00044366624,0.04239128,0.00079335086,0.00040192148,0.0010652749,0.00060725556,0.30831152,0.031307813,0.055208858,0.04327323,0.5147334],"study_design_scores_gemma":[0.0002515749,0.0002603496,0.0040333695,0.00005748661,0.00008411055,0.0005940407,0.0002931444,0.8942481,0.010086993,0.08418539,0.00584005,0.000065449414],"about_ca_topic_score_codex":0.0018625453,"about_ca_topic_score_gemma":0.0021193044,"teacher_disagreement_score":0.004012408,"about_ca_system_score_codex":0.0014819313,"about_ca_system_score_gemma":0.0025815242,"threshold_uncertainty_score":0.018321276},"labels":[],"label_agreement":null},{"id":"W1986143062","doi":"10.1142/9789812791962_0010","title":"INTEGER ROOTS FOR INTEGER-POWER-CONTENT CALCULATIONS","year":2000,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Western University","funders":"","keywords":"Integer (computer science); Power (physics); Integer programming; Branch and price; Mathematics; Content (measure theory); Radical of an integer; Computer science; Discrete mathematics; Combinatorics; Mathematical optimization; Prime factor; Physics; Mathematical analysis; Prime (order theory)","score_opus":0.024315679734581784,"score_gpt":0.2678129440758994,"score_spread":0.2434972643413176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986143062","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.0067715473,0.00074430427,0.9523154,0.00034982004,0.0002738393,0.000048681963,0.00006548394,0.0018498033,0.03758111],"genre_scores_gemma":[0.24983943,0.001492581,0.714782,0.00046428936,0.00035463538,0.00018992623,0.00015976257,0.0020075757,0.030709809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934274,0.00015407061,0.000035226592,0.00008314823,0.00031621862,0.000068585556],"domain_scores_gemma":[0.99895823,0.0005272813,0.000082970844,0.00024702883,0.00015235748,0.000032101856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081063015,0.000744236,0.00049061014,0.0008645266,0.0006669238,0.001772741,0.0010463648,0.00051736046,0.024801617],"category_scores_gemma":[0.007136962,0.00026837946,0.0002938742,0.0010136608,0.0013777346,0.002931655,0.0014907825,0.0016961875,0.007072798],"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.00013377321,0.000035449957,0.000233026,0.00021387951,0.000007836528,0.00015630636,0.00024827642,0.017151956,0.0048296247,0.7757382,0.009513823,0.19173792],"study_design_scores_gemma":[0.000044773107,0.000056395926,0.0001063527,0.00013590296,0.000011265499,0.00015727071,0.000080080805,0.09211748,0.01088219,0.82231313,0.074065454,0.000029811301],"about_ca_topic_score_codex":0.0004020312,"about_ca_topic_score_gemma":0.0008621554,"teacher_disagreement_score":0.024801617,"about_ca_system_score_codex":0.0005947335,"about_ca_system_score_gemma":0.0005750692,"threshold_uncertainty_score":0.082969666},"labels":[],"label_agreement":null},{"id":"W1990785823","doi":"10.1016/s0304-3975(02)00086-5","title":"Approximation algorithms for NMR spectral peak assignment","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Bipartite graph; Matching (statistics); Disjoint sets; Combinatorics; Approximation algorithm; Mathematics; Algorithm; Set (abstract data type); Blossom algorithm; Computer science; Graph","score_opus":0.012902715873872492,"score_gpt":0.2668682977720276,"score_spread":0.2539655818981551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990785823","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.00408347,0.0006241286,0.9923563,0.00034234996,0.00008342828,0.00005689021,0.00015178524,0.0009714685,0.0013301253],"genre_scores_gemma":[0.11616093,0.0011309788,0.8742429,0.00034841913,0.00027950536,0.0005280835,0.0014766726,0.0005845499,0.005248001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974649,0.0009368236,0.00015291403,0.00047256332,0.00067442295,0.00029839575],"domain_scores_gemma":[0.9882714,0.00795028,0.00061414,0.0017817619,0.0010142796,0.00036808554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040147905,0.0022646247,0.0031181166,0.0024821998,0.0013934518,0.00335672,0.0056118453,0.00323487,0.010575347],"category_scores_gemma":[0.024255548,0.0013546481,0.0017334875,0.0047501996,0.0019380335,0.005221582,0.0037401149,0.004871766,0.0039723264],"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.0007871964,0.00034023347,0.00094622624,0.00046332707,0.00012529179,0.000083726125,0.00021127258,0.46521,0.0016379363,0.08183164,0.01821834,0.4301448],"study_design_scores_gemma":[0.000079596844,0.000033574812,0.000112793496,0.000025489859,0.000026306016,0.000044460314,0.00003748514,0.89219695,0.0005338844,0.10509065,0.0018057727,0.000013011944],"about_ca_topic_score_codex":0.006232948,"about_ca_topic_score_gemma":0.00554351,"teacher_disagreement_score":0.010575347,"about_ca_system_score_codex":0.0030102131,"about_ca_system_score_gemma":0.00312006,"threshold_uncertainty_score":0.0353781},"labels":[],"label_agreement":null},{"id":"W1990948892","doi":"10.1016/j.jcss.2007.04.011","title":"The complexity of properly learning simple concept classes","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Hypergraph; Intersection (aeronautics); Simple (philosophy); Constant (computer programming); DTIME; Time complexity; Upper and lower bounds; Discrete mathematics; Running time; Graph; Turing machine; Computer science; Algorithm","score_opus":0.03143958742733738,"score_gpt":0.2867763757400699,"score_spread":0.25533678831273254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990948892","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.36850286,0.0017029387,0.6009161,0.011001612,0.00022647728,0.00022344138,0.0016704125,0.0007656938,0.014990445],"genre_scores_gemma":[0.87415177,0.0009502944,0.11593646,0.0007196647,0.00045329565,0.00033533282,0.0020205823,0.00021097102,0.0052215653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931933,0.0020427597,0.0007192122,0.0013421476,0.002361706,0.00034080914],"domain_scores_gemma":[0.88483495,0.10445518,0.002469108,0.004995266,0.0020984083,0.0011470915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045364224,0.00076877483,0.00158653,0.001066251,0.0012031754,0.0051361355,0.0027167676,0.0026613835,0.00934736],"category_scores_gemma":[0.07747123,0.0011434965,0.0018700438,0.001627962,0.0035390514,0.01863404,0.0052484474,0.004947049,0.00086933136],"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.0015953236,0.00039461127,0.011397782,0.0010697431,0.00033326604,0.00054014236,0.0017034825,0.14925526,0.004611459,0.601922,0.012312881,0.21486412],"study_design_scores_gemma":[0.0000716391,0.00005213506,0.0010248361,0.000025394475,0.000036759233,0.00015122625,0.00012806333,0.21803941,0.00080661854,0.7784336,0.0012043755,0.000025863572],"about_ca_topic_score_codex":0.002037497,"about_ca_topic_score_gemma":0.0017615736,"teacher_disagreement_score":0.00934736,"about_ca_system_score_codex":0.0021445274,"about_ca_system_score_gemma":0.0017085245,"threshold_uncertainty_score":0.031270027},"labels":[],"label_agreement":null},{"id":"W1995349519","doi":"10.1109/tnn.2003.810608","title":"Bias learning, knowledge sharing","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":45,"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 Montréal","funders":"","keywords":"Computer science; Generalization; Artificial intelligence; Machine learning; Inductive bias; Class (philosophy); Multi-task learning; Domain (mathematical analysis); Space (punctuation); Domain knowledge; Variety (cybernetics); Task (project management); Mathematics","score_opus":0.027695966266377804,"score_gpt":0.26385655350726067,"score_spread":0.23616058724088287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995349519","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.025654156,0.0034369393,0.95986086,0.0017915149,0.00015561603,0.0002511174,0.00019863811,0.0010101085,0.0076410486],"genre_scores_gemma":[0.68957454,0.0029087388,0.29564902,0.0010554477,0.00060325925,0.0009147538,0.0007157939,0.00028348956,0.008294962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917441,0.0038710455,0.00036419858,0.0018887346,0.0017564218,0.00037534971],"domain_scores_gemma":[0.9721196,0.015324573,0.002131585,0.007470756,0.0023169182,0.0006364954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011099946,0.001426588,0.0019521002,0.001840462,0.001350639,0.002976061,0.0029963467,0.0030569548,0.004854894],"category_scores_gemma":[0.055887327,0.0006043579,0.0010720519,0.0023159888,0.0033466665,0.0075759827,0.0058764904,0.0024238233,0.0019204115],"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.0005807933,0.00039899643,0.005247223,0.0007811527,0.0004468935,0.000246683,0.0006403848,0.13923468,0.004580093,0.22279826,0.008715311,0.61632955],"study_design_scores_gemma":[0.00010528736,0.00019756731,0.0010526583,0.00010532522,0.00009492419,0.00027066385,0.00010601594,0.30884826,0.004568281,0.67491907,0.009682346,0.000049546714],"about_ca_topic_score_codex":0.001624909,"about_ca_topic_score_gemma":0.0011227684,"teacher_disagreement_score":0.011099946,"about_ca_system_score_codex":0.0020127515,"about_ca_system_score_gemma":0.0021531938,"threshold_uncertainty_score":0.058702826},"labels":[],"label_agreement":null},{"id":"W1999359581","doi":"10.3166/ria.20.775-804","title":"Learning Recursive Automata from Positive Examples","year":2006,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Automaton; Theoretical computer science; Artificial intelligence","score_opus":0.029038296382250986,"score_gpt":0.2671320696690187,"score_spread":0.23809377328676773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999359581","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.09195415,0.0003068862,0.9016711,0.00043752973,0.0000653525,0.000048743375,0.00015082503,0.001008444,0.004356954],"genre_scores_gemma":[0.7418027,0.00034442602,0.25373003,0.00026448714,0.00007984356,0.0001189129,0.00058020186,0.0001627006,0.0029167442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988888,0.00048409,0.000057648493,0.00026666716,0.00025406227,0.00004875372],"domain_scores_gemma":[0.9932777,0.005164507,0.00024314782,0.0008293891,0.00041072012,0.000074527044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012646219,0.00040357464,0.0005200025,0.0006511553,0.00031965767,0.0009018738,0.0010407462,0.0007420806,0.002478131],"category_scores_gemma":[0.0131771825,0.00026054366,0.00070010667,0.00040358154,0.0013729995,0.0032707788,0.0011791802,0.0011721641,0.0006135815],"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.00019985528,0.00012468609,0.005343136,0.0005396669,0.00011128928,0.00055018434,0.0010538389,0.20307928,0.012199901,0.4254443,0.003954254,0.34739965],"study_design_scores_gemma":[0.000013178443,0.000053659318,0.000430793,0.00004246348,0.000022627499,0.0001519161,0.00009779924,0.53302,0.0044672303,0.45829287,0.0033864642,0.000021032496],"about_ca_topic_score_codex":0.00056396256,"about_ca_topic_score_gemma":0.001146219,"teacher_disagreement_score":0.002478131,"about_ca_system_score_codex":0.00042310238,"about_ca_system_score_gemma":0.00034648392,"threshold_uncertainty_score":0.008290172},"labels":[],"label_agreement":null},{"id":"W1999376700","doi":"10.1016/j.tcs.2012.10.013","title":"Tighter PAC-Bayes bounds through distribution-dependent priors","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Prior probability; Bayes' theorem; Mathematics; Reproducing kernel Hilbert space; Regularization (linguistics); Mathematical optimization; Applied mathematics; Exponential family; Algorithm; Class (philosophy); Function (biology); Distribution (mathematics); Computer science; Hilbert space; Artificial intelligence; Bayesian probability; Statistics; Mathematical analysis","score_opus":0.0075164416669550324,"score_gpt":0.2596614497271334,"score_spread":0.25214500806017837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999376700","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.008352932,0.005144183,0.9587742,0.0047191097,0.0005491191,0.00008820871,0.0004673567,0.000852181,0.021052675],"genre_scores_gemma":[0.42637476,0.008062733,0.5233052,0.00744865,0.0035548077,0.0009455394,0.002078983,0.0026565855,0.02557284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9804388,0.008498205,0.00070617435,0.0028438426,0.0058399434,0.0016730241],"domain_scores_gemma":[0.88854456,0.094004236,0.0021465956,0.009916694,0.0037879748,0.0015998201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024428647,0.004749354,0.0058899214,0.003936542,0.0030810605,0.008727347,0.006537524,0.0057068327,0.015901884],"category_scores_gemma":[0.13431431,0.004338477,0.0028482976,0.0047369264,0.007082033,0.023961946,0.011117729,0.01905622,0.004234355],"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.00058633665,0.00023290412,0.0012488193,0.00048728095,0.00020280342,0.00020791194,0.00037030788,0.14784627,0.0012673808,0.7673877,0.017876763,0.06228544],"study_design_scores_gemma":[0.000048212914,0.000025582887,0.00017641002,0.00010319535,0.000045384586,0.00008545606,0.000030641786,0.20869029,0.00055221346,0.7875804,0.0026323763,0.00002997053],"about_ca_topic_score_codex":0.0042838734,"about_ca_topic_score_gemma":0.007330006,"teacher_disagreement_score":0.024428647,"about_ca_system_score_codex":0.0062134876,"about_ca_system_score_gemma":0.0059629283,"threshold_uncertainty_score":0.12919259},"labels":[],"label_agreement":null},{"id":"W2001622826","doi":"10.1109/ciss.2013.6552253","title":"Active learning of multiple source multiple destination topologies","year":2013,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"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":"Merge (version control); Subnetwork; Computer science; Network topology; Topology (electrical circuits); Upper and lower bounds; Focus (optics); Greedy algorithm; Algorithm; Theoretical computer science; Combinatorics; Mathematics; Computer network; Physics","score_opus":0.011188860004621376,"score_gpt":0.23576215575322979,"score_spread":0.2245732957486084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001622826","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.052433904,0.00044088572,0.9440805,0.0006460894,0.00006057923,0.00006565918,0.00023320287,0.00057057466,0.0014686425],"genre_scores_gemma":[0.8209567,0.0003736275,0.17371023,0.0002382752,0.00014609726,0.00017853665,0.00071767846,0.000091206384,0.003587573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987551,0.0004627004,0.000050927705,0.0003500941,0.00025250614,0.00012857036],"domain_scores_gemma":[0.9909018,0.0070011606,0.0006845008,0.0005565379,0.000553311,0.0003026915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027213504,0.0010964919,0.0016840134,0.0013982242,0.00075354415,0.0018123172,0.0036553564,0.0023083724,0.0014582229],"category_scores_gemma":[0.010587004,0.0009663809,0.0010932841,0.0017260293,0.0012139636,0.0047739195,0.0019833662,0.002506599,0.00035204305],"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.00017888292,0.000060356782,0.0016715995,0.00005725987,0.000045307086,0.00015576385,0.00010199658,0.9572578,0.0008275593,0.007934674,0.00066634145,0.031042438],"study_design_scores_gemma":[0.0000045037955,0.000008398565,0.00008418624,0.00000286598,0.000003066364,0.0000118109165,0.000011560148,0.9935737,0.00025107234,0.005897273,0.00014903561,0.0000026305406],"about_ca_topic_score_codex":0.0031105576,"about_ca_topic_score_gemma":0.003381766,"teacher_disagreement_score":0.0036553564,"about_ca_system_score_codex":0.0013965679,"about_ca_system_score_gemma":0.00065084134,"threshold_uncertainty_score":0.014392078},"labels":[],"label_agreement":null},{"id":"W2008727473","doi":"10.1109/icmla.2011.88","title":"Learning with Guaranteed Label Quality","year":2011,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Western University","funders":"","keywords":"Computer science; Noise (video); Artificial intelligence; Quality (philosophy); Machine learning; Instance-based learning; Supervised learning; Active learning (machine learning); Certainty; Unsupervised learning; Semi-supervised learning; Mathematics; Artificial neural network","score_opus":0.04140024751138482,"score_gpt":0.2734888507921342,"score_spread":0.23208860328074937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008727473","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.017162548,0.0004162843,0.97887224,0.0007062954,0.00004887706,0.000076703254,0.00012884173,0.0012716342,0.0013166248],"genre_scores_gemma":[0.612146,0.0004396724,0.38251045,0.0009204664,0.00035708793,0.0002597308,0.0007787514,0.00030199555,0.002285911],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99044585,0.0032413318,0.0007415959,0.0023895388,0.0026325013,0.00054911396],"domain_scores_gemma":[0.96627164,0.020394463,0.0023976879,0.005980222,0.003991439,0.0009646671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008880579,0.0013125108,0.0027349321,0.0014596852,0.0012071655,0.0035611093,0.0034515467,0.003922067,0.002060701],"category_scores_gemma":[0.059028193,0.0006879282,0.0010569632,0.001815975,0.0031604609,0.007329176,0.005622838,0.0046462785,0.0011809764],"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.0015815898,0.0003820708,0.0064699827,0.0006886601,0.00015244947,0.00021510123,0.00058872544,0.3358369,0.007264657,0.18066448,0.011577302,0.45457816],"study_design_scores_gemma":[0.00015937696,0.00019171363,0.00035201357,0.000037700356,0.000022139067,0.00013177969,0.000047503618,0.87943846,0.0042966744,0.113273814,0.0020160947,0.000032750548],"about_ca_topic_score_codex":0.0017656005,"about_ca_topic_score_gemma":0.0011294031,"teacher_disagreement_score":0.008880579,"about_ca_system_score_codex":0.0015910577,"about_ca_system_score_gemma":0.0023962008,"threshold_uncertainty_score":0.0469656},"labels":[],"label_agreement":null},{"id":"W2013029345","doi":"10.1007/s10994-009-5137-3","title":"Learning the set covering machine by bound minimization and margin-sparsity trade-off","year":2009,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"VC dimension; Classifier (UML); Margin (machine learning); Computer science; Minification; Upper and lower bounds; Artificial intelligence; Machine learning; Dimension (graph theory); Algorithm; Structural risk minimization; Mathematics; Mathematical optimization; Support vector machine; Combinatorics","score_opus":0.007079538754920486,"score_gpt":0.22503493450158998,"score_spread":0.2179553957466695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013029345","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.040941842,0.0013594801,0.95135427,0.0017402448,0.000103851795,0.00006214026,0.0002249525,0.00051692786,0.0036962465],"genre_scores_gemma":[0.6051638,0.0015108375,0.38208827,0.00088586274,0.00070341484,0.0004435352,0.0014501349,0.0007751652,0.006978883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968485,0.0017675677,0.000119300865,0.00046983335,0.0005784165,0.00021635192],"domain_scores_gemma":[0.9796618,0.016548835,0.00074855506,0.001619209,0.000857901,0.0005636451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046707853,0.0015498048,0.004286618,0.0016425351,0.0009806392,0.0025362521,0.00312597,0.0041488926,0.004208766],"category_scores_gemma":[0.030311609,0.0013788805,0.0012812446,0.0025985613,0.00251898,0.0066158567,0.0042145234,0.0033752373,0.0008752925],"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.00046390083,0.00023392784,0.0018473142,0.0003552908,0.00014305777,0.00012352303,0.00019448268,0.725378,0.001798129,0.11245103,0.01439516,0.1426162],"study_design_scores_gemma":[0.000019567502,0.000039147155,0.0001343626,0.000018966704,0.000009681602,0.000036478585,0.000012404008,0.9155765,0.00031992767,0.083362356,0.0004616033,0.0000091319525],"about_ca_topic_score_codex":0.0011772498,"about_ca_topic_score_gemma":0.0011289283,"teacher_disagreement_score":0.0046707853,"about_ca_system_score_codex":0.0014368081,"about_ca_system_score_gemma":0.0010174637,"threshold_uncertainty_score":0.024701774},"labels":[],"label_agreement":null},{"id":"W2016687122","doi":"10.1007/s00224-013-9488-6","title":"Learning Read-Constant Polynomials of Constant Degree Modulo Composites","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Constant (computer programming); Mathematics; Monomial; Degree (music); Modulo; Polynomial; Discrete mathematics; Combinatorics; Computer science; Mathematical analysis","score_opus":0.016115388889490833,"score_gpt":0.2364751190193163,"score_spread":0.2203597301298255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016687122","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.32346547,0.00094276713,0.6376744,0.002422075,0.00037784877,0.00010086302,0.00053655636,0.0026648415,0.031815253],"genre_scores_gemma":[0.9159581,0.00037278922,0.070646554,0.0003177596,0.00036562173,0.000043621025,0.00064121047,0.00032065768,0.011333814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988507,0.00020216935,0.00004506244,0.00040939002,0.00028803144,0.00020466662],"domain_scores_gemma":[0.9942919,0.003160003,0.00038892284,0.0011862778,0.0006360915,0.0003368181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063828,0.0006801614,0.00077586295,0.0008085169,0.00090685557,0.0023411592,0.0011128904,0.00086743245,0.010332306],"category_scores_gemma":[0.01274592,0.00040478908,0.0007367584,0.000905654,0.002176112,0.0053250375,0.0021005294,0.0031397392,0.0021166832],"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.00073591626,0.00020469772,0.0044092154,0.00036698004,0.000056274162,0.0003106778,0.0008544059,0.02856538,0.009699298,0.754206,0.0103042945,0.19028682],"study_design_scores_gemma":[0.000054844128,0.00008263371,0.0006299981,0.000042237825,0.000030248517,0.00014638217,0.00020708975,0.065974444,0.0047268975,0.9224113,0.005670167,0.00002380357],"about_ca_topic_score_codex":0.0008203627,"about_ca_topic_score_gemma":0.0012886635,"teacher_disagreement_score":0.010332306,"about_ca_system_score_codex":0.0010301184,"about_ca_system_score_gemma":0.000945975,"threshold_uncertainty_score":0.03456503},"labels":[],"label_agreement":null},{"id":"W2023453328","doi":"10.1145/1401890.1401950","title":"Active learning with direct query construction","year":2008,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Active learning (machine learning); Computer science; Machine learning; Semi-supervised learning; Decision tree; Artificial intelligence; Process (computing); Construct (python library); Tree (set theory); Labeled data; Instance-based learning; ID3 algorithm; Incremental decision tree; Decision tree learning; Mathematics","score_opus":0.006472633424440829,"score_gpt":0.19929036422178337,"score_spread":0.19281773079734255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023453328","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.0029059951,0.00019613745,0.9948196,0.0003199437,0.0000290329,0.00008563408,0.00004951372,0.00046789568,0.0011263082],"genre_scores_gemma":[0.2937302,0.00053193636,0.69603544,0.00075185724,0.0002769535,0.0010140383,0.000643059,0.0002928302,0.0067237318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99338645,0.003460627,0.00035868114,0.0011379638,0.0013286317,0.00032760916],"domain_scores_gemma":[0.9824378,0.0119389575,0.00049398484,0.0033225548,0.0014758118,0.0003309513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007266206,0.0012430252,0.0021465344,0.0010302102,0.0010123241,0.0030390413,0.0049263425,0.002918059,0.0056819376],"category_scores_gemma":[0.026937189,0.00096683676,0.0013651347,0.0016039807,0.0025097008,0.008924836,0.0048913066,0.004072195,0.0015675401],"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.0006410769,0.0004530439,0.0017298753,0.00047583826,0.00011850081,0.0002273334,0.0009413169,0.2523393,0.0045751673,0.32134417,0.014581036,0.4025733],"study_design_scores_gemma":[0.00006751578,0.000080002144,0.0000686587,0.000018020775,0.00001860351,0.00008463612,0.000051061565,0.88987684,0.0026537993,0.10205669,0.005009339,0.000014794069],"about_ca_topic_score_codex":0.0014312194,"about_ca_topic_score_gemma":0.0015332244,"teacher_disagreement_score":0.007266206,"about_ca_system_score_codex":0.0012300184,"about_ca_system_score_gemma":0.0017584488,"threshold_uncertainty_score":0.03842783},"labels":[],"label_agreement":null},{"id":"W2023517821","doi":"10.1007/s10845-009-0351-1","title":"Rogue components: their effect and control using logical analysis of data","year":2009,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Scope (computer science); Asset (computer security); Component (thermodynamics); Population; Process (computing); Engineering; Operations research; Risk analysis (engineering); Selection (genetic algorithm); Computer science; Asset management; Reliability engineering; Computer security; Artificial intelligence; Business","score_opus":0.042723214024488726,"score_gpt":0.3066010491594813,"score_spread":0.2638778351349925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023517821","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.34194213,0.00045598915,0.65354455,0.00026769048,0.0001519361,0.0001235577,0.000117860334,0.0015332634,0.0018630314],"genre_scores_gemma":[0.9446552,0.00014050922,0.054137487,0.00004656391,0.000047699246,0.000037874386,0.000076656266,0.00012928019,0.00072857237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997288,0.0006760351,0.00018893891,0.0006182786,0.000997431,0.00023129725],"domain_scores_gemma":[0.97989345,0.013002907,0.0018112216,0.0027391033,0.0021779684,0.00037545562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003922527,0.0006657762,0.0010395343,0.0019217968,0.0007957523,0.0029017462,0.0013113081,0.000762783,0.0018930403],"category_scores_gemma":[0.020532593,0.00054745714,0.0007241892,0.0011793706,0.0018082882,0.0030914168,0.0014976748,0.0010247256,0.0002999962],"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.0062585236,0.0008674473,0.049923528,0.0005994438,0.0005313351,0.0011740391,0.0014382802,0.29490235,0.14906758,0.049689084,0.0020064753,0.44354197],"study_design_scores_gemma":[0.00006280977,0.0006361388,0.008365528,0.00002720126,0.00019131752,0.00024909046,0.000252995,0.9336415,0.04426985,0.010608645,0.0016204353,0.00007447039],"about_ca_topic_score_codex":0.0015550554,"about_ca_topic_score_gemma":0.0013133798,"teacher_disagreement_score":0.003922527,"about_ca_system_score_codex":0.0006974466,"about_ca_system_score_gemma":0.0007980429,"threshold_uncertainty_score":0.020744503},"labels":[],"label_agreement":null},{"id":"W2024502076","doi":"10.1016/j.tcs.2008.02.030","title":"Learning indexed families of recursive languages from positive data: A survey","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Inductive reasoning; Recursion (computer science); Computer science; Decidability; Artificial intelligence; Computability theory; Naturalness; String (physics); Theoretical computer science; Natural language processing; Mathematics; Algorithm","score_opus":0.017941794120456118,"score_gpt":0.27954005080668504,"score_spread":0.26159825668622894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024502076","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03750618,0.041657135,0.90863883,0.004006153,0.0001407609,0.00014196464,0.001305602,0.0017238518,0.0048795906],"genre_scores_gemma":[0.3780954,0.06418295,0.53975654,0.0019572952,0.0017418426,0.0006320293,0.007956876,0.0010195419,0.0046575577],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9920522,0.0029813433,0.0008714498,0.0018031582,0.0020171662,0.0002746664],"domain_scores_gemma":[0.9262694,0.061649933,0.001886529,0.0063113025,0.0033006903,0.00058217545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012420188,0.0010234568,0.0026135724,0.0038675496,0.0010997101,0.0045094225,0.0043246346,0.0021170801,0.0031403229],"category_scores_gemma":[0.054231174,0.0013483295,0.0021363543,0.0056236004,0.0029871915,0.019482845,0.0040884074,0.0032369755,0.0014806187],"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.00026627508,0.00034500382,0.014290215,0.0021337853,0.00014903973,0.00014615926,0.00080809667,0.029861622,0.0017480991,0.15408882,0.009309815,0.786853],"study_design_scores_gemma":[0.00006706902,0.00035289797,0.002895933,0.00076531665,0.00009625058,0.0011192,0.00064839044,0.30961213,0.0032207323,0.6470532,0.034065116,0.00010368415],"about_ca_topic_score_codex":0.0010489783,"about_ca_topic_score_gemma":0.0013731545,"teacher_disagreement_score":0.012420188,"about_ca_system_score_codex":0.0016267262,"about_ca_system_score_gemma":0.0030706774,"threshold_uncertainty_score":0.065685034},"labels":[],"label_agreement":null},{"id":"W2024781872","doi":"10.1145/1798596.1798606","title":"Adaptive sampling strategies for quickselects","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Seventh Framework Programme; Consejo Superior de Investigaciones Científicas; Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Mathematics; Rank (graph theory); Generalization; Statistics; Interval (graph theory); Sample (material); Range (aeronautics); Combinatorics; Relative value; Sample size determination; Value (mathematics); Sampling (signal processing); Computer science; Economics","score_opus":0.031082135522389722,"score_gpt":0.3020420511231188,"score_spread":0.27095991560072913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024781872","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.090229616,0.00075595995,0.89783615,0.0006106268,0.00012121197,0.0004758978,0.0004554238,0.0021922889,0.0073228837],"genre_scores_gemma":[0.5130068,0.00019421641,0.47853404,0.00056481705,0.00008819684,0.0007457092,0.00077658263,0.00043593883,0.005653804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602,0.0016084231,0.0002391671,0.0007406688,0.0009653511,0.00042648872],"domain_scores_gemma":[0.9847002,0.010086848,0.0007413724,0.002625048,0.001249171,0.0005973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062387483,0.0010162145,0.0017016901,0.0015434698,0.0011608419,0.0019694862,0.0040934333,0.0019859304,0.011006426],"category_scores_gemma":[0.03066107,0.0006965021,0.0010087605,0.0014843104,0.0015700811,0.0033581485,0.0029432229,0.0017030361,0.0018022174],"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.0027276643,0.0006311678,0.0091991285,0.0005145442,0.00026179908,0.00030458125,0.000749351,0.3405752,0.0097127,0.17434533,0.015211758,0.44576684],"study_design_scores_gemma":[0.000279071,0.0003731229,0.00068661384,0.00006304615,0.000047299876,0.00019497111,0.00016606868,0.87898827,0.004597408,0.10840987,0.006149554,0.00004462914],"about_ca_topic_score_codex":0.0023063088,"about_ca_topic_score_gemma":0.0036782555,"teacher_disagreement_score":0.011006426,"about_ca_system_score_codex":0.0014812922,"about_ca_system_score_gemma":0.0026957993,"threshold_uncertainty_score":0.036820114},"labels":[],"label_agreement":null},{"id":"W2025257504","doi":"10.1109/icaie.2010.5641154","title":"Self-Directed Learner","year":2010,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Artificial intelligence; Exploit; Process (computing); Sequence (biology); Machine learning; Simple (philosophy); Instance-based learning; Autodidacticism; Active learning (machine learning); Mathematics education; Programming language; Mathematics","score_opus":0.003979150360754122,"score_gpt":0.22430841374456884,"score_spread":0.2203292633838147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025257504","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008214544,0.00030373503,0.98458743,0.00036265736,0.000083644234,0.000155072,0.00012997728,0.0010794165,0.005083653],"genre_scores_gemma":[0.34243512,0.00072476966,0.64124453,0.001123079,0.0001798922,0.00079746754,0.00083985034,0.00019122162,0.012463961],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985172,0.0006441634,0.000062266925,0.00030013316,0.00041801186,0.00005821288],"domain_scores_gemma":[0.9959383,0.0022329348,0.00016852334,0.0007259843,0.0007565106,0.00017783782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002838582,0.0007651665,0.0008403631,0.00057960924,0.00043099566,0.0009173384,0.0024848497,0.0011436592,0.0033793128],"category_scores_gemma":[0.007973008,0.0002974762,0.00057905674,0.00048994255,0.0007624559,0.0016867323,0.0015027504,0.0015091031,0.0018801902],"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.00029566803,0.0006277968,0.0045413263,0.00046270396,0.0002548035,0.00022916237,0.00039134515,0.1940723,0.004772825,0.1041231,0.030280273,0.6599487],"study_design_scores_gemma":[0.00008677642,0.00017316126,0.000229856,0.00004317775,0.00003477937,0.00016435231,0.00004667653,0.9179519,0.004730258,0.059286375,0.0172298,0.000022829347],"about_ca_topic_score_codex":0.00081947393,"about_ca_topic_score_gemma":0.0014433896,"teacher_disagreement_score":0.0033793128,"about_ca_system_score_codex":0.00047760314,"about_ca_system_score_gemma":0.0012640529,"threshold_uncertainty_score":0.015012026},"labels":[],"label_agreement":null},{"id":"W2026798797","doi":"10.1007/s10994-005-0464-5","title":"Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning","year":2005,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Learnability; Constraint (computer-aided design); Heuristic; Class (philosophy); Mathematics; Discrete mathematics; Boolean function; Combinatorics; Artificial intelligence; Computer science; Mathematical optimization","score_opus":0.01560519044351934,"score_gpt":0.25798942077620063,"score_spread":0.24238423033268128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026798797","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.0058840546,0.00034367375,0.9890752,0.0006092716,0.00006753189,0.000052658983,0.000048339745,0.00015688073,0.0037624459],"genre_scores_gemma":[0.38243678,0.0010520645,0.6034563,0.00041851588,0.00041894874,0.0006713562,0.00029136895,0.00064772094,0.010606922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97237587,0.019889647,0.00091720076,0.0019287801,0.00406115,0.00082735444],"domain_scores_gemma":[0.82345194,0.15540703,0.004288143,0.008716915,0.0066553904,0.0014805702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.038178634,0.0021418994,0.004571722,0.0026720974,0.0017984529,0.004081459,0.0048694964,0.0053212205,0.006695971],"category_scores_gemma":[0.1450115,0.0014051602,0.0014193165,0.0042163585,0.007187663,0.008157399,0.0054326006,0.0046510664,0.0015301906],"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.00019589231,0.000110396744,0.00072707137,0.00024357162,0.00007905539,0.00008743585,0.00029715942,0.3001067,0.00028108674,0.63097686,0.0045594936,0.062335156],"study_design_scores_gemma":[0.000030931176,0.000042320742,0.000087717126,0.000049499344,0.000014365523,0.00003951158,0.00003133837,0.43334544,0.000369781,0.5648978,0.0010714034,0.0000199206],"about_ca_topic_score_codex":0.0015356943,"about_ca_topic_score_gemma":0.0011730688,"teacher_disagreement_score":0.038178634,"about_ca_system_score_codex":0.0032008733,"about_ca_system_score_gemma":0.003367384,"threshold_uncertainty_score":0.20191038},"labels":[],"label_agreement":null},{"id":"W2027471805","doi":"10.1049/iet-spr.2012.0315","title":"Modified student's <i>t</i> ‐hidden Markov model for pattern recognition and classification","year":2013,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Hidden Markov model; Computer science; Pattern recognition (psychology); Artificial intelligence; Speech recognition; Markov model; Markov chain; Machine learning","score_opus":0.04534824788077283,"score_gpt":0.2844448863382583,"score_spread":0.2390966384574855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027471805","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.0035235516,0.0007052135,0.9943499,0.00019626354,0.000087258944,0.000026840387,0.000095297386,0.0003280664,0.000687639],"genre_scores_gemma":[0.4271577,0.0032449344,0.5539649,0.00046884245,0.00032067872,0.00045132387,0.0014608293,0.0002549016,0.012675844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989403,0.00039997674,0.000069662274,0.0002276049,0.00026571623,0.00009675155],"domain_scores_gemma":[0.99877864,0.0007009277,0.00012133168,0.00015872305,0.00020538447,0.000035035282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00172991,0.0008511684,0.0010412957,0.00086505443,0.00042063274,0.0010400495,0.0022422376,0.0016244774,0.0028035787],"category_scores_gemma":[0.004107155,0.0004844033,0.0017544084,0.0015250338,0.0007422836,0.0014192963,0.00088060286,0.001992193,0.0013204418],"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.00026559958,0.00012267381,0.003005139,0.00031174696,0.000290625,0.00028033115,0.00018149597,0.53218955,0.0073915944,0.10133076,0.008558633,0.34607187],"study_design_scores_gemma":[0.0000049131186,0.000022007125,0.0002492991,0.000009581532,0.000015636822,0.00003876301,0.000006230923,0.98425496,0.00070182007,0.012976203,0.0017059442,0.000014552995],"about_ca_topic_score_codex":0.0069275936,"about_ca_topic_score_gemma":0.0060975016,"teacher_disagreement_score":0.0069275936,"about_ca_system_score_codex":0.0010234022,"about_ca_system_score_gemma":0.0013505316,"threshold_uncertainty_score":0.013774514},"labels":[],"label_agreement":null},{"id":"W2028077146","doi":"10.1016/j.tcs.2007.03.039","title":"Learning intersection-closed classes with signatures","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Intersection (aeronautics); Equivalence (formal languages); Signature (topology); Mathematics; Theoretical computer science; Algebraic number; Invariant (physics); Scheme (mathematics); Concept class; Algebra over a field; Computer science; Discrete mathematics; Algorithm; Pure mathematics","score_opus":0.004030657338007537,"score_gpt":0.2408022262372431,"score_spread":0.23677156889923556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028077146","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.05758072,0.00067364064,0.93177086,0.0011802248,0.000119235876,0.00008310767,0.0005107121,0.002257591,0.005823945],"genre_scores_gemma":[0.6317725,0.000758431,0.35504338,0.00052982476,0.00040970193,0.0002956468,0.0038588436,0.0008296801,0.00650193],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921923,0.0019045803,0.0007094987,0.002306323,0.0022256416,0.00066162576],"domain_scores_gemma":[0.9776225,0.01411212,0.0012386569,0.0042306776,0.0019883492,0.00080774847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005034991,0.0010310865,0.0024492107,0.0027544298,0.0019623253,0.0064285775,0.0039668023,0.0023252433,0.0064048585],"category_scores_gemma":[0.03207912,0.0013011062,0.0023040508,0.0035488901,0.0034398853,0.024983078,0.0088542355,0.0072021293,0.0018806771],"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.0012790823,0.00051065936,0.009736099,0.00053206226,0.00020128737,0.00019235259,0.001216776,0.040028114,0.002948515,0.4364576,0.01607841,0.49081904],"study_design_scores_gemma":[0.000045204426,0.00006643144,0.00038160433,0.000055707602,0.000039845698,0.00016291601,0.00025061882,0.16655944,0.002423256,0.824836,0.0051507675,0.000028104632],"about_ca_topic_score_codex":0.0010242854,"about_ca_topic_score_gemma":0.0011694529,"teacher_disagreement_score":0.0064285775,"about_ca_system_score_codex":0.0017908888,"about_ca_system_score_gemma":0.0021723383,"threshold_uncertainty_score":0.026627958},"labels":[],"label_agreement":null},{"id":"W2028368516","doi":"10.1007/s00037-014-0091-2","title":"The complexity of estimating min-entropy","year":2014,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Logarithm; Entropy (arrow of time); Discrete mathematics; Markov chain; Sample complexity; Combinatorics; Computer science; Statistics; Mathematical analysis","score_opus":0.04906858431237536,"score_gpt":0.29609605101110653,"score_spread":0.24702746669873116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028368516","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.061407525,0.0028126026,0.9210568,0.005048866,0.00032008442,0.00007088943,0.00084016024,0.0006052382,0.007837804],"genre_scores_gemma":[0.6995602,0.0025745407,0.28694528,0.00072382623,0.0013944034,0.00027877936,0.0019031392,0.0006086802,0.0060111317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99103326,0.0045320904,0.0005052088,0.0011515722,0.0023697263,0.00040816638],"domain_scores_gemma":[0.88870764,0.09919789,0.0017223321,0.006686874,0.003004859,0.0006804491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076219817,0.0009980976,0.0019498912,0.0018872926,0.001071884,0.0051656943,0.0031022986,0.0017367433,0.006570191],"category_scores_gemma":[0.089261174,0.0009806938,0.00127255,0.0021970922,0.002888805,0.012635677,0.0040384093,0.0038132966,0.0010457026],"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.00075648655,0.00013724477,0.008013254,0.00077970175,0.00031838779,0.0003193839,0.00038101795,0.3268894,0.003377785,0.44200593,0.012787915,0.20423351],"study_design_scores_gemma":[0.000022370277,0.00003832602,0.0016497248,0.00004986975,0.00003199252,0.00015305704,0.000068168876,0.55728686,0.0013624579,0.43774557,0.001551597,0.00004005619],"about_ca_topic_score_codex":0.003101666,"about_ca_topic_score_gemma":0.0028407532,"teacher_disagreement_score":0.0076219817,"about_ca_system_score_codex":0.002684489,"about_ca_system_score_gemma":0.0022441158,"threshold_uncertainty_score":0.04030943},"labels":[],"label_agreement":null},{"id":"W2029731972","doi":"10.1016/j.tcs.2008.02.025","title":"Measuring teachability using variants of the teaching dimension","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dimension (graph theory); Monomial; Object (grammar); Mathematics education; Mathematics; Computer science; Teaching method; Theoretical computer science; Artificial intelligence; Discrete mathematics; Combinatorics","score_opus":0.025250209994526658,"score_gpt":0.25284650155929644,"score_spread":0.2275962915647698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029731972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95133513,0.00022270733,0.035135213,0.00017069765,0.00003022458,0.000108032444,0.0011514222,0.0002607472,0.011585792],"genre_scores_gemma":[0.9919843,0.000059357633,0.006553052,0.000014961901,0.000015182205,0.000086404885,0.00050817634,0.000029231413,0.00074934255],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556774,0.0011570983,0.0003880413,0.0007084451,0.0018321946,0.00034645153],"domain_scores_gemma":[0.9166445,0.06117635,0.0087666325,0.006029604,0.0039683473,0.0034145864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033919346,0.00045975792,0.0005738165,0.0034815676,0.00053606863,0.0026573187,0.00076838006,0.0011293493,0.0044435486],"category_scores_gemma":[0.043538086,0.00020562827,0.0007222236,0.003318907,0.0012274302,0.0032781574,0.0018090577,0.0013724458,0.000810417],"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.0011938522,0.0012404512,0.7767512,0.0003383481,0.00050397974,0.00008649143,0.0017497553,0.017207127,0.014457155,0.018596929,0.0012678414,0.16660675],"study_design_scores_gemma":[0.00009509876,0.0015650076,0.87981516,0.00006280167,0.00022853658,0.00022940502,0.0011626474,0.05248748,0.02017091,0.03964134,0.0043939203,0.0001478126],"about_ca_topic_score_codex":0.0016233086,"about_ca_topic_score_gemma":0.0019369407,"teacher_disagreement_score":0.0044435486,"about_ca_system_score_codex":0.0010878703,"about_ca_system_score_gemma":0.00081349333,"threshold_uncertainty_score":0.017938495},"labels":[],"label_agreement":null},{"id":"W2037646952","doi":"10.2316/journal.201.2007.1.201-1654","title":"ON THE SIMPLIFICATION OF AN EXAMPLES-BASED CONTROLLER WITH SUPPORT VECTOR MACHINES","year":2007,"lang":"en","type":"article","venue":"Control and Intelligent Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Support vector machine; Computer science; Controller (irrigation); Set (abstract data type); Data set; Data mining; Artificial intelligence; Machine learning","score_opus":0.014277466102956115,"score_gpt":0.24860022899581363,"score_spread":0.23432276289285753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037646952","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.020540351,0.0003242725,0.97391766,0.00015320294,0.000057939316,0.00010555253,0.000064669584,0.0011875833,0.0036487267],"genre_scores_gemma":[0.49513277,0.0005485193,0.49669456,0.000169059,0.000106235384,0.00031316152,0.00049789075,0.00020674377,0.0063310005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990313,0.00019275477,0.0000810839,0.00013601147,0.00050934794,0.000049464303],"domain_scores_gemma":[0.99766636,0.0013034027,0.00013616856,0.0004416446,0.00040644594,0.000046026915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009376911,0.000762594,0.0011765026,0.0005198501,0.0004712377,0.001028918,0.00090999756,0.0005693796,0.0033555834],"category_scores_gemma":[0.0050364453,0.00042302394,0.000668144,0.00048357103,0.00076989393,0.0013599459,0.00077725307,0.0019926557,0.0009497581],"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.00026174638,0.00009224888,0.00050287833,0.00017004232,0.000056581044,0.00016258511,0.00011163351,0.7076235,0.010769879,0.01769006,0.0016540666,0.2609048],"study_design_scores_gemma":[0.000014881744,0.00007839426,0.00018460877,0.000010264923,0.000010602104,0.000038698392,0.000007756798,0.98959494,0.0033321306,0.0038902445,0.002828954,0.000008568456],"about_ca_topic_score_codex":0.0061804214,"about_ca_topic_score_gemma":0.0048178025,"teacher_disagreement_score":0.0061804214,"about_ca_system_score_codex":0.00061534345,"about_ca_system_score_gemma":0.00074087933,"threshold_uncertainty_score":0.012288928},"labels":[],"label_agreement":null},{"id":"W2037750176","doi":"10.1016/j.ic.2012.07.001","title":"Automatic learning of subclasses of pattern languages","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Learnability; Class (philosophy); Alphabet; Computer science; Variable (mathematics); Abstract family of languages; Regular language; Constant (computer programming); Mathematics; Bounded function; Formal language; Discrete mathematics; Automaton; Artificial intelligence; Algorithm; Programming language; Second-generation programming language; Linguistics","score_opus":0.007190676344356576,"score_gpt":0.2644436623241567,"score_spread":0.2572529859798002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037750176","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.30621663,0.00087925926,0.6717965,0.0015215275,0.00016757495,0.00025722888,0.002351722,0.00817338,0.0086361235],"genre_scores_gemma":[0.71599275,0.0004070577,0.2707729,0.00038773118,0.00011880709,0.00021494912,0.0059921863,0.0010533874,0.005060273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883896,0.00024951153,0.00013406204,0.00040963554,0.00025959522,0.00010823737],"domain_scores_gemma":[0.9911712,0.0045166346,0.00057180645,0.0021007028,0.0012278651,0.00041182849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012352883,0.0005252496,0.0009756372,0.0020027624,0.00084285834,0.0019436069,0.0015887975,0.00094658084,0.003938964],"category_scores_gemma":[0.010080318,0.00078160287,0.001448003,0.0010831652,0.0008252469,0.005252472,0.0019514638,0.0023385799,0.00096868904],"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.000866498,0.0005143026,0.02871091,0.00080081687,0.0002135637,0.0007210161,0.000796436,0.021852087,0.03543212,0.11829561,0.023245787,0.7685509],"study_design_scores_gemma":[0.000085697786,0.00010449286,0.0044758697,0.00015089753,0.000091652546,0.0007426063,0.00041221845,0.6642105,0.016990092,0.30097973,0.011717902,0.00003836654],"about_ca_topic_score_codex":0.0014812188,"about_ca_topic_score_gemma":0.00377027,"teacher_disagreement_score":0.003938964,"about_ca_system_score_codex":0.0007882783,"about_ca_system_score_gemma":0.0011833964,"threshold_uncertainty_score":0.013177156},"labels":[],"label_agreement":null},{"id":"W2038878443","doi":"10.1016/s0304-3975(03)00422-5","title":"Finding hidden independent sets in interval graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"University of Waterloo","keywords":"Interval graph; Interval (graph theory); Set (abstract data type); Computer science; Graph; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics; Combinatorics; Chordal graph","score_opus":0.011004459878765176,"score_gpt":0.2695621984548484,"score_spread":0.2585577385760832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038878443","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.2590762,0.0007572423,0.7333488,0.00059594534,0.00007000132,0.00010531346,0.0006696049,0.00063780975,0.004739158],"genre_scores_gemma":[0.84698004,0.0006520783,0.1466171,0.00015405868,0.00016293145,0.00017945326,0.0017923102,0.00018317495,0.0032788368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862385,0.00038813567,0.00007912898,0.0004037083,0.000319587,0.0001855539],"domain_scores_gemma":[0.9731435,0.022050384,0.0018877267,0.0015709032,0.00069102447,0.00065647444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018166146,0.00097093615,0.0016877748,0.0021595522,0.0010399579,0.0025351718,0.0032840113,0.0015442792,0.0044527655],"category_scores_gemma":[0.01810997,0.001629966,0.0015952999,0.0021029157,0.0016222324,0.005461043,0.0019474493,0.0037965113,0.0005980896],"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.00228093,0.0009916448,0.020511707,0.0011306967,0.0006974765,0.0012558791,0.0018917944,0.30771422,0.010036044,0.42737192,0.00961332,0.21650444],"study_design_scores_gemma":[0.00009492882,0.00007937389,0.0017679607,0.000063599044,0.00011398184,0.00013052428,0.00015363406,0.42724654,0.0018617081,0.56764823,0.00081177027,0.000027761982],"about_ca_topic_score_codex":0.0008287375,"about_ca_topic_score_gemma":0.00092417555,"teacher_disagreement_score":0.0044527655,"about_ca_system_score_codex":0.00079114205,"about_ca_system_score_gemma":0.00057351333,"threshold_uncertainty_score":0.014895976},"labels":[],"label_agreement":null},{"id":"W2040852548","doi":"10.1007/s10994-007-5043-5","title":"A notion of task relatedness yielding provable multiple-task learning guarantees","year":2008,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Generalization; Multi-task learning; Computer science; Task (project management); Artificial intelligence; Similarity (geometry); Machine learning; Point (geometry); Domain (mathematical analysis); Variety (cybernetics); Theoretical computer science; Mathematics","score_opus":0.012613177219527812,"score_gpt":0.22340017247581537,"score_spread":0.21078699525628755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040852548","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.012857193,0.00070734427,0.9680093,0.0046120286,0.00034706556,0.00010230749,0.00038382434,0.0021583058,0.010822615],"genre_scores_gemma":[0.6339337,0.0010565288,0.34069738,0.0054650106,0.0024433234,0.0007939923,0.0014829856,0.0023880035,0.011738986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97740227,0.0069378917,0.0012371968,0.0055944957,0.0060827513,0.0027453087],"domain_scores_gemma":[0.8949858,0.061612926,0.0045863222,0.029020803,0.0051707374,0.0046233996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014633301,0.0031073417,0.0044423947,0.0018002146,0.004025043,0.00693081,0.010263713,0.008438602,0.010635252],"category_scores_gemma":[0.09412395,0.0027567097,0.003657799,0.0037666378,0.0071293055,0.026394073,0.021832354,0.021879684,0.0043120217],"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.0017999925,0.000676542,0.0012605612,0.0009137468,0.00022450362,0.00042993226,0.0007821655,0.07264912,0.0082403105,0.796269,0.029015912,0.08773822],"study_design_scores_gemma":[0.00010123356,0.0001069215,0.0001488294,0.000039200346,0.00005254358,0.00019084866,0.000049005812,0.10735889,0.0020390367,0.8871142,0.0027657854,0.000033408414],"about_ca_topic_score_codex":0.0007992115,"about_ca_topic_score_gemma":0.0011728276,"teacher_disagreement_score":0.014633301,"about_ca_system_score_codex":0.0026745088,"about_ca_system_score_gemma":0.0044289706,"threshold_uncertainty_score":0.07738918},"labels":[],"label_agreement":null},{"id":"W2041368329","doi":"10.1142/s0219720005001570","title":"HEURISTIC SEARCH IN CONSTRAINED BIPARTITE MATCHING WITH APPLICATIONS TO PROTEIN NMR BACKBONE RESONANCE ASSIGNMENT","year":2005,"lang":"en","type":"article","venue":"Journal of Bioinformatics and Computational Biology","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Matching (statistics); Heuristics; Assignment problem; Complete bipartite graph; Mathematics; Heuristic; Combinatorial optimization; Local search (optimization); Algorithm; Computer science; Graph; Mathematical optimization","score_opus":0.010647841950632267,"score_gpt":0.2710084611486648,"score_spread":0.2603606191980325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041368329","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.0196547,0.001231298,0.9723808,0.00044431473,0.000056842135,0.00011336051,0.00007916564,0.00041776703,0.0056217103],"genre_scores_gemma":[0.35335153,0.0010072095,0.6416661,0.00033212517,0.00008660967,0.00035822106,0.00021568323,0.00013244236,0.002850049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892956,0.000719833,0.000034103094,0.00011179276,0.00011777237,0.00008694406],"domain_scores_gemma":[0.99748707,0.0020917477,0.00014259017,0.00010200145,0.000112482296,0.000064109554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00175519,0.00070983986,0.0012452246,0.0010800215,0.0006899662,0.0008888291,0.0011347434,0.0012685227,0.0022482825],"category_scores_gemma":[0.0054283924,0.00047958968,0.000548934,0.0023620473,0.00096836797,0.0009075172,0.0009726773,0.000907174,0.00033097208],"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.00010528617,0.00011059358,0.00029514384,0.00012337463,0.000039736493,0.00007287383,0.000047259822,0.8916191,0.0007050041,0.046606787,0.0022982068,0.057976663],"study_design_scores_gemma":[0.000036463673,0.000034465444,0.000053562362,0.000009408787,0.000008125143,0.000029099225,0.000016185395,0.9659348,0.00031353103,0.03244242,0.0011158399,0.000006121218],"about_ca_topic_score_codex":0.004888972,"about_ca_topic_score_gemma":0.0040703793,"teacher_disagreement_score":0.004888972,"about_ca_system_score_codex":0.0010546292,"about_ca_system_score_gemma":0.0014790229,"threshold_uncertainty_score":0.009721041},"labels":[],"label_agreement":null},{"id":"W2041420888","doi":"10.2316/journal.201.2008.1.201-1679","title":"CONTROLLING MODEL TRUST WITH COMPACTLY SUPPORTED SMOOTH RBF","year":2008,"lang":"en","type":"article","venue":"Control and Intelligent Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Psychology","score_opus":0.0188074203328741,"score_gpt":0.2275509382975114,"score_spread":0.2087435179646373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041420888","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.019033516,0.000114965485,0.9799912,0.00011431269,0.000012825785,0.000010731665,0.0000106963425,0.0002703041,0.00044145947],"genre_scores_gemma":[0.86128134,0.00016299414,0.13718772,0.00006984812,0.00003326081,0.00006942985,0.000046141784,0.00010913052,0.001040147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782723,0.00083961466,0.00011989019,0.0003060029,0.0007165346,0.00019064515],"domain_scores_gemma":[0.9912549,0.0052447156,0.00116982,0.0012508725,0.0008467455,0.0002328868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004645048,0.001232172,0.0014842213,0.00060137635,0.00037933158,0.0016815877,0.0019113689,0.0023598087,0.00076365494],"category_scores_gemma":[0.020560674,0.0008590459,0.0009708571,0.0004583382,0.0020513593,0.0031141927,0.0034645414,0.0023893248,0.00031195904],"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.00018045581,0.000033752716,0.00030306034,0.00005571472,0.000034421413,0.000062234394,0.00012817129,0.95049393,0.0060327356,0.023972366,0.00029198662,0.01841119],"study_design_scores_gemma":[0.0000045696097,0.000017538048,0.000018944083,0.0000019548777,0.000002024336,0.0000053780605,0.0000019455506,0.9977945,0.0004258151,0.0016571281,0.000065965265,0.0000042185475],"about_ca_topic_score_codex":0.0029562383,"about_ca_topic_score_gemma":0.0015499598,"teacher_disagreement_score":0.004645048,"about_ca_system_score_codex":0.0011299143,"about_ca_system_score_gemma":0.0009808447,"threshold_uncertainty_score":0.024565637},"labels":[],"label_agreement":null},{"id":"W2043527421","doi":"10.1109/icsai.2012.6223045","title":"Active semi-supervised framework with data editing","year":2012,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Transportation of Ontario","funders":"National Natural Science Foundation of China","keywords":"Computer science; Labeled data; Semi-supervised learning; Artificial intelligence; Generalization; Machine learning; Noise (video); Supervised learning; Active learning (machine learning); Training set; Artificial neural network; Image (mathematics)","score_opus":0.02821335659739175,"score_gpt":0.28456746991498966,"score_spread":0.2563541133175979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043527421","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.0025573985,0.00005512858,0.99675626,0.00006568894,0.000013387917,0.00003557926,0.000024831532,0.00026785873,0.00022391023],"genre_scores_gemma":[0.29988235,0.0001737136,0.69600356,0.00029589582,0.00020867551,0.00054989685,0.0005174464,0.00020337164,0.0021650514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950245,0.002603818,0.00027881833,0.00095718075,0.0009692962,0.00016622856],"domain_scores_gemma":[0.98277456,0.010139594,0.0013113241,0.0029065413,0.0024981513,0.0003698973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071454234,0.0013885114,0.0019199325,0.0013574989,0.00068560144,0.0015591489,0.0040349644,0.0019970255,0.00156732],"category_scores_gemma":[0.014464374,0.00075943646,0.001112281,0.0011484534,0.0023492118,0.0031244268,0.0025042517,0.0022490013,0.00073201564],"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.0005033891,0.0003798768,0.0014115096,0.0005117368,0.00021374969,0.00024250307,0.00069664937,0.45528543,0.015548826,0.038838938,0.004564385,0.4818029],"study_design_scores_gemma":[0.000019118517,0.000051660827,0.00008934,0.0000088908255,0.00001178497,0.000043982636,0.000020611868,0.9814711,0.004068901,0.012968137,0.0012314555,0.0000150175065],"about_ca_topic_score_codex":0.00091960846,"about_ca_topic_score_gemma":0.0014361714,"teacher_disagreement_score":0.0071454234,"about_ca_system_score_codex":0.00065229816,"about_ca_system_score_gemma":0.0014599862,"threshold_uncertainty_score":0.037789047},"labels":[],"label_agreement":null},{"id":"W2044654785","doi":"10.4204/eptcs.3.11","title":"State Complexity Approximation","year":2009,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"State (computer science); Computer science; Theoretical computer science; Mathematics; Algorithm","score_opus":0.006796178078751685,"score_gpt":0.24847129548516936,"score_spread":0.24167511740641767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044654785","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.007816811,0.00027714865,0.98535454,0.00035446175,0.000071458,0.000036180154,0.00018594213,0.00038450875,0.005518888],"genre_scores_gemma":[0.66453373,0.0011889823,0.32169497,0.00047544122,0.00033632838,0.00036975066,0.0017865316,0.00039142644,0.00922281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954211,0.0009338508,0.00024057196,0.0009675367,0.0019922797,0.0004447166],"domain_scores_gemma":[0.98604906,0.008742814,0.00082564715,0.0027830591,0.0013476309,0.00025180695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002265599,0.0010150553,0.0014144947,0.0013496482,0.00075316726,0.003215231,0.0022544027,0.0011742343,0.006684076],"category_scores_gemma":[0.022369724,0.0004785002,0.0012903216,0.0015268604,0.0015677267,0.007838277,0.0031634443,0.0042641023,0.0010910544],"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.00024848204,0.0001160171,0.0028131006,0.00023519614,0.00008046163,0.00014374852,0.0002245454,0.28614458,0.0019617558,0.59740835,0.0048655523,0.105758294],"study_design_scores_gemma":[0.00000951036,0.000036327096,0.000356054,0.000033530498,0.000018595607,0.00007682061,0.000026602045,0.7540817,0.0017595283,0.23956977,0.0040099574,0.000021608674],"about_ca_topic_score_codex":0.002244418,"about_ca_topic_score_gemma":0.0014716365,"teacher_disagreement_score":0.006684076,"about_ca_system_score_codex":0.002115472,"about_ca_system_score_gemma":0.0017002943,"threshold_uncertainty_score":0.022360444},"labels":[],"label_agreement":null},{"id":"W2046606421","doi":"10.1007/s11263-005-4436-9","title":"Efficient Discriminant Viewpoint Selection for Active Bayesian Recognition","year":2006,"lang":"en","type":"article","venue":"International Journal of Computer Vision","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Artificial intelligence; Computer science; Pattern recognition (psychology); Classifier (UML); Bayesian probability; Selection (genetic algorithm); Machine learning; Mutual information; Discriminant; Linear discriminant analysis; Cognitive neuroscience of visual object recognition; Data mining; Object (grammar)","score_opus":0.00862820358836279,"score_gpt":0.28551302835708997,"score_spread":0.27688482476872717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046606421","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.00596679,0.00014339147,0.992529,0.000067647474,0.000026617221,0.000021968477,0.00004234365,0.00049310783,0.00070912647],"genre_scores_gemma":[0.23172173,0.0002859698,0.7625488,0.0001305958,0.00008325601,0.000120806595,0.0005691296,0.00038085933,0.0041588503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914825,0.00023865994,0.000029409093,0.00016500335,0.00030870343,0.00010990943],"domain_scores_gemma":[0.9988581,0.00046585873,0.00006488891,0.0002202297,0.00030784306,0.00008306877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001332815,0.0010603358,0.0018955988,0.0010200858,0.0005738053,0.0012170399,0.0021280563,0.001128947,0.004565158],"category_scores_gemma":[0.003703044,0.000736405,0.0009268254,0.00083269336,0.000549036,0.0012125047,0.0018628635,0.0017805777,0.0025727872],"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.00055457745,0.00012528962,0.00092653953,0.00012120566,0.00006437786,0.00006939292,0.000095103846,0.04838294,0.034116298,0.017872443,0.0065546385,0.8911173],"study_design_scores_gemma":[0.000034955872,0.000045352113,0.00036641757,0.0000109072525,0.000022610508,0.00007791402,0.000022959126,0.97553366,0.009080407,0.012799419,0.0019900275,0.000015381722],"about_ca_topic_score_codex":0.0021668866,"about_ca_topic_score_gemma":0.004664348,"teacher_disagreement_score":0.004565158,"about_ca_system_score_codex":0.00050496415,"about_ca_system_score_gemma":0.0010637647,"threshold_uncertainty_score":0.015271962},"labels":[],"label_agreement":null},{"id":"W2047837697","doi":"10.1016/j.tcs.2014.09.024","title":"Algebraic methods proving Sauer's bound for teaching complexity","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Algebraic number; Algebra over a field; Mathematics; Computer science; Discrete mathematics; Theoretical computer science; Calculus (dental); Pure mathematics","score_opus":0.017830319807700792,"score_gpt":0.33658955597516604,"score_spread":0.31875923616746527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047837697","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.02651373,0.00085288455,0.8069246,0.010162045,0.00090562523,0.00011772545,0.00034905958,0.0011637317,0.15301062],"genre_scores_gemma":[0.6971639,0.0010952179,0.24001808,0.0022013872,0.0012459992,0.0005001359,0.00063076033,0.0010276901,0.05611691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953094,0.0013459824,0.00027505177,0.0010425779,0.0015151743,0.0005118507],"domain_scores_gemma":[0.97727877,0.016891135,0.00044565919,0.0028146964,0.0016597987,0.0009100594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004093097,0.0013580557,0.0014094448,0.0023641505,0.0030292114,0.004091068,0.0026389882,0.0027453273,0.030333733],"category_scores_gemma":[0.02721529,0.0011620562,0.002910523,0.001905031,0.00605799,0.015779747,0.008588436,0.009235477,0.0035510983],"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.00002825983,0.000028293834,0.0001517336,0.000057607293,0.000013561854,0.000013261876,0.00016212485,0.001911432,0.000335401,0.9824991,0.0030591781,0.011739969],"study_design_scores_gemma":[0.000016661745,0.000011640041,0.000080115555,0.000019070276,0.000015421696,0.00001310161,0.000035596113,0.011314978,0.00067665125,0.9833635,0.004442626,0.000010650162],"about_ca_topic_score_codex":0.0027247248,"about_ca_topic_score_gemma":0.0035532874,"teacher_disagreement_score":0.030333733,"about_ca_system_score_codex":0.0047147474,"about_ca_system_score_gemma":0.0027915598,"threshold_uncertainty_score":0.10147643},"labels":[],"label_agreement":null},{"id":"W2050570613","doi":"10.1145/337244.337257","title":"Learning functions represented as multiplicity automata","year":2000,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":124,"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 Calgary","funders":"","keywords":"Learnability; Mathematics; Discrete mathematics; Multiplicity (mathematics); Disjoint sets; Combinatorics; Computer science; Artificial intelligence","score_opus":0.008940393291089208,"score_gpt":0.2585674569749757,"score_spread":0.24962706368388649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050570613","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.13724047,0.00023887045,0.85826236,0.00056864053,0.000041969888,0.000047002253,0.00018710466,0.0006980248,0.002715655],"genre_scores_gemma":[0.8409901,0.00019549034,0.15441172,0.00019200746,0.000082105966,0.00013449545,0.0003152884,0.000080385464,0.0035983843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898595,0.00023209931,0.00006571834,0.0003434066,0.00022119125,0.00015160599],"domain_scores_gemma":[0.99313664,0.0048860027,0.00057041825,0.00086686906,0.00036684898,0.00017314909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014067957,0.0005548053,0.0010209603,0.0009084996,0.00076362916,0.0011957455,0.002143541,0.0011820693,0.0032991907],"category_scores_gemma":[0.0131483255,0.0003638208,0.0009472074,0.00097313384,0.0014969897,0.0065098093,0.001685351,0.0019752043,0.00043070054],"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.00038464362,0.00014583362,0.0054414817,0.0001846381,0.00005703388,0.00030656657,0.00033638653,0.34113213,0.006280007,0.52306604,0.0018788382,0.12078629],"study_design_scores_gemma":[0.000011873391,0.00003702882,0.0001366054,0.000006837374,0.000008553747,0.00005161167,0.000016488815,0.82872295,0.0015402384,0.16895968,0.00049810694,0.000010052657],"about_ca_topic_score_codex":0.0021388382,"about_ca_topic_score_gemma":0.002217648,"teacher_disagreement_score":0.0032991907,"about_ca_system_score_codex":0.0018539618,"about_ca_system_score_gemma":0.00078227796,"threshold_uncertainty_score":0.013451457},"labels":[],"label_agreement":null},{"id":"W2054626845","doi":"10.1016/s0196-6774(02)00003-2","title":"A linear time algorithm for recognizing regular Boolean functions","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Monotonic function; Boolean function; Monotone polygon; Corollary; Time complexity; Combinatorics; Function (biology); Algorithm; Discrete mathematics","score_opus":0.02007652376892932,"score_gpt":0.24515777599527802,"score_spread":0.2250812522263487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054626845","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.028488964,0.0007033218,0.94650435,0.0008379187,0.0002101498,0.0004794374,0.00089280575,0.0144854365,0.007397587],"genre_scores_gemma":[0.12360309,0.00029743975,0.86157155,0.0005146049,0.0001239402,0.00057995174,0.0039452612,0.0006492507,0.008714896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978853,0.00021315558,0.00020253872,0.000874662,0.00052570587,0.0002985816],"domain_scores_gemma":[0.99677736,0.001751156,0.00019485263,0.00067237014,0.00041722303,0.00018701982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093510194,0.0023265423,0.0022927609,0.0020453434,0.0015475994,0.0036977103,0.0043805228,0.0028381448,0.017037794],"category_scores_gemma":[0.0045432295,0.0011040458,0.0022734248,0.0030733105,0.0014103631,0.0077261333,0.003415537,0.0029189375,0.005988286],"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.0010419057,0.00058301736,0.0009808224,0.00047213034,0.00012409645,0.00013713476,0.00020214122,0.01615382,0.023494996,0.020767467,0.025191497,0.910851],"study_design_scores_gemma":[0.0011274242,0.0005985187,0.001358208,0.00011028856,0.00036879047,0.0009045589,0.00050050695,0.70711756,0.04738552,0.21682344,0.023545578,0.00015955712],"about_ca_topic_score_codex":0.0050372607,"about_ca_topic_score_gemma":0.008231892,"teacher_disagreement_score":0.017037794,"about_ca_system_score_codex":0.002362918,"about_ca_system_score_gemma":0.0031692358,"threshold_uncertainty_score":0.05699706},"labels":[],"label_agreement":null},{"id":"W2054806088","doi":"10.1016/j.tcs.2012.10.015","title":"PAC learnability under non-atomic measures: A problem by Vidyasagar","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Countable set; Learnability; Uncountable set; Discrete mathematics; Modulo; Dimension (graph theory); Axiom; Combinatorics; Computer science","score_opus":0.007524025083853643,"score_gpt":0.24933544729667395,"score_spread":0.24181142221282032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054806088","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.07904263,0.013565464,0.8250119,0.043181635,0.0011643267,0.00012570799,0.0005259312,0.00079214835,0.036590245],"genre_scores_gemma":[0.8009951,0.008284113,0.15982066,0.005997156,0.0031893179,0.00038016646,0.000730344,0.0007384881,0.019864678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99308443,0.002435255,0.0003656495,0.0018565354,0.001822768,0.00043532305],"domain_scores_gemma":[0.93690246,0.052710332,0.0010918492,0.005397893,0.0029854178,0.000912027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008752968,0.0013647076,0.004351064,0.0018892384,0.0040476047,0.0063754185,0.0031883826,0.005363546,0.0035326702],"category_scores_gemma":[0.057621628,0.0016476021,0.0024146433,0.0043870704,0.010767789,0.02349405,0.008696009,0.018808873,0.00089684105],"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.00013965904,0.00007236072,0.0008063401,0.000199626,0.0000849997,0.00008440694,0.00035133824,0.010630942,0.0004318238,0.9531871,0.0060863593,0.027924962],"study_design_scores_gemma":[0.0000150956175,0.000016354586,0.00012002352,0.00001933794,0.000015243309,0.000028783621,0.00003202433,0.02361765,0.00027968493,0.9740543,0.0017838085,0.000017629895],"about_ca_topic_score_codex":0.0027444125,"about_ca_topic_score_gemma":0.00131739,"teacher_disagreement_score":0.008752968,"about_ca_system_score_codex":0.0031857602,"about_ca_system_score_gemma":0.0026843192,"threshold_uncertainty_score":0.046290696},"labels":[],"label_agreement":null},{"id":"W2059501997","doi":"10.1007/s11263-012-0551-6","title":"A Computational Learning Theory of Active Object Recognition Under Uncertainty","year":2012,"lang":"en","type":"article","venue":"International Journal of Computer Vision","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computational complexity theory; Object (grammar); Representation (politics); Noise (video); Mathematics; Constraint (computer-aided design); Cognitive neuroscience of visual object recognition; Class (philosophy); Artificial intelligence; Pattern recognition (psychology); Feature (linguistics); Time complexity; Algorithm; Computer science; Theoretical computer science; Image (mathematics)","score_opus":0.01582512618309218,"score_gpt":0.30432023853386364,"score_spread":0.28849511235077147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059501997","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.0019130986,0.0003766186,0.9955713,0.00035960012,0.00005401822,0.000011547841,0.000031080668,0.000045930745,0.0016368063],"genre_scores_gemma":[0.5586426,0.002275196,0.42717227,0.0007134245,0.001157495,0.00035197998,0.0003781199,0.00015872184,0.009150216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975727,0.0007904125,0.00016521392,0.00045484508,0.00087429,0.00014257441],"domain_scores_gemma":[0.9926174,0.0053293924,0.0004337141,0.00070796785,0.00073797663,0.00017348588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003658786,0.0008446182,0.0019745475,0.0016970139,0.0010394932,0.0043292446,0.0044235936,0.0027689384,0.0029344608],"category_scores_gemma":[0.012445497,0.0010972514,0.001789481,0.002169066,0.00456947,0.0072456007,0.003653486,0.0036872395,0.00058784743],"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.000031284086,0.000020945212,0.00018219979,0.00009401139,0.000035833873,0.000045284567,0.0000943978,0.11226894,0.0005929341,0.8557804,0.0010502366,0.029803492],"study_design_scores_gemma":[0.000006194769,0.000016204476,0.000053953758,0.00001509277,0.000009536664,0.000030342795,0.000011787286,0.498469,0.00022084467,0.50010127,0.0010534633,0.000012249033],"about_ca_topic_score_codex":0.002047439,"about_ca_topic_score_gemma":0.001137501,"teacher_disagreement_score":0.0044235936,"about_ca_system_score_codex":0.0014908151,"about_ca_system_score_gemma":0.0011009024,"threshold_uncertainty_score":0.019349754},"labels":[],"label_agreement":null},{"id":"W2063410746","doi":"10.1007/bf02530500","title":"Strong consistency of automatic kernel regression estimates","year":2003,"lang":"en","type":"article","venue":"Annals of the Institute of Statistical Mathematics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Kernel regression; Independent and identically distributed random variables; Kernel (algebra); Bandwidth (computing); Bounded function; Consistency (knowledge bases); Statistics; Variable kernel density estimation; Applied mathematics; Strong consistency; Regression; Weak consistency; Kernel method; Random variable; Discrete mathematics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.04805841346465264,"score_gpt":0.3353193986665352,"score_spread":0.2872609852018826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063410746","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.022234565,0.00053556846,0.9728021,0.0007987058,0.00014999724,0.000032192565,0.00015221034,0.00051462254,0.0027798852],"genre_scores_gemma":[0.69154847,0.001152041,0.29208475,0.0009481502,0.0011210768,0.0002929489,0.0017418789,0.0014409443,0.009669753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97929573,0.011320569,0.0010092285,0.003847806,0.0037176355,0.0008090723],"domain_scores_gemma":[0.8292166,0.12300541,0.008767572,0.022100912,0.015350011,0.0015595813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02509671,0.0015254274,0.0028477479,0.002891435,0.0013332423,0.004736432,0.004923454,0.003743037,0.004140459],"category_scores_gemma":[0.16348802,0.0026440271,0.0019985675,0.0019979437,0.0053980835,0.00972099,0.007852047,0.007449874,0.0020256022],"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.0008837581,0.00017955629,0.0053168237,0.00052264053,0.0005490347,0.0003240414,0.00048657157,0.12348288,0.0072776433,0.7771968,0.007361172,0.07641903],"study_design_scores_gemma":[0.00009931959,0.00008815304,0.0017138856,0.0000622572,0.00006298248,0.0001734558,0.000040564883,0.4682691,0.0033247995,0.5238944,0.0021925843,0.00007836763],"about_ca_topic_score_codex":0.000942858,"about_ca_topic_score_gemma":0.0008254782,"teacher_disagreement_score":0.02509671,"about_ca_system_score_codex":0.0012762321,"about_ca_system_score_gemma":0.001852286,"threshold_uncertainty_score":0.13272572},"labels":[],"label_agreement":null},{"id":"W2065015368","doi":"10.1007/s10994-010-5179-6","title":"Polynomial regression under arbitrary product distributions","year":2010,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Carnegie Mellon University; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Mathematics; Product (mathematics); Polynomial; Degree (music); Discrete mathematics; Noise (video); Gaussian; Simple (philosophy); Distribution (mathematics); Combinatorics; Algorithm; Applied mathematics; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.0072890674834150656,"score_gpt":0.24878458362669115,"score_spread":0.24149551614327608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065015368","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.02869634,0.00087774824,0.9593064,0.0016358659,0.00013516986,0.000024863164,0.00016774645,0.00043452834,0.008721332],"genre_scores_gemma":[0.78416944,0.00273829,0.1845352,0.0006029224,0.001179906,0.00013540304,0.0007006095,0.0005591713,0.025379006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675226,0.00164612,0.00010457354,0.0005528657,0.00068686483,0.00025731826],"domain_scores_gemma":[0.9806368,0.013276449,0.0011486061,0.0032591594,0.0012340532,0.00044505153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046352963,0.00094999967,0.0013113011,0.0008442212,0.0005959098,0.0018485201,0.0016546824,0.0012622591,0.0047982195],"category_scores_gemma":[0.03162141,0.00076726783,0.0007782102,0.0018214327,0.0031929838,0.007815405,0.003299763,0.0034973659,0.0016831573],"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.000154402,0.000047825124,0.00063056214,0.00013503268,0.000036342444,0.00010509208,0.00007329442,0.030494902,0.001025649,0.9253451,0.0049828268,0.036968812],"study_design_scores_gemma":[0.000033791377,0.000028810913,0.00025060974,0.000012507056,0.000012263395,0.00013474569,0.000011236117,0.28281832,0.0007947976,0.71346754,0.0024216494,0.000013730604],"about_ca_topic_score_codex":0.0011865676,"about_ca_topic_score_gemma":0.0008377622,"teacher_disagreement_score":0.0047982195,"about_ca_system_score_codex":0.0011798594,"about_ca_system_score_gemma":0.0011124283,"threshold_uncertainty_score":0.02451402},"labels":[],"label_agreement":null},{"id":"W2066935960","doi":"10.1214/aos/1079120127","title":"Three papers on boosting: an introduction","year":2004,"lang":"en","type":"article","venue":"The Annals of Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Boosting (machine learning); AdaBoost; Artificial intelligence; Mathematics; Machine learning; Learnability; Probably approximately correct learning; Generalization; Computational learning theory; Gradient boosting; Generalization error; Algorithm; Computer science; Classifier (UML); Artificial neural network; Unsupervised learning","score_opus":0.05352995986453116,"score_gpt":0.32049673717227517,"score_spread":0.266966777307744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066935960","genre_codex":"review","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.0017291561,0.47225666,0.30401316,0.038844682,0.036283568,0.0002841796,0.0007692492,0.0011200941,0.14469928],"genre_scores_gemma":[0.05692852,0.44461226,0.26781735,0.039833605,0.08450046,0.000991748,0.0022123666,0.0018519794,0.101251744],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99509084,0.0014218492,0.0003675975,0.0008325898,0.0019939106,0.00029312065],"domain_scores_gemma":[0.9940148,0.00289751,0.0003307292,0.00052366656,0.0018511976,0.00038222905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064903633,0.002229606,0.0024833146,0.0061082523,0.0017520798,0.008141576,0.002811249,0.0048689838,0.014520826],"category_scores_gemma":[0.011968285,0.001571089,0.0023922282,0.009589143,0.0024854748,0.008381433,0.0034119016,0.0069479886,0.014922582],"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.00011890187,0.00011427006,0.0008264129,0.001140168,0.00014540816,0.00013369657,0.00032161392,0.004012359,0.00046392946,0.34144005,0.22852223,0.42276105],"study_design_scores_gemma":[0.000022563107,0.00003820887,0.00028378965,0.0006784854,0.00003090444,0.00028242683,0.0000533334,0.0025804937,0.0003217864,0.15883361,0.8368244,0.000049962575],"about_ca_topic_score_codex":0.0011119796,"about_ca_topic_score_gemma":0.000647232,"teacher_disagreement_score":0.014520826,"about_ca_system_score_codex":0.0024644907,"about_ca_system_score_gemma":0.001585694,"threshold_uncertainty_score":0.04857701},"labels":[],"label_agreement":null},{"id":"W2069278771","doi":"10.1145/1984674.1984684","title":"Toward high-level reuse of statechart-based AI in computer games","year":2011,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"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":"Reuse; Modular design; Computer science; Interface (matter); Human–computer interaction; Software engineering; Computer architecture; Programming language; Operating system; Engineering","score_opus":0.04757649344080034,"score_gpt":0.25176523991945765,"score_spread":0.2041887464786573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069278771","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.0048226356,0.00004006431,0.9920735,0.000121190795,0.000008219083,0.00006496063,0.000011872196,0.0012373999,0.001620259],"genre_scores_gemma":[0.2079648,0.00015484008,0.7880903,0.0001283444,0.000023922034,0.00032349955,0.00010861775,0.00051651493,0.0026890985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962929,0.0016724262,0.00033106888,0.00043250533,0.0009896634,0.00028130886],"domain_scores_gemma":[0.9914044,0.003655812,0.0004705978,0.0030636021,0.0010908272,0.00031468144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056690183,0.0009089412,0.00065751764,0.0012465162,0.0008960347,0.004175751,0.0026043542,0.0013785956,0.003906771],"category_scores_gemma":[0.015894603,0.0010821038,0.0018827791,0.0008473796,0.0035688062,0.006921135,0.0041923863,0.0031432393,0.0012119833],"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.00019152705,0.00025557645,0.0025503095,0.0003397079,0.00014205702,0.00040764324,0.0055329753,0.111176625,0.021616783,0.69689494,0.0019652136,0.15892668],"study_design_scores_gemma":[0.00004925443,0.00015121899,0.00050017843,0.00014834099,0.00011592429,0.00016977593,0.00027534275,0.6059613,0.022692496,0.34084943,0.029013935,0.00007287056],"about_ca_topic_score_codex":0.0032996847,"about_ca_topic_score_gemma":0.0037464937,"teacher_disagreement_score":0.0056690183,"about_ca_system_score_codex":0.001371232,"about_ca_system_score_gemma":0.002309295,"threshold_uncertainty_score":0.029980958},"labels":[],"label_agreement":null},{"id":"W2070468815","doi":"10.1016/j.jairtraman.2011.10.004","title":"Logical analysis of data for estimating passenger show rates at Air Canada","year":2011,"lang":"en","type":"article","venue":"Journal of Air Transport Management","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Air Canada; Polytechnique Montréal","funders":"","keywords":"Logical analysis; Operations research; Population; Computer science; Statistics; Econometrics; Engineering; Mathematics; Mathematical statistics; Demography","score_opus":0.04366106932765179,"score_gpt":0.2780978618753474,"score_spread":0.23443679254769562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070468815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9824185,0.0002218242,0.005161329,0.00019308717,0.000013176452,0.000054162938,0.010249127,0.00026314755,0.0014255889],"genre_scores_gemma":[0.9835249,0.000108352724,0.0041851876,0.000017758492,0.000009565281,0.000030141655,0.011359731,0.000017962393,0.00074626895],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990368,0.00019025253,0.000075297256,0.00012482278,0.0003927272,0.00018009002],"domain_scores_gemma":[0.9942631,0.002844661,0.00043471187,0.00034275028,0.001915972,0.00019878215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012353525,0.00054406933,0.00037516115,0.003693411,0.00080113596,0.0013138766,0.0007767499,0.000599621,0.001457941],"category_scores_gemma":[0.0070102885,0.0001988118,0.00064498594,0.0035661655,0.00044929655,0.00046593382,0.0004313716,0.0006094002,0.00044991547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008056509,0.0003322109,0.8501507,0.00014360808,0.00028671682,0.00035554037,0.0002862588,0.06696752,0.005757266,0.0015404393,0.004777361,0.068596624],"study_design_scores_gemma":[0.000035577195,0.00015405734,0.72531265,0.000027660075,0.00010535627,0.00014329872,0.00083283684,0.26434183,0.0048211794,0.0008028857,0.003380636,0.00004200682],"about_ca_topic_score_codex":0.665197,"about_ca_topic_score_gemma":0.72103626,"teacher_disagreement_score":0.334803,"about_ca_system_score_codex":0.003838585,"about_ca_system_score_gemma":0.0060164738,"threshold_uncertainty_score":0.6735494},"labels":[],"label_agreement":null},{"id":"W2071925009","doi":"10.1016/j.jda.2007.04.002","title":"Computing the throughput of Concatenation State Machines","year":2007,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Concatenation (mathematics); Infimum and supremum; Combinatorics; Alphabet; Graph; Mathematics; Path (computing); Throughput; Enhanced Data Rates for GSM Evolution; Algorithm; Discrete mathematics; Minimum weight; Function (biology); Computer science; Artificial intelligence","score_opus":0.009754639617023692,"score_gpt":0.28754800989303453,"score_spread":0.2777933702760108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071925009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61154956,0.0007662035,0.37386703,0.0014859362,0.00033604167,0.000088663284,0.00097438873,0.0042963997,0.0066358726],"genre_scores_gemma":[0.9699055,0.00014590652,0.027953979,0.00006241431,0.00013342954,0.000061502236,0.0005058313,0.00017213532,0.0010592688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968624,0.0009696341,0.00024189068,0.0006372278,0.00074798113,0.0005408505],"domain_scores_gemma":[0.9627418,0.0284073,0.0013728864,0.004567864,0.0020382241,0.0008718723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005033051,0.0009721132,0.0018043402,0.0017868783,0.0014039516,0.0036361043,0.0019367039,0.001440678,0.0041088425],"category_scores_gemma":[0.035238612,0.00088806683,0.0007929833,0.002010502,0.0020432041,0.00805925,0.0023212105,0.0018695947,0.0007811628],"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.004121684,0.0003481072,0.017776983,0.00026428932,0.0002780659,0.00027061405,0.00055692584,0.7356528,0.012006875,0.11810335,0.0061413962,0.10447888],"study_design_scores_gemma":[0.000024913707,0.00007686809,0.00079517055,0.000010300875,0.000025419262,0.000023710445,0.000037040012,0.94034034,0.0040985565,0.054259863,0.000292359,0.000015374862],"about_ca_topic_score_codex":0.0024831055,"about_ca_topic_score_gemma":0.0024965699,"teacher_disagreement_score":0.005033051,"about_ca_system_score_codex":0.002557184,"about_ca_system_score_gemma":0.0023037777,"threshold_uncertainty_score":0.026617587},"labels":[],"label_agreement":null},{"id":"W2073735261","doi":"10.1002/mats.200400074","title":"Diagnosis of Impurity Levels in a Copolymerization Process","year":2005,"lang":"en","type":"article","venue":"Macromolecular Theory and Simulations","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"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":"Observability; Computer science; Fault (geology); Design of experiments; Fuzzy logic; Artificial intelligence; Boundary (topology); Algorithm; Machine learning; Mathematics; Statistics; Applied mathematics","score_opus":0.007153494322388387,"score_gpt":0.2770057409748343,"score_spread":0.26985224665244595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073735261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90633285,0.00013291769,0.0928051,0.00008092022,0.000014971735,0.000035771685,0.000028617047,0.00014291858,0.00042593494],"genre_scores_gemma":[0.98826563,0.00002477402,0.011476726,0.000008843834,0.0000018097624,0.000008704838,0.000015903606,0.000003839046,0.00019378492],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996087,0.000100186175,0.000021621307,0.000097195036,0.00014135106,0.000031070405],"domain_scores_gemma":[0.99905235,0.0005610726,0.0001522073,0.000050051294,0.00016030426,0.00002396742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009044575,0.00025531612,0.00033093742,0.00027975533,0.00025931568,0.00028483223,0.0002842566,0.0005408528,0.0007072897],"category_scores_gemma":[0.0016668919,0.00015483687,0.00021207676,0.00016198818,0.00030664363,0.00032380858,0.00028730324,0.00031875962,0.000083295],"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.0023185778,0.00045587827,0.014885011,0.0003587681,0.00004972105,0.00028732518,0.00022929558,0.12409974,0.77156216,0.0011850344,0.00019869406,0.08436977],"study_design_scores_gemma":[0.000035378594,0.0007995941,0.0048826816,0.0000069316998,0.000023055105,0.00006887987,0.000036859034,0.5386147,0.45488563,0.0003871887,0.00024717435,0.000011942229],"about_ca_topic_score_codex":0.0006556001,"about_ca_topic_score_gemma":0.0005214255,"teacher_disagreement_score":0.0009044575,"about_ca_system_score_codex":0.00043692294,"about_ca_system_score_gemma":0.0003456229,"threshold_uncertainty_score":0.0047832727},"labels":[],"label_agreement":null},{"id":"W2076948581","doi":"10.1016/j.compchemeng.2004.02.035","title":"Optimal experimental design for training of a fault diagnosis algorithm","year":2004,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fuzzy logic; Gaussian; Boundary (topology); Algorithm; Design of experiments; Factorial experiment; Mathematics; Kriging; Projection (relational algebra); Computer science; Artificial intelligence; Machine learning; Data mining; Pattern recognition (psychology); Statistics","score_opus":0.018793547054391797,"score_gpt":0.24415098796693882,"score_spread":0.22535744091254703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076948581","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.023972148,0.00009027834,0.9744518,0.00011351033,0.00002941973,0.0001879548,0.00004431503,0.00032569782,0.00078497664],"genre_scores_gemma":[0.64807534,0.000066628956,0.3497251,0.00008356809,0.000025898653,0.0009566429,0.00014020629,0.000045512632,0.000881094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835217,0.0008364785,0.00010173652,0.00034214856,0.0002259471,0.00014144479],"domain_scores_gemma":[0.99285275,0.0052067568,0.0004973565,0.00043660772,0.0009033213,0.00010328918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00425469,0.0007204394,0.00091347157,0.0006116095,0.0004608817,0.00059313636,0.0010688463,0.0014884057,0.0047400836],"category_scores_gemma":[0.012416901,0.0006745466,0.0004776173,0.00024625444,0.0011151577,0.0009407108,0.00069742167,0.00093322527,0.00049888407],"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.001631492,0.00035458358,0.0008630539,0.00031808292,0.00006830109,0.000040479987,0.00007609755,0.8366176,0.016497,0.011780186,0.0005800886,0.13117303],"study_design_scores_gemma":[0.00014862619,0.00028094955,0.00031848327,0.000012364905,0.000020404235,0.00001302319,0.0000070109595,0.98874223,0.007260833,0.0027186375,0.00046921347,0.000008204776],"about_ca_topic_score_codex":0.0016507163,"about_ca_topic_score_gemma":0.0013825425,"teacher_disagreement_score":0.0047400836,"about_ca_system_score_codex":0.0009835304,"about_ca_system_score_gemma":0.0017613095,"threshold_uncertainty_score":0.02250117},"labels":[],"label_agreement":null},{"id":"W2078513661","doi":"10.1142/s021800140300254x","title":"FORMAL ASPECTS OF A MULTIPLE-RULE CLASSIFIER","year":2003,"lang":"en","type":"article","venue":"International Journal of Pattern Recognition and Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Classifier (UML); Artificial intelligence; Decision rule; Rule-based system; Machine learning; Data mining","score_opus":0.06482898972396037,"score_gpt":0.30576794724551526,"score_spread":0.2409389575215549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078513661","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.0031227986,0.00018836118,0.99089617,0.00060220476,0.000041758973,0.000089573274,0.000063785876,0.00019340393,0.0048019895],"genre_scores_gemma":[0.10271124,0.00026559335,0.8931543,0.00022720305,0.00014971003,0.00027253552,0.00024185039,0.00009495153,0.0028826243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.985457,0.003249289,0.0017880508,0.0022683174,0.0066845682,0.00055270205],"domain_scores_gemma":[0.9832223,0.0098994,0.0010771388,0.0023412588,0.0031321724,0.00032767537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011900732,0.00050657074,0.0007204531,0.0015764395,0.0012308032,0.0049173585,0.0033112231,0.0024668423,0.004370865],"category_scores_gemma":[0.023982177,0.0006370847,0.0013014581,0.001333638,0.0049944324,0.0071382453,0.0020313477,0.0028075676,0.0016352892],"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.000044576333,0.00005517529,0.0006006642,0.00017010266,0.000023585097,0.00022506806,0.00044515776,0.013479334,0.0018098401,0.9447852,0.00093873206,0.03742258],"study_design_scores_gemma":[0.000049741386,0.00011814373,0.00026208756,0.00018080206,0.000051536,0.0008011058,0.00014847826,0.19437078,0.0065466464,0.75750864,0.039913185,0.000048953083],"about_ca_topic_score_codex":0.0013097054,"about_ca_topic_score_gemma":0.0010095389,"teacher_disagreement_score":0.011900732,"about_ca_system_score_codex":0.001427158,"about_ca_system_score_gemma":0.0023550952,"threshold_uncertainty_score":0.062937856},"labels":[],"label_agreement":null},{"id":"W2079682427","doi":"10.1109/grc.2010.102","title":"Predictive PAC Learnability: A Paradigm for Learning from Exchangeable Input Data","year":2010,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"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":"Generalization; Function (biology); Class (philosophy); Separable space; Simple (philosophy); Sample (material); Random variable; Extension (predicate logic)","score_opus":0.03471467606058336,"score_gpt":0.28471269623855766,"score_spread":0.2499980201779743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079682427","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.0026057006,0.000409214,0.9937749,0.0012837577,0.00004927364,0.000058799968,0.00021405779,0.00014624953,0.0014580751],"genre_scores_gemma":[0.44641075,0.0033943057,0.5343975,0.002965524,0.0016910168,0.0022168509,0.0015382266,0.00036475435,0.0070211156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98510635,0.0071552005,0.0007710291,0.003331362,0.003131746,0.00050430745],"domain_scores_gemma":[0.9524411,0.03761817,0.0023774288,0.0049142987,0.0019494207,0.00069966237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016233167,0.0025707544,0.00297306,0.002722453,0.0012606459,0.0056352783,0.005910957,0.0038201353,0.0030994685],"category_scores_gemma":[0.05543296,0.0012560437,0.0033665984,0.0030319616,0.007559223,0.013279122,0.0059269182,0.012133782,0.0006621715],"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.00021587666,0.00009887372,0.0013521449,0.0003752739,0.00019386155,0.00023312468,0.00032257778,0.13523516,0.0006827174,0.8037688,0.0034556591,0.05406594],"study_design_scores_gemma":[0.00003124212,0.00007722324,0.0001566812,0.000038572696,0.000020816407,0.00007144999,0.000019855519,0.39483565,0.0004894495,0.6023675,0.0018668215,0.000024798699],"about_ca_topic_score_codex":0.0022563783,"about_ca_topic_score_gemma":0.0014899791,"teacher_disagreement_score":0.016233167,"about_ca_system_score_codex":0.0036824048,"about_ca_system_score_gemma":0.0021140883,"threshold_uncertainty_score":0.08585018},"labels":[],"label_agreement":null},{"id":"W2094015783","doi":"10.1145/2330163.2330262","title":"GP under streaming data constraints","year":2012,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Streaming data; Data mining","score_opus":0.05107812566443349,"score_gpt":0.30912151444885205,"score_spread":0.25804338878441857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094015783","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.15402415,0.00071577955,0.83082277,0.001979278,0.00016837071,0.00015538145,0.001286402,0.0011720047,0.009675926],"genre_scores_gemma":[0.8128093,0.00042774415,0.17608756,0.0002928085,0.00016447515,0.00032486732,0.0013790064,0.00024436036,0.008269953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947184,0.0001684926,0.000031267824,0.0001398875,0.00011237715,0.0000762719],"domain_scores_gemma":[0.9953753,0.0033370983,0.00023956086,0.00038846536,0.00054804556,0.0001115217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013057957,0.00052388455,0.0010387413,0.00039253506,0.00028587884,0.0010494702,0.0011954848,0.0013388194,0.0024219966],"category_scores_gemma":[0.009756823,0.00032677082,0.0004970889,0.0008284043,0.0005933113,0.0014760899,0.000916367,0.0014098972,0.00035895282],"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.00007532045,0.000026710028,0.0008361727,0.000059406582,0.000025881234,0.00021796337,0.000051701765,0.94284916,0.0007241639,0.017488893,0.0028262117,0.03481841],"study_design_scores_gemma":[0.0000108841905,0.000011483364,0.00010722557,0.000002991663,0.000003809141,0.000025822566,0.0000075415314,0.9905565,0.00018033703,0.008616196,0.0004750088,0.0000021759042],"about_ca_topic_score_codex":0.007564462,"about_ca_topic_score_gemma":0.0037776434,"teacher_disagreement_score":0.007564462,"about_ca_system_score_codex":0.00083717215,"about_ca_system_score_gemma":0.0010085241,"threshold_uncertainty_score":0.0150408745},"labels":[],"label_agreement":null},{"id":"W2096578724","doi":"10.1016/j.tcs.2014.09.022","title":"Confident and consistent partial learning of recursive functions","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National University of Singapore","keywords":"Recursive functions; Partial function; Computer science; Mathematics; Calculus (dental); Algebra over a field; Theoretical computer science; Algorithm; Artificial intelligence; Discrete mathematics; Pure mathematics; Medicine","score_opus":0.005754438812722299,"score_gpt":0.23142524644197493,"score_spread":0.22567080762925262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096578724","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.1008047,0.0009511762,0.8870587,0.0029039728,0.00007660718,0.000044669956,0.0004981015,0.0005107226,0.0071514137],"genre_scores_gemma":[0.9078235,0.0008403359,0.08179731,0.0006241274,0.00032440005,0.00014580472,0.0008732913,0.00020674765,0.007364447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931879,0.0034454984,0.00032273142,0.0011103757,0.0014132416,0.0005202465],"domain_scores_gemma":[0.86643976,0.10965387,0.0044971905,0.012797468,0.0048334254,0.0017782975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010227935,0.001086793,0.0020493574,0.0014114011,0.0010924699,0.0042803544,0.003077135,0.0029811433,0.004456153],"category_scores_gemma":[0.11904595,0.0014729903,0.0012198718,0.0017256457,0.005920359,0.011084907,0.005064319,0.0059951274,0.00061474374],"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.0003292879,0.00006231933,0.002267834,0.00013802695,0.00007280227,0.00010352421,0.00036468095,0.072882846,0.0006494529,0.8857296,0.0026302766,0.03476944],"study_design_scores_gemma":[0.000026949994,0.00003469472,0.00039271777,0.00003137598,0.000015407617,0.000049455393,0.000021451498,0.17660616,0.00041663635,0.82179886,0.00058899575,0.000017333776],"about_ca_topic_score_codex":0.0020648597,"about_ca_topic_score_gemma":0.0020227223,"teacher_disagreement_score":0.010227935,"about_ca_system_score_codex":0.0020281505,"about_ca_system_score_gemma":0.002546362,"threshold_uncertainty_score":0.054091156},"labels":[],"label_agreement":null},{"id":"W2096609671","doi":"10.1007/978-3-642-16108-7_14","title":"PAC Learnability of a Concept Class under Non-atomic Measures: A Problem by Vidyasagar","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Countable set; Learnability; Uncountable set; Mathematics; Discrete mathematics; Dimension (graph theory); Axiom; Class (philosophy); VC dimension; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.010013552157859299,"score_gpt":0.23918485540342774,"score_spread":0.22917130324556845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096609671","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.10987642,0.005686457,0.85691,0.012408726,0.0004260751,0.000093230534,0.00035904002,0.0005120255,0.013728044],"genre_scores_gemma":[0.8061915,0.003902335,0.17237467,0.0015532232,0.0012240477,0.00028945063,0.0006948369,0.0003658085,0.013404175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956441,0.0012175586,0.00024643505,0.001457607,0.0012099998,0.00022425887],"domain_scores_gemma":[0.9624278,0.031795677,0.0007946899,0.0028573337,0.0015697047,0.0005547425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005010339,0.0010032906,0.003062916,0.0013957348,0.0026563874,0.0051182364,0.0028178096,0.0031455813,0.002124588],"category_scores_gemma":[0.034593686,0.0014121924,0.002941463,0.0031686483,0.0075352504,0.01921191,0.006001843,0.013546631,0.0004123924],"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.0002352639,0.000076762815,0.001514164,0.00028902295,0.00012417321,0.000125321,0.00066647015,0.025378123,0.0012613918,0.89323467,0.005171571,0.07192308],"study_design_scores_gemma":[0.000016826201,0.000038581806,0.0003311494,0.000026350383,0.000031855634,0.00007956914,0.000061878214,0.07421062,0.0008712149,0.9219354,0.002370768,0.00002571706],"about_ca_topic_score_codex":0.0026933802,"about_ca_topic_score_gemma":0.0013931758,"teacher_disagreement_score":0.0051182364,"about_ca_system_score_codex":0.00321244,"about_ca_system_score_gemma":0.0018881632,"threshold_uncertainty_score":0.026497483},"labels":[],"label_agreement":null},{"id":"W2097000991","doi":"10.1007/s11749-006-0042-6","title":"Strongly consistent model selection for densities","year":2007,"lang":"en","type":"article","venue":"Test","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Dimension (graph theory); Density estimation; Range (aeronautics); Selection (genetic algorithm); Multivariate statistics; Discrete mathematics; Statistical physics; Statistics; Physics; Computer science; Materials science","score_opus":0.017589846174558766,"score_gpt":0.271091627967674,"score_spread":0.2535017817931152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097000991","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.009474484,0.000425933,0.9869435,0.0012084022,0.00006286035,0.00012524794,0.00025139825,0.0008139814,0.0006941971],"genre_scores_gemma":[0.5141323,0.00083432684,0.4655256,0.0021885394,0.00077246106,0.0017123405,0.0055425945,0.001315896,0.007975812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9767395,0.018850185,0.0005791718,0.0016060261,0.0016839855,0.0005410613],"domain_scores_gemma":[0.8432124,0.14087667,0.0021243454,0.008295828,0.003975963,0.0015147823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03005022,0.0033008438,0.0056923702,0.0040764245,0.0021430575,0.0037897525,0.0078145135,0.005791141,0.0072190673],"category_scores_gemma":[0.14964096,0.0027757764,0.0028466566,0.0025800904,0.0062694564,0.0056959796,0.0071501546,0.007982038,0.0020276767],"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.0016653038,0.00048478288,0.008284042,0.00081061956,0.0013542105,0.0008795371,0.00032513743,0.4845579,0.0021076242,0.27053335,0.024717474,0.20427996],"study_design_scores_gemma":[0.00019819457,0.00010354911,0.00036815263,0.00005010661,0.00006644843,0.000094593524,0.000025216266,0.83480257,0.0005861462,0.16288945,0.00078886334,0.00002670775],"about_ca_topic_score_codex":0.0039332826,"about_ca_topic_score_gemma":0.0036618116,"teacher_disagreement_score":0.03005022,"about_ca_system_score_codex":0.0021568348,"about_ca_system_score_gemma":0.0041661016,"threshold_uncertainty_score":0.15892267},"labels":[],"label_agreement":null},{"id":"W2098000447","doi":"10.7551/mitpress/7503.003.0061","title":"A PAC-Bayes Risk Bound for General Loss Functions","year":2007,"lang":"en","type":"book-chapter","venue":"The MIT Press eBooks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"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é Laval","funders":"","keywords":"Upper and lower bounds; Bayes' theorem; Set (abstract data type); Bayesian probability; Mathematics; AdaBoost; Exponential function; Statistics; Computer science; Artificial intelligence; Mathematical analysis; Classifier (UML)","score_opus":0.03722296304277321,"score_gpt":0.27102572940868735,"score_spread":0.23380276636591413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098000447","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.0018565297,0.0034231795,0.9796848,0.0007286257,0.00020637012,0.000058885016,0.000103813756,0.00024808143,0.013689761],"genre_scores_gemma":[0.23627466,0.010039921,0.7128512,0.0023283218,0.0025009161,0.0012750572,0.00094488513,0.0013389108,0.03244608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899704,0.0026292887,0.00038684672,0.0015169862,0.0047868225,0.0007095874],"domain_scores_gemma":[0.98257357,0.012673702,0.0006106842,0.0015341521,0.0022246498,0.00038320894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009454269,0.0033173838,0.0027871921,0.0023575344,0.0014929197,0.005557836,0.003860623,0.0039677103,0.010472891],"category_scores_gemma":[0.039734602,0.001204599,0.0021159854,0.0024963408,0.0030615574,0.008992258,0.004675527,0.009275153,0.0046930434],"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.00019492394,0.00015097042,0.0008398648,0.00050664163,0.00012733818,0.0002826959,0.00023041874,0.22856453,0.0030607306,0.55107504,0.025391087,0.18957572],"study_design_scores_gemma":[0.000015426984,0.00007563038,0.00028389023,0.00020574492,0.00004394559,0.00043075264,0.000024194254,0.5978904,0.0019488169,0.38385156,0.015184503,0.000045099543],"about_ca_topic_score_codex":0.0015532773,"about_ca_topic_score_gemma":0.0012670483,"teacher_disagreement_score":0.010472891,"about_ca_system_score_codex":0.004461623,"about_ca_system_score_gemma":0.002001519,"threshold_uncertainty_score":0.049999535},"labels":[],"label_agreement":null},{"id":"W2099596552","doi":"","title":"Bootstrapping via Graph Propagation","year":2012,"lang":"en","type":"article","venue":"Summit (Simon Fraser University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bootstrapping (finance); Computer science; Graph; Classifier (UML); Artificial intelligence; Theoretical computer science; Machine learning; Algorithm; Mathematics","score_opus":0.011392372054108021,"score_gpt":0.20806482946325663,"score_spread":0.19667245740914863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099596552","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.0068914564,0.00010130393,0.99058187,0.000119201395,0.00003685851,0.000103564955,0.000088785346,0.0012762273,0.00080067426],"genre_scores_gemma":[0.24525383,0.00024004758,0.7493166,0.00032680077,0.00014585722,0.00045058032,0.0011146542,0.00042134925,0.0027302778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679476,0.0012224186,0.000121501325,0.0007745987,0.0009160873,0.00017062262],"domain_scores_gemma":[0.9900648,0.005759719,0.00049439823,0.0022352864,0.0012494505,0.00019637447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002765988,0.0011685031,0.0015243022,0.0025094359,0.0010212341,0.0014317947,0.002644984,0.0019952394,0.0024807716],"category_scores_gemma":[0.019667227,0.00057775597,0.0012645983,0.0021656447,0.0017340808,0.0028997436,0.00216033,0.0023549327,0.001990848],"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.00029708727,0.00026114585,0.003112253,0.0002894101,0.00019259418,0.0004191874,0.00027333564,0.24252126,0.014521497,0.06299314,0.01403428,0.6610849],"study_design_scores_gemma":[0.000033644952,0.000056274555,0.00032792604,0.000019472984,0.000027098338,0.00013858738,0.000026689035,0.9230855,0.005744276,0.06704281,0.0034783394,0.0000193669],"about_ca_topic_score_codex":0.0019829397,"about_ca_topic_score_gemma":0.00239009,"teacher_disagreement_score":0.002765988,"about_ca_system_score_codex":0.00072023476,"about_ca_system_score_gemma":0.00107979,"threshold_uncertainty_score":0.014628112},"labels":[],"label_agreement":null},{"id":"W2100559472","doi":"","title":"A Gradient-Based Boosting Algorithm for Regression Problems","year":2000,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":101,"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":"Boosting (machine learning); Gradient boosting; Gradient descent; Regression; Computer science; Artificial intelligence; Machine learning; Algorithm; Mathematical optimization; Mathematics; Artificial neural network; Statistics","score_opus":0.013348684554582775,"score_gpt":0.2550972427902804,"score_spread":0.24174855823569763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100559472","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.0004327326,0.0010351562,0.9965004,0.00015045471,0.000097213044,0.00007345791,0.000030251926,0.00037252138,0.0013078228],"genre_scores_gemma":[0.041480355,0.0025636614,0.9487206,0.00038547118,0.0005066749,0.0005510649,0.0003013156,0.00022995661,0.0052610245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749315,0.0010413924,0.00011654891,0.0003379388,0.000887065,0.00012397933],"domain_scores_gemma":[0.9989103,0.00054404093,0.00007454818,0.00012578945,0.00028377332,0.000061553736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003741366,0.0017923887,0.0029222157,0.0014000923,0.0007843079,0.0017045991,0.0025588644,0.002471814,0.004524992],"category_scores_gemma":[0.005423689,0.00094780326,0.0015285303,0.002289371,0.001018399,0.0018304678,0.0019261874,0.0037133219,0.005640467],"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.00012170435,0.0001913249,0.00080842886,0.0006210353,0.00031603465,0.00015209927,0.000118950054,0.30646715,0.0055947495,0.11405188,0.02807488,0.5434818],"study_design_scores_gemma":[0.00006303613,0.0001201814,0.00027012877,0.000071713235,0.000048797632,0.00018183368,0.000012721783,0.88125396,0.0018450797,0.07634361,0.03975096,0.000038071143],"about_ca_topic_score_codex":0.0014903403,"about_ca_topic_score_gemma":0.0011837628,"teacher_disagreement_score":0.004524992,"about_ca_system_score_codex":0.0006476979,"about_ca_system_score_gemma":0.0011816393,"threshold_uncertainty_score":0.019786477},"labels":[],"label_agreement":null},{"id":"W2101806650","doi":"","title":"{PAC-Bayesian Theory for Transductive Learning}","year":2014,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":25,"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é Laval; Université de Moncton","funders":"","keywords":"Artificial intelligence; Bayesian probability; Generalization; Computer science; Generalization error; Machine learning; Probably approximately correct learning; Inductive bias; Multi-task learning; Stability (learning theory); Mathematics","score_opus":0.053925697791907215,"score_gpt":0.3345362810595931,"score_spread":0.2806105832676859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101806650","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.0017145795,0.0009525932,0.98278606,0.00152486,0.00015610592,0.00004882368,0.00018493783,0.0001697114,0.012462167],"genre_scores_gemma":[0.42455068,0.006000541,0.5387126,0.005992797,0.0030588198,0.0012895064,0.0010958835,0.00072573737,0.018573277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99316686,0.0027831995,0.00023636088,0.0011200693,0.0022940594,0.00039959245],"domain_scores_gemma":[0.9873465,0.008183383,0.0007172873,0.0013943972,0.0019040938,0.00045443725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066085123,0.0023450693,0.0024585344,0.0033709435,0.0021004626,0.0060293316,0.004635679,0.003854212,0.009769985],"category_scores_gemma":[0.024845418,0.0013306963,0.0022226495,0.0034368886,0.006238237,0.0102866115,0.0048826085,0.009067939,0.0027146332],"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.000018588327,0.000023037383,0.00011286725,0.000104921295,0.00003462472,0.000043858916,0.00007500711,0.012860168,0.00024136165,0.9690263,0.0033125447,0.014146725],"study_design_scores_gemma":[0.0000049753808,0.000015335676,0.00006205638,0.000033128443,0.00001054819,0.000039465904,0.000009100275,0.07877116,0.00022342525,0.91777456,0.0030417915,0.000014427654],"about_ca_topic_score_codex":0.0024303764,"about_ca_topic_score_gemma":0.0015796046,"teacher_disagreement_score":0.009769985,"about_ca_system_score_codex":0.0033573282,"about_ca_system_score_gemma":0.0018529139,"threshold_uncertainty_score":0.0349496},"labels":[],"label_agreement":null},{"id":"W2101961482","doi":"10.1016/j.tcs.2012.10.011","title":"Learning without coding","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Numbering; Theoretical computer science; Computer science; Computable function; Coding (social sciences); Iterative learning control; Artificial intelligence; Natural language processing; Mathematics; Algorithm","score_opus":0.009088502408711367,"score_gpt":0.2651701515503501,"score_spread":0.2560816491416388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101961482","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.008742067,0.0015325826,0.8759051,0.010508679,0.0010557444,0.000090338166,0.00078675227,0.0010209787,0.100357704],"genre_scores_gemma":[0.5666062,0.003296287,0.26521742,0.005236536,0.0019764288,0.00051675335,0.002599082,0.0012336569,0.15331763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977811,0.00080759544,0.000114823284,0.00050181046,0.00063114276,0.00016366314],"domain_scores_gemma":[0.9914186,0.004291307,0.00023535464,0.0030303614,0.00082587835,0.00019851574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015993973,0.0008741128,0.00089301035,0.001220157,0.0013075947,0.002965188,0.0014220393,0.0017435986,0.017257862],"category_scores_gemma":[0.016224602,0.0005579202,0.0009896754,0.0013068464,0.004201011,0.009102668,0.0037318587,0.005038348,0.004447875],"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.000022825778,0.00001307669,0.00013842943,0.000060874318,0.000013314311,0.000023639228,0.000054659413,0.0037715642,0.00022992247,0.9418209,0.008437134,0.04541368],"study_design_scores_gemma":[0.000004144788,0.0000037290556,0.000029429923,0.000016419694,0.000004523196,0.000022824313,0.0000074901545,0.012096495,0.000286999,0.982209,0.0053144465,0.0000044440335],"about_ca_topic_score_codex":0.0016399262,"about_ca_topic_score_gemma":0.0013464354,"teacher_disagreement_score":0.017257862,"about_ca_system_score_codex":0.0015626119,"about_ca_system_score_gemma":0.0017900756,"threshold_uncertainty_score":0.057733297},"labels":[],"label_agreement":null},{"id":"W2103797923","doi":"10.1109/icdm.2009.71","title":"Active Learning with Generalized Queries","year":2009,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Oracle; Computer science; Probabilistic logic; Ask price; Construct (python library); Artificial intelligence; Active learning (machine learning); Machine learning; Information retrieval","score_opus":0.005007538961441209,"score_gpt":0.22629187500905934,"score_spread":0.22128433604761813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103797923","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.004329602,0.00035134467,0.9927463,0.00050753064,0.000049752256,0.00012854932,0.00011078897,0.0006478953,0.0011282448],"genre_scores_gemma":[0.37386116,0.0006430939,0.6155991,0.0014938711,0.0005595081,0.0012296414,0.0012356754,0.00026499975,0.0051130317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915769,0.004535366,0.000672559,0.0015715064,0.0013085699,0.00033501573],"domain_scores_gemma":[0.97274643,0.020735985,0.0010124404,0.0032065732,0.00185442,0.00044415385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007975207,0.0019697158,0.002580795,0.0013634682,0.0008014941,0.0034218323,0.0047123893,0.0035998127,0.0040489156],"category_scores_gemma":[0.030467618,0.00089535065,0.0013438681,0.001946798,0.0023336099,0.007129788,0.0035002108,0.0039516143,0.0010639034],"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.0007061494,0.0004536769,0.0025580146,0.0005721376,0.00023323452,0.00022290004,0.0006283966,0.39336228,0.002937834,0.099345766,0.016087193,0.48289245],"study_design_scores_gemma":[0.00007770667,0.00007048825,0.000085822685,0.000020924539,0.000019311532,0.000053678097,0.000045581608,0.9179989,0.0010174914,0.077649534,0.0029450054,0.0000155256],"about_ca_topic_score_codex":0.001622672,"about_ca_topic_score_gemma":0.0018935528,"teacher_disagreement_score":0.007975207,"about_ca_system_score_codex":0.0011490148,"about_ca_system_score_gemma":0.0014071628,"threshold_uncertainty_score":0.04217744},"labels":[],"label_agreement":null},{"id":"W2104291768","doi":"","title":"Randomized Experimental Design for Causal Graph Discovery","year":2014,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":11,"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":"Logarithm; Graph; Computer science; Complement (music); Comparability graph; Mathematics; Theoretical computer science; Combinatorics; Discrete mathematics; Line graph; Pathwidth","score_opus":0.02042628929663891,"score_gpt":0.2727784671030319,"score_spread":0.25235217780639296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104291768","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.011680272,0.00020189979,0.98387516,0.0007888148,0.000086796856,0.0012228201,0.00017143854,0.00030665813,0.0016661533],"genre_scores_gemma":[0.3860384,0.0003793767,0.6043751,0.0005920501,0.00021710212,0.007040646,0.00026291198,0.00009427972,0.0009999968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9295598,0.05498957,0.0017815685,0.0073616956,0.005001631,0.0013057997],"domain_scores_gemma":[0.55410236,0.37428597,0.024431905,0.039593767,0.0051937187,0.0023923318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.063548274,0.0023398742,0.002388628,0.0018046191,0.001447397,0.002680254,0.0058163796,0.00339638,0.0067512663],"category_scores_gemma":[0.23502307,0.0017285716,0.001319352,0.0015997391,0.007304707,0.0067204423,0.0036699225,0.004554027,0.0007748883],"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.0047050193,0.0013326573,0.006379976,0.0016254786,0.00065137807,0.00024647271,0.00032205833,0.3247532,0.009128816,0.57127875,0.002866557,0.07670959],"study_design_scores_gemma":[0.0011245711,0.0021508818,0.0007583995,0.000096815886,0.00017306257,0.00011716075,0.000056374647,0.52143013,0.0045072744,0.46659705,0.002916583,0.00007176928],"about_ca_topic_score_codex":0.0005570984,"about_ca_topic_score_gemma":0.000673999,"teacher_disagreement_score":0.063548274,"about_ca_system_score_codex":0.0041894154,"about_ca_system_score_gemma":0.004874994,"threshold_uncertainty_score":0.33607948},"labels":[],"label_agreement":null},{"id":"W2106886536","doi":"10.1007/978-3-540-68825-9_19","title":"Selective Sampling for Classification","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Classifier (UML); Machine learning; Artificial intelligence; Task (project management); Active learning (machine learning); Set (abstract data type); Semi-supervised learning; Process (computing)","score_opus":0.036737260978105625,"score_gpt":0.2871909328080159,"score_spread":0.25045367182991024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106886536","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.0032715674,0.0018648901,0.98765707,0.0004282656,0.0002713963,0.000088736284,0.00038493247,0.0011854263,0.0048477463],"genre_scores_gemma":[0.17248303,0.0027215083,0.7690356,0.0010648837,0.0017553223,0.000952792,0.0043269945,0.0008683109,0.0467916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978125,0.00088346784,0.000090852714,0.00052747614,0.000528623,0.00015706714],"domain_scores_gemma":[0.9962921,0.0019956855,0.00010075621,0.0011880008,0.00033513765,0.00008829629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002482272,0.001125943,0.0021209014,0.0016421981,0.0010828535,0.0017825782,0.0028264888,0.0015781042,0.012498365],"category_scores_gemma":[0.008060725,0.00072032196,0.0014149831,0.0022701803,0.0013116959,0.0021158867,0.0018530868,0.0025375192,0.006260248],"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.00021552267,0.00011373267,0.0010288251,0.00034861738,0.00014926927,0.000117737734,0.00011688545,0.03500128,0.0032063872,0.22031772,0.06848329,0.6709007],"study_design_scores_gemma":[0.000050419443,0.00007313045,0.0005310406,0.00005069997,0.000057533387,0.00023474077,0.000030394913,0.60195774,0.0030947155,0.36498916,0.028904522,0.00002583406],"about_ca_topic_score_codex":0.0022752036,"about_ca_topic_score_gemma":0.0032567978,"teacher_disagreement_score":0.012498365,"about_ca_system_score_codex":0.0010848297,"about_ca_system_score_gemma":0.0009104593,"threshold_uncertainty_score":0.041811228},"labels":[],"label_agreement":null},{"id":"W2107548906","doi":"10.1109/fuzzy.2006.1681989","title":"Fuzzy Grammar Induction from Large Corpora","year":2006,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parsing; Artificial intelligence; Generalization; Natural language processing; Grammar induction; Context (archaeology); Grammar; Rule-based machine translation; Context-free grammar; Fuzzy logic; Degree (music); Natural language; Linguistics; Mathematics","score_opus":0.006886239700385081,"score_gpt":0.21294060545177684,"score_spread":0.20605436575139177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107548906","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.013661205,0.0002111317,0.97906554,0.00022195776,0.000037883514,0.00013919995,0.0008208711,0.0041411547,0.0017010677],"genre_scores_gemma":[0.073519476,0.00019734014,0.9198489,0.0001142238,0.00004604139,0.00025932153,0.0037378485,0.0005428526,0.0017340786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820304,0.0005008771,0.00012766308,0.00055580534,0.000532207,0.00008030092],"domain_scores_gemma":[0.99343675,0.0046147923,0.00020244354,0.00078067475,0.00086528633,0.00009996596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001983653,0.00094815274,0.00091348885,0.0024895167,0.0012738239,0.0012360075,0.0016980545,0.0010359101,0.0045526763],"category_scores_gemma":[0.010548643,0.00068379263,0.0010446341,0.002186314,0.0010332124,0.0024504543,0.0018206639,0.0017661109,0.0017036549],"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.00014311612,0.00016987698,0.002830249,0.00055099616,0.00014174139,0.0009472999,0.00084261625,0.12565222,0.028397389,0.044275902,0.018779857,0.7772687],"study_design_scores_gemma":[0.00006113991,0.00004856986,0.0011629175,0.00007413156,0.00006888182,0.0003272261,0.00021118701,0.8412266,0.021605698,0.1177171,0.017451476,0.000045106],"about_ca_topic_score_codex":0.0033312344,"about_ca_topic_score_gemma":0.008201537,"teacher_disagreement_score":0.0045526763,"about_ca_system_score_codex":0.0008610184,"about_ca_system_score_gemma":0.0021263275,"threshold_uncertainty_score":0.015230179},"labels":[],"label_agreement":null},{"id":"W2110291364","doi":"10.1145/1198302.1198304","title":"Goal-oriented optimal subset selection of correlated multimedia streams","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Heuristic; Set (abstract data type); Selection (genetic algorithm); Event (particle physics); Point (geometry); Data stream mining; Function (biology); Mathematical optimization; Data mining; Machine learning; Artificial intelligence; Mathematics","score_opus":0.011183621523512911,"score_gpt":0.28356853117930186,"score_spread":0.27238490965578893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110291364","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.047035422,0.00021852815,0.94962025,0.00018234277,0.000016898022,0.00014019465,0.000064128035,0.00020735992,0.0025150287],"genre_scores_gemma":[0.76443577,0.0002848466,0.23227887,0.00011887714,0.000054889526,0.00035709512,0.00027534188,0.00011805985,0.0020763697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986891,0.00049972744,0.00006492224,0.00023278172,0.00031539728,0.00019817255],"domain_scores_gemma":[0.9976216,0.0015280043,0.00027131248,0.00012443656,0.00030116047,0.00015352975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019517739,0.0013990559,0.0014995843,0.001098347,0.0005010561,0.0012688839,0.0012990221,0.0008618704,0.0017042996],"category_scores_gemma":[0.0048639607,0.0006672702,0.00077278446,0.0009021281,0.0008064627,0.001503235,0.0013697931,0.0010181532,0.00023781299],"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.0002577046,0.00012873925,0.00091425056,0.000106642205,0.00006707161,0.00014936391,0.00013259641,0.9329342,0.005285875,0.013322301,0.0008264695,0.04587474],"study_design_scores_gemma":[0.000011569123,0.000059363723,0.00011883024,0.000007639529,0.000012689195,0.000022426198,0.000037896232,0.9930923,0.0015583786,0.004790675,0.00028235413,0.0000058334763],"about_ca_topic_score_codex":0.001836248,"about_ca_topic_score_gemma":0.0013750958,"teacher_disagreement_score":0.0019517739,"about_ca_system_score_codex":0.0009577702,"about_ca_system_score_gemma":0.0015491615,"threshold_uncertainty_score":0.010322094},"labels":[],"label_agreement":null},{"id":"W2110523400","doi":"10.1145/1143844.1143946","title":"Feature value acquisition in testing","year":2006,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Sequence (biology); Computer science; Feature (linguistics); Value (mathematics); Process (computing); Artificial intelligence; Test (biology); Order (exchange); Data mining; Test case; Machine learning; Algorithm","score_opus":0.006622177081230296,"score_gpt":0.22716732364663067,"score_spread":0.22054514656540036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110523400","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.060349505,0.0005245071,0.93416786,0.00042273273,0.00008547359,0.00022201223,0.0002970237,0.0021272134,0.0018037705],"genre_scores_gemma":[0.53523046,0.00021422458,0.46078318,0.00032436516,0.00009378351,0.0003210897,0.00077736063,0.0001622877,0.0020932017],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977774,0.0008423138,0.00018363835,0.0004866893,0.00056002877,0.00014996361],"domain_scores_gemma":[0.9873439,0.009100939,0.000690453,0.0015119446,0.001147758,0.00020501518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029735337,0.0010538413,0.0015075188,0.0012821644,0.0003941224,0.00096589717,0.0022084583,0.0014693646,0.0028351897],"category_scores_gemma":[0.01806159,0.00051192986,0.00063263316,0.0014833502,0.000943483,0.0022877913,0.0012131984,0.0013724491,0.00089733035],"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.00078554143,0.0003937873,0.009759523,0.00024608034,0.00008117879,0.00034748093,0.00014398804,0.12600386,0.011978363,0.011451392,0.005457066,0.8333518],"study_design_scores_gemma":[0.00006488052,0.0003268902,0.0024246299,0.00002791243,0.000035405155,0.00046165826,0.000049873688,0.9451647,0.018239444,0.02995497,0.003213685,0.000035804605],"about_ca_topic_score_codex":0.0020533733,"about_ca_topic_score_gemma":0.0014741023,"teacher_disagreement_score":0.0029735337,"about_ca_system_score_codex":0.0006712666,"about_ca_system_score_gemma":0.0010239761,"threshold_uncertainty_score":0.015725672},"labels":[],"label_agreement":null},{"id":"W2112284223","doi":"","title":"The Decision List Machine","year":2002,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":22,"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":"Computer science; Support vector machine; Generalization; Machine learning; Artificial intelligence; Training set; Generalization error; Classifier (UML); Data mining; Margin classifier; Structured support vector machine; Artificial neural network; Mathematics","score_opus":0.009034827736112755,"score_gpt":0.22377576784210507,"score_spread":0.21474094010599232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112284223","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.0033415789,0.0020857032,0.9824933,0.00091304077,0.00049517734,0.00014996224,0.00080416544,0.0020671645,0.0076499423],"genre_scores_gemma":[0.09779953,0.002250523,0.8851101,0.001085832,0.0008856043,0.000556507,0.0027401522,0.00027080256,0.009300875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970981,0.0008684116,0.00021251915,0.0005139524,0.0010818003,0.00022520428],"domain_scores_gemma":[0.99559325,0.0024192843,0.00026741505,0.0006267733,0.00090198644,0.00019128926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00236346,0.0010096475,0.0014135473,0.002679726,0.001074578,0.0033741982,0.0028194485,0.0018110065,0.008950069],"category_scores_gemma":[0.012017967,0.00050492445,0.0010493002,0.002764848,0.0011921007,0.0055844835,0.0023390527,0.002644544,0.0072848457],"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.00020887192,0.00012368902,0.0014212944,0.0004382659,0.000085188694,0.00012779876,0.000126201,0.037907988,0.0018070057,0.22267585,0.044731393,0.6903465],"study_design_scores_gemma":[0.00009725889,0.0001737399,0.0004938936,0.00016400102,0.00006707206,0.00042066057,0.000053748354,0.4776195,0.0063511524,0.41544095,0.09902901,0.000088998866],"about_ca_topic_score_codex":0.0010689598,"about_ca_topic_score_gemma":0.0009807962,"teacher_disagreement_score":0.008950069,"about_ca_system_score_codex":0.001048745,"about_ca_system_score_gemma":0.0015701604,"threshold_uncertainty_score":0.029940903},"labels":[],"label_agreement":null},{"id":"W2112717538","doi":"10.1145/1553374.1553413","title":"Learning to segment from a few well-selected training images","year":2009,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"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":"Magyar Tudományos Akadémia Számítástechnikai és Automatizálási Kutatóintézet","keywords":"Computer science; Artificial intelligence; Discriminative model; Market segmentation; Segmentation; Image segmentation; Oracle; Pattern recognition (psychology); Computer vision; Task (project management); Image (mathematics); Field (mathematics); Contextual image classification; Mathematics","score_opus":0.009406377697098126,"score_gpt":0.24475854151351073,"score_spread":0.2353521638164126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112717538","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.18080282,0.0008486819,0.81383634,0.00094315445,0.00005941889,0.0001303535,0.00020977994,0.0019402074,0.001229234],"genre_scores_gemma":[0.7432784,0.0004251747,0.25051737,0.0008466695,0.00023880955,0.00022389111,0.0010702589,0.00022966352,0.0031697648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989241,0.0002585275,0.00005213887,0.00051733217,0.00015616165,0.00009176507],"domain_scores_gemma":[0.99436754,0.003229715,0.0005852202,0.0010456166,0.0005088998,0.0002630429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003383473,0.0012727138,0.0019967384,0.00087489065,0.00059382926,0.0012162785,0.0024854832,0.0022271846,0.0013803723],"category_scores_gemma":[0.00816861,0.0007788471,0.0007432607,0.0007381253,0.0013774348,0.003261093,0.001254435,0.0023660902,0.0011346872],"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.0015690087,0.0011390857,0.020770175,0.00047303594,0.00034194608,0.0003345921,0.0007549561,0.26249856,0.07662835,0.007845983,0.006868466,0.6207759],"study_design_scores_gemma":[0.00006363292,0.0004802154,0.0026232656,0.000032086056,0.000079472535,0.00019243793,0.00007998478,0.9592182,0.024269998,0.011173897,0.0017514532,0.00003537766],"about_ca_topic_score_codex":0.001414193,"about_ca_topic_score_gemma":0.0026570053,"teacher_disagreement_score":0.003383473,"about_ca_system_score_codex":0.0007000666,"about_ca_system_score_gemma":0.0009830685,"threshold_uncertainty_score":0.017893732},"labels":[],"label_agreement":null},{"id":"W2113182385","doi":"10.1145/1553374.1553384","title":"Online feature elicitation in interactive optimization","year":2009,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"University of Toronto","funders":"","keywords":"Regret; Preference elicitation; Computer science; Feature (linguistics); Heuristic; Focus (optics); Set (abstract data type); Machine learning; Minimax; Artificial intelligence; Function (biology); Mathematical optimization; Mathematics; Preference","score_opus":0.006054616727109698,"score_gpt":0.27305286438205806,"score_spread":0.26699824765494834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113182385","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.020733928,0.00035890623,0.9735892,0.00039638835,0.00001649088,0.00017482652,0.000112663976,0.00028925715,0.0043284073],"genre_scores_gemma":[0.6882472,0.00034153447,0.30706796,0.00025058285,0.00006745368,0.00067912944,0.00033001378,0.00012654865,0.002889543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98816097,0.008163585,0.00039030108,0.0011106832,0.0016473697,0.0005270731],"domain_scores_gemma":[0.9723423,0.023664402,0.0009705416,0.0017488735,0.0008967674,0.00037705715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007995601,0.001478756,0.002312174,0.0009892908,0.0009779875,0.0023113922,0.002865665,0.0024683434,0.008312272],"category_scores_gemma":[0.035169546,0.0008039193,0.0010886162,0.0019591462,0.0020896879,0.004998313,0.0032589594,0.002540833,0.00074334117],"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.0010365546,0.0005136409,0.0013200255,0.000515753,0.00018974091,0.00030483818,0.0009808931,0.6574165,0.0020366714,0.17607027,0.004664629,0.15495044],"study_design_scores_gemma":[0.00008811683,0.000112591726,0.00022597113,0.000034909604,0.000026114989,0.000054529824,0.00010238355,0.83994323,0.00094459316,0.15675676,0.0016818803,0.000028943816],"about_ca_topic_score_codex":0.0029563776,"about_ca_topic_score_gemma":0.0027737366,"teacher_disagreement_score":0.008312272,"about_ca_system_score_codex":0.002270983,"about_ca_system_score_gemma":0.001476731,"threshold_uncertainty_score":0.042285323},"labels":[],"label_agreement":null},{"id":"W2116298394","doi":"10.1016/s0304-3975(99)00267-4","title":"Query learning of bounded-width OBDDs","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Calgary","keywords":"Learnability; Binary decision diagram; Equivalence (formal languages); Bounded function; Mathematics; Discrete mathematics; Combinatorics; Time complexity; Theoretical computer science; Algorithm; Computer science; Artificial intelligence","score_opus":0.0043915468152772134,"score_gpt":0.23586408441484966,"score_spread":0.23147253759957245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116298394","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.16937299,0.0027363428,0.81739575,0.002295258,0.00012621541,0.00014225957,0.0012911536,0.0025014535,0.0041385195],"genre_scores_gemma":[0.7917199,0.00091191725,0.19894919,0.0005793254,0.00016632066,0.0001450654,0.0028117786,0.0004649824,0.0042515337],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964581,0.0012006641,0.00034307266,0.0006763905,0.0009484961,0.00037329152],"domain_scores_gemma":[0.9796515,0.015020933,0.0006017138,0.002585355,0.0017913362,0.00034917056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002798061,0.0007190888,0.0021774957,0.0012456398,0.0007787113,0.0035208894,0.0030767766,0.0013440934,0.005339013],"category_scores_gemma":[0.027255699,0.0007038477,0.0014161275,0.002275195,0.0012311144,0.009390851,0.0031435054,0.002233391,0.0006521648],"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.0018238311,0.0005174645,0.009728929,0.0012920843,0.00025251744,0.00035111306,0.00092543825,0.28625894,0.006523662,0.14648329,0.020538649,0.525304],"study_design_scores_gemma":[0.000089272326,0.00008264683,0.00044989126,0.000057987658,0.0000630136,0.00014225002,0.00019942128,0.76504904,0.002978412,0.2280873,0.002784973,0.000015794829],"about_ca_topic_score_codex":0.0027476065,"about_ca_topic_score_gemma":0.0040278593,"teacher_disagreement_score":0.005339013,"about_ca_system_score_codex":0.0017379946,"about_ca_system_score_gemma":0.0014375686,"threshold_uncertainty_score":0.01786083},"labels":[],"label_agreement":null},{"id":"W2116493296","doi":"10.1145/335191.335409","title":"XTRACT","year":2000,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":202,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; XML validation; Document Structure Description; Document type definition; RELAX NG; XML Schema Editor; Well-formed document; XML Schema (W3C); Streaming XML; XML; Information retrieval; Programming language; Simple API for XML; Efficient XML Interchange; XML database; XML Signature; World Wide Web","score_opus":0.010340759165822527,"score_gpt":0.24748946711200087,"score_spread":0.23714870794617834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116493296","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.0038420162,0.0016874342,0.46492332,0.0021098177,0.0015109935,0.00076432247,0.047426786,0.39055887,0.0871764],"genre_scores_gemma":[0.06455163,0.0032887494,0.45505536,0.002851344,0.00090719457,0.0014040242,0.29233906,0.06987658,0.10972606],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99645114,0.0005564816,0.00033741887,0.00078689546,0.0015994415,0.0002685711],"domain_scores_gemma":[0.9952721,0.0013324555,0.000336269,0.0016800149,0.0011418713,0.00023739513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030113338,0.0016049226,0.0011287858,0.0026478022,0.0013350561,0.0059946673,0.0044262614,0.002401274,0.09221158],"category_scores_gemma":[0.015199302,0.0011082339,0.0021465293,0.0031899498,0.0009739241,0.006280416,0.0035056586,0.0028912798,0.08255686],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0006169067,0.000097695236,0.0015964333,0.00078722124,0.00011401977,0.0005178604,0.0002718069,0.0067927954,0.0045273965,0.05063822,0.6613179,0.27272174],"study_design_scores_gemma":[0.00010315516,0.00009399517,0.0006987663,0.00014519184,0.00004608314,0.000500553,0.000059825365,0.04813132,0.0076695993,0.040860407,0.90160626,0.00008482553],"about_ca_topic_score_codex":0.005217343,"about_ca_topic_score_gemma":0.0040334105,"teacher_disagreement_score":0.09221158,"about_ca_system_score_codex":0.0015295597,"about_ca_system_score_gemma":0.0025373467,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2116800676","doi":"10.48550/arxiv.1301.3890","title":"Monte Carlo Inference via Greedy Importance Sampling","year":2013,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"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":"Markov chain Monte Carlo; Monte Carlo method; Inference; Sampling (signal processing); Gibbs sampling; Computer science; Slice sampling; Importance sampling; Rejection sampling; Sampling distribution; Statistical inference; Algorithm; Greedy algorithm; Hybrid Monte Carlo; Mathematical optimization; Artificial intelligence; Mathematics; Statistics; Bayesian probability","score_opus":0.05242060392084918,"score_gpt":0.18838399190872554,"score_spread":0.13596338798787636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116800676","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.0021017585,0.00006477596,0.99703574,0.000054166077,0.000014968439,0.000024641766,0.000018212444,0.00019974505,0.00048595504],"genre_scores_gemma":[0.19799533,0.00023230677,0.79902333,0.00023047523,0.00012443372,0.0003732896,0.00024132714,0.0002261906,0.00155327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959466,0.002547898,0.00010906186,0.00042215508,0.00076623855,0.00020800305],"domain_scores_gemma":[0.98903674,0.0084834425,0.00045877567,0.0011993571,0.00061523664,0.00020655365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041984264,0.0010339776,0.0015672641,0.0013455002,0.0006822385,0.0012972659,0.002037398,0.0011745772,0.0023327465],"category_scores_gemma":[0.024169805,0.0008830538,0.0010183773,0.0014675598,0.0019084767,0.0016765305,0.0018855688,0.0022495193,0.00062997564],"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.0001766098,0.00011127757,0.0019139949,0.00017336803,0.00018256632,0.00018025805,0.00015102261,0.67255473,0.0021691918,0.21821617,0.0032961308,0.100874774],"study_design_scores_gemma":[0.000028719236,0.0000146811835,0.00009908519,0.000010721109,0.000012363752,0.000028678727,0.000004788585,0.9381665,0.0004945124,0.06035015,0.0007806077,0.0000091646125],"about_ca_topic_score_codex":0.004043735,"about_ca_topic_score_gemma":0.005495137,"teacher_disagreement_score":0.0041984264,"about_ca_system_score_codex":0.0011091537,"about_ca_system_score_gemma":0.0020952816,"threshold_uncertainty_score":0.022203684},"labels":[],"label_agreement":null},{"id":"W2118163005","doi":"","title":"Optimizing Costly Functions with Simple Constraints: A Limited-Memory Projected Quasi-Newton Algorithm","year":2009,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":222,"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 British Columbia","funders":"","keywords":"Mathematical optimization; Algorithm; Orthant; Descent direction; Mathematics; Convex function; Stochastic gradient descent; Broyden–Fletcher–Goldfarb–Shanno algorithm; Quadratic equation; Computer science; Gradient descent; Regular polygon; Applied mathematics; Artificial intelligence","score_opus":0.010177841479002678,"score_gpt":0.24216979176825956,"score_spread":0.2319919502892569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118163005","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.0027010674,0.00013656051,0.99514246,0.00015528974,0.00003327944,0.000053190182,0.000041143132,0.0003254747,0.0014115418],"genre_scores_gemma":[0.07125906,0.00016059156,0.92378706,0.00017751912,0.000052476,0.00037677438,0.00016085966,0.00028738534,0.0037383502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944144,0.00024946258,0.000018093702,0.00006202098,0.00018659649,0.000042422733],"domain_scores_gemma":[0.9986279,0.0008845103,0.00008721124,0.000116086805,0.00021863807,0.00006561651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014874699,0.0012173692,0.0016596493,0.00064756395,0.00048338162,0.0008849313,0.0020989897,0.0020984216,0.004079922],"category_scores_gemma":[0.0040975176,0.0012883296,0.0006674204,0.00077335106,0.0010187145,0.0011125728,0.001307845,0.0016302306,0.0015411583],"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.00008150313,0.000059197322,0.00022193842,0.00013737551,0.000052083462,0.00009342437,0.000056861034,0.91875166,0.0012609796,0.024152221,0.004537421,0.05059533],"study_design_scores_gemma":[0.000015159028,0.000008355771,0.000018831852,0.000004945939,0.000001905339,0.000006533884,0.0000021478165,0.9960445,0.000093647635,0.0033650033,0.00043550445,0.0000035094008],"about_ca_topic_score_codex":0.006509001,"about_ca_topic_score_gemma":0.00825369,"teacher_disagreement_score":0.006509001,"about_ca_system_score_codex":0.00079944765,"about_ca_system_score_gemma":0.0022428413,"threshold_uncertainty_score":0.013648629},"labels":[],"label_agreement":null},{"id":"W2119480209","doi":"10.1109/lgrs.2009.2021964","title":"Mine Classification With Imbalanced Data","year":2009,"lang":"en","type":"article","venue":"IEEE Geoscience and Remote Sensing Letters","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Clutter; Computer science; Sonar; One-class classification; Data mining; Statistical classification; Class (philosophy); Data set; Radar; Logistic regression; Support vector machine; Set (abstract data type); Classification rule; Artificial intelligence; Remote sensing; Pattern recognition (psychology); Machine learning; Geology","score_opus":0.022511718059118294,"score_gpt":0.25868203434994663,"score_spread":0.23617031629082835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119480209","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.31687114,0.0009914254,0.6751972,0.0014123493,0.00030626057,0.00019593153,0.0009159952,0.0013882202,0.0027215008],"genre_scores_gemma":[0.88646394,0.00030770045,0.10948173,0.0003150777,0.0003375196,0.00016689784,0.0017920908,0.00006886125,0.0010663106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957093,0.0014793742,0.00033390158,0.00091719045,0.0012340294,0.00032623645],"domain_scores_gemma":[0.98892164,0.0061058044,0.0013052948,0.0017589958,0.0016634298,0.00024482718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0079179,0.0009870275,0.0015965778,0.0025201603,0.00088441296,0.0020478053,0.0016544485,0.001638232,0.00069156295],"category_scores_gemma":[0.021357097,0.0004579384,0.0008244893,0.0024801912,0.001076514,0.0032231214,0.0022671323,0.0016776306,0.00067704933],"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.001985074,0.00083995465,0.069416195,0.00032584873,0.00029852637,0.00097520667,0.0006497305,0.3507281,0.011659559,0.007411036,0.008994017,0.5467168],"study_design_scores_gemma":[0.000042939108,0.00012705837,0.007580229,0.000021074735,0.000026960215,0.00023399273,0.00020118947,0.97234905,0.0045990013,0.012949459,0.0018383447,0.00003067766],"about_ca_topic_score_codex":0.0012268663,"about_ca_topic_score_gemma":0.0009150264,"teacher_disagreement_score":0.0079179,"about_ca_system_score_codex":0.0008853931,"about_ca_system_score_gemma":0.00059078896,"threshold_uncertainty_score":0.04187435},"labels":[],"label_agreement":null},{"id":"W2120295426","doi":"","title":"Denoising and Untangling Graphs Using Degree Priors","year":2003,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"University of Toronto","funders":"","keywords":"Inference; Prior probability; Degree (music); Computer science; Approximate inference; Graphical model; Graph; Algorithm; Set (abstract data type); Theoretical computer science; Artificial intelligence; Mathematics; Bayesian probability","score_opus":0.030812769864826426,"score_gpt":0.2621981979019841,"score_spread":0.2313854280371577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120295426","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.012640098,0.00015614735,0.986188,0.00020657224,0.000016834685,0.000012514963,0.000059002414,0.00031184903,0.00040896234],"genre_scores_gemma":[0.33096007,0.0005180225,0.66439885,0.00023677919,0.00009660199,0.00006874307,0.00052959804,0.00031521262,0.002876069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987998,0.0004308492,0.000034674904,0.00037165757,0.00027087497,0.00009218413],"domain_scores_gemma":[0.99255157,0.0053597596,0.0005487784,0.0010797449,0.00029146593,0.00016868737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025380468,0.0009573199,0.001227561,0.0012351237,0.000617715,0.001175289,0.002799385,0.0021579333,0.0012259352],"category_scores_gemma":[0.012069757,0.0010474025,0.0011263106,0.0011876175,0.001922923,0.004172986,0.0020143487,0.0029933853,0.00054271624],"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.00025670452,0.000065002816,0.0019118614,0.0001455313,0.00007020461,0.00019358935,0.00028701793,0.7724432,0.010789914,0.08048147,0.0015794134,0.13177608],"study_design_scores_gemma":[0.000011710135,0.000017158092,0.0002546388,0.000008121908,0.000008236335,0.00006354827,0.000013473656,0.9236016,0.0025363353,0.07274903,0.0007231078,0.000013062005],"about_ca_topic_score_codex":0.0036504832,"about_ca_topic_score_gemma":0.0043307887,"teacher_disagreement_score":0.0036504832,"about_ca_system_score_codex":0.0010273067,"about_ca_system_score_gemma":0.0006930359,"threshold_uncertainty_score":0.013422608},"labels":[],"label_agreement":null},{"id":"W2120311929","doi":"10.16995/dscn.247","title":"NUMEXCO: A Text Mining Approach to Thematic Analysis of a Philosophical Corpus","year":2005,"lang":"en","type":"article","venue":"Digital Studies / Le champ numérique","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Thematic analysis; Software; Thematic map; Modular design; Data science; Corpus linguistics; Natural language processing; Artificial intelligence; Sociology; Qualitative research; Social science; Programming language; Cartography","score_opus":0.028250558886101083,"score_gpt":0.2763301992438175,"score_spread":0.24807964035771643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120311929","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.10020304,0.0012364937,0.7127362,0.0026020044,0.00046037693,0.0029684212,0.103704445,0.021264402,0.054824594],"genre_scores_gemma":[0.117991515,0.0005038377,0.7996844,0.00020891998,0.00010024454,0.0026263094,0.06104839,0.0027257623,0.015110679],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981275,0.0006698979,0.00025149432,0.00037973913,0.0005012272,0.00007009428],"domain_scores_gemma":[0.9918881,0.0053353286,0.00048155946,0.00086785085,0.0011213252,0.00030582616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032528143,0.0005554053,0.0005576568,0.007508602,0.002030046,0.003419893,0.0010711679,0.0005690332,0.01332002],"category_scores_gemma":[0.012319814,0.00043210617,0.00063267845,0.0061140764,0.0009996236,0.003443977,0.0031501437,0.0012408852,0.0040661134],"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.0005324019,0.0002428698,0.008299462,0.003005027,0.00013137239,0.0008059037,0.019442616,0.0013734682,0.03325834,0.08644039,0.083575375,0.76289284],"study_design_scores_gemma":[0.00012546348,0.00014082796,0.016876044,0.0008782459,0.00015304513,0.0012681204,0.014723015,0.04324812,0.03086652,0.06087605,0.83068633,0.00015825743],"about_ca_topic_score_codex":0.00279182,"about_ca_topic_score_gemma":0.0074675707,"teacher_disagreement_score":0.01332002,"about_ca_system_score_codex":0.0011476366,"about_ca_system_score_gemma":0.0030539772,"threshold_uncertainty_score":0.044559956},"labels":[],"label_agreement":null},{"id":"W2122020121","doi":"10.1109/icmlc.2007.4370125","title":"Using Learning Automata to Model a Domain in a Tutorial-<i>Like</i> System","year":2007,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Domain (mathematical analysis); Artificial intelligence; Process (computing); Programming language; Mathematics","score_opus":0.01910786641398224,"score_gpt":0.28884089461616425,"score_spread":0.26973302820218203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122020121","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.02137786,0.00013690899,0.9643387,0.0004230324,0.000076745026,0.00014529908,0.00024753902,0.0037240502,0.009529782],"genre_scores_gemma":[0.34349704,0.00043063873,0.6352656,0.0003334995,0.00006349759,0.000698989,0.0011672375,0.00039899768,0.018144524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919194,0.0003411262,0.00007236053,0.00020661307,0.00012780284,0.00006019863],"domain_scores_gemma":[0.9988589,0.00056510785,0.00007816175,0.00020984802,0.00020174922,0.000086248525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093879236,0.00057211565,0.00039758265,0.00064318517,0.0005876816,0.0023816251,0.0015743528,0.001427296,0.0057536527],"category_scores_gemma":[0.0027948017,0.00034881954,0.00085551786,0.00039690896,0.0010590395,0.003761781,0.001419591,0.0012861516,0.0018181292],"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.00027458908,0.00046619415,0.0038482558,0.00052794535,0.00010139431,0.0007882073,0.0018720573,0.39914218,0.02502322,0.44212383,0.006913341,0.11891879],"study_design_scores_gemma":[0.000038920592,0.00012607819,0.0002956618,0.00006480721,0.000041133437,0.00016380603,0.00012906572,0.8873156,0.010127944,0.065433376,0.03621878,0.00004490469],"about_ca_topic_score_codex":0.005225611,"about_ca_topic_score_gemma":0.0051683025,"teacher_disagreement_score":0.0057536527,"about_ca_system_score_codex":0.0013468086,"about_ca_system_score_gemma":0.0012949439,"threshold_uncertainty_score":0.01924795},"labels":[],"label_agreement":null},{"id":"W2123046986","doi":"","title":"Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms: An Initial Investigation ∗","year":2006,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"","keywords":"Computer science; Algorithm; Machine learning; Parametric statistics; Randomized algorithm; Artificial intelligence; Mathematics; Statistics","score_opus":0.009951827015683389,"score_gpt":0.2438050837366216,"score_spread":0.2338532567209382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123046986","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.45773098,0.0026346918,0.5170919,0.001931901,0.000122068464,0.00028744817,0.00081473205,0.008396483,0.01098985],"genre_scores_gemma":[0.9160483,0.0002751896,0.08202328,0.00011955818,0.000043804623,0.00014979717,0.00046641545,0.0003554793,0.00051820284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9912549,0.004175616,0.00040959884,0.0015951591,0.0019955088,0.00056917407],"domain_scores_gemma":[0.9475204,0.031693418,0.0025390096,0.015351987,0.002573087,0.0003221911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009691469,0.0013305658,0.0011746914,0.0010411454,0.0006378827,0.0025512632,0.0031457385,0.0018258656,0.00274769],"category_scores_gemma":[0.052693263,0.00074796553,0.0009471948,0.0013776335,0.0011817844,0.0051627886,0.0011704972,0.0026330987,0.00070720917],"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.0006142819,0.0007187041,0.011403157,0.00022776537,0.00009688663,0.00007257429,0.00012890522,0.8270511,0.00638398,0.015540012,0.0030326808,0.13472989],"study_design_scores_gemma":[0.000022634309,0.000115746996,0.0008026714,0.000011479669,0.0000069252824,0.000022039001,0.000014541544,0.99125457,0.002282893,0.0049439627,0.00051054434,0.00001190299],"about_ca_topic_score_codex":0.003162228,"about_ca_topic_score_gemma":0.0033092017,"teacher_disagreement_score":0.009691469,"about_ca_system_score_codex":0.002246482,"about_ca_system_score_gemma":0.002219641,"threshold_uncertainty_score":0.051253974},"labels":[],"label_agreement":null},{"id":"W2123952665","doi":"10.1109/tsmcb.2009.2013723","title":"Achieving Microaggregation for Secure Statistical Databases Using Fixed-Structure Partitioning-Based Learning Automata","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Learning automata; Database; Automaton; Data mining; Theoretical computer science","score_opus":0.021009208168299733,"score_gpt":0.2734805969734777,"score_spread":0.252471388805178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123952665","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.051971257,0.00016026855,0.94630545,0.00021664385,0.000018054006,0.0000704182,0.00006718941,0.0004745612,0.00071609434],"genre_scores_gemma":[0.81218827,0.00012957433,0.18635435,0.00008850791,0.000024649073,0.00019565494,0.00015571607,0.00004458359,0.0008185999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980755,0.00072509074,0.00021635683,0.000398541,0.00041227756,0.00017234903],"domain_scores_gemma":[0.9907987,0.005963999,0.0007615805,0.0014989967,0.000733342,0.00024336537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025032845,0.0005905846,0.0013746833,0.00078520225,0.00091511226,0.0016235767,0.0014858186,0.0011200886,0.001199721],"category_scores_gemma":[0.010303437,0.0003882067,0.0008464851,0.0010568348,0.0012710976,0.0023887656,0.0024379175,0.0011154265,0.0003094188],"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.00020235882,0.00009649015,0.0021881822,0.00009616751,0.00007306284,0.00015085445,0.0003032894,0.85578865,0.0045282827,0.036958624,0.0008826203,0.09873145],"study_design_scores_gemma":[0.000009210838,0.000037328697,0.000108224405,0.000004265383,0.000007261344,0.00003654858,0.000029129036,0.9809887,0.0016755579,0.016770808,0.0003257993,0.000007243575],"about_ca_topic_score_codex":0.001849482,"about_ca_topic_score_gemma":0.0018763177,"teacher_disagreement_score":0.0025032845,"about_ca_system_score_codex":0.0011455008,"about_ca_system_score_gemma":0.0015015862,"threshold_uncertainty_score":0.013238847},"labels":[],"label_agreement":null},{"id":"W2124730187","doi":"10.1504/ijcat.2013.055325","title":"Active AODE learning based on a novel sampling strategy and its application","year":2013,"lang":"en","type":"article","venue":"International Journal of Computer Applications in Technology","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Sampling (signal processing); Computer vision","score_opus":0.011503814295189369,"score_gpt":0.29287908091216813,"score_spread":0.28137526661697876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124730187","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.0029748029,0.00018176335,0.9963032,0.00008351746,0.0000183672,0.000020278781,0.000009288119,0.00010618098,0.00030269733],"genre_scores_gemma":[0.44416073,0.0006545595,0.5508713,0.00044624973,0.00018994973,0.00031154367,0.00024739833,0.00012141973,0.0029968664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790597,0.00082468364,0.00013912223,0.00044674627,0.0005723694,0.00011118544],"domain_scores_gemma":[0.9940838,0.0038386316,0.00027325272,0.00050428923,0.0011390434,0.00016092065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035232878,0.0008159707,0.001442594,0.0012279465,0.0005462379,0.0012204237,0.0025906542,0.0014539196,0.0010796434],"category_scores_gemma":[0.010628055,0.00055557897,0.0008948539,0.00089520146,0.0012866907,0.0025173475,0.0018156914,0.0016235048,0.0003549165],"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.00025879566,0.00030855474,0.0046587107,0.00027772615,0.00018499888,0.00017386388,0.00030905716,0.44032016,0.013033259,0.06918104,0.0024699664,0.4688239],"study_design_scores_gemma":[0.000007781184,0.000025053687,0.00010245586,0.000004913291,0.000007588953,0.000029554063,0.000004492988,0.99387676,0.0013400946,0.0040289317,0.0005642848,0.000008082413],"about_ca_topic_score_codex":0.0017837844,"about_ca_topic_score_gemma":0.0015906456,"teacher_disagreement_score":0.0035232878,"about_ca_system_score_codex":0.00066501304,"about_ca_system_score_gemma":0.00067777047,"threshold_uncertainty_score":0.018633187},"labels":[],"label_agreement":null},{"id":"W2124856856","doi":"10.1016/j.tcs.2005.10.014","title":"Maximizing agreements and coagnostic learning","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Artificial intelligence; Natural language processing; Mathematical economics; Mathematics","score_opus":0.005471975983276587,"score_gpt":0.2387742020984049,"score_spread":0.2333022261151283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124856856","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.08956287,0.0011220829,0.8232295,0.010179063,0.00020571265,0.00014724408,0.0003145546,0.00057457876,0.07466439],"genre_scores_gemma":[0.90042967,0.00080685,0.06910426,0.0012558387,0.00041199572,0.00038265224,0.00024453254,0.00027253572,0.027091801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895559,0.006714197,0.00036807745,0.0012836285,0.0013712755,0.0007070232],"domain_scores_gemma":[0.91167796,0.070368394,0.0037323167,0.009074344,0.0029178183,0.002229176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0121096,0.00090638397,0.0024250054,0.0012974631,0.002122947,0.004180979,0.0033838763,0.0042933864,0.012003673],"category_scores_gemma":[0.07234951,0.0009029653,0.0010146976,0.002387031,0.005244993,0.011332256,0.0056556994,0.0059122434,0.0014866507],"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.00006870765,0.000050040246,0.00044609385,0.000046526467,0.0000209309,0.000039695296,0.000141278,0.008114782,0.00010853875,0.9718531,0.0026110697,0.01649922],"study_design_scores_gemma":[0.000011045597,0.0000066675466,0.00006223553,0.0000075702865,0.0000039274387,0.000023676048,0.000018137933,0.016320756,0.000061146035,0.98272187,0.00075886503,0.0000040399395],"about_ca_topic_score_codex":0.00091839,"about_ca_topic_score_gemma":0.000899401,"teacher_disagreement_score":0.0121096,"about_ca_system_score_codex":0.0021918819,"about_ca_system_score_gemma":0.002082282,"threshold_uncertainty_score":0.06404239},"labels":[],"label_agreement":null},{"id":"W2125291716","doi":"10.1007/978-3-642-02172-5_1","title":"Inference and Learning for Active Sensing, Experimental Design and Control","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"","keywords":"Computer science; Inference; Artificial intelligence; Optimal control; Nonlinear system; Machine learning; Gaussian; Range (aeronautics); Active learning (machine learning); Control (management); Actuator; Mathematical optimization; Engineering; Mathematics","score_opus":0.014819154625114316,"score_gpt":0.2671591383307689,"score_spread":0.2523399837056546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125291716","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.00030459868,0.00033457702,0.9987889,0.000084267005,0.000022838301,0.000015965337,0.000021642796,0.00010116296,0.0003260374],"genre_scores_gemma":[0.10690555,0.001370839,0.8842417,0.0002606394,0.00031621393,0.0006952737,0.00024968083,0.00015727122,0.0058028484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668545,0.001741498,0.0002568401,0.00063442346,0.00057037926,0.00011138716],"domain_scores_gemma":[0.98252386,0.014531267,0.0005839189,0.0015168831,0.0007096147,0.00013441526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008280795,0.0017874782,0.0027706283,0.0011401632,0.000757665,0.0026094103,0.003906265,0.0030492612,0.0053487075],"category_scores_gemma":[0.023792112,0.0017248105,0.0019304327,0.0012330103,0.003729569,0.0039759236,0.0024179213,0.0035180538,0.00113119],"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.00016962207,0.00015570637,0.0004947961,0.00087269384,0.00021134294,0.000074345604,0.00021447425,0.25089425,0.0020770892,0.5241015,0.003987254,0.21674699],"study_design_scores_gemma":[0.000021130962,0.00003101001,0.000094103525,0.000027375558,0.000025288304,0.000027533937,0.000011299904,0.6990688,0.00079737644,0.29776824,0.0021144229,0.0000134074435],"about_ca_topic_score_codex":0.0028466037,"about_ca_topic_score_gemma":0.0029586342,"teacher_disagreement_score":0.008280795,"about_ca_system_score_codex":0.0017837196,"about_ca_system_score_gemma":0.0017725307,"threshold_uncertainty_score":0.04379356},"labels":[],"label_agreement":null},{"id":"W2126472279","doi":"10.1016/j.ic.2007.06.002","title":"Some natural conditions on incremental learning","year":2007,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National University of Singapore","keywords":"Natural (archaeology); Computer science; Artificial intelligence; Geology","score_opus":0.006486232717059994,"score_gpt":0.26785870355440244,"score_spread":0.26137247083734244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126472279","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.049156085,0.002474113,0.85381126,0.011475575,0.0008779618,0.0003092945,0.0019835266,0.0010770968,0.07883509],"genre_scores_gemma":[0.7274346,0.003503174,0.22934982,0.0043637636,0.004181703,0.0017387394,0.0041007902,0.00088144775,0.024446007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651825,0.0010894368,0.00037600345,0.0008348471,0.00083938165,0.00034207987],"domain_scores_gemma":[0.95070225,0.038766604,0.001269214,0.0037515515,0.0041712956,0.0013389932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065548373,0.00096173736,0.0016336845,0.0027695089,0.002557628,0.004742908,0.002814384,0.0030622345,0.020155713],"category_scores_gemma":[0.0536829,0.00093370466,0.0021205996,0.003159761,0.004989357,0.018089214,0.0049789073,0.005471168,0.0017319856],"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.000061980834,0.000037840204,0.00029085303,0.0000896477,0.000011286138,0.00008986812,0.00015342642,0.00096473884,0.00025392926,0.98511827,0.0042204885,0.008707814],"study_design_scores_gemma":[0.00002794795,0.00001913284,0.00015100194,0.000027842416,0.000012542058,0.000104640974,0.000057711462,0.011242614,0.00041564403,0.9852149,0.002713113,0.000012838824],"about_ca_topic_score_codex":0.0013773718,"about_ca_topic_score_gemma":0.001424825,"teacher_disagreement_score":0.020155713,"about_ca_system_score_codex":0.0016737378,"about_ca_system_score_gemma":0.001724249,"threshold_uncertainty_score":0.067427516},"labels":[],"label_agreement":null},{"id":"W2127163205","doi":"10.1145/1102351.1102412","title":"PAC-Bayes risk bounds for sample-compressed Gibbs classifiers","year":2005,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Université Laval","funders":"","keywords":"Bayes' theorem; Gibbs sampling; Computer science; Naive Bayes classifier; Sample (material); Artificial intelligence; Pattern recognition (psychology); Machine learning; Bayesian probability; Support vector machine; Physics","score_opus":0.010619508158807396,"score_gpt":0.2574498896767193,"score_spread":0.2468303815179119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127163205","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.006103491,0.0022195687,0.9829746,0.0014654994,0.00015295493,0.0000756914,0.00016709464,0.0002874715,0.0065536723],"genre_scores_gemma":[0.3947695,0.0057338886,0.57455266,0.0023965307,0.0022676205,0.0014906946,0.0016857086,0.0010859647,0.016017439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895654,0.0034993181,0.0004284282,0.0013003917,0.0046119187,0.0005944484],"domain_scores_gemma":[0.95161855,0.03920404,0.0016103165,0.0031804352,0.0037010799,0.0006856627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012937688,0.0021727092,0.0030469715,0.0023386779,0.0015443696,0.004198614,0.0037874107,0.0034311707,0.006576824],"category_scores_gemma":[0.08043876,0.0012573021,0.0017549185,0.0022559187,0.0046597696,0.010038896,0.0045903632,0.008017263,0.0016809378],"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.00033962086,0.00009763387,0.0013340113,0.00028556248,0.00013836082,0.00019713557,0.00026581026,0.27680898,0.0011619458,0.62753403,0.0076959766,0.084140934],"study_design_scores_gemma":[0.00002528413,0.00003730877,0.00024731294,0.00006313716,0.000029876603,0.00012464444,0.00001743498,0.6199185,0.00085620565,0.37626123,0.002391062,0.000028008957],"about_ca_topic_score_codex":0.0027039123,"about_ca_topic_score_gemma":0.0022368704,"teacher_disagreement_score":0.012937688,"about_ca_system_score_codex":0.005689386,"about_ca_system_score_gemma":0.0026336121,"threshold_uncertainty_score":0.0684219},"labels":[],"label_agreement":null},{"id":"W2128274109","doi":"","title":"A PAC-Bayes approach to the Set Covering Machine","year":2005,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"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; Université Laval","funders":"","keywords":"Bayes' theorem; Computer science; Margin (machine learning); Naive Bayes classifier; Perspective (graphical); Machine learning; Set (abstract data type); Artificial intelligence; Bayesian probability; Data mining; Support vector machine","score_opus":0.014724869340385686,"score_gpt":0.24588148723495934,"score_spread":0.23115661789457365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128274109","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.0010501461,0.0001791463,0.9968562,0.00023244467,0.000048654932,0.000024024504,0.000020756805,0.000085726286,0.0015028961],"genre_scores_gemma":[0.12983128,0.000974218,0.86270255,0.00063121505,0.00060978555,0.00040061332,0.00021666731,0.00019688858,0.0044367053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556786,0.0017910659,0.00015885111,0.0005478738,0.0017167254,0.00021766401],"domain_scores_gemma":[0.993433,0.004389092,0.00032526843,0.0007220478,0.00092688244,0.00020360021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004137788,0.0010342273,0.0022877837,0.0013362156,0.0010391452,0.0022883194,0.002934759,0.0023858072,0.0033314626],"category_scores_gemma":[0.017407982,0.0008363489,0.0012606622,0.0016638626,0.0021958954,0.004596592,0.0026300037,0.0035991045,0.0011688459],"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.00009277901,0.00008140932,0.00063069694,0.00022962742,0.00008509862,0.00016348498,0.00020492541,0.26577252,0.0026223925,0.5407827,0.009479194,0.17985515],"study_design_scores_gemma":[0.000008276255,0.00003232421,0.000074060175,0.000026557438,0.000012038665,0.00013673057,0.000011096516,0.8018308,0.0013690515,0.19252704,0.00395567,0.000016345532],"about_ca_topic_score_codex":0.00082897244,"about_ca_topic_score_gemma":0.0007680367,"teacher_disagreement_score":0.004137788,"about_ca_system_score_codex":0.0012368525,"about_ca_system_score_gemma":0.0012725318,"threshold_uncertainty_score":0.021882951},"labels":[],"label_agreement":null},{"id":"W2129911503","doi":"","title":"A Transductive Bound for the Voted Classifier with an Application to Semi-supervised Learning","year":2008,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":21,"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é Laval","funders":"","keywords":"Classifier (UML); Upper and lower bounds; Artificial intelligence; Margin classifier; Decision boundary; Margin (machine learning); Computer science; Machine learning; Pattern recognition (psychology); Linear classifier; Training set; Mathematics; Algorithm","score_opus":0.018029664824879752,"score_gpt":0.2559521503137447,"score_spread":0.23792248548886494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129911503","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.0015093386,0.0003627688,0.99687743,0.00024690953,0.000044983113,0.000032539247,0.000023835324,0.0001687698,0.00073337666],"genre_scores_gemma":[0.2817878,0.0010874437,0.70904195,0.0010123512,0.00090277306,0.0008236635,0.000443212,0.00065489963,0.0042459397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98064995,0.008296128,0.00085545256,0.0029677195,0.006404304,0.0008263954],"domain_scores_gemma":[0.94876754,0.036699384,0.0019443255,0.0052203336,0.0063932994,0.00097508717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017787354,0.0022629015,0.0036557156,0.0045097778,0.0014554745,0.005344361,0.0065372954,0.0053161397,0.0036629806],"category_scores_gemma":[0.07050611,0.0013643482,0.0026787554,0.0027189236,0.006485833,0.008635756,0.00794541,0.008188355,0.00150894],"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.00030130488,0.00017237417,0.0016391654,0.00044292622,0.0002928091,0.00019990644,0.0004605462,0.501766,0.0049189082,0.34003985,0.0044887187,0.14527743],"study_design_scores_gemma":[0.000012353153,0.000054665732,0.000107776796,0.000044091434,0.000018303359,0.000050509152,0.000012645617,0.9243307,0.0011617703,0.073069334,0.0011112528,0.00002659164],"about_ca_topic_score_codex":0.0013128439,"about_ca_topic_score_gemma":0.0011412677,"teacher_disagreement_score":0.017787354,"about_ca_system_score_codex":0.00440239,"about_ca_system_score_gemma":0.0020258597,"threshold_uncertainty_score":0.09406966},"labels":[],"label_agreement":null},{"id":"W2129968541","doi":"10.1109/tsmcb.2009.2032414","title":"Modeling a Student–Classroom Interaction in a Tutorial-<i>Like</i> System Using Learning Automata","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Hierarchy; Context (archaeology); Process (computing); Mathematics education; Learning environment; Psychology","score_opus":0.01987429936882729,"score_gpt":0.2702755236944176,"score_spread":0.2504012243255903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129968541","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.17847139,0.0002607882,0.79019463,0.0009998888,0.00010753369,0.00022769332,0.00035301535,0.0012610713,0.028123999],"genre_scores_gemma":[0.9225824,0.00019453102,0.06259285,0.00016321446,0.000042476575,0.00031585564,0.00024340811,0.00008284451,0.013782429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993036,0.0002870274,0.000037730493,0.00016371117,0.00010292514,0.00010503706],"domain_scores_gemma":[0.99876827,0.0006774642,0.00011329112,0.000101390346,0.00018537026,0.00015415454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010162784,0.0005070681,0.0005221208,0.00042512224,0.0006783094,0.002017624,0.0014950957,0.0016379209,0.0097686425],"category_scores_gemma":[0.0020553255,0.0002831017,0.00069994957,0.00024309955,0.0009409277,0.0017179921,0.0016052871,0.0009869477,0.0011059501],"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.00027910218,0.00035282227,0.005729884,0.00018977908,0.0001163065,0.00082859537,0.0012401022,0.77542937,0.00845993,0.18197227,0.0021415025,0.023260372],"study_design_scores_gemma":[0.000027474316,0.00009092853,0.00036943017,0.000015805681,0.000023095925,0.000053672396,0.00009647782,0.9826293,0.0010339102,0.012876629,0.0027667063,0.000016566391],"about_ca_topic_score_codex":0.008031436,"about_ca_topic_score_gemma":0.0057507893,"teacher_disagreement_score":0.0097686425,"about_ca_system_score_codex":0.0012168173,"about_ca_system_score_gemma":0.00136619,"threshold_uncertainty_score":0.03267932},"labels":[],"label_agreement":null},{"id":"W2130400275","doi":"10.1109/32.888631","title":"A learning agent that assists the browsing of software libraries","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Software Engineering","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":46,"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":"Computer science; Software; Similarity (geometry); World Wide Web; Information retrieval; Human–computer interaction; Artificial intelligence; Programming language","score_opus":0.010120749815697744,"score_gpt":0.20454357418451105,"score_spread":0.1944228243688133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130400275","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.23626418,0.00046707742,0.72430396,0.00064189994,0.000088987974,0.0005676953,0.00025561033,0.022611918,0.014798672],"genre_scores_gemma":[0.458794,0.00025316665,0.52678216,0.0003289551,0.000063950996,0.00018173002,0.00036157013,0.00026443505,0.012970008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959224,0.00011270141,0.000027542339,0.00010439024,0.00012717559,0.00003597063],"domain_scores_gemma":[0.9969406,0.0016182411,0.0003427331,0.00037529244,0.0004200081,0.00030313202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010084122,0.0005725755,0.00068879285,0.00066702295,0.0004716116,0.00081165205,0.0014488085,0.0013606683,0.0041021165],"category_scores_gemma":[0.005849833,0.00033755036,0.00023604915,0.0005949257,0.0004082149,0.0020035545,0.0007686495,0.0011529614,0.0025506138],"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.0009559343,0.0026120546,0.013648884,0.0003660117,0.00007074352,0.0005000638,0.0007176533,0.016412184,0.040300686,0.003513203,0.011130496,0.9097721],"study_design_scores_gemma":[0.0003853738,0.0015927067,0.005621688,0.00007917842,0.00020098283,0.0017133942,0.00039212426,0.8666246,0.07353491,0.0058398214,0.043905806,0.00010944382],"about_ca_topic_score_codex":0.0016756152,"about_ca_topic_score_gemma":0.003408259,"teacher_disagreement_score":0.0041021165,"about_ca_system_score_codex":0.00028062484,"about_ca_system_score_gemma":0.0009172698,"threshold_uncertainty_score":0.013722956},"labels":[],"label_agreement":null},{"id":"W2131854866","doi":"","title":"Using matrices to model symbolic relationship","year":2008,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":24,"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":"Generalization; Wife; Order (exchange); Novelty; Computer science; The Symbolic; Modular design; Multiplication (music); Matrix (chemical analysis); Algebra over a field; Theoretical computer science; Artificial intelligence; Mathematics; Pure mathematics; Psychology; Social psychology; Combinatorics; Programming language","score_opus":0.09678032387449856,"score_gpt":0.31852251884654725,"score_spread":0.2217421949720487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131854866","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.013348935,0.00019404886,0.9787158,0.0004051471,0.00007638749,0.000057174442,0.00044347244,0.0020525197,0.0047065304],"genre_scores_gemma":[0.3152417,0.00044293026,0.67569,0.00024423405,0.00009140828,0.00030140922,0.0013996026,0.00019934696,0.0063893986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938977,0.00017731125,0.00004114591,0.00019576281,0.00015726774,0.000038775586],"domain_scores_gemma":[0.9985322,0.00072803156,0.00018186987,0.0002875162,0.00020258424,0.00006779137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061355316,0.0010246397,0.00040850003,0.0012739799,0.00059776334,0.0014692232,0.0015861298,0.0008966355,0.010396214],"category_scores_gemma":[0.0058055203,0.00043218897,0.0008000859,0.0012465887,0.001009545,0.0048357025,0.0013854925,0.0015320634,0.0025096745],"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.00025966964,0.00013941863,0.004071065,0.00043751168,0.00013104764,0.0004391156,0.0009152776,0.12457832,0.017157381,0.32132822,0.012481355,0.51806164],"study_design_scores_gemma":[0.00002307216,0.00009641864,0.000534885,0.00005893762,0.000031280822,0.0002489625,0.00011927251,0.6820149,0.0074585755,0.28617442,0.02319797,0.00004131897],"about_ca_topic_score_codex":0.003180548,"about_ca_topic_score_gemma":0.004893649,"teacher_disagreement_score":0.010396214,"about_ca_system_score_codex":0.00074034545,"about_ca_system_score_gemma":0.0007072648,"threshold_uncertainty_score":0.034778774},"labels":[],"label_agreement":null},{"id":"W2131930295","doi":"","title":"Methods of Moments for Learning Stochastic Languages: Unified Presentation and Empirical Comparison","year":2014,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":28,"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; Probabilistic logic; Machine learning; Artificial intelligence; Latent variable; Context (archaeology); Moment (physics); Statistical model; Maximization; Expectation–maximization algorithm; Variable (mathematics); Maxima and minima; Presentation (obstetrics); Mathematical optimization; Mathematics; Maximum likelihood","score_opus":0.03888286568339164,"score_gpt":0.4344807903260029,"score_spread":0.39559792464261123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131930295","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.004515727,0.008275826,0.98294985,0.0009696019,0.00016724429,0.00008408255,0.00015455682,0.00038864106,0.0024945075],"genre_scores_gemma":[0.20522879,0.015959559,0.77126056,0.00058550504,0.0016366923,0.00090273627,0.0009816966,0.0009432011,0.0025012358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990729,0.005865101,0.00040634445,0.00061720744,0.0021851792,0.00019713312],"domain_scores_gemma":[0.94757277,0.042684052,0.0029188527,0.0037196637,0.0027410437,0.00036354942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018295947,0.002137602,0.0018325661,0.005433593,0.00083090924,0.0042987224,0.0026012186,0.0037311318,0.0052622147],"category_scores_gemma":[0.08523476,0.0008179184,0.0012260829,0.0050836024,0.0030931556,0.008819629,0.004332187,0.0046314346,0.0018080203],"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.0001862999,0.0001325452,0.0036824525,0.00082808686,0.00019127072,0.00016530023,0.0005543939,0.10962942,0.0021376275,0.69986856,0.011294777,0.17132922],"study_design_scores_gemma":[0.000039350507,0.0001813747,0.0023924925,0.0004203288,0.00006822014,0.0006549955,0.0001671326,0.5854354,0.0018823069,0.3920899,0.016502552,0.0001660296],"about_ca_topic_score_codex":0.0008306199,"about_ca_topic_score_gemma":0.0005953756,"teacher_disagreement_score":0.018295947,"about_ca_system_score_codex":0.0017694505,"about_ca_system_score_gemma":0.0010745253,"threshold_uncertainty_score":0.09675938},"labels":[],"label_agreement":null},{"id":"W2132632935","doi":"10.1109/icsmc.2007.4413769","title":"Using learning automata to model the behavior of a teacher in a tutorial-like system","year":2007,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Carleton University","funders":"","keywords":"Novelty; Computer science; Process (computing); Benchmark (surveying); Domain (mathematical analysis); Convergence (economics); Salient; Mathematics education; Field (mathematics); Automaton; Socratic method; Artificial intelligence; Human–computer interaction; Psychology; Mathematics","score_opus":0.028619813251642704,"score_gpt":0.3093328426105539,"score_spread":0.2807130293589112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132632935","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.12602809,0.00020881338,0.8638431,0.00028481503,0.00006102706,0.00012532968,0.00020616679,0.0014941597,0.007748543],"genre_scores_gemma":[0.92965376,0.00021013296,0.06298372,0.00006517032,0.000028060485,0.0002903056,0.00015837091,0.00010717456,0.006503386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943763,0.00022048908,0.0000395199,0.00012974127,0.00008816431,0.000084381514],"domain_scores_gemma":[0.9985424,0.00081741845,0.00016292774,0.0001535998,0.00021799063,0.00010563367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069597195,0.00061655865,0.0005853304,0.00056279625,0.00045472034,0.0015229892,0.0014162018,0.0016206346,0.003855067],"category_scores_gemma":[0.0028364435,0.0003777787,0.0006101839,0.00023721535,0.0009803682,0.0014385764,0.0009748594,0.0010500647,0.00066390197],"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.000097046934,0.00006897729,0.0019817967,0.00006106826,0.000032002656,0.00016889861,0.00025160972,0.9680995,0.0036285482,0.018762575,0.00025035167,0.006597641],"study_design_scores_gemma":[0.000008335421,0.000023526802,0.000097004806,0.000004821375,0.0000075931066,0.000014794901,0.0000131692905,0.99648464,0.00049394055,0.0024282169,0.0004183099,0.000005660709],"about_ca_topic_score_codex":0.0075602853,"about_ca_topic_score_gemma":0.004502052,"teacher_disagreement_score":0.0075602853,"about_ca_system_score_codex":0.000994395,"about_ca_system_score_gemma":0.0009923985,"threshold_uncertainty_score":0.01503253},"labels":[],"label_agreement":null},{"id":"W2133442019","doi":"10.4007/annals.2006.164.603","title":"Combinatorics of random processes and sections of convex bodies","year":2006,"lang":"en","type":"article","venue":"Annals of Mathematics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, Davis; University of Alberta; Pacific Institute for the Mathematical Sciences; National Science Foundation","keywords":"Mathematics; Combinatorics; Regular polygon; Mixed volume; Convex body; Geometry; Convex hull","score_opus":0.02637954132136015,"score_gpt":0.28315367179927015,"score_spread":0.25677413047791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133442019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48604935,0.0011653051,0.47331268,0.0017597093,0.00011309027,0.000081597056,0.00028329392,0.00024207626,0.03699285],"genre_scores_gemma":[0.9583067,0.0006578494,0.027884962,0.0001618964,0.000245985,0.00013400208,0.00027270833,0.000091565205,0.012244315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903595,0.00029834718,0.000051183953,0.00023339881,0.00025448698,0.0001266618],"domain_scores_gemma":[0.99526274,0.0025667008,0.000871814,0.00047093446,0.00030663115,0.00052123365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013773233,0.00060310867,0.00076641765,0.0028424624,0.0011004762,0.0031588147,0.00093463296,0.000741802,0.0056157317],"category_scores_gemma":[0.005687026,0.0005567383,0.0010565303,0.0010318747,0.004191451,0.004938531,0.002611173,0.001898573,0.00047945944],"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.000009710629,0.0000062180443,0.00045796874,0.000014139029,0.0000074064183,0.0000630973,0.00007342466,0.0030279025,0.00040902614,0.99418736,0.00016152217,0.001582346],"study_design_scores_gemma":[0.000009253919,0.000014826992,0.000642667,0.0000119964025,0.000007966445,0.00012715594,0.000056847806,0.023660237,0.00071382395,0.97332215,0.0014224699,0.000010547114],"about_ca_topic_score_codex":0.00046402944,"about_ca_topic_score_gemma":0.00037814712,"teacher_disagreement_score":0.0056157317,"about_ca_system_score_codex":0.0014380642,"about_ca_system_score_gemma":0.0003589109,"threshold_uncertainty_score":0.01878655},"labels":[],"label_agreement":null},{"id":"W2134625044","doi":"","title":"Online Learning with Costly Features and Labels","year":2013,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"University of Alberta","funders":"","keywords":"Regret; Computer science; Function (biology); Feature (linguistics); Online learning; Upper and lower bounds; Artificial intelligence; Mathematical optimization; Machine learning; Mathematics; World Wide Web","score_opus":0.005415105815118959,"score_gpt":0.22408387713619995,"score_spread":0.218668771321081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134625044","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.107849285,0.0013490459,0.8762293,0.0044611422,0.00019921905,0.0002834894,0.0008992888,0.0029405472,0.005788763],"genre_scores_gemma":[0.7908839,0.00042774997,0.1945753,0.001071081,0.00040434612,0.00072179094,0.0015354288,0.0002959834,0.010084359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951214,0.002504407,0.00017659033,0.0010386602,0.00065024075,0.0005086123],"domain_scores_gemma":[0.96644676,0.027471684,0.0014158473,0.003422303,0.00056512014,0.0006784029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059069376,0.0023844594,0.0038840263,0.0006838568,0.0011975841,0.002804304,0.005024479,0.005539765,0.0065904898],"category_scores_gemma":[0.027448026,0.001559552,0.0012395993,0.0018370304,0.002725146,0.009307778,0.0037283145,0.0053871963,0.0014016305],"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.0028176832,0.0013076492,0.0066186492,0.00057567656,0.00022134362,0.00083810947,0.00041121506,0.69466454,0.0023451713,0.09437638,0.02113669,0.17468685],"study_design_scores_gemma":[0.00020442996,0.0001391793,0.00039888034,0.00002720609,0.000028603792,0.00009496284,0.000036758374,0.8868267,0.00073939504,0.11040899,0.0010704104,0.000024523746],"about_ca_topic_score_codex":0.0025130385,"about_ca_topic_score_gemma":0.0028106277,"teacher_disagreement_score":0.0065904898,"about_ca_system_score_codex":0.002381812,"about_ca_system_score_gemma":0.0018884938,"threshold_uncertainty_score":0.031239271},"labels":[],"label_agreement":null},{"id":"W2136345626","doi":"10.1109/tsmcb.2009.2027220","title":"Modeling a Student's Behavior in a Tutorial-<i>Like</i> System Using Learning Automata","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.019950517543016643,"score_gpt":0.26852908187105234,"score_spread":0.2485785643280357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136345626","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.12774983,0.00012879475,0.8650799,0.00023045,0.00004336308,0.00012407966,0.00020439766,0.0012672297,0.0051719663],"genre_scores_gemma":[0.8891138,0.00018096916,0.104081534,0.00009113222,0.00003298948,0.00029241346,0.00021399894,0.00010596172,0.0058872704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927586,0.00021644113,0.000047539677,0.0002124516,0.000142647,0.00010513758],"domain_scores_gemma":[0.99848443,0.0007571575,0.0001945862,0.00023879406,0.00021816556,0.0001068918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007934429,0.0006615966,0.0005389197,0.00040789245,0.00046168573,0.0014739619,0.0015352936,0.0013145449,0.003237637],"category_scores_gemma":[0.002585514,0.00029464514,0.00082001835,0.00019676975,0.0010023538,0.001644819,0.0012820686,0.0012048153,0.00063068204],"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.00024349676,0.00023277452,0.008335304,0.0001798495,0.0000894054,0.0003902415,0.0007419079,0.87591755,0.020435765,0.0689727,0.0007334988,0.023727464],"study_design_scores_gemma":[0.00000966177,0.000057390065,0.0003220303,0.000008752955,0.000014425157,0.000029664769,0.000026533593,0.99013937,0.002341988,0.006056939,0.0009818091,0.000011422911],"about_ca_topic_score_codex":0.005033744,"about_ca_topic_score_gemma":0.0033754928,"teacher_disagreement_score":0.005033744,"about_ca_system_score_codex":0.0008749553,"about_ca_system_score_gemma":0.0012154834,"threshold_uncertainty_score":0.010830939},"labels":[],"label_agreement":null},{"id":"W2136743277","doi":"10.1109/tasl.2007.905151","title":"Solving Large-Margin Hidden Markov Model Estimation via Semidefinite Programming","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Audio Speech and Language Processing","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":19,"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":"Semidefinite programming; Margin (machine learning); Computer science; Hidden Markov model; Mathematical optimization; Optimization problem; Constraint (computer-aided design); Pattern recognition (psychology); Artificial intelligence; Algorithm; Machine learning; Mathematics","score_opus":0.007489662029505366,"score_gpt":0.2619869842734736,"score_spread":0.25449732224396826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136743277","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.003033256,0.000058996393,0.99601495,0.00012056228,0.000010969267,0.000016618367,0.000025318966,0.00020193156,0.0005174836],"genre_scores_gemma":[0.31810567,0.00028424102,0.67653614,0.00037774077,0.000088136505,0.00045914328,0.00045453175,0.00029142524,0.003402932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888855,0.00062643975,0.000045562272,0.00019288187,0.00018582253,0.00006062691],"domain_scores_gemma":[0.99444866,0.004679017,0.00029889712,0.00019585653,0.00030626377,0.0000713895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002295522,0.0013740113,0.0013651177,0.00038038028,0.00033236874,0.00096906617,0.001188331,0.001249485,0.002837752],"category_scores_gemma":[0.005744598,0.00084159395,0.0006749372,0.00049353746,0.0010742203,0.0014671596,0.0010870979,0.0023033964,0.00056787994],"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.000079011574,0.00009216956,0.0002843949,0.00016850804,0.000043022217,0.00010192234,0.00005959388,0.9385275,0.0020005351,0.013286152,0.0016488319,0.043708224],"study_design_scores_gemma":[0.000007882105,0.000010764132,0.00001635529,0.0000026008092,0.0000016442834,0.000007968448,0.0000037039904,0.9963313,0.00041684406,0.0030682208,0.00012989985,0.0000028805773],"about_ca_topic_score_codex":0.0017838234,"about_ca_topic_score_gemma":0.002242852,"teacher_disagreement_score":0.002837752,"about_ca_system_score_codex":0.000590912,"about_ca_system_score_gemma":0.0012905379,"threshold_uncertainty_score":0.012140036},"labels":[],"label_agreement":null},{"id":"W2136791927","doi":"10.1613/jair.2486","title":"A General Theory of Additive State Space Abstractions","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Disjoint sets; Heuristics; Computer science; State (computer science); Space (punctuation); Heuristic; State space; Cube (algebra); Set (abstract data type); Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Programming language; Artificial intelligence","score_opus":0.14257912253204047,"score_gpt":0.4123511718843479,"score_spread":0.2697720493523074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136791927","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.009922077,0.0002416133,0.9839115,0.00027807214,0.000046200126,0.00009671562,0.00023734628,0.0005993187,0.0046671405],"genre_scores_gemma":[0.3975696,0.00074148166,0.5933116,0.0005922919,0.000160772,0.0011083608,0.0008769404,0.0002562948,0.0053826184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99477214,0.0011144301,0.0006381673,0.0012939919,0.0015290468,0.0006522334],"domain_scores_gemma":[0.99138254,0.004386978,0.0008628855,0.0023098735,0.00075684645,0.0003009686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033325425,0.0013527322,0.0011358839,0.0022262777,0.001325355,0.004986197,0.0030794058,0.0016474185,0.0071319523],"category_scores_gemma":[0.014945112,0.0012345373,0.0031866662,0.0025911224,0.0053805592,0.0079540815,0.0053593344,0.004385013,0.0011368721],"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.000057609534,0.000039566785,0.0005547292,0.00014680557,0.000045173845,0.00010098318,0.00026290547,0.07043266,0.0015579473,0.90496767,0.00095003226,0.020883814],"study_design_scores_gemma":[0.0000317487,0.0001228897,0.00023009873,0.00007472378,0.0000537062,0.00016676747,0.00010264432,0.18053634,0.0029200672,0.80573845,0.009983605,0.000039038165],"about_ca_topic_score_codex":0.0020734062,"about_ca_topic_score_gemma":0.0013742985,"teacher_disagreement_score":0.0071319523,"about_ca_system_score_codex":0.0021171665,"about_ca_system_score_gemma":0.00244456,"threshold_uncertainty_score":0.023858786},"labels":[],"label_agreement":null},{"id":"W2136945987","doi":"","title":"Risk Bounds for Randomized Sample Compressed Classifiers","year":2008,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"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":"occam; Computer science; Classifier (UML); Compressed sensing; Compression (physics); Data compression; Sample (material); Artificial intelligence; Upper and lower bounds; Algorithm; Pattern recognition (psychology); Mathematics","score_opus":0.017094328702026203,"score_gpt":0.25412722778012403,"score_spread":0.23703289907809783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136945987","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.0057714735,0.0014581762,0.9844245,0.0014879794,0.00016681259,0.00012671058,0.00016335322,0.00028119585,0.006119785],"genre_scores_gemma":[0.45740515,0.006065629,0.50642186,0.003470404,0.0027600506,0.0025473472,0.0017766146,0.0011285279,0.018424358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98443156,0.006173556,0.00069683586,0.0018040157,0.0059177415,0.0009762876],"domain_scores_gemma":[0.8820351,0.09809943,0.0044448725,0.008363379,0.0058364985,0.0012207066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02180087,0.0033185254,0.0031905458,0.0031116593,0.00125506,0.0042467862,0.004674615,0.0044345167,0.011574013],"category_scores_gemma":[0.14000726,0.0013053275,0.00242388,0.0025840618,0.005575332,0.012457558,0.008421864,0.010445673,0.002344786],"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.00033835802,0.00016917683,0.001256582,0.0004761789,0.00016640045,0.00023702827,0.0002555448,0.20815949,0.0023799206,0.7030382,0.00732418,0.07619891],"study_design_scores_gemma":[0.00003316264,0.000092072594,0.00029230907,0.000114038616,0.000048872862,0.00016035099,0.00002935185,0.6356559,0.0019620522,0.35970855,0.0018651219,0.000038292324],"about_ca_topic_score_codex":0.0008711627,"about_ca_topic_score_gemma":0.0009300613,"teacher_disagreement_score":0.02180087,"about_ca_system_score_codex":0.0052601458,"about_ca_system_score_gemma":0.00279711,"threshold_uncertainty_score":0.11529541},"labels":[],"label_agreement":null},{"id":"W2137440488","doi":"","title":"Fast maximum a posteriori inference in Monte Carlo state spaces","year":2005,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Machine Learning and Algorithms","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 British Columbia","funders":"","keywords":"Viterbi algorithm; Inference; Computer science; Maximum a posteriori estimation; Computation; Monte Carlo method; Approximate inference; Algorithm; A priori and a posteriori; Range (aeronautics); State (computer science); Artificial intelligence; Hidden Markov model; Mathematics; Maximum likelihood; Statistics","score_opus":0.02019099077922133,"score_gpt":0.2612807071089224,"score_spread":0.2410897163297011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137440488","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.0026817378,0.000077817676,0.9962037,0.000081605445,0.000011994565,0.000014899828,0.000029652625,0.00048135073,0.00041717585],"genre_scores_gemma":[0.19935912,0.00021233397,0.79703283,0.00011167712,0.000074795644,0.00026552737,0.00037073664,0.00030758063,0.0022654347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977477,0.0012184172,0.0001100268,0.00030340545,0.0004911539,0.00012937277],"domain_scores_gemma":[0.9869287,0.010751092,0.0004004634,0.0011512242,0.00061020075,0.0001582498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004226369,0.0008610122,0.0017114019,0.0011462435,0.0010203734,0.001737954,0.0022188977,0.0019437188,0.0037237387],"category_scores_gemma":[0.022132006,0.0011966884,0.0008853877,0.0013750317,0.0016366076,0.0030012224,0.0026585408,0.0025592537,0.001390591],"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.00024160946,0.000052139658,0.00097548927,0.00012555602,0.00008662031,0.000088487584,0.0001477914,0.77693665,0.0012931973,0.11125143,0.0018216277,0.10697949],"study_design_scores_gemma":[0.000011154624,0.000006853381,0.00006489081,0.0000062206213,0.0000026653559,0.000013908843,0.0000062164227,0.9529532,0.0004190445,0.046064466,0.0004459831,0.0000054012617],"about_ca_topic_score_codex":0.004927502,"about_ca_topic_score_gemma":0.0049187145,"teacher_disagreement_score":0.004927502,"about_ca_system_score_codex":0.0011151524,"about_ca_system_score_gemma":0.0017823109,"threshold_uncertainty_score":0.022351444},"labels":[],"label_agreement":null},{"id":"W2137795521","doi":"","title":"Discriminative Batch Mode Active Learning","year":2007,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":234,"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":"Discriminative model; Computer science; Artificial intelligence; Machine learning; Classifier (UML); Active learning (machine learning); Semi-supervised learning; Pattern recognition (psychology)","score_opus":0.008560599392563007,"score_gpt":0.29079615752039195,"score_spread":0.28223555812782897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137795521","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.0034638734,0.00022267985,0.99428326,0.00012763463,0.0000458161,0.000050069695,0.000039539587,0.00036826194,0.0013988381],"genre_scores_gemma":[0.41981786,0.0006021349,0.5675786,0.0005617356,0.00035696413,0.0006062617,0.00048004987,0.00024313225,0.009753256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987174,0.00056987716,0.000057224748,0.00030029012,0.0002678263,0.00008724651],"domain_scores_gemma":[0.9959259,0.0026070944,0.00029991262,0.0004353056,0.00059254345,0.00013931253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027107282,0.0014128205,0.0021472087,0.00066171924,0.00043444638,0.001399563,0.0038827092,0.0019408911,0.003187972],"category_scores_gemma":[0.005763224,0.0007577513,0.00083837315,0.0010124756,0.0014252912,0.0023398641,0.0013058088,0.0023212922,0.0012027251],"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.00065273343,0.00039167688,0.001701529,0.00035929607,0.00013928997,0.00014240587,0.00020074422,0.535377,0.011898015,0.05142433,0.010771151,0.38694182],"study_design_scores_gemma":[0.00001440764,0.000037367834,0.000053367563,0.000005414492,0.000006946447,0.000020495008,0.0000053415806,0.9914773,0.0014201109,0.0061064265,0.00084621453,0.0000066728826],"about_ca_topic_score_codex":0.0013534622,"about_ca_topic_score_gemma":0.0017797346,"teacher_disagreement_score":0.0038827092,"about_ca_system_score_codex":0.0008428118,"about_ca_system_score_gemma":0.00087171944,"threshold_uncertainty_score":0.014335871},"labels":[],"label_agreement":null},{"id":"W2138041254","doi":"10.1109/tsmcb.2002.1049608","title":"Generalized pursuit learning schemes: new families of continuous and discretized learning automata","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Action (physics); Learning automata; Discretization; Computer science; Scheme (mathematics); Artificial intelligence; Estimator; Algorithm; Automaton; Machine learning; Mathematical optimization; Mathematics; Statistics","score_opus":0.016794056746851457,"score_gpt":0.22871380987604678,"score_spread":0.2119197531291953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138041254","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.014728171,0.000944629,0.98114246,0.00026182615,0.000071465576,0.00008322273,0.00006200646,0.0003292377,0.0023770265],"genre_scores_gemma":[0.4015464,0.0013897109,0.5914036,0.00029951372,0.00014706499,0.0005065124,0.00018148674,0.000111522575,0.004414235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895704,0.00036255116,0.000073792966,0.00017163662,0.00036269554,0.00007223294],"domain_scores_gemma":[0.9970085,0.0017131466,0.0002649273,0.0005194044,0.00036344994,0.00013057346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020428163,0.00066682685,0.0008576555,0.0008474721,0.00052453333,0.0016526568,0.0019513553,0.0013872813,0.0022892142],"category_scores_gemma":[0.009335551,0.00038430103,0.0008622396,0.00087417365,0.0020431022,0.00284361,0.002414386,0.0021402328,0.00056381343],"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.00014674978,0.00006735735,0.0011959877,0.00022510852,0.000072509094,0.00009499832,0.00027558027,0.48473603,0.004067981,0.32608324,0.0028449127,0.18018952],"study_design_scores_gemma":[0.000022716464,0.00006065736,0.000091285634,0.000020044743,0.0000074767054,0.000048453607,0.000015999072,0.9362759,0.00052272936,0.060591888,0.002328503,0.0000144471915],"about_ca_topic_score_codex":0.001377335,"about_ca_topic_score_gemma":0.0012471629,"teacher_disagreement_score":0.0022892142,"about_ca_system_score_codex":0.0010327799,"about_ca_system_score_gemma":0.0009688419,"threshold_uncertainty_score":0.01080358},"labels":[],"label_agreement":null},{"id":"W2138395462","doi":"10.1016/j.ic.2006.02.004","title":"Mind change efficient learning","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Class (philosophy); Order (exchange); Set (abstract data type); Computer science; Point (geometry); Property (philosophy); Artificial intelligence; Mathematics; Theoretical computer science; Epistemology; Pure mathematics","score_opus":0.009672202445510066,"score_gpt":0.23670760446161604,"score_spread":0.22703540201610597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138395462","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.080358006,0.0016058928,0.74345386,0.008222717,0.0010943873,0.00010670506,0.00033255824,0.0016167572,0.1632092],"genre_scores_gemma":[0.8034432,0.0008068418,0.12573919,0.0012483235,0.000439522,0.000112544505,0.0003226181,0.0004952931,0.067392476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947613,0.000118178374,0.000017814125,0.00017942264,0.00014806047,0.00006027976],"domain_scores_gemma":[0.9979388,0.00075360946,0.00011683741,0.00073125376,0.0003290725,0.0001304597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006962619,0.0003887615,0.0004077239,0.0005355273,0.0005628464,0.0016274258,0.00092473655,0.00096083054,0.017786503],"category_scores_gemma":[0.0063832863,0.00029955577,0.00046271778,0.00045358308,0.001219472,0.0035465707,0.0013496687,0.0018487216,0.0026159536],"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.00011027777,0.00010729175,0.0010399104,0.0001359303,0.0000752255,0.000097400385,0.00026292086,0.013007574,0.006393201,0.77088726,0.01743826,0.1904447],"study_design_scores_gemma":[0.000018292012,0.000037917293,0.0012009359,0.000015061816,0.000030293912,0.000121740195,0.00007025573,0.069752835,0.0029623625,0.90565044,0.020126265,0.00001361215],"about_ca_topic_score_codex":0.00052758754,"about_ca_topic_score_gemma":0.00065513194,"teacher_disagreement_score":0.017786503,"about_ca_system_score_codex":0.0006534119,"about_ca_system_score_gemma":0.0004857303,"threshold_uncertainty_score":0.059501767},"labels":[],"label_agreement":null},{"id":"W2140013491","doi":"10.1109/icdm.2010.114","title":"Active Learning with Human-Like Noisy Oracle","year":2010,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Oracle; Computer science; Exploit; Noise (video); Process (computing); Sample (material); Machine learning; Artificial intelligence; Space (punctuation); Active learning (machine learning); Sampling (signal processing); Synthetic data; Data mining; Algorithm; Image (mathematics); Computer security","score_opus":0.004825229185612319,"score_gpt":0.24154419578625452,"score_spread":0.2367189666006422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140013491","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.012875884,0.00017751222,0.98597604,0.00017173043,0.000012010555,0.000036224526,0.000017049259,0.0001567849,0.0005768204],"genre_scores_gemma":[0.7499005,0.0002725036,0.24684826,0.00037589215,0.0001316465,0.00026001147,0.0001588519,0.00005376825,0.0019984883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685633,0.0017496113,0.00012903304,0.0005688393,0.0005244908,0.00017165227],"domain_scores_gemma":[0.97076267,0.024233753,0.0013788504,0.0019762942,0.0011640993,0.00048439053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068300627,0.0013346309,0.0021810045,0.0008690394,0.00057199923,0.0022236377,0.0042061624,0.0037057544,0.001223697],"category_scores_gemma":[0.024227468,0.0007991369,0.0009781212,0.00091816427,0.0036244898,0.004196854,0.0026784802,0.002527999,0.00031522557],"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.00060301996,0.00025170547,0.0039679348,0.00034252123,0.00016741281,0.00026827544,0.00062523043,0.7566845,0.00519332,0.07366953,0.0015339848,0.15669256],"study_design_scores_gemma":[0.000017361384,0.000048540154,0.00011205853,0.000011091213,0.000008235375,0.000035995658,0.00001592728,0.98074406,0.001048064,0.017689683,0.00025921545,0.000009821398],"about_ca_topic_score_codex":0.0008333915,"about_ca_topic_score_gemma":0.00096332567,"teacher_disagreement_score":0.0068300627,"about_ca_system_score_codex":0.00087996625,"about_ca_system_score_gemma":0.0006595206,"threshold_uncertainty_score":0.03612125},"labels":[],"label_agreement":null},{"id":"W2140407154","doi":"10.5555/1036843.1036887","title":"Active model selection","year":2004,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":52,"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":"Computer science; Task (project management); Simple (philosophy); Set (abstract data type); Selection (genetic algorithm); Artificial intelligence; Model selection; Sample (material); Machine learning; Active learning (machine learning); Field (mathematics); Sample complexity; Mathematics","score_opus":0.008331924834581646,"score_gpt":0.2432273949317493,"score_spread":0.23489547009716766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140407154","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.003971827,0.00036364517,0.9924306,0.00031275375,0.00007623719,0.000115521405,0.00010281665,0.0007155807,0.0019110352],"genre_scores_gemma":[0.37043774,0.0007849774,0.61361563,0.0013553398,0.0005549926,0.0011042999,0.0014856925,0.00048218912,0.010179097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958204,0.002294337,0.00015731156,0.00071413803,0.0007327709,0.00028105802],"domain_scores_gemma":[0.9901349,0.006801862,0.0004381735,0.0016509849,0.00068912905,0.0002850083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004896578,0.0020697184,0.0029573515,0.0016819487,0.0009777909,0.0024988009,0.0063334904,0.0038582247,0.0086413305],"category_scores_gemma":[0.015655527,0.0012454487,0.0021618889,0.0016118576,0.0017313327,0.004515958,0.0038594313,0.0030387465,0.0027037477],"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.0006995367,0.0004979633,0.0020917386,0.00036425987,0.0004220563,0.000305255,0.00024627123,0.44018286,0.0035029545,0.10221554,0.023053732,0.42641777],"study_design_scores_gemma":[0.000059048598,0.00004941097,0.00007691935,0.000019916448,0.000030945997,0.00007019521,0.00001952214,0.9556789,0.0013357188,0.039948553,0.002697358,0.000013528332],"about_ca_topic_score_codex":0.0015824354,"about_ca_topic_score_gemma":0.0022116946,"teacher_disagreement_score":0.0086413305,"about_ca_system_score_codex":0.0009687057,"about_ca_system_score_gemma":0.0015079388,"threshold_uncertainty_score":0.028908134},"labels":[],"label_agreement":null},{"id":"W2141195801","doi":"10.1016/j.tcs.2015.10.038","title":"Order compression schemes","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Compression (physics); Mathematics; Data compression; Conjecture; Data compression ratio; Sample (material); Lossless compression; Intersection (aeronautics); Dimension (graph theory); Order (exchange); Algorithm; Image compression; Discrete mathematics; Computer science; Combinatorics; Artificial intelligence","score_opus":0.014273892912185154,"score_gpt":0.27760372365807984,"score_spread":0.26332983074589467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141195801","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.0462672,0.0036081502,0.7343222,0.003108971,0.0016391396,0.00066972943,0.0022790015,0.0041118576,0.20399378],"genre_scores_gemma":[0.5385441,0.0040054107,0.30527973,0.0017616977,0.0013617668,0.0005598188,0.004233378,0.0014753137,0.14277878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998577,0.00021536331,0.00008944614,0.00017728673,0.0007205647,0.00022041312],"domain_scores_gemma":[0.9971943,0.0005284008,0.00008794418,0.0017922734,0.0003078093,0.000089276466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097558514,0.00087737833,0.0007642177,0.001943532,0.0013317113,0.0022836232,0.0010539332,0.0011651375,0.0298561],"category_scores_gemma":[0.0043644286,0.00039469282,0.0006199347,0.0026636424,0.001226923,0.0033719174,0.0023388213,0.0026433885,0.008560823],"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.00041628082,0.00009999609,0.00027053172,0.00014440747,0.000019968991,0.000097248405,0.00013653815,0.0060589355,0.0070521226,0.6996436,0.026794875,0.25926548],"study_design_scores_gemma":[0.00014154238,0.00017137364,0.00047235814,0.00013408864,0.000049504473,0.0005425258,0.00008701017,0.04691249,0.036582883,0.7942339,0.12060615,0.00006617289],"about_ca_topic_score_codex":0.00050852017,"about_ca_topic_score_gemma":0.00071121304,"teacher_disagreement_score":0.0298561,"about_ca_system_score_codex":0.0011434277,"about_ca_system_score_gemma":0.0012134665,"threshold_uncertainty_score":0.09987867},"labels":[],"label_agreement":null},{"id":"W2141969549","doi":"10.1109/icassp.2007.366991","title":"Incorporating Training Errors for Large Margin HMMS Under Semi-Definite Programming Framework","year":2007,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":36,"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":"Margin (machine learning); Computer science; Discriminative model; Convergence (economics); Function (biology); Pattern recognition (psychology); Support vector machine; Artificial intelligence; Error function; Algorithm; Mathematical optimization; Machine learning; Mathematics","score_opus":0.031212134414849598,"score_gpt":0.30563143605245174,"score_spread":0.27441930163760214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141969549","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.0046963366,0.00006162594,0.99465275,0.000108087814,0.000013919994,0.0000140611555,0.000007672834,0.00022958213,0.00021594351],"genre_scores_gemma":[0.36478853,0.00017352724,0.6300002,0.00030343048,0.00009973378,0.00019302338,0.00014631829,0.00048214608,0.0038130984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973463,0.0014328397,0.0001471934,0.00041838302,0.0005080594,0.00014722525],"domain_scores_gemma":[0.9806466,0.016096648,0.0007998038,0.00096594344,0.0012239455,0.000267022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007053008,0.0013937929,0.0016399394,0.00054966594,0.0006919869,0.0014053943,0.0019850535,0.0018799915,0.0023740907],"category_scores_gemma":[0.026640065,0.0011676673,0.0006401626,0.0005034798,0.0017571579,0.0043097623,0.0023647342,0.0031074127,0.0006793724],"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.00015161354,0.00008388631,0.0008183259,0.00013251121,0.000043436554,0.000102791426,0.00015334351,0.8828718,0.0023356508,0.017036447,0.0006716267,0.0955986],"study_design_scores_gemma":[0.0000042019506,0.000016273909,0.000044960667,0.000005396471,0.0000023967693,0.000012150435,0.000005502907,0.9946825,0.0008699291,0.0042001777,0.00015111825,0.0000054361667],"about_ca_topic_score_codex":0.0028697187,"about_ca_topic_score_gemma":0.003212246,"teacher_disagreement_score":0.007053008,"about_ca_system_score_codex":0.0010427972,"about_ca_system_score_gemma":0.0013755759,"threshold_uncertainty_score":0.03730029},"labels":[],"label_agreement":null},{"id":"W2141986577","doi":"10.1017/s0963548309990599","title":"Tight Bounds for Blind Search on the Integers and the Reals","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"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 Calgary","funders":"","keywords":"Security token; Combinatorics; Position (finance); Mathematics; Interval (graph theory); Function (biology); Distribution (mathematics); Mathematical proof; Discrete mathematics; Point (geometry); Computer science; Mathematical analysis; Geometry","score_opus":0.030472075923027673,"score_gpt":0.28445271480498724,"score_spread":0.25398063888195954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141986577","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.065827996,0.0074785315,0.9038102,0.0036377443,0.00022781885,0.00013775518,0.0004963641,0.00083130103,0.017552173],"genre_scores_gemma":[0.8257432,0.004914681,0.15324934,0.0014500516,0.00051675324,0.00058454776,0.00052438164,0.0007469439,0.0122700585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930407,0.0024780785,0.0002955914,0.0011763269,0.0014826255,0.0015267181],"domain_scores_gemma":[0.92631894,0.061847426,0.003998841,0.0040794485,0.0017574896,0.0019977894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013096468,0.0025884174,0.0038905018,0.0033373353,0.0020823672,0.0051337653,0.0040196516,0.003000097,0.0075017926],"category_scores_gemma":[0.08573004,0.0013275367,0.0019821038,0.003311154,0.007088396,0.014820004,0.0059419423,0.005635059,0.0012807687],"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.0009136267,0.00022676043,0.0015907567,0.00071450236,0.00018850266,0.00020903462,0.0004887685,0.3307489,0.0030515306,0.62753296,0.005068961,0.02926571],"study_design_scores_gemma":[0.00008037749,0.0001055836,0.00034088315,0.0001400034,0.000060270842,0.00009911362,0.000067854344,0.56159544,0.0011416925,0.43423536,0.002083593,0.000049740163],"about_ca_topic_score_codex":0.003384494,"about_ca_topic_score_gemma":0.0027044332,"teacher_disagreement_score":0.013096468,"about_ca_system_score_codex":0.005608568,"about_ca_system_score_gemma":0.0035557281,"threshold_uncertainty_score":0.06926155},"labels":[],"label_agreement":null},{"id":"W2143031849","doi":"","title":"Linear approximations for factored markov decision processes","year":2005,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"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":"Markov decision process; Mathematical optimization; Computer science; Representation (politics); Linear programming; Dynamic programming; Algorithm; Markov process; Mathematics","score_opus":0.009836518629011503,"score_gpt":0.23134023159719497,"score_spread":0.22150371296818347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143031849","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003471222,0.00033338158,0.99270827,0.00020244427,0.000034438064,0.000050001494,0.00010324264,0.00021009258,0.002886976],"genre_scores_gemma":[0.31628323,0.0013072565,0.67096585,0.0003716376,0.0001544849,0.0007868626,0.00080362114,0.00028359803,0.009043455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976649,0.0009355079,0.00011441075,0.00038126335,0.0006776671,0.00022627959],"domain_scores_gemma":[0.984868,0.012745969,0.0007498598,0.00056794094,0.0008364505,0.00023182601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041031335,0.0017955729,0.0019068741,0.0012714299,0.00072031544,0.0023083065,0.0021045273,0.0020971298,0.007817545],"category_scores_gemma":[0.0228845,0.0009908765,0.0015713845,0.0016073817,0.00203391,0.0027279635,0.0021057003,0.0045651454,0.0014935234],"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.00004954021,0.000027194845,0.0003163658,0.00007427893,0.00002133109,0.000035854766,0.00006119232,0.87849617,0.00018546396,0.103913546,0.00089578563,0.015923338],"study_design_scores_gemma":[0.0000047352814,0.0000062041063,0.000014984921,0.000009909162,0.0000025911938,0.00000442616,0.000004893009,0.972307,0.00006472687,0.027222704,0.00035537264,0.0000025488787],"about_ca_topic_score_codex":0.011577526,"about_ca_topic_score_gemma":0.010304682,"teacher_disagreement_score":0.011577526,"about_ca_system_score_codex":0.0039224285,"about_ca_system_score_gemma":0.002915513,"threshold_uncertainty_score":0.02845937},"labels":[],"label_agreement":null},{"id":"W2143258877","doi":"10.1007/s10489-013-0424-x","title":"On incorporating the paradigms of discretization and Bayesian estimation to create a new family of pursuit learning automata","year":2013,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Discretization; Estimator; Learning automata; Bayesian probability; Convergence (economics); Algorithm; Artificial intelligence; Space (punctuation); Machine learning; Mathematical optimization; Automaton; Mathematics; Statistics","score_opus":0.008793489752281355,"score_gpt":0.2385121398364691,"score_spread":0.22971865008418774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143258877","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.0035117853,0.00023180534,0.99298203,0.00025205317,0.000058801936,0.000020681302,0.00002689198,0.00010233317,0.0028135919],"genre_scores_gemma":[0.2591686,0.0011446901,0.7325252,0.00049413455,0.00018022633,0.00025303985,0.00013701955,0.00016865623,0.0059284084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881494,0.00050638686,0.000084762156,0.0002000204,0.00032599302,0.00006785249],"domain_scores_gemma":[0.9954035,0.0030856926,0.00022854104,0.00060594577,0.00052138494,0.00015486662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024892786,0.0006406265,0.0012513013,0.0011256943,0.0010702239,0.002074096,0.0017452185,0.0016759344,0.0032245556],"category_scores_gemma":[0.01141122,0.0005267185,0.001307063,0.001281045,0.0025425076,0.0044293264,0.0028954193,0.0032128035,0.0009161613],"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.00004272106,0.000038813334,0.0006225795,0.00008805324,0.000036790225,0.000043124266,0.00019893123,0.087912545,0.0017799266,0.8338161,0.0013648947,0.07405552],"study_design_scores_gemma":[0.000014497386,0.000055480483,0.00007826913,0.000030199304,0.000013056106,0.00006694982,0.000022225751,0.56597847,0.00070731074,0.42885602,0.004151987,0.00002551726],"about_ca_topic_score_codex":0.0019940871,"about_ca_topic_score_gemma":0.0021941764,"teacher_disagreement_score":0.0032245556,"about_ca_system_score_codex":0.000899347,"about_ca_system_score_gemma":0.0011296102,"threshold_uncertainty_score":0.013164759},"labels":[],"label_agreement":null},{"id":"W2144283734","doi":"10.1609/socs.v2i1.18207","title":"Probably Approximately Correct Heuristic Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"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":"Israel Science Foundation","keywords":"Generalization; Heuristic; Beam search; Incremental heuristic search; Task (project management); Bidirectional search; Search algorithm; Computer science; Best-first search; Quality (philosophy); Algorithm; Sequence (biology); Beam stack search; Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.014210996534451879,"score_gpt":0.25734625459628285,"score_spread":0.24313525806183098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144283734","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.03661723,0.0007871254,0.9446758,0.0012693611,0.00022219883,0.00010856365,0.00033115363,0.0014553053,0.014533192],"genre_scores_gemma":[0.47830132,0.00042392538,0.5094555,0.0007807881,0.00014254684,0.00027308482,0.0007908179,0.00058708544,0.009244862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969177,0.0011441025,0.00018512618,0.00078141753,0.00061063125,0.00036101742],"domain_scores_gemma":[0.98991346,0.0060179774,0.0005146264,0.0025237554,0.000810395,0.00021977689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029952629,0.0010581848,0.0016348936,0.0010984396,0.0011101306,0.0024666556,0.0020385522,0.0028412747,0.007527038],"category_scores_gemma":[0.024908818,0.0006504702,0.0014914888,0.0013019516,0.0022761435,0.0039540473,0.0017589009,0.0024480168,0.0014849091],"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.00065118243,0.00020415998,0.0032620833,0.00048758174,0.00024121282,0.00029633148,0.00026580697,0.43504757,0.0031987675,0.3083254,0.016944636,0.2310753],"study_design_scores_gemma":[0.00007693207,0.00008443358,0.0002663334,0.000051390813,0.000041092775,0.00015083139,0.00007308915,0.72317475,0.0013068839,0.26919714,0.0055558565,0.000021286876],"about_ca_topic_score_codex":0.002502432,"about_ca_topic_score_gemma":0.0040169456,"teacher_disagreement_score":0.007527038,"about_ca_system_score_codex":0.0015906972,"about_ca_system_score_gemma":0.0024527116,"threshold_uncertainty_score":0.0251804},"labels":[],"label_agreement":null},{"id":"W2144694779","doi":"10.1016/s0304-3975(02)00421-8","title":"On learning of functions refutably","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Real Estate Foundation of British Columbia","keywords":"Function (biology); Artificial intelligence; Computer science; Type (biology); Mathematics; Machine learning","score_opus":0.0060477036543585775,"score_gpt":0.23988754661695125,"score_spread":0.23383984296259266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144694779","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.03662179,0.0022273601,0.9394241,0.00482502,0.0005148824,0.00008181526,0.00023412817,0.0013415143,0.014729339],"genre_scores_gemma":[0.6559834,0.002512976,0.30903766,0.0024433255,0.0011259975,0.00028313935,0.0020103068,0.0009703439,0.025632886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941999,0.0028702915,0.0003132575,0.0011375181,0.0010750195,0.00040402755],"domain_scores_gemma":[0.9495706,0.039149936,0.0009376859,0.007069892,0.002746202,0.00052575587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063052187,0.0013821292,0.0018889678,0.0018793537,0.0018936339,0.0027225476,0.004843913,0.0030889194,0.009058295],"category_scores_gemma":[0.062088042,0.0008067118,0.0019372727,0.002462043,0.0064591765,0.01257211,0.0070161624,0.0053284434,0.0016394055],"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.00036010778,0.00010707932,0.0021967303,0.00025927697,0.000085433225,0.00010492594,0.0006049852,0.047636095,0.00066150824,0.70269775,0.012461115,0.23282497],"study_design_scores_gemma":[0.000030658106,0.000040414085,0.0001336264,0.00004988061,0.000021577955,0.000042935357,0.00005632315,0.11592697,0.0005855872,0.8791662,0.0039339536,0.0000117991085],"about_ca_topic_score_codex":0.003146757,"about_ca_topic_score_gemma":0.0033781005,"teacher_disagreement_score":0.009058295,"about_ca_system_score_codex":0.0019516393,"about_ca_system_score_gemma":0.0018133777,"threshold_uncertainty_score":0.03334558},"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":"W2147803349","doi":"10.1109/icsmc.2007.4413768","title":"Using learning automata to model a student-classroom interaction in a tutorial-like system","year":2007,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Process (computing); Hierarchy; Context (archaeology); Learning automata; Automaton; Transfer of learning; Mathematics education; Artificial intelligence; Programming language; Psychology","score_opus":0.02860284360873756,"score_gpt":0.3379195733859609,"score_spread":0.30931672977722335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147803349","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.2594571,0.00021601614,0.7196925,0.0011826666,0.00009743493,0.00019101702,0.0004631113,0.0013637611,0.017336369],"genre_scores_gemma":[0.94826466,0.000116086114,0.044750318,0.00008776572,0.000027722288,0.0002510142,0.0001772727,0.00006003887,0.006265082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893194,0.00055034173,0.00006920111,0.00018279941,0.00013810747,0.00012752478],"domain_scores_gemma":[0.99643195,0.002443274,0.00024021484,0.0002856662,0.0003294822,0.00026934565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014749996,0.00046916472,0.0006519228,0.0006139618,0.0007639108,0.0020391857,0.0017853335,0.0021500958,0.005672764],"category_scores_gemma":[0.004926882,0.00036762792,0.0005510671,0.00038060642,0.001335334,0.0024514683,0.0014551517,0.0013416071,0.00075243594],"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.00023696553,0.00018646312,0.0040773517,0.000060399274,0.000045716853,0.00041337023,0.0008367791,0.87594783,0.002103581,0.10546507,0.0008250675,0.009801471],"study_design_scores_gemma":[0.00001966284,0.00003721877,0.00015596976,0.0000050545186,0.00000793554,0.000020975167,0.000036404683,0.9869752,0.0002916993,0.011817243,0.00062320736,0.000009444543],"about_ca_topic_score_codex":0.0075669857,"about_ca_topic_score_gemma":0.0066620773,"teacher_disagreement_score":0.0075669857,"about_ca_system_score_codex":0.0013776422,"about_ca_system_score_gemma":0.0011113182,"threshold_uncertainty_score":0.018977225},"labels":[],"label_agreement":null},{"id":"W2147998588","doi":"","title":"PAC-Bayes Learning of Conjunctions and Classification of Gene-Expression Data","year":2004,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":17,"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; Université Laval","funders":"","keywords":"Margin (machine learning); Computer science; Bayes' theorem; Artificial intelligence; Simple (philosophy); Greedy algorithm; Naive Bayes classifier; Pattern recognition (psychology); Machine learning; Expression (computer science); Data mining; Bayesian probability; Algorithm; Support vector machine","score_opus":0.03356824497412746,"score_gpt":0.28673602417528027,"score_spread":0.2531677792011528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147998588","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.006828923,0.00015607382,0.9918331,0.0001984804,0.000024711144,0.000033702636,0.000046306806,0.000333694,0.00054501905],"genre_scores_gemma":[0.17671014,0.00027274026,0.8201169,0.00034166544,0.00016832502,0.00030141606,0.00042977685,0.00016410039,0.0014950242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944535,0.0024411925,0.0002948815,0.0010489625,0.0014346818,0.00032681678],"domain_scores_gemma":[0.9878534,0.009303412,0.000808565,0.00087952655,0.00090634037,0.00024880972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007892119,0.00133639,0.0022480525,0.0017019196,0.001013001,0.0022171417,0.0029062969,0.0017061367,0.0019756828],"category_scores_gemma":[0.021785267,0.0011414591,0.0013642651,0.0020921752,0.0029862458,0.0038406842,0.0023679424,0.003565178,0.0011583075],"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.0008101903,0.00019552464,0.00574996,0.0003141955,0.00024777072,0.00030720036,0.0003274965,0.4471696,0.008732712,0.07114232,0.0060923696,0.45891067],"study_design_scores_gemma":[0.000022449063,0.000035824472,0.000312266,0.000018069424,0.000016471582,0.000080061975,0.000024276953,0.9424157,0.002902681,0.0533495,0.0008085634,0.000014077583],"about_ca_topic_score_codex":0.0018307763,"about_ca_topic_score_gemma":0.0022945057,"teacher_disagreement_score":0.007892119,"about_ca_system_score_codex":0.0012565736,"about_ca_system_score_gemma":0.0015472443,"threshold_uncertainty_score":0.041737974},"labels":[],"label_agreement":null},{"id":"W2149731329","doi":"","title":"Agnostic Bayesian Learning of Ensembles","year":2014,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":28,"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 Sherbrooke; Université Laval","funders":"","keywords":"Computer science; Machine learning; Artificial intelligence; Generalization; Ensemble learning; Inference; Bayesian probability; Probabilistic logic; Bayesian inference; Class (philosophy); Set (abstract data type); Model selection; Bayes' theorem; Mathematics","score_opus":0.005033908525721422,"score_gpt":0.2215884451978455,"score_spread":0.2165545366721241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149731329","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.0066434145,0.00018023039,0.9912509,0.00016506569,0.000033729335,0.00004736753,0.00009217698,0.000684065,0.0009030722],"genre_scores_gemma":[0.38075674,0.0005336275,0.6084709,0.00087295764,0.00041608998,0.000677623,0.0018364233,0.00046806736,0.0059675626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943784,0.0023493113,0.00027088763,0.0010623465,0.0015572682,0.0003818179],"domain_scores_gemma":[0.9887121,0.0058429716,0.001018887,0.0021002362,0.0019156438,0.00041011072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0081376685,0.0021999949,0.0032982503,0.0025923105,0.0011324341,0.0022966026,0.0046046325,0.0025259242,0.0027564948],"category_scores_gemma":[0.02578919,0.0018832684,0.0021040866,0.0015561322,0.0016218787,0.0043356973,0.003510394,0.004378335,0.0015160186],"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.00031757855,0.00028351817,0.004897117,0.00018447735,0.0005506179,0.0001230127,0.00028529228,0.6173823,0.0043117246,0.044969514,0.007805436,0.31888947],"study_design_scores_gemma":[0.000016995264,0.00004705678,0.0003080209,0.000026844638,0.000031527652,0.000029835895,0.000009460958,0.9652664,0.0012372616,0.03195725,0.0010447134,0.00002468807],"about_ca_topic_score_codex":0.0031778023,"about_ca_topic_score_gemma":0.0060979463,"teacher_disagreement_score":0.0081376685,"about_ca_system_score_codex":0.0011911013,"about_ca_system_score_gemma":0.0020278774,"threshold_uncertainty_score":0.04303664},"labels":[],"label_agreement":null},{"id":"W2149991487","doi":"10.1145/1553374.1553419","title":"PAC-Bayesian learning of linear classifiers","year":2009,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":177,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"AdaBoost; Artificial intelligence; Bayes' theorem; Computer science; Machine learning; Bayesian probability; Support vector machine; Naive Bayes classifier; Pattern recognition (psychology)","score_opus":0.008686252362798613,"score_gpt":0.25373863518087414,"score_spread":0.24505238281807554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149991487","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.00066859706,0.0007000047,0.9947149,0.00022310542,0.000066114066,0.00002591295,0.000048994803,0.00015699449,0.003395445],"genre_scores_gemma":[0.17679198,0.004503197,0.8006624,0.0012210022,0.0012144431,0.0006825219,0.000800873,0.0005608292,0.013562751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916146,0.0031283905,0.0003530063,0.0012003141,0.0032656624,0.000438083],"domain_scores_gemma":[0.98478705,0.01036023,0.00083075155,0.0016480323,0.0020745224,0.0002994014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075739967,0.0019086866,0.0027329547,0.0021579126,0.0013377215,0.0048103323,0.003924963,0.0027717827,0.0080811335],"category_scores_gemma":[0.04714764,0.001559809,0.0018181422,0.0029475496,0.0027438982,0.008618786,0.0035430675,0.0051969015,0.0040941313],"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.000116502204,0.000097307275,0.000705729,0.00040799927,0.00013217505,0.00013040662,0.00018388196,0.17388067,0.001056593,0.6057964,0.0122032575,0.20528919],"study_design_scores_gemma":[0.000012205712,0.00003344893,0.00012779655,0.0000723665,0.000029341754,0.00014464103,0.000016433887,0.60698533,0.0012563575,0.3841229,0.0071740476,0.000025066043],"about_ca_topic_score_codex":0.0022499496,"about_ca_topic_score_gemma":0.0022678594,"teacher_disagreement_score":0.0080811335,"about_ca_system_score_codex":0.0021507496,"about_ca_system_score_gemma":0.0020834536,"threshold_uncertainty_score":0.040055573},"labels":[],"label_agreement":null},{"id":"W2152103449","doi":"10.1109/robot.2007.363632","title":"A formal framework for robot learning and control under model uncertainty","year":2007,"lang":"en","type":"article","venue":"Proceedings - IEEE International Conference on Robotics and Automation/Proceedings","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":22,"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":"Partially observable Markov decision process; A priori and a posteriori; Computer science; Robot; Markov decision process; Observable; Domain (mathematical analysis); Markov process; Process (computing); Artificial intelligence; Control (management); Simple (philosophy); Machine learning; Markov chain; Markov model; Mathematics","score_opus":0.031114092258158206,"score_gpt":0.31291518456510403,"score_spread":0.28180109230694583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152103449","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.0004220909,0.00025833872,0.99688077,0.00034423423,0.000036655038,0.000029681069,0.00004468955,0.00012660486,0.0018569777],"genre_scores_gemma":[0.14040975,0.0014854133,0.8517993,0.0004602465,0.00033611967,0.00090254657,0.0002950946,0.00013089567,0.004180567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787116,0.00080845004,0.00016398178,0.00035758995,0.0006178848,0.00018087866],"domain_scores_gemma":[0.99746644,0.0016888707,0.00024761446,0.00030159648,0.00018472549,0.000110799934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029912684,0.0015418079,0.0012240724,0.0009913198,0.0010911786,0.0029107234,0.0031854468,0.00208585,0.0047104713],"category_scores_gemma":[0.0058418186,0.00073906145,0.0022914372,0.0014088496,0.004401325,0.003648791,0.0029115665,0.004327301,0.00090910535],"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.000017052851,0.000026103688,0.000113362665,0.00013031175,0.000026610745,0.00013420731,0.00010514381,0.12268576,0.0005215702,0.8603928,0.0012466469,0.01460037],"study_design_scores_gemma":[0.000044611614,0.00005713639,0.00006464135,0.00007531711,0.000022367207,0.00010941793,0.000046737317,0.37686187,0.0005534153,0.6052368,0.016905561,0.000022059447],"about_ca_topic_score_codex":0.004134722,"about_ca_topic_score_gemma":0.0038869516,"teacher_disagreement_score":0.0047104713,"about_ca_system_score_codex":0.0017185909,"about_ca_system_score_gemma":0.0025764583,"threshold_uncertainty_score":0.01581955},"labels":[],"label_agreement":null},{"id":"W2152225808","doi":"10.1109/tkde.2010.33","title":"Asking Generalized Queries to Domain Experts to Improve Learning","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"China University of Geosciences; Shanghai Jiao Tong University; University of Pennsylvania","keywords":"Computer science; Oracle; Construct (python library); Classifier (UML); Ask price; Domain (mathematical analysis); Set (abstract data type); Machine learning; Class (philosophy); Labeled data; Active learning (machine learning); Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.010832096937412392,"score_gpt":0.265796040034446,"score_spread":0.25496394309703363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152225808","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.043291826,0.0003066156,0.95137584,0.00079283613,0.00004704852,0.00022764994,0.00012009942,0.0023718432,0.0014661882],"genre_scores_gemma":[0.5127568,0.00020674168,0.48243806,0.00080163067,0.00020175597,0.00044976885,0.0008665992,0.0003196863,0.0019589309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98838764,0.00538301,0.00085900316,0.002462897,0.0023529134,0.0005544581],"domain_scores_gemma":[0.9429019,0.04266129,0.0022576808,0.0073725735,0.0039247484,0.00088168617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00988446,0.0022444671,0.003020145,0.0016130182,0.0010900731,0.002825211,0.004128054,0.0036949306,0.003855173],"category_scores_gemma":[0.04832206,0.00081465655,0.0011626132,0.0017579326,0.0018985512,0.0093127005,0.0043023797,0.0041496847,0.0012971578],"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.0013739346,0.0014264222,0.011622085,0.0005643048,0.00025022923,0.00036421407,0.0019987444,0.23474956,0.017689174,0.031095792,0.017088123,0.68177736],"study_design_scores_gemma":[0.00010741219,0.00017356582,0.00051022053,0.000017625225,0.00003922844,0.00011918847,0.00025551044,0.96070707,0.0050593745,0.030153416,0.0028311692,0.000026261509],"about_ca_topic_score_codex":0.0019177173,"about_ca_topic_score_gemma":0.0030617644,"teacher_disagreement_score":0.00988446,"about_ca_system_score_codex":0.0014547055,"about_ca_system_score_gemma":0.0018491343,"threshold_uncertainty_score":0.052274644},"labels":[],"label_agreement":null},{"id":"W2153773643","doi":"","title":"Sample Compression for Multi-label Concept Classes","year":2014,"lang":"en","type":"article","venue":"Conference on Learning Theory","topic":"Machine Learning and Algorithms","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 Regina","funders":"","keywords":"Dimension (graph theory); Sample (material); Compression (physics); VC dimension; Class (philosophy); Mathematics; Extension (predicate logic); Binary number; Sample size determination; Data compression; Computer science; Artificial intelligence; Algorithm; Combinatorics; Arithmetic; Statistics","score_opus":0.05949915847716699,"score_gpt":0.3286035096503646,"score_spread":0.26910435117319764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153773643","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.13739663,0.0020687156,0.85052496,0.0016256579,0.00016080176,0.00036090176,0.0005690417,0.00063611096,0.006657218],"genre_scores_gemma":[0.7506407,0.0009816427,0.24141745,0.0006717686,0.0004595443,0.00042969582,0.0012855676,0.00016851057,0.0039451546],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924238,0.0015648075,0.00031983684,0.0011151714,0.0039878758,0.0005885969],"domain_scores_gemma":[0.97299474,0.017389245,0.0014921712,0.005399219,0.0022138052,0.0005107704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047995243,0.00076227135,0.0013046153,0.0022881557,0.0012786875,0.0022610645,0.0017765437,0.001358524,0.0036200942],"category_scores_gemma":[0.027679387,0.00040096886,0.0008521033,0.0028135064,0.0026212316,0.0067116953,0.0036774604,0.0028551247,0.0004738175],"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.0012969156,0.00048958126,0.0058477162,0.00062689144,0.00015510726,0.00027139726,0.0008688366,0.14768285,0.025536358,0.3580032,0.0071717896,0.45204943],"study_design_scores_gemma":[0.00008315459,0.0003170153,0.001994368,0.00009147092,0.00003945466,0.00062322634,0.00018222332,0.7999318,0.02441863,0.164718,0.007546629,0.000054064894],"about_ca_topic_score_codex":0.0008768222,"about_ca_topic_score_gemma":0.0005550441,"teacher_disagreement_score":0.0047995243,"about_ca_system_score_codex":0.0029543065,"about_ca_system_score_gemma":0.0012551509,"threshold_uncertainty_score":0.025382638},"labels":[],"label_agreement":null},{"id":"W2156368963","doi":"","title":"Efficient Sampling for Bipartite Matching Problems","year":2012,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"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":"Bipartite graph; Matching (statistics); Generalization; Ranking (information retrieval); Inference; Sampling (signal processing); Computer science; Artificial intelligence; 3-dimensional matching; Sampling distribution; Algorithm; Machine learning; Pattern recognition (psychology); Theoretical computer science; Mathematics; Computer vision; Statistics","score_opus":0.03428214932290437,"score_gpt":0.29521028512546055,"score_spread":0.2609281358025562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156368963","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.01197094,0.00017059132,0.9861627,0.0001691792,0.000016424885,0.00010828769,0.00007044379,0.0003297661,0.0010017181],"genre_scores_gemma":[0.42535058,0.0003807802,0.5675831,0.00040394973,0.00013024085,0.0008590119,0.0011190131,0.00033462894,0.0038387799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960615,0.0022857406,0.000122036494,0.00060522824,0.00066163845,0.00026386618],"domain_scores_gemma":[0.9875337,0.009745598,0.00045028128,0.0013578618,0.0005327458,0.0003798336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065089175,0.0010297843,0.002052666,0.0012932047,0.0012191974,0.0014808556,0.002897508,0.002352021,0.004296103],"category_scores_gemma":[0.028089184,0.00101953,0.0012297085,0.0015666882,0.0020037692,0.0035833318,0.002941242,0.0026670103,0.0010985442],"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.00052642106,0.00039315262,0.0034889109,0.00032431877,0.00015026575,0.00019832868,0.00028523235,0.61701137,0.0038806384,0.25668156,0.005904682,0.11115509],"study_design_scores_gemma":[0.00004296103,0.00004049394,0.00011928806,0.0000073936553,0.000006858363,0.000031916275,0.00001436764,0.92038584,0.00037503205,0.078446075,0.0005226794,0.000007124391],"about_ca_topic_score_codex":0.0026345493,"about_ca_topic_score_gemma":0.003960084,"teacher_disagreement_score":0.0065089175,"about_ca_system_score_codex":0.0014868929,"about_ca_system_score_gemma":0.0016425757,"threshold_uncertainty_score":0.034422874},"labels":[],"label_agreement":null},{"id":"W2157910771","doi":"10.1145/1639714.1639783","title":"Preference elicitation with subjective features","year":2009,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"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":"Preference elicitation; Regret; Computer science; Preference; Preference learning; Set (abstract data type); Heuristic; Machine learning; Recommender system; Artificial intelligence; Feature (linguistics); Focus (optics); Mathematics","score_opus":0.010187741620892204,"score_gpt":0.23811803489866223,"score_spread":0.22793029327777004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157910771","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.038169578,0.0003005703,0.95192,0.0009144279,0.000046042544,0.000544926,0.00026686076,0.00020892495,0.007628686],"genre_scores_gemma":[0.62974477,0.00033305088,0.36539692,0.0004669493,0.000104402534,0.0011818623,0.0005035109,0.0000679882,0.002200528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.95681983,0.03259598,0.0018461114,0.0025670065,0.0053956327,0.00077545975],"domain_scores_gemma":[0.9110435,0.067747466,0.004326125,0.01119055,0.004590434,0.0011019547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02360436,0.0014379278,0.0017544467,0.0010686355,0.0008986738,0.0035568667,0.0020548757,0.002089824,0.0063110203],"category_scores_gemma":[0.09880253,0.00070563314,0.001382889,0.0020011524,0.001957113,0.0057261433,0.0036383073,0.0039398153,0.00084706524],"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.00265427,0.00088379614,0.0057090446,0.0017352275,0.0005962783,0.0005826897,0.0033309935,0.15712228,0.010691329,0.4731611,0.009490031,0.33404306],"study_design_scores_gemma":[0.0004730861,0.00089979876,0.002050165,0.00022261158,0.00017222902,0.00029840638,0.0008365359,0.47914243,0.0063939365,0.4999677,0.009342932,0.00020009579],"about_ca_topic_score_codex":0.0007837296,"about_ca_topic_score_gemma":0.0011023439,"teacher_disagreement_score":0.02360436,"about_ca_system_score_codex":0.0019175574,"about_ca_system_score_gemma":0.0016777535,"threshold_uncertainty_score":0.124833286},"labels":[],"label_agreement":null},{"id":"W2159035200","doi":"10.1016/j.tcs.2010.04.007","title":"Active learning in heteroscedastic noise","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Nemzeti Kutatási és Technológiai Hivatal; Magyar Tudományos Akadémia; Hungarian Scientific Research Fund","keywords":"Logarithm; Mathematics; Asymptotically optimal algorithm; Variance (accounting); Heteroscedasticity; Conjecture; Sample (material); Simple (philosophy); Distribution (mathematics); Sample size determination; Mathematical optimization; Applied mathematics; Statistics; Discrete mathematics; Mathematical analysis","score_opus":0.004437595498572343,"score_gpt":0.24734009686251593,"score_spread":0.2429025013639436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159035200","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.016898124,0.00074886985,0.97998273,0.00068300904,0.00010698959,0.000017042996,0.000066343215,0.00010766113,0.0013892622],"genre_scores_gemma":[0.859963,0.0018629082,0.11484327,0.0007774068,0.0010570029,0.00023120291,0.00046835007,0.00020740298,0.02058941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667645,0.0017343801,0.00013686079,0.0006845148,0.0005409089,0.0002268683],"domain_scores_gemma":[0.9558126,0.039356366,0.0011966829,0.0017552229,0.0013966839,0.00048243414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008740218,0.0009609798,0.0023000052,0.0010102951,0.00069615635,0.002875768,0.003224617,0.0028170445,0.0024471693],"category_scores_gemma":[0.037632417,0.0012568466,0.0010077707,0.0012504274,0.0038362683,0.005430602,0.0028143667,0.003386,0.0005323835],"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.00035169235,0.00011023594,0.0019543022,0.00026240977,0.00021613007,0.00017820224,0.0002479508,0.44059986,0.001210398,0.50946033,0.0021542627,0.043254282],"study_design_scores_gemma":[0.00002496123,0.000023270504,0.00018557369,0.000012763181,0.000020719748,0.000021668455,0.000010184296,0.8496784,0.00024503627,0.14932184,0.00044415655,0.000011480516],"about_ca_topic_score_codex":0.0024431602,"about_ca_topic_score_gemma":0.0021822813,"teacher_disagreement_score":0.008740218,"about_ca_system_score_codex":0.0012682696,"about_ca_system_score_gemma":0.0009881341,"threshold_uncertainty_score":0.046223223},"labels":[],"label_agreement":null},{"id":"W2160163251","doi":"10.1109/sfcs.1993.366857","title":"Exact learning via the Monotone theory","year":2002,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":116,"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 Calgary","funders":"","keywords":"Learnability; Boolean function; Equivalence (formal languages); Monotone polygon; Mathematics; Function (biology); Discrete mathematics; Decision tree; Computer science; Theoretical computer science; Combinatorics; Artificial intelligence","score_opus":0.010125325806749082,"score_gpt":0.22270071941575703,"score_spread":0.21257539360900796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160163251","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.040366482,0.0015192591,0.9448953,0.0024133634,0.000091660055,0.000059402453,0.00034284865,0.00030187375,0.010009768],"genre_scores_gemma":[0.7812334,0.002225297,0.20387258,0.0014537937,0.0008592242,0.0003295614,0.0012235633,0.00016927246,0.008633357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99428225,0.0022876905,0.00024298923,0.0010881893,0.0016797595,0.00041919266],"domain_scores_gemma":[0.96455824,0.030526087,0.0012134464,0.001808287,0.0014331202,0.00046076474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068197716,0.0009765811,0.0013693887,0.0027773557,0.0010794243,0.0028836178,0.0026901427,0.0020501055,0.0068042213],"category_scores_gemma":[0.03848279,0.000820424,0.0018368014,0.002032688,0.0043463483,0.0127297295,0.0043244557,0.003977637,0.00065511075],"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.000082874496,0.00009226628,0.0011947633,0.00028257698,0.00008205535,0.000096308344,0.00023564008,0.041806154,0.000718625,0.8915337,0.0030193487,0.06085571],"study_design_scores_gemma":[0.000013738059,0.000033419878,0.00015580309,0.000017632801,0.0000092205,0.0000525377,0.000015264182,0.13060868,0.00029415006,0.86800236,0.00078861817,0.000008579923],"about_ca_topic_score_codex":0.002418003,"about_ca_topic_score_gemma":0.0016728864,"teacher_disagreement_score":0.0068197716,"about_ca_system_score_codex":0.0029139677,"about_ca_system_score_gemma":0.0014072049,"threshold_uncertainty_score":0.03606683},"labels":[],"label_agreement":null},{"id":"W2161735965","doi":"","title":"Active Preference Learning with Discrete Choice Data","year":2007,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":131,"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 British Columbia","funders":"","keywords":"Computer science; Exploit; Valuation (finance); Rendering (computer graphics); Machine learning; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.04787942694329,"score_gpt":0.28626099704776475,"score_spread":0.23838157010447475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161735965","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.014260168,0.00023054746,0.98377717,0.00044160057,0.00003222051,0.000073560164,0.00010344423,0.00022117911,0.00086010766],"genre_scores_gemma":[0.5856068,0.00033245096,0.40981063,0.00040688354,0.00014685915,0.0005558917,0.00047430545,0.00007528323,0.0025908414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952167,0.0030221574,0.0002048215,0.0006643707,0.0006822007,0.00020982373],"domain_scores_gemma":[0.9685478,0.0268247,0.0011580368,0.0015671809,0.0012799401,0.0006222698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008188049,0.0011138889,0.0023549586,0.0014172008,0.0005881175,0.0026510402,0.0045946683,0.0028126116,0.0041327924],"category_scores_gemma":[0.028881485,0.0010126232,0.0014692995,0.0020974851,0.00192421,0.0058574225,0.002025853,0.0044001187,0.0008292051],"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.00066415354,0.00054068473,0.0034909814,0.0002993258,0.00024358292,0.00012459954,0.00031085577,0.7011273,0.0012551986,0.06689432,0.0033436788,0.22170527],"study_design_scores_gemma":[0.00003347585,0.000033037133,0.000066305896,0.000007921391,0.0000072636512,0.000011726187,0.000008408027,0.97768265,0.00029303174,0.02156855,0.00028055036,0.0000071683207],"about_ca_topic_score_codex":0.0022639688,"about_ca_topic_score_gemma":0.0023431622,"teacher_disagreement_score":0.008188049,"about_ca_system_score_codex":0.0013719839,"about_ca_system_score_gemma":0.001036339,"threshold_uncertainty_score":0.043303072},"labels":[],"label_agreement":null},{"id":"W2163187564","doi":"10.48550/arxiv.1503.08329","title":"Risk Bounds for the Majority Vote: From a PAC-Bayesian Analysis to a Learning Algorithm","year":2015,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":91,"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é Laval","funders":"","keywords":"Bayesian probability; Statistical learning theory; Computer science; Upper and lower bounds; Divergence (linguistics); AdaBoost; Artificial intelligence; Probably approximately correct learning; Machine learning; Algorithm; Bayesian statistics; Mathematics; Support vector machine; Bayesian inference; Algorithmic learning theory; Unsupervised learning","score_opus":0.03610584429556141,"score_gpt":0.19800057639686244,"score_spread":0.16189473210130104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163187564","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.0040895017,0.00097116205,0.98875624,0.001213816,0.00006565113,0.000035160967,0.000046703433,0.00012776967,0.004693949],"genre_scores_gemma":[0.45711198,0.003357322,0.5220872,0.0020241325,0.0013228003,0.00072006223,0.0003580766,0.00090393587,0.012114505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904795,0.004597498,0.0002743212,0.00122407,0.002836426,0.0005882059],"domain_scores_gemma":[0.97459066,0.019481864,0.0010910524,0.0021375944,0.0022174532,0.00048144214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012224386,0.0015428007,0.0027252573,0.001920375,0.001443888,0.0046704593,0.0035993338,0.0029628372,0.006149835],"category_scores_gemma":[0.050936386,0.0011385867,0.0015851952,0.00198084,0.005003858,0.0088037085,0.0050630337,0.0070713614,0.001496803],"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.00012642899,0.000070632086,0.00074621,0.00019038244,0.00008191809,0.000071044175,0.0002642788,0.22252798,0.0009186438,0.6907874,0.0065575647,0.07765753],"study_design_scores_gemma":[0.000014783119,0.000048587823,0.00020057039,0.000067815956,0.000014444428,0.00006113068,0.000030554427,0.52072084,0.0007923243,0.47450912,0.0035125315,0.000027180335],"about_ca_topic_score_codex":0.0014926518,"about_ca_topic_score_gemma":0.0009294066,"teacher_disagreement_score":0.012224386,"about_ca_system_score_codex":0.002880581,"about_ca_system_score_gemma":0.0023987154,"threshold_uncertainty_score":0.06464952},"labels":[],"label_agreement":null},{"id":"W2169842665","doi":"10.1109/icci.1992.227658","title":"Using the IIPS framework to specify machine-discovery problems","year":2003,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Simon Fraser University; University of Regina","funders":"","keywords":"Computer science; Inference; Task (project management); Inductive reasoning; Artificial intelligence; Machine learning; Programming language; Engineering; Systems engineering","score_opus":0.03462053778491779,"score_gpt":0.2903149586787505,"score_spread":0.2556944208938327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169842665","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.00030613283,0.000094490664,0.9943382,0.00077040686,0.00005235183,0.000100129604,0.00029261195,0.00086083525,0.0031847428],"genre_scores_gemma":[0.020577218,0.0003985855,0.9712204,0.00073688064,0.000101956706,0.00091996434,0.0016932858,0.00046641714,0.003885281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98431015,0.008098026,0.0019329069,0.0014319584,0.0034321179,0.00079476275],"domain_scores_gemma":[0.9710732,0.021707892,0.0011277236,0.0031999268,0.0023019705,0.00058923644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015790673,0.0028904795,0.0014654777,0.0034426537,0.0020636066,0.0065200925,0.0054477477,0.0031930367,0.01133045],"category_scores_gemma":[0.031666815,0.0020874497,0.0065436126,0.0037685432,0.0038827036,0.008026545,0.00557842,0.008149478,0.003628911],"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.000028978906,0.000038944687,0.00029793158,0.00027122942,0.000054711913,0.00023606478,0.0003617815,0.02182507,0.00045553886,0.9414776,0.0082269665,0.026725268],"study_design_scores_gemma":[0.000045841625,0.000029585726,0.000086465916,0.000104643324,0.00004865257,0.00020701246,0.00013184201,0.10874128,0.0032092715,0.8192022,0.068148926,0.000044306107],"about_ca_topic_score_codex":0.0069017853,"about_ca_topic_score_gemma":0.009360373,"teacher_disagreement_score":0.015790673,"about_ca_system_score_codex":0.0030682378,"about_ca_system_score_gemma":0.0058482,"threshold_uncertainty_score":0.08351004},"labels":[],"label_agreement":null},{"id":"W2169863116","doi":"10.1145/1557019.1557119","title":"Effective multi-label active learning for text classification","year":2009,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Computer science; Multi-label classification; Support vector machine; Labeled data; Reduction (mathematics); Artificial intelligence; Machine learning; Active learning (machine learning); Point (geometry); Semi-supervised learning; Data reduction; Data mining; Pattern recognition (psychology); Mathematics","score_opus":0.024442108777897514,"score_gpt":0.31377022152819983,"score_spread":0.28932811275030235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169863116","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.0034039281,0.00030980606,0.9951007,0.00021353012,0.000055356268,0.00004736336,0.000045343073,0.00046011072,0.0003638635],"genre_scores_gemma":[0.24899778,0.00055037776,0.74384034,0.0005894415,0.00043525157,0.0007524953,0.0008188804,0.00020644836,0.0038090027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99360985,0.0030320296,0.00035599348,0.0010348596,0.001713551,0.00025373558],"domain_scores_gemma":[0.98236394,0.012220528,0.0011822208,0.0018394667,0.0020358844,0.00035802243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008279143,0.0017152881,0.0024560997,0.002838794,0.0013055134,0.0027920378,0.0065498245,0.004035273,0.0023279684],"category_scores_gemma":[0.01612554,0.0009666382,0.0015485244,0.0025736513,0.0022426408,0.007726616,0.002993714,0.004497479,0.0013619971],"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.0006624349,0.0006528007,0.0014603167,0.00037821333,0.00015478679,0.00017318114,0.0003967032,0.24099962,0.012636451,0.033538587,0.008434546,0.7005124],"study_design_scores_gemma":[0.000019921119,0.000031893695,0.00006270243,0.000010134513,0.000008890358,0.000023865252,0.000014397607,0.9806157,0.0026371195,0.015920863,0.00064363587,0.000010907465],"about_ca_topic_score_codex":0.000909741,"about_ca_topic_score_gemma":0.0012854842,"teacher_disagreement_score":0.008279143,"about_ca_system_score_codex":0.0013210708,"about_ca_system_score_gemma":0.0009644994,"threshold_uncertainty_score":0.043784797},"labels":[],"label_agreement":null},{"id":"W2170708028","doi":"10.5555/944919.944952","title":"The set covering machine","year":2003,"lang":"en","type":"article","venue":"ePrints Soton (University of Southampton)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":112,"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":"Computer science; Generalization; Set (abstract data type); Artificial intelligence; Machine learning; Generalization error; Support vector machine; Function (biology); Upper and lower bounds; Data set; Online machine learning; Algorithm; Active learning (machine learning); Artificial neural network; Mathematics","score_opus":0.008750570278197119,"score_gpt":0.1916936409724109,"score_spread":0.18294307069421378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170708028","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.012950899,0.0013472206,0.977212,0.0006659473,0.00020058926,0.00007604838,0.0002671389,0.0009199011,0.0063601914],"genre_scores_gemma":[0.37261933,0.0021284027,0.6142649,0.000865355,0.0005884484,0.00039906127,0.0013942169,0.00030187718,0.007438405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758804,0.0008616052,0.000119159355,0.00045731958,0.00077843294,0.0001953959],"domain_scores_gemma":[0.99645257,0.0019495268,0.00021895615,0.00087552983,0.0003489845,0.00015446047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017735276,0.0009027614,0.0017437241,0.001767088,0.00095913996,0.0019589858,0.0019931793,0.0017753299,0.004347568],"category_scores_gemma":[0.011558062,0.0005101079,0.0014083366,0.002395843,0.0019674844,0.0038838675,0.0034099096,0.0020643666,0.00169045],"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.00018941975,0.00007899511,0.0014282379,0.00029978948,0.00013024315,0.00019788889,0.00031467443,0.12786353,0.00335315,0.31206036,0.019222533,0.53486115],"study_design_scores_gemma":[0.000025330906,0.00011396446,0.00048200786,0.00006445769,0.000036587782,0.00040280062,0.00004028139,0.6034234,0.0032903969,0.36915335,0.022929337,0.00003808793],"about_ca_topic_score_codex":0.00066971447,"about_ca_topic_score_gemma":0.00044398807,"teacher_disagreement_score":0.004347568,"about_ca_system_score_codex":0.00089482026,"about_ca_system_score_gemma":0.00077975605,"threshold_uncertainty_score":0.01454407},"labels":[],"label_agreement":null},{"id":"W2170962714","doi":"10.3115/1611528.1611532","title":"Active learning for the identification of nonliteral language","year":2007,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Literal (mathematical logic); Cluster analysis; Context (archaeology); Identification (biology); Artificial intelligence; Natural language processing; Selection (genetic algorithm); Algorithm","score_opus":0.007260639940655844,"score_gpt":0.2925523322964307,"score_spread":0.28529169235577484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170962714","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.013293557,0.0004226507,0.98346037,0.00022833273,0.000043509048,0.00006388984,0.00013297437,0.0014416451,0.00091321114],"genre_scores_gemma":[0.43342522,0.000394264,0.55983365,0.00031927982,0.00014320097,0.0005296206,0.0011159556,0.0003598167,0.0038790724],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968532,0.0014538504,0.00019157973,0.00074946193,0.0006145297,0.00013742776],"domain_scores_gemma":[0.9834179,0.013357821,0.0009684746,0.0009649234,0.0011287156,0.00016218441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058129397,0.001243725,0.0013260116,0.0025376352,0.0007735054,0.0019118631,0.0035150894,0.0018197101,0.0026481685],"category_scores_gemma":[0.019410765,0.000890418,0.0009525206,0.0017849223,0.0017143886,0.003560419,0.001927751,0.0021405627,0.000959197],"study_design_candidate":"bench_or_experimental","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.0006391261,0.00044047518,0.0052764527,0.0007769702,0.00031232968,0.0005285891,0.001142899,0.28728557,0.014286906,0.04269965,0.005797587,0.64081347],"study_design_scores_gemma":[0.000023416327,0.000030247573,0.0002699178,0.000025726267,0.000015888161,0.000056530334,0.000050482933,0.96711975,0.003943568,0.026614092,0.0018362264,0.000014151776],"about_ca_topic_score_codex":0.0016421918,"about_ca_topic_score_gemma":0.0024401299,"teacher_disagreement_score":0.0058129397,"about_ca_system_score_codex":0.0010522647,"about_ca_system_score_gemma":0.00090117025,"threshold_uncertainty_score":0.030742168},"labels":[],"label_agreement":null},{"id":"W2171009797","doi":"10.1109/icassp.2004.1327157","title":"Theory of Monte Carlo sampling-based Alopex algorithms for neural networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Monte Carlo method; Computer science; Algorithm; Convergence (economics); Sampling (signal processing); Artificial neural network; Hybrid Monte Carlo; Monte Carlo integration; Importance sampling; Artificial intelligence; Bayesian probability; Mathematical optimization; Markov chain Monte Carlo; Mathematics; Statistics","score_opus":0.027187652867223803,"score_gpt":0.2796618321461932,"score_spread":0.2524741792789694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171009797","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.0008626673,0.00010572428,0.9983329,0.00005453462,0.000014754197,0.00002143323,0.00001204763,0.00010339481,0.0004925881],"genre_scores_gemma":[0.11276086,0.0005597159,0.8820155,0.00023149664,0.00013595987,0.0008055575,0.00018362733,0.00018541768,0.0031219162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983271,0.000875674,0.00008117827,0.00019875071,0.00042938837,0.00008789751],"domain_scores_gemma":[0.9937052,0.00480334,0.00025259904,0.00044909876,0.000667998,0.000121855126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003951209,0.0009868771,0.0011997581,0.0013037923,0.000758429,0.0014805588,0.0024299556,0.0017554667,0.0042737117],"category_scores_gemma":[0.017131817,0.0008001987,0.0007278142,0.0014026867,0.0018627449,0.0029999274,0.0022499496,0.0023386155,0.001023922],"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.000117961536,0.000059438567,0.00073014223,0.00014546815,0.00006306167,0.000060948823,0.000119245095,0.5961343,0.0015176297,0.28447798,0.0022029744,0.11437075],"study_design_scores_gemma":[0.000013902262,0.000022421404,0.00006991034,0.000012350481,0.0000044569683,0.000022938757,0.0000041990825,0.9390453,0.00053401134,0.05896377,0.001298334,0.000008367143],"about_ca_topic_score_codex":0.002042689,"about_ca_topic_score_gemma":0.0018960744,"teacher_disagreement_score":0.0042737117,"about_ca_system_score_codex":0.0011320307,"about_ca_system_score_gemma":0.0013432577,"threshold_uncertainty_score":0.020896256},"labels":[],"label_agreement":null},{"id":"W2180483632","doi":"10.1016/j.tcs.2015.02.006","title":"Complexity of barrier coverage with relocatable sensors in the plane","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo; Concordia University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Minimax; Plane (geometry); Set (abstract data type); Perpendicular; Range (aeronautics); Time complexity; Computer science; Line (geometry); Mathematical optimization; Algorithm; Mathematics; Topology (electrical circuits); Combinatorics; Geometry; Engineering","score_opus":0.020268602013612684,"score_gpt":0.2532846675983693,"score_spread":0.23301606558475663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180483632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62797844,0.0014287637,0.31691912,0.0067011095,0.00018833554,0.0003498933,0.0042221695,0.0009407811,0.041271426],"genre_scores_gemma":[0.9437791,0.0009574011,0.04319604,0.00035337918,0.000176554,0.0002781945,0.001999975,0.00034907804,0.008910182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798137,0.0005815333,0.000094907075,0.00033852717,0.00049671374,0.0005069244],"domain_scores_gemma":[0.97623694,0.019832814,0.0013595261,0.00086782884,0.0006290702,0.0010738712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015098504,0.0012369356,0.00244944,0.0011671542,0.0013071235,0.004232689,0.0032285184,0.0031495343,0.01553787],"category_scores_gemma":[0.02114505,0.0011721362,0.0013444979,0.0019216276,0.0017916212,0.0058403816,0.0038236897,0.0025668703,0.00089140574],"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.001046693,0.000135542,0.0031016064,0.00044805818,0.00012123354,0.00042186008,0.00035970582,0.8689179,0.0022279376,0.1003186,0.00887815,0.014022678],"study_design_scores_gemma":[0.0001533448,0.000079243015,0.00071233994,0.00003138197,0.000048140068,0.00018262737,0.00021691674,0.88482714,0.00068484445,0.11189358,0.0011479848,0.00002247704],"about_ca_topic_score_codex":0.0072639296,"about_ca_topic_score_gemma":0.0035990633,"teacher_disagreement_score":0.01553787,"about_ca_system_score_codex":0.0022865215,"about_ca_system_score_gemma":0.0018912157,"threshold_uncertainty_score":0.051979303},"labels":[],"label_agreement":null},{"id":"W2181598850","doi":"10.1007/978-3-642-41527-2_3","title":"Use Knowledge to Learn Faster: Topology Recognition with Advice","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Advice (programming); Computer science; Topology (electrical circuits); Artificial intelligence; Programming language; Electrical engineering; Engineering","score_opus":0.021133910231674588,"score_gpt":0.2543838681498512,"score_spread":0.2332499579181766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181598850","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.022754721,0.0008199754,0.93699354,0.00089896267,0.00029355485,0.000090435016,0.0003950789,0.0153308725,0.022422927],"genre_scores_gemma":[0.20827006,0.00087735296,0.76389825,0.0004493628,0.00016637066,0.00010955658,0.0010800697,0.0017628123,0.02338614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995505,0.00006588868,0.000026797905,0.00014518786,0.00017204153,0.000039451195],"domain_scores_gemma":[0.99795437,0.0009305194,0.0000974146,0.0006004136,0.00033341523,0.00008374798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066291663,0.00094398967,0.00075853814,0.0008847775,0.00039189775,0.0014967844,0.0021576807,0.0013488651,0.017219659],"category_scores_gemma":[0.0050800806,0.0006292753,0.00070434384,0.00082107284,0.0007862284,0.004254373,0.0012487153,0.001813192,0.0063141338],"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.00015700569,0.000103561666,0.00077825255,0.00022178586,0.000040748087,0.00013679216,0.00022565499,0.040323965,0.008833074,0.019434646,0.025203051,0.9045414],"study_design_scores_gemma":[0.00006792851,0.00009113144,0.0006163108,0.0001122424,0.000089257905,0.00034388385,0.00015205742,0.77282697,0.022815054,0.15885618,0.0439792,0.000049777103],"about_ca_topic_score_codex":0.003267679,"about_ca_topic_score_gemma":0.0042572767,"teacher_disagreement_score":0.017219659,"about_ca_system_score_codex":0.0005313813,"about_ca_system_score_gemma":0.00067846105,"threshold_uncertainty_score":0.057605505},"labels":[],"label_agreement":null},{"id":"W2182286517","doi":"","title":"From PAC-Bayes Bounds to Quadratic Programs for Majority Votes","year":2011,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":49,"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é Laval","funders":"","keywords":"Margin (machine learning); Upper and lower bounds; AdaBoost; Bayes' theorem; Mathematics; Quadratic equation; Divergence (linguistics); Minification; Basis (linear algebra); Combinatorics; Computer science; Algorithm; Support vector machine; Mathematical optimization; Artificial intelligence; Machine learning; Bayesian probability","score_opus":0.06972141086261915,"score_gpt":0.3134253480200855,"score_spread":0.24370393715746633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182286517","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.001764212,0.00045708558,0.9926246,0.00047978282,0.000055674434,0.000027949009,0.000027391648,0.00010673198,0.004456534],"genre_scores_gemma":[0.284379,0.0016438948,0.6925526,0.0014616891,0.0009500215,0.0007593217,0.00039034124,0.0010598084,0.016803266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99309856,0.0032184843,0.00018652728,0.0009781136,0.0020352127,0.00048312565],"domain_scores_gemma":[0.98300594,0.013076511,0.00075845956,0.00097588345,0.001777894,0.00040536828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010111499,0.0020392267,0.0021242464,0.001514971,0.0012628922,0.00484926,0.003210419,0.0029678165,0.007245364],"category_scores_gemma":[0.038752392,0.0013368941,0.0011796262,0.001443334,0.003869014,0.007734678,0.0052937404,0.0072272196,0.0015645579],"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.00011023392,0.00007755385,0.00044905685,0.0001767372,0.000054916192,0.000054567565,0.00019889715,0.24283628,0.0005501755,0.6747662,0.006242676,0.07448282],"study_design_scores_gemma":[0.000013078523,0.000019092142,0.000051481085,0.000042616928,0.000007705136,0.000016453432,0.00001538784,0.65514475,0.00045353523,0.3420186,0.0022056208,0.000011641378],"about_ca_topic_score_codex":0.002218257,"about_ca_topic_score_gemma":0.0020359375,"teacher_disagreement_score":0.010111499,"about_ca_system_score_codex":0.002975956,"about_ca_system_score_gemma":0.0026039134,"threshold_uncertainty_score":0.05347532},"labels":[],"label_agreement":null},{"id":"W2182705849","doi":"","title":"Structured Output Learning with High Order Loss Functions","year":2012,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":44,"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":"Leverage (statistics); Computer science; Inference; Margin (machine learning); Focus (optics); Machine learning; Graphical model; Order (exchange); Theoretical computer science; Information loss; Artificial intelligence","score_opus":0.007032438409102007,"score_gpt":0.2165185897935201,"score_spread":0.2094861513844181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182705849","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.010072289,0.00021916525,0.9873072,0.00048269288,0.000024832532,0.000050097737,0.00011307177,0.00048081906,0.001249821],"genre_scores_gemma":[0.57210386,0.00056023896,0.41517788,0.00091165124,0.00025232317,0.00046981184,0.0014018689,0.0003129856,0.008809304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969446,0.0017367422,0.000128896,0.00042034272,0.0005792277,0.00019014583],"domain_scores_gemma":[0.99116,0.0060356287,0.00060414104,0.0013094974,0.00064565387,0.00024514482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065719686,0.00219525,0.0017113523,0.00091699493,0.0005686179,0.0018969543,0.0022262088,0.002611203,0.0040581943],"category_scores_gemma":[0.015775297,0.0006039894,0.0010061916,0.0010933528,0.002177442,0.005130043,0.0029701216,0.004183392,0.0016277318],"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.0004365382,0.0004400092,0.003021742,0.0002848383,0.00012670446,0.0003209598,0.00020640297,0.67412937,0.0029047742,0.13815825,0.008753169,0.17121722],"study_design_scores_gemma":[0.00002234363,0.00007105614,0.00017707872,0.00001734732,0.000009182225,0.000033881293,0.0000112574235,0.92586184,0.00078221376,0.07245743,0.00054684817,0.000009518283],"about_ca_topic_score_codex":0.0009428707,"about_ca_topic_score_gemma":0.0015489624,"teacher_disagreement_score":0.0065719686,"about_ca_system_score_codex":0.0013915601,"about_ca_system_score_gemma":0.0012884623,"threshold_uncertainty_score":0.034756303},"labels":[],"label_agreement":null},{"id":"W2183286887","doi":"","title":"Learning from Weak Teachers","year":2012,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":28,"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":"Computer science; Sample complexity; Intuition; Crowdsourcing; Machine learning; Artificial intelligence; Sample (material); Homogeneous; Parametric statistics; Probably approximately correct learning; Quality (philosophy); Generality; Active learning (machine learning); Algorithmic learning theory; Mathematics","score_opus":0.09309872800627544,"score_gpt":0.34262361586816775,"score_spread":0.2495248878618923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183286887","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.063417345,0.0003717299,0.9307538,0.002083668,0.000045959696,0.000095352574,0.0002278198,0.00045410197,0.0025502138],"genre_scores_gemma":[0.7586411,0.00048064807,0.23002702,0.001160611,0.0002628742,0.00048800054,0.0011323997,0.00020799405,0.007599379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928437,0.0033930806,0.00029640348,0.0018842359,0.0011894482,0.000393131],"domain_scores_gemma":[0.9503491,0.036601078,0.002803766,0.005969176,0.0029841182,0.0012929066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010516962,0.0013382719,0.0026185438,0.001608778,0.0013896339,0.0033240214,0.0038038,0.0034485434,0.003759255],"category_scores_gemma":[0.081139475,0.0012047677,0.0012879162,0.0013997622,0.004165202,0.009719865,0.0074942377,0.0049407813,0.0016065615],"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.0015485566,0.0005113286,0.029041542,0.0008647543,0.00037551144,0.00062620343,0.0027245525,0.33069918,0.0059735063,0.36337557,0.014766487,0.24949293],"study_design_scores_gemma":[0.000107328844,0.00018449836,0.0010028252,0.00006208992,0.000041223724,0.00017433439,0.0002513359,0.71112704,0.0028731618,0.28107625,0.003067045,0.00003288429],"about_ca_topic_score_codex":0.0010900379,"about_ca_topic_score_gemma":0.001317203,"teacher_disagreement_score":0.010516962,"about_ca_system_score_codex":0.0017207782,"about_ca_system_score_gemma":0.0015757199,"threshold_uncertainty_score":0.055619657},"labels":[],"label_agreement":null},{"id":"W2185685412","doi":"10.1080/10691898.2003.11910695","title":"Multiple-Choice Randomization","year":2003,"lang":"en","type":"article","venue":"Journal of Statistics Education","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Randomization; Cheating; Randomized experiment; Computer science; Randomized controlled trial; Sample (material); Mathematics education; Psychology; Statistics; Econometrics; Mathematics; Social psychology; Medicine","score_opus":0.007929292996903231,"score_gpt":0.27150498234746295,"score_spread":0.26357568935055975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185685412","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.038646627,0.0012549039,0.79037076,0.0019779364,0.0043288465,0.11585717,0.0033285082,0.004083893,0.04015137],"genre_scores_gemma":[0.22007672,0.0010203186,0.518573,0.0023023407,0.0011202302,0.22720869,0.0010787798,0.0008516046,0.02776827],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.90005666,0.077077895,0.0056089344,0.005716815,0.009036409,0.0025033278],"domain_scores_gemma":[0.8469473,0.09739454,0.006814224,0.034949582,0.01127639,0.0026180148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.056289602,0.0021069741,0.0034016247,0.0019272151,0.0014949946,0.0024697443,0.0028914171,0.0028366635,0.08131513],"category_scores_gemma":[0.21212944,0.0010122702,0.0009951338,0.0025800157,0.0027667866,0.002503244,0.0032847873,0.0043965634,0.012528775],"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.04112221,0.0051279305,0.003904697,0.0035142123,0.0005385171,0.00048224596,0.0034739561,0.0067004384,0.010062469,0.27691123,0.07854766,0.56961447],"study_design_scores_gemma":[0.043733712,0.019448273,0.0059268125,0.0017785899,0.0007184172,0.001041319,0.0009670837,0.054987527,0.021613881,0.35958508,0.48951152,0.0006878938],"about_ca_topic_score_codex":0.00033344785,"about_ca_topic_score_gemma":0.0007184264,"teacher_disagreement_score":0.08131513,"about_ca_system_score_codex":0.0015108674,"about_ca_system_score_gemma":0.0034205108,"threshold_uncertainty_score":0.2976914},"labels":[],"label_agreement":null},{"id":"W2192675411","doi":"","title":"Smooth and strong: MAP inference with linear convergence","year":2015,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":20,"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":"Convexity; Smoothness; Mathematical optimization; Linear programming; Inference; Relaxation (psychology); Separable space; Computer science; Convergence (economics); Bounding overwatch; Optimization problem; Bellman equation; Linear programming relaxation; Focus (optics); Function (biology); Mathematics; Algorithm; Artificial intelligence","score_opus":0.025184544398007915,"score_gpt":0.27384454877151737,"score_spread":0.24866000437350946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2192675411","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.003546926,0.00060666655,0.9921646,0.0006492321,0.00005650423,0.00004777088,0.00008012066,0.00032700875,0.0025212374],"genre_scores_gemma":[0.2945713,0.0019520017,0.68995583,0.0009613419,0.0005850875,0.00063039246,0.00057665416,0.0009242172,0.009843183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966742,0.0018175015,0.00010560721,0.000531207,0.0006541074,0.00021742244],"domain_scores_gemma":[0.9835224,0.013243961,0.0007734209,0.0010552795,0.0010130673,0.00039179347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007897332,0.0025222602,0.0019039422,0.0014495448,0.0009981404,0.0027425168,0.0027387764,0.0036444683,0.0051741526],"category_scores_gemma":[0.037003722,0.001621783,0.0015863464,0.0015519836,0.0037536996,0.004843892,0.0069272467,0.00680447,0.00174502],"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.0003730627,0.0001468374,0.0008304708,0.00061474164,0.00015828454,0.00028836247,0.00022039331,0.71566945,0.0028478862,0.19272794,0.009311696,0.07681086],"study_design_scores_gemma":[0.000019213621,0.00004101905,0.0000829622,0.000037418966,0.000011748244,0.000046072928,0.000015775164,0.9258795,0.00088182365,0.07163742,0.0013341018,0.000012895073],"about_ca_topic_score_codex":0.0017352154,"about_ca_topic_score_gemma":0.00227607,"teacher_disagreement_score":0.007897332,"about_ca_system_score_codex":0.001502282,"about_ca_system_score_gemma":0.0022616596,"threshold_uncertainty_score":0.04176557},"labels":[],"label_agreement":null},{"id":"W2194321275","doi":"10.1126/science.aab3050","title":"Human-level concept learning through probabilistic program induction","year":2015,"lang":"en","type":"article","venue":"Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2930,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Army Research Office; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Alphabet; Artificial intelligence; Probabilistic logic; Turing; Natural language processing; Machine learning; Programming language; Linguistics","score_opus":0.08790062134160331,"score_gpt":0.35687654798195895,"score_spread":0.26897592664035563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2194321275","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.031148218,0.000099869154,0.9638201,0.000590424,0.000020323714,0.00005825394,0.00015809109,0.0012177523,0.002886912],"genre_scores_gemma":[0.6250239,0.00022816003,0.36902145,0.00031266813,0.00004325946,0.00028595867,0.0006471467,0.00015828996,0.004279123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995297,0.00015323948,0.0000151882405,0.00016852582,0.00010205944,0.000031310905],"domain_scores_gemma":[0.99688417,0.0020871882,0.00021408098,0.0004799764,0.00022335946,0.000111262416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011376055,0.00058629777,0.00045649102,0.0005217223,0.0004270935,0.00095540605,0.001979226,0.00077052444,0.003336357],"category_scores_gemma":[0.0062163975,0.00040055875,0.0008089835,0.00055831706,0.0014213651,0.0026701016,0.0014613194,0.0021216795,0.0007415737],"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.00023731004,0.00034628855,0.0046126302,0.00023687683,0.00010643631,0.00015786367,0.00045448027,0.5284888,0.007181862,0.15229765,0.009606091,0.2962736],"study_design_scores_gemma":[0.000010390954,0.000022239552,0.00014663178,0.000008880661,0.0000062878016,0.000023879362,0.000010698766,0.93599445,0.0013607433,0.06157638,0.0008335547,0.0000058042842],"about_ca_topic_score_codex":0.002478987,"about_ca_topic_score_gemma":0.004061829,"teacher_disagreement_score":0.003336357,"about_ca_system_score_codex":0.0009249291,"about_ca_system_score_gemma":0.0010431395,"threshold_uncertainty_score":0.011161268},"labels":[],"label_agreement":null},{"id":"W2200051882","doi":"","title":"Data sparseness in linear SVM","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Support vector machine; Computer science; Inference; Machine learning; Convergence (economics); Artificial intelligence; Data mining; Bayes' theorem; Pattern recognition (psychology); Bayesian probability","score_opus":0.3493317464406938,"score_gpt":0.4170538751309196,"score_spread":0.06772212869022581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200051882","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.021288866,0.0005033699,0.9762304,0.0006752763,0.000037403013,0.00004932426,0.000053994725,0.0002502894,0.0009111441],"genre_scores_gemma":[0.74558175,0.00080653385,0.25034326,0.0005979073,0.0002288789,0.0002752937,0.00043930055,0.00016357844,0.0015636231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99500424,0.0025680098,0.00023491548,0.0006884239,0.0013109832,0.00019327343],"domain_scores_gemma":[0.97117776,0.023786748,0.0012313395,0.0015054651,0.0019852968,0.00031340818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008235198,0.0005635389,0.0012512441,0.00080623303,0.0006420108,0.0015323756,0.0013104529,0.0014306279,0.001037855],"category_scores_gemma":[0.055404235,0.00064525154,0.00047749802,0.0011204472,0.0017994284,0.0029551226,0.0018024121,0.0027842673,0.00033069015],"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.00044421866,0.00015155492,0.006849531,0.0004290402,0.00010984618,0.00029342473,0.0003973904,0.7008481,0.004596523,0.121865146,0.004397065,0.15961815],"study_design_scores_gemma":[0.00000879397,0.00003098865,0.00026518502,0.000011908706,0.0000042983966,0.000049011604,0.000014127057,0.96733,0.00062655355,0.031364862,0.00028917193,0.0000051990364],"about_ca_topic_score_codex":0.0014978894,"about_ca_topic_score_gemma":0.00094119355,"teacher_disagreement_score":0.008235198,"about_ca_system_score_codex":0.0011194582,"about_ca_system_score_gemma":0.00083791115,"threshold_uncertainty_score":0.0435524},"labels":[],"label_agreement":null},{"id":"W2203314088","doi":"10.1007/978-1-4939-2864-4_709","title":"Testing Juntas and Related Properties of Boolean Functions","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.015278308512105186,"score_gpt":0.20993583485455644,"score_spread":0.19465752634245126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203314088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46145862,0.00444133,0.45756358,0.01042867,0.0013569308,0.00042475385,0.0051039415,0.0052545452,0.05396774],"genre_scores_gemma":[0.90183705,0.0010808443,0.08343166,0.0013469617,0.0008303219,0.0002671756,0.004735212,0.0008049349,0.0056658825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9863993,0.0038733298,0.0011053252,0.0032216706,0.004156027,0.0012443267],"domain_scores_gemma":[0.8585399,0.12513539,0.0036455053,0.007960568,0.003522237,0.0011963837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072575957,0.0019622834,0.0017154074,0.0023472335,0.0014643715,0.00510911,0.005079574,0.0033136602,0.01049737],"category_scores_gemma":[0.08491667,0.0010334934,0.0032979618,0.0025407064,0.00588737,0.0162178,0.0041269404,0.0054237475,0.001279174],"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.003614154,0.0013171966,0.029330792,0.0021920379,0.0006486551,0.00096990686,0.00087680714,0.08296921,0.011005288,0.5929701,0.025425725,0.24868008],"study_design_scores_gemma":[0.00017657234,0.0002036289,0.0010496137,0.00015149685,0.00012371616,0.00037834933,0.00022431713,0.11679446,0.0054801507,0.8730602,0.0023159385,0.000041484018],"about_ca_topic_score_codex":0.0012386516,"about_ca_topic_score_gemma":0.0018593788,"teacher_disagreement_score":0.01049737,"about_ca_system_score_codex":0.0023050397,"about_ca_system_score_gemma":0.002986186,"threshold_uncertainty_score":0.03838229},"labels":[],"label_agreement":null},{"id":"W2206671546","doi":"10.4230/lipics.cp.2022.8","title":"Learning MAX-SAT Models from Examples Using Genetic Algorithms and Knowledge Compilation","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Modulo; Preference; Preference elicitation; Psychology; Mathematical economics; Computer science; Mathematics; Discrete mathematics; Statistics","score_opus":0.057327003122854825,"score_gpt":0.297874918731804,"score_spread":0.24054791560894917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206671546","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.04930885,0.00047088362,0.9361725,0.00086209,0.00009303053,0.00018171465,0.00035878562,0.005680561,0.006871696],"genre_scores_gemma":[0.30378604,0.00036275623,0.6898373,0.0005760838,0.00008526935,0.00042239716,0.0016765889,0.0007937792,0.0024597347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796814,0.0009261618,0.00010207673,0.00042827512,0.0003733128,0.00020195798],"domain_scores_gemma":[0.9937874,0.004780603,0.00030114187,0.000635406,0.00036483127,0.00013052202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018865921,0.0023494298,0.0016860797,0.0018450534,0.00075872213,0.0020388928,0.0027232636,0.0020908248,0.0059374375],"category_scores_gemma":[0.01123017,0.0013346717,0.0028853195,0.0016504892,0.0016780355,0.0032276087,0.0026606368,0.0031500165,0.0012923232],"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.00012490015,0.00019652682,0.0017762586,0.00023420228,0.000119816126,0.00015049492,0.00012946529,0.82879454,0.0015536657,0.019784894,0.0042323954,0.14290294],"study_design_scores_gemma":[0.000031264553,0.00002954025,0.00010488681,0.00002700267,0.000026698492,0.000027878566,0.00003136325,0.97532743,0.0009692385,0.022421177,0.0009948441,0.000008644048],"about_ca_topic_score_codex":0.005851253,"about_ca_topic_score_gemma":0.011489856,"teacher_disagreement_score":0.0059374375,"about_ca_system_score_codex":0.0019209316,"about_ca_system_score_gemma":0.0026122772,"threshold_uncertainty_score":0.019862652},"labels":[],"label_agreement":null},{"id":"W2208773343","doi":"10.48550/arxiv.1506.05900","title":"Representation Learning for Clustering: A Statistical Framework","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"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":"Cluster analysis; Computer science; Dimension (graph theory); Correlation clustering; Representation (politics); Artificial intelligence; Clustering high-dimensional data; Sample (material); Conceptual clustering; Theoretical computer science; Constrained clustering; Class (philosophy); Data mining; CURE data clustering algorithm; Mathematics","score_opus":0.10326938999633002,"score_gpt":0.25580384703109627,"score_spread":0.15253445703476626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2208773343","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.0017147026,0.00018593368,0.995635,0.0009423591,0.0000232946,0.000035321802,0.00006852615,0.00009992256,0.0012950206],"genre_scores_gemma":[0.31625405,0.0015667481,0.67312855,0.0014616958,0.0009233506,0.0012264742,0.0007230141,0.0003935048,0.0043226336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98031723,0.011884224,0.00073138304,0.0030322964,0.003321876,0.0007131227],"domain_scores_gemma":[0.9166541,0.06223099,0.004906902,0.011902556,0.0032515875,0.0010538449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016711794,0.0015485407,0.002011409,0.00363604,0.0020799302,0.006774498,0.0059165834,0.0045811776,0.004583616],"category_scores_gemma":[0.07684788,0.0013121814,0.002384795,0.0041279164,0.010882498,0.015042418,0.007204793,0.0074680937,0.0012312604],"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.000023849681,0.000031055606,0.00028203055,0.000098354205,0.000046413796,0.000036922167,0.00015775161,0.040776383,0.00039593692,0.94597155,0.0009201662,0.011259645],"study_design_scores_gemma":[0.000010007233,0.000023062239,0.00009217157,0.00002550881,0.000010949293,0.00003427146,0.000033368295,0.19516799,0.00038664276,0.8023961,0.0018007483,0.000019100296],"about_ca_topic_score_codex":0.002230736,"about_ca_topic_score_gemma":0.0013961896,"teacher_disagreement_score":0.016711794,"about_ca_system_score_codex":0.0051079392,"about_ca_system_score_gemma":0.0034380157,"threshold_uncertainty_score":0.08838141},"labels":[],"label_agreement":null},{"id":"W2209166757","doi":"10.1016/j.tcs.2015.10.035","title":"Partial learning of recursively enumerable languages","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National University of Singapore","keywords":"Consistency (knowledge bases); Recursion (computer science); Mathematics; Inference; Recursively enumerable language; Limit (mathematics); Extension (predicate logic); Partial function; Class (philosophy); Relation (database); Inductive reasoning; Theoretical computer science; Computer science; Artificial intelligence; Discrete mathematics; Algorithm; Programming language; Data mining","score_opus":0.011608975006489186,"score_gpt":0.2756719027429692,"score_spread":0.26406292773648005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209166757","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.15492524,0.0007685765,0.82900983,0.0014617423,0.000082121085,0.000072213166,0.0007381952,0.0016302179,0.011311763],"genre_scores_gemma":[0.79926705,0.0006443993,0.18279101,0.0005729509,0.00015749407,0.00023820889,0.0023993151,0.00052408833,0.013405477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785596,0.0010104259,0.000119412885,0.00039712916,0.00038524353,0.00023175763],"domain_scores_gemma":[0.97351664,0.021666205,0.00074904336,0.0022837792,0.0012589525,0.0005254395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002066225,0.0006720556,0.00091826665,0.0011035679,0.0010686758,0.0029849284,0.0021194627,0.0012159415,0.007331421],"category_scores_gemma":[0.026520232,0.00086514425,0.0013987329,0.0012663944,0.002459894,0.007610806,0.0032751972,0.003311195,0.0009441817],"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.000245281,0.000110703244,0.0028810573,0.00032478434,0.00006432978,0.0001455164,0.0006920346,0.059773564,0.0023419783,0.8377291,0.0044943104,0.09119722],"study_design_scores_gemma":[0.000016147253,0.000026245643,0.0001893276,0.000038064005,0.000014777135,0.000059077265,0.00005161427,0.14199594,0.0009281651,0.85544604,0.0012225857,0.00001221563],"about_ca_topic_score_codex":0.0014958398,"about_ca_topic_score_gemma":0.0038067356,"teacher_disagreement_score":0.007331421,"about_ca_system_score_codex":0.0016683723,"about_ca_system_score_gemma":0.0018749812,"threshold_uncertainty_score":0.02452606},"labels":[],"label_agreement":null},{"id":"W2211963773","doi":"","title":"Risk Bounds and Learning Algorithms for the Regression Approach to Structured Output Prediction","year":2013,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"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é Laval","funders":"","keywords":"Quadratic equation; Regression; Kernel (algebra); Upper and lower bounds; Computer science; Regular polygon; Regression analysis; Mathematics; Algorithm; Mathematical optimization; Machine learning; Statistics; Discrete mathematics","score_opus":0.028572190901835257,"score_gpt":0.28665109385407767,"score_spread":0.2580789029522424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211963773","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.0017021451,0.0005582394,0.99545515,0.00044229618,0.000064106054,0.000029589086,0.000047647212,0.00019514872,0.0015056093],"genre_scores_gemma":[0.30442068,0.0038755627,0.67396694,0.0012153167,0.0014101323,0.0009440277,0.0010336434,0.0011086927,0.012024994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920684,0.0034040806,0.00034386912,0.0012436407,0.0023993335,0.00054063596],"domain_scores_gemma":[0.9508597,0.03740904,0.0025557221,0.0033554325,0.0050436524,0.000776375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013467181,0.003613578,0.0024120328,0.002113352,0.0009861201,0.0032484066,0.0033061237,0.003664238,0.0072609284],"category_scores_gemma":[0.07852713,0.0011092214,0.00203518,0.0019785997,0.003662852,0.0063435724,0.0062449006,0.009704475,0.002563614],"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.00021099132,0.00018772202,0.0014588267,0.0003801982,0.00014747151,0.00019364586,0.00023354185,0.47952533,0.0024228934,0.41829026,0.0077623734,0.089186765],"study_design_scores_gemma":[0.00001734689,0.000063056934,0.00017452684,0.00006124132,0.000019383679,0.00005648771,0.00001562578,0.8682609,0.00080097315,0.12924951,0.0012578558,0.000023119386],"about_ca_topic_score_codex":0.0015537818,"about_ca_topic_score_gemma":0.0013042428,"teacher_disagreement_score":0.013467181,"about_ca_system_score_codex":0.0023080935,"about_ca_system_score_gemma":0.0023032103,"threshold_uncertainty_score":0.07122207},"labels":[],"label_agreement":null},{"id":"W2231068950","doi":"10.32657/10356/13589","title":"Refining learning models in grammatical inference","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Medicine","score_opus":0.03181785070493954,"score_gpt":0.29515875040633455,"score_spread":0.263340899701395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2231068950","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.0272376,0.00023967763,0.9696624,0.0005237877,0.00003383826,0.00006388438,0.00013771561,0.0008781619,0.0012229463],"genre_scores_gemma":[0.3958854,0.00058111746,0.5984568,0.0003893829,0.00008092347,0.00027709248,0.00086782046,0.00031854908,0.003142862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695945,0.0011605759,0.00020239328,0.0009231157,0.0005895715,0.00016493765],"domain_scores_gemma":[0.983872,0.0121156415,0.0006066921,0.0023462705,0.00092875725,0.00013048809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028994414,0.0009219865,0.001390307,0.001432757,0.00088176026,0.0018175495,0.0020969212,0.0015646167,0.0033548018],"category_scores_gemma":[0.022569355,0.0010402992,0.002612973,0.0010294552,0.0021011352,0.00605973,0.0028035613,0.0030819408,0.0009951475],"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.00011472359,0.00011472349,0.002924375,0.000235192,0.000106538784,0.00020336475,0.0004545902,0.7088492,0.004287147,0.10071823,0.002063499,0.17992842],"study_design_scores_gemma":[0.00000644944,0.000019739671,0.00009796475,0.000013315666,0.000012988677,0.00002401096,0.00002000961,0.9340566,0.0011545278,0.06348928,0.0010977477,0.0000073610677],"about_ca_topic_score_codex":0.006669175,"about_ca_topic_score_gemma":0.009033515,"teacher_disagreement_score":0.006669175,"about_ca_system_score_codex":0.0020117555,"about_ca_system_score_gemma":0.0017618092,"threshold_uncertainty_score":0.015333891},"labels":[],"label_agreement":null},{"id":"W2232107379","doi":"","title":"ON THE COMBINATORICS OF SAMPLE COMPRESSION SCHEMES","year":2013,"lang":"en","type":"dissertation","venue":"oURspace (University of Regina)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Regina","keywords":"VC dimension; Dimension (graph theory); Compression (physics); Mathematics; Concept class; Sample (material); Conjecture; Combinatorics; Class (philosophy); Function (biology); Data compression; Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Physics","score_opus":0.009340674256730177,"score_gpt":0.2137404753230247,"score_spread":0.20439980106629452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2232107379","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.22740155,0.005874046,0.44890928,0.0107615525,0.0006827656,0.00035301934,0.0025185153,0.0015709909,0.3019283],"genre_scores_gemma":[0.8395162,0.0042785034,0.10497501,0.0016860683,0.0014255849,0.0004966742,0.0024691967,0.0010349526,0.04411781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927412,0.0024580609,0.0005778945,0.0011708279,0.0022487629,0.0008032653],"domain_scores_gemma":[0.9682246,0.021311576,0.0013303543,0.0066095274,0.0017417979,0.0007820745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042956313,0.0011095343,0.0019805487,0.003963317,0.0029514283,0.009534633,0.002832542,0.0021403518,0.017502364],"category_scores_gemma":[0.023529636,0.0012169257,0.0017947928,0.005783651,0.0068000755,0.018744746,0.007351347,0.0056321607,0.0029204616],"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.00009384994,0.00003884498,0.00042819208,0.00005951861,0.000012520976,0.00006602249,0.00019355408,0.0018176595,0.00037492017,0.9820208,0.0025429055,0.012351251],"study_design_scores_gemma":[0.000026059988,0.000016403226,0.00022656526,0.000041756444,0.000014962965,0.00012020678,0.00006136693,0.0047462634,0.00048835017,0.98918474,0.00505622,0.00001716275],"about_ca_topic_score_codex":0.0012390133,"about_ca_topic_score_gemma":0.0011904553,"teacher_disagreement_score":0.017502364,"about_ca_system_score_codex":0.0042543444,"about_ca_system_score_gemma":0.0017335865,"threshold_uncertainty_score":0.058551252},"labels":[],"label_agreement":null},{"id":"W2256407299","doi":"10.1007/978-3-642-37453-1_35","title":"Decisive Supervised Learning","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.012242736938922033,"score_gpt":0.23956161183013688,"score_spread":0.22731887489121486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256407299","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.007317404,0.0066567133,0.7665142,0.004963306,0.0017125275,0.000096854135,0.0006210614,0.0016436359,0.21047424],"genre_scores_gemma":[0.391064,0.005986491,0.30958837,0.004040192,0.004535597,0.0005273752,0.0028428375,0.0027010946,0.27871403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982791,0.00052072445,0.00007057792,0.00043814367,0.000590869,0.00010058744],"domain_scores_gemma":[0.9971156,0.0015802572,0.00009898258,0.0007822251,0.0002997939,0.0001230942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017223228,0.0011219723,0.0010838355,0.001220393,0.0009929494,0.0020579668,0.0014548635,0.0013656607,0.02274707],"category_scores_gemma":[0.0075191446,0.00072158925,0.000938192,0.0009239044,0.003094232,0.0035103054,0.0035035652,0.004950113,0.007450435],"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.00006062783,0.000027358235,0.00023588448,0.00018075028,0.000037527643,0.000043657466,0.000085866326,0.0035619938,0.0010257192,0.8272741,0.035159487,0.13230707],"study_design_scores_gemma":[0.000010374868,0.0000137632505,0.0001287323,0.000035388657,0.0000097090215,0.000058035428,0.000010814031,0.016090082,0.00090138,0.9496165,0.03311478,0.000010432951],"about_ca_topic_score_codex":0.00029855417,"about_ca_topic_score_gemma":0.0004918813,"teacher_disagreement_score":0.02274707,"about_ca_system_score_codex":0.0010522186,"about_ca_system_score_gemma":0.0008861329,"threshold_uncertainty_score":0.076096535},"labels":[],"label_agreement":null},{"id":"W2258798086","doi":"10.1088/1361-6420/ab7d2c","title":"Non-unique games over compact groups and orientation estimation in cryo-EM","year":2020,"lang":"en","type":"preprint","venue":"Inverse Problems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; National Institute of General Medical Sciences; York University; Princeton University; Gordon and Betty Moore Foundation; Simons Foundation; Alfred P. Sloan Foundation; Division of Mathematical Sciences; National Science Foundation","keywords":"Unit sphere; Mathematics; Estimator; Combinatorics; Generalization; Group (periodic table); Orientation (vector space); Mathematical analysis; Physics; Geometry; Statistics","score_opus":0.0183686970991048,"score_gpt":0.2736124710700747,"score_spread":0.25524377397096987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258798086","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.25446934,0.0006591942,0.70759785,0.0020905272,0.0002409183,0.000152525,0.0005302791,0.0009067189,0.03335269],"genre_scores_gemma":[0.87640715,0.00044143866,0.10758272,0.0005585714,0.00012724265,0.00030647338,0.00079497235,0.0005733214,0.013208084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991027,0.0003402994,0.00003751082,0.00019525654,0.00015889846,0.00016532677],"domain_scores_gemma":[0.9972042,0.0013142523,0.00031223684,0.0005345371,0.00016893173,0.00046578955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015612511,0.0009121352,0.001096984,0.000897649,0.0011895439,0.0019675489,0.0022160849,0.0018832602,0.008205102],"category_scores_gemma":[0.0076911547,0.00080807816,0.00079939544,0.0004237262,0.0031975098,0.0042690206,0.0039573596,0.0023999666,0.0015962062],"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.00016220794,0.00006536902,0.0010385272,0.00018540917,0.000036197867,0.00019481088,0.00032456763,0.085825555,0.002959818,0.8885085,0.0060866163,0.014612471],"study_design_scores_gemma":[0.00003267296,0.000032206004,0.00033436692,0.00003934449,0.00000586213,0.000057541907,0.00012238164,0.21235058,0.001230262,0.783295,0.0024697336,0.000030115934],"about_ca_topic_score_codex":0.0020054365,"about_ca_topic_score_gemma":0.0020210498,"teacher_disagreement_score":0.008205102,"about_ca_system_score_codex":0.001316352,"about_ca_system_score_gemma":0.0007438404,"threshold_uncertainty_score":0.027448833},"labels":[],"label_agreement":null},{"id":"W2260846929","doi":"","title":"Representation search through generate and test","year":2013,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":21,"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":"Computer science; Representation (politics); Artificial intelligence; Machine learning; Feature learning; Simple (philosophy); Fraction (chemistry); Element (criminal law); Artificial neural network; Theoretical computer science","score_opus":0.02203806101655674,"score_gpt":0.2865346447852325,"score_spread":0.26449658376867574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2260846929","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.09736163,0.00070565275,0.88531625,0.0014213976,0.00011254044,0.00046440694,0.00035299888,0.004488708,0.009776406],"genre_scores_gemma":[0.59467024,0.00020671854,0.396639,0.00057006313,0.00007984475,0.0006060009,0.0010734951,0.00060630153,0.005548338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955381,0.001907674,0.00025555427,0.00075797626,0.0011228998,0.0004177675],"domain_scores_gemma":[0.97797287,0.015751094,0.0010702253,0.0033482024,0.0014829304,0.00037464022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055808118,0.0013925949,0.001754181,0.001700418,0.0007505214,0.0020648066,0.0034077761,0.0026905816,0.0066210795],"category_scores_gemma":[0.038462117,0.00068999844,0.0010532591,0.0013245285,0.0023234366,0.0053657056,0.0030295441,0.0020323966,0.0015396388],"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.0009715469,0.00077387516,0.0066887783,0.00040414,0.00016331077,0.00037237606,0.0004251879,0.22356844,0.0040138415,0.114364184,0.012259191,0.6359951],"study_design_scores_gemma":[0.0001287951,0.00023373526,0.00040912893,0.00004682295,0.000044137654,0.00013071159,0.00009548629,0.9057774,0.005460153,0.08447935,0.0031654993,0.000028867697],"about_ca_topic_score_codex":0.0016598112,"about_ca_topic_score_gemma":0.0022121335,"teacher_disagreement_score":0.0066210795,"about_ca_system_score_codex":0.0015419385,"about_ca_system_score_gemma":0.0021249186,"threshold_uncertainty_score":0.029514492},"labels":[],"label_agreement":null},{"id":"W2265043488","doi":"10.1109/icmla.2015.167","title":"Active Learning for One-Class Classification","year":2015,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Health Canada","keywords":"Class (philosophy); Machine learning; Artificial intelligence; Computer science; One-class classification; Binary classification; Binary number; Classifier (UML); Mathematics; Support vector machine","score_opus":0.07499432127018407,"score_gpt":0.30871084051552644,"score_spread":0.23371651924534237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2265043488","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.0014567225,0.00027243633,0.99684024,0.00024941177,0.000047882986,0.00003349016,0.000017709443,0.00017030006,0.0009118684],"genre_scores_gemma":[0.21541691,0.0009446354,0.7775553,0.0006652323,0.0005719452,0.00052472187,0.00029015474,0.00018909146,0.0038420311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99376386,0.0029006768,0.00030756384,0.0012918842,0.0014943214,0.0002417128],"domain_scores_gemma":[0.9761395,0.017868023,0.0013833459,0.0024626122,0.0017480346,0.00039853112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009433406,0.0013604311,0.0020175492,0.0019613851,0.0011762583,0.0032182217,0.004575677,0.0034951067,0.0037129847],"category_scores_gemma":[0.026143871,0.0008599935,0.0013001745,0.0017495679,0.003475944,0.0048479717,0.0029196467,0.005481299,0.0011298707],"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.00025225774,0.00028464827,0.0017735454,0.0005125944,0.0001733967,0.00015087612,0.0004988796,0.34687573,0.0043408647,0.22231615,0.0070132944,0.4158078],"study_design_scores_gemma":[0.000018944413,0.000042754757,0.00010022425,0.000036380432,0.000013851319,0.000055138084,0.000023327171,0.9008368,0.0017236068,0.09401322,0.0031158251,0.000019935515],"about_ca_topic_score_codex":0.0010682344,"about_ca_topic_score_gemma":0.0011958698,"teacher_disagreement_score":0.009433406,"about_ca_system_score_codex":0.0012609509,"about_ca_system_score_gemma":0.0014818783,"threshold_uncertainty_score":0.049889207},"labels":[],"label_agreement":null},{"id":"W2275119517","doi":"10.1109/wi-iat.2015.237","title":"On Distinguishing between Reliable and Unreliable Sensors Without a Knowledge of the Ground Truth","year":2015,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ground truth; Computer science; Reliability (semiconductor); Process (computing); Quality (philosophy); Sensor fusion; Reading (process); Common ground; Data mining; Simple (philosophy); Artificial intelligence; Class (philosophy); Law","score_opus":0.02711345487387109,"score_gpt":0.2764135824706355,"score_spread":0.24930012759676443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275119517","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.04294553,0.0016805062,0.9469993,0.0028454172,0.00014921023,0.00014371266,0.0001504072,0.00021817538,0.004867745],"genre_scores_gemma":[0.72078,0.0020502866,0.2709767,0.0022464392,0.0007764974,0.00039559088,0.0004627847,0.00019980577,0.0021118158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97731084,0.009229598,0.0014821158,0.005722186,0.004887334,0.00136781],"domain_scores_gemma":[0.8497383,0.11995518,0.012744845,0.008232156,0.0078089996,0.0015205428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028950071,0.0023503029,0.0036823852,0.0039308453,0.0025135477,0.0060617067,0.00477636,0.0070394054,0.0014712057],"category_scores_gemma":[0.12473494,0.0012331606,0.001587439,0.0029799177,0.0121051,0.015349651,0.008562742,0.0041975793,0.0008489834],"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.0016719648,0.00035788945,0.041760832,0.0018577483,0.0008521187,0.0015895083,0.005258906,0.27239537,0.01203463,0.4532506,0.0056105377,0.20335996],"study_design_scores_gemma":[0.00009244771,0.0003703446,0.0058946023,0.0003810324,0.00019889681,0.000859783,0.0012922569,0.43720755,0.007093975,0.5417284,0.004656468,0.00022413673],"about_ca_topic_score_codex":0.002374074,"about_ca_topic_score_gemma":0.0014732708,"teacher_disagreement_score":0.028950071,"about_ca_system_score_codex":0.0018651924,"about_ca_system_score_gemma":0.002331515,"threshold_uncertainty_score":0.15310442},"labels":[],"label_agreement":null},{"id":"W2280386704","doi":"10.2139/ssrn.2683607","title":"Foundations of Non-Bayesian Social Learning","year":2015,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Bayesian probability; Psychology; Artificial intelligence; Econometrics; Cognitive psychology; Computer science; Mathematics","score_opus":0.01108845215516076,"score_gpt":0.27758958071275014,"score_spread":0.2665011285575894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280386704","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.020551777,0.0018340682,0.9380742,0.0071157697,0.00015414391,0.000069507936,0.0004345759,0.00017869298,0.031587325],"genre_scores_gemma":[0.81276166,0.0050273226,0.15547867,0.0017318123,0.001794478,0.00046045243,0.0007391507,0.000120835764,0.021885743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605113,0.001991869,0.00016010233,0.00068294717,0.00086509157,0.00024890315],"domain_scores_gemma":[0.96451557,0.029212406,0.0017353506,0.0020495902,0.0017189975,0.0007679765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051718145,0.0008898561,0.0017248719,0.0018881974,0.0019878943,0.004571609,0.0028819386,0.002998192,0.008777607],"category_scores_gemma":[0.028359674,0.0007884901,0.0010979322,0.00206987,0.004642355,0.0074835587,0.0031406523,0.003765836,0.0012828894],"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.0000071743766,0.000014665767,0.00024494983,0.00003560828,0.000016216829,0.0000207032,0.00006969209,0.0048139947,0.000045208435,0.98824686,0.00077559863,0.005709342],"study_design_scores_gemma":[0.0000042807137,0.0000031504217,0.00006719339,0.000007833352,0.0000030183853,0.000012589686,0.00001082227,0.021577047,0.000012862051,0.9774466,0.00085077615,0.0000038551543],"about_ca_topic_score_codex":0.0032461889,"about_ca_topic_score_gemma":0.0028901706,"teacher_disagreement_score":0.008777607,"about_ca_system_score_codex":0.002429618,"about_ca_system_score_gemma":0.0018018942,"threshold_uncertainty_score":0.02936405},"labels":[],"label_agreement":null},{"id":"W2309123164","doi":"10.1007/s10044-016-0535-1","title":"The design of absorbing Bayesian pursuit algorithms and the formal analyses of their ε-optimality","year":2016,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematical proof; Bayesian probability; Conjugate prior; Algorithm; Convergence (economics); Prior probability; Computer science; Discretization; Mathematics; Artificial intelligence","score_opus":0.024461076743623637,"score_gpt":0.29278379505628027,"score_spread":0.26832271831265664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2309123164","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.002254978,0.00019638089,0.99501085,0.00029108286,0.0000190754,0.000023557448,0.000020242414,0.0000450286,0.002138735],"genre_scores_gemma":[0.23517708,0.0020127308,0.7552883,0.0006658701,0.00028410187,0.00060964626,0.00017952305,0.00025213297,0.005530617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99391645,0.0033507538,0.0003490645,0.0005922085,0.0014395644,0.00035196383],"domain_scores_gemma":[0.9673843,0.02717346,0.0016328655,0.0012954706,0.002028753,0.0004852783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011071069,0.0015268523,0.0014775279,0.0018301542,0.0010798373,0.0037971782,0.0028876956,0.003813615,0.0041057765],"category_scores_gemma":[0.054377932,0.0016992164,0.0011828425,0.0018277107,0.004568564,0.005199525,0.0042540818,0.003967984,0.0013625869],"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.00007207196,0.00005252977,0.000323527,0.00013913514,0.00003146781,0.00003490711,0.00010831806,0.064450264,0.001738542,0.8958313,0.0012066389,0.036011286],"study_design_scores_gemma":[0.00003723674,0.000072258656,0.000103539016,0.00006744484,0.000016992886,0.00007280483,0.000024711631,0.35702997,0.0013908842,0.6390875,0.0020691252,0.000027552891],"about_ca_topic_score_codex":0.00067187625,"about_ca_topic_score_gemma":0.0007412395,"teacher_disagreement_score":0.011071069,"about_ca_system_score_codex":0.001991626,"about_ca_system_score_gemma":0.0028108158,"threshold_uncertainty_score":0.05855012},"labels":[],"label_agreement":null},{"id":"W2324430758","doi":"","title":"An approach for generating state machine designs from scenarios","year":2007,"lang":"en","type":"article","venue":"International Conference on Software Engineering","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"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 Calgary","funders":"","keywords":"Computer science; Merge (version control); Dependability; Theoretical computer science; Domain (mathematical analysis); Causality (physics); State (computer science); Domain theory; Row and column spaces; Artificial intelligence; Algorithm; Row; Mathematics; Programming language; Discrete mathematics; Software engineering","score_opus":0.03503041463935549,"score_gpt":0.28760421287247523,"score_spread":0.25257379823311976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2324430758","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.0012069385,0.000021299209,0.99659085,0.00007002468,0.000015078589,0.000167809,0.000095619886,0.00090579066,0.000926523],"genre_scores_gemma":[0.026357988,0.000057861907,0.97147626,0.00005055423,0.000010913284,0.0005795273,0.00042673224,0.00016728198,0.000872818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962515,0.0015276568,0.00027487346,0.00050133397,0.0012732816,0.00017140404],"domain_scores_gemma":[0.9944931,0.0031308455,0.00031255843,0.0011271451,0.00082574977,0.00011074021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038840687,0.0014159097,0.0005956562,0.0019367831,0.0008364625,0.0021192178,0.002042758,0.0017219982,0.0066287112],"category_scores_gemma":[0.01170761,0.0011703756,0.0028520366,0.0009775134,0.0017852318,0.0027353496,0.0024688072,0.0022659448,0.0016705627],"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.00024788515,0.00022446364,0.0017413766,0.00074724667,0.00016543234,0.00072006485,0.0013595303,0.23157015,0.014528538,0.45527998,0.0064089354,0.2870065],"study_design_scores_gemma":[0.000100016296,0.00017380153,0.0002075669,0.0001712023,0.00007406371,0.0003433922,0.00017528096,0.58323926,0.017480964,0.35737583,0.04058746,0.000071138464],"about_ca_topic_score_codex":0.0013765877,"about_ca_topic_score_gemma":0.002153164,"teacher_disagreement_score":0.0066287112,"about_ca_system_score_codex":0.0011399378,"about_ca_system_score_gemma":0.0021705136,"threshold_uncertainty_score":0.022175312},"labels":[],"label_agreement":null},{"id":"W2339224764","doi":"10.1145/1113439.1113452","title":"Algebraic generalization","year":2005,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Generalization; Unification; Algebraic number; Algebraic expression; Computer science; Algebra over a field; Expression (computer science); Mathematics; Pure mathematics; Programming language","score_opus":0.00891189697514321,"score_gpt":0.23719972651458326,"score_spread":0.22828782953944005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339224764","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.038831286,0.0022955951,0.6769702,0.0043082614,0.0006888917,0.00021399002,0.0006700209,0.00067790627,0.27534387],"genre_scores_gemma":[0.66180074,0.003852985,0.274789,0.0028743045,0.0015802623,0.00047602385,0.0012386044,0.0004946368,0.052893322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963683,0.0007684719,0.0003073039,0.0011020001,0.0010709515,0.0003829671],"domain_scores_gemma":[0.99670815,0.00086651376,0.0004388988,0.0010479568,0.0007233623,0.00021507365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027394746,0.00078254787,0.0007598595,0.002020252,0.0035168666,0.0035055869,0.0019431731,0.0010890373,0.013397993],"category_scores_gemma":[0.0056162244,0.00052270986,0.0023426577,0.0021467512,0.007829698,0.012100374,0.0073809475,0.0041312934,0.0026841776],"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.00000578311,0.0000066576135,0.00009686055,0.000028958075,0.000005286936,0.00006183086,0.00018754072,0.00057257974,0.00018860125,0.9932128,0.0009396776,0.0046934527],"study_design_scores_gemma":[0.000006537927,0.000016333592,0.00007457634,0.000021009902,0.000012323482,0.00019489473,0.000102018486,0.002821024,0.00038073346,0.9549757,0.041382052,0.000012728186],"about_ca_topic_score_codex":0.0019954257,"about_ca_topic_score_gemma":0.0015005863,"teacher_disagreement_score":0.013397993,"about_ca_system_score_codex":0.0026093458,"about_ca_system_score_gemma":0.0012326216,"threshold_uncertainty_score":0.044820726},"labels":[],"label_agreement":null},{"id":"W2342302999","doi":"","title":"Policy Optimization by Marginal-MAP Probabilistic Inference in Generative Models (Extended Abstract)","year":2014,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Partially observable Markov decision process; Computer science; Inference; Generative model; Probabilistic logic; Bounded function; Mathematical optimization; Representation (politics); Machine learning; Generative grammar; Bayesian inference; Artificial intelligence; Task (project management); Bayesian probability; Mathematics; Markov model; Markov chain","score_opus":0.011691526306042522,"score_gpt":0.26553986125129797,"score_spread":0.25384833494525544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342302999","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.0028484548,0.000074548465,0.9956642,0.00016196848,0.000015293412,0.00001324705,0.000044062774,0.00015934643,0.0010189106],"genre_scores_gemma":[0.5289293,0.00037284248,0.4648211,0.00032892064,0.00011046889,0.00032313666,0.0003199892,0.00032349714,0.0044706804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912137,0.0003180395,0.00003391463,0.00018975745,0.00023341787,0.000103402876],"domain_scores_gemma":[0.9977829,0.0016288946,0.00013347287,0.000207608,0.00014922145,0.00009788767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018722053,0.0008914495,0.0013900297,0.00060605636,0.0005096396,0.0013763654,0.0020205441,0.0011547232,0.00468236],"category_scores_gemma":[0.0072539886,0.00080175046,0.0013129307,0.0012141127,0.0018641549,0.0019324163,0.0030172535,0.002605976,0.00062967336],"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.00003587568,0.000023403332,0.00023297367,0.000049995673,0.000028583556,0.0000315728,0.00004765491,0.9266604,0.00038806643,0.05824612,0.000978977,0.01327634],"study_design_scores_gemma":[0.0000040049185,0.0000048338493,0.00002134923,0.000003955377,0.0000038198436,0.0000051114084,0.000004020536,0.97251356,0.00017331354,0.027001783,0.00026124928,0.0000030088079],"about_ca_topic_score_codex":0.008781197,"about_ca_topic_score_gemma":0.0076510496,"teacher_disagreement_score":0.008781197,"about_ca_system_score_codex":0.0016261782,"about_ca_system_score_gemma":0.0018747894,"threshold_uncertainty_score":0.017460167},"labels":[],"label_agreement":null},{"id":"W2394592999","doi":"10.1007/978-0-387-39940-9_3538","title":"SDI, Selective Dissemination of Information","year":2009,"lang":"en","type":"article","venue":"Encyclopedia of Database Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Business; Computer science","score_opus":0.003993681444553669,"score_gpt":0.24439380473874234,"score_spread":0.24040012329418867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394592999","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018972708,0.003133231,0.8708698,0.0033746858,0.002297532,0.0009860575,0.007690904,0.029743083,0.062932014],"genre_scores_gemma":[0.47684312,0.005632641,0.38510343,0.0015130155,0.0016605643,0.0013938334,0.01883587,0.0026390972,0.10637838],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974368,0.00049186277,0.00025196178,0.00039172577,0.0011779297,0.0002496758],"domain_scores_gemma":[0.9890177,0.0028334057,0.0006950039,0.005247285,0.0016706106,0.0005359213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030080543,0.00074047706,0.00111622,0.0030130236,0.0011283993,0.0031729466,0.0016942096,0.0007859812,0.014262673],"category_scores_gemma":[0.015346126,0.00044535042,0.0005887401,0.004032767,0.0012235577,0.0035174855,0.0030217278,0.0014450132,0.0081215855],"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.0006927474,0.0002737551,0.0026123107,0.00086318824,0.000114780414,0.00022864656,0.00025266205,0.0074888146,0.014561981,0.19791123,0.20933875,0.5656611],"study_design_scores_gemma":[0.0004041407,0.00040588542,0.0025420706,0.00018719213,0.00025484434,0.0011363878,0.00028897056,0.19727434,0.04546077,0.31267983,0.43925017,0.000115388866],"about_ca_topic_score_codex":0.0015459255,"about_ca_topic_score_gemma":0.0016898311,"teacher_disagreement_score":0.014262673,"about_ca_system_score_codex":0.00083397375,"about_ca_system_score_gemma":0.00334146,"threshold_uncertainty_score":0.0477134},"labels":[],"label_agreement":null},{"id":"W2395867717","doi":"","title":"Degree-type Conditions for Bipartite Matching Extendability.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Degree (music); Type (biology); Matching (statistics); Combinatorics; Statistics; Physics","score_opus":0.02056211590943097,"score_gpt":0.29426329146339497,"score_spread":0.273701175553964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395867717","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.23642154,0.0012980775,0.47249392,0.0053231376,0.00068570295,0.00032144718,0.004587733,0.00091862265,0.2779499],"genre_scores_gemma":[0.93784016,0.00095135556,0.035489324,0.0009501595,0.0007841796,0.00028834492,0.0027065666,0.00021962877,0.020770296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739,0.0007380298,0.00023950997,0.0005560379,0.00066328334,0.00041320396],"domain_scores_gemma":[0.9831234,0.010584041,0.0011952954,0.002141936,0.0015141973,0.0014410797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029722857,0.00057088543,0.000877758,0.0021702617,0.0015572973,0.0032286886,0.0016086425,0.0018805213,0.023548178],"category_scores_gemma":[0.024272345,0.0005444055,0.0011549966,0.0024634686,0.002873894,0.010419607,0.003343228,0.0036467805,0.0024926686],"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.000110245746,0.00004995436,0.0011306199,0.000097056334,0.000018298555,0.00018820586,0.00015541584,0.0020351098,0.0010254189,0.9815314,0.0043106624,0.009347669],"study_design_scores_gemma":[0.000028797107,0.000020221994,0.00057790335,0.000030290406,0.000013983234,0.00031767864,0.00009306659,0.0065111765,0.00075004605,0.98780966,0.0038294157,0.000017616685],"about_ca_topic_score_codex":0.0007537654,"about_ca_topic_score_gemma":0.0010628266,"teacher_disagreement_score":0.023548178,"about_ca_system_score_codex":0.0010152725,"about_ca_system_score_gemma":0.00081801583,"threshold_uncertainty_score":0.07877654},"labels":[],"label_agreement":null},{"id":"W2397134496","doi":"10.1609/socs.v3i1.18266","title":"Alternative Forms of Bounded Suboptimal Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Bounded function; Construct (python library); Mathematical optimization; Iterative deepening depth-first search; Mathematics; Computer science; Search algorithm; Constant (computer programming); Beam search; Algorithm; Theoretical computer science; Best-first search; Artificial intelligence","score_opus":0.014294365401943414,"score_gpt":0.2740143347736901,"score_spread":0.2597199693717467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397134496","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.010813724,0.000341919,0.97450364,0.00036975794,0.00003979695,0.00006382824,0.000050560913,0.00042793018,0.013388911],"genre_scores_gemma":[0.4186012,0.0005101305,0.5729287,0.0007177909,0.00007241806,0.00043619357,0.00022935227,0.00030053058,0.0062036505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99303126,0.002736832,0.00055066263,0.00094856054,0.0020610783,0.0006714999],"domain_scores_gemma":[0.98360276,0.00886191,0.0009936322,0.0042847674,0.0017028104,0.00055418076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007217868,0.0012213768,0.0013891178,0.0014914761,0.0011066451,0.0037626352,0.003307323,0.0023855395,0.0060089873],"category_scores_gemma":[0.03912419,0.00070698274,0.0012069931,0.001703766,0.0034369524,0.0055407844,0.0047587194,0.0027037016,0.0013843187],"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.000114306546,0.00004746949,0.00049850944,0.00013705056,0.000038157144,0.00008521324,0.00026133534,0.095217824,0.0017118795,0.86092925,0.001736083,0.039222907],"study_design_scores_gemma":[0.000045826306,0.00009513415,0.00012336731,0.00008090611,0.000025683294,0.00013523018,0.00007440856,0.5855912,0.003357124,0.40423888,0.006204556,0.000027733238],"about_ca_topic_score_codex":0.0013122814,"about_ca_topic_score_gemma":0.002084806,"teacher_disagreement_score":0.007217868,"about_ca_system_score_codex":0.0019886976,"about_ca_system_score_gemma":0.00275998,"threshold_uncertainty_score":0.038172185},"labels":[],"label_agreement":null},{"id":"W2398850217","doi":"","title":"Off-policy learning based on weighted importance sampling with linear computational complexity","year":2015,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":15,"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":"Component (thermodynamics); Computational complexity theory; Computer science; Sampling (signal processing); Measure (data warehouse); Stochastic gradient descent; Importance sampling; Algorithm; Function (biology); Mathematical optimization; Artificial intelligence; Mathematics; Machine learning; Data mining; Artificial neural network; Statistics; Monte Carlo method","score_opus":0.09631687283916708,"score_gpt":0.3443424134911935,"score_spread":0.24802554065202642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398850217","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.010537651,0.00009537349,0.98779905,0.0001002615,0.000024693816,0.000088512956,0.000015493724,0.0004069948,0.00093191897],"genre_scores_gemma":[0.5699551,0.00020787376,0.4259922,0.00031979888,0.00008961504,0.00045550484,0.00020851965,0.00021444375,0.0025569326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762136,0.0010542814,0.00012422727,0.00033424012,0.00065591244,0.00020999857],"domain_scores_gemma":[0.98829556,0.008901855,0.00050059997,0.0010809174,0.00090741477,0.00031367553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004682454,0.00129556,0.0021088456,0.0010919695,0.00072437106,0.0015054338,0.0027834782,0.0014584902,0.0028171341],"category_scores_gemma":[0.020491125,0.0007692131,0.00081005803,0.0010627968,0.0016852411,0.0026807918,0.0024351382,0.0029846474,0.00051095],"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.0002859172,0.00025793456,0.0016302589,0.00012260534,0.00007240824,0.00009131889,0.00011339054,0.7394483,0.001688914,0.05577455,0.0013603368,0.19915393],"study_design_scores_gemma":[0.000011734879,0.00002410743,0.00003851313,0.000004607623,0.0000037607253,0.000010018649,0.000004015702,0.9899906,0.00040756667,0.009362892,0.00013916702,0.0000030174822],"about_ca_topic_score_codex":0.0044432236,"about_ca_topic_score_gemma":0.004288202,"teacher_disagreement_score":0.004682454,"about_ca_system_score_codex":0.001732054,"about_ca_system_score_gemma":0.0025945578,"threshold_uncertainty_score":0.024763465},"labels":[],"label_agreement":null},{"id":"W2402719117","doi":"10.1609/socs.v3i1.18258","title":"Learning Heuristic Functions Faster by Using Predicted Solution Costs","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures; University of Regina","keywords":"Heuristics; Heuristic; Speedup; Computer science; Process (computing); Set (abstract data type); Hyper-heuristic; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.011698521861673328,"score_gpt":0.2546399854608649,"score_spread":0.24294146359919158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402719117","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.23726463,0.0005369606,0.74500036,0.00056299206,0.00011321383,0.0002346042,0.00031673544,0.008686365,0.007284197],"genre_scores_gemma":[0.69685745,0.00020618351,0.29895708,0.00021877592,0.00004902559,0.00028420647,0.00093050074,0.00047273745,0.002024052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990742,0.00025442246,0.00006528212,0.00022958757,0.0002673824,0.00010906912],"domain_scores_gemma":[0.993828,0.0038479785,0.00046412868,0.00092933356,0.00080377626,0.00012675987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021000819,0.0010150679,0.0012347625,0.0012443163,0.0003560051,0.0015250383,0.0013026015,0.0011501361,0.003367414],"category_scores_gemma":[0.012857077,0.00073879666,0.00068892183,0.0008989585,0.000499918,0.0029191594,0.00087760837,0.0019953279,0.0010837106],"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.0003020942,0.00037270834,0.0049270564,0.00012104592,0.000060456365,0.000039319377,0.00007446237,0.7558352,0.0038392541,0.004601592,0.0026065344,0.22722039],"study_design_scores_gemma":[0.000020748861,0.000031873726,0.00021763715,0.000005643662,0.0000059511767,0.0000060866255,0.000005558439,0.9965982,0.0011607476,0.0015630636,0.00037972163,0.000004860058],"about_ca_topic_score_codex":0.005024987,"about_ca_topic_score_gemma":0.00562014,"teacher_disagreement_score":0.005024987,"about_ca_system_score_codex":0.0012726894,"about_ca_system_score_gemma":0.0018218706,"threshold_uncertainty_score":0.011265159},"labels":[],"label_agreement":null},{"id":"W2406623448","doi":"10.5555/2615731.2616087","title":"Policy optimization by marginal-map probabilistic inference in generative models","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"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":"Partially observable Markov decision process; Inference; Computer science; Mathematical optimization; Generative model; Bounded function; Benchmark (surveying); Probabilistic logic; Machine learning; Artificial intelligence; Algorithm; Mathematics; Generative grammar; Markov model; Markov chain","score_opus":0.03596804359116691,"score_gpt":0.2878306369712302,"score_spread":0.2518625933800633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406623448","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.0045503653,0.000087848544,0.9943606,0.00011041996,0.000009717322,0.000016988657,0.000030991374,0.0001736226,0.0006594795],"genre_scores_gemma":[0.6322411,0.00031498115,0.36442208,0.00019413626,0.000060457343,0.00023150595,0.00023574277,0.00021979687,0.0020801944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990145,0.00039433144,0.000039898594,0.00020657854,0.00023464671,0.00011004438],"domain_scores_gemma":[0.9966587,0.0026943432,0.00018807997,0.00019398567,0.00017139579,0.000093478935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023076038,0.0010272239,0.0015497399,0.00072295003,0.0005871528,0.0014445026,0.0021311804,0.0014888452,0.002456649],"category_scores_gemma":[0.008791993,0.0009983853,0.0012655533,0.00086736423,0.002164701,0.001734786,0.0022484697,0.0025546544,0.00030079353],"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.000022327506,0.000012979899,0.00019363698,0.00003077038,0.000016912325,0.000020062062,0.0000339364,0.9727623,0.0002128758,0.019485295,0.0002251341,0.006983835],"study_design_scores_gemma":[0.0000036452955,0.000003937781,0.000019713047,0.0000025416514,0.000002473116,0.0000036330653,0.0000036185904,0.99024385,0.00011175863,0.009500965,0.000101656995,0.0000023368611],"about_ca_topic_score_codex":0.012252528,"about_ca_topic_score_gemma":0.0107825585,"teacher_disagreement_score":0.012252528,"about_ca_system_score_codex":0.001961825,"about_ca_system_score_gemma":0.002474535,"threshold_uncertainty_score":0.024362445},"labels":[],"label_agreement":null},{"id":"W2407114511","doi":"","title":"The Complexity of Estimating Min-Entropy.","year":2012,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Logarithm; Mathematics; Entropy (arrow of time); Discrete mathematics; Markov chain; Min entropy; Combinatorics; Applied mathematics; Entropy rate; Binary entropy function; Statistics; Principle of maximum entropy; Mathematical analysis; Physics","score_opus":0.03533590909925355,"score_gpt":0.28532919023732634,"score_spread":0.2499932811380728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407114511","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.043824166,0.0067445175,0.91899514,0.012386081,0.00044027995,0.00025458637,0.003043672,0.0011813822,0.013130117],"genre_scores_gemma":[0.7116227,0.004374511,0.26684856,0.0025773363,0.0020223137,0.0007327084,0.0048854914,0.00075547124,0.006180904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9864444,0.0064608925,0.0007208303,0.0022422692,0.003344137,0.0007873936],"domain_scores_gemma":[0.8819993,0.10492297,0.0020182915,0.007846093,0.0023710267,0.00084225746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0106057655,0.0012941713,0.0027347812,0.0018343952,0.0020930874,0.0059156013,0.0040262127,0.0029766976,0.008019505],"category_scores_gemma":[0.08455504,0.0016237283,0.002378041,0.0028512296,0.0054648644,0.019092282,0.006948686,0.007825405,0.0014103592],"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.0013542968,0.0001773941,0.0060034143,0.0011815846,0.00052676856,0.00043736002,0.0007816238,0.15714377,0.0025132126,0.66102064,0.023720099,0.14513996],"study_design_scores_gemma":[0.000052564636,0.00002604283,0.00063465914,0.000051284427,0.000033104454,0.00012907766,0.00006289339,0.1709504,0.00079253374,0.8254105,0.0018222287,0.000034623168],"about_ca_topic_score_codex":0.0042534154,"about_ca_topic_score_gemma":0.004052927,"teacher_disagreement_score":0.0106057655,"about_ca_system_score_codex":0.0047306786,"about_ca_system_score_gemma":0.003188461,"threshold_uncertainty_score":0.05608934},"labels":[],"label_agreement":null},{"id":"W2414396530","doi":"","title":"Survey Propagation beyond Constraint Satisfaction Problems.","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Local consistency; Computer science; Constraint satisfaction problem; Constraint (computer-aided design); Mathematical optimization; Artificial intelligence; Mathematics; Probabilistic logic","score_opus":0.08947312638678116,"score_gpt":0.33039098031030933,"score_spread":0.24091785392352816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2414396530","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.006510377,0.0031464808,0.962955,0.0039921342,0.0004899127,0.00025888885,0.0017431672,0.0008993509,0.02000465],"genre_scores_gemma":[0.27806634,0.0046424526,0.6746991,0.0030347388,0.0013379715,0.0009990837,0.0074083065,0.0012321105,0.028579863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99452895,0.003220089,0.00022357721,0.0006832011,0.0010083341,0.00033578713],"domain_scores_gemma":[0.9632564,0.02862293,0.0012042776,0.0031768577,0.0030463096,0.00069322047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006259127,0.001258251,0.0016933816,0.0028958514,0.001737113,0.0029654824,0.0033662461,0.002179374,0.017933924],"category_scores_gemma":[0.049038734,0.001059151,0.0015910767,0.0054572583,0.0017531342,0.0077173137,0.003815652,0.004027693,0.0027927388],"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.00023782422,0.00017993298,0.0020946222,0.0009867882,0.00032979017,0.0001924027,0.00028127228,0.074087694,0.00057966425,0.56002164,0.103642486,0.25736597],"study_design_scores_gemma":[0.00005130061,0.00004239125,0.00039550257,0.00017458608,0.00007033769,0.000093613664,0.00010434618,0.31972075,0.00075844873,0.6441889,0.034375086,0.000024656189],"about_ca_topic_score_codex":0.00938533,"about_ca_topic_score_gemma":0.015438303,"teacher_disagreement_score":0.017933924,"about_ca_system_score_codex":0.0020410274,"about_ca_system_score_gemma":0.003003272,"threshold_uncertainty_score":0.059994996},"labels":[],"label_agreement":null},{"id":"W2421136984","doi":"","title":"A Bayesian Method for Learning POMDP Observation Parameters for Robot Interaction Management Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":15,"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":"Robot learning; Computer science; Robot; Artificial intelligence; Oracle; Action selection; Set (abstract data type); Domain (mathematical analysis); Function (biology); Machine learning; Human–computer interaction; Partially observable Markov decision process; Social robot; Action (physics); Robot control; Mobile robot; Mathematics; Markov model; Markov chain","score_opus":0.02611401786596767,"score_gpt":0.31922552848744334,"score_spread":0.29311151062147567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2421136984","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.0012219859,0.000076762,0.99805105,0.000054116263,0.000010463668,0.000025948755,0.000029958775,0.00021424596,0.0003154902],"genre_scores_gemma":[0.25289583,0.00037801484,0.74252415,0.00016279983,0.00010024642,0.00071652187,0.0004452568,0.00026742785,0.002509763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878794,0.0004594003,0.00006949838,0.00020908123,0.00037393457,0.000100049416],"domain_scores_gemma":[0.9968231,0.002329949,0.00023994775,0.00015060522,0.00034528135,0.0001111168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032271023,0.0012370534,0.0019591108,0.0011683255,0.00089050416,0.0012264192,0.002945045,0.0016793613,0.0044424497],"category_scores_gemma":[0.010938205,0.001329213,0.0010577005,0.0011942527,0.0011991679,0.002189769,0.0017915359,0.0032093879,0.0008966424],"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.00012675763,0.00007295848,0.00052529405,0.00010450282,0.000054789278,0.000043105527,0.00006331474,0.9003486,0.0005515397,0.021297025,0.0010534414,0.0757588],"study_design_scores_gemma":[0.000015455655,0.000012834871,0.000044955686,0.000009303106,0.000005236297,0.0000067663727,0.0000043145665,0.9907968,0.00012702803,0.008593836,0.00037570746,0.000007687828],"about_ca_topic_score_codex":0.011773365,"about_ca_topic_score_gemma":0.013463835,"teacher_disagreement_score":0.011773365,"about_ca_system_score_codex":0.001872673,"about_ca_system_score_gemma":0.0030291178,"threshold_uncertainty_score":0.023409724},"labels":[],"label_agreement":null},{"id":"W2424687972","doi":"10.1007/s41060-016-0012-3","title":"Exact and approximate Boolean matrix decomposition with column-use condition","year":2016,"lang":"en","type":"article","venue":"International Journal of Data Science and Analytics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Univerzita Palackého v Olomouci","keywords":"Logical matrix; Matrix (chemical analysis); Complete Boolean algebra; Boolean function; Mathematics; Combinatorics; Discrete mathematics; Column (typography); Heuristic; Ideal (ethics); Maximum satisfiability problem; Heuristics; Boolean circuit; Algorithm; Two-element Boolean algebra; Algebra over a field; Pure mathematics; Mathematical optimization; Physics; Quantum mechanics","score_opus":0.021829510330628205,"score_gpt":0.3398350894567677,"score_spread":0.3180055791261395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2424687972","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.014892829,0.00044134047,0.97634876,0.00074389327,0.00020387195,0.000075782555,0.00060131017,0.0007364923,0.0059558186],"genre_scores_gemma":[0.43364307,0.0007506523,0.55182165,0.00066295016,0.0005763057,0.00034366513,0.0023566603,0.00046030167,0.009384796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964826,0.00094461243,0.00016086099,0.000504926,0.0015049493,0.00040208825],"domain_scores_gemma":[0.98875207,0.006687867,0.00046958544,0.0021975448,0.0015759428,0.00031706755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002538986,0.0015972232,0.0016986601,0.0012611048,0.00073380326,0.002625351,0.0021576139,0.0018588506,0.015796166],"category_scores_gemma":[0.023180513,0.0005783684,0.00095627026,0.0025172,0.0016834361,0.0061114547,0.0022695204,0.003063312,0.0026637109],"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.0012601736,0.0004798182,0.0018480079,0.0007733736,0.0001534656,0.00037206514,0.00019251286,0.25100207,0.008509047,0.40421417,0.043093573,0.2881018],"study_design_scores_gemma":[0.000045380377,0.000048659258,0.00019568467,0.000026554106,0.000018326484,0.00009983946,0.000038383692,0.758113,0.0017657778,0.23813862,0.0014909355,0.000018696766],"about_ca_topic_score_codex":0.002294174,"about_ca_topic_score_gemma":0.0034990446,"teacher_disagreement_score":0.015796166,"about_ca_system_score_codex":0.0010558064,"about_ca_system_score_gemma":0.0022560144,"threshold_uncertainty_score":0.052843392},"labels":[],"label_agreement":null},{"id":"W2460936583","doi":"10.1145/2911451.2914709","title":"Impact of Review-Set Selection on Human Assessment for Text Classification","year":2016,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"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":"Selection (genetic algorithm); Relevance (law); Context (archaeology); Computer science; Sampling (signal processing); Set (abstract data type); Information retrieval; Data mining; Statistics; Machine learning; Artificial intelligence; Mathematics","score_opus":0.059184829903375126,"score_gpt":0.42451419338150836,"score_spread":0.3653293634781332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460936583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89210635,0.018335162,0.05305211,0.005079225,0.0018000498,0.0035779919,0.0009110024,0.0014476426,0.023690447],"genre_scores_gemma":[0.9812367,0.00083258876,0.013819506,0.0010876934,0.0003654494,0.00065760757,0.00035962483,0.00016031641,0.0014805658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.5992012,0.30847588,0.024064722,0.019549444,0.04675849,0.0019501507],"domain_scores_gemma":[0.15291071,0.77559966,0.03446464,0.01735913,0.016960138,0.0027058397],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.2180206,0.001254036,0.001817559,0.0035249642,0.0023764523,0.0040430725,0.0015260471,0.0019769273,0.003509198],"category_scores_gemma":[0.6559159,0.00067405944,0.0022900847,0.002286826,0.002493966,0.0041661435,0.002991984,0.0018943686,0.001450751],"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.034792665,0.001692137,0.35146737,0.0057212086,0.005219914,0.0011057094,0.012673526,0.00424608,0.025518073,0.0016198199,0.014177145,0.54176646],"study_design_scores_gemma":[0.003019329,0.019380115,0.839402,0.0031844429,0.006638006,0.007691348,0.0059689116,0.03846473,0.03442347,0.012372544,0.028230168,0.0012247628],"about_ca_topic_score_codex":0.0025406096,"about_ca_topic_score_gemma":0.0038387221,"teacher_disagreement_score":0.2180206,"about_ca_system_score_codex":0.0021198026,"about_ca_system_score_gemma":0.0028597808,"threshold_uncertainty_score":0.9643198},"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":"W2469206972","doi":"10.1002/cjs.11457","title":"Prior‐based model checking","year":2018,"lang":"en","type":"preprint","venue":"Canadian Journal of Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Process (computing); Model checking; Dirichlet process; Algorithm; Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics; Programming language; Bayesian probability","score_opus":0.029541561411803006,"score_gpt":0.2616255454843285,"score_spread":0.23208398407252548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2469206972","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.008017562,0.00011140597,0.98768127,0.00039936474,0.000040024763,0.00010948074,0.00024637682,0.0017145918,0.001679926],"genre_scores_gemma":[0.48492542,0.00020597699,0.5088783,0.00044613908,0.0001229369,0.0004598465,0.001288668,0.0008231862,0.0028495311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96725553,0.017416518,0.001599029,0.004033982,0.008025569,0.0016693416],"domain_scores_gemma":[0.85607105,0.10780668,0.0049932697,0.020284466,0.009654316,0.0011901979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023777591,0.0019843243,0.0027295076,0.003924745,0.0018036936,0.006267603,0.006093125,0.0025925287,0.010858226],"category_scores_gemma":[0.13392812,0.0014673853,0.004551728,0.0028427772,0.0041279085,0.0074309856,0.0066915867,0.0052525024,0.0018749501],"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.0006380239,0.00022709992,0.0037709584,0.00048251232,0.00043198164,0.00038142066,0.00065529306,0.57719743,0.0030373507,0.26900235,0.0054023666,0.13877325],"study_design_scores_gemma":[0.00003743362,0.000030828112,0.00013847213,0.000057862,0.000036601014,0.000051596213,0.000032531487,0.85004294,0.002742066,0.14574154,0.0010620672,0.000026080297],"about_ca_topic_score_codex":0.007300023,"about_ca_topic_score_gemma":0.008400591,"teacher_disagreement_score":0.023777591,"about_ca_system_score_codex":0.0035617035,"about_ca_system_score_gemma":0.007115356,"threshold_uncertainty_score":0.12574941},"labels":[],"label_agreement":null},{"id":"W2474897245","doi":"10.1145/2911451.2914685","title":"Sampling Strategies and Active Learning for Volume Estimation","year":2016,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Google; National Science Foundation","keywords":"Computer science; Leverage (statistics); Popularity; Sampling (signal processing); Switchover; Volume (thermodynamics); Social media; Recall; Active learning (machine learning); Data science; Machine learning; Information retrieval; Precision and recall; Point (geometry); Data mining; Artificial intelligence; World Wide Web","score_opus":0.018498908334396685,"score_gpt":0.2883151042586092,"score_spread":0.26981619592421247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474897245","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.0051915925,0.0005265993,0.9930466,0.0002267005,0.00003857731,0.000072319555,0.00007686749,0.00034965,0.00047114355],"genre_scores_gemma":[0.3795816,0.0014461979,0.61091024,0.0005635581,0.00092027243,0.00081775046,0.0014732907,0.00038547794,0.0039015072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954489,0.0023749156,0.00028282558,0.0008285981,0.0008711342,0.00019371216],"domain_scores_gemma":[0.9650976,0.028432958,0.0014640605,0.0026025432,0.001971667,0.0004310804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008499995,0.0022155314,0.0024019284,0.0037772649,0.0010144236,0.0029645562,0.0041543473,0.0026690492,0.0015674699],"category_scores_gemma":[0.05204199,0.0012188676,0.0012401254,0.0025737393,0.002297289,0.006249267,0.0022658794,0.0030519336,0.00085480727],"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.00039132874,0.0003489652,0.007239234,0.00036800207,0.00030326835,0.00020771494,0.0005554201,0.57695305,0.0057474417,0.10741916,0.004476989,0.2959893],"study_design_scores_gemma":[0.000027125103,0.000043397453,0.00027177474,0.000023511295,0.00001665192,0.000050616134,0.000021522792,0.9490084,0.0015077422,0.04794266,0.0010681915,0.000018497343],"about_ca_topic_score_codex":0.0034003316,"about_ca_topic_score_gemma":0.0029009779,"teacher_disagreement_score":0.008499995,"about_ca_system_score_codex":0.001527266,"about_ca_system_score_gemma":0.0010658305,"threshold_uncertainty_score":0.04495281},"labels":[],"label_agreement":null},{"id":"W2475351935","doi":"","title":"Learning and Testing Junta Distributions","year":2016,"lang":"en","type":"article","venue":"Conference on Learning Theory","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"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":"Hypercube; Uniform distribution (continuous); Distribution (mathematics); Mathematics; Boolean function; Property testing; Domain (mathematical analysis); Combinatorics; Discrete mathematics; Set (abstract data type); Algorithm; Computer science; Statistics; Mathematical analysis","score_opus":0.02196962589253052,"score_gpt":0.26571864682509755,"score_spread":0.24374902093256703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475351935","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.2088155,0.00029569794,0.78572917,0.0015400071,0.00008081682,0.00015350603,0.00041717797,0.0008121886,0.0021559508],"genre_scores_gemma":[0.8196247,0.0001984499,0.17560977,0.00069835514,0.00029111942,0.00035275894,0.001566447,0.00017896545,0.0014794109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98618907,0.004287927,0.00097210443,0.0049862363,0.002581268,0.0009834544],"domain_scores_gemma":[0.89128447,0.08912706,0.0048532425,0.008752119,0.004022405,0.0019607684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01185183,0.0013000693,0.0024122878,0.0021927883,0.0019989565,0.0029375441,0.0048026023,0.0033041479,0.0024212627],"category_scores_gemma":[0.10878314,0.001151615,0.0021922614,0.0022255979,0.005043691,0.011729795,0.00455224,0.0048542465,0.0006047837],"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.0032716652,0.0010842648,0.048904978,0.0006300967,0.0007066466,0.0010627424,0.0011659992,0.4599885,0.007819266,0.21874651,0.005111931,0.25150737],"study_design_scores_gemma":[0.000094101415,0.00022838823,0.0015496447,0.00003625733,0.000038023238,0.00028022585,0.00016332325,0.7899922,0.0031406563,0.2036086,0.0008284404,0.000040081],"about_ca_topic_score_codex":0.0017104294,"about_ca_topic_score_gemma":0.001390546,"teacher_disagreement_score":0.01185183,"about_ca_system_score_codex":0.0021075897,"about_ca_system_score_gemma":0.0019897087,"threshold_uncertainty_score":0.06267923},"labels":[],"label_agreement":null},{"id":"W2478209449","doi":"10.1007/978-3-319-42085-1_7","title":"Point Placement in an Inexact Model with Applications","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Pairwise comparison; Algorithm; Point (geometry); Upper and lower bounds; Translation (biology); Adversary; Theoretical computer science; Mathematics; Artificial intelligence; Geometry","score_opus":0.012760755648954148,"score_gpt":0.2540348443157559,"score_spread":0.24127408866680175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478209449","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.0049442854,0.0004985235,0.99026895,0.00019647922,0.000092650145,0.000013023659,0.000054560565,0.00016989854,0.0037616075],"genre_scores_gemma":[0.29718325,0.0019157492,0.66671884,0.00018725268,0.00031594082,0.00014477839,0.0004034137,0.00052088127,0.03260986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926966,0.00019698383,0.000041246214,0.00015583418,0.00029677368,0.00003954161],"domain_scores_gemma":[0.9989465,0.00055394403,0.00009730216,0.00018162979,0.00015663769,0.000064096166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008106252,0.0011622887,0.001983283,0.00078460766,0.00070330926,0.0021187882,0.002643245,0.0027189548,0.0053517446],"category_scores_gemma":[0.003894432,0.0010517071,0.0010581188,0.0017859804,0.0015548266,0.002778119,0.0034211786,0.0029533838,0.0013135675],"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.000081163205,0.00003084235,0.00024296594,0.00018581898,0.000022664017,0.00015324196,0.00009047055,0.8210483,0.0010849434,0.122214675,0.0034172663,0.051427644],"study_design_scores_gemma":[0.0000035315024,0.000012236404,0.00002218636,0.000009711766,0.0000037187647,0.000037783768,0.000010199783,0.96285343,0.00023851535,0.035168573,0.0016346329,0.0000054298293],"about_ca_topic_score_codex":0.0030074266,"about_ca_topic_score_gemma":0.0024072232,"teacher_disagreement_score":0.0053517446,"about_ca_system_score_codex":0.00077180384,"about_ca_system_score_gemma":0.0007864603,"threshold_uncertainty_score":0.017903388},"labels":[],"label_agreement":null},{"id":"W2491818457","doi":"10.4018/978-1-60566-310-4.ch022","title":"Ethology-Based Approximate Adaptive Learning","year":2009,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Machine Learning and Algorithms","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 Manitoba","funders":"","keywords":"Ethology; Artificial intelligence; Computer science; Animal learning; Machine learning; Adaptive learning; Adaptive behavior; Psychology; Biology; Ecology; Cognitive psychology","score_opus":0.017449494881952982,"score_gpt":0.2525665531601567,"score_spread":0.2351170582782037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491818457","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.0097508915,0.010332443,0.8498937,0.0036282307,0.0007861599,0.000051123694,0.0000906908,0.0002999387,0.12516688],"genre_scores_gemma":[0.42898816,0.017206414,0.3536258,0.0022180453,0.0011330589,0.00032742796,0.0003422947,0.0002138902,0.19594496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977297,0.00007020601,0.000008867735,0.000045417935,0.000090513975,0.000012170192],"domain_scores_gemma":[0.99972624,0.00014572113,0.000016758753,0.000042869524,0.00005295154,0.000015480979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056777685,0.00037041432,0.00036489154,0.0004053299,0.00028859655,0.0010884948,0.0009401189,0.0008269606,0.0061343433],"category_scores_gemma":[0.0014493405,0.00019998485,0.0003687183,0.0004142774,0.0011723628,0.0014921004,0.0008665811,0.0016240923,0.0017053757],"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.000022647606,0.000028420009,0.00033010528,0.00017618228,0.000030859366,0.000059821643,0.00013787343,0.043580506,0.0020395368,0.8085476,0.009464961,0.13558148],"study_design_scores_gemma":[0.0000114204495,0.000056012002,0.00044893802,0.000086186395,0.00001496797,0.00024173992,0.000048402748,0.21567176,0.0014848188,0.701857,0.08005619,0.000022672135],"about_ca_topic_score_codex":0.0003383073,"about_ca_topic_score_gemma":0.00036507353,"teacher_disagreement_score":0.0061343433,"about_ca_system_score_codex":0.0005852699,"about_ca_system_score_gemma":0.00033861917,"threshold_uncertainty_score":0.020521402},"labels":[],"label_agreement":null},{"id":"W2493818561","doi":"10.1007/978-3-319-25388-6_16","title":"The choice of a nearest neighbor estimate","year":2015,"lang":"en","type":"book-chapter","venue":"Springer series in the data sciences","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Minimax; Mathematics; k-nearest neighbors algorithm; Nonparametric statistics; Class (philosophy); Universality (dynamical systems); Convergence (economics); Nonparametric regression; Property (philosophy); Function (biology); Applied mathematics; Econometrics; Statistics; Computer science; Mathematical economics; Artificial intelligence; Economics; Physics","score_opus":0.09872209417537257,"score_gpt":0.34689705553420336,"score_spread":0.24817496135883077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493818561","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.005120512,0.0014682484,0.98668694,0.00069969136,0.0003071816,0.00002585955,0.000087425105,0.0001472755,0.0054569533],"genre_scores_gemma":[0.1323274,0.0018755858,0.85367525,0.0004310413,0.0005158832,0.00012903269,0.0003967997,0.0003475237,0.010301531],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965432,0.0016175635,0.00019258211,0.00066903874,0.00086721434,0.00011035987],"domain_scores_gemma":[0.99314815,0.0043552667,0.00021798565,0.00082233903,0.0013002877,0.00015593879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00523233,0.0005432376,0.0015571505,0.001836789,0.0010852246,0.0021640274,0.0024867367,0.0031894846,0.004317975],"category_scores_gemma":[0.03462476,0.0007556958,0.0009983492,0.0013908658,0.0014903516,0.0051809615,0.0021595284,0.0026799594,0.0025395935],"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.00030127264,0.000109183035,0.0016270468,0.0006194428,0.00012785698,0.00018308205,0.00022801188,0.05768158,0.0070542297,0.3596068,0.019215627,0.55324584],"study_design_scores_gemma":[0.000043135555,0.00013645503,0.0010357955,0.0003043681,0.00008493478,0.0006722973,0.000181443,0.5766322,0.007269666,0.38984123,0.02368923,0.0001092812],"about_ca_topic_score_codex":0.0016676537,"about_ca_topic_score_gemma":0.0015419312,"teacher_disagreement_score":0.00523233,"about_ca_system_score_codex":0.0006645588,"about_ca_system_score_gemma":0.00071874453,"threshold_uncertainty_score":0.027671576},"labels":[],"label_agreement":null},{"id":"W2514090203","doi":"10.1145/2970276.2970300","title":"Local-based active classification of test report to assist crowdsourced testing","year":2016,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":58,"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":"Computer science; Machine learning; Classifier (UML); Artificial intelligence; Crowdsourcing; Task (project management); Labeled data; Training set; Process (computing); Test data; Test (biology); Supervised learning; Data mining; Engineering; Artificial neural network; Software engineering","score_opus":0.02679950523859292,"score_gpt":0.2768267888599649,"score_spread":0.250027283621372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514090203","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.18883508,0.0016753175,0.7851619,0.0016074831,0.0004562212,0.0005824495,0.0017783376,0.01305559,0.0068475227],"genre_scores_gemma":[0.8835,0.00020460339,0.10952566,0.00051469007,0.00019425851,0.0004118359,0.0019538517,0.00032507195,0.0033700326],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9949096,0.0016118394,0.000330712,0.0014831764,0.0012846794,0.00038008785],"domain_scores_gemma":[0.97406447,0.013849204,0.0032151495,0.0026067174,0.0052053444,0.0010591534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005447642,0.0021349671,0.0021928467,0.0033106916,0.00077116425,0.0018485904,0.004317307,0.0017027421,0.0017345424],"category_scores_gemma":[0.019254757,0.00038821428,0.00087968796,0.002091353,0.00097506377,0.0022807254,0.0023006573,0.0016635512,0.0013402349],"study_design_candidate":"bench_or_experimental","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.0018593248,0.0013908624,0.051745266,0.00073472556,0.00025265748,0.0010025853,0.0020203125,0.13754416,0.023735227,0.0028359443,0.02629254,0.75058645],"study_design_scores_gemma":[0.000057591955,0.00021135728,0.0050433483,0.000059428676,0.00006294069,0.00017769914,0.0004815486,0.97139055,0.012569695,0.00523259,0.0046678525,0.000045379293],"about_ca_topic_score_codex":0.004095014,"about_ca_topic_score_gemma":0.0057984157,"teacher_disagreement_score":0.005447642,"about_ca_system_score_codex":0.0011108113,"about_ca_system_score_gemma":0.0010920771,"threshold_uncertainty_score":0.028810203},"labels":[],"label_agreement":null},{"id":"W2520735695","doi":"","title":"Trans-dimensional MCMC for Bayesian policy learning","year":2007,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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 British Columbia","funders":"","keywords":"Markov chain Monte Carlo; Computer science; Reversible-jump Markov chain Monte Carlo; Inference; Bayesian inference; Markov chain; Bayesian probability; Importance sampling; Maximization; Artificial intelligence; Machine learning; Mathematical optimization; Algorithm; Monte Carlo method; Mathematics","score_opus":0.009121866273455296,"score_gpt":0.282070792895639,"score_spread":0.27294892662218373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520735695","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.00083400885,0.0005542403,0.99636865,0.00032818553,0.00005947534,0.000031965337,0.00008927838,0.0002730384,0.001461114],"genre_scores_gemma":[0.17720687,0.002035966,0.8117614,0.0006356466,0.00037079144,0.0009946784,0.0007097401,0.0004598243,0.0058251685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972312,0.0016048496,0.00011918515,0.00044394392,0.00047654673,0.00012423079],"domain_scores_gemma":[0.98840594,0.009136343,0.0006175457,0.000976496,0.0006475052,0.00021623755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005226421,0.0018398198,0.0024141737,0.0018238497,0.0012185205,0.002133646,0.0034158763,0.0031663987,0.010432353],"category_scores_gemma":[0.029619757,0.0014560589,0.0013107006,0.0029895937,0.0029845368,0.0026367716,0.0026683765,0.006140405,0.0021299527],"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.000075180025,0.000048924496,0.00041301094,0.00016906814,0.00008571863,0.00009951067,0.00007672543,0.4372182,0.00031555136,0.51832664,0.0030293087,0.040142138],"study_design_scores_gemma":[0.00001372949,0.0000074164495,0.000046179368,0.000019547608,0.0000076155166,0.000014837504,0.0000032040405,0.85125816,0.0001274968,0.14683124,0.0016590813,0.000011389944],"about_ca_topic_score_codex":0.013144223,"about_ca_topic_score_gemma":0.0117333485,"teacher_disagreement_score":0.013144223,"about_ca_system_score_codex":0.0035112584,"about_ca_system_score_gemma":0.0029443733,"threshold_uncertainty_score":0.03489971},"labels":[],"label_agreement":null},{"id":"W25248816","doi":"10.1007/978-3-642-34106-9_11","title":"Sauer’s Bound for a Notion of Teaching Complexity","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Dimension (graph theory); Upper and lower bounds; Conjecture; Concept class; Algebraic number; VC dimension; Class (philosophy); Combinatorics; Mathematics; Set (abstract data type); Discrete mathematics; Computer science; Algebra over a field; Pure mathematics; Artificial intelligence","score_opus":0.033174358755898394,"score_gpt":0.2873352660319016,"score_spread":0.2541609072760032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25248816","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.019988988,0.003092252,0.5707431,0.014415285,0.001077517,0.000112968,0.0007152439,0.0009841548,0.38887048],"genre_scores_gemma":[0.68320084,0.0033503636,0.18826321,0.004041959,0.0019003905,0.0008601003,0.00084364956,0.001445978,0.11609343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946609,0.0011752667,0.00039913435,0.0014173279,0.0014996537,0.0008476317],"domain_scores_gemma":[0.9827132,0.011830727,0.0003700266,0.0029541594,0.0012074149,0.0009244373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036744967,0.0014569237,0.0017326098,0.003220988,0.004438885,0.005757415,0.0028014067,0.0050488,0.033180427],"category_scores_gemma":[0.018873608,0.0013369464,0.0035777707,0.0038833695,0.008649365,0.0246615,0.0068975906,0.009629636,0.005525713],"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.000015174692,0.000011786209,0.000051896182,0.000034732566,0.0000073489546,0.000009845023,0.00010899636,0.0005360243,0.00020287043,0.99152654,0.0022920787,0.005202726],"study_design_scores_gemma":[0.000009791798,0.000009469742,0.000100157136,0.000022468008,0.00001298096,0.00002791848,0.000030347479,0.002366852,0.00037361035,0.9880129,0.009018375,0.000015219544],"about_ca_topic_score_codex":0.0020862422,"about_ca_topic_score_gemma":0.0019583502,"teacher_disagreement_score":0.033180427,"about_ca_system_score_codex":0.0053490116,"about_ca_system_score_gemma":0.0022947972,"threshold_uncertainty_score":0.110999525},"labels":[],"label_agreement":null},{"id":"W2533861448","doi":"10.1145/2983323.2983776","title":"Scalability of Continuous Active Learning for Reliable High-Recall Text Classification","year":2016,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":80,"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":"Scalability; Classifier (UML); Limiting; Computer science; Recall; Artificial intelligence; Machine learning; Binary logarithm; Precision and recall; Class (philosophy); Information retrieval; Mathematics; Discrete mathematics; Database","score_opus":0.0129889152481545,"score_gpt":0.25322929277122014,"score_spread":0.24024037752306565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533861448","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.03814657,0.0013855674,0.9471282,0.0011117818,0.00011809408,0.00026588028,0.00038919647,0.007909627,0.0035451313],"genre_scores_gemma":[0.60401237,0.00058465515,0.38964453,0.000535611,0.00039860554,0.0006506123,0.0013891885,0.00046569874,0.0023187578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933831,0.0019709757,0.0003916211,0.0014387151,0.0025018947,0.00031366028],"domain_scores_gemma":[0.96897405,0.020237816,0.0012888911,0.0056030434,0.0032443407,0.00065184926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011565969,0.001625118,0.0019177774,0.0020864168,0.0009469083,0.003515176,0.005207991,0.0024923745,0.0038394167],"category_scores_gemma":[0.04534916,0.0010239215,0.0010167995,0.0020243179,0.0022867357,0.0072200582,0.004738386,0.0035609894,0.0022839666],"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.0011892375,0.00066343043,0.004407856,0.0005225536,0.00017135228,0.00027803332,0.0005261101,0.3180613,0.013631621,0.019693917,0.011976796,0.6288778],"study_design_scores_gemma":[0.000050668637,0.000052098658,0.0002780664,0.000013227615,0.000010707218,0.00005443837,0.000033551078,0.9835159,0.0024231386,0.012617253,0.00093882054,0.000012100835],"about_ca_topic_score_codex":0.0033428622,"about_ca_topic_score_gemma":0.0031319777,"teacher_disagreement_score":0.011565969,"about_ca_system_score_codex":0.0017295181,"about_ca_system_score_gemma":0.0018275541,"threshold_uncertainty_score":0.06116742},"labels":[],"label_agreement":null},{"id":"W2547508527","doi":"10.48550/arxiv.1605.01288","title":"Fast rates with high probability in exp-concave statistical learning","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":11,"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 Victoria","funders":"","keywords":"Mathematics; Empirical risk minimization; Bounded function; Lipschitz continuity; Upper and lower bounds; Regret; Combinatorics; Exponential function; Discrete mathematics; Applied mathematics; Mathematical optimization; Statistics; Mathematical analysis","score_opus":0.03396108820979779,"score_gpt":0.18972000505705736,"score_spread":0.15575891684725957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547508527","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.004917311,0.0002889448,0.9910964,0.00061967684,0.000054477106,0.00008367839,0.000055459994,0.0007357528,0.0021483903],"genre_scores_gemma":[0.25369453,0.00088002527,0.7289936,0.001372255,0.0004605759,0.0009675464,0.0005274852,0.0010498832,0.012054104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99294853,0.0028623051,0.00034083435,0.0011633029,0.0020816487,0.00060342613],"domain_scores_gemma":[0.9745867,0.018000698,0.0009721521,0.0041590445,0.0015564108,0.00072487624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011964467,0.002532731,0.002372519,0.0015184474,0.0011269968,0.0035214385,0.0053411378,0.002841569,0.006582958],"category_scores_gemma":[0.052623212,0.0013592753,0.0021596209,0.0020942679,0.00386956,0.0075600273,0.008741491,0.0085975565,0.0032734415],"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.0007097374,0.0003674748,0.0025629653,0.0004551998,0.00012313641,0.0003900125,0.0005477489,0.3542437,0.0057503204,0.43826753,0.011159866,0.1854223],"study_design_scores_gemma":[0.000057755748,0.00007937046,0.00024037485,0.000039154325,0.0000198134,0.0001175389,0.000025731377,0.8472311,0.0023947952,0.14773841,0.0020307584,0.000025148762],"about_ca_topic_score_codex":0.0020825288,"about_ca_topic_score_gemma":0.0023734155,"teacher_disagreement_score":0.011964467,"about_ca_system_score_codex":0.0029748175,"about_ca_system_score_gemma":0.002615328,"threshold_uncertainty_score":0.06327492},"labels":[],"label_agreement":null},{"id":"W2550039418","doi":"","title":"Multi-step learning and underlying structure in statistical models","year":2016,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Computer science; Artificial intelligence; Semi-supervised learning; Machine learning; Unsupervised learning; Joint probability distribution; Algorithmic learning theory; Intuition; Transfer of learning; Multi-task learning; Theoretical computer science; Mathematics; Task (project management); Cognitive science","score_opus":0.0290997250675863,"score_gpt":0.29282301607554506,"score_spread":0.26372329100795877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550039418","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.006325007,0.00059462385,0.98955816,0.0011098855,0.00002986236,0.00003447432,0.000113377886,0.00012473685,0.002109955],"genre_scores_gemma":[0.6101991,0.0024685746,0.37566933,0.0010885372,0.00062581815,0.00077180855,0.00060339225,0.0003839962,0.008189447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99411964,0.0028015822,0.0002164129,0.0012472578,0.0013170302,0.000298145],"domain_scores_gemma":[0.9710679,0.022341987,0.0017987778,0.0026739163,0.0013910931,0.0007263282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010055932,0.0015028737,0.0017712185,0.0018776623,0.0012529489,0.0033475887,0.004184745,0.0039465614,0.0046338774],"category_scores_gemma":[0.032677114,0.0014551308,0.0026305916,0.0017788429,0.008269924,0.012134577,0.005440655,0.007433222,0.0010528439],"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.000017324519,0.000022744609,0.00048613423,0.000059381797,0.00002707612,0.000077567915,0.00019230199,0.05802064,0.00014517641,0.9348754,0.0004741747,0.0056021763],"study_design_scores_gemma":[0.0000058163632,0.000020299767,0.000074876676,0.000017519998,0.0000054277684,0.00002982467,0.000010652971,0.24264383,0.00009347159,0.756469,0.000618279,0.000010986646],"about_ca_topic_score_codex":0.0024210094,"about_ca_topic_score_gemma":0.0020378355,"teacher_disagreement_score":0.010055932,"about_ca_system_score_codex":0.0034062576,"about_ca_system_score_gemma":0.0017202139,"threshold_uncertainty_score":0.05318147},"labels":[],"label_agreement":null},{"id":"W2575405755","doi":"","title":"The complexity of learning acyclic CP-nets","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"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":"Computer science; Dimension (graph theory); Concept class; Theoretical computer science; Tree (set theory); Computational complexity theory; Core (optical fiber); Mistake; Upper and lower bounds; VC dimension; Artificial intelligence; Algorithm; Mathematics; Machine learning; Combinatorics","score_opus":0.14089382871735673,"score_gpt":0.3353116497484666,"score_spread":0.19441782103110988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575405755","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.196543,0.00043435761,0.7947289,0.0023938455,0.000044228924,0.0002484353,0.0007850475,0.00080986327,0.004012394],"genre_scores_gemma":[0.81150573,0.0005221021,0.1816221,0.0005538567,0.00010377799,0.00035925224,0.0016862948,0.00019454572,0.0034523588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949018,0.0017958347,0.00046774515,0.0011342743,0.00128156,0.00041871463],"domain_scores_gemma":[0.9333236,0.058357246,0.0021962395,0.0033332098,0.0019063336,0.000883259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050704903,0.000658229,0.0013187759,0.0009779712,0.00096048234,0.0031762347,0.0027845043,0.0021558572,0.0035750263],"category_scores_gemma":[0.048929933,0.0006942999,0.0012795433,0.0014431394,0.001994687,0.009250753,0.0028602185,0.0038150742,0.0003338531],"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.0006580078,0.00027335144,0.00813208,0.0004511622,0.00015637284,0.0002746424,0.00046506163,0.6731289,0.0024351387,0.1689668,0.0035646718,0.14149375],"study_design_scores_gemma":[0.000019440868,0.00003226809,0.00037587713,0.000012443756,0.000016292712,0.000055280718,0.00003926197,0.8380538,0.0007239682,0.16030078,0.00035926135,0.000011224898],"about_ca_topic_score_codex":0.0048559657,"about_ca_topic_score_gemma":0.0046807006,"teacher_disagreement_score":0.0050704903,"about_ca_system_score_codex":0.0035881754,"about_ca_system_score_gemma":0.002520236,"threshold_uncertainty_score":0.026815653},"labels":[],"label_agreement":null},{"id":"W2579011828","doi":"","title":"Lazy Arithmetic Circuits.","year":2016,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Arithmetic; Computer science; Electronic circuit; Mathematics; Electrical engineering; Engineering","score_opus":0.10841834535894951,"score_gpt":0.33997025881175547,"score_spread":0.23155191345280596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579011828","genre_codex":"other","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.05063318,0.014190151,0.3051538,0.009067525,0.003772103,0.00013176836,0.002425432,0.006039286,0.6085867],"genre_scores_gemma":[0.6800109,0.004269781,0.0959554,0.0034314184,0.0019103858,0.00020466842,0.0028537617,0.0013323879,0.21003127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946934,0.00008544283,0.000031827145,0.000120254925,0.00021133653,0.000081824786],"domain_scores_gemma":[0.99924785,0.00027123847,0.000057757607,0.00021165352,0.0001555334,0.000055921842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054576044,0.0006694528,0.00057113625,0.0010640955,0.0011204692,0.0024377971,0.0015068717,0.00090357685,0.038928866],"category_scores_gemma":[0.0025293326,0.00040651497,0.00055006164,0.0009558995,0.0011879887,0.0053199055,0.001768787,0.0025649008,0.008429342],"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.00014854074,0.000042196898,0.00037550804,0.00019996388,0.00003141222,0.00009105451,0.00009508665,0.0014905678,0.0026601937,0.86295563,0.05305334,0.07885654],"study_design_scores_gemma":[0.000046213,0.000025238203,0.0002516736,0.0000447437,0.000031924166,0.00016840745,0.000027452043,0.0060872124,0.0035314176,0.9279507,0.061820228,0.000014835643],"about_ca_topic_score_codex":0.00058664154,"about_ca_topic_score_gemma":0.0018142824,"teacher_disagreement_score":0.038928866,"about_ca_system_score_codex":0.0011490877,"about_ca_system_score_gemma":0.00074241625,"threshold_uncertainty_score":0.13023001},"labels":[],"label_agreement":null},{"id":"W2592594462","doi":"10.1145/3038462.3038469","title":"Active Learning with Visualization for Text Data","year":2017,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Active learning (machine learning); Visualization; Bottleneck; Learning analytics; Machine learning; Artificial intelligence; Semi-supervised learning; Visual analytics; Interface (matter); Interactive Learning; Interactive visualization; Data visualization; Annotation; Analytics; Data mining; Multimedia","score_opus":0.042284604510457575,"score_gpt":0.35157169664247806,"score_spread":0.3092870921320205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592594462","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.008005679,0.00041428537,0.97920245,0.0009249348,0.00009891615,0.00013370583,0.00041902612,0.009132189,0.0016687447],"genre_scores_gemma":[0.23611137,0.0005646381,0.7572325,0.00033620748,0.00015147484,0.00093476917,0.001308427,0.0012090849,0.002151533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99458295,0.0036031571,0.00027022054,0.00052476797,0.0008925944,0.0001264139],"domain_scores_gemma":[0.9559458,0.0356375,0.0011805642,0.0044094333,0.002185761,0.00064090156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071666557,0.0018802689,0.0010443028,0.0020583752,0.00077510515,0.004284982,0.0025656596,0.0021298414,0.0092926435],"category_scores_gemma":[0.042920675,0.0007341177,0.0010920428,0.0016884474,0.0013878114,0.006534979,0.0034093086,0.003387429,0.0020177432],"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.0013933481,0.00070364337,0.0026262747,0.0013570947,0.00021428334,0.0004138613,0.0026847192,0.25697902,0.018667333,0.05200546,0.03563333,0.62732166],"study_design_scores_gemma":[0.0001313946,0.0001632843,0.0004935666,0.00009032788,0.000020376261,0.00010990529,0.0001715818,0.8866828,0.016334623,0.07921247,0.01653197,0.0000577234],"about_ca_topic_score_codex":0.0013563256,"about_ca_topic_score_gemma":0.0013884465,"teacher_disagreement_score":0.0092926435,"about_ca_system_score_codex":0.0008963224,"about_ca_system_score_gemma":0.00073390466,"threshold_uncertainty_score":0.037901342},"labels":[],"label_agreement":null},{"id":"W2597787948","doi":"10.17863/cam.11070","title":"Deep Bayesian Active Learning with Image Data","year":2017,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":435,"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":"Artificial intelligence; Deep learning; Computer science; Machine learning; MNIST database; Active learning (machine learning); Convolutional neural network; Multi-task learning; Instance-based learning; Unsupervised learning; Semi-supervised learning; Task (project management)","score_opus":0.02947164731053246,"score_gpt":0.2792919809015813,"score_spread":0.24982033359104885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597787948","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.0043629254,0.00023450817,0.99357754,0.00041434445,0.000029040712,0.000029319996,0.0000747069,0.00028379634,0.0009937587],"genre_scores_gemma":[0.46593204,0.0008066082,0.5213574,0.0007815808,0.00029699403,0.00062782626,0.0009169398,0.000326359,0.008954235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860615,0.00066206226,0.000070835806,0.00024011599,0.0003356416,0.000085336804],"domain_scores_gemma":[0.99278957,0.005280827,0.00045824342,0.0006561533,0.00060124224,0.00021401163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049915044,0.0010884844,0.0015868782,0.0011669951,0.0005211565,0.0024074593,0.0032581666,0.0033499126,0.0029407567],"category_scores_gemma":[0.014504315,0.0012249576,0.0012338044,0.0011067215,0.0024104982,0.0038031861,0.0035297845,0.003843376,0.0008436783],"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.00016744761,0.00008796613,0.0007373617,0.00014727002,0.00005493787,0.00009902132,0.00016136824,0.8290335,0.0020888918,0.07702884,0.003144529,0.08724873],"study_design_scores_gemma":[0.000007891866,0.000007475561,0.000024064735,0.0000069282046,0.000002029644,0.000008705859,0.0000039244196,0.9810528,0.00039894896,0.01799058,0.00049252016,0.0000040656637],"about_ca_topic_score_codex":0.0032860145,"about_ca_topic_score_gemma":0.0038353645,"teacher_disagreement_score":0.0049915044,"about_ca_system_score_codex":0.0015097017,"about_ca_system_score_gemma":0.0013032107,"threshold_uncertainty_score":0.026397884},"labels":[],"label_agreement":null},{"id":"W2606312722","doi":"10.1007/978-3-319-57351-9_4","title":"Improving Active Learning for One-Class Classification Using Dimensionality Reduction","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Dimensionality reduction; Redundancy (engineering); Thresholding; Curse of dimensionality; Artificial intelligence; Reduction (mathematics); Machine learning; Pattern recognition (psychology); Algorithm; Mathematics; Image (mathematics)","score_opus":0.04405338391815277,"score_gpt":0.30032339676525066,"score_spread":0.2562700128470979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606312722","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.006096619,0.0007935578,0.990325,0.0001945233,0.00017417112,0.000033213255,0.000056952824,0.0010068829,0.0013191014],"genre_scores_gemma":[0.23710616,0.00093106355,0.74590766,0.00053131365,0.00068228587,0.00030807842,0.0009837837,0.0005699777,0.012979643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784744,0.00060604024,0.00015226922,0.0005268563,0.0007167374,0.00015072779],"domain_scores_gemma":[0.994023,0.0035206252,0.00019139545,0.0011735456,0.00095016224,0.00014129437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025352114,0.0015867248,0.0026800386,0.0011420328,0.000837506,0.002060289,0.0045679715,0.0028275119,0.004604569],"category_scores_gemma":[0.007790537,0.00076182256,0.0018419579,0.001359318,0.0010332911,0.004425436,0.0030436735,0.0045505874,0.0031385038],"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.00020198095,0.0003307558,0.0005984692,0.00018245928,0.0001363737,0.000050712788,0.00013922145,0.06384089,0.009607898,0.018214747,0.010153912,0.89654255],"study_design_scores_gemma":[0.000012661702,0.000047115816,0.00011953252,0.000011235108,0.000025084593,0.000050077095,0.000014778161,0.9807128,0.0031834645,0.014320242,0.0014922526,0.000010758141],"about_ca_topic_score_codex":0.0014817528,"about_ca_topic_score_gemma":0.0018258978,"teacher_disagreement_score":0.004604569,"about_ca_system_score_codex":0.0006131542,"about_ca_system_score_gemma":0.00063142244,"threshold_uncertainty_score":0.015403867},"labels":[],"label_agreement":null},{"id":"W2608848790","doi":"10.48550/arxiv.1704.07511","title":"Scalable Planning with Tensorflow for Hybrid Nonlinear Domains","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"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":"Scalability; Computer science; Mathematical optimization; Nonlinear system; Gradient descent; Deep learning; Nonlinear programming; Optimization problem; Artificial intelligence; Artificial neural network; Algorithm; Mathematics","score_opus":0.05397850387346422,"score_gpt":0.21203779139147838,"score_spread":0.15805928751801415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608848790","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.020041587,0.00025051142,0.9735908,0.00039798333,0.000053714502,0.000056189172,0.00019914543,0.0018067813,0.0036033576],"genre_scores_gemma":[0.4389321,0.0002680416,0.55666864,0.00021568013,0.000037504815,0.00023303319,0.00059179036,0.00044027224,0.0026128874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995628,0.00013776714,0.000028656143,0.00010257903,0.00011164663,0.000056545996],"domain_scores_gemma":[0.9987011,0.00077490346,0.0001016615,0.00019764983,0.00014581681,0.000078818994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010264511,0.001040769,0.00082970114,0.00038566522,0.0004929817,0.0011850151,0.0012166359,0.00088838924,0.0042711557],"category_scores_gemma":[0.0039791977,0.00052247825,0.00080076884,0.0005008524,0.0011902982,0.0018277306,0.0017755952,0.0019986196,0.00059855555],"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.00005705886,0.000026637494,0.0004501358,0.00008303069,0.000022822793,0.00005646315,0.000048039306,0.95495594,0.0009803566,0.01822246,0.0015196243,0.023577563],"study_design_scores_gemma":[0.0000049740356,0.0000056446265,0.000021041627,0.0000035765083,0.0000015711931,0.0000047248873,0.000005657496,0.99096394,0.00030481536,0.008240988,0.00044116206,0.0000018430947],"about_ca_topic_score_codex":0.011595465,"about_ca_topic_score_gemma":0.013119858,"teacher_disagreement_score":0.011595465,"about_ca_system_score_codex":0.0014142522,"about_ca_system_score_gemma":0.0021626295,"threshold_uncertainty_score":0.023055911},"labels":[],"label_agreement":null},{"id":"W2611181800","doi":"10.1007/978-3-319-59162-9_29","title":"Some Properties of Consensus-Based Classification","year":2017,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.041400240630787066,"score_gpt":0.2852372765419548,"score_spread":0.24383703591116773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611181800","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.04731052,0.0030342308,0.897027,0.0031284199,0.0005081373,0.00016061937,0.00047458464,0.00059900654,0.0477575],"genre_scores_gemma":[0.80731857,0.0031808657,0.15076052,0.0014742151,0.0014811294,0.0007819513,0.0013619731,0.00053855655,0.033102226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722004,0.00080951134,0.00019926953,0.00065005757,0.00091476494,0.00020643199],"domain_scores_gemma":[0.9778135,0.015169091,0.0012162853,0.0025231342,0.002806068,0.0004720606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004298194,0.0007429492,0.0015096449,0.0018406581,0.0017012666,0.0032882097,0.0027937589,0.0022128662,0.0061733467],"category_scores_gemma":[0.029275184,0.00062182324,0.0012308006,0.003063804,0.0034659377,0.005990969,0.0023006115,0.0036869068,0.0010827596],"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.000094903815,0.00004988609,0.0007932366,0.00016399269,0.00005269694,0.00006856624,0.00028535226,0.028016714,0.0008969016,0.9043204,0.007425708,0.057831656],"study_design_scores_gemma":[0.000017534274,0.000024566421,0.00024532017,0.000027557808,0.000015989486,0.00006186951,0.000041529696,0.16812506,0.00052505796,0.8288458,0.002056326,0.000013439609],"about_ca_topic_score_codex":0.0022530218,"about_ca_topic_score_gemma":0.0012307005,"teacher_disagreement_score":0.0061733467,"about_ca_system_score_codex":0.0023363172,"about_ca_system_score_gemma":0.0012497957,"threshold_uncertainty_score":0.022731304},"labels":[],"label_agreement":null},{"id":"W2621731111","doi":"10.1609/aaai.v32i1.11627","title":"Sample-Efficient Learning of Mixtures","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sample complexity; Combinatorics; Distribution (mathematics); Logarithm; Class (philosophy); Mathematics; Upper and lower bounds; Discrete mathematics; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.05839631489145449,"score_gpt":0.3098292682075604,"score_spread":0.25143295331610593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621731111","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.006441674,0.0004109705,0.99117285,0.0003164993,0.0000360059,0.000051871142,0.00007821657,0.0005307718,0.000961094],"genre_scores_gemma":[0.35080698,0.0010830099,0.6382984,0.0009118396,0.00043924962,0.00048656727,0.00092564407,0.00047444092,0.0065739667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949714,0.0016137976,0.00026983413,0.0015947635,0.0011759643,0.00037413236],"domain_scores_gemma":[0.9856082,0.0098481,0.00091606,0.002061552,0.0010387003,0.0005274048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005594072,0.0022716268,0.0035425455,0.001653691,0.0012502713,0.0032478294,0.004774316,0.0034763487,0.0033956342],"category_scores_gemma":[0.030672584,0.0018003244,0.002957114,0.0020194205,0.0033398643,0.009454929,0.0053398837,0.006730237,0.0012190122],"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.00053565763,0.00024116124,0.0023696197,0.00030332198,0.00025312632,0.00017220723,0.00024150027,0.7757091,0.0026826877,0.12867498,0.0034871602,0.085329585],"study_design_scores_gemma":[0.000015612615,0.00003249619,0.00011828003,0.000010003067,0.00001493019,0.000036214973,0.000008945509,0.94957715,0.00065518625,0.04884658,0.000670926,0.000013667278],"about_ca_topic_score_codex":0.0035141725,"about_ca_topic_score_gemma":0.0027951514,"teacher_disagreement_score":0.005594072,"about_ca_system_score_codex":0.0027194924,"about_ca_system_score_gemma":0.0016957452,"threshold_uncertainty_score":0.029584646},"labels":[],"label_agreement":null},{"id":"W2626188202","doi":"10.1007/s11750-017-0451-6","title":"On learning and branching: a survey","year":2017,"lang":"en","type":"article","venue":"Top","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":174,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Integer programming; Artificial intelligence; Branching (polymer chemistry); Heuristic; Machine learning; Field (mathematics); Branch and bound; Variable (mathematics); Computational learning theory; Mathematical optimization; Theoretical computer science; Active learning (machine learning); Algorithm; Mathematics","score_opus":0.016824630452904037,"score_gpt":0.2971222359018433,"score_spread":0.2802976054489392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626188202","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075634895,0.5649549,0.3722674,0.008646648,0.0012943035,0.00008890792,0.0008131784,0.00091262336,0.043458607],"genre_scores_gemma":[0.10674843,0.6345876,0.22923413,0.0039404538,0.009996878,0.00026799348,0.0020699603,0.00077074044,0.012383837],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971571,0.00070584274,0.00021839145,0.0006857795,0.0009692444,0.000263644],"domain_scores_gemma":[0.98844135,0.008725218,0.00030793448,0.001145113,0.0009977891,0.00038266784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041823415,0.0019745757,0.004471516,0.0043278984,0.0019474428,0.007631264,0.0036167696,0.0028601668,0.013658224],"category_scores_gemma":[0.014026551,0.0014905971,0.0018518948,0.014408626,0.0036417523,0.015404751,0.0042542536,0.006183392,0.0051511154],"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.00012747319,0.00021795128,0.0029714464,0.002671805,0.0001072246,0.00007634316,0.00021393507,0.011750478,0.00036465353,0.3565806,0.03494106,0.5899771],"study_design_scores_gemma":[0.000048963597,0.00013096904,0.0013098859,0.0010006903,0.00011518022,0.000538503,0.0002087748,0.03665902,0.0006745448,0.7973435,0.1619077,0.00006224491],"about_ca_topic_score_codex":0.003547651,"about_ca_topic_score_gemma":0.0030280135,"teacher_disagreement_score":0.013658224,"about_ca_system_score_codex":0.0029396915,"about_ca_system_score_gemma":0.003384621,"threshold_uncertainty_score":0.04569131},"labels":[],"label_agreement":null},{"id":"W2626194254","doi":"10.1162/neco_a_01174","title":"Gated Orthogonal Recurrent Units: On Learning to Forget","year":2019,"lang":"en","type":"article","venue":"Neural Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":101,"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 Montréal","funders":"Army Research Office; Semiconductor Research Corporation; National Science Foundation","keywords":"Artificial intelligence; Computer science; Psychology; Pattern recognition (psychology); Machine learning; Mathematics; Combinatorics","score_opus":0.01709036190143093,"score_gpt":0.27418542364558757,"score_spread":0.25709506174415664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626194254","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.05099878,0.0006842622,0.9433877,0.00037614166,0.0001415979,0.000035781453,0.000102868085,0.001021838,0.0032510373],"genre_scores_gemma":[0.8665729,0.00066372426,0.122653976,0.00041956207,0.00011616457,0.00012375753,0.00030890148,0.0002371498,0.008903806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996537,0.00009082534,0.00002208178,0.00010079148,0.000071669805,0.00006107258],"domain_scores_gemma":[0.99888426,0.00052943337,0.0001263698,0.0002035251,0.00019307686,0.00006346218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009765513,0.00083913567,0.0008807162,0.0003085545,0.00028692491,0.00065253815,0.002175958,0.00093221036,0.0023251693],"category_scores_gemma":[0.0040515144,0.00045543286,0.00055306614,0.000364,0.001085266,0.0022991137,0.001139845,0.0013609566,0.0005809756],"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.00025705047,0.00008599485,0.0010702462,0.00012794902,0.00009751206,0.0002184334,0.00015275512,0.77094126,0.012080966,0.059907522,0.002897024,0.15216327],"study_design_scores_gemma":[0.0000052817504,0.000032081593,0.000059499765,0.0000042445563,0.000009680306,0.000019277879,0.0000033069123,0.98884165,0.0012461954,0.009389327,0.00038391966,0.0000055694013],"about_ca_topic_score_codex":0.0031357643,"about_ca_topic_score_gemma":0.0038954534,"teacher_disagreement_score":0.0031357643,"about_ca_system_score_codex":0.00056724163,"about_ca_system_score_gemma":0.0005853371,"threshold_uncertainty_score":0.0077784657},"labels":[],"label_agreement":null},{"id":"W2703150994","doi":"10.1109/tro.2018.2830331","title":"Informed Sampling for Asymptotically Optimal Path Planning","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"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":"Mathematical optimization; Heuristics; Curse of dimensionality; Motion planning; Norm (philosophy); Asymptotically optimal algorithm; Dimension (graph theory); Mathematics; Euclidean geometry; Euclidean distance; Convergence (economics); Sampling (signal processing); Computer science; State (computer science); Path (computing); Algorithm; Robot; Artificial intelligence; Filter (signal processing); Combinatorics","score_opus":0.036968620761113326,"score_gpt":0.31722975212223303,"score_spread":0.2802611313611197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2703150994","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.01770821,0.00025260923,0.9791461,0.00012685405,0.000018226812,0.00005273675,0.00006693848,0.00052787224,0.0021004807],"genre_scores_gemma":[0.54508543,0.00032984948,0.45122287,0.0002204812,0.000054590415,0.00041926777,0.00045971602,0.00029145888,0.0019162839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980793,0.0008997407,0.00008034734,0.00025812862,0.000542706,0.0001398199],"domain_scores_gemma":[0.99494475,0.003743931,0.0002693839,0.0005408569,0.00035754679,0.00014350886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019291799,0.0010127341,0.0012411488,0.001029853,0.0006756773,0.0010502331,0.0010998395,0.0008627907,0.0020695657],"category_scores_gemma":[0.01212656,0.0007807751,0.00090188795,0.00094534655,0.0014170787,0.001871155,0.0017729359,0.0017484316,0.00033618064],"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.00017117591,0.000053727555,0.00057750556,0.00007521443,0.00004372149,0.00006360621,0.00009661317,0.9199082,0.0014181288,0.04052688,0.0009794513,0.03608584],"study_design_scores_gemma":[0.000012725708,0.000030103729,0.00006476215,0.0000057171005,0.000004197798,0.000009953833,0.000008345819,0.9728899,0.0003861372,0.026232919,0.00035044778,0.0000048821134],"about_ca_topic_score_codex":0.004821519,"about_ca_topic_score_gemma":0.0050023156,"teacher_disagreement_score":0.004821519,"about_ca_system_score_codex":0.0016202426,"about_ca_system_score_gemma":0.0019593942,"threshold_uncertainty_score":0.0117557645},"labels":[],"label_agreement":null},{"id":"W2735713893","doi":"10.1109/ijcnn.2017.7966313","title":"Self-training with adaptive regularization for S3VM","year":2017,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"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":"Training (meteorology); Computer science; Regularization (linguistics); Artificial intelligence; Physics","score_opus":0.024643301851753258,"score_gpt":0.26307440109192454,"score_spread":0.23843109924017128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735713893","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.009937915,0.0002529361,0.98695546,0.00027164278,0.00004984608,0.00005499922,0.000045961766,0.0010917163,0.0013395731],"genre_scores_gemma":[0.372365,0.00024506226,0.61971,0.0006554746,0.00013930832,0.00043195757,0.00053602253,0.0006830732,0.0052341265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991548,0.00033396532,0.000049719725,0.00017514099,0.00021049395,0.000075934586],"domain_scores_gemma":[0.9983425,0.0009072114,0.00015674988,0.00018318562,0.00032431757,0.00008600931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018145874,0.0010163181,0.0011796824,0.00056412845,0.00045707665,0.0009045813,0.0018575098,0.0019443183,0.0028934896],"category_scores_gemma":[0.0053309184,0.0006144804,0.00081622147,0.00061859016,0.0009995059,0.00124766,0.0015065459,0.002322062,0.0009645687],"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.00009959689,0.00012753319,0.0008429611,0.00013265263,0.00005064065,0.00009878347,0.0001218038,0.82730323,0.004640219,0.01389311,0.006745773,0.14594376],"study_design_scores_gemma":[0.0000026255948,0.0000069611924,0.000016206988,0.0000028963464,9.093538e-7,0.000004998805,0.0000024121193,0.99815875,0.00022473009,0.0013600782,0.00021774671,0.0000016601844],"about_ca_topic_score_codex":0.0033634077,"about_ca_topic_score_gemma":0.0044870893,"teacher_disagreement_score":0.0033634077,"about_ca_system_score_codex":0.00084363297,"about_ca_system_score_gemma":0.0018086169,"threshold_uncertainty_score":0.009679675},"labels":[],"label_agreement":null},{"id":"W2740275380","doi":"10.48550/arxiv.1708.00088","title":"Learning Algorithms for Active Learning","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Microsoft (Canada)","funders":"","keywords":"Active learning (machine learning); Computer science; Algorithm; Artificial intelligence; Machine learning","score_opus":0.07412385670808344,"score_gpt":0.22856959367735838,"score_spread":0.15444573696927494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740275380","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.0003183744,0.00082516304,0.99561876,0.0004305408,0.00011349173,0.000056463028,0.00012205206,0.00036012297,0.0021550334],"genre_scores_gemma":[0.08177865,0.0039257905,0.8972024,0.0012816334,0.0013055399,0.0018223006,0.0015671303,0.00059794,0.010518587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942287,0.0027686274,0.00039168823,0.0010978265,0.0012502434,0.00026282086],"domain_scores_gemma":[0.9867778,0.0095128,0.00053209794,0.0017272739,0.0011750072,0.00027497887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00675932,0.0025113095,0.0026425729,0.0026196437,0.0011007205,0.004721615,0.005889712,0.003792472,0.01150707],"category_scores_gemma":[0.028138379,0.0013380941,0.0022265553,0.0036645911,0.0025015848,0.0063673677,0.0048190877,0.0070168134,0.006022591],"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.00007638871,0.00017363082,0.000927404,0.00051966665,0.00022611566,0.000091237176,0.00016848146,0.16063216,0.0005509347,0.5856603,0.020525953,0.23044775],"study_design_scores_gemma":[0.000040489056,0.000029653687,0.00006660751,0.000069727816,0.000023269875,0.000059117272,0.00001893313,0.47093895,0.00030818448,0.5157132,0.012714882,0.000016883694],"about_ca_topic_score_codex":0.0019403306,"about_ca_topic_score_gemma":0.0018669731,"teacher_disagreement_score":0.01150707,"about_ca_system_score_codex":0.0018179839,"about_ca_system_score_gemma":0.0019641472,"threshold_uncertainty_score":0.038494945},"labels":[],"label_agreement":null},{"id":"W2740505281","doi":"10.24963/ijcai.2017/261","title":"Cost-Effective Active Learning from Diverse Labelers","year":2017,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"National Key Research and Development Program of China; Nanjing University; National Natural Science Foundation of China","keywords":"Computer science; Crowdsourcing; Artificial intelligence; Selection (genetic algorithm); Quality (philosophy); Machine learning; Supervised learning; Ground truth; Artificial neural network","score_opus":0.03486200667316531,"score_gpt":0.3052119527193748,"score_spread":0.2703499460462095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740505281","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.047785245,0.00071109226,0.9461551,0.001312111,0.000087204615,0.0002803474,0.00017591071,0.0010229803,0.0024699608],"genre_scores_gemma":[0.7559428,0.0002877811,0.23493129,0.0014791383,0.00043568775,0.0008468955,0.0007369817,0.00026012867,0.0050792433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938069,0.0032200306,0.0002746038,0.001102431,0.0012108753,0.00038506536],"domain_scores_gemma":[0.9710153,0.023118056,0.0012138146,0.0020134728,0.0019591197,0.00068017497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0099222055,0.0024847146,0.003453064,0.0016854793,0.0018074387,0.003063421,0.006927292,0.0050138156,0.002891553],"category_scores_gemma":[0.022462392,0.0008713939,0.0013858329,0.0019184421,0.0028515037,0.005749993,0.0042103566,0.0037474192,0.0009915073],"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.0021035362,0.0012762729,0.0063007735,0.00050189445,0.00025157837,0.0005008717,0.0011299105,0.52823174,0.0113861505,0.039285507,0.012168189,0.3968636],"study_design_scores_gemma":[0.00008844869,0.000080764104,0.00010390751,0.000014832236,0.000021484733,0.00004549936,0.00006429798,0.97859645,0.0020487478,0.018263632,0.0006599275,0.000012054395],"about_ca_topic_score_codex":0.0022307243,"about_ca_topic_score_gemma":0.003107661,"teacher_disagreement_score":0.0099222055,"about_ca_system_score_codex":0.0015165262,"about_ca_system_score_gemma":0.0016388451,"threshold_uncertainty_score":0.05247426},"labels":[],"label_agreement":null},{"id":"W2741306150","doi":"10.24963/ijcai.2017/262","title":"Multi-instance multi-label active learning","year":2017,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Oracle; Active learning (machine learning); Artificial intelligence; Exploit; Machine learning; Task (project management); Rank (graph theory); Learning to rank; Space (punctuation); Mathematics; Ranking (information retrieval); Engineering","score_opus":0.04053652865405402,"score_gpt":0.3248157569571066,"score_spread":0.28427922830305263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741306150","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.0070258304,0.0004341687,0.99010676,0.00050130696,0.00005853479,0.00006830611,0.000113906564,0.0007361507,0.0009551265],"genre_scores_gemma":[0.5112122,0.0004750402,0.4795679,0.0013914116,0.0004961867,0.0005278662,0.0011653779,0.00030642672,0.0048576356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967895,0.0013813621,0.00015187645,0.0008513287,0.0005885751,0.00023741086],"domain_scores_gemma":[0.9914996,0.0056647426,0.0006476817,0.0010961661,0.0008041461,0.000287653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004938566,0.0016873241,0.003477654,0.0015266751,0.0009768491,0.0030401899,0.0065949187,0.004973387,0.0028548667],"category_scores_gemma":[0.011360049,0.0009571923,0.0014950308,0.0019122798,0.0022308114,0.005421122,0.0035261852,0.004585015,0.00095642876],"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.00065127166,0.00055506924,0.0023685722,0.00045275767,0.0002135815,0.00020979001,0.00032390706,0.53522795,0.005995317,0.04765973,0.011826991,0.3945151],"study_design_scores_gemma":[0.000014602557,0.000021680156,0.00003464482,0.000005975003,0.000008628361,0.000014623238,0.000007967716,0.99088436,0.0009944716,0.0074861236,0.0005200571,0.0000068513946],"about_ca_topic_score_codex":0.0013458938,"about_ca_topic_score_gemma":0.0020439015,"teacher_disagreement_score":0.0065949187,"about_ca_system_score_codex":0.0012792917,"about_ca_system_score_gemma":0.0010706455,"threshold_uncertainty_score":0.02611798},"labels":[],"label_agreement":null},{"id":"W2741312414","doi":"10.7939/r3c07x","title":"NOVEL MACHINE LEARNING ALGORITHMS","year":2013,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"Machine Learning and Algorithms","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 Alberta","funders":"","keywords":"Artificial intelligence; Machine learning; Computer science; Decision tree; Naive Bayes classifier; Classifier (UML); Incremental decision tree; Focus (optics); Tree (set theory); Active learning (machine learning); Decision tree learning; Pattern recognition (psychology); Support vector machine; Mathematics","score_opus":0.006413709727114704,"score_gpt":0.17068589177246998,"score_spread":0.1642721820453553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741312414","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.0023322287,0.003292624,0.9797789,0.001395955,0.0006631244,0.00014656973,0.00024529963,0.00085491035,0.011290398],"genre_scores_gemma":[0.106834896,0.0069437465,0.85841453,0.002319334,0.0020372062,0.0008199136,0.0015560242,0.00036039422,0.02071399],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957858,0.0011400505,0.00035663715,0.0010694744,0.0013808307,0.00026727963],"domain_scores_gemma":[0.9951321,0.0025096256,0.00030893745,0.00088588113,0.0010250424,0.00013847499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041261897,0.0018991267,0.0022027662,0.0025266851,0.0011470534,0.0046478137,0.003611182,0.0034751198,0.010999054],"category_scores_gemma":[0.017096372,0.0008723647,0.0020584692,0.0026024983,0.0018061908,0.005724137,0.003967931,0.004897024,0.00671531],"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.000079254634,0.00016684551,0.0014550845,0.0006501375,0.00016924625,0.00015439055,0.0001622364,0.088886574,0.002010772,0.39403963,0.02757902,0.4846468],"study_design_scores_gemma":[0.00004293868,0.00007739834,0.00024587597,0.00015608242,0.000042225307,0.0003370512,0.00003804584,0.62144905,0.0016896626,0.3222071,0.053680554,0.000034096654],"about_ca_topic_score_codex":0.0008440961,"about_ca_topic_score_gemma":0.0008541543,"teacher_disagreement_score":0.010999054,"about_ca_system_score_codex":0.0017510634,"about_ca_system_score_gemma":0.0015790361,"threshold_uncertainty_score":0.036795497},"labels":[],"label_agreement":null},{"id":"W2742855836","doi":"10.1002/cjs.11327","title":"Minimax robust active learning for approximately specified regression models","year":2017,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"University of Alberta; McGill University; Jewish General Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minimax; Statistics; Population; Context (archaeology); Regression; Sampling (signal processing); Regression analysis; Econometrics; Mathematics; Computer science; Benchmark (surveying); Sampling distribution; Mathematical optimization; Geography","score_opus":0.058320863441980425,"score_gpt":0.27688259623258965,"score_spread":0.21856173279060923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742855836","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.012045147,0.00033742763,0.9862422,0.0004165588,0.000021306674,0.000043050233,0.000067518646,0.00022761391,0.0005992403],"genre_scores_gemma":[0.71636665,0.00055444613,0.27314746,0.0007958861,0.00024662574,0.00079684495,0.0008636268,0.00035025083,0.006878201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99560636,0.0030245518,0.00017965281,0.0005848325,0.00042607586,0.00017840526],"domain_scores_gemma":[0.95394695,0.0405393,0.0017491843,0.0015236083,0.0018720402,0.00036887292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016330045,0.0014020363,0.0030663991,0.0012965433,0.00057782204,0.0023645486,0.004585002,0.002843936,0.0026542358],"category_scores_gemma":[0.042508394,0.0012305581,0.0012611359,0.001168429,0.0030570666,0.0028576127,0.0030478102,0.0037476684,0.000659846],"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.00011178957,0.0000632274,0.0011264187,0.00009676972,0.00008545902,0.00004983559,0.00009069233,0.9566496,0.00040305514,0.01965587,0.0007443572,0.020922767],"study_design_scores_gemma":[0.000006948963,0.000012002107,0.000048726608,0.000008721698,0.0000028010613,0.000003441732,0.000003704891,0.9938012,0.00010636305,0.0059105526,0.000092468974,0.0000031337026],"about_ca_topic_score_codex":0.0044750795,"about_ca_topic_score_gemma":0.0033491182,"teacher_disagreement_score":0.016330045,"about_ca_system_score_codex":0.001869357,"about_ca_system_score_gemma":0.0016204956,"threshold_uncertainty_score":0.0863626},"labels":[],"label_agreement":null},{"id":"W2751109772","doi":"","title":"Min-Max Propagation","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"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":"Belief propagation; Job shop scheduling; Minification; Inference; Set (abstract data type); Factor graph; Computer science; Function (biology); Propagation delay; Mathematical optimization; Combinatorics; Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Schedule; Decoding methods","score_opus":0.01574268461058346,"score_gpt":0.2681194521659511,"score_spread":0.25237676755536764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751109772","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.0029570807,0.00023680831,0.9941876,0.0002410988,0.00005959492,0.00004488296,0.0000802052,0.00029889817,0.001893864],"genre_scores_gemma":[0.24633332,0.0009078752,0.744423,0.00065057614,0.00028709898,0.0003763677,0.0005441493,0.00045923676,0.00601829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712557,0.0012404355,0.0001200306,0.00058940216,0.000644153,0.00028044768],"domain_scores_gemma":[0.9869464,0.009800361,0.0005905999,0.0014829276,0.000978023,0.00020163716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004499832,0.00210997,0.0019376057,0.0013648643,0.0011654,0.0023115461,0.003696883,0.0019686297,0.0071158614],"category_scores_gemma":[0.025203161,0.0011578514,0.0014704039,0.0025156885,0.0018345183,0.005567456,0.002531741,0.0035615137,0.0015374742],"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.00025232698,0.000113698836,0.0008540207,0.00037663215,0.00014563455,0.000120326295,0.00018909632,0.7265286,0.0020747965,0.1376953,0.007177485,0.124472044],"study_design_scores_gemma":[0.000013109065,0.000029157105,0.000057917012,0.00001802995,0.000020814283,0.000027800048,0.000014358438,0.92341405,0.0011300645,0.0732911,0.0019732937,0.000010271813],"about_ca_topic_score_codex":0.004752028,"about_ca_topic_score_gemma":0.006854468,"teacher_disagreement_score":0.0071158614,"about_ca_system_score_codex":0.0018965689,"about_ca_system_score_gemma":0.0019020739,"threshold_uncertainty_score":0.023804963},"labels":[],"label_agreement":null},{"id":"W2751223050","doi":"","title":"Multitask Spectral Learning of Weighted Automata","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"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; Representation (politics); Multi-task learning; Artificial intelligence; Automaton; Learning automata; Feature learning; Vector space; Machine learning; Theoretical computer science; Task (project management); Mathematics","score_opus":0.013211264280660433,"score_gpt":0.26776658986475527,"score_spread":0.2545553255840948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751223050","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.022959728,0.0001249495,0.9759779,0.00014921163,0.000025971609,0.000039962128,0.00005668319,0.0002514727,0.0004142515],"genre_scores_gemma":[0.7363461,0.00015998632,0.26072654,0.0001462463,0.0000792174,0.0002817407,0.00038167115,0.00013886642,0.001739701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974734,0.0009733317,0.00017201457,0.0008600586,0.00032413666,0.00019697245],"domain_scores_gemma":[0.98947185,0.007191739,0.0008345412,0.0010744429,0.0010643728,0.00036304892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035477034,0.0011207819,0.0017043639,0.0017263768,0.00079555326,0.0020305794,0.0026600738,0.0020714744,0.0020371403],"category_scores_gemma":[0.021060161,0.0006527176,0.0015038886,0.0016535548,0.001556505,0.004814829,0.0024251773,0.0021203202,0.0006159921],"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.0002152951,0.00020594252,0.0044902535,0.0002519262,0.00020060288,0.00017026794,0.00036688877,0.75281495,0.005238489,0.067674,0.0012041274,0.16716726],"study_design_scores_gemma":[0.0000031903824,0.000028617458,0.00013272327,0.0000058391834,0.0000067708847,0.000015602178,0.000019949668,0.957829,0.0005248644,0.041235916,0.00019005965,0.000007438632],"about_ca_topic_score_codex":0.0029207391,"about_ca_topic_score_gemma":0.0024036716,"teacher_disagreement_score":0.0035477034,"about_ca_system_score_codex":0.0013553585,"about_ca_system_score_gemma":0.0011949929,"threshold_uncertainty_score":0.01876223},"labels":[],"label_agreement":null},{"id":"W2753140668","doi":"10.1016/j.ic.2017.08.003","title":"Distinguishing pattern languages with membership examples","year":2017,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Artificial intelligence; Linguistics; Natural language processing; Programming language; Philosophy","score_opus":0.016559403679376257,"score_gpt":0.2783609530920439,"score_spread":0.26180154941266764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753140668","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.1983896,0.00021437445,0.7867647,0.0019494824,0.00009381059,0.00013758735,0.0004385597,0.0014764734,0.010535355],"genre_scores_gemma":[0.85702413,0.00015059956,0.13599859,0.00039924722,0.00013653812,0.00014202905,0.0009517976,0.00027581907,0.0049213152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995514,0.001410683,0.0004260981,0.0010655515,0.0011541203,0.00042968127],"domain_scores_gemma":[0.97631663,0.015836181,0.0010953017,0.004360332,0.0015858406,0.0008056355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030615155,0.00050224835,0.0008519807,0.0018278403,0.0011682131,0.0040808385,0.0021108566,0.0019232781,0.0059484127],"category_scores_gemma":[0.031361956,0.0006435154,0.001219561,0.0016511603,0.0029129789,0.015734917,0.0056054546,0.0037542935,0.0011564366],"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.0007852305,0.0002705036,0.009126002,0.00036404058,0.00006782496,0.00064740423,0.0018732575,0.008499128,0.008400723,0.7834919,0.0051998394,0.18127419],"study_design_scores_gemma":[0.000027412152,0.00005270695,0.0005557378,0.000038755556,0.000026049813,0.00042854616,0.0003164197,0.06094267,0.0056420066,0.9286122,0.003335074,0.00002242204],"about_ca_topic_score_codex":0.00040151642,"about_ca_topic_score_gemma":0.00051067956,"teacher_disagreement_score":0.0059484127,"about_ca_system_score_codex":0.00069126906,"about_ca_system_score_gemma":0.0008821565,"threshold_uncertainty_score":0.019899487},"labels":[],"label_agreement":null},{"id":"W2756339378","doi":"10.1007/978-3-319-67549-7_8","title":"From Passive to Active FSM Inference via Checking Sequence Construction","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Computer Research Institute of Montréal","funders":"","keywords":"TRACE (psycholinguistics); Inference; Sequence (biology); Computer science; Finite-state machine; A priori and a posteriori; Set (abstract data type); Model checking; Solver; Algorithm; Reset (finance); Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.020546046712473887,"score_gpt":0.28608513160102855,"score_spread":0.26553908488855466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756339378","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.0033088736,0.00013112476,0.98810786,0.0003551508,0.00014458706,0.00005556892,0.00013773245,0.0026430176,0.005116094],"genre_scores_gemma":[0.32823285,0.00042705509,0.65499777,0.0010057243,0.00032546144,0.0002836762,0.0012502727,0.0029576023,0.010519659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99279284,0.002245819,0.00040558836,0.0017040232,0.0023434635,0.00050825183],"domain_scores_gemma":[0.97995365,0.012379589,0.00033001785,0.005537923,0.0015321613,0.00026662296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056816973,0.0013548041,0.0011189635,0.0018929302,0.0014503365,0.0032730557,0.0053094747,0.0023525578,0.011430586],"category_scores_gemma":[0.024660593,0.0017390712,0.003053652,0.001178571,0.00518656,0.010022314,0.0077593797,0.0069820974,0.0031977803],"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.00028640497,0.0001921459,0.00088664534,0.0005517702,0.000111724476,0.0003106924,0.0007612835,0.021538349,0.0091738785,0.74661434,0.00953641,0.21003623],"study_design_scores_gemma":[0.000031326395,0.00003583733,0.0001214391,0.00009344978,0.00009467088,0.00011281153,0.00005188041,0.09263799,0.0106384205,0.8877527,0.00839978,0.000029694327],"about_ca_topic_score_codex":0.001917761,"about_ca_topic_score_gemma":0.002969441,"teacher_disagreement_score":0.011430586,"about_ca_system_score_codex":0.0014525253,"about_ca_system_score_gemma":0.002773167,"threshold_uncertainty_score":0.03823912},"labels":[],"label_agreement":null},{"id":"W2762632680","doi":"10.1109/tsp.2014.2304431","title":"Active Learning of Multiple Source Multiple Destination Topologies","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":15,"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":"Merge (version control); Subnetwork; Network topology; Computer science; Upper and lower bounds; Algorithm; Topology (electrical circuits); Focus (optics); Binary number; Binary logarithm; Greedy algorithm; Theoretical computer science; Mathematics; Combinatorics; Discrete mathematics; Computer network","score_opus":0.015328202565357161,"score_gpt":0.25229379681255065,"score_spread":0.2369655942471935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762632680","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.041736685,0.00035505305,0.95520157,0.0006023242,0.000043781878,0.000059833485,0.0002486409,0.0005056664,0.0012463582],"genre_scores_gemma":[0.78827196,0.00034091927,0.20590588,0.00027739574,0.00014387081,0.0002119256,0.0008218479,0.00011035462,0.003915832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985991,0.0005471894,0.00005337759,0.00039554285,0.00026018714,0.00014458274],"domain_scores_gemma":[0.9906392,0.007383087,0.0006627703,0.0005053131,0.0005106855,0.00029896825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028363315,0.0010017677,0.0017238919,0.0013684728,0.0007345358,0.0018731599,0.003953007,0.002406383,0.0016879926],"category_scores_gemma":[0.01087178,0.0009797096,0.0010841597,0.0015910448,0.001336963,0.004987878,0.0021974037,0.00243494,0.00038116073],"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.00022862024,0.000068610476,0.0015561327,0.000071429386,0.00005213461,0.00016503435,0.00012424627,0.9465331,0.00093746267,0.013404792,0.0009001942,0.03595824],"study_design_scores_gemma":[0.0000061938667,0.000009500718,0.00008374488,0.0000035511985,0.0000041062285,0.000012648411,0.000012903441,0.9911361,0.0003000868,0.008252238,0.00017597085,0.0000030703704],"about_ca_topic_score_codex":0.0030852978,"about_ca_topic_score_gemma":0.003230589,"teacher_disagreement_score":0.003953007,"about_ca_system_score_codex":0.0013791176,"about_ca_system_score_gemma":0.00064839364,"threshold_uncertainty_score":0.0150001645},"labels":[],"label_agreement":null},{"id":"W2763798028","doi":"10.1109/tnnls.2018.2869164","title":"Bag-Level Aggregation for Multiple-Instance Active Learning in Instance Classification Problems","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Classifier (UML); Machine learning; Artificial intelligence; Labeled data; Benchmark (surveying); Data mining; Semi-supervised learning; Pattern recognition (psychology)","score_opus":0.03955656413195239,"score_gpt":0.2687729767789352,"score_spread":0.2292164126469828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763798028","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.0032912756,0.00058962737,0.99516064,0.00016959306,0.000031766947,0.000056655776,0.00004387653,0.0003545159,0.00030202483],"genre_scores_gemma":[0.27814317,0.0009882122,0.7174439,0.00047152198,0.00042592286,0.0005958431,0.0006437205,0.00022751378,0.001060113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99345267,0.0031741206,0.00050293194,0.0011347007,0.0014271302,0.00030837464],"domain_scores_gemma":[0.9856365,0.010564955,0.000961474,0.001389182,0.0011239125,0.00032410023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008978629,0.0019874005,0.0036210231,0.0023021968,0.0008369216,0.003691455,0.0044881376,0.002446756,0.0018195854],"category_scores_gemma":[0.023273863,0.0009497567,0.0018606625,0.0032752485,0.0015891341,0.004837279,0.0034606564,0.005483998,0.00057015836],"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.00025174333,0.00036555855,0.0022369546,0.0005638966,0.00033587226,0.00013287668,0.00043337932,0.5978517,0.0028727367,0.056383528,0.005032536,0.3335393],"study_design_scores_gemma":[0.000006629283,0.000026133546,0.00007747029,0.000010374695,0.000016306345,0.000017135235,0.000012324957,0.98341006,0.00047532513,0.015421353,0.00052001525,0.0000069008556],"about_ca_topic_score_codex":0.0022061456,"about_ca_topic_score_gemma":0.0021097872,"teacher_disagreement_score":0.008978629,"about_ca_system_score_codex":0.0017818918,"about_ca_system_score_gemma":0.0014781527,"threshold_uncertainty_score":0.0474841},"labels":[],"label_agreement":null},{"id":"W2767121203","doi":"10.1016/j.jcss.2017.09.008","title":"Recognizable series on graphs and hypergraphs","year":2017,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hypergraph; Series (stratigraphy); Mathematics; Closure (psychology); Combinatorics; Learnability; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.015798208545533283,"score_gpt":0.2544205664885582,"score_spread":0.23862235794302492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767121203","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.19605285,0.0005668512,0.7686797,0.0008927113,0.00048265472,0.000109874345,0.0009829963,0.0030218645,0.029210588],"genre_scores_gemma":[0.8334976,0.00078107684,0.12767844,0.0003028464,0.0004854564,0.000120143064,0.0020001011,0.0007324411,0.034401864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993992,0.00014007022,0.00005151805,0.00019864486,0.00015231603,0.00005838144],"domain_scores_gemma":[0.9957379,0.0020147623,0.0006522898,0.00064641045,0.0006625627,0.000286043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056890387,0.00057385856,0.0006222957,0.0022185114,0.00060756935,0.0022698087,0.00096506695,0.0009074407,0.009106996],"category_scores_gemma":[0.005917966,0.00037006242,0.0006297118,0.001898132,0.0011564917,0.0043057124,0.0011198167,0.0014389546,0.0013232286],"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.00014038292,0.00007521935,0.0022143712,0.00016140079,0.00003083436,0.00055839674,0.00068176055,0.018003741,0.006400435,0.8787731,0.0071805282,0.08577986],"study_design_scores_gemma":[0.000014644144,0.000041213814,0.00055183034,0.000029973766,0.000019959254,0.00030188984,0.00015062782,0.090203136,0.0021978908,0.8978862,0.008586101,0.000016574539],"about_ca_topic_score_codex":0.000877205,"about_ca_topic_score_gemma":0.0011791656,"teacher_disagreement_score":0.009106996,"about_ca_system_score_codex":0.0007471898,"about_ca_system_score_gemma":0.0003251505,"threshold_uncertainty_score":0.0304659},"labels":[],"label_agreement":null},{"id":"W2767578565","doi":"10.5539/elt.v10n12p196","title":"The Acquisition of English Word Stress by Mandarin EFL Learners","year":2017,"lang":"en","type":"article","venue":"English Language Teaching","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Syllabic verse; Syllable; Linguistics; Stress (linguistics); Psychology; Mandarin Chinese; Phonology; Word (group theory); Syntax; Second-language acquisition; Word recognition; Reading (process)","score_opus":0.00514556056776243,"score_gpt":0.25655694510514293,"score_spread":0.2514113845373805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767578565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9996613,0.000014775406,0.00002617534,0.0000059275794,3.5806016e-7,0.0000012254635,0.00000731585,0.0000012730013,0.00028163963],"genre_scores_gemma":[0.9990841,0.000055230936,0.00018586157,0.000013232638,0.0000013719441,0.000005862631,0.000030222376,0.0000031992734,0.0006208777],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99971956,0.000066838395,0.00002694375,0.000059247403,0.00007841449,0.00004902193],"domain_scores_gemma":[0.9986712,0.0005434741,0.00029535542,0.00008995984,0.00026031685,0.00013965779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004696026,0.00025121192,0.00024144979,0.00047893258,0.00032055916,0.00078264927,0.00016914055,0.0002782057,0.0013275677],"category_scores_gemma":[0.002455754,0.00023600955,0.00009142588,0.00024889768,0.00053914037,0.00052757165,0.00049910124,0.00036494408,0.0004019327],"study_design_candidate":"observational","study_design_consensus":"observational","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.000595722,0.00047847914,0.6629612,0.00017067793,0.00003825247,0.0018529425,0.07778265,0.00019279776,0.16184098,0.00041345425,0.00029108566,0.0933817],"study_design_scores_gemma":[0.000013623417,0.00086638425,0.9568126,0.000022129168,0.000022340133,0.0012797816,0.019491117,0.00048013852,0.018995237,0.00034527815,0.0016343674,0.00003697575],"about_ca_topic_score_codex":0.0019116129,"about_ca_topic_score_gemma":0.0029888533,"teacher_disagreement_score":0.0019116129,"about_ca_system_score_codex":0.00020663811,"about_ca_system_score_gemma":0.00029852943,"threshold_uncertainty_score":0.0044412017},"labels":[],"label_agreement":null},{"id":"W2774221743","doi":"10.1016/j.tcs.2017.11.024","title":"On the teaching complexity of linear sets","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Computer science; Theoretical computer science; Discrete mathematics; Combinatorics; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.03139846617734175,"score_gpt":0.31474211638168936,"score_spread":0.2833436502043476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774221743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3574133,0.0024555493,0.35085502,0.030218402,0.00061239715,0.00019691166,0.0006671321,0.0009150856,0.2566662],"genre_scores_gemma":[0.9491891,0.00060821045,0.02903022,0.00062002975,0.00038615032,0.00017022135,0.00041208675,0.00023623972,0.019347709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634486,0.0017104715,0.0001353111,0.00049261976,0.00090280164,0.00041399035],"domain_scores_gemma":[0.90621984,0.08329371,0.0020968348,0.0035391445,0.0028237784,0.002026597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025633983,0.00058061746,0.0010589149,0.0008652239,0.0019123298,0.0037685237,0.0018534368,0.002018133,0.02539357],"category_scores_gemma":[0.05499872,0.0006628382,0.00096175476,0.0013133604,0.0029500243,0.010722975,0.0039865845,0.004761907,0.0015143054],"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.00033720015,0.00023834982,0.0020855477,0.00020464924,0.000031885407,0.00005216652,0.0008127501,0.02415902,0.0012065829,0.916215,0.008897366,0.04575945],"study_design_scores_gemma":[0.00006058745,0.000052002015,0.00074732903,0.00003419387,0.000019688408,0.00003546087,0.00017838644,0.07676372,0.00093183544,0.9175984,0.0035639629,0.0000144006935],"about_ca_topic_score_codex":0.002967904,"about_ca_topic_score_gemma":0.0038222151,"teacher_disagreement_score":0.02539357,"about_ca_system_score_codex":0.005165858,"about_ca_system_score_gemma":0.0025471407,"threshold_uncertainty_score":0.08494997},"labels":[],"label_agreement":null},{"id":"W2794548123","doi":"10.1109/access.2018.2820501","title":"Higher-Fidelity Frugal and Accurate Quantile Estimation Using a Novel Incremental &lt;italic&gt;Discretized&lt;/italic&gt; Paradigm","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantile; Estimator; Computer science; Context (archaeology); Mathematics; Statistics; Algorithm","score_opus":0.04662587225730297,"score_gpt":0.34258136673280587,"score_spread":0.2959554944755029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794548123","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.0015730988,0.000086872904,0.9973736,0.00008782847,0.000017979457,0.000015890497,0.000035014033,0.00016380078,0.0006459569],"genre_scores_gemma":[0.22592413,0.0005099413,0.7685825,0.00034196308,0.0002658111,0.00015863203,0.0003894763,0.0002357532,0.0035918294],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984263,0.00043108794,0.00007635338,0.0003005174,0.00063648756,0.00012911035],"domain_scores_gemma":[0.99683595,0.0015850763,0.00028600584,0.0006830735,0.00049320154,0.00011668737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021511335,0.0006754581,0.0010096782,0.00085550116,0.00042389994,0.0017895092,0.0035863328,0.0013052728,0.0040848036],"category_scores_gemma":[0.0109472005,0.0005409198,0.0007634792,0.0011891305,0.0012631827,0.0024457218,0.0032097981,0.0025044635,0.0014314144],"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.00031455673,0.00016442307,0.001931576,0.0002125817,0.000068129855,0.00032000183,0.00044395667,0.36692885,0.019351354,0.23092903,0.008062165,0.3712733],"study_design_scores_gemma":[0.000012114459,0.000031301206,0.00014575715,0.000008729979,0.0000064869205,0.00006554776,0.000011354344,0.9743936,0.0015250095,0.021279328,0.0025075066,0.000013227513],"about_ca_topic_score_codex":0.0038156104,"about_ca_topic_score_gemma":0.002885642,"teacher_disagreement_score":0.0040848036,"about_ca_system_score_codex":0.0010316137,"about_ca_system_score_gemma":0.000980338,"threshold_uncertainty_score":0.0136650205},"labels":[],"label_agreement":null},{"id":"W2794774656","doi":"10.48550/arxiv.1803.08988","title":"Evaluating Sentence-Level Relevance Feedback for High-Recall Information Retrieval","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"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":"Relevance feedback; Relevance (law); Recall; Computer science; Sentence; Baseline (sea); Precision and recall; Information retrieval; Natural language processing; Artificial intelligence; Cognitive psychology; Psychology; Image retrieval","score_opus":0.11993929458410046,"score_gpt":0.24713628233344087,"score_spread":0.1271969877493404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794774656","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.48807633,0.0029889278,0.5010241,0.00059675856,0.00014526231,0.0004608588,0.00024174197,0.0019422143,0.004523784],"genre_scores_gemma":[0.9323431,0.00021067253,0.06599746,0.000097613796,0.000039866438,0.0001614634,0.00024019116,0.000044011875,0.00086556154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99470335,0.0033750471,0.00020861477,0.000588887,0.00093983836,0.00018427614],"domain_scores_gemma":[0.95107985,0.04122498,0.0016417651,0.001875906,0.0035617293,0.0006157324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010588777,0.00079439685,0.0012148254,0.0007623702,0.00043870058,0.0011801308,0.0016472843,0.0016702731,0.00136065],"category_scores_gemma":[0.058205742,0.0003899247,0.00040430282,0.0006438479,0.00062225515,0.0022403072,0.0007876397,0.000949773,0.0007207446],"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.0030466088,0.0015727567,0.009032207,0.0009358735,0.00035431384,0.00013095055,0.0003533626,0.7203172,0.029051157,0.004853061,0.002900921,0.22745155],"study_design_scores_gemma":[0.00015746089,0.0010579401,0.0011416283,0.000015172028,0.00004083716,0.000050944665,0.000025695372,0.98581076,0.009105441,0.0021308532,0.00044214263,0.000021183252],"about_ca_topic_score_codex":0.0034094802,"about_ca_topic_score_gemma":0.0044109826,"teacher_disagreement_score":0.010588777,"about_ca_system_score_codex":0.0014484877,"about_ca_system_score_gemma":0.0014642795,"threshold_uncertainty_score":0.055999517},"labels":[],"label_agreement":null},{"id":"W27961112","doi":"","title":"Zero-data learning of new tasks","year":2008,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":353,"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 Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Generalization; Zero (linguistics); Context (archaeology); Machine learning; Multi-task learning; Ranking (information retrieval); Perspective (graphical); Set (abstract data type); Task (project management); Mathematics","score_opus":0.04672579905843802,"score_gpt":0.2816601494586466,"score_spread":0.23493435040020857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27961112","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.020318933,0.00041121693,0.9733015,0.0014818064,0.00009249757,0.00012041118,0.0003033104,0.00035391052,0.0036164583],"genre_scores_gemma":[0.56205314,0.00063727255,0.4280892,0.0010430336,0.00026535394,0.0009884108,0.0016089687,0.00018807083,0.0051266495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930608,0.0032220194,0.00049899163,0.0017614671,0.0010152815,0.00044154635],"domain_scores_gemma":[0.97833383,0.012489448,0.0011697391,0.005776445,0.001288311,0.00094226364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008188944,0.0014139506,0.002122038,0.0013857966,0.0010467108,0.0034957295,0.0045025884,0.0025048389,0.004631037],"category_scores_gemma":[0.04014746,0.000833938,0.0025337527,0.0011729202,0.005294612,0.010747211,0.008456003,0.0059871282,0.0010809544],"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.000544221,0.00045476595,0.006862555,0.00068822235,0.00022753494,0.00047078513,0.0012084821,0.1898475,0.0023505697,0.6172179,0.0058697513,0.1742577],"study_design_scores_gemma":[0.000047149406,0.00010452944,0.0003383103,0.000062409104,0.000019867866,0.00010273647,0.00011172335,0.3747403,0.0011340008,0.6190491,0.004256999,0.00003298755],"about_ca_topic_score_codex":0.0012947601,"about_ca_topic_score_gemma":0.0012498403,"teacher_disagreement_score":0.008188944,"about_ca_system_score_codex":0.0016329266,"about_ca_system_score_gemma":0.0015631462,"threshold_uncertainty_score":0.04330784},"labels":[],"label_agreement":null},{"id":"W2799108077","doi":"10.1145/3209978.3210176","title":"A System for Efficient High-Recall Retrieval","year":2018,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Waterloo Institute for Nanotechnology, University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Google","keywords":"Computer science; Relevance feedback; Recall; Relevance (law); Information retrieval; Flexibility (engineering); Precision and recall; User interface; Search engine; Interface (matter); Human–computer interaction; World Wide Web; Image retrieval; Artificial intelligence","score_opus":0.009687290545810733,"score_gpt":0.24747372622263092,"score_spread":0.23778643567682017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799108077","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.014420459,0.00073570426,0.76902336,0.00043876562,0.0003267113,0.001455635,0.0022892754,0.20171915,0.009590997],"genre_scores_gemma":[0.13155454,0.0005061829,0.8185175,0.0011715504,0.00038679788,0.0018710685,0.0076508936,0.005744097,0.03259734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969999,0.00057203235,0.0004572041,0.00069201476,0.0011424136,0.00013641607],"domain_scores_gemma":[0.9930906,0.002309273,0.00037698602,0.0018528405,0.0019460722,0.00042427273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004420529,0.0015652856,0.0014011674,0.0025246812,0.001574233,0.0031474584,0.0026924387,0.0026977025,0.03322556],"category_scores_gemma":[0.011598651,0.0010765315,0.00080770714,0.0014387079,0.00050888746,0.0050052754,0.0035010488,0.0016723751,0.034851387],"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.0020667708,0.0008549302,0.002839238,0.0010507966,0.00019152815,0.00072727434,0.0011810161,0.0022210588,0.12697677,0.0071821525,0.1358022,0.7189064],"study_design_scores_gemma":[0.0012829473,0.002465382,0.009093066,0.00037547603,0.00045836426,0.005317603,0.00046815054,0.20382133,0.22911309,0.019037148,0.52756983,0.0009976958],"about_ca_topic_score_codex":0.0016068239,"about_ca_topic_score_gemma":0.0013697161,"teacher_disagreement_score":0.03322556,"about_ca_system_score_codex":0.00055774,"about_ca_system_score_gemma":0.0012034636,"threshold_uncertainty_score":0.11115056},"labels":[],"label_agreement":null},{"id":"W2802936684","doi":"10.1007/s10589-018-0007-1","title":"A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions","year":2018,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Mathematics; Piecewise linear function; Adjacency matrix; Vertex (graph theory); Bivariate analysis; Time complexity; Graph; Algorithm; Combinatorics; Discrete mathematics","score_opus":0.00804029159818934,"score_gpt":0.25733657941712923,"score_spread":0.2492962878189399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802936684","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.0034739387,0.000052106498,0.9945522,0.000065352884,0.000042100015,0.000036765032,0.00003268453,0.0008433645,0.0009014481],"genre_scores_gemma":[0.11941921,0.00007700582,0.87642765,0.000083263534,0.00005166757,0.00014719198,0.00026848644,0.0004054566,0.003120006],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946195,0.00011052277,0.000033452692,0.00011116038,0.00020980097,0.000073102594],"domain_scores_gemma":[0.99861825,0.00063658046,0.000078669924,0.00022555255,0.00032600688,0.00011488281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010448721,0.00120859,0.0011456568,0.0010570005,0.00064872525,0.00161213,0.0016031326,0.0012381485,0.012092568],"category_scores_gemma":[0.0061824573,0.0006626624,0.00073544384,0.0012937981,0.0008618458,0.001616109,0.0028000122,0.0022070128,0.0034001882],"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.00063540763,0.00024321579,0.0011245413,0.0002185787,0.00009122568,0.00017743433,0.00016562942,0.2531411,0.01245373,0.0766845,0.011303981,0.6437607],"study_design_scores_gemma":[0.00006781898,0.000050517363,0.00015379334,0.000008482756,0.000013966185,0.000051212817,0.000027907408,0.97681993,0.002955596,0.01805343,0.0017827236,0.000014590308],"about_ca_topic_score_codex":0.00420136,"about_ca_topic_score_gemma":0.006192174,"teacher_disagreement_score":0.012092568,"about_ca_system_score_codex":0.0011227203,"about_ca_system_score_gemma":0.0024504508,"threshold_uncertainty_score":0.040453672},"labels":[],"label_agreement":null},{"id":"W2804232618","doi":"10.48550/arxiv.1806.02252","title":"Causal Bandits with Propagating Inference","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Regret; Causal inference; Graph; Combinatorics; Upper and lower bounds; Inference; Mathematics; Discrete mathematics; Causal structure; Theoretical computer science; Algorithm; Computer science; Artificial intelligence","score_opus":0.03907063994759458,"score_gpt":0.18555713445719135,"score_spread":0.14648649450959678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804232618","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.012849974,0.0010360057,0.9785792,0.0012116375,0.00018038035,0.00021336657,0.0004747203,0.0014846063,0.003970168],"genre_scores_gemma":[0.61781657,0.0013781774,0.36471424,0.0018235801,0.00065682014,0.0011277949,0.001443041,0.00044292293,0.01059687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951781,0.0026177308,0.00024102571,0.0009284393,0.00059363415,0.0004410261],"domain_scores_gemma":[0.9704851,0.024096612,0.0017594802,0.0022708157,0.0008980639,0.0004899759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007915342,0.0025091032,0.0037877725,0.0020108253,0.0015184568,0.0025362896,0.0039741136,0.003953321,0.009028893],"category_scores_gemma":[0.033877198,0.0015087654,0.0019069931,0.0025006414,0.0031043917,0.0051765665,0.0027806317,0.0054640924,0.001522607],"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.00063863525,0.0001773076,0.0014163778,0.00036582968,0.00020114207,0.00015462581,0.00013088064,0.7264917,0.0006475865,0.19479617,0.00636747,0.068612285],"study_design_scores_gemma":[0.00006646403,0.000034389628,0.00009972439,0.000028157192,0.000031089276,0.000016873053,0.000010341407,0.89628756,0.00032734653,0.10211986,0.0009640869,0.000014187196],"about_ca_topic_score_codex":0.006859846,"about_ca_topic_score_gemma":0.008564839,"teacher_disagreement_score":0.009028893,"about_ca_system_score_codex":0.0031038034,"about_ca_system_score_gemma":0.003477877,"threshold_uncertainty_score":0.04186088},"labels":[],"label_agreement":null},{"id":"W2804233805","doi":"10.48550/arxiv.1709.06181","title":"On Nesting Monte Carlo Estimators","year":2017,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":45,"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 British Columbia","funders":"Air Force Research Laboratory; Institute for Information and Communications Technology Promotion; Defense Advanced Research Projects Agency; Ministry of Science, ICT and Future Planning; European Commission; University of Oxford; Nvidia","keywords":"Estimator; Nesting (process); Monte Carlo method; Convergence (economics); Computer science; Mathematical optimization; Rate of convergence; Applied mathematics; Bayesian probability; Mathematics; Econometrics; Statistics; Artificial intelligence","score_opus":0.05383123295369001,"score_gpt":0.19286674453687003,"score_spread":0.13903551158318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804233805","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.001617313,0.00015787613,0.9969886,0.00014268853,0.000019274526,0.000038007565,0.000015937017,0.000072635514,0.0009477249],"genre_scores_gemma":[0.15364929,0.00054029986,0.84125435,0.0006048957,0.00018982578,0.00070519885,0.00017493425,0.00031676426,0.0025645136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97316825,0.02058129,0.0008065354,0.0015355039,0.0033080787,0.0006003657],"domain_scores_gemma":[0.8321945,0.14402011,0.0051143696,0.01182313,0.0056408844,0.0012069764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.045860715,0.0015592782,0.0023072525,0.0021173893,0.0013920703,0.0029401877,0.0037736115,0.0034797534,0.0048644273],"category_scores_gemma":[0.2218518,0.0016791167,0.0016801938,0.0018523971,0.0054393653,0.007228321,0.005273842,0.006582135,0.0010742812],"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.00008101566,0.00006284465,0.0018575522,0.00016929036,0.00007917683,0.00011791645,0.0003611913,0.13741101,0.000839896,0.82454264,0.0012908345,0.033186674],"study_design_scores_gemma":[0.000030237332,0.000051163177,0.00029239175,0.00010195032,0.000022587938,0.000071621565,0.000025615143,0.5959155,0.0005200431,0.40080333,0.0021438138,0.000021670297],"about_ca_topic_score_codex":0.003204991,"about_ca_topic_score_gemma":0.0029645308,"teacher_disagreement_score":0.045860715,"about_ca_system_score_codex":0.0023201872,"about_ca_system_score_gemma":0.0023368862,"threshold_uncertainty_score":0.24253756},"labels":[],"label_agreement":null},{"id":"W2805756377","doi":"","title":"Bootstrapped Self Training for Knowledge Base Population.","year":2015,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Training (meteorology); Computer science; Base (topology); Knowledge base; Population; Artificial intelligence; Mathematics; Geography; Demography; Sociology","score_opus":0.029526962935586886,"score_gpt":0.29601267893562133,"score_spread":0.26648571600003446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805756377","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.080033414,0.0008921553,0.904378,0.00054466707,0.00022165955,0.00047555164,0.0006164939,0.0030777978,0.009760204],"genre_scores_gemma":[0.6370212,0.00025063916,0.3512452,0.0005790192,0.00013940569,0.0007237195,0.0024193195,0.00028972919,0.0073317806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987691,0.0005025769,0.000063326945,0.00026659554,0.0002912656,0.00010716882],"domain_scores_gemma":[0.99371135,0.0034644224,0.0001676946,0.001156871,0.0013144732,0.0001851615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029403693,0.0004713141,0.000898827,0.0013574938,0.0007293622,0.0008176464,0.0025434156,0.0014693416,0.0055396156],"category_scores_gemma":[0.014171794,0.0004106015,0.000521269,0.0010049605,0.0007332852,0.0019975281,0.00181717,0.0012726671,0.0015930958],"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.0004365756,0.00058632455,0.004915712,0.00027046204,0.00011854579,0.00017862245,0.00037451976,0.21378778,0.0053659375,0.018864572,0.021385323,0.73371565],"study_design_scores_gemma":[0.000037733185,0.00010334708,0.00050795585,0.000034877194,0.000024537909,0.00007181852,0.00007448101,0.9821692,0.0026864712,0.011729571,0.0025527366,0.0000072913913],"about_ca_topic_score_codex":0.0025062605,"about_ca_topic_score_gemma":0.004007401,"teacher_disagreement_score":0.0055396156,"about_ca_system_score_codex":0.00061112357,"about_ca_system_score_gemma":0.0010272954,"threshold_uncertainty_score":0.018531919},"labels":[],"label_agreement":null},{"id":"W2808279896","doi":"10.24963/ijcai.2018/411","title":"Cost-Effective Active Learning for Hierarchical Multi-Label Classification","year":2018,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Machine learning; Exploit; Selection (genetic algorithm); Artificial intelligence; Active learning (machine learning); Annotation; Multi-label classification; Hierarchy; Labeled data","score_opus":0.06644345468817692,"score_gpt":0.3616965684584418,"score_spread":0.29525311377026486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808279896","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.013017081,0.00030307958,0.98498744,0.00025688912,0.000030710424,0.000074989424,0.00007054615,0.0007221274,0.0005371203],"genre_scores_gemma":[0.5660241,0.00027372479,0.42820367,0.0005909571,0.00023121557,0.00048683115,0.0007780875,0.00024563758,0.0031656404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968466,0.0014048963,0.00014531416,0.00061670115,0.00073933206,0.00024700552],"domain_scores_gemma":[0.9898801,0.0071629058,0.0005772247,0.001039514,0.0010247593,0.00031553023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052575446,0.0014063771,0.002178733,0.0015272653,0.0010444107,0.0017180566,0.005469539,0.0027639172,0.0021617252],"category_scores_gemma":[0.010385428,0.0007015931,0.0011416586,0.0018540642,0.001720114,0.0039603887,0.0026807308,0.0032341764,0.0006460777],"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.0007233792,0.000697499,0.0026053127,0.00027101737,0.00014111809,0.00019571585,0.00050360383,0.53303784,0.012349921,0.029344995,0.0068871095,0.4132424],"study_design_scores_gemma":[0.000012214266,0.000023105418,0.00005315825,0.0000032449138,0.0000064385104,0.00001090685,0.0000119653705,0.9918493,0.0010105183,0.006804565,0.00020957214,0.0000048838547],"about_ca_topic_score_codex":0.003752334,"about_ca_topic_score_gemma":0.0048644342,"teacher_disagreement_score":0.005469539,"about_ca_system_score_codex":0.0016081234,"about_ca_system_score_gemma":0.0014700344,"threshold_uncertainty_score":0.027804911},"labels":[],"label_agreement":null},{"id":"W2809142577","doi":"10.1007/978-3-319-95582-7_6","title":"FSM Inference from Long Traces","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Computer Research Institute of Montréal","funders":"","keywords":"Inference; Computer science; Artificial intelligence","score_opus":0.014782738002180601,"score_gpt":0.26112970838910887,"score_spread":0.24634697038692827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809142577","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.009823098,0.00044610686,0.98227525,0.0005822643,0.00012600781,0.000036489317,0.00068082754,0.0029918926,0.003038072],"genre_scores_gemma":[0.4379785,0.0009836842,0.5372673,0.00045285947,0.00040559063,0.0001780012,0.0049432875,0.0014301988,0.0163605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983569,0.00045332397,0.00009593084,0.00045293377,0.0005066347,0.0001342488],"domain_scores_gemma":[0.9856689,0.011629261,0.00026641446,0.0015977758,0.0006745652,0.0001631749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002268606,0.0009135881,0.0011007058,0.0024011082,0.00091016834,0.0015554286,0.002521086,0.0017509792,0.0110045895],"category_scores_gemma":[0.020673929,0.0008527897,0.0017541626,0.0017255257,0.0013955422,0.0055947723,0.002789084,0.003161418,0.0021334125],"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.0003872317,0.0001383307,0.0025076217,0.0005278751,0.00021092792,0.00041311863,0.0003507803,0.19802907,0.0037988343,0.24438772,0.014735404,0.5345131],"study_design_scores_gemma":[0.000019057212,0.000015344755,0.00021966819,0.00006875723,0.00002876497,0.000072674215,0.00003212271,0.54175895,0.0023777075,0.4517584,0.0036351355,0.000013465909],"about_ca_topic_score_codex":0.0043476773,"about_ca_topic_score_gemma":0.007999622,"teacher_disagreement_score":0.0110045895,"about_ca_system_score_codex":0.0014136591,"about_ca_system_score_gemma":0.0015153886,"threshold_uncertainty_score":0.036814034},"labels":[],"label_agreement":null},{"id":"W2809900044","doi":"10.48550/arxiv.1807.01406","title":"Connecting Weighted Automata and Recurrent Neural Networks through Spectral Learning","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"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; Université de Montréal","funders":"","keywords":"Automaton; Artificial neural network; Computer science; Recurrent neural network; Artificial intelligence","score_opus":0.043685239089459,"score_gpt":0.20640078455424596,"score_spread":0.16271554546478695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809900044","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.015795268,0.00015345989,0.9822005,0.00012446205,0.000033572673,0.000019455292,0.000033704586,0.0002650022,0.0013746036],"genre_scores_gemma":[0.71408445,0.0004114691,0.28117657,0.00021996329,0.000097110365,0.00021132472,0.00017775192,0.00018510035,0.0034362124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877304,0.0005134688,0.00006752391,0.00032486895,0.00023471355,0.0000864262],"domain_scores_gemma":[0.9947807,0.0037378771,0.0004191451,0.00048288872,0.0004585811,0.000120801305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017084057,0.0007816208,0.0007940627,0.0008307948,0.00060646806,0.0014425417,0.0015689073,0.0013213167,0.0028419625],"category_scores_gemma":[0.012110273,0.0005809906,0.0006335244,0.0006986494,0.002182541,0.0042569814,0.0023205434,0.0017994643,0.00054008054],"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.000078299636,0.000047221867,0.0009372562,0.00015490367,0.000056440695,0.00014234523,0.000284014,0.6081524,0.0033374217,0.3297155,0.0007171757,0.056377072],"study_design_scores_gemma":[0.0000036045967,0.000022914144,0.000044146782,0.000009412182,0.0000048275974,0.000021893793,0.000015479327,0.85670364,0.0006742641,0.14193256,0.00055950537,0.000007708751],"about_ca_topic_score_codex":0.0016494917,"about_ca_topic_score_gemma":0.0019280454,"teacher_disagreement_score":0.0028419625,"about_ca_system_score_codex":0.0008020664,"about_ca_system_score_gemma":0.00070525164,"threshold_uncertainty_score":0.009507239},"labels":[],"label_agreement":null},{"id":"W2884970704","doi":"10.1109/focs.2018.00040","title":"Classical Lower Bounds from Quantum Upper Bounds","year":2018,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"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":"Mathematics; Upper and lower bounds; Combinatorics; Communication complexity; Boolean function; Degree (music); Omega; Rank (graph theory); Logarithm; Discrete mathematics; Function (biology); Corollary; Quantum","score_opus":0.009691478543210699,"score_gpt":0.25529293275464887,"score_spread":0.24560145421143817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884970704","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.03279095,0.003823892,0.857827,0.008962196,0.00085885957,0.00019168168,0.0010914556,0.001221482,0.09323255],"genre_scores_gemma":[0.73717105,0.0044590677,0.21754293,0.0059628813,0.0029480467,0.0013807088,0.0014125257,0.002015664,0.027107071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9860606,0.0025860728,0.00054298376,0.0028010437,0.0059202877,0.0020890285],"domain_scores_gemma":[0.9547376,0.029885901,0.0015300103,0.009457423,0.0032147635,0.0011743204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006362844,0.0025392082,0.0025686559,0.0029878416,0.0036676095,0.00723072,0.0048742127,0.0035392446,0.022965962],"category_scores_gemma":[0.04589504,0.0013508989,0.0037930773,0.0036564001,0.008735915,0.024681855,0.009695209,0.015138185,0.004352814],"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.00025708432,0.00013435095,0.00067474874,0.00032017674,0.000056324025,0.00008872132,0.00023507478,0.032457024,0.004059792,0.9299602,0.00708102,0.024675483],"study_design_scores_gemma":[0.000023068516,0.000046243484,0.00024018217,0.000062318155,0.000029517072,0.00008698266,0.000047185964,0.08627262,0.0035979124,0.90262413,0.0069295675,0.000040325474],"about_ca_topic_score_codex":0.0021814115,"about_ca_topic_score_gemma":0.0019599893,"teacher_disagreement_score":0.022965962,"about_ca_system_score_codex":0.0067218817,"about_ca_system_score_gemma":0.0027649873,"threshold_uncertainty_score":0.07682884},"labels":[],"label_agreement":null},{"id":"W2885413928","doi":"","title":"Refresh Strategies in Continuous Active Learning","year":2018,"lang":"en","type":"article","venue":"UWSpace (University of Waterloo)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Computer science","score_opus":0.0075878469554151815,"score_gpt":0.2072648149955474,"score_spread":0.1996769680401322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885413928","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.021922093,0.0013594594,0.97180057,0.0006159518,0.00010090747,0.00032127407,0.00012697824,0.0019201594,0.0018325845],"genre_scores_gemma":[0.34202966,0.0005245271,0.65302277,0.0004810068,0.00015704749,0.00072325184,0.00035960204,0.00020498251,0.0024972446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933014,0.0034841562,0.0006417074,0.0011017709,0.0012409169,0.00023004183],"domain_scores_gemma":[0.9486401,0.04030825,0.0017609567,0.0055143926,0.0029564141,0.0008198156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014338231,0.0010513184,0.0017262232,0.002052492,0.0007159458,0.0025588814,0.0049065836,0.0022276328,0.005371236],"category_scores_gemma":[0.07376045,0.001024002,0.0009038054,0.00175358,0.0019334649,0.005456254,0.0039193947,0.0026190472,0.0014829033],"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.0010768246,0.0006037288,0.0036567564,0.00067588186,0.00021135151,0.00021070588,0.0013701993,0.18157619,0.007035695,0.059857037,0.0055988426,0.73812675],"study_design_scores_gemma":[0.00027131152,0.0003309801,0.00047290552,0.00007323431,0.000060061633,0.00010457428,0.00012685629,0.91985816,0.0038384788,0.070535995,0.004291229,0.000036219197],"about_ca_topic_score_codex":0.0027472484,"about_ca_topic_score_gemma":0.003280575,"teacher_disagreement_score":0.014338231,"about_ca_system_score_codex":0.0012057419,"about_ca_system_score_gemma":0.0014145264,"threshold_uncertainty_score":0.07582867},"labels":[],"label_agreement":null},{"id":"W2891786606","doi":"","title":"Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":34,"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 British Columbia; University of Waterloo; McMaster University","funders":"","keywords":"Upper and lower bounds; Compression (physics); Sample complexity; Mixture model; Matching (statistics); Sample (material); Mathematics; Data compression; Combinatorics; Algorithm; Computer science; Statistics; Artificial intelligence; Physics; Mathematical analysis","score_opus":0.025119302185203602,"score_gpt":0.2861917601460713,"score_spread":0.2610724579608677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891786606","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.029136596,0.0015005426,0.9612257,0.0016531285,0.00008392094,0.00016484676,0.00034206788,0.0008718448,0.0050214357],"genre_scores_gemma":[0.49921665,0.0024289603,0.48630643,0.0015298142,0.000710804,0.0011836734,0.0018961971,0.0007827876,0.0059446767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99260086,0.002092334,0.00050781836,0.0012739855,0.0027220352,0.0008029709],"domain_scores_gemma":[0.9294038,0.058447413,0.0024002527,0.006008429,0.002388887,0.0013511985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009253108,0.0026145768,0.0031290893,0.0023995508,0.0013410687,0.0039593787,0.003853357,0.0032491123,0.0065871067],"category_scores_gemma":[0.08013211,0.0014316726,0.0022495268,0.0025552548,0.0042241034,0.01344106,0.007737068,0.008107519,0.001603393],"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.0010825142,0.00040020284,0.004108725,0.0005532887,0.00021580185,0.00025577296,0.000425713,0.5813641,0.0073830034,0.282316,0.006398329,0.1154966],"study_design_scores_gemma":[0.000039784543,0.000068256806,0.00033858084,0.00004129106,0.000020626274,0.00008384089,0.00002575146,0.8987802,0.001932339,0.097697966,0.0009459882,0.00002537099],"about_ca_topic_score_codex":0.002033097,"about_ca_topic_score_gemma":0.0022662717,"teacher_disagreement_score":0.009253108,"about_ca_system_score_codex":0.0041135065,"about_ca_system_score_gemma":0.0029182255,"threshold_uncertainty_score":0.04893571},"labels":[],"label_agreement":null},{"id":"W2892279490","doi":"10.1109/icra.2018.8460633","title":"Eager and Memory-Based Non-Parametric Stochastic Search Methods for Learning Control","year":2018,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parametric statistics; Controller (irrigation); Nonparametric statistics; Robot; Control (management); Artificial intelligence; Machine learning; Control engineering; Engineering; Mathematics","score_opus":0.016669341500843773,"score_gpt":0.3563884507545277,"score_spread":0.3397191092536839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892279490","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.013178412,0.00061326404,0.9850236,0.00010697826,0.000017628357,0.000018543518,0.000007887522,0.00015976558,0.0008739767],"genre_scores_gemma":[0.70653534,0.00079158874,0.28538004,0.00017645507,0.00007881481,0.0002693964,0.000052493117,0.00012259482,0.0065931953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994677,0.00024329819,0.0000309955,0.000086636384,0.00012852755,0.000042818643],"domain_scores_gemma":[0.99675566,0.0025342705,0.00022807127,0.00023544437,0.00018904293,0.00005757324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020509874,0.00072963577,0.0009559136,0.00051292457,0.00029086077,0.0007114205,0.0016206924,0.0013283311,0.0015614169],"category_scores_gemma":[0.007099016,0.00040676884,0.0004974524,0.0005567277,0.00147725,0.0014900217,0.0010637647,0.0017026553,0.0002909617],"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.000059325288,0.000053894542,0.0002969055,0.00007617452,0.000040602205,0.000025883903,0.00005614604,0.9065304,0.0014960103,0.030403217,0.0002767363,0.060684692],"study_design_scores_gemma":[0.0000068700806,0.00003686614,0.00004720042,0.0000047384815,0.000002978036,0.0000066475745,0.0000027475198,0.99362844,0.00054476404,0.0055177994,0.00019619317,0.0000047774543],"about_ca_topic_score_codex":0.0015584907,"about_ca_topic_score_gemma":0.0018467614,"teacher_disagreement_score":0.0020509874,"about_ca_system_score_codex":0.0006680402,"about_ca_system_score_gemma":0.00075881137,"threshold_uncertainty_score":0.010846734},"labels":[],"label_agreement":null},{"id":"W2892280284","doi":"10.1007/978-3-319-99927-2_10","title":"Conformance Testing and Inference of Embedded Components","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Programming language; Conformance testing; Inference; Software engineering; Artificial intelligence; Operating system; Standardization","score_opus":0.025218782383904632,"score_gpt":0.2671131487032797,"score_spread":0.24189436631937505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892280284","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.020409396,0.00025082016,0.9750323,0.00020666918,0.000056804605,0.00005817254,0.00013917706,0.0018023171,0.002044331],"genre_scores_gemma":[0.46398392,0.00031448342,0.5280586,0.00026151948,0.00018671587,0.00017770329,0.0013476853,0.0010399382,0.004629463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898734,0.0034235246,0.00062246434,0.0023884673,0.0030978858,0.0005942157],"domain_scores_gemma":[0.9521662,0.037421964,0.0013623958,0.006227692,0.0024607182,0.00036096625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058218995,0.0014542955,0.001524247,0.0025620537,0.00076233933,0.0021061131,0.0059235226,0.0025042456,0.005596805],"category_scores_gemma":[0.05176859,0.0013547332,0.0037721328,0.001713191,0.0034664432,0.0067056576,0.003772287,0.004550425,0.0011745217],"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.00097257015,0.00034178898,0.008673286,0.00078800844,0.0004371664,0.00088820234,0.0007975649,0.23680319,0.012644757,0.30989903,0.0058104703,0.42194387],"study_design_scores_gemma":[0.000032344797,0.00006788181,0.0006614793,0.00007577199,0.00007207811,0.0001679402,0.00005830432,0.50786185,0.007119994,0.48221937,0.0016393141,0.000023643906],"about_ca_topic_score_codex":0.0022026687,"about_ca_topic_score_gemma":0.0023549967,"teacher_disagreement_score":0.0059235226,"about_ca_system_score_codex":0.0010654452,"about_ca_system_score_gemma":0.0012524733,"threshold_uncertainty_score":0.030789495},"labels":[],"label_agreement":null},{"id":"W2895601233","doi":"10.1145/3209280.3209532","title":"Active High-Recall Information Retrieval from Domain-Specific Text Corpora based on Query Documents","year":2018,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Information retrieval; Ranking (information retrieval); Domain (mathematical analysis); Document retrieval; Class (philosophy); Artificial intelligence; Precision and recall; Active learning (machine learning); Natural language processing","score_opus":0.007305110214433513,"score_gpt":0.22415545718739618,"score_spread":0.21685034697296268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895601233","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.03762144,0.003479283,0.9465677,0.0005823289,0.00013100244,0.00039529504,0.00046363988,0.0071212035,0.0036380305],"genre_scores_gemma":[0.3527752,0.0023784616,0.6264937,0.0009130462,0.00055687834,0.0006544732,0.004393496,0.0005334482,0.011301346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966509,0.0009065261,0.00025892156,0.0007746102,0.0012589674,0.00015022693],"domain_scores_gemma":[0.99340135,0.0032240406,0.0006292089,0.0013514463,0.0012403756,0.00015364558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042754672,0.0012320745,0.0021363106,0.0053881416,0.001117832,0.0032424803,0.0031191201,0.0019880002,0.0024782065],"category_scores_gemma":[0.0109116025,0.0006169966,0.001171559,0.00368587,0.0011534947,0.007131976,0.0017275746,0.0015221178,0.0044201156],"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.00086676417,0.00081367523,0.0027257814,0.0011989012,0.0002299651,0.00046281854,0.00086243934,0.014075119,0.07925063,0.008344654,0.014479926,0.87668926],"study_design_scores_gemma":[0.00029434633,0.0013534218,0.0075264936,0.00022385675,0.00050236704,0.0028341804,0.00081520143,0.7709181,0.13729289,0.022091083,0.055841427,0.00030657658],"about_ca_topic_score_codex":0.001826581,"about_ca_topic_score_gemma":0.0029584358,"teacher_disagreement_score":0.0053881416,"about_ca_system_score_codex":0.0008400793,"about_ca_system_score_gemma":0.0009936198,"threshold_uncertainty_score":0.022611141},"labels":[],"label_agreement":null},{"id":"W2897647221","doi":"10.48550/arxiv.1810.10158","title":"Randomized Gradient Boosting Machine","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Booth University College","funders":"Office of Naval Research; National Science Foundation","keywords":"Boosting (machine learning); Computer science; Machine learning; Artificial intelligence; Gradient boosting; Algorithm; Fraction (chemistry)","score_opus":0.04777259867698978,"score_gpt":0.19363714060893675,"score_spread":0.14586454193194698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897647221","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.0034504419,0.00090585015,0.9913265,0.00038489452,0.0002195573,0.00008073411,0.00009835357,0.0009063405,0.0026273234],"genre_scores_gemma":[0.31819892,0.0017059605,0.6669463,0.0012745629,0.0007788447,0.0005360443,0.0010430182,0.00048392641,0.009032309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779665,0.001135334,0.00007529651,0.00031297584,0.00052648445,0.00015332109],"domain_scores_gemma":[0.99809295,0.0007939244,0.00016208865,0.0003826617,0.00045089662,0.0001174037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003045952,0.0012355438,0.002937318,0.0008633001,0.0005815404,0.0014938064,0.0020435504,0.0017104482,0.0029911988],"category_scores_gemma":[0.0094334595,0.00058267143,0.001054597,0.0012337868,0.0010917635,0.0012580581,0.001579352,0.0022342817,0.0024236308],"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.00023730514,0.00015048379,0.0018537478,0.000386723,0.0003020205,0.00015570743,0.00008587753,0.53044486,0.0032941436,0.14928466,0.030938461,0.28286603],"study_design_scores_gemma":[0.000035759163,0.00007216768,0.00021744566,0.00002718959,0.000025401945,0.00006624177,0.000006591877,0.94715476,0.00094015134,0.042339373,0.009098435,0.000016507904],"about_ca_topic_score_codex":0.0017967785,"about_ca_topic_score_gemma":0.0014706706,"teacher_disagreement_score":0.003045952,"about_ca_system_score_codex":0.0009770367,"about_ca_system_score_gemma":0.0016317555,"threshold_uncertainty_score":0.016108692},"labels":[],"label_agreement":null},{"id":"W2898297778","doi":"10.1016/j.artint.2018.08.005","title":"Probably bounded suboptimal heuristic search","year":2018,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bounded function; Heuristic; Mathematical optimization; Computer science; Incremental heuristic search; Mathematics; Artificial intelligence; Search algorithm; Beam search","score_opus":0.05176550724848589,"score_gpt":0.323414968421788,"score_spread":0.27164946117330213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898297778","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.046493884,0.0034742723,0.86750907,0.005830198,0.001011083,0.00024080677,0.0005570734,0.001662826,0.073220715],"genre_scores_gemma":[0.53396744,0.0008049041,0.43569928,0.0021989404,0.00039670695,0.00046350292,0.0009969998,0.00069611595,0.024776118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970126,0.0015416185,0.0001341312,0.00044415594,0.0005758059,0.0002915119],"domain_scores_gemma":[0.984775,0.011746696,0.00035193638,0.0020383582,0.0007593175,0.00032868524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035889563,0.0013987242,0.002378774,0.001321656,0.0016678396,0.002889393,0.0026907632,0.004673757,0.017939333],"category_scores_gemma":[0.03412867,0.0011391247,0.001396917,0.0018070594,0.0027233271,0.0036494911,0.0023046054,0.0037290142,0.0024716929],"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.0018285257,0.00033245477,0.0017793595,0.0008425352,0.00033215593,0.00037496394,0.00034100114,0.38482514,0.0019171064,0.39468488,0.060469083,0.15227284],"study_design_scores_gemma":[0.0001972216,0.00009420835,0.00024103634,0.000084796775,0.00006369509,0.00015613419,0.000070454036,0.6569169,0.0006750161,0.33660406,0.0048747617,0.000021703057],"about_ca_topic_score_codex":0.0025812208,"about_ca_topic_score_gemma":0.0048105423,"teacher_disagreement_score":0.017939333,"about_ca_system_score_codex":0.0021980237,"about_ca_system_score_gemma":0.0029609348,"threshold_uncertainty_score":0.060013056},"labels":[],"label_agreement":null},{"id":"W2898829623","doi":"10.1145/3274297","title":"MechanicalHeart","year":2018,"lang":"en","type":"article","venue":"Proceedings of the ACM on Human-Computer Interaction","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Health Sciences Centre; Sunnybrook Health Science Centre; William Osler Health System; University of Waterloo","funders":"","keywords":"Computer science; Machine learning; Artificial intelligence; Classifier (UML); Baseline (sea); Active listening; Human heart; Psychology","score_opus":0.040299478758984826,"score_gpt":0.32884027959061934,"score_spread":0.2885408008316345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898829623","genre_codex":"other","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.051776625,0.0044649323,0.16082926,0.007921044,0.008662971,0.0024653994,0.05733334,0.09664747,0.6098991],"genre_scores_gemma":[0.2852703,0.0024339613,0.09116206,0.0072091613,0.002918398,0.0020767148,0.08100851,0.011724569,0.5161963],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990049,0.000109499364,0.00005642724,0.00025875858,0.00044764,0.00012275387],"domain_scores_gemma":[0.9976674,0.00046489,0.0001060489,0.00063950755,0.00067418325,0.00044795137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015590125,0.0009719048,0.0007530374,0.00082286884,0.0010962281,0.0021164021,0.0017469907,0.0014102833,0.24680538],"category_scores_gemma":[0.0069547365,0.00040004877,0.0006464278,0.00065486075,0.00044542665,0.0021889368,0.0035995354,0.00092866534,0.15826285],"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.0009271962,0.00015364752,0.0048714154,0.00053871254,0.000052119827,0.0005121193,0.00045540495,0.00065332593,0.008674147,0.006196145,0.6426373,0.33432832],"study_design_scores_gemma":[0.00018016034,0.00030440226,0.014218874,0.0001833559,0.00004188096,0.00088609004,0.0002719922,0.004575024,0.003856576,0.005734853,0.9696574,0.00008932339],"about_ca_topic_score_codex":0.001687762,"about_ca_topic_score_gemma":0.0032893019,"teacher_disagreement_score":0.24680538,"about_ca_system_score_codex":0.00043880122,"about_ca_system_score_gemma":0.00082725455,"threshold_uncertainty_score":0.8256463},"labels":[],"label_agreement":null},{"id":"W2899114640","doi":"10.1137/1.9781611975482.44","title":"Testing Halfspaces over Rotation-Invariant Distributions","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"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":"Invariant (physics); Rotation (mathematics); Mathematics; Geometry; Mathematical physics","score_opus":0.04968396008981972,"score_gpt":0.2504123407981213,"score_spread":0.20072838070830157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899114640","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.061415102,0.0002898474,0.93389124,0.00035184718,0.00005126513,0.00010173979,0.00031048697,0.0010740685,0.0025143393],"genre_scores_gemma":[0.56215334,0.00023074694,0.43169534,0.00046641534,0.00010888576,0.00030715906,0.001761097,0.0002971772,0.0029798686],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967018,0.0009274819,0.00025149292,0.0008485742,0.001021337,0.00024924896],"domain_scores_gemma":[0.9815137,0.013874084,0.0009643958,0.00214643,0.0010115306,0.00048992207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035302558,0.0009244028,0.0013011743,0.0015403727,0.00066247385,0.001987638,0.0026050294,0.0017661958,0.0052092196],"category_scores_gemma":[0.028584745,0.0006058337,0.0012209319,0.0012286385,0.002457368,0.004924884,0.004307293,0.0018809036,0.001238566],"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.0015626183,0.00022787465,0.0149752,0.00034963625,0.0002696801,0.00035146694,0.0003897648,0.15397304,0.016088752,0.12384185,0.00762209,0.68034804],"study_design_scores_gemma":[0.0000819741,0.00020935775,0.0018360628,0.000058523554,0.000021684382,0.000320569,0.00013708769,0.8087119,0.009508075,0.17674126,0.0023305072,0.000043022425],"about_ca_topic_score_codex":0.00121367,"about_ca_topic_score_gemma":0.0007252406,"teacher_disagreement_score":0.0052092196,"about_ca_system_score_codex":0.00089456065,"about_ca_system_score_gemma":0.0011024808,"threshold_uncertainty_score":0.018669963},"labels":[],"label_agreement":null},{"id":"W2903118764","doi":"10.1007/978-3-030-19212-9_36","title":"Deep Inverse Optimization","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Concordia University","funders":"","keywords":"Computer science; Backpropagation; Leverage (statistics); Inverse; Inverse problem; Mathematical optimization; Parametric statistics; Optimization problem; Process (computing); Algorithm; Artificial intelligence; Set (abstract data type); Artificial neural network; Mathematics","score_opus":0.009558944436102227,"score_gpt":0.228805236371499,"score_spread":0.21924629193539677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903118764","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.0041391565,0.0023346301,0.8684162,0.00092269114,0.00072377146,0.00003339779,0.00032252158,0.0011068397,0.12200087],"genre_scores_gemma":[0.17258526,0.0036084608,0.4539334,0.00096449646,0.00067040144,0.00021165164,0.0016649341,0.0022508434,0.36411062],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998337,0.000027684262,0.0000059328036,0.00003699116,0.000077694946,0.000017882861],"domain_scores_gemma":[0.99986804,0.00004274137,0.00001028316,0.000032530992,0.00002974152,0.000016663414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002969905,0.00086123834,0.00092950324,0.00043492933,0.0003180532,0.000998293,0.0007223516,0.0009865594,0.023737779],"category_scores_gemma":[0.0008159178,0.00042091176,0.00062108703,0.0004781938,0.0006924252,0.0010057646,0.0018256675,0.0022223357,0.0076999194],"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.00009480654,0.00009215188,0.00020026151,0.00029379854,0.00007423667,0.000063361214,0.000050187227,0.16184357,0.006383914,0.3310054,0.06676939,0.433129],"study_design_scores_gemma":[0.000018432811,0.00004893835,0.0002253671,0.000097904005,0.000025064273,0.0001580575,0.00001997191,0.6666778,0.004770732,0.23991553,0.088013604,0.000028646771],"about_ca_topic_score_codex":0.0008574843,"about_ca_topic_score_gemma":0.0014463795,"teacher_disagreement_score":0.023737779,"about_ca_system_score_codex":0.00044380824,"about_ca_system_score_gemma":0.0005905975,"threshold_uncertainty_score":0.07941079},"labels":[],"label_agreement":null},{"id":"W2903822982","doi":"10.1038/s42256-018-0002-3","title":"Learnability can be undecidable","year":2018,"lang":"en","type":"article","venue":"Nature Machine Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Israel Science Foundation; Blavatnik Family Foundation","keywords":"Learnability; Undecidable problem; Axiom; Equivalence (formal languages); Computer science; Simple (philosophy); Theoretical computer science; Mathematical economics; Calculus (dental); Discrete mathematics; Mathematics; Artificial intelligence; Epistemology; Philosophy","score_opus":0.010662934815707872,"score_gpt":0.29627553176362165,"score_spread":0.2856125969479138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903822982","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.28414795,0.0023199944,0.4750483,0.056216117,0.0022715982,0.00038147235,0.0048932503,0.004947103,0.16977419],"genre_scores_gemma":[0.9313591,0.00097442546,0.034060605,0.0042021554,0.00095869135,0.0004514394,0.0031268909,0.0007760884,0.024090583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99408406,0.0010542703,0.00041780315,0.0016723523,0.0017650191,0.0010065149],"domain_scores_gemma":[0.94086814,0.047459744,0.0017596873,0.004816121,0.003774998,0.001321389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003663613,0.0012880646,0.0013124244,0.001655613,0.002879253,0.00619203,0.0031533423,0.0037860274,0.012849707],"category_scores_gemma":[0.037952967,0.0011468754,0.0027126432,0.0017858036,0.008218228,0.01751988,0.005508211,0.0118688475,0.0015830857],"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.00018482697,0.00015964078,0.0013129784,0.00032147518,0.00007220803,0.00031068773,0.0004797626,0.008978446,0.0009512417,0.9568822,0.012013293,0.01833309],"study_design_scores_gemma":[0.000028317178,0.000009022774,0.000074533506,0.000017739594,0.000016234691,0.000052134146,0.000050541767,0.0065944986,0.00057231303,0.99063826,0.0019360298,0.000010405195],"about_ca_topic_score_codex":0.0027192573,"about_ca_topic_score_gemma":0.002697228,"teacher_disagreement_score":0.012849707,"about_ca_system_score_codex":0.0033177352,"about_ca_system_score_gemma":0.0030760816,"threshold_uncertainty_score":0.04298657},"labels":[],"label_agreement":null},{"id":"W2904474531","doi":"10.1609/aaai.v33i01.33013143","title":"An Exponential Tail Bound for the Deleted Estimate","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"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":"Generalization; Stability (learning theory); Mathematics; Exponential function; Applied mathematics; Upper and lower bounds; Computation; Distribution (mathematics); Exponential family; Computer science; Mathematical analysis; Algorithm; Machine learning","score_opus":0.04738441104690382,"score_gpt":0.31718142633747964,"score_spread":0.2697970152905758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904474531","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.019353272,0.0019427794,0.96727896,0.0028199325,0.00018127242,0.0001004647,0.0002997486,0.00043758354,0.007585904],"genre_scores_gemma":[0.6822454,0.0057673166,0.27978697,0.0048190374,0.0014645355,0.0010076725,0.0017362844,0.0015204393,0.021652384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919264,0.00241099,0.00042359997,0.0020284485,0.0025070496,0.0007036155],"domain_scores_gemma":[0.87985766,0.09349077,0.0046397303,0.009832402,0.010360337,0.0018191047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01421363,0.0024651296,0.0021956135,0.0025108256,0.0014270438,0.0040943995,0.0060555097,0.00335429,0.008484288],"category_scores_gemma":[0.13390017,0.0010743487,0.0023523073,0.00149397,0.006005062,0.014530634,0.007740474,0.012632702,0.00258154],"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.0008311254,0.00023208286,0.007333373,0.00077282713,0.0002830989,0.00085241307,0.0010782736,0.22639109,0.012349876,0.66523373,0.010238965,0.07440312],"study_design_scores_gemma":[0.000042494183,0.00018823575,0.0012683087,0.00022498178,0.000092810245,0.00040391635,0.00010142052,0.6560398,0.0062555163,0.33027002,0.005037188,0.00007542938],"about_ca_topic_score_codex":0.0018462595,"about_ca_topic_score_gemma":0.0015035106,"teacher_disagreement_score":0.01421363,"about_ca_system_score_codex":0.0048665763,"about_ca_system_score_gemma":0.002365137,"threshold_uncertainty_score":0.0751698},"labels":[],"label_agreement":null},{"id":"W2904565525","doi":"10.1016/j.aam.2019.06.001","title":"Complexity of model testing for dynamical systems with toric steady states","year":2019,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Euclidean space; Euclidean geometry; Dynamical systems theory; Degree (music); Invariant (physics); Euclidean distance; Computer science; Mathematical optimization; Optimization problem; Computational complexity theory; Applied mathematics; Mathematics; Algorithm; Artificial intelligence; Pure mathematics; Physics","score_opus":0.04423710264542948,"score_gpt":0.30535899887708606,"score_spread":0.2611218962316566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904565525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49679312,0.0007464898,0.4758653,0.0056140106,0.00015219519,0.00022570757,0.003053953,0.0009734758,0.01657582],"genre_scores_gemma":[0.9720143,0.0002422729,0.022401351,0.00025892875,0.00019020824,0.00017942143,0.0016783369,0.00017959983,0.0028554865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564075,0.0014555415,0.0002955691,0.0009710488,0.0010540916,0.00058301166],"domain_scores_gemma":[0.9152089,0.07486581,0.0032887931,0.0033282824,0.0018332527,0.0014750569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039423816,0.0010830851,0.002460018,0.0019822272,0.0015291504,0.0054475437,0.0026203466,0.0022267161,0.011153534],"category_scores_gemma":[0.04795009,0.000834382,0.0024050807,0.0011926703,0.0039635124,0.007573065,0.0046069277,0.003930153,0.000502335],"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.0010854738,0.00027495806,0.01044883,0.0005829393,0.00027217998,0.00056664937,0.00061444275,0.42320257,0.0020372442,0.5282613,0.0056533697,0.0270001],"study_design_scores_gemma":[0.000040087863,0.000037252674,0.0006237349,0.000018995584,0.000032499054,0.00006620505,0.000063935775,0.49179074,0.00048338043,0.5065654,0.00025367137,0.000024118262],"about_ca_topic_score_codex":0.0037123512,"about_ca_topic_score_gemma":0.0024590434,"teacher_disagreement_score":0.011153534,"about_ca_system_score_codex":0.0029113905,"about_ca_system_score_gemma":0.0030608855,"threshold_uncertainty_score":0.03731233},"labels":[],"label_agreement":null},{"id":"W2904784373","doi":"10.1609/aaai.v33i01.33017530","title":"Deep Reactive Policies for Planning in Stochastic Nonlinear Domains","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":22,"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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Reinforcement learning; Markov decision process; Mathematical optimization; Stochastic optimization; Artificial intelligence; Probabilistic logic; Stochastic control; Benchmark (surveying); Inference; Optimal control; Mathematics; Markov process","score_opus":0.04538887102499332,"score_gpt":0.31662759264975515,"score_spread":0.2712387216247618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904784373","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.0069731325,0.000245046,0.989495,0.00024707813,0.000032540516,0.00003320701,0.00010929701,0.0011922645,0.001672422],"genre_scores_gemma":[0.53784853,0.0006367612,0.4564843,0.00024699888,0.000054184144,0.0003374499,0.00058800966,0.00040467054,0.0033991593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958223,0.00011524259,0.000030459576,0.00009093932,0.00012605882,0.00005501286],"domain_scores_gemma":[0.99879634,0.00074992777,0.00011072949,0.00012651134,0.00015286688,0.00006354065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009233368,0.0010936892,0.000875295,0.00052449835,0.0004804293,0.0009793241,0.0013271304,0.0009800531,0.003382658],"category_scores_gemma":[0.0031736027,0.00068423135,0.00065684406,0.0005514401,0.0011726957,0.0013309423,0.0012586447,0.0023628306,0.0005330571],"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.000025584339,0.000012766351,0.00012634914,0.000043240965,0.00000884306,0.000017604614,0.00001987735,0.9709523,0.00049880217,0.012218557,0.00057395623,0.015502253],"study_design_scores_gemma":[0.0000033924864,0.000003878241,0.000013355487,0.0000034644684,0.00000115757,0.000002202085,0.000002516304,0.9932376,0.00022647635,0.0062171044,0.0002872819,0.000001455431],"about_ca_topic_score_codex":0.016135672,"about_ca_topic_score_gemma":0.017346518,"teacher_disagreement_score":0.016135672,"about_ca_system_score_codex":0.0019427404,"about_ca_system_score_gemma":0.0027784917,"threshold_uncertainty_score":0.03208351},"labels":[],"label_agreement":null},{"id":"W2904898906","doi":"10.1007/s11219-018-9429-3","title":"FSM inference and checking sequence construction are two sides of the same coin","year":2018,"lang":"en","type":"article","venue":"Software Quality Journal","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"TRACE (psycholinguistics); Sequence (biology); Inference; Computer science; Nondeterministic algorithm; Finite-state machine; Model checking; Permutation (music); A priori and a posteriori; Algorithm; Automaton; Theoretical computer science; Artificial intelligence","score_opus":0.04786971646388845,"score_gpt":0.3511958778392323,"score_spread":0.30332616137534385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904898906","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.0045860717,0.00081767136,0.9809368,0.0056484817,0.00054174504,0.00009753303,0.00013126219,0.0017001582,0.0055401917],"genre_scores_gemma":[0.2284017,0.0016501317,0.75345427,0.0032265505,0.0012478229,0.00030703028,0.00071219093,0.0020374202,0.008962896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9653196,0.013063437,0.0025879731,0.0056026443,0.011384004,0.002042408],"domain_scores_gemma":[0.88485056,0.07288716,0.0028492678,0.030255377,0.007908899,0.00124881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027472425,0.0014970105,0.003493237,0.0049590534,0.0028092742,0.008413745,0.006799051,0.0076670754,0.013881301],"category_scores_gemma":[0.102685414,0.002096594,0.0043773027,0.0039658076,0.0176089,0.028290724,0.012617432,0.009146781,0.0030878845],"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.000285092,0.000105375,0.0015374655,0.00043680143,0.00014543944,0.0002319147,0.00071011623,0.011388764,0.001899981,0.8192126,0.00738751,0.15665889],"study_design_scores_gemma":[0.000047105266,0.000044057433,0.00043420016,0.00019161307,0.00006685916,0.00022217078,0.00012705864,0.040146183,0.004228082,0.94442326,0.009983377,0.00008612751],"about_ca_topic_score_codex":0.0049215066,"about_ca_topic_score_gemma":0.0043164724,"teacher_disagreement_score":0.027472425,"about_ca_system_score_codex":0.003354397,"about_ca_system_score_gemma":0.0074881334,"threshold_uncertainty_score":0.14528978},"labels":[],"label_agreement":null},{"id":"W2910195212","doi":"10.48550/arxiv.1901.02046","title":"A New Perspective on Machine Learning: How to do Perfect Supervised Learning","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","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":"York University","funders":"","keywords":"Generalization; Generalization error; Perspective (graphical); Computer science; Artificial intelligence; Constraint (computer-aided design); Machine learning; Bandlimiting; Probably approximately correct learning; Artificial neural network; Key (lock); Mathematics","score_opus":0.03579808011625987,"score_gpt":0.1991813649447568,"score_spread":0.16338328482849693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910195212","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.004191214,0.0015479237,0.98467594,0.005867296,0.00022012685,0.00002170263,0.00005220016,0.0002706716,0.0031529013],"genre_scores_gemma":[0.4370848,0.0054402146,0.5440584,0.0043096016,0.0026972215,0.00025639968,0.00027327554,0.00047652284,0.0054035494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967704,0.0016776131,0.00013432043,0.0007079158,0.00059068593,0.000119136326],"domain_scores_gemma":[0.98694915,0.00852404,0.00053742115,0.002970657,0.00075353734,0.00026511247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068525993,0.0012090558,0.0017053831,0.0010520277,0.0008397015,0.0021370691,0.0021886118,0.0021309422,0.002155855],"category_scores_gemma":[0.024637368,0.00059974927,0.0011249337,0.0010295013,0.0077323257,0.011832937,0.0034297719,0.0050966498,0.0008980558],"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.00006330226,0.00006548382,0.00052011333,0.00032184777,0.000091008886,0.000056477078,0.00031428575,0.070840515,0.0011929813,0.8410665,0.006010859,0.0794566],"study_design_scores_gemma":[0.0000111436575,0.00002634595,0.000051356583,0.000035359397,0.0000059232193,0.000020821357,0.000024644307,0.08598662,0.0003684493,0.9102232,0.003233982,0.000012101726],"about_ca_topic_score_codex":0.0011272813,"about_ca_topic_score_gemma":0.0006316445,"teacher_disagreement_score":0.0068525993,"about_ca_system_score_codex":0.0010760757,"about_ca_system_score_gemma":0.0010819724,"threshold_uncertainty_score":0.03624046},"labels":[],"label_agreement":null},{"id":"W2911248322","doi":"","title":"Learning to Learn with Conditional Class Dependencies","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université de Sherbrooke; Dalhousie University","funders":"","keywords":"Computer science; Class (philosophy); Artificial intelligence; Machine learning; Theoretical computer science","score_opus":0.030354844997369082,"score_gpt":0.3326982328008643,"score_spread":0.30234338780349523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911248322","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.04842542,0.0006465808,0.9442568,0.0017603575,0.00018681076,0.00008439645,0.00066200783,0.0016581294,0.002319618],"genre_scores_gemma":[0.7622771,0.0009484813,0.22037874,0.0013808195,0.00047350064,0.00042973345,0.0042335456,0.00031918788,0.009558821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872833,0.00038837144,0.00007931783,0.00044069145,0.00022710719,0.00013617825],"domain_scores_gemma":[0.99385816,0.004026298,0.0002873745,0.0012099796,0.000456203,0.00016187695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021314947,0.0011276932,0.0013601143,0.0011267145,0.0006107151,0.001425078,0.0022126483,0.0023785853,0.0046918876],"category_scores_gemma":[0.012238502,0.0008557086,0.0013799499,0.0016528284,0.0012983109,0.0062183803,0.0029212406,0.00501928,0.0012192456],"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.00062525977,0.00054335425,0.0059904642,0.00033881242,0.0003574176,0.00022627208,0.0002305695,0.24817966,0.003812747,0.09968732,0.029404523,0.61060363],"study_design_scores_gemma":[0.00004450895,0.000059626338,0.00031521087,0.00002451657,0.00003817727,0.000055584962,0.00002203313,0.9125011,0.0009964675,0.084748,0.00118365,0.000011136984],"about_ca_topic_score_codex":0.0033207703,"about_ca_topic_score_gemma":0.0045208954,"teacher_disagreement_score":0.0046918876,"about_ca_system_score_codex":0.0010803419,"about_ca_system_score_gemma":0.0018476318,"threshold_uncertainty_score":0.01569599},"labels":[],"label_agreement":null},{"id":"W2914503505","doi":"10.1007/3-540-45790-9_4","title":"Beyond EDSM","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Merge (version control); Computer science; Automaton; Prefix; Heuristic; Theoretical computer science; Algorithm; Finite-state machine; Artificial intelligence; Parallel computing","score_opus":0.011030029652310805,"score_gpt":0.23320230234686903,"score_spread":0.22217227269455822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914503505","genre_codex":"other","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.0009771466,0.00714957,0.016669264,0.013971006,0.0059323087,0.0000316074,0.00049979636,0.0014889527,0.95328027],"genre_scores_gemma":[0.007619468,0.0023219755,0.004603316,0.002497721,0.0009077789,0.000030282506,0.00047067518,0.00042518816,0.9811235],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919695,0.00015872352,0.0000279705,0.00015644405,0.00034833813,0.0001116393],"domain_scores_gemma":[0.99915755,0.00013878952,0.0000299303,0.00022667822,0.00022013024,0.00022698214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010010679,0.0006329366,0.00043399187,0.0015333461,0.001156663,0.0049963286,0.0013762625,0.0016069899,0.21991591],"category_scores_gemma":[0.0023896338,0.00031224082,0.00038047982,0.001516353,0.0009355213,0.0050619408,0.0038053037,0.0021851656,0.108613364],"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.000030812902,0.00003057358,0.00013811822,0.00011948394,0.0000040816903,0.000047511065,0.00019068713,0.00017295554,0.0004906601,0.14238249,0.4736965,0.38269612],"study_design_scores_gemma":[0.0000019109148,0.000005253721,0.00007242675,0.000042555974,0.0000011549636,0.00004389504,0.0000441591,0.00008662603,0.00013732877,0.016933639,0.98262835,0.0000026618088],"about_ca_topic_score_codex":0.00089963194,"about_ca_topic_score_gemma":0.002093708,"teacher_disagreement_score":0.21991591,"about_ca_system_score_codex":0.0013427634,"about_ca_system_score_gemma":0.0013596539,"threshold_uncertainty_score":0.735692},"labels":[],"label_agreement":null},{"id":"W2942259633","doi":"10.4086/toc.2019.v015a001","title":"","year":2019,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; York University; National Science Foundation","keywords":"Property testing; Monotone polygon; Monotonic function; Mathematics; Combinatorics; Context (archaeology); Omega; Domain (mathematical analysis); Hypercube; Partially ordered set; Discrete mathematics; Boolean function; Function (biology); Mathematical analysis; Physics","score_opus":0.006081717006494044,"score_gpt":0.22978444834867517,"score_spread":0.22370273134218113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942259633","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4115191,0.0015400818,0.50824577,0.0015378349,0.0006149705,0.00014409285,0.001876007,0.0010736288,0.07344842],"genre_scores_gemma":[0.9139144,0.0006053034,0.07104676,0.00038295667,0.00021908781,0.00014589816,0.0009482522,0.0001332333,0.01260408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934345,0.0001188429,0.00004671609,0.00024163786,0.00012330855,0.0001260674],"domain_scores_gemma":[0.99894947,0.00039951873,0.00013686976,0.00013965688,0.00024461205,0.00012991259],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004558755,0.00042593858,0.0004286469,0.0008379391,0.00068340363,0.0014438047,0.0004704713,0.00052334525,0.0054701567],"category_scores_gemma":[0.00236952,0.0001685796,0.00039332034,0.0006022003,0.0014801599,0.0030822514,0.0009254894,0.0006717293,0.0012442038],"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.0005293453,0.00015285666,0.0037626051,0.0004059411,0.000051084633,0.00039236477,0.0005387774,0.004371218,0.028136576,0.8309367,0.007224247,0.123498395],"study_design_scores_gemma":[0.000052776657,0.00026037058,0.0031846587,0.00009465687,0.000050116312,0.0028922644,0.00040168234,0.034552798,0.02080158,0.8880929,0.049521305,0.000095032156],"about_ca_topic_score_codex":0.00043586027,"about_ca_topic_score_gemma":0.0006109087,"teacher_disagreement_score":0.99452984,"about_ca_system_score_codex":0.0005879581,"about_ca_system_score_gemma":0.00043261418,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2945134239","doi":"10.65109/ecst4444","title":"Report-Sensitive Spot-Checking in Peer-Grading Systems","year":2019,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"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 British Columbia","funders":"","keywords":"Grading (engineering); Computer science; Scalability; Incentive; Obstacle; Homogeneous; Ground truth; Theoretical computer science; Mathematical proof; Mathematics education; Artificial intelligence; Mathematics","score_opus":0.01046836796641533,"score_gpt":0.25292207121071997,"score_spread":0.24245370324430462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945134239","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.13261293,0.0014127003,0.8412912,0.0024902667,0.00058784336,0.0011594951,0.0007780273,0.008309392,0.011358172],"genre_scores_gemma":[0.938124,0.00021557482,0.05550035,0.00034212536,0.00023488808,0.00022207008,0.00027194538,0.00026494393,0.0048241825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9748795,0.009433239,0.001615237,0.005720989,0.005799922,0.0025510874],"domain_scores_gemma":[0.86912495,0.07278611,0.012640646,0.030275915,0.010967411,0.004204968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023722379,0.0019712388,0.0036535175,0.0021953783,0.0035715948,0.0048745754,0.008772812,0.0047589587,0.009623817],"category_scores_gemma":[0.101313345,0.0017359448,0.0012436819,0.0022624906,0.0036885012,0.009626571,0.0080349855,0.0049316143,0.0027178596],"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.0038470114,0.0013728334,0.019321376,0.0010988681,0.00034391475,0.001973965,0.0035851288,0.4003985,0.013398095,0.21711837,0.023684205,0.3138578],"study_design_scores_gemma":[0.00023660848,0.00039146148,0.0014082128,0.00007614705,0.00008443746,0.0005087677,0.0002668091,0.8559428,0.005635191,0.13027285,0.005050158,0.00012660185],"about_ca_topic_score_codex":0.004718759,"about_ca_topic_score_gemma":0.0034862412,"teacher_disagreement_score":0.023722379,"about_ca_system_score_codex":0.0029952514,"about_ca_system_score_gemma":0.004748117,"threshold_uncertainty_score":0.12545747},"labels":[],"label_agreement":null},{"id":"W2946194516","doi":"10.22215/etd/2011-07131","title":"Learning automata and the Commons Game","year":2011,"lang":"pl","type":"dissertation","venue":"","topic":"Machine Learning and Algorithms","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":"Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Commons; The Internet; Humanities; Political science; World Wide Web; Art; Law","score_opus":0.010935956446034446,"score_gpt":0.2479448422396522,"score_spread":0.23700888579361776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946194516","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.3271453,0.0020180263,0.5452269,0.011597198,0.00036241856,0.00016009768,0.00084713486,0.00069566874,0.11194727],"genre_scores_gemma":[0.9632949,0.00045870704,0.019803299,0.0003018836,0.000098660894,0.000111159876,0.00023030072,0.000058724578,0.015642269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987005,0.00071831647,0.00006986962,0.00021770393,0.00013475609,0.00015875694],"domain_scores_gemma":[0.98638284,0.011532983,0.00042128985,0.00056292,0.00037907122,0.00072083104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016812098,0.0004373611,0.0007767766,0.00076319557,0.0009884142,0.002993707,0.000983924,0.0014333642,0.008915285],"category_scores_gemma":[0.014540033,0.00032481187,0.0007244912,0.0006865109,0.002789523,0.004303505,0.0016559716,0.0021463404,0.0006398414],"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.000126401,0.00008398148,0.001250653,0.000066464985,0.0000356391,0.00007486355,0.00023594398,0.0982199,0.00023914654,0.8800212,0.0036336929,0.016012022],"study_design_scores_gemma":[0.00002073202,0.000013889874,0.00013832998,0.000013400237,0.0000060852653,0.000013440424,0.000047508143,0.18524197,0.00008992621,0.8129381,0.0014679651,0.000008690925],"about_ca_topic_score_codex":0.0059685777,"about_ca_topic_score_gemma":0.0073734783,"teacher_disagreement_score":0.008915285,"about_ca_system_score_codex":0.0021534099,"about_ca_system_score_gemma":0.0016346173,"threshold_uncertainty_score":0.029824555},"labels":[],"label_agreement":null},{"id":"W2946554987","doi":"","title":"Learnability of Solutions to Conjunctive Queries","year":2019,"lang":"en","type":"article","venue":"BIROn (Birkbeck, University of London)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Learnability; Computer science; Conjunctive query; Theoretical computer science; Artificial intelligence; Information retrieval","score_opus":0.008053666535263158,"score_gpt":0.19114057002711846,"score_spread":0.1830869034918553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946554987","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.20802535,0.000780806,0.7779739,0.0040116836,0.000054750653,0.00019210903,0.00064445136,0.0009753139,0.007341569],"genre_scores_gemma":[0.8657054,0.00071763975,0.12696047,0.00055628055,0.00021372247,0.00026263052,0.0019472378,0.00017659662,0.0034601172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98906285,0.003992563,0.0007059791,0.0026086352,0.002891428,0.0007384989],"domain_scores_gemma":[0.95236534,0.039717827,0.0020795607,0.003173426,0.0020731709,0.00059067755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008318142,0.0012049025,0.0014651582,0.0018091731,0.0013044134,0.004429446,0.0033365295,0.00242125,0.004494888],"category_scores_gemma":[0.06292538,0.00077095884,0.0021474375,0.0017224868,0.005759059,0.014584367,0.0054901806,0.005466505,0.000488792],"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.0006796994,0.0005246135,0.009168678,0.0013377855,0.00026582583,0.0002885329,0.0027122602,0.120107315,0.0058995136,0.67476296,0.005153222,0.17909956],"study_design_scores_gemma":[0.000037634927,0.00009479999,0.00061202515,0.000042875265,0.000036686866,0.00010711413,0.0002940159,0.25650397,0.003429997,0.7378105,0.0010083494,0.000021971382],"about_ca_topic_score_codex":0.0015773989,"about_ca_topic_score_gemma":0.001548035,"teacher_disagreement_score":0.008318142,"about_ca_system_score_codex":0.0021296882,"about_ca_system_score_gemma":0.001530315,"threshold_uncertainty_score":0.04399109},"labels":[],"label_agreement":null},{"id":"W2946940318","doi":"","title":"UWaterlooMDS at the TREC 2018 Common Core Track.","year":2018,"lang":"en","type":"article","venue":"Text REtrieval Conference","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Track (disk drive); Computer science; Core (optical fiber); Information retrieval; Artificial intelligence; Telecommunications; Operating system","score_opus":0.03971195414912118,"score_gpt":0.29323575829561693,"score_spread":0.2535238041464958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946940318","genre_codex":"other","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.0024558,0.0046088737,0.007300077,0.015586602,0.012676315,0.0007554541,0.28601736,0.016450701,0.6541489],"genre_scores_gemma":[0.0041277204,0.0016564835,0.0046886387,0.0015216513,0.0012741195,0.00017739208,0.108339004,0.0027018925,0.8755131],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851674,0.00017960308,0.000071557915,0.00028978192,0.00073394016,0.00020842113],"domain_scores_gemma":[0.99539953,0.00034728457,0.00010543062,0.0004909902,0.002269926,0.001386722],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023142793,0.0014604415,0.002659148,0.004353568,0.0026155505,0.0062806164,0.0021616442,0.0016249424,0.71701384],"category_scores_gemma":[0.005034408,0.0007373211,0.0006103997,0.0066761407,0.0006332745,0.0053154896,0.0031231453,0.0019503819,0.51205015],"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.000022565302,0.00002420315,0.00004463292,0.000034379704,0.0000019592542,0.000008275456,0.000008047572,0.000026804628,0.00016871556,0.0003989428,0.9888188,0.010442662],"study_design_scores_gemma":[0.000029230783,0.000018290395,0.0007514722,0.000052827734,0.0000043147033,0.000016153337,0.00006021081,0.00034161555,0.00036244543,0.001705245,0.9966434,0.000014716282],"about_ca_topic_score_codex":0.07756723,"about_ca_topic_score_gemma":0.23054245,"teacher_disagreement_score":0.71701384,"about_ca_system_score_codex":0.0035981678,"about_ca_system_score_gemma":0.00492426,"threshold_uncertainty_score":0.4036454},"labels":[],"label_agreement":null},{"id":"W2948606716","doi":"10.1016/j.neucom.2021.11.027","title":"Bayesian active learning with abstention feedbacks","year":2021,"lang":"en","type":"preprint","venue":"Neurocomputing","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation; Viet Nam National University Ho Chi Minh City; Canada Research Chairs; Dalhousie University; University of Delaware","keywords":"Computer science; Bayesian probability; Function (biology); Value (mathematics); Greedy algorithm; Artificial intelligence; Constant (computer programming); Mathematical optimization; Machine learning; Algorithm; Mathematics","score_opus":0.007621210456470815,"score_gpt":0.23154229887421243,"score_spread":0.2239210884177416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948606716","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.0067000436,0.00037369327,0.98915523,0.0006064249,0.00014310535,0.000044437966,0.0000839228,0.00028859678,0.0026045495],"genre_scores_gemma":[0.6508704,0.0006823726,0.32413974,0.0008574978,0.00088811293,0.000498335,0.00052181445,0.0003877263,0.021154113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605846,0.0019492474,0.00020190937,0.00063008105,0.00095336494,0.00020700289],"domain_scores_gemma":[0.9800331,0.015327143,0.0005836123,0.0017351663,0.0017706588,0.0005504206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073452597,0.0014196424,0.0023159985,0.0013755837,0.0009916528,0.0027648534,0.0043822513,0.004520947,0.008392032],"category_scores_gemma":[0.033750966,0.0013806255,0.0009642898,0.0013407998,0.002843575,0.006672514,0.004306524,0.004864162,0.0018484552],"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.00089711585,0.00042389124,0.00087562157,0.0003977264,0.00017109996,0.00012896158,0.00026715,0.35011813,0.003501411,0.4138498,0.008978089,0.22039102],"study_design_scores_gemma":[0.000043643286,0.000040505536,0.000042906177,0.000016691845,0.0000149156,0.000021597762,0.0000061848596,0.87557924,0.0006777281,0.12276495,0.00077801157,0.000013552977],"about_ca_topic_score_codex":0.001799572,"about_ca_topic_score_gemma":0.0022030638,"teacher_disagreement_score":0.008392032,"about_ca_system_score_codex":0.0009955467,"about_ca_system_score_gemma":0.0013287505,"threshold_uncertainty_score":0.038845897},"labels":[],"label_agreement":null},{"id":"W2949091389","doi":"10.48550/arxiv.1212.1527","title":"Learning Mixtures of Arbitrary Distributions over Large Discrete Domains","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mixture model; Dimension (graph theory); Point process; Point (geometry); Moment (physics); Unsupervised learning; Mathematics; Sequence (biology); Computer science; Algorithm; Artificial intelligence; Combinatorics; Physics; Statistics","score_opus":0.02455428583374884,"score_gpt":0.2001401681885146,"score_spread":0.17558588235476577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949091389","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.0029312745,0.00007339818,0.9957898,0.00024277932,0.000013022837,0.000033453944,0.000049177583,0.00043223295,0.00043490925],"genre_scores_gemma":[0.1018504,0.00016986106,0.89357835,0.00031761624,0.00010273826,0.00031008117,0.0007860414,0.00024578004,0.0026390478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975988,0.00074783876,0.00016663542,0.0006783865,0.0005885386,0.00021979876],"domain_scores_gemma":[0.99478227,0.00340404,0.00031768123,0.0008553656,0.00042861517,0.00021203767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003976154,0.001286689,0.0016168247,0.0016816661,0.0011197029,0.0021196029,0.0030248684,0.0023806295,0.004781018],"category_scores_gemma":[0.017405225,0.0013214578,0.0021009482,0.0018010908,0.0018729754,0.0060018776,0.0067443573,0.004915119,0.0018352984],"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.00044757267,0.00024423518,0.002969424,0.00024347531,0.00018381941,0.00021166871,0.000534599,0.44675714,0.0039629266,0.19888154,0.009311341,0.33625224],"study_design_scores_gemma":[0.000026159532,0.000019424771,0.00014471232,0.000012748591,0.000008623693,0.000047604466,0.000026649624,0.92998075,0.0009635884,0.06715883,0.0015968144,0.0000140777465],"about_ca_topic_score_codex":0.0030729426,"about_ca_topic_score_gemma":0.0042848396,"teacher_disagreement_score":0.004781018,"about_ca_system_score_codex":0.001896057,"about_ca_system_score_gemma":0.0015058502,"threshold_uncertainty_score":0.021028161},"labels":[],"label_agreement":null},{"id":"W2949623047","doi":"10.48550/arxiv.cs/0212035","title":"Exploiting Context When Learning to Classify","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Context (archaeology); Computer science; Set (abstract data type); Domain (mathematical analysis); Artificial intelligence; Machine learning; Fault (geology); Natural language processing; Speech recognition; Mathematics","score_opus":0.06477789406911422,"score_gpt":0.2765881276680366,"score_spread":0.21181023359892237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949623047","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.06761538,0.0038895013,0.92151034,0.0015925928,0.0004762241,0.00017498067,0.00031542525,0.0008919798,0.0035335945],"genre_scores_gemma":[0.66569585,0.0015384272,0.32768944,0.001014768,0.0011102994,0.00036932007,0.00096396205,0.00013796403,0.0014799221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951776,0.0018102092,0.00037715386,0.0014870252,0.00086081127,0.00028718385],"domain_scores_gemma":[0.9886065,0.008209145,0.0006074376,0.0015820098,0.0007100358,0.00028491375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003300588,0.0014478719,0.0016752413,0.0024809358,0.0013724589,0.0024347769,0.001881285,0.002482618,0.0016233218],"category_scores_gemma":[0.026883911,0.00064541795,0.00089625246,0.002272467,0.0017706301,0.006474321,0.0025035418,0.0030993596,0.0008907672],"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.00082218694,0.00036888983,0.018129112,0.0004928906,0.0002827327,0.0006176722,0.0007806028,0.06895283,0.007335414,0.031178163,0.00784738,0.86319214],"study_design_scores_gemma":[0.000104703766,0.00035374786,0.0032889354,0.0001468712,0.00019025152,0.00077091483,0.00042892306,0.6910697,0.012844501,0.27852327,0.01216793,0.00011025982],"about_ca_topic_score_codex":0.0020005086,"about_ca_topic_score_gemma":0.002573988,"teacher_disagreement_score":0.003300588,"about_ca_system_score_codex":0.0005463458,"about_ca_system_score_gemma":0.0008407167,"threshold_uncertainty_score":0.017455399},"labels":[],"label_agreement":null},{"id":"W2949846021","doi":"10.48550/arxiv.cs/0201005","title":"Sharpening Occam's Razor","year":2002,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","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":"occam; Occam's razor; Sharpening; Representation (politics); Computer science; Work (physics); Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Programming language; Statistics; Artificial intelligence","score_opus":0.07102146071513687,"score_gpt":0.17924696230714676,"score_spread":0.10822550159200989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949846021","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.020540176,0.0015368026,0.95179003,0.0057338863,0.00061831105,0.00010165344,0.0007343729,0.0006940444,0.018250814],"genre_scores_gemma":[0.62717247,0.0022619886,0.3466148,0.0059108348,0.002640571,0.0005288596,0.0013713075,0.0006347163,0.012864405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9882116,0.003917353,0.00057412125,0.0023911558,0.0039808266,0.00092484336],"domain_scores_gemma":[0.9415554,0.03748005,0.003308243,0.0095267575,0.0067487215,0.001380862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011020751,0.0018589629,0.0025439493,0.002506568,0.0023459787,0.005799815,0.005583294,0.0030663847,0.007424313],"category_scores_gemma":[0.065213785,0.001186723,0.0023713287,0.0029829282,0.0070114466,0.012076423,0.0065856497,0.010391041,0.0023318445],"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.00035293674,0.00008212937,0.001860852,0.0003742898,0.00014521694,0.00016934371,0.00023565236,0.021157382,0.0026494337,0.88661224,0.01646788,0.069892675],"study_design_scores_gemma":[0.00008939348,0.00014526899,0.0005426507,0.000068267276,0.00005887803,0.000244579,0.000043826352,0.17419986,0.002921615,0.8136142,0.007999379,0.00007209052],"about_ca_topic_score_codex":0.0028204261,"about_ca_topic_score_gemma":0.0034844673,"teacher_disagreement_score":0.011020751,"about_ca_system_score_codex":0.0033860514,"about_ca_system_score_gemma":0.0038203276,"threshold_uncertainty_score":0.058283985},"labels":[],"label_agreement":null},{"id":"W2950284428","doi":"10.48550/arxiv.cs/0212031","title":"Contextual Normalization Applied to Aircraft Gas Turbine Engine Diagnosis","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Machine Learning and Algorithms","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":"National Research Council Canada","funders":"","keywords":"Normalization (sociology); Gas turbines; Computer science; Artificial intelligence; Machine learning; Software; Database normalization; Turbine; Regression; Data mining; Engineering; Pattern recognition (psychology); Mathematics","score_opus":0.02492922328226276,"score_gpt":0.24839912325541752,"score_spread":0.22346989997315475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950284428","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.09234609,0.00080247066,0.899665,0.0003865602,0.00010911046,0.0000745067,0.00023020722,0.005154136,0.0012320044],"genre_scores_gemma":[0.6394103,0.0003244475,0.3582378,0.0001958774,0.000117156305,0.00010134122,0.0005814256,0.00024342047,0.00078821386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980718,0.000702818,0.00011703164,0.000616061,0.00036872926,0.00012347597],"domain_scores_gemma":[0.9960407,0.002239097,0.00034050664,0.0005968828,0.0006782907,0.00010443333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028714275,0.0009796222,0.001301349,0.0011916318,0.00063229084,0.00096948165,0.0013106801,0.0009183397,0.0010599364],"category_scores_gemma":[0.014713039,0.0003870737,0.0007812842,0.0017879087,0.0010508351,0.0012827464,0.0012761154,0.0014303528,0.0002643661],"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.0003386308,0.00018013985,0.007324076,0.00016169406,0.00014647921,0.00016408678,0.00020815039,0.40281057,0.014914091,0.0060247527,0.0025788113,0.56514853],"study_design_scores_gemma":[0.000015812515,0.000064194595,0.0026316647,0.000010974821,0.00003757953,0.00006321449,0.000033029297,0.96672577,0.020256342,0.008640137,0.0014988447,0.000022453141],"about_ca_topic_score_codex":0.008195216,"about_ca_topic_score_gemma":0.0058371075,"teacher_disagreement_score":0.008195216,"about_ca_system_score_codex":0.0010842945,"about_ca_system_score_gemma":0.0011303626,"threshold_uncertainty_score":0.016295016},"labels":[],"label_agreement":null},{"id":"W2951025196","doi":"","title":"Learning Algorithms for Active Learning","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":69,"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 Montréal; Microsoft (Canada)","funders":"","keywords":"MovieLens; Heuristic; Computer science; Artificial intelligence; Machine learning; Construct (python library); Selection (genetic algorithm); Representation (politics); Model selection; Algorithm; Training set; Active learning (machine learning); Recommender system; Collaborative filtering","score_opus":0.07412385670808344,"score_gpt":0.22856959367735838,"score_spread":0.15444573696927494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951025196","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.0003183744,0.00082516304,0.99561876,0.0004305408,0.00011349173,0.000056463028,0.00012205206,0.00036012297,0.0021550334],"genre_scores_gemma":[0.08177865,0.0039257905,0.8972024,0.0012816334,0.0013055399,0.0018223006,0.0015671303,0.00059794,0.010518587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942287,0.0027686274,0.00039168823,0.0010978265,0.0012502434,0.00026282086],"domain_scores_gemma":[0.9867778,0.0095128,0.00053209794,0.0017272739,0.0011750072,0.00027497887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00675932,0.0025113095,0.0026425729,0.0026196437,0.0011007205,0.004721615,0.005889712,0.003792472,0.01150707],"category_scores_gemma":[0.028138379,0.0013380941,0.0022265553,0.0036645911,0.0025015848,0.0063673677,0.0048190877,0.0070168134,0.006022591],"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.00007638871,0.00017363082,0.000927404,0.00051966665,0.00022611566,0.000091237176,0.00016848146,0.16063216,0.0005509347,0.5856603,0.020525953,0.23044775],"study_design_scores_gemma":[0.000040489056,0.000029653687,0.00006660751,0.000069727816,0.000023269875,0.000059117272,0.00001893313,0.47093895,0.00030818448,0.5157132,0.012714882,0.000016883694],"about_ca_topic_score_codex":0.0019403306,"about_ca_topic_score_gemma":0.0018669731,"teacher_disagreement_score":0.01150707,"about_ca_system_score_codex":0.0018179839,"about_ca_system_score_gemma":0.0019641472,"threshold_uncertainty_score":0.038494945},"labels":[],"label_agreement":null},{"id":"W2951036665","doi":"10.48550/arxiv.1501.06841","title":"A Canonical Form for Weighted Automata and Applications to Approximate Minimization","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","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":"McGill University","funders":"","keywords":"Mathematics; Series (stratigraphy); Singular value decomposition; Canonical form; Automaton; Hankel matrix; Quantum finite automata; Rational function; Finite-state machine; Probabilistic automaton; Algorithm; Discrete mathematics; Applied mathematics; Automata theory; Computer science; Pure mathematics; Theoretical computer science; Mathematical analysis","score_opus":0.057638769615268586,"score_gpt":0.22240892787850944,"score_spread":0.16477015826324085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951036665","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.00522565,0.00022433537,0.99212825,0.00016503321,0.0000654999,0.000025502637,0.000042152213,0.00012121286,0.0020023275],"genre_scores_gemma":[0.20398463,0.0011796512,0.7857038,0.00027208962,0.0002947267,0.00041164944,0.00046078017,0.00055968517,0.007132971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979316,0.00069612346,0.00016754687,0.00049906684,0.0005725287,0.00013317424],"domain_scores_gemma":[0.9971534,0.0014522475,0.00020344931,0.00043827755,0.00064301095,0.000109579574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021144685,0.0011203751,0.001110935,0.0015703166,0.00084626646,0.0020187374,0.0017323797,0.001268948,0.0050290697],"category_scores_gemma":[0.0124553945,0.0007138692,0.0016330073,0.001885331,0.002392376,0.0043460345,0.0025505254,0.0026323148,0.0014675341],"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.000033198718,0.00004024204,0.000539743,0.0001425559,0.00004114778,0.00006496188,0.0002419349,0.10191632,0.0023903863,0.83442646,0.0016379326,0.058525015],"study_design_scores_gemma":[0.0000055596493,0.000033988097,0.00005892965,0.000032025502,0.000011295884,0.000043798394,0.00004486737,0.38630137,0.0012407426,0.6087473,0.0034647896,0.00001537543],"about_ca_topic_score_codex":0.0015140055,"about_ca_topic_score_gemma":0.0018281474,"teacher_disagreement_score":0.0050290697,"about_ca_system_score_codex":0.0010745729,"about_ca_system_score_gemma":0.00089352095,"threshold_uncertainty_score":0.016823947},"labels":[],"label_agreement":null},{"id":"W2951804632","doi":"","title":"Preference-based Teaching","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","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 Regina","funders":"","keywords":"Class (philosophy); Closure (psychology); Dimension (graph theory); Mathematics; Preference; Operator (biology); Euclidean geometry; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.11623475084041357,"score_gpt":0.20993673697517226,"score_spread":0.09370198613475869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951804632","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.06846914,0.00045921048,0.88144886,0.0030911823,0.00011501214,0.00017452634,0.000796909,0.00073550513,0.044709615],"genre_scores_gemma":[0.86066186,0.00031405574,0.11886374,0.00049961143,0.00015059028,0.00031920194,0.00048466198,0.00014848169,0.018557828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994307,0.0021235873,0.0002605634,0.0013718476,0.0012444793,0.0006926587],"domain_scores_gemma":[0.9829534,0.008991997,0.0014736631,0.0036652703,0.0012728309,0.0016428865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003544076,0.00073532126,0.0011581205,0.0009199218,0.0014319972,0.004878991,0.0036399018,0.0024953922,0.0205125],"category_scores_gemma":[0.02138183,0.0005882173,0.0012223638,0.0016615893,0.003680269,0.01284961,0.00343707,0.0040470143,0.0022156518],"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.00017811733,0.00010195412,0.00097153505,0.00010965193,0.000030226092,0.00011019791,0.00036306074,0.030531483,0.0012406515,0.9403489,0.0021724768,0.023841646],"study_design_scores_gemma":[0.000048039372,0.000106608575,0.00038028506,0.000026560341,0.000028259534,0.00020055998,0.00014701998,0.2108796,0.0013618849,0.7794647,0.0073199514,0.000036582413],"about_ca_topic_score_codex":0.0015377839,"about_ca_topic_score_gemma":0.0019132139,"teacher_disagreement_score":0.0205125,"about_ca_system_score_codex":0.0038413831,"about_ca_system_score_gemma":0.0015499783,"threshold_uncertainty_score":0.0686211},"labels":[],"label_agreement":null},{"id":"W2953197276","doi":"10.48550/arxiv.cs/0309033","title":"Lower bounds for predecessor searching in the cell probe model","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"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 Victoria","funders":"Centre National de la Recherche Scientifique; National Science Foundation","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.04996953184438188,"score_gpt":0.30455353406821034,"score_spread":0.2545840022238285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953197276","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.08399081,0.0044652107,0.8536122,0.009409283,0.00027848332,0.0004179761,0.0017310916,0.0021074892,0.04398752],"genre_scores_gemma":[0.71602887,0.004769375,0.24296153,0.0032396184,0.0008540562,0.0014183138,0.0025078012,0.001835464,0.026384924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9859758,0.0032056805,0.0005804715,0.0025833352,0.0045153396,0.0031393748],"domain_scores_gemma":[0.9180128,0.058816772,0.0035369531,0.014194011,0.0035805586,0.0018589189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00965576,0.002164606,0.003564502,0.0031163355,0.0034943596,0.0076371017,0.008444285,0.0035982379,0.017365402],"category_scores_gemma":[0.04828367,0.0016974509,0.0041828696,0.0047559696,0.0055256765,0.031969238,0.009710548,0.010438159,0.0032345315],"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.0014609554,0.00044755905,0.0019731277,0.00075610925,0.00017154499,0.0002732394,0.00096044753,0.13067135,0.011206095,0.7790496,0.017895194,0.0551348],"study_design_scores_gemma":[0.00011578757,0.00020733621,0.00057354197,0.000100770056,0.00018250127,0.00027768977,0.00018933654,0.49529275,0.010877395,0.4818092,0.010265815,0.000107813656],"about_ca_topic_score_codex":0.0036290404,"about_ca_topic_score_gemma":0.0028443187,"teacher_disagreement_score":0.017365402,"about_ca_system_score_codex":0.007123257,"about_ca_system_score_gemma":0.0049145175,"threshold_uncertainty_score":0.05809301},"labels":[],"label_agreement":null},{"id":"W2954304163","doi":"10.23638/lmcs-17(1:9)2021","title":"Computing Probabilistic Bisimilarity Distances for Probabilistic Automata","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Probabilistic logic; Computer science; Probabilistic automaton; Probabilistic CTL; Theoretical computer science; Automaton; Probabilistic analysis of algorithms; Programming language; Artificial intelligence","score_opus":0.06591931980726415,"score_gpt":0.4080842784368488,"score_spread":0.3421649586295846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954304163","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.05206842,0.00010655366,0.94554055,0.00015373739,0.000030032606,0.00008848592,0.00011717841,0.0005368445,0.0013582003],"genre_scores_gemma":[0.5223726,0.0001299593,0.47480795,0.0001671152,0.000040383686,0.00030060404,0.00047591346,0.0002078875,0.0014976274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99449277,0.0014034841,0.00056811195,0.0016228176,0.0015500939,0.00036278288],"domain_scores_gemma":[0.98760045,0.008257122,0.0010170457,0.0015991871,0.0011096996,0.00041641825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034019365,0.0010210366,0.0012439005,0.0023888543,0.00093235786,0.0024582036,0.0022775051,0.0020556531,0.0027603027],"category_scores_gemma":[0.025268648,0.0007592881,0.0015793999,0.0015755781,0.0027549001,0.006382733,0.0044249757,0.0030391526,0.0005748834],"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.00029888446,0.00014594734,0.0021623094,0.00025270303,0.00013321405,0.000118372125,0.0005475153,0.22163545,0.009571524,0.66327405,0.0009210689,0.10093902],"study_design_scores_gemma":[0.0000249112,0.00008217118,0.00023353138,0.00001936526,0.000020959817,0.0000491518,0.00004771094,0.5448928,0.00620814,0.44706434,0.00132346,0.00003338386],"about_ca_topic_score_codex":0.0012259387,"about_ca_topic_score_gemma":0.0014024329,"teacher_disagreement_score":0.0034019365,"about_ca_system_score_codex":0.0029293671,"about_ca_system_score_gemma":0.0018734997,"threshold_uncertainty_score":0.021254182},"labels":[],"label_agreement":null},{"id":"W2962696883","doi":"10.48550/arxiv.1511.03225","title":"Label Efficient Learning by Exploiting Multi-class Output Codes","year":2015,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","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 Alberta","funders":"","keywords":"Computer science; Intuition; Class (philosophy); Artificial intelligence; Theoretical computer science; Supervised learning; Semi-supervised learning; Machine learning; Algorithm; Artificial neural network","score_opus":0.09271439463421345,"score_gpt":0.2039915599581275,"score_spread":0.11127716532391406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962696883","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.018280841,0.00010536207,0.9781196,0.00043479417,0.000039460316,0.000045027293,0.00008059568,0.00042921954,0.0024651203],"genre_scores_gemma":[0.54928106,0.0002508676,0.44346032,0.0005654602,0.00020605003,0.00030469603,0.0004615625,0.00037632923,0.00509358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961849,0.001392164,0.00015493011,0.00065443414,0.0012405235,0.00037302688],"domain_scores_gemma":[0.9816258,0.010693937,0.0013387904,0.0045242584,0.0014482777,0.00036898846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039119665,0.0009960538,0.0011767576,0.0014993537,0.0011117354,0.002400857,0.0025449647,0.0018597232,0.0019315124],"category_scores_gemma":[0.025396073,0.0004604349,0.0008816503,0.0016925982,0.0035489306,0.0054689143,0.005091476,0.0035308343,0.0008039702],"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.00042542606,0.0002176495,0.0027956038,0.00022462333,0.0000705554,0.00018714757,0.0004873565,0.20070341,0.008110197,0.5778844,0.003517311,0.20537637],"study_design_scores_gemma":[0.00003790462,0.00006458138,0.00014210715,0.00003457428,0.000016302418,0.00008102174,0.000040613784,0.596897,0.007396271,0.3933894,0.0018762627,0.000023950597],"about_ca_topic_score_codex":0.0009548718,"about_ca_topic_score_gemma":0.0011557417,"teacher_disagreement_score":0.0039119665,"about_ca_system_score_codex":0.0011490822,"about_ca_system_score_gemma":0.0017521265,"threshold_uncertainty_score":0.020688713},"labels":[],"label_agreement":null},{"id":"W2962748838","doi":"10.5555/3310435.3310479","title":"Testing halfspaces over rotation-invariant distributions","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Machine Learning and Algorithms","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 Waterloo","funders":"","keywords":"Correctness; Logarithm; Invariant (physics); Mathematics; Rotation (mathematics); Function (biology); Distribution (mathematics); Probability distribution; Sign (mathematics); Discrete mathematics; Combinatorics; Sign function; Algorithm; Mathematical analysis; Geometry; Statistics","score_opus":0.010179169663962507,"score_gpt":0.2524591371140157,"score_spread":0.24227996745005317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962748838","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.119288325,0.00021868109,0.87693167,0.000444826,0.000046531302,0.00008943229,0.00033091073,0.001028359,0.0016213204],"genre_scores_gemma":[0.75292563,0.00012363018,0.2435914,0.0003818256,0.00007784649,0.00021711206,0.0012454037,0.00019235979,0.0012447601],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957426,0.0012707707,0.00033802667,0.0010423022,0.0011974433,0.0004087887],"domain_scores_gemma":[0.97393906,0.019215561,0.0015800999,0.0032421823,0.0012089631,0.0008140339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004087693,0.0009133109,0.0013223201,0.0015670984,0.00073391024,0.0019549308,0.0028125031,0.0019594969,0.004290334],"category_scores_gemma":[0.03691076,0.00062238536,0.0012766229,0.0011427009,0.002841018,0.005240706,0.005190045,0.0020191234,0.00086571986],"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.0032210327,0.00038107723,0.02968181,0.00037531054,0.00038031122,0.0004743162,0.0005501587,0.24732314,0.020304443,0.14349777,0.005679803,0.54813075],"study_design_scores_gemma":[0.00010929982,0.00028326327,0.0019182735,0.000042468204,0.000021233362,0.00024291237,0.0001359973,0.8213049,0.00993912,0.16474561,0.0012099808,0.00004693804],"about_ca_topic_score_codex":0.0011504177,"about_ca_topic_score_gemma":0.00066223246,"teacher_disagreement_score":0.004290334,"about_ca_system_score_codex":0.0009435181,"about_ca_system_score_gemma":0.0012450811,"threshold_uncertainty_score":0.021618009},"labels":[],"label_agreement":null},{"id":"W2962845353","doi":"","title":"Clustering with Same-Cluster Queries","year":2016,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":44,"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":"Cluster analysis; Computer science; Time complexity; Margin (machine learning); Computational complexity theory; Theoretical computer science; Probabilistic logic; Correlation clustering; Cluster (spacecraft); Upper and lower bounds; Data mining; Mathematics; Algorithm; Artificial intelligence; Machine learning","score_opus":0.02686987631801791,"score_gpt":0.16032861345644586,"score_spread":0.13345873713842796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962845353","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.008531051,0.00022856076,0.986832,0.0009402825,0.000038932834,0.00021811874,0.000406227,0.0013224143,0.0014824326],"genre_scores_gemma":[0.24598509,0.00020365416,0.7474015,0.00065383734,0.0001879232,0.00055473414,0.0020144861,0.0004382472,0.002560448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9877508,0.004645582,0.00062963966,0.0034294627,0.0028230874,0.000721553],"domain_scores_gemma":[0.9730157,0.013601932,0.0015200361,0.008376104,0.0025596323,0.00092651905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007736278,0.0016511966,0.0030744853,0.0015725422,0.00218107,0.004252117,0.008400766,0.004496038,0.005860769],"category_scores_gemma":[0.0299711,0.0012792228,0.0019546815,0.003469464,0.0025560108,0.009973706,0.005541788,0.004413458,0.0019252241],"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.0012390801,0.0008409288,0.0032324416,0.0006837635,0.00032564596,0.00040286817,0.0014089436,0.42458177,0.0076855565,0.2900373,0.03541116,0.2341506],"study_design_scores_gemma":[0.00005789241,0.00006898129,0.00022347552,0.000013311976,0.000020162997,0.00014827368,0.00012738547,0.85897595,0.001959028,0.13406357,0.004309286,0.000032629356],"about_ca_topic_score_codex":0.0048508393,"about_ca_topic_score_gemma":0.0065174736,"teacher_disagreement_score":0.008400766,"about_ca_system_score_codex":0.0029803384,"about_ca_system_score_gemma":0.0034926145,"threshold_uncertainty_score":0.04091388},"labels":[],"label_agreement":null},{"id":"W2963042078","doi":"10.4230/lipics.itcs.2017.33","title":"Testing Submodularity and Other Properties of Valuation Functions","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Property testing; Submodular set function; Bounding overwatch; Constant (computer programming); Mathematics; Valuation (finance); Discrete mathematics; Function (biology); Monotonic function; Constant function; Combinatorics; Computer science; Piecewise; Mathematical analysis","score_opus":0.062271835273430644,"score_gpt":0.2795524570611236,"score_spread":0.21728062178769295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963042078","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.3983068,0.0010473027,0.5822521,0.0038509031,0.0001283425,0.00023043824,0.0013804911,0.0016817463,0.011121979],"genre_scores_gemma":[0.94002855,0.00027872395,0.056443263,0.0004500112,0.00013117859,0.00013419136,0.0007762197,0.00012783094,0.0016300309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946136,0.0014679338,0.00030832866,0.0014606235,0.0013585455,0.00079098175],"domain_scores_gemma":[0.9423808,0.046168555,0.0024432598,0.0062513514,0.0015503681,0.0012056514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059765754,0.001639372,0.002287468,0.000978439,0.0009276916,0.0035647524,0.0035917659,0.0017058882,0.0053617726],"category_scores_gemma":[0.049286272,0.0005399822,0.0018941433,0.0016196874,0.0036903606,0.012300061,0.0034777597,0.0050001703,0.00060777523],"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.0029107248,0.0011887151,0.02683572,0.00086662994,0.00034539748,0.00080355123,0.00095173967,0.29922405,0.017028159,0.44077387,0.008331108,0.20074043],"study_design_scores_gemma":[0.00012163295,0.00037873286,0.0013437576,0.000051473708,0.00006152775,0.0003639669,0.00017141139,0.60641956,0.007304407,0.38229337,0.0014498791,0.000040344654],"about_ca_topic_score_codex":0.0016013987,"about_ca_topic_score_gemma":0.001341657,"teacher_disagreement_score":0.0059765754,"about_ca_system_score_codex":0.002039182,"about_ca_system_score_gemma":0.0020571444,"threshold_uncertainty_score":0.03160751},"labels":[],"label_agreement":null},{"id":"W2963085561","doi":"","title":"Fast cross-validation for incremental learning","year":2015,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"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":"Computer science; Machine learning; Artificial intelligence; Online machine learning; Range (aeronautics); Unsupervised learning; Computational learning theory; Semi-supervised learning; Domain (mathematical analysis); Process (computing); Wake-sleep algorithm; Base (topology); Incremental learning; Instance-based learning; Computational complexity theory; Algorithm; Mathematics; Generalization error","score_opus":0.07752648522303678,"score_gpt":0.22234580540913632,"score_spread":0.14481932018609955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963085561","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.003785755,0.0003763849,0.9923723,0.00008293493,0.000083268584,0.00009892482,0.000096725154,0.0025436096,0.0005601283],"genre_scores_gemma":[0.17394511,0.00034609754,0.81981087,0.0003102357,0.00019679558,0.0009071851,0.0015587206,0.00093588314,0.0019891188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929864,0.0029611876,0.000418057,0.0013466871,0.0019247475,0.00036291886],"domain_scores_gemma":[0.97807807,0.01228495,0.0009013192,0.003926147,0.004435875,0.000373642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010472253,0.001960506,0.0020563654,0.0028780212,0.0010952527,0.0014865156,0.0048037195,0.002174071,0.004234321],"category_scores_gemma":[0.04559889,0.0010266267,0.0015702561,0.0020831116,0.0013120882,0.0023344662,0.0028946605,0.0041650576,0.002745872],"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.00038526923,0.00026483534,0.0031190254,0.0003863856,0.00036113945,0.00017251122,0.00014275152,0.44803584,0.0055230893,0.02565228,0.014876299,0.5010807],"study_design_scores_gemma":[0.000023373053,0.00004807406,0.0003237913,0.000019838495,0.000019751376,0.000046329915,0.000008243514,0.9838239,0.0020562394,0.011870439,0.0017460601,0.000013883714],"about_ca_topic_score_codex":0.0044686687,"about_ca_topic_score_gemma":0.0046340004,"teacher_disagreement_score":0.010472253,"about_ca_system_score_codex":0.0013936025,"about_ca_system_score_gemma":0.0029039502,"threshold_uncertainty_score":0.055383205},"labels":[],"label_agreement":null},{"id":"W2963164464","doi":"","title":"Ranking to Learn: Feature Ranking and Selection via Eigenvector Centrality","year":2017,"lang":"en","type":"article","venue":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Technische Universität Dortmund; Institut National de Recherche en Sciences et Technologies pour l'Environnement et l'Agriculture; Vysoká Škola Ekonomická v Praze; National Research Council Canada; Indian Council of Agricultural Research; Università degli Studi di Torino; Universita degli Studi di Bari Aldo Moro; Politechnika Warszawska; University of Oregon; Universidade do Porto; Politechnika Poznańska; Università degli Studi di Ferrara; University of Ottawa","keywords":"Centrality; Feature selection; Computer science; Graph; Dimensionality reduction; Ranking (information retrieval); Artificial intelligence; Data mining; Pattern recognition (psychology); Filter (signal processing); Machine learning; Mathematics; Theoretical computer science; Computer vision","score_opus":0.011126361855161379,"score_gpt":0.2594980136220977,"score_spread":0.2483716517669363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963164464","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.030204244,0.0013406699,0.9626785,0.0008335713,0.00022243899,0.00012142232,0.00050273514,0.0019249225,0.0021715208],"genre_scores_gemma":[0.3979136,0.0011345617,0.5839291,0.000435735,0.00064229436,0.0003349914,0.0036100731,0.00094854686,0.011050969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980415,0.0007410475,0.00009511432,0.0003835901,0.00052089547,0.00021783973],"domain_scores_gemma":[0.9945104,0.003807807,0.00021329522,0.0005550436,0.0007111803,0.00020217933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023362616,0.0014627115,0.0023496086,0.003606018,0.0012437452,0.0026273145,0.0022859462,0.0018037948,0.004535223],"category_scores_gemma":[0.013075449,0.0008394823,0.0015856737,0.0033454418,0.000965922,0.0034800076,0.0018389568,0.0023530694,0.0023062122],"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.00049100514,0.0004894973,0.0035690553,0.00027769504,0.00027284102,0.0002163923,0.00022535019,0.15051082,0.0050488566,0.033148035,0.04162333,0.76412714],"study_design_scores_gemma":[0.000067559595,0.00008906342,0.00063536497,0.00002289468,0.000051330797,0.00007922975,0.000059414077,0.94670564,0.0016907457,0.047506824,0.0030613467,0.000030629806],"about_ca_topic_score_codex":0.0060114204,"about_ca_topic_score_gemma":0.009256029,"teacher_disagreement_score":0.0060114204,"about_ca_system_score_codex":0.0009315365,"about_ca_system_score_gemma":0.0018742648,"threshold_uncertainty_score":0.015171826},"labels":[],"label_agreement":null},{"id":"W2963375484","doi":"","title":"PAC-Bayes bounds for stable algorithms with instance-dependent priors","year":2018,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Defence Science and Technology Group; DeepMind; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Simons Institute for the Theory of Computing, University of California Berkeley; Office of Defense Programs; Multidisciplinary University Research Initiative; Engineering and Physical Sciences Research Council; Defence Science and Technology Laboratory; U.S. Department of Defense; Alberta Innovates; Alberta Machine Intelligence Institute","keywords":"Prior probability; Bayes' theorem; Stability (learning theory); Algorithm; Mathematics; Gaussian; Artificial intelligence; Computer science; Upper and lower bounds; Naive Bayes classifier; Classifier (UML); Pattern recognition (psychology); Bayesian probability; Support vector machine; Machine learning","score_opus":0.00848001380485293,"score_gpt":0.22495464049599762,"score_spread":0.21647462669114467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963375484","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.0036028835,0.0016509123,0.9900102,0.000445269,0.00009797851,0.00005797334,0.0000621994,0.00024298833,0.0038295519],"genre_scores_gemma":[0.34346563,0.0038949798,0.6386814,0.0014774479,0.0011272718,0.0011895433,0.0007007752,0.0017312441,0.0077316603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9797773,0.0077823205,0.00096940325,0.002893615,0.0072700595,0.0013073491],"domain_scores_gemma":[0.84287065,0.13199534,0.005092165,0.009169442,0.009091675,0.0017807505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022557218,0.003487689,0.0026976536,0.0037610037,0.0021492795,0.005700478,0.004187939,0.003994776,0.007489618],"category_scores_gemma":[0.15660478,0.0015406661,0.0026667516,0.0026996867,0.0065259608,0.01183442,0.0061390926,0.010841559,0.0021850658],"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.00042260255,0.00011428799,0.0015495325,0.00051130744,0.00020089737,0.00016234648,0.0003585706,0.24830131,0.0027822219,0.66550416,0.003985277,0.07610747],"study_design_scores_gemma":[0.000018201408,0.00010879513,0.00032046027,0.00013650613,0.000049412803,0.000118594966,0.000032931282,0.6833974,0.0028425385,0.31077278,0.0021574867,0.000044962213],"about_ca_topic_score_codex":0.001503366,"about_ca_topic_score_gemma":0.0015815565,"teacher_disagreement_score":0.022557218,"about_ca_system_score_codex":0.004935547,"about_ca_system_score_gemma":0.0034935742,"threshold_uncertainty_score":0.11929536},"labels":[],"label_agreement":null},{"id":"W2963487534","doi":"10.1609/aaai.v32i1.12095","title":"Planning With Pixels in (Almost) Real Time","year":2018,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Alberta","keywords":"Computer science; Pixel; Artificial intelligence; State (computer science); Computer vision; Machine learning; Algorithm","score_opus":0.0072909441033548,"score_gpt":0.2537958165596243,"score_spread":0.2465048724562695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963487534","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.07063064,0.00018021262,0.909744,0.00023919942,0.00007006302,0.00011261586,0.00017635392,0.008133509,0.0107133575],"genre_scores_gemma":[0.56282306,0.00010880172,0.43140444,0.00011706546,0.000019103665,0.00013742605,0.00035436338,0.00045115605,0.004584509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994696,0.00013848179,0.000034569308,0.00016627928,0.0001343332,0.0000568462],"domain_scores_gemma":[0.9988605,0.0006326208,0.000081801074,0.00027142567,0.000104838706,0.000048895985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007681923,0.0007998739,0.0005844889,0.00034722048,0.00031837542,0.0009851153,0.0011210488,0.0006810572,0.00827751],"category_scores_gemma":[0.003034231,0.0003352213,0.0003365244,0.0003844346,0.00090410165,0.001565463,0.0010221219,0.00084070547,0.0012494826],"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.0010949933,0.00021253566,0.0016566009,0.00017912238,0.00007482842,0.00017540439,0.00028832274,0.41145626,0.018663313,0.020474363,0.007055395,0.53866893],"study_design_scores_gemma":[0.00007781392,0.0001377357,0.00043180984,0.000015455818,0.00002099909,0.000054495034,0.00007395544,0.9602289,0.013343191,0.022097802,0.0035027454,0.0000149621155],"about_ca_topic_score_codex":0.0052548843,"about_ca_topic_score_gemma":0.0077791894,"teacher_disagreement_score":0.00827751,"about_ca_system_score_codex":0.00053683715,"about_ca_system_score_gemma":0.00096584833,"threshold_uncertainty_score":0.027691007},"labels":[],"label_agreement":null},{"id":"W2963554831","doi":"10.1609/aaai.v32i1.11627","title":"Sample-Efficient Learning of Mixtures","year":2018,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sample complexity; Logarithm; Mathematics; Combinatorics; Distribution (mathematics); Class (philosophy); Sample (material); Upper and lower bounds; Sample size determination; Total variation; Discrete mathematics; Probability distribution; Statistics; Computer science; Artificial intelligence; Mathematical analysis; Physics","score_opus":0.009118810389095873,"score_gpt":0.25906288062786775,"score_spread":0.24994407023877188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963554831","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.006441674,0.0004109705,0.99117285,0.0003164993,0.0000360059,0.000051871142,0.00007821657,0.0005307718,0.000961094],"genre_scores_gemma":[0.35080698,0.0010830099,0.6382984,0.0009118396,0.00043924962,0.00048656727,0.00092564407,0.00047444092,0.0065739667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949714,0.0016137976,0.00026983413,0.0015947635,0.0011759643,0.00037413236],"domain_scores_gemma":[0.9856082,0.0098481,0.00091606,0.002061552,0.0010387003,0.0005274048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005594072,0.0022716268,0.0035425455,0.001653691,0.0012502713,0.0032478294,0.004774316,0.0034763487,0.0033956342],"category_scores_gemma":[0.030672584,0.0018003244,0.002957114,0.0020194205,0.0033398643,0.009454929,0.0053398837,0.006730237,0.0012190122],"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.00053565763,0.00024116124,0.0023696197,0.00030332198,0.00025312632,0.00017220723,0.00024150027,0.7757091,0.0026826877,0.12867498,0.0034871602,0.085329585],"study_design_scores_gemma":[0.000015612615,0.00003249619,0.00011828003,0.000010003067,0.00001493019,0.000036214973,0.000008945509,0.94957715,0.00065518625,0.04884658,0.000670926,0.000013667278],"about_ca_topic_score_codex":0.0035141725,"about_ca_topic_score_gemma":0.0027951514,"teacher_disagreement_score":0.005594072,"about_ca_system_score_codex":0.0027194924,"about_ca_system_score_gemma":0.0016957452,"threshold_uncertainty_score":0.029584646},"labels":[],"label_agreement":null},{"id":"W2963582482","doi":"10.24963/ijcai.2018/666","title":"Organizing Experience: a Deeper Look at Replay Mechanisms for Sample-Based Planning in Continuous State Domains","year":2018,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":29,"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":"Computer science; Sample (material); Flexibility (engineering); Function (biology); Parametric statistics; State (computer science); Artificial intelligence; Machine learning; Algorithm","score_opus":0.014943079806890917,"score_gpt":0.28297479998291863,"score_spread":0.2680317201760277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963582482","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.010262436,0.00034104896,0.9871258,0.00030183437,0.000020189502,0.000029310293,0.00003670169,0.0002777692,0.0016048629],"genre_scores_gemma":[0.7018416,0.0009516961,0.29248628,0.0002542962,0.00007137605,0.0002772346,0.00016443747,0.00022498329,0.0037280868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890363,0.00041125956,0.00006287749,0.00025327835,0.00026022005,0.000108772554],"domain_scores_gemma":[0.995928,0.0023100355,0.00037640266,0.0008438239,0.00029899224,0.00024283362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024219744,0.000869184,0.0011937807,0.000617198,0.00054072804,0.0021077401,0.00269295,0.0011736965,0.004323321],"category_scores_gemma":[0.010269344,0.00075459294,0.0013500564,0.00068836333,0.0020029568,0.0061050947,0.002822429,0.003199623,0.00049704785],"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.0001605057,0.000106734624,0.001246269,0.00019499788,0.00010890103,0.00013064074,0.00057634007,0.6774252,0.0026330163,0.251763,0.0010207511,0.06463364],"study_design_scores_gemma":[0.000014804043,0.0001072835,0.00011813978,0.000029798459,0.00001527412,0.000046629415,0.00004650946,0.89839435,0.0009251411,0.09878394,0.0014968825,0.000021279066],"about_ca_topic_score_codex":0.0032025245,"about_ca_topic_score_gemma":0.0024869742,"teacher_disagreement_score":0.004323321,"about_ca_system_score_codex":0.0011615775,"about_ca_system_score_gemma":0.0010999024,"threshold_uncertainty_score":0.014463007},"labels":[],"label_agreement":null},{"id":"W2963711525","doi":"","title":"A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel Learning","year":2013,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"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":"Kernel (algebra); Algorithm; Mathematics; Gradient descent; Sampling (signal processing); Mathematical optimization; Exponential function; Computational complexity theory; Computer science; Artificial intelligence; Discrete mathematics","score_opus":0.011041216321354682,"score_gpt":0.25144452274013557,"score_spread":0.24040330641878088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963711525","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.003994834,0.00007327898,0.99520653,0.00009477796,0.00002065811,0.000028917362,0.000012100333,0.00031984266,0.00024910015],"genre_scores_gemma":[0.17603557,0.0001053313,0.8206937,0.00017847809,0.00008607884,0.0002870258,0.00015752709,0.00014687677,0.0023094127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989661,0.0004514484,0.0000450704,0.00019480415,0.00025147529,0.00009109438],"domain_scores_gemma":[0.998108,0.0009342487,0.00018044653,0.00034714345,0.00030301642,0.00012699208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021186057,0.00080413,0.0014728233,0.0005915409,0.00056042784,0.0008262423,0.0025483053,0.0016054835,0.0021601254],"category_scores_gemma":[0.006282378,0.00066389184,0.0007109806,0.0007461431,0.0011042941,0.0016725814,0.0016201239,0.0017007719,0.00097072584],"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.0003642997,0.00027805023,0.0014925349,0.00013179133,0.00015849748,0.000176665,0.00009866488,0.6989834,0.0074750297,0.05406493,0.0055741756,0.23120198],"study_design_scores_gemma":[0.000019232908,0.000024480398,0.000041308176,0.0000019149493,0.0000032056464,0.000015037571,0.0000023949267,0.99420506,0.00045608028,0.0049204277,0.00030640376,0.000004416672],"about_ca_topic_score_codex":0.0025441926,"about_ca_topic_score_gemma":0.0034189732,"teacher_disagreement_score":0.0025483053,"about_ca_system_score_codex":0.0008329723,"about_ca_system_score_gemma":0.0017079163,"threshold_uncertainty_score":0.011204362},"labels":[],"label_agreement":null},{"id":"W2964075712","doi":"","title":"Budgeted learning of nailve-bayes classifiers","year":2002,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":77,"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":"Computer science; Feature (linguistics); Naive Bayes classifier; Machine learning; Feature selection; Artificial intelligence; Process (computing); Value (mathematics); Selection (genetic algorithm); Bayes' theorem; Bayesian probability","score_opus":0.049034054115880535,"score_gpt":0.16431362558951368,"score_spread":0.11527957147363314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964075712","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.05841257,0.0016123669,0.9338756,0.0009397648,0.00008848613,0.00024264133,0.00024509022,0.00066261645,0.00392084],"genre_scores_gemma":[0.64425874,0.00081443513,0.34512147,0.0005338945,0.00019289136,0.00066778454,0.0007380086,0.00015238763,0.007520336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655306,0.0016248324,0.0002449997,0.0006233759,0.0005884242,0.0003654111],"domain_scores_gemma":[0.98729974,0.010058659,0.00054513145,0.0008250432,0.0009306652,0.00034075722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009393721,0.0010926942,0.0034181708,0.0012402601,0.0009148617,0.0022669232,0.004035179,0.003158552,0.0052339067],"category_scores_gemma":[0.028371736,0.0016428885,0.000968224,0.0012299663,0.0015545164,0.006143269,0.0027070774,0.0027555774,0.0011700211],"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.0014673519,0.0003803144,0.0043260534,0.00028241146,0.00013784667,0.00010501173,0.00041720734,0.6055051,0.0012441592,0.061525214,0.005667001,0.31894228],"study_design_scores_gemma":[0.000054523425,0.00005999951,0.0001957933,0.00003880874,0.00001541922,0.000023252502,0.000025634654,0.95706034,0.0004723578,0.041322816,0.0007189697,0.000012120147],"about_ca_topic_score_codex":0.0062760226,"about_ca_topic_score_gemma":0.0066692345,"teacher_disagreement_score":0.009393721,"about_ca_system_score_codex":0.0021225703,"about_ca_system_score_gemma":0.0021197663,"threshold_uncertainty_score":0.04967934},"labels":[],"label_agreement":null},{"id":"W2965216507","doi":"10.1609/aaai.v33i01.33019957","title":"Variational BEJG Solvers for Marginal-MAP Inference with Accurate Approximation of B-Conditional Entropy","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","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":"Inference; Graphical model; Approximate inference; Computer science; Belief propagation; Variable elimination; Probabilistic logic; Mathematical optimization; Principle of maximum entropy; Algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.03291802856887852,"score_gpt":0.2828693483141397,"score_spread":0.24995131974526116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965216507","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.0024024332,0.0001833322,0.99486166,0.0002548201,0.00003318364,0.000042519456,0.0000993518,0.00038890232,0.0017337368],"genre_scores_gemma":[0.27096716,0.0004546742,0.72070533,0.00060455996,0.00013687229,0.0005379561,0.0007528062,0.0009580625,0.004882562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904805,0.00034494852,0.000053656833,0.00019305604,0.00023883088,0.000121381425],"domain_scores_gemma":[0.99506277,0.003840051,0.0001960771,0.00030708688,0.00041211286,0.00018191675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027389938,0.0015979998,0.002165488,0.0009932664,0.00077930593,0.0020668507,0.003063114,0.0024064002,0.007056151],"category_scores_gemma":[0.010485088,0.0012981904,0.0018059234,0.0013225469,0.0016046016,0.0017091777,0.003218982,0.004704193,0.0010407344],"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.000040778476,0.000032099986,0.00041084824,0.00009982389,0.000050727715,0.000056826484,0.00006877422,0.9248056,0.00036517336,0.048467062,0.00198748,0.023614885],"study_design_scores_gemma":[0.0000053842564,0.0000025460824,0.000016619573,0.0000061644027,0.0000028061822,0.0000046649184,0.000005138512,0.9868203,0.000079064805,0.012753563,0.00030164456,0.0000020770592],"about_ca_topic_score_codex":0.019604616,"about_ca_topic_score_gemma":0.022602655,"teacher_disagreement_score":0.019604616,"about_ca_system_score_codex":0.0024034737,"about_ca_system_score_gemma":0.0047570756,"threshold_uncertainty_score":0.03898102},"labels":[],"label_agreement":null},{"id":"W2965465046","doi":"","title":"Learning proposals for sequential importance samplers using reinforced variational inference.","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Inference; Computer science; Artificial intelligence; Machine learning","score_opus":0.05752040479871633,"score_gpt":0.3716738520567237,"score_spread":0.31415344725800737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965465046","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.008638158,0.0004400722,0.9893523,0.00027098102,0.0001146322,0.00008178483,0.00008651745,0.0003602753,0.00065523986],"genre_scores_gemma":[0.44211584,0.00056727725,0.54778683,0.0005625978,0.00048799353,0.00079042703,0.0011332289,0.00051116996,0.006044552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977252,0.0013397177,0.000096445314,0.00034236227,0.00029290584,0.00020329223],"domain_scores_gemma":[0.9722268,0.024105372,0.0006656387,0.0012135549,0.0010902777,0.0006983842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008636348,0.0013902375,0.0026023176,0.001531719,0.00074352394,0.0018844743,0.004215426,0.0031002436,0.0058848895],"category_scores_gemma":[0.0464287,0.0022681798,0.0014493999,0.0014713662,0.0024463197,0.0041126646,0.003230775,0.0052924,0.0013011248],"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.0010141507,0.00031589283,0.0034951416,0.00038888014,0.00032195792,0.00016555616,0.00036973233,0.6247612,0.0017205207,0.214579,0.009970718,0.14289716],"study_design_scores_gemma":[0.00007654202,0.000030359215,0.000063664076,0.000021862646,0.000017922308,0.00001373771,0.000009225895,0.95443606,0.00020827539,0.04459978,0.0005144307,0.000008162379],"about_ca_topic_score_codex":0.00573525,"about_ca_topic_score_gemma":0.0097742295,"teacher_disagreement_score":0.008636348,"about_ca_system_score_codex":0.0013825223,"about_ca_system_score_gemma":0.0023021891,"threshold_uncertainty_score":0.045673907},"labels":[],"label_agreement":null},{"id":"W2966418478","doi":"10.48550/arxiv.1809.04092","title":"A Fixed-Depth Size-Hierarchy Theorem for AC$^0[\\\\oplus]$ via the Coin\\n Problem","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Circuit complexity; Boolean circuit; Mathematics; Boolean function; Discrete mathematics; Truth table; Combinatorics; Binary logarithm; Upper and lower bounds; Function (biology); Polynomial; Parity function; Computable function; Random oracle; Electronic circuit; Algorithm; Computer science; Boolean expression; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.029399169374624553,"score_gpt":0.1913531464959238,"score_spread":0.16195397712129925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966418478","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.27963623,0.0018154401,0.56176096,0.009384718,0.00029374825,0.0003612941,0.0020753166,0.003195842,0.14147642],"genre_scores_gemma":[0.83471495,0.0009123742,0.1282664,0.0030451263,0.00026395652,0.00043138626,0.0013351782,0.0007143648,0.030316204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998041,0.000271068,0.00009407988,0.00042651838,0.0006657525,0.0005015541],"domain_scores_gemma":[0.994926,0.0032572823,0.00024228526,0.00077131926,0.0005444202,0.00025868777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012922536,0.0008327073,0.0007747259,0.0008780437,0.0013984072,0.002747388,0.0023717722,0.0011136014,0.015803084],"category_scores_gemma":[0.010158835,0.0006314799,0.0016136419,0.0010142081,0.002519898,0.008976737,0.0035749462,0.0039331946,0.0014870061],"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.00033928687,0.00009704568,0.0018102005,0.00037711288,0.00003817083,0.00012904296,0.00040694667,0.011319173,0.009703282,0.9007347,0.012197432,0.06284754],"study_design_scores_gemma":[0.00009469396,0.00009327344,0.0010739564,0.000088388806,0.00009333831,0.00025029565,0.0001274864,0.085897274,0.011129975,0.8862398,0.014856044,0.000055502474],"about_ca_topic_score_codex":0.0073782965,"about_ca_topic_score_gemma":0.011016075,"teacher_disagreement_score":0.015803084,"about_ca_system_score_codex":0.0045115743,"about_ca_system_score_gemma":0.0026055546,"threshold_uncertainty_score":0.05286652},"labels":[],"label_agreement":null},{"id":"W2969998143","doi":"10.48550/arxiv.1908.07585","title":"Fast-rate PAC-Bayes Generalization Bounds via Shifted Rademacher Processes","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"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":"Generalization; Bayes' theorem; Computer science; Mathematics; Bayesian probability; Artificial intelligence","score_opus":0.036428638364992175,"score_gpt":0.18954022416904012,"score_spread":0.15311158580404793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969998143","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.010179732,0.0021137407,0.9660699,0.001932531,0.0001834644,0.00008509045,0.00018846699,0.00035581685,0.018891232],"genre_scores_gemma":[0.5656984,0.0059351767,0.39420062,0.0031586664,0.001751475,0.0009523453,0.00073666894,0.0015396387,0.026027136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991735,0.0029135365,0.00026823406,0.0013765428,0.0029933592,0.00071340654],"domain_scores_gemma":[0.9509233,0.037812497,0.0019611854,0.0046941033,0.0035825965,0.0010263263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014620848,0.0029257357,0.0024768773,0.0033423477,0.0020412197,0.0050751227,0.004087427,0.00294797,0.0097377775],"category_scores_gemma":[0.07968017,0.0014441919,0.0025688955,0.0023400043,0.0057115476,0.015813367,0.0077176136,0.011036967,0.0025662368],"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.000055840384,0.000032099786,0.00043847875,0.00010577672,0.000032003016,0.00006826372,0.00019078124,0.060954355,0.00065950816,0.9155305,0.002642633,0.019289762],"study_design_scores_gemma":[0.000010371579,0.000023906317,0.00017882147,0.000056505814,0.000017943945,0.000068171896,0.000023914068,0.29227027,0.000586982,0.703743,0.0029910698,0.000029062774],"about_ca_topic_score_codex":0.003369473,"about_ca_topic_score_gemma":0.002914109,"teacher_disagreement_score":0.014620848,"about_ca_system_score_codex":0.0058557424,"about_ca_system_score_gemma":0.0028734582,"threshold_uncertainty_score":0.07732338},"labels":[],"label_agreement":null},{"id":"W2970731410","doi":"","title":"Exact Combinatorial Optimization with Graph Convolutional Neural Networks","year":2019,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Solver; Bipartite graph; Theoretical computer science; Graph; Artificial intelligence; Convolutional neural network; Joins; Deep learning; Branch and bound; Mathematical optimization; Machine learning; Algorithm; Mathematics; Programming language","score_opus":0.004437494179705834,"score_gpt":0.2010936910741419,"score_spread":0.19665619689443609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970731410","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.035376787,0.0007117163,0.9510381,0.0010361477,0.00008981536,0.00006622494,0.00031481122,0.0018522219,0.009514086],"genre_scores_gemma":[0.72105956,0.0005420191,0.2661403,0.0005827365,0.0000996114,0.0002717952,0.0008953312,0.00064537907,0.009763231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995109,0.00014605006,0.00002087163,0.00012396359,0.000112857444,0.00008541542],"domain_scores_gemma":[0.99837863,0.0011039112,0.00013247787,0.00016550485,0.00012978313,0.000089700334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009933567,0.0012266401,0.0010942067,0.0006697681,0.00039804194,0.0013126795,0.0016786612,0.0018124776,0.0047338903],"category_scores_gemma":[0.0057444233,0.0007274356,0.000678269,0.0011008935,0.0011682042,0.0020985752,0.0014159186,0.0023429294,0.00077898666],"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.000032709017,0.000025968606,0.00027847246,0.000034385626,0.000013097158,0.000020293188,0.00001032102,0.96252394,0.00020927173,0.015984239,0.0015722775,0.019294973],"study_design_scores_gemma":[0.0000027892138,0.0000020254013,0.000014593643,0.000002470089,8.936876e-7,0.0000015851049,8.569188e-7,0.99253064,0.000052562595,0.0072811604,0.00010941966,9.294946e-7],"about_ca_topic_score_codex":0.011992064,"about_ca_topic_score_gemma":0.02062302,"teacher_disagreement_score":0.011992064,"about_ca_system_score_codex":0.0024356756,"about_ca_system_score_gemma":0.002310395,"threshold_uncertainty_score":0.02384454},"labels":[],"label_agreement":null},{"id":"W2971070621","doi":"10.4230/lipics.concur.2019.9","title":"Computing Probabilistic Bisimilarity Distances for Probabilistic Automata","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"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":"Probabilistic logic; Computer science; Probabilistic automaton; Automaton; Theoretical computer science; Artificial intelligence","score_opus":0.011532384648756541,"score_gpt":0.2636695619378635,"score_spread":0.25213717728910695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971070621","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.057571292,0.000099909215,0.9400107,0.0001772568,0.00003141724,0.00008945485,0.00012257676,0.0005342207,0.0013630502],"genre_scores_gemma":[0.57581836,0.00011646833,0.4212777,0.00015330936,0.00003914165,0.00025444385,0.00045007648,0.0002094996,0.0016809927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951845,0.0014009749,0.0005024987,0.0013820792,0.0011942742,0.00033559775],"domain_scores_gemma":[0.9886352,0.007715312,0.00084425486,0.0014217709,0.00096092344,0.0004226013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030208302,0.0009937249,0.0011837223,0.0022028522,0.00092110445,0.002595654,0.0018595532,0.002028804,0.0031617035],"category_scores_gemma":[0.024741326,0.00066711515,0.0014203456,0.0014513244,0.0026581136,0.00563705,0.0043590073,0.0028861812,0.0006783508],"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.00031595063,0.00015360203,0.0023146868,0.00027168938,0.00011831314,0.0001289916,0.00057567016,0.22422516,0.009838816,0.6576885,0.0011683789,0.10320032],"study_design_scores_gemma":[0.000025175037,0.00007357354,0.00019518328,0.00001935387,0.000016241425,0.000047866175,0.00004844195,0.5049061,0.005636772,0.4878343,0.0011658589,0.00003108987],"about_ca_topic_score_codex":0.0010113973,"about_ca_topic_score_gemma":0.0011570062,"teacher_disagreement_score":0.0031617035,"about_ca_system_score_codex":0.002220338,"about_ca_system_score_gemma":0.0018171524,"threshold_uncertainty_score":0.016109705},"labels":[],"label_agreement":null},{"id":"W2971155082","doi":"10.1007/978-3-662-59958-7_3","title":"A Study of Three Different Approaches to Point Placement on a Line in an Inexact Model","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Embedding; Heuristic; Pairwise comparison; Algorithm; Point (geometry); Line (geometry); Adversary; Linear programming; Sequence (biology); Function (biology); Set (abstract data type); Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Geometry","score_opus":0.0940192473809117,"score_gpt":0.28303223108929837,"score_spread":0.18901298370838665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971155082","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.016918736,0.0009187357,0.9682398,0.00036846334,0.00008040442,0.00005212045,0.000053224416,0.00017502533,0.01319355],"genre_scores_gemma":[0.29151922,0.002294527,0.6888366,0.00018285323,0.0001623581,0.0001766729,0.00023443186,0.0003933524,0.016199956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763453,0.00078668207,0.00010215828,0.0003158853,0.0010117708,0.00014901356],"domain_scores_gemma":[0.9923653,0.0053011356,0.00047494538,0.0009647537,0.00061772653,0.00027601185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025629385,0.0012167275,0.0015056366,0.0015089723,0.0011330514,0.0041829413,0.004864531,0.0041054934,0.008120836],"category_scores_gemma":[0.012332539,0.0009801834,0.0018528389,0.0031109715,0.0030116518,0.005921942,0.0036017578,0.0032186576,0.0011055641],"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.00017800965,0.0001321994,0.00065301405,0.0004520351,0.00007503959,0.00014054662,0.0004447469,0.5961651,0.0013122312,0.30516404,0.0022039257,0.09307913],"study_design_scores_gemma":[0.00002989021,0.00018586061,0.00028371727,0.000071109826,0.000038673505,0.00014803313,0.000259191,0.9228354,0.0012127324,0.07067239,0.0042223064,0.000040624986],"about_ca_topic_score_codex":0.0031737443,"about_ca_topic_score_gemma":0.0035212024,"teacher_disagreement_score":0.008120836,"about_ca_system_score_codex":0.0016064093,"about_ca_system_score_gemma":0.0013175725,"threshold_uncertainty_score":0.027166903},"labels":[],"label_agreement":null},{"id":"W2972514247","doi":"10.1007/978-1-4471-7452-3_3","title":"Elements of Computational Learning Theory","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Learnability; VC dimension; Empirical risk minimization; Probably approximately correct learning; Generalization; Statistical learning theory; Dimension (graph theory); Computational learning theory; Algorithmic learning theory; Computer science; Learning theory; Structural risk minimization; Computational complexity theory; Artificial intelligence; Mathematics; Theoretical computer science; Algorithm; Unsupervised learning; Pure mathematics; Support vector machine; Mathematical analysis; Mathematics education","score_opus":0.009701868012260965,"score_gpt":0.23809970416770576,"score_spread":0.2283978361554448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972514247","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010420651,0.019989861,0.19938256,0.008552662,0.0023458365,0.000058721434,0.00032117398,0.00033594575,0.76797116],"genre_scores_gemma":[0.09666141,0.0394931,0.14763853,0.0045311023,0.0063229827,0.00049516873,0.0010833287,0.0005976528,0.70317674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994523,0.00015474134,0.000024229726,0.00008336849,0.00025799978,0.000027483544],"domain_scores_gemma":[0.99918026,0.0005304151,0.00002237485,0.00012803276,0.00011072875,0.00002806039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006442751,0.0008951225,0.00065446674,0.001243859,0.0009961777,0.0033528686,0.0010683591,0.0010700729,0.023208369],"category_scores_gemma":[0.002003566,0.00041790894,0.0003899011,0.0016918604,0.0047907457,0.004488977,0.0012295019,0.003695138,0.011434282],"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.000002376202,0.0000066734447,0.00002404651,0.000070254275,0.0000030123265,0.000007571291,0.000064088745,0.00060571166,0.00006723115,0.94305956,0.024218077,0.03187152],"study_design_scores_gemma":[0.0000013777343,0.0000025343577,0.00002746205,0.000064642794,0.0000015504677,0.000019465862,0.000017540096,0.000967248,0.00007582212,0.8345655,0.16425334,0.0000034548154],"about_ca_topic_score_codex":0.00089538185,"about_ca_topic_score_gemma":0.0011843944,"teacher_disagreement_score":0.023208369,"about_ca_system_score_codex":0.0017094552,"about_ca_system_score_gemma":0.0013266192,"threshold_uncertainty_score":0.07763976},"labels":[],"label_agreement":null},{"id":"W2972833528","doi":"10.1007/978-3-030-30446-1_13","title":"Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Heuristics; Computer science; Boolean satisfiability problem; Solver; Inference; Problem solver; Theoretical computer science; Algorithm; Artificial intelligence; Programming language","score_opus":0.013847354109660705,"score_gpt":0.24150034008730892,"score_spread":0.22765298597764821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972833528","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.012037232,0.00080879143,0.96436125,0.0009997217,0.00027294355,0.0001625381,0.0015182623,0.0064040823,0.013435239],"genre_scores_gemma":[0.15253593,0.00043164173,0.82928604,0.0009977102,0.00031851928,0.0002946403,0.006137205,0.0014169703,0.008581304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838126,0.00045552358,0.000112714304,0.0004948969,0.00042740154,0.0001282091],"domain_scores_gemma":[0.9950163,0.0026143189,0.00014724681,0.0014749818,0.00060921436,0.00013807818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016543863,0.0011410459,0.0015188277,0.001703667,0.0010218312,0.001809826,0.0037416413,0.0016017624,0.016523117],"category_scores_gemma":[0.012273697,0.00077292847,0.0021447784,0.0017652258,0.0011635693,0.0046978192,0.0032843486,0.0043154545,0.0051938654],"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.0003306222,0.00031264673,0.0026057323,0.0006610108,0.00016372278,0.00014399666,0.00023443799,0.08620818,0.0049907016,0.118063085,0.055810876,0.73047495],"study_design_scores_gemma":[0.000076856275,0.00012361893,0.0005616235,0.00014513967,0.00009267675,0.00016135283,0.00007532691,0.61065286,0.0032321112,0.36567575,0.019171814,0.000030847725],"about_ca_topic_score_codex":0.0039903237,"about_ca_topic_score_gemma":0.01337505,"teacher_disagreement_score":0.016523117,"about_ca_system_score_codex":0.0012328799,"about_ca_system_score_gemma":0.001866689,"threshold_uncertainty_score":0.05527538},"labels":[],"label_agreement":null},{"id":"W2973912839","doi":"10.1007/978-3-030-31157-5_8","title":"Learning Communicating State Machines","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Finite-state machine; Conformance testing; Automaton; Modular design; Oracle; Component (thermodynamics); Theoretical computer science; Deterministic finite automaton; Equivalence (formal languages); Artificial intelligence; Algorithm; Programming language; Discrete mathematics; Mathematics","score_opus":0.011895957843734883,"score_gpt":0.25431404813083874,"score_spread":0.24241809028710387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973912839","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.014135313,0.0008444159,0.96390986,0.0007434564,0.00031496878,0.000047414196,0.00032980944,0.0022559653,0.017418856],"genre_scores_gemma":[0.62942487,0.0024165565,0.31153232,0.00057784247,0.0006529747,0.00038944674,0.0033497813,0.00062631915,0.05102992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954754,0.00011199236,0.000025930105,0.00015990126,0.000117187476,0.00003739751],"domain_scores_gemma":[0.9975988,0.0015782835,0.00009670929,0.0004893901,0.00018058665,0.000056216104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007221307,0.00068002724,0.0007740359,0.00070596987,0.00052054704,0.0015077126,0.0010268302,0.000986895,0.008998874],"category_scores_gemma":[0.005494241,0.00050397724,0.0006647111,0.00091961765,0.0009547786,0.0026391488,0.0015499766,0.00206646,0.002814957],"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.00014649435,0.000110898036,0.0014534261,0.00023643833,0.00009429206,0.00011205983,0.00021813026,0.17292975,0.004853124,0.319091,0.017128805,0.4836256],"study_design_scores_gemma":[0.000008881903,0.00002890535,0.00021418193,0.000029944336,0.00001829986,0.00005606538,0.000022538252,0.63157564,0.003245425,0.3566958,0.008090175,0.000014116244],"about_ca_topic_score_codex":0.0005041908,"about_ca_topic_score_gemma":0.0006285518,"teacher_disagreement_score":0.008998874,"about_ca_system_score_codex":0.0005121519,"about_ca_system_score_gemma":0.00050248514,"threshold_uncertainty_score":0.03010422},"labels":[],"label_agreement":null},{"id":"W2977816479","doi":"10.1109/qrs.2019.00053","title":"Learning and Adaptive Testing of Nondeterministic State Machines","year":2019,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Computer Research Institute of Montréal","funders":"","keywords":"Nondeterministic algorithm; Computer science; TRACE (psycholinguistics); Equivalence (formal languages); Set (abstract data type); Theoretical computer science; Conformance testing; Sequence (biology); Artificial intelligence; Algorithm; Mathematics; Programming language; Discrete mathematics; Standardization","score_opus":0.010728446508045355,"score_gpt":0.2445321763372586,"score_spread":0.23380372982921324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977816479","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.11177653,0.0001587196,0.88550895,0.000564402,0.000028895369,0.00009053114,0.00010217037,0.00066188595,0.0011078994],"genre_scores_gemma":[0.87147725,0.00009020919,0.12679361,0.00013247036,0.00004885309,0.000185312,0.0002196573,0.00007752068,0.0009752353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933229,0.003031868,0.0003810423,0.0018255162,0.00097279606,0.0004658859],"domain_scores_gemma":[0.9633959,0.030585412,0.0015532664,0.0030130704,0.0010724077,0.00037988258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052052527,0.0008199957,0.0010303501,0.0009038424,0.0005811404,0.0016667808,0.0025773053,0.001489004,0.0014417473],"category_scores_gemma":[0.032473527,0.00061965117,0.0014535845,0.0007033696,0.0039686565,0.0047278306,0.00263784,0.0028253375,0.00014981213],"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.0006169124,0.00031104984,0.0080982745,0.0002633342,0.00018032157,0.00037017476,0.00074696104,0.63137203,0.0065063867,0.22754002,0.0009598115,0.12303486],"study_design_scores_gemma":[0.000028781002,0.00006211974,0.00026346897,0.000011714428,0.000014750228,0.000037392692,0.000032217675,0.8339506,0.0028564667,0.1624645,0.0002655184,0.000012483425],"about_ca_topic_score_codex":0.001863494,"about_ca_topic_score_gemma":0.0018932528,"teacher_disagreement_score":0.0052052527,"about_ca_system_score_codex":0.001504806,"about_ca_system_score_gemma":0.0012321485,"threshold_uncertainty_score":0.027528346},"labels":[],"label_agreement":null},{"id":"W2980693811","doi":"10.1007/s10898-020-00973-1","title":"Learning chordal extensions","year":2021,"lang":"en","type":"preprint","venue":"Journal of Global Optimization","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Chordal graph; Extension (predicate logic); Graph; Imitation; Exploit; Block (permutation group theory); Mathematical optimization; Optimization problem; Theoretical computer science; Mathematics; Algorithm; Combinatorics","score_opus":0.008315659150930637,"score_gpt":0.26428914247964763,"score_spread":0.255973483328717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980693811","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.1565126,0.0021598337,0.78595954,0.0020864268,0.0006712314,0.0001419813,0.00077018654,0.0017019559,0.049996275],"genre_scores_gemma":[0.8181174,0.001084718,0.15477794,0.0005919903,0.0005554031,0.00017192037,0.0016999226,0.00041288545,0.022587806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999218,0.00022095439,0.000052682604,0.0003126231,0.00012611653,0.000069685295],"domain_scores_gemma":[0.9962923,0.0021322314,0.00020444693,0.0007623499,0.00034338905,0.00026539023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001405326,0.00072512735,0.0009758808,0.0011202669,0.00093596434,0.0020106724,0.0011396728,0.0011701799,0.013246997],"category_scores_gemma":[0.011934573,0.00042463597,0.00076747406,0.00090125436,0.0016502363,0.00513007,0.0033458807,0.0028619368,0.0019838777],"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.00054486765,0.00016108714,0.003359588,0.00033990663,0.00009062449,0.00018693297,0.00046477304,0.054267354,0.0038302771,0.6661432,0.015967684,0.25464365],"study_design_scores_gemma":[0.00003874301,0.000084603795,0.00034139285,0.00005519762,0.000018648849,0.00007788568,0.00011762125,0.19483042,0.0005907437,0.79790664,0.005922586,0.000015511168],"about_ca_topic_score_codex":0.0005413074,"about_ca_topic_score_gemma":0.0009440828,"teacher_disagreement_score":0.013246997,"about_ca_system_score_codex":0.00058061775,"about_ca_system_score_gemma":0.00059662014,"threshold_uncertainty_score":0.044315577},"labels":[],"label_agreement":null},{"id":"W2982280042","doi":"10.5220/0011277700003274","title":"Attention for Inference Compilation","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Mila - Quebec Artificial Intelligence Institute; University of British Columbia","funders":"","keywords":"Inference; Computer science; Probabilistic logic; Latent variable; Artificial intelligence; Range (aeronautics); Machine learning; Salient; Artificial neural network; Theoretical computer science","score_opus":0.03318869698639137,"score_gpt":0.3323839105139169,"score_spread":0.29919521352752554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982280042","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.011517969,0.00019900933,0.9822183,0.0002787864,0.000050854273,0.000029221288,0.000069778405,0.0034073426,0.0022287846],"genre_scores_gemma":[0.60514146,0.0003319788,0.38764885,0.0006114163,0.0001406659,0.00017744768,0.00041254106,0.0007419305,0.0047937483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989895,0.00026643474,0.000055914694,0.00028968422,0.000267206,0.00013118824],"domain_scores_gemma":[0.99726427,0.0015654006,0.00016853171,0.00061512383,0.00029400978,0.00009265644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012692882,0.000759435,0.00064637297,0.00062574644,0.00054573524,0.0009882273,0.0020331203,0.0009828681,0.005852451],"category_scores_gemma":[0.00790942,0.0004980977,0.0007403952,0.0006514967,0.0012518293,0.0033551096,0.0023713682,0.002406384,0.0008347999],"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.00036459538,0.00015611647,0.002251496,0.00026797483,0.00010906993,0.00018062323,0.00029506907,0.40109617,0.012242568,0.12854548,0.009615266,0.44487554],"study_design_scores_gemma":[0.0000072491357,0.000016247215,0.00010083504,0.000010290677,0.000014838316,0.000021963411,0.0000062014487,0.9467547,0.002974692,0.048586816,0.0014996527,0.000006638454],"about_ca_topic_score_codex":0.005780088,"about_ca_topic_score_gemma":0.0099747935,"teacher_disagreement_score":0.005852451,"about_ca_system_score_codex":0.0015072948,"about_ca_system_score_gemma":0.0017921141,"threshold_uncertainty_score":0.019578457},"labels":[],"label_agreement":null},{"id":"W2984492834","doi":"10.1016/j.tcs.2019.11.011","title":"Finitely distinguishable erasing pattern languages","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Ministry of Education - Singapore","keywords":"Decidability; Alphabet; Mathematical proof; Equivalence (formal languages); Mathematics; Regular language; Discrete mathematics; Decision problem; Object (grammar); Dimension (graph theory); Theoretical computer science; Combinatorics; Computer science; Artificial intelligence; Algorithm; Linguistics; Automaton","score_opus":0.0051199541038309685,"score_gpt":0.2525612319938292,"score_spread":0.2474412778899982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984492834","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.27044997,0.0006955303,0.64243746,0.0038355999,0.00058210525,0.000116146024,0.0011887127,0.0029428273,0.07775154],"genre_scores_gemma":[0.8767048,0.00032382054,0.08565909,0.0012291104,0.00029919983,0.00016848267,0.0014221225,0.0008475247,0.03334595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953126,0.0010160903,0.0004445303,0.0012066659,0.0011609629,0.00085910066],"domain_scores_gemma":[0.9812165,0.011511439,0.0011078326,0.0037631,0.0013787489,0.0010224431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023389738,0.0008311416,0.0011484846,0.0015642444,0.0020641014,0.005082207,0.0027686805,0.002736108,0.015167025],"category_scores_gemma":[0.014083722,0.0011643448,0.0016216045,0.0014668237,0.0038733776,0.012754563,0.0069625564,0.0077821272,0.0030519613],"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.00016228486,0.000055365294,0.0004356807,0.000080051184,0.000015208694,0.0002326085,0.00044917004,0.0009905816,0.0028510988,0.97931427,0.0014432091,0.013970606],"study_design_scores_gemma":[0.000026275246,0.000030180128,0.00012788367,0.00002106135,0.000014237795,0.0003438694,0.00009377564,0.0055185794,0.0028394037,0.9878421,0.003120535,0.000022170965],"about_ca_topic_score_codex":0.00024650863,"about_ca_topic_score_gemma":0.00032709152,"teacher_disagreement_score":0.015167025,"about_ca_system_score_codex":0.0011044844,"about_ca_system_score_gemma":0.0011500792,"threshold_uncertainty_score":0.050738752},"labels":[],"label_agreement":null},{"id":"W2989812388","doi":"10.26615/978-954-452-056-4_088","title":"Turning Silver into Gold: Error-Focused Corpus Reannotation with Active Learning","year":2019,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Selection (genetic algorithm); Natural language processing; Gold standard (test); Quality (philosophy); Factor (programming language); Random forest; Machine learning; Statistics","score_opus":0.006310426710666149,"score_gpt":0.23154179107935463,"score_spread":0.22523136436868849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989812388","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.13247506,0.0033676396,0.7948116,0.0033154956,0.002328927,0.001212241,0.008139175,0.03837734,0.015972415],"genre_scores_gemma":[0.2520581,0.000566268,0.7043306,0.0012222358,0.00033083587,0.0012806448,0.021787137,0.0048832237,0.013540962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9847355,0.0061052563,0.0015535314,0.003277254,0.0036020945,0.00072643074],"domain_scores_gemma":[0.94934297,0.024607541,0.0024856634,0.01386996,0.008825806,0.0008680278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015713928,0.0023136737,0.002083522,0.0059266174,0.0028083564,0.005166221,0.0051080557,0.004314053,0.00408636],"category_scores_gemma":[0.048452776,0.0008967368,0.0010500911,0.004121357,0.0034866752,0.0061760824,0.008790381,0.004117757,0.0053265635],"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.0013114082,0.0008874173,0.0085799005,0.0019271314,0.00030878244,0.0009596467,0.0053254887,0.019940225,0.040090308,0.018269533,0.09176975,0.81063044],"study_design_scores_gemma":[0.00046232934,0.00082282076,0.0084310975,0.00079323095,0.00030397892,0.0013995451,0.00516728,0.4739498,0.21034497,0.09502251,0.20286645,0.00043601726],"about_ca_topic_score_codex":0.0037413999,"about_ca_topic_score_gemma":0.008819125,"teacher_disagreement_score":0.015713928,"about_ca_system_score_codex":0.001293705,"about_ca_system_score_gemma":0.0023953165,"threshold_uncertainty_score":0.08310419},"labels":[],"label_agreement":null},{"id":"W2995926104","doi":"10.1609/aaai.v34i02.5602","title":"Path Planning Problems with Side Observations—When Colonels Play Hide-and-Seek","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"Agence Nationale de la Recherche; Alexander von Humboldt-Stiftung","keywords":"Regret; Benchmark (surveying); Computer science; Path (computing); Oracle; Observability; Mathematical optimization; Mathematics; Machine learning; Geography","score_opus":0.10832251060419515,"score_gpt":0.27702353533914686,"score_spread":0.16870102473495172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995926104","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.10811049,0.00044113485,0.8727029,0.002779523,0.0001961107,0.0004868278,0.00069592695,0.0012778132,0.013309318],"genre_scores_gemma":[0.8279137,0.0003070483,0.15892439,0.00090881914,0.00011928834,0.0005965345,0.000783373,0.00025955372,0.010187208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845386,0.00063983386,0.000048708287,0.0004306805,0.00016687626,0.00026010635],"domain_scores_gemma":[0.9917854,0.0064453017,0.0005267133,0.0005990353,0.00016716827,0.00047644932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002196032,0.0016339172,0.001482157,0.00036195805,0.00084244483,0.001256086,0.0018580722,0.0025764054,0.008154548],"category_scores_gemma":[0.011779364,0.0007999182,0.0010218059,0.00045883917,0.0020799085,0.0046651848,0.002742016,0.004577074,0.0007292993],"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.0017191704,0.0005104264,0.0028585303,0.00039743003,0.00018130656,0.0006642122,0.00045546226,0.7582798,0.0037615043,0.14264655,0.015382728,0.07314288],"study_design_scores_gemma":[0.00015090466,0.00016374812,0.0002812709,0.000028438417,0.000021926855,0.00012525788,0.00008794589,0.85898644,0.0014427196,0.13625243,0.0024320856,0.00002681722],"about_ca_topic_score_codex":0.003742027,"about_ca_topic_score_gemma":0.0054464303,"teacher_disagreement_score":0.008154548,"about_ca_system_score_codex":0.0011801561,"about_ca_system_score_gemma":0.0023910177,"threshold_uncertainty_score":0.027279675},"labels":[],"label_agreement":null},{"id":"W2998153559","doi":"10.48550/arxiv.1911.07357","title":"Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Microsoft Research; National Science Foundation","keywords":"Combinatorics; Conditioning; Bhattacharyya distance; Oracle; Mathematics; Multivariate random variable; Aggregate (composite); Key (lock); Component (thermodynamics); Distribution (mathematics); Computer science; Discrete mathematics; Random variable; Algorithm; Statistics; Artificial intelligence; Physics","score_opus":0.020848921648559334,"score_gpt":0.16377892218695245,"score_spread":0.1429300005383931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998153559","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.03338971,0.0001640657,0.96199036,0.0006685207,0.000043620177,0.0001429457,0.00031462614,0.0014002596,0.0018858598],"genre_scores_gemma":[0.43189216,0.00015248539,0.56169593,0.0009199099,0.00026725687,0.0007261391,0.0016921475,0.00047529733,0.0021787093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98995167,0.0048071947,0.0005009634,0.0021248856,0.0019019399,0.00071326824],"domain_scores_gemma":[0.9474218,0.038729873,0.0019462367,0.009079882,0.0018204326,0.0010018096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008624427,0.0014730246,0.002764288,0.0015123736,0.0013265093,0.002224464,0.0052035963,0.002327953,0.0061405795],"category_scores_gemma":[0.0646134,0.0009837942,0.0019526343,0.0023411734,0.004601447,0.006329018,0.0072482186,0.0048299874,0.0012889925],"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.0021898923,0.0005049702,0.013470895,0.00032653313,0.00030231307,0.0007376349,0.0006488359,0.31623927,0.009922437,0.41353887,0.013052427,0.22906595],"study_design_scores_gemma":[0.000111388916,0.00012285543,0.0009470175,0.000022328171,0.000027678787,0.00019141432,0.00006250021,0.7117045,0.0034429862,0.2821912,0.0011356827,0.00004055525],"about_ca_topic_score_codex":0.003536009,"about_ca_topic_score_gemma":0.002662386,"teacher_disagreement_score":0.008624427,"about_ca_system_score_codex":0.0018844904,"about_ca_system_score_gemma":0.0025931415,"threshold_uncertainty_score":0.045610845},"labels":[],"label_agreement":null},{"id":"W3001787625","doi":"10.1145/3726532","title":"Reconstruction of Depth-4 Multilinear Circuits","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Machine Learning and Algorithms","field":"Computer Science","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 Toronto","funders":"","keywords":"Multilinear map; Electronic circuit; Computer science; Mathematics; Engineering; Electrical engineering; Pure mathematics","score_opus":0.013004703538657644,"score_gpt":0.2806092736660844,"score_spread":0.2676045701274268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001787625","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.20179988,0.0005795276,0.78190297,0.0008161185,0.000080680926,0.00014178496,0.001024217,0.0032231447,0.010431596],"genre_scores_gemma":[0.78512186,0.00023600769,0.20722106,0.00044241443,0.00003854774,0.00013091783,0.001270039,0.000323874,0.0052152406],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984862,0.00027036207,0.00009276324,0.00036044995,0.00044988835,0.00034037398],"domain_scores_gemma":[0.9977055,0.0010072691,0.00024270393,0.00066180143,0.00028963457,0.00009303326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005580266,0.000712241,0.000693499,0.0005382062,0.00057321653,0.0013223472,0.0014085117,0.0010251342,0.0072915037],"category_scores_gemma":[0.0063539413,0.0005864137,0.0009842208,0.00060101994,0.0007802299,0.0025043446,0.0031073638,0.001925344,0.0013874803],"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.0023056916,0.00025454603,0.0054808008,0.0010031824,0.00017288383,0.00085260853,0.00091468275,0.21366857,0.07742136,0.29015398,0.011899618,0.39587194],"study_design_scores_gemma":[0.00019166876,0.0003191512,0.0008329587,0.00010815909,0.000084789295,0.000544533,0.00019333146,0.57774985,0.067870714,0.33814126,0.013887956,0.0000756174],"about_ca_topic_score_codex":0.0009744653,"about_ca_topic_score_gemma":0.0014574836,"teacher_disagreement_score":0.0072915037,"about_ca_system_score_codex":0.0011808196,"about_ca_system_score_gemma":0.0009900093,"threshold_uncertainty_score":0.024392486},"labels":[],"label_agreement":null},{"id":"W3002510907","doi":"10.48550/arxiv.2009.13579","title":"Novelty Search in Representational Space for Sample Efficient Exploration","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"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":"Novelty; Leverage (statistics); Computer science; Sample (material); Space (punctuation); Key (lock); Artificial intelligence; Sample space; Similarity (geometry); Machine learning; Theoretical computer science; Psychology; Image (mathematics)","score_opus":0.16331180414883728,"score_gpt":0.249236281397331,"score_spread":0.08592447724849372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002510907","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.012578778,0.00017950597,0.98552716,0.00019581534,0.000019449939,0.000027647891,0.00004139933,0.0003598948,0.0010704095],"genre_scores_gemma":[0.50257325,0.00026024922,0.4921241,0.00027497602,0.00009886503,0.0003400854,0.00029845035,0.00031902475,0.0037110115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882203,0.00047855626,0.000058770256,0.00021519542,0.00032006405,0.00010531125],"domain_scores_gemma":[0.99733967,0.0015848462,0.00023480803,0.0004861926,0.00021283394,0.00014167104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017109099,0.00097163115,0.0015295992,0.0008513672,0.00053375366,0.0014505369,0.0019266705,0.0016838546,0.0028716088],"category_scores_gemma":[0.006989924,0.000613843,0.0010997332,0.0010186727,0.0016341397,0.00352849,0.0041101538,0.0024828766,0.0007001177],"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.00027533996,0.00015626728,0.0010365216,0.00019677961,0.000091818205,0.000113073664,0.00019389443,0.76376957,0.0051877904,0.11752523,0.0028090193,0.108644664],"study_design_scores_gemma":[0.000018462442,0.00006049504,0.000054654698,0.000008272403,0.0000069853945,0.000026478507,0.000009670312,0.9522865,0.0006221601,0.046368018,0.0005302946,0.000007950797],"about_ca_topic_score_codex":0.00089092343,"about_ca_topic_score_gemma":0.0012615041,"teacher_disagreement_score":0.0028716088,"about_ca_system_score_codex":0.0010143283,"about_ca_system_score_gemma":0.0009448427,"threshold_uncertainty_score":0.009606481},"labels":[],"label_agreement":null},{"id":"W3012136308","doi":"10.4230/lipics.cp.2022.15","title":"Constraint Acquisition Based on Solution Counting","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Université Laval","funders":"","keywords":"Constraint (computer-aided design); Computer science; Information retrieval; Mathematics; Geometry","score_opus":0.014764384835088212,"score_gpt":0.2674246517087655,"score_spread":0.25266026687367726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012136308","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.015104798,0.00030803733,0.9451981,0.00061328674,0.00007552192,0.00036629193,0.000609196,0.031044548,0.006680126],"genre_scores_gemma":[0.184101,0.00028155593,0.8015159,0.0008443154,0.000095404095,0.0006123434,0.0030532817,0.0032611913,0.0062351367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990488,0.0032104617,0.0005912265,0.0016915766,0.003433572,0.00058526767],"domain_scores_gemma":[0.97073686,0.017067159,0.0014256282,0.006174722,0.0038956746,0.0006999673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004773093,0.0017943871,0.0018605792,0.0028415732,0.0014408771,0.0033862945,0.005523963,0.0018177225,0.020590372],"category_scores_gemma":[0.041185115,0.001298055,0.0019905716,0.0031012532,0.00236318,0.008029324,0.0059666913,0.0049697165,0.0061081536],"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.0011157945,0.0009929417,0.0042214165,0.001285982,0.00024574006,0.0003917153,0.0009884713,0.06902021,0.022603994,0.11187892,0.054138053,0.73311675],"study_design_scores_gemma":[0.00014728548,0.00013086968,0.00045327508,0.00012217932,0.000050579005,0.00024633494,0.000118572825,0.8638748,0.021601668,0.09071743,0.022439424,0.000097567805],"about_ca_topic_score_codex":0.0049086167,"about_ca_topic_score_gemma":0.008295822,"teacher_disagreement_score":0.020590372,"about_ca_system_score_codex":0.0015357367,"about_ca_system_score_gemma":0.004230605,"threshold_uncertainty_score":0.06888163},"labels":[],"label_agreement":null},{"id":"W3013629183","doi":"10.1109/cvpr46437.2021.00668","title":"VaB-AL: Incorporating Class Imbalance and Difficulty with Variational Bayes for Active Learning","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Chung-Ang University; Compute Canada","keywords":"Discriminative model; Computer science; Machine learning; Classifier (UML); Artificial intelligence; Mistake; Generative model; Bayes' theorem; Class (philosophy); Generative grammar; Pattern recognition (psychology); Bayesian probability","score_opus":0.009191338527466626,"score_gpt":0.24874475134432225,"score_spread":0.23955341281685563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013629183","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.0039660702,0.0002217603,0.9945422,0.00027546953,0.000043316053,0.00004324118,0.000030910123,0.00019747994,0.00067962665],"genre_scores_gemma":[0.43633577,0.0004750235,0.55389184,0.0011470212,0.00031219245,0.00061827136,0.00040643913,0.000540009,0.0062734806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755186,0.0012003023,0.000100401885,0.00040858332,0.00055204454,0.00018687511],"domain_scores_gemma":[0.99197316,0.006011473,0.00038829795,0.0006898277,0.00064014626,0.00029714283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0078121517,0.0012336399,0.0022002575,0.0011041894,0.0008727978,0.0025962328,0.004907827,0.0034234035,0.0032621378],"category_scores_gemma":[0.018694552,0.0012664407,0.0014270255,0.00089883094,0.0027074264,0.0039571677,0.00393931,0.004590666,0.0007824983],"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.00019428547,0.00015131803,0.0034287467,0.00019410673,0.00018587,0.0001399355,0.00049391645,0.66551924,0.0038159206,0.15140682,0.004852555,0.16961722],"study_design_scores_gemma":[0.000007936758,0.000009363638,0.000044922795,0.000010011211,0.0000054758275,0.0000132176465,0.0000062343165,0.9747483,0.00033991033,0.024248868,0.0005596744,0.000006105029],"about_ca_topic_score_codex":0.0048770374,"about_ca_topic_score_gemma":0.0071147014,"teacher_disagreement_score":0.0078121517,"about_ca_system_score_codex":0.001981998,"about_ca_system_score_gemma":0.0018230052,"threshold_uncertainty_score":0.04131514},"labels":[],"label_agreement":null},{"id":"W3019554865","doi":"10.48550/arxiv.2004.12496","title":"Learning and Testing Junta Distributions with Subcube Conditioning","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"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":"Conditioning; Computer science; Mathematics; Statistics","score_opus":0.05073677933563847,"score_gpt":0.1905602238981427,"score_spread":0.13982344456250423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019554865","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.37659615,0.0007080089,0.61094,0.0020259593,0.00012338346,0.0002967287,0.0014347938,0.0037115163,0.004163446],"genre_scores_gemma":[0.8335192,0.00023797591,0.15688877,0.00093811064,0.00030496652,0.00058599294,0.004368075,0.0005333563,0.0026237199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99149674,0.0030265048,0.00049439224,0.0026844817,0.0016605891,0.00063726405],"domain_scores_gemma":[0.91710067,0.064192876,0.0033203603,0.010595115,0.0029503382,0.0018406758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007450223,0.0016580138,0.0025510713,0.0017270937,0.0017287238,0.002866867,0.0054524257,0.0028432033,0.0052756355],"category_scores_gemma":[0.07690899,0.0009699353,0.0021303887,0.002434366,0.003965032,0.008599955,0.005017992,0.0054140873,0.0013311349],"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.0048930524,0.0014883385,0.084504,0.000508005,0.0006275001,0.0008935146,0.0010633926,0.43511125,0.007742749,0.2164715,0.015064251,0.23163259],"study_design_scores_gemma":[0.00009815739,0.00020695137,0.0017143622,0.000025927642,0.00002452276,0.00019022681,0.00014792728,0.85519755,0.0025418655,0.13895613,0.000865468,0.00003085018],"about_ca_topic_score_codex":0.0051113768,"about_ca_topic_score_gemma":0.004779827,"teacher_disagreement_score":0.007450223,"about_ca_system_score_codex":0.0019257317,"about_ca_system_score_gemma":0.0022387432,"threshold_uncertainty_score":0.039400995},"labels":[],"label_agreement":null},{"id":"W3021764960","doi":"10.1101/2020.04.28.065532","title":"A Bayesian neural network for toxicity prediction","year":2020,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prioris.ai (Canada)","funders":"","keywords":"Overfitting; Machine learning; Computer science; Artificial intelligence; Artificial neural network; Hyperparameter; Bayesian probability; Dropout (neural networks); Bayesian network; Flexibility (engineering); Data mining; Statistics; Mathematics","score_opus":0.014125115562419232,"score_gpt":0.22414578938229437,"score_spread":0.21002067381987513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021764960","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.09634306,0.0040541464,0.8836546,0.003320349,0.0003495611,0.00019939704,0.0015189281,0.0016839938,0.008875966],"genre_scores_gemma":[0.85671693,0.0015111484,0.12944691,0.000763263,0.0002582653,0.0002706589,0.0020624518,0.000094931245,0.0088753905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992254,0.00027828693,0.00005495086,0.00018009792,0.00018657837,0.00007483344],"domain_scores_gemma":[0.99783295,0.0013374608,0.00014570117,0.00005939813,0.0005594839,0.000065027125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023991615,0.00095581246,0.0010698636,0.0013264511,0.00043240513,0.0010448487,0.0013619498,0.0016686853,0.0040397],"category_scores_gemma":[0.006604212,0.00062296423,0.0008239991,0.000994719,0.0004468786,0.0010995745,0.00072462927,0.0019599258,0.00076233526],"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.00016637746,0.00010360734,0.0019943079,0.00007027747,0.000070313334,0.00005083652,0.000016153801,0.90955365,0.0005951681,0.0027111645,0.002236808,0.08243125],"study_design_scores_gemma":[0.0000036519555,0.000009019474,0.00011718739,0.000008951093,0.000004836602,0.0000037934258,0.0000012311189,0.99826556,0.00009534603,0.0013700797,0.00011748147,0.0000028723414],"about_ca_topic_score_codex":0.023344794,"about_ca_topic_score_gemma":0.014293416,"teacher_disagreement_score":0.023344794,"about_ca_system_score_codex":0.0016221297,"about_ca_system_score_gemma":0.0012995742,"threshold_uncertainty_score":0.046417832},"labels":[],"label_agreement":null},{"id":"W3022560185","doi":"","title":"Representation, reasoning, and learning for a relational influence diagram applied to a real-time geological domain","year":2014,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"MineSense Technologies (Canada); University of British Columbia","funders":"","keywords":"Sorting; Inference; Bin; Computer science; Representation (politics); Process (computing); Influence diagram; Diagram; Domain (mathematical analysis); Throughput; Data mining; Artificial intelligence; Machine learning; Algorithm; Decision tree; Database","score_opus":0.007459488958184695,"score_gpt":0.2553950990998938,"score_spread":0.2479356101417091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022560185","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.008836482,0.0000869717,0.9877364,0.00037540667,0.000021542304,0.00011967211,0.00048892596,0.0014632605,0.00087149255],"genre_scores_gemma":[0.2921073,0.00023307513,0.7037191,0.00012729476,0.000045069377,0.0003306486,0.0015814723,0.00015674898,0.0016992914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985139,0.0004544511,0.00013666129,0.00041750848,0.00036164405,0.00011591691],"domain_scores_gemma":[0.99398947,0.004411449,0.00031917015,0.00051693415,0.0005865401,0.00017638272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019926415,0.0009238714,0.0006445177,0.0019126539,0.0007962123,0.0020998667,0.0017078016,0.0011970423,0.005537803],"category_scores_gemma":[0.013733547,0.00055854087,0.0021352354,0.0010384822,0.0011295456,0.0036201251,0.0019043621,0.0016898755,0.0007425574],"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.00038325266,0.00024794845,0.006069617,0.00063837075,0.00016422416,0.001069021,0.0009457678,0.62428427,0.0068934904,0.1590836,0.005164896,0.19505557],"study_design_scores_gemma":[0.000027499513,0.000021675232,0.00018266037,0.000019021107,0.000024847861,0.000068281304,0.000041646046,0.95669204,0.0014116253,0.039304864,0.0021949338,0.000010957542],"about_ca_topic_score_codex":0.022097297,"about_ca_topic_score_gemma":0.03836337,"teacher_disagreement_score":0.022097297,"about_ca_system_score_codex":0.0016545202,"about_ca_system_score_gemma":0.0019289752,"threshold_uncertainty_score":0.043937325},"labels":[],"label_agreement":null},{"id":"W3033527224","doi":"10.1145/3385188","title":"Asterisk","year":2020,"lang":"en","type":"article","venue":"ACM/IMS Transactions on Data Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"","keywords":"Computer science; Heuristics; Quality (philosophy); Machine learning; Preprocessor; Process (computing); Artificial intelligence; Annotation; IBM; Data mining","score_opus":0.076600776069982,"score_gpt":0.3117897892712219,"score_spread":0.23518901320123992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033527224","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004295618,0.0018842784,0.17439349,0.017029164,0.023043796,0.0012999568,0.110674284,0.06868587,0.5986935],"genre_scores_gemma":[0.03417986,0.0031727282,0.19867161,0.007877329,0.0034366213,0.0011054715,0.19108659,0.023088822,0.537381],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99593604,0.00076771964,0.00062904577,0.0010279006,0.0012997191,0.00033964112],"domain_scores_gemma":[0.9803602,0.004138392,0.0017003835,0.007390639,0.005592095,0.00081822043],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032665827,0.0015406132,0.0012865087,0.0035188727,0.0027294739,0.008265748,0.004449442,0.0037806232,0.5137476],"category_scores_gemma":[0.0220295,0.0009966356,0.0011019119,0.005846728,0.0014770945,0.007292263,0.005289281,0.0032071567,0.49635264],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00021891748,0.000046453926,0.0005737723,0.00043449752,0.000015363987,0.00026431005,0.0001568375,0.00039634467,0.0015307885,0.017956857,0.8848882,0.09351762],"study_design_scores_gemma":[0.000022894212,0.000013718455,0.00026984402,0.00011697911,0.0000051461725,0.00021227275,0.00009658119,0.00065734045,0.001319498,0.0064296466,0.9908386,0.000017402686],"about_ca_topic_score_codex":0.0023308806,"about_ca_topic_score_gemma":0.0023886508,"teacher_disagreement_score":0.48625243,"about_ca_system_score_codex":0.0017308844,"about_ca_system_score_gemma":0.0035721855,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3035470936","doi":"10.24963/ijcai.2021/334","title":"Bayesian Experience Reuse for Learning from Multiple Demonstrators","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Machine Learning and Algorithms","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 Toronto","funders":"","keywords":"Reuse; Computer science; Prior probability; Bayesian probability; Machine learning; Artificial intelligence; Task (project management); Transfer of learning; Sample (material); Mathematical optimization; Mathematics; Engineering","score_opus":0.022216496868386906,"score_gpt":0.2714997775298665,"score_spread":0.2492832806614796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035470936","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.011991205,0.00017685094,0.98572737,0.00021479277,0.0000118091975,0.000053862776,0.000036949263,0.0001979211,0.0015891937],"genre_scores_gemma":[0.73250824,0.00032546447,0.25892523,0.00032910894,0.00007007495,0.0005726116,0.00023378196,0.00019745002,0.0068381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768806,0.0009867977,0.00010893669,0.0005059849,0.00048160425,0.00022868685],"domain_scores_gemma":[0.99437124,0.0038005686,0.00044272034,0.00058251625,0.0004897435,0.00031316094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045276796,0.0014312984,0.0019320338,0.00076835044,0.00059158687,0.001261279,0.0029202546,0.0021478832,0.004848239],"category_scores_gemma":[0.015673695,0.0012864807,0.0009889676,0.0009014863,0.0021412515,0.0037155466,0.003950462,0.002845854,0.0006711851],"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.0001993027,0.00012567201,0.00062230055,0.00014422859,0.00006353206,0.00008854426,0.00019719652,0.8890126,0.0011783494,0.03257345,0.001171029,0.074623816],"study_design_scores_gemma":[0.000020367157,0.00006419971,0.00009087945,0.000015851583,0.000009854194,0.000016897564,0.0000124004955,0.97668535,0.00054954924,0.02204734,0.00047747436,0.0000097717475],"about_ca_topic_score_codex":0.004778158,"about_ca_topic_score_gemma":0.005010931,"teacher_disagreement_score":0.004848239,"about_ca_system_score_codex":0.0021559258,"about_ca_system_score_gemma":0.0018880707,"threshold_uncertainty_score":0.023944914},"labels":[],"label_agreement":null},{"id":"W3036503133","doi":"10.1109/icccs49078.2020.9118568","title":"Optimal Training Data Selection in Active Learning for Discrimination and Classification","year":2020,"lang":"en","type":"article","venue":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","topic":"Machine Learning and Algorithms","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":"Brock University","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Classifier (UML); Active learning (machine learning); Monte Carlo method; Learning classifier system; Pattern recognition (psychology); Unsupervised learning; Mathematics; Statistics","score_opus":0.1957910737432852,"score_gpt":0.3599655975664877,"score_spread":0.16417452382320252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036503133","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.013765943,0.00022598382,0.98519725,0.00011350173,0.000021001355,0.000041558545,0.0000122765305,0.0001252482,0.00049714994],"genre_scores_gemma":[0.599471,0.0003431254,0.39727333,0.00022017125,0.000105588755,0.00036291862,0.00010763373,0.00007980114,0.0020363822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980263,0.00086528074,0.000101887184,0.000374915,0.00047666478,0.00015498885],"domain_scores_gemma":[0.99140996,0.0067866314,0.00040799298,0.0004558515,0.0008027996,0.00013673028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004736567,0.0009229761,0.0012476869,0.0010857229,0.0006704777,0.0016700045,0.0020106893,0.0017817069,0.0013874619],"category_scores_gemma":[0.012296552,0.000546738,0.00075203803,0.0008930571,0.0016895769,0.0026015579,0.001532153,0.0016512264,0.00057617825],"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.00087189587,0.00072590634,0.0033270884,0.0003526921,0.00010408958,0.00021496718,0.00040190216,0.4388255,0.026429271,0.034394782,0.0018207813,0.49253106],"study_design_scores_gemma":[0.000019719939,0.00010276161,0.0002076784,0.00001659447,0.000011602432,0.00003620582,0.000021334074,0.98578185,0.0060667642,0.0072519216,0.00047188724,0.00001168186],"about_ca_topic_score_codex":0.0007232657,"about_ca_topic_score_gemma":0.0007856603,"teacher_disagreement_score":0.004736567,"about_ca_system_score_codex":0.0006171095,"about_ca_system_score_gemma":0.0007987482,"threshold_uncertainty_score":0.025049686},"labels":[],"label_agreement":null},{"id":"W3036904899","doi":"10.48550/arxiv.2006.13057","title":"PAC-Bayes Analysis Beyond the Usual Bounds","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Laboratory; Army Research Office; Engineering and Physical Sciences Research Council; University College London; DeepMind; Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Prior probability; Bayes' theorem; Bounded function; Generalization; Moment (physics); Computer science; Mathematics; Upper and lower bounds; Applied mathematics; Algorithm; Artificial intelligence; Bayesian probability","score_opus":0.04837899876211513,"score_gpt":0.1949291850842765,"score_spread":0.14655018632216138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036904899","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.004021515,0.002842679,0.9704043,0.0027140116,0.00023039481,0.000058559563,0.00020447114,0.00025642908,0.01926757],"genre_scores_gemma":[0.5179212,0.0088441195,0.43580404,0.00560678,0.0032455525,0.0010196858,0.0009052293,0.0012493124,0.025404098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98751056,0.004364757,0.00046594956,0.0020940483,0.004630587,0.0009341481],"domain_scores_gemma":[0.9232004,0.06309705,0.0018734285,0.005372991,0.005530632,0.00092539156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01647729,0.0032453123,0.0032365094,0.0023461215,0.0017774547,0.0052023055,0.003881249,0.0030378827,0.00831241],"category_scores_gemma":[0.09169758,0.001538021,0.002286006,0.002340255,0.005628399,0.015103339,0.0056052506,0.013472077,0.0018296167],"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.00007381498,0.000050446008,0.00042068682,0.00020115306,0.00005731861,0.000108411325,0.00017227484,0.07101118,0.00047001953,0.89921176,0.0052497364,0.022973124],"study_design_scores_gemma":[0.0000100211355,0.000017917566,0.00011174593,0.00007799219,0.000017762506,0.000062196814,0.000019158797,0.27318528,0.00048785488,0.7225672,0.003424662,0.000018261797],"about_ca_topic_score_codex":0.0037053053,"about_ca_topic_score_gemma":0.0026362087,"teacher_disagreement_score":0.01647729,"about_ca_system_score_codex":0.0049520186,"about_ca_system_score_gemma":0.0036941865,"threshold_uncertainty_score":0.087141275},"labels":[],"label_agreement":null},{"id":"W3037657365","doi":"","title":"The Complexity of Deciding Statistical Properties of Samplable Distributions.","year":2013,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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 Toronto","funders":"","keywords":"Mathematics; Independent and identically distributed random variables; Pairwise comparison; Completeness (order theory); Uncorrelated; Pairwise independence; Bounded function; Independence (probability theory); Distribution (mathematics); Joint probability distribution; Discrete mathematics; Combinatorics; Circuit complexity; Algorithm; Electronic circuit; Statistics; Random variable; Mathematical analysis","score_opus":0.04615993374536034,"score_gpt":0.25704579062005384,"score_spread":0.2108858568746935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037657365","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.30940792,0.0011996385,0.6556008,0.012718226,0.0001257723,0.000846853,0.0074788947,0.0021272793,0.010494619],"genre_scores_gemma":[0.83941054,0.00065348385,0.14662525,0.0014616913,0.00029171014,0.0007257296,0.0067986315,0.0004119899,0.0036209964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99035865,0.0036157244,0.0007322044,0.0023400239,0.0020057121,0.0009476966],"domain_scores_gemma":[0.84862244,0.13603361,0.004823334,0.0063157724,0.0026548652,0.0015499534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008196786,0.00096931274,0.0019869534,0.001238313,0.0020802328,0.0055972296,0.0040337113,0.0035123227,0.008074814],"category_scores_gemma":[0.07565843,0.0013608548,0.0027070246,0.0025440243,0.0042899004,0.015262446,0.003848599,0.0051737847,0.00084999733],"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.0036386691,0.00073168526,0.02027843,0.0017330331,0.0006339982,0.0011207705,0.0016575797,0.43806854,0.007305728,0.35993385,0.022541974,0.14235571],"study_design_scores_gemma":[0.00029348177,0.00013698386,0.0015666407,0.000053021417,0.0000819014,0.00032045762,0.00024524593,0.49251103,0.0037002775,0.49941155,0.0016321416,0.0000472689],"about_ca_topic_score_codex":0.005847964,"about_ca_topic_score_gemma":0.005609933,"teacher_disagreement_score":0.008196786,"about_ca_system_score_codex":0.005471355,"about_ca_system_score_gemma":0.0058586164,"threshold_uncertainty_score":0.043349266},"labels":[],"label_agreement":null},{"id":"W3042622665","doi":"10.4230/lipics.icalp.2022.71","title":"Downsampling for Testing and Learning in Product Distributions","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"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":"Upsampling; Property testing; Monotonic function; Polynomial; Product (mathematics); Mathematics; Distribution (mathematics); Constant (computer programming); Regular polygon; Connection (principal bundle); Combinatorics; Discrete mathematics; Sample complexity; Time complexity; Function (biology); Sample (material); Algorithm; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.03634888266614139,"score_gpt":0.2872981621214975,"score_spread":0.2509492794553561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042622665","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.017898878,0.00031582397,0.978297,0.00073125877,0.00004674389,0.000084478546,0.00013988485,0.000685959,0.0018000265],"genre_scores_gemma":[0.3867923,0.0004199056,0.60698473,0.0006867874,0.0003141009,0.0004837709,0.0008440076,0.00031938855,0.003155064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99459153,0.002020238,0.00024952856,0.0013939502,0.0013643007,0.0003803891],"domain_scores_gemma":[0.9697337,0.023083903,0.0012784044,0.0040411595,0.0012594551,0.000603274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076571126,0.0017733747,0.0019352629,0.0016035716,0.0008724773,0.0020202096,0.0033765337,0.0017311127,0.0044407416],"category_scores_gemma":[0.038009603,0.0009880926,0.0021397471,0.0014754941,0.0035592827,0.008285429,0.0040051616,0.005065198,0.0009703463],"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.0012007898,0.00047823734,0.0062402682,0.00048023986,0.00023819836,0.00036869882,0.00046366674,0.30626494,0.0070523433,0.38937443,0.009538823,0.27829942],"study_design_scores_gemma":[0.00004124418,0.00006165688,0.00031225974,0.000015400423,0.000019874584,0.00008853233,0.000018040875,0.86869097,0.0023491129,0.1275363,0.00085541216,0.000011197477],"about_ca_topic_score_codex":0.002333326,"about_ca_topic_score_gemma":0.0017051161,"teacher_disagreement_score":0.0076571126,"about_ca_system_score_codex":0.0024355946,"about_ca_system_score_gemma":0.0018025031,"threshold_uncertainty_score":0.040495157},"labels":[],"label_agreement":null},{"id":"W3057037158","doi":"10.1007/978-3-030-56150-5_4","title":"Extending Sliding-Step Importance Weighting from Supervised Learning to Reinforcement Learning","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Machine learning; Artificial intelligence; Weighting; Stochastic gradient descent; Robustness (evolution); Online machine learning; Supervised learning; Mathematical optimization; Algorithm; Semi-supervised learning; Mathematics; Artificial neural network","score_opus":0.014479107915693361,"score_gpt":0.24249650176752494,"score_spread":0.22801739385183156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3057037158","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.003733865,0.00020406283,0.99492717,0.000036278478,0.000051561125,0.000018338424,0.000009080862,0.00015829218,0.00086120673],"genre_scores_gemma":[0.4381138,0.0005485763,0.5534914,0.00015913216,0.00018803966,0.00016555288,0.00014658249,0.00021620395,0.006970645],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934477,0.0002090235,0.000043695247,0.00014500688,0.00021219593,0.000045263343],"domain_scores_gemma":[0.99770373,0.0014157884,0.00010118748,0.00031459398,0.0003914476,0.00007332048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018749207,0.00063108857,0.0011248082,0.00055445667,0.00023525604,0.00065721193,0.0014743704,0.0008460822,0.0025248372],"category_scores_gemma":[0.005585707,0.0004093323,0.0005311516,0.0007687953,0.0006539181,0.0015681307,0.0013936284,0.0014873013,0.00049079116],"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.00012619648,0.00022292227,0.0005284514,0.00017077153,0.00009984468,0.00005827088,0.00007638073,0.46489075,0.0071008615,0.035566222,0.0030375642,0.48812172],"study_design_scores_gemma":[0.000005385951,0.000025600495,0.00005907612,0.0000049561804,0.0000062716554,0.000009050928,0.0000017743797,0.98637706,0.0007087725,0.01228804,0.00051062164,0.0000033620115],"about_ca_topic_score_codex":0.0018858139,"about_ca_topic_score_gemma":0.0019801785,"teacher_disagreement_score":0.0025248372,"about_ca_system_score_codex":0.00048151385,"about_ca_system_score_gemma":0.0006955601,"threshold_uncertainty_score":0.00991565},"labels":[],"label_agreement":null},{"id":"W3083184497","doi":"10.1016/j.orl.2020.08.014","title":"Sampling from the complement of a polyhedron: An MCMC algorithm for data augmentation","year":2020,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Complement (music); Sampling (signal processing); Algorithm; Polyhedron; Computer science; Markov chain Monte Carlo; Set (abstract data type); Pipeline (software); Boundary (topology); Data set; Artificial intelligence; Pattern recognition (psychology); Mathematics; Bayesian probability; Computer vision","score_opus":0.2966483137067856,"score_gpt":0.4570154344034947,"score_spread":0.16036712069670905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083184497","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.003625812,0.00012134293,0.99485934,0.0001479521,0.00003915289,0.00007255314,0.000092951,0.00040384853,0.00063706003],"genre_scores_gemma":[0.12924612,0.00018025591,0.8661751,0.00034133374,0.00012836077,0.00081378873,0.0007936512,0.00031397297,0.0020074558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978531,0.0010980398,0.00010410849,0.00031320972,0.00045441787,0.0001771805],"domain_scores_gemma":[0.9891102,0.008183057,0.00028725548,0.0010211624,0.0010878068,0.00031055283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003964388,0.0013643638,0.002648176,0.0015285675,0.0012453995,0.0018684275,0.0043117045,0.0029768604,0.0059030997],"category_scores_gemma":[0.019477956,0.001850145,0.0017945401,0.002259842,0.00231972,0.002046353,0.0034603195,0.005501296,0.0012737893],"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.00053005497,0.00015882614,0.0010798838,0.000222703,0.00010700253,0.00010199957,0.00017787633,0.8090268,0.0019650594,0.048103943,0.0071758167,0.13135001],"study_design_scores_gemma":[0.000016563152,0.0000113429305,0.000025030991,0.000007953167,0.0000038193316,0.0000065947092,0.0000037061363,0.9930106,0.00019334807,0.0063934736,0.00032291422,0.0000047532217],"about_ca_topic_score_codex":0.018194044,"about_ca_topic_score_gemma":0.017352566,"teacher_disagreement_score":0.018194044,"about_ca_system_score_codex":0.0014230941,"about_ca_system_score_gemma":0.004189127,"threshold_uncertainty_score":0.036176324},"labels":[],"label_agreement":null},{"id":"W3084911943","doi":"10.48550/arxiv.2009.06492","title":"Beyond Accuracy: ROI-driven Data Analytics of Empirical Data","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","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 Calgary","funders":"","keywords":"Analytics; Computer science; Data analysis; Data science; Data mining","score_opus":0.264585490832015,"score_gpt":0.2855492832822576,"score_spread":0.020963792450242602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084911943","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.051516205,0.00349071,0.91401076,0.014424118,0.00023218771,0.0006586156,0.0013908338,0.003170588,0.011106034],"genre_scores_gemma":[0.6353492,0.0009620279,0.35868597,0.0013274598,0.0002880507,0.0005301801,0.0012127515,0.00055248616,0.0010917612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.95835143,0.023175536,0.0022284726,0.0035356516,0.011769791,0.00093911757],"domain_scores_gemma":[0.7714192,0.16560605,0.016275506,0.02686284,0.017679233,0.0021571682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04531626,0.0020214943,0.0017394355,0.0048849955,0.00071020424,0.008457308,0.0026696636,0.0018544658,0.0016550473],"category_scores_gemma":[0.17454895,0.0007315532,0.0011299073,0.0029645772,0.0033197117,0.014475165,0.004324996,0.0043398924,0.0011050634],"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.0009827581,0.00051937485,0.061392393,0.0019669714,0.00050641055,0.0005468616,0.0034007959,0.104902424,0.011800411,0.14400446,0.016672652,0.6533045],"study_design_scores_gemma":[0.0001094414,0.00075875863,0.017584167,0.0016544419,0.00020116838,0.0007708507,0.0019463716,0.56135464,0.023303475,0.3547714,0.037316326,0.00022895762],"about_ca_topic_score_codex":0.0015612422,"about_ca_topic_score_gemma":0.0017868639,"teacher_disagreement_score":0.04531626,"about_ca_system_score_codex":0.0024560578,"about_ca_system_score_gemma":0.0032577235,"threshold_uncertainty_score":0.23965818},"labels":[],"label_agreement":null},{"id":"W3088086419","doi":"10.1007/s10994-020-05902-7","title":"Fast greedy $$\\mathcal {C}$$-bound minimization with guarantees","year":2020,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Algorithm; Upper and lower bounds; Boosting (machine learning); Combinatorics; Machine learning; Mathematics; Artificial intelligence; Computer science; Mathematical analysis","score_opus":0.010887755744747697,"score_gpt":0.21806746839543142,"score_spread":0.20717971265068372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088086419","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.022975959,0.001148665,0.94966817,0.0028426086,0.00033186778,0.00037986645,0.00076407916,0.0042101378,0.017678728],"genre_scores_gemma":[0.3963516,0.0004888778,0.57123303,0.00268047,0.00056950585,0.0011810957,0.0033031038,0.0024977773,0.021694578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633527,0.0012517751,0.00014141639,0.00063307694,0.00091222825,0.0007262251],"domain_scores_gemma":[0.99153155,0.005886027,0.00028581018,0.0009589254,0.0009768934,0.00036077903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034987838,0.0024285861,0.003014505,0.0011787686,0.0011981867,0.0025196846,0.0033109337,0.0024839987,0.018524557],"category_scores_gemma":[0.014593539,0.0010412242,0.0018352809,0.0017353956,0.0016221259,0.0030453252,0.0030342066,0.0043998603,0.005634194],"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.0009988319,0.00049035973,0.0017308787,0.00064864755,0.0001568569,0.00018622368,0.0001458641,0.51303524,0.0027045961,0.09831943,0.10681355,0.27476954],"study_design_scores_gemma":[0.00007523399,0.000049465496,0.00016866381,0.00003388656,0.000019029063,0.000036398444,0.000026686823,0.9393719,0.0007543872,0.057232976,0.0022196982,0.000011648774],"about_ca_topic_score_codex":0.007263218,"about_ca_topic_score_gemma":0.012543634,"teacher_disagreement_score":0.018524557,"about_ca_system_score_codex":0.0031109494,"about_ca_system_score_gemma":0.0052761785,"threshold_uncertainty_score":0.06197083},"labels":[],"label_agreement":null},{"id":"W3090054376","doi":"","title":"Amortized Bayesian Optimization over Discrete Spaces","year":2020,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"University of Toronto","funders":"","keywords":"Bayesian probability; Amortized analysis; Computer science; Bayesian optimization; Mathematical optimization; Mathematics; Artificial intelligence; Data structure; Programming language","score_opus":0.027766262182025745,"score_gpt":0.29204230372859835,"score_spread":0.2642760415465726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090054376","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.008720832,0.00077610824,0.9860394,0.0012423707,0.00011842901,0.00004530296,0.00019262987,0.00022565517,0.0026392774],"genre_scores_gemma":[0.4044394,0.0013543427,0.57699883,0.0009622893,0.00079028815,0.0005696761,0.0010999446,0.00059094327,0.013194336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947732,0.0031855726,0.00025887112,0.0005834644,0.00091188744,0.0002869503],"domain_scores_gemma":[0.9810141,0.015739843,0.0005677806,0.0012371216,0.0009683618,0.00047292715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009830501,0.0018768733,0.0033845874,0.0016367611,0.0010674817,0.0042759827,0.0036804317,0.0045555127,0.00754812],"category_scores_gemma":[0.025946828,0.0021839058,0.0017095878,0.0027953084,0.0036767635,0.0070163123,0.0051919073,0.00486866,0.0007881859],"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.0002460523,0.00010636527,0.000430682,0.00021427093,0.0001578629,0.000056224286,0.00008412115,0.7030598,0.00037989471,0.2592361,0.0043493607,0.031679254],"study_design_scores_gemma":[0.00002200898,0.000016784814,0.00004819322,0.000017239105,0.0000130657445,0.00001233874,0.000006271638,0.87031955,0.00012686377,0.12884402,0.00056464475,0.000009010305],"about_ca_topic_score_codex":0.005267889,"about_ca_topic_score_gemma":0.004103299,"teacher_disagreement_score":0.009830501,"about_ca_system_score_codex":0.003008708,"about_ca_system_score_gemma":0.002611737,"threshold_uncertainty_score":0.051989317},"labels":[],"label_agreement":null},{"id":"W3091802565","doi":"10.1145/3417994","title":"Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes","year":2020,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of British Columbia; University of Waterloo; McMaster University; Vector Institute","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mixture model; Upper and lower bounds; Compression (physics); Gaussian; Sample complexity; Matching (statistics); Mathematics; Scheme (mathematics); Data compression; Algorithm; Class (philosophy); Computer science; Distribution (mathematics); Artificial intelligence; Statistics; Mathematical analysis; Physics","score_opus":0.04636202812958371,"score_gpt":0.28564379071210755,"score_spread":0.23928176258252384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091802565","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.012857195,0.0013818338,0.97920245,0.0011574775,0.00007993784,0.0001442177,0.00018976683,0.00074006425,0.0042470624],"genre_scores_gemma":[0.48398092,0.0028897186,0.50070727,0.0016931382,0.0009300708,0.001262014,0.0014411458,0.0009778836,0.0061178147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99151915,0.0023355805,0.000432923,0.0012542459,0.0036728424,0.0007851595],"domain_scores_gemma":[0.94028395,0.048359275,0.002263736,0.005657926,0.0022574377,0.0011776729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010478422,0.0032145246,0.0032487742,0.0027815625,0.001214715,0.003760573,0.0043010353,0.0034393524,0.00525301],"category_scores_gemma":[0.08424353,0.0013775902,0.0020079797,0.0026802921,0.004930072,0.011319687,0.008592726,0.008715078,0.0014366179],"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.000886512,0.0003259648,0.0022093279,0.00047277077,0.00017293904,0.0002205142,0.00028504807,0.65492827,0.008278436,0.2288228,0.005548103,0.097849384],"study_design_scores_gemma":[0.00003093786,0.00007933752,0.00023568707,0.000044050932,0.000019338902,0.000079288584,0.00001889634,0.9194166,0.002427734,0.07667058,0.0009514858,0.000026109275],"about_ca_topic_score_codex":0.0015680015,"about_ca_topic_score_gemma":0.0016374369,"teacher_disagreement_score":0.010478422,"about_ca_system_score_codex":0.004284321,"about_ca_system_score_gemma":0.0028725965,"threshold_uncertainty_score":0.05541587},"labels":[],"label_agreement":null},{"id":"W3092429884","doi":"10.1609/aaai.v35i11.17161","title":"Interpretable Sequence Classification via Discrete Optimization","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Schwartz/Reisman Emergency Medicine Institute; Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; Vector Institute; Canadian Institute for Advanced Research; Agencia Nacional de Investigación y Desarrollo; Microsoft Research","keywords":"Computer science; Artificial intelligence; Sequence (biology); Automaton; Machine learning; TRACE (psycholinguistics); Class (philosophy); Task (project management); Pattern recognition (psychology); Engineering","score_opus":0.08354368913952419,"score_gpt":0.3199233827761914,"score_spread":0.23637969363666722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092429884","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.022030111,0.0003618586,0.97321635,0.0008017618,0.00006779309,0.000062045016,0.00017001395,0.0012321868,0.002057946],"genre_scores_gemma":[0.74468625,0.00033504338,0.24792051,0.000574151,0.00014799545,0.00040466012,0.0008635903,0.00032054723,0.0047472855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989588,0.0003251532,0.000075178665,0.00036800138,0.00018708587,0.00008579395],"domain_scores_gemma":[0.99453163,0.0042574485,0.00032551138,0.00035238694,0.00043274823,0.00010019618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016159074,0.00097635837,0.0011097674,0.0008904134,0.00037960958,0.0014507938,0.0011839427,0.0016015506,0.0034418947],"category_scores_gemma":[0.009091362,0.0004927285,0.0009045152,0.0006564301,0.0015381946,0.002222716,0.0012988516,0.0025873515,0.00077707344],"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.00010471547,0.00006870055,0.0010264202,0.00012714113,0.000041147337,0.0000965728,0.00012573518,0.8383434,0.0017072551,0.029810902,0.0021323662,0.12641566],"study_design_scores_gemma":[0.0000044483695,0.000010633193,0.00003513268,0.000005743923,0.000002269469,0.000005316061,0.000004564469,0.9813276,0.00023432814,0.018202564,0.00016502003,0.0000024033018],"about_ca_topic_score_codex":0.0030203478,"about_ca_topic_score_gemma":0.0033090618,"teacher_disagreement_score":0.0034418947,"about_ca_system_score_codex":0.00159752,"about_ca_system_score_gemma":0.00128324,"threshold_uncertainty_score":0.011590898},"labels":[],"label_agreement":null},{"id":"W3094990364","doi":"10.1137/1.9781611976465.65","title":"A Local Search Framework for Experimental Design","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"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":"Computer science","score_opus":0.10073777207082951,"score_gpt":0.2973408001713968,"score_spread":0.1966030281005673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094990364","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.00020183604,0.000097148906,0.9980192,0.00007267109,0.000014640139,0.000071341805,0.00002192591,0.000090917645,0.0014103164],"genre_scores_gemma":[0.027724914,0.00032359638,0.9672564,0.0002759467,0.00006132736,0.0016824029,0.000089285095,0.0001388561,0.002447254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9857978,0.010531368,0.00046260722,0.0013659003,0.001516156,0.00032602865],"domain_scores_gemma":[0.97871345,0.01649088,0.0012659797,0.0022951164,0.0009099376,0.00032458428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019008165,0.0025529468,0.0020961063,0.0021233198,0.0008762676,0.0028643422,0.0043836352,0.00245893,0.011843591],"category_scores_gemma":[0.02898617,0.0015509002,0.0020667857,0.0024509123,0.0037949872,0.0030831513,0.003249154,0.004934746,0.0022631234],"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.00012888163,0.000113261165,0.0002253823,0.00032834144,0.00011323168,0.00007283555,0.00009932832,0.23762748,0.002068188,0.6926899,0.0024906825,0.064042486],"study_design_scores_gemma":[0.00015000383,0.00022867575,0.00009421907,0.00009526607,0.000048810292,0.00007031444,0.000030537416,0.4597092,0.001521595,0.5234174,0.0146022495,0.00003169474],"about_ca_topic_score_codex":0.0011256589,"about_ca_topic_score_gemma":0.0011257408,"teacher_disagreement_score":0.019008165,"about_ca_system_score_codex":0.0034002347,"about_ca_system_score_gemma":0.0033239047,"threshold_uncertainty_score":0.100525975},"labels":[],"label_agreement":null},{"id":"W3096226674","doi":"10.48550/arxiv.2011.01453","title":"Participation in TREC 2020 COVID Track Using Continuous Active Learning","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","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 Waterloo","funders":"","keywords":"Coronavirus disease 2019 (COVID-19); Track (disk drive); Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2); 2019-20 coronavirus outbreak; Computer science; Virology; Medicine; Infectious disease (medical specialty); Outbreak","score_opus":0.08329573879351988,"score_gpt":0.23936534015879013,"score_spread":0.15606960136527026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096226674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23038574,0.009897046,0.15651853,0.048456445,0.07786293,0.014358996,0.19618514,0.06586477,0.20047039],"genre_scores_gemma":[0.34475887,0.0010724677,0.11374466,0.01028793,0.00829539,0.0075148297,0.2857901,0.007916022,0.22061978],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9647455,0.015565085,0.000981177,0.00398769,0.010629793,0.0040907934],"domain_scores_gemma":[0.9195089,0.017477643,0.0010871374,0.009604148,0.032639887,0.01968225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0430638,0.0028321485,0.0024718859,0.0029731903,0.006169088,0.008791599,0.0042855153,0.004652223,0.034534983],"category_scores_gemma":[0.051506616,0.000813422,0.0014896515,0.0027222382,0.0014142757,0.005136635,0.008140117,0.006539624,0.03184815],"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.0007966519,0.00097361684,0.001971251,0.0004061758,0.0001195522,0.0001546554,0.0006295622,0.0022090967,0.0031531833,0.0012161358,0.93668634,0.05168372],"study_design_scores_gemma":[0.0013283979,0.0025089146,0.012309885,0.00021917801,0.00014171102,0.0005548372,0.0020830987,0.06429285,0.015545934,0.009811367,0.8907941,0.00040965987],"about_ca_topic_score_codex":0.01814376,"about_ca_topic_score_gemma":0.04843932,"teacher_disagreement_score":0.0430638,"about_ca_system_score_codex":0.003625106,"about_ca_system_score_gemma":0.008139559,"threshold_uncertainty_score":0.22774589},"labels":[],"label_agreement":null},{"id":"W3098573930","doi":"10.46298/lmcs-19(2:5)2023","title":"Inferring Symbolic Automata","year":2023,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Israel Science Foundation; Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Learnability; Computer science; Theoretical computer science; Model checking; Identifiability; Regular language; Kleene algebra; Bounded function; Boolean function; Limit (mathematics); Probably approximately correct learning; Polynomial; Discrete mathematics; Automaton; Mathematics; Algorithm; Artificial intelligence; Computational learning theory; Machine learning","score_opus":0.06941551654696516,"score_gpt":0.4283480724184977,"score_spread":0.35893255587153255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098573930","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.06826145,0.00036124722,0.92520714,0.00087390107,0.000042487878,0.00010106613,0.0007612142,0.001339263,0.0030522253],"genre_scores_gemma":[0.6687236,0.0005588766,0.32304037,0.00036398196,0.00014415033,0.00030458445,0.00246184,0.00043664192,0.00396597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943433,0.0015126112,0.00041721118,0.0018455031,0.0014457697,0.00043564817],"domain_scores_gemma":[0.93038875,0.057467666,0.003058782,0.0059293355,0.0024540157,0.0007014477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003164786,0.0011351472,0.0011316867,0.002239309,0.0009529206,0.003184396,0.0023863283,0.0020687527,0.0044206525],"category_scores_gemma":[0.06160843,0.0009732354,0.0026913288,0.0015752068,0.0031810768,0.008920721,0.0036333238,0.0032878455,0.00092063897],"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.00035516458,0.00021287188,0.011791512,0.00071173697,0.00021662122,0.00053367263,0.0011888761,0.44203907,0.010264653,0.4017788,0.002303869,0.12860319],"study_design_scores_gemma":[0.000015322239,0.00004437203,0.00039452733,0.000036786754,0.00003063719,0.00010012378,0.00010041363,0.5681276,0.0041040746,0.42529795,0.0017267952,0.000021452634],"about_ca_topic_score_codex":0.003187487,"about_ca_topic_score_gemma":0.0036086573,"teacher_disagreement_score":0.0044206525,"about_ca_system_score_codex":0.0027029973,"about_ca_system_score_gemma":0.0022211845,"threshold_uncertainty_score":0.019611716},"labels":[],"label_agreement":null},{"id":"W3102197198","doi":"","title":"Learning Linear Programs from Optimal Decisions","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","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; Concordia University","funders":"","keywords":"Computer science; Linear programming; Mathematical optimization; Backpropagation; Point (geometry); Artificial intelligence; Homogeneous; Machine learning; Artificial neural network; Algorithm; Mathematics","score_opus":0.03041559653165141,"score_gpt":0.26340838422031,"score_spread":0.23299278768865858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102197198","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.006027851,0.000115769326,0.99131536,0.00022877887,0.00001692644,0.00004632582,0.00010588332,0.0005438627,0.0015991908],"genre_scores_gemma":[0.42061085,0.0003696484,0.57069415,0.00045019365,0.00012036775,0.0007269725,0.0012368058,0.00048595393,0.0053050104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880636,0.0004031397,0.000049469018,0.0003295556,0.0002799624,0.0001316011],"domain_scores_gemma":[0.99705243,0.0021907198,0.0002355504,0.0001500663,0.0002619223,0.00010926816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019615672,0.0014050398,0.001570884,0.0010786004,0.00045571604,0.0014931422,0.0016876622,0.0016674402,0.0056965137],"category_scores_gemma":[0.009073468,0.0009970678,0.0011292445,0.0009609368,0.0015753049,0.0021984086,0.0018569398,0.00343128,0.00088935945],"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.000041498985,0.000050186773,0.0002984552,0.00007002943,0.000018651297,0.00005019419,0.00003415157,0.93537617,0.000343761,0.027310027,0.0018984126,0.03450845],"study_design_scores_gemma":[0.000006551525,0.000008932696,0.000018449271,0.0000074186064,0.0000017529688,0.0000044329663,0.0000030822712,0.9834758,0.00016997343,0.016041294,0.00025950623,0.0000028111704],"about_ca_topic_score_codex":0.0037049148,"about_ca_topic_score_gemma":0.0048905434,"teacher_disagreement_score":0.0056965137,"about_ca_system_score_codex":0.0014226036,"about_ca_system_score_gemma":0.002161823,"threshold_uncertainty_score":0.019056737},"labels":[],"label_agreement":null},{"id":"W3105079502","doi":"","title":"Multi-task Additive Models for Robust Estimation and Automatic Structure Discovery","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Task (project management); Artificial intelligence; Estimation; Data mining; Pattern recognition (psychology); Engineering","score_opus":0.023526670654839713,"score_gpt":0.250854597206479,"score_spread":0.2273279265516393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105079502","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.0013516721,0.0002884689,0.99763536,0.00010694207,0.0000330528,0.000011280084,0.000075459444,0.00031496113,0.00018272239],"genre_scores_gemma":[0.29485416,0.0013686626,0.6922004,0.00047948706,0.00041953754,0.00036675474,0.0017302698,0.0006577997,0.00792289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973954,0.0012171427,0.00014598353,0.0006673467,0.0003785969,0.00019547314],"domain_scores_gemma":[0.99199706,0.005177853,0.0006219102,0.0012800846,0.0007244296,0.00019869088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049412595,0.0020889402,0.0025158813,0.0014551503,0.0009231942,0.0022324168,0.0034812961,0.0027478626,0.0031679058],"category_scores_gemma":[0.019759933,0.0017557048,0.0022771866,0.0023376711,0.0013109584,0.0033933036,0.003550172,0.0048895245,0.0022843187],"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.0005302827,0.0002557101,0.00089431886,0.00033230826,0.0005203877,0.00017175154,0.00014880323,0.64146626,0.0055957786,0.057957113,0.0064752125,0.2856521],"study_design_scores_gemma":[0.000010138634,0.000028359838,0.0001417201,0.000011257142,0.000027083788,0.000026752636,0.000007817639,0.9725988,0.0008951624,0.02539088,0.00084437197,0.000017681923],"about_ca_topic_score_codex":0.0058996314,"about_ca_topic_score_gemma":0.00864321,"teacher_disagreement_score":0.0058996314,"about_ca_system_score_codex":0.0008899858,"about_ca_system_score_gemma":0.0017347389,"threshold_uncertainty_score":0.026132166},"labels":[],"label_agreement":null},{"id":"W3106175111","doi":"","title":"Training Linear Finite-State Machines.","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Training (meteorology); Finite-state machine; Artificial intelligence; Algorithm; Physics","score_opus":0.03953275174896976,"score_gpt":0.2669046606796222,"score_spread":0.22737190893065246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106175111","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.026216824,0.0015938714,0.95770663,0.00070926535,0.00045869843,0.00011287219,0.0007485522,0.0038345412,0.008618701],"genre_scores_gemma":[0.78948796,0.00061862066,0.19718257,0.0003855839,0.00014503326,0.00043442668,0.0024127944,0.0002509358,0.009082149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999385,0.00020270505,0.000044883363,0.00019381064,0.00008735105,0.000086194595],"domain_scores_gemma":[0.9946766,0.0042722723,0.0001500575,0.00040346105,0.00041955308,0.000078002195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054484,0.0008388254,0.0010020225,0.0004821796,0.00049489253,0.0009351251,0.0012564133,0.0013498367,0.009817593],"category_scores_gemma":[0.008916093,0.0007006337,0.00063793774,0.00065012684,0.0006603877,0.001736068,0.0010010336,0.0024004583,0.0024677152],"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.00037583036,0.00027618857,0.0024187674,0.00041795403,0.00018190527,0.00011703563,0.00012646535,0.64656657,0.002863011,0.022328498,0.0105023235,0.31382552],"study_design_scores_gemma":[0.00001497138,0.000027315176,0.00014730425,0.000019905861,0.000011404102,0.000010495677,0.000009735339,0.9860573,0.0010693346,0.011856922,0.000770385,0.0000050012486],"about_ca_topic_score_codex":0.0052832155,"about_ca_topic_score_gemma":0.010659015,"teacher_disagreement_score":0.009817593,"about_ca_system_score_codex":0.0007525654,"about_ca_system_score_gemma":0.0012658915,"threshold_uncertainty_score":0.032843173},"labels":[],"label_agreement":null},{"id":"W3110571569","doi":"10.1016/j.ipl.2021.106133","title":"Weighted automata are compact and actively learnable","year":2021,"lang":"en","type":"preprint","venue":"Information Processing Letters","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University; James S. McDonnell Foundation","keywords":"ω-automaton; Generalization; Quantum finite automata; Automaton; Mathematics; Discrete mathematics; Deterministic automaton; Time complexity; Deterministic finite automaton; Automata theory; Timed automaton; Mobile automaton; DFA minimization; Nondeterministic finite automaton; Algorithm; Computer science; Finite-state machine; Theoretical computer science","score_opus":0.010278333150746062,"score_gpt":0.23921076495620378,"score_spread":0.22893243180545772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110571569","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.108910754,0.00066135055,0.87800294,0.0006566753,0.00016354112,0.00006455109,0.00043781628,0.00093453424,0.010167838],"genre_scores_gemma":[0.8662614,0.00063096656,0.11034204,0.00039946678,0.00029913374,0.00036755833,0.0007350595,0.00058806915,0.020376312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980567,0.00035217902,0.00014531722,0.0007646,0.00046367332,0.00021755985],"domain_scores_gemma":[0.98419225,0.010088671,0.0013852693,0.0022612058,0.0015543865,0.0005182083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012123367,0.001100373,0.0014407021,0.001531412,0.00097199326,0.0033281124,0.0021494064,0.0023872969,0.0050770063],"category_scores_gemma":[0.016137935,0.0012391183,0.0011641147,0.0011380276,0.0028094742,0.010406895,0.0030089698,0.0037942394,0.0011554742],"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.00011109452,0.00006804129,0.00085122656,0.0001672562,0.00004597353,0.00023481062,0.0004776925,0.02413228,0.0066993753,0.93536365,0.0013534208,0.030495096],"study_design_scores_gemma":[0.0000108182085,0.000031057043,0.0001472966,0.000015500907,0.000012373259,0.00009476314,0.000042070944,0.11718309,0.0016021337,0.8794183,0.0014282978,0.000014272601],"about_ca_topic_score_codex":0.00078075536,"about_ca_topic_score_gemma":0.00098515,"teacher_disagreement_score":0.0050770063,"about_ca_system_score_codex":0.00095652987,"about_ca_system_score_gemma":0.00075590255,"threshold_uncertainty_score":0.016984284},"labels":[],"label_agreement":null},{"id":"W3111378514","doi":"10.1613/jair.1.12087","title":"Adapting Behavior via Intrinsic Reward: A Survey and Empirical Study","year":2020,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Computer science; Active learning (machine learning); Artificial intelligence; Introspection; Proactive learning; Representation (politics); Testbed; Machine learning; Cognitive psychology; Robot learning; Psychology","score_opus":0.32470343897132165,"score_gpt":0.4767867490410224,"score_spread":0.15208331006970077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111378514","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.17518575,0.24987008,0.52469933,0.0077625103,0.0003454538,0.000286406,0.0007028383,0.0012468739,0.039900746],"genre_scores_gemma":[0.85482806,0.08804004,0.05250425,0.0007324736,0.00053197274,0.0002182049,0.00039076735,0.00027668572,0.0024775448],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9970482,0.001200976,0.00018324149,0.0007356035,0.0006543045,0.000177672],"domain_scores_gemma":[0.9565618,0.03671146,0.002077174,0.0022014203,0.0019013643,0.00054674334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00465734,0.0012613396,0.0014882394,0.0015906101,0.0004923088,0.002857871,0.0017758412,0.0017743204,0.0031832324],"category_scores_gemma":[0.030457813,0.0007237415,0.0009662239,0.0023361593,0.002735879,0.0048782732,0.0012781571,0.0024950325,0.0007883376],"study_design_candidate":"observational","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.00045050294,0.0007826675,0.03729085,0.0049723024,0.0004976688,0.00013930931,0.00062020967,0.16616753,0.0021154264,0.119003825,0.0052510817,0.6627086],"study_design_scores_gemma":[0.00012984814,0.0013508658,0.042508118,0.0021151653,0.0004883515,0.00081595936,0.0012784986,0.6285122,0.0050699785,0.25182948,0.06558669,0.00031488543],"about_ca_topic_score_codex":0.002041447,"about_ca_topic_score_gemma":0.0012450123,"teacher_disagreement_score":0.00465734,"about_ca_system_score_codex":0.0016746497,"about_ca_system_score_gemma":0.0012873668,"threshold_uncertainty_score":0.024630666},"labels":[],"label_agreement":null},{"id":"W3114166581","doi":"10.1613/jair.1.12013","title":"On the Complexity of Learning a Class Ratio from Unlabeled Data","year":2020,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Mila - Quebec Artificial Intelligence Institute","funders":"National Science Foundation","keywords":"Learnability; VC dimension; Class (philosophy); Sample complexity; Axiom; Variety (cybernetics); Computer science; Artificial intelligence; Dimension (graph theory); Set (abstract data type); Machine learning; Concept class; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.48521303872051297,"score_gpt":0.44851998283976285,"score_spread":0.036693055880750114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114166581","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.12193941,0.0022524646,0.84174013,0.016771082,0.0001987795,0.00033001965,0.00197577,0.0012372877,0.013555088],"genre_scores_gemma":[0.7774211,0.0021573405,0.2051524,0.0025603932,0.00089965685,0.00075396046,0.0035235635,0.00050265226,0.0070288745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98839754,0.0055814767,0.0006563245,0.002323095,0.0022800274,0.00076153886],"domain_scores_gemma":[0.8579969,0.13015832,0.0023851853,0.0062269038,0.0022267257,0.0010059422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011273964,0.0012124834,0.00257301,0.0016070658,0.0015773192,0.006032078,0.0033176234,0.0026783338,0.005112143],"category_scores_gemma":[0.07292976,0.0008485423,0.0016509545,0.0024059755,0.0043458487,0.015362485,0.005424172,0.0062124864,0.00070929684],"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.0015916812,0.00041744963,0.008738392,0.00073772826,0.00026188296,0.0002791276,0.00086246664,0.39522028,0.0019804079,0.42373735,0.0140713835,0.15210184],"study_design_scores_gemma":[0.00006988526,0.000064299034,0.00072190526,0.00004264031,0.00003105736,0.00009900979,0.00009827948,0.62564814,0.00073960435,0.37118655,0.0012708029,0.000027727981],"about_ca_topic_score_codex":0.0060214093,"about_ca_topic_score_gemma":0.0040076105,"teacher_disagreement_score":0.011273964,"about_ca_system_score_codex":0.004993861,"about_ca_system_score_gemma":0.0031609326,"threshold_uncertainty_score":0.059623122},"labels":[],"label_agreement":null},{"id":"W3114981464","doi":"10.1017/9781108571401.012","title":"The Upper Confidence Bound Algorithm: Minimax Optimality","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Machine Learning and Algorithms","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 Alberta","funders":"","keywords":"Minimax; Upper and lower bounds; Content (measure theory); Computer science; Mathematical optimization; Mathematics; Algorithm","score_opus":0.017933067131491467,"score_gpt":0.211350567773031,"score_spread":0.1934175006415395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114981464","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.0011941555,0.0034262168,0.9722741,0.000823512,0.00028556722,0.00005062712,0.00021367447,0.00069405057,0.021037987],"genre_scores_gemma":[0.099996015,0.0070606736,0.8363994,0.0015411599,0.0011761455,0.0007284633,0.001581187,0.0021813263,0.049335748],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977417,0.00085907895,0.00011304145,0.00036881477,0.0007519481,0.00016545982],"domain_scores_gemma":[0.9963243,0.0027895125,0.00011414439,0.00034066808,0.00034795728,0.00008335292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030801378,0.0016983488,0.0029494043,0.0014274808,0.00069807674,0.0031355096,0.0032157917,0.0030743596,0.022127667],"category_scores_gemma":[0.015318311,0.0010267484,0.0011016022,0.0029858751,0.0016699241,0.0034279355,0.0035756358,0.0058017015,0.008595045],"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.00023473612,0.00012154928,0.0002646007,0.0006149561,0.00014856938,0.00009256131,0.00009818413,0.24488752,0.0009959866,0.20064917,0.09527639,0.4566157],"study_design_scores_gemma":[0.00008057616,0.000067794484,0.00022389654,0.00020305334,0.00003783042,0.00014419414,0.000024396844,0.75174546,0.0011353786,0.22542933,0.020867487,0.000040612445],"about_ca_topic_score_codex":0.0026104033,"about_ca_topic_score_gemma":0.0023500936,"teacher_disagreement_score":0.022127667,"about_ca_system_score_codex":0.0011534689,"about_ca_system_score_gemma":0.0023714867,"threshold_uncertainty_score":0.07402438},"labels":[],"label_agreement":null},{"id":"W3117691076","doi":"10.1017/9781108571401.011","title":"The Upper Confidence Bound Algorithm: Asymptotic Optimality","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Machine Learning and Algorithms","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 Alberta","funders":"","keywords":"Algorithm; Upper and lower bounds; Mathematics; Computer science; Mathematical analysis","score_opus":0.01611220428013797,"score_gpt":0.2073435006163297,"score_spread":0.19123129633619174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117691076","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.0016007934,0.0025553284,0.97846437,0.00087385095,0.00027660967,0.00008034301,0.00028556856,0.0011835991,0.014679581],"genre_scores_gemma":[0.10829936,0.005501648,0.84205574,0.0018291805,0.0016837259,0.0010512017,0.0028199262,0.0025281971,0.034231108],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914458,0.0036483197,0.0003806684,0.0012105841,0.0026228935,0.00069169945],"domain_scores_gemma":[0.9620013,0.029945407,0.00073800306,0.0038475334,0.0029752902,0.0004925058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009422518,0.002363839,0.0042548175,0.0039317342,0.0015858676,0.005656689,0.005708781,0.0040267156,0.022537587],"category_scores_gemma":[0.07907938,0.0017889191,0.0020528447,0.0066990135,0.0030026252,0.007615172,0.006553552,0.009271521,0.013866759],"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.0005131381,0.00028929222,0.0011227624,0.0007179117,0.00028929344,0.00017280532,0.00018334598,0.14292161,0.0011942401,0.26744455,0.085621096,0.49953005],"study_design_scores_gemma":[0.000110715904,0.0000593794,0.0004172203,0.00020101744,0.00008105404,0.00024651142,0.00004244581,0.6525385,0.0011807285,0.3339652,0.01110972,0.000047525224],"about_ca_topic_score_codex":0.0057763048,"about_ca_topic_score_gemma":0.00510395,"teacher_disagreement_score":0.022537587,"about_ca_system_score_codex":0.0025255962,"about_ca_system_score_gemma":0.0048860945,"threshold_uncertainty_score":0.07539576},"labels":[],"label_agreement":null},{"id":"W3125322785","doi":"","title":"The expressibility of functions on the Boolean domain, with applications to Counting CSPs","year":2015,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Isaac Newton Institute for Mathematical Sciences","keywords":"Computer science; Counting problem; Boolean function; Domain (mathematical analysis); Theoretical computer science; Arithmetic; Mathematics; Algorithm","score_opus":0.021300307207863963,"score_gpt":0.26005188475870183,"score_spread":0.23875157755083787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125322785","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.1295084,0.0017965597,0.8350188,0.0053569167,0.000097175114,0.00012080682,0.0005265681,0.00047479707,0.02710001],"genre_scores_gemma":[0.76001394,0.002298904,0.22461036,0.0008799384,0.0005535528,0.00046321852,0.000873241,0.00024111531,0.010065701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637324,0.0013887035,0.00024959346,0.0006475827,0.001046699,0.00029428236],"domain_scores_gemma":[0.978394,0.017917978,0.00096761965,0.0013151516,0.00096921605,0.00043605448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003628866,0.0011720173,0.0011571358,0.0024285424,0.0014199418,0.0047888313,0.0021588954,0.001496644,0.0040398943],"category_scores_gemma":[0.02677057,0.00062604377,0.0022354396,0.0054852567,0.004331549,0.013142893,0.0037124716,0.005970621,0.00044756237],"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.000033572018,0.0000318238,0.00044495656,0.000065074906,0.000011070497,0.00006815448,0.00020917259,0.017887276,0.00077023974,0.9654484,0.0008089745,0.01422126],"study_design_scores_gemma":[0.000013891085,0.000016137501,0.00016807919,0.000023295692,0.000012671254,0.00007912687,0.00006764273,0.10566164,0.000702009,0.8910043,0.0022361402,0.00001507469],"about_ca_topic_score_codex":0.0034218684,"about_ca_topic_score_gemma":0.0020196473,"teacher_disagreement_score":0.0047888313,"about_ca_system_score_codex":0.004055062,"about_ca_system_score_gemma":0.0012753736,"threshold_uncertainty_score":0.029421687},"labels":[],"label_agreement":null},{"id":"W3125798464","doi":"","title":"An Exponential Tail bound for Lq Stable Learning Rules.","year":2019,"lang":"en","type":"article","venue":"Algorithmic Learning Theory","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Exponential function; Mathematics; Upper and lower bounds; Stability (learning theory); Mathematical optimization; Computer science; Applied mathematics; Machine learning; Mathematical analysis","score_opus":0.0061748898356533246,"score_gpt":0.24255154468119505,"score_spread":0.23637665484554174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125798464","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.02190312,0.0015764337,0.9512273,0.002306941,0.00034665718,0.00009753908,0.00036272738,0.00067558454,0.021503717],"genre_scores_gemma":[0.8115832,0.0018763987,0.15158033,0.0028869128,0.0010248619,0.00052825705,0.0013779232,0.00092131156,0.028220795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923981,0.0018730193,0.0004061616,0.001063232,0.0033619439,0.000897624],"domain_scores_gemma":[0.8839206,0.09158503,0.0023976667,0.008966644,0.010748076,0.0023820184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010508643,0.0010504654,0.0015771774,0.0020775818,0.0014267009,0.0046928967,0.003806385,0.0023572105,0.017162418],"category_scores_gemma":[0.11079897,0.0009179509,0.0012711581,0.0022581427,0.0036954277,0.010713864,0.0051018586,0.008240258,0.003214427],"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.00034575138,0.00021205052,0.0027141613,0.00029922574,0.00009350296,0.00016104929,0.00030386975,0.04219532,0.0018163485,0.8655409,0.011593554,0.074724175],"study_design_scores_gemma":[0.000029116594,0.000056504738,0.0003544226,0.0000669505,0.00002772018,0.00009530144,0.000032540633,0.2586025,0.00088286854,0.73792654,0.0019034557,0.000022180478],"about_ca_topic_score_codex":0.0019402768,"about_ca_topic_score_gemma":0.002331158,"teacher_disagreement_score":0.017162418,"about_ca_system_score_codex":0.0026652706,"about_ca_system_score_gemma":0.0024457416,"threshold_uncertainty_score":0.057413995},"labels":[],"label_agreement":null},{"id":"W3133934064","doi":"","title":"Classification Confidence Scores with Point-wise Guarantees.","year":2021,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Point (geometry); Confidence interval; Artificial intelligence; Machine learning; Statistics; Mathematics","score_opus":0.09752630771783521,"score_gpt":0.3380556511823711,"score_spread":0.24052934346453586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133934064","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.015970206,0.0016052035,0.96840334,0.002503504,0.0005971917,0.00016603859,0.0008018485,0.0022081484,0.007744459],"genre_scores_gemma":[0.579998,0.0012047396,0.39894357,0.0013287489,0.0022034622,0.00069430924,0.0040786513,0.0009541347,0.010594381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9671166,0.010514231,0.0022699554,0.0045928373,0.013112629,0.0023937672],"domain_scores_gemma":[0.83960706,0.1011133,0.0068754456,0.03160764,0.0172564,0.003540142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03680423,0.0023744623,0.0035768186,0.0046114456,0.002031311,0.00791702,0.007384138,0.006367714,0.013691834],"category_scores_gemma":[0.20686701,0.001670146,0.0023252491,0.0044097616,0.0038953645,0.011655767,0.008268219,0.010275394,0.0062907333],"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.003195383,0.0007856725,0.009439478,0.0006947273,0.0006403901,0.0003517292,0.00034712287,0.15121795,0.0028134403,0.33107212,0.056919128,0.44252288],"study_design_scores_gemma":[0.00017178326,0.0002956244,0.0011946249,0.00012617458,0.000086101376,0.00028841905,0.000071412345,0.6097479,0.0027997503,0.38089222,0.0042766435,0.00004936626],"about_ca_topic_score_codex":0.0013647999,"about_ca_topic_score_gemma":0.0013848388,"teacher_disagreement_score":0.03680423,"about_ca_system_score_codex":0.002485974,"about_ca_system_score_gemma":0.004271413,"threshold_uncertainty_score":0.19464171},"labels":[],"label_agreement":null},{"id":"W3134713499","doi":"10.1007/s10994-021-05947-2","title":"Incremental learning of iterated dependencies","year":2021,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Atomic Energy of Canada Limited; Universiteit van Amsterdam; University of Cambridge; Institut national de recherche en informatique et en automatique (INRIA); University of Pennsylvania","keywords":"Link grammar; Dependency (UML); Iterated function; Categorial grammar; Grammar induction; Rule-based machine translation; Combinatory categorial grammar; Computer science; Dependency theory (database theory); Mathematics; Learnability; Theoretical computer science; L-attributed grammar; Tree-adjoining grammar; Artificial intelligence; Context-free grammar; Mildly context-sensitive grammar formalism; Functional dependency; Generative grammar; Emergent grammar; Attribute grammar","score_opus":0.00914247867839503,"score_gpt":0.2367233856628351,"score_spread":0.22758090698444006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134713499","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.06555685,0.0006777437,0.92567015,0.00048531525,0.00015310057,0.000058451915,0.00019602825,0.00096456835,0.006237761],"genre_scores_gemma":[0.8111228,0.00057010556,0.17854348,0.00021332441,0.00026986416,0.0001619394,0.0008283114,0.00029907352,0.007991099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990227,0.0003571978,0.000053497082,0.00026067186,0.00021704393,0.00008895953],"domain_scores_gemma":[0.98716927,0.009464504,0.0004778924,0.0015251412,0.0010747812,0.00028847833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017584665,0.0005562076,0.0010903359,0.001159423,0.000614356,0.0011754603,0.002508517,0.001195081,0.005376588],"category_scores_gemma":[0.020168887,0.00074306247,0.00079879543,0.0009442222,0.0011779155,0.0042327447,0.0019862244,0.0021805668,0.00075002766],"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.00047660572,0.0003233258,0.0041843243,0.0003862127,0.00021011778,0.00037891456,0.00042225327,0.3447869,0.0054348726,0.24434304,0.013068349,0.385985],"study_design_scores_gemma":[0.00001935785,0.000032054668,0.00032043058,0.00001584145,0.00002158719,0.00004406303,0.000012134865,0.9164208,0.0007522148,0.08147352,0.00087684806,0.000011116245],"about_ca_topic_score_codex":0.0024710922,"about_ca_topic_score_gemma":0.0045208973,"teacher_disagreement_score":0.005376588,"about_ca_system_score_codex":0.0007446816,"about_ca_system_score_gemma":0.00094433746,"threshold_uncertainty_score":0.017986417},"labels":[],"label_agreement":null},{"id":"W3138618557","doi":"10.1016/j.insmatheco.2021.03.008","title":"Batch mode active learning framework and its application on valuing large variable annuity portfolios","year":2021,"lang":"en","type":"article","venue":"Insurance Mathematics and Economics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Western University","keywords":"Computer science; Valuation (finance); Ambiguity; Portfolio; Monte Carlo method; Regression; Data mining; Machine learning; Finance; Mathematics; Statistics; Economics","score_opus":0.008225814142309598,"score_gpt":0.24414406372858177,"score_spread":0.23591824958627217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138618557","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.016669085,0.00051534653,0.9809147,0.0002847882,0.000050555114,0.000019982153,0.00003334174,0.00010886517,0.0014034313],"genre_scores_gemma":[0.7656136,0.0012321697,0.21884084,0.00019576034,0.0003480967,0.00016875243,0.00018690132,0.00010780655,0.013305955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944085,0.00028912767,0.000023747354,0.00009265573,0.00011316164,0.000040407824],"domain_scores_gemma":[0.9954448,0.0035724714,0.00019644442,0.0001976484,0.0004359624,0.00015279104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044679833,0.0007343849,0.0011840257,0.000659285,0.00036135694,0.0013594726,0.0021467367,0.0020565789,0.0026214323],"category_scores_gemma":[0.0103830695,0.0004903149,0.00063504267,0.0007956534,0.0010912817,0.0025585992,0.0012348779,0.0024020635,0.00030852275],"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.00026795242,0.0001830732,0.0013796791,0.00012596545,0.00006648138,0.00016367735,0.00014172675,0.739051,0.0034165399,0.1573219,0.0022783861,0.09560366],"study_design_scores_gemma":[0.000003657406,0.000010421316,0.00004864544,0.000002792174,0.000004083989,0.0000071774134,0.0000025793704,0.9872688,0.00017371678,0.012328059,0.0001468982,0.0000032544694],"about_ca_topic_score_codex":0.0020463276,"about_ca_topic_score_gemma":0.0016333433,"teacher_disagreement_score":0.0044679833,"about_ca_system_score_codex":0.0006794672,"about_ca_system_score_gemma":0.00069998327,"threshold_uncertainty_score":0.023629189},"labels":[],"label_agreement":null},{"id":"W3159062657","doi":"","title":"Beyond Marginal Uncertainty: How Accurately can Bayesian Regression Models Estimate Posterior Predictive Correlations?","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"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":"Computer science; Machine learning; Bayesian probability; Benchmark (surveying); Artificial intelligence; Gaussian process; Regression; Consistency (knowledge bases); Benchmarking; Marginal likelihood; Statistics; Mathematics; Gaussian","score_opus":0.08572084720730128,"score_gpt":0.3550802520154215,"score_spread":0.2693594048081202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159062657","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.06891219,0.0017407868,0.919474,0.0021834401,0.00011437516,0.000070132104,0.0009751533,0.0018611854,0.0046686763],"genre_scores_gemma":[0.8381957,0.0010852339,0.15593284,0.0006090891,0.00021065302,0.00016992466,0.0017566711,0.00080825674,0.0012317486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99146783,0.0044097705,0.0004797743,0.0013165218,0.0019481978,0.00037802794],"domain_scores_gemma":[0.93815523,0.046054643,0.003797666,0.00651987,0.0045241914,0.00094835286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021367528,0.0024134365,0.0023540165,0.0027128947,0.00079405104,0.0056269555,0.0030800076,0.0035312742,0.002304031],"category_scores_gemma":[0.13013369,0.0011283557,0.0013130353,0.0023445862,0.0025863426,0.011984298,0.0040501733,0.0045579304,0.001146372],"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.00037518845,0.00011722996,0.013650206,0.00027256028,0.00038874635,0.00008457748,0.0002539606,0.857094,0.001327779,0.037491202,0.0033790155,0.085565545],"study_design_scores_gemma":[0.000017187383,0.000059930448,0.0013532041,0.000086167194,0.000032494376,0.00005408418,0.000053227912,0.9447827,0.0017757796,0.050844748,0.0008951101,0.000045375018],"about_ca_topic_score_codex":0.008246153,"about_ca_topic_score_gemma":0.006553962,"teacher_disagreement_score":0.021367528,"about_ca_system_score_codex":0.0018088802,"about_ca_system_score_gemma":0.0023895418,"threshold_uncertainty_score":0.11300367},"labels":[],"label_agreement":null},{"id":"W3162206701","doi":"10.1017/9781108571401.010","title":"The Upper Confidence Bound Algorithm","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"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":"Algorithm; Computer science; Upper and lower bounds; Mathematics; Mathematical analysis","score_opus":0.014709909016811311,"score_gpt":0.20097297102519984,"score_spread":0.18626306200838852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162206701","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.0015421676,0.0036568611,0.97072464,0.0007977833,0.0005004122,0.00013090097,0.0009286585,0.0028337953,0.018884854],"genre_scores_gemma":[0.08737549,0.004934872,0.84542954,0.0014971552,0.0013651631,0.0007556534,0.0075932113,0.002666632,0.04838237],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99351305,0.0019013314,0.00036753458,0.0014354753,0.0022479454,0.0005347482],"domain_scores_gemma":[0.98888516,0.0061796624,0.00037481062,0.002342982,0.0019321918,0.00028519717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004628044,0.0022691975,0.00328023,0.004145395,0.001463917,0.0053395014,0.00548668,0.0032960908,0.04686476],"category_scores_gemma":[0.032116815,0.0012090581,0.002109233,0.005484107,0.0015777294,0.004870749,0.0049427203,0.006277093,0.031014744],"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.00037447913,0.00016641691,0.0008653169,0.0004774306,0.00025229415,0.00012777478,0.000069882524,0.053406253,0.0012561167,0.07832759,0.09722539,0.767451],"study_design_scores_gemma":[0.00016424421,0.00012275038,0.00084376644,0.00030289576,0.0001925935,0.00062214874,0.00006716166,0.6332234,0.004936192,0.2857612,0.07366588,0.00009776364],"about_ca_topic_score_codex":0.0055638244,"about_ca_topic_score_gemma":0.004080416,"teacher_disagreement_score":0.04686476,"about_ca_system_score_codex":0.0015893384,"about_ca_system_score_gemma":0.0039056484,"threshold_uncertainty_score":0.15677822},"labels":[],"label_agreement":null},{"id":"W3162733320","doi":"10.1109/icassp39728.2021.9413633","title":"Near-Optimal Resampling in Particle Filters Using the Ising Energy Model","year":2021,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"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":"Fujitsu","keywords":"Resampling; Divergence (linguistics); Particle filter; Convergence (economics); Algorithm; Mathematical optimization; Upper and lower bounds; Kullback–Leibler divergence; Mathematics; Computer science; Ising model; Integer (computer science); Statistics; Statistical physics; Kalman filter; Physics","score_opus":0.03448385788042208,"score_gpt":0.2822236028509717,"score_spread":0.24773974497054962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162733320","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.024394115,0.00014229245,0.973892,0.00017780098,0.00002898676,0.000025098034,0.000018271996,0.00017286853,0.0011486609],"genre_scores_gemma":[0.67063755,0.00022940314,0.3269341,0.00014433477,0.000056515302,0.0001051549,0.00009351439,0.00010728064,0.0016921316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994011,0.00023871646,0.000029238878,0.000090947724,0.0001842237,0.000055834655],"domain_scores_gemma":[0.9976453,0.0017212605,0.00016824549,0.0002188886,0.00018179014,0.0000643519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020969124,0.00046424425,0.00072915864,0.0004922921,0.0004742321,0.00077729044,0.00084759766,0.0010024408,0.00082152244],"category_scores_gemma":[0.0063305055,0.00041454486,0.00059649505,0.0004677713,0.00088678155,0.0014188037,0.0006993062,0.0009884494,0.00014775053],"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.0000859114,0.000036133555,0.00050720613,0.000042780946,0.000027731625,0.00007147835,0.000055174383,0.9398576,0.002851197,0.040251236,0.00046645093,0.015747143],"study_design_scores_gemma":[0.000005320916,0.0000076282086,0.00004788322,0.0000025597271,0.000002399178,0.000005934733,0.000002435749,0.9938758,0.00050495047,0.005408336,0.00013337148,0.0000034561244],"about_ca_topic_score_codex":0.0057736733,"about_ca_topic_score_gemma":0.0052048774,"teacher_disagreement_score":0.0057736733,"about_ca_system_score_codex":0.001043459,"about_ca_system_score_gemma":0.0011721551,"threshold_uncertainty_score":0.011480093},"labels":[],"label_agreement":null},{"id":"W3163500608","doi":"10.1103/physreva.104.052403","title":"Nonclassical kernels in continuous-variable systems","year":2021,"lang":"en","type":"preprint","venue":"Physical review. A/Physical review, A","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Witness; Kernel (algebra); Computer science; Variable (mathematics); Feature (linguistics); Theoretical computer science; Similarity (geometry); Kernel method; Artificial intelligence; Quantum; Statistical physics; Mathematics; Pure mathematics; Mathematical analysis; Physics; Quantum mechanics; Support vector machine; Philosophy","score_opus":0.01574435196665317,"score_gpt":0.35259077941093137,"score_spread":0.3368464274442782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163500608","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.14294551,0.003834455,0.8134584,0.005046046,0.00034319016,0.000059939015,0.00016166983,0.00026295317,0.033887867],"genre_scores_gemma":[0.9475421,0.001740217,0.045354918,0.0004239818,0.00026948098,0.00007138628,0.00005185124,0.000075574964,0.0044704103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989956,0.0003825022,0.00004184936,0.00014399533,0.000346801,0.000089262205],"domain_scores_gemma":[0.99716717,0.0016606427,0.0002720077,0.00053176226,0.00024002853,0.00012840512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020102398,0.00029558432,0.0005678069,0.0006967906,0.0006194619,0.0020131394,0.0009890693,0.0012181719,0.0020103813],"category_scores_gemma":[0.0054517332,0.00033681456,0.00045268293,0.00051463937,0.004224565,0.0042429892,0.0018531723,0.0021788846,0.00025671427],"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.0000058394767,0.0000050613967,0.000065646884,0.000022921135,0.0000036342428,0.000023860683,0.00004280941,0.0055865934,0.00046460034,0.9919905,0.00020966935,0.0015787983],"study_design_scores_gemma":[0.000008109242,0.000011233225,0.00019921872,0.000011529625,0.000002429893,0.000042858675,0.000018601493,0.114236,0.0004284184,0.8839107,0.0011183928,0.000012455979],"about_ca_topic_score_codex":0.0006662209,"about_ca_topic_score_gemma":0.00027483408,"teacher_disagreement_score":0.0020131394,"about_ca_system_score_codex":0.0010174947,"about_ca_system_score_gemma":0.00077270495,"threshold_uncertainty_score":0.010631323},"labels":[],"label_agreement":null},{"id":"W3168792393","doi":"10.1145/3406325.3465360","title":"Learnability can be independent of set theory (invited paper)","year":2021,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Learnability; Mathematics; Discrete mathematics; Conjecture; Cardinality (data modeling); Combinatorics; Computer science; Artificial intelligence","score_opus":0.013669477555483447,"score_gpt":0.25628229183772555,"score_spread":0.2426128142822421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168792393","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.06981003,0.04486025,0.4568625,0.27220798,0.008877944,0.00009521431,0.0010531612,0.0007490678,0.1454838],"genre_scores_gemma":[0.8524632,0.01386442,0.055855423,0.020647218,0.018201519,0.00019780874,0.0007339449,0.00043786585,0.037598554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979602,0.00060137326,0.000068142566,0.0007030035,0.00053541217,0.0001317693],"domain_scores_gemma":[0.9792139,0.018153612,0.00034062174,0.0008584046,0.0009912625,0.00044215212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032684556,0.00054012693,0.0009507209,0.0010292762,0.0010705215,0.0035920423,0.0007581822,0.0018165739,0.005847593],"category_scores_gemma":[0.02297825,0.0004711847,0.0010808515,0.0009562114,0.0059984927,0.00963681,0.0019125356,0.006324521,0.0012233206],"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.000057845857,0.000035353445,0.00073389563,0.00018333965,0.000044424254,0.000058351834,0.00021925774,0.004709125,0.0005186913,0.9169901,0.033698324,0.04275131],"study_design_scores_gemma":[0.000010610228,0.000019337805,0.00046743455,0.000035351986,0.000011553321,0.00007998956,0.000033721775,0.006450111,0.00043328138,0.96627843,0.026163952,0.000016316211],"about_ca_topic_score_codex":0.0010051026,"about_ca_topic_score_gemma":0.0005571505,"teacher_disagreement_score":0.005847593,"about_ca_system_score_codex":0.0021431695,"about_ca_system_score_gemma":0.0006220233,"threshold_uncertainty_score":0.019562185},"labels":[],"label_agreement":null},{"id":"W3172003993","doi":"10.1007/978-3-030-76928-4_9","title":"Robustness to Approximations and Model Learning in MDPs and POMDPs","year":2021,"lang":"en","type":"book-chapter","venue":"Emergence, complexity and computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Robustness (evolution); Convergence (economics); Mathematical optimization; Computer science; Optimal control; Mathematics","score_opus":0.04616066726937957,"score_gpt":0.2798371538038212,"score_spread":0.23367648653444162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172003993","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.017755996,0.001953296,0.96590346,0.0017277375,0.00012447138,0.000038194215,0.0001501904,0.00025749265,0.012089202],"genre_scores_gemma":[0.8223984,0.0033626754,0.16361879,0.0004974224,0.00038473526,0.0002846395,0.00040657562,0.00033301348,0.0087137325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967374,0.0016030564,0.00018059478,0.00056961883,0.00071402406,0.00019532222],"domain_scores_gemma":[0.9656722,0.030497026,0.001146222,0.0016924159,0.0006854841,0.00030658187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041667526,0.0011716125,0.0020841416,0.0011406787,0.0008269441,0.0037868693,0.001942915,0.0023402437,0.0036142801],"category_scores_gemma":[0.036026318,0.0010735583,0.001684516,0.0013136187,0.0054511027,0.005917399,0.0038357344,0.005498552,0.00033889042],"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.000073094314,0.000025460491,0.000393126,0.0001843288,0.000059662445,0.0000702113,0.00014923672,0.45589012,0.00040861566,0.52301466,0.0013863675,0.018345147],"study_design_scores_gemma":[0.00000704717,0.000012555752,0.00008447338,0.00002109391,0.000008272958,0.000017124108,0.000022109452,0.52724755,0.00017253814,0.4716639,0.00073389226,0.000009460863],"about_ca_topic_score_codex":0.0039719697,"about_ca_topic_score_gemma":0.0019899085,"teacher_disagreement_score":0.0041667526,"about_ca_system_score_codex":0.0032621704,"about_ca_system_score_gemma":0.0014170591,"threshold_uncertainty_score":0.023668885},"labels":[],"label_agreement":null},{"id":"W3173332884","doi":"10.48550/arxiv.2106.12535","title":"Learning Stochastic Majority Votes by Minimizing a PAC-Bayes Generalization Bound","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Université Laval","funders":"","keywords":"Generalization; Prior probability; Differentiable function; Computer science; Bayes' theorem; Series (stratigraphy); Artificial intelligence; Dirichlet distribution; Upper and lower bounds; Algorithm; Mathematics; Applied mathematics; Machine learning; Mathematical optimization; Bayesian probability","score_opus":0.030402094354615012,"score_gpt":0.1859151147798472,"score_spread":0.15551302042523218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173332884","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.04757366,0.00049882947,0.94629127,0.00084475067,0.000072991184,0.0000932807,0.00012045855,0.00048399417,0.0040207687],"genre_scores_gemma":[0.7434406,0.00034144262,0.24617296,0.0008452059,0.00026758586,0.00033731185,0.0006891117,0.00046728057,0.0074384683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957497,0.001887335,0.0001794605,0.0009341636,0.0009084409,0.00034089707],"domain_scores_gemma":[0.9876673,0.008910266,0.00071400095,0.001380948,0.00095226866,0.00037519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008302898,0.0013458572,0.0027724735,0.00085409364,0.0011500655,0.0027197164,0.0033588107,0.0025256143,0.003175863],"category_scores_gemma":[0.025828922,0.00075642345,0.0013619472,0.0010598692,0.0019806025,0.004704131,0.0035355622,0.0031945137,0.0010537695],"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.00041968955,0.00014194657,0.0019268646,0.00017607442,0.00013921755,0.000087117536,0.0002449662,0.7560197,0.0018812768,0.097482346,0.0059426627,0.13553813],"study_design_scores_gemma":[0.000014107419,0.000032117845,0.000097689,0.000012462238,0.000009840642,0.000017624574,0.000015815449,0.96311164,0.00062610523,0.03560898,0.00044644703,0.000007134247],"about_ca_topic_score_codex":0.0025571526,"about_ca_topic_score_gemma":0.002764326,"teacher_disagreement_score":0.008302898,"about_ca_system_score_codex":0.0017205308,"about_ca_system_score_gemma":0.0018216945,"threshold_uncertainty_score":0.043910444},"labels":[],"label_agreement":null},{"id":"W3174799275","doi":"","title":"Learning and testing junta distributions with sub cube conditioning","year":2021,"lang":"en","type":"article","venue":"Conference on Learning Theory","topic":"Machine Learning and Algorithms","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":"Conditioning; Combinatorics; Distribution (mathematics); Mathematics; Logarithm; Bhattacharyya distance; Probability distribution; Discrete mathematics; Algorithm; Computer science; Statistics; Artificial intelligence; Mathematical analysis","score_opus":0.016076298876510308,"score_gpt":0.2527456540907559,"score_spread":0.2366693552142456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174799275","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.23021504,0.00077198114,0.7532955,0.0028817242,0.00021570061,0.00038353578,0.0017182578,0.0055772364,0.004941028],"genre_scores_gemma":[0.7244607,0.00032990504,0.26092213,0.0016531094,0.0004299077,0.00071610813,0.0064119413,0.0009361784,0.0041399277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99158305,0.0028215044,0.00057234743,0.002502666,0.0018922227,0.0006281614],"domain_scores_gemma":[0.92983675,0.053255435,0.0025239424,0.00973039,0.003011523,0.0016418908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007194861,0.0021054328,0.0026894584,0.0014643143,0.0015775776,0.0032879878,0.0059794993,0.0029830416,0.00777153],"category_scores_gemma":[0.07238828,0.0010305189,0.0027951726,0.002341473,0.003438934,0.009807803,0.006473823,0.006532435,0.0021149495],"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.00450004,0.0016092586,0.05058598,0.000638981,0.0005961251,0.0008212796,0.0008896531,0.41839117,0.0074455375,0.19255364,0.026970938,0.2949974],"study_design_scores_gemma":[0.00010246607,0.00019833392,0.0010769021,0.000028484776,0.000026407548,0.00017168693,0.00012069424,0.8576603,0.0025753924,0.13694833,0.0010622831,0.000028728811],"about_ca_topic_score_codex":0.0039652167,"about_ca_topic_score_gemma":0.0047672,"teacher_disagreement_score":0.00777153,"about_ca_system_score_codex":0.0020662302,"about_ca_system_score_gemma":0.0028125395,"threshold_uncertainty_score":0.038050532},"labels":[],"label_agreement":null},{"id":"W3174935984","doi":"","title":"Size and Depth Separation in Approximating Natural Functions with Neural Networks","year":2021,"lang":"en","type":"article","venue":"Conference on Learning Theory","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"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":"Lipschitz continuity; Bounded function; Mathematics; Function (biology); Polynomial; Artificial neural network; Constant (computer programming); Computational complexity theory; Discrete mathematics; Algorithm; Computer science; Pure mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.010892488346086762,"score_gpt":0.25413729974615773,"score_spread":0.24324481140007098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174935984","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.18348527,0.0016931911,0.79198,0.0036409977,0.0000968615,0.0001153199,0.00042739045,0.0019176656,0.016643256],"genre_scores_gemma":[0.7567539,0.0009423294,0.23389958,0.0007982903,0.00011498417,0.00018440529,0.0005477031,0.00040310522,0.0063557066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981706,0.000566676,0.00010458063,0.00041686033,0.0005097059,0.00023151544],"domain_scores_gemma":[0.9911142,0.00670441,0.0004523427,0.001048602,0.00041052196,0.0002697904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022498716,0.001300104,0.00090386055,0.0008891154,0.00072737946,0.0020205153,0.0020466626,0.0016630279,0.0035465069],"category_scores_gemma":[0.019627495,0.000798873,0.0014553118,0.000688157,0.0025348824,0.009179484,0.0036907638,0.0035302273,0.00056044065],"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.0010506494,0.00015765199,0.006625864,0.0005000503,0.00012387199,0.00025877976,0.00079956796,0.5878466,0.014030467,0.26729834,0.003983139,0.11732508],"study_design_scores_gemma":[0.000022846934,0.000075750235,0.00042737238,0.000039087932,0.00002902606,0.00007999965,0.00005514075,0.858995,0.0037536821,0.13434961,0.0021564362,0.000016019687],"about_ca_topic_score_codex":0.004462123,"about_ca_topic_score_gemma":0.0062687197,"teacher_disagreement_score":0.004462123,"about_ca_system_score_codex":0.0036390007,"about_ca_system_score_gemma":0.0015139277,"threshold_uncertainty_score":0.02640289},"labels":[],"label_agreement":null},{"id":"W3175423610","doi":"10.31234/osf.io/76mkg","title":"Sampling heuristics for active function learning","year":2021,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Heuristics; Sampling (signal processing); Heuristic; Computer science; Simple (philosophy); Function (biology); Machine learning; Adaptation (eye); Artificial intelligence; Mathematical optimization; Mathematics; Psychology","score_opus":0.022909199357289852,"score_gpt":0.28443409312324835,"score_spread":0.2615248937659585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175423610","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.15233181,0.00062680256,0.8395089,0.0010860072,0.000053085383,0.00015857576,0.0001078841,0.00047434843,0.0056525837],"genre_scores_gemma":[0.8630597,0.00017911717,0.13454974,0.0003114073,0.000051117568,0.00027759123,0.00013859343,0.000080115096,0.0013526013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954823,0.0030761347,0.00022392668,0.00058801234,0.00038859795,0.00024099366],"domain_scores_gemma":[0.9487624,0.04430083,0.0017004499,0.003572206,0.0010463102,0.0006177948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010583728,0.0009439429,0.0011121188,0.0013062777,0.0007503075,0.0025060282,0.001970995,0.0023531176,0.00372144],"category_scores_gemma":[0.07085292,0.0007406715,0.0008521999,0.000778876,0.0026395493,0.0041943477,0.0015397238,0.0023587246,0.00052417524],"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.00083314127,0.0005230864,0.018235743,0.00047525924,0.0003723509,0.00028558023,0.0019129327,0.40757197,0.003772997,0.34228364,0.0029441454,0.2207891],"study_design_scores_gemma":[0.00009182823,0.00012251093,0.0012210571,0.000049192255,0.000034387867,0.00006410589,0.0001079966,0.76336074,0.0010659131,0.23299663,0.00085766753,0.000027954793],"about_ca_topic_score_codex":0.0015551804,"about_ca_topic_score_gemma":0.002017313,"teacher_disagreement_score":0.010583728,"about_ca_system_score_codex":0.0013999009,"about_ca_system_score_gemma":0.0009049963,"threshold_uncertainty_score":0.055972755},"labels":[],"label_agreement":null},{"id":"W3175755704","doi":"10.1109/icit46573.2021.9453482","title":"A Feature-Based Machine Learning Approach for Mixed-Criticality Systems","year":2021,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Machine learning; Field (mathematics); Criticality; Robot learning; Robot; Cyber-physical system; Mobile robot","score_opus":0.015892513424145754,"score_gpt":0.2573370809992916,"score_spread":0.24144456757514585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175755704","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.0047285864,0.00012238392,0.99422413,0.00010956549,0.00001287868,0.000019373201,0.000020481897,0.000103921266,0.0006587299],"genre_scores_gemma":[0.73287004,0.0002449086,0.263873,0.00013138914,0.000081734084,0.00017453755,0.00012585876,0.00007233763,0.0024261507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953806,0.00013161702,0.000028147697,0.00010760088,0.00014027927,0.00005440071],"domain_scores_gemma":[0.99901795,0.0005450669,0.00010469676,0.000077076875,0.0002168941,0.000038369722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009400352,0.0007382794,0.00082510384,0.00096540444,0.0005155108,0.0009348276,0.0013246969,0.00088239234,0.0022418587],"category_scores_gemma":[0.0025355455,0.000358744,0.0006709059,0.00059386686,0.00074484025,0.0014016979,0.0011423287,0.0012392913,0.00032574718],"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.00007084038,0.00006209016,0.001341232,0.00011228632,0.00006987546,0.00020446822,0.00011694986,0.8258846,0.0027710134,0.06687041,0.0011718387,0.10132441],"study_design_scores_gemma":[0.0000023337236,0.000016680096,0.000068762274,0.000003512008,0.0000039482156,0.000020256926,0.0000039498955,0.98692816,0.00017121923,0.012438243,0.0003393322,0.000003660837],"about_ca_topic_score_codex":0.0020055568,"about_ca_topic_score_gemma":0.0015824226,"teacher_disagreement_score":0.0022418587,"about_ca_system_score_codex":0.00074605027,"about_ca_system_score_gemma":0.000572403,"threshold_uncertainty_score":0.0074997544},"labels":[],"label_agreement":null},{"id":"W3175989421","doi":"","title":"On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","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 Alberta","funders":"","keywords":"Realizability; Markov decision process; Bellman equation; Bounded function; Mathematical optimization; Mathematics; Function (biology); Time horizon; Linear programming; Computer science; Markov process; Algorithm","score_opus":0.03489768521518928,"score_gpt":0.19835584774944626,"score_spread":0.163458162534257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175989421","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.03647405,0.00042631474,0.95878077,0.0006565696,0.000026766562,0.00012756015,0.00019492867,0.0007266018,0.0025864227],"genre_scores_gemma":[0.6532414,0.000774727,0.34229323,0.0002910444,0.00008082038,0.00044747174,0.00056511,0.00029289478,0.0020132505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995828,0.0017399616,0.00023727822,0.0008137505,0.0007040473,0.00067686266],"domain_scores_gemma":[0.97420937,0.022784745,0.00080346165,0.0012266753,0.00053373404,0.00044202615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061227377,0.0014920265,0.002643846,0.00097025756,0.0010227453,0.0022924521,0.0023852196,0.0016149307,0.0037044552],"category_scores_gemma":[0.022662869,0.0009144124,0.0020197874,0.0019333159,0.00462113,0.0055876723,0.0035790934,0.0034243308,0.00041758615],"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.00023003515,0.000060494196,0.00027296363,0.000104012885,0.000026848873,0.00006585027,0.00013036138,0.9353813,0.00078230223,0.050910044,0.00042755634,0.011608275],"study_design_scores_gemma":[0.000034942426,0.00005060704,0.000048734917,0.000011510357,0.000008657588,0.000011104251,0.000019660383,0.9496373,0.00043474155,0.049513176,0.00022098472,0.000008573035],"about_ca_topic_score_codex":0.013022469,"about_ca_topic_score_gemma":0.008047289,"teacher_disagreement_score":0.013022469,"about_ca_system_score_codex":0.0036023208,"about_ca_system_score_gemma":0.004039453,"threshold_uncertainty_score":0.03238052},"labels":[],"label_agreement":null},{"id":"W3177257816","doi":"","title":"MRG_UWaterloo Participation in the TREC 2020 Precision Medicine Track.","year":2020,"lang":"en","type":"article","venue":"Text REtrieval Conference","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University Health Network; University of Waterloo","funders":"","keywords":"Track (disk drive); Computer science; Precision medicine; Artificial intelligence; Information retrieval; Medicine","score_opus":0.0453331524621173,"score_gpt":0.31571176415762026,"score_spread":0.270378611695503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177257816","genre_codex":"other","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.010629021,0.014963763,0.011796116,0.12680486,0.053975817,0.00357807,0.22884062,0.0077627627,0.541649],"genre_scores_gemma":[0.017933946,0.0021898006,0.008404245,0.017398112,0.0057924087,0.00067827635,0.09822963,0.00088495604,0.8484887],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99303174,0.001323031,0.00016762674,0.00078729895,0.0034748062,0.0012155331],"domain_scores_gemma":[0.9872224,0.0007900037,0.00025908832,0.00057176023,0.007226313,0.003930469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011753537,0.0015828868,0.0020667876,0.0029668207,0.0041537597,0.005982981,0.0026656853,0.004052326,0.16110636],"category_scores_gemma":[0.009002735,0.0005190745,0.0009007745,0.002704711,0.0011002545,0.0028512839,0.003604298,0.0021021243,0.10036899],"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.00006614546,0.000041786865,0.0001325768,0.000052214204,0.0000067946767,0.000012465447,0.000016986021,0.00005358145,0.00040255958,0.0003319098,0.9890485,0.009834483],"study_design_scores_gemma":[0.00010395175,0.00009703416,0.0018626632,0.000061154744,0.000018378907,0.00003010146,0.000121347766,0.0007042689,0.0012766673,0.00086413213,0.99483645,0.000023902405],"about_ca_topic_score_codex":0.19976693,"about_ca_topic_score_gemma":0.43666995,"teacher_disagreement_score":0.19976693,"about_ca_system_score_codex":0.00810436,"about_ca_system_score_gemma":0.018749632,"threshold_uncertainty_score":0.5389545},"labels":[],"label_agreement":null},{"id":"W3181285895","doi":"10.1109/icps49255.2021.9468145","title":"An Active Transfer Learning (ATL) Framework for Smart Manufacturing with Limited Data: Case Study on Material Transfer in Composites Processing","year":2021,"lang":"en","type":"article","venue":"","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":"Kelowna General Hospital; Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Transfer of learning; Aerospace; Process (computing); Limiting; Data modeling; Product (mathematics); Manufacturing engineering; Machine learning; Quality (philosophy); Artificial intelligence; Process engineering; Industrial engineering; Engineering; Mechanical engineering; Mathematics","score_opus":0.031011322825660093,"score_gpt":0.30618657759443746,"score_spread":0.27517525476877736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181285895","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.061571725,0.0005260537,0.93346256,0.00049254985,0.000029594574,0.0001542331,0.00009304707,0.00033254136,0.003337735],"genre_scores_gemma":[0.857554,0.00026984347,0.13919593,0.00010727195,0.00003192944,0.0003178542,0.00013562283,0.000042120584,0.0023454272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990262,0.0004346546,0.000048877057,0.00020893494,0.00020526735,0.00007614191],"domain_scores_gemma":[0.99705756,0.002292918,0.00018158118,0.0001857742,0.00020371437,0.00007838101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030582584,0.0008458158,0.0007977164,0.00058443204,0.0005521733,0.0012558032,0.0018839908,0.0020034714,0.0021855752],"category_scores_gemma":[0.00426458,0.0003307046,0.00091371697,0.0006176844,0.0015756651,0.0016790688,0.0015958096,0.0018254704,0.00027801876],"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.00018901844,0.00023177451,0.00090555614,0.00016682011,0.000031142907,0.00020573087,0.000121712044,0.938009,0.0036598106,0.010776444,0.0003290635,0.04537402],"study_design_scores_gemma":[0.000009367756,0.00009204761,0.00016005387,0.0000057415145,0.000006192182,0.000021114594,0.000019324114,0.9908655,0.00202785,0.006351228,0.00043345842,0.000008052448],"about_ca_topic_score_codex":0.0027874836,"about_ca_topic_score_gemma":0.0023524594,"teacher_disagreement_score":0.0030582584,"about_ca_system_score_codex":0.00091391546,"about_ca_system_score_gemma":0.0010980493,"threshold_uncertainty_score":0.01617378},"labels":[],"label_agreement":null},{"id":"W3184302936","doi":"","title":"Identifying Regions of Trusted Predictions","year":2021,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"Machine Learning and Algorithms","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":"York University; University of Waterloo","funders":"","keywords":"Computer science; Pointwise; Machine learning; Artificial intelligence; Process (computing); Domain (mathematical analysis); Data mining; Confidence interval; Sample complexity; Sample (material); Statistics; Mathematics","score_opus":0.05836014756836001,"score_gpt":0.32275409738340266,"score_spread":0.26439394981504266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184302936","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.08944411,0.0006533541,0.90395945,0.0009463128,0.00003906128,0.000090269976,0.0005708079,0.0010608084,0.0032358135],"genre_scores_gemma":[0.8567128,0.00035346055,0.13948083,0.0003330635,0.00012095638,0.0002146455,0.0012612939,0.00045773442,0.0010651808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990298,0.0026241534,0.00054131285,0.002222119,0.0034410518,0.00087352726],"domain_scores_gemma":[0.8608825,0.10470001,0.010275956,0.013270704,0.009048479,0.0018223079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012793548,0.0010908087,0.0019050146,0.002139059,0.0015388166,0.0053589735,0.0035524482,0.002890103,0.0039894334],"category_scores_gemma":[0.12325603,0.001233248,0.0016207132,0.001525692,0.0044437996,0.007848712,0.007319223,0.0036817887,0.0010887142],"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.0018302705,0.00017464721,0.03449829,0.000674856,0.00020855055,0.0012427343,0.0027334508,0.47854394,0.014201572,0.3409552,0.0064246026,0.11851196],"study_design_scores_gemma":[0.00005055386,0.00012786718,0.0026650582,0.00012335792,0.00004492971,0.00037230938,0.00026237356,0.7213654,0.015749129,0.2562139,0.002967632,0.000057607875],"about_ca_topic_score_codex":0.002629122,"about_ca_topic_score_gemma":0.0016518444,"teacher_disagreement_score":0.012793548,"about_ca_system_score_codex":0.0020844026,"about_ca_system_score_gemma":0.002311049,"threshold_uncertainty_score":0.06765962},"labels":[],"label_agreement":null},{"id":"W3185643228","doi":"10.1145/3459605","title":"Falsification of Hybrid Systems Using Adaptive Probabilistic Search","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":24,"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":"Japan Science and Technology Agency; Japan Society for the Promotion of Science","keywords":"Probabilistic logic; Computer science; Robustness (evolution); Discriminative model; Exploit; Baseline (sea); Discretization; Algorithm; Key (lock); Tree traversal; Tree (set theory); Mathematical optimization; Machine learning; Artificial intelligence; Mathematics","score_opus":0.0666532214771873,"score_gpt":0.29892923341253497,"score_spread":0.23227601193534766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185643228","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.04980948,0.0001590395,0.9463061,0.0002326595,0.000025511485,0.00008284843,0.000052444953,0.0012872847,0.0020446086],"genre_scores_gemma":[0.79609734,0.000059679307,0.20219627,0.0001277492,0.000018882763,0.00014577387,0.00011409331,0.00019162508,0.0010486403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783045,0.00078362925,0.00012722025,0.00035306218,0.00065998733,0.0002456722],"domain_scores_gemma":[0.9810628,0.015335561,0.0012434748,0.001154938,0.0008715194,0.00033175535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003963375,0.0014083325,0.0014309135,0.0013384414,0.00076179503,0.0017830009,0.002077904,0.0020847963,0.0039291],"category_scores_gemma":[0.02288067,0.0007291641,0.0011905511,0.0006200378,0.0030012866,0.002473329,0.0031144517,0.0018991116,0.0004544114],"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.00022072585,0.00004104776,0.0018165576,0.00011421017,0.000063698186,0.0001718667,0.00012376487,0.9338158,0.0022610219,0.025041202,0.00051793,0.03581215],"study_design_scores_gemma":[0.000016033027,0.000030343597,0.000055791046,0.000010358988,0.000006133507,0.00002572373,0.000013033752,0.98578876,0.0008708348,0.013011976,0.00016467355,0.000006288991],"about_ca_topic_score_codex":0.0022151521,"about_ca_topic_score_gemma":0.0023808877,"teacher_disagreement_score":0.003963375,"about_ca_system_score_codex":0.0012373604,"about_ca_system_score_gemma":0.0017327542,"threshold_uncertainty_score":0.020960629},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W3188523428","doi":"10.24963/ijcai.2021/354","title":"Asynchronous Active Learning with Distributed Label Querying","year":2021,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Novelis (Canada)","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Asynchronous communication; Crowdsourcing; Server; Active learning (machine learning); Synchronization (alternating current); Latency (audio); Machine learning; Artificial intelligence; Distributed computing; Computer network; World Wide Web","score_opus":0.00796768571783371,"score_gpt":0.23454462266297232,"score_spread":0.2265769369451386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188523428","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.0075051277,0.00015117807,0.99002916,0.0002564066,0.00005211561,0.00006717564,0.000045373577,0.0007894712,0.0011041069],"genre_scores_gemma":[0.64819723,0.0002524272,0.34321722,0.00056941475,0.0004081233,0.00060949684,0.00036344182,0.000277782,0.006104884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964976,0.0011536891,0.00015953807,0.0011266103,0.00077845796,0.0002841574],"domain_scores_gemma":[0.9922289,0.0043431493,0.00047908688,0.0016386106,0.0008819912,0.00042820378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00459563,0.0014367589,0.0019466496,0.00093331066,0.0013956438,0.0031052243,0.006267992,0.0024678537,0.0031133874],"category_scores_gemma":[0.01041272,0.00078229816,0.0008574724,0.0015077873,0.0018398796,0.0054681697,0.0047982153,0.0030607108,0.0010514766],"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.0017360954,0.00091669336,0.0032743723,0.00037514538,0.00014600383,0.00038592168,0.0009260407,0.50742006,0.019471752,0.070256114,0.009944773,0.38514695],"study_design_scores_gemma":[0.000055520013,0.000035710444,0.00006275613,0.0000042438533,0.0000103976345,0.000026698306,0.00002719271,0.97898394,0.0019133027,0.01783681,0.0010344143,0.000008998043],"about_ca_topic_score_codex":0.0022169729,"about_ca_topic_score_gemma":0.003042525,"teacher_disagreement_score":0.006267992,"about_ca_system_score_codex":0.0011209282,"about_ca_system_score_gemma":0.002010167,"threshold_uncertainty_score":0.02430427},"labels":[],"label_agreement":null},{"id":"W3190040206","doi":"10.24963/ijcai.2021/420","title":"Dual Active Learning for Both Model and Data Selection","year":2021,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Novelis (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Machine learning; Discriminative model; Hyperparameter; Artificial intelligence; Model selection; Selection (genetic algorithm); Dual (grammatical number); Convergence (economics); Active learning (machine learning); Labeled data; Data mining","score_opus":0.03484230968304197,"score_gpt":0.30994578767170455,"score_spread":0.2751034779886626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190040206","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.0037855485,0.00019814966,0.99488753,0.00017923179,0.000026174133,0.000042799078,0.000026409398,0.0003014899,0.0005526707],"genre_scores_gemma":[0.39492428,0.00045250033,0.59789073,0.00076225016,0.00029660447,0.0006742628,0.0005442493,0.0002972912,0.0041577974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960885,0.0019094179,0.00018556621,0.0007578567,0.00082546927,0.00023312759],"domain_scores_gemma":[0.9930648,0.0042381873,0.00043503038,0.0010365403,0.0008916893,0.00033375397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069356128,0.0019464773,0.0024661147,0.001924626,0.0008366219,0.0025455395,0.005674687,0.0030841231,0.003359558],"category_scores_gemma":[0.014479839,0.0010916028,0.0013875036,0.0015788887,0.0020485246,0.0045147534,0.004856244,0.0041688485,0.0012381803],"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.00055260543,0.00057941227,0.0028071986,0.00032941657,0.00022331046,0.00021032724,0.00034040003,0.54030275,0.0101587465,0.07014892,0.0070362077,0.3673107],"study_design_scores_gemma":[0.000017616187,0.000025711137,0.000030353192,0.0000056555436,0.0000089163705,0.000021246378,0.000008314206,0.9892371,0.0011046275,0.0089896675,0.00054482464,0.000005977394],"about_ca_topic_score_codex":0.0016647856,"about_ca_topic_score_gemma":0.0021620884,"teacher_disagreement_score":0.0069356128,"about_ca_system_score_codex":0.0011849062,"about_ca_system_score_gemma":0.0015078031,"threshold_uncertainty_score":0.036679447},"labels":[],"label_agreement":null},{"id":"W3195438473","doi":"10.1007/s10115-021-01605-0","title":"Model complexity of deep learning: a survey","year":2021,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":388,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Deep learning; Artificial intelligence; Generalization; Machine learning; Model selection; Game complexity; Process (computing); Computational complexity theory; Worst-case complexity; Algorithm; Mathematics","score_opus":0.041583257627835754,"score_gpt":0.2735118115492377,"score_spread":0.23192855392140194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195438473","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01982539,0.13453028,0.8135599,0.015967656,0.0006585559,0.000075305,0.0013265049,0.0005445912,0.013511794],"genre_scores_gemma":[0.50748163,0.23614195,0.23323867,0.0036862122,0.005305241,0.0005302477,0.0035370141,0.00068433414,0.009394791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976375,0.0007653854,0.00019879668,0.00043657742,0.0008244429,0.00013728467],"domain_scores_gemma":[0.97972816,0.016834885,0.000619177,0.0012761129,0.0012781748,0.000263439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043166056,0.0016242153,0.0028340763,0.0018991911,0.0006552453,0.004785905,0.0033019579,0.0023068497,0.004022646],"category_scores_gemma":[0.023436924,0.0012096686,0.0014000755,0.0028214925,0.0019071539,0.010755478,0.0031462377,0.004528206,0.0008751925],"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.00018701277,0.00021146123,0.003924327,0.002181076,0.00026915665,0.000110381436,0.00012613856,0.23288883,0.0005905586,0.4925283,0.01610288,0.2508798],"study_design_scores_gemma":[0.000013899932,0.000045292574,0.00043919106,0.00020218486,0.000040012892,0.00008750469,0.000039617687,0.38046268,0.00044726304,0.6098202,0.008378144,0.000024026298],"about_ca_topic_score_codex":0.0039192326,"about_ca_topic_score_gemma":0.0031941875,"teacher_disagreement_score":0.004785905,"about_ca_system_score_codex":0.0036357706,"about_ca_system_score_gemma":0.0025868472,"threshold_uncertainty_score":0.026379466},"labels":[],"label_agreement":null},{"id":"W3199768470","doi":"10.1007/978-3-030-86520-7_11","title":"Self-bounding Majority Vote Learning Algorithms by the Direct Minimization of a Tight PAC-Bayesian C-Bound","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche","keywords":"Bounding overwatch; Computer science; Upper and lower bounds; Algorithm; Margin (machine learning); Bayesian probability; Artificial intelligence; Machine learning; Classifier (UML); Mathematics","score_opus":0.008154924065312942,"score_gpt":0.23681703442254523,"score_spread":0.2286621103572323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199768470","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.0021061057,0.0004786047,0.9917276,0.0003538201,0.00013520771,0.00003829369,0.000049286587,0.00033794847,0.00477312],"genre_scores_gemma":[0.21481812,0.0009165675,0.7561233,0.0011903652,0.0007599619,0.00072466605,0.00060179,0.0013396629,0.023525594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930159,0.0030651074,0.00025416887,0.0010843279,0.0021279815,0.0004525565],"domain_scores_gemma":[0.9860261,0.010178319,0.00035746332,0.0018622278,0.0012643104,0.00031167417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063961735,0.001830967,0.0029592447,0.001286909,0.0011746573,0.0033144022,0.004424566,0.0038960364,0.008791034],"category_scores_gemma":[0.028049719,0.0014470615,0.0014936983,0.002213199,0.0027988115,0.0051597524,0.007027653,0.0060313293,0.0035147266],"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.00030382065,0.00017195653,0.0005847066,0.00036669162,0.0001578116,0.00007219381,0.00015019572,0.39317226,0.0028746964,0.343395,0.027724553,0.23102605],"study_design_scores_gemma":[0.000015989504,0.00003127544,0.00006344808,0.000027642569,0.000013480035,0.000032414267,0.0000097314605,0.8896164,0.0008361225,0.107424065,0.0019175994,0.000011902739],"about_ca_topic_score_codex":0.0018656896,"about_ca_topic_score_gemma":0.0028480429,"teacher_disagreement_score":0.008791034,"about_ca_system_score_codex":0.0021681075,"about_ca_system_score_gemma":0.0027001104,"threshold_uncertainty_score":0.03382659},"labels":[],"label_agreement":null},{"id":"W3199885714","doi":"10.1109/ijcnn52387.2021.9534284","title":"One Line To Rule Them All: Generating LO-Shot Soft-Label Prototypes","year":2021,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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 Waterloo","funders":"","keywords":"Shot (pellet); Computer science; Line (geometry); Artificial intelligence; Mathematics; Materials science","score_opus":0.058445713773741775,"score_gpt":0.2997609432157832,"score_spread":0.24131522944204145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199885714","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.036585584,0.0003710706,0.94919246,0.001307135,0.00041006377,0.00047455338,0.00049707043,0.0057881395,0.005373908],"genre_scores_gemma":[0.17456551,0.00021311772,0.8139655,0.001371473,0.00012010507,0.00043841742,0.0014250076,0.0009212535,0.006979613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650663,0.00087510864,0.00021348419,0.0012961254,0.00093441556,0.00017420317],"domain_scores_gemma":[0.98746026,0.0036430585,0.0009706307,0.0051237843,0.002239718,0.0005625259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028709138,0.0011743814,0.0014978589,0.0011100459,0.0018310988,0.0030689077,0.00478882,0.0031233977,0.005748712],"category_scores_gemma":[0.024320532,0.0007946073,0.000923734,0.0011983847,0.0026413652,0.0062415637,0.0035382628,0.003801073,0.0058303676],"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.0008774961,0.00046421794,0.009360421,0.0006502913,0.00018477865,0.0005529814,0.0012494817,0.035318352,0.028390855,0.049874067,0.037913993,0.83516306],"study_design_scores_gemma":[0.00018994202,0.00061841967,0.0021514723,0.00034629015,0.000091551294,0.0014422608,0.0009262469,0.74061793,0.055821847,0.14773804,0.049805094,0.00025093876],"about_ca_topic_score_codex":0.0023152782,"about_ca_topic_score_gemma":0.005347008,"teacher_disagreement_score":0.005748712,"about_ca_system_score_codex":0.0007420665,"about_ca_system_score_gemma":0.0013151799,"threshold_uncertainty_score":0.019231379},"labels":[],"label_agreement":null},{"id":"W3205586065","doi":"10.1088/1402-4896/acc0a6","title":"A-optimal active learning","year":2023,"lang":"en","type":"article","venue":"Physica Scripta","topic":"Machine Learning and Algorithms","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 British Columbia","funders":"","keywords":"Frequentist inference; Computer science; Artificial intelligence; Machine learning; Laplacian matrix; Set (abstract data type); Graph; Bayesian probability; Semi-supervised learning; Bayesian network; Deep learning; Interpretation (philosophy); Term (time); Bayesian inference; Theoretical computer science","score_opus":0.014667410864226692,"score_gpt":0.26017346577961514,"score_spread":0.24550605491538846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205586065","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.010323867,0.00017977417,0.985165,0.00059507624,0.000080420614,0.000089189496,0.00007779853,0.00024386343,0.0032450487],"genre_scores_gemma":[0.613444,0.0002519025,0.37860712,0.0008112512,0.0002648679,0.00082173035,0.00030003407,0.00020370759,0.005295365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99444795,0.0031624106,0.0001769518,0.0011644064,0.0007775517,0.00027066792],"domain_scores_gemma":[0.9795888,0.013909723,0.0013189055,0.0029917508,0.001536455,0.0006544597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009890875,0.0011640876,0.001954183,0.0009570121,0.00079871016,0.0028839456,0.0029670268,0.0032822795,0.004932087],"category_scores_gemma":[0.025681468,0.0009701244,0.0010569834,0.0006369465,0.005106231,0.004608255,0.0039983103,0.0037552996,0.00078897685],"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.0007465081,0.0004478265,0.0015764982,0.00036528546,0.00015983287,0.000082994244,0.00021595902,0.40792537,0.008214832,0.47840473,0.0047290185,0.09713115],"study_design_scores_gemma":[0.000055114968,0.000102414706,0.00011238244,0.000025518064,0.000010388895,0.000018581082,0.000016177028,0.8412451,0.0023789152,0.1547493,0.001274435,0.000011663362],"about_ca_topic_score_codex":0.0008726419,"about_ca_topic_score_gemma":0.00068527093,"teacher_disagreement_score":0.009890875,"about_ca_system_score_codex":0.0018709976,"about_ca_system_score_gemma":0.0018999693,"threshold_uncertainty_score":0.05230856},"labels":[],"label_agreement":null},{"id":"W3205746337","doi":"10.1017/9781108571401.013","title":"The Upper Confidence Bound Algorithm: Bernoulli Noise","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Machine Learning and Algorithms","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 Alberta","funders":"","keywords":"Bernoulli's principle; Computer science; Content (measure theory); Upper and lower bounds; Algorithm; Noise (video); Mathematics; Artificial intelligence; Engineering; Mathematical analysis","score_opus":0.014335034211056832,"score_gpt":0.20146653798445274,"score_spread":0.1871315037733959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205746337","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.0005325817,0.0016759594,0.9913709,0.00034009153,0.00023709665,0.000027712362,0.00012180539,0.0010330112,0.004660667],"genre_scores_gemma":[0.044069793,0.0038273307,0.92044044,0.0009970339,0.0010209047,0.00040066705,0.0014023912,0.0017823947,0.026058964],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543494,0.0015470057,0.00022016256,0.00073554076,0.0018111272,0.00025124874],"domain_scores_gemma":[0.9887445,0.00818514,0.00031021278,0.0013103801,0.0012352689,0.00021453985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049536987,0.0017099556,0.002827431,0.002478895,0.0008057887,0.004014308,0.004939014,0.0032431523,0.019754877],"category_scores_gemma":[0.03314962,0.0011035553,0.0012138792,0.0041107703,0.0017656864,0.0041665547,0.0042956257,0.0059852134,0.013722274],"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.00033178393,0.00009367289,0.0005116915,0.0003943838,0.0001575833,0.00011569453,0.000099007666,0.11611041,0.0013210342,0.11389465,0.05672967,0.7102404],"study_design_scores_gemma":[0.0000662641,0.000038806782,0.00024612143,0.00016794032,0.00005288963,0.00025038788,0.000019988656,0.82650715,0.0025856886,0.14532267,0.02468315,0.000059009177],"about_ca_topic_score_codex":0.0037197839,"about_ca_topic_score_gemma":0.002759754,"teacher_disagreement_score":0.019754877,"about_ca_system_score_codex":0.0011817332,"about_ca_system_score_gemma":0.0025900023,"threshold_uncertainty_score":0.06608665},"labels":[],"label_agreement":null},{"id":"W3206213316","doi":"","title":"Fast Projection onto the Capped Simplex withApplications to Sparse Regression in Bioinformatics","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Machine Learning and Algorithms","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":"Simplex; Algorithm; Computer science; Projection (relational algebra); Sorting; Hyperplane; Simplex algorithm; Bounded function; Mathematics; Linear programming; Combinatorics","score_opus":0.024011197622214143,"score_gpt":0.299290367091799,"score_spread":0.27527916946958486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206213316","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.0026244926,0.000263816,0.99587977,0.00014471196,0.00006871343,0.0000397281,0.00005505694,0.00038195192,0.0005417695],"genre_scores_gemma":[0.04779965,0.0005333649,0.94892126,0.0001276886,0.00009280662,0.00027319873,0.00029315506,0.00022783544,0.0017309771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891114,0.0004702284,0.00005046891,0.00015269664,0.00033882304,0.00007665419],"domain_scores_gemma":[0.99852836,0.00074725744,0.000086559914,0.00017285396,0.0003790627,0.000085938904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017481185,0.0012513001,0.0015314748,0.0008854028,0.00073528726,0.0011044366,0.0013678832,0.0015785821,0.0055345744],"category_scores_gemma":[0.0050919373,0.00079633977,0.0014374597,0.001736578,0.0011021575,0.0012658958,0.0020505358,0.0023450593,0.0017403566],"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.00017734332,0.00011223369,0.0011186914,0.0005673119,0.00012822232,0.00021155013,0.000199676,0.70630497,0.006882826,0.046260606,0.009064141,0.22897252],"study_design_scores_gemma":[0.00001762578,0.000023228451,0.00009207248,0.000012853551,0.000004087233,0.00004243924,0.000013973609,0.982153,0.0011707562,0.014295733,0.002163619,0.000010631049],"about_ca_topic_score_codex":0.006268782,"about_ca_topic_score_gemma":0.0055840835,"teacher_disagreement_score":0.006268782,"about_ca_system_score_codex":0.00062969077,"about_ca_system_score_gemma":0.0018937737,"threshold_uncertainty_score":0.018514931},"labels":[],"label_agreement":null},{"id":"W3209416948","doi":"10.48550/arxiv.2111.00062","title":"Improving Generalization Bounds for VC Classes Using the Hypergeometric Tail Inversion","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","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 Ottawa; Université Laval","funders":"","keywords":"Hypergeometric distribution; Upper and lower bounds; Inversion (geology); Generalization; Mathematics; Margin (machine learning); Hypergeometric function; Combinatorics; Set (abstract data type); Algorithm; Discrete mathematics; Computer science; Statistics; Pure mathematics; Mathematical analysis; Machine learning","score_opus":0.07267578090149533,"score_gpt":0.20813836498355986,"score_spread":0.13546258408206452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209416948","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.033097837,0.0032608896,0.9503787,0.001660981,0.00022436935,0.0001425103,0.00032776818,0.0009876057,0.009919372],"genre_scores_gemma":[0.7918434,0.003520814,0.18957357,0.00273317,0.001251084,0.00059564307,0.0013269867,0.0011244122,0.008030836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99104685,0.0028047457,0.0004281846,0.0016333528,0.0031523162,0.0009346117],"domain_scores_gemma":[0.9456099,0.03851089,0.0027004085,0.008204779,0.003590686,0.0013832619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015482526,0.002781556,0.0027937803,0.0042875176,0.0015609642,0.005292586,0.0048446576,0.0029397837,0.0063298787],"category_scores_gemma":[0.07879414,0.0009249591,0.0023467063,0.0036696852,0.0050211237,0.011775678,0.009271635,0.010408344,0.0016908346],"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.0005057506,0.0002982382,0.0064768367,0.0004801776,0.00026554163,0.00024636058,0.0003960725,0.3760454,0.0065690987,0.4068957,0.013183601,0.18863721],"study_design_scores_gemma":[0.000033833836,0.000093458664,0.0007701382,0.000084495376,0.000036922906,0.00014024202,0.000036629423,0.77297825,0.0024781863,0.22098126,0.002320517,0.000046117686],"about_ca_topic_score_codex":0.0024984826,"about_ca_topic_score_gemma":0.0023553327,"teacher_disagreement_score":0.015482526,"about_ca_system_score_codex":0.0037549553,"about_ca_system_score_gemma":0.0024729008,"threshold_uncertainty_score":0.08188045},"labels":[],"label_agreement":null},{"id":"W3213357492","doi":"","title":"Towards a Unified Information-Theoretic Framework for Generalization","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"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":"Bounded function; Corollary; Generalization; Mathematics; Upper and lower bounds; Class (philosophy); Discrete mathematics; Constant (computer programming); Computer science; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.029419538538649648,"score_gpt":0.19298475504711624,"score_spread":0.1635652165084666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213357492","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.0065560816,0.0007175806,0.985374,0.0017975298,0.000036737772,0.000035377674,0.000092044225,0.00017629069,0.00521438],"genre_scores_gemma":[0.6177123,0.0019225336,0.37154573,0.0018696518,0.0008455134,0.0004831541,0.0005814142,0.00044031974,0.0045994595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9871367,0.0049597756,0.0006677726,0.002153553,0.004330763,0.0007514417],"domain_scores_gemma":[0.96077377,0.026589464,0.0020916702,0.007719739,0.0021198548,0.0007053791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019896297,0.0017928205,0.002149294,0.0025860735,0.0012992121,0.0058065495,0.0058374503,0.0032448776,0.0032594134],"category_scores_gemma":[0.045946807,0.0014016691,0.0027774083,0.0022663237,0.010601759,0.019571172,0.010839866,0.011573932,0.00068084104],"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.000031236603,0.000020995136,0.0002983995,0.00007103559,0.000030363079,0.000045218167,0.00015356671,0.03465851,0.00050158694,0.9544966,0.00044010466,0.009252294],"study_design_scores_gemma":[0.000011515269,0.000035424764,0.00011765014,0.000032405635,0.00001263233,0.000034769153,0.000028808208,0.16138458,0.00067442405,0.8361236,0.0015279008,0.000016306329],"about_ca_topic_score_codex":0.0012894468,"about_ca_topic_score_gemma":0.0007139049,"teacher_disagreement_score":0.019896297,"about_ca_system_score_codex":0.00563344,"about_ca_system_score_gemma":0.0019249264,"threshold_uncertainty_score":0.10522294},"labels":[],"label_agreement":null},{"id":"W41314287","doi":"10.1609/aaai.v28i1.9100","title":"A Novel Single-DBN Generative Model for Optimizing POMDP Controllers by Probabilistic Inference","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","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 Waterloo","funders":"","keywords":"Partially observable Markov decision process; Inference; Computer science; Probabilistic logic; Generative model; Benchmark (surveying); Graphical model; Artificial intelligence; Machine learning; Generative grammar; Markov model; Markov chain","score_opus":0.07558307285019203,"score_gpt":0.2955255551993101,"score_spread":0.2199424823491181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41314287","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.0020378344,0.0000482616,0.99634176,0.00010320434,0.000015749023,0.000022534687,0.000067998786,0.00018617607,0.0011764739],"genre_scores_gemma":[0.38286212,0.00028663076,0.61212873,0.00026945042,0.000056735873,0.00040350432,0.00039692593,0.00024017374,0.0033558314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905306,0.0002508698,0.000047598347,0.00024507617,0.00030957672,0.0000937727],"domain_scores_gemma":[0.99864644,0.00085190707,0.00011662092,0.0001764923,0.00013522962,0.00007324097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016831984,0.0007774408,0.0012834381,0.000595604,0.0004993244,0.0013604707,0.0028331373,0.001289337,0.004168785],"category_scores_gemma":[0.0041963197,0.00078318716,0.0014152965,0.00094872835,0.0014673274,0.001855534,0.0018155962,0.0025837289,0.0005939909],"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.000019482715,0.000019507683,0.00016614454,0.00003893042,0.000018122879,0.000028725099,0.000034335048,0.95282054,0.0005126283,0.034126237,0.00046651613,0.011748964],"study_design_scores_gemma":[0.000004416294,0.000003885327,0.0000134616985,0.000002665598,0.0000030682922,0.000005874629,0.0000025336226,0.9915208,0.00013396287,0.008083026,0.00022347737,0.0000027426672],"about_ca_topic_score_codex":0.008939974,"about_ca_topic_score_gemma":0.011557507,"teacher_disagreement_score":0.008939974,"about_ca_system_score_codex":0.0018428303,"about_ca_system_score_gemma":0.0026208262,"threshold_uncertainty_score":0.017775893},"labels":[],"label_agreement":null},{"id":"W41530335","doi":"10.1007/978-3-319-11662-4_20","title":"Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Dimension (graph theory); Compression (physics); Computer science; Sample (material); Graph; VC dimension; Binary number; Data compression; Algorithm; Discrete mathematics; Mathematics; Theoretical computer science; Artificial intelligence; Combinatorics; Arithmetic","score_opus":0.024913944128829878,"score_gpt":0.2833774274205435,"score_spread":0.25846348329171365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41530335","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.0097688725,0.0007224294,0.9856128,0.00030618775,0.00017407362,0.00010867422,0.00024463364,0.001092284,0.001970072],"genre_scores_gemma":[0.22016747,0.0015143486,0.7606151,0.00062589964,0.0010394674,0.00033047766,0.002628713,0.000660371,0.012418232],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982186,0.00035932247,0.00009299176,0.00041567473,0.0007825514,0.00013086716],"domain_scores_gemma":[0.9963568,0.0015561295,0.00013410948,0.0011775894,0.0006965066,0.00007890854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020070309,0.0014736862,0.0014948494,0.0021893515,0.0006890591,0.0018143472,0.0023565958,0.0017744926,0.0043506157],"category_scores_gemma":[0.008810626,0.0005653438,0.0012111241,0.002791362,0.001430816,0.0034990383,0.0027563048,0.0028351278,0.0016638997],"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.0003057123,0.00018734668,0.00069957995,0.00019772306,0.000091354,0.00010603689,0.00015149215,0.093293056,0.009746802,0.025793262,0.010565594,0.85886216],"study_design_scores_gemma":[0.000022667964,0.000051033865,0.0004195692,0.000035544097,0.000034290366,0.0001303311,0.00004250665,0.93491334,0.008477087,0.05162788,0.0042295386,0.00001620201],"about_ca_topic_score_codex":0.004339612,"about_ca_topic_score_gemma":0.005671556,"teacher_disagreement_score":0.0043506157,"about_ca_system_score_codex":0.0010752277,"about_ca_system_score_gemma":0.0012934752,"threshold_uncertainty_score":0.014554203},"labels":[],"label_agreement":null},{"id":"W4200150901","doi":"10.1016/j.eswa.2021.116276","title":"Multi granularity based label propagation with active learning for semi-supervised classification","year":2021,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Granularity; Leverage (statistics); Graph; Semi-supervised learning; Affinity propagation; Belief propagation; Artificial intelligence; Adjacency list; Machine learning; Supervised learning; Benchmark (surveying); Data mining; Pattern recognition (psychology); Algorithm; Artificial neural network; Theoretical computer science; Cluster analysis","score_opus":0.029226167248766623,"score_gpt":0.28409829131691927,"score_spread":0.25487212406815263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200150901","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.0034451277,0.00014209506,0.9951237,0.00009238431,0.000053174677,0.00004720824,0.0000546954,0.0007678715,0.00027388547],"genre_scores_gemma":[0.24399884,0.00021352564,0.75054854,0.00029311364,0.00024542946,0.0003683665,0.00066111557,0.00043644893,0.0032346095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99423283,0.002151659,0.00041712367,0.0012686589,0.0015609072,0.0003687792],"domain_scores_gemma":[0.9786618,0.0145102125,0.0010656335,0.0027885097,0.0025589075,0.00041497924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077530346,0.0014475997,0.002769589,0.0030906834,0.0017000838,0.003081368,0.006107922,0.0045099873,0.0029949227],"category_scores_gemma":[0.01426844,0.0013141343,0.0020421029,0.003227009,0.0020932874,0.005499465,0.004586415,0.0049049566,0.0014191787],"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.00084025314,0.00074480684,0.0015903674,0.00040569436,0.00029149675,0.0001803545,0.00055410556,0.23145404,0.016042404,0.029323312,0.006745761,0.71182746],"study_design_scores_gemma":[0.000012914011,0.000027587748,0.00007394723,0.000010918405,0.000017542314,0.000018705885,0.000013899508,0.9858942,0.0022843296,0.011227235,0.00040959546,0.000009209049],"about_ca_topic_score_codex":0.003218913,"about_ca_topic_score_gemma":0.0058306996,"teacher_disagreement_score":0.0077530346,"about_ca_system_score_codex":0.001384136,"about_ca_system_score_gemma":0.0016528182,"threshold_uncertainty_score":0.041002452},"labels":[],"label_agreement":null},{"id":"W4205991048","doi":"10.1109/lra.2021.3135940","title":"Learning an Explainable Trajectory Generator Using the Automaton Generative Network (AGN)","year":2021,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"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":"Toyota Research Institute","keywords":"Computer science; Artificial intelligence; Component (thermodynamics); Leverage (statistics); Automaton; Theoretical computer science; Generator (circuit theory); Pipeline (software); Machine learning; Key (lock); Representation (politics); Finite-state machine; Generative model; Artificial neural network; Generative grammar; Programming language","score_opus":0.01624430306944624,"score_gpt":0.2481310575836374,"score_spread":0.23188675451419116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205991048","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.027866647,0.00007450943,0.96880305,0.00030248897,0.000025304857,0.00003466805,0.0001759892,0.0011240297,0.00159328],"genre_scores_gemma":[0.7640328,0.00017259827,0.23053598,0.00020254382,0.00003891493,0.00018830482,0.00065129215,0.00020475413,0.003972857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982446,0.00004567434,0.000007420733,0.000067979134,0.000034301902,0.000020159354],"domain_scores_gemma":[0.9992762,0.0004646735,0.00006576426,0.00009496979,0.00006521093,0.000033176348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047566337,0.00051170524,0.00032975763,0.00039092384,0.00024999553,0.0004651213,0.0011117762,0.0008216505,0.0024455553],"category_scores_gemma":[0.0022681712,0.0003924716,0.00067108206,0.00032967277,0.00066971447,0.00095294777,0.0008041974,0.0012090529,0.0003984565],"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.000040057268,0.000024985833,0.0010636479,0.000037312486,0.000027276072,0.00009822997,0.00005004132,0.93671125,0.002132705,0.019390738,0.0009059524,0.039517738],"study_design_scores_gemma":[0.0000022411177,0.000006673198,0.000043016826,0.0000021018586,0.0000024997325,0.000010792148,0.0000018594708,0.99309605,0.0003104856,0.0062983283,0.0002242884,0.0000017347736],"about_ca_topic_score_codex":0.0039541074,"about_ca_topic_score_gemma":0.0072281663,"teacher_disagreement_score":0.0039541074,"about_ca_system_score_codex":0.00069650373,"about_ca_system_score_gemma":0.0006563919,"threshold_uncertainty_score":0.008181155},"labels":[],"label_agreement":null},{"id":"W4206159874","doi":"10.1016/s0890-5401(04)00057-4","title":"The query complexity of order-finding","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bounded function; Permutation (music); Constant (computer programming); Order (exchange); Mathematics; Exponential function; Probabilistic logic; Polynomial; Combinatorics; Discrete mathematics; Time complexity; Computer science; Statistics","score_opus":0.020841465448893905,"score_gpt":0.27322877145194907,"score_spread":0.25238730600305515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206159874","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.33911428,0.008020194,0.55912083,0.037111014,0.0008366237,0.0005540997,0.0061464435,0.0030843192,0.046012253],"genre_scores_gemma":[0.87970185,0.0030101666,0.09934044,0.0014233611,0.0013095165,0.00029651562,0.0032624546,0.0012298967,0.010425955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98277986,0.00509733,0.0010570302,0.002550109,0.006142001,0.0023736353],"domain_scores_gemma":[0.8132134,0.15983947,0.004352678,0.014320602,0.0051411246,0.0031326371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009242981,0.0014386881,0.005155914,0.002954718,0.0034219578,0.010799346,0.0067441785,0.0048096203,0.021704355],"category_scores_gemma":[0.1010285,0.0016878761,0.0026766122,0.007647126,0.005764675,0.031961836,0.0052658753,0.0065641813,0.0021984035],"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.00517512,0.00080389774,0.010109422,0.001482017,0.00047467384,0.00059226004,0.0017396612,0.22397687,0.005790438,0.500606,0.06221617,0.18703347],"study_design_scores_gemma":[0.0003122988,0.0001129643,0.0011081673,0.000053529828,0.0001857886,0.000371243,0.00034185586,0.47540528,0.0018533946,0.51751053,0.0026852314,0.00005978544],"about_ca_topic_score_codex":0.0102596795,"about_ca_topic_score_gemma":0.0072457865,"teacher_disagreement_score":0.021704355,"about_ca_system_score_codex":0.0077568833,"about_ca_system_score_gemma":0.0074743913,"threshold_uncertainty_score":0.07260829},"labels":[],"label_agreement":null},{"id":"W4210540074","doi":"10.1007/978-3-030-95470-3_30","title":"Active Learning for Capturing Human Decision Policies in a Data Frugal Context","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Thales (Canada)","funders":"","keywords":"Computer science; Machine learning; Oracle; Artificial intelligence; Domain (mathematical analysis); Context (archaeology); Software engineering","score_opus":0.034503564701649135,"score_gpt":0.307258719742429,"score_spread":0.2727551550407799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210540074","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.026613401,0.0005747083,0.9708865,0.00020152621,0.00004442219,0.00002737273,0.00012945835,0.00033128826,0.0011911873],"genre_scores_gemma":[0.75762606,0.00066033367,0.23640227,0.00010486464,0.00012738684,0.00012387657,0.0003300318,0.00012997106,0.004495252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995161,0.00020307957,0.000020803696,0.00013270359,0.000078665675,0.000048615708],"domain_scores_gemma":[0.99737096,0.0020900415,0.0001415283,0.0001880043,0.00012998866,0.00007950012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011058447,0.0005771905,0.0005471037,0.0005997344,0.00039648352,0.00136537,0.0011312265,0.0009379788,0.0015983293],"category_scores_gemma":[0.0057429965,0.000431455,0.00045167303,0.000738233,0.00093640236,0.0025884372,0.0010924902,0.002016933,0.0003480316],"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.0004881131,0.00024788702,0.0034225457,0.00021504267,0.000096037205,0.00021469717,0.0006989132,0.5226146,0.0109436205,0.14358583,0.0035471148,0.31392562],"study_design_scores_gemma":[0.0000039872766,0.000023209885,0.00031192115,0.00000875165,0.0000068842273,0.000016872753,0.000023455588,0.95262694,0.0011499566,0.044937592,0.00088276196,0.0000075496046],"about_ca_topic_score_codex":0.003825972,"about_ca_topic_score_gemma":0.005428048,"teacher_disagreement_score":0.003825972,"about_ca_system_score_codex":0.00081846566,"about_ca_system_score_gemma":0.0005885075,"threshold_uncertainty_score":0.0076074004},"labels":[],"label_agreement":null},{"id":"W4210950892","doi":"10.1017/9781108571401.042","title":"Foundations of Bayesian Learning","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Machine Learning and Algorithms","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 Alberta","funders":"","keywords":"Bayesian probability; Artificial intelligence; Computer science; Machine learning; Psychology","score_opus":0.017697375751174093,"score_gpt":0.20681659585375978,"score_spread":0.1891192201025857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210950892","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.002322098,0.06603405,0.625337,0.014431449,0.0010478057,0.000053053638,0.0011198432,0.0005109047,0.28914383],"genre_scores_gemma":[0.28342187,0.17929953,0.37448695,0.006016251,0.0076778224,0.0006083501,0.0027148123,0.0008059352,0.1449685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998566,0.00064359984,0.00006951329,0.00019283392,0.00044824116,0.000079782476],"domain_scores_gemma":[0.99573475,0.0033066687,0.00013939769,0.0003445552,0.00034291696,0.00013176014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002879654,0.00082441536,0.00095949403,0.0016234848,0.0008053558,0.0033067742,0.0010657305,0.0017800125,0.01923237],"category_scores_gemma":[0.0088777635,0.0006811835,0.00081228645,0.0024479611,0.002866473,0.0035039296,0.0013475715,0.0035341394,0.0069128447],"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.0000053813283,0.000008413106,0.000115941024,0.00013281389,0.000016897684,0.000029134608,0.000067575194,0.0027593,0.000069357644,0.9339896,0.018288374,0.044517145],"study_design_scores_gemma":[0.0000022236009,0.0000025094564,0.00008045457,0.000087849345,0.0000035727164,0.00003197226,0.000009152427,0.0025882032,0.000029970355,0.96778363,0.029374938,0.0000055888363],"about_ca_topic_score_codex":0.0028015424,"about_ca_topic_score_gemma":0.0027972641,"teacher_disagreement_score":0.01923237,"about_ca_system_score_codex":0.002371526,"about_ca_system_score_gemma":0.0018629292,"threshold_uncertainty_score":0.064338684},"labels":[],"label_agreement":null},{"id":"W4210999043","doi":"10.1017/9781108571401.020","title":"Minimax Lower Bounds","year":2020,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Machine Learning and Algorithms","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 Alberta","funders":"","keywords":"Minimax; Computer science; Mathematics; Mathematical optimization","score_opus":0.015866484835127894,"score_gpt":0.1927824651860851,"score_spread":0.1769159803509572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210999043","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037928317,0.046522997,0.56038314,0.008166899,0.0038679875,0.00015404736,0.0025419807,0.0011055854,0.37346452],"genre_scores_gemma":[0.21207121,0.072876245,0.30309308,0.009286265,0.008720364,0.002200888,0.00792612,0.0048135673,0.37901223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776256,0.00077817834,0.00010121738,0.00037282342,0.0007277192,0.0002575066],"domain_scores_gemma":[0.99452657,0.0040329765,0.00014400393,0.00058365753,0.00051981345,0.00019281915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034495988,0.002761911,0.0030585858,0.001968344,0.0011259076,0.004640993,0.0028642823,0.0025247184,0.06169489],"category_scores_gemma":[0.016203608,0.00064046594,0.0014658322,0.003086179,0.0019139661,0.003997293,0.0030617819,0.0073976624,0.018847596],"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.00017510212,0.00010425894,0.0002969142,0.001232903,0.00013450228,0.000103282866,0.00007522866,0.051843982,0.0007854264,0.49651894,0.246339,0.20239055],"study_design_scores_gemma":[0.00006229331,0.00011781981,0.00046089644,0.0006019028,0.00007273726,0.00024513455,0.00004954766,0.12054343,0.0010431804,0.7631471,0.11360387,0.000052019623],"about_ca_topic_score_codex":0.0013434119,"about_ca_topic_score_gemma":0.0016875128,"teacher_disagreement_score":0.06169489,"about_ca_system_score_codex":0.0023557218,"about_ca_system_score_gemma":0.0017081667,"threshold_uncertainty_score":0.20638996},"labels":[],"label_agreement":null},{"id":"W4211067137","doi":"10.1007/978-1-4471-7452-3_2","title":"Fundamentals of Machine Learning","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.01319073599633082,"score_gpt":0.23132458197931846,"score_spread":0.21813384598298763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211067137","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057709,0.06138032,0.07636781,0.003819485,0.0041028177,0.000102750244,0.0005970148,0.0011069825,0.8519458],"genre_scores_gemma":[0.009467439,0.054004997,0.03937871,0.0018558633,0.003520087,0.00021450031,0.0008623062,0.0005159433,0.8901801],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995474,0.00005482298,0.000018144216,0.00007457532,0.00027460864,0.00003037958],"domain_scores_gemma":[0.9995407,0.00022943993,0.00001890664,0.00006951548,0.00010534803,0.00003607145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046198617,0.0013751861,0.0009694157,0.001786096,0.0007686543,0.0026212628,0.0012689208,0.0011176458,0.08329165],"category_scores_gemma":[0.0013650546,0.00043723627,0.0004237522,0.0022877054,0.001370602,0.0028396444,0.0013993231,0.0024911785,0.06774379],"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.000013613764,0.000038763814,0.00009674069,0.00054810446,0.00001036811,0.000036928202,0.00017451894,0.0012277554,0.0006308471,0.22858877,0.3400439,0.4285897],"study_design_scores_gemma":[0.0000026601454,0.000011082334,0.00014279516,0.0002258362,0.0000033676654,0.00006777103,0.000028147922,0.0007942118,0.00019307088,0.09011387,0.90840966,0.0000074101395],"about_ca_topic_score_codex":0.0010089461,"about_ca_topic_score_gemma":0.0018847515,"teacher_disagreement_score":0.08329165,"about_ca_system_score_codex":0.0010629112,"about_ca_system_score_gemma":0.0014450592,"threshold_uncertainty_score":0.2786383},"labels":[],"label_agreement":null},{"id":"W4211108110","doi":"10.1017/9781108164085","title":"Artificial Intelligence","year":2017,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":152,"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 British Columbia","funders":"","keywords":"Computer science; Transformational leadership; Artificial intelligence; Appeal; Space (punctuation); Comprehension; Psychology","score_opus":0.03170559268435974,"score_gpt":0.23573749968269264,"score_spread":0.2040319069983329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211108110","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050487753,0.04344187,0.008863442,0.005882986,0.0037705572,0.00006903846,0.0004291553,0.00044276356,0.93659526],"genre_scores_gemma":[0.013226588,0.042627335,0.011079044,0.0048790304,0.0025367127,0.00016410409,0.0012773025,0.00037990752,0.92382985],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990068,0.00015085543,0.000053675398,0.0001821815,0.00055220653,0.0000541918],"domain_scores_gemma":[0.9993845,0.00020296939,0.000030306228,0.0001576333,0.0001550372,0.0000696413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005409719,0.0010385257,0.00069913425,0.0015889503,0.0010942844,0.0070864432,0.0010906273,0.0016631024,0.07903514],"category_scores_gemma":[0.0020739164,0.00039954451,0.0005162359,0.0020281186,0.0020569095,0.0045818277,0.00253944,0.0032138512,0.052457422],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000015541265,0.000029093222,0.00019582616,0.00053126545,0.000023625209,0.00008791587,0.00033252494,0.00043680955,0.00043812202,0.286483,0.48696348,0.2244629],"study_design_scores_gemma":[0.0000016477924,0.0000044050894,0.00011387526,0.00018223698,0.0000022103081,0.00008809498,0.000037480982,0.000117320305,0.00007188663,0.04096409,0.9584132,0.0000035669555],"about_ca_topic_score_codex":0.0009506064,"about_ca_topic_score_gemma":0.0016625102,"teacher_disagreement_score":0.07903514,"about_ca_system_score_codex":0.0018529447,"about_ca_system_score_gemma":0.0018603171,"threshold_uncertainty_score":0.26439887},"labels":[],"label_agreement":null},{"id":"W4224214014","doi":"10.48550/arxiv.2204.08404","title":"Low Degree Testing over the Reals","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; Ministry of Education, India","keywords":"Degree (music); Polynomial; Combinatorics; Mathematics; Logarithm; Discrete mathematics; Function (biology); Rational function; Distribution (mathematics); Set (abstract data type); Physics; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.10822899080682184,"score_gpt":0.20669548990623962,"score_spread":0.09846649909941778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224214014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57297,0.0017860099,0.3999005,0.011178219,0.0001537419,0.00011277448,0.0017404915,0.0020367755,0.010121514],"genre_scores_gemma":[0.9788976,0.00036093814,0.016540863,0.00056523044,0.00029824107,0.00007334357,0.0006021289,0.0001375743,0.0025240968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99285936,0.0027813641,0.00026567196,0.0018181166,0.0014209774,0.00085447944],"domain_scores_gemma":[0.8936314,0.08982811,0.0050270744,0.0074260766,0.0020806957,0.0020065987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006915742,0.0012299728,0.0020557363,0.0015706522,0.0014089422,0.0033731721,0.003139496,0.0016590947,0.0046797013],"category_scores_gemma":[0.063372515,0.0005898932,0.0014585236,0.0018366991,0.004595207,0.008264502,0.0036492571,0.0042266496,0.001106711],"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.0047628125,0.00056509953,0.029822676,0.0011435159,0.0004358122,0.00077488954,0.0013370152,0.22658995,0.016188752,0.58164716,0.016054614,0.12067776],"study_design_scores_gemma":[0.00025255885,0.00026494736,0.0029842886,0.00005084564,0.000080293925,0.00032948932,0.00013401255,0.5084051,0.005282297,0.47971404,0.0024464387,0.000055711407],"about_ca_topic_score_codex":0.0026389821,"about_ca_topic_score_gemma":0.0016075011,"teacher_disagreement_score":0.006915742,"about_ca_system_score_codex":0.003417591,"about_ca_system_score_gemma":0.0015565531,"threshold_uncertainty_score":0.036574423},"labels":[],"label_agreement":null},{"id":"W4224557610","doi":"10.1007/s42979-022-01115-y","title":"Supervised and Unsupervised Machine Learning Methods Applied for Enrolling Women in the Canadian Armed Forces","year":2022,"lang":"en","type":"article","venue":"SN Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Department of National Defence","funders":"","keywords":"Cluster analysis; Machine learning; Logistic regression; Artificial intelligence; Vendor; Selection (genetic algorithm); Computer science; Unsupervised learning; Supervised learning; Population; Rank (graph theory); Marketing; Mathematics; Sociology; Business; Demography; Artificial neural network","score_opus":0.017320615701909722,"score_gpt":0.2779549218365267,"score_spread":0.26063430613461697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224557610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96022314,0.0008713542,0.027150033,0.0015228757,0.00018754356,0.00056856964,0.0045001227,0.00024915603,0.0047272802],"genre_scores_gemma":[0.9734291,0.00027265467,0.019266455,0.00018203311,0.000049500013,0.00021802743,0.0024139918,0.000031021933,0.004137163],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9976572,0.0008343638,0.00013114116,0.00037188813,0.0004614043,0.0005438782],"domain_scores_gemma":[0.9929756,0.0033877902,0.00048536272,0.0003013413,0.0024624823,0.0003875017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049882373,0.00060333835,0.0005347808,0.0017071596,0.0020007598,0.0011542487,0.0021311378,0.0009189905,0.0016626694],"category_scores_gemma":[0.024262292,0.00023381569,0.00076638954,0.0018074465,0.0006273387,0.00054311886,0.0007331864,0.0011208764,0.00024084028],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007269711,0.0006168114,0.7223058,0.00028721866,0.00029372692,0.00019141629,0.0026041595,0.04309951,0.0019515395,0.0037992585,0.016205303,0.20791823],"study_design_scores_gemma":[0.0001048021,0.00022887762,0.5461618,0.00019216862,0.00022760339,0.000090504414,0.0066367444,0.4286232,0.0030153773,0.0041398895,0.010467877,0.00011126003],"about_ca_topic_score_codex":0.90709525,"about_ca_topic_score_gemma":0.9584296,"teacher_disagreement_score":0.09290475,"about_ca_system_score_codex":0.010611752,"about_ca_system_score_gemma":0.03202408,"threshold_uncertainty_score":0.18690372},"labels":[],"label_agreement":null},{"id":"W4226427252","doi":"10.1145/3526074","title":"Private and Online Learnability Are Equivalent","year":2022,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Tel Aviv University; Azrieli Foundation; Israel Science Foundation; National Science Foundation","keywords":"Learnability; Equivalence (formal languages); Discrete mathematics; Binary number; Class (philosophy); Mathematics; VC dimension; Computer science; Theoretical computer science; Combinatorics; Artificial intelligence; Arithmetic","score_opus":0.019819827565847433,"score_gpt":0.27069484088327556,"score_spread":0.2508750133174281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226427252","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.17934711,0.00064825563,0.7746163,0.00901206,0.00011128175,0.00021160931,0.001280886,0.0006593936,0.034113057],"genre_scores_gemma":[0.951818,0.00048105518,0.040346712,0.0011146757,0.00024696093,0.00039493726,0.00075026875,0.00013217467,0.004715157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920677,0.002017798,0.000493898,0.0022384885,0.0020284348,0.0011536616],"domain_scores_gemma":[0.9427043,0.043689664,0.0026790346,0.0071859895,0.002282147,0.0014587978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005468748,0.0008720642,0.0014918908,0.0013452683,0.0015169638,0.0052538747,0.002495759,0.0029035334,0.007122457],"category_scores_gemma":[0.043744884,0.0007796019,0.0016236029,0.0012163422,0.008520776,0.016722256,0.006336492,0.0056582903,0.00064139586],"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.0002408215,0.00013839058,0.0017403759,0.0001823485,0.00007235629,0.0001158218,0.00040811286,0.022340853,0.0014097119,0.95117193,0.0014878482,0.020691516],"study_design_scores_gemma":[0.00004224156,0.00005437944,0.00042343908,0.000024085164,0.000017060673,0.00009347082,0.000081564416,0.05983963,0.0012460323,0.93736774,0.00079318776,0.000017256365],"about_ca_topic_score_codex":0.001334554,"about_ca_topic_score_gemma":0.0006775267,"teacher_disagreement_score":0.007122457,"about_ca_system_score_codex":0.0032441479,"about_ca_system_score_gemma":0.0017580765,"threshold_uncertainty_score":0.028921783},"labels":[],"label_agreement":null},{"id":"W4230976265","doi":"10.4018/978-1-60960-818-7.ch710","title":"Ethology-Based Approximate Adaptive Learning","year":2011,"lang":"en","type":"book-chapter","venue":"Machine Learning","topic":"Machine Learning and Algorithms","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 Manitoba","funders":"","keywords":"Ethology; Artificial intelligence; Computer science; Animal learning; Machine learning; Adaptive learning; Adaptive behavior; Psychology; Biology; Cognitive psychology; Ecology","score_opus":0.025530463959230084,"score_gpt":0.2349662953763786,"score_spread":0.2094358314171485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230976265","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.007876361,0.01160653,0.84423494,0.0033048196,0.00085492677,0.000047781265,0.00008991607,0.0002986091,0.13168615],"genre_scores_gemma":[0.36035296,0.023652865,0.37152615,0.0024113746,0.0012904464,0.00033334826,0.000373049,0.00025143736,0.23980844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997961,0.00005351736,0.0000079027595,0.000039896957,0.00009129118,0.00001135296],"domain_scores_gemma":[0.99975246,0.00013357025,0.000013484909,0.000033517153,0.000053760454,0.000013218753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005516247,0.00036827353,0.0003337048,0.00039747445,0.00027322705,0.0010242488,0.0008254384,0.00073054514,0.004735902],"category_scores_gemma":[0.0013469715,0.00019418389,0.00034061488,0.00039887417,0.0011629974,0.0014053201,0.0007268729,0.0016233365,0.0014933761],"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.000019055084,0.000025557729,0.0002783428,0.00014812523,0.000028334593,0.000050366027,0.00011863145,0.042940624,0.0017932549,0.81008804,0.010732464,0.13377708],"study_design_scores_gemma":[0.000009306053,0.000045798268,0.00041528806,0.00008001556,0.00001359501,0.00022532078,0.000040194387,0.1849788,0.0016926843,0.71331894,0.09915683,0.00002319246],"about_ca_topic_score_codex":0.0004204383,"about_ca_topic_score_gemma":0.0004365455,"teacher_disagreement_score":0.004735902,"about_ca_system_score_codex":0.00059376727,"about_ca_system_score_gemma":0.00037321114,"threshold_uncertainty_score":0.015843213},"labels":[],"label_agreement":null},{"id":"W4232763190","doi":"10.12927/hcq..17422","title":"Insight: If You Want To Learn - Take on the Most Difficult Problem","year":2004,"lang":"en","type":"article","venue":"Healthcare Quarterly","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Medical Association","funders":"","keywords":"Best practice; Business; Public relations; Process management; Medical education; Psychology; Medicine; Political science; Management; Economics","score_opus":0.015504797564395089,"score_gpt":0.2643403035692217,"score_spread":0.24883550600482662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232763190","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009673385,0.001995249,0.036403395,0.9277461,0.0028056158,0.000064070875,0.0004615677,0.000358682,0.020492002],"genre_scores_gemma":[0.5947495,0.0057159876,0.097760044,0.24248897,0.010096518,0.00036604688,0.00082156353,0.0004919385,0.047509447],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983845,0.0006220894,0.00008228752,0.00023695677,0.00044727285,0.00022697856],"domain_scores_gemma":[0.9900358,0.0055450387,0.00078876986,0.0005647477,0.0017769568,0.0012887998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038605311,0.0007306123,0.0008206481,0.0008002883,0.0016888542,0.0037299301,0.0012053594,0.004366974,0.027225662],"category_scores_gemma":[0.033916175,0.00027156572,0.00052779075,0.00060274836,0.004793424,0.009601256,0.0024123103,0.007739854,0.0056004496],"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.0004931774,0.00032237647,0.006902695,0.0005069044,0.000090648624,0.00067508436,0.0014353854,0.0023482225,0.0011398313,0.26262453,0.5638409,0.15962018],"study_design_scores_gemma":[0.00016547712,0.00017183987,0.0027077906,0.0003039839,0.000038398244,0.0011515288,0.0033127663,0.007840271,0.0005492351,0.8957437,0.08794463,0.00007028211],"about_ca_topic_score_codex":0.0019557916,"about_ca_topic_score_gemma":0.0021070002,"teacher_disagreement_score":0.027225662,"about_ca_system_score_codex":0.0014658915,"about_ca_system_score_gemma":0.0025872532,"threshold_uncertainty_score":0.09107894},"labels":[],"label_agreement":null},{"id":"W4236555516","doi":"10.1109/icse.2001.919189","title":"Model processing tools in UML","year":2005,"lang":"en","type":"article","venue":"Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Association of Canadian Universities for Research in Astronomy","keywords":"Class diagram; Sequence diagram; Communication diagram; Computer science; Unified Modeling Language; Merge (version control); Programming language; UML tool; Story-driven modeling; Applications of UML; Activity diagram; Interaction overview diagram; System context diagram; State diagram; Theoretical computer science; Diagram; Finite-state machine; Software; Information retrieval; Database","score_opus":0.03905878854159189,"score_gpt":0.27558280502886245,"score_spread":0.23652401648727056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236555516","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.00041676915,0.00031041025,0.9855919,0.00027540827,0.000057149155,0.00010712392,0.00048325327,0.00844613,0.0043118685],"genre_scores_gemma":[0.0122607,0.00089998695,0.9799683,0.00018591544,0.00007752259,0.0004656584,0.0017217717,0.0014368865,0.0029832637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99520916,0.0018518548,0.0007715617,0.0005416172,0.0014483333,0.00017749303],"domain_scores_gemma":[0.99303657,0.0041805343,0.0004284277,0.0015508287,0.0006863056,0.00011727438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061445357,0.0018913517,0.0012627702,0.004719621,0.0011369789,0.0067204484,0.0033341045,0.002001598,0.018580329],"category_scores_gemma":[0.017104218,0.001983251,0.0035187542,0.0036068335,0.0013583241,0.007057467,0.0034099969,0.0036327476,0.008331549],"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.00007501875,0.00012455026,0.00052341947,0.0011734951,0.00017779823,0.0005524045,0.001351189,0.04010973,0.004397987,0.6358556,0.02875825,0.28690055],"study_design_scores_gemma":[0.0000937642,0.000059472684,0.0001924423,0.0008531948,0.00009411925,0.00046385825,0.00025920366,0.15849325,0.0068667335,0.467903,0.36464018,0.00008080675],"about_ca_topic_score_codex":0.0025211724,"about_ca_topic_score_gemma":0.002492332,"teacher_disagreement_score":0.018580329,"about_ca_system_score_codex":0.0014061849,"about_ca_system_score_gemma":0.0020127716,"threshold_uncertainty_score":0.062157333},"labels":[],"label_agreement":null},{"id":"W4237170106","doi":"10.1017/9781108989817.012","title":"Theoretical Foundations for Native AI and Machine Learning","year":2021,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Machine Learning and Algorithms","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Content (measure theory); Artificial intelligence; World Wide Web; Mathematics","score_opus":0.018358243722651234,"score_gpt":0.2277507237517058,"score_spread":0.20939248002905456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237170106","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042107985,0.03189154,0.27404702,0.019033303,0.0012426358,0.000038056995,0.00036132717,0.0006595225,0.66851574],"genre_scores_gemma":[0.48145947,0.04647176,0.17485675,0.0066022174,0.005407178,0.00061775406,0.001284719,0.00083019474,0.2824699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992908,0.00026875606,0.000034475655,0.00010884336,0.0002194764,0.00007764336],"domain_scores_gemma":[0.99776804,0.001585254,0.000066079745,0.00028996452,0.00020838187,0.00008219563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013244717,0.00061565754,0.00056082057,0.0014966903,0.0015664278,0.0041479706,0.0012129389,0.0017642345,0.018324003],"category_scores_gemma":[0.0035695778,0.0004455549,0.0007358904,0.001677371,0.0063469126,0.006953551,0.001722796,0.0039185705,0.0051653516],"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":[9.924382e-7,0.0000024696494,0.00001680488,0.000027701699,0.0000019035258,0.0000104150995,0.000060936796,0.00019327666,0.00002899389,0.9912116,0.0041995514,0.0042452877],"study_design_scores_gemma":[9.036241e-7,0.0000010647151,0.000022999327,0.000019687777,8.3015357e-7,0.000025854573,0.00001936468,0.0007109619,0.00003463048,0.9818866,0.017275328,0.0000017275111],"about_ca_topic_score_codex":0.0014522044,"about_ca_topic_score_gemma":0.0015690783,"teacher_disagreement_score":0.018324003,"about_ca_system_score_codex":0.0023300515,"about_ca_system_score_gemma":0.0011499204,"threshold_uncertainty_score":0.06129986},"labels":[],"label_agreement":null},{"id":"W4237453455","doi":"10.1017/cbo9781107298019.008","title":"Nonuniform Learnability","year":2014,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Machine Learning and Algorithms","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":"Learnability; Dimension (graph theory); Characterization (materials science); Mathematics; Sample (material); Computer science; Pure mathematics; Calculus (dental); Discrete mathematics; Artificial intelligence; Physics","score_opus":0.012795334467867701,"score_gpt":0.1922847087164745,"score_spread":0.17948937424860678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237453455","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.024683228,0.010556988,0.7113842,0.006478387,0.0006714671,0.00011672234,0.0009076948,0.00056358683,0.24463788],"genre_scores_gemma":[0.7227986,0.012621027,0.15657565,0.0041573243,0.0024078053,0.0006599057,0.0018319861,0.00058801525,0.09835972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785393,0.0004676289,0.000109074994,0.0006769911,0.0007666341,0.00012565964],"domain_scores_gemma":[0.9936267,0.0041150297,0.00023531713,0.0014350907,0.0004446189,0.00014313382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019785638,0.00072153803,0.0007770105,0.000884405,0.00065084134,0.0024930313,0.0012499201,0.0009739557,0.0074963234],"category_scores_gemma":[0.013255363,0.00045646555,0.0007899714,0.0010973043,0.004389691,0.0074759866,0.0022997195,0.004498021,0.0014546127],"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.000035172157,0.000013979739,0.00030754757,0.00017087784,0.000015000361,0.000039472394,0.00012635611,0.005661255,0.0006704125,0.92889804,0.0060523073,0.05800973],"study_design_scores_gemma":[0.000007901819,0.000029441058,0.0004820068,0.00006497868,0.0000128290385,0.0002015434,0.000029895935,0.018458558,0.0014284994,0.9398634,0.039407942,0.000012969512],"about_ca_topic_score_codex":0.00051735976,"about_ca_topic_score_gemma":0.0003741798,"teacher_disagreement_score":0.0074963234,"about_ca_system_score_codex":0.0023667668,"about_ca_system_score_gemma":0.0006259767,"threshold_uncertainty_score":0.0250777},"labels":[],"label_agreement":null},{"id":"W4240930969","doi":"10.1016/s0925-2312(04)00126-2","title":"Unifying models of paired associates and serial learning: insights from simulating a chaining model","year":2004,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Baycrest Hospital","funders":"","keywords":"Chaining; Serial learning; Computer science; Dissociation (chemistry); Isolation (microbiology); Recall; Autocorrelation; Artificial intelligence; Theoretical computer science; Algorithm; Mathematics; Cognitive psychology; Psychology; Statistics; Bioinformatics; Biology","score_opus":0.022973404121213147,"score_gpt":0.23945163589348564,"score_spread":0.2164782317722725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240930969","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.377474,0.00054606615,0.57567316,0.0026125265,0.00022129955,0.00012615017,0.00038444818,0.0005136979,0.04244866],"genre_scores_gemma":[0.9479944,0.00041143232,0.032509442,0.00020644793,0.00009760349,0.00012999256,0.00018314764,0.00010762075,0.018359935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991627,0.0003741949,0.00004469464,0.0001454394,0.0001359286,0.00013717811],"domain_scores_gemma":[0.99225605,0.005420479,0.00047080623,0.0008264774,0.00050364336,0.0005225787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024975722,0.0007671809,0.0019070102,0.0009913916,0.0010528117,0.0024640453,0.0033205114,0.003664894,0.014113673],"category_scores_gemma":[0.014485338,0.00074091856,0.0013991273,0.0015494477,0.002350011,0.0068347254,0.0016981782,0.0027627177,0.0011639461],"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.000086491076,0.000109242836,0.00082280487,0.000027713182,0.00002562244,0.0000972067,0.00016479891,0.76618314,0.00026194024,0.22604418,0.0009235548,0.005253346],"study_design_scores_gemma":[0.000025121471,0.000022494767,0.00009363806,0.0000047397893,0.000009557668,0.000022926562,0.000026988162,0.8455301,0.000096909236,0.15385042,0.00030603298,0.000011099806],"about_ca_topic_score_codex":0.008681868,"about_ca_topic_score_gemma":0.0075522177,"teacher_disagreement_score":0.014113673,"about_ca_system_score_codex":0.0013917298,"about_ca_system_score_gemma":0.0016845969,"threshold_uncertainty_score":0.047214925},"labels":[],"label_agreement":null},{"id":"W4244320771","doi":"10.1137/1.9781611975482.61","title":"XOR Codes and Sparse Learning Parity with Noise","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Chinese University of Hong Kong; National Science Foundation","keywords":"Mathematics; Random variable; Combinatorics; Modulo; Decoding methods; Discrete mathematics; Parity (physics); Algorithm; Statistics; Physics; Quantum mechanics","score_opus":0.03669504724905,"score_gpt":0.2299703520996574,"score_spread":0.1932753048506074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244320771","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.26310402,0.0004894587,0.7134509,0.0047457837,0.00016269136,0.00021027157,0.0013050938,0.0017040829,0.014827771],"genre_scores_gemma":[0.8399129,0.00018371028,0.14757484,0.00080969284,0.00017552945,0.0002820395,0.0011847493,0.00032395896,0.0095526045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978849,0.0006596587,0.00010672365,0.00046457117,0.00053115684,0.00035297137],"domain_scores_gemma":[0.9915394,0.006401532,0.0005368109,0.0008928403,0.00042185813,0.00020741843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014017953,0.0008033487,0.0012827574,0.00049315114,0.00072721695,0.0017263086,0.0015913789,0.0014513563,0.00620644],"category_scores_gemma":[0.014854205,0.0004967788,0.0010975542,0.0010085669,0.0016508295,0.0036680591,0.0026634117,0.0031165204,0.00084544794],"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.001133911,0.00027813468,0.004557582,0.00040838553,0.0001503273,0.00053230027,0.00050549716,0.50412494,0.0051574777,0.36772734,0.013140352,0.1022837],"study_design_scores_gemma":[0.00010207521,0.000058803533,0.00028031014,0.000020907064,0.000019786765,0.00008741635,0.00005901595,0.68299556,0.0024069254,0.3126738,0.0012743508,0.000021015532],"about_ca_topic_score_codex":0.0021602395,"about_ca_topic_score_gemma":0.0030449065,"teacher_disagreement_score":0.00620644,"about_ca_system_score_codex":0.0018065039,"about_ca_system_score_gemma":0.0017440402,"threshold_uncertainty_score":0.020762682},"labels":[],"label_agreement":null},{"id":"W4244641834","doi":"10.1007/978-0-387-30162-4_189","title":"Inductive Inference","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Inference; Computer science; Artificial intelligence","score_opus":0.015424452460302133,"score_gpt":0.24907265832351036,"score_spread":0.23364820586320822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244641834","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.00084524683,0.0024576113,0.6969149,0.0017981795,0.00066023355,0.00015240232,0.0017004505,0.0032839433,0.29218695],"genre_scores_gemma":[0.06326502,0.006358203,0.6034265,0.00291748,0.0016871953,0.0006574987,0.010083936,0.0024437057,0.3091604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985423,0.00037902896,0.000076326425,0.00038259744,0.0005388645,0.000080859776],"domain_scores_gemma":[0.9981686,0.0009910861,0.00004141665,0.0005132374,0.0002427279,0.000042898027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016197306,0.0010777423,0.00095235783,0.0021208962,0.001236644,0.0029205158,0.0033198928,0.0011569638,0.10113708],"category_scores_gemma":[0.0051879017,0.00085872796,0.0015850872,0.0016758274,0.0018583799,0.004824515,0.0030427012,0.003391451,0.054557156],"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.000027791986,0.00005789448,0.00030315682,0.0004055516,0.000043674005,0.000064312204,0.0001608071,0.001525672,0.00094552105,0.59865934,0.09727625,0.30053005],"study_design_scores_gemma":[0.00001290987,0.000009423217,0.0001993101,0.00016577478,0.000027700708,0.0001750804,0.00004296118,0.006329412,0.0023583435,0.6924317,0.29822934,0.000018040793],"about_ca_topic_score_codex":0.0008829197,"about_ca_topic_score_gemma":0.0018187887,"teacher_disagreement_score":0.10113708,"about_ca_system_score_codex":0.0010924616,"about_ca_system_score_gemma":0.001213058,"threshold_uncertainty_score":0.33833718},"labels":[],"label_agreement":null},{"id":"W4244675684","doi":"10.1007/978-0-387-39940-9_3724","title":"Supervised Learning","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Psychology","score_opus":0.011964455203064007,"score_gpt":0.22928214753207607,"score_spread":0.21731769232901207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244675684","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.0028936174,0.004461749,0.9230204,0.0009895287,0.0006147884,0.00015380378,0.001568218,0.004948475,0.061349493],"genre_scores_gemma":[0.0981967,0.0058471626,0.73255426,0.0014068995,0.0013127311,0.00063542725,0.0136981355,0.0016837887,0.14466488],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872786,0.00024406731,0.00007289337,0.00043179383,0.00046865974,0.0000548453],"domain_scores_gemma":[0.99829406,0.00060265686,0.00006790537,0.00064254587,0.0003450151,0.0000477815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001085845,0.00092835084,0.0010451245,0.0011969678,0.0005626037,0.0019298116,0.0022379372,0.0009508305,0.023525385],"category_scores_gemma":[0.0038093822,0.0004827517,0.00081262714,0.0014147433,0.000729739,0.0018888975,0.0015682896,0.0017681387,0.021549525],"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.000045685712,0.00010632422,0.0005481747,0.0003609169,0.00007606799,0.000048591904,0.00005836575,0.01189228,0.0018085662,0.046973962,0.106024615,0.8320564],"study_design_scores_gemma":[0.000044075347,0.00011753851,0.001393289,0.00027317082,0.00007354586,0.00057838403,0.00007480563,0.30653727,0.009765186,0.35244918,0.32863224,0.000061263796],"about_ca_topic_score_codex":0.00085185573,"about_ca_topic_score_gemma":0.0018952298,"teacher_disagreement_score":0.023525385,"about_ca_system_score_codex":0.00052192796,"about_ca_system_score_gemma":0.0011058942,"threshold_uncertainty_score":0.078700244},"labels":[],"label_agreement":null},{"id":"W4248809068","doi":"10.1145/342009.335409","title":"XTRACT","year":2000,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; XML validation; Document Structure Description; RELAX NG; Document type definition; XML Schema Editor; Well-formed document; XML Schema (W3C); XML; Streaming XML; Information retrieval; Programming language; Simple API for XML; Efficient XML Interchange; XML Signature; World Wide Web","score_opus":0.003759429383309652,"score_gpt":0.21651594326639353,"score_spread":0.2127565138830839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248809068","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004143927,0.0014718521,0.5659677,0.001805346,0.0012002526,0.0007246647,0.03895768,0.31421813,0.07151052],"genre_scores_gemma":[0.06919917,0.003009988,0.53666496,0.002404437,0.000762875,0.0013444691,0.24272877,0.05306061,0.09082482],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966968,0.0005450408,0.00032831714,0.0007295407,0.0014671625,0.00023321547],"domain_scores_gemma":[0.9952807,0.0013852598,0.00035236523,0.0016373314,0.0011337203,0.00021062374],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029025946,0.0014804299,0.0010386592,0.0025914959,0.001256764,0.0054931934,0.003983581,0.0022898677,0.07592473],"category_scores_gemma":[0.0154578835,0.0010369014,0.0019975994,0.003109919,0.0009235136,0.005746903,0.0031459837,0.0026090615,0.06446952],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00062482414,0.00009999503,0.0018467996,0.0008457943,0.00012737961,0.0005756992,0.00030766905,0.009333481,0.0052456367,0.06208796,0.5776484,0.34125638],"study_design_scores_gemma":[0.00009840054,0.0000926579,0.00075522007,0.00015462532,0.000049823564,0.0005767029,0.00006664008,0.068083,0.009329205,0.04832224,0.8723844,0.000087022214],"about_ca_topic_score_codex":0.0050365888,"about_ca_topic_score_gemma":0.0038850394,"teacher_disagreement_score":0.92407525,"about_ca_system_score_codex":0.0014140771,"about_ca_system_score_gemma":0.0023730688,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4252287331","doi":"10.4018/978-1-5225-7368-5.ch003","title":"Artificial Intelligence Review","year":2018,"lang":"en","type":"book-chapter","venue":"Advances in computer and electrical engineering book series","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":71,"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":"Turing test; Artificial intelligence; Computer science; Fuzzy logic; Artificial Intelligence System; Applications of artificial intelligence; Artificial neural network; Cover (algebra); Machine learning; Engineering","score_opus":0.007932784901009269,"score_gpt":0.2372539404540633,"score_spread":0.22932115555305405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252287331","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043377356,0.8641354,0.0020023638,0.008761857,0.0076090875,0.00003351893,0.00029768358,0.00012288375,0.11660346],"genre_scores_gemma":[0.005149048,0.90065634,0.002720954,0.0074854502,0.0060827527,0.000059486203,0.0007800311,0.00011578392,0.07695009],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990938,0.0001519953,0.000082823506,0.00014964139,0.0004528166,0.00006904723],"domain_scores_gemma":[0.9985079,0.000690577,0.000076647804,0.000096062,0.0005246979,0.00010412168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009245578,0.0009242416,0.0009986792,0.004064584,0.0008973189,0.0040719104,0.0015399159,0.001767315,0.04654704],"category_scores_gemma":[0.0032072954,0.00036469853,0.0006742278,0.005355368,0.0010125904,0.0034302855,0.0014763437,0.0027266094,0.029849216],"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.0000238954,0.00004647027,0.00018861094,0.0035514517,0.00003835657,0.00017051121,0.00020585641,0.00049250136,0.00036241632,0.04864007,0.47205165,0.4742281],"study_design_scores_gemma":[0.0000012838157,0.0000062845756,0.000119231576,0.00075244,0.000005155991,0.00022495084,0.000030884952,0.00003458693,0.000042640175,0.004198403,0.9945798,0.0000043857426],"about_ca_topic_score_codex":0.0018329587,"about_ca_topic_score_gemma":0.0027040783,"teacher_disagreement_score":0.04654704,"about_ca_system_score_codex":0.0023479303,"about_ca_system_score_gemma":0.0024695848,"threshold_uncertainty_score":0.15571529},"labels":[],"label_agreement":null},{"id":"W4253436129","doi":"10.11606/d.55.2019.tde-11092019-090930","title":"TRIVIR: A Visualization System to Support Document Retrieval with High Recall","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Dalhousie University","keywords":"Computer science; Information retrieval; Set (abstract data type); Precision and recall; Visualization; Recall; Process (computing); Similarity (geometry); Vocabulary; Data mining; Artificial intelligence; Image (mathematics)","score_opus":0.005783897656507108,"score_gpt":0.27034477583780225,"score_spread":0.26456087818129514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253436129","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.0062207757,0.0017301417,0.56342566,0.0005897412,0.0003358573,0.0005403477,0.010120622,0.40645322,0.010583567],"genre_scores_gemma":[0.08964097,0.0023061596,0.8211093,0.00079210347,0.0004496881,0.0014142463,0.034168676,0.026714003,0.023404762],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989367,0.00026483208,0.00012884515,0.00020043817,0.000390276,0.000078966936],"domain_scores_gemma":[0.9962823,0.0014372419,0.0002388268,0.0009116805,0.00086384115,0.00026618293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033966994,0.0017896028,0.0012493553,0.004682002,0.00063354615,0.0037775035,0.0034084062,0.0016696301,0.030523922],"category_scores_gemma":[0.008724088,0.00090319896,0.0010973143,0.0025281059,0.00043403372,0.0042481297,0.0032406268,0.0019877383,0.02080741],"study_design_candidate":"bench_or_experimental","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.002169538,0.00040178373,0.0018954483,0.0021138228,0.00029900033,0.0005198467,0.0010256473,0.008839769,0.037135374,0.011625788,0.34359142,0.59038264],"study_design_scores_gemma":[0.001046595,0.000726048,0.0037600659,0.0005857028,0.00031856046,0.0017490882,0.00043963437,0.34639266,0.084120885,0.04766479,0.5126598,0.00053613796],"about_ca_topic_score_codex":0.0018683384,"about_ca_topic_score_gemma":0.002078008,"teacher_disagreement_score":0.030523922,"about_ca_system_score_codex":0.00065570505,"about_ca_system_score_gemma":0.0008836157,"threshold_uncertainty_score":0.10211271},"labels":[],"label_agreement":null},{"id":"W4283753891","doi":"10.48550/arxiv.2206.14800","title":"Understanding Generalization via Leave-One-Out Conditional Mutual Information","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Materials Research; Simons Institute for the Theory of Computing, University of California Berkeley; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Mutual information; Generalization; Bounded function; Computer science; Mathematics; Artificial intelligence; Constant (computer programming); Algorithm; Upper and lower bounds; Machine learning","score_opus":0.14475967715498758,"score_gpt":0.20401448737645067,"score_spread":0.05925481022146309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283753891","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.039621945,0.00057789776,0.9571471,0.0007634502,0.00004275501,0.000060667302,0.00019936482,0.00043753147,0.0011492848],"genre_scores_gemma":[0.83265156,0.0009111579,0.16011721,0.00092484494,0.00033778162,0.00044830848,0.0014463932,0.0006213973,0.0025413549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99267805,0.0030287094,0.00030119985,0.002191005,0.0013454155,0.00045573624],"domain_scores_gemma":[0.9017789,0.073854245,0.0071607297,0.013356042,0.0026136844,0.0012364028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023106007,0.0020870832,0.002520079,0.0021489912,0.0013769529,0.0027004017,0.005398173,0.0027226773,0.0018130281],"category_scores_gemma":[0.07326599,0.0012483681,0.0023974297,0.001508764,0.0076888367,0.008708354,0.007431636,0.0056980434,0.00031691545],"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.0003905795,0.00025889915,0.014449053,0.000396002,0.00054115447,0.0004335046,0.0015416717,0.64679635,0.003934282,0.26383248,0.003095417,0.06433059],"study_design_scores_gemma":[0.000018931114,0.00011986097,0.0020824117,0.000036785998,0.000051213057,0.000085460044,0.00006504112,0.7508711,0.0016789042,0.24404709,0.0008933646,0.000049732353],"about_ca_topic_score_codex":0.004120852,"about_ca_topic_score_gemma":0.003352209,"teacher_disagreement_score":0.023106007,"about_ca_system_score_codex":0.0029847228,"about_ca_system_score_gemma":0.0017114271,"threshold_uncertainty_score":0.12219769},"labels":[],"label_agreement":null},{"id":"W4283791154","doi":"10.1609/aaai.v36i11.21593","title":"Annotation Cost-Sensitive Deep Active Learning with Limited Data (Student Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"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é Laval","funders":"","keywords":"MNIST database; Computer science; Artificial intelligence; Annotation; Deep learning; Active learning (machine learning); Machine learning; Context (archaeology); Task (project management); Labeled data; Biology; Engineering","score_opus":0.07314071175042759,"score_gpt":0.31633812135045475,"score_spread":0.24319740960002717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283791154","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.028811844,0.0008470501,0.96281916,0.0020183658,0.00038493847,0.00008202538,0.0004846074,0.0018709206,0.0026811971],"genre_scores_gemma":[0.57629836,0.00063703954,0.3939891,0.0013010398,0.0008035922,0.00035836702,0.00273788,0.0007414428,0.0231332],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980262,0.000825918,0.00008526545,0.00054571783,0.0003487036,0.00016808386],"domain_scores_gemma":[0.990045,0.006286006,0.00036874224,0.001654075,0.0012477328,0.00039839986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005173429,0.000951396,0.0013257104,0.0007247125,0.0007061334,0.0022851676,0.0030860018,0.0027017747,0.0060807923],"category_scores_gemma":[0.014395325,0.00066337484,0.0009471451,0.0008737618,0.0014717844,0.0030876657,0.0030281185,0.0038278056,0.0017376018],"study_design_candidate":"bench_or_experimental","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.0011154698,0.0005046806,0.0025737754,0.00030690635,0.00014631724,0.00031020204,0.00028633975,0.23075175,0.017290356,0.032081272,0.037725836,0.6769072],"study_design_scores_gemma":[0.000031997133,0.000060872084,0.0002851982,0.00002239797,0.00001315983,0.000050354018,0.00002023289,0.967508,0.008246022,0.021057578,0.0026887741,0.000015432586],"about_ca_topic_score_codex":0.0038148835,"about_ca_topic_score_gemma":0.005693679,"teacher_disagreement_score":0.0060807923,"about_ca_system_score_codex":0.0012015348,"about_ca_system_score_gemma":0.0010317395,"threshold_uncertainty_score":0.027360022},"labels":[],"label_agreement":null},{"id":"W4283800411","doi":"10.1609/aaai.v36i9.21220","title":"Sample-Efficient Iterative Lower Bound Optimization of Deep Reactive Policies for Planning in Continuous MDPs","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"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":"National Research Foundation Singapore; National Research Foundation","keywords":"Computer science; Mathematical optimization; Variance (accounting); Maximization; Iterative learning control; Upper and lower bounds; Parametric statistics; Sample (material); Markov decision process; Optimization problem; Artificial intelligence; Algorithm; Mathematics; Control (management)","score_opus":0.04515529792387129,"score_gpt":0.3091709383972863,"score_spread":0.264015640473415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283800411","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.020254297,0.00023918232,0.9760576,0.00026817078,0.000026564967,0.00005166956,0.00005780324,0.00061075663,0.0024338535],"genre_scores_gemma":[0.73984975,0.00023198254,0.25608873,0.0002638424,0.000032962547,0.0003455139,0.00028348557,0.0003474547,0.0025562923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993111,0.0002433826,0.0000323608,0.00012818906,0.00017806591,0.000106786014],"domain_scores_gemma":[0.9964557,0.0026885474,0.0002576832,0.00018485289,0.00027074406,0.00014246747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018381121,0.0013585343,0.0013412104,0.00054165267,0.0004388265,0.0009585877,0.0012775626,0.001297332,0.002490437],"category_scores_gemma":[0.00798416,0.0008822725,0.0006692108,0.00047639484,0.0015522948,0.0012633668,0.0016936315,0.0024036726,0.00039564588],"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.000028099288,0.000015823527,0.00013310894,0.000026411242,0.000007952328,0.000014360776,0.000017560693,0.9899143,0.00020016562,0.0030907525,0.00025496166,0.006296539],"study_design_scores_gemma":[0.000004371062,0.0000082701345,0.000012619726,0.000003522693,0.0000013305597,0.000001874578,0.0000026639113,0.99788624,0.00012603278,0.0018654517,0.00008652793,0.0000011475316],"about_ca_topic_score_codex":0.009502151,"about_ca_topic_score_gemma":0.0106583815,"teacher_disagreement_score":0.009502151,"about_ca_system_score_codex":0.0017323863,"about_ca_system_score_gemma":0.002800903,"threshold_uncertainty_score":0.01889366},"labels":[],"label_agreement":null},{"id":"W4283822869","doi":"10.1609/aaai.v36i6.20563","title":"Active Sampling for Text Classification with Subinstance Level Queries","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Catastrophic Loss Reduction; University of Wisconsin-Madison","keywords":"Computer science; Sample (material); Labeled data; Artificial intelligence; Annotation; Machine learning; Salient; Class (philosophy); Domain (mathematical analysis); Selection (genetic algorithm); Task (project management); Data mining; Information retrieval","score_opus":0.16211629431123747,"score_gpt":0.3247130027261861,"score_spread":0.1625967084149486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283822869","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.010208142,0.00060086994,0.98583466,0.00046578294,0.000054466112,0.00018657748,0.00022012774,0.0015290579,0.0009002748],"genre_scores_gemma":[0.39577997,0.0005742026,0.5938556,0.0009600855,0.0007566781,0.0011877094,0.0025104692,0.00049812975,0.0038771413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944224,0.0025861934,0.00030660257,0.0011639796,0.0012207357,0.00030018785],"domain_scores_gemma":[0.98198867,0.0136546735,0.00083454093,0.0017938169,0.0012585118,0.0004697291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007830972,0.0015238486,0.0028689574,0.0019286355,0.0010476505,0.0031542073,0.0046145082,0.0028279286,0.0033627653],"category_scores_gemma":[0.024261236,0.00073494716,0.0013565103,0.00274521,0.0016999487,0.005312563,0.0023940403,0.0035365769,0.001562498],"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.0013751371,0.0009596645,0.004330903,0.0004757457,0.00014365955,0.00028717925,0.00085611857,0.42644957,0.009899519,0.06304444,0.015031591,0.47714642],"study_design_scores_gemma":[0.000033098102,0.00004349834,0.00011013684,0.000007369496,0.000006341704,0.000022707136,0.00002533669,0.9738008,0.00088280137,0.023913637,0.0011472922,0.000007070001],"about_ca_topic_score_codex":0.0026693488,"about_ca_topic_score_gemma":0.0035284262,"teacher_disagreement_score":0.007830972,"about_ca_system_score_codex":0.0018306167,"about_ca_system_score_gemma":0.0015925127,"threshold_uncertainty_score":0.041414678},"labels":[],"label_agreement":null},{"id":"W4285492222","doi":"10.1007/s41666-022-00117-y","title":"Active Learning for Multi-way Sensitivity Analysis with Application to Disease Screening Modeling","year":2022,"lang":"en","type":"article","venue":"Journal of Healthcare Informatics Research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"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; University of Toronto","funders":"","keywords":"Sensitivity (control systems); Machine learning; Computer science; Artificial intelligence; Random forest; Selection (genetic algorithm); Task (project management); Ensemble learning; Model selection; Data mining; Engineering","score_opus":0.0927543417513914,"score_gpt":0.4284659217935231,"score_spread":0.3357115800421317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285492222","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.0041030305,0.00019167065,0.9949503,0.00010719019,0.000025254061,0.000038121336,0.000054404296,0.0002950485,0.00023492672],"genre_scores_gemma":[0.4704115,0.00052346144,0.52272844,0.0002974804,0.00016517394,0.0007969318,0.00046624048,0.000443638,0.0041670627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99549073,0.0032140315,0.00020806058,0.0004699659,0.00044683644,0.00017046556],"domain_scores_gemma":[0.94516003,0.05136293,0.0007921239,0.0012205455,0.0011871462,0.00027727438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013647095,0.001927262,0.003828804,0.002051989,0.0011132663,0.0024109134,0.003385501,0.0028378507,0.0035363717],"category_scores_gemma":[0.03302116,0.0017534966,0.0039478377,0.0013243847,0.0016163321,0.002048507,0.0033148967,0.004991687,0.0004579978],"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.00014317426,0.0001589781,0.0008185891,0.00014827294,0.00034260075,0.00010835101,0.0001012751,0.94754165,0.0008430792,0.014618482,0.0005661969,0.034609303],"study_design_scores_gemma":[0.00000624125,0.000014811177,0.000041498508,0.0000038473386,0.000012601879,0.000010165496,0.0000026618338,0.99508286,0.0001507729,0.00454923,0.00011952545,0.0000057534394],"about_ca_topic_score_codex":0.00671254,"about_ca_topic_score_gemma":0.0059668752,"teacher_disagreement_score":0.013647095,"about_ca_system_score_codex":0.0012342798,"about_ca_system_score_gemma":0.0017717209,"threshold_uncertainty_score":0.072173595},"labels":[],"label_agreement":null},{"id":"W4290188500","doi":"10.48550/arxiv.1404.3328","title":"Myopic Bounds for Optimal Policy of POMDPs: An extension of Lovejoy's\\n structural results","year":2014,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","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 British Columbia","funders":"","keywords":"Extension (predicate logic); Bounded function; Markov decision process; Mathematical optimization; Relaxation (psychology); Mathematical economics; Upper and lower bounds; Computer science; Mathematics; Markov process; Economics; Applied mathematics; Statistics","score_opus":0.05878703035128744,"score_gpt":0.23410372179051805,"score_spread":0.17531669143923062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290188500","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.013586332,0.00062508177,0.96489155,0.0013883568,0.00007310745,0.00007610865,0.00023029622,0.00021808271,0.018911142],"genre_scores_gemma":[0.7499196,0.0020754505,0.23671024,0.0010029296,0.0004350194,0.00081845484,0.00062075566,0.00041700134,0.008000506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476755,0.0016758277,0.00026464288,0.0009985631,0.001760656,0.0005327387],"domain_scores_gemma":[0.96745425,0.025375536,0.0021295126,0.0022858412,0.0018742275,0.0008806372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007176046,0.0017214261,0.0016941861,0.0018564757,0.0013547597,0.0028939932,0.0031384963,0.0019722588,0.010267977],"category_scores_gemma":[0.04164487,0.0016767882,0.0020262,0.0014620222,0.0038933964,0.0082465345,0.0052315257,0.006528048,0.0009736704],"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.000101387566,0.00008705706,0.0005081445,0.00027029257,0.000045196837,0.00007983481,0.00034605135,0.17183039,0.0015386281,0.8056548,0.0022946207,0.01724362],"study_design_scores_gemma":[0.000030782245,0.00008213594,0.0002522629,0.000119600925,0.00001749868,0.000043217264,0.000061912964,0.45489526,0.0011704896,0.54023296,0.0030680122,0.000025820927],"about_ca_topic_score_codex":0.0018778928,"about_ca_topic_score_gemma":0.0021265098,"teacher_disagreement_score":0.010267977,"about_ca_system_score_codex":0.00307694,"about_ca_system_score_gemma":0.0035510429,"threshold_uncertainty_score":0.037950993},"labels":[],"label_agreement":null},{"id":"W4295783905","doi":"10.2139/ssrn.4217673","title":"On the Complexity of Decision Problems for Some Classes of Machines and Applications","year":2022,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Decision problem; Theoretical computer science; Management science; Mathematics; Programming language; Engineering","score_opus":0.01818503682676028,"score_gpt":0.26965556047134637,"score_spread":0.2514705236445861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295783905","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.24552926,0.013446212,0.6265213,0.042163502,0.00096454524,0.0005913322,0.004627381,0.0007278233,0.06542871],"genre_scores_gemma":[0.8301712,0.006532577,0.13656469,0.002411662,0.002560842,0.0009119771,0.0039754095,0.00050267763,0.016368926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99199146,0.0032161411,0.00047944754,0.0012308893,0.00215795,0.0009242672],"domain_scores_gemma":[0.8246152,0.16396129,0.0034095726,0.0034217583,0.0026101081,0.001982134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007969226,0.0018728818,0.003354564,0.0027605244,0.002070478,0.008460963,0.0040990063,0.003916916,0.015323714],"category_scores_gemma":[0.072629645,0.0013755694,0.0029372745,0.003434456,0.004757017,0.01694712,0.004466639,0.0108251,0.00085646234],"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.0008529285,0.00047223276,0.004245145,0.000901177,0.000234072,0.00021179963,0.0005850151,0.17273611,0.00082128966,0.7455829,0.019373532,0.05398378],"study_design_scores_gemma":[0.00008391818,0.00004173594,0.0007872332,0.00005486745,0.00003819943,0.00009137301,0.00009902946,0.29136539,0.00018041098,0.705481,0.0017514812,0.000025379513],"about_ca_topic_score_codex":0.0045674425,"about_ca_topic_score_gemma":0.003511565,"teacher_disagreement_score":0.015323714,"about_ca_system_score_codex":0.0058311364,"about_ca_system_score_gemma":0.0031857558,"threshold_uncertainty_score":0.051262975},"labels":[],"label_agreement":null},{"id":"W4295845595","doi":"10.4230/lipics.icalp.2025.135","title":"Deterministic Independent Sets in the Semi-Streaming Model","year":2025,"lang":"en","type":"preprint","venue":"Dagstuhl Research Online Publication Server","topic":"Machine Learning and Algorithms","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":"Combinatorics; Logarithm; Upper and lower bounds; Mathematics; Reciprocal; Omega; BETA (programming language); Graph; Independent set; Set (abstract data type); Discrete mathematics; Constant (computer programming); Computer science; Physics; Mathematical analysis","score_opus":0.12301858349673361,"score_gpt":0.44195738755447317,"score_spread":0.31893880405773956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295845595","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.054845937,0.0007793094,0.9354529,0.0016790949,0.00011852644,0.00021918841,0.0010589039,0.0007088943,0.005137319],"genre_scores_gemma":[0.65074974,0.0015545157,0.33296725,0.000831526,0.00069484324,0.0007585709,0.0025268532,0.00030314995,0.009613609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99309856,0.0024829237,0.00038453523,0.0018023731,0.0014832536,0.0007483446],"domain_scores_gemma":[0.97281986,0.017799014,0.0017878361,0.0052444316,0.0013865795,0.00096240296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051324405,0.0012778491,0.0026228302,0.0010953884,0.0013152981,0.0028252082,0.0042260233,0.002042578,0.005173711],"category_scores_gemma":[0.0196814,0.0010584727,0.002070875,0.0025332794,0.0027003582,0.008880652,0.0031429017,0.0039746007,0.0012357445],"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.0008943733,0.0003681168,0.0018649639,0.0005279647,0.00018762983,0.00046110366,0.00038506193,0.45085484,0.0060223304,0.48842287,0.007986369,0.042024367],"study_design_scores_gemma":[0.000072851064,0.00007798699,0.00022244029,0.000017534485,0.00002380252,0.00016869111,0.00003986625,0.6945204,0.001357578,0.30144846,0.0020264026,0.000024054958],"about_ca_topic_score_codex":0.0018225637,"about_ca_topic_score_gemma":0.0016665022,"teacher_disagreement_score":0.005173711,"about_ca_system_score_codex":0.002198236,"about_ca_system_score_gemma":0.0018024988,"threshold_uncertainty_score":0.02714324},"labels":[],"label_agreement":null},{"id":"W4296870767","doi":"10.1016/j.ifacol.2022.09.071","title":"Novel Representative Sampling for Improved Active Learning","year":2022,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"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 the Fraser Valley; Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Sampling (signal processing); Machine learning; MNIST database; Active learning (machine learning); Transformation (genetics); Set (abstract data type); Sampling distribution; Object (grammar); Pattern recognition (psychology); Data mining; Deep learning; Mathematics; Computer vision; Statistics","score_opus":0.030054351927624456,"score_gpt":0.3137060158030343,"score_spread":0.28365166387540985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296870767","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.0027985862,0.00011589633,0.9962878,0.000048619168,0.000022370417,0.000017059303,0.000014046242,0.0003694988,0.0003261571],"genre_scores_gemma":[0.25868523,0.0003186198,0.73627716,0.00037593034,0.00015641486,0.00037267772,0.00046377038,0.000425634,0.0029245827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981343,0.00075596856,0.00008925671,0.00031215663,0.0005758762,0.0001324019],"domain_scores_gemma":[0.99470204,0.0028335634,0.00030745636,0.0008500127,0.0010712518,0.00023560417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038250922,0.0011700223,0.001863635,0.0011687853,0.00061032554,0.0015837913,0.002963178,0.001906473,0.0024176924],"category_scores_gemma":[0.011582602,0.0007821856,0.0011778376,0.0011288121,0.0014282479,0.002853572,0.0026565883,0.002497887,0.0011453719],"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.0004741234,0.00030788514,0.0019994834,0.00018998224,0.00011819897,0.00014113467,0.00038953676,0.49262995,0.017993448,0.05213408,0.005456744,0.42816547],"study_design_scores_gemma":[0.000012335764,0.000035986825,0.000053822834,0.0000058594687,0.0000047137096,0.000022587323,0.000007172218,0.9912593,0.0022178655,0.0054816687,0.00089300354,0.0000057735847],"about_ca_topic_score_codex":0.0013133103,"about_ca_topic_score_gemma":0.0013647745,"teacher_disagreement_score":0.0038250922,"about_ca_system_score_codex":0.00078052405,"about_ca_system_score_gemma":0.0008668974,"threshold_uncertainty_score":0.02022928},"labels":[],"label_agreement":null},{"id":"W4301342375","doi":"10.48550/arxiv.1503.02244","title":"Asymptotic Optimality of Finite Approximations to Markov Decision\\n Processes with Borel Spaces","year":2015,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov decision process; Mathematics; State space; Convergence (economics); Applied mathematics; Action (physics); Mathematical optimization; Markov chain; Space (punctuation); Class (philosophy); Markov process; Q-learning; Finite state; Rate of convergence; Average cost; Reinforcement learning; Computer science; Statistics","score_opus":0.05481596787929066,"score_gpt":0.20978786082827658,"score_spread":0.15497189294898592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301342375","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.0456089,0.000737763,0.94938445,0.00056400016,0.000057552872,0.000047567617,0.00008021224,0.00023921388,0.0032802913],"genre_scores_gemma":[0.82681394,0.0011061918,0.16788806,0.00022003542,0.000118172946,0.00029271079,0.00039349194,0.00015872878,0.003008533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633694,0.0018257371,0.00016762136,0.0005395353,0.0007891085,0.0003410516],"domain_scores_gemma":[0.9627417,0.033185735,0.0012982356,0.0012869698,0.0010015955,0.000485771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076621426,0.001172942,0.0018569309,0.0015280567,0.00082091795,0.002643143,0.0021864532,0.0017512594,0.0019749957],"category_scores_gemma":[0.0519775,0.0010064571,0.0013092584,0.00094179634,0.0040997756,0.003659005,0.0025743772,0.004076618,0.00035995792],"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.000110170164,0.000055855435,0.00076599454,0.00009592878,0.00005043015,0.00005213762,0.00010399126,0.8343242,0.00046311234,0.15159982,0.00043074932,0.011947693],"study_design_scores_gemma":[0.000004758792,0.000013303562,0.000049714698,0.000014130418,0.0000027778365,0.0000056374843,0.0000074002974,0.9551384,0.00016392361,0.044486687,0.000109308574,0.00000390315],"about_ca_topic_score_codex":0.005674932,"about_ca_topic_score_gemma":0.0036374573,"teacher_disagreement_score":0.0076621426,"about_ca_system_score_codex":0.0042161485,"about_ca_system_score_gemma":0.0027753436,"threshold_uncertainty_score":0.0405218},"labels":[],"label_agreement":null},{"id":"W4301373880","doi":"10.1080/10705511.2022.2112199","title":"Testing Model Fit in Path Models with Dependent Errors Given Non-Normality, Non-Linearity and Hierarchical Data","year":2022,"lang":"en","type":"article","venue":"Structural Equation Modeling A Multidisciplinary Journal","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Normality; Covariance; Path (computing); Parametric statistics; Nonlinear system; Mathematics; Linearity; Parametric model; Computer science; Path analysis (statistics); Algorithm; Applied mathematics; Statistics","score_opus":0.10362328176336716,"score_gpt":0.32550032161704967,"score_spread":0.2218770398536825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301373880","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.13237584,0.00010664556,0.864421,0.00039971556,0.000038070826,0.00020910338,0.000529964,0.0004418018,0.0014778404],"genre_scores_gemma":[0.71926403,0.0001315176,0.27693018,0.00020430057,0.000045228022,0.0010833556,0.001612661,0.00024206059,0.00048665158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.94325846,0.044524852,0.0016883634,0.005765269,0.0037973798,0.00096561323],"domain_scores_gemma":[0.6487621,0.31571496,0.008644169,0.020319572,0.005380768,0.0011784506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05586995,0.0022644405,0.0020598245,0.003086452,0.0013134273,0.0022676478,0.0023984164,0.002049567,0.005525519],"category_scores_gemma":[0.29366285,0.00090435275,0.0033471405,0.0039683552,0.0028556553,0.005570538,0.0037500958,0.003947645,0.0007474027],"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.0015737895,0.0012377083,0.21682203,0.0012186472,0.006523546,0.0012947806,0.0039261077,0.32527465,0.004051922,0.20665208,0.0049768863,0.22644785],"study_design_scores_gemma":[0.00018736615,0.0008323037,0.020875836,0.00013708472,0.0004298013,0.00027539887,0.00083077524,0.7774898,0.0021269782,0.1948779,0.0018504707,0.000086279506],"about_ca_topic_score_codex":0.0033494683,"about_ca_topic_score_gemma":0.003800849,"teacher_disagreement_score":0.05586995,"about_ca_system_score_codex":0.0014349179,"about_ca_system_score_gemma":0.0042931847,"threshold_uncertainty_score":0.2954721},"labels":[],"label_agreement":null},{"id":"W43025842","doi":"","title":"PLAL: Cluster-based active learning","year":2013,"lang":"en","type":"article","venue":"Conference on Learning Theory","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":29,"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":"Sample complexity; Complement (music); Computer science; Preprocessor; Probabilistic logic; Smoothness; Sample (material); Simple (philosophy); Active learning (machine learning); Artificial intelligence; Machine learning; Semi-supervised learning; Process (computing); Cluster (spacecraft); Mathematics","score_opus":0.014207983216091773,"score_gpt":0.24791224070079795,"score_spread":0.2337042574847062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43025842","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.0051778415,0.00007281072,0.99228585,0.00034999193,0.000023643006,0.00009033098,0.000081025304,0.0008761305,0.0010423376],"genre_scores_gemma":[0.3161701,0.00018325729,0.6748466,0.00063112105,0.00017678573,0.00086167577,0.000722921,0.00058639306,0.0058212196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994197,0.002524935,0.00019435953,0.0011930283,0.001562893,0.00032779205],"domain_scores_gemma":[0.9516176,0.035298623,0.0017156997,0.0075011896,0.002938021,0.00092886516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009972543,0.0014353298,0.0014557746,0.001253172,0.0014373987,0.0035053503,0.007877616,0.0029840004,0.0057723843],"category_scores_gemma":[0.03487288,0.0009054465,0.0011207034,0.0012927208,0.0034768772,0.0070403786,0.00670777,0.006079498,0.0017658594],"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.0015330656,0.0008602491,0.0038454433,0.000726983,0.0002173468,0.00019520475,0.0010608414,0.31672356,0.014790419,0.29612902,0.01342085,0.35049713],"study_design_scores_gemma":[0.00005800222,0.00011200466,0.000117343036,0.000015608273,0.000015457252,0.000040714185,0.000036500765,0.91492563,0.0051545925,0.077808,0.0017013174,0.000014982341],"about_ca_topic_score_codex":0.0017872468,"about_ca_topic_score_gemma":0.0021972812,"teacher_disagreement_score":0.009972543,"about_ca_system_score_codex":0.0022709807,"about_ca_system_score_gemma":0.00197183,"threshold_uncertainty_score":0.052740455},"labels":[],"label_agreement":null},{"id":"W4306808597","doi":"10.4230/lipics.itcs.2024.97","title":"Commuting Local Hamiltonians Beyond 2D","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","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 Waterloo","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Lemma (botany); Event (particle physics); Bounded function; Weak measurement; Mathematics; Discrete mathematics; Type (biology); Set (abstract data type); Quantum; State (computer science); Quantum state; Random access; Sequence (biology); Square root; Combinatorics; Algorithm; Computer science; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.0403656324946088,"score_gpt":0.1892337081471688,"score_spread":0.14886807565256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306808597","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.3362302,0.0012325328,0.5890863,0.0034244177,0.00022602189,0.00031051427,0.0013102482,0.0014303838,0.06674938],"genre_scores_gemma":[0.9120269,0.00033707503,0.079385564,0.0005756276,0.00010553112,0.0002474655,0.00048332626,0.00019779577,0.0066407537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838877,0.00043450194,0.00009426033,0.0003347209,0.0004996105,0.000248157],"domain_scores_gemma":[0.9950059,0.0030122343,0.00033324305,0.0010902439,0.00032572658,0.00023275412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011827794,0.00036881812,0.00056984625,0.00054420315,0.0014713472,0.002496052,0.0009935129,0.00080007367,0.010123165],"category_scores_gemma":[0.0060044834,0.00035301613,0.0010074232,0.0005868459,0.002983595,0.0062856534,0.0032825603,0.002969026,0.0009454209],"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.000083033236,0.0000564805,0.0005193744,0.00013597366,0.00001761923,0.00016856143,0.00042738178,0.016961321,0.0022604605,0.96054053,0.002671809,0.016157478],"study_design_scores_gemma":[0.000019916459,0.000024224637,0.00013692658,0.00001660433,0.000007715202,0.00008742332,0.00012346443,0.044687092,0.0014898726,0.9484412,0.0049496316,0.000016021862],"about_ca_topic_score_codex":0.0010016547,"about_ca_topic_score_gemma":0.001254656,"teacher_disagreement_score":0.010123165,"about_ca_system_score_codex":0.0014828892,"about_ca_system_score_gemma":0.000958384,"threshold_uncertainty_score":0.033865333},"labels":[],"label_agreement":null},{"id":"W4307820629","doi":"10.1007/s10898-022-01247-8","title":"Projections onto hyperbolas or bilinear constraint sets in Hilbert spaces","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hyperbola; Bilinear interpolation; Hilbert space; Constraint (computer-aided design); Space (punctuation); Pure mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.012174143496306362,"score_gpt":0.27517118676509045,"score_spread":0.2629970432687841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307820629","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.026766436,0.00045235065,0.9563136,0.0009581123,0.00020843948,0.00008595751,0.00028823328,0.0001676373,0.014759191],"genre_scores_gemma":[0.6185718,0.00257925,0.3266731,0.0013708641,0.0005766341,0.00070800754,0.00088496733,0.00073228095,0.047902927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982382,0.0008925694,0.000082439066,0.0002145049,0.00040210775,0.00017012662],"domain_scores_gemma":[0.9971276,0.0013748938,0.00034331036,0.0002978406,0.0003518411,0.00050459895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024725324,0.0011588467,0.001044885,0.001169063,0.0007561618,0.0033459186,0.0012495939,0.0010780483,0.009705634],"category_scores_gemma":[0.007510958,0.0009962028,0.000846838,0.0013713157,0.0031143303,0.0056867753,0.0048879865,0.0041653616,0.0013181538],"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.00006188482,0.000036564456,0.00012106353,0.00007506117,0.000021602613,0.000034777266,0.00010246866,0.0092115225,0.0010158552,0.974607,0.0017767445,0.012935426],"study_design_scores_gemma":[0.000013864405,0.000030733492,0.00007623243,0.000017971191,0.000005578291,0.00002987717,0.000055993525,0.0517378,0.00041964697,0.9456153,0.0019831902,0.000013770189],"about_ca_topic_score_codex":0.00073458545,"about_ca_topic_score_gemma":0.00065538427,"teacher_disagreement_score":0.009705634,"about_ca_system_score_codex":0.00079321384,"about_ca_system_score_gemma":0.0012494101,"threshold_uncertainty_score":0.032468557},"labels":[],"label_agreement":null},{"id":"W4312693274","doi":"10.1007/978-3-030-95995-1_12","title":"Model-Free Classification","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Taxonomy (biology); Set (abstract data type); Computer science; Data set; Geography; Artificial intelligence; Information retrieval; Biology; Ecology","score_opus":0.04111124745938666,"score_gpt":0.2491976192293219,"score_spread":0.20808637176993525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312693274","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.002485676,0.0038443797,0.85401756,0.0020720114,0.0014783057,0.00014559155,0.0015725823,0.006522314,0.12786154],"genre_scores_gemma":[0.08724271,0.0048418352,0.41406888,0.0031397135,0.0017170585,0.00045031318,0.0097628925,0.003236106,0.47554052],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902475,0.00016156632,0.000038704202,0.00027560286,0.00041564537,0.000083727704],"domain_scores_gemma":[0.99867463,0.00042836013,0.000040636634,0.00061603903,0.00020398639,0.000036461755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009844064,0.0014099724,0.0013193237,0.0011863937,0.0008741319,0.0025496932,0.0026597348,0.0015785175,0.0523527],"category_scores_gemma":[0.0033439666,0.0005808679,0.0012841694,0.0015274165,0.00080731703,0.003934572,0.002362501,0.0031030774,0.048432298],"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.0000631122,0.00007077411,0.0002336672,0.0002289668,0.000056026245,0.000053743148,0.00004031511,0.01368073,0.0019237483,0.10045507,0.19760023,0.6855936],"study_design_scores_gemma":[0.000021653204,0.0000526846,0.00051343493,0.00014180363,0.00005716302,0.00041553183,0.00004006474,0.24630047,0.006007253,0.42308897,0.3233159,0.00004508949],"about_ca_topic_score_codex":0.0013814996,"about_ca_topic_score_gemma":0.0023912499,"teacher_disagreement_score":0.0523527,"about_ca_system_score_codex":0.00077062025,"about_ca_system_score_gemma":0.00096531207,"threshold_uncertainty_score":0.17513722},"labels":[],"label_agreement":null},{"id":"W4312852115","doi":"10.1561/9781638280538","title":"Convex Optimization for Machine Learning","year":2022,"lang":"en","type":"book","venue":"","topic":"Machine Learning and Algorithms","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Computer science; Regular polygon; Artificial intelligence; Mathematical optimization; Mathematics; Geometry","score_opus":0.01101386096750196,"score_gpt":0.23232219336453905,"score_spread":0.2213083323970371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312852115","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.001878162,0.13189022,0.61948246,0.015707448,0.010310178,0.00016561236,0.0022368024,0.0025231407,0.21580598],"genre_scores_gemma":[0.086626336,0.20579575,0.39921182,0.014537667,0.026684782,0.0014639559,0.0074526393,0.0036846378,0.25454235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805766,0.0004658973,0.00012354396,0.0004159116,0.00082679436,0.00011023199],"domain_scores_gemma":[0.9982266,0.0011084188,0.00009327735,0.00020068401,0.00030655102,0.00006453743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014782788,0.002111123,0.0018298434,0.001457519,0.0007101071,0.0029828916,0.0015276414,0.0020923493,0.03357513],"category_scores_gemma":[0.0056314003,0.00068098254,0.0014000242,0.0023556936,0.00216026,0.0035279233,0.002043845,0.0064930078,0.019101169],"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.000030732503,0.00003156649,0.00020490788,0.00116807,0.00007908473,0.00012940002,0.00015370824,0.013718592,0.0007266146,0.55273956,0.2537891,0.17722861],"study_design_scores_gemma":[0.000011869134,0.000042039825,0.0003251076,0.00047220665,0.000018573028,0.0002654438,0.00004152283,0.018531788,0.00038074993,0.46810502,0.51177233,0.000033298445],"about_ca_topic_score_codex":0.0013830502,"about_ca_topic_score_gemma":0.0011324763,"teacher_disagreement_score":0.03357513,"about_ca_system_score_codex":0.0017702602,"about_ca_system_score_gemma":0.0014877958,"threshold_uncertainty_score":0.11231995},"labels":[],"label_agreement":null},{"id":"W4312881858","doi":"10.1109/tit.2022.3222231","title":"Almost Optimal Variance-Constrained Best Arm Identification","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"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":"Ministry of Education - Singapore; National Research Foundation Singapore","keywords":"Identification (biology); Computer science; Variance (accounting); Algorithm; Mathematical optimization; Statistics; Mathematics","score_opus":0.0076063456983573785,"score_gpt":0.22817551988501886,"score_spread":0.22056917418666147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312881858","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.03870889,0.00061415776,0.95182025,0.0009617159,0.000067399975,0.00015862132,0.00041782224,0.0017388536,0.005512425],"genre_scores_gemma":[0.6710649,0.00037576465,0.31902263,0.0010618329,0.00016800931,0.0006348868,0.0015982242,0.00067144027,0.0054022945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99211675,0.0035026788,0.0003512396,0.0015313923,0.0015604799,0.00093749457],"domain_scores_gemma":[0.963648,0.025712762,0.002963494,0.0050493246,0.0015587093,0.0010677412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007405807,0.0024027869,0.0034480237,0.0016877635,0.0012887826,0.004063172,0.0038410327,0.0039642695,0.007495093],"category_scores_gemma":[0.05236611,0.0013304062,0.001574445,0.0016234654,0.0023044024,0.004386012,0.0050614104,0.0036648107,0.0026793173],"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.0020495357,0.0003518431,0.0035887826,0.0005568626,0.00025030252,0.00023382214,0.00023252459,0.73224854,0.007089064,0.09826791,0.011300917,0.14382996],"study_design_scores_gemma":[0.00008282292,0.00014848007,0.0003840519,0.000051896575,0.000029126477,0.00009259562,0.00003366209,0.92767286,0.0025005897,0.06806337,0.00090477173,0.000035782094],"about_ca_topic_score_codex":0.0011938848,"about_ca_topic_score_gemma":0.0013837452,"teacher_disagreement_score":0.007495093,"about_ca_system_score_codex":0.0019685528,"about_ca_system_score_gemma":0.0038182505,"threshold_uncertainty_score":0.039166093},"labels":[],"label_agreement":null},{"id":"W4313158210","doi":"10.1007/978-3-031-22695-3_54","title":"Enhancing the Speed of Hierarchical Learning Automata by Ordering the Actions - A Pioneering Approach","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Automaton; Learning automata; Tree (set theory); Hierarchical organization; Artificial intelligence; Theoretical computer science; Action (physics); Machine learning; Algorithm; Mathematics","score_opus":0.013969571760685643,"score_gpt":0.244148616925046,"score_spread":0.23017904516436036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313158210","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.013916019,0.000750495,0.9723532,0.00026600467,0.0002035058,0.00007366324,0.00010253633,0.0042920806,0.0080425],"genre_scores_gemma":[0.33253416,0.0009659598,0.6563255,0.00031618372,0.0001657942,0.00019363023,0.00025348342,0.0007722614,0.008472965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884146,0.00024405318,0.00009000333,0.00032923135,0.0003689897,0.00012622336],"domain_scores_gemma":[0.9937109,0.0036059304,0.00017046517,0.0017114541,0.0006516668,0.00014963729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013347899,0.0011426662,0.0012253416,0.0009270448,0.00069521985,0.0015840598,0.0032809617,0.0014881585,0.008270968],"category_scores_gemma":[0.0080179125,0.0009832263,0.0009929906,0.0012287579,0.0013541747,0.0052320044,0.0019871357,0.0032288805,0.0030120942],"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.0004875405,0.00024523048,0.00071844907,0.00059041026,0.00007193129,0.00006777177,0.00025575838,0.20474458,0.04425265,0.19000804,0.0065512927,0.55200636],"study_design_scores_gemma":[0.00004174034,0.000107722815,0.00011715638,0.000028819391,0.000036646823,0.000049107384,0.000028296954,0.8490347,0.021008654,0.12181538,0.007700725,0.000031076703],"about_ca_topic_score_codex":0.003850027,"about_ca_topic_score_gemma":0.004424566,"teacher_disagreement_score":0.008270968,"about_ca_system_score_codex":0.0013416673,"about_ca_system_score_gemma":0.001583446,"threshold_uncertainty_score":0.027669191},"labels":[],"label_agreement":null},{"id":"W4313171465","doi":"10.1109/cvpr52688.2022.00037","title":"How Much More Data Do I Need? Estimating Requirements for Downstream Tasks","year":2022,"lang":"en","type":"article","venue":"2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Task (project management); Function (biology); Set (abstract data type); Downstream (manufacturing); Data set; Estimator; Data validation; Machine learning; Artificial intelligence; Data mining; Database; Engineering","score_opus":0.09217580612085,"score_gpt":0.33219020574482816,"score_spread":0.24001439962397816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313171465","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.21523595,0.00083314284,0.76788455,0.004697604,0.00012016562,0.00045753512,0.001610648,0.0025225633,0.0066379006],"genre_scores_gemma":[0.48620826,0.00044116634,0.5057552,0.00086816517,0.000112628855,0.00078528177,0.002185433,0.0010998981,0.0025439283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918298,0.0029979495,0.000622032,0.0019485764,0.0021289575,0.00047269376],"domain_scores_gemma":[0.8979675,0.070269465,0.0040241396,0.01757713,0.008281738,0.0018799223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010491185,0.0010962804,0.0015236986,0.0010122128,0.00084614195,0.002886235,0.003011931,0.0027854764,0.0047870683],"category_scores_gemma":[0.1457647,0.001189613,0.001002278,0.001290576,0.0015906987,0.009978307,0.0022725598,0.003110964,0.004533781],"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.0028690842,0.0011906135,0.05934878,0.0013334758,0.00024394774,0.0005159874,0.0014260449,0.1699769,0.0788507,0.021326683,0.014639378,0.64827836],"study_design_scores_gemma":[0.00016605492,0.0009883959,0.034416597,0.00025205,0.00011766817,0.0009345406,0.00096459885,0.82667315,0.06726153,0.055630635,0.012437628,0.00015711781],"about_ca_topic_score_codex":0.003997496,"about_ca_topic_score_gemma":0.0037913762,"teacher_disagreement_score":0.010491185,"about_ca_system_score_codex":0.0010868085,"about_ca_system_score_gemma":0.0023069836,"threshold_uncertainty_score":0.05548334},"labels":[],"label_agreement":null},{"id":"W4313326748","doi":"10.3765/salt.v1i0.5349","title":"Ranges: composite measure phrases, modified numerals, and choice functions","year":2022,"lang":"en","type":"article","venue":"Proceedings from Semantics and Linguistic Theory","topic":"Machine Learning and Algorithms","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 British Columbia","funders":"","keywords":"Range (aeronautics); Singleton; Numeral system; Parameterized complexity; Computer science; Measure (data warehouse); Set (abstract data type); Natural language processing; Mathematics; Interval (graph theory); Scope (computer science); Rubric; Linguistics; Artificial intelligence; Arithmetic; Algorithm; Combinatorics; Data mining; Programming language; Philosophy","score_opus":0.009565006911168187,"score_gpt":0.21944851239736224,"score_spread":0.20988350548619406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313326748","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.067543015,0.0035390884,0.85774744,0.0045971666,0.0003158211,0.000097300195,0.00070364086,0.0011870911,0.06426948],"genre_scores_gemma":[0.83183956,0.0013474604,0.15531611,0.0010927869,0.0006802973,0.00024210158,0.00039238768,0.0008733971,0.008215842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954407,0.0020337985,0.0003497921,0.0008919196,0.0009408203,0.0003429473],"domain_scores_gemma":[0.9925283,0.0048015947,0.0007732807,0.0011029972,0.0005293844,0.00026447483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040763994,0.00089604885,0.0008337589,0.0024274003,0.0022003422,0.007169354,0.0017539056,0.0026928803,0.007849027],"category_scores_gemma":[0.012953145,0.0010103466,0.0012235064,0.0035888383,0.014927685,0.023624375,0.006156842,0.00388678,0.0012616767],"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.000022701082,0.000003985484,0.00023853697,0.000029978748,0.0000055325054,0.00007361178,0.0011125092,0.00032824904,0.00041708726,0.99134225,0.0005171093,0.0059085195],"study_design_scores_gemma":[0.000008077548,0.000010023512,0.00025465054,0.000025503392,0.0000108598315,0.0001778809,0.00040922264,0.0022728746,0.0007977883,0.98626244,0.009744504,0.000026156535],"about_ca_topic_score_codex":0.0012190151,"about_ca_topic_score_gemma":0.00097264635,"teacher_disagreement_score":0.007849027,"about_ca_system_score_codex":0.0017441389,"about_ca_system_score_gemma":0.0006670519,"threshold_uncertainty_score":0.026257634},"labels":[],"label_agreement":null},{"id":"W4315489007","doi":"10.1109/cdc51059.2022.9993165","title":"Near Optimality of Finite Memory Policies for POMPDs with Continuous Spaces","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Queen's University","funders":"National Science Foundation","keywords":"Discretization; Markov decision process; Uncountable set; Convergence (economics); Computer science; State space; Mathematical optimization; Focus (optics); Reduction (mathematics); Applied mathematics; Controllability; Optimal control; Markov process; Stability (learning theory); Filter (signal processing); Mathematics; Discrete mathematics; Mathematical analysis; Machine learning","score_opus":0.016643458648762786,"score_gpt":0.2640921500093241,"score_spread":0.24744869136056133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315489007","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.019591292,0.00016564019,0.97883683,0.00018811226,0.000018458884,0.000029871171,0.00003292661,0.00009439036,0.0010424632],"genre_scores_gemma":[0.8058937,0.00036857635,0.19095409,0.00016012929,0.00005025068,0.00025570195,0.0001415761,0.000094014395,0.002081966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998643,0.0005458604,0.00007266535,0.00027466804,0.00029604306,0.00016778946],"domain_scores_gemma":[0.98595536,0.012272664,0.00072148565,0.00042004738,0.00037604576,0.0002544953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003824004,0.00093085336,0.0014706013,0.00082084595,0.00059344625,0.0012974729,0.0015281251,0.0015623991,0.0018380949],"category_scores_gemma":[0.017945146,0.0007873545,0.0011514297,0.0005426337,0.0024767937,0.0021484075,0.0021042759,0.002663578,0.00016322563],"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.00006816258,0.000034805744,0.00045090975,0.00007767149,0.000028728638,0.00005571498,0.00008477423,0.9375317,0.0005685991,0.054051097,0.00018138923,0.0068663987],"study_design_scores_gemma":[0.0000058128335,0.000015978687,0.00002961842,0.0000075099006,0.0000023478112,0.000004714254,0.000004599593,0.9879562,0.00015660017,0.01174236,0.00007126846,0.0000028321626],"about_ca_topic_score_codex":0.0058947615,"about_ca_topic_score_gemma":0.003141965,"teacher_disagreement_score":0.0058947615,"about_ca_system_score_codex":0.0022145323,"about_ca_system_score_gemma":0.0023425382,"threshold_uncertainty_score":0.020223558},"labels":[],"label_agreement":null},{"id":"W4315489093","doi":"10.1109/cdc51059.2022.9992909","title":"Informative Path Planning in Random Fields via Mixed Integer Programming","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer programming; Mathematical optimization; Integer (computer science); Covariance; Path (computing); Estimator; Mathematics; Linear programming; Set (abstract data type); Quadratic programming; Computer science; Algorithm","score_opus":0.014392491466810452,"score_gpt":0.26333190851462995,"score_spread":0.2489394170478195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315489093","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.0028261468,0.00029191404,0.9948447,0.00030943615,0.00003048339,0.000036503294,0.000058269216,0.00010478661,0.0014977553],"genre_scores_gemma":[0.3057875,0.0010048453,0.68599993,0.0005045923,0.00018812112,0.00067317457,0.00042120123,0.0002551314,0.0051654535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806935,0.0010473115,0.00006639664,0.00027443276,0.00032922262,0.00021335314],"domain_scores_gemma":[0.9937265,0.005291031,0.0004284229,0.00012896297,0.00025170337,0.00017329952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003788406,0.0020712062,0.0021655497,0.001082442,0.0006621955,0.0026417407,0.0019594193,0.0018498148,0.003579942],"category_scores_gemma":[0.007547866,0.0011652707,0.0012628331,0.0019057473,0.0018631287,0.002622945,0.0019303004,0.0033578852,0.0005165349],"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.000036418343,0.000034328117,0.00017103567,0.000055438,0.000019680314,0.00003584248,0.000027744958,0.96319413,0.00020219633,0.025415171,0.0008109065,0.009997062],"study_design_scores_gemma":[0.000007833535,0.000013438681,0.000015696898,0.0000069780226,0.0000032458586,0.00000476163,0.0000044583935,0.98963296,0.00007812857,0.009918059,0.000311114,0.0000033271447],"about_ca_topic_score_codex":0.004349172,"about_ca_topic_score_gemma":0.005208172,"teacher_disagreement_score":0.004349172,"about_ca_system_score_codex":0.002160735,"about_ca_system_score_gemma":0.0021683336,"threshold_uncertainty_score":0.020035267},"labels":[],"label_agreement":null},{"id":"W4315881264","doi":"10.48550/arxiv.2301.04268","title":"Adversarial Online Multi-Task Reinforcement Learning","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Omega; Combinatorics; Sample complexity; Regret; Reinforcement learning; Upper and lower bounds; Lambda; Mathematics; Tilde; Discrete mathematics; Finite set; Artificial intelligence; Computer science; Physics; Statistics","score_opus":0.09278095900279544,"score_gpt":0.21973802605315385,"score_spread":0.12695706705035842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315881264","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.04176081,0.00043475055,0.95073396,0.0012824151,0.00011007899,0.00010240831,0.00025472816,0.00066953973,0.00465126],"genre_scores_gemma":[0.89022124,0.00019005225,0.10280008,0.000464768,0.00012726849,0.00022813206,0.00038117278,0.00009896162,0.005488318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985727,0.00054206414,0.000048125246,0.0004062042,0.00020870075,0.00022219765],"domain_scores_gemma":[0.9948783,0.0034986495,0.00039632985,0.0006171953,0.00023780504,0.0003717324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002343693,0.001395289,0.0019360929,0.00036098147,0.0005578891,0.0010226765,0.0027232468,0.0018104495,0.0031339657],"category_scores_gemma":[0.0087857,0.0005212784,0.00071479223,0.00061888446,0.0016934783,0.0020156875,0.002094523,0.0029571322,0.00053732836],"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.00017649846,0.00009678643,0.00047336842,0.000053334505,0.000036569567,0.0000782436,0.000028492635,0.96409214,0.00040431658,0.023520967,0.0014104184,0.009628837],"study_design_scores_gemma":[0.000013112752,0.000014436702,0.000040199746,0.0000022346155,0.00000256823,0.0000065577424,0.000002216913,0.99009585,0.0001264123,0.009518521,0.00017477102,0.0000030505323],"about_ca_topic_score_codex":0.0045367046,"about_ca_topic_score_gemma":0.004295117,"teacher_disagreement_score":0.0045367046,"about_ca_system_score_codex":0.0016557256,"about_ca_system_score_gemma":0.0015702792,"threshold_uncertainty_score":0.012394786},"labels":[],"label_agreement":null},{"id":"W4320013629","doi":"10.1002/cjs.11762","title":"Distributed sequential estimation procedures","year":2023,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Anhui Province; Ministry of Science and Technology, Taiwan; National Natural Science Foundation of China","keywords":"Computer science; Python (programming language); Data mining; Set (abstract data type); Machine learning; Programming language","score_opus":0.015299232986001747,"score_gpt":0.2543474157911753,"score_spread":0.23904818280517356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320013629","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.0012282158,0.000050343082,0.99749506,0.000094518764,0.000042685708,0.00008306546,0.000075845826,0.0005120065,0.00041828142],"genre_scores_gemma":[0.08817359,0.00016860572,0.9051113,0.00024990513,0.00023916787,0.0008342645,0.0009278826,0.0007180731,0.0035771683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906633,0.004118448,0.0006281686,0.0022311965,0.0018848751,0.0004740829],"domain_scores_gemma":[0.9668168,0.020213641,0.0016336663,0.0054804953,0.0053073694,0.00054797216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012247117,0.0018714571,0.0020892394,0.0020901293,0.0012871154,0.0025178923,0.0048588654,0.0020837171,0.01619468],"category_scores_gemma":[0.057444252,0.0012958328,0.0022908226,0.002279325,0.0019578396,0.0037282454,0.0050663347,0.003862156,0.004326824],"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.00053575414,0.00024729306,0.0051929546,0.00046860197,0.000398529,0.00038055744,0.00048959005,0.38920954,0.0048990226,0.20548196,0.013823625,0.37887254],"study_design_scores_gemma":[0.00007289289,0.000050615912,0.0004017202,0.000046587644,0.000034705557,0.00008901865,0.000041446503,0.90238404,0.002410351,0.089123294,0.0053108297,0.000034515902],"about_ca_topic_score_codex":0.0065422705,"about_ca_topic_score_gemma":0.006736715,"teacher_disagreement_score":0.01619468,"about_ca_system_score_codex":0.0013706812,"about_ca_system_score_gemma":0.004375115,"threshold_uncertainty_score":0.064769685},"labels":[],"label_agreement":null},{"id":"W4321230649","doi":"10.1007/978-3-031-25460-4_39","title":"SLIME: State Learning in the Middle of Everything for Tool-Assisted Vulnerability Detection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Finite-state machine; Artificial intelligence; Machine learning; Automaton; State (computer science); Learning automata; Vulnerability (computing); Implementation; Reliability (semiconductor); Software engineering; Programming language; Computer security","score_opus":0.03277274044482258,"score_gpt":0.26671967468046737,"score_spread":0.23394693423564478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321230649","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.004498093,0.00032494764,0.9510257,0.00027729908,0.00018599056,0.00010932716,0.0009868162,0.039408345,0.0031835397],"genre_scores_gemma":[0.1748314,0.00045837666,0.8081076,0.0004582246,0.00014636049,0.00048723497,0.0045057125,0.0033553042,0.0076496694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987758,0.00028195238,0.00009116045,0.00035371055,0.00037734397,0.000120084864],"domain_scores_gemma":[0.9971712,0.0015070272,0.00017934757,0.0007772085,0.00026385952,0.000101318525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015591965,0.0017220114,0.001330054,0.0013441049,0.00063890545,0.0021093504,0.0033841338,0.0014630306,0.010821873],"category_scores_gemma":[0.0068357675,0.00080729474,0.0016002923,0.0009170339,0.0011390748,0.0043082684,0.004050487,0.003190235,0.004586245],"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.00045419723,0.0003771046,0.0026271155,0.00055444794,0.00016744691,0.00018183817,0.00027575827,0.12521926,0.007915552,0.04221573,0.06363486,0.7563767],"study_design_scores_gemma":[0.00002159129,0.0000685842,0.00022947683,0.000061144325,0.00002519936,0.000070299204,0.00004136727,0.9222223,0.0068100668,0.06121736,0.009203086,0.000029503777],"about_ca_topic_score_codex":0.0022535021,"about_ca_topic_score_gemma":0.0041109426,"teacher_disagreement_score":0.010821873,"about_ca_system_score_codex":0.0007868493,"about_ca_system_score_gemma":0.0017761422,"threshold_uncertainty_score":0.03620279},"labels":[],"label_agreement":null},{"id":"W4321448342","doi":"10.14778/3574245.3574273","title":"On Efficient Approximate Queries over Machine Learning Models","year":2022,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"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 British Columbia","funders":"Agence Nationale de la Recherche","keywords":"Oracle; Computer science; Heuristic; Quality (philosophy); Random oracle; Machine learning; Artificial intelligence; Data mining; Theoretical computer science; Information retrieval; Programming language","score_opus":0.011615232348690043,"score_gpt":0.2104266141063533,"score_spread":0.19881138175766325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321448342","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.029270358,0.0023143203,0.95765233,0.0025569948,0.00011318053,0.00023835585,0.0008361059,0.0039966553,0.003021801],"genre_scores_gemma":[0.424165,0.001155703,0.5612234,0.0019805522,0.00075582485,0.0006720955,0.0044392627,0.0009271111,0.004681053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9835022,0.0077671865,0.0013238045,0.0025087758,0.0038514752,0.0010466704],"domain_scores_gemma":[0.91929406,0.065856285,0.0022001343,0.008974548,0.0027292462,0.00094573357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014166757,0.0032483465,0.005197742,0.0031498382,0.0014625577,0.006029329,0.0055269944,0.0048785093,0.00760768],"category_scores_gemma":[0.087430686,0.0013773928,0.0020794927,0.0064577847,0.0034432262,0.0138972625,0.006789324,0.004908165,0.002594885],"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.0018764415,0.0007223448,0.005279224,0.0007802875,0.00026761187,0.0003497601,0.0007157454,0.55246025,0.0025199524,0.11561373,0.028126653,0.291288],"study_design_scores_gemma":[0.000085578795,0.00008180733,0.00020875019,0.000029840821,0.000026228412,0.00010662923,0.00010512086,0.8998637,0.0008774767,0.097194865,0.0014020901,0.00001778478],"about_ca_topic_score_codex":0.005233924,"about_ca_topic_score_gemma":0.0065595927,"teacher_disagreement_score":0.014166757,"about_ca_system_score_codex":0.0029966985,"about_ca_system_score_gemma":0.0039095744,"threshold_uncertainty_score":0.07492185},"labels":[],"label_agreement":null},{"id":"W4322628680","doi":"10.32614/rj-2023-012","title":"robslopes: Efficient Computation of the (Repeated) Median Slope","year":2023,"lang":"en","type":"article","venue":"The R Journal","topic":"Machine Learning and Algorithms","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":"Toronto Metropolitan University","funders":"","keywords":"Estimator; Computation; Benchmark (surveying); Mathematics; R package; Parametric statistics; Statistics; Set (abstract data type); Algorithm; Computer science; Combinatorics; Geodesy","score_opus":0.011687805497591054,"score_gpt":0.24943032563297962,"score_spread":0.23774252013538857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322628680","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.005361799,0.00036348088,0.95698065,0.00013407598,0.00010027873,0.000109474815,0.001928587,0.033179466,0.0018423197],"genre_scores_gemma":[0.051664207,0.00029225458,0.9260013,0.00015949422,0.0000726724,0.00051860476,0.006566081,0.010221566,0.0045038],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981371,0.00037576078,0.00015476087,0.00043793407,0.0006994261,0.00019497707],"domain_scores_gemma":[0.9969812,0.001356678,0.00023261708,0.0006589275,0.00064371555,0.0001268804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024109408,0.0020902278,0.0018939315,0.002215755,0.0008522004,0.0026487543,0.0036897843,0.0014458086,0.03632086],"category_scores_gemma":[0.018853974,0.0013539328,0.0023062134,0.00258491,0.0007364804,0.002753804,0.003596585,0.0022210884,0.022087691],"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.00084869255,0.00019949565,0.0069504543,0.0014001954,0.0004927127,0.0004979381,0.0006556056,0.09116813,0.01497141,0.027797824,0.14453565,0.71048176],"study_design_scores_gemma":[0.00039879797,0.00021924842,0.0047411327,0.00022817808,0.00012591148,0.0006457654,0.00033868098,0.81743926,0.01790104,0.070684254,0.08707304,0.00020470707],"about_ca_topic_score_codex":0.0071455627,"about_ca_topic_score_gemma":0.013525989,"teacher_disagreement_score":0.03632086,"about_ca_system_score_codex":0.00066496455,"about_ca_system_score_gemma":0.002842999,"threshold_uncertainty_score":0.12150538},"labels":[],"label_agreement":null},{"id":"W4324291633","doi":"10.1109/tse.2023.3256939","title":"New Techniques for Static Symmetry Breaking in Many-Sorted Finite Model Finding","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Software Engineering","topic":"Machine Learning and Algorithms","field":"Computer Science","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 Waterloo; University of British Columbia","funders":"","keywords":"Computer science; Symmetry breaking; Correctness; Theoretical computer science; sort; Symmetry (geometry); Context (archaeology); Inference; Algorithm; Mathematics; Artificial intelligence; Physics","score_opus":0.017929932504266763,"score_gpt":0.26386151031678046,"score_spread":0.24593157781251368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324291633","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.006753418,0.000099835794,0.9895927,0.00033363508,0.000057119614,0.00011723013,0.00006412119,0.0013428329,0.0016391269],"genre_scores_gemma":[0.15573482,0.000156939,0.8412503,0.00034470568,0.00007149791,0.00018280331,0.00027066428,0.0007147834,0.0012734738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.988915,0.0035677732,0.0011797182,0.0013577132,0.0040930356,0.0008867061],"domain_scores_gemma":[0.9704775,0.012385427,0.0017614812,0.012667615,0.002363222,0.00034473476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011598608,0.0014914925,0.0014533533,0.0026320019,0.0022719426,0.0050337748,0.005810152,0.0021560602,0.00610001],"category_scores_gemma":[0.041742943,0.0012953923,0.004307939,0.0027853705,0.006348185,0.012229588,0.009502246,0.0077649807,0.0012760814],"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.00028460906,0.0002586282,0.0027117976,0.00043754236,0.00017915668,0.00024840195,0.00094949204,0.06777975,0.0128617175,0.68781054,0.003480092,0.22299829],"study_design_scores_gemma":[0.00010449035,0.0001566302,0.00031240756,0.00012532016,0.00014192579,0.00030551426,0.00030810034,0.29322386,0.03160539,0.6632533,0.010364449,0.00009854943],"about_ca_topic_score_codex":0.0022098823,"about_ca_topic_score_gemma":0.0038076346,"teacher_disagreement_score":0.011598608,"about_ca_system_score_codex":0.0031953766,"about_ca_system_score_gemma":0.0058022845,"threshold_uncertainty_score":0.061339974},"labels":[],"label_agreement":null},{"id":"W4352976823","doi":"10.1007/978-3-031-28719-0_23","title":"Efficient Search of Active Inference Policy Spaces Using k-Means","year":2023,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Tree traversal; Embedding; Computer science; Inference; Cluster analysis; Graph traversal; Selection (genetic algorithm); Sample (material); Graph; Space (punctuation); Point (geometry); Space policy; Vector space; Theoretical computer science; Data mining; Machine learning; Artificial intelligence; Mathematics; Algorithm","score_opus":0.06879035466039136,"score_gpt":0.36479731378653923,"score_spread":0.2960069591261479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4352976823","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.002475252,0.00024681908,0.9953107,0.00009657622,0.00004838014,0.00002276467,0.000032753316,0.00053354073,0.0012331331],"genre_scores_gemma":[0.15887189,0.00030765092,0.83338445,0.00020297499,0.00013459782,0.00023269598,0.00033228932,0.00046988935,0.0060634855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887794,0.0004317945,0.00007460074,0.00024147233,0.0002633186,0.00011097874],"domain_scores_gemma":[0.9942532,0.004563998,0.0001929856,0.00038921568,0.00047012398,0.00013048474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024499658,0.0013744045,0.002750157,0.001199798,0.0012781164,0.0022576614,0.0039628274,0.003144133,0.006533252],"category_scores_gemma":[0.010090158,0.0019897523,0.0017138043,0.0014291981,0.0018571066,0.00327695,0.0030757294,0.004456103,0.0019691929],"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.00029353888,0.00015051363,0.00036021892,0.0002100272,0.00014345603,0.000073473515,0.00017218139,0.71347445,0.0019370314,0.043413308,0.006356153,0.23341565],"study_design_scores_gemma":[0.000010934666,0.0000114731865,0.000017922,0.000008314705,0.0000056780036,0.000010027286,0.000007362979,0.9886439,0.00038417138,0.0105073005,0.00038785653,0.000005079896],"about_ca_topic_score_codex":0.0073648286,"about_ca_topic_score_gemma":0.00888786,"teacher_disagreement_score":0.0073648286,"about_ca_system_score_codex":0.0011797481,"about_ca_system_score_gemma":0.0020953584,"threshold_uncertainty_score":0.02185595},"labels":[],"label_agreement":null},{"id":"W4360866164","doi":"10.3389/frai.2023.1029943","title":"Active feature elicitation: An unified framework","year":2023,"lang":"en","type":"article","venue":"Frontiers in Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","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 Alberta","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development; University of Texas at Dallas","keywords":"Computer science; Classifier (UML); Generalization; Set (abstract data type); Artificial intelligence; Metric (unit); Feature (linguistics); Machine learning; Data mining; Information retrieval; Mathematics","score_opus":0.03266707401550995,"score_gpt":0.318367653870833,"score_spread":0.28570057985532304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360866164","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.0009413193,0.00028495272,0.9976993,0.00025805004,0.00001693902,0.00007174482,0.000037255417,0.000089282505,0.0006011639],"genre_scores_gemma":[0.17667483,0.0008556256,0.81703377,0.00056262955,0.00037018233,0.00083552604,0.00044832597,0.00016016189,0.0030590575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98610616,0.0072135357,0.00078554923,0.0021349369,0.0031900345,0.0005697602],"domain_scores_gemma":[0.9690738,0.022301916,0.0015365029,0.0027522913,0.0034391899,0.0008963278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020854633,0.002143444,0.0034413897,0.004018247,0.001264678,0.0057362947,0.007537122,0.005424311,0.0041376916],"category_scores_gemma":[0.039087094,0.001471528,0.0024978088,0.003303298,0.0037375537,0.009835293,0.0081038885,0.005143428,0.0012968341],"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.00036504495,0.00059526175,0.0020941747,0.0009877824,0.00034854,0.00044452012,0.0011481738,0.29145658,0.004730904,0.3991975,0.0059552155,0.29267636],"study_design_scores_gemma":[0.000035200166,0.00010995233,0.00017033097,0.00006619232,0.000041373572,0.00010243496,0.0000797956,0.86524445,0.0009603631,0.1295955,0.0035596574,0.000034828452],"about_ca_topic_score_codex":0.0022477456,"about_ca_topic_score_gemma":0.0020095855,"teacher_disagreement_score":0.020854633,"about_ca_system_score_codex":0.002324737,"about_ca_system_score_gemma":0.0030526489,"threshold_uncertainty_score":0.11029118},"labels":[],"label_agreement":null},{"id":"W4360978592","doi":"10.1007/s10878-023-00998-8","title":"A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Uniqueness; Theory of computation; Minimum weight; Linear programming; Matching (statistics); Algorithm; Mathematics; Computer science; Enhanced Data Rates for GSM Evolution; Cover (algebra); Combinatorics; Mathematical optimization; Artificial intelligence","score_opus":0.008549360243585968,"score_gpt":0.2621156453445673,"score_spread":0.25356628510098134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360978592","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.00047243736,0.0014426633,0.9810823,0.00046176344,0.00030534645,0.00011475986,0.00025074513,0.00051562925,0.015354335],"genre_scores_gemma":[0.024360575,0.004396735,0.9542433,0.00064136006,0.0005871542,0.00042007846,0.0006118719,0.0005682664,0.014170552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987941,0.00031902507,0.00009005143,0.00023800154,0.00046030345,0.00009852408],"domain_scores_gemma":[0.99937624,0.00030346366,0.000041972922,0.00012982366,0.00012103642,0.00002749094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010298422,0.0012579155,0.0014708128,0.0015421214,0.0007937454,0.0025015573,0.0033713693,0.001999886,0.02742235],"category_scores_gemma":[0.004093517,0.0011664862,0.0017017841,0.003466557,0.0008937739,0.0038042143,0.0025251363,0.0047751092,0.012610067],"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.00006885862,0.00025204787,0.00023382487,0.00068543805,0.000078412704,0.00012490548,0.00007838153,0.097900495,0.005081267,0.4561733,0.037464023,0.40185907],"study_design_scores_gemma":[0.00003549569,0.000104628634,0.00027125535,0.00016380889,0.000031292377,0.00041402862,0.000032336917,0.34963116,0.0032958016,0.5247615,0.12117792,0.00008074711],"about_ca_topic_score_codex":0.0013666905,"about_ca_topic_score_gemma":0.0016763046,"teacher_disagreement_score":0.02742235,"about_ca_system_score_codex":0.0013008738,"about_ca_system_score_gemma":0.0016086189,"threshold_uncertainty_score":0.09173685},"labels":[],"label_agreement":null},{"id":"W4361866068","doi":"10.4230/lipics.icalp.2023.42","title":"Online Learning and Disambiguations of Partial Concept Classes","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Learnability; Class (philosophy); Extension (predicate logic); Computer science; Mathematics; Theoretical computer science; Artificial intelligence; Discrete mathematics; Programming language","score_opus":0.07790816076508807,"score_gpt":0.23340054663045787,"score_spread":0.1554923858653698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361866068","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.097350925,0.0019844938,0.89223063,0.0014954893,0.00017466725,0.00016334916,0.00076459115,0.00061006966,0.005225745],"genre_scores_gemma":[0.75015813,0.00080601795,0.24207403,0.00066263013,0.00032946697,0.00032277944,0.0017107793,0.00016499517,0.003771204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99473476,0.0014074291,0.00031282345,0.0020957203,0.0011549213,0.0002943888],"domain_scores_gemma":[0.9861864,0.00933701,0.0008306853,0.0022874498,0.0008529669,0.00050553726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052119237,0.0010686493,0.0020502566,0.0025470885,0.0015000656,0.0025416103,0.0028762193,0.0013822162,0.0034711163],"category_scores_gemma":[0.025928214,0.0009088269,0.0022114706,0.0026292645,0.0043144687,0.011317056,0.0054511772,0.004059644,0.0004484772],"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.0006238742,0.00028991562,0.008123293,0.0007365915,0.00041174283,0.00029913307,0.0013021276,0.067650504,0.0032511693,0.4787577,0.008361044,0.43019286],"study_design_scores_gemma":[0.000051675725,0.00010627922,0.0012343948,0.00008969004,0.00008683983,0.0002410247,0.00017077883,0.24437845,0.0023701114,0.7442271,0.0069934926,0.000050128692],"about_ca_topic_score_codex":0.0016034447,"about_ca_topic_score_gemma":0.0017560283,"teacher_disagreement_score":0.0052119237,"about_ca_system_score_codex":0.001664406,"about_ca_system_score_gemma":0.0013638898,"threshold_uncertainty_score":0.027563572},"labels":[],"label_agreement":null},{"id":"W4376864979","doi":"10.4230/lipics.itcs.2024.15","title":"Testing and Learning Convex Sets in the Ternary Hypercube","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Staatssekretariat für Bildung, Forschung und Innovation; Natural Sciences and Engineering Research Council of Canada; University of Waterloo; National Science Foundation","keywords":"Combinatorics; Upper and lower bounds; Regular polygon; Convexity; Mathematics; Hypercube; Property testing; Boundary (topology); Omega; Domain (mathematical analysis); Convex hull; Convex set; Discrete mathematics; Ternary operation; Convex optimization; Computer science; Mathematical analysis; Physics","score_opus":0.10333685719290182,"score_gpt":0.2072765697097603,"score_spread":0.10393971251685848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376864979","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.18645535,0.001166178,0.79876894,0.003102249,0.0000813033,0.00016183332,0.00048182858,0.00041092766,0.009371385],"genre_scores_gemma":[0.8358993,0.000841167,0.1574168,0.0005129178,0.00026938156,0.00038337611,0.0010311484,0.00016544112,0.0034805539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930038,0.0030994068,0.0003055751,0.0011026657,0.0018946131,0.00059406314],"domain_scores_gemma":[0.93548673,0.055292524,0.0029856665,0.0029132206,0.0020876653,0.0012341754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050081452,0.0014556964,0.002423707,0.0012951604,0.00088020065,0.003116765,0.0028158287,0.001924547,0.0039933342],"category_scores_gemma":[0.054984894,0.0007218792,0.001683388,0.0020392148,0.0050386395,0.0066068186,0.004129414,0.0043271426,0.0007205156],"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.0006294078,0.00019893124,0.0043957476,0.0003122839,0.00011025512,0.00031828543,0.0002742017,0.7949897,0.0020250909,0.14416958,0.0020245116,0.050552044],"study_design_scores_gemma":[0.000023759147,0.000047174024,0.00039879422,0.000015849191,0.000006831165,0.000044719647,0.000042133637,0.90718645,0.0011987725,0.09064932,0.0003769426,0.000009380392],"about_ca_topic_score_codex":0.0029682398,"about_ca_topic_score_gemma":0.0014267117,"teacher_disagreement_score":0.0050081452,"about_ca_system_score_codex":0.0029980938,"about_ca_system_score_gemma":0.0014379916,"threshold_uncertainty_score":0.02648592},"labels":[],"label_agreement":null},{"id":"W4377030644","doi":"10.1016/j.knosys.2023.110616","title":"Label shift conditioned hybrid querying for deep active learning","year":2023,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Generalization; Artificial intelligence; Matching (statistics); Machine learning; Class (philosophy); Active learning (machine learning); Deep learning; Baseline (sea); Mathematics","score_opus":0.024187131899840727,"score_gpt":0.292427379954212,"score_spread":0.26824024805437124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377030644","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.019170757,0.0003668275,0.9760873,0.00040838742,0.000100639736,0.00007493246,0.00034173665,0.0020363268,0.0014131397],"genre_scores_gemma":[0.6666866,0.00029414296,0.3217743,0.0006189732,0.0002512581,0.00024902835,0.0015619334,0.0006378482,0.007925952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787104,0.0005524769,0.00012460913,0.0004904093,0.00073744904,0.00022397538],"domain_scores_gemma":[0.99356246,0.00323965,0.00023442837,0.001566641,0.0011291422,0.0002677708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031327861,0.00092241657,0.001936915,0.0013601624,0.00090182474,0.00352512,0.0048342985,0.0027766966,0.0067082336],"category_scores_gemma":[0.011252568,0.0006130677,0.0008512804,0.0017528589,0.0015418057,0.007532251,0.0051348223,0.0041481187,0.0015813562],"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.0018936406,0.0011673082,0.00278756,0.00035214354,0.00015932288,0.00018228713,0.00051404553,0.1206871,0.028573284,0.09614849,0.014419774,0.733115],"study_design_scores_gemma":[0.00003288464,0.00006110983,0.00013973846,0.0000149119305,0.000015748215,0.000032444077,0.000050048682,0.93805873,0.007317915,0.05281334,0.0014473023,0.00001588592],"about_ca_topic_score_codex":0.0038306182,"about_ca_topic_score_gemma":0.0063903276,"teacher_disagreement_score":0.0067082336,"about_ca_system_score_codex":0.0013385186,"about_ca_system_score_gemma":0.0014360407,"threshold_uncertainty_score":0.022441268},"labels":[],"label_agreement":null},{"id":"W4377249682","doi":"10.1007/978-3-031-33271-5_25","title":"Boolean-Arithmetic Equations: Acquisition and Uses","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Boolean function; Computer science; Boolean data type; Simple (philosophy); Commutative property; Function (biology); Arithmetic; Boolean expression; Exclusive or; Discrete mathematics; Truth table; Mathematics; Algorithm; Logic gate","score_opus":0.019081374602415373,"score_gpt":0.2610932912542653,"score_spread":0.2420119166518499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377249682","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054380145,0.03811694,0.4154137,0.0063194185,0.00072473293,0.0001169257,0.0008844873,0.000949262,0.4830943],"genre_scores_gemma":[0.6078616,0.03154232,0.2501439,0.0012901624,0.0014070619,0.00016721891,0.0013309622,0.00052844797,0.1057284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994609,0.0001470577,0.000054372806,0.00013440494,0.00016596352,0.000037327496],"domain_scores_gemma":[0.9977569,0.0016070806,0.00009593576,0.00025262884,0.00024529005,0.000042181488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089132885,0.0006339732,0.0004990615,0.0014375452,0.00068967167,0.0028764713,0.0012337497,0.00070873904,0.014516712],"category_scores_gemma":[0.006447388,0.00064489373,0.00068354374,0.0017961371,0.003259974,0.008299318,0.001386089,0.00330534,0.0031620823],"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.000017909362,0.000019447622,0.000281509,0.00013496932,0.0000047218173,0.000050597566,0.000430401,0.00044924818,0.0005585226,0.8985325,0.0050729304,0.094447225],"study_design_scores_gemma":[0.000007861839,0.000009289377,0.00035664148,0.000087695065,0.00000784545,0.00023509095,0.000108551474,0.0029451533,0.00094680506,0.9579289,0.037354816,0.000011387434],"about_ca_topic_score_codex":0.00076269824,"about_ca_topic_score_gemma":0.0010608622,"teacher_disagreement_score":0.014516712,"about_ca_system_score_codex":0.0010068959,"about_ca_system_score_gemma":0.00079144136,"threshold_uncertainty_score":0.048563242},"labels":[],"label_agreement":null},{"id":"W4379511143","doi":"10.21428/594757db.5ed119cc","title":"Learning to Recognize Reachable States from Visual Domains","year":2023,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Vector Institute","keywords":"Computer science; Noise (video); Hidden Markov model; Viterbi algorithm; Artificial intelligence; State (computer science); Algorithm; Space (punctuation); Property (philosophy); Machine learning; Image (mathematics)","score_opus":0.010177243373683698,"score_gpt":0.27606040004595594,"score_spread":0.26588315667227225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379511143","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.14628042,0.00046464478,0.8411277,0.00047909847,0.000059095386,0.0001506981,0.001389131,0.007424691,0.0026244684],"genre_scores_gemma":[0.7784746,0.00021966833,0.21699816,0.00012493596,0.000022936116,0.00018271946,0.00246672,0.00028586795,0.0012243894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946195,0.00013146587,0.00002245753,0.0002517081,0.00006837116,0.00006405357],"domain_scores_gemma":[0.99729,0.0018338716,0.00024488178,0.00034090545,0.00018876386,0.000101574995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006859125,0.0012372914,0.00073950354,0.0012725762,0.00038142587,0.0011764169,0.0014063328,0.0011752095,0.0022910642],"category_scores_gemma":[0.00650235,0.0008415964,0.0013102394,0.00070662575,0.0011277889,0.002230511,0.0014547623,0.0020587798,0.0006846928],"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.00026731455,0.00017918843,0.006170145,0.00024246133,0.00008842665,0.00020847366,0.00031285037,0.804876,0.0065995688,0.010408997,0.003391216,0.16725539],"study_design_scores_gemma":[0.000009918931,0.000030770745,0.0004250301,0.00001957546,0.0000068022323,0.000020668433,0.000043965218,0.98191833,0.0026111046,0.014461204,0.0004435181,0.000009086018],"about_ca_topic_score_codex":0.011037394,"about_ca_topic_score_gemma":0.017274909,"teacher_disagreement_score":0.011037394,"about_ca_system_score_codex":0.0012331178,"about_ca_system_score_gemma":0.001283729,"threshold_uncertainty_score":0.021946311},"labels":[],"label_agreement":null},{"id":"W4380991670","doi":"10.1007/978-3-030-96729-1_10","title":"Cybernetics, Machine Learning, and Stochastic Learning Automata","year":2023,"lang":"en","type":"book-chapter","venue":"Springer handbooks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Cybernetics; Learning automata; Computer science; Automaton; Probabilistic automaton; Artificial intelligence; Finite-state machine; Machine learning; Probabilistic logic; Online machine learning; Estimator; Action (physics); Theoretical computer science; Active learning (machine learning); Algorithm; Mathematics","score_opus":0.013881411402393377,"score_gpt":0.2295798460704437,"score_spread":0.21569843466805033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380991670","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005322718,0.3469608,0.22657508,0.0076050414,0.0065631457,0.000058398822,0.0010930864,0.0010400773,0.40478167],"genre_scores_gemma":[0.14276738,0.2946129,0.11389757,0.0031986302,0.011169508,0.00042763946,0.0020858434,0.00077256624,0.43106794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997985,0.000041598534,0.000011524867,0.000045784138,0.000090003254,0.000012604131],"domain_scores_gemma":[0.9994824,0.0003566499,0.00002969078,0.000056627625,0.000053919302,0.000020660484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025984482,0.0011661957,0.0012045807,0.0015185933,0.00043758962,0.0025843054,0.0007485086,0.0010389923,0.02180025],"category_scores_gemma":[0.0011494401,0.00038782146,0.0004405842,0.0027253896,0.0015393976,0.0027952085,0.0006839702,0.0024621284,0.0062691714],"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.000013245724,0.00004038468,0.0001916994,0.0005174356,0.000025181434,0.000063939624,0.00008983014,0.0075124637,0.00069434184,0.74257916,0.10823305,0.14003928],"study_design_scores_gemma":[0.0000045383176,0.000015355039,0.0003477224,0.00015876908,0.000010516161,0.00017016874,0.000047299287,0.011212388,0.00024563938,0.72510403,0.2626671,0.000016426755],"about_ca_topic_score_codex":0.001306388,"about_ca_topic_score_gemma":0.0019919,"teacher_disagreement_score":0.02180025,"about_ca_system_score_codex":0.0008761395,"about_ca_system_score_gemma":0.0007004157,"threshold_uncertainty_score":0.072929084},"labels":[],"label_agreement":null},{"id":"W4381713181","doi":"10.48550/arxiv.2306.11951","title":"On the Optimal Bounds for Noisy Computing","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Instituto de Ciencias del Mar y Limnología, Universidad Nacional Autónoma de México; Natural Sciences and Engineering Research Council of Canada; University of Cambridge; National Science Foundation","keywords":"Upper and lower bounds; Matching (statistics); Mathematics; Bounded function; Function (biology); Constant (computer programming); sort; Pairwise comparison; Combinatorics; Computer science; Discrete mathematics; Statistics","score_opus":0.09702384811491163,"score_gpt":0.21361329543662247,"score_spread":0.11658944732171084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381713181","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.018603638,0.021665465,0.89697856,0.017262736,0.0011493429,0.00033569123,0.0012366013,0.002304185,0.040463727],"genre_scores_gemma":[0.4595001,0.019102804,0.47283193,0.013337892,0.0067895274,0.0026802442,0.0032860294,0.005431857,0.017039511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.94927347,0.017152365,0.0026866212,0.009688568,0.014691377,0.006507612],"domain_scores_gemma":[0.71568674,0.23026694,0.005699216,0.0358305,0.009340898,0.0031756796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.030999018,0.0074897637,0.008302894,0.0062240376,0.006210523,0.013315692,0.013027772,0.007646901,0.016291738],"category_scores_gemma":[0.20937823,0.0041024922,0.005689674,0.010893734,0.013587671,0.059769742,0.02054018,0.02637151,0.0065885577],"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.0019549371,0.0006504579,0.0025135041,0.0012731785,0.00031798802,0.00027830992,0.00088924106,0.1529536,0.003339205,0.67788625,0.035348494,0.12259485],"study_design_scores_gemma":[0.000093843206,0.00010194892,0.00039021243,0.00028471075,0.00012602551,0.00014439349,0.0001245601,0.2142783,0.0018375815,0.7749161,0.0076193935,0.00008295388],"about_ca_topic_score_codex":0.0055539557,"about_ca_topic_score_gemma":0.004908612,"teacher_disagreement_score":0.030999018,"about_ca_system_score_codex":0.012290137,"about_ca_system_score_gemma":0.007844035,"threshold_uncertainty_score":0.16394043},"labels":[],"label_agreement":null},{"id":"W4382063067","doi":"10.3390/math11132819","title":"Active Learning: Encoder-Decoder-Outlayer and Vector Space Diversification Sampling","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Machine Learning and Algorithms","field":"Computer Science","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 Toronto","funders":"","keywords":"Computer science; Pipeline (software); Encoder; Sampling (signal processing); Flexibility (engineering); Machine learning; Diversification (marketing strategy); Artificial intelligence; Sample (material); Computer engineering; Data mining; Mathematics; Computer vision","score_opus":0.03790433557480861,"score_gpt":0.2852573740978525,"score_spread":0.2473530385230439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382063067","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.005751184,0.00019114249,0.99142635,0.00012697656,0.000045183144,0.000084072264,0.00005185616,0.0014085834,0.0009146124],"genre_scores_gemma":[0.30667582,0.00029909765,0.6840968,0.00049875217,0.0001500024,0.00060378027,0.00082516595,0.0004850248,0.0063655614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985085,0.00059752556,0.00007616213,0.00037253735,0.00030267955,0.00014247699],"domain_scores_gemma":[0.99744666,0.0013376885,0.00011513288,0.0004933508,0.00045644722,0.00015075922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002731393,0.0016623994,0.001387674,0.00082309585,0.00065595633,0.00163086,0.003160847,0.001880023,0.004403513],"category_scores_gemma":[0.00947374,0.00088378956,0.0007486566,0.00086702756,0.0011709789,0.0027100735,0.0030957784,0.0028663136,0.001784112],"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.0007206014,0.00032997824,0.002481626,0.00019046965,0.000118841584,0.00019305277,0.00031431124,0.2808838,0.010512041,0.046227053,0.008676102,0.6493521],"study_design_scores_gemma":[0.000033025535,0.00007004413,0.00009272085,0.00001062731,0.000010986806,0.0000482427,0.000015589272,0.98434836,0.0035837686,0.010294427,0.0014809561,0.000011216266],"about_ca_topic_score_codex":0.0041570277,"about_ca_topic_score_gemma":0.006176422,"teacher_disagreement_score":0.004403513,"about_ca_system_score_codex":0.0008993093,"about_ca_system_score_gemma":0.0021100643,"threshold_uncertainty_score":0.014731169},"labels":[],"label_agreement":null},{"id":"W4382239954","doi":"10.1609/aaai.v37i5.25757","title":"Better Peer Grading through Bayesian Inference","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; Alberta Machine Intelligence Institute; Compute Canada; Defense Advanced Research Projects Agency; University of British Columbia; Canadian Institute for Advanced Research","keywords":"Grading (engineering); Computer science; Inference; Interpretability; Rubric; Robustness (evolution); Machine learning; Bayesian probability; Probabilistic logic; Bayesian inference; Artificial intelligence; Mathematics; Mathematics education","score_opus":0.07531137878603723,"score_gpt":0.3286441539662129,"score_spread":0.25333277518017566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239954","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.07000143,0.0004583084,0.9177708,0.0016592502,0.00011826944,0.00018581976,0.00035913775,0.0024932192,0.00695367],"genre_scores_gemma":[0.7929531,0.0002443527,0.20019515,0.00034583022,0.00016391787,0.0001625824,0.0005341604,0.00030137354,0.005099591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9860292,0.007815825,0.00061850494,0.0021637534,0.00292386,0.00044883275],"domain_scores_gemma":[0.97069585,0.017608764,0.0024762952,0.0045156614,0.004167813,0.00053553615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016340489,0.0011189326,0.0019114371,0.0024728396,0.0013065595,0.0041951463,0.0024029491,0.001909368,0.003969164],"category_scores_gemma":[0.07992797,0.0007547569,0.0008858821,0.0018281578,0.00090447906,0.0063576126,0.0025857855,0.0028331508,0.0016199943],"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.00039749025,0.00047136805,0.017276846,0.00021678845,0.00032792083,0.00016599616,0.0013155852,0.5361344,0.0024785008,0.060130216,0.011541665,0.36954316],"study_design_scores_gemma":[0.000036032776,0.00004392243,0.0017604588,0.000019757612,0.00003076083,0.000026346484,0.00008436505,0.94409096,0.0009885399,0.05059536,0.0022885173,0.000035100333],"about_ca_topic_score_codex":0.012775908,"about_ca_topic_score_gemma":0.012688613,"teacher_disagreement_score":0.016340489,"about_ca_system_score_codex":0.0022543676,"about_ca_system_score_gemma":0.00209155,"threshold_uncertainty_score":0.086417854},"labels":[],"label_agreement":null},{"id":"W4383047243","doi":"10.48550/arxiv.2306.17693","title":"Thompson sampling for improved exploration in GFlowNets","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Samsung; Genentech; Canadian Institute for Advanced Research","keywords":"Thompson sampling; Computer science; Flexibility (engineering); Sampling (signal processing); Mathematical optimization; Importance sampling; Convergence (economics); Inference; Machine learning; Generative grammar; Artificial intelligence; Posterior probability; Bayesian probability; Algorithm; Mathematics; Monte Carlo method; Statistics","score_opus":0.1928492168762235,"score_gpt":0.2401838458746142,"score_spread":0.04733462899839069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383047243","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.038710512,0.00032108335,0.9566578,0.00039434346,0.00005210864,0.00007315548,0.000108592656,0.00086166384,0.0028208338],"genre_scores_gemma":[0.68435955,0.0002391041,0.30894604,0.0005076518,0.00006346849,0.00041432856,0.0005617658,0.0005295721,0.0043784697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907,0.00040741,0.00004435269,0.00018434822,0.00016156516,0.00013231246],"domain_scores_gemma":[0.9954875,0.0034484915,0.0001970345,0.00037396429,0.0002958092,0.00019723529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026527517,0.0010708505,0.0014928763,0.0009622758,0.0009197495,0.0011924658,0.0023453583,0.0018336707,0.003738392],"category_scores_gemma":[0.013848454,0.0008019361,0.00088817766,0.00071313104,0.0018814183,0.0026560489,0.0023883146,0.0020810934,0.00061093114],"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.00019687477,0.00007907166,0.0018616384,0.00008471734,0.000045299417,0.00011594593,0.0002019021,0.8790732,0.0012996983,0.054279815,0.0020015035,0.060760397],"study_design_scores_gemma":[0.000010954094,0.00001570347,0.00004507277,0.000009463555,0.0000034678185,0.000009722528,0.000007733673,0.97922236,0.0002521112,0.020114953,0.00030474836,0.000003730762],"about_ca_topic_score_codex":0.008486419,"about_ca_topic_score_gemma":0.013412074,"teacher_disagreement_score":0.008486419,"about_ca_system_score_codex":0.0017068133,"about_ca_system_score_gemma":0.0019961018,"threshold_uncertainty_score":0.016874075},"labels":[],"label_agreement":null},{"id":"W4383174182","doi":"10.48550/arxiv.2307.00504","title":"On efficient computation in active inference","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"Engineering and Physical Sciences Research Council; Medical Research Council; Canadian Institute for Advanced Research","keywords":"Computer science; Inference; Computation; Process (computing); Grid; Task (project management); Artificial intelligence; Reinforcement learning; State (computer science); Dynamic programming; Mathematical optimization; Computational complexity theory; Machine learning; Algorithm; Mathematics","score_opus":0.07750341264697344,"score_gpt":0.22632585820207746,"score_spread":0.14882244555510402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383174182","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.0020744607,0.00020163557,0.9948026,0.0002459489,0.000028257495,0.000025644107,0.000030000188,0.00020078722,0.0023906596],"genre_scores_gemma":[0.24729508,0.00058603764,0.74644387,0.00035822584,0.00012659663,0.0004461859,0.00023856513,0.00027390977,0.004231508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998789,0.00051395665,0.00006807946,0.00022687095,0.00029124084,0.000110814246],"domain_scores_gemma":[0.99370676,0.005113498,0.00022010505,0.00052812183,0.00032529354,0.000106275074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028451262,0.0011661969,0.0013235763,0.0010241303,0.0010113419,0.0017750164,0.0025677374,0.0015615766,0.004705817],"category_scores_gemma":[0.01150317,0.0007511034,0.0010555609,0.0014443534,0.0024533186,0.0034341116,0.0029387162,0.002932589,0.0009393615],"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.00014586597,0.000061667895,0.00043237954,0.00013463445,0.00005115238,0.00008806081,0.00012048084,0.61651915,0.0012321682,0.29288942,0.0019677735,0.08635722],"study_design_scores_gemma":[0.000015242151,0.000012302981,0.00003796165,0.0000116296815,0.0000059564354,0.000009447239,0.0000075169837,0.8789357,0.00037943065,0.119618125,0.00096121966,0.0000054916554],"about_ca_topic_score_codex":0.0061953445,"about_ca_topic_score_gemma":0.00745657,"teacher_disagreement_score":0.0061953445,"about_ca_system_score_codex":0.0016806728,"about_ca_system_score_gemma":0.0019614524,"threshold_uncertainty_score":0.01574254},"labels":[],"label_agreement":null},{"id":"W4383604771","doi":"10.48550/arxiv.2307.02744","title":"Active Learning with Contrastive Pre-training for Facial Expression Recognition","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mitacs","keywords":"Computer science; Context (archaeology); Artificial intelligence; Set (abstract data type); Machine learning; Active learning (machine learning); Baseline (sea); Code (set theory); Labelling; Labeled data; Deep learning; Test set; Training set; Source code; Natural language processing; Psychology","score_opus":0.11412709709786092,"score_gpt":0.22194629957588263,"score_spread":0.10781920247802171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383604771","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.02783837,0.0010615047,0.9616883,0.00048194383,0.00015503749,0.00013901289,0.00026207595,0.0045514633,0.0038223246],"genre_scores_gemma":[0.4636654,0.00071671704,0.5226139,0.0010053802,0.00017987839,0.00048092598,0.0021573873,0.0005837216,0.008596713],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986545,0.00048965996,0.000053462067,0.00033452437,0.00031853456,0.00014931393],"domain_scores_gemma":[0.99747247,0.0015146865,0.00013468078,0.00045529602,0.00034364077,0.00007917158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029674682,0.0013951475,0.0010493002,0.0010414926,0.00042407025,0.0010654472,0.00297334,0.0016266683,0.0032398012],"category_scores_gemma":[0.0066832905,0.0006452177,0.0012025716,0.00073854893,0.0011385822,0.001947568,0.0014419786,0.0033290677,0.002173613],"study_design_candidate":"bench_or_experimental","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.00061326585,0.0006612072,0.0020111424,0.00022775434,0.0001669133,0.00009217275,0.00018560972,0.18523844,0.024862932,0.0073340973,0.011677062,0.7669294],"study_design_scores_gemma":[0.000024243976,0.000113368325,0.00046730845,0.000027333728,0.000017940705,0.000056759924,0.000020575793,0.9754014,0.015854022,0.0051181903,0.0028822662,0.000016651475],"about_ca_topic_score_codex":0.0029708066,"about_ca_topic_score_gemma":0.005637151,"teacher_disagreement_score":0.0032398012,"about_ca_system_score_codex":0.0010306677,"about_ca_system_score_gemma":0.00074258714,"threshold_uncertainty_score":0.015693605},"labels":[],"label_agreement":null},{"id":"W4385284395","doi":"10.1109/icde55515.2023.00346","title":"Looking Back on the Past: Active Learning with Historical Evaluation Results : Extended Abstract","year":2023,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Université de Montréal","funders":"","keywords":"Computer science; Heuristic; Set (abstract data type); Sequence (biology); Artificial intelligence; Machine learning; Active learning (machine learning); Data mining","score_opus":0.03484767331263514,"score_gpt":0.28460704071223863,"score_spread":0.2497593673996035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385284395","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.05911393,0.0021978242,0.9332661,0.0008854893,0.00015020055,0.00018895688,0.0002470569,0.0017027672,0.0022476537],"genre_scores_gemma":[0.7929785,0.0005696462,0.20179425,0.00042414948,0.0003065766,0.00020978406,0.0006481221,0.0002633752,0.0028056835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563193,0.0018070588,0.00034552685,0.00095278455,0.0010402759,0.00022249228],"domain_scores_gemma":[0.979287,0.012395187,0.0014746317,0.003021463,0.0030742625,0.00074741285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011267921,0.0015015347,0.0018839506,0.0021551996,0.000887322,0.0031024963,0.0043505575,0.0022486397,0.0021577228],"category_scores_gemma":[0.022560976,0.0007960014,0.00084400404,0.0022817967,0.001516823,0.00563655,0.0020097855,0.0025545063,0.00064689066],"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.0012206422,0.0012354325,0.013863563,0.00037851385,0.00036719194,0.0002430773,0.0005505511,0.2444899,0.0077608502,0.013799383,0.008602313,0.7074886],"study_design_scores_gemma":[0.000032670425,0.00015153982,0.00068816636,0.000028865723,0.000050901323,0.000052643663,0.000033661112,0.9847147,0.0033255708,0.0098266285,0.0010704347,0.000024187591],"about_ca_topic_score_codex":0.0056113293,"about_ca_topic_score_gemma":0.007150581,"teacher_disagreement_score":0.011267921,"about_ca_system_score_codex":0.0012418376,"about_ca_system_score_gemma":0.0015152321,"threshold_uncertainty_score":0.059591174},"labels":[],"label_agreement":null},{"id":"W4385571590","doi":"10.18653/v1/2023.findings-acl.180","title":"Operator Selection and Ordering in a Pipeline Approach to Efficiency Optimizations for Transformers","year":2023,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Computer science; Commutative property; Pipeline (software); Operator (biology); Quantization (signal processing); Inference; Transformer; Theoretical computer science; Artificial intelligence; Algorithm; Mathematics; Programming language; Engineering","score_opus":0.013064767561271163,"score_gpt":0.26314482477156104,"score_spread":0.25008005721028986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385571590","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.01129866,0.00013545687,0.9835067,0.00031730483,0.000034642166,0.00008725533,0.0000678504,0.0013652351,0.0031869425],"genre_scores_gemma":[0.26044437,0.00020756222,0.7332266,0.00028898154,0.00006898833,0.0001744101,0.00019648075,0.0011356368,0.004256923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953917,0.0015709832,0.00029111572,0.00065479544,0.0015469482,0.0005444357],"domain_scores_gemma":[0.9926369,0.003688682,0.00033682844,0.0021261415,0.00095573673,0.00025566464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061194333,0.0010191305,0.0011021517,0.0015999669,0.0011792689,0.0029347886,0.002288575,0.000976998,0.008282468],"category_scores_gemma":[0.014134276,0.00078020606,0.0017981654,0.0015846179,0.0034709563,0.008439256,0.004354443,0.0031193132,0.0013638234],"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.00041151562,0.00022924846,0.0016774415,0.00028052638,0.00006334952,0.0001718729,0.0006887864,0.07234523,0.019709151,0.6828931,0.0063312077,0.2151986],"study_design_scores_gemma":[0.0000889499,0.0001512226,0.00034812937,0.000044740424,0.000059915914,0.0001395548,0.00013701123,0.42747414,0.018432053,0.54229456,0.010787814,0.00004190599],"about_ca_topic_score_codex":0.0033501398,"about_ca_topic_score_gemma":0.005325553,"teacher_disagreement_score":0.008282468,"about_ca_system_score_codex":0.0020467483,"about_ca_system_score_gemma":0.0040164096,"threshold_uncertainty_score":0.032362998},"labels":[],"label_agreement":null},{"id":"W4385750076","doi":"10.48550/arxiv.2308.04734","title":"Expected decrease for derivative-free algorithms using random subspaces","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Linear subspace; Leverage (statistics); Dimension (graph theory); Subspace topology; Algorithm; Computation; Mathematics; Computer science; Derivative (finance); Mathematical optimization; Function (biology); Pure mathematics; Artificial intelligence","score_opus":0.12955195879413184,"score_gpt":0.23434890705869166,"score_spread":0.10479694826455982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385750076","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.07977772,0.0019345753,0.9089532,0.0013663707,0.00009244546,0.000122038255,0.00020219693,0.00072606927,0.006825374],"genre_scores_gemma":[0.7785263,0.0012857136,0.21241485,0.00063520524,0.00014885869,0.00047838278,0.00067028526,0.0007504817,0.0050898334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99449277,0.002424054,0.00023699264,0.0006731631,0.0016582015,0.00051480153],"domain_scores_gemma":[0.9443839,0.045700114,0.001739489,0.0041428166,0.0031787972,0.00085495686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0088196965,0.0012709354,0.0013657017,0.0012188079,0.0008278823,0.0024270734,0.0021459656,0.0016783583,0.0035861523],"category_scores_gemma":[0.06471635,0.0005405018,0.001137313,0.0010328336,0.0028147413,0.0049599856,0.0023007307,0.003013767,0.000899386],"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.00078607764,0.00023856465,0.0040109153,0.00050318654,0.0001446402,0.000113447895,0.00018513387,0.81255066,0.0055127847,0.12911291,0.003373235,0.04346847],"study_design_scores_gemma":[0.000019278461,0.00014392426,0.00048055986,0.000036231846,0.000017970977,0.000053239084,0.00002172809,0.9652406,0.0018911713,0.031576477,0.00050470134,0.000014046059],"about_ca_topic_score_codex":0.000982958,"about_ca_topic_score_gemma":0.0010747751,"teacher_disagreement_score":0.0088196965,"about_ca_system_score_codex":0.0026092005,"about_ca_system_score_gemma":0.0021478208,"threshold_uncertainty_score":0.046643615},"labels":[],"label_agreement":null},{"id":"W4385764415","doi":"10.24963/ijcai.2023/624","title":"Levin Tree Search with Context Models","year":2023,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Context (archaeology); Parameterized complexity; Artificial neural network; Tree (set theory); Convergence (economics); Pipeline (software); Artificial intelligence; Set (abstract data type); Mathematical optimization; Test set; Algorithm; Machine learning; Mathematics","score_opus":0.036400107847621085,"score_gpt":0.2652189778720609,"score_spread":0.2288188700244398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385764415","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.07885993,0.0008645513,0.90878844,0.00086836476,0.000077879624,0.00008610349,0.00026021842,0.0015035626,0.00869096],"genre_scores_gemma":[0.7422461,0.0003727191,0.24896258,0.0005071355,0.000064225125,0.00031899574,0.00056879834,0.00036901725,0.0065904125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993266,0.00029257158,0.00003433524,0.00013514375,0.00011835106,0.000093150484],"domain_scores_gemma":[0.9977836,0.0016987004,0.00013113402,0.00018364633,0.00012811497,0.00007486606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010249037,0.00074580184,0.0011240927,0.0006512776,0.00044173165,0.00094424916,0.0012450846,0.001733334,0.004967541],"category_scores_gemma":[0.0077393632,0.0005101215,0.00062607427,0.0008883283,0.00094853766,0.0026837194,0.0018088561,0.0014942412,0.00072423747],"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.00015239637,0.000050230406,0.0010086459,0.00008414033,0.000031231124,0.00011680457,0.00007891041,0.88816535,0.0006551365,0.057726357,0.0025764182,0.049354292],"study_design_scores_gemma":[0.000015818972,0.000018810737,0.000037573736,0.000008304933,0.000003851596,0.000013283336,0.0000089664745,0.97239494,0.00011947698,0.026895707,0.00047988683,0.0000033678068],"about_ca_topic_score_codex":0.004310024,"about_ca_topic_score_gemma":0.0071486314,"teacher_disagreement_score":0.004967541,"about_ca_system_score_codex":0.001213062,"about_ca_system_score_gemma":0.0017026172,"threshold_uncertainty_score":0.016618073},"labels":[],"label_agreement":null},{"id":"W4385849344","doi":"10.48550/arxiv.2308.07275","title":"On Semidefinite Relaxations for Matrix-Weighted State-Estimation Problems in Robotics","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Semidefinite programming; Relaxation (psychology); Leverage (statistics); Mathematical optimization; Matrix (chemical analysis); Mathematics; Positive-definite matrix; Convex optimization; Isotropy; Robotics; Regular polygon; Computer science; Artificial intelligence; Applied mathematics; Eigenvalues and eigenvectors; Robot","score_opus":0.0733355089338035,"score_gpt":0.22497635552131046,"score_spread":0.15164084658750696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385849344","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.0023401948,0.00047551058,0.99417746,0.00038263443,0.000046277644,0.000039423783,0.0000645514,0.00008685504,0.002387069],"genre_scores_gemma":[0.24377052,0.0027131352,0.74354166,0.0011035792,0.00046133148,0.00087831245,0.0009823903,0.00063477136,0.0059142574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550134,0.0024055096,0.00022001815,0.0007808284,0.0008531538,0.00023917959],"domain_scores_gemma":[0.98025745,0.016026368,0.0011708933,0.0009555714,0.0012628902,0.00032691297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008134541,0.0034683067,0.001971448,0.0011726951,0.0008371259,0.0025335636,0.0017753146,0.0024094756,0.0054050027],"category_scores_gemma":[0.026603209,0.0015879862,0.0018778329,0.0018902663,0.004401281,0.0045709843,0.0037072473,0.008463276,0.0013141237],"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.000072509814,0.00010624408,0.0004490612,0.00044993716,0.000076398734,0.00013849416,0.00023619863,0.7817843,0.0012832017,0.18249406,0.0039594,0.028950263],"study_design_scores_gemma":[0.000017397788,0.000042402262,0.000077141915,0.000058596095,0.000006472406,0.00003270989,0.00003116904,0.8813582,0.00033557895,0.11670176,0.0013218693,0.000016740276],"about_ca_topic_score_codex":0.003250175,"about_ca_topic_score_gemma":0.0031526573,"teacher_disagreement_score":0.008134541,"about_ca_system_score_codex":0.001968169,"about_ca_system_score_gemma":0.0020649552,"threshold_uncertainty_score":0.04302007},"labels":[],"label_agreement":null},{"id":"W4386725051","doi":"10.1016/j.media.2023.102958","title":"Active learning for medical image segmentation with stochastic batches","year":2023,"lang":"en","type":"article","venue":"Medical Image Analysis","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Hôpital Notre-Dame","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Fonds de recherche du Québec – Nature et technologies; Réseau en Bio-Imagerie du Quebec","keywords":"Computer science; Segmentation; Artificial intelligence; Set (abstract data type); Machine learning; Sampling (signal processing); Baseline (sea); Metric (unit); Active learning (machine learning); Image segmentation; Code (set theory); Data mining; Pattern recognition (psychology); Computer vision","score_opus":0.007167990610211484,"score_gpt":0.29577817084283925,"score_spread":0.28861018023262774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386725051","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.0026826768,0.00016180032,0.99622524,0.000130306,0.000030968342,0.00003781514,0.000056752582,0.00044817838,0.00022621632],"genre_scores_gemma":[0.31629542,0.00054264505,0.6714145,0.00041972383,0.00039581239,0.00087948533,0.0010699308,0.00063533353,0.008347067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852896,0.0005868954,0.00010611417,0.0002914317,0.00035750098,0.00012922291],"domain_scores_gemma":[0.99224466,0.0061049634,0.0003708215,0.0005096914,0.00056827563,0.00020160677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005379123,0.0010761551,0.0027461487,0.0011901141,0.0006705074,0.0016502937,0.004112401,0.0027851954,0.0037366394],"category_scores_gemma":[0.010870468,0.0021496385,0.0019497585,0.0013074029,0.0020821523,0.0020460412,0.0027772526,0.0036705346,0.0009906382],"study_design_candidate":"bench_or_experimental","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.00068291277,0.0001322843,0.0004974858,0.00021390192,0.00014984002,0.00009125376,0.00010976276,0.83538485,0.0050058183,0.03831741,0.003219958,0.11619449],"study_design_scores_gemma":[0.000012042342,0.000014724939,0.000032767584,0.000004353643,0.0000054341863,0.0000068352388,0.0000015550893,0.99349445,0.0005131771,0.0056761284,0.0002336762,0.0000049331165],"about_ca_topic_score_codex":0.008836403,"about_ca_topic_score_gemma":0.009081801,"teacher_disagreement_score":0.008836403,"about_ca_system_score_codex":0.002033367,"about_ca_system_score_gemma":0.0020647184,"threshold_uncertainty_score":0.028447866},"labels":[],"label_agreement":null},{"id":"W4386798147","doi":"10.1007/978-3-031-43412-9_1","title":"Learning Objective-Specific Active Learning Strategies with Attentive Neural Processes","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"","keywords":"Computer science; Machine learning; Oracle; Artificial intelligence; Scalability; Active learning (machine learning); Classifier (UML); Exploit; Artificial neural network; Learning classifier system; Stability (learning theory); Process (computing); Database","score_opus":0.015418009766857836,"score_gpt":0.24466715370042816,"score_spread":0.22924914393357032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386798147","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.016915461,0.00044839145,0.97722614,0.00014976208,0.00008721519,0.000040191037,0.000019168026,0.00037420745,0.0047393353],"genre_scores_gemma":[0.74405783,0.00062570337,0.24318112,0.00038727565,0.00018318495,0.00026052597,0.00011736118,0.00022613203,0.010960878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995455,0.00014208272,0.000035859925,0.00012216053,0.00010098184,0.000053389977],"domain_scores_gemma":[0.99732816,0.0019755505,0.00014896042,0.00023626516,0.00021925246,0.00009185984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017158918,0.0012085807,0.00080986624,0.00044084617,0.00027664332,0.0016577289,0.0021710848,0.0014878609,0.003902678],"category_scores_gemma":[0.006646296,0.0006518271,0.0005427012,0.0005062227,0.0008669734,0.0029930382,0.0019534633,0.0025120836,0.0006933358],"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.00028512877,0.0004108647,0.001058746,0.00026022273,0.00020452385,0.00011458074,0.00034838586,0.367279,0.01138382,0.10874966,0.004229735,0.5056753],"study_design_scores_gemma":[0.000021360804,0.000080349186,0.00009253322,0.00001993413,0.000028389019,0.000023036328,0.000014554361,0.9514507,0.0021663061,0.04541839,0.00067441026,0.000010007779],"about_ca_topic_score_codex":0.000667498,"about_ca_topic_score_gemma":0.0012401609,"teacher_disagreement_score":0.003902678,"about_ca_system_score_codex":0.00041125316,"about_ca_system_score_gemma":0.00044675253,"threshold_uncertainty_score":0.013055742},"labels":[],"label_agreement":null},{"id":"W4386811795","doi":"10.1007/978-3-031-43421-1_16","title":"Exact Combinatorial Optimization with Temporo-Attentional Graph Neural Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Combinatorial optimization; Solver; Bipartite graph; Heuristic; Quadratic assignment problem; Artificial intelligence; Graph; Theoretical computer science; Set (abstract data type); Optimization problem; Deep learning; Machine learning; Mathematical optimization; Algorithm; Mathematics","score_opus":0.009691492511790648,"score_gpt":0.22722486161378336,"score_spread":0.21753336910199272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386811795","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.019133065,0.0012439097,0.94969666,0.0010922536,0.00036308085,0.00008542473,0.0003145096,0.00077617634,0.027294839],"genre_scores_gemma":[0.5229132,0.0010066518,0.44584182,0.0007979483,0.00044685582,0.0004590938,0.0007547545,0.0008933623,0.026886377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994773,0.00018245637,0.000021403579,0.000120403914,0.00010051215,0.000097807344],"domain_scores_gemma":[0.99801815,0.0015043238,0.000086893895,0.00018276373,0.0001258138,0.000082139275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010433437,0.0015338799,0.0019196311,0.00096587825,0.00071680086,0.002060895,0.0035207658,0.003081424,0.011367924],"category_scores_gemma":[0.006017353,0.0013031252,0.0012402484,0.0020967107,0.0015056954,0.0034803832,0.0020193397,0.0026899714,0.0011741057],"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.00009822904,0.00008999298,0.00013938293,0.00016450738,0.000047348854,0.00005380259,0.0000218477,0.868583,0.0003477003,0.08145921,0.008386076,0.040608913],"study_design_scores_gemma":[0.0000098646515,0.000008205661,0.000022834189,0.000007076259,0.000005390326,0.0000075615867,0.0000045379275,0.9583466,0.000059191294,0.04126129,0.00026376266,0.00000361462],"about_ca_topic_score_codex":0.0076966593,"about_ca_topic_score_gemma":0.011192888,"teacher_disagreement_score":0.011367924,"about_ca_system_score_codex":0.0020192887,"about_ca_system_score_gemma":0.0016652461,"threshold_uncertainty_score":0.038029492},"labels":[],"label_agreement":null},{"id":"W4386838733","doi":"10.1007/s10994-023-06391-0","title":"A general framework for the practical disintegration of PAC-Bayesian bounds","year":2023,"lang":"en","type":"article","venue":"Machine Learning","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Generalization; Computer science; Bayesian probability; Artificial neural network; Artificial intelligence; Generalization error; Bayesian network; Machine learning; Algorithm; Mathematics","score_opus":0.022321818771002738,"score_gpt":0.33163513537195954,"score_spread":0.3093133166009568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386838733","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.0005475745,0.0003126419,0.9880101,0.0011860185,0.00013073573,0.000039499464,0.000064079846,0.0001479823,0.00956131],"genre_scores_gemma":[0.14480272,0.0016974233,0.8353569,0.0023398383,0.0017994448,0.00071325933,0.00037297895,0.0006459,0.012271538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9856054,0.0064774347,0.00075793045,0.0018318413,0.004469929,0.0008574024],"domain_scores_gemma":[0.96815354,0.018165104,0.0010005804,0.007700245,0.004118947,0.00086151273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018644817,0.002875682,0.002530684,0.0032413786,0.002945842,0.007613972,0.008042088,0.0053954986,0.016472146],"category_scores_gemma":[0.07165042,0.0023638997,0.0031754586,0.0039048716,0.00855757,0.018579504,0.010711995,0.01715259,0.0037173016],"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.000013756244,0.000012940641,0.000052106738,0.00003309567,0.000012644296,0.00003476626,0.00006156661,0.0066739097,0.00012226606,0.9833055,0.0019202327,0.0077571175],"study_design_scores_gemma":[0.000009408791,0.00001282568,0.000029687431,0.00003154267,0.000010572254,0.000042553274,0.000013872601,0.05017048,0.00018322463,0.94429564,0.005184129,0.000016014646],"about_ca_topic_score_codex":0.00431563,"about_ca_topic_score_gemma":0.004109059,"teacher_disagreement_score":0.018644817,"about_ca_system_score_codex":0.0043211826,"about_ca_system_score_gemma":0.0041433997,"threshold_uncertainty_score":0.09860444},"labels":[],"label_agreement":null},{"id":"W4387294078","doi":"10.48550/arxiv.2309.17016","title":"Efficient Agnostic Learning with Average Smoothness","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; Ben-Gurion University of the Negev","keywords":"Smoothness; Bounded function; Nonparametric statistics; Mathematics; Rate of convergence; Uniform convergence; Applied mathematics; Algorithm; Monotonic function; Computer science; Entropy (arrow of time); Uniform boundedness; Cross entropy; Metric (unit); Discrete mathematics; Mathematical optimization; Artificial intelligence; Mathematical analysis; Statistics; Principle of maximum entropy","score_opus":0.043981835313663835,"score_gpt":0.1837970187014434,"score_spread":0.13981518338777957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387294078","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.028107964,0.000109943896,0.9701675,0.0002678738,0.000015556123,0.000033360287,0.000049670427,0.0002182252,0.0010299822],"genre_scores_gemma":[0.78736466,0.00028701368,0.20779796,0.00029956322,0.00010617683,0.00018019069,0.00036648515,0.00015999217,0.003437975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978676,0.0007761367,0.00009479803,0.0005082013,0.00058168935,0.00017151827],"domain_scores_gemma":[0.9900831,0.0066556847,0.00087235554,0.0015319291,0.000542011,0.00031490705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042622644,0.001092354,0.0017045944,0.0010201582,0.0005766329,0.0016781219,0.0028973373,0.0017103471,0.0016658035],"category_scores_gemma":[0.020160764,0.0007162645,0.0012104085,0.0010692787,0.002558548,0.0044352133,0.003731481,0.0033183598,0.00040927005],"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.00023225139,0.00014843591,0.0023286298,0.00016198815,0.00009000046,0.00013759286,0.000144798,0.68223155,0.0037263993,0.25893524,0.0013025396,0.050560556],"study_design_scores_gemma":[0.000008669223,0.00003874091,0.00016011357,0.000006682816,0.0000071442387,0.000025759553,0.000007194334,0.91879594,0.0007060646,0.079967745,0.00026781546,0.000008178008],"about_ca_topic_score_codex":0.0013062913,"about_ca_topic_score_gemma":0.0012746353,"teacher_disagreement_score":0.0042622644,"about_ca_system_score_codex":0.0017521799,"about_ca_system_score_gemma":0.0011191949,"threshold_uncertainty_score":0.022541285},"labels":[],"label_agreement":null},{"id":"W4387736264","doi":"10.36227/techrxiv.24328879.v1","title":"Ordered Reliability Direct Error Pattern Testing Decoding Algorithm","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Machine Learning and Algorithms","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":"Dalhousie University","funders":"","keywords":"Decoding methods; Algorithm; Reliability (semiconductor); Computer science; Sequential decoding; List decoding; Product (mathematics); Berlekamp–Welch algorithm; Variety (cybernetics); Binary number; State (computer science); Order (exchange); Concatenated error correction code; Mathematics; Block code; Arithmetic; Artificial intelligence; Power (physics)","score_opus":0.06243711614455985,"score_gpt":0.30921179056101855,"score_spread":0.2467746744164587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387736264","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.013787996,0.000120480516,0.9827026,0.00012229345,0.000044767632,0.000085727705,0.00015832788,0.0008733866,0.0021042714],"genre_scores_gemma":[0.24909231,0.00015680362,0.7450862,0.00019764827,0.000057008652,0.00028902068,0.0006747308,0.0001619679,0.004284339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792767,0.0005624695,0.00015533781,0.00031166789,0.0008966859,0.00014610573],"domain_scores_gemma":[0.99540365,0.0015654266,0.00031630357,0.0011068137,0.0014631156,0.00014460621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015051543,0.0006774444,0.00080968067,0.0010308484,0.00030505794,0.0010184281,0.0017276068,0.0008701266,0.0027312615],"category_scores_gemma":[0.0074898833,0.00028129693,0.0003854989,0.0009552417,0.00093785144,0.001202796,0.0014326437,0.0012509848,0.0013151648],"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.000669613,0.00012608766,0.0031763178,0.00022124073,0.000063938656,0.0002565977,0.00016107706,0.13760866,0.02178945,0.07615287,0.0059095537,0.7538646],"study_design_scores_gemma":[0.00010170872,0.00019958394,0.00060957996,0.00002776105,0.000023028637,0.000506152,0.000027748556,0.92331374,0.026484314,0.042898092,0.005760881,0.0000474062],"about_ca_topic_score_codex":0.0014396282,"about_ca_topic_score_gemma":0.0012043718,"teacher_disagreement_score":0.0027312615,"about_ca_system_score_codex":0.00052400114,"about_ca_system_score_gemma":0.0018283058,"threshold_uncertainty_score":0.009136975},"labels":[],"label_agreement":null},{"id":"W4387963612","doi":"10.48550/arxiv.2310.16161","title":"MyriadAL: Active Few Shot Learning for Histopathology","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Alberta Innovates","keywords":"Computer science; Artificial intelligence; Machine learning; Oracle; Active learning (machine learning); Encoder; Supervised learning; Data mining; Artificial neural network","score_opus":0.12189227134896884,"score_gpt":0.22659794975679629,"score_spread":0.10470567840782745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387963612","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.0076954155,0.0010182132,0.9822235,0.00039478776,0.00013504528,0.0001213629,0.00053777196,0.0065430272,0.0013309572],"genre_scores_gemma":[0.23951745,0.0008998219,0.7406017,0.0014840006,0.0003764695,0.00058234157,0.0061974423,0.0013015819,0.009039147],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984944,0.00043941956,0.000054177643,0.0005000114,0.0003972669,0.00011470227],"domain_scores_gemma":[0.99800974,0.0010356682,0.00012761791,0.00039561585,0.0002735202,0.00015778723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002659224,0.001362531,0.0016228812,0.0018632546,0.0007855316,0.0019478543,0.0048339246,0.003011022,0.004027291],"category_scores_gemma":[0.006181995,0.0009634257,0.0013176592,0.0010114902,0.0014785293,0.0024574483,0.0038717112,0.003220053,0.0022635648],"study_design_candidate":"bench_or_experimental","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.00053868035,0.00037639105,0.0020081694,0.00043374908,0.00022746429,0.00026371452,0.00031533098,0.2243363,0.02082653,0.01734582,0.028223187,0.7051047],"study_design_scores_gemma":[0.000022080909,0.000071397924,0.00022726768,0.00002145233,0.000015679376,0.000090217385,0.00002768188,0.96777153,0.0057055727,0.022432117,0.0035908166,0.00002412417],"about_ca_topic_score_codex":0.0049808114,"about_ca_topic_score_gemma":0.008488449,"teacher_disagreement_score":0.0049808114,"about_ca_system_score_codex":0.0015172526,"about_ca_system_score_gemma":0.0013522725,"threshold_uncertainty_score":0.0140634775},"labels":[],"label_agreement":null},{"id":"W4388235576","doi":"10.1109/sampta59647.2023.10301400","title":"Sampling Informative Positives Pairs in Contrastive Learning","year":2023,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Université de Montréal","funders":"","keywords":"Similarity (geometry); Sampling (signal processing); Artificial intelligence; Representation (politics); Computer science; Class (philosophy); Space (punctuation); False positive paradox; Machine learning; Mathematics; Pattern recognition (psychology)","score_opus":0.015145223499369998,"score_gpt":0.2783324649142953,"score_spread":0.26318724141492533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388235576","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.035571676,0.000360425,0.9605787,0.0006201195,0.000035864905,0.00015875974,0.00007713931,0.0002172438,0.0023799206],"genre_scores_gemma":[0.68183404,0.00035194823,0.31186482,0.00088992977,0.00017793495,0.000624204,0.0004344416,0.00017239715,0.003650294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934727,0.0040176148,0.00017368606,0.0011511471,0.00097251876,0.00021222011],"domain_scores_gemma":[0.9778364,0.017403197,0.0011366786,0.002243629,0.00084354053,0.0005365507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011071049,0.0014042344,0.0017632154,0.001645206,0.0012703477,0.0024343508,0.0032807898,0.0026233292,0.0025821466],"category_scores_gemma":[0.047485318,0.0009285454,0.0010254234,0.0010179644,0.004903365,0.004797327,0.004144539,0.0035433522,0.0006292819],"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.0008621902,0.00072874303,0.0082404455,0.00035583432,0.00019800327,0.0006088319,0.0008052961,0.20347607,0.007536789,0.59246147,0.004306803,0.18041958],"study_design_scores_gemma":[0.00010479662,0.00027865102,0.0005051414,0.000059851795,0.000040811676,0.00020979432,0.00007960176,0.6877892,0.0035183362,0.3051343,0.0022447614,0.00003479401],"about_ca_topic_score_codex":0.00090117275,"about_ca_topic_score_gemma":0.0011271551,"teacher_disagreement_score":0.011071049,"about_ca_system_score_codex":0.0014993815,"about_ca_system_score_gemma":0.00101054,"threshold_uncertainty_score":0.05854994},"labels":[],"label_agreement":null},{"id":"W4388625507","doi":"10.1145/3626111.3628182","title":"Harnessing ML For Network Protocol Assessment","year":2023,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","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 Toronto","funders":"","keywords":"Computer science; Protocol (science); Process (computing); Network congestion; Distributed computing; Communications protocol; Network simulation; Machine learning; Artificial intelligence; Computer network; Operating system","score_opus":0.026487610474149756,"score_gpt":0.36766121431051496,"score_spread":0.3411736038363652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388625507","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.008589259,0.00017529314,0.9824011,0.00036444116,0.000056774694,0.00007796105,0.00006984492,0.0056957053,0.002569678],"genre_scores_gemma":[0.6569241,0.00028086995,0.33894703,0.00036598058,0.00011026658,0.00027482974,0.00022307367,0.00076552364,0.002108267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99153215,0.0040124888,0.00046436748,0.0009720045,0.0026980806,0.0003209382],"domain_scores_gemma":[0.95813906,0.028711073,0.0025439935,0.0071743703,0.0029396857,0.0004918654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009215032,0.0014899026,0.0010974193,0.0025481745,0.00055058196,0.003615402,0.0030938718,0.001720914,0.0040924656],"category_scores_gemma":[0.0642273,0.0007477867,0.00069236517,0.00084210414,0.0022331488,0.0077733984,0.004207375,0.0039873514,0.0015158303],"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.00042329807,0.00041037824,0.007605749,0.000419203,0.00024350235,0.00022914512,0.0004412655,0.46701035,0.015527398,0.12296853,0.0037093556,0.3810119],"study_design_scores_gemma":[0.000017361801,0.00008931036,0.00024867416,0.000036063695,0.00001670901,0.000054443495,0.000032065316,0.92143023,0.009176995,0.06643565,0.0024344123,0.000028079312],"about_ca_topic_score_codex":0.00080597383,"about_ca_topic_score_gemma":0.0007245371,"teacher_disagreement_score":0.009215032,"about_ca_system_score_codex":0.0012420239,"about_ca_system_score_gemma":0.0015561967,"threshold_uncertainty_score":0.048734307},"labels":[],"label_agreement":null},{"id":"W4389260608","doi":"10.48550/arxiv.2311.18010","title":"Active learning meets fractal decision boundaries: a cautionary tale from the Sitnikov three-body problem","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"HORIZON EUROPE Framework Programme; Alliance de recherche numérique du Canada; European Commission; Canada Research Chairs; Flatiron Health","keywords":"Fractal; Chaotic; Context (archaeology); Boundary (topology); Stability (learning theory); Cosmology; Computer science; Gravitation; Attractor; Cluster (spacecraft); Artificial intelligence; Decision boundary; Three-body problem; Physics; Astrophysics; Astronomy; Mathematics; Machine learning; Geography; Mathematical analysis","score_opus":0.04102123877156246,"score_gpt":0.20441576394524355,"score_spread":0.16339452517368108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389260608","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.037924416,0.019261545,0.6489598,0.2643931,0.0030047267,0.00009006751,0.00040013285,0.00079307583,0.02517315],"genre_scores_gemma":[0.6344862,0.011684042,0.2798537,0.048012357,0.010349969,0.00053610175,0.00037291797,0.0008774599,0.013827308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972698,0.0013355046,0.0001525554,0.0005672141,0.0005819755,0.000093015165],"domain_scores_gemma":[0.97163457,0.024563374,0.0006181909,0.001703494,0.0010340345,0.0004464291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008595724,0.00095205155,0.002106068,0.0010305385,0.0017701632,0.0035233065,0.002949107,0.006092426,0.002243582],"category_scores_gemma":[0.046695486,0.000654808,0.0010805189,0.0007016707,0.008522413,0.00908566,0.0033249124,0.016672058,0.001127407],"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.00018873799,0.000058480513,0.0021004465,0.00043979444,0.00020343959,0.000391116,0.00046453968,0.08708974,0.0013981992,0.79677755,0.045471776,0.06541612],"study_design_scores_gemma":[0.00004079994,0.000035433135,0.00024181939,0.00009182438,0.000011529881,0.00010113068,0.00003957665,0.1132717,0.0004379303,0.8769319,0.008766294,0.00003008204],"about_ca_topic_score_codex":0.0017356119,"about_ca_topic_score_gemma":0.0014108764,"teacher_disagreement_score":0.008595724,"about_ca_system_score_codex":0.0010883937,"about_ca_system_score_gemma":0.00088297063,"threshold_uncertainty_score":0.045459032},"labels":[],"label_agreement":null},{"id":"W4390815987","doi":"10.1016/j.artint.2024.104075","title":"Corrigendum to “Learning constraints through partial queries” [Artificial Intelligence 319 (2023) 103896]","year":2024,"lang":"en","type":"erratum","venue":"Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.06598476562047607,"score_gpt":0.3288429589463709,"score_spread":0.26285819332589483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390815987","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017722884,0.0021917853,0.0020188119,0.13828695,0.79379964,0.00013604178,0.0043758014,0.0019775708,0.057036143],"genre_scores_gemma":[0.0047270586,0.0036355357,0.0043211593,0.12316292,0.13002625,0.00048516382,0.005780823,0.0019185856,0.7259426],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99178666,0.001389868,0.00071601674,0.001311071,0.003951478,0.000844926],"domain_scores_gemma":[0.9775339,0.005329285,0.0007470295,0.0016123594,0.013784627,0.0009928297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004797277,0.003339877,0.0042583197,0.007088195,0.0077631143,0.00942428,0.0063110865,0.01577061,0.2882042],"category_scores_gemma":[0.05013553,0.0019233824,0.0034283348,0.0052788574,0.0028519824,0.005093392,0.0037125808,0.009895802,0.19718227],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00001075105,0.0000039668644,0.000009974789,0.000021111857,0.00000426225,0.000018178656,0.000003456488,0.000020732621,0.000010399,0.0006019674,0.99794585,0.0013493059],"study_design_scores_gemma":[0.00006111291,0.000031764244,0.0006315018,0.00022537126,0.000048922786,0.000072173665,0.000048795486,0.00071028905,0.00019728145,0.008141494,0.98976165,0.00006955571],"about_ca_topic_score_codex":0.07151834,"about_ca_topic_score_gemma":0.102920726,"teacher_disagreement_score":0.2882042,"about_ca_system_score_codex":0.011819485,"about_ca_system_score_gemma":0.0063286456,"threshold_uncertainty_score":0.9641391},"labels":[],"label_agreement":null},{"id":"W4390874348","doi":"10.1109/acii59096.2023.10388093","title":"Active Learning with Contrastive Pre-training for Facial Expression Recognition","year":2023,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Artificial intelligence; Facial expression recognition; Facial expression; Speech recognition; Natural language processing; Pattern recognition (psychology); Facial recognition system","score_opus":0.03273952067144982,"score_gpt":0.28668279252865503,"score_spread":0.2539432718572052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390874348","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.024300132,0.0009180909,0.9670391,0.00041373234,0.00013405227,0.00012929653,0.00020607137,0.0036241976,0.0032352293],"genre_scores_gemma":[0.4366819,0.00067083904,0.5509756,0.0009559137,0.0001632127,0.0004780947,0.001760754,0.00053679815,0.007776932],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986362,0.0004968958,0.000055843393,0.0003295736,0.00032859037,0.00015286992],"domain_scores_gemma":[0.9973647,0.0016158716,0.00014506005,0.00044315835,0.00035191266,0.00007926682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029220171,0.0013749085,0.0010589084,0.0010187537,0.00040747036,0.0010487235,0.0028892336,0.0016072929,0.0031342502],"category_scores_gemma":[0.006842034,0.00064149586,0.0011783566,0.00072161335,0.0011354209,0.0019235134,0.0014210396,0.0033057265,0.0020203537],"study_design_candidate":"bench_or_experimental","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.0005990698,0.0006569986,0.0019998543,0.00023566032,0.00017277867,0.000094567156,0.0001918739,0.1935476,0.027506925,0.007503514,0.010326517,0.75716466],"study_design_scores_gemma":[0.000022246975,0.000110291585,0.0004459246,0.000026612079,0.000017321172,0.00005714681,0.000019889561,0.97601193,0.015998602,0.0046635424,0.0026101836,0.000016306034],"about_ca_topic_score_codex":0.0026999984,"about_ca_topic_score_gemma":0.005323583,"teacher_disagreement_score":0.0031342502,"about_ca_system_score_codex":0.0009795374,"about_ca_system_score_gemma":0.00072137953,"threshold_uncertainty_score":0.015453279},"labels":[],"label_agreement":null},{"id":"W4390956195","doi":"10.1109/tnsm.2024.3355310","title":"Labeling Cloud Metrics Data for Fault Detection in Cloud Using Active Learning With Test Suite","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Ericsson (Canada); Concordia University","funders":"","keywords":"Cloud computing; Suite; Test suite; Computer science; Test (biology); Machine learning; Operating system; Test case; Geology; Geography","score_opus":0.025388512425434436,"score_gpt":0.2706910840739789,"score_spread":0.24530257164854447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390956195","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.26974848,0.00038533346,0.7197632,0.0006814694,0.00007519924,0.00019693814,0.0006875849,0.0071407803,0.0013208896],"genre_scores_gemma":[0.9114822,0.00007168633,0.0862377,0.00018501632,0.000038313083,0.000110888584,0.0012380908,0.000113147944,0.0005229401],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997869,0.00077338703,0.0001597107,0.0005065692,0.0004975185,0.00019372362],"domain_scores_gemma":[0.9916892,0.0037212076,0.0012166168,0.0013271304,0.0016806292,0.00036525802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028907584,0.0012427996,0.00093868695,0.0025026964,0.0005147404,0.0013100011,0.0020418125,0.0010108304,0.0005754659],"category_scores_gemma":[0.0103807235,0.00027540486,0.0006694851,0.0014805836,0.0006617416,0.0019275673,0.0011243,0.0012690828,0.0004015461],"study_design_candidate":"bench_or_experimental","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.0009052111,0.0015231578,0.06016226,0.00019123027,0.00017195458,0.00036637177,0.0003124588,0.36211208,0.02517332,0.0027531052,0.006393968,0.5399349],"study_design_scores_gemma":[0.000010345621,0.000077753124,0.001795602,0.0000062962285,0.000009022355,0.00004348348,0.000028847424,0.9895734,0.00656089,0.0015345458,0.0003517174,0.000008106466],"about_ca_topic_score_codex":0.004884307,"about_ca_topic_score_gemma":0.006357715,"teacher_disagreement_score":0.004884307,"about_ca_system_score_codex":0.0012765415,"about_ca_system_score_gemma":0.0011567,"threshold_uncertainty_score":0.015287995},"labels":[],"label_agreement":null},{"id":"W4391129997","doi":"10.1109/ictc58733.2023.10392770","title":"Uncertainty-based Active Learning with Ensemble Technique for Enhancing the Performance of Natural Language Classification with Limited Data","year":2023,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Artificial Intelligence in Medicine (Canada)","funders":"Korea Institute for Advancement of Technology; National Research Foundation","keywords":"Computer science; Machine learning; Artificial intelligence; Natural language; Ensemble learning; Preprocessor; Natural language understanding; Data pre-processing; Language model; Training set; Data mining","score_opus":0.02072955563730382,"score_gpt":0.2796560352480592,"score_spread":0.2589264796107554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391129997","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.034145925,0.00059400493,0.9636666,0.00022447642,0.00006593128,0.000029219826,0.00004390538,0.0005659738,0.00066391093],"genre_scores_gemma":[0.79393137,0.00042462064,0.20307393,0.00032338884,0.00021933544,0.00013064271,0.00036163747,0.00010931756,0.0014257948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844766,0.0005918102,0.00010786796,0.00027694134,0.00045054185,0.00012517773],"domain_scores_gemma":[0.9940646,0.003936141,0.0002797097,0.00049525994,0.0010804064,0.00014392662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004434976,0.001022986,0.0018002036,0.0012203557,0.0006711128,0.00090621895,0.0021931317,0.0012877678,0.00083345507],"category_scores_gemma":[0.0082032895,0.0003376247,0.0010763182,0.0011287078,0.00071051804,0.0030122015,0.0015152148,0.0020641221,0.000294866],"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.00035588964,0.00038634535,0.0044519654,0.00010624993,0.00021326597,0.000157078,0.0003650881,0.5192679,0.014690597,0.008418861,0.003442682,0.44814396],"study_design_scores_gemma":[0.0000022418599,0.000022659957,0.00008683036,0.0000018665871,0.000007678659,0.0000086113605,0.0000060559723,0.9972627,0.0012022178,0.0012579227,0.00013695683,0.0000042565835],"about_ca_topic_score_codex":0.002344449,"about_ca_topic_score_gemma":0.0024203956,"teacher_disagreement_score":0.004434976,"about_ca_system_score_codex":0.0004236347,"about_ca_system_score_gemma":0.0006388431,"threshold_uncertainty_score":0.023454666},"labels":[],"label_agreement":null},{"id":"W4391386721","doi":"10.3390/e26020129","title":"Deep Individual Active Learning: Safeguarding against Out-of-Distribution Challenges in Neural Networks","year":2024,"lang":"en","type":"article","venue":"Entropy","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research","keywords":"MNIST database; Computer science; Leverage (statistics); Regret; Machine learning; Artificial intelligence; Artificial neural network; Key (lock); Test set; Set (abstract data type); Training set; Active learning (machine learning); Data mining","score_opus":0.023380409488017374,"score_gpt":0.26686762435404593,"score_spread":0.24348721486602856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391386721","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.021843694,0.0007498187,0.9743078,0.00080563105,0.00007964361,0.000056359942,0.000075892174,0.00079209625,0.0012891259],"genre_scores_gemma":[0.8047637,0.00069498486,0.18778364,0.0010937797,0.00029261757,0.0003552138,0.0004148919,0.00031318268,0.0042880666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967638,0.0015298073,0.00014639969,0.00053305336,0.000728846,0.00029805495],"domain_scores_gemma":[0.98795474,0.007887872,0.00077931694,0.0019642895,0.0010451302,0.00036867714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008491765,0.0018559359,0.002632301,0.00091827835,0.0012079069,0.0023074008,0.005633494,0.0027251327,0.0014975643],"category_scores_gemma":[0.018984327,0.0010240162,0.0010051166,0.0011215877,0.0029416336,0.0054847626,0.005981518,0.005626238,0.0005643742],"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.00080671126,0.00038355726,0.0032504543,0.0002187226,0.00021558726,0.00023884769,0.00037785462,0.68002594,0.005161699,0.043514613,0.006916919,0.25888914],"study_design_scores_gemma":[0.000018532504,0.000044584544,0.00006193488,0.000011465205,0.000009833363,0.000024376064,0.00001423018,0.9789075,0.0013237228,0.019176282,0.00040172704,0.0000057505326],"about_ca_topic_score_codex":0.0022741896,"about_ca_topic_score_gemma":0.0036792727,"teacher_disagreement_score":0.008491765,"about_ca_system_score_codex":0.0016885181,"about_ca_system_score_gemma":0.0021369858,"threshold_uncertainty_score":0.0449093},"labels":[],"label_agreement":null},{"id":"W4392173106","doi":"10.2139/ssrn.4737332","title":"Simultaneous Search and Adverse Selection","year":2024,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Selection (genetic algorithm); Adverse selection; Computer science; Artificial intelligence; Business; Actuarial science","score_opus":0.004434874449376412,"score_gpt":0.2503920609740748,"score_spread":0.2459571865246984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392173106","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.05291108,0.0035653163,0.8880664,0.006927549,0.0007982842,0.00023241731,0.00045761955,0.0006455704,0.046395756],"genre_scores_gemma":[0.8824752,0.0019453242,0.05236838,0.0011752585,0.0014029134,0.00045272216,0.00040401382,0.00022468907,0.059551515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9861654,0.010099236,0.000448954,0.0012669987,0.0012400472,0.00077932747],"domain_scores_gemma":[0.8822855,0.10207759,0.00483893,0.0068367915,0.0025477053,0.0014135088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013977749,0.0015156873,0.004258449,0.0027991561,0.0015444123,0.0036345394,0.0029829496,0.0044035586,0.02062854],"category_scores_gemma":[0.07383949,0.0014644634,0.0021661413,0.0031739632,0.0043124864,0.0060236217,0.0049216347,0.0044929464,0.0028374526],"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.00066538254,0.00012207076,0.002427195,0.0003492052,0.00041840074,0.0006782657,0.00022054928,0.09238037,0.00034011214,0.83077866,0.01882588,0.052793812],"study_design_scores_gemma":[0.00013287262,0.00011822288,0.00039135423,0.00003148036,0.00005580258,0.0003004494,0.000047639754,0.16087875,0.00018078364,0.8351587,0.0026768702,0.000027099952],"about_ca_topic_score_codex":0.0010116859,"about_ca_topic_score_gemma":0.0010381349,"teacher_disagreement_score":0.02062854,"about_ca_system_score_codex":0.0010649941,"about_ca_system_score_gemma":0.0016759888,"threshold_uncertainty_score":0.07392228},"labels":[],"label_agreement":null},{"id":"W4392605832","doi":"10.1007/978-3-031-52113-3_28","title":"Positive Characteristic Sets for Relational Pattern Languages","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Programming language; Relational database; Natural language processing; Artificial intelligence; Theoretical computer science; Information retrieval","score_opus":0.011955958014900176,"score_gpt":0.27143595651556973,"score_spread":0.25947999850066955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392605832","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.03945147,0.0047752,0.8041734,0.0027299589,0.0005227822,0.00012842125,0.00093247934,0.0012320183,0.14605431],"genre_scores_gemma":[0.6191002,0.004646394,0.28888616,0.0010829312,0.0010647245,0.000652393,0.0019795443,0.0009827765,0.08160484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998841,0.00020603038,0.00008755723,0.00023076044,0.0005215863,0.000113222995],"domain_scores_gemma":[0.9971758,0.0019668143,0.00016468232,0.0003692845,0.00022344697,0.00009997743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010551754,0.00064829696,0.0007501971,0.0021481314,0.0012034423,0.0036586141,0.0010228583,0.0008046205,0.008779071],"category_scores_gemma":[0.004188763,0.00086091954,0.0010030522,0.0033671279,0.002692312,0.008556709,0.0020112752,0.0037347584,0.0019641004],"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.000017490029,0.000011474389,0.00010612515,0.00008827239,0.000005796356,0.00003168304,0.00016268404,0.00074818777,0.00073107943,0.95968866,0.004247691,0.03416098],"study_design_scores_gemma":[0.0000046495343,0.0000053487647,0.000077369215,0.00001861686,0.000004759677,0.00009057964,0.000032928678,0.0022705817,0.00042907646,0.98764145,0.009417132,0.000007606711],"about_ca_topic_score_codex":0.0005082137,"about_ca_topic_score_gemma":0.0005254453,"teacher_disagreement_score":0.008779071,"about_ca_system_score_codex":0.001928507,"about_ca_system_score_gemma":0.0006478248,"threshold_uncertainty_score":0.029368937},"labels":[],"label_agreement":null},{"id":"W4392800531","doi":"10.1007/978-3-031-56066-8_5","title":"Learning to Jointly Transform and Rank Difficult Queries","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"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; University of Waterloo","funders":"","keywords":"Computer science; Rank (graph theory); Learning to rank; Artificial intelligence; Information retrieval; Ranking (information retrieval); Mathematics; Combinatorics","score_opus":0.007478165551158179,"score_gpt":0.23302899334275923,"score_spread":0.22555082779160104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392800531","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.04050781,0.0009647905,0.9460885,0.0017495217,0.00027154668,0.00019256608,0.0009382823,0.005574075,0.0037130478],"genre_scores_gemma":[0.33563995,0.00091150944,0.64033246,0.00088340626,0.0012943924,0.00035188466,0.0056718723,0.000659281,0.014255211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588424,0.0011383927,0.0002832965,0.0007175766,0.0014632231,0.0005133405],"domain_scores_gemma":[0.98900837,0.006877538,0.0006351072,0.001960231,0.0010703803,0.00044831957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038492025,0.0020923344,0.0028476678,0.002522192,0.0006888719,0.0031405736,0.0027280333,0.003234461,0.007802514],"category_scores_gemma":[0.02046439,0.00078770495,0.0014277732,0.0032385252,0.0017096172,0.0057924236,0.0041089184,0.0038538969,0.0049721175],"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.0011047794,0.00050232955,0.0034862629,0.0002740651,0.00020951666,0.00019731511,0.00019546169,0.09732171,0.009703931,0.025548315,0.03844106,0.8230153],"study_design_scores_gemma":[0.00009268749,0.00024334998,0.0003600574,0.00002008051,0.000053837437,0.0002558996,0.0001198434,0.93668354,0.005108782,0.05298961,0.0040457193,0.000026612783],"about_ca_topic_score_codex":0.00299003,"about_ca_topic_score_gemma":0.00527918,"teacher_disagreement_score":0.007802514,"about_ca_system_score_codex":0.0010480578,"about_ca_system_score_gemma":0.0025398678,"threshold_uncertainty_score":0.026102006},"labels":[],"label_agreement":null},{"id":"W4392981319","doi":"10.1109/ism59092.2023.00017","title":"Active Learning for Multi-Class Vehicle Categorization and Traffic Analysis in complex environments","year":2023,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Categorization; Computer science; Class (philosophy); Artificial intelligence; Machine learning","score_opus":0.03235574589909209,"score_gpt":0.28867788113310916,"score_spread":0.2563221352340171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392981319","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.026451273,0.00024937827,0.9705038,0.00015425147,0.00005271386,0.00004370662,0.000087034714,0.0014040383,0.00105383],"genre_scores_gemma":[0.771965,0.00021645354,0.2226668,0.00019771254,0.00012283721,0.0001316817,0.00056019565,0.00016668638,0.0039725904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992136,0.00016583846,0.00003074501,0.0002983968,0.00016926599,0.00012215048],"domain_scores_gemma":[0.9986291,0.00061567855,0.00014206379,0.00022398078,0.0002932059,0.00009609236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016911027,0.0009520062,0.00097203674,0.0019521818,0.0006316593,0.001338073,0.002736393,0.0013487225,0.001625436],"category_scores_gemma":[0.0031428672,0.0005018177,0.000906377,0.0013785785,0.0008057972,0.0019357769,0.001670895,0.0017588624,0.00073923223],"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.0002773485,0.00040158082,0.0045822053,0.00012139984,0.00015631996,0.00012389217,0.0002115166,0.3120755,0.012319182,0.0074732713,0.003297384,0.6589604],"study_design_scores_gemma":[0.0000035148744,0.00002105904,0.0003471569,0.000004407043,0.0000070339233,0.000015397458,0.000021583579,0.99254096,0.0022740348,0.004193074,0.0005661198,0.0000055808937],"about_ca_topic_score_codex":0.005177983,"about_ca_topic_score_gemma":0.0068204557,"teacher_disagreement_score":0.005177983,"about_ca_system_score_codex":0.0009097274,"about_ca_system_score_gemma":0.00083622016,"threshold_uncertainty_score":0.010295689},"labels":[],"label_agreement":null},{"id":"W4393152373","doi":"10.1609/aaai.v38i21.30515","title":"Learning to Build Solutions in Stochastic Matching Problems Using Flows (Student Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"McGill University; Université de Montréal","funders":"","keywords":"Matching (statistics); Computer science; Mathematics education; Mathematical optimization; Mathematics; Statistics","score_opus":0.06907772291841656,"score_gpt":0.3283144772424974,"score_spread":0.25923675432408083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393152373","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10467077,0.0002765363,0.88964945,0.001927798,0.00010452742,0.0000713534,0.00013116328,0.0002961264,0.0028721779],"genre_scores_gemma":[0.74297273,0.00039921535,0.24768318,0.00076697575,0.0002799188,0.00034182344,0.0005280401,0.00019361009,0.0068345326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926144,0.00034325768,0.000036198784,0.00020401964,0.00007518287,0.00007984901],"domain_scores_gemma":[0.9923685,0.0062327473,0.00049204234,0.00024115895,0.00028236693,0.00038318196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032437025,0.00070364616,0.0010749124,0.0011857665,0.0007187568,0.001291428,0.0011083373,0.001901311,0.0037806986],"category_scores_gemma":[0.01738529,0.0006568982,0.0011019281,0.0010059442,0.0020283184,0.0031417247,0.0021662908,0.0021906192,0.00035970338],"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.00016824664,0.00016870939,0.003684472,0.00014069496,0.00009405111,0.0001047075,0.0002198254,0.7049414,0.0007636053,0.21961306,0.004823279,0.065277904],"study_design_scores_gemma":[0.000018584497,0.000027059916,0.0001203493,0.000012731237,0.00000435143,0.000009248351,0.000014906457,0.88662124,0.00018890461,0.112583935,0.00039287875,0.0000058844257],"about_ca_topic_score_codex":0.0027727992,"about_ca_topic_score_gemma":0.0032771465,"teacher_disagreement_score":0.0037806986,"about_ca_system_score_codex":0.0012858112,"about_ca_system_score_gemma":0.00093868515,"threshold_uncertainty_score":0.017154515},"labels":[],"label_agreement":null},{"id":"W4394294388","doi":"10.6084/m9.figshare.13123250","title":"Field Experiment Data for Solo Survey","year":2020,"lang":"en","type":"dataset","venue":"Figshare","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Field survey; Field (mathematics); Survey data collection; Geography; Statistics; Cartography; Mathematics","score_opus":0.15739105308926968,"score_gpt":0.3638333918655035,"score_spread":0.20644233877623383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394294388","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0091013955,0.00015078898,0.0070649753,0.00032930943,0.0002803414,0.0021014237,0.94980526,0.0016097738,0.029556759],"genre_scores_gemma":[0.04525922,0.00029868245,0.030583559,0.0010058954,0.00011289925,0.020525573,0.8648639,0.0017768664,0.035573523],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950303,0.0012787428,0.0006329482,0.0010611452,0.001625312,0.0003715198],"domain_scores_gemma":[0.9805753,0.00326464,0.0020798377,0.004527682,0.008703507,0.0008489631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005380279,0.0010616953,0.0011401224,0.0033149896,0.0010721341,0.001540501,0.0020596047,0.0006880003,0.112114884],"category_scores_gemma":[0.011771057,0.00064154726,0.0011340388,0.006003257,0.0004609685,0.0015302161,0.0017979479,0.0012431992,0.042570774],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0016823635,0.0006412982,0.040853314,0.0032574113,0.00042949617,0.00015784752,0.001069235,0.0013298618,0.0060487567,0.0032092321,0.81697094,0.124350205],"study_design_scores_gemma":[0.00035866702,0.0004056155,0.05126294,0.00042138415,0.00015170668,0.00006541802,0.0012197185,0.00063425425,0.0023956362,0.0017962065,0.94120604,0.00008244846],"about_ca_topic_score_codex":0.014410447,"about_ca_topic_score_gemma":0.03197088,"teacher_disagreement_score":0.112114884,"about_ca_system_score_codex":0.002087244,"about_ca_system_score_gemma":0.0037843643,"threshold_uncertainty_score":0.37506163},"labels":[],"label_agreement":null},{"id":"W4394838778","doi":"10.1145/3618260.3649784","title":"On the Power of Interactive Proofs for Learning","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Qualcomm (Canada); Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; University of Warwick; UK Research and Innovation","keywords":"Mathematical proof; Computer science; Power (physics); Mathematics","score_opus":0.013676777235512807,"score_gpt":0.29143924376349667,"score_spread":0.27776246652798386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394838778","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.024068143,0.0015796061,0.93901175,0.005030382,0.00014845302,0.00020105031,0.0002645752,0.0016316517,0.028064396],"genre_scores_gemma":[0.72577846,0.0019509707,0.25518215,0.0019601763,0.00089313305,0.00093268737,0.0005071426,0.0009814888,0.011813763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97926694,0.008833121,0.00076158164,0.0033208118,0.0061037703,0.0017137558],"domain_scores_gemma":[0.829737,0.1369129,0.003590033,0.025201535,0.0027686465,0.001789894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014468962,0.0023129564,0.0022178115,0.0019988767,0.0035860466,0.007598991,0.0063816807,0.0044649644,0.013121655],"category_scores_gemma":[0.07171541,0.0018402674,0.0030703915,0.0018824018,0.012676008,0.027547244,0.012229386,0.01576179,0.002413587],"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.0002770006,0.00009141656,0.0004214866,0.0002035606,0.000054381868,0.00010696611,0.0003738879,0.031932,0.0012506042,0.9474632,0.0014326158,0.01639283],"study_design_scores_gemma":[0.00008477005,0.000052887208,0.00008179287,0.00006376264,0.000026919357,0.00005728115,0.000029870902,0.12022761,0.0015690405,0.87449116,0.0032822103,0.000032803015],"about_ca_topic_score_codex":0.0016067666,"about_ca_topic_score_gemma":0.0010748755,"teacher_disagreement_score":0.014468962,"about_ca_system_score_codex":0.005204855,"about_ca_system_score_gemma":0.0033464152,"threshold_uncertainty_score":0.076520145},"labels":[],"label_agreement":null},{"id":"W4396600708","doi":"","title":"Length Independent PAC-Bayes Bounds for Simple RNNs","year":2024,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Simple (philosophy); Computer science; Bayes' theorem; Artificial intelligence; Algorithm; Bayesian probability","score_opus":0.009541271259036074,"score_gpt":0.24175528942213176,"score_spread":0.23221401816309567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396600708","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.041561093,0.009989515,0.8874943,0.0073087714,0.0008357572,0.00020668082,0.0018410609,0.0017495257,0.049013242],"genre_scores_gemma":[0.63579804,0.009370591,0.29272103,0.0044709872,0.003660295,0.0012955127,0.00480177,0.0022133964,0.045668438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99071383,0.0027317968,0.00036397707,0.0015591532,0.0034722872,0.0011588925],"domain_scores_gemma":[0.8779839,0.10619323,0.0029055632,0.0058252756,0.0048490614,0.0022429116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011046705,0.0033848847,0.0041371477,0.0030450153,0.0028252404,0.0061234836,0.0059656594,0.005125978,0.014069447],"category_scores_gemma":[0.08007412,0.0020920138,0.0019866233,0.0029319155,0.004987411,0.0186252,0.0073697316,0.011720318,0.0037517261],"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.00090352737,0.00026673218,0.002362402,0.0011682643,0.00021377458,0.00033727853,0.0004295126,0.36516368,0.0031443709,0.5244531,0.023271034,0.078286365],"study_design_scores_gemma":[0.000028646633,0.000043420856,0.0002688728,0.00012429606,0.000045811514,0.00008261461,0.000029848583,0.5106192,0.0010478963,0.48557118,0.002106077,0.00003215438],"about_ca_topic_score_codex":0.0034410625,"about_ca_topic_score_gemma":0.007816514,"teacher_disagreement_score":0.014069447,"about_ca_system_score_codex":0.006889641,"about_ca_system_score_gemma":0.00474857,"threshold_uncertainty_score":0.058421254},"labels":[],"label_agreement":null},{"id":"W4396680742","doi":"10.1109/jsait.2024.3396787","title":"Noisy Computing of the OR and MAX Functions","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Machine Learning and Algorithms","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 Toronto; University of British Columbia","funders":"","keywords":"Divergence (linguistics); Pairwise comparison; Mathematics; Function (biology); Computation; Combinatorics; Upper and lower bounds; Probability distribution; Kullback–Leibler divergence; Probability of error; Discrete mathematics; Algorithm; Statistics; Mathematical analysis","score_opus":0.006234505061312398,"score_gpt":0.23775144553921707,"score_spread":0.23151694047790466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396680742","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.12233931,0.0011030632,0.86687565,0.0021178946,0.00014551752,0.00010166766,0.00036365783,0.0013058651,0.005647385],"genre_scores_gemma":[0.8749024,0.0003884707,0.12053797,0.0005355405,0.0002464333,0.00020185285,0.0003664517,0.00026172568,0.0025591494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895874,0.0041156216,0.00052691856,0.002233301,0.0023155937,0.0012211016],"domain_scores_gemma":[0.95875853,0.03155201,0.0024013645,0.0051441235,0.0015026724,0.00064114935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008367387,0.0015174102,0.0034664155,0.001029136,0.0015965916,0.004542108,0.0031213448,0.0022381,0.003069275],"category_scores_gemma":[0.05798368,0.00086446083,0.0011768215,0.0017502952,0.0049349307,0.012982644,0.0039229873,0.003350121,0.00092558895],"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.003953987,0.00026459963,0.0064734337,0.0005897007,0.00023753315,0.0007053332,0.00065696565,0.64981794,0.010115734,0.24088414,0.004850704,0.081449926],"study_design_scores_gemma":[0.00004224193,0.000102149024,0.00048241913,0.000030604548,0.00003081342,0.00016841173,0.00009368208,0.8516952,0.006450128,0.14001727,0.00085143466,0.00003565227],"about_ca_topic_score_codex":0.0021116582,"about_ca_topic_score_gemma":0.0015991749,"teacher_disagreement_score":0.008367387,"about_ca_system_score_codex":0.0027690255,"about_ca_system_score_gemma":0.0024624611,"threshold_uncertainty_score":0.0442515},"labels":[],"label_agreement":null},{"id":"W4396821580","doi":"10.48550/arxiv.2405.01425","title":"In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Regular polygon; Diffusion; Sampling (signal processing); Computer science; Mathematics; Geometry; Computer vision; Physics","score_opus":0.06861903679308398,"score_gpt":0.22885073136343537,"score_spread":0.16023169457035139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396821580","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.0047295685,0.00011114846,0.99352384,0.00023747949,0.000051317704,0.000037424044,0.000042496347,0.00046111207,0.0008055527],"genre_scores_gemma":[0.3686353,0.00043450753,0.6203812,0.0006883781,0.00023643138,0.0005174175,0.00052829867,0.00094005914,0.00763847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977654,0.0008143309,0.00011575713,0.00049567176,0.0006226329,0.00018612499],"domain_scores_gemma":[0.9920644,0.004977039,0.000462767,0.0013628772,0.0005825788,0.00055032613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036793284,0.0013475843,0.0018267184,0.0009200537,0.00094383414,0.002153417,0.0032610355,0.0023061968,0.0054693213],"category_scores_gemma":[0.017293002,0.0008437,0.0013943102,0.001178548,0.0028172669,0.004236006,0.0048381495,0.0042690393,0.0012068133],"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.0005053829,0.00020216056,0.0018755454,0.00028441864,0.0001401874,0.00020093485,0.00026198724,0.58595634,0.009626164,0.29365468,0.0067595853,0.10053267],"study_design_scores_gemma":[0.000027290265,0.000042433465,0.000054485543,0.000011548407,0.000008345029,0.0000324926,0.000008945732,0.94556314,0.0016985085,0.051592074,0.0009498221,0.000010909918],"about_ca_topic_score_codex":0.0017088449,"about_ca_topic_score_gemma":0.0025242993,"teacher_disagreement_score":0.0054693213,"about_ca_system_score_codex":0.0016516652,"about_ca_system_score_gemma":0.0013311761,"threshold_uncertainty_score":0.019458413},"labels":[],"label_agreement":null},{"id":"W4396860342","doi":"10.5802/ojmo.27","title":"Cardinality-constrained structured data-fitting problems","year":2024,"lang":"en","type":"article","venue":"Open Journal of Mathematical Optimization","topic":"Machine Learning and Algorithms","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 British Columbia","funders":"","keywords":"Cardinality (data modeling); Dual (grammatical number); Iterated function; Mathematical optimization; Constraint (computer-aided design); Computer science; Simple (philosophy); Algorithm; Identification (biology); Mathematics; Data mining","score_opus":0.041852714837984556,"score_gpt":0.3248309299069888,"score_spread":0.2829782150690042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396860342","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.0022660873,0.00009142274,0.9968105,0.00015986052,0.000016296613,0.000043076085,0.000088679706,0.00009204739,0.00043207334],"genre_scores_gemma":[0.13777567,0.0004640554,0.8569955,0.00026370492,0.00015762706,0.0006273593,0.0011197298,0.00027774804,0.0023186235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968087,0.0013551031,0.00017357165,0.0007287103,0.0007221952,0.00021159729],"domain_scores_gemma":[0.9912888,0.005770589,0.0007683662,0.001003563,0.0008827603,0.00028594272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005497186,0.0017277771,0.0027785536,0.0017690674,0.0009731404,0.002611625,0.0039380416,0.0034806265,0.004528982],"category_scores_gemma":[0.023514178,0.0014273524,0.0021291908,0.0024930846,0.0021996398,0.0037140464,0.0059049665,0.004428595,0.0010434437],"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.00012732224,0.000106134954,0.0010664598,0.00032936994,0.00011005777,0.00020571482,0.00017736027,0.81512594,0.0014135952,0.103306435,0.004222216,0.0738094],"study_design_scores_gemma":[0.000015628792,0.000021657328,0.000059363752,0.000027869839,0.000007820811,0.000052136675,0.000026515054,0.942421,0.0005152055,0.05594114,0.0008983672,0.000013205683],"about_ca_topic_score_codex":0.001803496,"about_ca_topic_score_gemma":0.0015019996,"teacher_disagreement_score":0.005497186,"about_ca_system_score_codex":0.0012132314,"about_ca_system_score_gemma":0.0026273835,"threshold_uncertainty_score":0.029072225},"labels":[],"label_agreement":null},{"id":"W4396892922","doi":"10.1145/3651613","title":"A faster FPRAS for #NFA","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"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":"Universitas Brawijaya","keywords":"Computer science","score_opus":0.05590839665298635,"score_gpt":0.3236092414076727,"score_spread":0.26770084475468636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396892922","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.04686186,0.00091565796,0.9237599,0.0026678215,0.00026293486,0.0003441986,0.00073303544,0.018365234,0.0060893386],"genre_scores_gemma":[0.25405577,0.00029658576,0.7367905,0.0011770603,0.00015796606,0.00055620755,0.0011789096,0.0010007727,0.0047861747],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906036,0.0022529073,0.00062711077,0.0026931632,0.0025984272,0.0012247815],"domain_scores_gemma":[0.97547185,0.010808306,0.0012328924,0.010648844,0.0012883602,0.0005498411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00475499,0.001817694,0.002363025,0.0011474699,0.0014953421,0.0038133236,0.0044709877,0.0032283848,0.008695833],"category_scores_gemma":[0.023411658,0.0011835361,0.0043669613,0.0015417513,0.002535764,0.010689813,0.004179268,0.0055577178,0.003308073],"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.0033999984,0.0009794749,0.005673829,0.0014450473,0.0004606624,0.00038046684,0.0011152376,0.13995911,0.05690054,0.26307,0.026730059,0.49988565],"study_design_scores_gemma":[0.00034191582,0.00037551174,0.00074358704,0.00014500218,0.00022951946,0.00048782607,0.00020503068,0.76277417,0.02536229,0.18817267,0.021041544,0.00012095715],"about_ca_topic_score_codex":0.005625187,"about_ca_topic_score_gemma":0.0058719874,"teacher_disagreement_score":0.008695833,"about_ca_system_score_codex":0.0040725237,"about_ca_system_score_gemma":0.005823125,"threshold_uncertainty_score":0.029548347},"labels":[],"label_agreement":null},{"id":"W4398202932","doi":"10.3390/risks12060085","title":"Use of Prediction Bias in Active Learning and Its Application to Large Variable Annuity Portfolios","year":2024,"lang":"en","type":"article","venue":"Risks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Metric (unit); Machine learning; Ambiguity; Portfolio; Econometrics; Sampling (signal processing); Artificial intelligence; Data mining; Mathematics; Engineering; Finance","score_opus":0.03808635608426609,"score_gpt":0.31956280269576604,"score_spread":0.28147644661149995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398202932","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.048125654,0.0008212391,0.9483173,0.0007166616,0.00006518676,0.000072891475,0.000048327835,0.00030057572,0.001532147],"genre_scores_gemma":[0.8572782,0.0005481101,0.1405968,0.00029737374,0.00011648811,0.00013358102,0.00011140917,0.0000590734,0.000858961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945598,0.0034177282,0.00024504075,0.00059895765,0.0009938774,0.0001845253],"domain_scores_gemma":[0.9037023,0.084408805,0.003389701,0.0045128632,0.0032819787,0.00070427125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018039368,0.001144009,0.001454306,0.0010054178,0.0007231161,0.0022362883,0.0019674685,0.0020512159,0.0011596367],"category_scores_gemma":[0.07839145,0.0004714273,0.00065333344,0.001105454,0.0018244811,0.003270866,0.0028787984,0.0028714847,0.00021337098],"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.00059138593,0.0002675666,0.011069157,0.00021031244,0.00017744437,0.0002087797,0.0003838201,0.74677217,0.0038070048,0.07620902,0.0011431682,0.15916015],"study_design_scores_gemma":[0.000026021145,0.00007425257,0.00026817832,0.000019935109,0.000015674563,0.0000381885,0.0000142711715,0.9724975,0.0016541474,0.02505222,0.00032792013,0.000011666668],"about_ca_topic_score_codex":0.0016754662,"about_ca_topic_score_gemma":0.0012304842,"teacher_disagreement_score":0.018039368,"about_ca_system_score_codex":0.0010321632,"about_ca_system_score_gemma":0.0011937938,"threshold_uncertainty_score":0.09540242},"labels":[],"label_agreement":null},{"id":"W4399048835","doi":"10.1007/978-3-031-60599-4_12","title":"CaVE: A Cone-Aligned Approach for Fast Predict-then-optimize with Binary Linear Programs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cave; Binary number; Cone (formal languages); Algorithm; Computer graphics (images); Mathematics; Arithmetic","score_opus":0.01343312036061641,"score_gpt":0.2419434773370101,"score_spread":0.22851035697639369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399048835","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.002235397,0.00025722012,0.9691362,0.0001513631,0.00017370938,0.000109162065,0.0004372554,0.021730386,0.005769405],"genre_scores_gemma":[0.036527295,0.00012597717,0.947889,0.00035520602,0.000101208316,0.00029609905,0.0014208836,0.005457601,0.007826772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987342,0.00027011015,0.00006301778,0.00022960182,0.0005548472,0.00014836612],"domain_scores_gemma":[0.9982633,0.00085003255,0.000075727745,0.0003212718,0.0003760994,0.00011365893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016521685,0.002318791,0.0017612475,0.0011908392,0.0010584681,0.0019389772,0.0039897724,0.0020487665,0.045737952],"category_scores_gemma":[0.00614952,0.0017118867,0.0016767267,0.0016452334,0.00084573566,0.0024936742,0.003189248,0.0050501246,0.013462258],"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.000634915,0.0004909782,0.0010354602,0.00039093173,0.00015079086,0.0002554989,0.00011978995,0.12850128,0.0040716603,0.05788857,0.12451337,0.68194675],"study_design_scores_gemma":[0.00007840585,0.000048629754,0.000113050206,0.000029937415,0.000011569696,0.000041148014,0.000018082927,0.9652442,0.0016334188,0.02442684,0.008335677,0.000018911638],"about_ca_topic_score_codex":0.007873085,"about_ca_topic_score_gemma":0.020499859,"teacher_disagreement_score":0.045737952,"about_ca_system_score_codex":0.0007866424,"about_ca_system_score_gemma":0.0024928213,"threshold_uncertainty_score":0.1530087},"labels":[],"label_agreement":null},{"id":"W4399455309","doi":"10.48550/arxiv.2406.04308","title":"Approximation-Aware Bayesian Optimization","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Biological Infrastructure; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; University of Pennsylvania; National Science Foundation","keywords":"Bayesian optimization; Bayesian probability; Computer science; Econometrics; Artificial intelligence; Economics","score_opus":0.03172677665055935,"score_gpt":0.18348659165282294,"score_spread":0.1517598150022636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399455309","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.0038812403,0.0003236019,0.99264294,0.0003020579,0.000026189928,0.000035008583,0.00008014928,0.00035579377,0.0023530587],"genre_scores_gemma":[0.42170197,0.0009598113,0.5668883,0.00060645945,0.00018126414,0.00036809963,0.0008936392,0.00069475174,0.007705687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780244,0.0009877875,0.000093363975,0.0003934727,0.00054654904,0.00017631675],"domain_scores_gemma":[0.9943064,0.004033686,0.0003185581,0.0005163317,0.00064931734,0.00017567752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037490304,0.0013914547,0.0021888763,0.0009810597,0.0006211332,0.0020403166,0.0023410623,0.0026191815,0.004303626],"category_scores_gemma":[0.014041204,0.0012825473,0.0012416702,0.0012263679,0.0019835087,0.0023747515,0.0027244086,0.003492998,0.0012940766],"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.00009496694,0.00004127661,0.00043223845,0.00013585974,0.000058532998,0.000035631765,0.000051679235,0.9101704,0.0007899506,0.047259245,0.0031437562,0.037786424],"study_design_scores_gemma":[0.000009326681,0.000011923114,0.00004207753,0.000009246468,0.0000057875063,0.0000083878385,0.0000037629723,0.98060566,0.0002674255,0.018444784,0.00058680266,0.000004744302],"about_ca_topic_score_codex":0.006374422,"about_ca_topic_score_gemma":0.005684368,"teacher_disagreement_score":0.006374422,"about_ca_system_score_codex":0.001931257,"about_ca_system_score_gemma":0.002892293,"threshold_uncertainty_score":0.019827008},"labels":[],"label_agreement":null},{"id":"W4399531108","doi":"10.1109/nice61972.2024.10548051","title":"A Recurrent Dynamic Model for Efficient Bayesian Optimization<sup>*</sup>","year":2024,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Computer science; Bayesian optimization; Bayesian probability; Artificial intelligence","score_opus":0.009426391800888952,"score_gpt":0.2677747944627554,"score_spread":0.2583484026618665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399531108","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.0019833874,0.00011663337,0.99401325,0.0002587792,0.000037711354,0.00001411002,0.00004237043,0.00022238448,0.0033113032],"genre_scores_gemma":[0.37893388,0.0006946335,0.59574974,0.00052562915,0.0001740935,0.00035742627,0.0002929115,0.0006184183,0.022653257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967265,0.00012308828,0.000016966342,0.000056186924,0.000101634505,0.00002954423],"domain_scores_gemma":[0.9993981,0.0003410289,0.00006815445,0.00006145719,0.0000952536,0.000035957226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008097686,0.00043665332,0.000615454,0.0002828176,0.00032991893,0.001209293,0.0015109342,0.001134383,0.006721184],"category_scores_gemma":[0.0027699342,0.00042225845,0.0006118734,0.0004817588,0.00079206796,0.0013159397,0.0010462123,0.0016755172,0.0022759226],"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.00009171079,0.000059148082,0.00036720085,0.00010364412,0.00005462963,0.00012303912,0.00012653577,0.5193341,0.00781613,0.36933044,0.008469276,0.09412416],"study_design_scores_gemma":[0.0000034764682,0.0000095192345,0.000022123533,0.000005351287,0.0000034825175,0.000019155437,0.0000037724615,0.97906095,0.0006416213,0.017795648,0.0024298506,0.000005079811],"about_ca_topic_score_codex":0.0021646153,"about_ca_topic_score_gemma":0.0036389611,"teacher_disagreement_score":0.006721184,"about_ca_system_score_codex":0.00073625694,"about_ca_system_score_gemma":0.0007526101,"threshold_uncertainty_score":0.02248466},"labels":[],"label_agreement":null},{"id":"W4399759465","doi":"10.48550/arxiv.2406.10161","title":"On the Computability of Robust PAC Learning","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computability; Computer science; Artificial intelligence; Mathematics education; Mathematics; Theoretical computer science","score_opus":0.06114499898615442,"score_gpt":0.1842416270676044,"score_spread":0.12309662808145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399759465","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.060186114,0.001290456,0.9047314,0.0056537106,0.0001695543,0.00012572455,0.0006132285,0.00063084357,0.026598893],"genre_scores_gemma":[0.9103593,0.0011345069,0.08088778,0.0010964249,0.0005954011,0.00028576376,0.0006065109,0.0003572258,0.0046770996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936342,0.0021881245,0.00033243062,0.0014684281,0.0017713907,0.0006053945],"domain_scores_gemma":[0.94530135,0.04126798,0.002657315,0.007541804,0.0021014716,0.0011301723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006349665,0.0011488342,0.0015013617,0.0015376214,0.0012854168,0.0045175552,0.0022999046,0.0022539534,0.0059324107],"category_scores_gemma":[0.040962763,0.00068293296,0.0021025394,0.001271502,0.010099155,0.011976425,0.0060590496,0.008549252,0.0007576358],"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.00006163383,0.000027494096,0.0005661191,0.00013033579,0.000033625904,0.00006048808,0.00012578636,0.035850182,0.00093710667,0.95543236,0.00086432946,0.005910556],"study_design_scores_gemma":[0.000010912871,0.000031944972,0.0002023655,0.000032768832,0.000012836253,0.00004325808,0.000022370326,0.11179117,0.0011045205,0.8852499,0.0014803216,0.000017507473],"about_ca_topic_score_codex":0.0011031134,"about_ca_topic_score_gemma":0.0007215958,"teacher_disagreement_score":0.006349665,"about_ca_system_score_codex":0.0033887238,"about_ca_system_score_gemma":0.0017133362,"threshold_uncertainty_score":0.03358066},"labels":[],"label_agreement":null},{"id":"W4400149513","doi":"10.2139/ssrn.4880211","title":"Transfer Learning in Bayesian Optimization: An Accelerated Search Strategy","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bayesian optimization; Bayesian probability; Computer science; Transfer of learning; Artificial intelligence; Machine learning","score_opus":0.018975653411124994,"score_gpt":0.29337970840778993,"score_spread":0.2744040549966649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400149513","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.0061318283,0.00052144035,0.98670757,0.00067589455,0.00015632382,0.00006881867,0.000026403228,0.00016939362,0.0055424278],"genre_scores_gemma":[0.24396591,0.0012624855,0.73410326,0.000788363,0.0008831812,0.0010564392,0.00018445267,0.0005599783,0.017195886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981134,0.0011776445,0.00006353149,0.0001367342,0.00041911233,0.00008962153],"domain_scores_gemma":[0.99392635,0.00469075,0.00019330614,0.00042239705,0.000578801,0.00018841734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005360626,0.0013532876,0.0021723981,0.00158218,0.0009013549,0.0015936709,0.002919838,0.0044386955,0.008549697],"category_scores_gemma":[0.02345156,0.0011891695,0.0015501545,0.0019354093,0.0020348295,0.0037548873,0.004373186,0.0038540508,0.001783241],"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.00026204507,0.0002354683,0.00053499016,0.0003290702,0.00016973478,0.00016113119,0.00017764106,0.5045975,0.0013247422,0.37653252,0.008589476,0.10708567],"study_design_scores_gemma":[0.000044844794,0.00003286502,0.000055942135,0.000017584533,0.000017108443,0.000024364632,0.000007517123,0.9438577,0.00015395807,0.054862004,0.00091758225,0.000008532146],"about_ca_topic_score_codex":0.0027613044,"about_ca_topic_score_gemma":0.002298803,"teacher_disagreement_score":0.008549697,"about_ca_system_score_codex":0.0012120047,"about_ca_system_score_gemma":0.0018564324,"threshold_uncertainty_score":0.028601587},"labels":[],"label_agreement":null},{"id":"W4400237039","doi":"10.1145/3663408.3665813","title":"Keep Your Paths Free: Toward Scalable Learning-Based Traffic Engineering","year":2024,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"McGill University","funders":"","keywords":"Computer science; Scalability; Computer network; Distributed computing; Operating system","score_opus":0.010154918771961516,"score_gpt":0.2298597541940117,"score_spread":0.2197048354220502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400237039","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.010030015,0.00013247464,0.9858642,0.00031770405,0.000035923265,0.000043574775,0.00005699663,0.00062179886,0.002897281],"genre_scores_gemma":[0.4907606,0.00043216159,0.5013414,0.0003611923,0.000114372924,0.00027444045,0.00042560662,0.0005221175,0.0057681557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953437,0.00013146311,0.000015803107,0.00007992087,0.00016720843,0.000071306415],"domain_scores_gemma":[0.998752,0.000675622,0.00011346952,0.0001462012,0.0002295862,0.00008310843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011086832,0.0010138898,0.00093389023,0.00058518344,0.0004427816,0.0012020773,0.0018254372,0.0010963436,0.0037495685],"category_scores_gemma":[0.0038809967,0.0005486638,0.000580423,0.0007305552,0.0010348014,0.0022801373,0.0022191522,0.0020797104,0.00082167826],"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.000016857994,0.000031725947,0.00012489868,0.000020549278,0.000007504462,0.000023328148,0.000015127975,0.9732178,0.00064238335,0.0070111407,0.0011472869,0.017741375],"study_design_scores_gemma":[0.00000219364,0.0000033340068,0.0000049519754,0.000001325343,4.848886e-7,0.0000021218707,0.0000021207904,0.996243,0.00007743696,0.0034780134,0.0001843,6.7944586e-7],"about_ca_topic_score_codex":0.005256472,"about_ca_topic_score_gemma":0.005677933,"teacher_disagreement_score":0.005256472,"about_ca_system_score_codex":0.0010553217,"about_ca_system_score_gemma":0.0016473777,"threshold_uncertainty_score":0.012543619},"labels":[],"label_agreement":null},{"id":"W4400275447","doi":"10.1109/tmrb.2024.3422652","title":"Label-Free Adaptive Gaussian Sample Consensus Framework for Learning From Perfect and Imperfect Demonstrations","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Medical Robotics and Bionics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; China Scholarship Council; Canada Foundation for Innovation","keywords":"Imperfect; Gaussian; Sample (material); Computer science; Artificial intelligence; Econometrics; Machine learning; Mathematics; Physics; Philosophy","score_opus":0.02222466351777169,"score_gpt":0.2815202385697144,"score_spread":0.25929557505194273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400275447","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.0076512466,0.00013364412,0.9909622,0.00013681538,0.000020449363,0.0000364346,0.000033022698,0.00051716866,0.0005089623],"genre_scores_gemma":[0.7753989,0.00022977045,0.21806097,0.00031713885,0.00011980738,0.00037067902,0.00038454618,0.0002640063,0.0048542074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983224,0.0005152759,0.00008310788,0.0004460056,0.0004621825,0.00017093954],"domain_scores_gemma":[0.9949468,0.002737228,0.0006111508,0.0005368801,0.0009386305,0.00022926442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031082756,0.0011208438,0.0015647054,0.0007828593,0.00062267785,0.0009766676,0.0027477383,0.0019081789,0.0017195975],"category_scores_gemma":[0.010545602,0.0007009392,0.00071472785,0.00080676784,0.0019245069,0.0017230453,0.0022054696,0.0026391714,0.000577117],"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.00013193442,0.000052767296,0.00044012378,0.00008014332,0.000034703633,0.00007630654,0.000117889365,0.93212837,0.0026385502,0.008571226,0.0008865564,0.05484147],"study_design_scores_gemma":[0.0000073492683,0.000020241534,0.000039898012,0.00000279742,0.000002194037,0.000004864454,0.0000037119464,0.9966456,0.00035921688,0.0027850035,0.00012438669,0.0000046943715],"about_ca_topic_score_codex":0.008548339,"about_ca_topic_score_gemma":0.008264044,"teacher_disagreement_score":0.008548339,"about_ca_system_score_codex":0.0012499559,"about_ca_system_score_gemma":0.0020225132,"threshold_uncertainty_score":0.016997159},"labels":[],"label_agreement":null},{"id":"W4400676397","doi":"10.1007/978-3-031-65112-0_1","title":"Chronosymbolic Learning: Efficient CHC Solving with Symbolic Reasoning and Inductive Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Inductive reasoning; Artificial intelligence; Inductive method; Inductive bias; Theoretical computer science; Mathematics education; Multi-task learning; Teaching method; Mathematics; Task (project management)","score_opus":0.006533803507163764,"score_gpt":0.2260423456541138,"score_spread":0.21950854214695004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400676397","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.009201641,0.00029726455,0.95474714,0.0003292412,0.0001398856,0.00010975726,0.00040572856,0.0044444846,0.030324867],"genre_scores_gemma":[0.12944567,0.0002660924,0.8487033,0.00017315689,0.00013321081,0.00018977524,0.0012193554,0.0009004173,0.018969027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941385,0.00013101374,0.000037569767,0.00016776756,0.00018556952,0.00006419689],"domain_scores_gemma":[0.99871457,0.00075814966,0.000053667423,0.00022869564,0.00018328309,0.00006171989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005577671,0.0010248369,0.0007031213,0.00095913623,0.0011598372,0.0019893649,0.002902316,0.0010497216,0.03438015],"category_scores_gemma":[0.003974208,0.0005117979,0.0008266325,0.0020193271,0.0012617757,0.0033516947,0.0025630924,0.002191274,0.0052778632],"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.00025982154,0.00015705604,0.0004370601,0.0004020297,0.000034996952,0.00014771833,0.00024356702,0.047747336,0.0039936625,0.23824967,0.028649317,0.6796778],"study_design_scores_gemma":[0.000094171395,0.000045584457,0.00016534043,0.00005701759,0.00002561425,0.00011872872,0.00014453176,0.56297356,0.010407867,0.39236632,0.033578664,0.000022558757],"about_ca_topic_score_codex":0.004463324,"about_ca_topic_score_gemma":0.010278231,"teacher_disagreement_score":0.03438015,"about_ca_system_score_codex":0.0011575756,"about_ca_system_score_gemma":0.0021578695,"threshold_uncertainty_score":0.115013},"labels":[],"label_agreement":null},{"id":"W4400725025","doi":"10.1007/978-3-031-64359-0_9","title":"Comparison of Tools and Methods for Technology-Assisted Review","year":2024,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Information retrieval","score_opus":0.08852392516551118,"score_gpt":0.4451655094585418,"score_spread":0.3566415842930306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400725025","genre_codex":"review","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.006871044,0.49229828,0.40662527,0.006836018,0.0051607024,0.0029766567,0.017693672,0.007217534,0.054320868],"genre_scores_gemma":[0.06549645,0.28595543,0.60023296,0.0030826556,0.0031969524,0.007579648,0.014485408,0.0020116349,0.01795882],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.97875506,0.0106328335,0.002646877,0.0013554865,0.0063494486,0.00026031246],"domain_scores_gemma":[0.8533848,0.111005366,0.0064688777,0.0069234865,0.021332024,0.00088535424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02790259,0.0010697356,0.002104463,0.016275758,0.00054489216,0.006714922,0.0025643152,0.00095278746,0.022005454],"category_scores_gemma":[0.16620877,0.0005359989,0.0022850013,0.019100768,0.00073440035,0.005511699,0.0026162511,0.0010520057,0.006077266],"study_design_candidate":"observational","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.00053745566,0.00005887439,0.0013212282,0.017368924,0.0013633941,0.00005197312,0.000403895,0.001493193,0.0006616397,0.026784802,0.0712566,0.878698],"study_design_scores_gemma":[0.0004936228,0.00047796205,0.009815318,0.017885163,0.0039570485,0.00066366914,0.0007460377,0.011999126,0.0042036385,0.07129157,0.8781915,0.00027543496],"about_ca_topic_score_codex":0.0017103448,"about_ca_topic_score_gemma":0.0027182603,"teacher_disagreement_score":0.02790259,"about_ca_system_score_codex":0.0021398917,"about_ca_system_score_gemma":0.0053439583,"threshold_uncertainty_score":0.14756477},"labels":[],"label_agreement":null},{"id":"W4400959673","doi":"10.23952/jano.6.2024.3.03","title":"Unsupervised sample selection for active learning with quadratic programming","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Selection (genetic algorithm); Computer science; Machine learning; Sample (material); Artificial intelligence; Active learning (machine learning); Unsupervised learning; Chemistry","score_opus":0.005992738286746913,"score_gpt":0.23469284714421976,"score_spread":0.22870010885747286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400959673","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.0019408675,0.00014689154,0.9972621,0.00009765527,0.000020990685,0.00003165931,0.000016517752,0.00017065852,0.0003126623],"genre_scores_gemma":[0.3456905,0.00061496254,0.646132,0.0006489903,0.0003362322,0.0009909136,0.00070842804,0.0004580313,0.00442005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796486,0.0010049093,0.00008446651,0.00038537043,0.00043981776,0.00012062551],"domain_scores_gemma":[0.9936877,0.004696619,0.00033611397,0.0002950402,0.0008080568,0.00017654154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044689123,0.0017407062,0.002429373,0.0015185615,0.0007453965,0.0015016583,0.003612876,0.0020191716,0.002850285],"category_scores_gemma":[0.010808228,0.0010753326,0.0014532829,0.0013557179,0.0018759962,0.0022869546,0.0024737078,0.002800024,0.00067308114],"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.00025854082,0.00024616695,0.0014940131,0.00034743786,0.00020033454,0.00013012839,0.00018062764,0.7208311,0.0035645764,0.040116213,0.0047285245,0.22790231],"study_design_scores_gemma":[0.000008378616,0.000016359478,0.000031417734,0.00000509211,0.0000048065085,0.0000080663785,0.000003905239,0.9951768,0.00026846922,0.0041994927,0.0002739069,0.000003189294],"about_ca_topic_score_codex":0.002632877,"about_ca_topic_score_gemma":0.0034522025,"teacher_disagreement_score":0.0044689123,"about_ca_system_score_codex":0.0010526618,"about_ca_system_score_gemma":0.0014309216,"threshold_uncertainty_score":0.023634195},"labels":[],"label_agreement":null},{"id":"W4401035172","doi":"10.5802/ojmo.31","title":"Tight analyses for subgradient descent I: Lower bounds","year":2024,"lang":"lv","type":"article","venue":"Open Journal of Mathematical Optimization","topic":"Machine Learning and Algorithms","field":"Computer Science","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 British Columbia","funders":"","keywords":"Subgradient method; Mathematics; Lipschitz continuity; Upper and lower bounds; Differentiable function; Combinatorics; Convex function; Descent (aeronautics); Matching (statistics); Regular polygon; Function (biology); Discrete mathematics; Mathematical optimization; Pure mathematics; Statistics; Mathematical analysis","score_opus":0.06688709976136888,"score_gpt":0.38187943235358673,"score_spread":0.31499233259221787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401035172","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.010524043,0.00621964,0.92764556,0.0052663563,0.00062275986,0.00018089019,0.0006400722,0.0011487114,0.04775198],"genre_scores_gemma":[0.4947587,0.0101742735,0.41814664,0.00679127,0.0023006897,0.0020578848,0.0031877584,0.004639428,0.05794335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99190044,0.0030365016,0.00025125835,0.0010852715,0.0024507088,0.0012758637],"domain_scores_gemma":[0.968591,0.022514813,0.0015186693,0.0025981606,0.003277055,0.0015003852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013092006,0.005197703,0.0038091,0.0037932934,0.0023098784,0.0065405634,0.004728997,0.0043731984,0.018129278],"category_scores_gemma":[0.07342727,0.0020667827,0.0036492066,0.0034080176,0.0048407903,0.009240924,0.0066945977,0.013446942,0.0038471115],"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.00061144517,0.00033891044,0.0021635778,0.001042491,0.00027332664,0.00034065166,0.0004334284,0.26174027,0.0019680974,0.63215095,0.04424894,0.054688044],"study_design_scores_gemma":[0.000048796344,0.00012444111,0.0004680329,0.0003324039,0.00008559354,0.000085180516,0.00008307617,0.6955363,0.0009709148,0.29310143,0.009127178,0.000036606907],"about_ca_topic_score_codex":0.009993123,"about_ca_topic_score_gemma":0.008642033,"teacher_disagreement_score":0.018129278,"about_ca_system_score_codex":0.0078076543,"about_ca_system_score_gemma":0.005496039,"threshold_uncertainty_score":0.06923801},"labels":[],"label_agreement":null},{"id":"W4401399881","doi":"10.1142/9789811267048_0026","title":"On Removing Diverse Data for Training Machine Learning Models","year":2024,"lang":"en","type":"book-chapter","venue":"Series on computers and operations research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Concordia University; Group for Research in Decision Analysis","funders":"","keywords":"Training (meteorology); Computer science; Machine learning; Artificial intelligence; Training set; Geography","score_opus":0.2136281158318142,"score_gpt":0.36668852896863213,"score_spread":0.15306041313681792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401399881","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.0041760784,0.0012473371,0.9900255,0.0005034927,0.00028573824,0.00007330294,0.00025271924,0.00073668023,0.0026991821],"genre_scores_gemma":[0.076248094,0.0019835758,0.90157604,0.0014090074,0.00087820954,0.0004458893,0.003876234,0.0009228843,0.012660108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667835,0.0016361895,0.0002121329,0.00039281923,0.00094134884,0.00013919633],"domain_scores_gemma":[0.9899984,0.007263696,0.00017178449,0.0016890145,0.00075942255,0.00011758471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053929915,0.0021182136,0.0020804142,0.0016326235,0.0012789865,0.0014456848,0.0037069726,0.002792954,0.005824343],"category_scores_gemma":[0.01940824,0.0011730817,0.0020536936,0.0026951868,0.0018380081,0.00369011,0.0039050053,0.0064035724,0.0032974447],"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.00024347505,0.00022467179,0.0010567645,0.00029780972,0.00020622805,0.00020623396,0.00017549815,0.19916104,0.0038221772,0.030344004,0.034459233,0.7298028],"study_design_scores_gemma":[0.000044446428,0.000068685025,0.00062528194,0.000090666654,0.00006908582,0.00012676869,0.000055536213,0.89684236,0.0035814873,0.0901424,0.008325775,0.000027558464],"about_ca_topic_score_codex":0.0031411694,"about_ca_topic_score_gemma":0.006645326,"teacher_disagreement_score":0.005824343,"about_ca_system_score_codex":0.0005510453,"about_ca_system_score_gemma":0.00081806415,"threshold_uncertainty_score":0.02852124},"labels":[],"label_agreement":null},{"id":"W4401440230","doi":"","title":"Preventing Dimensional Collapse in Contrastive Local Learning with Subsampling","year":2023,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.0083160152041617,"score_gpt":0.22045035421571815,"score_spread":0.21213433901155646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401440230","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.035726137,0.00050747517,0.9617945,0.0003203976,0.00005973021,0.000052398176,0.000050555886,0.00073253695,0.00075619604],"genre_scores_gemma":[0.6313319,0.0003151311,0.36201936,0.0008087438,0.0002593444,0.00025254005,0.00049665524,0.00049489643,0.0040213736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955556,0.002041667,0.0001919082,0.0006557385,0.0012568885,0.00029816586],"domain_scores_gemma":[0.9778039,0.01662157,0.0010142984,0.0024859712,0.0014304583,0.00064373075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006118111,0.0012777938,0.0028436221,0.001187635,0.0012034837,0.0015417014,0.003190197,0.0027715652,0.0021302782],"category_scores_gemma":[0.032244757,0.0013532296,0.0013957954,0.0010608429,0.0031186382,0.0025361364,0.0068636835,0.0036718529,0.00054783374],"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.0018770671,0.00042033682,0.0068322397,0.0005000204,0.00041130124,0.0005271187,0.0007775012,0.55506593,0.023425039,0.103837684,0.01226471,0.294061],"study_design_scores_gemma":[0.000026362553,0.00006472889,0.00023449164,0.000011868298,0.000015704552,0.000060274087,0.000018064162,0.9813813,0.002238948,0.015525478,0.00041155188,0.000011194397],"about_ca_topic_score_codex":0.0044938466,"about_ca_topic_score_gemma":0.006434492,"teacher_disagreement_score":0.006118111,"about_ca_system_score_codex":0.0015992816,"about_ca_system_score_gemma":0.0013692335,"threshold_uncertainty_score":0.032356024},"labels":[],"label_agreement":null},{"id":"W4401548587","doi":"10.1177/10711813241260676","title":"Evaluating Active Learning Strategies for Automated Classification of Patient Safety Event Reports in Hospitals","year":2024,"lang":"en","type":"article","venue":"Proceedings of the Human Factors and Ergonomics Society Annual Meeting","topic":"Machine Learning and Algorithms","field":"Computer Science","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 Toronto","funders":"Agency for Healthcare Research and Quality","keywords":"Workload; Computer science; Annotation; Machine learning; Artificial intelligence; Process (computing); Event (particle physics)","score_opus":0.016893083355104904,"score_gpt":0.299991809120692,"score_spread":0.2830987257655871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401548587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87702316,0.0015227939,0.11416556,0.0010367087,0.000237409,0.00056102575,0.0005865722,0.002502449,0.0023642627],"genre_scores_gemma":[0.94335216,0.00019848919,0.05381291,0.00026109852,0.000088629095,0.0002056581,0.0010543341,0.000052010764,0.0009747755],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9956884,0.0023360148,0.00039363035,0.00085542724,0.0005013752,0.00022519512],"domain_scores_gemma":[0.9704334,0.02372125,0.0012284144,0.001408525,0.0026204698,0.00058787694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008576354,0.001514169,0.00093812274,0.0016313181,0.00064208335,0.0015495952,0.002299618,0.0018646608,0.0009208267],"category_scores_gemma":[0.024795238,0.00045085762,0.0007095382,0.0010026653,0.0008174898,0.0023858265,0.0012688574,0.0015200154,0.00050379854],"study_design_candidate":"bench_or_experimental","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.003848711,0.005714898,0.03383255,0.0005408674,0.0003937672,0.000117208074,0.000595121,0.31915724,0.010193324,0.0013773625,0.005298444,0.61893046],"study_design_scores_gemma":[0.00007344824,0.00058450864,0.0018180582,0.000011737,0.00003294829,0.000018393994,0.00011062392,0.9922065,0.0041661793,0.0006589797,0.00030673677,0.000011770314],"about_ca_topic_score_codex":0.0074391454,"about_ca_topic_score_gemma":0.006947215,"teacher_disagreement_score":0.008576354,"about_ca_system_score_codex":0.0014952745,"about_ca_system_score_gemma":0.0012287229,"threshold_uncertainty_score":0.04535663},"labels":[],"label_agreement":null},{"id":"W4401814194","doi":"10.1090/mcom/4011","title":"Expected decrease for derivative-free algorithms using random subspaces","year":2024,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Linear subspace; Mathematics; Leverage (statistics); Dimension (graph theory); Subspace topology; Algorithm; Mathematical optimization; Computation; Derivative (finance); Function (biology); Pure mathematics; Statistics; Mathematical analysis","score_opus":0.02951130113500457,"score_gpt":0.3173608825810777,"score_spread":0.28784958144607314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401814194","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.07125575,0.0016831215,0.91842806,0.0011181013,0.00008518268,0.00011391943,0.00017085437,0.0006551542,0.0064898073],"genre_scores_gemma":[0.7874347,0.0012548212,0.20369369,0.00059010804,0.00014255632,0.00046017178,0.0005911941,0.0007286056,0.0051041213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949333,0.0021342793,0.00022107389,0.00060672074,0.0015976921,0.0005068652],"domain_scores_gemma":[0.9484633,0.042164866,0.001672034,0.003748432,0.0031181483,0.00083320966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008159072,0.0012431317,0.0012736116,0.0011561672,0.0007947614,0.0023009453,0.0020474838,0.0015736433,0.0035827085],"category_scores_gemma":[0.061387487,0.0005108699,0.0010676195,0.00093312125,0.0027144833,0.00463426,0.0021579629,0.0027831409,0.0008920507],"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.000743978,0.00022044065,0.0035251204,0.00049294665,0.00013229107,0.00011572586,0.00018063639,0.8093181,0.006313924,0.13615747,0.002971073,0.03982826],"study_design_scores_gemma":[0.000017837881,0.000145851,0.0004716415,0.00003663253,0.000017294264,0.000056500307,0.000021598398,0.96669924,0.0020665932,0.02993857,0.00051367073,0.000014596726],"about_ca_topic_score_codex":0.0009191993,"about_ca_topic_score_gemma":0.0009992094,"teacher_disagreement_score":0.008159072,"about_ca_system_score_codex":0.0024217167,"about_ca_system_score_gemma":0.0020828666,"threshold_uncertainty_score":0.04314983},"labels":[],"label_agreement":null},{"id":"W4401857052","doi":"10.1145/3637528.3672048","title":"Predicting Cascading Failures with a Hyperparametric Diffusion Model","year":2024,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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 British Columbia","funders":"","keywords":"Computer science; Diffusion; Reliability engineering; Engineering; Physics","score_opus":0.008385733004966263,"score_gpt":0.2349539293952119,"score_spread":0.22656819639024564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401857052","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.17665762,0.0005642034,0.81878424,0.0011668078,0.000054369735,0.00008376768,0.0004271269,0.0006408035,0.0016210913],"genre_scores_gemma":[0.97589195,0.00031803187,0.021462424,0.00013172686,0.000056886794,0.000073501236,0.00034746336,0.0000434867,0.0016744764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926203,0.00027302894,0.00004303735,0.00022720384,0.000104318846,0.000090385365],"domain_scores_gemma":[0.9909161,0.006882227,0.00096885033,0.0004779067,0.00048655324,0.00026830361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002045581,0.0010660468,0.0012489503,0.0013611589,0.00042078734,0.001409418,0.0017595658,0.0017116977,0.0016842514],"category_scores_gemma":[0.012205505,0.0008519483,0.0010090051,0.0008681195,0.0011212198,0.002425447,0.0016023337,0.002663413,0.0003493147],"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.000051445804,0.00004129224,0.0034864626,0.00003661396,0.00004626245,0.00009405804,0.00004929828,0.9810253,0.00044114797,0.007839397,0.0005367042,0.0063519767],"study_design_scores_gemma":[0.0000030936785,0.0000063894377,0.00017277441,0.0000023751406,0.0000048797224,0.000008722864,0.00000459941,0.9948225,0.00005939194,0.004854498,0.000057394653,0.0000033341903],"about_ca_topic_score_codex":0.0069156503,"about_ca_topic_score_gemma":0.0042754426,"teacher_disagreement_score":0.0069156503,"about_ca_system_score_codex":0.0007962362,"about_ca_system_score_gemma":0.000628897,"threshold_uncertainty_score":0.013750792},"labels":[],"label_agreement":null},{"id":"W4402193272","doi":"10.1145/3670474.3685970","title":"Machine Learning VLSI CAD Experiments Should Consider Atomic Data Groups","year":2024,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","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 British Columbia","funders":"","keywords":"Very-large-scale integration; CAD; Computer science; Computer architecture; Theoretical computer science; Embedded system; Engineering drawing; Engineering","score_opus":0.07244461838837163,"score_gpt":0.3442668887532328,"score_spread":0.2718222703648612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402193272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6473772,0.00051596714,0.32967234,0.0042260448,0.00039985508,0.001673659,0.0025065474,0.0025332668,0.011095117],"genre_scores_gemma":[0.8470707,0.00013602534,0.1459918,0.001065511,0.000054181288,0.0011461034,0.00298767,0.00028056058,0.0012674079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99094254,0.0050500673,0.0005570921,0.0010181768,0.0020362022,0.00039590354],"domain_scores_gemma":[0.95393395,0.027528815,0.0018021549,0.013249959,0.0031527828,0.0003322061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010578685,0.00097158033,0.00080232596,0.00058551034,0.0009959841,0.0015973251,0.00242321,0.0016480702,0.0023214922],"category_scores_gemma":[0.061496135,0.0006426175,0.0007717917,0.000818711,0.0015068315,0.0049671186,0.0016556698,0.002696789,0.000674733],"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.002106906,0.0033244765,0.085253835,0.00064656674,0.0005794444,0.00029904416,0.00050966145,0.63759416,0.02497055,0.017323598,0.014266871,0.2131249],"study_design_scores_gemma":[0.0002795821,0.0037270642,0.015461952,0.00011111985,0.00013527677,0.00025510922,0.0006520035,0.8538988,0.070446834,0.038993146,0.0159396,0.00009949801],"about_ca_topic_score_codex":0.0022540295,"about_ca_topic_score_gemma":0.00390258,"teacher_disagreement_score":0.010578685,"about_ca_system_score_codex":0.0011932004,"about_ca_system_score_gemma":0.0014717053,"threshold_uncertainty_score":0.05594611},"labels":[],"label_agreement":null},{"id":"W4402961816","doi":"10.1007/978-3-031-72775-7_25","title":"Data-to-Model Distillation: Data-Efficient Learning Framework","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Bank of Canada; University of Toronto","funders":"","keywords":"Computer science; Distillation; Artificial intelligence; Machine learning","score_opus":0.04576043651424889,"score_gpt":0.3127651815191225,"score_spread":0.26700474500487364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402961816","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.0018868021,0.00026622173,0.99390864,0.00025412312,0.00006385709,0.000057137007,0.00031631562,0.0018844204,0.0013623411],"genre_scores_gemma":[0.106567025,0.0004688492,0.8805893,0.00040972116,0.00019568217,0.00036141838,0.0025703192,0.0009976332,0.007840047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983662,0.0005773364,0.000092985196,0.00032634073,0.00046935465,0.00016784923],"domain_scores_gemma":[0.99760395,0.0010866643,0.00007897929,0.0006927939,0.00041467955,0.00012295943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026828824,0.001734053,0.002218677,0.0013684859,0.0010650073,0.0023372155,0.005412642,0.0024797597,0.011128466],"category_scores_gemma":[0.00826152,0.0010341214,0.0015522187,0.0023424046,0.001352275,0.004281027,0.006318968,0.0053561605,0.0046256087],"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.00039729147,0.00035404004,0.00045622184,0.00028410228,0.00011703439,0.00015114484,0.0001051708,0.28677106,0.0033146054,0.1429177,0.029347796,0.53578377],"study_design_scores_gemma":[0.000019447796,0.000025196181,0.000028410672,0.0000098433475,0.000009602213,0.000027833194,0.000010729926,0.9343939,0.0017329697,0.06068294,0.0030486453,0.0000104640685],"about_ca_topic_score_codex":0.0043047275,"about_ca_topic_score_gemma":0.0070985355,"teacher_disagreement_score":0.011128466,"about_ca_system_score_codex":0.0012617428,"about_ca_system_score_gemma":0.0027537697,"threshold_uncertainty_score":0.037228405},"labels":[],"label_agreement":null},{"id":"W4403215990","doi":"10.1145/3699824.3699829","title":"Welfare-Maximizing Pooled Testing","year":2024,"lang":"en","type":"article","venue":"ACM SIGecom Exchanges","topic":"Machine Learning and Algorithms","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 Toronto","funders":"","keywords":"Welfare; Econometrics; Computer science; Economics","score_opus":0.03299751274314557,"score_gpt":0.27798834960966173,"score_spread":0.24499083686651615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403215990","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.09370295,0.0011731811,0.879075,0.0025358484,0.00025167465,0.0012651599,0.0011310301,0.0008684444,0.01999675],"genre_scores_gemma":[0.8109961,0.0008216963,0.17260763,0.001482714,0.00027299463,0.0023848196,0.000958029,0.00024430495,0.01023179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9853536,0.010406107,0.00045990228,0.0015471751,0.0010396221,0.0011935962],"domain_scores_gemma":[0.9606303,0.028594218,0.0025348219,0.005277614,0.0016186272,0.0013445369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017691081,0.0025392903,0.0035745762,0.00133431,0.0009707568,0.0022363204,0.004288574,0.0023765098,0.014115041],"category_scores_gemma":[0.0638648,0.0008941277,0.0019302949,0.001702797,0.0024633128,0.0050627287,0.004123395,0.0026609874,0.001591413],"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.0025692654,0.0012097432,0.008488953,0.00090331474,0.00080698164,0.00075257564,0.00057941076,0.30243152,0.0041439612,0.35928112,0.017733572,0.30109963],"study_design_scores_gemma":[0.00050401303,0.0012296626,0.002490398,0.00023254628,0.0003110555,0.0004179017,0.00022311258,0.3973449,0.0025809503,0.5840026,0.010587897,0.0000749375],"about_ca_topic_score_codex":0.0010675906,"about_ca_topic_score_gemma":0.0006857638,"teacher_disagreement_score":0.017691081,"about_ca_system_score_codex":0.0018535639,"about_ca_system_score_gemma":0.0023048106,"threshold_uncertainty_score":0.09356046},"labels":[],"label_agreement":null},{"id":"W4403577738","doi":"10.48550/arxiv.2410.12251","title":"NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Equivalence (formal languages); Constant (computer programming); Orthogonal polynomials; Mathematics; Classical orthogonal polynomials; Pure mathematics; Computer science","score_opus":0.09515973350640454,"score_gpt":0.22880297223851168,"score_spread":0.13364323873210715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403577738","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81138957,0.0012828511,0.13448526,0.011912761,0.0001620143,0.00033120994,0.007210277,0.0015928962,0.03163323],"genre_scores_gemma":[0.9553232,0.00068522774,0.031722154,0.0010351313,0.0002492524,0.00018044087,0.005168985,0.00022438246,0.0054111825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702746,0.0006062876,0.00016257756,0.0008874474,0.00069418206,0.00062194275],"domain_scores_gemma":[0.98174644,0.015132846,0.000799888,0.001057168,0.00059138535,0.0006722788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014118609,0.001055576,0.0016032334,0.0007469331,0.0012473535,0.0029933383,0.0027830708,0.0017557465,0.008152222],"category_scores_gemma":[0.01325595,0.00085823634,0.002226447,0.0012916421,0.0024012383,0.0074499385,0.0029758401,0.0047232443,0.00051941175],"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.0060325,0.0021669911,0.019352663,0.002713085,0.0005881797,0.0015997656,0.0027040893,0.28000838,0.020080322,0.44176534,0.040926747,0.18206184],"study_design_scores_gemma":[0.00086191733,0.00039194408,0.005367586,0.00015600973,0.00025377228,0.0008172782,0.00082465936,0.29955104,0.008601462,0.6754891,0.0076184343,0.00006683825],"about_ca_topic_score_codex":0.007975309,"about_ca_topic_score_gemma":0.006777739,"teacher_disagreement_score":0.008152222,"about_ca_system_score_codex":0.0028056405,"about_ca_system_score_gemma":0.0024212752,"threshold_uncertainty_score":0.027271867},"labels":[],"label_agreement":null},{"id":"W4403721246","doi":"10.1109/icjece.2024.3429273","title":"Supervised <i>t</i>-SNE for Metric Learning With Stochastic and Geodesic Distances","year":2024,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Geodesic; Metric (unit); Mathematics; Artificial intelligence; Computer science; Combinatorics; Statistics; Geometry","score_opus":0.003609875705010711,"score_gpt":0.17569273515928624,"score_spread":0.17208285945427554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403721246","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.0017429503,0.0001447687,0.99723035,0.000051499137,0.00003888152,0.000040739054,0.0000483606,0.0002586406,0.00044387454],"genre_scores_gemma":[0.080198064,0.0004464418,0.9148838,0.00016059495,0.00013407874,0.00048494135,0.0007970983,0.0002853151,0.0026096494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671054,0.0013524406,0.00025509263,0.00069359154,0.00090046134,0.0000878137],"domain_scores_gemma":[0.99655944,0.0014248769,0.0002992369,0.00081427174,0.00079571985,0.000106413194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003207867,0.0012580677,0.001462773,0.0020658083,0.0009361231,0.0014105513,0.002190638,0.0014516196,0.0032371785],"category_scores_gemma":[0.011042189,0.0004828953,0.0017410774,0.002587476,0.0015452566,0.00207558,0.0021589305,0.0024299764,0.0021174508],"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.0001808703,0.00019407734,0.0018733507,0.00036367783,0.00026619318,0.0002020525,0.00021366533,0.21821758,0.0061070197,0.12955327,0.010029432,0.63279885],"study_design_scores_gemma":[0.000006667351,0.000057204303,0.00025646016,0.000018992067,0.000011009558,0.000102191,0.000017675326,0.95906514,0.0014728876,0.035654463,0.0033162753,0.00002097244],"about_ca_topic_score_codex":0.0018682869,"about_ca_topic_score_gemma":0.0024789341,"teacher_disagreement_score":0.0032371785,"about_ca_system_score_codex":0.00077808084,"about_ca_system_score_gemma":0.001556971,"threshold_uncertainty_score":0.016964972},"labels":[],"label_agreement":null},{"id":"W4403916365","doi":"10.1093/9780198925330.003.0003","title":"Countability","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Machine Learning and Algorithms","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 Toronto","funders":"","keywords":"Countable set; Mathematics; Pure mathematics","score_opus":0.011103765755315896,"score_gpt":0.23902489749446829,"score_spread":0.22792113173915238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403916365","genre_codex":"other","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.0076663946,0.0046623186,0.10772158,0.006926753,0.00083292957,0.0000783856,0.00045336952,0.00030869636,0.8713496],"genre_scores_gemma":[0.57029766,0.0075649056,0.0534764,0.003562681,0.0021880523,0.00050066604,0.0014244779,0.00064765423,0.36033753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778193,0.0005594494,0.00013477898,0.0006008377,0.0007636591,0.00015937969],"domain_scores_gemma":[0.99686134,0.0016852412,0.00012829035,0.0005113312,0.00069454784,0.0001192213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013961006,0.0005843291,0.0006306022,0.0018126166,0.002252265,0.0051106466,0.0012316005,0.0012228907,0.027356258],"category_scores_gemma":[0.0061972765,0.0003381954,0.0006936124,0.0015888838,0.009146746,0.009242627,0.0025413213,0.0034154202,0.005024188],"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.0000026434993,0.0000022339418,0.000019481247,0.000019704421,9.318283e-7,0.000010766368,0.0000844467,0.00013461072,0.000045767076,0.99245244,0.0031016723,0.004125278],"study_design_scores_gemma":[0.0000028103668,0.0000049918876,0.000057284073,0.00004306797,0.0000025344866,0.00005868202,0.000052940617,0.00077084254,0.00032152137,0.89855844,0.10012076,0.000006083496],"about_ca_topic_score_codex":0.003268187,"about_ca_topic_score_gemma":0.0019151989,"teacher_disagreement_score":0.027356258,"about_ca_system_score_codex":0.0036472757,"about_ca_system_score_gemma":0.0012262423,"threshold_uncertainty_score":0.09151584},"labels":[],"label_agreement":null},{"id":"W4404031565","doi":"10.1109/icccnt61001.2024.10724595","title":"Mitigating Annotation Burden in Active Learning with Transfer Learning and Iterative Acquisition Functions","year":2024,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"American Water (Canada)","funders":"","keywords":"Computer science; Annotation; Transfer of learning; Active learning (machine learning); Iterative learning control; Artificial intelligence; Machine learning","score_opus":0.005467159691514076,"score_gpt":0.24219485654423936,"score_spread":0.2367276968527253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404031565","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.01761986,0.00030475945,0.9788938,0.00034699167,0.000044337816,0.00009001751,0.00004038283,0.0017237503,0.0009361773],"genre_scores_gemma":[0.5898355,0.00026784095,0.4027137,0.00083859905,0.00016521737,0.0007618031,0.0004668898,0.0005836751,0.0043668705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996463,0.0014504512,0.00022010764,0.00079268566,0.0007871173,0.00028668487],"domain_scores_gemma":[0.9810301,0.012575417,0.0009907498,0.0028631508,0.0020992893,0.00044125112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010226005,0.0024958942,0.0024398386,0.0015729085,0.0013171604,0.0024877435,0.00639865,0.0047479905,0.003031476],"category_scores_gemma":[0.031862006,0.0012589236,0.0012884832,0.0014208381,0.0034692693,0.0074223345,0.0060627265,0.0055146534,0.0013709331],"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.0008175108,0.0005682207,0.0033941073,0.0002764191,0.00019170079,0.00034263302,0.0008483464,0.512038,0.011973748,0.02653773,0.0043937345,0.43861777],"study_design_scores_gemma":[0.000033597255,0.000090712245,0.00014001767,0.000016981181,0.000015915204,0.000035164554,0.000028349577,0.98273414,0.003747348,0.012544798,0.0005982114,0.0000147810515],"about_ca_topic_score_codex":0.0032330053,"about_ca_topic_score_gemma":0.0036695702,"teacher_disagreement_score":0.010226005,"about_ca_system_score_codex":0.001869309,"about_ca_system_score_gemma":0.0022097686,"threshold_uncertainty_score":0.054080963},"labels":[],"label_agreement":null},{"id":"W4404199498","doi":"10.1007/978-3-031-73010-8_19","title":"Generalized Coverage for More Robust Low-Budget Active Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Operations research; Mathematics","score_opus":0.012573944020081282,"score_gpt":0.25789861381640344,"score_spread":0.24532466979632217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404199498","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.0050669205,0.0008293986,0.98876053,0.00049185904,0.00016459698,0.00006925164,0.00027238549,0.0007983394,0.0035467118],"genre_scores_gemma":[0.33150396,0.00091557315,0.6387722,0.0015323207,0.0013497235,0.0008796659,0.0023310783,0.0019231038,0.020792408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99525034,0.0020854655,0.00023064688,0.0010308666,0.0010775356,0.00032514325],"domain_scores_gemma":[0.98035413,0.0148473615,0.00048397394,0.0028834231,0.00097208173,0.0004589823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065560364,0.0025171547,0.0040256446,0.0019320695,0.0007011617,0.003141898,0.0055134925,0.0045552594,0.018116605],"category_scores_gemma":[0.03622302,0.0012104622,0.0017813474,0.002085382,0.0024383906,0.0069670016,0.0060527637,0.0063837613,0.0030467948],"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.000978319,0.00032618453,0.0008890064,0.0008504838,0.00033174403,0.00018649938,0.00022502706,0.44884828,0.009139914,0.24243456,0.023620084,0.27216995],"study_design_scores_gemma":[0.00003967244,0.000050626342,0.000113532624,0.00003782622,0.000024539013,0.000040005678,0.000009015215,0.89488024,0.0010823554,0.10133766,0.0023703924,0.000014136986],"about_ca_topic_score_codex":0.0022394857,"about_ca_topic_score_gemma":0.002697424,"teacher_disagreement_score":0.018116605,"about_ca_system_score_codex":0.0019117931,"about_ca_system_score_gemma":0.0011769526,"threshold_uncertainty_score":0.060606062},"labels":[],"label_agreement":null},{"id":"W4404693164","doi":"10.1007/978-3-031-73024-5_17","title":"Exploring Active Learning in Meta-learning: Enhancing Context Set Labeling","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Active learning (machine learning); Context (archaeology); Set (abstract data type); Artificial intelligence; Machine learning; Programming language","score_opus":0.0663894235555258,"score_gpt":0.2792490876966843,"score_spread":0.21285966414115848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404693164","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.009633622,0.001037396,0.9863542,0.00021431572,0.000084486404,0.000031231488,0.00008386891,0.0008058659,0.0017550566],"genre_scores_gemma":[0.29385954,0.0009138171,0.69983995,0.00026482527,0.00018634545,0.000107457716,0.0005522075,0.00047965668,0.0037962317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881953,0.00046938422,0.0000600274,0.00036177342,0.00022533999,0.000063936015],"domain_scores_gemma":[0.9959752,0.0026180244,0.00015394807,0.00078838953,0.00031676903,0.00014758365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021528904,0.0009760811,0.001183424,0.001068147,0.000711666,0.002747647,0.0031377382,0.0018865758,0.003697816],"category_scores_gemma":[0.0063995477,0.00073413097,0.0011264908,0.0016881895,0.00093040825,0.0059424774,0.0029578255,0.003034279,0.0010806709],"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.0004147574,0.00045088562,0.001728025,0.00045779868,0.00017475165,0.00012378271,0.0005478127,0.11068059,0.014663747,0.043428667,0.00737087,0.8199583],"study_design_scores_gemma":[0.000025175746,0.00010377397,0.00022220412,0.00006264686,0.00006818702,0.00009685167,0.00007614382,0.90773314,0.010039374,0.07583361,0.005718692,0.000020271922],"about_ca_topic_score_codex":0.0011046971,"about_ca_topic_score_gemma":0.00247482,"teacher_disagreement_score":0.003697816,"about_ca_system_score_codex":0.00062903995,"about_ca_system_score_gemma":0.00070864893,"threshold_uncertainty_score":0.012370408},"labels":[],"label_agreement":null},{"id":"W4404876970","doi":"10.1016/j.compchemeng.2024.108952","title":"Point-by-point transfer learning for Bayesian optimization: An accelerated search strategy","year":2024,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Point (geometry); Transfer of learning; Bayesian probability; Bayesian optimization; Computer science; Artificial intelligence; Mathematical optimization; Machine learning; Mathematics; Geometry","score_opus":0.012881379650201698,"score_gpt":0.24790733184072405,"score_spread":0.23502595219052236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404876970","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.003577345,0.00025703193,0.99411374,0.00022213689,0.000031446965,0.000051123705,0.000020092286,0.0004497921,0.0012773194],"genre_scores_gemma":[0.23962297,0.0004954175,0.75353116,0.00057298044,0.00013640702,0.0006738832,0.00024100208,0.00051119376,0.0042149783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991035,0.00038898556,0.000041562165,0.00013425748,0.00025585238,0.00007586829],"domain_scores_gemma":[0.9979189,0.0014141045,0.00012612178,0.0001449698,0.00030333226,0.00009263082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026692878,0.0016202636,0.0020229667,0.001052751,0.0006724864,0.000943474,0.0023402884,0.0022868337,0.0047295406],"category_scores_gemma":[0.0076834946,0.0009526082,0.0011933924,0.0012561937,0.0014758384,0.0019424509,0.0026339816,0.0028780415,0.0014598534],"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.00010584863,0.000109332745,0.00057926495,0.00015695582,0.00007835403,0.00008554953,0.00011315027,0.86574996,0.0017981546,0.025066685,0.00358997,0.102566734],"study_design_scores_gemma":[0.00001095337,0.000015364425,0.000027362948,0.000006667484,0.0000040488458,0.000009058909,0.0000047689136,0.99504495,0.00018552884,0.0042917733,0.0003955151,0.000004041566],"about_ca_topic_score_codex":0.007802514,"about_ca_topic_score_gemma":0.0066983406,"teacher_disagreement_score":0.007802514,"about_ca_system_score_codex":0.0012709438,"about_ca_system_score_gemma":0.002600365,"threshold_uncertainty_score":0.015821874},"labels":[],"label_agreement":null},{"id":"W4405793647","doi":"10.1007/978-3-031-67802-8_10","title":"Optimization of Trap Locations for Narrow Capture Problems","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Saskatchewan","funders":"","keywords":"Trap (plumbing); Computer science; Physics; Meteorology","score_opus":0.014886558887212012,"score_gpt":0.23843541293873582,"score_spread":0.2235488540515238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405793647","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.008102685,0.0011597682,0.9624115,0.00046277672,0.0001707548,0.00010177418,0.0001820059,0.0004372874,0.026971424],"genre_scores_gemma":[0.3439608,0.0031303207,0.5701459,0.0006664924,0.00028287657,0.0010455156,0.0010454517,0.0022092147,0.07751347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951637,0.00016156245,0.000019026136,0.00008928301,0.0001297708,0.00008393364],"domain_scores_gemma":[0.99811625,0.0013189589,0.00013445038,0.00012897821,0.00016758393,0.00013387154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011949013,0.0017539331,0.0017344153,0.000977053,0.00069846865,0.0017631458,0.0025738692,0.0020519383,0.016729943],"category_scores_gemma":[0.007060916,0.001127776,0.0009800013,0.0012779563,0.0014184114,0.0021918411,0.0032733264,0.0033570698,0.0025350414],"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.00016766613,0.0001167555,0.00031202188,0.00039020518,0.000053734653,0.00007449846,0.000120649005,0.7853688,0.0022340482,0.10970299,0.02058134,0.08087729],"study_design_scores_gemma":[0.00003281694,0.00007747302,0.000105506486,0.00007843261,0.000017320777,0.000054052147,0.00006158989,0.9224778,0.0006719666,0.071036406,0.0053652744,0.000021418557],"about_ca_topic_score_codex":0.0019338026,"about_ca_topic_score_gemma":0.0029118557,"teacher_disagreement_score":0.016729943,"about_ca_system_score_codex":0.0012764181,"about_ca_system_score_gemma":0.0012889201,"threshold_uncertainty_score":0.05596727},"labels":[],"label_agreement":null},{"id":"W4406141748","doi":"10.1137/1.9781611978322.25","title":"Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"Engineering and Physical Sciences Research Council","keywords":"Settling; STREAMS; Computer science; Graph; Theoretical computer science; Physics; Computer network","score_opus":0.04045841376012336,"score_gpt":0.2533072176800302,"score_spread":0.21284880391990682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406141748","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.07344201,0.002900251,0.89348936,0.005438722,0.0005089121,0.00028309124,0.0015942749,0.0030278293,0.01931557],"genre_scores_gemma":[0.51305854,0.002612864,0.4486339,0.002060605,0.0010878993,0.0007180591,0.0034942764,0.0024205022,0.025913391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930299,0.0017302559,0.00046480863,0.0017003226,0.0022319348,0.0008428549],"domain_scores_gemma":[0.93462706,0.054320384,0.0019274796,0.0057337205,0.0022883385,0.0011029291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066726473,0.002078816,0.0030239813,0.0013933318,0.002048631,0.005950434,0.0066173864,0.004132239,0.012699328],"category_scores_gemma":[0.06362659,0.0017336863,0.0028665508,0.0037152872,0.0033876738,0.021753594,0.0070884903,0.008627196,0.0026356305],"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.0017658831,0.00037315127,0.0034075512,0.0012439241,0.00029542873,0.00038780615,0.0011032798,0.32041788,0.006668652,0.43990138,0.034327354,0.19010758],"study_design_scores_gemma":[0.00008473148,0.000091012655,0.00028731974,0.000064772496,0.00006890211,0.00013951847,0.00014115068,0.59821373,0.002246338,0.39451107,0.004119799,0.000031541713],"about_ca_topic_score_codex":0.0051780473,"about_ca_topic_score_gemma":0.0056592673,"teacher_disagreement_score":0.012699328,"about_ca_system_score_codex":0.004101234,"about_ca_system_score_gemma":0.003704779,"threshold_uncertainty_score":0.04248351},"labels":[],"label_agreement":null},{"id":"W4406228668","doi":"10.3389/frai.2024.1498956","title":"Dynamic-budget superpixel active learning for semantic segmentation","year":2025,"lang":"en","type":"article","venue":"Frontiers in Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Canada First Research Excellence Fund","keywords":"Segmentation; Computer science; Artificial intelligence","score_opus":0.012702873928516736,"score_gpt":0.30039950337718935,"score_spread":0.28769662944867264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406228668","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.02011907,0.0004393295,0.9756048,0.00029729173,0.00003384027,0.00006819475,0.00016033968,0.0019149755,0.0013621163],"genre_scores_gemma":[0.5288436,0.00037971494,0.46660236,0.00044796284,0.000073234805,0.00023950516,0.00083875365,0.00046409565,0.0021108568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988476,0.00027821356,0.00006823797,0.00032862765,0.00037655578,0.0001007813],"domain_scores_gemma":[0.9975924,0.0011791722,0.00021135306,0.00049787556,0.0003989524,0.000120276374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002216084,0.0010335152,0.001169815,0.0009158781,0.000501368,0.0016642902,0.0030383868,0.0015463377,0.00345697],"category_scores_gemma":[0.0065010316,0.0006361697,0.00085146906,0.0012907849,0.0011296263,0.0040467703,0.0019981128,0.0016954425,0.000718375],"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.00067196524,0.00028325416,0.0022749912,0.00022367302,0.00010639972,0.0001494048,0.00028316342,0.56226146,0.02849633,0.019656166,0.0066868737,0.3789064],"study_design_scores_gemma":[0.000014930339,0.000026956699,0.00015768204,0.000008332554,0.000008289809,0.00003316553,0.000018358396,0.98566955,0.00653925,0.006442465,0.0010726285,0.000008307434],"about_ca_topic_score_codex":0.0046327473,"about_ca_topic_score_gemma":0.005582564,"teacher_disagreement_score":0.0046327473,"about_ca_system_score_codex":0.0016005833,"about_ca_system_score_gemma":0.0013346347,"threshold_uncertainty_score":0.011719942},"labels":[],"label_agreement":null},{"id":"W4408086612","doi":"10.1002/9781394242177.ch1","title":"AI &amp; IP","year":2025,"lang":"en","type":"other","venue":"","topic":"Machine Learning and Algorithms","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 Ottawa","funders":"","keywords":"Computer science; Computational biology; Chemistry; Biology","score_opus":0.006685844300739991,"score_gpt":0.2716288826096321,"score_spread":0.2649430383088921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408086612","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020174995,0.0005860651,0.0016923146,0.0019979419,0.0015777746,0.00007449892,0.00054795784,0.0007228237,0.9925989],"genre_scores_gemma":[0.0046847686,0.0009577237,0.0016729246,0.0014183845,0.0008911141,0.00011262611,0.0006734458,0.0005090399,0.9890799],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981323,0.00023634787,0.00013206038,0.00039419276,0.00086847047,0.00023667765],"domain_scores_gemma":[0.9969131,0.0004893975,0.00016320666,0.00083679636,0.0011562181,0.00044132836],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013147884,0.0009952532,0.0008025775,0.0019961228,0.0031843553,0.015082053,0.0017983536,0.004526865,0.67685944],"category_scores_gemma":[0.006036843,0.0006794112,0.00079281675,0.002580191,0.0022197794,0.008283071,0.004158356,0.003178204,0.65133727],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000064992055,0.000050625273,0.00017581189,0.00030502456,0.000007300924,0.00022515397,0.00018324974,0.00017120219,0.0005568741,0.06872616,0.7525176,0.17701593],"study_design_scores_gemma":[0.0000056975105,0.000008359581,0.000118487784,0.000043018288,0.0000013671378,0.00009728153,0.000035514382,0.00011181541,0.00012570257,0.005237531,0.9942093,0.000005908472],"about_ca_topic_score_codex":0.0024752626,"about_ca_topic_score_gemma":0.0024338332,"teacher_disagreement_score":0.67685944,"about_ca_system_score_codex":0.0027369342,"about_ca_system_score_gemma":0.0022926866,"threshold_uncertainty_score":0.46092075},"labels":[],"label_agreement":null},{"id":"W4408141514","doi":"10.1093/restud/rdaf014","title":"Simultaneous Search and Adverse Selection","year":2025,"lang":"en","type":"article","venue":"The Review of Economic Studies","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"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":"Deutsche Forschungsgemeinschaft","keywords":"Adverse selection; Economics; Selection (genetic algorithm); Econometrics; Microeconomics; Computer science; Machine learning","score_opus":0.019041177403460993,"score_gpt":0.3323290739836644,"score_spread":0.3132878965802034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408141514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5896062,0.0021891634,0.36242634,0.004591211,0.00019847542,0.00018455254,0.00021946653,0.00023183535,0.04035277],"genre_scores_gemma":[0.99218595,0.00032241445,0.0037015057,0.0001709615,0.000077921235,0.000055113913,0.000022605982,0.000009125023,0.003454372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962031,0.0021510965,0.00014115269,0.00042799354,0.00043129333,0.0006452382],"domain_scores_gemma":[0.97530115,0.016989628,0.00410024,0.0016089021,0.0007190026,0.0012811992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00463637,0.0007496411,0.0022539664,0.0012262657,0.0011015697,0.0029524153,0.0017218761,0.002858511,0.008915622],"category_scores_gemma":[0.022971543,0.0005889,0.0015506101,0.0009303565,0.0043243,0.0046823826,0.0033679553,0.002260072,0.0006879629],"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.00044073412,0.0002495781,0.00669644,0.00037715983,0.00032641768,0.001765912,0.00065552146,0.24614687,0.003681653,0.713169,0.003695007,0.022795727],"study_design_scores_gemma":[0.0002358345,0.00023937457,0.001846392,0.000057514415,0.0000655905,0.0004470831,0.00019636951,0.394908,0.0005367658,0.59928066,0.0021222515,0.00006418914],"about_ca_topic_score_codex":0.0013677458,"about_ca_topic_score_gemma":0.00079640205,"teacher_disagreement_score":0.008915622,"about_ca_system_score_codex":0.0010936289,"about_ca_system_score_gemma":0.00074996945,"threshold_uncertainty_score":0.029825747},"labels":[],"label_agreement":null},{"id":"W4408353424","doi":"10.1109/icassp49660.2025.10889822","title":"Efficient Learning of Balanced Signed Graphs via Iterative Linear Programming","year":2025,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear programming; Computer science; Iterative learning control; Iterative method; Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence","score_opus":0.005010017240646336,"score_gpt":0.25538505359620595,"score_spread":0.25037503635555963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408353424","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.004961637,0.00006310723,0.99346995,0.0001572162,0.000016561651,0.000034101053,0.000057341716,0.000613074,0.0006270437],"genre_scores_gemma":[0.27669144,0.00024658724,0.7157567,0.0004688378,0.000114611896,0.0004874976,0.0012376368,0.0006227372,0.004373891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986358,0.00049267104,0.00005771948,0.0003389536,0.00031730524,0.0001575089],"domain_scores_gemma":[0.9959104,0.0027991403,0.00029541267,0.00026637985,0.00055101735,0.00017766384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019487863,0.002220303,0.0020614218,0.0013394706,0.0006141505,0.0017090166,0.0026727924,0.0022670492,0.0037474763],"category_scores_gemma":[0.010155239,0.0012705262,0.0013580157,0.0015128669,0.0014575156,0.0029932389,0.0026439994,0.0028123215,0.0014936869],"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.00007768999,0.00009376744,0.00045166005,0.00013505925,0.000050249484,0.00008882448,0.00006859806,0.8298943,0.0024271526,0.017293287,0.0042377813,0.14518167],"study_design_scores_gemma":[0.0000044106123,0.000008245352,0.000016156953,0.00000257254,0.0000016905276,0.000004614279,0.0000048261077,0.9927596,0.00018975942,0.0068824827,0.00012341041,0.0000023126127],"about_ca_topic_score_codex":0.0050545926,"about_ca_topic_score_gemma":0.008349692,"teacher_disagreement_score":0.0050545926,"about_ca_system_score_codex":0.0014635455,"about_ca_system_score_gemma":0.00235239,"threshold_uncertainty_score":0.012536526},"labels":[],"label_agreement":null},{"id":"W4411022335","doi":"10.1145/3742796","title":"Gradient Boosted Programming for Low Cardinality Classification","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cardinality (data modeling); Computer science; Artificial intelligence; Data mining","score_opus":0.012232340414358186,"score_gpt":0.270142507485868,"score_spread":0.2579101670715098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411022335","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.0038434714,0.00013028926,0.99463165,0.00011400472,0.000020439627,0.000026024698,0.000025922347,0.00024697222,0.00096113497],"genre_scores_gemma":[0.23267451,0.00035413945,0.76120925,0.00028363895,0.00016225179,0.0004109608,0.0003244544,0.0002486996,0.0043320693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985259,0.00064098486,0.00005121689,0.00022755044,0.0004252791,0.0001291432],"domain_scores_gemma":[0.9978289,0.0013977229,0.00012587251,0.00022322068,0.00033830298,0.0000860548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00339865,0.00086151285,0.0014633128,0.00080451666,0.0005245844,0.0011717264,0.0015574672,0.0012714874,0.002305802],"category_scores_gemma":[0.006178228,0.0005230333,0.0009213366,0.0011344629,0.0008185734,0.0014998021,0.0013074017,0.002845433,0.00077781576],"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.000077632794,0.000105216415,0.0009479634,0.000096308315,0.0000630673,0.00006766269,0.00007203439,0.8114957,0.0017525823,0.050136186,0.0034007712,0.13178483],"study_design_scores_gemma":[0.0000036680674,0.00001454854,0.000045265202,0.000004303121,0.0000034812458,0.000009659537,0.0000029019736,0.98032045,0.00030516667,0.018721875,0.0005664114,0.0000024082492],"about_ca_topic_score_codex":0.0014406211,"about_ca_topic_score_gemma":0.0017969382,"teacher_disagreement_score":0.00339865,"about_ca_system_score_codex":0.0007472813,"about_ca_system_score_gemma":0.0013087922,"threshold_uncertainty_score":0.017974019},"labels":[],"label_agreement":null},{"id":"W4412347816","doi":"10.1007/s10703-025-00481-6","title":"Rounding meets approximate model counting","year":2025,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Machine Learning and Algorithms","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 Toronto","funders":"National Supercomputing Centre Singapore; Ministry of Education, India; Ministry of Education - Singapore; National Research Foundation Singapore; National Research Foundation","keywords":"Rounding; Mathematics; Computer science; Operating system","score_opus":0.048295583550084335,"score_gpt":0.37390378712247896,"score_spread":0.3256082035723946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412347816","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.050541192,0.0019373499,0.8964686,0.005588735,0.0009323908,0.00034449162,0.001849633,0.0044200243,0.037917547],"genre_scores_gemma":[0.55168617,0.0012617175,0.42162523,0.002126041,0.0010667496,0.0006642212,0.003593586,0.0012547125,0.016721578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98949045,0.003489228,0.00056069077,0.0019335634,0.0033200274,0.0012061681],"domain_scores_gemma":[0.97017676,0.018271547,0.0013304475,0.0077217296,0.0018129252,0.0006866289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004306962,0.0021122873,0.0032029764,0.0021847829,0.0020024632,0.0062726242,0.003582867,0.003018724,0.0145237185],"category_scores_gemma":[0.034528706,0.0010628337,0.003256968,0.0034609854,0.0028119,0.009563016,0.0053309156,0.0067155366,0.0030748143],"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.0011781007,0.00038068224,0.0022346515,0.0009273858,0.00020216645,0.0003877421,0.00032497165,0.29908627,0.0035787935,0.4575689,0.045024924,0.18910553],"study_design_scores_gemma":[0.000079167934,0.0000787573,0.00017780521,0.00006129712,0.000050061994,0.0001860004,0.00008301904,0.5071805,0.0020225225,0.4843812,0.005673836,0.000025760122],"about_ca_topic_score_codex":0.0033614151,"about_ca_topic_score_gemma":0.0041695354,"teacher_disagreement_score":0.0145237185,"about_ca_system_score_codex":0.0034168246,"about_ca_system_score_gemma":0.0031306127,"threshold_uncertainty_score":0.048586667},"labels":[],"label_agreement":null},{"id":"W4412377140","doi":"10.1145/3726302.3730171","title":"Bias-Aware Curriculum Sampling For Fair Ranking","year":2025,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","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 Toronto; Toronto Metropolitan University","funders":"","keywords":"Computer science; Ranking (information retrieval); Curriculum; Sampling (signal processing); Artificial intelligence; Machine learning; Statistics; Psychology; Mathematics; Telecommunications; Pedagogy","score_opus":0.027704343447798208,"score_gpt":0.31859614858649465,"score_spread":0.29089180513869645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412377140","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.035335895,0.00053815113,0.959701,0.00038103046,0.00007538312,0.0002620257,0.000106272666,0.0014421201,0.0021580968],"genre_scores_gemma":[0.68048775,0.0003596684,0.31107074,0.00069847633,0.00026093418,0.0006524976,0.00051865407,0.0002972934,0.0056539606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594253,0.0020571218,0.00018338178,0.0006423294,0.00079741253,0.00037723506],"domain_scores_gemma":[0.99104685,0.0047260085,0.0005839688,0.0018398428,0.001325572,0.00047777288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00690895,0.0012017705,0.0021258441,0.0011679616,0.0012204585,0.0014291159,0.002513079,0.0018030024,0.0042644544],"category_scores_gemma":[0.027152216,0.000536508,0.0006943432,0.0011621669,0.0013786533,0.0030951058,0.002575145,0.0021418924,0.0016503698],"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.0010178596,0.00091113785,0.0067130863,0.0004182248,0.00014529521,0.00017813574,0.00044411665,0.34493122,0.017252857,0.04260681,0.0121218115,0.5732594],"study_design_scores_gemma":[0.00012551133,0.00031190933,0.0007685485,0.000033452852,0.00003413895,0.00008555498,0.00004685764,0.95462066,0.00666593,0.0349267,0.002349668,0.000030965606],"about_ca_topic_score_codex":0.0018759863,"about_ca_topic_score_gemma":0.0041848645,"teacher_disagreement_score":0.00690895,"about_ca_system_score_codex":0.0013867755,"about_ca_system_score_gemma":0.0028169039,"threshold_uncertainty_score":0.03653848},"labels":[],"label_agreement":null},{"id":"W4412380831","doi":"10.1007/978-3-031-98694-9_10","title":"A Feature-Driven Acquisition Strategy Using Scale-Invariant Descriptors for Deep Active Learning in Preclinical CT Segmentation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Invariant (physics); Pattern recognition (psychology); Scale (ratio); Computer vision; Cartography; Mathematics","score_opus":0.02608660762390048,"score_gpt":0.312552778947027,"score_spread":0.2864661713231265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412380831","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.0059108115,0.000236202,0.9924482,0.00009490256,0.000027461923,0.000046326997,0.000060194383,0.00053002464,0.0006458272],"genre_scores_gemma":[0.2087651,0.00059978245,0.7842329,0.00023149278,0.000079557205,0.0001726936,0.0004873252,0.00036844533,0.005062634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997962,0.00003191964,0.000016664093,0.00004427835,0.000081241924,0.000029612343],"domain_scores_gemma":[0.99951947,0.00019729708,0.000042752024,0.00006829767,0.00013803222,0.000034182056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086483074,0.0005860544,0.00082925137,0.00075184996,0.000257986,0.0012227516,0.0016800177,0.0010116522,0.0027300708],"category_scores_gemma":[0.0014053448,0.0005859081,0.0006823553,0.0009278418,0.0004228639,0.0010722558,0.0013673968,0.0013812904,0.0011254477],"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.00018906445,0.0001787469,0.0007028205,0.00014233193,0.00006290448,0.00007157343,0.000075258235,0.07364973,0.06990907,0.0110188015,0.0046158493,0.8393839],"study_design_scores_gemma":[0.000011143314,0.00007027139,0.00031555715,0.0000121647145,0.000020952559,0.00011874802,0.000011796733,0.972623,0.021784207,0.0031154621,0.0019024315,0.000014309648],"about_ca_topic_score_codex":0.0020414372,"about_ca_topic_score_gemma":0.0037769775,"teacher_disagreement_score":0.0027300708,"about_ca_system_score_codex":0.00045045943,"about_ca_system_score_gemma":0.0010018861,"threshold_uncertainty_score":0.009132981},"labels":[],"label_agreement":null},{"id":"W4413216539","doi":"10.1145/3712255.3734237","title":"Interpreting Tangled Program Graphs Under Partially Observable Dota 2 Invoker Tasks","year":2025,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Machine Learning and Algorithms","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":"Dalhousie University","funders":"","keywords":"DOTA; Observable; Computer science; Programming language; Physics; Chemistry","score_opus":0.01512294136339989,"score_gpt":0.25940539483243424,"score_spread":0.24428245346903435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413216539","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.03582605,0.000060502283,0.955602,0.00052611105,0.00003167921,0.00009296079,0.00032101263,0.0025708836,0.0049687577],"genre_scores_gemma":[0.5862873,0.00018130771,0.4065795,0.0003230123,0.00003806572,0.0002783867,0.00079929235,0.0009912964,0.004521859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846447,0.00062146084,0.00010124599,0.00031570005,0.00034062145,0.00015648792],"domain_scores_gemma":[0.99572766,0.0022919704,0.00042902617,0.0009344111,0.0004615293,0.00015555423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014244526,0.0008260305,0.00034159468,0.0009289051,0.00059610145,0.0020249314,0.001172689,0.0011056593,0.0035176186],"category_scores_gemma":[0.0087448135,0.0004970538,0.0013531935,0.0003671558,0.0037630124,0.0041493243,0.0027713412,0.0022327132,0.0004411396],"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.00013761596,0.000071169416,0.0023475473,0.0002004209,0.00004430969,0.00095296575,0.0021508904,0.1277347,0.010016512,0.8082154,0.0018086191,0.04631984],"study_design_scores_gemma":[0.000023835391,0.00004148669,0.0003768359,0.000039302493,0.000029180293,0.00014096014,0.00020935008,0.24033137,0.00693987,0.7448864,0.006951561,0.000029978819],"about_ca_topic_score_codex":0.005187232,"about_ca_topic_score_gemma":0.007704767,"teacher_disagreement_score":0.005187232,"about_ca_system_score_codex":0.0016381205,"about_ca_system_score_gemma":0.0011997883,"threshold_uncertainty_score":0.011885405},"labels":[],"label_agreement":null},{"id":"W4414197619","doi":"10.1109/dac63849.2025.11133351","title":"Approximate SMT Counting Beyond Discrete Domains","year":2025,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisfiability modulo theories; Projection (relational algebra); Domain (mathematical analysis); Solver; Hash function; Discrete logarithm; Suite; Logarithm","score_opus":0.004362921437147791,"score_gpt":0.2493068462120201,"score_spread":0.2449439247748723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414197619","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.1044168,0.0022057882,0.8609963,0.0040329765,0.0004891888,0.00029393754,0.002284842,0.008244149,0.017036075],"genre_scores_gemma":[0.5395606,0.0007180866,0.44855633,0.0009917825,0.00025725111,0.00039484559,0.0031327624,0.0010898903,0.0052983165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99447787,0.001687446,0.0003613807,0.00095644867,0.0019842284,0.0005326445],"domain_scores_gemma":[0.98574835,0.0091795,0.0007375474,0.0027163846,0.0012621451,0.00035609267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032671231,0.0013467984,0.0016212241,0.0018471243,0.0011481751,0.0035680772,0.0031546673,0.0016899004,0.009904744],"category_scores_gemma":[0.027372306,0.0006140548,0.0017668449,0.0030745554,0.0017130001,0.009475101,0.0041958755,0.0032712172,0.0013730844],"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.00075729174,0.00025134816,0.006334053,0.0009657004,0.00025842348,0.0003628548,0.00039053732,0.32324344,0.006079464,0.31057206,0.029211437,0.3215734],"study_design_scores_gemma":[0.000054305376,0.000056821846,0.00020584426,0.000060435334,0.0000328248,0.00009330132,0.00007892243,0.799689,0.0021812276,0.19342305,0.0041082366,0.000015994721],"about_ca_topic_score_codex":0.003699951,"about_ca_topic_score_gemma":0.007877635,"teacher_disagreement_score":0.009904744,"about_ca_system_score_codex":0.00276872,"about_ca_system_score_gemma":0.0043937294,"threshold_uncertainty_score":0.03313464},"labels":[],"label_agreement":null},{"id":"W4414499125","doi":"10.46254/na10.20250082","title":"A Computational Framework for Vaccine Selection: Comparing MEREC and CRITIC Weighting Techniques","year":2025,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; King Fahd University of Petroleum and Minerals","keywords":"Weighting; Selection (genetic algorithm); Process (computing); Pandemic; Product (mathematics); Analytic hierarchy process","score_opus":0.009910985562473267,"score_gpt":0.30652357786689494,"score_spread":0.29661259230442166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414499125","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.013197744,0.00037500545,0.97801787,0.0008592348,0.00009616527,0.00013654734,0.000071570226,0.00008367256,0.007162219],"genre_scores_gemma":[0.47127026,0.00060975424,0.5221754,0.0004792385,0.00020829681,0.0008152114,0.0002408446,0.00011982979,0.004081193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941121,0.0044004875,0.0001286648,0.00036590607,0.0007842933,0.00020858206],"domain_scores_gemma":[0.96689534,0.028318157,0.0010899066,0.00096606143,0.002262549,0.00046802484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012319123,0.0014124035,0.0018313698,0.0026447026,0.00095222984,0.0023653158,0.0028695017,0.0018982359,0.0053612585],"category_scores_gemma":[0.035995413,0.0008630711,0.0012757089,0.0019403471,0.0019586587,0.0022993565,0.0024254252,0.0028819358,0.0003941833],"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.000056015513,0.000047656547,0.0007481307,0.00013957128,0.00008066211,0.00004513529,0.00009804317,0.8902721,0.00020292032,0.08339899,0.0008777808,0.024033],"study_design_scores_gemma":[0.000010603338,0.000019277573,0.00006784612,0.000021163309,0.0000093407125,0.000008089953,0.000013104793,0.98192376,0.000046588793,0.017418852,0.00045550516,0.0000058918217],"about_ca_topic_score_codex":0.006317219,"about_ca_topic_score_gemma":0.007051675,"teacher_disagreement_score":0.012319123,"about_ca_system_score_codex":0.0021909978,"about_ca_system_score_gemma":0.002643807,"threshold_uncertainty_score":0.0651505},"labels":[],"label_agreement":null},{"id":"W4414943628","doi":"10.48550/arxiv.2507.10797","title":"Multi-Armed Sampling Problem and the End of Exploration","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut de Valorisation des Données; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Regret; Reinforcement learning; Sampling (signal processing); Thompson sampling; Convergence (economics); Context (archaeology); Sample (material); Contrast (vision)","score_opus":0.06852553140865048,"score_gpt":0.3101442841313991,"score_spread":0.24161875272274863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414943628","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.024900544,0.0006792048,0.9670214,0.0016551373,0.00007555166,0.00006665702,0.00008032193,0.00019496583,0.005326218],"genre_scores_gemma":[0.7805443,0.00070107623,0.21023011,0.0008088422,0.00023542445,0.00053440634,0.00018256601,0.00018663896,0.006576628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99441975,0.0037175883,0.00017708808,0.0007869196,0.00052417896,0.00037444488],"domain_scores_gemma":[0.9726061,0.022186747,0.0014446974,0.0022326438,0.0007361775,0.0007936789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008170638,0.0010887665,0.0019212131,0.00063671044,0.0009432237,0.0023129496,0.0018924971,0.0025043006,0.00362943],"category_scores_gemma":[0.035799354,0.0008295778,0.0012462444,0.0006625677,0.0037172453,0.0047787363,0.002526083,0.0043195416,0.00053949637],"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.00048075008,0.00013142437,0.0019470445,0.00018407946,0.00013854848,0.0002330128,0.0003272037,0.32515642,0.0014213474,0.6375301,0.002282794,0.030167323],"study_design_scores_gemma":[0.00006049779,0.00009425011,0.00025575748,0.000047134425,0.000018528935,0.000068550755,0.000036843147,0.62179255,0.00061554986,0.37535292,0.0016376183,0.000019771182],"about_ca_topic_score_codex":0.0009759036,"about_ca_topic_score_gemma":0.0009115404,"teacher_disagreement_score":0.008170638,"about_ca_system_score_codex":0.0015036816,"about_ca_system_score_gemma":0.0015836805,"threshold_uncertainty_score":0.043210983},"labels":[],"label_agreement":null},{"id":"W4415068418","doi":"10.1016/j.compchemeng.2025.109408","title":"Simultaneous outlier-exclusion and distributionally robust learning through partial optimal transport","year":2025,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Outlier; Ambiguity; Robust optimization; Residual; Robust regression; Set (abstract data type); Process (computing); Robustness (evolution); Construct (python library)","score_opus":0.004470038388133853,"score_gpt":0.20686566976350765,"score_spread":0.2023956313753738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415068418","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.010924499,0.00009472762,0.9880505,0.00014823681,0.000011457622,0.000019568182,0.0000262469,0.00024257119,0.00048222867],"genre_scores_gemma":[0.6998171,0.00026068155,0.29557595,0.00026776167,0.00007427295,0.00019741063,0.00041450944,0.00036007518,0.0030321314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873,0.0004742008,0.00008401635,0.0002694709,0.0002969882,0.00014531294],"domain_scores_gemma":[0.9977729,0.0012250636,0.0002986838,0.00025532016,0.00035860535,0.000089432346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00332185,0.0015325104,0.0020484105,0.0010319203,0.00079504965,0.0016852089,0.0023247877,0.0017777805,0.0013240064],"category_scores_gemma":[0.009131607,0.00081136514,0.0016537107,0.0013562862,0.0021825659,0.0030415417,0.0030867073,0.0021306714,0.00030904615],"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.00005734827,0.000033678796,0.0005025995,0.00004532626,0.00003954531,0.000059418635,0.00004644178,0.96178335,0.001215965,0.012864283,0.00040176127,0.022950437],"study_design_scores_gemma":[0.000003401758,0.000014607657,0.000034936773,0.000002529834,0.0000030931976,0.000008276248,0.000005271531,0.9937245,0.00044700882,0.005624892,0.00012756145,0.000003913108],"about_ca_topic_score_codex":0.0051578907,"about_ca_topic_score_gemma":0.0034306815,"teacher_disagreement_score":0.0051578907,"about_ca_system_score_codex":0.0013616399,"about_ca_system_score_gemma":0.002483974,"threshold_uncertainty_score":0.017567873},"labels":[],"label_agreement":null},{"id":"W4415139805","doi":"10.1007/s10115-025-02601-4","title":"Learning to rank under uncertainty: a robust neural approach","year":2025,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"ENCODE; Probabilistic logic; Relevance (law); Generalizability theory; Ambiguity; Divergence-from-randomness model; Rank (graph theory); Space (punctuation); Learning to rank","score_opus":0.011889342082284602,"score_gpt":0.2471812885091502,"score_spread":0.2352919464268656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415139805","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.0067036697,0.0006665194,0.99041754,0.0005320853,0.000083439845,0.000027722357,0.00009434563,0.0002742593,0.0012003455],"genre_scores_gemma":[0.64415485,0.0017188677,0.34229273,0.00076862174,0.0012084096,0.00024333433,0.00072786084,0.00027634387,0.008608928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996405,0.0013744821,0.00023914114,0.00077054923,0.0009109923,0.00029977603],"domain_scores_gemma":[0.98621446,0.009069901,0.0012462233,0.0013553407,0.0018373303,0.00027678534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062491074,0.0013695915,0.0029353302,0.0026730301,0.00091738516,0.0031894648,0.0034902308,0.0036039113,0.0035628087],"category_scores_gemma":[0.032782543,0.0010511671,0.0012207406,0.0022593623,0.0028881375,0.0053334907,0.0029805892,0.0031081217,0.0008564648],"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.00022422559,0.00012090826,0.00081812154,0.00021868055,0.00023537687,0.00010852948,0.00008668525,0.7401189,0.001457297,0.07555168,0.0046612695,0.17639834],"study_design_scores_gemma":[0.000009788282,0.000027894781,0.00009504177,0.00001346052,0.000019411154,0.000020538666,0.0000070335404,0.9599388,0.00031572732,0.039236564,0.00030054623,0.0000151455915],"about_ca_topic_score_codex":0.0047296574,"about_ca_topic_score_gemma":0.0030934012,"teacher_disagreement_score":0.0062491074,"about_ca_system_score_codex":0.0011749123,"about_ca_system_score_gemma":0.0016639988,"threshold_uncertainty_score":0.03304887},"labels":[],"label_agreement":null},{"id":"W4415903164","doi":"10.24963/kr.2025/55","title":"Pushdown Reward Machines for Reinforcement Learning","year":2025,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Exploit; Constant (computer programming); Pushdown automaton; Finite-state machine; Extension (predicate logic); Counterfactual thinking; Task (project management); Automaton","score_opus":0.0073980349498888815,"score_gpt":0.27201531612218754,"score_spread":0.26461728117229866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415903164","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.005575958,0.0002891063,0.9915803,0.0002226598,0.000048807353,0.00005789144,0.00007231512,0.0006352843,0.0015176046],"genre_scores_gemma":[0.5346224,0.0007420531,0.4580865,0.00041221082,0.00015069297,0.0008540702,0.00032115047,0.0002973563,0.004513677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978816,0.0009090424,0.00016730983,0.00049207365,0.0003965327,0.00015354178],"domain_scores_gemma":[0.9905854,0.0074085067,0.00047173744,0.00084441825,0.00048154357,0.0002084173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023275986,0.0011270365,0.0010060281,0.0006452682,0.0006742724,0.0017297255,0.0016131073,0.0015868474,0.0045780125],"category_scores_gemma":[0.01369083,0.00063306506,0.0011811913,0.00063875597,0.0022066443,0.0026985635,0.0016885061,0.0036691504,0.0008404184],"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.00021023289,0.00008613692,0.0008791531,0.00026158066,0.00008147599,0.00014812862,0.00017831157,0.6325661,0.0035579023,0.29400498,0.001720955,0.06630501],"study_design_scores_gemma":[0.000020579384,0.000051051666,0.00007476685,0.000019884004,0.000013455936,0.000028411388,0.000008759419,0.8362065,0.0013087542,0.16051127,0.0017385216,0.000018021561],"about_ca_topic_score_codex":0.0015397283,"about_ca_topic_score_gemma":0.0017999636,"teacher_disagreement_score":0.0045780125,"about_ca_system_score_codex":0.0015483128,"about_ca_system_score_gemma":0.0013321559,"threshold_uncertainty_score":0.015314996},"labels":[],"label_agreement":null},{"id":"W4416159334","doi":"10.48550/arxiv.2511.07417","title":"Language Generation with Infinite Contamination","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Countable set; Generator (circuit theory); Limit (mathematics); Oracle; Fraction (chemistry); Minimax; Third generation","score_opus":0.026316235675086792,"score_gpt":0.2794779266072273,"score_spread":0.2531616909321405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416159334","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.16875261,0.00092639914,0.8110125,0.0032677406,0.000083351035,0.00020245195,0.00063462905,0.0014112339,0.013709053],"genre_scores_gemma":[0.9400578,0.00031431956,0.05123331,0.00078834087,0.00013915561,0.00031197138,0.0005678542,0.0002780471,0.006309043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9908388,0.0034914643,0.0003556562,0.0022090622,0.0021158927,0.0009890076],"domain_scores_gemma":[0.93016785,0.050302584,0.004634331,0.010864386,0.0021989767,0.0018318867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057559256,0.0013480341,0.0015785896,0.0011900772,0.0014691113,0.002890223,0.0031560715,0.0029278814,0.0046042437],"category_scores_gemma":[0.061196025,0.00089162024,0.0015694159,0.001045322,0.0057484014,0.008369111,0.0065639354,0.0056905947,0.0012843845],"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.0007767831,0.00038899225,0.008472426,0.0004250007,0.00020289423,0.0011710165,0.0017210315,0.43331632,0.009925952,0.4993929,0.003536384,0.040670317],"study_design_scores_gemma":[0.000059747617,0.00017338079,0.00051164173,0.00004232468,0.00003110237,0.00032799825,0.000112659756,0.5914443,0.0043566963,0.4009004,0.001996546,0.000043181648],"about_ca_topic_score_codex":0.0010725453,"about_ca_topic_score_gemma":0.000585114,"teacher_disagreement_score":0.0057559256,"about_ca_system_score_codex":0.0025416925,"about_ca_system_score_gemma":0.0013048738,"threshold_uncertainty_score":0.030440629},"labels":[],"label_agreement":null},{"id":"W4416335450","doi":"10.18280/isi.300911","title":"Enhancing Relief Feature Selection via Uncertainty Sampling in Active Learning","year":2025,"lang":"","type":"article","venue":"Ingénierie des systèmes d information","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Active learning (machine learning); Feature selection; Selection (genetic algorithm); Feature (linguistics); Sampling (signal processing)","score_opus":0.007785236117595917,"score_gpt":0.2521425139316872,"score_spread":0.24435727781409128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416335450","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.014180718,0.0002841959,0.9845783,0.00012900372,0.00003951037,0.000022912602,0.000014650492,0.00015564513,0.0005950864],"genre_scores_gemma":[0.7316922,0.00030169223,0.2642508,0.00028923145,0.0002039011,0.00016102084,0.00012290518,0.00013293022,0.0028452217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989791,0.00040308293,0.000043981676,0.00013285788,0.00035255458,0.000088602676],"domain_scores_gemma":[0.9961809,0.0028028437,0.00018752656,0.0002560084,0.00048266305,0.00009014569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002614199,0.0007951447,0.0017493964,0.0007898159,0.00046236662,0.0011283959,0.0018384238,0.0018587877,0.0018371501],"category_scores_gemma":[0.008365669,0.0005464908,0.00074193213,0.0006959411,0.0009986669,0.0019404736,0.0017749893,0.0014411988,0.000386558],"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.00059046416,0.00028953986,0.0012647021,0.0002914382,0.00012035949,0.00016059238,0.00016240295,0.61082023,0.017307792,0.024351668,0.0033216067,0.3413191],"study_design_scores_gemma":[0.000012865812,0.00003990528,0.00007372754,0.000004369406,0.0000066340112,0.000020619242,0.0000038120484,0.99536055,0.0012479855,0.0030136816,0.00021110197,0.0000046260902],"about_ca_topic_score_codex":0.0007113751,"about_ca_topic_score_gemma":0.0007410358,"teacher_disagreement_score":0.002614199,"about_ca_system_score_codex":0.00037885833,"about_ca_system_score_gemma":0.0004026748,"threshold_uncertainty_score":0.013825357},"labels":[],"label_agreement":null},{"id":"W4416351046","doi":"10.4230/lipics.itcs.2026.22","title":"Simplicial Covering Dimension of Extremal Concept Classes","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dimension (graph theory); Simplicial complex; Class (philosophy); Simplicial manifold; Topological space; Simplicial approximation theorem; Dimension theory (algebra); Space (punctuation); Zero-dimensional space","score_opus":0.01638444906693456,"score_gpt":0.27563893332953243,"score_spread":0.2592544842625979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416351046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8102048,0.0010037238,0.1759945,0.00065750896,0.000048027945,0.000037382877,0.0004191044,0.00013897692,0.0114959255],"genre_scores_gemma":[0.98869973,0.00020962353,0.009903633,0.00003633187,0.000048330567,0.000034455516,0.00018430603,0.00002084347,0.0008627247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910647,0.0001909003,0.000042568445,0.00020818973,0.00029297028,0.00015895512],"domain_scores_gemma":[0.99447757,0.0033192995,0.0005762478,0.0005892904,0.00045256008,0.00058512983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013402815,0.00035195245,0.00063920364,0.0024435495,0.0012060807,0.0030854691,0.00081128516,0.00068757555,0.003364049],"category_scores_gemma":[0.009540906,0.0003000597,0.00051170134,0.0009162024,0.0027301023,0.004338139,0.0021877924,0.0011421079,0.00019961261],"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.00006457185,0.00003302924,0.006934588,0.0000785674,0.00003746138,0.000101477905,0.00038569968,0.012785104,0.0023889898,0.96358705,0.0009814845,0.012621941],"study_design_scores_gemma":[0.000011034478,0.000038009035,0.0035544639,0.0000367079,0.000020944193,0.00029402986,0.00019025555,0.14697121,0.0017941497,0.84445053,0.0026068108,0.000031773554],"about_ca_topic_score_codex":0.00040930597,"about_ca_topic_score_gemma":0.00033079705,"teacher_disagreement_score":0.003364049,"about_ca_system_score_codex":0.0013296284,"about_ca_system_score_gemma":0.0003072113,"threshold_uncertainty_score":0.011253893},"labels":[],"label_agreement":null},{"id":"W4416353551","doi":"10.48550/arxiv.2511.12039","title":"Positive Characteristic Sets for Relational Pattern Languages","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Relevance (law); Context (archaeology); Set (abstract data type); Class (philosophy); Word (group theory); String (physics); Statistical relational learning; Relational database","score_opus":0.030917407985119504,"score_gpt":0.3145953865389807,"score_spread":0.28367797855386123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416353551","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.18906046,0.0007962783,0.7958597,0.0016768926,0.000058463138,0.000118509124,0.0010726658,0.00063848105,0.010718575],"genre_scores_gemma":[0.8369869,0.00060115353,0.15555783,0.0005892625,0.00029673416,0.0005300443,0.0014298625,0.0002699925,0.003738215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951578,0.0012075545,0.00032774577,0.0012113394,0.0016985083,0.00039704316],"domain_scores_gemma":[0.9455804,0.042592008,0.003869294,0.00408477,0.002496013,0.0013775119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048098713,0.0005679741,0.001079647,0.0031035228,0.0014987899,0.0038405547,0.0018319434,0.001347037,0.00389933],"category_scores_gemma":[0.03886347,0.0007012549,0.0014058768,0.0026673109,0.005855085,0.010365305,0.003925552,0.003854917,0.00066151336],"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.00014613428,0.00007171279,0.0029472832,0.0001680546,0.000040187086,0.00024261465,0.00087136036,0.012524635,0.003358535,0.9494679,0.0020956271,0.028065806],"study_design_scores_gemma":[0.000019414138,0.000037536145,0.00061508984,0.000031900476,0.0000116980955,0.0003178479,0.00012598942,0.048951257,0.0015464853,0.94564617,0.002668658,0.000027945325],"about_ca_topic_score_codex":0.00048115163,"about_ca_topic_score_gemma":0.00040739425,"teacher_disagreement_score":0.0048098713,"about_ca_system_score_codex":0.0020995121,"about_ca_system_score_gemma":0.0011325377,"threshold_uncertainty_score":0.025437355},"labels":[],"label_agreement":null},{"id":"W4416399866","doi":"10.48550/arxiv.2510.07862","title":"On the Optimality of Tracking Fisher Information in Adaptive Testing with Stochastic Binary Responses","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Machine Learning and Algorithms","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Computerized adaptive testing; Binary number; Margin (machine learning); Statistic; Simple (philosophy); Statistical hypothesis testing; Identification (biology); Key (lock); Test statistic","score_opus":0.06114816217732075,"score_gpt":0.2823567521103623,"score_spread":0.22120858993304157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416399866","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.05847176,0.0003570125,0.9373116,0.0011214202,0.000023907924,0.00011732819,0.000112809736,0.00027576083,0.002208422],"genre_scores_gemma":[0.83084786,0.0003591938,0.1653792,0.0005526287,0.0001159291,0.00037095154,0.00025613248,0.00014749524,0.0019705917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9864162,0.009191341,0.000486111,0.0017813614,0.0014310604,0.00069389667],"domain_scores_gemma":[0.7355884,0.25099128,0.005254125,0.005003004,0.0021035399,0.0010596138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.032127067,0.0017346811,0.00309633,0.0018317123,0.0009110981,0.0020921743,0.0037870908,0.0037285963,0.0029583303],"category_scores_gemma":[0.18219344,0.0010881673,0.0011792682,0.0016097587,0.007551185,0.006988673,0.00455914,0.0037910612,0.00055959733],"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.0015000742,0.00043270376,0.011321214,0.00043427927,0.00026509745,0.0004478755,0.00090319203,0.5811336,0.0043922267,0.26752374,0.0020038115,0.12964226],"study_design_scores_gemma":[0.000081378035,0.00017908642,0.0010061404,0.00004118304,0.000021458984,0.00007109259,0.000041140014,0.86723286,0.0013911425,0.1297022,0.00019620704,0.000036191097],"about_ca_topic_score_codex":0.0033687109,"about_ca_topic_score_gemma":0.0015119043,"teacher_disagreement_score":0.032127067,"about_ca_system_score_codex":0.0020291593,"about_ca_system_score_gemma":0.0015672521,"threshold_uncertainty_score":0.1699062},"labels":[],"label_agreement":null},{"id":"W4416715375","doi":"10.1016/j.ic.2025.105383","title":"On the containment problem for deterministic multicounter machine models","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Containment (computer programming); Selection (genetic algorithm); Work (physics); Mathematical model; Control (management)","score_opus":0.009763061285680595,"score_gpt":0.25988773795508324,"score_spread":0.25012467666940263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416715375","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.022021089,0.0009291162,0.9629188,0.0018091153,0.00007429159,0.0001330414,0.00039980022,0.0008410705,0.010873637],"genre_scores_gemma":[0.6196556,0.0015250482,0.36040077,0.0013582103,0.0004950962,0.0011148455,0.0019900578,0.00083056267,0.012629874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99094135,0.0027877227,0.00064608356,0.0024342237,0.0023223558,0.000868315],"domain_scores_gemma":[0.95482767,0.03842204,0.0020619642,0.0029403563,0.0012041574,0.0005438884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004521655,0.001256037,0.0020793027,0.0018265429,0.002210571,0.00409708,0.0039628157,0.0030827394,0.0060470947],"category_scores_gemma":[0.027753621,0.0014847768,0.003313838,0.0022081672,0.006050297,0.011687974,0.0054507223,0.006100146,0.0009173782],"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.00006692106,0.00006290814,0.00051758054,0.00021936418,0.00003797544,0.0003887665,0.00077540963,0.042380843,0.0012776994,0.9406313,0.0015132305,0.012128042],"study_design_scores_gemma":[0.000021627575,0.000024202245,0.000086985994,0.000045862573,0.000026333419,0.00018585949,0.00007457077,0.14967012,0.0017080357,0.8447351,0.0033984028,0.000022865304],"about_ca_topic_score_codex":0.003876886,"about_ca_topic_score_gemma":0.0025228085,"teacher_disagreement_score":0.0060470947,"about_ca_system_score_codex":0.0035760351,"about_ca_system_score_gemma":0.002263455,"threshold_uncertainty_score":0.02594608},"labels":[],"label_agreement":null},{"id":"W4417232422","doi":"10.1061/9780784486115.056","title":"An Active Learning Pipeline Powered by Image Synthetization and Retrieval Techniques: A Novel Training Approach for Construction-Centric DNNs","year":2025,"lang":"","type":"article","venue":"","topic":"Machine Learning and Algorithms","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 Toronto","funders":"","keywords":"Oracle; Pipeline (software); Active learning (machine learning); Image (mathematics); Focus (optics); Deep learning; Realization (probability); Enabling","score_opus":0.010271193395905353,"score_gpt":0.27207000383404484,"score_spread":0.26179881043813946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417232422","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.014126365,0.00010193136,0.9824452,0.00013371985,0.000027023527,0.000057988418,0.0000577749,0.0013780119,0.0016721032],"genre_scores_gemma":[0.5022932,0.0001777448,0.49251387,0.00025992468,0.000042563333,0.00018028589,0.00044389337,0.00035217206,0.003736378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996319,0.00007484896,0.00001967408,0.000115992254,0.000113753435,0.000043819648],"domain_scores_gemma":[0.99904364,0.00033265672,0.00006969859,0.00029259475,0.00018763568,0.000073667085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014386907,0.0008054667,0.00043355027,0.00054525974,0.00032343867,0.0011129869,0.0024253987,0.0010282212,0.0034791697],"category_scores_gemma":[0.0031167043,0.00049005024,0.00042506104,0.00041312882,0.0013032275,0.0025343264,0.0018529807,0.0018275932,0.0007789017],"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.00034924588,0.000256453,0.0022826097,0.00024313992,0.0000752151,0.0002011451,0.00034428795,0.4368467,0.07356213,0.051535323,0.003523189,0.43078053],"study_design_scores_gemma":[0.0000071113777,0.00006774942,0.00010992759,0.000009334048,0.0000064145543,0.00003847925,0.000014159237,0.97567004,0.015248034,0.0067720814,0.002050601,0.0000061655232],"about_ca_topic_score_codex":0.0013879291,"about_ca_topic_score_gemma":0.00215951,"teacher_disagreement_score":0.0034791697,"about_ca_system_score_codex":0.00079285784,"about_ca_system_score_gemma":0.0008385665,"threshold_uncertainty_score":0.011638999},"labels":[],"label_agreement":null},{"id":"W45393323","doi":"10.1007/978-3-642-21254-3_14","title":"Automatic Learning of Subclasses of Pattern Languages","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Learnability; Class (philosophy); Alphabet; Variable (mathematics); Regular language; Abstract family of languages; Programming language; Artificial intelligence; Automaton; Constant (computer programming); Theoretical computer science; Natural language processing; Mathematics; Second-generation programming language; Linguistics; Fifth-generation programming language","score_opus":0.012181278538922546,"score_gpt":0.2497563777844709,"score_spread":0.23757509924554837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45393323","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.1464914,0.0009965501,0.8277185,0.00091127073,0.0001532952,0.00023096101,0.0021567217,0.01264574,0.008695629],"genre_scores_gemma":[0.44843894,0.0005782355,0.530317,0.0003755226,0.00012816198,0.00023517829,0.009924973,0.0015268911,0.008475148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911076,0.00015579752,0.00009663609,0.00033597235,0.00021601998,0.00008479608],"domain_scores_gemma":[0.99463886,0.0027168023,0.00031577947,0.0013556588,0.00074344885,0.00022949355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010626394,0.0005900009,0.00097192335,0.0016500156,0.00063033507,0.0016620125,0.0019823387,0.00088753604,0.0048871445],"category_scores_gemma":[0.0064225714,0.0008295287,0.0017010407,0.0011787445,0.0006722048,0.004707825,0.0020249805,0.0022357746,0.0016670868],"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.0004529143,0.0002496145,0.0099877855,0.0005431551,0.0001246497,0.00030502374,0.00030866428,0.013250102,0.024725799,0.038682897,0.020369695,0.8909997],"study_design_scores_gemma":[0.00009934983,0.00013392014,0.004063695,0.00017598971,0.00010066464,0.00088929024,0.00032111086,0.75663024,0.02478707,0.19557151,0.017188337,0.00003890228],"about_ca_topic_score_codex":0.0012442275,"about_ca_topic_score_gemma":0.0032986766,"teacher_disagreement_score":0.0048871445,"about_ca_system_score_codex":0.00060171087,"about_ca_system_score_gemma":0.0009617763,"threshold_uncertainty_score":0.016349077},"labels":[],"label_agreement":null},{"id":"W593234165","doi":"","title":"The sample complexity of agnostic learning under deterministic labels","year":2014,"lang":"en","type":"article","venue":"Conference on Learning Theory","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"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":"Sample complexity; Dimension (graph theory); Computer science; Class (philosophy); Sample (material); Function (biology); Set (abstract data type); VC dimension; Binary number; Artificial intelligence; Probably approximately correct learning; Computational complexity theory; Machine learning; Theoretical computer science; Algorithm; Mathematics; Computational learning theory; Active learning (machine learning); Combinatorics","score_opus":0.03920515464262433,"score_gpt":0.2815507529389313,"score_spread":0.24234559829630695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W593234165","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.2493138,0.0017012926,0.73309684,0.0055748248,0.00009699439,0.00023643108,0.0010461628,0.001416733,0.0075168894],"genre_scores_gemma":[0.82162565,0.000926794,0.1691489,0.0011534123,0.00027821248,0.0005483532,0.002177966,0.00039510717,0.0037455813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98961055,0.004722027,0.0006573863,0.0022482136,0.002072667,0.00068929273],"domain_scores_gemma":[0.8608232,0.11929782,0.0043333266,0.011357113,0.0028626495,0.0013257893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01270111,0.0011780766,0.0024388803,0.0012393396,0.001231807,0.0043087797,0.0032454082,0.0028731974,0.0030212007],"category_scores_gemma":[0.084173895,0.0010653732,0.0015025424,0.0014790545,0.0037959989,0.009947721,0.0041306578,0.0055505517,0.00059915084],"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.0022073565,0.0004125736,0.01248381,0.0007282103,0.00028224254,0.00026746906,0.0006557585,0.5908399,0.005420724,0.27416113,0.007389394,0.105151415],"study_design_scores_gemma":[0.00007522441,0.0001163119,0.0013476921,0.000044889897,0.0000325524,0.00013463611,0.00005715348,0.7880032,0.0017697221,0.20772515,0.00066077453,0.00003262799],"about_ca_topic_score_codex":0.0020635948,"about_ca_topic_score_gemma":0.00203125,"teacher_disagreement_score":0.01270111,"about_ca_system_score_codex":0.0042271777,"about_ca_system_score_gemma":0.0026571695,"threshold_uncertainty_score":0.06717068},"labels":[],"label_agreement":null},{"id":"W607505555","doi":"10.1017/cbo9781107298019","title":"Understanding Machine Learning: From Theory To Algorithms","year":2015,"lang":"en","type":"book","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3092,"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":"Computer science; Artificial intelligence; Field (mathematics); Machine learning; Computational learning theory; Stability (learning theory); Algorithmic learning theory; Stochastic gradient descent; Algorithm; Presentation (obstetrics); Convexity; Online machine learning; Artificial neural network; Mathematics","score_opus":0.08769515514832724,"score_gpt":0.2691373180682896,"score_spread":0.18144216291996237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W607505555","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033085083,0.21126646,0.5012818,0.033390284,0.004599967,0.00015176916,0.0009490849,0.0011904481,0.24386175],"genre_scores_gemma":[0.11257095,0.32358357,0.35341692,0.013935858,0.010934203,0.0007105184,0.003079225,0.0012760743,0.18049271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990528,0.00027266893,0.000043104155,0.00014319013,0.0004335697,0.00005468069],"domain_scores_gemma":[0.99800235,0.0014944122,0.00007254169,0.00015596402,0.00021297453,0.00006173614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011674755,0.0011648041,0.0010683617,0.0017947699,0.0007316839,0.006891694,0.0018565552,0.001963809,0.014338729],"category_scores_gemma":[0.0066627464,0.00074588717,0.00076421624,0.0027131657,0.003305907,0.009513234,0.0020503358,0.005000899,0.0071950923],"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.000010482627,0.000022691784,0.00019906927,0.00067032344,0.00003053263,0.00006720437,0.0003795416,0.006166649,0.0002981108,0.78096557,0.08655315,0.12463659],"study_design_scores_gemma":[0.0000037518364,0.000010917285,0.00018652389,0.00033658743,0.0000067475567,0.00010116053,0.00011060685,0.005795313,0.00013729637,0.7633676,0.22993192,0.000011652151],"about_ca_topic_score_codex":0.0012572285,"about_ca_topic_score_gemma":0.0009176828,"teacher_disagreement_score":0.014338729,"about_ca_system_score_codex":0.0018007099,"about_ca_system_score_gemma":0.0014947285,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W6581905","doi":"10.1007/978-3-319-06483-3_16","title":"Active Learning Strategies for Semi-Supervised DBSCAN","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Supervised learning; Pattern recognition (psychology); Artificial neural network","score_opus":0.01346121511558944,"score_gpt":0.2538646676027252,"score_spread":0.24040345248713574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6581905","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.00184302,0.00025315682,0.9959716,0.000059736718,0.000033238346,0.000022995397,0.000044395947,0.00047744936,0.0012943642],"genre_scores_gemma":[0.16366489,0.0005770649,0.8238305,0.00020074377,0.00017734506,0.00029345747,0.00068110024,0.0007095846,0.009865357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997865,0.0006681616,0.00018269614,0.00037548642,0.0007694965,0.00013917543],"domain_scores_gemma":[0.9947246,0.0031512538,0.00017956631,0.0007335649,0.0010525337,0.00015850479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028107867,0.0013197316,0.0020684071,0.0016422842,0.0010279993,0.003049664,0.0059520286,0.0022712583,0.007109032],"category_scores_gemma":[0.00975376,0.0011647769,0.0011826921,0.0022525117,0.001785745,0.003985182,0.0035570678,0.0033000596,0.0023156924],"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.00033672774,0.00019515758,0.000468885,0.00023343442,0.00012989275,0.000099158075,0.0002629266,0.3088056,0.0034815262,0.14015466,0.009078722,0.53675336],"study_design_scores_gemma":[0.000012033641,0.000022569124,0.000035096808,0.000013177555,0.000009073927,0.00004087146,0.000021727772,0.9441051,0.0012728708,0.052673616,0.0017827353,0.000011079843],"about_ca_topic_score_codex":0.0043257107,"about_ca_topic_score_gemma":0.0060135834,"teacher_disagreement_score":0.007109032,"about_ca_system_score_codex":0.0009208017,"about_ca_system_score_gemma":0.0014129921,"threshold_uncertainty_score":0.023782134},"labels":[],"label_agreement":null},{"id":"W6929237367","doi":"10.48660/07060041","title":"Mathematical structures of Quantum Mechanics and connections to operational principles","year":2007,"lang":"en","type":"other","venue":"PIRSA","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum; Mathematical structure; Mathematical model; Field (mathematics)","score_opus":0.021264119708285123,"score_gpt":0.283477856351623,"score_spread":0.26221373664333786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929237367","genre_codex":"other","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.028829914,0.012710243,0.45915142,0.012407135,0.0013799224,0.00008463915,0.0007888386,0.0007501202,0.48389766],"genre_scores_gemma":[0.6668321,0.013717186,0.1684709,0.0016842925,0.0031621412,0.00033595893,0.0009568899,0.00064188166,0.14419872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928373,0.00029886572,0.000031665695,0.00010617959,0.00022944878,0.000050089962],"domain_scores_gemma":[0.9989668,0.0004809418,0.000102008686,0.00019306113,0.0001951611,0.000062006315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011102,0.00074522995,0.0005998394,0.001905643,0.0013923608,0.004221172,0.0011934482,0.0015902566,0.022558322],"category_scores_gemma":[0.003867175,0.00042138222,0.00056199194,0.0027354418,0.0038089587,0.0060435594,0.0016653507,0.003258569,0.0034322306],"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.0000022642894,0.000004773333,0.000016896052,0.000016200005,0.0000014600139,0.000005729043,0.00002992606,0.000316038,0.000046327674,0.9935508,0.0022278961,0.0037818146],"study_design_scores_gemma":[0.0000020444197,0.0000021171682,0.000027469921,0.000014065323,0.0000013014568,0.000016063945,0.000012258075,0.0024162456,0.00005531408,0.9868847,0.010565192,0.0000031809086],"about_ca_topic_score_codex":0.0012826322,"about_ca_topic_score_gemma":0.0012168231,"teacher_disagreement_score":0.022558322,"about_ca_system_score_codex":0.0016255884,"about_ca_system_score_gemma":0.0013386002,"threshold_uncertainty_score":0.07546514},"labels":[],"label_agreement":null},{"id":"W6930583400","doi":"10.5281/zenodo.13800496","title":"Ozyptila praticola","year":2024,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Period (music); Window (computing); Time line; Data source","score_opus":0.022481193110994717,"score_gpt":0.2546752280114928,"score_spread":0.23219403490049806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930583400","genre_codex":"other","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.20272067,0.016781218,0.010328005,0.0035757278,0.0015804251,0.0014726791,0.011497059,0.002592285,0.74945194],"genre_scores_gemma":[0.75025314,0.013128654,0.023267815,0.0016911848,0.0007945143,0.00065635605,0.008195235,0.00025268318,0.20176043],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998067,0.000023104645,0.000022287135,0.000065262975,0.000054008295,0.00002871386],"domain_scores_gemma":[0.9998449,0.000021009613,0.000048749316,0.000026298358,0.000037108424,0.000021964888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018967508,0.0007825125,0.00045386556,0.0013294733,0.0012914053,0.00068984786,0.00067117804,0.00042179055,0.04717226],"category_scores_gemma":[0.00048969325,0.00034615293,0.00024040688,0.00091477885,0.00059689884,0.0016178633,0.0017388064,0.00097422814,0.018853327],"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.00040049024,0.00010102444,0.015560374,0.0016506271,0.000040698,0.002334578,0.002671908,0.00029600508,0.03183118,0.007915114,0.07301086,0.8641871],"study_design_scores_gemma":[0.00005099554,0.00030961097,0.08284654,0.00042661067,0.00005966858,0.004735424,0.0012997125,0.00034580633,0.0026241972,0.0014176976,0.9058469,0.000036754187],"about_ca_topic_score_codex":0.004007645,"about_ca_topic_score_gemma":0.010883016,"teacher_disagreement_score":0.04717226,"about_ca_system_score_codex":0.0003747656,"about_ca_system_score_gemma":0.000595348,"threshold_uncertainty_score":0.15780687},"labels":[],"label_agreement":null},{"id":"W6930597812","doi":"10.5281/zenodo.12226006","title":"industrie du papier pdf","year":2024,"lang":"fr","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Carton; Production system (computer science); Corrugated fiberboard","score_opus":0.029641779862575632,"score_gpt":0.23929406858186159,"score_spread":0.20965228871928596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930597812","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087734027,0.0021319776,0.0011192389,0.0013314431,0.0021825787,0.00010928734,0.00280794,0.003200064,0.9862402],"genre_scores_gemma":[0.0021967592,0.0011482292,0.0006122552,0.00025880183,0.00024327305,0.000028852975,0.0011598484,0.000987175,0.9933648],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989365,0.000065061,0.00003213635,0.00018732199,0.0006727221,0.000106332765],"domain_scores_gemma":[0.9985202,0.00014420226,0.00006714732,0.00020649661,0.00078582985,0.0002761568],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006187771,0.0015955042,0.0009437195,0.0024563393,0.0015429454,0.0073730736,0.001327258,0.0015290354,0.83732706],"category_scores_gemma":[0.0033233787,0.0006472989,0.00095065526,0.0021860297,0.00059423014,0.004010636,0.002623343,0.0022888735,0.7539858],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00006110766,0.00004666629,0.00015213185,0.00028160447,0.000006291105,0.00017319922,0.00008684222,0.00010341468,0.00091732974,0.004028614,0.84104264,0.15310024],"study_design_scores_gemma":[0.0000058581063,0.000014161653,0.00028917182,0.000059410224,0.0000016561537,0.0001123665,0.000045227225,0.00003665908,0.0002992014,0.0003163239,0.998814,0.0000059910135],"about_ca_topic_score_codex":0.0067024543,"about_ca_topic_score_gemma":0.008938728,"teacher_disagreement_score":0.16267294,"about_ca_system_score_codex":0.0016027183,"about_ca_system_score_gemma":0.0016560159,"threshold_uncertainty_score":0.2320332},"labels":[],"label_agreement":null},{"id":"W6930904857","doi":"10.5281/zenodo.15755242","title":"Otsekülvi kasutus Eestis ja selle valikut mõjutavad tegurid tootjate küsitlusuuringu andmetel","year":2025,"lang":"et","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Machine Learning and Algorithms","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":"Innovation Cluster (Canada)","funders":"","keywords":"European commission; Work (physics); Commission; Horizon","score_opus":0.020532939045493186,"score_gpt":0.24464389940590148,"score_spread":0.22411096036040828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930904857","genre_codex":"other","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.03279316,0.0072981524,0.12765415,0.013170695,0.0079527,0.00025077592,0.008509866,0.013350032,0.78902036],"genre_scores_gemma":[0.20140153,0.005468773,0.07400287,0.0015949209,0.0016718947,0.00020408034,0.010878283,0.01079979,0.69397783],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9967315,0.00043833494,0.00014041479,0.00071292167,0.0013914859,0.0005853106],"domain_scores_gemma":[0.99478346,0.0010686817,0.0004409351,0.0012669988,0.0013784572,0.0010614898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020514354,0.0014206567,0.0013831075,0.0018609203,0.00235006,0.008395425,0.002137363,0.002377653,0.20541388],"category_scores_gemma":[0.0065212357,0.00060075795,0.0009075074,0.0022984399,0.0015254798,0.008109728,0.0066488213,0.0020861102,0.12556478],"study_design_candidate":"observational","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.0014877922,0.0003512305,0.0045016604,0.0011995878,0.00010346405,0.00066838344,0.0009891255,0.002746722,0.019306082,0.10429499,0.20738661,0.65696436],"study_design_scores_gemma":[0.00005565592,0.00012805151,0.0016969913,0.00019650048,0.00003740476,0.00076534593,0.0004720476,0.005471569,0.02165972,0.040235385,0.92920715,0.00007413259],"about_ca_topic_score_codex":0.001545754,"about_ca_topic_score_gemma":0.0035909791,"teacher_disagreement_score":0.20541388,"about_ca_system_score_codex":0.0017507893,"about_ca_system_score_gemma":0.0026450912,"threshold_uncertainty_score":0.6871779},"labels":[],"label_agreement":null},{"id":"W6931233808","doi":"10.5281/zenodo.4337980","title":"Lasioglossum (Dialictus) clastipedion Gardner & Gibbs 2020, sp. nov.","year":2020,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Machine Learning and Algorithms","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 Manitoba","funders":"","keywords":"Head (geology); Southeast asia; Abdomen","score_opus":0.026740798922101815,"score_gpt":0.23566257345562533,"score_spread":0.2089217745335235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931233808","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.532521,0.030191822,0.016596913,0.0026327327,0.0022286382,0.001863112,0.018771835,0.0027334662,0.39246047],"genre_scores_gemma":[0.8992831,0.010980346,0.017095886,0.003697929,0.00031397847,0.0009076054,0.0134353805,0.00023233112,0.05405338],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9998022,0.000014721533,0.000020460784,0.00007429932,0.00006439945,0.000024015804],"domain_scores_gemma":[0.9997899,0.000027987793,0.00007399026,0.000019604066,0.000052878957,0.000035544992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002030857,0.0010912695,0.00033263472,0.002316652,0.0012622512,0.000584833,0.0007653298,0.0007075476,0.00981508],"category_scores_gemma":[0.00056804804,0.00030485183,0.00021416263,0.001420144,0.0007872397,0.0011846765,0.0011674794,0.00087597175,0.005214456],"study_design_candidate":"observational","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.00042986768,0.00012446968,0.051806822,0.0012622422,0.0001482178,0.0025539594,0.0030827953,0.0016386162,0.036124896,0.0025004935,0.042236935,0.85809064],"study_design_scores_gemma":[0.00021249204,0.00038708083,0.3733031,0.0016744577,0.00043546822,0.010841094,0.0033115328,0.0018962205,0.005155558,0.0013095563,0.60139316,0.0000802645],"about_ca_topic_score_codex":0.0371123,"about_ca_topic_score_gemma":0.07691723,"teacher_disagreement_score":0.0371123,"about_ca_system_score_codex":0.0013174082,"about_ca_system_score_gemma":0.0007059268,"threshold_uncertainty_score":0.07379258},"labels":[],"label_agreement":null},{"id":"W6931588702","doi":"10.5281/zenodo.5679778","title":"Ablabesmyia (Asayia) annulata Say","year":2011,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Beaver; Fishing; Pupa; Mile; Larva","score_opus":0.0437387871910469,"score_gpt":0.23786398507439174,"score_spread":0.19412519788334484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931588702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85761654,0.003543972,0.003833249,0.0004571361,0.00031723926,0.00012355566,0.0028872117,0.00042236148,0.13079868],"genre_scores_gemma":[0.96850175,0.0012537789,0.0028516424,0.0004122769,0.00012096899,0.000074200674,0.0015071634,0.000016924836,0.025261277],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99990344,0.00000850207,0.000010486369,0.0000352266,0.000023197495,0.00001911044],"domain_scores_gemma":[0.99991775,0.000012118247,0.000025601243,0.0000064572673,0.000021163702,0.00001685214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015564109,0.00041776296,0.00028416986,0.0007541009,0.0011166177,0.00024447744,0.00023922452,0.0003484177,0.008318476],"category_scores_gemma":[0.00015202462,0.00012691323,0.00017974449,0.0005097808,0.0003488315,0.00057146733,0.00057638454,0.000490925,0.0043435246],"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.0015380319,0.00038292597,0.09648348,0.001140576,0.00010863121,0.004282415,0.0047555147,0.002555294,0.29241675,0.008706649,0.021523844,0.5661059],"study_design_scores_gemma":[0.00016083918,0.0012428066,0.65159667,0.00034193206,0.00016409138,0.0054873857,0.0043490343,0.0017098673,0.011854387,0.0027337053,0.32028913,0.00007013655],"about_ca_topic_score_codex":0.005857558,"about_ca_topic_score_gemma":0.014134529,"teacher_disagreement_score":0.008318476,"about_ca_system_score_codex":0.00031569414,"about_ca_system_score_gemma":0.00015786498,"threshold_uncertainty_score":0.027828097},"labels":[],"label_agreement":null},{"id":"W6996016301","doi":"","title":"Quantifying the difference between black boxes and their automata approximations","year":2021,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Machine Learning and Algorithms","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":"McGill University","funders":"","keywords":"Black box; Metric (unit); Automaton; Artificial neural network; Upper and lower bounds; Obstacle; Line (geometry); Approximations of π","score_opus":0.030984889045679108,"score_gpt":0.26749103955039155,"score_spread":0.23650615050471244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996016301","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.18592535,0.0013021799,0.8056015,0.0007382412,0.00015260417,0.00007925022,0.00023293067,0.00089394214,0.005074117],"genre_scores_gemma":[0.7681921,0.00059584033,0.22813721,0.00030768482,0.00008683521,0.00021910836,0.0005004652,0.00039977388,0.0015609178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99350643,0.0024166908,0.0004428456,0.0014668641,0.0017935052,0.00037375756],"domain_scores_gemma":[0.93825805,0.04942344,0.0028134936,0.0065545635,0.0020245363,0.0009259054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067385877,0.0010022302,0.001268101,0.0016170348,0.0009425692,0.003032345,0.0014111055,0.0022391907,0.0028794801],"category_scores_gemma":[0.057063825,0.000986721,0.0008318876,0.0009639422,0.003532152,0.007890491,0.0034947929,0.0033703952,0.00061790104],"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.00086514984,0.0001423493,0.010825997,0.00044200217,0.00020399407,0.00018165007,0.00094784936,0.53970796,0.010374475,0.34529093,0.0016530786,0.08936458],"study_design_scores_gemma":[0.000013444236,0.00025746404,0.0012222358,0.00007895402,0.000031718806,0.00009481188,0.00009033219,0.8144663,0.0035525344,0.17837434,0.0017816682,0.00003614882],"about_ca_topic_score_codex":0.0012863606,"about_ca_topic_score_gemma":0.0011863924,"teacher_disagreement_score":0.0067385877,"about_ca_system_score_codex":0.001747255,"about_ca_system_score_gemma":0.0010733764,"threshold_uncertainty_score":0.035637498},"labels":[],"label_agreement":null},{"id":"W7020944395","doi":"","title":"Modeling and solving combinatorial optimization problems with Domain-Independent Dynamic Programming","year":2024,"lang":"en","type":"other","venue":"DUGiMedia - Universitat de Girona","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Dynamic programming; Optimization problem; Combinatorial optimization; Stochastic programming; Constraint programming","score_opus":0.0035136554803547834,"score_gpt":0.19382611721745213,"score_spread":0.19031246173709734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7020944395","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.001284897,0.0068306327,0.9640848,0.0040753763,0.0005885302,0.000023455155,0.00016574505,0.00044957557,0.022496969],"genre_scores_gemma":[0.08139102,0.020430993,0.8311179,0.0021670067,0.0017933158,0.00024365276,0.0007464856,0.0010005313,0.061109133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933547,0.00022511005,0.000025341044,0.00012560522,0.00024129028,0.000047238715],"domain_scores_gemma":[0.998706,0.000987995,0.000043083888,0.00008956747,0.00011161478,0.000061657825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012822303,0.0015475618,0.0008397451,0.0005601627,0.0004230865,0.0019322783,0.0009557656,0.0010467322,0.0068336306],"category_scores_gemma":[0.0036711642,0.0010141144,0.0010785423,0.0012284033,0.0013509974,0.0025399195,0.0013567706,0.0040708105,0.0020702917],"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.000037017897,0.000078745674,0.00052036723,0.0003665681,0.00008450184,0.000088376706,0.00009846101,0.26518562,0.0010433579,0.42946723,0.09713283,0.20589697],"study_design_scores_gemma":[0.000017736054,0.00002654321,0.00023715444,0.000120907476,0.000019241641,0.00006721439,0.000035850135,0.42581072,0.0012616348,0.42802784,0.14434054,0.000034671866],"about_ca_topic_score_codex":0.0042440146,"about_ca_topic_score_gemma":0.007600588,"teacher_disagreement_score":0.0068336306,"about_ca_system_score_codex":0.0011791246,"about_ca_system_score_gemma":0.0009957406,"threshold_uncertainty_score":0.022860825},"labels":[],"label_agreement":null},{"id":"W7025198433","doi":"","title":"Triage protocols outline who gets care - and who doesn't - if COVID-19 overwhelms hospitals","year":2021,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Triage; Health care; MEDLINE; Power of attorney; Public health","score_opus":0.007015503879151433,"score_gpt":0.23464522937283874,"score_spread":0.22762972549368732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025198433","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017841561,0.0016206929,0.011662786,0.22032008,0.010544073,0.0018095565,0.0061668605,0.0019080945,0.7441837],"genre_scores_gemma":[0.029751366,0.0059746183,0.022531282,0.10889555,0.0039435527,0.0022817764,0.006747122,0.0018760058,0.8179988],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98664236,0.0031862173,0.0017342246,0.00037568028,0.006438334,0.001623181],"domain_scores_gemma":[0.9270151,0.014464421,0.0035954164,0.005416743,0.04273902,0.0067692306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020579211,0.0005897423,0.00062843325,0.0025384426,0.0041040746,0.0046518454,0.0028861675,0.004143077,0.11126086],"category_scores_gemma":[0.08853644,0.0006288706,0.00044516113,0.0028527945,0.0031424505,0.0039750873,0.0036173828,0.0057574674,0.07942458],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000016564149,0.000016384289,0.00040100786,0.0000486464,0.0000011223228,0.00004182869,0.00021425086,0.0000895077,0.00008595863,0.008199559,0.9595106,0.031374495],"study_design_scores_gemma":[0.00002299439,0.000020562995,0.0022751784,0.00035004143,0.0000032042058,0.00007879587,0.00042945947,0.00022067869,0.00022315075,0.0026218365,0.9937203,0.000033817654],"about_ca_topic_score_codex":0.28043178,"about_ca_topic_score_gemma":0.3973272,"teacher_disagreement_score":0.28043178,"about_ca_system_score_codex":0.012930913,"about_ca_system_score_gemma":0.038044445,"threshold_uncertainty_score":0.55759895},"labels":[],"label_agreement":null},{"id":"W7027365879","doi":"","title":"1989 Chapter 0524. An Act Authorizing The Town Of Sudbury To Convey Certain Conservation Land To Jan B. Morgan.","year":2006,"lang":"en","type":"other","venue":"State Library's electronic repository (State Library of Massachusetts)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Easement; Work (physics)","score_opus":0.0072894229460684365,"score_gpt":0.21830248698136046,"score_spread":0.21101306403529202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027365879","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00138221,0.003873658,0.0007251381,0.0072075496,0.0015901882,0.00016044997,0.0024691157,0.0002470914,0.9823446],"genre_scores_gemma":[0.0054549067,0.0010870002,0.00031762072,0.001899614,0.0001329391,0.000068761874,0.0002873868,0.00007230262,0.9906793],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993529,0.00006828264,0.000030412304,0.000085016414,0.00030871245,0.00015475281],"domain_scores_gemma":[0.99944943,0.00015640077,0.00004597201,0.000030186984,0.00026644534,0.00005152865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056244875,0.0008090374,0.00032923082,0.0013286885,0.0064690867,0.0027168908,0.0010108419,0.003330997,0.2101632],"category_scores_gemma":[0.0025046328,0.00062837667,0.00023928635,0.0015974775,0.0012617152,0.0014002789,0.0010691707,0.0031451809,0.048312366],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000012633887,0.000012782495,0.00014133485,0.00005015041,0.0000011339247,0.00006323255,0.0004904349,0.00003051201,0.00017559221,0.033521537,0.9502195,0.015281039],"study_design_scores_gemma":[0.0000031380227,0.00000570465,0.000867029,0.0000781647,0.0000021898659,0.000025437083,0.00019434081,0.000017650951,0.00010395738,0.00053187413,0.99816436,0.0000062375025],"about_ca_topic_score_codex":0.3819495,"about_ca_topic_score_gemma":0.67371774,"teacher_disagreement_score":0.3819495,"about_ca_system_score_codex":0.004235407,"about_ca_system_score_gemma":0.0059366017,"threshold_uncertainty_score":0.75945264},"labels":[],"label_agreement":null},{"id":"W7066300175","doi":"","title":"[FSCR-TV] Charlotte Hornets vs Philadelphia 76ers:Live Stream (NBA Basketball Online 2019)","year":2019,"lang":"en","type":"other","venue":"OSF Preprints (OSF Preprints)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Victory; CONTEST; Shot (pellet); Basketball; Quarter (Canadian coin); Line (geometry)","score_opus":0.010761929326438824,"score_gpt":0.25189246630088896,"score_spread":0.24113053697445014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7066300175","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003972665,0.0012318472,0.00030843762,0.010029954,0.0059834043,0.00008744376,0.012731211,0.0017724227,0.9638826],"genre_scores_gemma":[0.013703533,0.0008357204,0.00027738995,0.0044714613,0.0016526305,0.00011101899,0.007231892,0.0010139836,0.97070223],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996983,0.000036615715,0.00000689543,0.000046725945,0.00009721477,0.0001142119],"domain_scores_gemma":[0.9991677,0.000084986714,0.000035161826,0.000038599374,0.00019756424,0.00047599155],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00047422593,0.00068369095,0.00030298525,0.0009980501,0.0048269834,0.006411678,0.00075175683,0.001783572,0.669894],"category_scores_gemma":[0.0014736383,0.0003513716,0.0002809659,0.001197189,0.00043832965,0.003252627,0.0032787994,0.0023427936,0.35648385],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000018852406,0.000010637763,0.00014787217,0.000013413451,7.59539e-7,0.000016479891,0.00006849794,0.000004461611,0.000029379482,0.0003093812,0.99093103,0.008449111],"study_design_scores_gemma":[0.000011504313,0.000021226831,0.0019183814,0.000080479,0.0000017569432,0.000039069608,0.0006559594,0.000033681423,0.000057024637,0.00023246212,0.9969405,0.000008097832],"about_ca_topic_score_codex":0.027347041,"about_ca_topic_score_gemma":0.10584269,"teacher_disagreement_score":0.33010602,"about_ca_system_score_codex":0.0012305487,"about_ca_system_score_gemma":0.000848101,"threshold_uncertainty_score":0.47085613},"labels":[],"label_agreement":null},{"id":"W7071928366","doi":"","title":"Workshop assesses impact of objective-based and performance-based codes","year":2010,"lang":"en","type":"article","venue":"NPARC","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Code (set theory); Context (archaeology); Confidentiality; Field (mathematics)","score_opus":0.010115310415085156,"score_gpt":0.2755510589919561,"score_spread":0.2654357485768709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7071928366","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73260117,0.0040581534,0.20606953,0.0021497575,0.0014726982,0.0007091835,0.0031706067,0.0051445034,0.044624377],"genre_scores_gemma":[0.8741622,0.000893431,0.09501998,0.00034865917,0.00025875997,0.00030237195,0.003157195,0.0015679859,0.024289355],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9897556,0.0038845807,0.000559263,0.0010573231,0.0039006046,0.0008426635],"domain_scores_gemma":[0.9588913,0.01807468,0.0011658146,0.0048034484,0.015540408,0.0015244103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010691029,0.0013972005,0.0011651919,0.002475412,0.000986903,0.0032034575,0.0015059836,0.0016931607,0.008235681],"category_scores_gemma":[0.032099713,0.00037807613,0.00096070796,0.0017986549,0.0009345809,0.002215637,0.002274111,0.0015531391,0.002423407],"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.0059078536,0.0018391064,0.022844747,0.00081780244,0.0005706843,0.00022916551,0.00038189173,0.22996268,0.034900967,0.014792543,0.022166898,0.6655857],"study_design_scores_gemma":[0.0007367566,0.009316105,0.02630651,0.00027374492,0.00034236626,0.0003808579,0.00075329444,0.75755197,0.15696196,0.007994995,0.03911666,0.00026471962],"about_ca_topic_score_codex":0.010954379,"about_ca_topic_score_gemma":0.009826556,"teacher_disagreement_score":0.010954379,"about_ca_system_score_codex":0.002805835,"about_ca_system_score_gemma":0.003013519,"threshold_uncertainty_score":0.05654025},"labels":[],"label_agreement":null},{"id":"W7095161281","doi":"","title":"University of Alberta ROBUST ACTIVE LEARNING","year":2016,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Active learning (machine learning); Permission; Work (physics); Minimax; Focus (optics); Association (psychology); Class (philosophy); Process (computing)","score_opus":0.007423889002004216,"score_gpt":0.18731604109101269,"score_spread":0.17989215208900847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095161281","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052173445,0.027111249,0.52938616,0.011340061,0.0053150165,0.00023940884,0.006001025,0.010383972,0.40500584],"genre_scores_gemma":[0.104986005,0.02253059,0.28532156,0.0013592439,0.0014764896,0.00036771895,0.010167164,0.0021241873,0.57166696],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984573,0.00017649963,0.000057204612,0.00040235172,0.00079788594,0.00010877954],"domain_scores_gemma":[0.99786997,0.0005303595,0.00008984764,0.00026082387,0.0010490024,0.00020010253],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016400167,0.0023759832,0.0016259807,0.0020176654,0.0010303869,0.004635745,0.0021353492,0.0024711757,0.07276796],"category_scores_gemma":[0.004363992,0.00073595496,0.000871027,0.001950862,0.0014775426,0.001308392,0.0022930205,0.0026818758,0.038365718],"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.0003458875,0.00008986295,0.0007225468,0.0007452238,0.00008846722,0.00033374477,0.00016126213,0.05717776,0.0053209094,0.10777979,0.26087302,0.5663615],"study_design_scores_gemma":[0.000107863,0.00008897887,0.001272483,0.00047407404,0.000065967964,0.00039133494,0.00011971954,0.14450562,0.0063581425,0.05831821,0.78817546,0.00012228133],"about_ca_topic_score_codex":0.080091275,"about_ca_topic_score_gemma":0.073567465,"teacher_disagreement_score":0.927232,"about_ca_system_score_codex":0.0036752073,"about_ca_system_score_gemma":0.00692024,"threshold_uncertainty_score":0.24343306},"labels":[],"label_agreement":null},{"id":"W7096875273","doi":"","title":"Author manuscript, published in &amp;quot;NIPS Workshop on Representations and Inference on Probability Distributions, Whistler: Canada (2007)&amp;quot; On Probability Distributions for Trees: Representations, Inference and Learning","year":2008,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tree diagram; Tree (set theory); Probability distribution; Series (stratigraphy); Inference; Class (philosophy); Algebraic number; Tree automaton; Representation (politics)","score_opus":0.06602749537341858,"score_gpt":0.3212853232006663,"score_spread":0.2552578278272477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096875273","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.014828129,0.039861046,0.2971852,0.116139874,0.21432035,0.00057689875,0.037373744,0.0069226664,0.27279204],"genre_scores_gemma":[0.054959025,0.015707135,0.07713718,0.007245997,0.016165676,0.00029944332,0.022778047,0.0034873,0.8022203],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891853,0.00024603112,0.00006284149,0.00037079843,0.0002939758,0.00010774915],"domain_scores_gemma":[0.9937773,0.0019331558,0.0001922829,0.00092255836,0.0026839594,0.0004907761],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023375265,0.001125379,0.002243027,0.0017290094,0.0017185573,0.006163072,0.0018797436,0.0016713183,0.31620488],"category_scores_gemma":[0.01568734,0.0008341331,0.00095866394,0.0034038578,0.0008738097,0.004467892,0.0018956035,0.00166653,0.113403946],"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.00035430235,0.00007357271,0.0010367137,0.00043093043,0.00013849152,0.00020115089,0.00014344108,0.0020119043,0.00082065456,0.018940764,0.8372785,0.13856955],"study_design_scores_gemma":[0.00008813314,0.000062905536,0.0021357848,0.00031796435,0.00007605715,0.00033216437,0.00020085514,0.012480804,0.0019400594,0.04203999,0.9402534,0.000071897535],"about_ca_topic_score_codex":0.00647736,"about_ca_topic_score_gemma":0.013375036,"teacher_disagreement_score":0.31620488,"about_ca_system_score_codex":0.0019842451,"about_ca_system_score_gemma":0.0015967817,"threshold_uncertainty_score":0.97535074},"labels":[],"label_agreement":null},{"id":"W7100476103","doi":"","title":"Canada (2013)&amp;quot; COMPRESSIVE GAUSSIAN MIXTURE ESTIMATION","year":2013,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Sketch; Histogram; Mixture model; Projection (relational algebra); Compressed sensing; Set (abstract data type); Centroid; Representation (politics); Data set","score_opus":0.005871955904163193,"score_gpt":0.21664568176879,"score_spread":0.2107737258646268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100476103","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063249585,0.020190427,0.18320024,0.024328407,0.0107173445,0.0004321047,0.024254266,0.0066620787,0.7238902],"genre_scores_gemma":[0.03243206,0.010642597,0.09027111,0.0019769524,0.00086078694,0.00012915197,0.009855672,0.0012110088,0.85262066],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905175,0.00006699611,0.00003533118,0.00018446673,0.0005479205,0.000113485934],"domain_scores_gemma":[0.99872977,0.00015223782,0.000043780812,0.00020038079,0.0007059729,0.00016782917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011778842,0.0011480121,0.0008365167,0.00171618,0.0022749796,0.004827554,0.0016781706,0.002525523,0.19729969],"category_scores_gemma":[0.0022282784,0.00057050737,0.00060561,0.0031508596,0.0014620577,0.0018760132,0.0019107388,0.0014889736,0.063677765],"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.00018619874,0.000046432855,0.00095405645,0.00020885172,0.000029113024,0.00023743644,0.000110463436,0.0068316185,0.0032064363,0.031104526,0.48377857,0.47330633],"study_design_scores_gemma":[0.000021570871,0.000024035928,0.0012049794,0.000111937625,0.0000082814495,0.00010584628,0.0001407212,0.015963651,0.0019827231,0.009653557,0.9707381,0.000044519427],"about_ca_topic_score_codex":0.3895702,"about_ca_topic_score_gemma":0.52808744,"teacher_disagreement_score":0.3895702,"about_ca_system_score_codex":0.008505193,"about_ca_system_score_gemma":0.010384271,"threshold_uncertainty_score":0.7746053},"labels":[],"label_agreement":null},{"id":"W7101439472","doi":"10.1016/j.rineng.2025.107934","title":"Experimental study on porosity-permeability regulation and strength enhancement of 3D-printed rock analogs: New insights from post-processing explorations","year":2025,"lang":"en","type":"article","venue":"Results in Engineering","topic":"Machine Learning and Algorithms","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 Alberta","funders":"International Science and Technology Cooperation Programme; Southwest University of Science and Technology; Natural Science Foundation of Hubei Province; National Natural Science Foundation of China","keywords":"Porosity; Permeability (electromagnetism); Compressive strength; Adhesive; Scanning electron microscope; Epoxy; Residual strength; Parametric statistics","score_opus":0.011170147939576061,"score_gpt":0.2623126223644146,"score_spread":0.25114247442483856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101439472","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9861859,0.0004209626,0.010986196,0.000036287285,0.000017608725,0.000023001878,0.00017214334,0.00013182711,0.0020260727],"genre_scores_gemma":[0.9924185,0.00025061305,0.0062625194,0.000024929783,0.000005257157,0.000028001734,0.00009113998,0.000035129076,0.00088390085],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997646,0.000017380227,0.000016268428,0.0000620801,0.00011681209,0.000022765145],"domain_scores_gemma":[0.99961156,0.00011673852,0.00009301031,0.00008061202,0.000070958,0.000027166358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024532434,0.00026347887,0.00017754204,0.00019300656,0.00015017382,0.0002515199,0.00020760242,0.00034792512,0.0011057851],"category_scores_gemma":[0.0004887883,0.00017701517,0.00018860116,0.00022238349,0.00049686857,0.00034190924,0.00026739205,0.00045414057,0.00020714746],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000025800618,0.000012094709,0.00030591912,0.00005242061,0.0000019246572,0.000068899026,0.00005873272,0.00046541425,0.9965519,0.000110772904,0.000028078166,0.002318084],"study_design_scores_gemma":[0.0000038064509,0.00012702172,0.0037750448,0.0000052706705,0.0000075810417,0.00012114118,0.000044501943,0.0023720905,0.9923901,0.00007944178,0.0010635012,0.000010515673],"about_ca_topic_score_codex":0.00023677631,"about_ca_topic_score_gemma":0.0005079096,"teacher_disagreement_score":0.0011057851,"about_ca_system_score_codex":0.00017208947,"about_ca_system_score_gemma":0.00011708436,"threshold_uncertainty_score":0.003699243},"labels":[],"label_agreement":null},{"id":"W7124149641","doi":"10.65109/vrcm7424","title":"Cultivating desired behaviour: policy teaching via environment-dynamics tweaks","year":2010,"lang":"","type":"article","venue":"","topic":"Machine Learning and Algorithms","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":"Order (exchange); Control (management); Function (biology); Balance (ability); Work (physics); Context (archaeology)","score_opus":0.007356547913689305,"score_gpt":0.253805130485612,"score_spread":0.24644858257192268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124149641","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.19885856,0.00032716792,0.7833587,0.0023439114,0.000084409025,0.00016843666,0.00005316132,0.00063249347,0.014173209],"genre_scores_gemma":[0.92103153,0.0002266155,0.076235734,0.00018427894,0.000026920457,0.00012912764,0.000023520513,0.000055408666,0.0020868338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991321,0.00051304733,0.000025683774,0.00014938235,0.00011903928,0.00006078934],"domain_scores_gemma":[0.99398154,0.0045667514,0.0005377134,0.0004904507,0.00021836674,0.00020508141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016093764,0.0005071894,0.00040403655,0.00026958116,0.00037452593,0.0010351889,0.00088922464,0.00094692054,0.0025010186],"category_scores_gemma":[0.013116451,0.0002896117,0.00022267544,0.00023919284,0.0013766165,0.0021078154,0.0013084274,0.0014810227,0.00033161262],"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.00035727772,0.0009805377,0.009650635,0.0005506509,0.00012553496,0.0003440674,0.0021774406,0.6373652,0.021354454,0.16816299,0.0023975982,0.15653357],"study_design_scores_gemma":[0.0001334441,0.0003767352,0.002175734,0.00007270579,0.000044737666,0.00010074802,0.0003978282,0.86789376,0.008535395,0.111895084,0.008323344,0.000050452974],"about_ca_topic_score_codex":0.00089094124,"about_ca_topic_score_gemma":0.0016172796,"teacher_disagreement_score":0.0025010186,"about_ca_system_score_codex":0.0005505854,"about_ca_system_score_gemma":0.0008864428,"threshold_uncertainty_score":0.008511245},"labels":[],"label_agreement":null},{"id":"W7126374618","doi":"10.18653/v1/2024.law-1.10","title":"Enhancing Text Classification through LLM-Driven Active Learning and Human Annotation","year":2024,"lang":"","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Ontario Tech University","funders":"","keywords":"Active learning (machine learning); Annotation; Focus (optics); Identification (biology)","score_opus":0.021408231918196883,"score_gpt":0.3204418519509792,"score_spread":0.2990336200327823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126374618","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.018356273,0.00031515668,0.97465974,0.00041564796,0.00011271818,0.00016317978,0.00017850254,0.0043293405,0.0014694306],"genre_scores_gemma":[0.44929674,0.0001938386,0.5422384,0.00072640966,0.0002712362,0.0006079912,0.00130832,0.0004815669,0.0048756045],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961074,0.0014963704,0.00022080202,0.00097646774,0.0009831882,0.00021579475],"domain_scores_gemma":[0.9849627,0.009908693,0.0008853046,0.0018927447,0.0020651252,0.00028544385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006268738,0.0018160476,0.0016229723,0.0021146869,0.0009833552,0.002421736,0.0040388526,0.0027462584,0.0029751572],"category_scores_gemma":[0.02012964,0.00057741057,0.0011591734,0.0016300434,0.001333182,0.005108928,0.0030884189,0.002993462,0.0021060067],"study_design_candidate":"bench_or_experimental","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.0006509101,0.0009197113,0.0040636593,0.00034050713,0.00011413318,0.00015349193,0.0005096212,0.09360546,0.02394868,0.0060286555,0.007629654,0.8620355],"study_design_scores_gemma":[0.000030329677,0.00008645784,0.0003971195,0.000022492763,0.000023456387,0.000052164047,0.00006430486,0.9782496,0.011355926,0.007815241,0.0018844539,0.00001844357],"about_ca_topic_score_codex":0.002093203,"about_ca_topic_score_gemma":0.004329711,"teacher_disagreement_score":0.006268738,"about_ca_system_score_codex":0.0011879418,"about_ca_system_score_gemma":0.0011640771,"threshold_uncertainty_score":0.03315264},"labels":[],"label_agreement":null},{"id":"W72192500","doi":"10.1007/978-3-642-32589-2_52","title":"The Lower Reaches of Circuit Uniformity","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Class (philosophy); Characterization (materials science); Boolean function; Current (fluid); Algorithm; Topology (electrical circuits); Electrical engineering; Artificial intelligence; Materials science; Nanotechnology; Engineering","score_opus":0.0175659527369735,"score_gpt":0.23880385968375029,"score_spread":0.22123790694677678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72192500","genre_codex":"other","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.059835937,0.010261881,0.15844421,0.01503095,0.0012382566,0.000054542055,0.0008258496,0.0009398551,0.75336856],"genre_scores_gemma":[0.8409521,0.0050203875,0.02974831,0.00643698,0.004111427,0.00033964362,0.00072611135,0.0014290839,0.111236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785966,0.00054233614,0.00008814271,0.00061594264,0.0005750702,0.0003189516],"domain_scores_gemma":[0.9911975,0.0064875865,0.00026493153,0.0012633005,0.00049414975,0.0002924386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015952177,0.0008098042,0.0016880375,0.0020344171,0.0024197118,0.005036596,0.0019705738,0.002284586,0.029146727],"category_scores_gemma":[0.015982974,0.0009068055,0.001094871,0.0023266675,0.007071686,0.012147152,0.004293923,0.009021167,0.004189461],"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.00002374308,0.000005133655,0.000051932107,0.00003034111,0.0000040183577,0.000010440586,0.00005705846,0.0003661069,0.000116716714,0.9886953,0.0031679878,0.0074711526],"study_design_scores_gemma":[0.0000054043676,0.000004444299,0.000058808517,0.000012038236,0.000004116558,0.000018056528,0.000011243278,0.00063053326,0.0001740139,0.99470454,0.0043721017,0.0000047027092],"about_ca_topic_score_codex":0.0011747042,"about_ca_topic_score_gemma":0.0008073647,"teacher_disagreement_score":0.029146727,"about_ca_system_score_codex":0.0026271434,"about_ca_system_score_gemma":0.0008211922,"threshold_uncertainty_score":0.09750551},"labels":[],"label_agreement":null},{"id":"W83954701","doi":"10.1007/978-3-642-22321-1_5","title":"State Complexity Research and Approximation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; State (computer science); Theoretical computer science; Algorithm","score_opus":0.07805654158210738,"score_gpt":0.3165436740408817,"score_spread":0.2384871324587743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83954701","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.018004876,0.031928156,0.7021076,0.020656733,0.0014426886,0.00013439919,0.00097121135,0.0009718896,0.22378244],"genre_scores_gemma":[0.63303643,0.040585972,0.20056377,0.0037622286,0.005810051,0.0007120185,0.0029313373,0.0012103136,0.11138778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970131,0.0006870203,0.000149444,0.00059644296,0.0012322532,0.00032180225],"domain_scores_gemma":[0.98915696,0.007441408,0.00035848637,0.0021892462,0.00066111056,0.0001927315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002454606,0.0017761084,0.0024775336,0.0025262486,0.0019673074,0.006622108,0.0033196846,0.0025867512,0.019180981],"category_scores_gemma":[0.014371397,0.0013202834,0.0026676685,0.0069815256,0.005653337,0.02123016,0.003447275,0.012532215,0.0032577873],"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.000031555377,0.000031226045,0.00012474514,0.00016114642,0.00001659735,0.000012406173,0.00007884613,0.0066751856,0.00012432162,0.95855653,0.008053877,0.026133498],"study_design_scores_gemma":[0.000006098073,0.000006464978,0.00006269356,0.000031171985,0.000011726419,0.000020115822,0.000014785039,0.012784488,0.00017790614,0.97913796,0.0077407886,0.000005834375],"about_ca_topic_score_codex":0.0026275096,"about_ca_topic_score_gemma":0.0017700621,"teacher_disagreement_score":0.019180981,"about_ca_system_score_codex":0.006207481,"about_ca_system_score_gemma":0.0022665013,"threshold_uncertainty_score":0.064166784},"labels":[],"label_agreement":null},{"id":"W8836454","doi":"10.1007/978-3-642-28332-1_24","title":"Polynomial-Time Algorithms for Learning Typed Pattern Languages","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Time complexity; Algorithm; Polynomial; Theoretical computer science; Artificial intelligence; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.01286230419875984,"score_gpt":0.26352007957974477,"score_spread":0.25065777538098494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W8836454","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.01420423,0.00069853413,0.9701431,0.0009828203,0.00014354516,0.00022120004,0.0011334367,0.006699571,0.0057734447],"genre_scores_gemma":[0.12239738,0.00066970865,0.86014163,0.00037295415,0.00018923375,0.0004966563,0.0047576535,0.0011654735,0.009809353],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710304,0.00046155014,0.00029581806,0.0010721593,0.00072845287,0.00033901347],"domain_scores_gemma":[0.98735946,0.008347243,0.0005177573,0.0026289923,0.00082581415,0.00032067444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019476839,0.001956595,0.0019677035,0.001658962,0.001443661,0.004289008,0.00661985,0.0027062756,0.022536159],"category_scores_gemma":[0.014604124,0.0014808415,0.0033814893,0.0044300873,0.0016039198,0.012591403,0.003853527,0.005702024,0.0063904854],"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.0007459475,0.0006667787,0.0018138387,0.0010298955,0.00015881222,0.00010816572,0.0002963341,0.07158102,0.0046671564,0.10732809,0.03511453,0.7764895],"study_design_scores_gemma":[0.00030634433,0.000110683926,0.00031302104,0.00007447768,0.00010900337,0.00019003656,0.00017973159,0.47872338,0.004503984,0.5075698,0.007884049,0.000035532343],"about_ca_topic_score_codex":0.0036347208,"about_ca_topic_score_gemma":0.00849223,"teacher_disagreement_score":0.022536159,"about_ca_system_score_codex":0.0028060046,"about_ca_system_score_gemma":0.0035589968,"threshold_uncertainty_score":0.075390935},"labels":[],"label_agreement":null},{"id":"W916574126","doi":"10.48550/arxiv.1408.1336","title":"On the Generalization of the C-Bound to Structured Output Ensemble Methods","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","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":"Université Laval","funders":"","keywords":"Margin (machine learning); Generalization; Upper and lower bounds; Bayesian probability; Computer science; Binary number; Artificial intelligence; Generalization error; Ensemble learning; Algorithm; Mathematics; Machine learning; Pattern recognition (psychology); Artificial neural network","score_opus":0.057465361519425245,"score_gpt":0.23132210977292156,"score_spread":0.1738567482534963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W916574126","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.0030834973,0.0012951082,0.9875717,0.0011639926,0.00014935895,0.000033298023,0.000101950944,0.00017875993,0.0064223236],"genre_scores_gemma":[0.3724778,0.006060676,0.5978429,0.0046181213,0.0023842775,0.0008015535,0.0011472506,0.0014569841,0.013210448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912266,0.0036908027,0.00029181145,0.001344671,0.0029364182,0.00050968106],"domain_scores_gemma":[0.95646363,0.034604874,0.0011683044,0.0034085435,0.003566933,0.0007876475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012736988,0.0024552108,0.0022689905,0.0022537422,0.0020369047,0.0041239294,0.0042028446,0.004021792,0.007056678],"category_scores_gemma":[0.07020766,0.0010008414,0.0017188502,0.0028718235,0.0046265176,0.008095755,0.008299024,0.011016652,0.0019780593],"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.00013027572,0.00006800071,0.0009649832,0.00023250838,0.00011301659,0.00013525877,0.00022416504,0.23612852,0.001124756,0.67729926,0.009812982,0.073766366],"study_design_scores_gemma":[0.000012902457,0.00003679166,0.00017623082,0.000104883766,0.0000187699,0.000057826997,0.000017283828,0.6960192,0.0007496377,0.29867524,0.0041055297,0.00002567514],"about_ca_topic_score_codex":0.0049557323,"about_ca_topic_score_gemma":0.0038924613,"teacher_disagreement_score":0.012736988,"about_ca_system_score_codex":0.0029815899,"about_ca_system_score_gemma":0.0029516516,"threshold_uncertainty_score":0.06736046},"labels":[],"label_agreement":null},{"id":"W987036772","doi":"10.1007/978-3-642-33275-3_1","title":"Optimal “Anti-Bayesian” Parametric Pattern Classification Using Order Statistics Criteria","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mahalanobis distance; Computer science; Bayesian probability; Classifier (UML); Artificial intelligence; Pattern recognition (psychology); Parametric statistics; Algorithm; Order statistic; Exponential family; Naive Bayes classifier; Mathematics; Machine learning; Statistics; Support vector machine","score_opus":0.03089943873873907,"score_gpt":0.29715494972542816,"score_spread":0.2662555109866891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W987036772","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.009028897,0.00015864563,0.9890286,0.00025514347,0.000028435106,0.000025666988,0.000047140704,0.00019543938,0.001232003],"genre_scores_gemma":[0.37238726,0.0005628195,0.6197534,0.0003676269,0.00031170316,0.0002593687,0.0006790498,0.00035442828,0.0053243428],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963653,0.0015090569,0.00029074337,0.00049166,0.0010715448,0.00027154072],"domain_scores_gemma":[0.9885589,0.007912657,0.0005130417,0.0012806504,0.0014865292,0.0002481899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048208465,0.00089257734,0.0022960398,0.001839889,0.0007468057,0.002720662,0.0025479223,0.002041485,0.0032879112],"category_scores_gemma":[0.02107482,0.0008616516,0.0015721485,0.0018837149,0.00182864,0.0042925347,0.0025711358,0.0022949674,0.0009794707],"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.00064479763,0.00021466655,0.0019552947,0.00037657694,0.00016747891,0.0001475317,0.0001865148,0.29894695,0.0062761814,0.22989963,0.0075620157,0.45362237],"study_design_scores_gemma":[0.000013510009,0.000041992887,0.00026142114,0.000013672663,0.0000145106505,0.000052766758,0.000012327015,0.90768343,0.0011081704,0.09021162,0.0005715719,0.000015017887],"about_ca_topic_score_codex":0.0015634432,"about_ca_topic_score_gemma":0.0016496675,"teacher_disagreement_score":0.0048208465,"about_ca_system_score_codex":0.0011871628,"about_ca_system_score_gemma":0.0020156712,"threshold_uncertainty_score":0.02549541},"labels":[],"label_agreement":null}]}