{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010862023,0.00019809708,0.9878263,0.00079953735,0.0008025364,0.00017352395,0.000002631922,0.000329242,0.00975952],"genre_scores_gemma":[0.456019,0.000008760302,0.53928244,0.0019398363,0.0012316487,0.00000784596,0.000011191115,0.000068589696,0.0014306752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963041,0.000064990716,0.00035895416,0.0015377363,0.0010317869,0.0007024414],"domain_scores_gemma":[0.9972284,0.00074161036,0.00031762169,0.0013617768,0.00015862624,0.00019200568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010635655,0.0005575164,0.00052887056,0.00048821946,0.00030804056,0.0009781416,0.0032264823,0.00020409172,0.00004271857],"category_scores_gemma":[0.00018484997,0.00042988884,0.000090548165,0.00037799246,0.00045790593,0.0002698,0.0009768881,0.0011035965,0.000048359572],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001882072,0.0000092061355,0.00060466485,0.00005471116,0.000010259814,0.00016199898,0.0009977272,0.01504529,0.000008705959,0.009007272,0.000017342745,0.9740809],"study_design_scores_gemma":[0.0004744507,0.00041362795,0.00075555645,0.001426976,0.00001787477,0.00028210264,8.19632e-7,0.957947,0.00029850093,0.028857984,0.007940765,0.001584347],"about_ca_topic_score_codex":0.00020584886,"about_ca_topic_score_gemma":0.00026873147,"teacher_disagreement_score":0.97249657,"about_ca_system_score_codex":0.00011956222,"about_ca_system_score_gemma":0.0002139625,"threshold_uncertainty_score":0.9998153},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032491997,0.000002991873,0.9393884,0.000047568956,0.00015766782,0.00003171943,9.104698e-8,0.00021057611,0.027669005],"genre_scores_gemma":[0.7713863,4.9039966e-7,0.2279175,0.00013108723,0.00006136985,3.4257113e-7,0.0000021186231,0.0000024659212,0.000498319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939793,0.00002568911,0.00012981537,0.00009491819,0.00016170648,0.00018995609],"domain_scores_gemma":[0.9996314,0.00008434662,0.000063538915,0.000112339185,0.00005011517,0.00005823173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037777808,0.00006514929,0.00005892947,0.00010063796,0.00015379582,0.000117122516,0.00020577302,0.0000350987,0.000034632696],"category_scores_gemma":[0.00011608654,0.000057423847,0.000023313401,0.00021692559,0.000012367654,0.0008581241,0.00009254906,0.00022054743,0.000113642076],"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.000007867299,0.00001521081,0.0006069482,0.0000072799644,0.0000098775245,0.000008380994,0.0027917826,0.054839216,0.00022595859,0.021095661,0.000059160207,0.9203327],"study_design_scores_gemma":[0.00014053764,0.00005155876,0.0014960624,0.0000051851503,0.000001651345,0.000022146953,0.00018397631,0.993033,0.0006568345,0.00011605716,0.004193332,0.00009968848],"about_ca_topic_score_codex":0.000069011585,"about_ca_topic_score_gemma":0.0000011868907,"teacher_disagreement_score":0.93819374,"about_ca_system_score_codex":0.000033215252,"about_ca_system_score_gemma":0.000024983876,"threshold_uncertainty_score":0.23416765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009843569,0.00034597574,0.987517,0.00057622755,0.00084613287,0.00022337756,0.0000012519721,0.0002984301,0.01009318],"genre_scores_gemma":[0.35143283,0.00005701074,0.64273775,0.0011543253,0.0015375039,0.000015037481,0.000010535605,0.00009244082,0.0029625474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963511,0.000067432,0.00031265983,0.0013584448,0.0010316377,0.00087868475],"domain_scores_gemma":[0.9977588,0.00045575562,0.0003161264,0.0010120841,0.000202185,0.0002550505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079228514,0.0005710108,0.0005108838,0.00063718844,0.00041227465,0.00045767069,0.0025109174,0.00025745438,0.00006797024],"category_scores_gemma":[0.000082394996,0.00044455176,0.00010227864,0.00056878896,0.00054683094,0.0006961042,0.0010552118,0.0020380998,0.00008491072],"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.000006919458,0.000017643399,0.00014463217,0.000015731877,0.000012764933,0.000053826283,0.0010221383,0.051211935,0.000017197199,0.007721059,0.0000040336063,0.9397721],"study_design_scores_gemma":[0.0006293107,0.00066078064,0.00071819016,0.0005880306,0.000020649477,0.00032233307,6.9089583e-7,0.94341785,0.0007832125,0.033511396,0.017736148,0.0016113832],"about_ca_topic_score_codex":0.00006091527,"about_ca_topic_score_gemma":0.00004008501,"teacher_disagreement_score":0.9381607,"about_ca_system_score_codex":0.00024383776,"about_ca_system_score_gemma":0.00039558907,"threshold_uncertainty_score":0.9998006},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002934885,0.00082652544,0.96730995,0.00028394855,0.0012598885,0.0003177663,0.000009152606,0.00023730654,0.029461974],"genre_scores_gemma":[0.4570172,0.00012662173,0.5406415,0.00045599826,0.00038956298,0.0000066939037,0.000008631011,0.00006470806,0.0012891178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540925,0.00012888115,0.0009586881,0.0016373016,0.0010431827,0.00082268973],"domain_scores_gemma":[0.9962893,0.0008175256,0.0008346699,0.0014532651,0.00036086503,0.00024438798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015024517,0.0006995015,0.0010404522,0.0010488206,0.0003449076,0.00032017968,0.0036391593,0.00036786444,0.000087245025],"category_scores_gemma":[0.0001976354,0.00061997026,0.000233011,0.0006069605,0.0014421906,0.00043212943,0.0016409896,0.0015572573,0.000043575055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015885396,0.00005184024,0.0005077555,0.00007256658,0.000035920442,0.00013354326,0.0016326936,0.019468768,0.0011259742,0.054487407,0.000014469171,0.92245317],"study_design_scores_gemma":[0.0008982445,0.0012789079,0.0003939264,0.0018346098,0.000042116524,0.00038031646,0.0000013888991,0.8154383,0.008593015,0.16648813,0.002639892,0.0020111846],"about_ca_topic_score_codex":0.00018008648,"about_ca_topic_score_gemma":0.00003825689,"teacher_disagreement_score":0.920442,"about_ca_system_score_codex":0.00016369569,"about_ca_system_score_gemma":0.00064821803,"threshold_uncertainty_score":0.99962515},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054392687,0.002613555,0.039981335,0.00034697287,0.00037929605,0.00015202136,0.0000014557015,0.00083384773,0.9556371],"genre_scores_gemma":[0.0016382902,0.00042680453,0.035099454,0.0002599773,0.00038413148,0.0000026540479,0.000005110531,0.000054844444,0.96212876],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983685,0.000033426622,0.0002644004,0.00065856206,0.00035197186,0.0003231302],"domain_scores_gemma":[0.9989138,0.00007677064,0.00019148875,0.00060734624,0.000048978618,0.00016158546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029609777,0.00037934716,0.0003663758,0.00017366408,0.00023735173,0.00033071978,0.00061973825,0.0002639703,0.00004115255],"category_scores_gemma":[0.000030867646,0.00037221386,0.000101500525,0.000021130067,0.00007261093,0.00009178905,0.00048426725,0.0012452216,0.00017796243],"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.0000019793654,0.000006188183,0.000026195015,0.00002868143,0.000032598444,0.000080683414,0.0003035539,0.000043734235,0.000022341013,0.15720716,0.00035116725,0.8418957],"study_design_scores_gemma":[0.00038185195,0.00022425754,0.00031657267,0.00046807178,0.000033191795,0.00008245891,0.0000016521518,0.02972086,0.000060800092,0.02279438,0.94518477,0.0007311365],"about_ca_topic_score_codex":0.000013260735,"about_ca_topic_score_gemma":0.0000031961258,"teacher_disagreement_score":0.9448336,"about_ca_system_score_codex":0.00002940893,"about_ca_system_score_gemma":0.000052570704,"threshold_uncertainty_score":0.999873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010521266,0.00031326714,0.9891156,0.00025589368,0.0010504449,0.00020655135,0.0000011273056,0.00019483657,0.007810146],"genre_scores_gemma":[0.22786844,0.00007130153,0.7703118,0.0006529043,0.0004949307,0.0000034389718,0.000003335326,0.000038345577,0.00055556686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996309,0.00005473297,0.00042418463,0.0016589833,0.00095037307,0.00060277025],"domain_scores_gemma":[0.997214,0.0012491909,0.00024387194,0.00089109794,0.00018263176,0.00021918424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016456255,0.00046778753,0.0004792243,0.0007958919,0.000404659,0.00047010073,0.0017827853,0.0003164934,0.000017553646],"category_scores_gemma":[0.0003738414,0.00040914584,0.000094618386,0.0005567138,0.0006489796,0.0005358562,0.001627779,0.0017753532,0.000022338563],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007910422,0.000012639994,0.00021436418,0.000012326198,0.0000039943625,0.000045932815,0.000644216,0.0093427515,0.000015238609,0.0033984613,0.0000015763643,0.9863006],"study_design_scores_gemma":[0.00040313177,0.00032737863,0.0032521575,0.00033430933,0.0000060130305,0.00010866566,4.2464288e-7,0.87507737,0.0003168366,0.11525391,0.004174947,0.0007448735],"about_ca_topic_score_codex":0.00004301511,"about_ca_topic_score_gemma":0.00012165313,"teacher_disagreement_score":0.9855557,"about_ca_system_score_codex":0.00021731356,"about_ca_system_score_gemma":0.0002605,"threshold_uncertainty_score":0.999836},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003386744,0.0003068013,0.99545234,0.00013537079,0.00094953144,0.00020542704,0.0000031636753,0.00009817413,0.002510529],"genre_scores_gemma":[0.4777214,0.00025007103,0.51943195,0.000436786,0.0005764255,0.000007007884,0.00001583533,0.00006665762,0.0014939043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964415,0.00006863378,0.00047861307,0.0013336667,0.0011219449,0.00055562914],"domain_scores_gemma":[0.99800456,0.0003205155,0.00049775094,0.00096808263,0.000060127655,0.0001489923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040440715,0.0005015496,0.0005957571,0.00066260475,0.00028546638,0.000116698255,0.0026537569,0.0002979554,0.000029672055],"category_scores_gemma":[0.00009285746,0.00045832226,0.00016149001,0.0004130946,0.0007848819,0.00040007077,0.0012366641,0.0014703103,0.000026138083],"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.000006139504,0.00002269879,0.00012549748,0.000018937186,0.000016861375,0.000072728864,0.0013728939,0.06363487,0.00044362398,0.0021545072,0.000006999677,0.93212426],"study_design_scores_gemma":[0.00076539745,0.0006609135,0.0025536781,0.00041853357,0.000014705706,0.00025977136,4.5946643e-7,0.9456471,0.0054387357,0.029975364,0.012964376,0.0013009476],"about_ca_topic_score_codex":0.000032174386,"about_ca_topic_score_gemma":0.0000070752785,"teacher_disagreement_score":0.93082327,"about_ca_system_score_codex":0.00018513971,"about_ca_system_score_gemma":0.00018408392,"threshold_uncertainty_score":0.99978685},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031527828,0.000017494322,0.9502654,0.0013912504,0.00037538033,0.00007037314,0.0000012572544,0.00043567296,0.04429037],"genre_scores_gemma":[0.8766412,5.2566577e-7,0.110083885,0.0003620883,0.0002534662,0.000004411163,0.00001781873,0.000011297174,0.012625302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893224,0.00004608594,0.00021019582,0.0003120736,0.00023267127,0.0002667158],"domain_scores_gemma":[0.99948955,0.00005937517,0.000068938454,0.00027949945,0.000038417533,0.00006420934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029909043,0.00012782868,0.00014322446,0.00008037543,0.00012556683,0.00013300074,0.00033365245,0.000048450132,0.00053357234],"category_scores_gemma":[0.000018021343,0.00010805764,0.000054331016,0.00021688482,0.000020821346,0.00026521718,0.00007024902,0.00016551811,0.00021883746],"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.000014853624,0.0003593774,0.0319304,0.00004516133,0.00006441153,0.00015176267,0.0034596266,0.057661813,0.0029190995,0.14985372,0.022038754,0.73150104],"study_design_scores_gemma":[0.0003211614,0.00006628378,0.020088058,0.000003549278,0.0000037067339,0.00003278485,0.000010241423,0.9658875,0.0002595996,0.0014279926,0.011698898,0.00020026036],"about_ca_topic_score_codex":0.00045894668,"about_ca_topic_score_gemma":0.000039373,"teacher_disagreement_score":0.90822566,"about_ca_system_score_codex":0.000019346237,"about_ca_system_score_gemma":0.000034522112,"threshold_uncertainty_score":0.5842243},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011155755,0.00004766018,0.99740237,0.0004123784,0.00018752096,0.00030735615,0.000015783144,0.000075694996,0.00043568062],"genre_scores_gemma":[0.7291875,0.0000035725232,0.2705278,0.000057319183,0.00009696972,0.0000141838245,0.000023834751,0.000017988757,0.00007086952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979656,0.000023245777,0.00033455945,0.0008559284,0.0004752642,0.00034541552],"domain_scores_gemma":[0.99805224,0.00096920005,0.0003356797,0.00038394635,0.00015984557,0.00009908938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049062655,0.00030515486,0.00034165973,0.000446159,0.00033718388,0.0001731873,0.00067073543,0.00012356708,0.00000337692],"category_scores_gemma":[0.00013933443,0.0002648505,0.0000540238,0.0002590173,0.0003153414,0.00026146762,0.0001740678,0.0005949794,0.0000017364725],"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.000007366616,0.000019127792,0.00013410722,0.000045092635,0.0000090080375,0.0000029247967,0.0009816671,0.313873,0.000036174803,0.041224256,0.0000015007621,0.6436658],"study_design_scores_gemma":[0.00028556446,0.00041909932,0.0016843504,0.0006494444,0.000009931437,0.00002941401,0.0000024017531,0.98516876,0.000036667596,0.011317537,0.000100433455,0.00029641666],"about_ca_topic_score_codex":0.000006935759,"about_ca_topic_score_gemma":0.000013691825,"teacher_disagreement_score":0.72807187,"about_ca_system_score_codex":0.00009997532,"about_ca_system_score_gemma":0.00026529038,"threshold_uncertainty_score":0.9999804},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002622415,0.0001554801,0.9942024,0.0002435293,0.0009130832,0.0004066285,0.00000613438,0.00031442376,0.003496131],"genre_scores_gemma":[0.07261387,0.00000583419,0.9238655,0.0011328412,0.00084357866,0.000032396718,0.00021315743,0.0000498,0.001243015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956386,0.00005842989,0.00066480966,0.0012235238,0.0016600358,0.00075460295],"domain_scores_gemma":[0.9976413,0.00035354015,0.00042038778,0.0010916995,0.0002873568,0.00020566492],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015765403,0.00051995355,0.0004250694,0.00050491636,0.00044509943,0.0011457105,0.0029529028,0.00024877986,0.000022500659],"category_scores_gemma":[0.000110017936,0.00046609418,0.00009773161,0.0005473084,0.00041529213,0.0011791855,0.0007937391,0.00096530345,0.000040330022],"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.000001786326,0.000032491545,0.000046903733,0.000028231681,0.000004155375,0.00001028563,0.00038673097,0.04871714,0.000019720359,0.004766813,0.00008608929,0.94589967],"study_design_scores_gemma":[0.0002641291,0.00040066545,0.00010124574,0.0001605838,0.000004937718,0.00006208799,9.706204e-8,0.93805563,0.000047012494,0.05693068,0.0034129643,0.0005599344],"about_ca_topic_score_codex":0.00018589699,"about_ca_topic_score_gemma":0.000044037504,"teacher_disagreement_score":0.94533974,"about_ca_system_score_codex":0.00021932738,"about_ca_system_score_gemma":0.0005602388,"threshold_uncertainty_score":0.9998912},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023488414,0.00005926719,0.9953997,0.00049641007,0.00030479056,0.00012925625,0.000004813697,0.0001007253,0.0011561743],"genre_scores_gemma":[0.012164706,0.0000052393552,0.9869196,0.00036071148,0.00019352906,0.000009225887,0.000016558068,0.000003881217,0.0003265387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994648,0.000015100881,0.00016707665,0.00008482678,0.00013909483,0.0001290837],"domain_scores_gemma":[0.9995103,0.000047343103,0.00007249122,0.00019100071,0.000079689606,0.00009918355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000374809,0.00007558315,0.0000852356,0.00004127451,0.00009372519,0.00017472547,0.00018871739,0.000043854234,0.000001033642],"category_scores_gemma":[0.00015151933,0.00006311868,0.000022609545,0.000068763606,0.000021233162,0.00034229388,0.000092570524,0.000060789404,0.000011733316],"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.00002955267,0.0001984715,0.013679039,0.0007112063,0.00004924883,0.0000033374633,0.024762327,0.014443309,0.000063788524,0.21746515,0.23220193,0.49639264],"study_design_scores_gemma":[0.00035450165,0.00008695609,0.00023708043,0.0000038008468,0.0000032181445,0.000010752303,0.00007011275,0.98462445,0.000043751126,0.0012192804,0.013253642,0.00009247247],"about_ca_topic_score_codex":0.000009467873,"about_ca_topic_score_gemma":0.000010728616,"teacher_disagreement_score":0.9701811,"about_ca_system_score_codex":0.000011257085,"about_ca_system_score_gemma":0.000062378625,"threshold_uncertainty_score":0.2573905},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012585778,0.000057153105,0.9670003,0.0013613573,0.0002455597,0.0001305484,0.0000014175405,0.00027481906,0.018343087],"genre_scores_gemma":[0.8736078,3.4399278e-7,0.11892533,0.0007632549,0.000373911,0.000011156718,0.000035761408,0.00001098198,0.00627144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992858,0.00001812343,0.00014170204,0.00022301135,0.000120777986,0.00021058477],"domain_scores_gemma":[0.99962527,0.00006336305,0.000052223644,0.00018610171,0.000043729946,0.000029298642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017508298,0.000094249306,0.00010552744,0.00006255416,0.00018355498,0.00043015153,0.00023426171,0.00003108884,0.00002118464],"category_scores_gemma":[0.000011230665,0.00007768851,0.00004451176,0.00009943464,0.000015147396,0.00033292343,0.000032293145,0.00007387656,0.000028265358],"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.000018230765,0.00017190895,0.020280235,0.000069067566,0.000024248413,0.000012161898,0.00083886273,0.018277906,0.0021046116,0.8776152,0.061826453,0.018761104],"study_design_scores_gemma":[0.00032340715,0.000040651696,0.0033992894,0.0000096422655,0.000001535054,0.000010894385,0.000008731258,0.95327884,0.0007987392,0.007595003,0.034399115,0.0001341802],"about_ca_topic_score_codex":0.0001172747,"about_ca_topic_score_gemma":0.0000020185553,"teacher_disagreement_score":0.9350009,"about_ca_system_score_codex":0.000012825104,"about_ca_system_score_gemma":0.000016403921,"threshold_uncertainty_score":0.4147961},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053270312,0.00058194523,0.986947,0.0017041436,0.0006945436,0.00034019616,0.000001388348,0.00021198862,0.009465506],"genre_scores_gemma":[0.14960217,0.00011802428,0.84473157,0.002975321,0.0008148752,0.000016978433,0.0000043385107,0.000063095555,0.0016736187],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99525887,0.00008888631,0.000754316,0.0017068149,0.0013181976,0.00087289495],"domain_scores_gemma":[0.99730474,0.00072641205,0.00027689335,0.0012804293,0.00019599132,0.00021556528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021113518,0.00059954607,0.0007928959,0.001042349,0.00021183338,0.00081658305,0.003590108,0.0003685091,0.000032587646],"category_scores_gemma":[0.00040306788,0.0005350339,0.00014384012,0.0007501507,0.00046096143,0.0005570595,0.00080694474,0.0016473351,0.00011534245],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031031557,0.000032192216,0.00004216799,0.000034417026,0.000004994942,0.00021286799,0.0007974509,0.0074250787,0.00005967467,0.03559839,0.000011556141,0.9557781],"study_design_scores_gemma":[0.00026207615,0.00014002864,0.00016839686,0.0012942235,0.0000049278947,0.00015759193,2.6164423e-7,0.4693621,0.00035442194,0.5269434,0.0006534113,0.00065917155],"about_ca_topic_score_codex":0.000036838737,"about_ca_topic_score_gemma":0.000058207555,"teacher_disagreement_score":0.95511895,"about_ca_system_score_codex":0.00023433333,"about_ca_system_score_gemma":0.0004364846,"threshold_uncertainty_score":0.99971014},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02967015,0.0008422582,0.91715646,0.023409924,0.0017484833,0.00051210565,0.0003150884,0.0018927127,0.024452819],"genre_scores_gemma":[0.4120922,0.000082489074,0.56650335,0.0043094927,0.0020982076,0.00010499001,0.0008014465,0.00009557986,0.013912226],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99795467,0.00011402977,0.00020986899,0.0006432547,0.00061568175,0.00046252055],"domain_scores_gemma":[0.99823505,0.0001065895,0.00009156012,0.0011687598,0.000096089025,0.000301946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005007298,0.00022591109,0.00024572367,0.000034514673,0.00028268347,0.0003117593,0.0013793681,0.00011361427,0.000031947642],"category_scores_gemma":[0.00006802554,0.00017531334,0.000057551886,0.00038757533,0.00013607567,0.00060056936,0.00062107894,0.0005939261,0.0001617229],"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.00008027038,0.0010227327,0.025640482,0.00013530633,0.0005038941,0.0003959874,0.014760243,0.0037334242,0.00020744566,0.13205506,0.787825,0.03364015],"study_design_scores_gemma":[0.003835533,0.00086531567,0.0028151865,0.00011910043,0.000079095065,0.00036615744,0.0009305951,0.26244566,0.00017098668,0.01533268,0.7116748,0.0013648848],"about_ca_topic_score_codex":0.0000845382,"about_ca_topic_score_gemma":0.000077677876,"teacher_disagreement_score":0.38242206,"about_ca_system_score_codex":0.000044419307,"about_ca_system_score_gemma":0.00026726033,"threshold_uncertainty_score":0.71490705},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037197658,0.00018623461,0.9936897,0.00043222657,0.002248038,0.00028342468,0.000014522017,0.00027407196,0.0024997615],"genre_scores_gemma":[0.40894753,0.000014293786,0.58940214,0.0004733934,0.00060236093,0.000005852623,0.0000064483784,0.000031680152,0.00051634724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648774,0.00006189293,0.0006213803,0.0014065941,0.00086089113,0.0005615131],"domain_scores_gemma":[0.9972596,0.00028125546,0.0003963469,0.001613162,0.0002418343,0.00020781103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001084598,0.0004998263,0.00058139913,0.0006933719,0.0003465501,0.00027225565,0.0019968562,0.00027770962,0.000045745997],"category_scores_gemma":[0.000070496724,0.00046304814,0.00019456964,0.0006537039,0.00046916047,0.00042088315,0.0010943301,0.0011310972,0.000042144315],"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.0000048493685,0.00013077953,0.00005036082,0.00011719246,0.00003651512,0.0018544176,0.0023060048,0.49593377,0.000043280925,0.027192334,0.000021786003,0.4723087],"study_design_scores_gemma":[0.00041867848,0.00027783195,0.00006619534,0.00027709542,0.0000151114,0.0015325809,2.7127598e-7,0.89238364,0.000501368,0.10278325,0.0010445534,0.00069944066],"about_ca_topic_score_codex":0.0002312394,"about_ca_topic_score_gemma":0.000050414947,"teacher_disagreement_score":0.47160926,"about_ca_system_score_codex":0.00028784026,"about_ca_system_score_gemma":0.00068243267,"threshold_uncertainty_score":0.99978215},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005762571,0.00013062195,0.9348206,0.009754586,0.0009635849,0.00038944377,0.0000039801903,0.0004653013,0.047709342],"genre_scores_gemma":[0.9926005,0.00011530507,0.002716369,0.0010313699,0.00025268612,0.000038182734,0.0000028474064,0.000017629434,0.003225112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974682,0.0003959344,0.00038792434,0.0006903132,0.00048297126,0.00057468],"domain_scores_gemma":[0.9982096,0.0006073795,0.00012065091,0.0006257695,0.00024370247,0.0001929279],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000567401,0.0002726226,0.00023639991,0.00009913158,0.0008106562,0.0004300268,0.0010887169,0.00011266144,0.0009394268],"category_scores_gemma":[0.0005289872,0.00020509439,0.00012936663,0.0006568098,0.00034328125,0.0005659686,0.00030440805,0.0010123524,0.0013388863],"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.0000092379805,0.000060677994,0.000071149305,0.0000026058497,0.00002210851,0.000043334127,0.0067729186,0.0014787742,0.0008297494,0.07999275,0.00061679806,0.9100999],"study_design_scores_gemma":[0.000024505289,0.00021445107,0.00036264255,0.000029452953,0.000014890913,0.000055518754,0.0020499502,0.9418425,0.01747693,0.0076693157,0.029827869,0.00043196836],"about_ca_topic_score_codex":0.0002439927,"about_ca_topic_score_gemma":0.00006124699,"teacher_disagreement_score":0.9868379,"about_ca_system_score_codex":0.000066643726,"about_ca_system_score_gemma":0.00004871639,"threshold_uncertainty_score":0.99997383},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0155130215,0.000011432654,0.87878156,0.0055853776,0.0002734574,0.000073739364,3.2366435e-7,0.00070171256,0.09905937],"genre_scores_gemma":[0.8936526,0.0000014720331,0.08041949,0.0019518898,0.00009189789,0.0000045834922,0.0000025579582,0.000007751507,0.023867713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990452,0.00021005943,0.00008145077,0.00027472212,0.00020777552,0.00018080776],"domain_scores_gemma":[0.99939513,0.00019900013,0.00002937327,0.00026213887,0.000033207223,0.000081169215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020702805,0.000103287544,0.000098320415,0.00007963508,0.00068240834,0.000042164615,0.00028581778,0.000028279392,0.000054196244],"category_scores_gemma":[0.0001427707,0.00007716268,0.000042007112,0.00014912775,0.000027719987,0.00011814296,0.00007540192,0.00050343963,0.00026313594],"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.000024916542,0.000881112,0.013165782,0.00001278016,0.00004372218,0.0005018522,0.0067332233,0.598662,0.001323439,0.17592455,0.062136173,0.1405904],"study_design_scores_gemma":[0.00020670446,0.00022015286,0.0008717272,0.000008027289,7.630777e-7,0.000015199167,0.000011796178,0.95943433,0.00020584761,0.000024485114,0.03888178,0.000119193406],"about_ca_topic_score_codex":0.00010477605,"about_ca_topic_score_gemma":0.000001320373,"teacher_disagreement_score":0.8781396,"about_ca_system_score_codex":0.000014251158,"about_ca_system_score_gemma":0.000047596175,"threshold_uncertainty_score":0.5248602},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004691335,0.0005527925,0.9927317,0.0008627181,0.0008734385,0.00028970672,0.0000014410541,0.00024262206,0.0039764293],"genre_scores_gemma":[0.1430684,0.00023251293,0.8518764,0.0012588835,0.0010302112,0.000022135619,0.000008278728,0.000069777794,0.0024334323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955652,0.000071067516,0.00058537367,0.0017829238,0.0011436767,0.0008517799],"domain_scores_gemma":[0.9972443,0.001092363,0.0003327482,0.0008822086,0.00027043637,0.00017792088],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011635444,0.0005660891,0.00059874076,0.00090791093,0.00030634573,0.0006652409,0.0031523015,0.000332385,0.00004716178],"category_scores_gemma":[0.00060708506,0.00051432656,0.00009648552,0.0012224584,0.00029910292,0.0009858296,0.0013690748,0.0018890991,0.00006840955],"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.000009928291,0.00002517902,0.0003148177,0.000029136834,0.000003402778,0.00007616907,0.000620189,0.21552418,0.000013317496,0.0006004876,0.0000072583944,0.78277594],"study_design_scores_gemma":[0.00046857487,0.00024439205,0.0012292608,0.0010579743,0.0000048858965,0.00005993928,4.0956908e-7,0.9502536,0.00052946334,0.034590032,0.010703893,0.0008575473],"about_ca_topic_score_codex":0.00006381712,"about_ca_topic_score_gemma":0.0006511511,"teacher_disagreement_score":0.7819184,"about_ca_system_score_codex":0.00032898245,"about_ca_system_score_gemma":0.0011100739,"threshold_uncertainty_score":0.9997308},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019972332,0.000018454073,0.9708777,0.0004066974,0.00012663646,0.00027133684,0.0000021792089,0.00036463243,0.007960031],"genre_scores_gemma":[0.903746,0.0000026134333,0.092776075,0.00004006087,0.000033668035,0.000055867527,0.000005020893,0.000008585907,0.003332069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989294,0.00008707229,0.00016413059,0.00033605532,0.0002607856,0.00022258243],"domain_scores_gemma":[0.9991864,0.00009957683,0.00006234742,0.00040831938,0.00012820684,0.00011517744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008886927,0.00010855442,0.0001278698,0.000061037164,0.00012177135,0.00033313042,0.0003814394,0.000023438119,0.000024786877],"category_scores_gemma":[0.000006089803,0.00007609794,0.000023501492,0.00020103493,0.000037523143,0.0004891909,0.00009890791,0.0001682766,0.00011711105],"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.000002217503,0.000029367959,0.0005284844,0.0000058281416,0.000017607683,0.0000046538303,0.00033569368,0.9915785,0.000012950596,0.006448349,0.0003291674,0.0007071588],"study_design_scores_gemma":[0.00022001195,0.00007043976,0.0005176343,0.000018359407,0.0000032014545,0.000013666248,0.00007742982,0.99790025,0.000017958822,0.00095154636,0.00009655929,0.00011293668],"about_ca_topic_score_codex":0.0031814878,"about_ca_topic_score_gemma":0.0000049802115,"teacher_disagreement_score":0.8837737,"about_ca_system_score_codex":0.000017192213,"about_ca_system_score_gemma":0.000028377784,"threshold_uncertainty_score":0.4809479},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04031282,0.0000459462,0.91349185,0.006215344,0.000062531064,0.000045207016,1.03379335e-7,0.0003525442,0.039473675],"genre_scores_gemma":[0.9697252,0.000009684251,0.012998179,0.0006460722,0.00006698526,0.0000032831997,0.0000010171441,0.0000068626396,0.016542736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993675,0.000055435357,0.000056937704,0.00017399057,0.0001675419,0.00017860238],"domain_scores_gemma":[0.99959856,0.00006896575,0.000031501542,0.00024378172,0.000017893444,0.000039275244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002229651,0.0000789119,0.000063770756,0.000025212752,0.00023764999,0.00015837076,0.00044573183,0.000013754524,0.00007683827],"category_scores_gemma":[0.000013844773,0.00003994141,0.000020437808,0.0002532457,0.000019212142,0.00014885078,0.00012904119,0.00025522168,0.00007952881],"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.000026549766,0.00006146806,0.09226738,0.0000139574895,0.000072928095,0.00024509963,0.0048191487,0.123074725,0.00029193476,0.048045557,0.0042519723,0.7268293],"study_design_scores_gemma":[0.00022072854,0.0001484703,0.004112528,0.000006562847,0.000002382303,0.00016048619,0.00007805849,0.8092585,0.000060965536,0.000099770215,0.18571874,0.00013281469],"about_ca_topic_score_codex":0.00017652081,"about_ca_topic_score_gemma":0.000024428613,"teacher_disagreement_score":0.92941236,"about_ca_system_score_codex":0.000007185187,"about_ca_system_score_gemma":0.000012261945,"threshold_uncertainty_score":0.18278356},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022780393,0.00080493797,0.98795366,0.0010160931,0.00068561547,0.00016625645,0.0000012504653,0.00027799208,0.008866403],"genre_scores_gemma":[0.5821436,0.00030140838,0.4118391,0.0020736412,0.0009872111,0.000008214035,0.000007078677,0.00007849345,0.0025612358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966503,0.000059914633,0.0003648355,0.0015205186,0.0007494795,0.00065495056],"domain_scores_gemma":[0.99840367,0.000322343,0.00017808663,0.0008012104,0.00008260933,0.00021207178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062416703,0.00050454336,0.00047148,0.0005918849,0.00040213353,0.0007685404,0.0019046379,0.00024719184,0.000027541573],"category_scores_gemma":[0.00004159997,0.0004515854,0.0000953728,0.00037900254,0.00049963134,0.00069100497,0.0009841258,0.0016380266,0.000027529757],"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.0000017384117,0.0000056320123,0.000020171532,0.000010018303,0.0000033046542,0.000070919516,0.00047657627,0.3045144,0.000006527065,0.008616619,0.000003599821,0.6862705],"study_design_scores_gemma":[0.0001452263,0.00012884068,0.000054446275,0.00012533533,0.0000036441338,0.00017035674,7.610252e-8,0.8482506,0.000026408417,0.14925118,0.0013961428,0.00044772477],"about_ca_topic_score_codex":0.000045975863,"about_ca_topic_score_gemma":0.000012299758,"teacher_disagreement_score":0.6858228,"about_ca_system_score_codex":0.00007674338,"about_ca_system_score_gemma":0.00017452812,"threshold_uncertainty_score":0.9997936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1869668,0.000068175876,0.66621983,0.004400979,0.0007320138,0.00039349927,2.0216618e-7,0.0010126035,0.14020592],"genre_scores_gemma":[0.7701496,0.0000012695234,0.20782861,0.0005345674,0.00008846485,0.000032699627,0.0000017781167,0.000013947215,0.021349074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989186,0.000109997876,0.00013508974,0.000329915,0.00022606416,0.00028035865],"domain_scores_gemma":[0.99947107,0.00003138421,0.000031662705,0.00024031043,0.000049060607,0.00017650904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006512265,0.00010291494,0.0001278475,0.00013005044,0.00003939915,0.00014066474,0.00044744377,0.00003565455,0.000011509601],"category_scores_gemma":[0.00022895483,0.00008365405,0.00002241992,0.0005264272,0.0000074322143,0.00019564464,0.00022263535,0.00023775896,0.00039052012],"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.00003687009,0.00020287762,0.03575207,0.000025465912,0.000010067272,0.0001440647,0.01534081,0.067144886,0.00013662719,0.02988487,0.01609615,0.8352252],"study_design_scores_gemma":[0.00048526714,0.00038069408,0.0022781019,0.000039261173,0.0000010621003,0.0000431442,0.0002901249,0.9534657,0.00023224561,0.0011733406,0.04133487,0.00027615932],"about_ca_topic_score_codex":0.00052550586,"about_ca_topic_score_gemma":0.000049224498,"teacher_disagreement_score":0.8863208,"about_ca_system_score_codex":0.000042143147,"about_ca_system_score_gemma":0.0000507771,"threshold_uncertainty_score":0.50194764},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63889897,0.000010036497,0.35133442,0.0039634225,0.0003005178,0.00018091459,0.0000011487389,0.0020483972,0.00326218],"genre_scores_gemma":[0.9844182,0.000015188,0.014470808,0.00011890863,0.00012707319,0.0000020557,0.000007364983,0.000012943577,0.00082744256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977953,0.0003435022,0.00020937846,0.0007254653,0.00039640508,0.0005299797],"domain_scores_gemma":[0.9986939,0.0003217795,0.00023630513,0.0003752536,0.00025882234,0.000113932285],"candidate_categories":["sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007003295,0.00027845963,0.00024433463,0.0004447676,0.0015542533,0.0005872004,0.0013683091,0.00047265875,0.00010105205],"category_scores_gemma":[0.0005205125,0.00022054515,0.00013732773,0.0023475622,0.00035493737,0.0017040487,0.000514402,0.0029571685,0.000076166296],"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.00008063912,0.0002794319,0.0022813634,0.000013317602,0.0000875047,0.000072376504,0.0008790288,0.0053243074,0.03369156,0.7947414,0.0003822945,0.16216676],"study_design_scores_gemma":[0.0015856882,0.00092649617,0.011386104,0.000036967143,0.000057963287,0.0003397605,0.0054750945,0.8218639,0.021365086,0.014488668,0.12137565,0.0010986468],"about_ca_topic_score_codex":0.00024855733,"about_ca_topic_score_gemma":0.0002211147,"teacher_disagreement_score":0.8165396,"about_ca_system_score_codex":0.00010921151,"about_ca_system_score_gemma":0.00016588454,"threshold_uncertainty_score":0.9997456},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051320955,0.00018740947,0.98977,0.002228234,0.0035976993,0.0002929222,0.0000031131544,0.0003762804,0.0030311444],"genre_scores_gemma":[0.035968423,0.000014446845,0.9576829,0.0036164194,0.0011159576,0.000012225868,0.000003958623,0.00005361708,0.0015320465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959065,0.00004654326,0.00047719295,0.0017183435,0.001037555,0.0008138715],"domain_scores_gemma":[0.99735683,0.00019232147,0.00023505194,0.0016722339,0.00022673211,0.0003168252],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009640758,0.00057830475,0.00058787124,0.00085215276,0.0004739027,0.001064751,0.003965347,0.0003603054,0.000053790543],"category_scores_gemma":[0.00018544006,0.0005222302,0.00014244852,0.0007047836,0.0004348558,0.00044441991,0.0019512817,0.0015860576,0.0001557206],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037768266,0.00001623338,0.000025023528,0.00001703821,0.0000067456717,0.000112938775,0.0010013427,0.023257505,0.000812936,0.012462456,0.000016989068,0.96226704],"study_design_scores_gemma":[0.00052695355,0.0004380489,0.00040674108,0.0004954893,0.000012157542,0.0002652849,2.1856204e-7,0.7718852,0.008674857,0.16247539,0.052736755,0.002082902],"about_ca_topic_score_codex":0.00023484706,"about_ca_topic_score_gemma":0.00019657651,"teacher_disagreement_score":0.9601841,"about_ca_system_score_codex":0.00014224333,"about_ca_system_score_gemma":0.00042899713,"threshold_uncertainty_score":0.9999722},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017539048,0.00008546042,0.9945815,0.00056601776,0.0012055368,0.00028017524,0.0000035498026,0.00028790484,0.0028144708],"genre_scores_gemma":[0.06515518,0.0000021059536,0.93251055,0.0013670909,0.0006541003,0.0000080201935,0.0000085085185,0.000046218913,0.00024822558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956588,0.00003245816,0.0004438367,0.0017553315,0.0012158585,0.0008937276],"domain_scores_gemma":[0.9971521,0.0005263829,0.00041802914,0.0014587871,0.00020221375,0.00024249348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012555382,0.00062312547,0.0005370053,0.0008159925,0.00055206346,0.00096868933,0.003188924,0.00032096487,0.000040932086],"category_scores_gemma":[0.00010608754,0.0005138028,0.00011199023,0.0004883233,0.00066864863,0.00043055986,0.00059676525,0.00217118,0.000038850365],"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.0000048776974,0.00001561782,0.000097963704,0.00003996969,0.000008172726,0.00008391134,0.0006461257,0.041344896,0.0009305554,0.0025135686,0.0000012862835,0.95431304],"study_design_scores_gemma":[0.0005095842,0.00034229498,0.000083603365,0.0004936919,0.000009827051,0.00008955579,3.496256e-7,0.9831012,0.002635853,0.009327758,0.002428783,0.000977531],"about_ca_topic_score_codex":0.0000672293,"about_ca_topic_score_gemma":0.000101741054,"teacher_disagreement_score":0.9533355,"about_ca_system_score_codex":0.00014935296,"about_ca_system_score_gemma":0.0010481788,"threshold_uncertainty_score":0.99973136},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21727951,0.009732309,0.32357776,0.38957977,0.020634176,0.0010293747,0.00004472535,0.0018994907,0.03622287],"genre_scores_gemma":[0.74333304,0.00017564473,0.24434432,0.0020756654,0.0015306886,0.000094251765,0.000017921193,0.000050101135,0.00837836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998119,0.00007061824,0.00043383008,0.00069428387,0.00023185996,0.00045041385],"domain_scores_gemma":[0.997459,0.00004722528,0.00015451266,0.0018607469,0.00033541332,0.00014307885],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042677316,0.00026748792,0.00034598817,0.00045014574,0.0003551295,0.00012061583,0.0017945603,0.000270063,0.00011138072],"category_scores_gemma":[0.00028476972,0.00020465499,0.00014387176,0.002781068,0.00018533671,0.0004081186,0.0010776274,0.00064514944,0.0008921981],"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.000014645942,0.0005816402,0.00047125405,0.00013217257,0.00015825454,0.0063245543,0.0009650695,0.0009947212,0.0040826416,0.49882683,0.14818108,0.33926713],"study_design_scores_gemma":[0.00043904842,0.00010458175,0.000034532124,0.00007125889,0.000016266387,0.002610475,0.0001695181,0.0064245053,0.022079008,0.00095664704,0.9668028,0.0002913679],"about_ca_topic_score_codex":0.000034896148,"about_ca_topic_score_gemma":0.0003798925,"teacher_disagreement_score":0.8186217,"about_ca_system_score_codex":0.0000459531,"about_ca_system_score_gemma":0.00035009722,"threshold_uncertainty_score":0.99988574},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000576641,0.000012335317,0.99240786,0.0034768358,0.00004344356,0.00035728625,0.000002534635,0.00024242225,0.0028806238],"genre_scores_gemma":[0.027564421,0.0000015619262,0.9696486,0.0005892021,0.00009388956,0.000294859,0.000013676667,0.0000072329663,0.0017865573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946135,0.000010848942,0.00009752171,0.00021120683,0.00009168914,0.00012739582],"domain_scores_gemma":[0.9994869,0.0000401867,0.000023604232,0.00022620537,0.00006749727,0.00015559526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015820164,0.00005736391,0.00007039385,0.00004618696,0.00006946327,0.0000980901,0.00022739501,0.000025175235,0.0000018664821],"category_scores_gemma":[0.000029488343,0.000046153236,0.000012779615,0.00018107028,0.000008974163,0.00012273446,0.00011734682,0.00003091509,0.000012649454],"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.000009983024,0.00009281755,0.00028495776,0.000027527665,0.00001091041,5.758929e-7,0.0011186908,0.00021368795,0.000035340476,0.47996888,0.016954806,0.50128186],"study_design_scores_gemma":[0.0003256873,0.00007039714,0.00008051933,0.0000023413318,0.000002236951,0.0000043366467,0.000015830514,0.9057467,0.000072088864,0.010550899,0.0830503,0.00007863215],"about_ca_topic_score_codex":0.000027117163,"about_ca_topic_score_gemma":0.000008992002,"teacher_disagreement_score":0.905533,"about_ca_system_score_codex":0.000014330373,"about_ca_system_score_gemma":0.000054483902,"threshold_uncertainty_score":0.18820743},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9733028,0.000020302123,0.015926888,0.0019357901,0.00044340288,0.00028959068,0.000005102648,0.00008255801,0.00799361],"genre_scores_gemma":[0.9914392,0.000014559565,0.0082768975,0.00005325062,0.00003731697,0.000005896327,2.482767e-7,0.000005451052,0.00016717921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987113,0.000016973645,0.00035317495,0.00036770545,0.000356284,0.00019454666],"domain_scores_gemma":[0.99852496,0.00024243725,0.00033137324,0.00025963582,0.0005742789,0.00006732983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044401563,0.00015474457,0.00020046737,0.000081739825,0.00013303268,0.00012463993,0.0011455365,0.00008796985,0.000028220338],"category_scores_gemma":[0.0013133762,0.00011050051,0.000055652818,0.00034802224,0.00031865694,0.00021973484,0.0002606865,0.0004725467,0.0000075159705],"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.000028712042,0.000081804435,0.0005869829,0.00004554178,0.000006375773,1.8908338e-7,0.0016443066,0.000030284824,0.10116308,0.5679729,0.000026246733,0.32841358],"study_design_scores_gemma":[0.0000286578,0.0002155444,0.003715,0.000106118656,0.000009113357,0.000010581047,0.00022343881,0.2847931,0.5478815,0.16274135,0.00009158757,0.0001839872],"about_ca_topic_score_codex":0.00009251945,"about_ca_topic_score_gemma":0.000023580014,"teacher_disagreement_score":0.44671842,"about_ca_system_score_codex":0.0000050128706,"about_ca_system_score_gemma":0.000051311796,"threshold_uncertainty_score":0.450608},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011011992,0.0004784526,0.99417585,0.0033237545,0.0008465139,0.00036227,0.0000048465085,0.0000607121,0.00073659886],"genre_scores_gemma":[0.019212788,0.000027268146,0.97861207,0.0005368997,0.00043342225,0.000008209746,0.0000024485428,0.000019299443,0.0011475753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998171,0.000014111541,0.0003216438,0.00070999964,0.00045994288,0.0003233334],"domain_scores_gemma":[0.9981164,0.00065540615,0.0002321679,0.000758421,0.00013007078,0.00010757261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006061938,0.0002685987,0.00030586682,0.00030687157,0.00036507717,0.00025088593,0.0017782942,0.00015773448,0.0000084379235],"category_scores_gemma":[0.00011464516,0.00018926038,0.000099556055,0.00034085117,0.00054819696,0.00022141587,0.00050749985,0.0005045216,0.000002484336],"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.0000029725666,0.000008843561,0.000013462635,0.000050640425,0.000012117413,0.000002405737,0.001154117,0.060570106,0.00001948305,0.11257694,0.000026750391,0.8255622],"study_design_scores_gemma":[0.00025151903,0.00012893822,0.00006775135,0.00013760156,0.000008565884,0.00001826901,3.0782456e-7,0.80166584,0.00012869021,0.1937654,0.003613743,0.00021335746],"about_ca_topic_score_codex":0.0000671038,"about_ca_topic_score_gemma":0.000028614118,"teacher_disagreement_score":0.8253488,"about_ca_system_score_codex":0.0000735376,"about_ca_system_score_gemma":0.0007171292,"threshold_uncertainty_score":0.7717814},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028410709,0.000109050954,0.96700287,0.0036282844,0.00038028386,0.00013155134,1.5422223e-7,0.000083173225,0.0002539305],"genre_scores_gemma":[0.87480545,0.0000053003496,0.12412071,0.0009657138,0.00007567029,0.000005486262,1.0841773e-7,0.0000050316626,0.000016509342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808717,0.00017644747,0.00021894234,0.00054815173,0.0005770072,0.0003922655],"domain_scores_gemma":[0.9984054,0.0007116762,0.000110686546,0.0006232202,0.000085790314,0.000063220315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000840857,0.00015824163,0.00017366878,0.0001661334,0.0002861404,0.00019264399,0.0019586121,0.00004489269,0.000049579266],"category_scores_gemma":[0.0004391261,0.000095285024,0.00005306706,0.0014297368,0.0005392272,0.0002452949,0.00040651354,0.0005403002,0.00004662983],"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.0000016918734,0.000057262794,0.0011555617,0.0000061563187,0.0000027056722,0.000009272393,0.0030476202,0.4052904,0.00028428258,0.00820219,0.00003438904,0.58190846],"study_design_scores_gemma":[0.00015675528,0.00022564013,0.0008681327,0.000048037942,6.8378824e-7,0.000013212809,8.1862123e-7,0.9921871,0.0016687977,0.0045036413,0.00019289415,0.00013428264],"about_ca_topic_score_codex":0.000028058646,"about_ca_topic_score_gemma":0.0000022252434,"teacher_disagreement_score":0.8463948,"about_ca_system_score_codex":0.00003206463,"about_ca_system_score_gemma":0.00004081962,"threshold_uncertainty_score":0.38856107},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016251354,0.00001945183,0.9813953,0.00044413088,0.000254358,0.00022918187,0.000023060813,0.00038562674,0.0009975316],"genre_scores_gemma":[0.8369523,0.000042565604,0.15846294,0.00009333885,0.0000782337,6.9696057e-7,0.00013123584,0.000025203717,0.004213432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976421,0.00041671158,0.0001424804,0.0013761735,0.00011600622,0.0003065379],"domain_scores_gemma":[0.9961881,0.00012879029,0.00023516339,0.0031316031,0.00014141062,0.00017491056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004109789,0.00028554237,0.00025441026,0.00023550383,0.00017361234,0.00027344032,0.0035257812,0.00019370325,0.00007765699],"category_scores_gemma":[0.00007462143,0.00027801274,0.00005369743,0.00051160203,0.000081150196,0.00062562805,0.003327535,0.0006142735,0.00008020173],"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.00008619862,0.000040865958,0.0005211948,0.000019975532,0.0000450193,0.00019237607,0.000105634936,0.98922545,0.0000024513388,0.008388851,0.0005765018,0.00079548673],"study_design_scores_gemma":[0.00037716381,0.000067880166,0.0005882662,0.00006632316,0.000032150307,0.0000091163,0.000022441916,0.9962761,0.0000061372643,0.0012954557,0.00089250156,0.00036650943],"about_ca_topic_score_codex":0.0002845244,"about_ca_topic_score_gemma":0.000010877464,"teacher_disagreement_score":0.82293236,"about_ca_system_score_codex":0.000080969185,"about_ca_system_score_gemma":0.0002342662,"threshold_uncertainty_score":0.9999672},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015183179,0.0009853133,0.9889373,0.0021823037,0.0010030669,0.0001542846,7.169818e-7,0.00029359464,0.0062915585],"genre_scores_gemma":[0.14811742,0.00026719004,0.8410378,0.0025465467,0.0015092638,0.000006621602,0.000004395039,0.00007302905,0.006437722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645156,0.000057597375,0.00039701923,0.001592325,0.00080974324,0.00069176214],"domain_scores_gemma":[0.99828994,0.0004467308,0.00024782348,0.0006763204,0.0001210995,0.00021810508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009077156,0.0005181007,0.000484281,0.000686467,0.00048763127,0.0008659538,0.0016799822,0.00029989542,0.000029753148],"category_scores_gemma":[0.00009562846,0.00047312846,0.00009539134,0.00037150737,0.0005271925,0.0005132417,0.0014585927,0.0018094594,0.000053898842],"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.000001407494,0.00000856502,0.0001683,0.000020542855,0.000007625863,0.00003991328,0.00046247055,0.039294444,0.000057919195,0.009724664,0.000008910671,0.9502052],"study_design_scores_gemma":[0.00028144688,0.0001843167,0.0005629858,0.00033358877,0.0000073275155,0.00016455936,3.6369983e-7,0.94038653,0.00012108574,0.042741053,0.01444422,0.00077250245],"about_ca_topic_score_codex":0.000017285794,"about_ca_topic_score_gemma":0.000021872223,"teacher_disagreement_score":0.94943273,"about_ca_system_score_codex":0.00017722543,"about_ca_system_score_gemma":0.0002612363,"threshold_uncertainty_score":0.999772},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007685183,0.00009845573,0.9949837,0.00048950507,0.00020357012,0.00047896852,0.000009048308,0.00013693325,0.0035230175],"genre_scores_gemma":[0.29640174,0.0000029026955,0.7027001,0.00032569945,0.0002571425,0.000022026108,0.000017351593,0.000026070582,0.00024701108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663126,0.000059922277,0.00045935708,0.0011590405,0.0012651541,0.00042524413],"domain_scores_gemma":[0.99755025,0.00071760017,0.00038516617,0.00065284,0.00053927395,0.00015489983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005753842,0.00041054885,0.00050035625,0.000768494,0.00030040785,0.00023127525,0.0021233815,0.00011382797,0.0000094563675],"category_scores_gemma":[0.00007796507,0.00035619535,0.00008231951,0.00078139256,0.0007003952,0.00021236265,0.0006708376,0.0008173082,0.000026116262],"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.0000030518863,0.000024470022,0.00014403391,0.00001800928,0.000009607713,0.000011406657,0.00025070657,0.7699527,0.00000923286,0.022704853,0.00000851427,0.2068634],"study_design_scores_gemma":[0.0002479604,0.00029076028,0.00080857426,0.0002958164,0.0000087093795,0.00004298331,1.4623059e-7,0.82442105,0.00020217388,0.17140324,0.001793116,0.00048547116],"about_ca_topic_score_codex":0.00019917032,"about_ca_topic_score_gemma":0.000077667886,"teacher_disagreement_score":0.29632488,"about_ca_system_score_codex":0.00015296656,"about_ca_system_score_gemma":0.00038065537,"threshold_uncertainty_score":0.999889},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004952216,0.0011530198,0.99316365,0.0001897834,0.000116410076,0.00011130923,0.000015991383,0.0002193658,0.000078271114],"genre_scores_gemma":[0.5636868,0.000061762614,0.43488953,0.00027421245,0.00015237233,0.000011982464,0.0005933037,0.000022112526,0.00030794402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742407,0.0002322406,0.00040886845,0.0007820076,0.0005226689,0.0006301199],"domain_scores_gemma":[0.9972033,0.00020406513,0.0002354489,0.00199651,0.00010142012,0.00025927005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014091501,0.00028048057,0.00040548484,0.00043740627,0.0003139083,0.0003594565,0.002087391,0.00005865419,0.00018866525],"category_scores_gemma":[0.00020211564,0.00022184382,0.0001616809,0.0019072137,0.000038167927,0.00088605005,0.00076091365,0.00042286608,0.00017225492],"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.000011161386,0.00036014608,0.19552204,0.00008470255,0.0014295515,0.000013653725,0.00088093395,0.10795438,0.00046766514,0.00024802174,0.00005622527,0.6929715],"study_design_scores_gemma":[0.00017922527,0.000044537526,0.0015659146,0.000033119464,0.000546333,0.0000021256494,0.00012295869,0.9866652,0.0005803239,0.0000020864768,0.00993103,0.00032717176],"about_ca_topic_score_codex":0.00094787654,"about_ca_topic_score_gemma":0.00009833801,"teacher_disagreement_score":0.8787108,"about_ca_system_score_codex":0.000055102715,"about_ca_system_score_gemma":0.000058840735,"threshold_uncertainty_score":0.90465283},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9760986,0.000015583752,0.0016398121,0.0055125845,0.0064236303,0.00020682561,0.000008563247,0.00006959855,0.010024805],"genre_scores_gemma":[0.9978262,0.000021441572,0.0013343212,0.00004388285,0.00027082214,0.000011541844,0.000004232332,0.000009111307,0.00047844986],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99829084,0.000019118972,0.00032096257,0.0002984288,0.0009094714,0.00016117089],"domain_scores_gemma":[0.99828684,0.000072561765,0.00022373229,0.0001838991,0.0011865345,0.000046438523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005514899,0.00011364639,0.00014654182,0.00007573946,0.00011683143,0.00009545481,0.0012727729,0.000065741784,0.000014321764],"category_scores_gemma":[0.0001521203,0.00008972337,0.000100794,0.00040771862,0.000053181622,0.0003573761,0.00047703803,0.000283169,0.000004669344],"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.000121442514,0.00055407017,0.023032626,0.00013891584,0.000104096354,5.070962e-7,0.0007153506,0.00044021406,0.76441836,0.20089677,0.000429811,0.009147805],"study_design_scores_gemma":[0.0007895667,0.000313,0.010471487,0.000114452196,0.000007925905,0.000013896317,0.00002038673,0.25669205,0.7269034,0.0036824774,0.00089233933,0.00009904558],"about_ca_topic_score_codex":0.00006099292,"about_ca_topic_score_gemma":3.127936e-7,"teacher_disagreement_score":0.25625184,"about_ca_system_score_codex":0.000104602084,"about_ca_system_score_gemma":0.00008666031,"threshold_uncertainty_score":0.3658813},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035951275,0.000067439934,0.87902707,0.00042755884,0.00015781718,0.00006543923,2.2343164e-7,0.0004564426,0.08384671],"genre_scores_gemma":[0.89735377,5.7480065e-7,0.0570341,0.000036663478,0.00012886277,0.0000048129023,0.0000010838997,0.000006558323,0.045433577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927527,0.000037352558,0.000104458115,0.00022378667,0.00018274362,0.00017637221],"domain_scores_gemma":[0.99954575,0.0000320278,0.00004792132,0.0003118244,0.000032770793,0.000029695233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016314643,0.000064361215,0.00007403014,0.000038378723,0.00007827759,0.0002627569,0.00029307927,0.000011107984,0.0000065089985],"category_scores_gemma":[0.000005094665,0.000043045653,0.000014908035,0.00017842063,0.000010956696,0.00017221602,0.00008364444,0.000076386095,0.00005620011],"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.00001378656,0.00024610898,0.20121609,0.00013801391,0.0000844428,0.0006417924,0.001015777,0.10734837,0.000859337,0.42297196,0.034903366,0.23056096],"study_design_scores_gemma":[0.00026046316,0.000049659582,0.009665179,0.0000240636,0.0000019376137,0.000072489485,0.000022624012,0.97719604,0.00029370247,0.0010878646,0.011130746,0.00019524715],"about_ca_topic_score_codex":0.0026418832,"about_ca_topic_score_gemma":0.00001635545,"teacher_disagreement_score":0.86984766,"about_ca_system_score_codex":0.000006909347,"about_ca_system_score_gemma":0.000014283759,"threshold_uncertainty_score":0.3993755},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2660221,0.0005641021,0.6767638,0.029390316,0.00085618295,0.0005074887,0.000011835288,0.002324372,0.02355985],"genre_scores_gemma":[0.7578004,0.00003084594,0.22524638,0.0024860122,0.00030258347,0.000013080235,0.000008440843,0.000022844937,0.014089386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986612,0.000072274146,0.00022076114,0.00047705785,0.0002266317,0.0003420685],"domain_scores_gemma":[0.99919045,0.00007366582,0.00003765595,0.0004521555,0.000047691727,0.00019836907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024873647,0.00020524797,0.00020033956,0.000096040625,0.00015865224,0.00020763603,0.0005644874,0.00006741639,0.00037117844],"category_scores_gemma":[0.000038882103,0.00016219735,0.000060861716,0.0002222795,0.00003989677,0.00042560333,0.00026182743,0.00020801103,0.00023102916],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010791776,0.00034792913,0.016421191,0.000054219727,0.000054291526,0.000045591845,0.00256938,0.00075403287,0.0046992465,0.011935077,0.006201328,0.9569069],"study_design_scores_gemma":[0.000926499,0.00007124999,0.008474882,0.000006480078,0.000004662936,0.00004211555,0.0000144376545,0.953925,0.00061341,0.000048811526,0.03561622,0.00025623885],"about_ca_topic_score_codex":0.000111720394,"about_ca_topic_score_gemma":0.000042615764,"teacher_disagreement_score":0.9566507,"about_ca_system_score_codex":0.000017671782,"about_ca_system_score_gemma":0.000040458097,"threshold_uncertainty_score":0.6614216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059087406,0.00068352604,0.98517644,0.00061960926,0.0007879875,0.00037299437,0.000007240734,0.00028141917,0.011479879],"genre_scores_gemma":[0.4182827,0.00037324618,0.576419,0.00061177346,0.0004036574,0.00001864302,0.000022967559,0.00008041197,0.0037875783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968458,0.00006869133,0.0006168789,0.0012910864,0.00070459733,0.0004729444],"domain_scores_gemma":[0.99803185,0.00024007233,0.00033505756,0.001084696,0.00014131589,0.00016698288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010001162,0.00042755084,0.0005383577,0.0005832381,0.00029891945,0.0003128031,0.0014582996,0.00029481866,0.000037107948],"category_scores_gemma":[0.000039171187,0.00038778273,0.00010940436,0.00061167596,0.0006374056,0.00039730643,0.00067744486,0.000992498,0.00002462782],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055356445,0.000105645246,0.00018634404,0.00014841167,0.000052950287,0.00003771471,0.0027900077,0.0377717,0.00006491335,0.025578957,0.000017657447,0.9332402],"study_design_scores_gemma":[0.00036281522,0.00026542778,0.000375212,0.0002838695,0.000017139106,0.00013729674,1.918771e-7,0.75817084,0.00013504799,0.23612143,0.003586339,0.0005443537],"about_ca_topic_score_codex":0.00006988661,"about_ca_topic_score_gemma":0.000020646043,"teacher_disagreement_score":0.9326958,"about_ca_system_score_codex":0.00010307656,"about_ca_system_score_gemma":0.00031971262,"threshold_uncertainty_score":0.9998574},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6193299,0.0009176049,0.33608592,0.036050655,0.0034140937,0.00073198695,0.0011944529,0.0014280702,0.000847299],"genre_scores_gemma":[0.58176106,0.000058556063,0.41495058,0.0010851087,0.00023489838,0.000043040734,0.001502678,0.00004657627,0.00031749837],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99775195,0.00011206113,0.00044037018,0.0007829189,0.00039432518,0.00051837374],"domain_scores_gemma":[0.9976895,0.00010110611,0.00028455033,0.0016205767,0.00019429467,0.00010996355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005562633,0.00027496897,0.00038436247,0.00046945395,0.00064013235,0.00014196518,0.0022950056,0.00020338333,0.000027855605],"category_scores_gemma":[0.0012940554,0.0002285999,0.00006371037,0.0026579385,0.00026612057,0.0008014884,0.002152268,0.0009913555,0.00007408447],"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.00007447581,0.0007139107,0.001397022,0.00014886732,0.000655351,0.0013204098,0.001758917,0.051330954,0.12952814,0.14113806,0.033791956,0.63814193],"study_design_scores_gemma":[0.001421086,0.0002241622,0.00013291462,0.00024362376,0.00006928739,0.0003410819,0.0005119235,0.17246442,0.06912727,0.0019666941,0.7528372,0.0006603493],"about_ca_topic_score_codex":0.000148314,"about_ca_topic_score_gemma":0.000049737744,"teacher_disagreement_score":0.7190452,"about_ca_system_score_codex":0.000061254934,"about_ca_system_score_gemma":0.00028452658,"threshold_uncertainty_score":0.93220335},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7809493,0.0000045232136,0.21055786,0.006288461,0.00023191186,0.0003155147,0.0000058520673,0.0006460947,0.0010004756],"genre_scores_gemma":[0.9567554,0.0000021877902,0.042417824,0.0004629464,0.00008942999,0.0000030961153,0.000004511588,0.000015710008,0.00024892017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973863,0.00030712507,0.00026540438,0.00084455387,0.0004006429,0.00079601805],"domain_scores_gemma":[0.9985366,0.00037005858,0.00013131354,0.00058188126,0.00012795097,0.00025218548],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010353553,0.00030152436,0.00035584587,0.00077908026,0.0006864925,0.00027621022,0.0021530357,0.00034479148,0.00006319025],"category_scores_gemma":[0.001013929,0.00025805307,0.00011219391,0.003007722,0.00016458091,0.0006454007,0.0015638976,0.0024847363,0.00006944108],"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.00038567724,0.0004093532,0.0027009798,0.00002668546,0.00011230803,0.0012223116,0.022500155,0.08855725,0.030993147,0.088159755,0.00020138909,0.764731],"study_design_scores_gemma":[0.0016502292,0.0007747879,0.0028980447,0.00008522245,0.000020259597,0.0001565223,0.006676255,0.9290894,0.0022600442,0.00089498097,0.054569572,0.0009246567],"about_ca_topic_score_codex":0.00021549356,"about_ca_topic_score_gemma":0.00050886493,"teacher_disagreement_score":0.8405322,"about_ca_system_score_codex":0.0001492267,"about_ca_system_score_gemma":0.00015829294,"threshold_uncertainty_score":0.9999872},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21871589,0.000107052314,0.6201568,0.008602456,0.00034490143,0.00020855905,1.5412851e-7,0.00050056365,0.1513636],"genre_scores_gemma":[0.98471254,0.0000102142485,0.012070156,0.0003897227,0.000094998526,0.0000051289826,6.0024934e-7,0.0000029936539,0.0027136372],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930036,0.000088887595,0.00007223062,0.00017614663,0.00020704276,0.00015531795],"domain_scores_gemma":[0.99964833,0.000091218855,0.00002749327,0.0001996011,0.000012008077,0.000021361913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019631775,0.00006708474,0.000068596244,0.000032366337,0.0001648702,0.000048953323,0.0005144043,0.000017188588,0.000010515093],"category_scores_gemma":[0.000027140137,0.00003471528,0.000019529783,0.00030086446,0.000036985766,0.00016080451,0.000052374115,0.0002786198,0.000031571115],"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.00006387309,0.00039017262,0.44082448,0.000018701146,0.000039144557,0.0011786916,0.045564763,0.050605405,0.000034200286,0.07984793,0.008990409,0.37244225],"study_design_scores_gemma":[0.0018764613,0.0007713323,0.38043645,0.000027719825,0.000004557461,0.00044057381,0.0005206757,0.48950857,0.00006392246,0.00047886724,0.12539294,0.0004779212],"about_ca_topic_score_codex":0.00018975767,"about_ca_topic_score_gemma":0.000029340852,"teacher_disagreement_score":0.76599663,"about_ca_system_score_codex":0.0000076213605,"about_ca_system_score_gemma":0.000031531046,"threshold_uncertainty_score":0.1415648},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015638444,0.0002331334,0.9894223,0.0011925031,0.0014660713,0.00044916137,0.0000010392965,0.00040554506,0.006673818],"genre_scores_gemma":[0.0848318,0.000044800654,0.9107702,0.00079255947,0.0009497148,0.000018670826,0.0000065095805,0.00006227716,0.0025234625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956036,0.00013913319,0.00052391714,0.0017330436,0.0012299607,0.0007703212],"domain_scores_gemma":[0.99626654,0.0014896845,0.00044724514,0.00127959,0.00028344023,0.00023349859],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025159877,0.0006812806,0.0010966075,0.00075958425,0.0005377264,0.0008967719,0.0031874166,0.00041790362,0.00004673353],"category_scores_gemma":[0.0004231356,0.00049767917,0.00021088307,0.0005719791,0.0015010197,0.00049728755,0.0011001292,0.0036121309,0.00006320978],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033244153,0.000033715198,0.00014122526,0.000048591453,0.00003613338,0.00020238958,0.0012790945,0.03750395,0.000111704,0.025487894,0.0000037947884,0.93481904],"study_design_scores_gemma":[0.011544774,0.0003191749,0.000044601773,0.00038901495,0.000022862134,0.00021811902,1.4128321e-7,0.8724664,0.00077973993,0.10991143,0.0032075893,0.0010961819],"about_ca_topic_score_codex":0.00009492955,"about_ca_topic_score_gemma":0.00008049927,"teacher_disagreement_score":0.9337229,"about_ca_system_score_codex":0.00009810515,"about_ca_system_score_gemma":0.0005049471,"threshold_uncertainty_score":0.99974746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006832919,0.00020456,0.9900848,0.0010899733,0.00009392433,0.00073206093,0.000005599379,0.00031237456,0.00064376806],"genre_scores_gemma":[0.6254782,0.00000415494,0.37094456,0.00016172208,0.00007104559,0.00010261802,0.0000036254894,0.000011320077,0.0032227389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988633,0.000074765936,0.00020464978,0.00040897392,0.00013744202,0.00031087952],"domain_scores_gemma":[0.9992688,0.00017243225,0.00006156897,0.00032330293,0.000109252884,0.00006467683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039749788,0.00017077745,0.00014000956,0.000039914696,0.0003457686,0.00035190172,0.00043134333,0.000056439043,0.000009858732],"category_scores_gemma":[0.00003700484,0.00009903541,0.000046128007,0.00020843055,0.00006078386,0.0003020492,0.00009992921,0.00017552264,0.000010231815],"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.000060215116,0.0025123178,0.03228165,0.00034144268,0.00026230662,0.000035303183,0.003418555,0.022126473,0.011742316,0.30849838,0.0067338003,0.61198723],"study_design_scores_gemma":[0.0012637416,0.000120028184,0.011900356,0.000007618796,0.0000075672306,0.000011353742,0.000049018166,0.9841187,0.0004479582,0.0008096792,0.0010841283,0.00017985639],"about_ca_topic_score_codex":0.00049201516,"about_ca_topic_score_gemma":0.0001489058,"teacher_disagreement_score":0.9619922,"about_ca_system_score_codex":0.000012461575,"about_ca_system_score_gemma":0.000053770378,"threshold_uncertainty_score":0.40385467},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042064705,0.00010796663,0.97674966,0.0010528585,0.0016679455,0.00046254817,0.0000071548147,0.00034445504,0.019565372],"genre_scores_gemma":[0.020121194,0.0000056741974,0.97365725,0.0029282318,0.0006353715,0.000017211927,0.0000059247254,0.000050995557,0.0025781651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950219,0.000035258618,0.00050678826,0.0022403563,0.0012373178,0.0009583849],"domain_scores_gemma":[0.9968556,0.00020201743,0.00023103005,0.002032118,0.00025640926,0.00042281646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001068547,0.0006947024,0.00071331323,0.00094187935,0.00036374753,0.0008988165,0.005318376,0.00048801219,0.000011589301],"category_scores_gemma":[0.0001323132,0.00061652693,0.00017739173,0.00066635985,0.00043128277,0.00039480743,0.0021068766,0.0021503714,0.000114200666],"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.0000031543213,0.00004174446,0.000009487925,0.000020859554,0.000006288636,0.000035135632,0.0010102942,0.3724018,0.00014417626,0.011387986,0.000039500304,0.6148996],"study_design_scores_gemma":[0.00019003284,0.0001100514,0.00001819946,0.0001101483,0.000004977923,0.000106191175,7.025015e-8,0.93104887,0.00022891854,0.06511028,0.0023540503,0.00071823766],"about_ca_topic_score_codex":0.000031236523,"about_ca_topic_score_gemma":0.00001990105,"teacher_disagreement_score":0.61418134,"about_ca_system_score_codex":0.00013901383,"about_ca_system_score_gemma":0.0005342826,"threshold_uncertainty_score":0.9996286},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15935239,0.000019892259,0.83726627,0.00007450837,0.00021514556,0.000112487425,5.7670326e-7,0.00021812116,0.0027405971],"genre_scores_gemma":[0.9905661,0.000006699609,0.0055752518,0.00005187254,0.00011800221,8.9406177e-7,0.0000025362037,0.000009918468,0.003668777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913734,0.00007632101,0.00006971513,0.00029911823,0.000043814365,0.0003737075],"domain_scores_gemma":[0.99938893,0.0001329333,0.00008309783,0.00022276292,0.000044747532,0.00012751501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026062352,0.00011189418,0.00010967658,0.00008784982,0.00028799835,0.00004879945,0.0004487092,0.000048726546,0.000014177098],"category_scores_gemma":[0.000033924993,0.00011765229,0.00007994564,0.00031652063,0.000023124978,0.0008012092,0.000168733,0.00022560084,0.00007045537],"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.0000276612,0.00016853258,0.017515974,0.000057115994,0.000077002915,0.000016115537,0.004415629,0.33451965,0.00045794994,0.6082154,0.00019711175,0.034331832],"study_design_scores_gemma":[0.0007705946,0.00012722322,0.0041387514,0.000028832445,0.000022785796,0.0000104476485,0.00033354157,0.9612845,0.0003507653,0.015779002,0.016762827,0.0003906831],"about_ca_topic_score_codex":0.000049542792,"about_ca_topic_score_gemma":0.000002413132,"teacher_disagreement_score":0.831691,"about_ca_system_score_codex":0.000047819995,"about_ca_system_score_gemma":0.00002042272,"threshold_uncertainty_score":0.47977212},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04102968,0.000020039608,0.9493563,0.0004710047,0.00006011072,0.00015782462,4.1964634e-7,0.000211242,0.008693352],"genre_scores_gemma":[0.48410138,1.2762162e-7,0.5153854,0.0001317064,0.000025749714,0.0000019655345,5.732517e-7,0.0000036963086,0.00034942006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988973,0.00022865695,0.00019126612,0.00020976433,0.000281698,0.00019130981],"domain_scores_gemma":[0.99921954,0.000325989,0.00010077062,0.00018829091,0.000107313674,0.000058093792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005497148,0.00009030686,0.000113717484,0.000067278255,0.00026698632,0.00010232579,0.0004681741,0.000016955062,0.00007571455],"category_scores_gemma":[0.00019509874,0.000061698025,0.00004130631,0.00064320234,0.00007723963,0.00010300344,0.00023109445,0.00017977407,0.000028134249],"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.0000014626995,0.00012459377,0.011108006,0.000010254021,0.000025968402,0.0000027167455,0.001091005,0.41376504,0.00009948232,0.031483058,0.00008709333,0.5422013],"study_design_scores_gemma":[0.00009163334,0.00008757494,0.007182465,0.000015889435,0.0000038322028,0.000011668504,0.00004474155,0.9879308,0.00002574589,0.004160707,0.00036400673,0.000080949314],"about_ca_topic_score_codex":0.00007783917,"about_ca_topic_score_gemma":0.0000012623296,"teacher_disagreement_score":0.57416576,"about_ca_system_score_codex":0.000015587406,"about_ca_system_score_gemma":0.000012677001,"threshold_uncertainty_score":0.25159723},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16637877,0.000023584025,0.8006171,0.007211635,0.00036596676,0.00021451384,0.000011526198,0.000175422,0.025001483],"genre_scores_gemma":[0.99378324,0.0000049473415,0.0053089107,0.00013638516,0.00012352374,0.000012460278,0.00001371266,0.000005734155,0.0006110612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980892,0.00013460162,0.0003233088,0.000397078,0.0007913481,0.0002644882],"domain_scores_gemma":[0.99917495,0.00019600664,0.00006989841,0.00014379808,0.00036678274,0.000048577294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066881865,0.00012905538,0.00011592309,0.00031218232,0.00012263701,0.00035367155,0.00038082685,0.000048836646,0.00010343899],"category_scores_gemma":[0.00013593133,0.0001264323,0.000033823326,0.00057603576,0.000069470545,0.0003153152,0.00006371716,0.00030459405,0.00044695206],"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.000010324536,0.00010344638,0.00024179168,0.0000030459369,0.0000015940748,0.000012590587,0.00034342555,0.05437947,0.0006979308,0.8347312,0.000045039837,0.10943014],"study_design_scores_gemma":[0.000025446969,0.00006668628,0.005198099,0.00001792282,4.0615322e-7,0.0000036454378,0.00006446303,0.69825506,0.0075338613,0.28856254,0.0001302312,0.00014163063],"about_ca_topic_score_codex":0.0005652992,"about_ca_topic_score_gemma":0.00032574678,"teacher_disagreement_score":0.8274045,"about_ca_system_score_codex":0.00008657825,"about_ca_system_score_gemma":0.00023413765,"threshold_uncertainty_score":0.57448137},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024730375,0.0030529704,0.8761466,0.039244596,0.0015325513,0.0026018135,0.000019082048,0.0011027041,0.05156928],"genre_scores_gemma":[0.6289437,0.0017591293,0.28716204,0.0003259522,0.0010733325,0.00074084755,0.000031176955,0.00005937857,0.07990448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969509,0.0003896974,0.0003081082,0.0005226944,0.0010464282,0.000782118],"domain_scores_gemma":[0.99777037,0.00037676236,0.00001815178,0.0010312705,0.0006216679,0.00018177039],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022085584,0.00015325917,0.00013929774,0.00017827642,0.0047208797,0.0007037105,0.0017481521,0.00006914998,0.000040764553],"category_scores_gemma":[0.00023859016,0.00010373788,0.00006197465,0.0013361188,0.00031810894,0.00053490215,0.00051318936,0.000897422,0.0007404358],"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.000014275087,0.0009097564,0.0024091308,0.000022443555,0.00016190985,0.00049710943,0.007332047,0.050072588,0.0018928854,0.28691503,0.17146856,0.47830427],"study_design_scores_gemma":[0.0002304185,0.00017405977,0.00097054336,0.000013135798,0.0000014277639,0.0001548949,0.00006685185,0.8845069,0.0002465098,0.00091982377,0.1125436,0.00017185695],"about_ca_topic_score_codex":0.0010392474,"about_ca_topic_score_gemma":0.00008099283,"teacher_disagreement_score":0.8344343,"about_ca_system_score_codex":0.00008007041,"about_ca_system_score_gemma":0.0005496467,"threshold_uncertainty_score":0.9965748},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13308328,0.00042418655,0.7297528,0.008271877,0.001297422,0.0018876753,0.000115618604,0.0010349604,0.124132164],"genre_scores_gemma":[0.02055983,0.00017598471,0.5134417,0.000028348233,0.0004770259,0.0000029726639,0.000818574,0.00006901898,0.46442655],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972912,0.00023503597,0.000080786616,0.0006475139,0.00124669,0.00049875746],"domain_scores_gemma":[0.9984859,0.000057533452,0.00015682781,0.0004160268,0.0007033291,0.00018037784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057195715,0.00021287182,0.00030005025,0.00079615053,0.00062700175,0.000113203576,0.0013727398,0.00020195865,0.00006791915],"category_scores_gemma":[0.000030040439,0.0002255779,0.00011757643,0.0011688257,0.00010787045,0.00038113544,0.000134884,0.0014831263,0.00005438531],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006486695,0.00059376174,0.002343874,0.00084233447,0.00056348083,0.0016359632,0.004946965,0.0020019258,0.0010356867,0.049436286,0.050764102,0.88577074],"study_design_scores_gemma":[0.0061596083,0.0048946165,0.07228672,0.0013611646,0.00015041149,0.00044029,0.0035663524,0.44825175,0.0058366447,0.004889564,0.44959298,0.0025699192],"about_ca_topic_score_codex":0.00079016195,"about_ca_topic_score_gemma":0.001068741,"teacher_disagreement_score":0.8832008,"about_ca_system_score_codex":0.00021799999,"about_ca_system_score_gemma":0.000761659,"threshold_uncertainty_score":0.91988},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000930688,0.00015482816,0.99663603,0.000686057,0.0008924152,0.00037644396,0.000021766804,0.00006903017,0.001070346],"genre_scores_gemma":[0.112753265,0.000007291884,0.8866325,0.00018304268,0.00021016008,0.000011715349,0.00002058082,0.000019660582,0.00016180411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974847,0.000016467404,0.00053302525,0.00092720304,0.0005505053,0.0004881204],"domain_scores_gemma":[0.99833727,0.00051910005,0.00027224125,0.0005908408,0.00013966173,0.00014088635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006025425,0.00034180962,0.00047508322,0.00070928375,0.00015021267,0.00014924939,0.0017411648,0.00018973685,0.000006578455],"category_scores_gemma":[0.00013841914,0.0003318793,0.00013043113,0.00069259974,0.00026742212,0.0003299089,0.00037982065,0.00057262264,0.000004601443],"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.0000038024898,0.000016919119,0.000051352323,0.000043012733,0.0000056440726,0.00001571765,0.0016797973,0.18737692,0.000053467782,0.075472414,0.000017491737,0.73526347],"study_design_scores_gemma":[0.0004777075,0.00017057528,0.00082255737,0.00059048116,0.000004481849,0.00001835464,7.921766e-7,0.67697257,0.00012871798,0.32005706,0.00039375783,0.00036293684],"about_ca_topic_score_codex":0.00013660711,"about_ca_topic_score_gemma":0.000046743353,"teacher_disagreement_score":0.73490053,"about_ca_system_score_codex":0.00023066242,"about_ca_system_score_gemma":0.0018529424,"threshold_uncertainty_score":0.99991333},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021071619,0.0024191753,0.29440296,0.00065319834,0.0031876415,0.0002484118,0.0000047348117,0.0014920885,0.6973811],"genre_scores_gemma":[0.038899053,0.0003300316,0.032795586,0.00072931265,0.0033673362,0.000014242945,0.00013720422,0.00028017996,0.9234471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964893,0.00012539343,0.00069474214,0.0013973584,0.0006447095,0.000648509],"domain_scores_gemma":[0.9969648,0.0003812252,0.00050960144,0.0017979544,0.00016142351,0.00018496718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093116704,0.00080878526,0.000894193,0.00048312903,0.0006716556,0.00058271893,0.0027386844,0.00045966668,0.000084926345],"category_scores_gemma":[0.00006712474,0.0007137033,0.00051481545,0.00016031461,0.000097007454,0.00020732998,0.0015331204,0.001346232,0.0007760284],"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.0000032637952,0.000021559976,0.0012870018,0.00011751783,0.0001746472,0.000107582506,0.0006478669,0.0001166995,0.00010523403,0.70069224,0.0076668593,0.28905955],"study_design_scores_gemma":[0.00048638656,0.00012675978,0.0007712216,0.0006716925,0.000113422284,0.0005369239,0.0000013579005,0.1566089,0.000054112923,0.22356287,0.6152471,0.0018193132],"about_ca_topic_score_codex":0.0004906018,"about_ca_topic_score_gemma":0.00004729481,"teacher_disagreement_score":0.6075802,"about_ca_system_score_codex":0.00003676466,"about_ca_system_score_gemma":0.000057520418,"threshold_uncertainty_score":0.9995314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020104904,0.000014676169,0.94363326,0.0003595082,0.00079360406,0.00013264715,0.0000026736116,0.00018538434,0.03477332],"genre_scores_gemma":[0.91750276,0.000001570574,0.07801178,0.000024879351,0.000086323445,0.000021610762,0.0000021036647,0.0000046266227,0.004344344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992761,0.000042275242,0.00017110717,0.00020037909,0.00017641803,0.00013370982],"domain_scores_gemma":[0.99923813,0.00007101851,0.00008112322,0.00046069166,0.00009250576,0.00005650866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002491996,0.000059758804,0.00010231667,0.000038502436,0.000066447516,0.000075123775,0.00042696792,0.00003331966,0.00003502291],"category_scores_gemma":[0.000067561166,0.000047746773,0.000032567677,0.00019252366,0.000031144526,0.00024004141,0.00011238514,0.0001500025,0.00002633494],"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.000007796496,0.00023115349,0.029230077,0.000080560894,0.000063710104,0.000010053071,0.0017727598,0.036726125,0.017252512,0.9018015,0.0035633969,0.009260309],"study_design_scores_gemma":[0.00012128016,0.000042562515,0.0049805418,0.000006085793,0.0000031255006,0.00000776784,0.000042184525,0.99007064,0.0022850754,0.000934152,0.0014439451,0.00006264761],"about_ca_topic_score_codex":0.0003937285,"about_ca_topic_score_gemma":0.0000144043415,"teacher_disagreement_score":0.9533445,"about_ca_system_score_codex":0.0000027278077,"about_ca_system_score_gemma":0.000039059923,"threshold_uncertainty_score":0.19470568},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015926144,0.0008383202,0.9885001,0.0014782147,0.0018348017,0.00030727094,0.0000015822186,0.00022367845,0.006656735],"genre_scores_gemma":[0.20634732,0.00009043773,0.7810465,0.002445536,0.004765474,0.000025685558,0.000011088917,0.000101904,0.005166045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995623,0.000059405862,0.0004676562,0.0017739055,0.0011982684,0.0008777981],"domain_scores_gemma":[0.9978118,0.00034483292,0.00031585127,0.0011270009,0.00016372633,0.00023677995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011337064,0.0005958586,0.00052706175,0.00097380497,0.0004102289,0.0006124629,0.0031387855,0.0003163493,0.00008095171],"category_scores_gemma":[0.000106304906,0.00054189545,0.00016475735,0.00064394576,0.00043403145,0.0003400626,0.0015250659,0.0018032829,0.0002894986],"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.0000012974805,0.000019037332,0.000037916834,0.000012066947,0.0000043586283,0.0000639035,0.0010670321,0.13030726,0.000013083039,0.003271518,0.0000043997848,0.86519814],"study_design_scores_gemma":[0.00020127864,0.00015730137,0.00014017569,0.000282169,0.0000052884457,0.00008614788,1.177121e-7,0.9731951,0.00016231267,0.0035600692,0.02154741,0.0006626455],"about_ca_topic_score_codex":0.00003023319,"about_ca_topic_score_gemma":0.000016934471,"teacher_disagreement_score":0.8645355,"about_ca_system_score_codex":0.000263336,"about_ca_system_score_gemma":0.00026636885,"threshold_uncertainty_score":0.9997032},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026635768,0.00009332748,0.9227694,0.010325497,0.0002039542,0.000043975917,1.8601473e-7,0.00097199506,0.038955893],"genre_scores_gemma":[0.89373475,0.00000838688,0.091120645,0.0016229156,0.000118498865,3.9091185e-7,0.0000027985539,0.000002617108,0.013388996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994206,0.00003475174,0.0000821835,0.00018042845,0.00012427942,0.00015778533],"domain_scores_gemma":[0.99964154,0.000056263812,0.000023805904,0.00019600209,0.000021761769,0.000060604743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009046992,0.00006578705,0.00006873995,0.000044641485,0.00007548991,0.00007050457,0.00037447727,0.000021596834,0.00006010278],"category_scores_gemma":[0.00010999435,0.000052086893,0.00003005803,0.00018581106,0.0000067611595,0.00011476873,0.00004606944,0.00019137956,0.00019384586],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.939118e-7,0.00009514412,0.0008192226,0.0000011986408,0.0000025204279,0.000023487573,0.00015234586,0.0026973472,0.00013971704,0.034704044,0.0019385425,0.95942575],"study_design_scores_gemma":[0.00027615606,0.00043408107,0.055785324,0.000010898788,0.0000023177245,0.00003604942,0.0000116453175,0.877015,0.00018753107,0.005170465,0.060846224,0.00022429934],"about_ca_topic_score_codex":0.000015678152,"about_ca_topic_score_gemma":0.0000010522585,"teacher_disagreement_score":0.95920146,"about_ca_system_score_codex":0.0000056556005,"about_ca_system_score_gemma":0.000010833907,"threshold_uncertainty_score":0.2491561},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075949625,0.00032708238,0.9866129,0.00077283906,0.0013399386,0.0003311028,0.000002732919,0.0002888372,0.010248592],"genre_scores_gemma":[0.035716973,0.00004805887,0.9580792,0.0018246343,0.00077908504,0.00002101132,0.0000073069873,0.000070104135,0.0034536188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626285,0.00005322686,0.00037780782,0.0016068361,0.0009286047,0.00077066425],"domain_scores_gemma":[0.9975592,0.00024444328,0.00033664383,0.0014304359,0.00021690823,0.00021238276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006900195,0.0006274856,0.0005998348,0.00066378224,0.00036350783,0.0006506639,0.0032290872,0.00025827636,0.000049172777],"category_scores_gemma":[0.000051858166,0.00048868865,0.00011118004,0.0005392026,0.0008023228,0.0005517154,0.0010996611,0.0010234861,0.0000550602],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014634974,0.000026428412,0.0001544848,0.000035936715,0.000022054219,0.0002593527,0.0015753403,0.011855546,0.00005128251,0.038554598,0.0000562224,0.94739413],"study_design_scores_gemma":[0.0010059233,0.0007140964,0.00026959946,0.0010019784,0.000024529489,0.000482602,3.1238622e-7,0.83780676,0.0018198037,0.12260217,0.03208912,0.0021830788],"about_ca_topic_score_codex":0.00009707312,"about_ca_topic_score_gemma":0.00010314567,"teacher_disagreement_score":0.94521105,"about_ca_system_score_codex":0.00014393484,"about_ca_system_score_gemma":0.00052266306,"threshold_uncertainty_score":0.99975646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012378562,0.00012587493,0.7810685,0.0019032228,0.00029359022,0.00006133834,1.4936654e-7,0.0006708038,0.20349793],"genre_scores_gemma":[0.9412461,0.000012408443,0.014892123,0.00045374304,0.000062639905,0.000003297221,6.605507e-7,0.0000063578345,0.043322697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907124,0.0000852278,0.00010623685,0.00027186683,0.00024174342,0.00022370637],"domain_scores_gemma":[0.9993836,0.00022010038,0.000041252402,0.00025376916,0.000020218737,0.00008103806],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016069923,0.00009501268,0.00010651944,0.00017725829,0.00014660605,0.00013210719,0.00042934815,0.00003050103,0.0012334575],"category_scores_gemma":[0.0002219716,0.00007213878,0.000050683888,0.000739196,0.00001951594,0.0001312801,0.00009950222,0.00027087604,0.0014194387],"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.000002601317,0.00012181741,0.0015006008,0.0000063462758,0.000016500428,0.000036850797,0.00072288077,0.005321443,0.00006260321,0.17308511,0.013647767,0.8054755],"study_design_scores_gemma":[0.0005370003,0.0002678246,0.0011737884,0.000009561303,0.000001652648,0.00001038388,0.000015663902,0.9613732,0.00017182024,0.00080366875,0.035424437,0.00021096485],"about_ca_topic_score_codex":0.00002153118,"about_ca_topic_score_gemma":3.0221892e-7,"teacher_disagreement_score":0.95605177,"about_ca_system_score_codex":0.000012504831,"about_ca_system_score_gemma":0.0000031428128,"threshold_uncertainty_score":0.99967957},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007351845,0.000031824922,0.9868674,0.0039465744,0.0007201189,0.00016477978,0.000009145319,0.00039163767,0.0071333153],"genre_scores_gemma":[0.1637632,0.000011869205,0.8110051,0.00058750773,0.0005693449,0.00004632817,0.0000909978,0.00003157275,0.023894044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820787,0.0001180803,0.00027343055,0.000531718,0.0005652516,0.00030363337],"domain_scores_gemma":[0.99891114,0.00006488723,0.00018982356,0.0001910877,0.0003999311,0.00024310066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050398736,0.00023399472,0.00020774303,0.00021565963,0.00016382021,0.00036152886,0.0008303205,0.000082237944,0.000083330575],"category_scores_gemma":[0.00024571802,0.00021760279,0.00010840238,0.00018525455,0.00001498269,0.00037270208,0.00015261189,0.00051363406,0.00007543872],"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.000055283825,0.0000674566,0.00048367566,0.0000043123478,0.000057017896,0.0000061320497,0.0007213937,0.19178021,0.00037192632,0.2314277,0.0025630945,0.5724618],"study_design_scores_gemma":[0.0013774137,0.00029672455,0.000037612466,0.000024750643,0.000005825107,0.000020614743,0.000019253735,0.9677219,0.00011514176,0.01713383,0.0129971765,0.00024976613],"about_ca_topic_score_codex":0.00036168037,"about_ca_topic_score_gemma":0.000015215367,"teacher_disagreement_score":0.77594167,"about_ca_system_score_codex":0.00011177992,"about_ca_system_score_gemma":0.00033191286,"threshold_uncertainty_score":0.8873584},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0756402,0.00021737968,0.632714,0.05790695,0.0012591113,0.00313128,0.00012963696,0.0011092379,0.22789223],"genre_scores_gemma":[0.2858123,0.00042179786,0.7016532,0.008890871,0.00010230094,0.000109307366,0.00013134287,0.00003242212,0.0028464976],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987881,0.000031855416,0.0004219529,0.00020482395,0.00025275175,0.000300525],"domain_scores_gemma":[0.9991613,0.00003458619,0.00016110163,0.00044468037,0.000042408523,0.00015594266],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005465134,0.00013813472,0.00017883755,0.000070004426,0.00023508101,0.0010726164,0.0009904748,0.000024685367,0.000024763349],"category_scores_gemma":[0.000047375335,0.000114164715,0.000019077499,0.0002432407,0.000078232326,0.0013532104,0.0011633668,0.0001836199,0.0002030695],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006912709,0.00030451769,0.00050086406,0.00021390944,0.00009598708,0.000020102701,0.036126483,0.0046452265,0.000039405957,0.16298419,0.006620643,0.78837955],"study_design_scores_gemma":[0.008221929,0.0009534177,0.0063134935,0.00029795282,0.000010499047,0.00014233246,0.00044135697,0.1028723,0.0004089465,0.107474685,0.7720472,0.00081585086],"about_ca_topic_score_codex":0.00029109317,"about_ca_topic_score_gemma":0.000026215803,"teacher_disagreement_score":0.7875637,"about_ca_system_score_codex":0.0000646387,"about_ca_system_score_gemma":0.00007607306,"threshold_uncertainty_score":0.99996436},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07354822,0.00022798055,0.4170951,0.006971203,0.0034449804,0.0010232847,0.000001715952,0.0016054065,0.4960821],"genre_scores_gemma":[0.9520539,0.000013181722,0.037853666,0.00032949616,0.00014323555,0.000026938387,0.000015095245,0.00003563509,0.009528859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661,0.0014062639,0.0002611984,0.00078592444,0.00047016476,0.00046648755],"domain_scores_gemma":[0.99797136,0.0005576753,0.00024993374,0.00071698194,0.00020233418,0.00030171798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034578163,0.00029129515,0.0003126099,0.00015190917,0.000540917,0.00062283996,0.0018920449,0.000119295204,0.000057531233],"category_scores_gemma":[0.0013502829,0.0002473911,0.000064314045,0.00021374619,0.000084148305,0.0006434807,0.001462295,0.0013433368,0.0006283189],"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.00029057366,0.00008613978,0.00011007274,0.000006425611,0.000022104028,0.000029823139,0.0042195665,0.0039388402,0.00022160394,0.8096939,0.0012123216,0.18016863],"study_design_scores_gemma":[0.009279564,0.008050493,0.0005857079,0.0013078945,0.000070322385,0.000076274606,0.003997988,0.4342583,0.0012045079,0.41455472,0.12429395,0.0023202645],"about_ca_topic_score_codex":0.00008203436,"about_ca_topic_score_gemma":0.0000022022073,"teacher_disagreement_score":0.87850565,"about_ca_system_score_codex":0.00010030495,"about_ca_system_score_gemma":0.00024155376,"threshold_uncertainty_score":0.99999785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046771437,0.000039522707,0.78870046,0.00009560159,0.00023031935,0.00019570757,0.0000017150546,0.0007438138,0.16322145],"genre_scores_gemma":[0.88272464,0.0000017083139,0.10755338,0.00025250114,0.0000993549,0.0000030334322,0.0000140938155,0.000031667267,0.009319644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791276,0.00007945127,0.00025576956,0.00074518385,0.00037206453,0.00063477637],"domain_scores_gemma":[0.99875504,0.000036459172,0.00018464745,0.00050443993,0.00010034144,0.0004190585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029402054,0.0003025428,0.00030114216,0.0004020602,0.00047500702,0.000120560675,0.0012147112,0.00011700373,0.00016643142],"category_scores_gemma":[0.000056702487,0.00031442704,0.0001572869,0.0010388911,0.00007215225,0.00068102597,0.0004566395,0.0005306598,0.00015865595],"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.00019493567,0.0011250587,0.111658834,0.0001468761,0.00050911686,0.0016906629,0.28014326,0.039479468,0.00132332,0.43248096,0.012517254,0.11873025],"study_design_scores_gemma":[0.004249094,0.002116151,0.029351272,0.00033737026,0.00018202959,0.00050612533,0.01628958,0.6925986,0.0052260486,0.001994761,0.2424602,0.0046887905],"about_ca_topic_score_codex":0.00059491413,"about_ca_topic_score_gemma":0.000004890016,"teacher_disagreement_score":0.8359532,"about_ca_system_score_codex":0.00007158503,"about_ca_system_score_gemma":0.00007475773,"threshold_uncertainty_score":0.9999308},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019102463,0.00015490437,0.9904848,0.00035078733,0.0007084226,0.00030367178,0.000016227747,0.0005343802,0.0074277245],"genre_scores_gemma":[0.07662877,0.000008613478,0.9195804,0.0003938693,0.0011116004,0.000036878704,0.00007978932,0.00008513515,0.0020749208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960619,0.00005232169,0.00041642692,0.0017595115,0.0009731406,0.00073669443],"domain_scores_gemma":[0.99749833,0.0006490397,0.00034621087,0.0010073829,0.0002889718,0.00021005078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007078921,0.00059656956,0.0004855214,0.00069469627,0.000523475,0.00073176104,0.0026526693,0.00024355401,0.00021964633],"category_scores_gemma":[0.00025403316,0.0004908918,0.00010343425,0.0006630927,0.0007004407,0.0005580311,0.0012017589,0.0017644844,0.000120357305],"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.0000040746054,0.000043980424,0.00001354234,0.000090597525,0.000010004737,0.00011967868,0.0005304496,0.2034419,0.000010361519,0.029648999,0.000022687518,0.7660637],"study_design_scores_gemma":[0.00041256577,0.00044000737,0.000094507894,0.0009580852,0.000008564813,0.0002163187,1.3041114e-7,0.93067294,0.000040745053,0.063452594,0.0029453381,0.0007582291],"about_ca_topic_score_codex":0.00003726053,"about_ca_topic_score_gemma":0.00004951868,"teacher_disagreement_score":0.76530546,"about_ca_system_score_codex":0.0004738474,"about_ca_system_score_gemma":0.0017864025,"threshold_uncertainty_score":0.99975425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028764436,0.0000631729,0.98744553,0.0020133874,0.0004998885,0.00024364008,0.0000012455406,0.00041637954,0.0090291025],"genre_scores_gemma":[0.09992357,0.000004525015,0.86648506,0.00052239,0.00033390612,0.000020125615,0.000005828238,0.000016484746,0.0326881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988634,0.00002456911,0.00022948963,0.00037109194,0.00020405938,0.00030738467],"domain_scores_gemma":[0.9992014,0.00012353624,0.00007724857,0.00039782567,0.000059878228,0.00014007231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019855268,0.00014971735,0.00014635187,0.00010378465,0.00014465702,0.0001761372,0.00054907583,0.00006668636,0.00029849293],"category_scores_gemma":[0.00011611313,0.00011598526,0.000110269575,0.00021682474,0.000011473253,0.00045484988,0.00012341182,0.00013413223,0.00020542889],"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.000006226967,0.00005202051,0.00047244495,0.000010220839,0.0000216421,0.000001991115,0.0008528769,0.00021237001,0.0001780644,0.02630554,0.03779536,0.93409127],"study_design_scores_gemma":[0.0008463104,0.00014162649,0.00033865523,0.00001018852,0.0000032454027,0.0000088088145,0.00001632237,0.961258,0.0002242473,0.0019407342,0.035031423,0.0001804386],"about_ca_topic_score_codex":0.00012875922,"about_ca_topic_score_gemma":0.000014382876,"teacher_disagreement_score":0.9610456,"about_ca_system_score_codex":0.000022261765,"about_ca_system_score_gemma":0.000013657566,"threshold_uncertainty_score":0.47297418},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029295308,0.0010379388,0.9934807,0.0001256883,0.00059515866,0.00035276293,0.0000038950393,0.00031470848,0.0011596464],"genre_scores_gemma":[0.5425023,0.0003071047,0.4565338,0.00011347161,0.00021758021,0.000009203555,0.0000070202464,0.000024909115,0.000284665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973471,0.00007628862,0.00059977925,0.0009509694,0.00066244847,0.00036339188],"domain_scores_gemma":[0.9980072,0.000810422,0.00040876877,0.0005102162,0.00016088635,0.0001025052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001751091,0.0003706401,0.00084360514,0.0011377212,0.00020107965,0.00029201305,0.0007839818,0.00021806314,0.0000025841036],"category_scores_gemma":[0.00016618113,0.00030834787,0.00007912937,0.00056317716,0.0009509299,0.00044643471,0.0006324704,0.00057546515,0.0000014576491],"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.000081342405,0.000020060574,0.0006939908,0.0001300885,0.00002298879,0.000017094664,0.00047594344,0.08411152,0.000034874385,0.0011605337,0.00001251772,0.91323906],"study_design_scores_gemma":[0.004732406,0.00013390189,0.0009538894,0.00033494784,0.000016310536,0.000085722524,5.4851576e-8,0.989036,0.00010292883,0.00425984,0.00006288395,0.0002810752],"about_ca_topic_score_codex":0.000071569804,"about_ca_topic_score_gemma":0.000002440061,"teacher_disagreement_score":0.91295797,"about_ca_system_score_codex":0.000055382494,"about_ca_system_score_gemma":0.00013353021,"threshold_uncertainty_score":0.9999369},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05022876,0.000067704525,0.8961589,0.005178922,0.00048758482,0.00030388992,0.0000023073396,0.00031554291,0.04725642],"genre_scores_gemma":[0.99346054,0.000004460808,0.0029271424,0.00028769983,0.000068300076,0.000033284985,0.0000016238238,0.00001079586,0.0032061555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976866,0.0009786251,0.00023321742,0.0004043425,0.000364002,0.00033321127],"domain_scores_gemma":[0.9979053,0.00065794046,0.00015520594,0.0007088979,0.00037728448,0.00019536633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028879263,0.00017157526,0.00022783756,0.000096009,0.00029228616,0.000108012224,0.0010221603,0.000061135856,0.000087086846],"category_scores_gemma":[0.002712515,0.000118905424,0.00007680151,0.00039031645,0.00027635804,0.00016021868,0.00037946735,0.00066112174,0.00024964518],"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.000104516155,0.00007317875,0.0005990961,0.000008027703,0.000023927842,0.0000027995334,0.009787045,0.0073990375,0.00029331562,0.9187286,0.0004949641,0.06248549],"study_design_scores_gemma":[0.0021750769,0.0062435116,0.013121102,0.0003729557,0.000057365793,0.000048201844,0.01512684,0.2973451,0.0013834533,0.5075107,0.15516384,0.0014518304],"about_ca_topic_score_codex":0.00006652935,"about_ca_topic_score_gemma":0.000005756354,"teacher_disagreement_score":0.94323176,"about_ca_system_score_codex":0.00005204059,"about_ca_system_score_gemma":0.0002949102,"threshold_uncertainty_score":0.48488224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28123975,0.000049731192,0.70441985,0.0027894953,0.0010065655,0.00014995685,0.0000019482857,0.0005989212,0.009743818],"genre_scores_gemma":[0.8898196,0.0000028861941,0.10656768,0.0004933665,0.0001500953,0.0000025487361,0.000005088962,0.000011895872,0.002946795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865925,0.00010429896,0.00023007763,0.00042162745,0.0002536901,0.00033106658],"domain_scores_gemma":[0.999289,0.00007247493,0.00007368106,0.0004019284,0.000054413802,0.00010852531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040345665,0.00015937927,0.0001997687,0.00013862865,0.00011691942,0.00013102757,0.0006691326,0.00012974096,0.00024070044],"category_scores_gemma":[0.00008595475,0.00013089231,0.000055611894,0.00029266955,0.000041160343,0.00040890538,0.00023501985,0.0010270055,0.00004863063],"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.000016292275,0.0001951005,0.016623244,0.0000528873,0.000045921264,0.00020271535,0.004397702,0.30869293,0.04586332,0.21295613,0.002589862,0.4083639],"study_design_scores_gemma":[0.00033597706,0.000038582417,0.0011609943,0.000005329636,0.0000019916542,0.00002327767,0.000026149422,0.97565824,0.001168679,0.018381217,0.003000332,0.00019923729],"about_ca_topic_score_codex":0.00021157505,"about_ca_topic_score_gemma":0.000099144636,"teacher_disagreement_score":0.6669653,"about_ca_system_score_codex":0.000008457108,"about_ca_system_score_gemma":0.000056560228,"threshold_uncertainty_score":0.53376335},"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":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26122624,0.0007111621,0.3366117,0.0522076,0.15978605,0.0014912873,0.000010659454,0.008427576,0.17952774],"genre_scores_gemma":[0.40961996,0.000096906864,0.007966585,0.00050764676,0.54572207,0.000031474097,0.000057639158,0.000107381034,0.035890345],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968281,0.0005698353,0.00037071932,0.0009334915,0.00070567854,0.000592224],"domain_scores_gemma":[0.9989538,0.0001666913,0.00010816641,0.00046208085,0.00011604329,0.00019321387],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005688433,0.0003946241,0.0003928526,0.00030955224,0.0012788058,0.00016138614,0.0007242685,0.00015731534,0.00078797434],"category_scores_gemma":[0.00039641146,0.00037182347,0.00015900517,0.00070084905,0.000118190655,0.00051401893,0.00017840271,0.0024606325,0.0009611085],"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.0002567587,0.00083259493,0.051782552,0.000084792286,0.00027144892,0.0007369092,0.029469365,0.2141461,0.0013189734,0.010758916,0.23987614,0.45046544],"study_design_scores_gemma":[0.00062123954,0.000646625,0.002408643,0.000019009984,0.00000841886,0.00015444454,0.00007551398,0.0448727,0.00046732952,0.000053476422,0.95021886,0.0004537583],"about_ca_topic_score_codex":0.00016176088,"about_ca_topic_score_gemma":0.00000848601,"teacher_disagreement_score":0.7103427,"about_ca_system_score_codex":0.00009025284,"about_ca_system_score_gemma":0.00006276917,"threshold_uncertainty_score":0.9998734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06434129,0.00006302131,0.89430875,0.00014660889,0.00008357449,0.00034622924,0.0000038044482,0.00032949468,0.040377226],"genre_scores_gemma":[0.68654186,0.000010567733,0.3129111,0.00002382797,0.000020939638,0.000012038007,0.000007862419,0.000016196378,0.00045564986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998772,0.000015229552,0.00044590584,0.00026614734,0.00025319456,0.0002474765],"domain_scores_gemma":[0.9990224,0.00012393466,0.00023476039,0.00048096103,0.000039702092,0.000098206234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009457159,0.00015097825,0.00024281502,0.00008203482,0.00013560388,0.00006488482,0.00028170235,0.00007731671,0.000008801683],"category_scores_gemma":[0.000024954319,0.0001290997,0.000048048212,0.00031120682,0.000070497605,0.00009659931,0.00017372737,0.00020247788,0.00002085673],"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.0000045220527,0.00030296252,0.00013640305,0.00055859867,0.000118092066,0.0000040205127,0.01187732,0.00015160379,0.0031402996,0.972199,0.00009908744,0.011408071],"study_design_scores_gemma":[0.0020149455,0.00025890302,0.0026974757,0.00014998695,0.00014646426,0.0001038541,0.0019736688,0.49070653,0.0067257504,0.49052617,0.0037049518,0.0009913032],"about_ca_topic_score_codex":0.000008956445,"about_ca_topic_score_gemma":0.000002282743,"teacher_disagreement_score":0.62220055,"about_ca_system_score_codex":0.000016680604,"about_ca_system_score_gemma":0.000021268108,"threshold_uncertainty_score":0.52645326},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20114812,0.0000401647,0.7957913,0.00072358054,0.000052174677,0.00007525602,1.6143095e-7,0.00020163455,0.0019676012],"genre_scores_gemma":[0.95453507,0.000014989223,0.045070607,0.0002533435,0.000033951444,0.000006040512,0.000010930263,0.0000016781162,0.00007340103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954027,0.000026689257,0.00013847205,0.00007298304,0.00013909124,0.00008252005],"domain_scores_gemma":[0.99976015,0.000022738912,0.00007160773,0.000046515906,0.000048450922,0.00005051134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015313111,0.000057499747,0.000049454266,0.00007217965,0.00017110801,0.00030759608,0.000057609228,0.000027196967,0.0000030096135],"category_scores_gemma":[0.000020083238,0.000050878993,0.000010188365,0.00009687349,0.000013863406,0.0015365863,0.00006275879,0.00010322668,0.00001775926],"study_design_candidate":"design_other","study_design_consensus":null,"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.2344476e-7,0.0000056252,0.00071732193,0.0000060059147,0.0000015913613,8.4369816e-8,0.0025877373,0.0069648563,0.000009070505,0.002861706,0.000075540636,0.98676956],"study_design_scores_gemma":[0.00024708285,0.00005065722,0.010313476,0.000012020501,0.000001112663,0.000008911304,0.00009569696,0.95835054,0.000015185898,0.00035754425,0.030477777,0.00006998705],"about_ca_topic_score_codex":0.000013289647,"about_ca_topic_score_gemma":7.82278e-7,"teacher_disagreement_score":0.9866995,"about_ca_system_score_codex":0.000009446446,"about_ca_system_score_gemma":0.000011259872,"threshold_uncertainty_score":0.2966156},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013926739,9.902154e-7,0.9698097,0.003206162,0.000047185906,0.00006547175,6.681725e-8,0.00026584425,0.012677848],"genre_scores_gemma":[0.80714875,1.573829e-7,0.19167793,0.00031455862,0.00006635863,0.00000368302,6.4862184e-7,0.0000044801477,0.0007834581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912345,0.00016088269,0.000095897194,0.00021697315,0.00021220362,0.0001905783],"domain_scores_gemma":[0.99935156,0.00026580974,0.00006328302,0.0001931498,0.000052493724,0.000073714575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004804068,0.00008452747,0.000104568986,0.000039439405,0.00013862408,0.00013335385,0.00014512513,0.000033666955,0.00003346653],"category_scores_gemma":[0.00022518692,0.00005820059,0.000023617038,0.00012601375,0.000014959305,0.0003685062,0.000034011795,0.0002718346,0.000071951756],"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.000040478713,0.00011631468,0.039319582,0.000021589123,0.00003885217,0.000011175899,0.00061757583,0.028041722,0.0003126503,0.80805594,0.0007066979,0.122717425],"study_design_scores_gemma":[0.00055986154,0.00021055205,0.006170211,0.0000054801053,0.0000036831887,0.000026699616,0.0000067384567,0.98066264,0.00007318184,0.00067324913,0.011503239,0.0001044313],"about_ca_topic_score_codex":0.00007268928,"about_ca_topic_score_gemma":0.000009573099,"teacher_disagreement_score":0.9526209,"about_ca_system_score_codex":0.000012389216,"about_ca_system_score_gemma":0.000019922787,"threshold_uncertainty_score":0.23733512},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066867,0.00007270228,0.92746186,0.002374022,0.00017151577,0.00008054327,0.000002306154,0.00034048702,0.0026295516],"genre_scores_gemma":[0.72093534,0.0000015140715,0.2775156,0.0012845583,0.00007799036,0.000004803258,0.000021868704,0.000014073809,0.0001442413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838966,0.00002915644,0.00019947941,0.00044666952,0.0006289641,0.00030604866],"domain_scores_gemma":[0.99928004,0.00011735434,0.000116659845,0.0002579419,0.000103749015,0.00012424322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023686652,0.00018947257,0.00017151205,0.00021369505,0.0002700262,0.00031267738,0.00061653595,0.000045590154,0.000021909751],"category_scores_gemma":[0.000042761538,0.00015603207,0.00006896237,0.0008068171,0.00005804997,0.0012121942,0.00020635675,0.00031284138,0.0001069698],"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.000010788195,0.000049914786,0.0014610703,0.000024652914,0.000049253635,0.000061980594,0.0015967041,0.8013075,0.000037482416,0.18270218,0.0000646519,0.012633822],"study_design_scores_gemma":[0.0027637088,0.00042356848,0.047719147,0.00024452384,0.000022247443,0.000381961,0.00018562099,0.8319869,0.0002932661,0.11051917,0.0043452783,0.0011146077],"about_ca_topic_score_codex":0.00013151995,"about_ca_topic_score_gemma":7.223324e-7,"teacher_disagreement_score":0.65406835,"about_ca_system_score_codex":0.000061392595,"about_ca_system_score_gemma":0.00011970725,"threshold_uncertainty_score":0.6362803},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073911487,0.0007349274,0.9880199,0.00008325535,0.00065930485,0.00025944304,0.000011152833,0.0000775071,0.0027633726],"genre_scores_gemma":[0.6858633,0.0002329166,0.3114687,0.00023212706,0.001147605,0.000061445084,0.00021511303,0.000017261511,0.00076152745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918896,0.00005162134,0.0002924807,0.00018978218,0.000100941936,0.00017622273],"domain_scores_gemma":[0.9993036,0.00006271758,0.00015047895,0.00028663417,0.00012418973,0.00007240928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005356062,0.00011101673,0.00015686995,0.0001251124,0.00024650103,0.00041649537,0.0003015587,0.00006437734,9.032349e-7],"category_scores_gemma":[0.000050032777,0.000094148,0.000015146807,0.00016980409,0.000028578479,0.0036939376,0.0002915363,0.000076280325,0.00000977358],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026326254,0.000052523665,0.0021139907,0.00046694808,0.00010088533,0.000004379678,0.020227266,0.0012535051,0.000049673956,0.060087506,0.002996197,0.9126208],"study_design_scores_gemma":[0.00043613397,0.000046008467,0.00016329867,0.000039636794,0.0000064524675,0.000108923494,0.00040814138,0.90374374,0.0000022643346,0.00008082942,0.09484187,0.00012271867],"about_ca_topic_score_codex":0.00008292831,"about_ca_topic_score_gemma":0.000002223913,"teacher_disagreement_score":0.91249806,"about_ca_system_score_codex":0.000017565086,"about_ca_system_score_gemma":0.000044281045,"threshold_uncertainty_score":0.40162745},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02912133,0.00027513693,0.969189,0.00016765621,0.000030315443,0.00018617162,0.00002665796,0.000044893375,0.00095884723],"genre_scores_gemma":[0.9143548,0.000020428177,0.085549004,0.000017522154,0.000013018971,0.000006222065,0.000022189306,0.0000053316076,0.000011505257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892986,0.0000341025,0.00037728646,0.0002440137,0.00028361613,0.00013111427],"domain_scores_gemma":[0.9983835,0.00027462476,0.0002692464,0.0009960319,0.000034381417,0.000042163716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046723604,0.0001154409,0.00049474,0.00007587621,0.000056636214,0.000059064103,0.00095605146,0.00004455804,0.0000027011472],"category_scores_gemma":[0.000068339665,0.00006373789,0.00006238945,0.00069750356,0.00017449967,0.000045107463,0.0004604052,0.00010939827,0.0000018861448],"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.000012460548,0.00010803237,0.00005235246,0.00015957028,0.0006436431,0.000003770516,0.0023083303,0.025500981,0.00054884696,0.9687397,0.000018981727,0.0019033169],"study_design_scores_gemma":[0.00057578034,0.000028226248,0.00024828568,0.000023956545,0.00038355717,0.000013432849,0.0002744896,0.98972803,0.00020253318,0.0083710505,0.00003371024,0.000116914234],"about_ca_topic_score_codex":0.0000800535,"about_ca_topic_score_gemma":0.0000017543156,"teacher_disagreement_score":0.9642271,"about_ca_system_score_codex":0.000005685967,"about_ca_system_score_gemma":0.000020435222,"threshold_uncertainty_score":0.2599156},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004018353,0.00012407184,0.9939835,0.0010262637,0.0000355263,0.00020532815,0.00007746031,0.000015558539,0.0005139393],"genre_scores_gemma":[0.14505295,0.00007265533,0.8528661,0.00006706941,0.0001241598,0.000024504647,0.00023654758,0.000005524254,0.0015504493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984807,0.00022085897,0.0002948197,0.00034817687,0.0004396226,0.00021584287],"domain_scores_gemma":[0.99786216,0.00013449501,0.000034750778,0.00095134974,0.00092241133,0.0000948354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020720463,0.0000610124,0.00019929968,0.0004921495,0.00018713118,0.000090562105,0.0013058598,0.000048283426,0.00015715136],"category_scores_gemma":[0.0003039996,0.000053101845,0.000076214244,0.0016823097,0.00006205515,0.0004963355,0.00039342654,0.00013016835,0.000006596459],"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.000005726578,0.00030331934,0.000244702,0.000009732712,0.00044274423,0.000002177899,0.001326913,0.004214157,0.0014420684,0.03280756,0.017082172,0.9421187],"study_design_scores_gemma":[0.000107482345,0.00024740436,0.0013716038,0.00000366569,0.000020934944,5.6403434e-7,0.000022908003,0.99319065,0.0032878874,0.0002484871,0.0014423489,0.000056075314],"about_ca_topic_score_codex":0.0020050453,"about_ca_topic_score_gemma":0.00031026846,"teacher_disagreement_score":0.9889765,"about_ca_system_score_codex":0.0000043338696,"about_ca_system_score_gemma":0.00022877532,"threshold_uncertainty_score":0.3031042},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0676018,0.00002482873,0.9263136,0.0004932037,0.00078483677,0.000076965785,7.127266e-7,0.00039287342,0.004311229],"genre_scores_gemma":[0.8984689,0.000007783981,0.100860015,0.000289227,0.00015259144,0.000004232799,0.000001877973,0.000007314404,0.00020804313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997318,0.00040794915,0.00022138415,0.00075614755,0.0007149686,0.00058153877],"domain_scores_gemma":[0.9982178,0.0005097498,0.00007217911,0.00062787015,0.00028559362,0.00028677634],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022473114,0.00017275053,0.00019156585,0.0002036072,0.0013173951,0.0002529227,0.0019120199,0.000045131957,0.000044704073],"category_scores_gemma":[0.00055123196,0.00014321378,0.00006219881,0.001800343,0.0022531722,0.0005707105,0.00079768675,0.00049261557,0.00038923806],"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.000008099967,0.000067458495,0.0040219687,0.0000026553823,0.0000051809784,0.000046633293,0.0011342072,0.0018285749,0.000048313406,0.9302047,0.00028660372,0.06234564],"study_design_scores_gemma":[0.00025667588,0.0005535364,0.042664785,0.000018836014,0.0000021728447,0.000332927,0.000008105285,0.93551755,0.00025812408,0.01917551,0.00086216413,0.00034959926],"about_ca_topic_score_codex":0.000029108107,"about_ca_topic_score_gemma":7.357664e-7,"teacher_disagreement_score":0.933689,"about_ca_system_score_codex":0.000044693028,"about_ca_system_score_gemma":0.00017579521,"threshold_uncertainty_score":0.9999828},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18037383,0.00012212497,0.81766576,0.0004561911,0.0005722846,0.000018026685,7.9070475e-7,0.000019632727,0.0007713768],"genre_scores_gemma":[0.66092795,0.00000399012,0.33871895,0.00015979397,0.00015985906,2.658006e-7,0.0000010224288,0.000002602656,0.000025602223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920744,0.00010609537,0.00030082025,0.0001107483,0.00013248771,0.0001424281],"domain_scores_gemma":[0.9991887,0.00017869506,0.00029968235,0.000075404714,0.00018690352,0.00007058771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037652743,0.00007528596,0.00015304725,0.00017364549,0.00007502363,0.000037107475,0.0005052147,0.000044365966,0.000050529594],"category_scores_gemma":[0.000071682945,0.000058150115,0.000082482235,0.00014233479,0.0000506641,0.0002132991,0.00008217172,0.00022010758,0.000030744493],"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.00011753001,0.00034333422,0.06019208,0.000017291231,0.00027486638,0.00027216732,0.0049775396,0.104357876,0.00072756596,0.5841779,0.0025757097,0.2419661],"study_design_scores_gemma":[0.0017110156,0.0026314857,0.24842663,0.00006659819,0.000022354729,0.0022710992,0.000052397456,0.42903867,0.0005952684,0.3091609,0.0055747125,0.00044888692],"about_ca_topic_score_codex":0.000009413973,"about_ca_topic_score_gemma":1.9998822e-7,"teacher_disagreement_score":0.48055407,"about_ca_system_score_codex":0.000014001615,"about_ca_system_score_gemma":0.000102783175,"threshold_uncertainty_score":0.23712929},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008958156,0.000032807362,0.95284647,0.0034046583,0.00026399214,0.0001544877,0.0000018589715,0.0002868757,0.034050696],"genre_scores_gemma":[0.8310177,0.0000027171625,0.10352036,0.0010933988,0.00010929494,0.00004429524,0.0000059455338,0.000011729412,0.06419459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916875,0.000027607246,0.00017259056,0.00027937323,0.00012629663,0.00022534924],"domain_scores_gemma":[0.9993919,0.00008547486,0.000026413367,0.0003458104,0.00006592668,0.000084432926],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016951491,0.00010444511,0.00011145642,0.000057596255,0.00013194382,0.00012140098,0.00043019195,0.000039536626,0.00094934885],"category_scores_gemma":[0.000043053304,0.0000797853,0.00010068964,0.00016679503,0.000018821529,0.00021327658,0.00004998343,0.000120479155,0.00023918899],"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.000010651669,0.00014543164,0.0007293241,0.0000087670305,0.000034903638,0.000005549521,0.0008251615,0.0034986578,0.00019574822,0.21227951,0.011924647,0.77034163],"study_design_scores_gemma":[0.00042883508,0.00014047978,0.004472239,0.000015940821,0.0000044898325,0.000015152166,0.00003402132,0.8023921,0.00027212116,0.002761614,0.18922883,0.00023416043],"about_ca_topic_score_codex":0.00013701315,"about_ca_topic_score_gemma":0.000018698658,"teacher_disagreement_score":0.84932613,"about_ca_system_score_codex":0.000020146372,"about_ca_system_score_gemma":0.000025863388,"threshold_uncertainty_score":0.99996394},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002141932,0.00001902746,0.9899042,0.0009541168,0.00079521385,0.00029900623,0.000001224197,0.00024864625,0.00563662],"genre_scores_gemma":[0.49129865,8.8010523e-7,0.508278,0.00023406223,0.00012886524,0.000016569405,8.160177e-7,0.0000063171365,0.000035862053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974033,0.00014537534,0.00026861098,0.0007976157,0.0006895634,0.00069550873],"domain_scores_gemma":[0.9986033,0.00024064473,0.00008007175,0.0006652853,0.0001411862,0.00026950228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023920806,0.00019953726,0.00019773997,0.00015201057,0.00055694336,0.0005671633,0.0015785416,0.000047308164,0.000037141825],"category_scores_gemma":[0.00018248685,0.00016212427,0.00009279847,0.000760883,0.00086601765,0.00051377766,0.00026275395,0.00019983896,0.000051070467],"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.0000019621336,0.000059591,0.000016757189,0.0000062810486,0.0000028019103,0.0000023961757,0.00022460146,0.0008066177,0.0002200541,0.94085217,0.000056514094,0.057750273],"study_design_scores_gemma":[0.0002811595,0.00025075482,0.00018318243,0.0000103007,0.0000031129327,0.000033374625,0.0000050772856,0.7698826,0.0039459537,0.22438516,0.000814565,0.00020475141],"about_ca_topic_score_codex":0.0000015273209,"about_ca_topic_score_gemma":8.614619e-8,"teacher_disagreement_score":0.769076,"about_ca_system_score_codex":0.00008049386,"about_ca_system_score_gemma":0.00013198057,"threshold_uncertainty_score":0.6611236},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12070877,0.0010491348,0.8750828,0.00054389116,0.0010174434,0.00006453434,2.3723051e-7,0.000028180437,0.0015050367],"genre_scores_gemma":[0.972503,0.00001096189,0.027107794,0.000028177348,0.00031233803,1.5178594e-7,4.5539604e-8,0.0000020896766,0.00003541271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833137,0.00021807916,0.00054017466,0.000144796,0.00054136995,0.0002241922],"domain_scores_gemma":[0.9985339,0.00043876338,0.0005823701,0.000118526135,0.00023304558,0.00009341569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039611408,0.00009077917,0.00024515533,0.00009998227,0.00058812095,0.00033924024,0.00090708013,0.000024627932,9.926999e-7],"category_scores_gemma":[0.000036273912,0.00004709903,0.000074311756,0.0003120632,0.00061222934,0.00034489002,0.00014661728,0.0002156567,9.020799e-7],"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.000033579247,0.000089009496,0.030581558,0.00015416133,0.000089240995,0.00008585884,0.0068208133,0.012959405,0.00028105915,0.326444,0.0015751907,0.62088615],"study_design_scores_gemma":[0.0007565341,0.0027905565,0.04661013,0.00033786864,0.000015073248,0.0015827572,0.003109512,0.9243274,0.0005844685,0.0025380198,0.017059801,0.00028789582],"about_ca_topic_score_codex":0.000026480831,"about_ca_topic_score_gemma":0.0000029090975,"teacher_disagreement_score":0.91136795,"about_ca_system_score_codex":0.00001432309,"about_ca_system_score_gemma":0.000090788264,"threshold_uncertainty_score":0.45234102},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009055929,0.00014761831,0.9839499,0.00014589413,0.0020051212,0.000086940934,2.402068e-7,0.0005338749,0.004074504],"genre_scores_gemma":[0.990543,0.00002709071,0.002398686,0.00016853573,0.00010660923,0.00001684696,5.092324e-7,0.000021934486,0.0067167985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985299,0.00021101351,0.00020813066,0.00048122305,0.00015791159,0.0004118356],"domain_scores_gemma":[0.9991708,0.00017038418,0.000061869585,0.00041154667,0.000039164217,0.00014623479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002877899,0.00020330604,0.00016660092,0.00012793585,0.00047113403,0.00019023007,0.0004948043,0.00009464253,0.00008833153],"category_scores_gemma":[0.000010738529,0.00018831136,0.00014334332,0.0005794154,0.00003144412,0.00024103632,0.0000034854963,0.001012424,0.000100614154],"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.0000029771911,0.0000779162,0.00008875618,0.0000036443666,0.000012781918,0.000013594105,0.0002088734,0.8685144,0.0000119544075,0.0009347414,0.0001351525,0.12999521],"study_design_scores_gemma":[0.00025540098,0.00013875506,0.00006178551,0.00001699515,0.0000075061052,0.00005837839,0.00000838841,0.99081486,0.00045789283,0.00009195775,0.007871639,0.00021643101],"about_ca_topic_score_codex":0.000014675836,"about_ca_topic_score_gemma":0.000008982764,"teacher_disagreement_score":0.9815512,"about_ca_system_score_codex":0.00002904253,"about_ca_system_score_gemma":0.00001717283,"threshold_uncertainty_score":0.76791143},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02153619,0.0094329165,0.9156753,0.011954432,0.003402998,0.00033652695,0.00007093164,0.00047838668,0.03711235],"genre_scores_gemma":[0.7191745,0.00078232365,0.073644795,0.000394114,0.0033428688,0.000034046625,0.00025004701,0.00010717545,0.20227015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960129,0.00060876337,0.0008021106,0.0012214193,0.0004046142,0.0009501377],"domain_scores_gemma":[0.9971374,0.0010682719,0.00039515895,0.0009143658,0.0002766259,0.00020817156],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00069610827,0.00046686057,0.0004791597,0.00016760152,0.00067849824,0.000694259,0.0011574585,0.00026536363,0.0011098287],"category_scores_gemma":[0.00033892092,0.00052883074,0.00025896158,0.00092509645,0.0003397347,0.0006535628,0.00046014125,0.0010644852,0.005574483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019177682,0.0004906826,0.0010260775,0.000064419575,0.0000615734,0.0003430111,0.0072547565,0.27389398,0.001153308,0.14091817,0.0060193604,0.5687555],"study_design_scores_gemma":[0.00007345169,0.00032795343,0.0009483647,0.0005763878,0.000039826562,0.00007950908,0.00079986977,0.8476546,0.016427722,0.024700904,0.10778534,0.0005860747],"about_ca_topic_score_codex":0.0119646955,"about_ca_topic_score_gemma":0.000120986624,"teacher_disagreement_score":0.84203047,"about_ca_system_score_codex":0.00013853925,"about_ca_system_score_gemma":0.00012745138,"threshold_uncertainty_score":0.9998033},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035431366,0.00008223927,0.9567222,0.0017111711,0.0017151308,0.000111717934,0.0000041246117,0.00034478222,0.00387728],"genre_scores_gemma":[0.88780415,0.0000044919775,0.11100128,0.0006119059,0.00050560426,0.0000064459905,0.000003634863,0.000008424866,0.00005406696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968112,0.00016410607,0.00028733027,0.0006634257,0.0009938256,0.0010800721],"domain_scores_gemma":[0.99817246,0.0002696075,0.00008314191,0.0009244485,0.00013131938,0.00041903416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017182148,0.00024294495,0.00022164443,0.00007227099,0.0007464762,0.0007004591,0.0023643349,0.0000666255,0.00010507311],"category_scores_gemma":[0.0001360479,0.00018203686,0.00008868646,0.00091003324,0.0018451717,0.001623845,0.0012894503,0.00036130234,0.0003297261],"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.0000022172571,0.00009024984,0.0009963779,0.000004459297,0.000004056938,0.0000046803552,0.0009505499,0.000037715825,0.00007716427,0.9771399,0.0002024345,0.02049019],"study_design_scores_gemma":[0.0007489324,0.00052237365,0.022991167,0.00007853509,0.000021646812,0.00032643904,0.000031664953,0.69017386,0.008959381,0.25831673,0.01651208,0.0013172023],"about_ca_topic_score_codex":0.000011311249,"about_ca_topic_score_gemma":1.9076283e-7,"teacher_disagreement_score":0.85237277,"about_ca_system_score_codex":0.00009280829,"about_ca_system_score_gemma":0.00010051904,"threshold_uncertainty_score":0.74232477},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25440583,0.000011188419,0.7416565,0.00042505635,0.00007621588,0.00009245293,1.3389125e-7,0.0002801274,0.0030524929],"genre_scores_gemma":[0.8907614,0.0000018526292,0.10637207,0.000038310118,0.000024202389,0.000012014441,0.0000015330759,0.000004735454,0.0027838845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992471,0.0000913376,0.00013850526,0.0002040151,0.00014781622,0.00017122533],"domain_scores_gemma":[0.99906796,0.00048313083,0.00010439057,0.00018863163,0.0001160926,0.00003979259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012919884,0.00008563241,0.00011104253,0.00007338624,0.00011118602,0.0000591145,0.00035097756,0.000039990457,0.00007529182],"category_scores_gemma":[0.0008517629,0.000069154936,0.00003974032,0.00017369549,0.00004280498,0.00037553272,0.00018586255,0.00016908241,0.000090096706],"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.0000031562877,0.00006592304,0.07660615,0.000014160033,0.000013838755,8.7397797e-7,0.0019299869,0.016371597,0.0058678687,0.0032903212,0.0002545519,0.8955816],"study_design_scores_gemma":[0.00025434938,0.000085854714,0.055495713,0.0000075348853,0.00000123081,0.0000032058342,0.00036459966,0.92951906,0.012709777,0.0004470762,0.0010113724,0.00010024244],"about_ca_topic_score_codex":0.0014257672,"about_ca_topic_score_gemma":0.000009791773,"teacher_disagreement_score":0.91314745,"about_ca_system_score_codex":0.000013545203,"about_ca_system_score_gemma":0.000014929233,"threshold_uncertainty_score":0.28200567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07634323,0.000013533965,0.7666992,0.0001923906,0.000077988865,0.00004247289,9.7704365e-8,0.00057890767,0.1560522],"genre_scores_gemma":[0.78198975,8.732568e-7,0.21157259,0.00026986192,0.00002309324,0.0000026548857,3.3466733e-7,0.0000053273525,0.0061355364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992164,0.00010116753,0.00010824808,0.00023140709,0.00016059267,0.00018217998],"domain_scores_gemma":[0.99955636,0.000035754045,0.000051581424,0.0002677075,0.00003595496,0.000052655258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035160547,0.000082316816,0.00009761568,0.000036666337,0.00010908643,0.00005064648,0.00040386085,0.00002306348,0.000115759874],"category_scores_gemma":[0.000028835635,0.000055102893,0.000019139874,0.0001930289,0.000025129708,0.00015782285,0.00009107665,0.0001974807,0.00014458105],"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.000041623283,0.00029403466,0.11941,0.000028159402,0.000057809157,0.00006457946,0.012706199,0.0001376753,0.0004514753,0.5052135,0.00033535168,0.3612596],"study_design_scores_gemma":[0.0045382986,0.0031801485,0.2654532,0.00009056246,0.000021357397,0.00021028101,0.0011619785,0.6822122,0.005772412,0.009329734,0.026145287,0.0018845618],"about_ca_topic_score_codex":0.0005564982,"about_ca_topic_score_gemma":0.000013827752,"teacher_disagreement_score":0.7056465,"about_ca_system_score_codex":0.0000050949648,"about_ca_system_score_gemma":0.000019811776,"threshold_uncertainty_score":0.22470307},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4131886,0.011196907,0.5320848,0.033369202,0.00067220186,0.0006574867,0.000017082313,0.0020942625,0.006719425],"genre_scores_gemma":[0.9917265,0.0003013705,0.0042169453,0.0008858913,0.0001502039,0.0000049277924,0.00006693775,0.000030052324,0.0026171482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740535,0.0005957794,0.00033671054,0.00066112453,0.00044870176,0.0005523144],"domain_scores_gemma":[0.9988936,0.00028095458,0.00024895213,0.00038390493,0.000028610331,0.00016396857],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009551202,0.00035545553,0.00032520213,0.00012674202,0.0014237522,0.0006753601,0.0007075848,0.00010715163,0.00004568839],"category_scores_gemma":[0.00027302047,0.0002845261,0.000090866684,0.0004989722,0.0000740428,0.00047283355,0.00028307384,0.0013757766,0.00001874141],"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.00004259044,0.000102846934,0.063769095,0.000039720944,0.00006361701,0.000048961796,0.0061198547,0.08036226,0.0015364846,0.0024165702,0.0022981593,0.84319985],"study_design_scores_gemma":[0.0005808953,0.00030907852,0.016105384,0.000028030581,0.000016681091,0.00008734086,0.00006344324,0.82618076,0.000098822886,0.00025498105,0.15592447,0.00035011713],"about_ca_topic_score_codex":0.0001932509,"about_ca_topic_score_gemma":0.000013760361,"teacher_disagreement_score":0.84284973,"about_ca_system_score_codex":0.000046972953,"about_ca_system_score_gemma":0.000027200284,"threshold_uncertainty_score":0.99996066},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4767176,0.0007492143,0.50516224,0.00009403825,0.00067657983,0.00036225322,0.0000029577643,0.00028595186,0.01594919],"genre_scores_gemma":[0.9850758,0.000004472899,0.014278698,0.00002276384,0.00011220495,0.000003711999,0.000002247074,0.00001869092,0.00048142724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968604,0.0010780145,0.0008983824,0.0003802193,0.000393625,0.00038938178],"domain_scores_gemma":[0.9967847,0.0013490428,0.00087383616,0.0006031908,0.0002788337,0.00011041681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023579053,0.0002396525,0.00070091616,0.00020695172,0.00018808052,0.00012651281,0.00096718775,0.00008408211,0.00002544666],"category_scores_gemma":[0.00018810216,0.00020558429,0.00013233437,0.0003131956,0.0002461608,0.00018150642,0.00032135175,0.00030603097,0.000041434985],"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.000031185515,0.00017537897,0.0082381265,0.0005878919,0.0002448915,0.00001382935,0.0076379403,0.06127238,0.0484496,0.7353088,0.00030725016,0.1377327],"study_design_scores_gemma":[0.000782638,0.0004770652,0.0028327436,0.0011067089,0.000024836792,0.00012641093,0.001240655,0.9818898,0.0047096284,0.006107326,0.0002240716,0.00047810387],"about_ca_topic_score_codex":0.00046817824,"about_ca_topic_score_gemma":5.015592e-7,"teacher_disagreement_score":0.92061746,"about_ca_system_score_codex":0.000030109702,"about_ca_system_score_gemma":0.00007377479,"threshold_uncertainty_score":0.8383484},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11501408,0.000016871349,0.7202151,0.0004301175,0.00016709021,0.000052341456,1.3593596e-7,0.0006747511,0.16342954],"genre_scores_gemma":[0.87468636,0.000010075893,0.11951399,0.00007896035,0.00006431545,0.0000035005282,8.658403e-7,0.0000053497633,0.0056365905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939215,0.000059353486,0.00006029818,0.0002094077,0.00014387195,0.00013494388],"domain_scores_gemma":[0.9996852,0.000051249226,0.00004116785,0.00013969046,0.00003698866,0.00004568168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006291425,0.00007302289,0.00008430386,0.000051310395,0.00023298178,0.00003179718,0.00015027009,0.000021916641,0.00003478808],"category_scores_gemma":[0.000021653377,0.00005226755,0.000021111362,0.00020859642,0.000055088418,0.00025925282,0.00004446374,0.00019345706,0.000047872214],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037852707,0.000086200394,0.07167973,0.000011040529,0.000079659425,0.00020699861,0.003860872,0.010052214,0.00040470497,0.032637045,0.000918704,0.88002497],"study_design_scores_gemma":[0.0025351117,0.0015566715,0.121435,0.00008659026,0.000019647781,0.0046121576,0.0008061401,0.7575247,0.020596856,0.0009369614,0.08835526,0.0015349033],"about_ca_topic_score_codex":0.00012281774,"about_ca_topic_score_gemma":0.0000036319916,"teacher_disagreement_score":0.8784901,"about_ca_system_score_codex":0.000013486281,"about_ca_system_score_gemma":0.000040554834,"threshold_uncertainty_score":0.21314088},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49907735,0.0002959219,0.50032854,0.00015630401,0.00007876805,0.000033643333,0.0000026174564,0.000008367176,0.000018494755],"genre_scores_gemma":[0.9880593,0.00005279519,0.011685374,0.00010675075,0.000085759355,6.954334e-8,0.0000024709964,0.0000033190192,0.0000041555095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862266,0.00017978225,0.0005233604,0.0002101771,0.00028933134,0.00017467931],"domain_scores_gemma":[0.9986062,0.00031869637,0.00049807364,0.00041503334,0.000055104167,0.00010688988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010955269,0.00014503289,0.00053651194,0.00039794744,0.00006524833,0.00010157761,0.0009790766,0.000042761047,0.000012220748],"category_scores_gemma":[0.00006603972,0.00009348937,0.00017156937,0.00019932287,0.000028132416,0.00040842514,0.00017608613,0.00030205163,7.0519224e-7],"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.00018051852,0.000333636,0.010984016,0.00005560119,0.0027021188,0.00020125949,0.0008603727,0.15652739,0.014398073,0.000310535,0.000038832586,0.81340766],"study_design_scores_gemma":[0.00046039774,0.00044436,0.03546426,0.00009758078,0.00042426784,0.00016088923,0.000025196934,0.9140711,0.048061423,0.00026933438,0.00035956406,0.00016166068],"about_ca_topic_score_codex":0.000021319307,"about_ca_topic_score_gemma":9.422838e-7,"teacher_disagreement_score":0.813246,"about_ca_system_score_codex":0.000026570122,"about_ca_system_score_gemma":0.0000127230705,"threshold_uncertainty_score":0.38123858},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32301044,0.000050439965,0.6752309,0.00017254996,0.00022308821,0.000065418404,0.000023463388,0.000114034796,0.0011096433],"genre_scores_gemma":[0.87385213,0.000017048831,0.12586375,0.00012233615,0.00009430369,9.862924e-7,0.000026576528,0.0000063803136,0.000016471731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727714,0.000508542,0.000263042,0.000830674,0.000717856,0.00040274314],"domain_scores_gemma":[0.9972344,0.0011293404,0.00013060769,0.0010847503,0.00025535392,0.00016554327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017156934,0.00017143777,0.00028919356,0.00016647931,0.0004275411,0.00012530795,0.0036513912,0.000050503368,0.000016269418],"category_scores_gemma":[0.00067835,0.00014032781,0.000039390863,0.001109308,0.002655466,0.0006535065,0.002247555,0.00039178188,0.000031447733],"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.00005170982,0.00022399142,0.025774956,0.000010361409,0.000043696276,0.00015534641,0.013477829,0.0015457217,0.0010337689,0.81603533,0.00018419283,0.1414631],"study_design_scores_gemma":[0.00035461262,0.00043986316,0.20936868,0.00006070497,0.000005901372,0.000049425515,0.00007059231,0.7761021,0.0034347689,0.009734146,0.000042368207,0.00033684826],"about_ca_topic_score_codex":0.0005003287,"about_ca_topic_score_gemma":0.0000055072255,"teacher_disagreement_score":0.8063012,"about_ca_system_score_codex":0.000021897178,"about_ca_system_score_gemma":0.00016254024,"threshold_uncertainty_score":0.9784176},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001569508,0.000017780338,0.9941828,0.0013939867,0.0015364741,0.0002661107,0.000017346014,0.00048802712,0.0005279448],"genre_scores_gemma":[0.32617846,0.000005453886,0.6729218,0.00022239126,0.0001934034,0.000100949335,0.0000028286563,0.000020922058,0.00035381602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855477,0.000037080095,0.00021369783,0.0005234715,0.0002480338,0.00042293372],"domain_scores_gemma":[0.99838555,0.00043326148,0.00007188288,0.00083569647,0.0001312906,0.00014230672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027912858,0.00022204357,0.00019111727,0.00018170854,0.0005175846,0.00029141892,0.0010628966,0.00012474354,0.000046537487],"category_scores_gemma":[0.000051370393,0.00020749471,0.00015096951,0.00039311073,0.000058252645,0.00052744645,0.000013761527,0.00070478144,0.00005650919],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015910518,0.00015376389,0.000002796657,0.0000103607845,0.00004458995,0.0000031566017,0.0006521043,0.0049914313,0.0015809641,0.019257268,0.00007190128,0.97321576],"study_design_scores_gemma":[0.0015970016,0.0012524036,0.0005056012,0.00003887925,0.000042380132,0.000089117144,0.0005096231,0.87924767,0.007335421,0.0865873,0.021869501,0.0009251126],"about_ca_topic_score_codex":0.00009513043,"about_ca_topic_score_gemma":0.000063817846,"teacher_disagreement_score":0.97229064,"about_ca_system_score_codex":0.000021808974,"about_ca_system_score_gemma":0.0001641965,"threshold_uncertainty_score":0.84613883},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05847661,0.000027316386,0.31756365,0.008043983,0.0031620334,0.0001446759,3.0953763e-7,0.020382823,0.5921986],"genre_scores_gemma":[0.22396551,0.0000012836334,0.7607067,0.0004001332,0.00016497061,0.0000026340288,5.2775323e-7,0.000005506535,0.014752711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949515,0.00002154971,0.00006044425,0.00017563421,0.000108416294,0.00013882197],"domain_scores_gemma":[0.99954814,0.000032585325,0.000017224773,0.00031149332,0.000028455803,0.00006209341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013728162,0.00005593703,0.000051824925,0.00003638419,0.00006993265,0.00009571295,0.0004180168,0.00003353532,0.00021442256],"category_scores_gemma":[0.00003282452,0.000041888306,0.000024953319,0.00017303578,0.000009009795,0.00012510648,0.00009750433,0.00026785096,0.0005045458],"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.0000015796887,0.00023898746,0.007375314,0.000014940513,0.000033663408,0.000037521077,0.0012011472,0.000048245503,0.0047779446,0.46096924,0.035921704,0.4893797],"study_design_scores_gemma":[0.00010506141,0.000018241271,0.0035530487,6.55178e-7,9.3556804e-7,0.000018973808,0.0000019253723,0.7675787,0.00056507444,0.00081286166,0.22724319,0.00010130069],"about_ca_topic_score_codex":0.000039714952,"about_ca_topic_score_gemma":0.000010944472,"teacher_disagreement_score":0.7675305,"about_ca_system_score_codex":0.000002103118,"about_ca_system_score_gemma":0.000019189632,"threshold_uncertainty_score":0.64850837},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025525805,0.00012748402,0.9625762,0.0032936756,0.000038228052,0.00045800305,0.0000011441855,0.00093116565,0.007048272],"genre_scores_gemma":[0.68844354,0.0000047271947,0.30490988,0.0005042717,0.0002152165,0.00012266092,0.000021807573,0.00005466045,0.0057232333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726653,0.00022931962,0.00033077455,0.00084862893,0.000646328,0.0006784065],"domain_scores_gemma":[0.99857104,0.00017920442,0.00023769183,0.00057827047,0.00012368087,0.00031014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050242036,0.00036530555,0.0003477186,0.00029901412,0.0008779164,0.00036091564,0.0008508762,0.000059882048,0.00010699694],"category_scores_gemma":[0.0001417119,0.00030107948,0.000057214373,0.0009723498,0.000044896457,0.0003788682,0.00033726552,0.001070679,0.00038050715],"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.00006135165,0.00016966846,0.04162077,0.000043109852,0.00009635059,0.000036029232,0.0022103402,0.6456068,0.00045077846,0.0023183958,0.00008506109,0.3073013],"study_design_scores_gemma":[0.0016186165,0.001115092,0.0102275815,0.000240808,0.00005299078,0.00013117553,0.00016173992,0.8060467,0.00026237784,0.00008449118,0.17910478,0.0009536383],"about_ca_topic_score_codex":0.00021296676,"about_ca_topic_score_gemma":0.00012956654,"teacher_disagreement_score":0.66291773,"about_ca_system_score_codex":0.00009148821,"about_ca_system_score_gemma":0.00006644947,"threshold_uncertainty_score":0.99994415},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058548864,0.00008252242,0.93961966,0.0008386461,0.00003933757,0.00026194064,0.0000029545251,0.00013763858,0.00046843055],"genre_scores_gemma":[0.924599,0.00000439708,0.07451831,0.0004015389,0.00009817907,0.000114697556,0.00001429142,0.000012321366,0.00023729447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902165,0.00003575572,0.00018594343,0.00035718558,0.00019019945,0.00020924014],"domain_scores_gemma":[0.9994789,0.00005410509,0.00012077953,0.00012447771,0.00014804622,0.00007368953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002397246,0.00012005848,0.00011252138,0.000059718266,0.00022219501,0.00055215356,0.00026152804,0.000055663993,0.0000063021703],"category_scores_gemma":[0.000011659039,0.000108833854,0.000029169094,0.000105435836,0.000024387908,0.0007813555,0.00006964413,0.00012703172,0.000021714137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023836305,0.00003076427,0.00018747272,0.000056008717,0.0000040018567,3.1983075e-7,0.00077335624,0.00028181856,0.0015608035,0.000016540826,0.00024037542,0.99684614],"study_design_scores_gemma":[0.00031627476,0.000039612933,0.0014141613,0.00005049819,0.0000072083994,0.0000044580906,0.000047734193,0.99007267,0.00011251723,0.007760601,0.000018436971,0.00015584285],"about_ca_topic_score_codex":0.000019854291,"about_ca_topic_score_gemma":0.0000012147532,"teacher_disagreement_score":0.99669033,"about_ca_system_score_codex":0.000016296273,"about_ca_system_score_gemma":0.000035382713,"threshold_uncertainty_score":0.5324429},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09104086,0.000012868691,0.8992543,0.00044832268,0.000495841,0.00007674868,9.308339e-8,0.00045040392,0.0082205525],"genre_scores_gemma":[0.8165058,7.2271854e-7,0.18291217,0.0003364627,0.00018990062,0.0000013464269,3.5016546e-7,0.000007738043,0.000045513654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976042,0.00009719021,0.00020722498,0.0006899379,0.00074558007,0.00065589615],"domain_scores_gemma":[0.9985771,0.00041553707,0.00007762134,0.0004677794,0.0001872739,0.00027465643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021253396,0.00018980293,0.00016818632,0.00027475244,0.0006321709,0.00053253473,0.001682071,0.000053147953,0.00003258327],"category_scores_gemma":[0.000116088486,0.00013344176,0.000047627196,0.0014327465,0.0016255925,0.00054107024,0.0005346081,0.0006283227,0.000049682552],"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.00001686872,0.00003879801,0.0004311935,0.0000042933743,0.000004987806,0.00004456348,0.00066927046,0.0021351443,0.00063561945,0.8710788,0.000018430315,0.124922015],"study_design_scores_gemma":[0.00039457087,0.0012465727,0.008688182,0.000056640296,0.000005089242,0.00014035577,0.000053030184,0.9606881,0.0062719495,0.021234686,0.00079800026,0.00042281285],"about_ca_topic_score_codex":0.000008064994,"about_ca_topic_score_gemma":0.000002062942,"teacher_disagreement_score":0.95855296,"about_ca_system_score_codex":0.00005559966,"about_ca_system_score_gemma":0.000094953866,"threshold_uncertainty_score":0.5989563},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012541088,0.000037219634,0.98088986,0.0033216716,0.00050108205,0.0001011444,0.000004827074,0.00015075655,0.0024523314],"genre_scores_gemma":[0.552637,2.1685732e-7,0.44704488,0.00013387208,0.00011861988,0.0000030509987,0.000011811311,0.0000049128907,0.000045678524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982164,0.00032744918,0.00038467254,0.0003042831,0.0005037037,0.00026351388],"domain_scores_gemma":[0.99802494,0.00094699214,0.00026593788,0.00043605495,0.0002381179,0.00008796125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008515268,0.00014710483,0.00022347699,0.00005225918,0.0006908275,0.00015957424,0.0010821101,0.000028084558,0.000016617943],"category_scores_gemma":[0.0003331934,0.00011196281,0.00010428588,0.00028107042,0.0006836495,0.00014306998,0.00034838996,0.0002146558,0.000041270247],"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.000004215957,0.000038172082,0.0004479602,0.000013998048,0.000013629679,4.982996e-7,0.00013048285,0.05298032,0.000016623277,0.9233781,0.00046531172,0.022510663],"study_design_scores_gemma":[0.00016164403,0.000040082647,0.019929247,0.000008854683,0.0000019149918,0.000007799081,0.0000034454529,0.59469426,0.000018540231,0.38365757,0.0014005667,0.00007609987],"about_ca_topic_score_codex":0.00007160304,"about_ca_topic_score_gemma":0.00000822755,"teacher_disagreement_score":0.5417139,"about_ca_system_score_codex":0.00002528371,"about_ca_system_score_gemma":0.000057218258,"threshold_uncertainty_score":0.53133565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43335545,0.000006915615,0.5652448,0.00022854567,0.00041338414,0.000063368534,1.997782e-7,0.00006235095,0.0006250218],"genre_scores_gemma":[0.78757304,3.664881e-7,0.21224608,0.00010307693,0.00006771877,5.5819606e-7,3.471884e-8,0.000004262019,0.0000048453535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974591,0.0004003455,0.00028177063,0.00055213104,0.0008987543,0.0004078764],"domain_scores_gemma":[0.99834913,0.00021654584,0.00011407449,0.0010602486,0.00012516421,0.00013481946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027847262,0.00014357021,0.00019428875,0.00009506049,0.0012305746,0.00008295351,0.0025008512,0.000036337515,0.0000065877844],"category_scores_gemma":[0.00035668316,0.00009112295,0.000089898924,0.00070713443,0.0023319742,0.0004174932,0.0017798338,0.0004340998,0.000005482697],"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.0000031260233,0.00009872385,0.003649126,0.0000090436515,0.0000035497699,0.0000065990534,0.0016921306,0.0035527868,0.0076789446,0.96299887,0.000005449024,0.020301657],"study_design_scores_gemma":[0.000120414305,0.000056576682,0.026249966,0.000047192614,0.00000279845,0.00014030209,0.000003085172,0.95223683,0.0039963457,0.01700672,0.000010766046,0.000129031],"about_ca_topic_score_codex":0.000032437063,"about_ca_topic_score_gemma":1.4748191e-7,"teacher_disagreement_score":0.94868404,"about_ca_system_score_codex":0.000055403212,"about_ca_system_score_gemma":0.00015766433,"threshold_uncertainty_score":0.94647086},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06566448,0.00018573838,0.93211335,0.0005373231,0.0002195508,0.0004749283,0.0000061162677,0.000070658134,0.0007278805],"genre_scores_gemma":[0.9990528,0.0000022014813,0.00029214367,0.0003380721,0.00010316004,0.000022602677,0.0000040802993,0.000008866154,0.000176029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878836,0.00016108343,0.00031685014,0.0002680286,0.00026338178,0.00020231934],"domain_scores_gemma":[0.9985862,0.0006265707,0.00019916068,0.00038183318,0.00011323964,0.00009302959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001262456,0.00014515253,0.00024543874,0.00008254695,0.000119108416,0.00010447826,0.00035113454,0.00004114565,0.000010794233],"category_scores_gemma":[0.00006340177,0.000076130535,0.00004250717,0.00013044571,0.00005812499,0.00008279429,0.000012862107,0.00012196866,0.0000106532525],"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.0013527207,0.0007301,0.011620144,0.00021925467,0.0003188485,0.000035590012,0.0019714832,0.023299797,0.008895636,0.6908992,0.0007455042,0.25991175],"study_design_scores_gemma":[0.0012001947,0.0012935976,0.008975406,0.000058276368,0.00001829442,0.000017639702,0.00010066541,0.9825762,0.0009301843,0.00023754743,0.004405154,0.00018685611],"about_ca_topic_score_codex":0.0002228006,"about_ca_topic_score_gemma":0.000012534988,"teacher_disagreement_score":0.9592764,"about_ca_system_score_codex":0.00001366551,"about_ca_system_score_gemma":0.000028206645,"threshold_uncertainty_score":0.3104513},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36632055,0.000038932794,0.6328959,0.000050529543,0.000043930435,0.00002527769,3.0432707e-7,0.0000417967,0.00058279035],"genre_scores_gemma":[0.9897208,0.0000042343777,0.010207811,0.00003821256,0.00001132494,0.0000010472565,0.000008281303,0.00000106629,0.000007216921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995746,0.00003473614,0.0001894174,0.000026015872,0.00011275174,0.00006248205],"domain_scores_gemma":[0.9996387,0.0000562102,0.00018842662,0.000043539167,0.00005028731,0.000022873017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018174546,0.000038147053,0.00006855826,0.000087338136,0.000029102763,0.000025299445,0.00006010888,0.000017034883,0.0000055872233],"category_scores_gemma":[0.000032092557,0.000033738776,0.000014134318,0.00010540356,0.000011616107,0.0008942756,0.000031789416,0.00004545912,0.0000072863895],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.0877345e-7,0.000010883247,0.017286988,0.00008630528,0.000004329638,3.4057628e-8,0.005248218,0.0020860273,0.00003684556,0.0029846341,0.000021364682,0.97223395],"study_design_scores_gemma":[0.00013567376,0.000038772854,0.09130234,0.000020385824,0.0000022077468,0.0000047593658,0.00034755658,0.9072977,0.0004576152,0.00007834457,0.0002728584,0.000041815194],"about_ca_topic_score_codex":0.00003116252,"about_ca_topic_score_gemma":1.7491834e-7,"teacher_disagreement_score":0.97219217,"about_ca_system_score_codex":0.0000034831962,"about_ca_system_score_gemma":0.000008417868,"threshold_uncertainty_score":0.13758273},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2027978,0.000023741364,0.78825504,0.0004907928,0.0008850132,0.00010598266,3.371447e-7,0.00015651145,0.007284787],"genre_scores_gemma":[0.8522149,0.0000017223,0.14739914,0.0003317121,0.000026605318,0.0000042466463,2.3313106e-7,0.00000620515,0.000015258097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971974,0.0002806966,0.00030016724,0.0007890232,0.0007306052,0.0007021139],"domain_scores_gemma":[0.9987643,0.00019960775,0.000061838444,0.0006569987,0.00006700991,0.0002502598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026771368,0.00019088245,0.00021551953,0.00041148954,0.0002640606,0.00048036355,0.0022569122,0.000056216366,0.00006405947],"category_scores_gemma":[0.0001853196,0.00016023648,0.00006824093,0.00167165,0.0009060149,0.0005585562,0.00073921785,0.00046249872,0.000093133945],"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.0000015886951,0.000049010974,0.0014775752,0.0000034288682,0.000001576287,0.00004098289,0.0005954136,0.00014722232,0.000071188915,0.94543713,0.0000132684445,0.052161604],"study_design_scores_gemma":[0.0003969447,0.00017648289,0.007739767,0.000053112835,0.0000017013888,0.00012300129,0.000014451816,0.59121704,0.0013183214,0.39849353,0.00014157502,0.0003240781],"about_ca_topic_score_codex":0.000009338649,"about_ca_topic_score_gemma":0.0000016630748,"teacher_disagreement_score":0.6494171,"about_ca_system_score_codex":0.000072178766,"about_ca_system_score_gemma":0.00011820927,"threshold_uncertainty_score":0.6534254},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5518563,0.0007758206,0.4411004,0.0004991053,0.00047864893,0.00025902092,0.0000017193628,0.0010774493,0.0039515826],"genre_scores_gemma":[0.977063,0.000081859675,0.018612266,0.000055113494,0.00013182056,0.000015237268,0.000023735185,0.000045725847,0.0039712694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970704,0.0004870683,0.000581018,0.00069904263,0.0005698424,0.0005926701],"domain_scores_gemma":[0.9983854,0.0004102279,0.0004785217,0.0004520465,0.00015180193,0.0001219931],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093424175,0.00034040486,0.00048270708,0.00035600236,0.00091958145,0.0000977481,0.0007863823,0.00016181634,0.000040007522],"category_scores_gemma":[0.001192423,0.00032046277,0.0001877897,0.000895884,0.00009808132,0.0005885282,0.00038637107,0.0015273286,0.00007131031],"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.00007993837,0.00029037954,0.38225955,0.00022410456,0.00013550944,0.00025387172,0.013751765,0.46491513,0.030894877,0.002020499,0.00014942636,0.105024956],"study_design_scores_gemma":[0.0009857407,0.0003508611,0.009582072,0.0001634652,0.000015195236,0.00021565428,0.00009759334,0.9761927,0.0014427785,0.00009566322,0.010429401,0.00042884008],"about_ca_topic_score_codex":0.00085000205,"about_ca_topic_score_gemma":0.000013374956,"teacher_disagreement_score":0.5112776,"about_ca_system_score_codex":0.000050406077,"about_ca_system_score_gemma":0.000076794066,"threshold_uncertainty_score":0.9999247},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0583776,0.00010563488,0.93754333,0.0035926993,0.000014942762,0.0001633692,0.0000039630872,0.000009141371,0.0001893376],"genre_scores_gemma":[0.5211521,0.000005511054,0.47849786,0.00027571645,0.000041145362,0.0000065937484,0.0000022302618,0.0000019694044,0.000016879165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990999,0.000046804358,0.0004369268,0.00008945282,0.00017121279,0.00015569835],"domain_scores_gemma":[0.9994017,0.00011813689,0.00018592145,0.000077186036,0.00011917142,0.000097890574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047700593,0.00008293661,0.00016272283,0.00019848673,0.000072988216,0.00006859367,0.00021234968,0.000030092757,0.0000038600597],"category_scores_gemma":[0.000014474655,0.000060605562,0.000020211472,0.00023743446,0.00004980965,0.00017015474,0.000068305184,0.00019028687,0.000010109186],"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.000044555036,0.00013004914,0.0013848752,0.000045877357,0.00002835062,0.000009189358,0.0018664035,0.34070894,0.00021563734,0.11010732,0.00005877638,0.5454],"study_design_scores_gemma":[0.00092952244,0.00063874427,0.0054078368,0.00011470697,0.000003421614,0.00027229474,0.00011890779,0.9774953,0.00005139598,0.008719418,0.0060849283,0.00016352179],"about_ca_topic_score_codex":0.0000053740127,"about_ca_topic_score_gemma":0.000003023572,"teacher_disagreement_score":0.63678634,"about_ca_system_score_codex":0.000031670483,"about_ca_system_score_gemma":0.00011459158,"threshold_uncertainty_score":0.24714231},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034371715,0.0014967646,0.9601625,0.0003862234,0.0002986623,0.0003785761,0.000007013018,0.00023813524,0.002660386],"genre_scores_gemma":[0.9958528,0.00008176074,0.0014611257,0.0002675658,0.00015266532,0.000029501487,0.000004029009,0.00001723229,0.0021333178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832666,0.00011087525,0.0003887122,0.00044013932,0.00033094521,0.00040264585],"domain_scores_gemma":[0.99894834,0.00011213867,0.00017585751,0.00040170035,0.0001329904,0.00022900398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033789693,0.00025229531,0.00048818067,0.00011446692,0.00030637436,0.00019189033,0.0004045954,0.00007038708,0.0000060380326],"category_scores_gemma":[0.00002542397,0.0001759497,0.00007253001,0.00015755637,0.00009210813,0.000250879,0.000039378134,0.00023061564,0.00003208895],"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.0006252654,0.00061499304,0.062500544,0.00031065746,0.0008646634,0.00064011425,0.008522952,0.7760597,0.0029026396,0.100412324,0.0048871147,0.04165904],"study_design_scores_gemma":[0.0013968273,0.00021506238,0.0007489969,0.000053662603,0.000017132435,0.00019120472,0.00005337732,0.99105763,0.000054482123,0.00006816735,0.0058935075,0.00024996258],"about_ca_topic_score_codex":0.00021822652,"about_ca_topic_score_gemma":0.0000036861727,"teacher_disagreement_score":0.9614811,"about_ca_system_score_codex":0.000027182,"about_ca_system_score_gemma":0.00008151281,"threshold_uncertainty_score":0.71750206},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035291289,0.00004311434,0.97917604,0.001283535,0.0003818395,0.00004945482,0.0000026537582,0.00027251564,0.0152617255],"genre_scores_gemma":[0.48012698,0.0000015244811,0.5178663,0.0005706454,0.0009260736,0.0000027560413,0.000010260143,0.000007856351,0.00048758514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905986,0.000048499187,0.00007871885,0.00027303834,0.00022108194,0.000318795],"domain_scores_gemma":[0.99870926,0.00015091879,0.000040148694,0.0009506561,0.000026708716,0.00012231381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002797832,0.00009688507,0.00009225653,0.00003105669,0.00012125163,0.000102549806,0.001110859,0.000041299412,0.00011035696],"category_scores_gemma":[0.00009869023,0.0000661913,0.0000125462975,0.00023660834,0.000019187784,0.001107684,0.0005861328,0.00028705737,0.00011052867],"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.000013118492,0.00024364212,0.041891918,0.000027762706,0.00009352209,0.000016633698,0.0062560597,0.00020993964,0.00009647784,0.09698119,0.010434545,0.8437352],"study_design_scores_gemma":[0.0005437883,0.00013380688,0.015276131,0.00011456758,0.000018086823,0.000077789926,0.0006229589,0.9245334,0.001201814,0.001365207,0.055505313,0.0006070819],"about_ca_topic_score_codex":0.000054852775,"about_ca_topic_score_gemma":0.0000019914662,"teacher_disagreement_score":0.9243235,"about_ca_system_score_codex":0.000009061655,"about_ca_system_score_gemma":0.000021958005,"threshold_uncertainty_score":0.2699203},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079886265,0.000036411977,0.90978914,0.0032537945,0.000153347,0.00018900471,1.7960292e-7,0.00035507858,0.0063367574],"genre_scores_gemma":[0.8887738,0.000005797529,0.11046843,0.0006522094,0.00007776985,0.0000051209913,3.8795017e-7,0.0000047710573,0.000011703299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969963,0.000030259935,0.0003111952,0.00083926285,0.0007025775,0.0011203946],"domain_scores_gemma":[0.9992276,0.000049273658,0.000096931624,0.00028924274,0.00016349944,0.00017344861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022847936,0.00020447592,0.00021620252,0.00032912672,0.00031522344,0.00061170245,0.0023665521,0.00004301484,0.000009681764],"category_scores_gemma":[0.00011570282,0.00017855957,0.00004642914,0.0021340002,0.0008850008,0.0011212138,0.00035609293,0.0006035061,0.000025900554],"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.000004818851,0.00006316804,0.000077123266,0.000003616499,8.8529174e-7,0.0000019816196,0.00045102517,0.00008415743,0.0003622394,0.8934048,0.000016324919,0.10552989],"study_design_scores_gemma":[0.00015191568,0.00026622033,0.0020378907,0.000013752758,5.532814e-7,0.000026656795,0.0000018916792,0.51596147,0.0013935844,0.47994378,0.000063929314,0.00013834907],"about_ca_topic_score_codex":0.0000029970242,"about_ca_topic_score_gemma":4.551284e-7,"teacher_disagreement_score":0.80888754,"about_ca_system_score_codex":0.00023379414,"about_ca_system_score_gemma":0.00018061836,"threshold_uncertainty_score":0.72814476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038267132,0.000027996444,0.9559815,0.0028786222,0.0025816178,0.00009327849,0.0000036623255,0.000032705488,0.00013351193],"genre_scores_gemma":[0.7279604,0.0000050241797,0.27002138,0.00020396379,0.0017488467,0.0000029577445,0.000009652587,0.00000873693,0.000039055907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986567,0.00007523315,0.0004365361,0.00018914297,0.0005006524,0.000141745],"domain_scores_gemma":[0.99852884,0.00012628324,0.0004466117,0.000081723454,0.0007646266,0.000051946005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040329233,0.00011470495,0.0001531878,0.00028836058,0.00008523763,0.00020622431,0.00054136326,0.000041104584,0.000009208843],"category_scores_gemma":[0.000024077439,0.00009149596,0.00017604437,0.000120953424,0.000015232025,0.00026267333,0.000094026735,0.00017421089,0.000008401902],"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.00011730428,0.00030540477,0.00005802829,0.000007694728,0.00004390933,0.000020996264,0.00017452845,0.039292805,0.0013660776,0.00341517,0.0019173749,0.9532807],"study_design_scores_gemma":[0.0008521322,0.000612059,0.0044182506,0.00015450803,0.000010146939,0.00039543255,0.0000049487107,0.97685343,0.0025793745,0.009138257,0.0048552877,0.00012614406],"about_ca_topic_score_codex":0.000027898113,"about_ca_topic_score_gemma":0.00000307803,"teacher_disagreement_score":0.95315456,"about_ca_system_score_codex":0.000115194285,"about_ca_system_score_gemma":0.00004965653,"threshold_uncertainty_score":0.37310967},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057211425,0.000013664581,0.9857462,0.0021371506,0.0010391709,0.0002636617,8.741903e-7,0.0004801619,0.0045979847],"genre_scores_gemma":[0.45086586,1.2620454e-7,0.5481592,0.00068007025,0.00025894912,0.000009409289,6.774386e-7,0.000008366577,0.000017349836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965079,0.00068101514,0.00034165249,0.0010436799,0.0005754249,0.00085033587],"domain_scores_gemma":[0.9970351,0.0013302468,0.00012002445,0.001010998,0.0001582274,0.00034542265],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.009704037,0.00025251,0.00032592146,0.00020106813,0.0014713017,0.0010153973,0.0032685737,0.000058696947,0.000015285748],"category_scores_gemma":[0.0009872235,0.00020501985,0.00012156154,0.0005601989,0.0028364044,0.0006536928,0.0012906203,0.00047160045,0.000026564885],"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.000002277896,0.000027370248,0.00001583938,0.000012240012,0.0000021511946,5.204024e-7,0.00033485919,0.00010805469,0.00031532493,0.6839489,0.000028220747,0.3152043],"study_design_scores_gemma":[0.0001695317,0.00020710753,0.00025243167,0.000015379734,0.0000034114205,0.00001856142,0.000002996394,0.6168114,0.0007549897,0.38026148,0.0013094374,0.00019329009],"about_ca_topic_score_codex":0.00001261153,"about_ca_topic_score_gemma":4.6066359e-7,"teacher_disagreement_score":0.61670333,"about_ca_system_score_codex":0.000057979276,"about_ca_system_score_gemma":0.00009855192,"threshold_uncertainty_score":0.99987733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95126325,0.00008056659,0.018442132,0.017496929,0.0010483701,0.00006746977,4.3364167e-7,0.00014462743,0.011456242],"genre_scores_gemma":[0.9471633,0.000022314776,0.033420574,0.00034873374,0.00031698062,7.0250627e-7,1.4901634e-7,0.00000814426,0.018719133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990674,0.00018223381,0.00021667528,0.000104756204,0.00030059283,0.00012828893],"domain_scores_gemma":[0.998597,0.000106179694,0.00020471725,0.0009616336,0.00006710487,0.00006332965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046542488,0.000065697226,0.00010656694,0.00004867202,0.00023831331,0.00007788704,0.002446723,0.000027840362,0.00019094079],"category_scores_gemma":[0.001256596,0.000040010593,0.0001401174,0.00026566206,0.000021891608,0.00023657187,0.00045237166,0.00054871035,0.000113692404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082367675,0.00038355577,0.035218075,0.000011688124,0.00018912261,0.00014283751,0.0043395706,0.061401516,0.0015535305,0.00035353686,0.03706713,0.85925704],"study_design_scores_gemma":[0.0017213518,0.0006832404,0.20888728,0.00015867036,0.000052641826,0.002650516,0.00021645713,0.6010357,0.0013667572,0.009028387,0.1738675,0.00033151382],"about_ca_topic_score_codex":0.00007064925,"about_ca_topic_score_gemma":9.83056e-7,"teacher_disagreement_score":0.8589256,"about_ca_system_score_codex":0.000019513092,"about_ca_system_score_gemma":0.000041536652,"threshold_uncertainty_score":0.45466605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039790597,0.00080836687,0.99360925,0.0027474842,0.0014730559,0.00015436958,0.000013779249,0.000104467945,0.00069134304],"genre_scores_gemma":[0.0005895511,0.000081270104,0.98457015,0.00034370474,0.0024718118,0.000007989638,0.0000044899944,0.000038777052,0.011892238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978963,0.00010367248,0.00070324907,0.00032678264,0.0005238051,0.00044617825],"domain_scores_gemma":[0.99801683,0.00021527531,0.0005720418,0.00041278193,0.00051349757,0.00026954946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010418141,0.0002379896,0.00042932964,0.00035180253,0.0003086064,0.00019244823,0.0008773103,0.00011614775,0.00014942334],"category_scores_gemma":[0.00019717,0.00020372657,0.0004007483,0.000512563,0.000045723904,0.0007219259,0.00011037357,0.00052937435,0.00021728584],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003892008,0.00014211584,0.000008776011,0.000008506756,0.00009139317,0.000056386816,0.00028495656,0.0003327937,0.00016503978,0.000056366418,0.019049745,0.97980005],"study_design_scores_gemma":[0.0009996489,0.0006906581,0.000032583077,0.000064134176,0.000039968745,0.0007001484,0.00003498022,0.87097824,0.00029931558,0.000729794,0.12518905,0.00024148809],"about_ca_topic_score_codex":0.0000051831353,"about_ca_topic_score_gemma":1.9777804e-7,"teacher_disagreement_score":0.9795585,"about_ca_system_score_codex":0.000068862624,"about_ca_system_score_gemma":0.000054738677,"threshold_uncertainty_score":0.8307728},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042612206,0.00009607314,0.95022196,0.0022680084,0.0006363152,0.0002003457,0.0000013211607,0.00033815866,0.003625615],"genre_scores_gemma":[0.8663567,0.0000041241556,0.13238433,0.0009700873,0.0002167792,0.000010113902,7.6038276e-7,0.000012062103,0.000045064742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963394,0.0002726048,0.0003277749,0.0008350037,0.0010487717,0.0011764652],"domain_scores_gemma":[0.9977689,0.00024698893,0.00009156554,0.0010712632,0.0001622963,0.00065898086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038925267,0.00027597923,0.00027736663,0.00013492243,0.00059332483,0.0005022783,0.002687216,0.00008147735,0.000054435033],"category_scores_gemma":[0.00009818007,0.00021383181,0.000098722325,0.0010854307,0.002094049,0.0010978677,0.0011581655,0.00049641525,0.00029336708],"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.0000054870675,0.0002018484,0.0010786348,0.000011284873,0.000007041884,0.0000017588858,0.00093156664,0.0001904317,0.0010790811,0.912419,0.00063467625,0.08343914],"study_design_scores_gemma":[0.00056661846,0.00034833048,0.005116234,0.00006131863,0.0000115974435,0.00009251975,0.000022364831,0.82594985,0.005200864,0.15819514,0.0036242427,0.0008109337],"about_ca_topic_score_codex":0.000017719041,"about_ca_topic_score_gemma":3.113666e-7,"teacher_disagreement_score":0.8257594,"about_ca_system_score_codex":0.00011962029,"about_ca_system_score_gemma":0.00015956884,"threshold_uncertainty_score":0.8719808},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13059038,0.00007751415,0.8665108,0.000516961,0.0018284458,0.000035980433,0.0000022835538,0.000024964076,0.0004126452],"genre_scores_gemma":[0.9052894,0.000016473716,0.09359047,0.00021651939,0.00082649617,4.3547945e-7,0.000010458174,0.0000076582755,0.00004210419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810314,0.0003595444,0.0004725123,0.0001289228,0.00077387725,0.00016200705],"domain_scores_gemma":[0.9977211,0.00057334936,0.0006724974,0.00009174709,0.0008450453,0.000096292875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010458559,0.000121110286,0.000204017,0.00033999648,0.000056343433,0.000084654705,0.0006609364,0.00005097993,0.000050811894],"category_scores_gemma":[0.000079310696,0.000100551115,0.0001673204,0.00015888813,0.000041627136,0.00094725547,0.00020040009,0.00037578744,0.000023078572],"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.00013015915,0.00023388374,0.00053576956,0.0000054526267,0.00017356299,0.000012296933,0.0013397172,0.22583953,0.00014186688,0.008571002,0.00023518033,0.76278156],"study_design_scores_gemma":[0.0021800364,0.0011307403,0.053875193,0.00045935105,0.000033377208,0.0010844747,0.00018843744,0.87386495,0.0008085093,0.06182985,0.004187769,0.00035733843],"about_ca_topic_score_codex":0.000007623786,"about_ca_topic_score_gemma":1.893806e-7,"teacher_disagreement_score":0.77469903,"about_ca_system_score_codex":0.00008331094,"about_ca_system_score_gemma":0.000079029174,"threshold_uncertainty_score":0.41003555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040002983,0.00014921605,0.95350707,0.00043282742,0.00031227065,0.00017277808,0.000032765787,0.00003945018,0.005350671],"genre_scores_gemma":[0.5169595,0.000008884742,0.4829479,0.000020583468,0.000004233623,0.0000018049001,8.2561854e-7,0.0000052105934,0.000051079936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851674,0.00007099256,0.00065160287,0.00015069844,0.00043269797,0.00017725395],"domain_scores_gemma":[0.9980581,0.0005374237,0.0005403102,0.0006108218,0.00019063073,0.000062704035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049954065,0.0001417302,0.0004203973,0.00005671091,0.00007193338,0.00001758413,0.0006637439,0.000047681464,0.000025085572],"category_scores_gemma":[0.0024833465,0.00008806592,0.00009915402,0.00022833896,0.0004054799,0.00013848562,0.00015463374,0.00012319315,0.0000043250934],"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.0000013188477,0.00022670063,0.00017178062,0.00072146836,0.000037066944,0.000003003738,0.00033772754,0.0004874648,0.0003177062,0.990758,0.00034742863,0.006590314],"study_design_scores_gemma":[0.0003507228,0.00020398018,0.0017155815,0.001690587,0.000056557827,0.000039150164,0.00008621871,0.40698445,0.02761238,0.5608168,0.00021882306,0.00022473295],"about_ca_topic_score_codex":0.000025527797,"about_ca_topic_score_gemma":0.0000011497116,"teacher_disagreement_score":0.4769565,"about_ca_system_score_codex":0.0000046277037,"about_ca_system_score_gemma":0.00011383563,"threshold_uncertainty_score":0.3591224},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44207108,0.0005948577,0.5106109,0.022477934,0.003998741,0.0003396248,0.000013112819,0.0025380794,0.017355675],"genre_scores_gemma":[0.960389,0.0000063292646,0.03523689,0.0002029106,0.00067393464,0.000009796407,0.00005440487,0.000022040358,0.003404668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983602,0.00017239603,0.00022342923,0.00054674747,0.00028628472,0.00041090895],"domain_scores_gemma":[0.99897933,0.000101660225,0.00012969747,0.00058059406,0.000048260106,0.00016044076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005017774,0.00021785172,0.00018818068,0.00012166743,0.00066493824,0.00024181981,0.0007227446,0.00007958899,0.00014475903],"category_scores_gemma":[0.000298946,0.00017505587,0.000099794925,0.00040581136,0.000063531275,0.0003388436,0.00035523006,0.0017471641,0.00013147823],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046365025,0.0005256082,0.11368561,0.00006384259,0.000094801566,0.00014048778,0.001395297,0.005352559,0.0818256,0.04997005,0.016329098,0.7305707],"study_design_scores_gemma":[0.00088690105,0.00016588956,0.04955398,0.000046666115,0.000016907485,0.0002562029,0.000020318597,0.5471185,0.0048376215,0.0013445355,0.39498758,0.0007649258],"about_ca_topic_score_codex":0.0002018588,"about_ca_topic_score_gemma":0.000028361063,"teacher_disagreement_score":0.72980577,"about_ca_system_score_codex":0.000019064246,"about_ca_system_score_gemma":0.00007214204,"threshold_uncertainty_score":0.75906557},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0134924995,0.000024971147,0.96244353,0.022458518,0.00030030526,0.00006394987,0.000016687081,0.00007752562,0.0011220047],"genre_scores_gemma":[0.7999135,0.000030971787,0.19789957,0.0013444801,0.00062573527,0.0000027814438,0.000012988008,0.0000125677325,0.00015740859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934703,0.00003301306,0.00012372117,0.00015326662,0.00020606072,0.00013691359],"domain_scores_gemma":[0.9992912,0.000092842856,0.000090130794,0.0004050988,0.00007948246,0.000041287498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032954774,0.000069973925,0.00008036599,0.000031546453,0.000112360314,0.000041258263,0.00040859944,0.00001671234,0.000011319662],"category_scores_gemma":[0.00020425128,0.000048026835,0.000017605676,0.0001213084,0.000055758574,0.00007562512,0.000047179725,0.00013155285,0.000017880417],"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.000008444697,0.00006528801,0.000027498128,0.00000686282,0.000009795582,0.0000038615867,0.00061571924,0.013911666,0.00024052804,0.7868009,0.002808747,0.19550066],"study_design_scores_gemma":[0.00076399004,0.0030187934,0.035415385,0.000055533656,0.000020560907,0.000037647696,0.00015835068,0.11348153,0.0072476147,0.8105937,0.028694276,0.00051257235],"about_ca_topic_score_codex":0.00007773897,"about_ca_topic_score_gemma":0.000016085702,"teacher_disagreement_score":0.786421,"about_ca_system_score_codex":0.0000051251322,"about_ca_system_score_gemma":0.000027790866,"threshold_uncertainty_score":0.19584775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048864067,0.000009057368,0.9488403,0.0012447821,0.00020258439,0.00006340913,0.000002020183,0.00014146362,0.00063231104],"genre_scores_gemma":[0.5642509,0.0000010744222,0.4349994,0.0005532196,0.00001631349,0.0000024890364,0.0000011199465,0.000004302551,0.00017117045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907833,0.00006782932,0.00022526472,0.00026007465,0.00016926922,0.0001992447],"domain_scores_gemma":[0.9991782,0.0000451294,0.00006410859,0.00060355326,0.000053357155,0.000055660068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002470572,0.00010406306,0.00016921535,0.00015529453,0.000017282808,0.000026054187,0.0009000998,0.000040642153,0.00009816769],"category_scores_gemma":[0.000020712312,0.00008398409,0.000040246923,0.0002553452,0.000031330426,0.0001644183,0.00025114953,0.00015405468,0.000039552706],"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.000106758904,0.0014913081,0.021663375,0.00021782439,0.00006454193,0.00026777078,0.014861474,0.007524776,0.0011728054,0.11537416,0.014463446,0.82279176],"study_design_scores_gemma":[0.0011938522,0.0004282208,0.10036042,0.000060269915,0.0000030945719,0.0000051035477,0.000015672918,0.8730307,0.015628561,0.007927511,0.001020281,0.00032628828],"about_ca_topic_score_codex":0.0012311891,"about_ca_topic_score_gemma":0.000019794774,"teacher_disagreement_score":0.86550593,"about_ca_system_score_codex":0.000011007534,"about_ca_system_score_gemma":0.00005046371,"threshold_uncertainty_score":0.34247717},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038841356,0.00006234786,0.9591124,0.0009400988,0.00029316894,0.00010834951,0.000025036494,0.0000149593725,0.0006022643],"genre_scores_gemma":[0.6230281,0.000009329313,0.37653613,0.0001626605,0.0000428735,0.0000016114013,0.000019196536,0.000004922074,0.0001951556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850184,0.000032466145,0.00058083446,0.00024322311,0.00044035751,0.0002012662],"domain_scores_gemma":[0.9987433,0.0000669127,0.0004491616,0.0005339155,0.0001090905,0.00009765299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008011863,0.0001241866,0.00038208507,0.00021391879,0.00007776654,0.000009109518,0.0013019112,0.000024612846,0.000054787026],"category_scores_gemma":[0.000011423796,0.00009388346,0.00016709698,0.0004411027,0.000021103868,0.0002849371,0.0001214822,0.0001203951,4.058498e-7],"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.00048654704,0.0017060102,0.22766834,0.0014642458,0.021394376,0.0034488444,0.0041524777,0.39417654,0.00013612043,0.012384157,0.030357156,0.30262518],"study_design_scores_gemma":[0.0006225725,0.00021295999,0.332144,0.000069484,0.0013729834,0.000014172541,0.000111792426,0.65455973,0.000119093835,0.0002045517,0.0103437845,0.00022486495],"about_ca_topic_score_codex":0.005829818,"about_ca_topic_score_gemma":0.015103974,"teacher_disagreement_score":0.58418673,"about_ca_system_score_codex":0.000050721792,"about_ca_system_score_gemma":0.00006764279,"threshold_uncertainty_score":0.881298},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057473388,0.0005878508,0.93850565,0.0016891696,0.00092587434,0.00007490672,0.0000022653985,0.00002869105,0.0007122171],"genre_scores_gemma":[0.87795055,0.000051015122,0.12116872,0.00019634605,0.00047841063,2.0954892e-7,0.0000011722533,0.000012750371,0.00014080343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798506,0.00013813691,0.00079601316,0.00015569753,0.00064069335,0.00028436922],"domain_scores_gemma":[0.9979866,0.0003726587,0.000884219,0.00028411177,0.00037691082,0.00009545673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027692614,0.00015131618,0.00029527495,0.00015803151,0.00016032819,0.00010272183,0.0010164503,0.00004122538,0.000005392057],"category_scores_gemma":[0.00014218995,0.00008823349,0.0001841793,0.00044899888,0.00009831317,0.00043078678,0.00017384072,0.0004446364,0.0000039369634],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035557918,0.000105840176,0.004508806,0.00003762668,0.00018584538,0.000112667396,0.00467793,0.00995958,0.001468498,0.0051602507,0.0006574731,0.97308993],"study_design_scores_gemma":[0.0017508036,0.0008641216,0.06571546,0.00018780648,0.000054601885,0.0007629981,0.0004290193,0.9093999,0.007429516,0.0081228865,0.0048765033,0.00040638258],"about_ca_topic_score_codex":0.00007980058,"about_ca_topic_score_gemma":0.000010158294,"teacher_disagreement_score":0.97268355,"about_ca_system_score_codex":0.00003214787,"about_ca_system_score_gemma":0.00007693543,"threshold_uncertainty_score":0.35980573},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6726605,0.00020173828,0.3265896,0.00021404559,0.000017669618,0.000071992145,0.0000053886565,0.000027989227,0.00021102458],"genre_scores_gemma":[0.9968328,0.000005153913,0.0029984198,0.0000977705,0.000016195649,0.000008045815,0.000003411779,0.000004462067,0.000033759294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992892,0.00018284375,0.00015937634,0.00016766433,0.000095538,0.00010536129],"domain_scores_gemma":[0.9995524,0.00016422755,0.00005328045,0.00016484012,0.000031104413,0.000034100703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028582528,0.00006961968,0.00009849058,0.00009434093,0.00007745037,0.000031429678,0.00015344711,0.00003361122,0.000032833257],"category_scores_gemma":[0.00011247717,0.00006816137,0.000023161196,0.0003025316,0.00003777283,0.00017572872,0.000048477497,0.00007723547,0.0000017744787],"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.000017729048,0.00037366856,0.051470242,0.00006951831,0.000029405555,0.0000151230515,0.0073356,0.18986298,0.0034431894,0.46039003,0.0000035604107,0.28698894],"study_design_scores_gemma":[0.0006951415,0.000052363877,0.031164745,0.000049781098,0.000009080887,0.000008755767,0.000044484226,0.87744766,0.021418286,0.0686339,0.00025693583,0.00021884812],"about_ca_topic_score_codex":0.0000073918413,"about_ca_topic_score_gemma":0.000006079706,"teacher_disagreement_score":0.6875847,"about_ca_system_score_codex":0.000006219094,"about_ca_system_score_gemma":0.00001914196,"threshold_uncertainty_score":0.27795398},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025919171,0.0001933256,0.9729735,0.00012950985,0.00035226336,0.00016036344,0.0000022223671,0.00026254985,0.0000070634937],"genre_scores_gemma":[0.32281095,0.0000013824477,0.67696005,0.000031409905,0.0001230071,0.000053740056,0.0000027867516,0.00001483501,0.0000018580694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887997,0.000008983265,0.00025261857,0.00034232612,0.00017494279,0.00034114756],"domain_scores_gemma":[0.99933624,0.00021994565,0.000059781676,0.00022158235,0.00003361452,0.00012885428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014508788,0.00019027574,0.00026065385,0.000082807164,0.000039610484,0.00005473517,0.0005841819,0.00006697292,0.0000017329666],"category_scores_gemma":[0.000048618927,0.00019920645,0.00013262466,0.00019907943,0.000025350426,0.00016002815,0.00015918985,0.00015873536,0.0000017129648],"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.0000037322725,0.000092300885,0.0000016525031,0.000028975672,0.000034891207,0.000009691507,0.0017374145,0.8892576,0.037177585,0.0013702161,0.000068533904,0.07021741],"study_design_scores_gemma":[0.00060908025,0.0000970061,0.000003209354,0.0000649437,0.000003532391,0.000017408784,0.000012809552,0.72142816,0.27735206,0.000051137606,0.00019253137,0.00016813354],"about_ca_topic_score_codex":0.000005723805,"about_ca_topic_score_gemma":4.813863e-9,"teacher_disagreement_score":0.29689178,"about_ca_system_score_codex":0.00006551264,"about_ca_system_score_gemma":0.00003559336,"threshold_uncertainty_score":0.8123403},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17655529,0.000054228647,0.82041836,0.0005272188,0.001103581,0.000035366476,0.00000689421,0.000011103997,0.0012879558],"genre_scores_gemma":[0.9913437,0.000054862423,0.008191471,0.0002092907,0.00017448192,0.0000011292348,0.0000020940315,0.000004850563,0.000018152205],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872553,0.00009282998,0.000539555,0.00013360471,0.00037431903,0.00013412967],"domain_scores_gemma":[0.9987473,0.00016445735,0.0004097085,0.000079696736,0.0005178736,0.000080950354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049599423,0.00009381568,0.00014306772,0.00021366056,0.000046141125,0.00011106744,0.00036898532,0.000041180523,0.00013558347],"category_scores_gemma":[0.00031285238,0.00008159649,0.00009271087,0.00010715002,0.000055411558,0.00050254667,0.00005218869,0.00020522915,0.000032014832],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018647994,0.00012682211,0.0013227505,0.000006605118,0.000043095177,0.00004631259,0.0004623629,0.00008247308,0.0017400788,0.008293249,0.00001269092,0.9878449],"study_design_scores_gemma":[0.00073810096,0.00094103214,0.005302358,0.00064526283,0.000042708773,0.0019593458,0.0012592628,0.14201082,0.4389369,0.40412793,0.003336396,0.00069990277],"about_ca_topic_score_codex":0.000019237952,"about_ca_topic_score_gemma":0.00001018493,"teacher_disagreement_score":0.987145,"about_ca_system_score_codex":0.000017276216,"about_ca_system_score_gemma":0.00005080995,"threshold_uncertainty_score":0.33274084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012594652,0.000048997917,0.9784288,0.004231823,0.0007907918,0.00027876,0.000028271883,0.0005692174,0.0030286957],"genre_scores_gemma":[0.6134838,0.00001452421,0.37665713,0.0006623809,0.0012460275,0.00008852789,0.00026770998,0.000037687932,0.007542244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829507,0.00009443132,0.00018993109,0.00081479363,0.00024280365,0.00036299895],"domain_scores_gemma":[0.9977567,0.00049868866,0.00009173377,0.0014522998,0.000058368405,0.00014219935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008040558,0.00016073736,0.00020771463,0.00006147183,0.00027410695,0.00027270167,0.0017398581,0.00009891069,0.000158808],"category_scores_gemma":[0.0006617851,0.00013544122,0.000051860305,0.0001932832,0.000053410186,0.000704712,0.00087140786,0.0006678847,0.00006562712],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077800294,0.00043681118,0.031894315,0.00006934934,0.00020797299,0.000019559462,0.0047029355,0.0028017566,0.0027613519,0.04765839,0.029285198,0.8800846],"study_design_scores_gemma":[0.00033217567,0.00013179643,0.0019435141,0.0000062035188,0.000008059472,0.000003597234,0.000035859386,0.7953371,0.00018005224,0.009967968,0.1918892,0.00016450454],"about_ca_topic_score_codex":0.0006728302,"about_ca_topic_score_gemma":0.00011574903,"teacher_disagreement_score":0.87992007,"about_ca_system_score_codex":0.000012258748,"about_ca_system_score_gemma":0.00008219512,"threshold_uncertainty_score":0.55231327},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005058522,0.0000539527,0.9616119,0.0009090465,0.00036204857,0.000025510879,0.0000020629752,0.00019252753,0.031784423],"genre_scores_gemma":[0.8820472,0.0000015124286,0.116034925,0.00036006139,0.00014382231,4.7714434e-7,0.0000074209556,0.0000031630125,0.0014014625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937695,0.0000314005,0.000063349726,0.0001784081,0.000120584526,0.00022930981],"domain_scores_gemma":[0.99911,0.000059677684,0.000022406142,0.0007063946,0.000010037298,0.00009148394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002782113,0.000056691326,0.000056174482,0.000025905987,0.0000638829,0.00007503736,0.0008400317,0.00002052932,0.00017450865],"category_scores_gemma":[0.00002167735,0.000046669014,0.000011369892,0.000093614595,0.00003184233,0.00057981873,0.0005263815,0.00009355445,0.00024622062],"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":[1.6990491e-7,0.000056886973,0.0043909787,0.0000022397078,0.000010105561,0.0000017645115,0.00014950623,0.00003909616,0.000044115575,0.17856123,0.0026463408,0.8140976],"study_design_scores_gemma":[0.0005484979,0.000039526283,0.07735499,0.000024095702,0.000011414386,0.00014699332,0.00031997592,0.8658301,0.00044835723,0.0026414797,0.05204592,0.0005886208],"about_ca_topic_score_codex":0.00003918536,"about_ca_topic_score_gemma":0.0000015402339,"teacher_disagreement_score":0.87698865,"about_ca_system_score_codex":0.0000059100075,"about_ca_system_score_gemma":0.000019293348,"threshold_uncertainty_score":0.31647503},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046170812,0.000018786744,0.9496218,0.0008919524,0.00043027796,0.000060282735,2.9083628e-7,0.00009348131,0.0027123326],"genre_scores_gemma":[0.94311917,0.0000025346296,0.056599796,0.00015545213,0.00008894064,0.0000022234715,3.2636473e-7,0.000003385845,0.000028158127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841404,0.0002065028,0.00021148787,0.0004574651,0.00040916787,0.0003013159],"domain_scores_gemma":[0.99883103,0.0003701833,0.000088121764,0.00035643182,0.00015783109,0.0001963885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014404117,0.000109574525,0.0001797668,0.0001108184,0.00035099188,0.00018193269,0.0006744471,0.000029200566,0.000020472784],"category_scores_gemma":[0.00026441636,0.00008905614,0.000041022573,0.0004144115,0.002167797,0.00019919191,0.0005786516,0.00022341273,0.00002144765],"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.0000026898358,0.000019175204,0.00029023946,0.0000048116553,0.0000027341553,0.0000010953199,0.00035700112,0.00061085826,0.00020924148,0.9323129,0.000012252274,0.06617699],"study_design_scores_gemma":[0.00020937077,0.00046301313,0.0017588561,0.000027874135,0.0000057668676,0.00003822975,0.000015460388,0.9610066,0.0014196103,0.03409749,0.000823311,0.00013445337],"about_ca_topic_score_codex":0.000007954593,"about_ca_topic_score_gemma":1.5802323e-7,"teacher_disagreement_score":0.9603957,"about_ca_system_score_codex":0.000012447335,"about_ca_system_score_gemma":0.00004905195,"threshold_uncertainty_score":0.79873383},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037505516,0.00041251737,0.9934653,0.0015494769,0.0011679407,0.0005325186,0.00001376619,0.00017457677,0.0023088336],"genre_scores_gemma":[0.5040102,0.000037356855,0.49242726,0.0017636005,0.00050884153,0.000020161131,0.000012292176,0.0000813448,0.0011389678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949446,0.00010168444,0.0007873177,0.0019202778,0.0014469327,0.00079922134],"domain_scores_gemma":[0.99625593,0.000559077,0.0005908557,0.0019064663,0.00042057037,0.00026711042],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016204354,0.00067888387,0.0008763646,0.00051256997,0.00028449082,0.00037193258,0.004105008,0.0006080722,0.00003845883],"category_scores_gemma":[0.0001412959,0.00058798783,0.00024066014,0.00061197544,0.0016776823,0.00042919055,0.0012634508,0.0024439574,0.00002451219],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014417236,0.00014212947,0.00018589797,0.00012732828,0.000043464246,0.0000303813,0.0024894632,0.028755855,0.003672459,0.010173857,0.0001715787,0.9541932],"study_design_scores_gemma":[0.0011309527,0.0007156905,0.00019136051,0.0008970592,0.000028046414,0.000113605245,0.0000011131372,0.7199679,0.016592324,0.24408893,0.014441708,0.0018312882],"about_ca_topic_score_codex":0.00014903767,"about_ca_topic_score_gemma":0.0000942619,"teacher_disagreement_score":0.9523619,"about_ca_system_score_codex":0.00022878875,"about_ca_system_score_gemma":0.0010061752,"threshold_uncertainty_score":0.9998574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03314249,0.000018707175,0.9645675,0.0003340531,0.00010312431,0.00006214593,0.0000011338012,0.00019015909,0.001580715],"genre_scores_gemma":[0.8199931,3.8550868e-7,0.17750023,0.00013092831,0.000089334,0.0000035580283,0.0000013349346,0.0000041120984,0.002277017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995358,0.0000051936076,0.00008148302,0.00013262968,0.00008178485,0.00016310056],"domain_scores_gemma":[0.99961907,0.00015242433,0.000029744706,0.000101906626,0.00005965952,0.000037193207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023998947,0.000052607524,0.000055464,0.000038392223,0.000104742154,0.000049645296,0.00012400918,0.000021313093,0.0000018137507],"category_scores_gemma":[0.00006400814,0.00004861458,0.000029078514,0.00007451917,0.00001327715,0.000077546756,0.000027617432,0.000062247826,0.000010222105],"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.000037816866,0.00049659546,0.051423665,0.00011084547,0.00006307776,0.000015875856,0.0035839158,0.17392784,0.010167706,0.33959782,0.018818071,0.40175676],"study_design_scores_gemma":[0.00013226498,0.00008238418,0.0018635957,0.000003722209,0.0000024222984,0.000011938166,0.000013880909,0.99464345,0.00074194523,0.0011470929,0.001290882,0.00006642053],"about_ca_topic_score_codex":0.000030262217,"about_ca_topic_score_gemma":0.000031779342,"teacher_disagreement_score":0.8207156,"about_ca_system_score_codex":0.000022418286,"about_ca_system_score_gemma":0.00003165006,"threshold_uncertainty_score":0.19824451},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031795225,0.0008135486,0.4037102,0.00010136247,0.00091304886,0.0004523674,0.00008705632,0.00026133418,0.5936293],"genre_scores_gemma":[0.00028544455,0.000031436666,0.010431233,0.00024872978,0.0015111088,0.00006221468,0.000016985516,0.00005979495,0.987353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983269,0.000055827397,0.0003094821,0.00055603625,0.0003370974,0.0004146319],"domain_scores_gemma":[0.99803895,0.00031035818,0.0003042498,0.0011279773,0.0001110516,0.000107420805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057587324,0.00037123545,0.00031133805,0.00009613223,0.0006116894,0.00032669306,0.0012419352,0.00023127972,0.00002359735],"category_scores_gemma":[0.000026470345,0.00026180223,0.00030953292,0.000009146101,0.00017917529,0.00005596871,0.0003633801,0.00075107836,0.000051651623],"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.000024877527,0.000011786538,0.0000030061087,0.000037693673,0.00024782913,0.000017281365,0.0006367408,0.00017469111,0.0000061437954,0.7270735,0.008255498,0.263511],"study_design_scores_gemma":[0.00029234347,0.000104294675,0.000010676501,0.000049768816,0.00012108493,0.000031103184,0.0000015118175,0.01592552,0.00005878801,0.05545582,0.9275905,0.0003585928],"about_ca_topic_score_codex":0.0003656928,"about_ca_topic_score_gemma":0.00005364209,"teacher_disagreement_score":0.919335,"about_ca_system_score_codex":0.000033965618,"about_ca_system_score_gemma":0.000066320135,"threshold_uncertainty_score":0.99998343},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07573863,0.00007341196,0.9100695,0.0004123003,0.0004620466,0.00010701932,0.0000012108071,0.00036443587,0.012771426],"genre_scores_gemma":[0.9938671,0.000009476859,0.00386275,0.000096193064,0.00012233427,3.249171e-7,0.000005516095,0.000007031722,0.0020292827],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906284,0.00009109895,0.00008547298,0.00023645644,0.00018806514,0.00033604744],"domain_scores_gemma":[0.99938345,0.00003152977,0.00007020068,0.00030873824,0.00004503008,0.00016103289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016361296,0.00012080156,0.000101498255,0.00029015433,0.0002200966,0.000051912848,0.0005375196,0.00006229185,0.000032483335],"category_scores_gemma":[0.000011583667,0.00012812162,0.000071794304,0.000818868,0.000035707882,0.001017336,0.0001446107,0.00019839808,0.00012092196],"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.000013314309,0.00020179109,0.8763844,0.0000387578,0.0000556266,0.000070031725,0.00015157314,0.0007841529,0.0000916902,0.040229123,0.0054558762,0.07652368],"study_design_scores_gemma":[0.0020850492,0.00025890657,0.035580643,0.00008620279,0.00008197913,1.637374e-7,0.003132749,0.13067424,0.006062844,0.0019746914,0.8185568,0.0015057649],"about_ca_topic_score_codex":0.0000824329,"about_ca_topic_score_gemma":0.00023008461,"teacher_disagreement_score":0.9181285,"about_ca_system_score_codex":0.00004518533,"about_ca_system_score_gemma":0.000024193203,"threshold_uncertainty_score":0.5224648},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011494883,0.000064892556,0.99102205,0.0012167053,0.00015547556,0.00022065379,0.0000016578904,0.00045662437,0.0057124295],"genre_scores_gemma":[0.01370346,0.0000033386982,0.9727112,0.00062875537,0.00014269826,0.000057222358,0.0000090431495,0.000013671722,0.01273063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989678,0.000038913866,0.00016260154,0.0003542923,0.00017269352,0.00030369704],"domain_scores_gemma":[0.9994098,0.00010248552,0.000047135094,0.00031029322,0.000040271138,0.000090035464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027835026,0.00012243185,0.0001172102,0.000058461486,0.00022802726,0.00012791132,0.00042896872,0.000039843428,0.00013510701],"category_scores_gemma":[0.000022057033,0.000088544686,0.00007568939,0.00021354729,0.000016473803,0.00016455697,0.00003371323,0.000107376945,0.00005886533],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001163604,0.00003494683,0.000046533205,0.000009063201,0.0000025691863,0.000002336614,0.00008786259,0.0009404657,0.000034844776,0.000727249,0.001002474,0.9971105],"study_design_scores_gemma":[0.00047619105,0.00012606439,0.0001018453,0.00004903501,0.0000020512828,0.000006886783,0.0000034420682,0.95079666,0.0003704362,0.0008212736,0.047107425,0.00013869427],"about_ca_topic_score_codex":0.000057782738,"about_ca_topic_score_gemma":0.000001939119,"teacher_disagreement_score":0.9969718,"about_ca_system_score_codex":0.000014908811,"about_ca_system_score_gemma":0.000032341115,"threshold_uncertainty_score":0.36107475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022535691,0.0000064581563,0.9900933,0.002041268,0.00060963293,0.00010968323,0.000038092778,0.000074616466,0.006801603],"genre_scores_gemma":[0.86625636,0.000026859925,0.13218294,0.00034497277,0.00022017703,0.000014569302,0.00002727015,0.000009764636,0.0009170908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998777,0.00016003143,0.0002548973,0.0003678689,0.00024131511,0.00019891352],"domain_scores_gemma":[0.9985589,0.0008491662,0.00009717409,0.00014756634,0.00026149256,0.00008569567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000617075,0.00014676459,0.00014172282,0.0001081206,0.00018967946,0.00029853295,0.00045782398,0.00005124329,0.00011936735],"category_scores_gemma":[0.00079329615,0.00013511714,0.00003784299,0.00007547474,0.00011913906,0.00013474925,0.00004254268,0.00022090673,0.000046252255],"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.000035336685,0.000025805359,0.0000075800963,0.0000030349347,0.000010789006,0.000001139403,0.00053580856,0.00033078244,0.000086198284,0.605359,0.00004716298,0.39355734],"study_design_scores_gemma":[0.000026179525,0.00025252695,0.000027432003,0.0000114442,0.0000034858372,0.0000035508451,0.00016706249,0.51465577,0.00060646684,0.48222008,0.0019180136,0.000107988795],"about_ca_topic_score_codex":0.000016390271,"about_ca_topic_score_gemma":0.000017859167,"teacher_disagreement_score":0.866031,"about_ca_system_score_codex":0.000016915945,"about_ca_system_score_gemma":0.000039752435,"threshold_uncertainty_score":0.55099165},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042091344,0.000028031041,0.9455636,0.0005318866,0.0009784707,0.00006128544,9.238091e-8,0.00045989215,0.010285407],"genre_scores_gemma":[0.7945136,0.0000018256491,0.20475817,0.00029805666,0.00037079127,0.0000023921186,2.165248e-7,0.0000066894804,0.00004829321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765325,0.00016528131,0.00018598381,0.00045876548,0.000653387,0.0008833135],"domain_scores_gemma":[0.99871933,0.00018915437,0.00006203153,0.0005100912,0.00008759024,0.0004318056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025643136,0.00016254977,0.00017000645,0.00015861634,0.0007037515,0.0004418995,0.0018005258,0.000037935963,0.00004951626],"category_scores_gemma":[0.00017012256,0.00012950222,0.000053158783,0.0009187039,0.0011236465,0.001074446,0.001067949,0.00042729513,0.00027680042],"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.0000011166271,0.000028528202,0.003433078,0.0000029506164,0.0000017107681,0.0000018555505,0.000825167,0.00020065636,0.0003334213,0.9160741,0.000012262664,0.079085164],"study_design_scores_gemma":[0.00014802201,0.00013963191,0.0050271326,0.000021103464,0.0000028643144,0.00008037903,0.000009595287,0.97970504,0.0016335837,0.011952873,0.0010153743,0.0002644078],"about_ca_topic_score_codex":0.0000028820796,"about_ca_topic_score_gemma":2.7904738e-8,"teacher_disagreement_score":0.97950435,"about_ca_system_score_codex":0.000040307707,"about_ca_system_score_gemma":0.00005047908,"threshold_uncertainty_score":0.54127586},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045520246,0.000025496734,0.89450276,0.0037173636,0.000055501747,0.000049270515,7.3795334e-8,0.00059571763,0.05553355],"genre_scores_gemma":[0.7769491,0.0000047152344,0.21093714,0.0007804195,0.00006567907,0.000002293886,0.0000012047589,0.0000041153266,0.011255306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993951,0.000051591844,0.000060062564,0.00019648169,0.00013615661,0.00016063174],"domain_scores_gemma":[0.99970144,0.0000210525,0.000033352804,0.0001639091,0.000031034244,0.000049231603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000727749,0.000081169805,0.00008825507,0.000039239236,0.00012979744,0.00010720918,0.00023843569,0.000019263656,0.000043370255],"category_scores_gemma":[0.000015640726,0.00005422963,0.000021118321,0.00018144128,0.000014669529,0.00025187957,0.00003092614,0.00016071586,0.000031514926],"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.000024215327,0.000046035326,0.00090777274,0.0000021000392,0.000017161381,0.000033933797,0.0016905636,0.004939497,0.000717698,0.21661581,0.00053239835,0.77447283],"study_design_scores_gemma":[0.002662669,0.0027970914,0.050459146,0.00004728936,0.000014039062,0.00018574552,0.00033599,0.77682734,0.017008556,0.010554659,0.13792248,0.0011850017],"about_ca_topic_score_codex":0.000052380285,"about_ca_topic_score_gemma":0.0000035785433,"teacher_disagreement_score":0.77328783,"about_ca_system_score_codex":0.000008640021,"about_ca_system_score_gemma":0.000022439575,"threshold_uncertainty_score":0.22114201},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030017924,0.00015184702,0.99416345,0.0001957214,0.0009562696,0.00059273985,0.0000012166503,0.0002850776,0.0006518879],"genre_scores_gemma":[0.9841264,7.901112e-7,0.014898874,0.0002734519,0.00016764703,0.00025141588,0.000014146771,0.000007026277,0.00026023888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867916,0.00021515894,0.0004749293,0.00014742339,0.00026498744,0.00021835817],"domain_scores_gemma":[0.9990907,0.00022423545,0.00033887394,0.00018108483,0.00010756589,0.000057550948],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011335941,0.00014652719,0.00028753417,0.00013021627,0.0002884091,0.0015278851,0.00035009562,0.000049520768,6.809835e-7],"category_scores_gemma":[0.0001608859,0.000109412795,0.00008746795,0.00017576273,0.00003969524,0.004650958,0.000044095093,0.000093104776,0.000012771556],"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.008211287,0.00019743113,0.00008838334,0.0021340628,0.00011460194,0.000002181797,0.023754336,0.41526842,0.0017701003,0.25753936,0.008103143,0.28281668],"study_design_scores_gemma":[0.01689305,0.00007452255,0.0000034983084,0.000047401576,0.0000045823726,0.000019792902,0.00008652284,0.97988075,0.0008195714,0.00027338986,0.0017466487,0.00015024863],"about_ca_topic_score_codex":0.000028830042,"about_ca_topic_score_gemma":7.432349e-8,"teacher_disagreement_score":0.98112464,"about_ca_system_score_codex":0.000021688053,"about_ca_system_score_gemma":0.000037206057,"threshold_uncertainty_score":0.9995086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001597951,0.000264157,0.99428695,0.00081441604,0.001340123,0.00043829466,0.000004354895,0.00022608049,0.0026096138],"genre_scores_gemma":[0.04365973,0.0000626628,0.95372796,0.00080661033,0.0009318292,0.000028455886,0.000011707745,0.000039448725,0.00073159987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969421,0.00002500024,0.0003904582,0.0014679601,0.0006193801,0.0005550825],"domain_scores_gemma":[0.9976751,0.0006752942,0.0002869774,0.00091030565,0.00032894468,0.00012338645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006444544,0.0003988088,0.00039946949,0.0006316112,0.00047195167,0.0003269762,0.002194236,0.0002616772,0.000004222409],"category_scores_gemma":[0.0001757804,0.00037328256,0.00014188419,0.0004944359,0.0003401912,0.0003652441,0.00044124256,0.00076973805,0.000024348836],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042252727,0.000018121764,0.000031443775,0.000026698961,0.000008761932,0.0000072192943,0.0007818831,0.021103406,0.00014670029,0.0125850625,0.00007822453,0.96520823],"study_design_scores_gemma":[0.00021377066,0.00016598347,0.00030234415,0.00014170876,0.000003935675,0.000053718537,7.2828925e-8,0.9297732,0.00034314548,0.060425162,0.008084892,0.0004920604],"about_ca_topic_score_codex":0.000013276839,"about_ca_topic_score_gemma":0.0000119436145,"teacher_disagreement_score":0.9647162,"about_ca_system_score_codex":0.00026697977,"about_ca_system_score_gemma":0.0005242587,"threshold_uncertainty_score":0.9998719},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07796544,0.000048935406,0.8728766,0.0012973903,0.0007231236,0.000047535705,0.000002574193,0.00052343897,0.04651496],"genre_scores_gemma":[0.90038145,0.00000125322,0.0929179,0.00024489916,0.00046800097,0.0000027462595,0.000022918168,0.000005594464,0.0059552626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999313,0.000036844336,0.000104853556,0.00023025862,0.00014990203,0.00016515762],"domain_scores_gemma":[0.99960846,0.000022350554,0.00004577072,0.00026495883,0.000023509392,0.000034934874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012468299,0.00007175196,0.00007104442,0.000042029424,0.000093946896,0.000108831046,0.0002755255,0.00003965499,0.00006384678],"category_scores_gemma":[0.0000072579364,0.000059508537,0.00003197057,0.00018197026,0.000009338016,0.0002016875,0.000087639324,0.00012547678,0.0002640811],"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.0000026590442,0.0002108439,0.026530014,0.0000035814512,0.000012803525,0.000033265,0.00016511077,0.00037043085,0.0012652214,0.77156705,0.03019942,0.1696396],"study_design_scores_gemma":[0.0011379645,0.00011569182,0.18237315,0.000013555589,0.000008764058,0.000023394077,0.000043197866,0.22129855,0.0023016885,0.38473293,0.20733495,0.00061615574],"about_ca_topic_score_codex":0.0027165364,"about_ca_topic_score_gemma":0.00005199712,"teacher_disagreement_score":0.822416,"about_ca_system_score_codex":0.0000107157675,"about_ca_system_score_gemma":0.000013207068,"threshold_uncertainty_score":0.41066083},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014026817,0.00013457895,0.9836524,0.00079759496,0.00012340516,0.00052942673,0.000024314186,0.00041523404,0.00029619125],"genre_scores_gemma":[0.5448844,0.00011146133,0.45475304,0.000047171976,0.000033346765,0.000043433123,0.00004870262,0.000014771108,0.00006366827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981438,0.00013539613,0.0006297099,0.00047232793,0.00026539664,0.00035335618],"domain_scores_gemma":[0.9955443,0.001606206,0.00029919948,0.0020551847,0.000292624,0.00020248634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006666236,0.00024168562,0.00026443758,0.00036989027,0.00093330164,0.00006389017,0.001531645,0.00014607716,0.000017158098],"category_scores_gemma":[0.00006639508,0.00025287614,0.00010525669,0.001368339,0.0002655904,0.00019470174,0.00013110063,0.0006915043,0.000029683926],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011379782,0.0006913596,0.0010283379,0.000014181219,0.00006433921,4.291874e-7,0.0011254435,0.0036318607,0.0017521288,0.002145126,0.00002647442,0.9895089],"study_design_scores_gemma":[0.00075654645,0.00013698987,0.0048865657,0.000047533755,0.00004295098,0.000024897874,0.00023666646,0.9844702,0.0024433006,0.0001584977,0.006514977,0.0002808957],"about_ca_topic_score_codex":0.00020536657,"about_ca_topic_score_gemma":0.00005585847,"teacher_disagreement_score":0.98922807,"about_ca_system_score_codex":0.000055893288,"about_ca_system_score_gemma":0.00006642134,"threshold_uncertainty_score":0.9999924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039707128,0.00006798962,0.86122507,0.0055356645,0.00018006576,0.000056886725,2.0195269e-7,0.00039733324,0.09282965],"genre_scores_gemma":[0.68531764,1.4640247e-7,0.31084648,0.00028863942,0.00012744011,0.0000017759345,0.0000014680302,0.0000027113078,0.0034136996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999564,0.000028664826,0.000051172512,0.00014642639,0.000089595385,0.00012012451],"domain_scores_gemma":[0.9997762,0.000049707924,0.00001854348,0.0001262625,0.000014840142,0.0000144362675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013582832,0.00004644825,0.000045307304,0.00005196278,0.000039204555,0.00007003909,0.0001785986,0.000025476591,0.0000061090527],"category_scores_gemma":[0.00001789091,0.000038598766,0.000012261996,0.00032715275,0.0000047328112,0.00013060826,0.000050541057,0.00010383893,0.000031233118],"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.0000016805632,0.0001315199,0.087635666,0.000018056502,0.0000026021778,0.00011024173,0.00018212321,0.03899749,0.0032277056,0.6612276,0.013180065,0.19528526],"study_design_scores_gemma":[0.0001501069,0.000022110942,0.13528402,0.000014084846,3.9852642e-7,0.000017369659,0.0000029012654,0.8498837,0.00034524334,0.012572598,0.0016169735,0.00009050382],"about_ca_topic_score_codex":0.0004317685,"about_ca_topic_score_gemma":0.000010491455,"teacher_disagreement_score":0.8108862,"about_ca_system_score_codex":0.000012223693,"about_ca_system_score_gemma":0.000010170935,"threshold_uncertainty_score":0.1574012},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089985644,0.00060135126,0.90723044,0.008316732,0.00043091,0.000033914763,1.5934486e-7,0.00022663595,0.082259975],"genre_scores_gemma":[0.7978556,0.00015119831,0.12980498,0.0013152817,0.00018077178,0.0000044667395,3.6729784e-7,0.00000817087,0.07067914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945754,0.000028227802,0.00008183198,0.00013747874,0.000161462,0.00013346689],"domain_scores_gemma":[0.9993293,0.00020980905,0.000019339906,0.00038314442,0.00001601369,0.000042387353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019192602,0.00005127591,0.000040095052,0.000017546952,0.00029629472,0.00022237483,0.00065425085,0.000013977648,0.0002179478],"category_scores_gemma":[0.00006471164,0.000026299262,0.000029781386,0.00015522554,0.000016544593,0.000091529015,0.00014811836,0.00010449432,0.000471473],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.0606114e-7,0.000010715812,0.000214862,2.6328817e-7,0.0000014455687,0.0000031992065,0.000052689433,0.000036749836,0.0000052383125,0.035906084,0.01645062,0.94731784],"study_design_scores_gemma":[0.000066716915,0.00001810994,0.00042033143,0.0000015996623,3.24586e-7,0.000009968405,0.0000015635438,0.7369599,0.000024450075,0.0020415864,0.2604142,0.000041256844],"about_ca_topic_score_codex":0.000050043196,"about_ca_topic_score_gemma":0.000016986487,"teacher_disagreement_score":0.9472766,"about_ca_system_score_codex":0.0000051323073,"about_ca_system_score_gemma":0.0000019884633,"threshold_uncertainty_score":0.6059989},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09621354,0.000054925644,0.871683,0.007261166,0.00016968478,0.000109879606,5.092291e-7,0.0010164771,0.023490792],"genre_scores_gemma":[0.77280563,0.0000033365914,0.21979047,0.0015704968,0.00014661974,0.000003441157,0.0000043944547,0.0000068295603,0.0056687845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875313,0.00009189449,0.00016023233,0.00041668798,0.00023798933,0.00034009354],"domain_scores_gemma":[0.9994144,0.00007753113,0.000042285552,0.0002560936,0.000049004895,0.00016072717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019696046,0.00014028866,0.00015899354,0.000095229705,0.00017118173,0.0002538084,0.0005076451,0.00003489877,0.00016977896],"category_scores_gemma":[0.000084451654,0.00012160205,0.00004223953,0.00053441565,0.0000066684293,0.00016949122,0.0000892901,0.00027954538,0.00033782743],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052445357,0.00004739423,0.0006733011,0.0000013965912,0.000014911546,0.000030755215,0.00622041,0.0043629818,0.005819997,0.0010618013,0.003738708,0.9780231],"study_design_scores_gemma":[0.0018607994,0.001946983,0.14075787,0.00012385423,0.000018639552,0.000039563016,0.0010055541,0.77396905,0.013190659,0.0031551295,0.062571116,0.001360792],"about_ca_topic_score_codex":0.00018007393,"about_ca_topic_score_gemma":0.0000041363382,"teacher_disagreement_score":0.9766623,"about_ca_system_score_codex":0.000023195607,"about_ca_system_score_gemma":0.00003852966,"threshold_uncertainty_score":0.49587876},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047716657,0.000013041652,0.9809609,0.009301811,0.00008334489,0.000042414933,2.369421e-7,0.000103855295,0.004722727],"genre_scores_gemma":[0.45346618,0.0000046363057,0.54415387,0.0012267582,0.000046305544,7.8192573e-7,0.000012885723,0.000001757904,0.0010867938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996168,0.000032639648,0.00006410224,0.0001345587,0.000074827076,0.00007704212],"domain_scores_gemma":[0.99979466,0.000026892632,0.000027344135,0.00010216572,0.000029769633,0.000019148581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000062481944,0.00004717742,0.00004943728,0.00008889581,0.000021234346,0.00005111577,0.00015152353,0.00002484421,0.000015320524],"category_scores_gemma":[0.00004110227,0.000039393384,0.000013136964,0.00027270234,0.0000025846405,0.0003131604,0.000016565056,0.00012719772,0.000009135133],"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.000005400533,0.00021532513,0.00028104713,0.0000015165595,0.000002290555,0.000008693967,0.0012992937,0.4113104,0.00012564939,0.011236842,0.001054721,0.5744588],"study_design_scores_gemma":[0.000143336,0.000057353718,0.014648347,0.000008562332,3.4596792e-7,0.0000028234272,0.000026464828,0.98395437,0.00006123196,0.00073499756,0.0003101232,0.000052041032],"about_ca_topic_score_codex":0.000021243406,"about_ca_topic_score_gemma":0.000009165877,"teacher_disagreement_score":0.57440674,"about_ca_system_score_codex":0.000018060275,"about_ca_system_score_gemma":0.00000923034,"threshold_uncertainty_score":0.16064157},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094516344,0.000032883116,0.8849212,0.0006133333,0.00029831997,0.0000667124,3.3076915e-7,0.00026981375,0.019281054],"genre_scores_gemma":[0.8233021,0.0000073876104,0.17616142,0.00023571041,0.00011073819,0.0000017454089,3.84712e-7,0.000006545154,0.00017394884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756193,0.00018612479,0.00030545043,0.0006292814,0.00076385617,0.00055333955],"domain_scores_gemma":[0.9986666,0.00022996793,0.00007385257,0.00068032986,0.00011857398,0.00023071597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016060754,0.00017081652,0.000239592,0.0001604612,0.00043142514,0.0003096197,0.0023463035,0.000048030364,0.00036375213],"category_scores_gemma":[0.0000860359,0.00013999855,0.00008442554,0.001233509,0.0021863952,0.00051256886,0.00049641787,0.00038297698,0.00016900674],"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.0000033175322,0.00003375957,0.00016153997,0.000004665553,0.000002098883,0.000006094198,0.00031136785,0.0014382516,0.00011280748,0.67289054,0.000013535794,0.325022],"study_design_scores_gemma":[0.00017761027,0.00030011198,0.0014904594,0.000032545555,0.000002726381,0.000044940745,0.0000029170262,0.9042738,0.001446292,0.09064934,0.0013740185,0.00020523263],"about_ca_topic_score_codex":0.000014624473,"about_ca_topic_score_gemma":1.3925644e-7,"teacher_disagreement_score":0.90283555,"about_ca_system_score_codex":0.000028389079,"about_ca_system_score_gemma":0.00012684826,"threshold_uncertainty_score":0.8055864},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5872807,0.00036488366,0.22584279,0.014160382,0.0022065013,0.00026316274,0.000002473473,0.0018479119,0.1680312],"genre_scores_gemma":[0.726635,0.00008602018,0.23174208,0.0012611422,0.0005659762,0.0000127019675,0.0000031984819,0.000020591058,0.03967332],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999175,0.000049873495,0.000121479134,0.00028335128,0.00014525451,0.00022505618],"domain_scores_gemma":[0.99897176,0.00010279351,0.000029265051,0.0008043212,0.0000151350305,0.00007670466],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015247548,0.00009424842,0.00010075266,0.00004037277,0.00009885225,0.00009605048,0.0011493164,0.000041270807,0.0010449879],"category_scores_gemma":[0.00006729605,0.00008052059,0.00005641572,0.00020579276,0.000014439763,0.00023458673,0.0001086314,0.00019028303,0.0012209893],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018303455,0.00002219204,0.00081648683,0.0000016313224,0.0000042080105,0.000013720786,0.00009363781,0.00005610891,0.00004851586,0.00053781085,0.0031812005,0.9952226],"study_design_scores_gemma":[0.00040376722,0.00021909576,0.011263884,0.000020306117,0.000004797553,0.000061003546,0.0000052174387,0.1182701,0.00036189397,0.015029644,0.8539644,0.00039589088],"about_ca_topic_score_codex":0.00012403574,"about_ca_topic_score_gemma":0.0000045363704,"teacher_disagreement_score":0.9948268,"about_ca_system_score_codex":0.000010090779,"about_ca_system_score_gemma":0.000020570396,"threshold_uncertainty_score":0.9998682},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44385847,0.000022830041,0.5542808,0.00011774246,0.00013893978,0.00007886469,5.827175e-7,0.00020527064,0.0012964489],"genre_scores_gemma":[0.99126863,0.000016013375,0.0062701884,0.00016224025,0.000052411,6.7670936e-7,6.898833e-7,0.000008395441,0.0022207377],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988597,0.00005524097,0.00012749108,0.0005452005,0.00007519429,0.00033717495],"domain_scores_gemma":[0.99889493,0.000092784634,0.00010692434,0.00063053006,0.00010941993,0.00016544046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012298506,0.00015975992,0.00015171895,0.00010386667,0.00018673844,0.00011544714,0.0009852122,0.00006209505,0.00009445088],"category_scores_gemma":[0.000039375234,0.00016618411,0.00007528252,0.0005806897,0.00005390945,0.0008212112,0.0003012159,0.0002516546,0.00039791182],"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.000012131173,0.00019305323,0.40391186,0.000048498492,0.00010282193,0.0003945031,0.0010617552,0.36690015,0.00079178915,0.1699826,0.0009216875,0.05567916],"study_design_scores_gemma":[0.00023251698,0.00004644446,0.023410706,0.000013036313,0.00000637433,0.000006446036,0.00003156137,0.96775293,0.00003361773,0.0076328926,0.0005868038,0.00024666885],"about_ca_topic_score_codex":0.0010972372,"about_ca_topic_score_gemma":0.000049346185,"teacher_disagreement_score":0.6008528,"about_ca_system_score_codex":0.000049204165,"about_ca_system_score_gemma":0.00003895606,"threshold_uncertainty_score":0.6776791},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016833475,0.000046682875,0.9740625,0.0028167677,0.00015568557,0.00029142285,0.0000055988376,0.0012120251,0.019725954],"genre_scores_gemma":[0.16083772,0.0000089383975,0.8298716,0.002356046,0.00025016945,0.000028987213,0.00004367917,0.000025929823,0.0065769064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981521,0.000107686035,0.00026758583,0.00060290896,0.00036858325,0.00050115737],"domain_scores_gemma":[0.9988247,0.00010745743,0.00011205587,0.00059271255,0.00017178182,0.00019127385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002647943,0.00026129582,0.00024960452,0.00021419532,0.0003445056,0.00031999047,0.0005324401,0.00008230124,0.00012857246],"category_scores_gemma":[0.00005195591,0.0002002869,0.00007577141,0.00090138207,0.00009938961,0.0004929939,0.0000773053,0.00041259354,0.00009199435],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010399788,0.00030654273,0.00008350235,0.0000057010943,0.00003737693,0.000069892034,0.000711828,0.0016285537,0.00019507567,0.0028939482,0.0037517864,0.99030536],"study_design_scores_gemma":[0.0014133623,0.0016550905,0.001263956,0.00005064957,0.000023365044,0.0003353651,0.0005062131,0.98413384,0.0004504256,0.0003774456,0.00919426,0.00059603556],"about_ca_topic_score_codex":0.00012742724,"about_ca_topic_score_gemma":0.000013515502,"teacher_disagreement_score":0.9897094,"about_ca_system_score_codex":0.000049015813,"about_ca_system_score_gemma":0.00017472288,"threshold_uncertainty_score":0.81674623},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2036134,0.000021829894,0.7693011,0.026454648,0.00023989123,0.000052728104,7.029449e-7,0.00011918522,0.00019649889],"genre_scores_gemma":[0.50120354,0.000018460703,0.49116036,0.0072466345,0.0001628069,1.4356819e-8,0.0000055139353,0.000004796436,0.00019787854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865794,0.000043155862,0.00012046305,0.0006105036,0.00027523126,0.0002927207],"domain_scores_gemma":[0.998949,0.00003251263,0.00008252166,0.0008195505,0.000028934677,0.00008751877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031913866,0.00012252416,0.00011596279,0.00008472979,0.00025758968,0.00024918796,0.00062143645,0.00002770864,2.3770477e-7],"category_scores_gemma":[0.00002270419,0.000089765825,0.000012459037,0.0004118881,0.00014915733,0.00047718396,0.00006135413,0.00015629841,0.0000060523353],"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.000003703493,0.00000695722,0.000038718677,0.0000031461614,0.0000022977993,0.000038430484,0.00023672676,0.00007512911,0.075441964,0.000058912527,0.0006972666,0.92339677],"study_design_scores_gemma":[0.00019993128,0.00007800688,0.012162343,0.000048696504,0.0000043819236,0.00019129626,0.000015692403,0.9847521,0.00049559004,0.000120465804,0.001745356,0.00018609453],"about_ca_topic_score_codex":0.00014069003,"about_ca_topic_score_gemma":0.0000087330445,"teacher_disagreement_score":0.984677,"about_ca_system_score_codex":0.000011940241,"about_ca_system_score_gemma":0.000028986691,"threshold_uncertainty_score":0.36605442},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4108717,0.00020071967,0.5848894,0.000071136725,0.00013167842,0.000030019439,4.4388855e-8,0.00011162505,0.0036936635],"genre_scores_gemma":[0.6708993,0.0000045214056,0.32882842,0.000117533775,0.000012913205,3.022299e-7,6.742683e-8,0.0000048842553,0.00013209978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993163,0.000057161174,0.00009916747,0.00022624146,0.00011461642,0.00018656277],"domain_scores_gemma":[0.99964845,0.0000452243,0.000033053613,0.00018377676,0.000021370199,0.000068118774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026444223,0.000082366176,0.00008094423,0.000081143146,0.00018567673,0.00016667371,0.00015581821,0.000027327902,0.000013483153],"category_scores_gemma":[0.000050472616,0.00007004705,0.000023455661,0.00025202634,0.000020985512,0.0002063942,0.00006201465,0.00010492925,0.0000043751215],"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.0000015432583,0.000043813845,0.051168315,0.000028386083,0.000028921815,0.00007221376,0.001821203,0.0016232784,0.0036000789,0.60621864,0.000050792303,0.33534282],"study_design_scores_gemma":[0.00059276185,0.00007332187,0.004984571,0.00006135778,0.000014023055,0.00040557852,0.0002241353,0.96488833,0.0054280725,0.01931894,0.0034426353,0.00056627963],"about_ca_topic_score_codex":0.000066519024,"about_ca_topic_score_gemma":0.0000050692875,"teacher_disagreement_score":0.96326506,"about_ca_system_score_codex":0.00001040234,"about_ca_system_score_gemma":0.000023568924,"threshold_uncertainty_score":0.28564358},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4969076,0.0007138463,0.4552765,0.0072410707,0.000103541686,0.0003009303,0.00001997089,0.00027172497,0.039164845],"genre_scores_gemma":[0.99260855,0.000014648066,0.0063536046,0.00029107038,0.00014085705,0.000050774248,0.00000934584,0.000014895856,0.0005162521],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826247,0.00006280937,0.00043519863,0.0005270141,0.00037038513,0.0003421227],"domain_scores_gemma":[0.9987565,0.00026270005,0.0001693549,0.0005254222,0.00014887031,0.00013711253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003221969,0.0002446988,0.0006770639,0.00031491826,0.00014024216,0.00015389347,0.00068159675,0.000057824098,0.000002391922],"category_scores_gemma":[0.00033718772,0.00019996165,0.0002587035,0.0016653993,0.000091390066,0.00035529456,0.0005450233,0.00016581625,0.00002413907],"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.000039256593,0.0019003719,0.0052363407,0.000257538,0.005392427,0.000030285619,0.6895582,0.04363818,0.00009871698,0.016115699,0.0011236959,0.23660927],"study_design_scores_gemma":[0.0012730607,0.00056596764,0.002647309,0.00024121423,0.000012983226,0.00007379141,0.10587125,0.8687432,0.00038962532,0.011740905,0.0069693043,0.0014713961],"about_ca_topic_score_codex":0.000015915872,"about_ca_topic_score_gemma":0.000009769867,"teacher_disagreement_score":0.825105,"about_ca_system_score_codex":0.000050850515,"about_ca_system_score_gemma":0.000035980982,"threshold_uncertainty_score":0.81542},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06650376,0.0000110403,0.92281395,0.00016514977,0.00054967933,0.00012952271,2.0625244e-7,0.00063430954,0.009192358],"genre_scores_gemma":[0.5279922,1.83103e-7,0.47107798,0.00016852916,0.00012796784,0.0000027055294,3.5058702e-7,0.0000103528655,0.00061972556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834263,0.00009497317,0.00031303157,0.00043117505,0.00033621702,0.0004819695],"domain_scores_gemma":[0.99926853,0.00008059996,0.000063703636,0.0003875343,0.000036895086,0.00016276004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017821401,0.00014986804,0.00020017244,0.00026558363,0.00013910723,0.00016673992,0.00058935065,0.00006662788,0.0000024234923],"category_scores_gemma":[0.000045090434,0.00013703966,0.00004591109,0.00074255414,0.000009628887,0.0002427226,0.0003287171,0.00028697055,0.00005417394],"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.000021024329,0.00007304156,0.0017849694,0.000057307814,0.0000102436225,0.00019541923,0.00433768,0.8435986,0.0040125847,0.11917285,0.0002691721,0.026467098],"study_design_scores_gemma":[0.00034481368,0.00003689395,0.00015331568,0.00006186415,0.0000013048656,0.000040184146,0.00017075514,0.9968921,0.00009918584,0.00024401593,0.0017665531,0.00018902941],"about_ca_topic_score_codex":0.00054325373,"about_ca_topic_score_gemma":0.00003754969,"teacher_disagreement_score":0.46148846,"about_ca_system_score_codex":0.00017133352,"about_ca_system_score_gemma":0.0000738883,"threshold_uncertainty_score":0.5588315},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8603707,0.00007420421,0.13806081,0.0000828806,0.0000809663,0.00013489311,9.747848e-7,0.0004388822,0.000755719],"genre_scores_gemma":[0.92023253,0.000021507094,0.0795886,0.000024777753,0.000051283772,0.000007208882,0.000009493254,0.0000038844487,0.00006074086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990907,0.00016727792,0.00026445935,0.00020732332,0.00016251241,0.00010776481],"domain_scores_gemma":[0.9995031,0.00014744108,0.00011686832,0.00012199517,0.000058010013,0.000052597978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007358631,0.00008642285,0.00021746318,0.00021364748,0.000095552954,0.00009443424,0.00009502427,0.00004494551,0.000002662783],"category_scores_gemma":[0.00007998759,0.00006990846,0.00001804363,0.0003033648,0.00011417086,0.0006165264,0.000052239495,0.00008391887,6.0088075e-7],"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.00160956,0.0003234293,0.18281627,0.00041931402,0.00014560952,0.000014876167,0.00519281,0.03123772,0.0041960026,0.034389693,0.0004264101,0.7392283],"study_design_scores_gemma":[0.009776414,0.00009963671,0.029868074,0.000017650102,0.000009499071,0.000018564451,0.000008283617,0.958961,0.0006020989,0.0005577932,0.000008722626,0.00007226145],"about_ca_topic_score_codex":0.00038497965,"about_ca_topic_score_gemma":0.0000019902334,"teacher_disagreement_score":0.9277233,"about_ca_system_score_codex":0.000006096873,"about_ca_system_score_gemma":0.000019859886,"threshold_uncertainty_score":0.28507844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03539718,0.00023904283,0.96201414,0.00033791194,0.00083642255,0.00052692543,0.0002004464,0.00034672327,0.00010120504],"genre_scores_gemma":[0.9478651,0.00003865461,0.05097941,0.00020283849,0.00022557985,0.00002910837,0.000086202504,0.0000407076,0.0005323531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973292,0.0002744062,0.0005805213,0.00079732074,0.0004562039,0.00056237745],"domain_scores_gemma":[0.9984068,0.00034320704,0.0002789419,0.0005668543,0.00014530147,0.00025887176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036353065,0.0004162659,0.00041779317,0.00021431451,0.0007209682,0.00057332125,0.00036398348,0.00016580387,0.00002595909],"category_scores_gemma":[0.000036300775,0.00041836427,0.000107251886,0.00029080242,0.00010210988,0.00024404253,0.00000771261,0.00057052536,0.00001259117],"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.00010409662,0.00047838848,0.00057164696,0.00046045423,0.00013927679,0.000038802522,0.0011452915,0.89115304,0.004394847,0.019870643,0.0013248627,0.08031863],"study_design_scores_gemma":[0.0011009497,0.0005499772,0.00058478775,0.00042494346,0.00009653366,0.000085072264,0.00005802494,0.9805052,0.002369006,0.00020913413,0.01346051,0.00055586133],"about_ca_topic_score_codex":0.00011969021,"about_ca_topic_score_gemma":0.000032393473,"teacher_disagreement_score":0.91246796,"about_ca_system_score_codex":0.00007556179,"about_ca_system_score_gemma":0.00008902388,"threshold_uncertainty_score":0.9998268},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028684305,0.00004261787,0.96680766,0.003852619,0.00010165614,0.00020187683,0.00000106338,0.00008048639,0.00022771875],"genre_scores_gemma":[0.8911184,0.000010968814,0.10849092,0.0001538207,0.00012607644,0.00007536811,0.0000030632161,0.000007514653,0.000013862675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897736,0.000028444587,0.0003615734,0.00024332556,0.00025022222,0.00013907466],"domain_scores_gemma":[0.9988221,0.00018459371,0.0003427744,0.00017869193,0.00042656297,0.00004526662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018146126,0.000116217525,0.00015707636,0.00086458394,0.00006257087,0.00010237977,0.0010439568,0.00009702673,0.000005182842],"category_scores_gemma":[0.00003543898,0.000107607666,0.000038460763,0.00041509225,0.000037980422,0.00026989164,0.00015867622,0.0005616612,0.000014421999],"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.000007169737,0.00023203503,0.0015503593,0.000004693143,0.000031323387,0.0000028296286,0.00009736836,0.114297755,0.0024513805,0.11449755,0.00001424825,0.7668133],"study_design_scores_gemma":[0.0005396232,0.00015009682,0.006756984,0.00003687771,0.0000025611114,0.00007635276,0.00002990483,0.9758557,0.0010050322,0.011691372,0.0037434497,0.00011203617],"about_ca_topic_score_codex":0.000011551582,"about_ca_topic_score_gemma":8.1993096e-7,"teacher_disagreement_score":0.8624341,"about_ca_system_score_codex":0.00007624695,"about_ca_system_score_gemma":0.000052936182,"threshold_uncertainty_score":0.4388113},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057623293,0.00005786622,0.93606716,0.002110913,0.00024148314,0.000070044734,1.405659e-7,0.00025631255,0.0035727909],"genre_scores_gemma":[0.73847735,0.0000066944035,0.26085255,0.00047181873,0.00014873593,0.0000017996463,2.1211899e-7,0.000004626346,0.000036201418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804085,0.00010640203,0.00018953362,0.0006189236,0.00053057156,0.00051373005],"domain_scores_gemma":[0.9989734,0.00025428127,0.000053788746,0.00037683072,0.00007636763,0.000265318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012156789,0.00015212856,0.00015020404,0.0001502733,0.0006264778,0.0005710746,0.0012456408,0.00003097153,0.00003443355],"category_scores_gemma":[0.0001711366,0.0001268572,0.000029555096,0.00057689653,0.0011220216,0.00061652693,0.0011833628,0.00032514156,0.00011417794],"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.0000011959461,0.000019634179,0.00040565635,0.0000031288805,0.0000017871818,0.0000065029726,0.00041850784,0.0012454669,0.00012993197,0.6371887,0.000013237771,0.3605663],"study_design_scores_gemma":[0.0002089848,0.0001493639,0.0022887436,0.000025465919,0.0000026825903,0.00006444911,0.000005458472,0.98130256,0.00048956944,0.014213461,0.0010607592,0.0001885275],"about_ca_topic_score_codex":0.0000036139916,"about_ca_topic_score_gemma":2.5872907e-7,"teacher_disagreement_score":0.98005706,"about_ca_system_score_codex":0.0000314763,"about_ca_system_score_gemma":0.000042342555,"threshold_uncertainty_score":0.55068856},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019086008,0.0006257169,0.9975492,0.00043240844,0.00031457676,0.0004726218,0.0000010518479,0.00012020835,0.0002934094],"genre_scores_gemma":[0.35822615,0.000023340697,0.640553,0.00074045267,0.00020384132,0.0000044437356,0.0000013393906,0.000018369567,0.0002290494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976363,0.000085860396,0.0002546703,0.0011831528,0.00037857858,0.00046139603],"domain_scores_gemma":[0.9977972,0.001365691,0.00020277139,0.00036033103,0.00011942601,0.00015456903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007837507,0.00040866918,0.0004410683,0.00035945815,0.00046085173,0.0005703298,0.00066962617,0.0001936909,0.0000023228192],"category_scores_gemma":[0.00019442101,0.00037178388,0.00005210551,0.00014910066,0.000439706,0.00036898282,0.00037267388,0.0008319057,0.0000019027435],"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.000013673133,0.000008817177,0.000010669755,0.000010483592,0.0000071439467,0.00001806369,0.0011190866,0.024394067,0.00042275432,0.0018206179,0.0000019636002,0.9721727],"study_design_scores_gemma":[0.0005787879,0.00066011207,0.00008850755,0.00016603697,0.0000066711013,0.00007697081,5.243035e-7,0.96983445,0.0018790792,0.025702091,0.00056325196,0.00044349412],"about_ca_topic_score_codex":0.000016089396,"about_ca_topic_score_gemma":0.0000028988072,"teacher_disagreement_score":0.97172916,"about_ca_system_score_codex":0.00008348827,"about_ca_system_score_gemma":0.00017758699,"threshold_uncertainty_score":0.9998734},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2627982,0.000027033402,0.7321746,0.0005910374,0.0004544833,0.00009384855,7.9631786e-7,0.0002870847,0.0035729534],"genre_scores_gemma":[0.99384844,0.0000032948242,0.0050472827,0.0009267452,0.00006124143,0.0000015266698,0.00005915505,0.0000015562013,0.000050747214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994728,0.000022276967,0.00016828932,0.00006757806,0.00016513403,0.000103944294],"domain_scores_gemma":[0.9997192,0.000065469765,0.00008750928,0.000044599245,0.000041917512,0.000041279756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026639336,0.00005997188,0.000046630536,0.00015577521,0.00022421005,0.000170735,0.000074100826,0.00002233766,0.0000030601236],"category_scores_gemma":[0.000025713838,0.00005643554,0.000016004784,0.00012795781,0.000013925305,0.0013734993,0.00003494434,0.00015640426,0.00008680779],"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.000011581838,0.000024623965,0.0007492849,0.000015428037,0.00001038869,0.0000023401415,0.0027288785,0.022481868,0.00011815375,0.20337583,0.000502119,0.7699795],"study_design_scores_gemma":[0.00049083686,0.00012273077,0.043940797,0.000014337101,0.000001590295,0.000021099124,0.00022479627,0.94763327,0.00024294113,0.002671472,0.004509069,0.00012707981],"about_ca_topic_score_codex":0.0000125259,"about_ca_topic_score_gemma":6.863483e-7,"teacher_disagreement_score":0.9251514,"about_ca_system_score_codex":0.00002165286,"about_ca_system_score_gemma":0.00001026756,"threshold_uncertainty_score":0.23013745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032701252,0.00006748181,0.9855093,0.0037498015,0.00032400587,0.00014196061,0.000013239557,0.0004518617,0.0064722453],"genre_scores_gemma":[0.32684976,0.000014876395,0.66649246,0.00087143976,0.00046923582,0.00003256318,0.00000900014,0.000014609922,0.0052460344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987927,0.000061897874,0.00019188842,0.00039337028,0.00019600235,0.00036414588],"domain_scores_gemma":[0.9987575,0.0005035342,0.000088746965,0.00047306265,0.00005421367,0.00012294741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033175986,0.00014669696,0.00015789337,0.00007798903,0.0002979756,0.00028486873,0.00068851805,0.00005982822,0.0001228892],"category_scores_gemma":[0.0001842722,0.000118301505,0.00011329728,0.00017426879,0.000038499093,0.00029908988,0.000107799846,0.00018426421,0.000073567855],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013315567,0.000111586494,0.0037091502,0.00001764875,0.000048857735,0.0000013801782,0.0007476725,0.0036080088,0.00016763847,0.083558105,0.036287684,0.87172896],"study_design_scores_gemma":[0.00038550844,0.0000724406,0.0012841506,0.0000038587923,0.000004993346,0.0000022198278,0.000014898109,0.6316955,0.0004254926,0.0041882894,0.36176714,0.0001554751],"about_ca_topic_score_codex":0.00027660208,"about_ca_topic_score_gemma":0.00004560136,"teacher_disagreement_score":0.8715735,"about_ca_system_score_codex":0.000026589427,"about_ca_system_score_gemma":0.000048179238,"threshold_uncertainty_score":0.48241955},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042662006,0.0002542166,0.9815407,0.0035020686,0.00044112417,0.00031440007,0.000005549433,0.00045439455,0.009221349],"genre_scores_gemma":[0.9891345,0.0000013397439,0.008568099,0.0015212607,0.0002857346,0.00005221211,0.0000155095,0.000006310706,0.0004150674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877566,0.00006321532,0.000374897,0.00015177773,0.00038617075,0.00024829028],"domain_scores_gemma":[0.99928796,0.00002678383,0.0001997105,0.0003026044,0.00009938284,0.00008353829],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00048842846,0.00014202192,0.00013307949,0.000112149704,0.0003989533,0.0014248001,0.00069299183,0.000039352086,0.0000015326037],"category_scores_gemma":[0.000052572486,0.00009106803,0.00003510486,0.00046200608,0.0000131440165,0.0027544037,0.00013472629,0.00021489503,0.00014733615],"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.0000047817994,0.00001798494,0.00016824444,0.00021670581,0.000007030527,3.8132993e-7,0.011761708,0.45746732,0.000019962847,0.004129654,0.0039950353,0.5222112],"study_design_scores_gemma":[0.00011289921,0.000020270705,0.00014437588,0.000030920863,0.0000016730803,0.00007119329,0.00015759483,0.8655811,0.000026579195,0.000005954058,0.13373443,0.000112983806],"about_ca_topic_score_codex":0.0000920684,"about_ca_topic_score_gemma":0.0000017118269,"teacher_disagreement_score":0.9848683,"about_ca_system_score_codex":0.000040493025,"about_ca_system_score_gemma":0.000036456564,"threshold_uncertainty_score":0.9996118},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0386547,0.000012868762,0.9561917,0.003451158,0.00003896733,0.00040827767,5.4079516e-7,0.0002248584,0.0010169256],"genre_scores_gemma":[0.90499246,0.0000025630868,0.09119198,0.0005983942,0.00012514592,0.00017379595,0.0000048642087,0.000013177385,0.002897617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991359,0.000054916847,0.00009561443,0.00034362805,0.00017203485,0.00019787776],"domain_scores_gemma":[0.999345,0.00012066205,0.000030175845,0.00033679203,0.00008198706,0.00008537453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019826648,0.00010357616,0.0000931007,0.00004210801,0.0005407693,0.00008719177,0.0004497145,0.000031119784,0.000008869138],"category_scores_gemma":[0.000018104314,0.000061215556,0.00003293605,0.00033323187,0.000039427352,0.00019152946,0.00002549767,0.0001668102,0.000015005107],"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.0002589235,0.00029584233,0.0028482839,0.0000234721,0.00014462035,0.000009020217,0.032375842,0.082448475,0.00724278,0.03921198,0.0012050818,0.8339357],"study_design_scores_gemma":[0.00039149885,0.00044500886,0.0039247046,0.0000032634255,0.0000065952117,0.000026591348,0.0002027986,0.97132915,0.00054102234,0.00019161912,0.022792276,0.00014546215],"about_ca_topic_score_codex":0.0001437091,"about_ca_topic_score_gemma":0.00003679172,"teacher_disagreement_score":0.88888067,"about_ca_system_score_codex":0.000015886213,"about_ca_system_score_gemma":0.000048532565,"threshold_uncertainty_score":0.41592148},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18866204,0.00029065265,0.8040887,0.00012276784,0.004116351,0.0005980152,0.0000052082346,0.0006204361,0.0014957979],"genre_scores_gemma":[0.9958179,0.00012160289,0.002412282,0.00007183765,0.00033873285,0.000040425897,0.0000030552135,0.000045920973,0.0011482192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616146,0.0005141488,0.0009537412,0.0009591562,0.00074056117,0.000670921],"domain_scores_gemma":[0.9985213,0.00012873037,0.00025332667,0.0007016377,0.00012565663,0.000269316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075182255,0.00050448213,0.0006121316,0.00048319626,0.00039675957,0.00080852443,0.00059870305,0.0002519672,0.0000047811477],"category_scores_gemma":[0.00000860603,0.00052189425,0.00014776764,0.0005794388,0.00004460667,0.0004017115,0.0000173056,0.0010219319,0.0000522403],"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.000032962384,0.00030479537,0.000119979086,0.00009828278,0.00005437913,0.00005837453,0.0022549191,0.9800889,0.00039275305,0.0021653292,0.000036570193,0.014392793],"study_design_scores_gemma":[0.0011980169,0.00040688578,0.00009936359,0.00075619144,0.000053493448,0.00021180522,0.00089981256,0.9937149,0.00012253447,0.000045401524,0.0019608429,0.0005307159],"about_ca_topic_score_codex":0.0008814744,"about_ca_topic_score_gemma":0.000066919645,"teacher_disagreement_score":0.8071559,"about_ca_system_score_codex":0.0003169774,"about_ca_system_score_gemma":0.00007214993,"threshold_uncertainty_score":0.99972326},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02564545,0.0001442536,0.9725419,0.00010757671,0.00048377615,0.00008886048,0.0000033190556,0.0009387464,0.00004611805],"genre_scores_gemma":[0.85527605,0.00003559106,0.14340846,0.00006255615,0.000052770847,0.000021286663,0.0000010922298,0.00003254321,0.0011096349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881524,0.000062645835,0.00021316938,0.00028973844,0.00032273168,0.0002964997],"domain_scores_gemma":[0.99903125,0.00039434392,0.000056193832,0.00041281982,0.000026671469,0.0000787169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017903469,0.00020402182,0.00019264637,0.00013013423,0.00032208636,0.00016292746,0.00053474185,0.0000699933,0.00014059411],"category_scores_gemma":[0.000035114743,0.00016657781,0.00015546275,0.0004344527,0.00003760928,0.0004025277,0.000004685171,0.0005972088,0.000033757984],"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.0000041277426,0.000029341672,0.00014867068,0.000028246053,0.000031459054,0.0000061345477,0.0009058417,0.6918964,0.000042879325,0.000043355896,0.000024288267,0.30683932],"study_design_scores_gemma":[0.0008806198,0.00041856087,0.007080815,0.0005960979,0.000071644106,0.00014637856,0.00011892709,0.94084567,0.024176316,0.00010734939,0.024508726,0.0010488942],"about_ca_topic_score_codex":0.000031215153,"about_ca_topic_score_gemma":0.0000012189096,"teacher_disagreement_score":0.8296306,"about_ca_system_score_codex":0.000031350257,"about_ca_system_score_gemma":0.00003746763,"threshold_uncertainty_score":0.67928463},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13322876,0.00002182134,0.85614127,0.00060538325,0.00005617788,0.00003328601,1.4645744e-7,0.00018392618,0.009729234],"genre_scores_gemma":[0.56606996,9.673046e-7,0.4310556,0.0002443899,0.000029303505,9.604288e-7,1.3469855e-7,0.000002617653,0.002596044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944985,0.000021858677,0.000088342436,0.00016875275,0.00013686472,0.00013430645],"domain_scores_gemma":[0.99961346,0.00003920855,0.000020059651,0.00022771952,0.000024389921,0.00007515639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094135285,0.000055647255,0.000059480346,0.00009939507,0.00020909237,0.000042236217,0.00030449269,0.000021270273,0.000008008687],"category_scores_gemma":[0.000034178185,0.000047565838,0.000023531895,0.00036332675,0.0000073707515,0.00019416206,0.000100302066,0.00008197067,0.00013679682],"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.0000011375371,0.000034282977,0.02502591,0.0000055330443,0.000004663518,0.000015517278,0.0022641008,0.7924715,0.0002021998,0.1714518,0.002000993,0.0065223137],"study_design_scores_gemma":[0.000040694118,0.000008153506,0.004195001,0.0000029246073,8.2681134e-7,0.00003244614,0.0000032919527,0.9934754,0.0000439598,0.0018749867,0.00024730203,0.00007501371],"about_ca_topic_score_codex":0.00008149358,"about_ca_topic_score_gemma":0.0000011112479,"teacher_disagreement_score":0.4328412,"about_ca_system_score_codex":0.0000127631665,"about_ca_system_score_gemma":0.000037012054,"threshold_uncertainty_score":0.19396785},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017832957,0.000026352807,0.98060375,0.00028675635,0.000057105317,0.00009327158,1.7351171e-7,0.000068913694,0.0010307088],"genre_scores_gemma":[0.5698701,2.5821913e-7,0.42946973,0.000033804205,0.000021568441,0.0000053966537,0.0000022404986,0.0000030976626,0.0005937895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927473,0.00020964387,0.00014235327,0.00016909576,0.00009831725,0.00010584245],"domain_scores_gemma":[0.9991368,0.00059064815,0.00007782901,0.00011542468,0.00003699501,0.00004226956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005598775,0.000059688846,0.00013684489,0.0000567038,0.000060147562,0.00003842919,0.00014754492,0.000026179905,0.000004738992],"category_scores_gemma":[0.0003062659,0.000048837024,0.000022313207,0.00009653062,0.0000186415,0.000077241755,0.000073627365,0.000084766,0.0000013534486],"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.000019108234,0.00009996669,0.012778885,0.000096411575,0.000036520698,2.2751243e-7,0.004718779,0.037135012,0.0021522983,0.02956966,0.0004397377,0.9129534],"study_design_scores_gemma":[0.00032765657,0.00017929454,0.0038929423,0.0000068180466,0.0000052088194,9.793504e-7,0.00015570036,0.99287826,0.0007188252,0.00094004936,0.00083450874,0.00005976072],"about_ca_topic_score_codex":0.000038277165,"about_ca_topic_score_gemma":0.00000128738,"teacher_disagreement_score":0.95574325,"about_ca_system_score_codex":0.000004318924,"about_ca_system_score_gemma":0.000007575233,"threshold_uncertainty_score":0.1991516},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24324206,0.000009741203,0.75327164,0.00006494358,0.00027667702,0.00017348073,1.5789004e-7,0.00017076674,0.0027905335],"genre_scores_gemma":[0.88725245,1.1982156e-7,0.11157964,0.00003654503,0.00007488539,0.000009048899,1.8258542e-7,0.000007800745,0.001039351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988833,0.00009056006,0.00026654446,0.0002328945,0.00027275275,0.00025396247],"domain_scores_gemma":[0.99939996,0.00006211287,0.00007516347,0.00036503194,0.0000382587,0.00005946764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015414981,0.000096296986,0.00014643614,0.00013437845,0.00008775416,0.000061869265,0.0005719833,0.000046101162,0.00000337562],"category_scores_gemma":[0.000044041408,0.00006585151,0.00004169958,0.00043764783,0.000014142883,0.000117435666,0.00024743075,0.00024993124,0.000008724149],"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.00002490448,0.00029651716,0.025661016,0.000076440025,0.000019504801,0.000080319325,0.01122071,0.7378193,0.00937814,0.080861524,0.00017754082,0.13438407],"study_design_scores_gemma":[0.00016748483,0.000030602827,0.0020139432,0.000036721798,0.0000043917507,0.000015627145,0.00023736665,0.9968433,0.00017578824,0.0000130041635,0.0003721729,0.00008962672],"about_ca_topic_score_codex":0.0010360891,"about_ca_topic_score_gemma":0.000038122675,"teacher_disagreement_score":0.64401037,"about_ca_system_score_codex":0.00006814791,"about_ca_system_score_gemma":0.000051232462,"threshold_uncertainty_score":0.2685347},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6709493,0.002357123,0.31781232,0.0013084278,0.0001431696,0.00022391426,0.000014335331,0.00008337183,0.0071080728],"genre_scores_gemma":[0.97988164,0.000098512945,0.019715259,0.000013647579,0.000011474229,0.000002148242,6.7448053e-7,0.0000040681603,0.0002725593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938345,0.000018057517,0.0002853713,0.000075777876,0.00016080169,0.00007654088],"domain_scores_gemma":[0.99896044,0.00029447803,0.0002726933,0.00016657964,0.00028897522,0.000016820086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025841844,0.000062798834,0.00024599588,0.000064336054,0.000029832006,0.000010938135,0.00017236719,0.000026049489,0.0000020883729],"category_scores_gemma":[0.00019238195,0.000051610634,0.00003417024,0.0001646121,0.00007667825,0.00007817171,0.00005891188,0.00004490927,4.9802395e-7],"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.000028627917,0.0038717662,0.008927342,0.01790625,0.00027974503,0.0000067972474,0.031194985,0.0018592908,0.0027935093,0.9190261,0.007460807,0.006644788],"study_design_scores_gemma":[0.0019721847,0.0006031424,0.0023553898,0.00068096386,0.000051480212,0.000034063207,0.0007360188,0.08229942,0.2169406,0.69254816,0.0014151665,0.00036341982],"about_ca_topic_score_codex":0.000046531484,"about_ca_topic_score_gemma":0.0000022840177,"teacher_disagreement_score":0.3089324,"about_ca_system_score_codex":7.644471e-7,"about_ca_system_score_gemma":0.000026996227,"threshold_uncertainty_score":0.21046206},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7242335,0.0003612535,0.24507953,0.010299753,0.0001115852,0.00020692624,5.2596715e-7,0.0008063621,0.018900536],"genre_scores_gemma":[0.78439194,0.000014124046,0.18857814,0.0007992964,0.00006488059,0.000005154283,0.000002486615,0.000007841904,0.026136143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945825,0.000035841465,0.00005386211,0.00019270743,0.000113695154,0.00014565745],"domain_scores_gemma":[0.9996749,0.00005125816,0.000025448504,0.00013851614,0.000039629576,0.000070233866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006592978,0.000076161756,0.00007619227,0.00003434438,0.000097954784,0.0002081468,0.00018421237,0.0000222716,0.00005717152],"category_scores_gemma":[0.0000207799,0.000047580954,0.000009012838,0.00011659761,0.000023003236,0.00023203724,0.00009846764,0.00021261963,0.00004441993],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002991769,0.00010950816,0.033556208,0.00001929726,0.000032138734,0.00001941135,0.0010344872,0.0010029002,0.00072422554,0.020883216,0.006460845,0.9361548],"study_design_scores_gemma":[0.0011750113,0.0008645386,0.481018,0.000058797654,0.000008335774,0.00031545834,0.00026996832,0.48814568,0.00064142374,0.0016384915,0.02526207,0.0006022263],"about_ca_topic_score_codex":0.00033029242,"about_ca_topic_score_gemma":0.0000150516225,"teacher_disagreement_score":0.93555254,"about_ca_system_score_codex":0.0000033436665,"about_ca_system_score_gemma":0.000008904196,"threshold_uncertainty_score":0.20071644},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3230574,0.00044812815,0.6707151,0.00008178006,0.0032097017,0.0007686678,0.000008348702,0.0006842103,0.0010266626],"genre_scores_gemma":[0.9954488,0.000108841516,0.0027417226,0.00006257287,0.00028093884,0.000068408444,0.0000027410474,0.000049716946,0.0012362453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607337,0.0004516792,0.0009332671,0.0009855777,0.00081311393,0.0007430218],"domain_scores_gemma":[0.9984697,0.00009742974,0.00021279759,0.00078696065,0.00011980383,0.00031327092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007398858,0.000523398,0.00064806856,0.0004403853,0.0004212447,0.00076321146,0.00071145146,0.00026441095,0.0000045771203],"category_scores_gemma":[0.0000062302915,0.00054085744,0.0001565454,0.0005784861,0.00005682979,0.00028971903,0.000018124136,0.0009139078,0.000043407726],"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.000029532592,0.00056689896,0.00034346024,0.00011588877,0.00005317398,0.00016144266,0.002431576,0.9770457,0.00053827994,0.0030039663,0.00003313611,0.015676921],"study_design_scores_gemma":[0.001246283,0.00045880745,0.00030542334,0.00048505285,0.0000861432,0.00022741631,0.00053606066,0.994951,0.00010147073,0.000022758575,0.0009872572,0.00059232156],"about_ca_topic_score_codex":0.0008621696,"about_ca_topic_score_gemma":0.00005013182,"teacher_disagreement_score":0.6723914,"about_ca_system_score_codex":0.00022950793,"about_ca_system_score_gemma":0.00008068178,"threshold_uncertainty_score":0.9997043},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012320083,0.0005433471,0.9855742,0.0002133279,0.0001353481,0.0001484383,0.0000027679837,0.0004804363,0.00058206375],"genre_scores_gemma":[0.56588095,0.000007753279,0.43348113,0.00015542567,0.000037910024,0.000007428558,0.0000021759445,0.000015343974,0.00041191807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843,0.00004265088,0.00027274183,0.0004428882,0.00031279694,0.00049892155],"domain_scores_gemma":[0.9993301,0.00009312421,0.00012013046,0.00024551875,0.000058053032,0.00015308645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009277613,0.00021723195,0.0001836278,0.00026124978,0.0005669373,0.00033984432,0.00024406782,0.000099502366,0.000014413686],"category_scores_gemma":[0.000019135883,0.00020590494,0.00006432611,0.00046321563,0.000034103115,0.00059702434,0.000006641672,0.00045612172,0.000013537016],"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.000011563482,0.000074010764,0.000016535678,0.00007724979,0.000009663554,0.000041891377,0.0028760622,0.0036688598,0.0014309363,0.000013652528,0.0000073953274,0.9917722],"study_design_scores_gemma":[0.0003695554,0.000045684093,0.000039671206,0.0001368375,0.000017653805,0.00009959972,0.0002293779,0.98867875,0.0099436715,0.00011940192,0.00006140798,0.00025839987],"about_ca_topic_score_codex":0.000048197577,"about_ca_topic_score_gemma":0.000054134794,"teacher_disagreement_score":0.9915138,"about_ca_system_score_codex":0.0000486937,"about_ca_system_score_gemma":0.00005609727,"threshold_uncertainty_score":0.839656},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27237794,0.00018555456,0.72470796,0.0010247862,0.0003564429,0.000078000056,0.000004475707,0.000015009519,0.0012498436],"genre_scores_gemma":[0.9700024,0.00040127672,0.028013026,0.000015248818,0.0003927709,0.0000020325851,3.6439303e-7,0.000008883191,0.0011639929],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99728596,0.000565259,0.00058860285,0.00017305338,0.0010216542,0.0003654667],"domain_scores_gemma":[0.9970516,0.00092684623,0.0003040064,0.0002688285,0.0012738755,0.00017483602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035539453,0.00009228518,0.00021604187,0.00053822127,0.00029849252,0.00007056279,0.0008559627,0.00004627031,0.0001593986],"category_scores_gemma":[0.0007806726,0.000074500036,0.00014063912,0.0007414942,0.00036130167,0.0004179076,0.00014189877,0.001002502,0.00010410638],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017235894,0.0005441619,0.00026821226,0.000015893926,0.00008967794,0.00054793106,0.0075411643,0.016008409,0.010236381,0.13033976,0.0014029605,0.8328331],"study_design_scores_gemma":[0.00016092378,0.0031194868,0.005095238,0.00020867186,0.000014920163,0.001710796,0.004335576,0.20786172,0.43069735,0.33539212,0.010909674,0.0004934971],"about_ca_topic_score_codex":0.00013040195,"about_ca_topic_score_gemma":0.000010612406,"teacher_disagreement_score":0.8323396,"about_ca_system_score_codex":0.000057848076,"about_ca_system_score_gemma":0.00045740823,"threshold_uncertainty_score":0.43554282},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030062243,0.00004875676,0.9897741,0.0007346205,0.00036653155,0.0003059036,0.0000050932485,0.0003292432,0.005429504],"genre_scores_gemma":[0.32287177,0.00004709135,0.67163616,0.00052597275,0.0001558066,0.00008950839,0.000009331682,0.00001177329,0.004652591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998953,0.00016201423,0.00019983613,0.00027919566,0.00016527827,0.00024067979],"domain_scores_gemma":[0.9978852,0.0015299261,0.00009409233,0.00034662226,0.00005760334,0.0000865111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054274715,0.00011118139,0.00030461673,0.000059947317,0.00039807623,0.00008617334,0.00048765278,0.000041254567,0.000045575976],"category_scores_gemma":[0.0004915583,0.000081728205,0.00018454215,0.00014031652,0.00010434609,0.0001450091,0.00007560157,0.00013086555,0.000023070566],"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.011097529,0.00058430654,0.007925165,0.0000794773,0.0006030384,0.00003465444,0.0072557745,0.010050721,0.0002767982,0.61253613,0.14469469,0.2048617],"study_design_scores_gemma":[0.04855142,0.00004077951,0.00026407145,0.0000024436586,0.000008202119,0.000008282681,0.000008002207,0.90895116,0.00013047284,0.008605238,0.03328497,0.00014497948],"about_ca_topic_score_codex":0.0004512347,"about_ca_topic_score_gemma":0.00000531264,"teacher_disagreement_score":0.8989004,"about_ca_system_score_codex":0.000010942138,"about_ca_system_score_gemma":0.000044533932,"threshold_uncertainty_score":0.33327797},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79100525,0.000069148,0.17335998,0.0056760423,0.000102849124,0.00054146635,0.00013761496,0.0002082079,0.028899435],"genre_scores_gemma":[0.93242,0.00082005025,0.058065612,0.000035754976,0.00003984673,2.0729517e-7,0.000013923035,0.000016951564,0.008587613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964601,0.000669078,0.00018328914,0.00078943337,0.0008908085,0.0010073078],"domain_scores_gemma":[0.9978251,0.00048806705,0.00016873683,0.0007950064,0.0003093065,0.00041381805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090607384,0.0002674468,0.00042453414,0.0014967988,0.00067587703,0.00012258875,0.0030714031,0.00010075082,0.00008455153],"category_scores_gemma":[0.00010357223,0.00033667302,0.00017737382,0.0016484071,0.0006225019,0.0016054809,0.0026253595,0.0011181374,0.000031801035],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016520437,0.001187319,0.12773263,0.00031557196,0.00028851215,0.0029507494,0.058254886,0.026991883,0.0018637422,0.028152965,0.0026890915,0.74792063],"study_design_scores_gemma":[0.004607036,0.0014390775,0.09311213,0.0003215006,0.00002298295,0.00003017707,0.014216715,0.45156315,0.0001046537,0.0041780965,0.4293466,0.0010578923],"about_ca_topic_score_codex":0.004367038,"about_ca_topic_score_gemma":0.0075650834,"teacher_disagreement_score":0.7468627,"about_ca_system_score_codex":0.00029427366,"about_ca_system_score_gemma":0.00042900053,"threshold_uncertainty_score":0.9999085},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015735807,0.000007892023,0.8634403,0.0006259863,0.00014808867,0.00003988174,1.7017096e-7,0.00028007163,0.119721845],"genre_scores_gemma":[0.916531,0.0000018505294,0.07235211,0.00015950126,0.00008306801,0.0000018184111,0.0000014803021,0.0000064537594,0.010862673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907404,0.00005398362,0.000110654015,0.00027311404,0.00020544464,0.00028278507],"domain_scores_gemma":[0.9994594,0.00016626935,0.000048318,0.00018657839,0.000051627067,0.000087822475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033683356,0.00009883271,0.00009454341,0.00008102328,0.0001638109,0.00007058459,0.00039428964,0.000034218814,0.00004949548],"category_scores_gemma":[0.00008026758,0.00007854146,0.00004262099,0.00024855696,0.000024840925,0.0003154708,0.00017151088,0.00032298974,0.000102047845],"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.0000069130097,0.000049836675,0.0008386519,0.0000039267893,0.000014620222,0.000028076143,0.006187047,0.0012968831,0.00045523376,0.106888205,0.0002590453,0.8839716],"study_design_scores_gemma":[0.0005191315,0.00025482348,0.02308307,0.000018895882,0.000006284038,0.000027912563,0.0016252373,0.93329144,0.017405238,0.008199351,0.015087278,0.00048132276],"about_ca_topic_score_codex":0.00021715251,"about_ca_topic_score_gemma":0.000021485344,"teacher_disagreement_score":0.93199456,"about_ca_system_score_codex":0.000029841587,"about_ca_system_score_gemma":0.000018666236,"threshold_uncertainty_score":0.32028276},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29374042,0.004363579,0.69187397,0.00076120516,0.0015574057,0.0008275563,0.000016915717,0.0009248275,0.0059341076],"genre_scores_gemma":[0.9540469,0.0025701155,0.0051386934,0.000053443957,0.00014563002,0.000031473206,0.0000041519606,0.00005674278,0.037952855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968707,0.00042251378,0.0007406412,0.00078088837,0.00063526514,0.00054999435],"domain_scores_gemma":[0.9983394,0.00026136116,0.0003546793,0.00056947785,0.000108200526,0.00036689584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045227245,0.0004656551,0.0007229263,0.00028363886,0.00038602858,0.00048843026,0.0005274648,0.00021321498,0.00007368338],"category_scores_gemma":[0.000033809214,0.00044504929,0.00014313738,0.0003785773,0.00022563773,0.00019965696,0.000029976245,0.000767273,0.000052971987],"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.00020362777,0.0013137786,0.004604693,0.0012175901,0.0012621911,0.00014906515,0.027466718,0.1421283,0.008868898,0.0319346,0.005465541,0.775385],"study_design_scores_gemma":[0.0037023914,0.0011134752,0.00056033843,0.00049841724,0.00015019631,0.00017968501,0.0007275753,0.8848,0.0018511501,0.00013697974,0.10532658,0.0009532051],"about_ca_topic_score_codex":0.00060087896,"about_ca_topic_score_gemma":0.000023264784,"teacher_disagreement_score":0.77443177,"about_ca_system_score_codex":0.00002985034,"about_ca_system_score_gemma":0.0000311005,"threshold_uncertainty_score":0.99980015},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10489377,0.000030468338,0.8909437,0.00046624814,0.00012436521,0.00006755405,2.7399213e-7,0.00010400676,0.003369583],"genre_scores_gemma":[0.98551685,0.0000016479102,0.014176156,0.00016001631,0.000059440317,0.0000054354864,0.000025511134,0.0000013950979,0.00005352554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995428,0.00002534081,0.00014606249,0.00006702237,0.00013197401,0.00008682544],"domain_scores_gemma":[0.9997755,0.000022884313,0.000086628796,0.000043640073,0.000047565274,0.000023747738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013934348,0.000053979787,0.000046311518,0.000103464605,0.00013526864,0.00021317958,0.00006503161,0.00002231269,0.0000034299676],"category_scores_gemma":[0.000008720217,0.000050524253,0.000013510231,0.00015201214,0.000009316968,0.00061399426,0.000037173333,0.00007445907,0.00008144602],"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":[9.910004e-7,0.0000089156665,0.00057428196,0.00000833326,0.0000011283099,4.213449e-7,0.0014375967,0.08523058,0.0000047812987,0.012373021,0.0000839677,0.900276],"study_design_scores_gemma":[0.00017967154,0.000025760866,0.019854143,0.000005989359,8.6279914e-7,0.000008760415,0.00003686871,0.9670899,0.00002238568,0.00033067976,0.012380088,0.000064878455],"about_ca_topic_score_codex":0.00007052625,"about_ca_topic_score_gemma":6.1400186e-7,"teacher_disagreement_score":0.9002111,"about_ca_system_score_codex":0.000009894669,"about_ca_system_score_gemma":0.0000076063325,"threshold_uncertainty_score":0.20603192},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37223157,0.0000055321125,0.51895744,0.0010836628,0.00042913953,0.0001000532,2.2627063e-7,0.000932331,0.10626004],"genre_scores_gemma":[0.910652,3.569212e-7,0.07737972,0.00017691925,0.00010478416,0.000004867338,0.0000014346642,0.00000982542,0.011670101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918467,0.00003701668,0.00007769078,0.00029237266,0.0001923631,0.00021586675],"domain_scores_gemma":[0.99945015,0.00004735901,0.000052103685,0.00031234405,0.000054808235,0.000083214465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015489478,0.00010287047,0.000094752126,0.000055751145,0.00028084207,0.00015425186,0.00046063412,0.00004073712,0.00018786784],"category_scores_gemma":[0.000021046122,0.00007300818,0.000025788197,0.00020921674,0.00003809162,0.00030366232,0.00013477051,0.00066186,0.00017246124],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002049181,0.0002679935,0.02161501,0.000018762243,0.00007253737,0.00011518037,0.004190161,0.0016934084,0.029346552,0.17294891,0.0012690611,0.7684419],"study_design_scores_gemma":[0.0026826456,0.0016456287,0.09302223,0.000044234675,0.000022863014,0.00029200074,0.0004818328,0.5308334,0.022346,0.0041283905,0.34281537,0.001685386],"about_ca_topic_score_codex":0.00018679685,"about_ca_topic_score_gemma":0.00008776224,"teacher_disagreement_score":0.76675653,"about_ca_system_score_codex":0.0000059213994,"about_ca_system_score_gemma":0.000028475846,"threshold_uncertainty_score":0.29771873},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068995156,0.0000020167013,0.9693706,0.0011582162,0.00005135139,0.000019883033,6.45911e-8,0.000242627,0.022255724],"genre_scores_gemma":[0.7128155,6.754788e-7,0.28491578,0.00026222478,0.000028142647,0.0000018673823,2.0542042e-7,0.0000019187066,0.001973673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996707,0.0000066196767,0.000035814635,0.00012394323,0.000075848104,0.00008709796],"domain_scores_gemma":[0.99985105,0.000004826902,0.000012065425,0.00008538186,0.000018796633,0.000027909808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000038463393,0.000036853995,0.000031672123,0.000028173828,0.000060722952,0.000036424506,0.00015210078,0.000015666365,0.000008155213],"category_scores_gemma":[0.000006408323,0.000030051213,0.000016545455,0.00013416783,0.0000044187836,0.00019102579,0.000035460198,0.000076256656,0.00006864548],"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.0000012757636,0.00003808346,0.000034820387,0.0000012192133,0.000004702801,0.0000012712785,0.00051082583,0.4920393,0.0006883881,0.38379222,0.00018674876,0.12270114],"study_design_scores_gemma":[0.00012073466,0.000023760076,0.00020528772,0.0000012768644,4.4984168e-7,0.000006302204,0.0000031845161,0.96831745,0.003995001,0.027061846,0.00021631028,0.000048374546],"about_ca_topic_score_codex":0.000075224205,"about_ca_topic_score_gemma":0.0000058897713,"teacher_disagreement_score":0.705916,"about_ca_system_score_codex":0.000023024992,"about_ca_system_score_gemma":0.000034997523,"threshold_uncertainty_score":0.12254529},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011758756,0.0000380822,0.97573805,0.0020303968,0.00093887944,0.00007108178,2.5771385e-7,0.00039599676,0.0090284925],"genre_scores_gemma":[0.620896,6.788473e-7,0.3784452,0.00047542612,0.00014303313,0.0000019611366,3.5277733e-7,0.0000043655314,0.000032989738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768156,0.00012021641,0.00018799263,0.00061925914,0.0008898435,0.0005011522],"domain_scores_gemma":[0.9982203,0.00010963515,0.000050963168,0.0007800799,0.000337512,0.0005015131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015134991,0.00015631632,0.00016508436,0.00014318936,0.0003130193,0.0005005095,0.0025917708,0.000040206978,0.000028520328],"category_scores_gemma":[0.00020382585,0.00011493378,0.000035433583,0.0013340559,0.0014233509,0.0006336449,0.0015314041,0.00025432836,0.00025133847],"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.0000026294122,0.00003695532,0.00009619573,0.0000018366047,0.0000012670437,0.000009225915,0.00027795965,0.0004307032,0.0001210681,0.92428964,0.00026353478,0.07446898],"study_design_scores_gemma":[0.0002638643,0.00015264702,0.00021511901,0.000017895576,0.0000013258485,0.000040755272,0.0000044134918,0.90592796,0.0016395844,0.0878627,0.0036851887,0.0001885232],"about_ca_topic_score_codex":0.0000046717946,"about_ca_topic_score_gemma":8.065637e-8,"teacher_disagreement_score":0.90549725,"about_ca_system_score_codex":0.000036860005,"about_ca_system_score_gemma":0.00019792368,"threshold_uncertainty_score":0.5244396},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008141484,0.00004672411,0.9863136,0.0008568652,0.00046077275,0.0002541887,0.0000012093369,0.0006194524,0.0033056997],"genre_scores_gemma":[0.47427493,3.0252212e-7,0.5243397,0.000670241,0.00018347523,0.000014025817,0.0000043255504,0.000015896261,0.00049711834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980884,0.000046006517,0.00035302952,0.0004796769,0.00028630768,0.00074658316],"domain_scores_gemma":[0.9986098,0.00061522506,0.00017007548,0.0003718931,0.0000702564,0.00016279095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002075665,0.00020234442,0.00021226861,0.00014951406,0.0003845385,0.00025276365,0.0005604357,0.00013908002,0.00001860566],"category_scores_gemma":[0.00024491394,0.0001786922,0.000111293084,0.00059629313,0.000019941761,0.00028077012,0.0001817565,0.0004410944,0.000022641463],"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.000007814065,0.000079394806,0.0032872986,0.000034680368,0.000026435397,0.000017854716,0.0033885187,0.000514758,0.000117405405,0.63366556,0.00014220209,0.3587181],"study_design_scores_gemma":[0.0015815414,0.0005876151,0.0055959197,0.00028592418,0.00002190054,0.000065565364,0.004781221,0.8259903,0.00051360216,0.1088547,0.0503845,0.0013371926],"about_ca_topic_score_codex":0.00003361103,"about_ca_topic_score_gemma":0.000049036204,"teacher_disagreement_score":0.8254756,"about_ca_system_score_codex":0.00003366477,"about_ca_system_score_gemma":0.000063085405,"threshold_uncertainty_score":0.7286856},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34256732,0.00036688265,0.47808164,0.16882186,0.0012186537,0.002310132,0.0000016439024,0.00043127156,0.006200597],"genre_scores_gemma":[0.9928561,0.000005974992,0.005020635,0.0019025472,0.0000748558,0.000008685235,0.0000011485961,0.0000074754503,0.00012261038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997959,0.00047583797,0.0003031307,0.0005148979,0.0003533031,0.00039380832],"domain_scores_gemma":[0.99617094,0.002659428,0.00011524107,0.00081476883,0.00015866949,0.00008092973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005251766,0.00018306458,0.00023858536,0.00005388686,0.00092249905,0.0004903905,0.0011547114,0.000056991146,0.0000012847968],"category_scores_gemma":[0.0008503678,0.000100725934,0.000104790175,0.00049977464,0.00022624386,0.0000986051,0.0003113033,0.00057448656,0.000004921535],"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.000029113933,0.00008244041,0.00019711108,0.000014167025,0.000009109655,6.5155166e-7,0.0012288494,0.00039172123,0.0000037913487,0.9546102,0.0005437182,0.042889092],"study_design_scores_gemma":[0.0011279136,0.0002449438,0.00092135696,0.000028401626,0.0000043267764,0.000005648549,0.000024205629,0.47733027,0.00008758631,0.5181355,0.0019631,0.00012672566],"about_ca_topic_score_codex":0.000019155179,"about_ca_topic_score_gemma":5.123186e-7,"teacher_disagreement_score":0.65028876,"about_ca_system_score_codex":0.000073364456,"about_ca_system_score_gemma":0.000072641364,"threshold_uncertainty_score":0.709521},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6686102,0.00033015077,0.32412395,0.0023847006,0.0010948089,0.0011994786,0.00015314705,0.0005361428,0.0015673918],"genre_scores_gemma":[0.010670352,0.00009711033,0.51117766,0.000016030404,0.00013227304,0.0000021961346,0.0006453237,0.000027058051,0.477232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988551,0.000029607587,0.00013462876,0.00044572708,0.00029873263,0.00023621655],"domain_scores_gemma":[0.9987315,0.00013818977,0.00027830523,0.00038380147,0.00038286776,0.000085364445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014036923,0.00021148552,0.00031221987,0.00029315325,0.00030479525,0.0000546136,0.0009609349,0.0002166493,0.000055673972],"category_scores_gemma":[0.000084659885,0.00022723955,0.00015186981,0.00033097347,0.000028496852,0.00041673405,0.00008326206,0.00020640579,0.00003098138],"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.0004560431,0.00059711345,0.00039905155,0.003750512,0.00030968478,0.000026566164,0.28381476,0.0023240126,0.00095220166,0.0033251909,0.0122370655,0.6918078],"study_design_scores_gemma":[0.0074211634,0.0015362586,0.012124791,0.0025650018,0.000543105,0.00002191491,0.13421269,0.7257434,0.0070500425,0.0059661125,0.09886181,0.0039536785],"about_ca_topic_score_codex":0.0016260031,"about_ca_topic_score_gemma":0.0072321105,"teacher_disagreement_score":0.7234194,"about_ca_system_score_codex":0.000039521903,"about_ca_system_score_gemma":0.000176996,"threshold_uncertainty_score":0.92665595},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035920102,0.000018014274,0.9606094,0.000625417,0.00003476414,0.0002718437,3.137187e-7,0.00006285126,0.0024573244],"genre_scores_gemma":[0.908288,0.0000057523894,0.09147055,0.000107504624,0.000015053394,0.000018240515,0.0000023201312,0.000006765622,0.00008580579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990543,0.000046452176,0.00027848678,0.00024061662,0.0002517875,0.0001283504],"domain_scores_gemma":[0.999139,0.00023287542,0.00021760583,0.0002999036,0.000042163607,0.000068457215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030768052,0.000107880725,0.00014094787,0.00007766812,0.00010078776,0.00010480913,0.00048928877,0.00003240794,0.000009455029],"category_scores_gemma":[0.0001430875,0.00007771191,0.000019087012,0.00040723773,0.000053588905,0.00014083041,0.00015455633,0.00014437328,0.000029024368],"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.0000042686743,0.0000149840735,0.00030243088,0.000016307056,0.0000058259243,1.8257352e-7,0.0016170394,0.11226087,0.0025148678,0.26275232,0.0000658407,0.6204451],"study_design_scores_gemma":[0.000043778822,0.00016270178,0.0041225823,0.00006009023,0.0000035780015,0.0000015023871,0.00011213236,0.95407456,0.006949811,0.034340177,0.000035671896,0.0000934216],"about_ca_topic_score_codex":0.0004127751,"about_ca_topic_score_gemma":0.0000019341066,"teacher_disagreement_score":0.8723679,"about_ca_system_score_codex":0.000009432144,"about_ca_system_score_gemma":0.000030821666,"threshold_uncertainty_score":0.31689999},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71137196,0.0000945615,0.0038994302,0.04705405,0.023597177,0.0010120544,0.000025312997,0.00048733482,0.21245812],"genre_scores_gemma":[0.9953901,0.00001762914,0.0016526624,0.00016254891,0.0004624127,0.000019565337,0.000003309964,0.000019357376,0.002272393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971054,0.000057236874,0.00031670404,0.0005236167,0.0016495452,0.00034749295],"domain_scores_gemma":[0.9980793,0.00021836582,0.00012455528,0.00025652463,0.0012150984,0.000106161155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010450841,0.00017611663,0.00020953981,0.00009155805,0.00022314627,0.00044430417,0.0025917927,0.00007927311,0.00003656234],"category_scores_gemma":[0.00043026166,0.00013795613,0.00015061011,0.0006274706,0.000108565575,0.0002627013,0.0012476755,0.00058732525,0.000046170826],"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.0000851444,0.0005578538,0.0038756698,0.0000912164,0.000087434935,0.000010024681,0.0005791081,0.00038452778,0.045362007,0.941925,0.0020916772,0.0049503595],"study_design_scores_gemma":[0.0026541608,0.00055664114,0.002902747,0.00045507398,0.000022786828,0.00019281762,0.00016266556,0.1229858,0.8044645,0.04860764,0.0163415,0.00065362174],"about_ca_topic_score_codex":0.000081052254,"about_ca_topic_score_gemma":5.4508416e-7,"teacher_disagreement_score":0.89331734,"about_ca_system_score_codex":0.00016008562,"about_ca_system_score_gemma":0.00018054311,"threshold_uncertainty_score":0.5625688},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028320748,0.000009731643,0.94125277,0.00024968415,0.0005461685,0.000049497015,2.3288698e-7,0.00015286478,0.029418308],"genre_scores_gemma":[0.8894551,8.4459634e-7,0.11022517,0.00016447902,0.000035114925,0.0000017719522,1.8537693e-7,0.0000046469295,0.0001127291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816227,0.00021156087,0.00019858533,0.00048933027,0.0005646734,0.00037356856],"domain_scores_gemma":[0.9987447,0.00034446374,0.000069976166,0.0005506851,0.00012674814,0.00016337246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015163895,0.00012212906,0.00015556907,0.00018954446,0.00039945336,0.00014404132,0.0010724778,0.000031709176,0.000078792575],"category_scores_gemma":[0.0004193781,0.00009662185,0.000056984645,0.0011728861,0.001064596,0.00023971114,0.0002361405,0.00032842648,0.00011567256],"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.000001947004,0.000044157146,0.00006949396,0.0000025678712,0.0000017338876,0.0000027029423,0.0001311328,0.004194492,0.00023769258,0.97059536,0.000024946483,0.024693754],"study_design_scores_gemma":[0.00023345355,0.0007384298,0.00051144336,0.000031206237,0.0000029835608,0.000037104375,0.0000075483094,0.8293991,0.0039071436,0.16348493,0.0014380781,0.00020857027],"about_ca_topic_score_codex":0.0000019031821,"about_ca_topic_score_gemma":4.1160998e-8,"teacher_disagreement_score":0.8611343,"about_ca_system_score_codex":0.000023511215,"about_ca_system_score_gemma":0.000090175854,"threshold_uncertainty_score":0.39401245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5955049,0.0017299502,0.38992906,0.009969783,0.000737942,0.0002095333,0.0000012590002,0.000147422,0.0017701982],"genre_scores_gemma":[0.9018227,0.00011714257,0.09698966,0.00012293668,0.00039226352,0.0000013052916,0.0000022245958,0.000025302905,0.00052647496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939112,0.0032679576,0.00051722693,0.0003900715,0.0013753792,0.0005381677],"domain_scores_gemma":[0.9941788,0.0041129747,0.0004136602,0.0003822812,0.00056687795,0.00034542746],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.011154839,0.00019679498,0.00040067747,0.00065611856,0.0010830633,0.0003269939,0.0008330618,0.00010527714,0.000027803471],"category_scores_gemma":[0.006953037,0.00014597859,0.00010272461,0.0003838959,0.00011500514,0.00046902135,0.0007943188,0.004100969,0.000020890764],"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.00024092376,0.00037474572,0.05462037,0.00013301229,0.00010193191,0.00016870002,0.007592945,0.0144733675,0.01606786,0.020864788,0.0068280557,0.8785333],"study_design_scores_gemma":[0.0018670213,0.002812125,0.012080247,0.00064155326,0.000016040462,0.0006498626,0.00023728357,0.8718269,0.00082828454,0.014027052,0.09462915,0.00038446733],"about_ca_topic_score_codex":0.0003491336,"about_ca_topic_score_gemma":0.000004333811,"teacher_disagreement_score":0.87814885,"about_ca_system_score_codex":0.000060788116,"about_ca_system_score_gemma":0.0000738665,"threshold_uncertainty_score":0.9981966},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16966906,0.0000055537535,0.824196,0.00008605745,0.0012169671,0.00012406062,1.1204296e-7,0.00048385703,0.004218326],"genre_scores_gemma":[0.84450585,3.1019093e-7,0.15427448,0.000086959255,0.00017195112,0.0000037560558,5.808735e-7,0.00001096307,0.0009451366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984441,0.00009322198,0.0003283853,0.00040978123,0.0003593724,0.00036513965],"domain_scores_gemma":[0.99934906,0.000084080966,0.00008564322,0.00031055888,0.000050503797,0.00012016441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011860089,0.00014087865,0.00017815869,0.00034124535,0.00012230032,0.0002466983,0.00050132745,0.000058272053,0.0000034610466],"category_scores_gemma":[0.000047431757,0.00013159153,0.00004362747,0.0005529572,0.000005480616,0.0004097639,0.00033561882,0.00034390032,0.000059440183],"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.000020634032,0.00010925548,0.005681221,0.00003522447,0.000014826,0.000078188714,0.004558866,0.9315185,0.0022695216,0.013988994,0.00010741694,0.041617338],"study_design_scores_gemma":[0.0003108649,0.000053572458,0.0009967084,0.00008574689,0.0000025142558,0.00003068078,0.00057970005,0.99681216,0.00009610965,0.000024882504,0.0008466666,0.00016039528],"about_ca_topic_score_codex":0.00057459064,"about_ca_topic_score_gemma":0.000076246055,"teacher_disagreement_score":0.6748368,"about_ca_system_score_codex":0.00030473908,"about_ca_system_score_gemma":0.00004943224,"threshold_uncertainty_score":0.53661466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06351642,0.00006733855,0.93411905,0.00043103736,0.000056869958,0.000034714056,0.0000020037482,0.000054007356,0.0017185558],"genre_scores_gemma":[0.8561939,0.000018301402,0.14354786,0.00001202499,0.00001616891,8.051118e-7,0.000012013358,0.0000023900643,0.00019650249],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994462,0.000037231373,0.00013902246,0.00019769774,0.000116122465,0.00006371586],"domain_scores_gemma":[0.9993659,0.000046255394,0.000103023594,0.0004132053,0.00004299575,0.00002857967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019445585,0.000046446115,0.00008206997,0.00005182823,0.000063513304,0.000018895716,0.0003158208,0.000025188778,0.00000932529],"category_scores_gemma":[0.00007641525,0.000036822406,0.000011535532,0.00012756714,0.000039287464,0.00022638791,0.00016728703,0.00008616121,0.0000030964184],"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.000012227969,0.0002842486,0.04946284,0.00010833949,0.00003789857,0.0000022097513,0.002072869,0.011610695,0.6102764,0.15506932,0.0005634128,0.17049953],"study_design_scores_gemma":[0.0011359152,0.0003383432,0.13913417,0.00013121736,0.000017695525,0.000023809314,0.00035329006,0.726389,0.124579705,0.0031270504,0.0045021465,0.00026768167],"about_ca_topic_score_codex":0.000089053356,"about_ca_topic_score_gemma":0.000003035682,"teacher_disagreement_score":0.7926775,"about_ca_system_score_codex":0.0000038719163,"about_ca_system_score_gemma":0.000028986993,"threshold_uncertainty_score":0.1501574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076929494,0.00001626548,0.9535659,0.00047448018,0.00009305548,0.00001809718,3.1467575e-8,0.00015100978,0.037988197],"genre_scores_gemma":[0.92573273,0.0000021266924,0.07232158,0.00009057979,0.000043150845,8.32214e-7,3.7381636e-7,0.0000035839391,0.0018050459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939895,0.00009069577,0.00010888989,0.00015005526,0.00012595212,0.00012545241],"domain_scores_gemma":[0.99944705,0.00022716731,0.00004980381,0.00020460636,0.000027451126,0.000043914948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025912042,0.000057928482,0.000095757896,0.000051663323,0.00005690134,0.000031671305,0.00031946937,0.000021375929,0.00004275966],"category_scores_gemma":[0.00025034393,0.000046672194,0.00003269378,0.00013391435,0.000015785485,0.000077376775,0.0000891872,0.00010829408,0.000044843415],"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.000001231983,0.000039747465,0.012027234,0.000028715902,0.000010095353,0.0000032252801,0.00058205856,0.008935974,0.0014295101,0.38129416,0.0005047841,0.59514326],"study_design_scores_gemma":[0.00011956947,0.00012077785,0.003797082,0.000015442763,0.0000018223602,0.0000061697247,0.000008852826,0.98310846,0.0019960045,0.0026111414,0.008124907,0.00008978655],"about_ca_topic_score_codex":0.0000646923,"about_ca_topic_score_gemma":0.0000018012701,"teacher_disagreement_score":0.9741725,"about_ca_system_score_codex":0.0000026617743,"about_ca_system_score_gemma":0.000009853848,"threshold_uncertainty_score":0.19032368},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046726707,0.000024721052,0.94932556,0.002356316,0.00009057925,0.000028872606,7.409043e-8,0.00022193285,0.04327927],"genre_scores_gemma":[0.8736135,0.000004198271,0.12221605,0.0002727851,0.00005657351,2.1844643e-7,6.564122e-7,0.0000029035193,0.0038331067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928516,0.000055225388,0.0001407064,0.00018407624,0.0001662496,0.00016858264],"domain_scores_gemma":[0.99957347,0.00003657468,0.000062376006,0.00022875033,0.000032562868,0.00006626197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020039674,0.000074916206,0.00011327781,0.0000701076,0.00008152224,0.00003047992,0.0003640652,0.00003691103,0.00004162009],"category_scores_gemma":[0.000053926553,0.00006096771,0.000053139924,0.000248945,0.000017364591,0.0001263858,0.000040109717,0.0002081548,0.000028152392],"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.000003991537,0.00007834155,0.0027949926,0.000008634851,0.000011514428,0.0000148552235,0.0011480522,0.005304967,0.0016978377,0.1730581,0.0009379645,0.81494075],"study_design_scores_gemma":[0.0001918067,0.00028868337,0.0043350398,0.0000118884545,0.0000020254004,0.000007655192,0.000051878804,0.98269737,0.0017568774,0.001985361,0.008541153,0.00013028173],"about_ca_topic_score_codex":0.000024162351,"about_ca_topic_score_gemma":4.7238396e-7,"teacher_disagreement_score":0.9773924,"about_ca_system_score_codex":0.0000066576754,"about_ca_system_score_gemma":0.000023683753,"threshold_uncertainty_score":0.24861911},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04201717,0.000021164335,0.9456042,0.0062792893,0.0003335748,0.00033293533,0.000005734844,0.0003636037,0.005042314],"genre_scores_gemma":[0.8175077,0.000041254945,0.18107402,0.0007262601,0.0002441225,0.00003613574,0.00000474348,0.000023421015,0.00034238124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977255,0.0000029469334,0.0004935465,0.0006717542,0.0005564873,0.0005498075],"domain_scores_gemma":[0.9980512,0.0001757484,0.00040705653,0.00005408895,0.0010886613,0.00022319399],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009742169,0.0003421513,0.00031066296,0.00032975062,0.00052141596,0.0012298973,0.00053020427,0.0001972813,0.000010782949],"category_scores_gemma":[0.0002834728,0.00032336023,0.000080640275,0.0002265563,0.00010128978,0.0011928694,0.0001405391,0.0005604418,0.0000048585766],"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.00005251934,0.000049550043,0.0010468797,0.00006874308,0.0000502011,5.4591675e-7,0.00086330203,0.015616605,0.0014258574,0.96869844,0.00008204765,0.012045288],"study_design_scores_gemma":[0.00080164487,0.00022283132,0.0014294283,0.00015018394,0.000019883359,0.000028118202,0.00042764176,0.8830963,0.0003324251,0.11302176,0.00012595288,0.00034385466],"about_ca_topic_score_codex":0.000008803077,"about_ca_topic_score_gemma":9.728954e-7,"teacher_disagreement_score":0.8674797,"about_ca_system_score_codex":0.000081549886,"about_ca_system_score_gemma":0.000051935105,"threshold_uncertainty_score":0.99992186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044468276,0.000048387174,0.95288897,0.00032323372,0.0016222626,0.00012163457,0.000012801311,0.00034412558,0.0001703345],"genre_scores_gemma":[0.76683354,0.00001127286,0.23208939,0.00010190934,0.00025840726,0.00004708506,0.00000572267,0.000029174356,0.00062352535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988756,0.000025923942,0.00016182166,0.00053353986,0.000114085,0.00028899076],"domain_scores_gemma":[0.99888444,0.00009229813,0.00001803489,0.0007313287,0.000031876978,0.00024203163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027320956,0.00018395473,0.00016413389,0.00022566992,0.00023914041,0.00020765419,0.0006227248,0.00006061877,0.000015430456],"category_scores_gemma":[0.00002760398,0.0001796962,0.00003054804,0.00032413402,0.000009896495,0.0003938798,0.00003720854,0.00041467563,0.000047677917],"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.00001824053,0.00011510889,0.000020112666,0.000059787217,0.000052049647,0.000017439248,0.00635638,0.079611614,0.27814087,0.002155364,0.00059999846,0.63285303],"study_design_scores_gemma":[0.0004547292,0.00018918968,0.000083379164,0.00006748383,0.00001040173,0.000034086963,0.00006715989,0.78954816,0.028707217,0.000027469076,0.18025629,0.00055441755],"about_ca_topic_score_codex":0.00004357141,"about_ca_topic_score_gemma":0.000059474594,"teacher_disagreement_score":0.72236526,"about_ca_system_score_codex":0.0000141305745,"about_ca_system_score_gemma":0.000024282968,"threshold_uncertainty_score":0.7327798},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020654346,0.00004269485,0.9929924,0.0005139163,0.00043182832,0.00016439923,0.0000031709158,0.0004935473,0.0032925934],"genre_scores_gemma":[0.749171,0.000010179725,0.24509853,0.0005377235,0.00018923686,0.0000407511,0.000021933827,0.000026529628,0.0049041286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816453,0.0005359022,0.00020111729,0.000520967,0.00020378121,0.00037371242],"domain_scores_gemma":[0.9972623,0.0018531069,0.00016537016,0.0004555558,0.0001384051,0.00012525158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009713296,0.000212466,0.00025176178,0.00009057247,0.0004413685,0.00022197005,0.00084585603,0.00009570292,0.0000834905],"category_scores_gemma":[0.0018083588,0.00017878241,0.00007171061,0.0001208813,0.00010774081,0.00016957063,0.00017662195,0.0004893184,0.00009550877],"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.00001797275,0.000056964298,0.00015868722,0.000010384337,0.000007162917,4.725518e-7,0.00051280245,0.00081049296,0.00036811258,0.6062626,0.00018490726,0.39160943],"study_design_scores_gemma":[0.0010021793,0.00046722247,0.0003741981,0.000091563226,0.0000052559003,0.000001963055,0.00007886252,0.9411732,0.00051397213,0.029114349,0.026920654,0.0002565891],"about_ca_topic_score_codex":0.00001339414,"about_ca_topic_score_gemma":7.8315213e-7,"teacher_disagreement_score":0.9403627,"about_ca_system_score_codex":0.000018169383,"about_ca_system_score_gemma":0.00005505389,"threshold_uncertainty_score":0.72905356},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030496778,0.000104213264,0.96609306,0.0005268378,0.0004811355,0.00013516113,4.632676e-7,0.0002605398,0.0019018106],"genre_scores_gemma":[0.59758097,4.777244e-7,0.40131035,0.00017943607,0.00018910725,0.000021193024,8.8622863e-7,0.000006272982,0.0007113148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992256,0.000018594852,0.000119497025,0.00016130981,0.00011836121,0.00035663985],"domain_scores_gemma":[0.9995342,0.0000988741,0.000038859132,0.00020999053,0.0000233823,0.00009468147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053149293,0.00007665118,0.00007841058,0.000046640802,0.00015288945,0.00010070741,0.00027031818,0.000021862876,0.000013741477],"category_scores_gemma":[0.000024840378,0.00005898096,0.00004756828,0.00012723442,0.0000071810196,0.00010452361,0.00010709726,0.00007553939,0.000070478294],"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.000003501741,0.00029306233,0.0040530455,0.00011854986,0.000028322194,4.4314692e-7,0.0069594095,0.2687693,0.0035166768,0.5012338,0.00079497375,0.21422891],"study_design_scores_gemma":[0.00018092671,0.000030731728,0.0010527134,0.000017846893,0.000002767302,0.0000073172764,0.000022972621,0.96893394,0.000410256,0.0018154122,0.027361764,0.00016335044],"about_ca_topic_score_codex":0.000028031585,"about_ca_topic_score_gemma":7.7012663e-7,"teacher_disagreement_score":0.7001646,"about_ca_system_score_codex":0.000011479116,"about_ca_system_score_gemma":0.00000938506,"threshold_uncertainty_score":0.24051738},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025811572,0.000024189998,0.90624905,0.0019545287,0.00004228347,0.000063367654,1.2364872e-7,0.0002810342,0.06557384],"genre_scores_gemma":[0.91673666,0.0000013604639,0.080571234,0.000511172,0.000027690776,0.0000016625715,7.4230985e-7,0.0000014241947,0.0021480594],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99952406,0.000025114392,0.000042159394,0.00017295503,0.00013050488,0.000105199055],"domain_scores_gemma":[0.9997086,0.000027638105,0.000023250668,0.00016307055,0.00004503388,0.0000324377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057989477,0.000059281596,0.000049853355,0.000037727175,0.00006969756,0.00008729899,0.00022155934,0.00001712721,0.000007647293],"category_scores_gemma":[0.000014308841,0.000038170994,0.00001106322,0.00019234125,0.000007970057,0.00020737553,0.000013846766,0.000094406525,0.000020309128],"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.000013113754,0.00006287952,0.00156722,0.0000024415094,0.000008323801,0.000008938962,0.0016825639,0.0009625437,0.00044667817,0.30680746,0.0010323654,0.68740547],"study_design_scores_gemma":[0.0004553775,0.0010259778,0.89793175,0.000022537452,0.0000036816502,0.000043633656,0.00006507242,0.07572263,0.0037713232,0.01963921,0.0010281255,0.0002906963],"about_ca_topic_score_codex":0.00004417794,"about_ca_topic_score_gemma":0.000007523435,"teacher_disagreement_score":0.8963645,"about_ca_system_score_codex":0.000007471776,"about_ca_system_score_gemma":0.000015250833,"threshold_uncertainty_score":0.1556568},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28402326,0.0000021942685,0.7109817,0.0006724023,0.0008245504,0.00007159002,1.9192069e-7,0.0002266364,0.0031974379],"genre_scores_gemma":[0.88861096,6.005423e-7,0.11098624,0.0002342078,0.00013594428,0.000004704133,2.912335e-7,0.000006671304,0.000020407277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780256,0.00011965001,0.0002095259,0.00071952195,0.0005313396,0.0006174215],"domain_scores_gemma":[0.99873734,0.0003037531,0.00005632591,0.0005649883,0.00008704463,0.00025055013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012865597,0.00016829272,0.00018018314,0.00027348765,0.00033106538,0.0004092822,0.0021453619,0.00005750727,0.000047547488],"category_scores_gemma":[0.00032577253,0.00014070865,0.0000471233,0.0012059109,0.0014566709,0.0006043421,0.0009400599,0.0011075082,0.00012106218],"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.0000041682833,0.000050612503,0.00082245766,0.0000027950791,9.307132e-7,0.000020354722,0.00054292445,0.0012517703,0.004852966,0.8217667,0.0000026579291,0.17068169],"study_design_scores_gemma":[0.00023863927,0.00014730843,0.013296335,0.000015363374,9.572766e-7,0.000043586926,0.000003999212,0.9512006,0.002747467,0.031955767,0.00014116669,0.00020880782],"about_ca_topic_score_codex":0.000010434485,"about_ca_topic_score_gemma":0.0000026466723,"teacher_disagreement_score":0.94994885,"about_ca_system_score_codex":0.000028632001,"about_ca_system_score_gemma":0.00010795365,"threshold_uncertainty_score":0.57379323},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023724248,0.00018824196,0.91325897,0.002722113,0.00014235589,0.00004626039,2.9834286e-8,0.00033988184,0.080929734],"genre_scores_gemma":[0.9473156,0.000017633498,0.008227618,0.00068545627,0.000108523156,0.000005329136,1.9278751e-7,0.000006643672,0.043633044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916726,0.00020568355,0.00009013724,0.00019212498,0.0001546586,0.00019010261],"domain_scores_gemma":[0.9993409,0.00021257458,0.000035985082,0.00035161534,0.000016010006,0.000042946216],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046684174,0.00008080779,0.000068177396,0.000030445939,0.00026366665,0.00012909682,0.000612858,0.000023597559,0.0007210474],"category_scores_gemma":[0.00005647315,0.000045907942,0.000045551646,0.00019129283,0.000029788282,0.00014701342,0.00014782177,0.0002988236,0.00078435853],"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":[8.201862e-7,0.0000322163,0.0005387707,0.0000020429457,0.0000123670925,0.000009005875,0.0014447874,0.0019313873,0.0001365947,0.10647397,0.0016502495,0.8877678],"study_design_scores_gemma":[0.00009344391,0.00004485922,0.0008729031,0.0000026696143,0.0000018478772,0.00002265856,0.000031508975,0.9535322,0.00018400096,0.005185391,0.03992733,0.00010118959],"about_ca_topic_score_codex":0.000031095497,"about_ca_topic_score_gemma":6.789194e-7,"teacher_disagreement_score":0.9516008,"about_ca_system_score_codex":0.000006701034,"about_ca_system_score_gemma":0.000002915948,"threshold_uncertainty_score":0.9999936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09742968,0.000020661093,0.8237294,0.0010018848,0.000057427307,0.00039065097,0.00011450919,0.00022860608,0.077027194],"genre_scores_gemma":[0.85848033,0.00041710775,0.12938271,0.000021863027,0.00008280851,1.0886266e-7,0.00024180178,0.000028777695,0.011344494],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99585915,0.0006328844,0.00014361614,0.0011119485,0.0011893312,0.0010630754],"domain_scores_gemma":[0.9961798,0.0011332432,0.00023076634,0.0015177369,0.00042592667,0.0005124791],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017118504,0.00026854716,0.00037010465,0.00094498694,0.0015708476,0.000089571295,0.0059395637,0.00011221129,0.00008412717],"category_scores_gemma":[0.0002171676,0.00029660616,0.0001029697,0.0017998773,0.0009180159,0.0021456406,0.005115379,0.0017297021,0.000015941334],"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.005419394,0.0010974336,0.16216981,0.00045563126,0.0011453645,0.003398527,0.023755638,0.0031087857,0.0020317114,0.11157361,0.00501564,0.68082845],"study_design_scores_gemma":[0.0032028332,0.0019177282,0.13919039,0.00024376975,0.000060634855,0.000039815448,0.014765532,0.10504427,0.00014820891,0.0012098412,0.73333836,0.0008386425],"about_ca_topic_score_codex":0.0023694497,"about_ca_topic_score_gemma":0.0028838953,"teacher_disagreement_score":0.76105064,"about_ca_system_score_codex":0.00017340411,"about_ca_system_score_gemma":0.00042251157,"threshold_uncertainty_score":0.9999486},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038876254,0.000047524798,0.95966035,0.00046758333,0.00024466828,0.00017233971,0.000025561718,0.00022069778,0.0002850433],"genre_scores_gemma":[0.9522291,0.000011422998,0.044819057,0.00014790244,0.00017557615,0.0000013844979,0.000012848446,0.000011826582,0.002590907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835175,0.0002589658,0.00014267812,0.00072555523,0.00014028733,0.0003807715],"domain_scores_gemma":[0.9981632,0.0004346385,0.00014790926,0.0007554163,0.00017239047,0.00032640807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007455516,0.00019352135,0.00025568655,0.00024283372,0.00054966984,0.0002383727,0.0012242703,0.000079995305,0.000011158311],"category_scores_gemma":[0.00023380433,0.00016594466,0.00025828055,0.0022312917,0.000054811695,0.00029439642,0.000358858,0.00038047644,0.000051275292],"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.00007899753,0.00014549382,0.08702463,0.0000049394416,0.0015322465,0.00013037956,0.0036211438,0.7516295,0.000008635026,0.015867574,0.0017034885,0.138253],"study_design_scores_gemma":[0.00053598214,0.00013614712,0.0062445826,0.0000035018566,0.00036440394,0.0000010920055,0.00031241524,0.97528857,0.000011803436,0.0064634583,0.01040372,0.00023430143],"about_ca_topic_score_codex":0.0047761234,"about_ca_topic_score_gemma":0.0004441171,"teacher_disagreement_score":0.9148413,"about_ca_system_score_codex":0.00010365763,"about_ca_system_score_gemma":0.000085778636,"threshold_uncertainty_score":0.7220102},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043264204,0.00011167166,0.9726994,0.002556186,0.0005696169,0.00015434859,5.618813e-7,0.00015269183,0.019429095],"genre_scores_gemma":[0.36648822,0.0000044321323,0.6256132,0.002662944,0.00017069677,0.000006805003,3.267023e-7,0.000014421185,0.0050389585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876434,0.00015715614,0.00016336775,0.00033884958,0.0002642412,0.00031206655],"domain_scores_gemma":[0.9990313,0.00013534442,0.000045045686,0.0006697652,0.000027913251,0.000090610156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000516053,0.00013775824,0.00011816457,0.000056990615,0.0002662367,0.0004889254,0.0007596573,0.000048193084,0.00009236402],"category_scores_gemma":[0.00014543437,0.00008259244,0.00006245328,0.00054623705,0.000021943179,0.00027542055,0.00018632153,0.00035407225,0.00011948841],"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.000001591605,0.000058719983,0.003239578,0.000008918179,0.000017995259,0.000011003199,0.00115172,0.02900098,0.0003096961,0.9510907,0.0014945442,0.013614586],"study_design_scores_gemma":[0.00034182187,0.00018613745,0.0015597065,0.00011886867,0.000012748877,0.00016345116,0.00015400631,0.6311226,0.0020064223,0.092541344,0.27094063,0.00085231225],"about_ca_topic_score_codex":0.0001346464,"about_ca_topic_score_gemma":0.000009893496,"teacher_disagreement_score":0.8585493,"about_ca_system_score_codex":0.000024081752,"about_ca_system_score_gemma":0.00004291042,"threshold_uncertainty_score":0.47147188},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045848377,0.000016940474,0.988623,0.0015953718,0.00011530558,0.0003155497,3.05443e-7,0.0003384183,0.004410244],"genre_scores_gemma":[0.7222141,0.000002105412,0.27355537,0.00029203173,0.000080869046,0.00003932298,0.000004179757,0.000005441153,0.0038065936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919075,0.000081080485,0.00009984386,0.00032408882,0.000106820735,0.00019742848],"domain_scores_gemma":[0.9994053,0.00020398569,0.00007048712,0.00018185088,0.000083622144,0.00005475363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021279998,0.00010117198,0.00010541488,0.00006708462,0.00020783392,0.00009485043,0.00028775568,0.000047853784,0.0000061879755],"category_scores_gemma":[0.00017595066,0.00008438536,0.000044431115,0.00019064973,0.000012295253,0.0002666574,0.0000303956,0.00019649521,0.000057857145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006813072,0.00007827853,0.00009260883,0.0000024359756,0.0000061266337,4.4696785e-7,0.00042499453,0.00018874796,0.0025440166,0.017393976,0.000133572,0.979128],"study_design_scores_gemma":[0.0007163394,0.00034292083,0.032967176,0.0000067363194,0.0000030881872,0.0000023718076,0.000044025554,0.9607892,0.0018319344,0.00081615924,0.0023552834,0.00012474667],"about_ca_topic_score_codex":0.000011765836,"about_ca_topic_score_gemma":0.000001275171,"teacher_disagreement_score":0.97900325,"about_ca_system_score_codex":0.000034797235,"about_ca_system_score_gemma":0.000017488088,"threshold_uncertainty_score":0.3441135},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2822849,0.00011084863,0.6824196,0.0011455612,0.00047509946,0.00016989563,0.0000073522033,0.00021272794,0.033174016],"genre_scores_gemma":[0.9822287,0.0000281901,0.013538582,0.000037112644,0.000011703247,1.5492178e-7,0.0000014075111,0.00000567531,0.004148448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991003,0.00011123935,0.000085674576,0.00025848052,0.00022164153,0.000222619],"domain_scores_gemma":[0.9991441,0.00009879895,0.00010734475,0.00052275055,0.000045488443,0.00008153971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047760026,0.00009951978,0.00012387816,0.000052978474,0.0004903695,0.000047270187,0.00088250043,0.00004177491,0.00019925435],"category_scores_gemma":[0.000057254725,0.00009229253,0.00009078936,0.00022181707,0.000102595135,0.00017768866,0.0002875237,0.0002132876,0.00021537716],"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.000080895334,0.00031332637,0.10931913,0.00010801907,0.0003631863,0.0001993287,0.03724388,0.0058677145,0.0012274096,0.5677016,0.0027912026,0.27478436],"study_design_scores_gemma":[0.0030223888,0.00020888065,0.062171124,0.00009486881,0.00003690099,0.00008879776,0.0062820003,0.2206274,0.0023205625,0.015348878,0.68871933,0.0010788555],"about_ca_topic_score_codex":0.00030714014,"about_ca_topic_score_gemma":0.000032819444,"teacher_disagreement_score":0.69994384,"about_ca_system_score_codex":0.000024274263,"about_ca_system_score_gemma":0.00004179872,"threshold_uncertainty_score":0.37715754},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02955986,0.00003228538,0.96857506,0.00034290412,0.00011347856,0.0000744997,3.6802655e-7,0.000050559516,0.0012509553],"genre_scores_gemma":[0.9807363,8.7610283e-7,0.01504847,0.00005428157,0.000064608736,0.0000031482768,0.0000018386886,0.0000024663645,0.004088014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995883,0.000017121196,0.00012145744,0.00009591037,0.00008558438,0.00009163796],"domain_scores_gemma":[0.999428,0.0002841253,0.000079063015,0.00014866899,0.000046645484,0.000013543098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006311602,0.00003370427,0.000040619205,0.000031153875,0.000081740865,0.00003485181,0.00026247773,0.000013750565,0.000006855281],"category_scores_gemma":[0.00010642812,0.00002118284,0.000029299028,0.00013132412,0.000012910976,0.0000982574,0.00003745542,0.000074617325,0.0000050725466],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066404136,0.000016944901,0.00032630624,0.0000070404403,0.000010459353,5.661012e-7,0.0047555296,0.00066228287,0.009448192,0.017097473,0.00006686797,0.9676017],"study_design_scores_gemma":[0.00025012784,0.00006845574,0.025743773,0.000005703563,0.00000524728,0.0000041015296,0.00084967416,0.89247406,0.07398499,0.00037474095,0.006153326,0.0000857802],"about_ca_topic_score_codex":0.00005348706,"about_ca_topic_score_gemma":0.000004873438,"teacher_disagreement_score":0.96751595,"about_ca_system_score_codex":0.000005551043,"about_ca_system_score_gemma":0.000007695544,"threshold_uncertainty_score":0.08638111},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004766568,0.00015745475,0.9930965,0.00082691736,0.00041896614,0.00019136585,0.0000030944109,0.0002062867,0.00033285012],"genre_scores_gemma":[0.69152683,0.0000016479228,0.30738923,0.0006130573,0.0001481064,0.00001776294,0.0000028877241,0.000012996701,0.000287465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988911,0.000053870543,0.00023956409,0.0003280274,0.00017326421,0.0003141635],"domain_scores_gemma":[0.9990362,0.00024938126,0.00009782567,0.00043107316,0.00009776669,0.00008774795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048104418,0.00014934297,0.00020342978,0.00007190627,0.0001099547,0.00006662955,0.00065377983,0.000061480336,0.000009589445],"category_scores_gemma":[0.000057705252,0.000119249904,0.00014296101,0.00023156522,0.00004792956,0.00013567269,0.00009014232,0.00015677612,0.00000252128],"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.000011472076,0.000046967838,0.00012065741,0.000010527782,0.000011802882,0.0000022201698,0.0001082054,0.8629793,0.000013496994,0.02205168,0.000056614277,0.11458708],"study_design_scores_gemma":[0.0008505236,0.0002050271,0.0005417173,0.000015088256,0.0000065037857,0.000003964643,0.0000141176515,0.99341834,0.00029222522,0.003987963,0.00050759956,0.0001569638],"about_ca_topic_score_codex":0.00013336062,"about_ca_topic_score_gemma":0.000012873562,"teacher_disagreement_score":0.6867603,"about_ca_system_score_codex":0.00001994092,"about_ca_system_score_gemma":0.00005567321,"threshold_uncertainty_score":0.486287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1788793,0.000013109614,0.81218964,0.0015197905,0.00018219676,0.00013029292,0.000001915167,0.000062423744,0.007021347],"genre_scores_gemma":[0.91538167,7.262957e-7,0.084166914,0.0003852379,0.000050018247,0.0000023140633,7.6356116e-7,0.0000036947647,0.000008639263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780047,0.00026275494,0.00021076559,0.000427013,0.00089948263,0.00039952277],"domain_scores_gemma":[0.9985755,0.00025237532,0.00006843941,0.0007926527,0.00013490034,0.00017614008],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0028584641,0.00013271185,0.00019625053,0.00012031074,0.00014871424,0.00019421127,0.0023494514,0.000027014348,0.000013756407],"category_scores_gemma":[0.0001100541,0.00007536942,0.000024028537,0.0012525095,0.0030246375,0.00033907872,0.00044771846,0.0002835691,0.000019435314],"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.000014806176,0.000051986157,0.0006988212,0.0000047440676,0.0000015081405,0.000028762486,0.001853137,0.0034379202,0.000022431372,0.9901081,0.000050680617,0.0037271446],"study_design_scores_gemma":[0.00052194024,0.00051988603,0.0040346673,0.000034113356,0.000002457218,0.000121025194,0.000046914025,0.8449645,0.0008138203,0.1485734,0.0001830035,0.00018426545],"about_ca_topic_score_codex":0.00005971465,"about_ca_topic_score_gemma":0.0000026470664,"teacher_disagreement_score":0.8415347,"about_ca_system_score_codex":0.00002764321,"about_ca_system_score_gemma":0.00017846492,"threshold_uncertainty_score":0.99968857},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004370614,0.00011552603,0.9869038,0.0015332964,0.0014415957,0.00044799727,0.0000038007217,0.00035020764,0.008766711],"genre_scores_gemma":[0.026966115,0.000018836408,0.9585049,0.0035970183,0.0008947181,0.00003247514,0.00001275621,0.000068460664,0.009904704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964088,0.00008317037,0.00040700953,0.0017369905,0.0006001096,0.0007638801],"domain_scores_gemma":[0.997271,0.00054828514,0.00022086965,0.0012274272,0.0004263314,0.00030606263],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005300447,0.0005649981,0.0005251207,0.000949662,0.00027846155,0.0008577663,0.0024016274,0.00029438297,0.00010303602],"category_scores_gemma":[0.00011672331,0.0004590141,0.00008357096,0.0007411039,0.00041073433,0.00083938136,0.001228947,0.001123161,0.0010505652],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006318553,0.000027045024,0.000049760998,0.000022852788,0.000009305152,0.000047089652,0.001055848,0.0067739175,0.000027327542,0.001985064,0.000108544875,0.98988694],"study_design_scores_gemma":[0.0006638907,0.001883158,0.00062350795,0.0012156018,0.000023487763,0.0005095952,9.1334624e-7,0.90877545,0.0006047033,0.040368505,0.043086227,0.0022449768],"about_ca_topic_score_codex":0.00019443929,"about_ca_topic_score_gemma":0.00029073146,"teacher_disagreement_score":0.98764193,"about_ca_system_score_codex":0.00017587256,"about_ca_system_score_gemma":0.0003558253,"threshold_uncertainty_score":0.99978614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05630509,0.000034787274,0.9169764,0.005460813,0.0014530824,0.00040945667,0.000027958737,0.0005904781,0.018741962],"genre_scores_gemma":[0.8879699,0.0000040987175,0.109022,0.0003937655,0.0003454701,0.00009038131,0.00009203155,0.000020391057,0.0020619398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981223,0.0001341149,0.00031001103,0.0006408662,0.0004492788,0.00034345256],"domain_scores_gemma":[0.9988821,0.00018271946,0.00017055773,0.0003363873,0.00025726322,0.00017096219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039674024,0.00025472415,0.00023221137,0.000189253,0.00026632493,0.0004973503,0.0013160167,0.00007458041,0.0003608845],"category_scores_gemma":[0.00041476748,0.00022953683,0.00011680214,0.00017996377,0.00003725841,0.00031369325,0.00024449895,0.00050406123,0.00021287966],"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.00017302098,0.00040781745,0.038920976,0.00002153853,0.00017820533,0.000030639258,0.0085861925,0.000525916,0.000992944,0.33154696,0.000374139,0.61824167],"study_design_scores_gemma":[0.0007776839,0.0010102855,0.008348304,0.00015128298,0.000013458714,0.000008487855,0.00019147558,0.9140614,0.0007030532,0.05402113,0.020160574,0.0005528086],"about_ca_topic_score_codex":0.0022505547,"about_ca_topic_score_gemma":0.00013447063,"teacher_disagreement_score":0.91353554,"about_ca_system_score_codex":0.00005053839,"about_ca_system_score_gemma":0.00006611843,"threshold_uncertainty_score":0.936024},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050209705,0.00003956441,0.93908876,0.0008843094,0.0005069545,0.00004879527,3.3594787e-7,0.0004659849,0.008755582],"genre_scores_gemma":[0.876269,8.820853e-7,0.09912948,0.00017248237,0.00023219394,0.0000040344717,0.000003713672,0.0000090476315,0.024179202],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912995,0.000059252015,0.00008741846,0.00019972953,0.00020088609,0.00032277423],"domain_scores_gemma":[0.9994633,0.00004020978,0.000044046257,0.0002695644,0.000061189116,0.00012167976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014181904,0.00011312912,0.00009730892,0.000060596183,0.00022823468,0.00010534983,0.00025795912,0.000036932113,0.00020981715],"category_scores_gemma":[0.000026868529,0.000075198834,0.00002185806,0.00035860733,0.000026050988,0.00039201934,0.00010241962,0.0002850916,0.0002163225],"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.000018618635,0.00022702993,0.32315236,0.00002926927,0.00016350516,0.000024746554,0.00377751,0.042989094,0.00023673405,0.17519207,0.0057481066,0.44844094],"study_design_scores_gemma":[0.0019668154,0.000666777,0.37227878,0.00003227227,0.000046144203,0.00037486482,0.00042715343,0.18421076,0.00083248236,0.0010676451,0.43674433,0.0013519555],"about_ca_topic_score_codex":0.00014348414,"about_ca_topic_score_gemma":0.000008314923,"teacher_disagreement_score":0.83995926,"about_ca_system_score_codex":0.000012782013,"about_ca_system_score_gemma":0.000026058287,"threshold_uncertainty_score":0.30665195},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005018708,0.00003128225,0.9786525,0.0013058116,0.0010456583,0.000045355962,0.000024097808,0.000088092784,0.013788503],"genre_scores_gemma":[0.92221624,0.00007509137,0.07637784,0.0001826978,0.00031724785,0.00000545722,0.0000331979,0.000007296912,0.0007849185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988082,0.00011112568,0.00024627303,0.0002614428,0.00032368655,0.0002492411],"domain_scores_gemma":[0.9991454,0.0003489241,0.00009791403,0.00014996299,0.00011622316,0.00014156736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030941202,0.00013942881,0.00011800025,0.00008906594,0.00014588644,0.00031117286,0.0004378357,0.00005276934,0.00040587486],"category_scores_gemma":[0.00039164344,0.00013070973,0.000024321911,0.00008303591,0.00007785568,0.00028967956,0.00011740229,0.0003433905,0.00036883412],"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.0000063237185,0.0000404002,0.0008025734,6.677058e-7,0.000012101481,0.0000024930798,0.0014109362,0.00017447356,0.00017533297,0.6024501,0.00011663862,0.394808],"study_design_scores_gemma":[0.000035320096,0.00016132358,0.0022651367,0.00003251733,0.000007078364,0.000008269565,0.0012789082,0.8263167,0.0010957548,0.16255777,0.0059477766,0.00029345852],"about_ca_topic_score_codex":0.00018956237,"about_ca_topic_score_gemma":0.00001664805,"teacher_disagreement_score":0.9171975,"about_ca_system_score_codex":0.000026513635,"about_ca_system_score_gemma":0.000031190808,"threshold_uncertainty_score":0.53301877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004077123,0.00013175524,0.9929078,0.00027267545,0.0017204585,0.000042749754,0.0000012652365,0.00000900848,0.0008371277],"genre_scores_gemma":[0.41857806,0.00003175169,0.58059263,0.00013214907,0.00019887502,0.0000012535928,0.000002635908,0.000004870852,0.00045777252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992374,0.00013652968,0.0002772449,0.000070505375,0.00019770548,0.000080602396],"domain_scores_gemma":[0.99848664,0.0005994071,0.00036181495,0.00011127622,0.00037199334,0.00006888619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045616104,0.00005615357,0.00010261984,0.000112162365,0.00006509893,0.00008793164,0.00017600467,0.000021056374,0.000021910968],"category_scores_gemma":[0.0034825278,0.000048317106,0.000026196654,0.0001561931,0.000009832815,0.0002333473,0.0000074862905,0.00013465503,0.000008713582],"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.00003552794,0.0006738794,0.031320464,0.000056656576,0.00005667724,0.000008867046,0.0022039432,0.0055108694,0.0005803936,0.4183388,0.045846056,0.49536785],"study_design_scores_gemma":[0.013787172,0.000851898,0.108852744,0.00027090262,0.000146534,0.0010212797,0.00049749535,0.37372607,0.002338281,0.14732745,0.3502383,0.0009418788],"about_ca_topic_score_codex":0.000009889578,"about_ca_topic_score_gemma":0.0000015592243,"teacher_disagreement_score":0.49442598,"about_ca_system_score_codex":0.000035901325,"about_ca_system_score_gemma":0.00035600315,"threshold_uncertainty_score":0.41691628},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019747052,0.00006739127,0.97225684,0.0012970066,0.00015014272,0.00004851508,3.7943295e-7,0.00018498782,0.00624771],"genre_scores_gemma":[0.8386114,0.0000036405572,0.15802285,0.000191741,0.000047949237,0.0000025963782,7.338019e-7,0.0000041795192,0.0031148745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993337,0.000029305264,0.00007319717,0.00022977835,0.00017951235,0.00015454213],"domain_scores_gemma":[0.9994638,0.00003445148,0.000029843644,0.00024344755,0.00006569907,0.00016276664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015655917,0.0000838539,0.00008252587,0.00002972589,0.000043213608,0.00007955246,0.0002938793,0.000021203034,0.00002224887],"category_scores_gemma":[0.000028102077,0.00005668887,0.000007721421,0.000118009004,0.000044514323,0.00023484876,0.0001470987,0.000111313304,0.00007251466],"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.000040451352,0.00018271276,0.25799772,0.00006624829,0.000047640497,0.00012465447,0.004646002,0.0058093527,0.00009505232,0.49262345,0.007665846,0.23070088],"study_design_scores_gemma":[0.00055233395,0.00041426186,0.005065594,0.000017252187,0.000003038971,0.000017825074,0.000094771276,0.96021223,0.00020641575,0.0011892156,0.031981204,0.00024587387],"about_ca_topic_score_codex":0.00017151263,"about_ca_topic_score_gemma":0.000013251549,"teacher_disagreement_score":0.95440286,"about_ca_system_score_codex":0.000006420423,"about_ca_system_score_gemma":0.00007372408,"threshold_uncertainty_score":0.2311705},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28226218,0.00028628894,0.6636225,0.0028544606,0.0038371137,0.0010443254,0.0000013786305,0.0030660154,0.04302575],"genre_scores_gemma":[0.8876891,4.7058344e-7,0.110032886,0.00008540254,0.00015786773,0.000025497084,0.0000011738052,0.000005990415,0.0020016185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980693,0.000086181986,0.00016370267,0.0005633221,0.00070308254,0.00041445202],"domain_scores_gemma":[0.99906725,0.000020420164,0.00010140851,0.00038835278,0.00025192133,0.00017063456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010954269,0.00011726429,0.00011117098,0.00008305055,0.0005629025,0.00045088818,0.0011757571,0.00003689817,0.0000072407665],"category_scores_gemma":[0.0005617841,0.00009909357,0.000027449456,0.0013261475,0.00057724887,0.0012342903,0.0003408834,0.0003396233,0.00008207423],"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.0000025061834,0.00032741626,0.0018207203,0.000020024205,0.0000068560157,0.00002325794,0.019055415,0.02409254,0.0032481852,0.15530418,0.0010356667,0.79506326],"study_design_scores_gemma":[0.0016986483,0.0030064113,0.025345864,0.00012856722,0.000014677569,0.00025680792,0.0017727183,0.78018415,0.0048573194,0.08727501,0.09397063,0.0014892204],"about_ca_topic_score_codex":0.00010622738,"about_ca_topic_score_gemma":0.0000026965909,"teacher_disagreement_score":0.79357404,"about_ca_system_score_codex":0.00008917859,"about_ca_system_score_gemma":0.00031664423,"threshold_uncertainty_score":0.43479252},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007771687,0.000022546874,0.95058787,0.01045649,0.0038090763,0.00012927435,0.000030336942,0.00017366001,0.027019067],"genre_scores_gemma":[0.9813822,0.000018278688,0.017324012,0.00040258546,0.00031014995,0.000008450164,0.00004353058,0.000008543234,0.00050228107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804544,0.00010256531,0.0003947896,0.0006216738,0.00058657984,0.00024891985],"domain_scores_gemma":[0.99856293,0.00009305102,0.00010260773,0.000839043,0.0002618054,0.00014056808],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077933806,0.00015709635,0.00015108862,0.00022643889,0.00004323593,0.00026958028,0.0032987816,0.000061656,0.00012777052],"category_scores_gemma":[0.0005261524,0.00014937411,0.000027094387,0.00033718284,0.00006573142,0.000567861,0.0006599154,0.00034333277,0.0010341299],"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.000031749725,0.00017503399,0.00036969496,0.0000020310576,0.000008455731,0.00006799668,0.00047540187,0.006262293,0.00013503613,0.7434086,0.00033123037,0.24873243],"study_design_scores_gemma":[0.000040230105,0.000068533736,0.00012561835,0.000043541986,9.329747e-7,0.0000094216275,0.00015266142,0.91821426,0.0013422491,0.07453032,0.0052982126,0.00017404258],"about_ca_topic_score_codex":0.00030717833,"about_ca_topic_score_gemma":0.00027023302,"teacher_disagreement_score":0.97361046,"about_ca_system_score_codex":0.00006566132,"about_ca_system_score_gemma":0.00020591321,"threshold_uncertainty_score":0.9997437},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024773736,0.0029953243,0.009262455,0.0003069995,0.0012573123,0.00030165524,0.000050100007,0.00021881475,0.9853596],"genre_scores_gemma":[0.0026205454,0.0008008697,0.041938104,0.000025492365,0.0004580958,0.00001228436,0.000010977028,0.00008675955,0.95404685],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979223,0.000039279916,0.0007216363,0.0005929753,0.00044523767,0.00027857278],"domain_scores_gemma":[0.9981487,0.00017155618,0.0006426528,0.00065113994,0.00025837612,0.00012758918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033304148,0.00038492214,0.00059149455,0.00029500027,0.00012186964,0.000031019415,0.0005873874,0.00026964585,0.00007462384],"category_scores_gemma":[0.00017885084,0.00029068484,0.00013668451,0.000116531344,0.00027509523,0.0002441231,0.0004141978,0.0004715571,0.00005701272],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000793742,0.000048238617,0.00016794789,0.0002673543,0.00020408221,0.000034670367,0.0007235693,0.00002199443,0.00031916326,0.040383473,0.0008106118,0.957011],"study_design_scores_gemma":[0.0036262404,0.0028553663,0.0028353538,0.010022263,0.00063898007,0.0007478905,0.000110359564,0.036417246,0.0011942709,0.08494374,0.8521662,0.0044420846],"about_ca_topic_score_codex":0.0000449779,"about_ca_topic_score_gemma":0.0000015249195,"teacher_disagreement_score":0.9525689,"about_ca_system_score_codex":0.000026351136,"about_ca_system_score_gemma":0.00016675769,"threshold_uncertainty_score":0.9999545},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17177935,0.0008383572,0.82255495,0.000083137085,0.0017227193,0.0009480387,0.00059511885,0.0004634051,0.001014956],"genre_scores_gemma":[0.3278224,0.00017810008,0.667651,0.00019057252,0.0008677536,0.000101645484,0.0027204412,0.0001330993,0.0003349823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586415,0.00022772784,0.0014766664,0.0008399323,0.0007032094,0.00088832836],"domain_scores_gemma":[0.9964688,0.00027661715,0.0010599082,0.0011723714,0.0005922378,0.00043005575],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010304847,0.00086559105,0.0010065882,0.00048484222,0.00059091323,0.001561282,0.0016471014,0.00064353255,0.000010932973],"category_scores_gemma":[0.000113652786,0.00084795704,0.0002781857,0.0002715358,0.00015603768,0.0013664443,0.0036161253,0.0018013906,0.000058118057],"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.000082998726,0.00045537495,0.010670516,0.0020908306,0.0007236787,0.000022727672,0.09130614,0.62557995,0.000046815094,0.002447484,0.0013832866,0.2651902],"study_design_scores_gemma":[0.0015382542,0.00014742713,0.0008719502,0.0004820541,0.00008693633,0.000046624922,0.0005549169,0.9780729,0.000030154513,0.010000101,0.007238212,0.00093048066],"about_ca_topic_score_codex":0.00039093313,"about_ca_topic_score_gemma":0.000019993468,"teacher_disagreement_score":0.35249296,"about_ca_system_score_codex":0.0002719566,"about_ca_system_score_gemma":0.00036131818,"threshold_uncertainty_score":0.9994752},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007820884,0.00002729321,0.9893726,0.00017798119,0.0007883261,0.00027399478,0.000009774255,0.0003762299,0.0011529101],"genre_scores_gemma":[0.8720914,0.00002046472,0.12493316,0.00005404936,0.00023108452,0.0000029792468,0.000058780915,0.00002207176,0.0025859922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812454,0.00023964945,0.00017902747,0.0010184271,0.00011081991,0.0003275327],"domain_scores_gemma":[0.99817586,0.00047121505,0.00022299025,0.0007209427,0.00020844616,0.00020057053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043892776,0.00023581569,0.00030762673,0.00015962873,0.00018659477,0.00021319887,0.001031862,0.0002718104,0.000018819474],"category_scores_gemma":[0.0005964315,0.00027527224,0.00013330244,0.0003410706,0.00005771638,0.00018754782,0.00144065,0.0009936854,0.00004888673],"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.000033246422,0.000037076323,0.001351348,0.00007120958,0.0000462848,0.00008945985,0.00044768935,0.8415327,0.0000018613787,0.1492691,0.0007193561,0.006400657],"study_design_scores_gemma":[0.00028527473,0.00008574084,0.00032254786,0.000060941922,0.000029711047,0.000003586731,0.00005969911,0.8520308,0.0000046811856,0.1452651,0.0015859656,0.000265905],"about_ca_topic_score_codex":0.00013069106,"about_ca_topic_score_gemma":0.0000073077454,"teacher_disagreement_score":0.8644394,"about_ca_system_score_codex":0.00013114556,"about_ca_system_score_gemma":0.00016671483,"threshold_uncertainty_score":0.99996996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033967767,0.000055372504,0.9559437,0.0007044752,0.00040898964,0.00005556522,3.314845e-7,0.00017207144,0.008691735],"genre_scores_gemma":[0.8480878,0.0000014168293,0.15161397,0.00010932513,0.00012809674,0.0000016087804,3.7921663e-7,0.0000044841418,0.000052955333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808854,0.00018652844,0.00020570209,0.0004390303,0.0006719774,0.00040819764],"domain_scores_gemma":[0.998805,0.00015637475,0.000088382156,0.0004333297,0.0002274911,0.0002894255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019312666,0.00011943155,0.00018596849,0.000128117,0.00018306873,0.00017537146,0.0016037398,0.000034383895,0.000019800202],"category_scores_gemma":[0.0003638871,0.00009636536,0.00004562811,0.00083018944,0.0011442137,0.00039937603,0.0006929674,0.00026859282,0.00006326326],"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.0000048550837,0.000032531985,0.00029562012,0.0000036995225,0.0000024223484,0.00001008662,0.001236219,0.0021295862,0.0002590253,0.93175375,0.000057360558,0.064214826],"study_design_scores_gemma":[0.00027117785,0.00044949385,0.00034309883,0.000025636553,0.0000030838514,0.00003339165,0.000039375034,0.95717907,0.008872623,0.031682637,0.0009229896,0.00017740793],"about_ca_topic_score_codex":0.000018216217,"about_ca_topic_score_gemma":8.93633e-8,"teacher_disagreement_score":0.9550495,"about_ca_system_score_codex":0.00002559339,"about_ca_system_score_gemma":0.00015844066,"threshold_uncertainty_score":0.4215903},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017749155,0.00009455124,0.9670653,0.005143903,0.0008865549,0.0005788834,0.000015556112,0.00034836022,0.008117737],"genre_scores_gemma":[0.937653,0.00006899268,0.05557142,0.00029915082,0.00038915436,0.00017331034,0.000058051177,0.000025407913,0.0057614828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789757,0.00030963586,0.00029371897,0.00064549316,0.0005334018,0.0003202011],"domain_scores_gemma":[0.9985824,0.0004443478,0.00025090695,0.00028165127,0.0002941422,0.0001465287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007834213,0.00026859,0.00019999298,0.00020961283,0.0009519275,0.0009558805,0.0008946776,0.0000925113,0.00006205396],"category_scores_gemma":[0.00085226266,0.00017954873,0.00008300974,0.00018904835,0.00005418146,0.00038954968,0.00032008288,0.0012824856,0.00004132946],"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.000045265973,0.000057864298,0.01545799,0.000014960244,0.00011028301,0.000001275658,0.0025135544,0.056136884,0.00039945633,0.037561167,0.0006175518,0.88708377],"study_design_scores_gemma":[0.00048414597,0.00028354116,0.026445797,0.000040300318,0.000010453699,0.000018672006,0.00020605193,0.95121986,0.00003648074,0.0017630729,0.019295054,0.00019657586],"about_ca_topic_score_codex":0.0005516317,"about_ca_topic_score_gemma":0.000005614138,"teacher_disagreement_score":0.9199039,"about_ca_system_score_codex":0.000039421404,"about_ca_system_score_gemma":0.000036710222,"threshold_uncertainty_score":0.92175776},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040537998,0.00024976302,0.6774793,0.00017688071,0.00075484737,0.00011254175,3.1492036e-7,0.0007809016,0.27990744],"genre_scores_gemma":[0.7590914,0.000117951764,0.14275903,0.00010196368,0.00012124677,0.000044928624,0.00018035529,0.00004567134,0.09753748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827605,0.00012605124,0.00037314426,0.00050224504,0.00038261295,0.00033991956],"domain_scores_gemma":[0.9992058,0.00019176566,0.00014061158,0.00031780388,0.00006293466,0.0000810809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002565966,0.00024038715,0.00032454688,0.00029063434,0.00012992369,0.00014717718,0.00072471437,0.00022991204,0.00003010394],"category_scores_gemma":[0.00021823049,0.00022144284,0.000072537885,0.00040787263,0.000012887258,0.00033844807,0.00008622867,0.0012826996,0.00009290074],"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.000012157783,0.00011672693,0.0021351902,0.00018226041,0.000024273344,0.00021670933,0.010822306,0.102769025,0.000046057467,0.24780965,0.00023354699,0.6356321],"study_design_scores_gemma":[0.0001579797,0.000049628703,0.0018840696,0.00016498214,0.0000022491454,0.0000074317554,0.000113078735,0.9919491,0.000026793386,0.004699254,0.0006213487,0.0003240853],"about_ca_topic_score_codex":0.00042900213,"about_ca_topic_score_gemma":0.00022282002,"teacher_disagreement_score":0.88918006,"about_ca_system_score_codex":0.00003514421,"about_ca_system_score_gemma":0.00015957344,"threshold_uncertainty_score":0.9030177},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39749834,0.00038690187,0.08246033,0.5120878,0.0012621968,0.00047475816,0.000018702432,0.00017412356,0.005636858],"genre_scores_gemma":[0.24817404,0.0005315304,0.043562368,0.00008911353,0.00008507243,0.0000016280248,0.0002458542,0.000060043163,0.70725036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912167,0.000098162964,0.000015078016,0.00024500827,0.00037749865,0.00014258132],"domain_scores_gemma":[0.9984571,0.00032215638,0.00042067532,0.0005583856,0.00019187889,0.000049804814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014704648,0.00014457767,0.00026047195,0.00014009122,0.00020346374,0.000023183215,0.0011602327,0.00013757608,0.000013728889],"category_scores_gemma":[0.00007662811,0.00012755304,0.00011993107,0.0002858527,0.00006255443,0.00013260415,0.000114848735,0.00034895018,0.00002118413],"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.00002043988,0.00006444349,0.00017482857,0.0001743921,0.000056761593,0.000005909761,0.0013246126,0.00010468709,0.00020366884,0.5365682,0.4502374,0.011064624],"study_design_scores_gemma":[0.00062904047,0.0003700921,0.0016420714,0.00079269346,0.000052894,0.0000017084938,0.0047584036,0.037703346,0.001092256,0.0024565742,0.9500925,0.00040844432],"about_ca_topic_score_codex":0.00009106028,"about_ca_topic_score_gemma":0.000019708103,"teacher_disagreement_score":0.7016135,"about_ca_system_score_codex":0.000024618996,"about_ca_system_score_gemma":0.00007209713,"threshold_uncertainty_score":0.5201462},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012321376,0.0004166575,0.9832071,0.0008683426,0.0016871339,0.0002921289,0.0000010074274,0.00034836872,0.013056062],"genre_scores_gemma":[0.076808244,0.00008186574,0.9127882,0.0019550093,0.0012081179,0.000018593917,0.000009336423,0.00008365091,0.007046943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956106,0.00007102498,0.00051504245,0.0017785495,0.0011831718,0.00084159436],"domain_scores_gemma":[0.9970851,0.0007194356,0.0002781319,0.0013360052,0.00031539676,0.00026592307],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000862887,0.00061557855,0.00060010684,0.0008785893,0.00042257784,0.001067876,0.004163764,0.0003420842,0.00020153828],"category_scores_gemma":[0.0002508142,0.00054181163,0.00017697875,0.0006261945,0.0004647513,0.0006929941,0.001772781,0.0019475181,0.0006784936],"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.0000012523788,0.000012125266,0.00007916972,0.000012934019,0.000008047841,0.000075985234,0.0006002913,0.04647607,0.000041658444,0.009927088,0.000041857173,0.9427235],"study_design_scores_gemma":[0.0002439126,0.00018789049,0.00016129593,0.00024729644,0.0000047403373,0.00007838737,1.5044898e-7,0.9074748,0.00020464747,0.0839688,0.0067083333,0.0007197577],"about_ca_topic_score_codex":0.000062640895,"about_ca_topic_score_gemma":0.000013735945,"teacher_disagreement_score":0.9420038,"about_ca_system_score_codex":0.00019730876,"about_ca_system_score_gemma":0.00041220008,"threshold_uncertainty_score":0.9999691},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25693035,0.00010905418,0.73640656,0.0030885069,0.00091760803,0.000921824,0.000009469945,0.00039657467,0.0012200341],"genre_scores_gemma":[0.9320013,0.00005591279,0.06701617,0.0005736255,0.0000909006,0.00004603565,0.00008014293,0.000023659904,0.000112247915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836165,0.00009852891,0.00034322368,0.00068725634,0.00028040446,0.00022893444],"domain_scores_gemma":[0.999135,0.000050836723,0.00025546498,0.00039097332,0.0000445263,0.00012316872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035551187,0.00026365454,0.00030991336,0.00020836627,0.00006264334,0.00038358363,0.00046233938,0.00017753917,0.000016022534],"category_scores_gemma":[0.000049717757,0.0002640201,0.000058768324,0.00028919664,0.000040420895,0.0003743188,0.00058757566,0.0008187009,0.00003229186],"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.000045788307,0.0003605495,0.067915425,0.002784431,0.00015955145,0.0001894624,0.08196722,0.7105195,0.0009714618,0.021862857,0.008530461,0.10469333],"study_design_scores_gemma":[0.00042098775,0.00005562795,0.028105013,0.00026785402,0.0000076168476,0.0000061919377,0.00004218376,0.93975836,0.000073361916,0.03067467,0.00031552793,0.00027258607],"about_ca_topic_score_codex":0.0010198217,"about_ca_topic_score_gemma":0.00009569427,"teacher_disagreement_score":0.67507094,"about_ca_system_score_codex":0.00008761297,"about_ca_system_score_gemma":0.00010315543,"threshold_uncertainty_score":0.9999812},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22756597,0.00007474107,0.73497224,0.010899903,0.00012128253,0.00013231175,2.0998755e-7,0.00023540495,0.025997933],"genre_scores_gemma":[0.7694689,0.00002084755,0.21931925,0.000562704,0.000085503925,0.000008290928,0.0000010979635,0.000003535338,0.010529891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953747,0.000031318836,0.00005745896,0.0001741498,0.00009635112,0.000103277715],"domain_scores_gemma":[0.9996469,0.0000962256,0.0000108673985,0.00017563309,0.000036749803,0.000033610962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000746955,0.000039813614,0.000042749507,0.000016685251,0.00007281259,0.00021706692,0.00014178052,0.000013823825,0.0000971162],"category_scores_gemma":[0.00003847512,0.000029870704,0.000008952758,0.00013717523,0.000015395332,0.0003980446,0.00011084708,0.00006180521,0.00021676696],"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":[5.6909175e-7,0.00007822641,0.07684203,0.000015318219,0.000013070067,0.000010495091,0.002769948,0.00060653384,0.011055139,0.105543524,0.020500721,0.7825644],"study_design_scores_gemma":[0.00015754125,0.000055137854,0.055768255,0.0000027345086,7.5257367e-7,0.000016676428,0.0000420058,0.93237966,0.0054094377,0.004641087,0.0014260577,0.000100675774],"about_ca_topic_score_codex":0.0010066424,"about_ca_topic_score_gemma":0.0000022048891,"teacher_disagreement_score":0.9317731,"about_ca_system_score_codex":0.0000028881177,"about_ca_system_score_gemma":0.0000072249645,"threshold_uncertainty_score":0.2786173},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022924207,0.000007145613,0.9565098,0.0032000954,0.00019554344,0.00009704564,1.9500695e-7,0.00028305914,0.03741467],"genre_scores_gemma":[0.82867134,0.0000012641764,0.15821506,0.00022537947,0.00016771366,0.0000323536,0.0000066857274,0.000008016456,0.01267218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993535,0.000051664152,0.00008483429,0.0002167778,0.00014733343,0.00014588874],"domain_scores_gemma":[0.99947524,0.000087585504,0.000053995587,0.00017841464,0.00011612883,0.00008865408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028717527,0.00006021825,0.00007268653,0.000045881243,0.00008840696,0.00009360551,0.00029326315,0.00003356758,0.0000072051153],"category_scores_gemma":[0.0001954325,0.00005305313,0.000030368063,0.00013536317,0.00001152256,0.00024531398,0.000060903938,0.00012639644,0.00009286551],"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.000014909097,0.00007605182,0.0007456775,0.000008285578,0.000018815508,7.15019e-7,0.001563197,0.0018591586,0.0006628772,0.26246506,0.0045693587,0.7280159],"study_design_scores_gemma":[0.00034668966,0.0001287287,0.0018043955,0.0000035487217,0.0000022648558,0.0000018615945,0.0001486444,0.91737807,0.000698064,0.0036708706,0.075717606,0.000099238736],"about_ca_topic_score_codex":0.000023530525,"about_ca_topic_score_gemma":0.0000021033409,"teacher_disagreement_score":0.91551894,"about_ca_system_score_codex":0.000032917582,"about_ca_system_score_gemma":0.00005401544,"threshold_uncertainty_score":0.21634437},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8469894,0.00012220714,0.03747969,0.00077712303,0.0008930294,0.00015482097,0.0000018413449,0.00021268522,0.11336921],"genre_scores_gemma":[0.98259705,9.620616e-7,0.011172019,0.000044200042,0.00010555921,0.0000015666766,4.7119744e-7,0.000008074434,0.0060700667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912715,0.00007345082,0.00016151305,0.00026094305,0.00018754831,0.00018941998],"domain_scores_gemma":[0.99904996,0.00026130752,0.00008867598,0.00041490226,0.000079888756,0.00010526991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061901635,0.00010829143,0.00016947197,0.00004126182,0.0001248572,0.00011627502,0.00046611394,0.00003908182,0.000002978743],"category_scores_gemma":[0.0005156526,0.00006561782,0.000032178323,0.00028090517,0.000053710755,0.00012708177,0.00030120445,0.00019837751,0.0000147667915],"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.000031032243,0.0003070962,0.40814108,0.00020438178,0.00010296935,0.0000079688325,0.01587119,0.005310526,0.00007969065,0.5077626,0.014697625,0.04748383],"study_design_scores_gemma":[0.002937132,0.000943331,0.080725804,0.0006122396,0.000060114584,0.00003968189,0.000666959,0.7981441,0.0023202908,0.0781654,0.0344218,0.00096316513],"about_ca_topic_score_codex":0.00052995916,"about_ca_topic_score_gemma":0.000006058718,"teacher_disagreement_score":0.79283357,"about_ca_system_score_codex":0.000020935264,"about_ca_system_score_gemma":0.0000564861,"threshold_uncertainty_score":0.2675817},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018197732,0.00017012584,0.9760444,0.0016780964,0.00022095242,0.00002971737,1.1801095e-7,0.000046815454,0.0036120005],"genre_scores_gemma":[0.99252784,0.000040541385,0.004995275,0.000029667015,0.0003687949,0.0000011274723,0.000001129547,0.000008557959,0.0020270392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982975,0.00012296093,0.00019856486,0.00013285123,0.0002945433,0.0009535779],"domain_scores_gemma":[0.99946594,0.000029182374,0.0001852526,0.00010499876,0.00013318383,0.000081419035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017029012,0.00008527086,0.00013000715,0.00011130788,0.0002821819,0.00009021581,0.00051357265,0.00004009609,0.0000059087474],"category_scores_gemma":[0.00009914238,0.00007749682,0.00008087544,0.00028343732,0.000029378083,0.0002568261,0.00006885855,0.001529582,0.000023042174],"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.000013338044,0.00010247721,0.0051168404,0.0000058740325,0.00012346421,0.000005916309,0.0038011675,0.003245554,0.00025445045,0.50329614,0.00040036681,0.4836344],"study_design_scores_gemma":[0.0023072755,0.0015498989,0.0024559076,0.000028906454,0.000036537116,0.000839713,0.0030901714,0.37433013,0.00015527518,0.6006078,0.014071124,0.00052728876],"about_ca_topic_score_codex":0.00006613349,"about_ca_topic_score_gemma":0.000040587416,"teacher_disagreement_score":0.9743301,"about_ca_system_score_codex":0.00023685137,"about_ca_system_score_gemma":0.0019514628,"threshold_uncertainty_score":0.66453576},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030480183,0.00038150154,0.9943008,0.0020205744,0.0000056566782,0.00013974149,0.000009712973,0.000014303551,0.00007971089],"genre_scores_gemma":[0.993435,0.00032273596,0.0060536894,0.00004281132,0.000025069545,0.00005915442,0.0000013030469,0.0000031080538,0.00005712035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990435,0.00016065151,0.00028596117,0.00021147342,0.00015841902,0.00013999626],"domain_scores_gemma":[0.99839675,0.0007486959,0.00023828814,0.000503051,0.0000716806,0.00004154066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010671798,0.000091910086,0.00023044196,0.00007859446,0.00030833553,0.000082970524,0.0005016924,0.000021566946,0.0000051243032],"category_scores_gemma":[0.000018724502,0.000036934387,0.000120187644,0.0005251199,0.000259152,0.00010196436,0.00016987137,0.000055908513,7.0297415e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004180259,0.0000243516,0.0081706485,0.0000073112615,0.00043681663,8.322575e-8,0.00027761687,0.00039930287,0.00080221874,0.0066649914,0.000007878355,0.9832046],"study_design_scores_gemma":[0.00057029194,0.00003462413,0.04338437,0.000014299628,0.00044568628,0.000003249282,0.00014124688,0.9460732,0.0032930418,0.005436002,0.00045886327,0.00014517408],"about_ca_topic_score_codex":0.00033901402,"about_ca_topic_score_gemma":0.000023815302,"teacher_disagreement_score":0.99038696,"about_ca_system_score_codex":0.0000039249576,"about_ca_system_score_gemma":0.000010941268,"threshold_uncertainty_score":0.23714988},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019627744,0.000020343683,0.97893804,0.000058811882,0.0006020404,0.000117751624,0.000035324458,0.00045062386,0.00014931172],"genre_scores_gemma":[0.46263182,0.0000014881948,0.5369068,0.00008811743,0.00019728078,0.000013379263,0.000076166565,0.000013371293,0.0000716015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987603,0.000017520728,0.00023429633,0.00041249715,0.00030417996,0.00027120157],"domain_scores_gemma":[0.9992081,0.00017727443,0.000074284195,0.0002697443,0.00015020742,0.00012039341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040361154,0.00017946969,0.00013387293,0.00015206602,0.000088105124,0.00028171745,0.000832578,0.00004931746,0.000022864815],"category_scores_gemma":[0.00019465426,0.000176763,0.000053538155,0.000096577445,0.00000928815,0.0003109056,0.00006800781,0.00023908122,0.0000070923584],"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.00003872255,0.0001721847,0.0031841241,0.00001977935,0.00009975616,0.000027792901,0.001477046,0.7425441,0.011590298,0.03924919,0.000054335924,0.20154268],"study_design_scores_gemma":[0.0002782779,0.0000732289,0.0010067608,0.000024479297,0.0000020994357,0.0000044766025,0.000014677004,0.99617475,0.0016309519,0.00025917904,0.00031745943,0.00021367881],"about_ca_topic_score_codex":0.00008556633,"about_ca_topic_score_gemma":0.000004585638,"teacher_disagreement_score":0.44300407,"about_ca_system_score_codex":0.000058227604,"about_ca_system_score_gemma":0.00003656777,"threshold_uncertainty_score":0.7208186},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025814522,0.00059877813,0.8205791,0.1401835,0.0006272466,0.00016879138,0.0000016940963,0.0010242739,0.011002125],"genre_scores_gemma":[0.5350372,0.000032802647,0.445332,0.0072226482,0.0010705919,0.000017710616,0.000016363998,0.00002223619,0.011248427],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999094,0.00007030314,0.00014342413,0.00028709366,0.00018871596,0.00021644309],"domain_scores_gemma":[0.99910015,0.00008267808,0.000053192372,0.0006582076,0.000035753554,0.00007002673],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021232221,0.000101610975,0.00008885987,0.00005802664,0.00011497327,0.00011450683,0.0009304618,0.000044071618,0.00069719076],"category_scores_gemma":[0.00025640478,0.00009385251,0.000042288582,0.00017617266,0.000015043647,0.00008361457,0.0002796947,0.00012247344,0.0021228292],"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.0000026407567,0.00009355606,0.0009363646,0.0000094814295,0.000015251592,0.000013096343,0.000619858,0.0048011784,0.0007921912,0.04729641,0.2614711,0.6839489],"study_design_scores_gemma":[0.00021012191,0.00003292292,0.0011606384,0.000006739512,0.0000021117748,0.000014470929,0.0000027843157,0.047615953,0.0009286,0.0008811811,0.9489852,0.00015927467],"about_ca_topic_score_codex":0.000038642578,"about_ca_topic_score_gemma":0.0000023898322,"teacher_disagreement_score":0.6875141,"about_ca_system_score_codex":0.000018308736,"about_ca_system_score_gemma":0.000016529977,"threshold_uncertainty_score":0.9986541},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007578409,0.000012582388,0.9859411,0.0026059612,0.000065738255,0.00012230533,0.0000012306502,0.00013976888,0.010353484],"genre_scores_gemma":[0.7746293,0.0000062897657,0.22327197,0.0004217097,0.000071799725,0.000021428305,0.000011358018,0.0000074706772,0.0015586857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888104,0.000097193275,0.00021067556,0.00036609962,0.0001913458,0.00025362344],"domain_scores_gemma":[0.99931026,0.00014865927,0.000072633346,0.00031722535,0.00006923093,0.00008198164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002937651,0.00013768878,0.00014291286,0.0001330537,0.00007118387,0.0001682058,0.0004472013,0.000053555836,0.00003457029],"category_scores_gemma":[0.00021707664,0.000116731164,0.000024375842,0.00032618194,0.000030011,0.0004742373,0.00011086799,0.00017928041,0.000027980768],"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.0000011828596,0.00004748274,0.000035128014,0.000007651749,0.000001768249,7.7717226e-7,0.00021835767,0.8349024,0.000034082077,0.1473915,0.00018693644,0.017172713],"study_design_scores_gemma":[0.00021542478,0.0000494211,0.00023818984,0.0000118761845,8.346677e-7,0.0000010328678,0.0000043316923,0.9679999,0.00006798602,0.03107324,0.00018912734,0.00014864915],"about_ca_topic_score_codex":0.00045260505,"about_ca_topic_score_gemma":0.000027634547,"teacher_disagreement_score":0.7738715,"about_ca_system_score_codex":0.000053140182,"about_ca_system_score_gemma":0.00009198584,"threshold_uncertainty_score":0.4760159},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015926624,0.00026040146,0.9269329,0.00018591026,0.0008004944,0.0003523909,0.00010146787,0.00012828126,0.05531153],"genre_scores_gemma":[0.98674464,0.000058516474,0.012710177,0.0000138109335,0.00008628748,0.000006382524,0.000096938726,0.0000026225662,0.0002806001],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998994,0.00007614123,0.0003737795,0.00012373691,0.0003128618,0.000119462224],"domain_scores_gemma":[0.99900836,0.00010913431,0.00031781837,0.00036402507,0.00015685576,0.00004382512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040169558,0.00008660993,0.00016835632,0.00016190854,0.000035777277,0.00002505561,0.0003515201,0.000032574822,0.0000033331903],"category_scores_gemma":[0.00025592837,0.000076430624,0.000033046043,0.00040290086,0.000013583173,0.0012152613,0.000048697813,0.00009417478,0.000013369677],"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.00004822448,0.00060631294,0.007148369,0.001013122,0.00008981247,0.000012320151,0.018375086,0.0045786616,0.0055983965,0.23111533,0.04783123,0.68358314],"study_design_scores_gemma":[0.0014840907,0.0015678621,0.07821604,0.001876155,0.00005955843,0.00008724018,0.0010838094,0.81233186,0.012366766,0.00094765617,0.088793226,0.0011857133],"about_ca_topic_score_codex":0.00013502203,"about_ca_topic_score_gemma":9.652089e-7,"teacher_disagreement_score":0.97081804,"about_ca_system_score_codex":0.000016201042,"about_ca_system_score_gemma":0.000045625784,"threshold_uncertainty_score":0.311675},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85014534,0.0003084821,0.12475494,0.009404477,0.007239451,0.0007349394,0.000012176075,0.0013211654,0.00607904],"genre_scores_gemma":[0.981889,0.0000035363857,0.017108634,0.0004854053,0.000024459428,0.000013063066,0.000011139647,0.000008288971,0.0004564805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891055,0.00006472079,0.0001985588,0.00034654647,0.00017023474,0.00030940093],"domain_scores_gemma":[0.9990238,0.00017515273,0.000073299925,0.00050016865,0.00011673113,0.00011084241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035903498,0.0001328733,0.00016185259,0.000073253024,0.0002955989,0.00015163157,0.0005484364,0.00005322324,0.00001635165],"category_scores_gemma":[0.00012844156,0.00012733738,0.00008248696,0.00033590873,0.000026249189,0.0003165362,0.00006332889,0.00017053075,0.000068689376],"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.000004224494,0.0001105423,0.00029269993,0.000007063348,0.000007980578,0.000004280217,0.00025298225,0.00011183326,0.0005785421,0.97813493,0.002770633,0.01772426],"study_design_scores_gemma":[0.0004849398,0.00031441968,0.010034878,0.000017516133,0.000006637426,0.000009866074,0.000009858229,0.025773963,0.00040246575,0.9565905,0.006160997,0.00019397866],"about_ca_topic_score_codex":0.000018511857,"about_ca_topic_score_gemma":0.0000012741041,"teacher_disagreement_score":0.13174367,"about_ca_system_score_codex":0.000030404808,"about_ca_system_score_gemma":0.000050274517,"threshold_uncertainty_score":0.5192668},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9393624,0.000021396476,0.0012216803,0.009115241,0.0037804157,0.00022823652,0.000012622133,0.000057805017,0.04620022],"genre_scores_gemma":[0.9973565,0.000018692732,0.0015024907,0.00007368639,0.000284356,0.00000860592,0.0000026008868,0.000013647619,0.00073942903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99719876,0.000039229446,0.00035880913,0.00040219448,0.001719573,0.00028142318],"domain_scores_gemma":[0.9977822,0.00020087439,0.00018844774,0.00022334006,0.001523081,0.00008207005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096039975,0.00015192827,0.00022592321,0.00010937897,0.00014169242,0.00020903625,0.002488573,0.00007007806,0.000035337507],"category_scores_gemma":[0.00025263475,0.00011553195,0.00018253224,0.0005205964,0.00015554857,0.00035095608,0.001233282,0.00045944305,0.000011379206],"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.00007901721,0.00032414068,0.0031106356,0.00003862353,0.00009330449,0.0000027549088,0.000562851,0.0003424672,0.05047425,0.9433842,0.00015905988,0.0014287392],"study_design_scores_gemma":[0.0013518906,0.000304822,0.0013567742,0.00014629462,0.000007899031,0.000025903053,0.0000913185,0.04467165,0.88967866,0.06079402,0.001382222,0.00018853835],"about_ca_topic_score_codex":0.00014471756,"about_ca_topic_score_gemma":7.9893243e-7,"teacher_disagreement_score":0.8825901,"about_ca_system_score_codex":0.00014056728,"about_ca_system_score_gemma":0.00016372588,"threshold_uncertainty_score":0.4711256},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031075152,0.000026096297,0.9631496,0.0035783998,0.00018393126,0.0002105229,0.000004229126,0.00028709118,0.0014849413],"genre_scores_gemma":[0.8723392,0.0000020940984,0.1265895,0.0007171653,0.00022799442,0.000016079917,0.00003545838,0.000017924762,0.0000545711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973401,0.00025818998,0.00053419586,0.00065984705,0.00069767924,0.0005100168],"domain_scores_gemma":[0.9983453,0.00048293095,0.00021337703,0.00042603997,0.00029492428,0.0002373943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009793651,0.0002772136,0.00029904,0.0003877211,0.00022841743,0.00017669614,0.0007577104,0.00008302501,0.000034033157],"category_scores_gemma":[0.000579313,0.00024063016,0.0000614802,0.0014295962,0.00021404374,0.00020700344,0.00010787175,0.00071504497,0.00013355825],"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.00008046426,0.00012844827,0.0019979542,0.0000059924632,0.000004750284,0.00002566432,0.000670577,0.85879475,0.0000050490307,0.08123843,0.000014866859,0.057033055],"study_design_scores_gemma":[0.00012767785,0.00037340223,0.00040085285,0.00007288471,0.0000020546051,0.0000076151578,0.0001707732,0.9410805,0.00014551404,0.056234118,0.0010901613,0.00029441394],"about_ca_topic_score_codex":0.0008314554,"about_ca_topic_score_gemma":0.0002953709,"teacher_disagreement_score":0.84126407,"about_ca_system_score_codex":0.00024629652,"about_ca_system_score_gemma":0.0005434809,"threshold_uncertainty_score":0.9812614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9413309,0.000045107176,0.01248193,0.012284296,0.012766904,0.00031994682,0.000026597676,0.0002517821,0.02049252],"genre_scores_gemma":[0.9966703,0.000008390196,0.00056170474,0.000080735,0.00042278602,0.000008096957,0.000010481616,0.00001507529,0.0022224418],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797875,0.00005044641,0.00027081723,0.0003897532,0.0010586743,0.00025157537],"domain_scores_gemma":[0.9985615,0.00012421695,0.00016455562,0.00013677229,0.0009341737,0.000078756704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044146867,0.0001396239,0.00014490446,0.00007479358,0.0003410881,0.0003116896,0.0010405744,0.000077191275,0.000029356503],"category_scores_gemma":[0.0003610005,0.00011963713,0.000105621046,0.00046014437,0.00005870375,0.00030722452,0.00068129046,0.0005586053,0.000012763296],"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.00018400593,0.0008693194,0.027319724,0.000093391085,0.0003006081,0.000006752479,0.0011041847,0.00335935,0.8139266,0.1318349,0.011411877,0.0095893135],"study_design_scores_gemma":[0.002403593,0.00058475987,0.0017671966,0.00040066225,0.000040845884,0.00009238762,0.00019217735,0.7618452,0.21133554,0.0027573088,0.018098325,0.00048204593],"about_ca_topic_score_codex":0.00012534588,"about_ca_topic_score_gemma":4.551632e-7,"teacher_disagreement_score":0.7584858,"about_ca_system_score_codex":0.00027251244,"about_ca_system_score_gemma":0.000092304595,"threshold_uncertainty_score":0.48786604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004409754,0.0002042871,0.9935559,0.000252152,0.0003250711,0.00055079645,0.00001635414,0.00008184145,0.0006038528],"genre_scores_gemma":[0.96790993,0.000066107736,0.029798377,0.00021526201,0.00010377088,0.00009281952,0.000023506836,0.00001895733,0.0017712833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978576,0.00044720274,0.00036956772,0.0006364839,0.00029737712,0.00039180543],"domain_scores_gemma":[0.99904174,0.00012022646,0.00019271873,0.00035093524,0.00012129661,0.00017309886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004365471,0.0002701982,0.00031549475,0.00018946819,0.00017946985,0.00025032993,0.00042509072,0.000091787246,0.0000050027165],"category_scores_gemma":[0.00014006243,0.00023316308,0.00003741258,0.00031242575,0.000055759338,0.0005186242,0.00021878036,0.00018816988,0.000017895565],"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.000005898322,0.00014748714,0.00092839164,0.000044471628,0.000025447664,0.0000057276475,0.0014903863,0.97169626,0.00002749147,0.020179745,0.00029790812,0.005150808],"study_design_scores_gemma":[0.00086914847,0.000115221344,0.0008838316,0.00009517078,0.0000055032688,0.0000031477662,0.000062570456,0.9965168,0.0000061084957,0.00034409895,0.0008332927,0.0002651038],"about_ca_topic_score_codex":0.0019010738,"about_ca_topic_score_gemma":0.000023751592,"teacher_disagreement_score":0.9637575,"about_ca_system_score_codex":0.000088249755,"about_ca_system_score_gemma":0.00005898947,"threshold_uncertainty_score":0.95081145},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068083964,0.00009887888,0.98028016,0.001720862,0.00046937025,0.000032492717,1.8114491e-7,0.000075989454,0.010513661],"genre_scores_gemma":[0.5785596,4.7636286e-7,0.42071533,0.000051700503,0.00008631427,8.5459453e-7,1.7510455e-7,0.0000014511933,0.00058412977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948627,0.000047442907,0.000102336075,0.00006353909,0.00012621995,0.00017419379],"domain_scores_gemma":[0.9995218,0.00011702559,0.000054843727,0.00024198732,0.00002152422,0.000042823547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037075955,0.00004205318,0.000056058823,0.000010971679,0.00015266011,0.000040486597,0.00039175124,0.000009579457,0.000019352925],"category_scores_gemma":[0.00006888308,0.000023737644,0.000027121718,0.00008820337,0.00008265525,0.00012413989,0.00014261535,0.00006899014,0.00003215176],"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":[5.5152304e-7,0.000028755994,0.003950463,0.000005225073,0.0000060202874,1.854084e-7,0.00042672796,0.00011585678,0.00014022554,0.8766422,0.0011407679,0.117543],"study_design_scores_gemma":[0.00006956728,0.000017506269,0.009467269,0.000004328059,0.0000013739573,0.0000062065556,0.000022497328,0.9776563,0.0006766852,0.0064933593,0.005530702,0.000054223372],"about_ca_topic_score_codex":0.00007244415,"about_ca_topic_score_gemma":0.0000015496247,"teacher_disagreement_score":0.97754043,"about_ca_system_score_codex":0.000004214641,"about_ca_system_score_gemma":0.0000073991264,"threshold_uncertainty_score":0.11741536},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024849123,0.000006285558,0.99086994,0.0029872572,0.00071806327,0.00012470825,0.00016789696,0.000072672316,0.0025682661],"genre_scores_gemma":[0.97680306,0.00009857378,0.022494089,0.00014804189,0.00007940064,0.000012815214,0.000024475254,0.000006608307,0.0003329101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857044,0.00015611776,0.00034423394,0.00037795358,0.0003669936,0.00018426987],"domain_scores_gemma":[0.99870414,0.0004741996,0.00014679342,0.00017881271,0.0004063273,0.00008974952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055296643,0.00014513159,0.00012175719,0.00012186492,0.00012210256,0.00029457247,0.00031007334,0.00005381813,0.00025808133],"category_scores_gemma":[0.0006108319,0.00010553416,0.000019171808,0.00010610499,0.00015908868,0.0002701724,0.00007314398,0.00013221032,0.00018112353],"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.0000096040485,0.000018322262,0.0007082957,0.0000020281668,0.0000071951927,0.0000031044572,0.000091939364,0.00002953976,0.0006001345,0.5096681,0.00006721785,0.4887945],"study_design_scores_gemma":[0.00008901334,0.00036706397,0.022722505,0.00010649492,0.0000047718895,0.000023935987,0.00008048103,0.4571303,0.002550877,0.5161907,0.00037065175,0.0003631715],"about_ca_topic_score_codex":0.00020256678,"about_ca_topic_score_gemma":0.00038074257,"teacher_disagreement_score":0.97431815,"about_ca_system_score_codex":0.00004394283,"about_ca_system_score_gemma":0.00008640424,"threshold_uncertainty_score":0.43035582},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084842695,0.0000047576073,0.9945084,0.0010842204,0.0017543841,0.0006492911,5.9121055e-7,0.00027746527,0.00087249465],"genre_scores_gemma":[0.07179399,9.807933e-7,0.92264646,0.00015074726,0.00011905212,0.00027640903,0.000013174316,0.000012816779,0.004986364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998998,0.00007286033,0.00021280645,0.00036068214,0.00012970428,0.00022593932],"domain_scores_gemma":[0.99911976,0.00035522445,0.00013187884,0.00025684774,0.000079549114,0.0000567703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087573327,0.00011682947,0.00013613788,0.000109778455,0.00020239124,0.00032572026,0.00032512302,0.00005406436,0.0000045186125],"category_scores_gemma":[0.000104842584,0.00010235988,0.000089378605,0.00014816324,0.000005818655,0.00034562504,0.00006139103,0.00020541364,0.000006252988],"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.000023121676,0.000053183037,0.00036484803,0.00018876322,0.000071700015,0.000001209665,0.00038117825,0.108195595,0.002140038,0.14570977,0.0009559033,0.7419147],"study_design_scores_gemma":[0.00033789952,0.0001235643,0.00023031641,0.000017028275,0.0000117333375,0.000006476743,0.0001034843,0.96144485,0.000350193,0.0010717277,0.03616875,0.0001339562],"about_ca_topic_score_codex":0.00014826801,"about_ca_topic_score_gemma":0.000013266992,"teacher_disagreement_score":0.85324925,"about_ca_system_score_codex":0.000021999562,"about_ca_system_score_gemma":0.000009246833,"threshold_uncertainty_score":0.41741148},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25350252,0.000053729254,0.74146485,0.004621658,0.00019945537,0.000033496617,0.00003615284,0.000014284009,0.00007384675],"genre_scores_gemma":[0.9567117,0.00022888478,0.042712018,0.00016173835,0.00010970589,1.8112e-7,0.000004099356,0.0000028748398,0.00006878142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987486,0.000022133268,0.00019840171,0.0002166675,0.00069811236,0.00011611366],"domain_scores_gemma":[0.9988134,0.00010208937,0.0002452579,0.000213292,0.0005157458,0.0001102047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087430683,0.00006800986,0.00009408638,0.00023480259,0.00010896379,0.00064989575,0.0010875608,0.000014886055,0.0000042438423],"category_scores_gemma":[0.00014872225,0.00004040332,0.000011456591,0.00018728469,0.00025012667,0.004932373,0.00033657148,0.00008136428,0.0000014027747],"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.00020189579,0.0003803363,0.093497954,0.000035037247,0.00035839278,0.00069438666,0.00075026177,0.000569386,0.030752713,0.07222739,0.0036545785,0.7968777],"study_design_scores_gemma":[0.0029980121,0.00089749915,0.065763965,0.0006960465,0.000079499856,0.0045009917,0.00016209063,0.90304697,0.002194612,0.0051566088,0.013997021,0.0005067137],"about_ca_topic_score_codex":0.000011334213,"about_ca_topic_score_gemma":0.0000034248053,"teacher_disagreement_score":0.90247756,"about_ca_system_score_codex":0.000036059664,"about_ca_system_score_gemma":0.0001302665,"threshold_uncertainty_score":0.626696},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008223825,0.00002482915,0.9848262,0.0019241355,0.000059670525,0.0002191542,0.0000024981796,0.00008341835,0.0046362723],"genre_scores_gemma":[0.9730423,0.000048926184,0.02458305,0.000112350106,0.000054743956,0.000029864737,0.000004229254,0.0000047989465,0.0021197363],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99939835,0.000051283263,0.00015006872,0.00018004168,0.00012086763,0.00009939274],"domain_scores_gemma":[0.9994742,0.00007957736,0.000111334455,0.00022232402,0.00008236337,0.000030189542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032924992,0.000062949664,0.00010011873,0.000049344126,0.000059882186,0.000016774313,0.00019547285,0.000020271485,0.00007352638],"category_scores_gemma":[0.00003965796,0.000033560602,0.00008158471,0.00012502355,0.0000085434585,0.00011082682,0.00001796506,0.000039314815,0.000015182797],"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.0000048907596,0.0001659683,0.010267795,0.00011406877,0.000033018954,1.0943292e-7,0.000032170752,0.000030828505,0.037928868,0.13672173,0.034406625,0.78029394],"study_design_scores_gemma":[0.0014051399,0.004387027,0.7847052,0.0010274148,0.000023791059,0.0000079633555,0.000004040873,0.18485089,0.0041630077,0.006002717,0.012988025,0.0004347429],"about_ca_topic_score_codex":0.00003251668,"about_ca_topic_score_gemma":0.0000020037035,"teacher_disagreement_score":0.9648185,"about_ca_system_score_codex":0.00006359395,"about_ca_system_score_gemma":0.000043132302,"threshold_uncertainty_score":0.13685617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27701744,0.0014304048,0.61576766,0.04416674,0.0019636468,0.00034730192,0.000002263964,0.0002837362,0.059020817],"genre_scores_gemma":[0.9611134,0.000029585939,0.03518218,0.000055532582,0.00052510784,0.0000020762934,7.2749884e-7,0.000019679557,0.0030717272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554825,0.0015045695,0.00045394414,0.0003008446,0.0016161031,0.0005762952],"domain_scores_gemma":[0.99662757,0.0008566614,0.0007083597,0.00092950027,0.00060143723,0.00027649518],"candidate_categories":["sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.01212998,0.00016540854,0.00032549803,0.0005902577,0.0025161493,0.0015502122,0.0040072077,0.00009070366,0.00005967609],"category_scores_gemma":[0.007962771,0.00012596145,0.00017758775,0.00015875012,0.00015970111,0.0008243326,0.0006986922,0.005379361,0.00006701217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001174501,0.00034252513,0.14647599,0.000086119864,0.00008734466,0.0005943952,0.0012710048,0.010390099,0.0017796484,0.0104533415,0.004313689,0.8240884],"study_design_scores_gemma":[0.0018543168,0.0016787228,0.05339543,0.00035670365,0.000009866111,0.00022025585,0.00005218337,0.81298286,0.0006642715,0.0028015268,0.12566148,0.00032240144],"about_ca_topic_score_codex":0.00029545958,"about_ca_topic_score_gemma":0.000007688515,"teacher_disagreement_score":0.823766,"about_ca_system_score_codex":0.00008097903,"about_ca_system_score_gemma":0.00034352965,"threshold_uncertainty_score":0.99948627},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065780734,0.00019061938,0.9957047,0.0006816822,0.0017672281,0.00005486235,0.00019145496,0.000014772556,0.0007368601],"genre_scores_gemma":[0.15583335,0.000008643178,0.84296536,0.00042053263,0.0004927718,8.606188e-7,0.000011578325,0.000022205868,0.00024472424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855816,0.000070682574,0.0004660672,0.00022819961,0.00031855088,0.00035830718],"domain_scores_gemma":[0.99750185,0.00008204431,0.00061789044,0.00043985256,0.0006106486,0.000747685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005431336,0.00020139366,0.00032038087,0.00039607123,0.00017867646,0.0004231147,0.0014266111,0.00014867155,0.000042420423],"category_scores_gemma":[0.00035260548,0.00019805474,0.000090338,0.00011546798,0.00009425032,0.00008279833,0.000113198825,0.0010631662,0.000013996006],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007677669,0.00003707734,0.0016724527,0.0003537482,0.00016527697,0.0021914546,0.0031057806,0.68883336,0.000008913041,0.04079603,0.10728685,0.15554136],"study_design_scores_gemma":[0.00016328742,0.000065957654,0.00041054416,0.000221776,0.000022911563,0.000045775978,0.000004628988,0.9678224,0.000013502399,0.026744023,0.0042708023,0.00021441761],"about_ca_topic_score_codex":0.0017074515,"about_ca_topic_score_gemma":0.003716494,"teacher_disagreement_score":0.278989,"about_ca_system_score_codex":0.00021593996,"about_ca_system_score_gemma":0.00794251,"threshold_uncertainty_score":0.99768156},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012265492,0.0000102043405,0.98493975,0.0015406978,0.000057911766,0.00005353744,2.8391486e-7,0.00016298516,0.00096914236],"genre_scores_gemma":[0.7023575,0.0000020877624,0.29559943,0.000031229527,0.000034297573,0.0000072678495,7.966858e-7,0.000003270522,0.0019641723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995904,0.00001841192,0.000060100196,0.00016373768,0.00005614026,0.000111208195],"domain_scores_gemma":[0.9996593,0.00016154432,0.000033388842,0.00007491001,0.00004201638,0.000028863577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012389707,0.000051864314,0.000054999386,0.000031835938,0.00012374566,0.0001843766,0.00010032739,0.000019526255,0.000011361819],"category_scores_gemma":[0.00011515654,0.000032676966,0.000014725072,0.00004341347,0.000015218028,0.00066971243,0.000046283723,0.000043328157,0.000010599066],"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.0000020506257,0.0000031966892,0.00018075094,0.0000050087283,0.0000036515146,1.4829386e-7,0.00024263302,0.0015755728,0.0005428539,0.043361135,0.0000381732,0.9540448],"study_design_scores_gemma":[0.0002527841,0.000098149576,0.004207589,0.000016993929,0.0000017870573,0.0000040758314,0.0001310201,0.97739744,0.00038838983,0.013787487,0.0036190392,0.00009525779],"about_ca_topic_score_codex":0.000019892157,"about_ca_topic_score_gemma":0.0000014107104,"teacher_disagreement_score":0.97582185,"about_ca_system_score_codex":0.000008013587,"about_ca_system_score_gemma":0.000020707706,"threshold_uncertainty_score":0.17779477},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05432954,0.000065107975,0.9112205,0.0023206456,0.00020644582,0.00008345559,0.0000017047935,0.0008906107,0.030881984],"genre_scores_gemma":[0.983311,0.00003726901,0.006369432,0.00005805353,0.00008843831,0.000010048599,0.0000021842006,0.0000144014475,0.010109197],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830925,0.00045888926,0.00017273973,0.0004950803,0.00019179555,0.00037226154],"domain_scores_gemma":[0.99798334,0.0013702967,0.00012950593,0.00026363053,0.00010977722,0.00014346321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010054656,0.00018726804,0.00017236767,0.000100076424,0.0005770712,0.00021293196,0.00042716367,0.00006929474,0.00010689917],"category_scores_gemma":[0.0028634616,0.00013047234,0.000038126847,0.0002404083,0.00015118919,0.00023503948,0.00028227555,0.000575199,0.00022845433],"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.0000059097165,0.000013901243,0.0059830365,0.0000046356276,0.000007148381,0.000008051718,0.00022493844,0.000045717377,0.0017867984,0.4179159,0.00002214906,0.5739818],"study_design_scores_gemma":[0.0039769015,0.0043560974,0.07113781,0.0024526413,0.000068282236,0.00035796195,0.0011202687,0.33380374,0.0040690713,0.44443896,0.13097136,0.003246917],"about_ca_topic_score_codex":0.0000068324543,"about_ca_topic_score_gemma":4.0025589e-7,"teacher_disagreement_score":0.9289814,"about_ca_system_score_codex":0.000029299114,"about_ca_system_score_gemma":0.00006653871,"threshold_uncertainty_score":0.5320507},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004385371,0.00007160663,0.9931919,0.0011354942,0.00017209469,0.00046419582,0.0000043377395,0.0001509807,0.004765519],"genre_scores_gemma":[0.09482877,0.000018634244,0.9017512,0.0013705303,0.00039229376,0.000077746794,0.0000065720897,0.00004796305,0.0015062595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679697,0.00003275932,0.00037783172,0.0014734278,0.0007582165,0.00056081376],"domain_scores_gemma":[0.997864,0.00017359674,0.00020454875,0.0014382614,0.00013570966,0.00018385076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006853445,0.00043115925,0.00037696766,0.00075802126,0.00016847342,0.0003491183,0.002649566,0.00016690105,0.000014703],"category_scores_gemma":[0.000014348715,0.0003061361,0.000050293267,0.00046155718,0.0003330012,0.0006321563,0.0007048987,0.00071082014,0.000030884752],"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.0000061480346,0.000044771237,0.00009721345,0.000015062814,0.00000364278,0.000026555337,0.00042991326,0.49247497,0.00003556234,0.045221645,0.0000046781847,0.46163982],"study_design_scores_gemma":[0.00031793918,0.00021031876,0.00004470358,0.00023091536,0.0000023941784,0.000028142449,1.0758702e-7,0.922612,0.00007201703,0.07548417,0.0005395532,0.00045771772],"about_ca_topic_score_codex":0.000015324073,"about_ca_topic_score_gemma":0.00011985057,"teacher_disagreement_score":0.46118212,"about_ca_system_score_codex":0.0002703266,"about_ca_system_score_gemma":0.000516087,"threshold_uncertainty_score":0.9999391},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000057617262,0.0001967085,0.20099202,0.00021207967,0.00033875616,0.00017959901,0.000009602379,0.00075710955,0.7973084],"genre_scores_gemma":[0.057443526,0.0000061400465,0.2795311,0.0045204717,0.00111028,0.000034013992,0.000020408268,0.00014246527,0.65719163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756724,0.000103778046,0.0003629848,0.00093994674,0.00048948114,0.00053659186],"domain_scores_gemma":[0.9985075,0.00007216028,0.00036244415,0.000742598,0.00011849173,0.00019681152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032215423,0.0005682357,0.0005702087,0.00012175548,0.00024259981,0.00019338397,0.0011345358,0.0005204143,0.0000201724],"category_scores_gemma":[0.00003341407,0.0005523611,0.00029508173,0.000037882623,0.00011431678,0.00006394917,0.00027691986,0.0012813681,0.00032131604],"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.0000116616,0.0000074353843,0.000004805043,0.000010910306,0.00002734153,0.00018801808,0.00004781292,0.0006850136,0.000002981083,0.843477,0.00035013788,0.15518686],"study_design_scores_gemma":[0.000907258,0.00096913666,0.00006101026,0.00038874598,0.00006779279,0.00018168562,0.0000060218695,0.117504574,0.000042115767,0.7587218,0.119679935,0.0014699196],"about_ca_topic_score_codex":0.000030914976,"about_ca_topic_score_gemma":0.0000050841136,"teacher_disagreement_score":0.15371694,"about_ca_system_score_codex":0.00015130735,"about_ca_system_score_gemma":0.00024735814,"threshold_uncertainty_score":0.9996928},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002960774,0.013131223,0.01052247,0.020698803,0.0053464854,0.00096704543,0.000452412,0.00030865177,0.9482768],"genre_scores_gemma":[0.060115907,0.005730501,0.30604535,0.0024706475,0.0054145236,0.00014686411,0.00048977294,0.0002920633,0.61929435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99765813,0.000091085654,0.0003534287,0.00063877704,0.00091946824,0.00033912793],"domain_scores_gemma":[0.99635774,0.00056649424,0.0003308368,0.002619896,0.000074407966,0.00005063262],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0036306453,0.00023571553,0.00025126684,0.0000996953,0.0004931518,0.0006644377,0.013358506,0.000076409066,0.000015846837],"category_scores_gemma":[0.00051697897,0.00012245582,0.000041903757,0.000249398,0.0013305325,0.00089248846,0.0031812196,0.0004767413,0.000038960465],"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.0000058438336,0.000013328832,0.00023051555,0.000029589371,0.000016543443,0.00001905295,0.0007427518,0.00032119045,0.0000028780016,0.93384784,0.006175131,0.05859535],"study_design_scores_gemma":[0.00009093647,0.00015352588,0.0005311204,0.00014707916,0.00001161017,0.000029819885,0.00007038063,0.029964354,0.0000058351848,0.049555834,0.91915846,0.00028101887],"about_ca_topic_score_codex":0.00032115137,"about_ca_topic_score_gemma":0.00044392934,"teacher_disagreement_score":0.91298336,"about_ca_system_score_codex":0.000016471597,"about_ca_system_score_gemma":0.00028071154,"threshold_uncertainty_score":0.9919797},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0203313,9.635038e-7,0.96548605,0.0033331518,0.00006708536,0.000076254975,0.0000013098196,0.00019684252,0.010507021],"genre_scores_gemma":[0.87909716,2.7675162e-8,0.118974864,0.00013677184,0.000028739587,0.000008695157,7.7829145e-7,0.0000057864263,0.0017471848],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999008,0.000039755356,0.00024047235,0.0003290005,0.00022475352,0.00015801673],"domain_scores_gemma":[0.99832237,0.00069920486,0.00017391042,0.00051065383,0.00020151581,0.00009236885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003254881,0.0000871286,0.000115067014,0.000088276814,0.00006766014,0.000033332057,0.00035927835,0.000033443303,0.000021634747],"category_scores_gemma":[0.0015905696,0.000055727003,0.000034236255,0.0004265029,0.000041112577,0.00011762368,0.00007730517,0.000060018545,0.000050590523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005339383,0.000113553266,0.03988271,0.00001037749,0.0000067268447,0.00002489197,0.00009277963,0.00047527772,0.09664745,0.0020612406,0.00045261704,0.86022705],"study_design_scores_gemma":[0.0004619863,0.00032105835,0.53516203,0.0001327824,0.0000059426607,0.000042677093,0.000034084274,0.36300525,0.09703204,0.00034677619,0.0031651629,0.0002902033],"about_ca_topic_score_codex":0.000105197774,"about_ca_topic_score_gemma":0.000006090405,"teacher_disagreement_score":0.85993683,"about_ca_system_score_codex":0.00004268587,"about_ca_system_score_gemma":0.0000948209,"threshold_uncertainty_score":0.22724813},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017046353,0.00002118163,0.9802884,0.0047364407,0.00014861501,0.00008141118,3.355876e-7,0.00029689597,0.012722091],"genre_scores_gemma":[0.65779346,7.937593e-7,0.3310032,0.0009418464,0.00036029206,0.000003593023,0.0000029407468,0.000010114067,0.009883773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904877,0.000026585114,0.00014874023,0.0002545247,0.00017514899,0.00034624597],"domain_scores_gemma":[0.9994391,0.0002010092,0.000033691067,0.00016428567,0.000042848762,0.00011904894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062927464,0.00009563203,0.00009795516,0.00014202956,0.00020955302,0.000062248866,0.00031664685,0.000044435194,0.00004231258],"category_scores_gemma":[0.00007774687,0.00008061613,0.00007868564,0.0002705535,0.000017148439,0.00013107872,0.000043282387,0.00016692634,0.000017273633],"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.00001614325,0.000067136614,0.0008577043,0.00001698554,0.000018986426,0.000013531252,0.0008262904,0.0044933353,0.0018665945,0.23012869,0.0014689936,0.7602256],"study_design_scores_gemma":[0.00075337215,0.00024930752,0.003207463,0.0000121160465,0.0000035099306,0.00003909959,0.00002899856,0.8268765,0.0018445194,0.0062450296,0.16044177,0.00029830154],"about_ca_topic_score_codex":0.00011559424,"about_ca_topic_score_gemma":0.000012533024,"teacher_disagreement_score":0.82238317,"about_ca_system_score_codex":0.000018801198,"about_ca_system_score_gemma":0.000058609126,"threshold_uncertainty_score":0.32874304},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000110310466,0.0003975459,0.9935398,0.0006714626,0.00174566,0.00039772948,0.000010604626,0.00012846525,0.0029984375],"genre_scores_gemma":[0.18854599,0.000009481631,0.8097832,0.00045085797,0.00083961705,0.000008913994,0.000011282535,0.00003048457,0.00032012604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970544,0.000057352972,0.0005237485,0.0009900031,0.0007455208,0.0006289826],"domain_scores_gemma":[0.99756795,0.0006005287,0.00045084246,0.0010290889,0.00020215832,0.0001494471],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018974253,0.00041414407,0.0005681766,0.000595607,0.0003669223,0.00027184765,0.0023584845,0.00023761857,0.000011967804],"category_scores_gemma":[0.00017648116,0.0003765428,0.00019165543,0.00023891211,0.00061790086,0.00051633216,0.0008399734,0.00092347414,0.00001173815],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004829759,0.000040879066,0.00006484623,0.00008855162,0.000009753018,0.0000031560292,0.0008075459,0.0053008357,0.00014138132,0.12285779,0.000016988073,0.87066346],"study_design_scores_gemma":[0.00032434342,0.00023910907,0.00030818672,0.00033868614,0.00001211509,0.000038008493,1.3967963e-7,0.73546296,0.0005213187,0.25742632,0.004783078,0.000545711],"about_ca_topic_score_codex":0.00007132775,"about_ca_topic_score_gemma":0.00003315953,"teacher_disagreement_score":0.8701177,"about_ca_system_score_codex":0.00016610677,"about_ca_system_score_gemma":0.00026933438,"threshold_uncertainty_score":0.99986863},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067920275,0.0000073637193,0.9254837,0.0027121329,0.0002031506,0.0001709432,0.0000013363142,0.00016933624,0.0033317837],"genre_scores_gemma":[0.92558897,0.00000361721,0.06386219,0.000033736313,0.000045127566,0.000021749773,0.0000016191426,0.0000061742244,0.0104368385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990745,0.000071477065,0.00020309632,0.00032595888,0.00014096824,0.00018396458],"domain_scores_gemma":[0.9988586,0.00042579178,0.0001450857,0.00032664908,0.00019322189,0.000050676776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044285547,0.000083636965,0.00016130763,0.000045342516,0.00008400209,0.000027872184,0.00034559943,0.000053773052,0.000050271774],"category_scores_gemma":[0.00040408495,0.000052286632,0.000057573085,0.00013894675,0.000049859464,0.00023635376,0.00007636541,0.00008652566,0.00003426589],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028083516,0.00008928977,0.00615278,0.000020188902,0.0000140159955,1.9755254e-7,0.00016130673,0.00010544824,0.01479779,0.06874889,0.00083049445,0.90905154],"study_design_scores_gemma":[0.0041022943,0.001691565,0.24983366,0.00018199735,0.000028189468,0.000007244379,0.00020114335,0.5238334,0.09612308,0.03024779,0.092927895,0.00082174415],"about_ca_topic_score_codex":0.00011562689,"about_ca_topic_score_gemma":0.0000033043652,"teacher_disagreement_score":0.90822977,"about_ca_system_score_codex":0.00003310929,"about_ca_system_score_gemma":0.000037452523,"threshold_uncertainty_score":0.2132187},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32857978,0.000009244632,0.66923386,0.00015908832,0.00016127656,0.00020288922,0.000009192327,0.00020535773,0.0014393175],"genre_scores_gemma":[0.9876244,0.000013964374,0.010288664,0.000025788857,0.000064881,0.0000021526068,0.000014188046,0.000017521672,0.0019484038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974293,0.00047518854,0.00021146097,0.0013053049,0.00012765608,0.0004510984],"domain_scores_gemma":[0.99837303,0.00034328693,0.00021281572,0.0007845993,0.00011654467,0.00016970384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042663707,0.00033500337,0.00040362502,0.0002037608,0.00013277816,0.00013564604,0.0011299204,0.00019861558,0.000065878034],"category_scores_gemma":[0.00011022367,0.00027973496,0.00006918326,0.00038252684,0.00018856685,0.00026630325,0.0012572948,0.0011746034,0.00007901517],"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.00010460601,0.00021326498,0.111828916,0.00019302008,0.00008531796,0.0012436506,0.0008762081,0.4383335,0.000018492728,0.4367702,0.000068958856,0.0102638565],"study_design_scores_gemma":[0.0014884857,0.00031054093,0.03718966,0.00038714794,0.000032567736,0.0000114698505,0.00010846196,0.794953,0.00008843811,0.16428895,0.00022352746,0.00091778435],"about_ca_topic_score_codex":0.0005002501,"about_ca_topic_score_gemma":0.00008882584,"teacher_disagreement_score":0.6590446,"about_ca_system_score_codex":0.00022012305,"about_ca_system_score_gemma":0.0002449686,"threshold_uncertainty_score":0.9999655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02111685,0.00012348323,0.9778658,0.00024951843,0.00017874909,0.00010849857,0.0000030579906,0.0001712222,0.00018279004],"genre_scores_gemma":[0.97739655,0.000004568223,0.022378273,0.000056992758,0.00002102654,0.00000701754,0.000003846075,0.0000049140554,0.00012682308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989775,0.000088737506,0.00034565708,0.00015527249,0.00021985143,0.00021298577],"domain_scores_gemma":[0.9995244,0.00007910643,0.00017073138,0.000090314395,0.0000704554,0.00006499007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022688898,0.00011571315,0.00013810789,0.0001465377,0.00016220335,0.0005478635,0.00017498274,0.000060957515,0.0000020110135],"category_scores_gemma":[0.00008435017,0.000076682896,0.000010066319,0.00018005603,0.000028150096,0.0034903192,0.00007148465,0.00019762604,0.000006393971],"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.0000050113417,0.0000066260122,0.0027114244,0.00026789797,0.0000029696619,0.0000036374688,0.0025813414,0.026116658,0.00040557815,0.0073925992,0.00002668652,0.96047956],"study_design_scores_gemma":[0.00043816067,0.000027332939,0.0013473197,0.00014678012,0.000001007951,0.000046627105,0.00018771351,0.9968176,0.000008390337,0.00019000251,0.00066854287,0.00012052938],"about_ca_topic_score_codex":0.00007321429,"about_ca_topic_score_gemma":0.0000044791273,"teacher_disagreement_score":0.9707009,"about_ca_system_score_codex":0.000036457517,"about_ca_system_score_gemma":0.000035459027,"threshold_uncertainty_score":0.528306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010156958,0.000015632426,0.93532807,0.039107777,0.0014574638,0.00011638508,0.0000054726083,0.0001447194,0.013667517],"genre_scores_gemma":[0.99522585,0.00008020768,0.0032932602,0.0001291385,0.00012900222,0.00001138426,0.0000015518435,0.000007742869,0.0011218513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802905,0.00017275709,0.0005340531,0.00039080708,0.0005953471,0.00027801024],"domain_scores_gemma":[0.9983842,0.00042814584,0.00030323825,0.00041444288,0.00038636866,0.00008360271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060330034,0.00016377182,0.00016822528,0.000118481614,0.00024256985,0.00022283991,0.0015124124,0.00004883449,0.00023885276],"category_scores_gemma":[0.0007580284,0.000096006144,0.00010876844,0.0001767264,0.0005268257,0.00023026424,0.0002926045,0.0002759081,0.00048218],"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.000012589532,0.000034960394,0.00008280458,9.649914e-7,0.000012204502,0.0000027633948,0.000121391735,0.00012893324,0.0056140856,0.6068393,0.00004099325,0.387109],"study_design_scores_gemma":[0.00007748022,0.00031649557,0.0019400573,0.000223381,0.0000037299974,0.000017696937,0.00018458709,0.26754445,0.12580225,0.5935677,0.009984616,0.00033750385],"about_ca_topic_score_codex":0.00007901213,"about_ca_topic_score_gemma":0.000040683746,"teacher_disagreement_score":0.9850689,"about_ca_system_score_codex":0.000050723178,"about_ca_system_score_gemma":0.00007922391,"threshold_uncertainty_score":0.61976093},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011020659,0.00001272387,0.9497434,0.012632757,0.00052517094,0.00009800355,0.000008505612,0.0002227947,0.035654586],"genre_scores_gemma":[0.99258655,0.000015055712,0.005115903,0.00068780186,0.00020381318,0.00001917517,0.0000018747896,0.00000823187,0.0013615945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979407,0.000106069085,0.0003251005,0.00051420706,0.0008127788,0.00030113885],"domain_scores_gemma":[0.99855787,0.00038572142,0.000107192194,0.00031140013,0.0005137918,0.00012402088],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005628605,0.00016709525,0.00014514598,0.00020451074,0.00017353613,0.00021177648,0.0009338783,0.0000755574,0.00046585654],"category_scores_gemma":[0.0006948212,0.00011896967,0.00006708882,0.000397672,0.000111921094,0.00032213406,0.00010342443,0.00019559424,0.0025778296],"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.0000018909193,0.00003985523,0.000015994985,0.0000010793367,0.0000033241195,0.0000029317675,0.00004300051,0.00006520942,0.0011142823,0.57547987,0.00009055081,0.423142],"study_design_scores_gemma":[0.000051345934,0.00018851901,0.00083795266,0.000079475794,0.0000024129795,0.000013802352,0.000022387367,0.14639942,0.022679903,0.8256326,0.0037247746,0.0003674596],"about_ca_topic_score_codex":0.000017365744,"about_ca_topic_score_gemma":0.0000102102385,"teacher_disagreement_score":0.99148446,"about_ca_system_score_codex":0.00007886108,"about_ca_system_score_gemma":0.00023307523,"threshold_uncertainty_score":0.9981988},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011525525,0.0000036543129,0.98803306,0.00078389747,0.00007973813,0.000083305866,0.0000013629,0.00012538496,0.009737044],"genre_scores_gemma":[0.8233185,0.000003051673,0.16661328,0.000117645686,0.0001514221,0.000009418709,0.00003936236,0.000011114881,0.009736193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994296,0.000020595486,0.00005072871,0.0002804648,0.00010177566,0.00011688091],"domain_scores_gemma":[0.99890304,0.000051951745,0.000096913165,0.0008674133,0.00004891743,0.000031775016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018604983,0.00005794916,0.000063422354,0.000022766453,0.00058892486,0.0004172386,0.0012478824,0.000018015551,0.000011897366],"category_scores_gemma":[0.00018474928,0.000041114003,0.000009356025,0.000032805114,0.000020871192,0.00083298376,0.00038695766,0.000070836904,0.00001562547],"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.00001794967,0.00003738284,0.004017451,0.0000140539005,0.00002738046,0.0000029205835,0.0005617471,0.00073570176,0.00007882598,0.08419331,0.0014592771,0.908854],"study_design_scores_gemma":[0.00031309834,0.00011488884,0.0047878274,0.000009989622,0.000003215571,0.0000033058102,0.000026228327,0.96255165,0.00029992414,0.00027387674,0.03152346,0.00009250618],"about_ca_topic_score_codex":0.0000806656,"about_ca_topic_score_gemma":0.00001727413,"teacher_disagreement_score":0.96181595,"about_ca_system_score_codex":0.000005138747,"about_ca_system_score_gemma":0.000026737396,"threshold_uncertainty_score":0.45295936},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021587403,0.000013502321,0.866635,0.0028918404,0.0000657415,0.00034531977,0.00009031235,0.00017588367,0.10819499],"genre_scores_gemma":[0.6893667,0.00063887035,0.29768404,0.000019952253,0.00009712405,1.8385917e-7,0.0001965234,0.000039242543,0.011957347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961493,0.0006870968,0.000115227645,0.0011120972,0.0010223318,0.0009139333],"domain_scores_gemma":[0.9954668,0.00041053302,0.0003460235,0.0028684924,0.00043567884,0.00047245016],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001091528,0.00026866503,0.00040682376,0.0007135202,0.0046085836,0.00030337024,0.010112011,0.000106137544,0.00012856668],"category_scores_gemma":[0.00026932496,0.00030626246,0.00012762117,0.000581176,0.0016048644,0.0036165644,0.008292281,0.0015582364,0.000022995946],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037194812,0.0011567646,0.07445087,0.0004320735,0.00129987,0.00762985,0.022406345,0.0020248792,0.0018061849,0.07805416,0.0067984276,0.8002211],"study_design_scores_gemma":[0.0035938432,0.001342493,0.06292744,0.00018942375,0.00006410134,0.00005380858,0.012887498,0.6092649,0.000078172045,0.002341635,0.30647874,0.0007779024],"about_ca_topic_score_codex":0.0023444633,"about_ca_topic_score_gemma":0.0019398241,"teacher_disagreement_score":0.7994432,"about_ca_system_score_codex":0.00014044439,"about_ca_system_score_gemma":0.00043422566,"threshold_uncertainty_score":0.99993896},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036002844,0.00007287714,0.99507755,0.000712001,0.0022143924,0.00045866973,0.00000303608,0.00017391212,0.0009275334],"genre_scores_gemma":[0.29723164,0.000011100808,0.7002515,0.00012688516,0.0013553094,0.000016534168,0.000018144625,0.000048182756,0.0009406727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652505,0.000068347596,0.00042169046,0.0016552743,0.0007734564,0.000556163],"domain_scores_gemma":[0.99702156,0.0003623093,0.0008627352,0.0011886831,0.00043027443,0.00013443231],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013371868,0.00042145516,0.00045546837,0.0005036745,0.0014209832,0.00080068555,0.0019690811,0.00032370313,0.000005203503],"category_scores_gemma":[0.00041645468,0.00042010692,0.00015596779,0.00016521731,0.0004808723,0.0009270548,0.00080817885,0.0011845408,0.000008368241],"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.000010775943,0.000020787846,0.000014968494,0.000045056368,0.000011772632,0.0000040506497,0.00033486332,0.053069945,0.0036827184,0.0090762805,0.000002109252,0.93372667],"study_design_scores_gemma":[0.00023246516,0.000120707584,0.00021990112,0.0002745563,0.000014045201,0.000039512008,4.1292938e-7,0.9537317,0.0015999501,0.042665552,0.00063134084,0.00046982217],"about_ca_topic_score_codex":0.00010386681,"about_ca_topic_score_gemma":0.000012386252,"teacher_disagreement_score":0.93325686,"about_ca_system_score_codex":0.0004906508,"about_ca_system_score_gemma":0.00062039425,"threshold_uncertainty_score":0.999879},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11399754,0.000042375166,0.8816279,0.00020046101,0.00047188046,0.00032555623,0.000038514136,0.00032542137,0.0029703563],"genre_scores_gemma":[0.90573424,0.000023437533,0.084138066,0.00009188631,0.00033036008,0.000002884724,0.000047355225,0.000037938065,0.009593849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980075,0.00006462637,0.0001423285,0.0011963806,0.00010985468,0.00047931098],"domain_scores_gemma":[0.99751246,0.00012164599,0.00034624327,0.0016474914,0.00018395587,0.00018822939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002933073,0.00035028288,0.00039821203,0.00019044908,0.0006226895,0.0003837719,0.0023780942,0.0001526606,0.000007854323],"category_scores_gemma":[0.000058560716,0.00033717172,0.00018535147,0.00013500774,0.00012088199,0.0003320143,0.0012279727,0.0006783708,0.00003663042],"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.00012708757,0.00015174059,0.008921517,0.00023591248,0.0002533094,0.0014578545,0.00028464172,0.9602927,0.0000150103015,0.022302784,0.0015842072,0.004373209],"study_design_scores_gemma":[0.00087812636,0.00014265231,0.00049323443,0.00022193427,0.00005839061,0.000021862104,0.0000191252,0.9824992,0.00009476282,0.007380781,0.007681953,0.0005080179],"about_ca_topic_score_codex":0.00014042594,"about_ca_topic_score_gemma":0.000009380652,"teacher_disagreement_score":0.7974898,"about_ca_system_score_codex":0.00008356046,"about_ca_system_score_gemma":0.0002304954,"threshold_uncertainty_score":0.99990803},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019964152,0.29446355,0.553806,0.0005740069,0.007664318,0.0016813072,0.0000142196095,0.00041450383,0.13938564],"genre_scores_gemma":[0.9692748,0.0017112886,0.0040088613,0.0000372375,0.00047250072,0.000008834518,0.0000048973425,0.000035255667,0.024446316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984123,0.00005007792,0.0006170755,0.0004724954,0.000257292,0.00019072987],"domain_scores_gemma":[0.99828744,0.00013098361,0.0008589187,0.0005654994,0.00010890409,0.000048256723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004546807,0.00024964852,0.0004794178,0.00018553303,0.0001549001,0.00013577935,0.00057483657,0.0001307416,0.0000010496009],"category_scores_gemma":[0.00005002407,0.0002124936,0.00006902844,0.000018552504,0.00015700446,0.00014133594,0.00016272668,0.00031546864,0.000007377421],"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.000009443018,0.000024381903,0.00038811477,0.0011588599,0.000026612006,0.00001641004,0.00036966745,0.013732656,0.000062038,0.71087784,0.000021565053,0.27331245],"study_design_scores_gemma":[0.00017358322,0.00010291728,0.000044442782,0.005397159,0.000009629843,0.000020568485,0.000048386082,0.92584527,0.00024160794,0.0056838267,0.06202097,0.00041163378],"about_ca_topic_score_codex":0.00007197998,"about_ca_topic_score_gemma":0.000006327587,"teacher_disagreement_score":0.9672784,"about_ca_system_score_codex":0.000038717,"about_ca_system_score_gemma":0.000066988454,"threshold_uncertainty_score":0.86652374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18390933,0.000107700886,0.79643774,0.003046196,0.0024825276,0.00078322453,0.000025197358,0.00029257633,0.012915496],"genre_scores_gemma":[0.9828087,0.00003861426,0.016585976,0.00006311487,0.00022218187,0.000022520797,0.0000017762077,0.000022040475,0.00023506065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968235,0.00006184967,0.0008971671,0.000884976,0.000897789,0.00043475415],"domain_scores_gemma":[0.9963377,0.00026297037,0.0013817701,0.0006024282,0.001308943,0.0001061676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010565982,0.0004191868,0.0005840354,0.00025674643,0.00023701394,0.00030067758,0.004286104,0.00026399508,0.00009818826],"category_scores_gemma":[0.0018492695,0.00031260008,0.00031383795,0.0005647873,0.00052649766,0.000091285176,0.0027316976,0.0013888979,0.000046053916],"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.00004469099,0.00022968819,0.0003355911,0.0002895691,0.000048260878,4.1770878e-7,0.0030996094,0.0071829865,0.007811511,0.90129125,0.0001592135,0.07950721],"study_design_scores_gemma":[0.000015833955,0.00021928216,0.00012429665,0.0007420127,0.000018568118,0.0000020564835,0.00014038837,0.642589,0.24477637,0.110974014,0.00012381929,0.00027438064],"about_ca_topic_score_codex":0.00024012175,"about_ca_topic_score_gemma":0.0000012287818,"teacher_disagreement_score":0.7988994,"about_ca_system_score_codex":0.000045260495,"about_ca_system_score_gemma":0.0002256694,"threshold_uncertainty_score":0.9999326},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8591509,0.00007560853,0.105470516,0.0017250848,0.00045297857,0.000051010637,5.9525104e-7,0.00020361839,0.03286968],"genre_scores_gemma":[0.99406254,0.0000044317276,0.0021381981,0.00008508097,0.000046442707,7.296581e-7,4.93617e-7,0.0000033233987,0.003658749],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99952066,0.000075036514,0.000044038607,0.00016991491,0.00008307377,0.00010728169],"domain_scores_gemma":[0.99950325,0.00010594161,0.000048703572,0.0002879138,0.000011540505,0.00004265852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041522086,0.00005139152,0.00006455649,0.000021924878,0.00044307578,0.00034642985,0.00034197964,0.00001873197,0.000010691613],"category_scores_gemma":[0.00042152018,0.00004335913,0.000012059913,0.000020677988,0.000020616322,0.00011989504,0.00015588185,0.00017745295,0.000047933874],"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.0000064534092,0.000023474022,0.18782139,0.000007773461,0.000008176416,0.000020457499,0.0007220657,0.00015621225,0.000065472,0.029469108,0.00051781366,0.78118163],"study_design_scores_gemma":[0.00034038548,0.00013737538,0.85280097,0.000022549844,0.0000010430692,0.000009612394,0.000003063278,0.13126987,0.00009889476,0.00274663,0.012409019,0.00016059111],"about_ca_topic_score_codex":0.00029319452,"about_ca_topic_score_gemma":0.000011633781,"teacher_disagreement_score":0.781021,"about_ca_system_score_codex":0.0000029656112,"about_ca_system_score_gemma":0.000007670036,"threshold_uncertainty_score":0.34078255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8281415,0.000008121241,0.16826515,0.001152248,0.0008474666,0.00017049031,7.6524066e-7,0.00030995655,0.001104304],"genre_scores_gemma":[0.99301916,5.368529e-7,0.0057796263,0.000605056,0.00007571565,0.0000028530396,0.000029145785,0.000009325608,0.00047858278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889433,0.00014920221,0.00015054335,0.00032553304,0.00028099067,0.00019938611],"domain_scores_gemma":[0.999473,0.000119527234,0.0000711481,0.00013756426,0.00011262682,0.000086134874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016290731,0.00011504009,0.000108462365,0.00013165934,0.000109056025,0.0001165484,0.00024909948,0.000030139277,0.00000916588],"category_scores_gemma":[0.00007306415,0.00010485564,0.000029044098,0.0006198479,0.000005067238,0.00016848945,0.00009507996,0.0003034959,0.00034534174],"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.000018883176,0.000024491013,0.0019507367,0.000009469662,0.00000450145,0.000005021219,0.0005970645,0.54435277,0.00024377354,0.002666009,0.0004811285,0.44964617],"study_design_scores_gemma":[0.00025236572,0.00087569025,0.008366786,0.000026529478,0.0000012612905,0.0000068745762,0.000018196088,0.9846373,0.000107992426,0.0002335488,0.005333672,0.0001397504],"about_ca_topic_score_codex":0.000009823089,"about_ca_topic_score_gemma":0.0000015208188,"teacher_disagreement_score":0.4495064,"about_ca_system_score_codex":0.000025286,"about_ca_system_score_gemma":0.000024086157,"threshold_uncertainty_score":0.44387847},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095285324,0.000005205294,0.9963895,0.00057237945,0.0012203682,0.00014710812,0.0000057106417,0.0002943079,0.00041256376],"genre_scores_gemma":[0.26449487,0.000002814758,0.7345983,0.00033693507,0.00018535434,0.00001405094,0.0000014665018,0.000015063806,0.00035116047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892193,0.000021829666,0.00022446943,0.0002775271,0.00020192485,0.0003523339],"domain_scores_gemma":[0.9989677,0.00040954264,0.000056867066,0.00033008622,0.00011743295,0.000118373646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017048776,0.00015141717,0.00014553475,0.00011926044,0.00044783458,0.00015802901,0.00041207712,0.00008251217,0.000012465714],"category_scores_gemma":[0.000030391011,0.00014261645,0.00009721834,0.00022763401,0.000060776074,0.00021578983,0.0000032382716,0.00025013727,0.00005754859],"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.000015372672,0.000059929214,0.000008868278,0.000015701133,0.00002204676,0.0000015866947,0.00050770666,0.9664147,0.00007645977,0.0021676978,0.00014587959,0.03056406],"study_design_scores_gemma":[0.00042685377,0.0005657753,0.0000830919,0.000063467334,0.000016368156,0.000015349013,0.00002836275,0.9955333,0.0014983185,0.00029808033,0.0012591215,0.00021192603],"about_ca_topic_score_codex":0.000004602815,"about_ca_topic_score_gemma":0.0000017788329,"teacher_disagreement_score":0.263542,"about_ca_system_score_codex":0.000038091526,"about_ca_system_score_gemma":0.00012250525,"threshold_uncertainty_score":0.581573},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035692158,0.0000038765365,0.97168314,0.0012925476,0.00009988729,0.000109237706,3.6021984e-7,0.00020622375,0.026247783],"genre_scores_gemma":[0.30669296,4.5337686e-7,0.6893364,0.00008559002,0.00007980533,0.000011414222,9.780601e-7,0.000004961901,0.00378741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995007,0.000012301393,0.0000547618,0.00019946088,0.00009773821,0.00013504119],"domain_scores_gemma":[0.99937546,0.000032663844,0.00008243743,0.00041084673,0.000060927054,0.000037681177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016633776,0.0000618069,0.00006907321,0.000023002001,0.00046584517,0.00028775816,0.00048147058,0.000022375216,0.0000030323808],"category_scores_gemma":[0.00003685573,0.000044515727,0.000019789053,0.000031007494,0.000016880636,0.0003600413,0.00007305991,0.000051167386,0.000005634241],"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.000010811998,0.000028710347,0.00072163885,0.000012093538,0.000034072986,0.00000471843,0.0021993676,0.00036199277,0.000032459102,0.76391494,0.00038248487,0.23229672],"study_design_scores_gemma":[0.00041047952,0.00021279693,0.0019285221,0.000012513325,0.0000043685686,0.0000073971546,0.00004074788,0.98470527,0.0002455704,0.005515624,0.006799842,0.00011688145],"about_ca_topic_score_codex":0.000017045755,"about_ca_topic_score_gemma":0.000007631866,"teacher_disagreement_score":0.9843433,"about_ca_system_score_codex":0.000007464198,"about_ca_system_score_gemma":0.00003900846,"threshold_uncertainty_score":0.35829514},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030592058,0.000055231863,0.9608918,0.00023568039,0.0012030479,0.00040187177,0.000010288016,0.0007320124,0.0058780056],"genre_scores_gemma":[0.96024656,0.0001324237,0.012291871,0.000035668407,0.00042052977,0.000005223322,0.000052208354,0.00004781696,0.026767699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971296,0.00028577272,0.0002069848,0.0016186107,0.00013701073,0.0006220222],"domain_scores_gemma":[0.9972817,0.0003125191,0.0006873617,0.0012184965,0.00027392348,0.00022604385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005665021,0.0004652201,0.0005210948,0.00028808007,0.0012666014,0.0004976204,0.0028783234,0.00040798594,0.000021130654],"category_scores_gemma":[0.00040386477,0.0005408055,0.00042273794,0.00020779713,0.00012486975,0.00052054797,0.0025988943,0.0022948422,0.00008757778],"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.00005233795,0.00008576377,0.0017993259,0.00014609548,0.000246644,0.00025210643,0.0011912168,0.8253428,0.000022412778,0.03563086,0.00023860409,0.13499184],"study_design_scores_gemma":[0.0007139374,0.00020545044,0.0006614131,0.00012108464,0.0000624008,0.0000067241676,0.00013018367,0.967662,0.00009616631,0.015608886,0.014082916,0.00064885576],"about_ca_topic_score_codex":0.00025218664,"about_ca_topic_score_gemma":0.000009441924,"teacher_disagreement_score":0.94859993,"about_ca_system_score_codex":0.00018210454,"about_ca_system_score_gemma":0.00024919232,"threshold_uncertainty_score":0.99970436},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14180969,0.000027128268,0.7672159,0.0021126154,0.0012686029,0.0006634908,0.0000046708587,0.0007079789,0.08618994],"genre_scores_gemma":[0.979122,0.000005754502,0.016198639,0.00015969857,0.00015270236,0.000035816294,0.0000034288664,0.000007829218,0.0043141637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905604,0.00010327921,0.00007087618,0.00036836657,0.0001781473,0.00022329079],"domain_scores_gemma":[0.99897635,0.00017611477,0.00012660526,0.0005756987,0.00004990685,0.000095339725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014721487,0.00011812162,0.00013340259,0.00003789052,0.00087597605,0.00043204587,0.0010048824,0.00004721798,0.00012501041],"category_scores_gemma":[0.00025545404,0.00009929814,0.000055731038,0.00004656709,0.000059137798,0.0006512792,0.00056954025,0.0003579242,0.00039251588],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051818247,0.000023438899,0.0103513785,0.0000012110621,0.000037748592,0.00002099938,0.0013439687,0.0004427363,0.0001758402,0.0029062873,0.000368255,0.98432297],"study_design_scores_gemma":[0.0017157127,0.00022795922,0.39147234,0.000037721795,0.00001833228,0.000004794479,0.0005172521,0.5477997,0.004593134,0.0024021328,0.050645724,0.00056520454],"about_ca_topic_score_codex":0.0020559574,"about_ca_topic_score_gemma":0.00004214226,"teacher_disagreement_score":0.98375773,"about_ca_system_score_codex":0.000033711374,"about_ca_system_score_gemma":0.000019397212,"threshold_uncertainty_score":0.6737388},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0106666,0.00003590836,0.97660077,0.000995499,0.00043955015,0.0000785115,5.677299e-7,0.00040685726,0.010775733],"genre_scores_gemma":[0.41455588,0.000009968379,0.55977917,0.00012926752,0.00006360753,0.00000592567,6.2980416e-7,0.000009250584,0.025446339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892646,0.00006252284,0.00011882855,0.00041511477,0.00017928107,0.00029779342],"domain_scores_gemma":[0.9988543,0.00004858892,0.00016300399,0.0007666697,0.00006724258,0.000100195844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021804267,0.00013866671,0.00014199468,0.000044119453,0.0010341007,0.000488731,0.0013926555,0.00005175977,0.000028710025],"category_scores_gemma":[0.00030887034,0.00011665974,0.000044480512,0.00005809383,0.000061282306,0.00072397816,0.0004567117,0.00040333532,0.0002824044],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044546905,0.00015997697,0.007042637,0.000007544688,0.000021873331,0.000036317608,0.0010313013,0.00025348936,0.001740408,0.005321296,0.00015496666,0.98422575],"study_design_scores_gemma":[0.0010321088,0.000040963223,0.030962408,0.0000151741815,0.0000017639932,0.000005643889,0.00003659028,0.96209264,0.0010196408,0.000045842313,0.004558056,0.00018915752],"about_ca_topic_score_codex":0.00024710904,"about_ca_topic_score_gemma":0.000048986432,"teacher_disagreement_score":0.98403656,"about_ca_system_score_codex":0.00002242243,"about_ca_system_score_gemma":0.00003173464,"threshold_uncertainty_score":0.79535705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10245225,0.0002503039,0.7074023,0.016404402,0.00045497413,0.00034654795,0.0000035205653,0.0007946617,0.17189102],"genre_scores_gemma":[0.33057186,0.00006748764,0.514949,0.00045741626,0.00010743357,3.417835e-7,0.000047481346,0.000030289617,0.15376866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926275,0.000049169368,0.00009130958,0.0002597195,0.00014280884,0.00019425478],"domain_scores_gemma":[0.9993367,0.00015313593,0.000091389215,0.00028120037,0.000022244903,0.00011530986],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000041663498,0.00010945754,0.00014814854,0.00011883783,0.00015696422,0.00006465901,0.0008922794,0.00005448126,0.0010214746],"category_scores_gemma":[0.000018743553,0.00011573179,0.00007942934,0.00028147767,0.000056289966,0.0016116939,0.0005083161,0.00023636813,0.00028130942],"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.000051423103,0.0012231069,0.121996544,0.00021832094,0.000443871,0.0001231607,0.03673018,0.0057890797,0.004342129,0.15577324,0.049893618,0.62341535],"study_design_scores_gemma":[0.0008246752,0.00015625662,0.01392516,0.000034948287,0.000008961467,0.000024272284,0.00023715734,0.8465765,0.00048542945,0.00061744783,0.13677269,0.0003364623],"about_ca_topic_score_codex":0.0062041366,"about_ca_topic_score_gemma":0.000015985352,"teacher_disagreement_score":0.8407875,"about_ca_system_score_codex":0.00000577152,"about_ca_system_score_gemma":0.000040304338,"threshold_uncertainty_score":0.9998917},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001722496,0.000057654423,0.9946287,0.00073690456,0.0007176344,0.000071158385,0.000052722135,0.00000708573,0.0020055945],"genre_scores_gemma":[0.3659228,0.000015926675,0.632487,0.000051117106,0.00030189738,0.0000015805829,0.0000058399946,0.000016297156,0.0011975204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896467,0.000058176793,0.00030941988,0.00016291432,0.0001999874,0.0003048081],"domain_scores_gemma":[0.9978916,0.00016440524,0.00075629493,0.00032297435,0.00040160835,0.00046312448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047464893,0.00012165024,0.00023945712,0.00015306764,0.0008532503,0.00057679485,0.0010068923,0.000054517746,0.000020382633],"category_scores_gemma":[0.000835467,0.00010151703,0.0000641775,0.000041850315,0.00007855968,0.0004722424,0.000037355636,0.00038352856,0.000004483807],"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.00006132777,0.000025757636,0.0009171385,0.000064845044,0.000084096566,0.0007277591,0.0035370293,0.053680904,0.000046729034,0.16305476,0.029296923,0.74850273],"study_design_scores_gemma":[0.00070969964,0.00029944762,0.0044082184,0.00012865891,0.000017742863,0.00013198603,0.00015704156,0.94577974,0.00012091503,0.032905232,0.01512148,0.00021981359],"about_ca_topic_score_codex":0.00082347787,"about_ca_topic_score_gemma":0.0009212729,"teacher_disagreement_score":0.89209884,"about_ca_system_score_codex":0.0000839983,"about_ca_system_score_gemma":0.0006736087,"threshold_uncertainty_score":0.6562598},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018230012,0.00013393167,0.9412628,0.0035857754,0.0026617232,0.00041850662,0.0000023090208,0.0007828137,0.03292213],"genre_scores_gemma":[0.9968638,0.0000010226858,0.0020604949,0.00012914426,0.00016228374,0.000022834764,0.0000070893293,0.0000038815147,0.00074944866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990445,0.00003206794,0.00031328335,0.00012230602,0.00031247453,0.00017537756],"domain_scores_gemma":[0.9987088,0.000011373453,0.000577183,0.00045806568,0.00018693869,0.000057662328],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003068089,0.000104268336,0.00011099979,0.000084096064,0.00095271,0.0037145817,0.00079143175,0.0000489146,0.0000018124528],"category_scores_gemma":[0.00013578995,0.0000844472,0.000027328455,0.00008279401,0.00003027865,0.007859285,0.00010885132,0.00013862933,0.0001302634],"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.0000033760998,0.00001400938,0.0008826259,0.00033848386,0.000004277142,0.0000026777882,0.0020225868,0.003665173,0.0000771999,0.009386432,0.0011557863,0.9824474],"study_design_scores_gemma":[0.00017616885,0.000031880296,0.001479434,0.00007432947,0.000001659082,0.000031819032,0.00003944896,0.97984606,0.00011180778,0.00008068907,0.018005274,0.000121421945],"about_ca_topic_score_codex":0.00008053721,"about_ca_topic_score_gemma":6.6072596e-7,"teacher_disagreement_score":0.982326,"about_ca_system_score_codex":0.000024306266,"about_ca_system_score_gemma":0.000051196854,"threshold_uncertainty_score":0.99731964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2750609,0.00026912076,0.68806523,0.0016795923,0.0031605696,0.0005359034,0.000006889196,0.0016430634,0.029578721],"genre_scores_gemma":[0.99461657,0.0000024631581,0.004866171,0.000028244434,0.00009018455,0.0000069378234,0.000007630378,0.000004902682,0.00037687752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884576,0.000051632906,0.0004337425,0.00012600113,0.0003407694,0.00020210065],"domain_scores_gemma":[0.9984267,0.000023226223,0.0008772489,0.00043804996,0.00017636154,0.000058431197],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003641944,0.00011935626,0.00018202956,0.00012082212,0.0006740984,0.001360347,0.00090496504,0.00005542431,0.000002709164],"category_scores_gemma":[0.0001459828,0.00009943918,0.00004314072,0.00010912173,0.00004765804,0.0049305325,0.00014752254,0.0002293342,0.00004368095],"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.00001579546,0.000051658782,0.010333678,0.0012484791,0.000027530092,0.000007766157,0.006479525,0.02001704,0.0007541594,0.017404249,0.00060237426,0.9430577],"study_design_scores_gemma":[0.0003234402,0.00005091902,0.004198554,0.00011292733,0.0000027707392,0.000032031392,0.000081359576,0.9907187,0.00042434625,0.000034445296,0.0039015997,0.00011886559],"about_ca_topic_score_codex":0.00016676022,"about_ca_topic_score_gemma":5.1487586e-7,"teacher_disagreement_score":0.9707017,"about_ca_system_score_codex":0.000019668421,"about_ca_system_score_gemma":0.00005080908,"threshold_uncertainty_score":0.99967635},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06294493,0.000008756488,0.9271913,0.0008825895,0.000088061526,0.000048743383,8.420421e-7,0.00011946313,0.008715277],"genre_scores_gemma":[0.97856164,0.0000015286655,0.021130309,0.0002280595,0.000030651656,0.0000025639727,0.000013067947,0.0000017448132,0.000030452771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996075,0.000016599733,0.00010055746,0.00007058113,0.00012628853,0.00007849259],"domain_scores_gemma":[0.9995625,0.000033601027,0.00017135366,0.00014622141,0.000051888914,0.000034460696],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00014888399,0.00005754049,0.000053304517,0.00004124611,0.00039141238,0.001157342,0.00019346728,0.000017048867,0.000003434664],"category_scores_gemma":[0.000059075533,0.00004531063,0.000008647238,0.000027146749,0.000021200842,0.0016414725,0.000068681795,0.00006456042,0.000016516913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014158784,0.0000032869375,0.008370945,0.000020430933,0.0000042009237,0.0000017703019,0.0027937724,0.0010646608,0.0000010744031,0.005283864,0.00007152435,0.9823831],"study_design_scores_gemma":[0.0003728168,0.00004621999,0.15422419,0.00003962814,0.0000026519085,0.000023701245,0.0002690236,0.84162366,0.00002515321,0.00066598435,0.0025818057,0.00012514276],"about_ca_topic_score_codex":0.00024071113,"about_ca_topic_score_gemma":0.000016526661,"teacher_disagreement_score":0.9822579,"about_ca_system_score_codex":0.000005821386,"about_ca_system_score_gemma":0.0000109712155,"threshold_uncertainty_score":0.99987954},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032434365,0.000055237168,0.9912792,0.0014589988,0.0035459078,0.00034495594,0.000020249721,0.0002172458,0.0027538536],"genre_scores_gemma":[0.275891,0.000019426932,0.72101,0.0011360105,0.0014981123,0.000017225268,0.000013532016,0.00003974726,0.00037488848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554926,0.000056246627,0.00046042318,0.0021472275,0.0010588221,0.0007279905],"domain_scores_gemma":[0.9960614,0.0005810316,0.0006076829,0.0020686272,0.00036751953,0.00031374628],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042428475,0.00064139755,0.0006407242,0.00066205644,0.00061093806,0.001196377,0.004872203,0.0003644109,0.000037040205],"category_scores_gemma":[0.00040199756,0.00060436246,0.00013096155,0.00030693263,0.0008463714,0.0010163994,0.0021156138,0.0014654481,0.00014369519],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000463777,0.000008533068,0.000055902598,0.000008815396,0.000012615435,0.000093198796,0.00154587,0.010635049,0.00044163805,0.003287497,0.000005504382,0.9839007],"study_design_scores_gemma":[0.00030765508,0.00022873576,0.0006420904,0.0010252834,0.000013962878,0.00010233285,7.3352766e-7,0.68267924,0.0052870726,0.30618864,0.0022244195,0.0012998357],"about_ca_topic_score_codex":0.00059299427,"about_ca_topic_score_gemma":0.00012435162,"teacher_disagreement_score":0.9826009,"about_ca_system_score_codex":0.00040096452,"about_ca_system_score_gemma":0.0006833335,"threshold_uncertainty_score":0.9998405},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03661363,0.000018067634,0.9623416,0.00014186984,0.00010633038,0.0000758421,7.870595e-7,0.00033088378,0.00037098653],"genre_scores_gemma":[0.96330714,0.000001937487,0.03628864,0.00004187885,0.000041246654,0.000013013571,8.4640334e-7,0.000013674868,0.00029162897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878645,0.00017230008,0.00022268039,0.00032310418,0.00027117156,0.00022427432],"domain_scores_gemma":[0.9989041,0.0005674572,0.00018232276,0.00015257577,0.00013707104,0.000056444114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030245597,0.00014988372,0.00017700988,0.00017912834,0.00046295888,0.00009093176,0.0003201518,0.00007193588,0.000012301102],"category_scores_gemma":[0.00007667998,0.00014011383,0.000074474345,0.00035769312,0.00007855044,0.00044410353,0.0000042046063,0.00042684303,0.00001222312],"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.000016586706,0.00006548663,0.00017884564,0.000028797622,0.000006538226,4.4568156e-7,0.00091252924,0.27284923,0.0049958504,0.000028602999,0.0000014393787,0.7209157],"study_design_scores_gemma":[0.00040218083,0.00019719938,0.00036361322,0.000074539894,0.000008283296,0.0000071309373,0.00017024639,0.8964004,0.10178994,0.00016170635,0.00027792918,0.00014684226],"about_ca_topic_score_codex":0.00006553581,"about_ca_topic_score_gemma":0.0000066856173,"teacher_disagreement_score":0.9266935,"about_ca_system_score_codex":0.000031742646,"about_ca_system_score_gemma":0.00004531134,"threshold_uncertainty_score":0.5713676},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03535823,0.0006041007,0.9585576,0.00028911614,0.0031982893,0.0013965376,0.000014766656,0.00049033563,0.00009103543],"genre_scores_gemma":[0.99363744,0.00029752517,0.0035661461,0.000049607726,0.0004849222,0.0006869632,0.000037495636,0.00006729222,0.001172582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959812,0.0009172905,0.0007499023,0.0013525418,0.0003926295,0.00060642493],"domain_scores_gemma":[0.99750507,0.0008264145,0.0007692402,0.0005074059,0.0002457948,0.00014606194],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010607166,0.00054401386,0.0006275176,0.00037348163,0.00090643956,0.000603954,0.00057632,0.00052534806,0.0000021860776],"category_scores_gemma":[0.00007927757,0.0005432506,0.00017804916,0.00050549174,0.00010094754,0.00043280117,0.000020951471,0.0035282064,0.000004286047],"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.00006329394,0.0000557471,0.00036511404,0.00021656466,0.00003430432,0.0000026127775,0.00088256266,0.82998574,0.00003814341,0.00009289952,0.000018994002,0.16824402],"study_design_scores_gemma":[0.000919867,0.00035882232,0.0014402907,0.0012118923,0.000021497306,0.000016574086,0.00017349748,0.9932489,0.000031301493,0.000041486197,0.0019866996,0.00054921146],"about_ca_topic_score_codex":0.00032632536,"about_ca_topic_score_gemma":0.00016918751,"teacher_disagreement_score":0.95827925,"about_ca_system_score_codex":0.00020202211,"about_ca_system_score_gemma":0.00008196844,"threshold_uncertainty_score":0.9997019},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.855877,0.0015160966,0.121479526,0.0048997933,0.0047577885,0.0001195778,0.0000012530187,0.00008565516,0.011263314],"genre_scores_gemma":[0.9577455,0.000077227734,0.041844122,0.000074392105,0.00015277311,3.5666892e-7,1.9765302e-8,0.0000022173165,0.00010339343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902123,0.0000785,0.00023793126,0.00019661647,0.00031297223,0.0001527243],"domain_scores_gemma":[0.9991405,0.0000757338,0.00037971913,0.0002075321,0.00008404686,0.000112469024],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011963364,0.00009715224,0.00022359665,0.00017232072,0.0009698199,0.0013488963,0.0008191709,0.00002676854,6.3641215e-7],"category_scores_gemma":[0.000020230093,0.00006178357,0.00004926163,0.000098824414,0.0002111269,0.0009734861,0.00016772124,0.00012375414,0.0000015188023],"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.000030554467,0.000076631484,0.06075755,0.00018831884,0.00008038931,0.00024375321,0.0019981058,0.0005447027,0.00010986469,0.33051616,0.0025441535,0.6029098],"study_design_scores_gemma":[0.0032005417,0.010454566,0.29278427,0.0030073393,0.00005966636,0.016083017,0.001082393,0.6141287,0.00062702777,0.042685952,0.014556474,0.0013300272],"about_ca_topic_score_codex":0.000016370615,"about_ca_topic_score_gemma":0.000001249745,"teacher_disagreement_score":0.613584,"about_ca_system_score_codex":0.0000046801188,"about_ca_system_score_gemma":0.000035413592,"threshold_uncertainty_score":0.9996878},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9014767,0.0009958929,0.03915819,0.00047605633,0.003068136,0.00019272069,0.000017440798,0.00059861434,0.05401626],"genre_scores_gemma":[0.9937469,0.000011617317,0.0034434905,0.000048108384,0.0008385755,0.0000066017833,0.000010350871,0.00001632952,0.0018780766],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985188,0.00026539734,0.00021756976,0.00032366332,0.0003504748,0.0003240672],"domain_scores_gemma":[0.9981213,0.00023903447,0.0002889802,0.0011898668,0.00008207156,0.0000787336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013371429,0.00015697574,0.00017289433,0.000046527744,0.0012550242,0.00092633447,0.0018368182,0.000066676774,0.000012396571],"category_scores_gemma":[0.0025726783,0.00011752074,0.00008691058,0.000049217248,0.00010074287,0.00059491757,0.0004587528,0.00071268197,0.000004086962],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014705704,0.000097263284,0.0073213186,0.0000407144,0.000059732774,0.000031843476,0.24602698,0.00027483725,0.00079182594,0.012016802,0.0037295795,0.7295944],"study_design_scores_gemma":[0.012057589,0.0012861514,0.029243564,0.0021224052,0.00022611095,0.000030553372,0.25920764,0.14601418,0.06754383,0.0026674566,0.4738284,0.0057721077],"about_ca_topic_score_codex":0.00052066124,"about_ca_topic_score_gemma":0.00002618726,"teacher_disagreement_score":0.7238223,"about_ca_system_score_codex":0.000026825819,"about_ca_system_score_gemma":0.00002210804,"threshold_uncertainty_score":0.9652759},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08651156,0.0000034612362,0.8884054,0.008903966,0.00052278786,0.00009299886,0.0000012097463,0.0000913025,0.015467326],"genre_scores_gemma":[0.8673437,5.5915103e-7,0.13202474,0.0005250937,0.00008721837,0.0000014289064,1.3676927e-7,0.000003992282,0.000013119063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807936,0.00019921464,0.00019505122,0.00046802787,0.00068976363,0.00036857542],"domain_scores_gemma":[0.9971284,0.0004967072,0.00016669113,0.001979376,0.00009609474,0.00013273321],"candidate_categories":["sts","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0024054565,0.00013719198,0.00017577264,0.00006990804,0.0024810073,0.00053633144,0.006167937,0.000028549766,0.000029659912],"category_scores_gemma":[0.0007056276,0.000080706115,0.00006967325,0.00014698404,0.0059509585,0.00034668206,0.0017958954,0.00046233565,0.000056009823],"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.000002557421,0.00003774935,0.000054478493,0.0000029394007,0.0000021064866,0.0000032299135,0.0003010519,0.00013623468,0.00007816803,0.95931685,0.000046292964,0.04001836],"study_design_scores_gemma":[0.00007993385,0.0001302509,0.002787993,0.00003053784,0.000001159869,0.000007668933,0.0000018531946,0.6694422,0.00097039755,0.3264101,0.00005312849,0.00008476547],"about_ca_topic_score_codex":0.000021729546,"about_ca_topic_score_gemma":3.6864662e-7,"teacher_disagreement_score":0.7808322,"about_ca_system_score_codex":0.000016247768,"about_ca_system_score_gemma":0.000058075366,"threshold_uncertainty_score":0.99920917},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5740494,0.000096658594,0.42323205,0.0004392618,0.0010930666,0.00020521226,0.00001976433,0.00022233355,0.00064223236],"genre_scores_gemma":[0.9614384,0.000007313435,0.037410356,0.0004049975,0.0005620489,0.000011445658,0.000017562183,0.00002748138,0.00012037891],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748254,0.0001364018,0.0005000087,0.0008029217,0.0005413796,0.0005367403],"domain_scores_gemma":[0.99853784,0.0001150041,0.000331894,0.0006785852,0.00012768351,0.0002089832],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006198976,0.0003465931,0.00036011302,0.0001649939,0.0005450835,0.0013183939,0.0012312444,0.00012713026,0.00006239073],"category_scores_gemma":[0.00006457027,0.00031804031,0.00008235216,0.0005643083,0.0002147699,0.0024911936,0.00056307024,0.00024427837,0.000052378567],"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.0007049727,0.002809888,0.04828541,0.0009766428,0.0010359286,0.00026322535,0.011813476,0.028060667,0.47019187,0.22874838,0.020832451,0.18627709],"study_design_scores_gemma":[0.0009511869,0.00014673757,0.013299747,0.000082090395,0.00002842993,0.000059791942,0.000008427552,0.9771186,0.003634918,0.0018123091,0.0023614378,0.0004962945],"about_ca_topic_score_codex":0.0010499036,"about_ca_topic_score_gemma":0.000067715264,"teacher_disagreement_score":0.94905794,"about_ca_system_score_codex":0.0000839338,"about_ca_system_score_gemma":0.00009128236,"threshold_uncertainty_score":0.99992716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1597326,0.000015078369,0.8369919,0.00026307805,0.0015595088,0.0004501003,0.000045717774,0.00030290056,0.0006390923],"genre_scores_gemma":[0.8882301,0.000051763604,0.1079383,0.00022221982,0.00038806497,0.0000021017493,0.00009976469,0.000019545922,0.0030481417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979418,0.00016559944,0.00034860012,0.0008754573,0.00021972357,0.0004488147],"domain_scores_gemma":[0.99718475,0.00030029984,0.00058519776,0.0010803784,0.00069817336,0.00015117155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009442812,0.0003370939,0.00033947013,0.00024103961,0.00033330408,0.00027353727,0.0018165961,0.00030383377,0.000024013236],"category_scores_gemma":[0.0006445151,0.00037476022,0.00019163195,0.00054354046,0.000102523394,0.000997075,0.0014850202,0.00064654637,0.00022457368],"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.00053941493,0.00020030329,0.0015565153,0.0009604764,0.0003312624,0.000058898997,0.0020054278,0.725035,0.00016234818,0.18289432,0.00609469,0.08016135],"study_design_scores_gemma":[0.00082995225,0.00021737465,0.0010879397,0.00016506437,0.00004339317,0.0000038811563,0.000032748503,0.95996267,0.00019381814,0.03566628,0.0013425527,0.00045433748],"about_ca_topic_score_codex":0.00015387559,"about_ca_topic_score_gemma":0.000007836438,"teacher_disagreement_score":0.7290536,"about_ca_system_score_codex":0.00022304723,"about_ca_system_score_gemma":0.00029241416,"threshold_uncertainty_score":0.9998704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075702816,0.00008209014,0.976363,0.0006387034,0.00011234505,0.000022880344,3.1518468e-7,0.00017815495,0.01503223],"genre_scores_gemma":[0.69274384,0.000025821011,0.2682598,0.00015048277,0.00009552092,3.091531e-7,0.0000063448088,0.00000606174,0.038711805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930465,0.000035809247,0.00012126973,0.00023257079,0.00017422566,0.0001314977],"domain_scores_gemma":[0.9991822,0.000045039433,0.000053277938,0.0006298606,0.00002101077,0.00006856318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000159874,0.000060693772,0.00009854441,0.0000428799,0.00008242013,0.000018569457,0.0010848569,0.000023484747,0.00007485273],"category_scores_gemma":[0.00008425421,0.000049780963,0.000022743749,0.00019633459,0.000021392545,0.00023431171,0.00049195514,0.00015929664,0.00008892106],"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.0000043549676,0.00009521363,0.029639935,0.000018103185,0.000036484224,0.00006354901,0.002730187,0.005216585,0.0007269965,0.0365022,0.11290175,0.81206465],"study_design_scores_gemma":[0.00035754955,0.000118791824,0.008881893,0.000012045549,0.0000028134525,0.00009090437,0.000015007303,0.8573156,0.0008833537,0.00085088273,0.13128796,0.0001832224],"about_ca_topic_score_codex":0.00048127107,"about_ca_topic_score_gemma":0.0000016413867,"teacher_disagreement_score":0.852099,"about_ca_system_score_codex":0.0000035190892,"about_ca_system_score_gemma":0.00006842459,"threshold_uncertainty_score":0.20300087},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023791308,0.000009233851,0.9677105,0.00090580364,0.001204165,0.00013599185,0.0000011956188,0.000462935,0.0057788445],"genre_scores_gemma":[0.8668884,9.2716824e-8,0.13008787,0.00013237675,0.0004201991,0.000004357112,8.0737686e-7,0.000005498345,0.0024604267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919736,0.000030481282,0.00012218156,0.00027237053,0.00016358413,0.00021400323],"domain_scores_gemma":[0.9993812,0.00007543123,0.0000392251,0.00032805468,0.000107333035,0.00006879637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035800764,0.00007553553,0.00009811046,0.00004527528,0.00014611128,0.00010132492,0.00045414414,0.000033902597,0.000015746977],"category_scores_gemma":[0.000046097826,0.00005587374,0.000044938144,0.00019910307,0.000025536936,0.00004010651,0.00010947238,0.00005459306,0.00022962649],"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.000052360996,0.00011234771,0.00008527458,0.000103343504,0.00003167616,0.000008908218,0.0007364092,0.00080889417,0.0020685333,0.92061377,0.009099866,0.066278644],"study_design_scores_gemma":[0.00038783162,0.000280094,0.00026679505,0.000017701346,0.0000029061298,0.000011851492,0.000014280667,0.98235834,0.005355491,0.00023744968,0.010951437,0.000115808034],"about_ca_topic_score_codex":0.000042040403,"about_ca_topic_score_gemma":0.0000010846481,"teacher_disagreement_score":0.98154944,"about_ca_system_score_codex":0.000027862525,"about_ca_system_score_gemma":0.00002616959,"threshold_uncertainty_score":0.29514605},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014475554,0.000042986696,0.9938651,0.004383076,0.00011240068,0.0005207969,0.000029155344,0.00016481917,0.00073694694],"genre_scores_gemma":[0.03114288,0.000011059092,0.96590626,0.0015638411,0.00039335192,0.00013874042,0.00011552014,0.000018300578,0.00071004836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986307,0.00009579593,0.00039206966,0.0003847782,0.00032086932,0.00017580655],"domain_scores_gemma":[0.9981975,0.00029605208,0.00019011096,0.0003651541,0.000806813,0.00014436449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033145997,0.00015962802,0.00019372994,0.00014589798,0.00057696976,0.000113154056,0.00043587846,0.000049433293,0.00006063913],"category_scores_gemma":[0.00004955407,0.00013128575,0.00005103201,0.0009866827,0.00019543954,0.00017209441,0.00019724946,0.00012665922,0.00021765368],"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.0000032154355,0.00008338391,0.000022272401,0.000007075678,0.000030764888,2.5519057e-7,0.00032036996,0.93093896,0.000026603555,0.030158779,0.00075836066,0.03764995],"study_design_scores_gemma":[0.00031124504,0.00010074471,0.0003387332,0.000013157554,0.000016361448,0.000010561592,0.000015259959,0.9841659,0.00003034701,0.002251133,0.012600014,0.0001465345],"about_ca_topic_score_codex":0.000016780556,"about_ca_topic_score_gemma":0.0000010629185,"teacher_disagreement_score":0.053226937,"about_ca_system_score_codex":0.000019358464,"about_ca_system_score_gemma":0.00012613644,"threshold_uncertainty_score":0.5353677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3511119,0.0000022150352,0.6421994,0.000064036845,0.000092219656,0.000047570626,4.0926258e-7,0.0001814526,0.00630084],"genre_scores_gemma":[0.99244756,0.0000017760813,0.0054586125,0.000076674674,0.00010377214,1.6632036e-7,7.4189666e-7,0.000005838398,0.0019048706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991615,0.000058485988,0.00006258199,0.00041417195,0.00006420912,0.00023908874],"domain_scores_gemma":[0.9992929,0.000057187797,0.00006839661,0.00037285706,0.000110476976,0.00009816059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012317322,0.000110209534,0.00009344704,0.0000752569,0.00023923304,0.0000738296,0.0005700395,0.000034754885,0.000035803754],"category_scores_gemma":[0.000034597113,0.000095617885,0.000022619959,0.0006043938,0.00011596534,0.0004031283,0.00018432748,0.00015618053,0.0001722969],"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.00007482628,0.00019540232,0.18874072,0.000044182747,0.00009778357,0.0009829841,0.001959936,0.029072424,0.00055726495,0.74970835,0.0005525921,0.028013533],"study_design_scores_gemma":[0.00052898464,0.0004729092,0.009160037,0.000043943135,0.000010821351,0.000019156932,0.000043765787,0.9845204,0.0007259193,0.0030485424,0.0011327591,0.00029277484],"about_ca_topic_score_codex":0.00009292222,"about_ca_topic_score_gemma":0.00004237099,"teacher_disagreement_score":0.955448,"about_ca_system_score_codex":0.00002611491,"about_ca_system_score_gemma":0.000070977025,"threshold_uncertainty_score":0.38991842},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.728773,0.000005784063,0.25755897,0.00026889483,0.00038558902,0.000052007617,7.425611e-7,0.00024638788,0.012708645],"genre_scores_gemma":[0.9942097,0.000002689362,0.0023105952,0.00007846148,0.000047314024,1.04165544e-7,1.9564018e-7,0.0000070057836,0.0033439167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991699,0.00004166233,0.00006452677,0.0004341672,0.000058925863,0.00023081062],"domain_scores_gemma":[0.99866056,0.000080841484,0.00012686489,0.0009769711,0.000038619237,0.0001161515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001456795,0.00011976889,0.00011202475,0.0000756153,0.0007310174,0.00021142668,0.0013648698,0.000043611937,0.000009228179],"category_scores_gemma":[0.00015782157,0.00012350315,0.00006469073,0.00012433011,0.000063292864,0.00047153755,0.00032976677,0.00019704555,0.00014890687],"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.000014145418,0.000072524985,0.051783312,0.000013024837,0.000027867518,0.0010431894,0.00025074682,0.34187195,0.00002375397,0.58603173,0.00053565635,0.01833208],"study_design_scores_gemma":[0.00030594852,0.00005860705,0.013466332,0.000026445166,0.000006261407,0.000006000912,0.000010377967,0.9796704,0.000036550424,0.005810137,0.00043283525,0.00017011887],"about_ca_topic_score_codex":0.0003501539,"about_ca_topic_score_gemma":0.000012750499,"teacher_disagreement_score":0.6377984,"about_ca_system_score_codex":0.000033163535,"about_ca_system_score_gemma":0.00002927449,"threshold_uncertainty_score":0.56224686},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007971077,0.0004617695,0.98705643,0.000178292,0.000045249802,0.0002301866,0.0000054940483,0.00015288962,0.0038985787],"genre_scores_gemma":[0.966137,0.0000052188493,0.033090387,0.000023538427,0.00010067005,0.00014518002,0.000014577938,0.000005711652,0.00047771173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994587,0.0000623528,0.00014215708,0.00016347742,0.000058885224,0.000114472525],"domain_scores_gemma":[0.99923384,0.0002825867,0.00007056148,0.00024073331,0.00009347879,0.00007877977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082585093,0.0000728657,0.00011322915,0.000056919627,0.0001314883,0.000038875965,0.00023342909,0.00002934445,0.0000018651484],"category_scores_gemma":[0.00006998791,0.00006513588,0.000026407051,0.00017471048,0.000054531705,0.00015079684,0.000046374556,0.000049505354,0.0000029453993],"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.000007283037,0.000029048337,0.00007153054,0.000019848252,0.0000071719714,3.8433136e-8,0.0029343483,0.000043081654,0.000024769306,0.93220854,0.00005447873,0.06459989],"study_design_scores_gemma":[0.0003580718,0.00006812774,0.00029985336,0.0000055453147,0.000015120469,0.0000057363545,0.0010728586,0.010677781,0.00055984897,0.96696955,0.01984041,0.00012711684],"about_ca_topic_score_codex":0.000007998747,"about_ca_topic_score_gemma":0.0000011807172,"teacher_disagreement_score":0.95816594,"about_ca_system_score_codex":0.0000064614815,"about_ca_system_score_gemma":0.00005766833,"threshold_uncertainty_score":0.26561642},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004099963,0.000005522754,0.9901153,0.0011259397,0.00028245675,0.00079095585,9.3824764e-7,0.00033069105,0.0032482257],"genre_scores_gemma":[0.5131649,0.0000016902255,0.48165074,0.00029496776,0.00034754624,0.00040885076,0.000008216116,0.000013596752,0.004109502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891853,0.0001467881,0.00012033896,0.00041501486,0.00013709806,0.00026224423],"domain_scores_gemma":[0.9990602,0.00037642935,0.00007193736,0.00022658471,0.00017585697,0.00008899754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031320192,0.00011391321,0.00011828289,0.00007944719,0.00035033352,0.00010660723,0.00037383547,0.00006466813,0.000019109179],"category_scores_gemma":[0.00032770413,0.00009429195,0.000045840243,0.00022017017,0.0000840647,0.0002473566,0.00010968225,0.00027998048,0.0001323042],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018069099,0.000078459845,0.00025809513,0.000003986839,0.000013577737,4.453669e-7,0.0008859846,0.000022663588,0.0012908016,0.020873573,0.00021251553,0.97634184],"study_design_scores_gemma":[0.0008407087,0.000417775,0.009920937,0.0000070775513,0.000003574479,0.0000035519076,0.000052387844,0.969456,0.002377479,0.00064704753,0.016137067,0.00013636047],"about_ca_topic_score_codex":0.00002138991,"about_ca_topic_score_gemma":0.0000075489,"teacher_disagreement_score":0.97620547,"about_ca_system_score_codex":0.00004419939,"about_ca_system_score_gemma":0.000034060755,"threshold_uncertainty_score":0.3845114},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005512418,0.0005731019,0.99083495,0.0007158471,0.002809529,0.00019625342,0.0000080958325,0.00030901958,0.0040019425],"genre_scores_gemma":[0.20732298,0.000075286734,0.7854871,0.0020015654,0.0028520909,0.0000093333865,0.000017761364,0.0000636796,0.0021702028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557376,0.000055802553,0.0005136155,0.0019802705,0.0011410911,0.00073545246],"domain_scores_gemma":[0.9966439,0.0008151032,0.00033648498,0.0017287545,0.00024100574,0.0002347294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007335483,0.0006184926,0.00058078323,0.0006294331,0.00033727498,0.001027242,0.005025896,0.00036956917,0.00023054951],"category_scores_gemma":[0.00018356666,0.0005414036,0.00014109386,0.0005505159,0.00089089846,0.00070006127,0.0016802266,0.0012350127,0.0003849713],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002950694,0.000023968782,0.0003414746,0.000016259442,0.000013750362,0.00012896823,0.0014664092,0.0063889115,0.000038237114,0.0036093772,0.000051711657,0.98791796],"study_design_scores_gemma":[0.00025429114,0.00023262617,0.001126092,0.0005390389,0.000009385631,0.000035747926,1.4542074e-7,0.76007533,0.00074688875,0.23245484,0.0035523318,0.00097325764],"about_ca_topic_score_codex":0.00016182207,"about_ca_topic_score_gemma":0.00018645164,"teacher_disagreement_score":0.98694474,"about_ca_system_score_codex":0.00015023722,"about_ca_system_score_gemma":0.00048776538,"threshold_uncertainty_score":0.99970376},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39691144,0.00012843573,0.5994845,0.00014217818,0.0011520156,0.00013138138,0.0000017942821,0.00065973535,0.0013885248],"genre_scores_gemma":[0.99142134,0.00019228578,0.0074466793,0.000052478626,0.00044935872,4.0245672e-7,0.000020187266,0.000025392477,0.00039189827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974899,0.00034708608,0.00021513004,0.001324702,0.00010144466,0.000521729],"domain_scores_gemma":[0.9984902,0.00017180304,0.00033408616,0.0007453346,0.000096506665,0.00016205906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034186238,0.0003846073,0.00037853848,0.00013619287,0.0005010474,0.00033183812,0.0011953487,0.00026118095,0.000032752065],"category_scores_gemma":[0.000059919177,0.00041957325,0.00014727279,0.0004374124,0.00010610571,0.0003940912,0.002624778,0.0016595694,0.000022617867],"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.00004572552,0.0001219711,0.0105989445,0.00013782592,0.00020674666,0.00065861206,0.001935935,0.8873526,0.0000054549805,0.06355907,0.000379705,0.03499742],"study_design_scores_gemma":[0.0004125677,0.00014461255,0.00083791825,0.00010970646,0.000039465922,0.00003072631,0.00005694543,0.99048746,0.000009437642,0.006479603,0.0009213067,0.00047025934],"about_ca_topic_score_codex":0.00020578253,"about_ca_topic_score_gemma":0.000018166671,"teacher_disagreement_score":0.5945099,"about_ca_system_score_codex":0.000090367175,"about_ca_system_score_gemma":0.000050361275,"threshold_uncertainty_score":0.9998256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104490705,0.000050136332,0.819432,0.008348357,0.0029952799,0.000051724575,0.000002317977,0.0006387791,0.06399069],"genre_scores_gemma":[0.9236332,0.0000021822295,0.05582219,0.0020971496,0.0013242343,0.0000036939498,0.0000039713486,0.000013399326,0.01709994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986541,0.00006316626,0.00016983764,0.00046287788,0.0003064227,0.00034353926],"domain_scores_gemma":[0.99901545,0.00008723699,0.00004051656,0.0006429052,0.00006790182,0.00014601502],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017989734,0.00014454653,0.00014803186,0.000057240908,0.0002521545,0.00045489948,0.000806663,0.00008099842,0.0009832884],"category_scores_gemma":[0.00004596125,0.000109960194,0.00008206006,0.00023377765,0.00014921653,0.00029618407,0.00029436214,0.0002304001,0.0020605673],"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.00002858518,0.00042205612,0.009641516,0.0000054231623,0.00008023874,0.00006902971,0.0016298549,0.000008584163,0.0013256813,0.61137265,0.20515266,0.17026374],"study_design_scores_gemma":[0.0002924485,0.00029357933,0.009020127,0.000009967325,0.000004155788,0.000008460993,0.0000134045795,0.5000729,0.0003637035,0.01773963,0.4719178,0.000263813],"about_ca_topic_score_codex":0.00033988868,"about_ca_topic_score_gemma":0.000030412693,"teacher_disagreement_score":0.8191425,"about_ca_system_score_codex":0.0000227904,"about_ca_system_score_gemma":0.000062111576,"threshold_uncertainty_score":0.99992996},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98652714,0.000012607653,0.0087362975,0.001282568,0.00010994556,0.000057912912,9.0056494e-7,0.00011751054,0.0031551241],"genre_scores_gemma":[0.9174468,0.000007938939,0.015397529,0.00001639169,0.00003969865,7.709225e-8,0.0000017764874,0.0000049704245,0.0670848],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99918735,0.00010918842,0.00006105365,0.00026302284,0.00014924083,0.00023016564],"domain_scores_gemma":[0.99952334,0.000035440386,0.00008772372,0.00021781567,0.00008352675,0.000052169762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017147182,0.000092562506,0.00016816892,0.00016408543,0.00016125532,0.00004624701,0.00054234813,0.000058001908,0.00005282099],"category_scores_gemma":[0.000015899177,0.000101613325,0.000043745164,0.00028444384,0.00014873907,0.00055751635,0.00022597198,0.0002335196,0.00007398232],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001708059,0.00024142505,0.01954179,0.00006943049,0.0000956924,0.00037675377,0.7263211,0.0019427143,0.01059948,0.02958585,0.0017508296,0.20930412],"study_design_scores_gemma":[0.005297072,0.0030311572,0.15553048,0.0003542843,0.000039932045,0.000047864833,0.5302618,0.26922888,0.007776976,0.006378615,0.020588541,0.0014643718],"about_ca_topic_score_codex":0.025854077,"about_ca_topic_score_gemma":0.0063852114,"teacher_disagreement_score":0.26728615,"about_ca_system_score_codex":0.000028865239,"about_ca_system_score_gemma":0.00004577888,"threshold_uncertainty_score":0.98063284},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015538274,0.00012190739,0.98232496,0.00029953575,0.0006338041,0.00029299594,0.000020573176,0.0003314833,0.00043648566],"genre_scores_gemma":[0.93570554,0.000001122649,0.06364767,0.0001371689,0.00029014266,0.000030195757,0.000093986484,0.000010688021,0.00008350309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830806,0.00010393535,0.0006444057,0.00021102397,0.00041076064,0.0003218023],"domain_scores_gemma":[0.9982053,0.00022854762,0.00069083873,0.000268676,0.0005172863,0.00008936733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046036483,0.0001911003,0.0002909377,0.00017540036,0.00079819525,0.00077420793,0.0005561773,0.00009384245,0.0000093944345],"category_scores_gemma":[0.00030115808,0.00015576191,0.00007398738,0.00037998555,0.00014887073,0.0024269724,0.000115906245,0.00022392058,0.000011907523],"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.00018404373,0.0001714234,0.011180718,0.004758275,0.00008452208,9.996066e-7,0.026506947,0.015480156,0.0064689135,0.033657275,0.004841701,0.89666504],"study_design_scores_gemma":[0.00039156186,0.00024801274,0.0005877678,0.00016665738,0.000005629261,0.000014685768,0.000100251586,0.9462849,0.0018541394,0.000643988,0.049514875,0.00018751531],"about_ca_topic_score_codex":0.0005273401,"about_ca_topic_score_gemma":0.000004343495,"teacher_disagreement_score":0.9308048,"about_ca_system_score_codex":0.000030739484,"about_ca_system_score_gemma":0.000075275726,"threshold_uncertainty_score":0.74657047},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032486853,0.00005822158,0.99452186,0.0007277974,0.0002244291,0.00028517406,4.947075e-7,0.00017820863,0.00075515534],"genre_scores_gemma":[0.4495376,2.8472405e-7,0.5481323,0.00032692848,0.00012099026,0.0000193362,6.032865e-7,0.000008993203,0.0018529502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986204,0.00026547475,0.0001612693,0.00042780375,0.00016436428,0.00036067434],"domain_scores_gemma":[0.9977189,0.0016474277,0.00005272636,0.00027821856,0.00016593303,0.00013682483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018795631,0.00013507775,0.00021091336,0.000263211,0.00031277913,0.00028506093,0.00037076435,0.00005669801,0.00003370384],"category_scores_gemma":[0.0006528391,0.00010851004,0.000059077352,0.00051876454,0.00008973716,0.00017870567,0.00009197285,0.00024428318,0.000029675735],"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.00003577921,0.00005296217,0.00034948107,0.000038754493,0.000037601876,0.0000020952168,0.00041561536,0.017497279,0.0012843492,0.003159486,0.00019943922,0.97692716],"study_design_scores_gemma":[0.0011557763,0.0005545646,0.0004992627,0.000008552192,0.000009013771,0.0000046300106,0.000017107986,0.9951122,0.0012615633,0.0002908082,0.00093387085,0.0001526917],"about_ca_topic_score_codex":0.00006128883,"about_ca_topic_score_gemma":0.0000010532127,"teacher_disagreement_score":0.9776149,"about_ca_system_score_codex":0.000015249848,"about_ca_system_score_gemma":0.0000700558,"threshold_uncertainty_score":0.4424911},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029192776,0.00016806801,0.9921493,0.00010737831,0.0007569041,0.00018229718,0.0000033638194,0.0001123236,0.003601115],"genre_scores_gemma":[0.39226002,0.000018855111,0.60689175,0.00034615197,0.00024598924,0.0000023905395,0.0000020055816,0.00001825496,0.00021455112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973538,0.000027783666,0.0004983097,0.0009663677,0.00069780985,0.0004559409],"domain_scores_gemma":[0.99735206,0.00083717436,0.0004349277,0.0008895388,0.00034653448,0.00013973839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073820545,0.00038640364,0.0005025136,0.0005281849,0.00019223287,0.00026602054,0.0020709068,0.00018175581,0.000016087633],"category_scores_gemma":[0.00033831067,0.00034394494,0.000049721493,0.00048757088,0.0010718874,0.0004290197,0.0014807304,0.00061481184,0.000020386457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004753839,0.000024129944,0.00118197,0.00012319483,0.00001186787,0.000029812902,0.0015967923,0.0064368774,0.0005435416,0.006010912,0.000009401728,0.98402673],"study_design_scores_gemma":[0.00023364641,0.00026326792,0.0013595369,0.0006884212,0.0000043845434,0.000054598604,1.2692121e-7,0.9400924,0.00085923064,0.0557573,0.00025359206,0.00043353962],"about_ca_topic_score_codex":0.000046973204,"about_ca_topic_score_gemma":0.000009934033,"teacher_disagreement_score":0.9835932,"about_ca_system_score_codex":0.000051494328,"about_ca_system_score_gemma":0.0002633645,"threshold_uncertainty_score":0.99990124},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11241172,0.0000036013867,0.8577278,0.0013932951,0.001113279,0.00015408808,0.000010994276,0.0003085171,0.02687668],"genre_scores_gemma":[0.8603807,0.0000030048689,0.1360424,0.0023299698,0.00042039194,0.000004465626,0.00006946515,0.000009274533,0.0007403083],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862516,0.00010458295,0.00024174261,0.00029838478,0.00049009686,0.00024004765],"domain_scores_gemma":[0.99889374,0.00015581373,0.00016550848,0.0005488539,0.00012614645,0.000109910674],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024489808,0.0001620933,0.00014559538,0.00014396939,0.00020345626,0.00031413013,0.00056896795,0.000081171784,0.0005548887],"category_scores_gemma":[0.00002421252,0.00013081872,0.00004995889,0.00035457872,0.00006482264,0.0010147819,0.00012040984,0.00022568533,0.002175937],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094929646,0.0004365864,0.0014056293,0.000016110134,0.00008977273,0.00003221859,0.0039347885,0.00095935527,0.0015953575,0.17789559,0.05691664,0.75576866],"study_design_scores_gemma":[0.004430848,0.0017579799,0.046818595,0.00011280621,0.000009333838,0.0000049087425,0.00016988225,0.44970357,0.018431887,0.023750655,0.4537692,0.0010403439],"about_ca_topic_score_codex":0.00031759517,"about_ca_topic_score_gemma":0.000004953723,"teacher_disagreement_score":0.7547283,"about_ca_system_score_codex":0.000084817686,"about_ca_system_score_gemma":0.00005542402,"threshold_uncertainty_score":0.99860096},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07670027,0.00016089459,0.9090928,0.00025881027,0.0015680708,0.0003902903,0.0000065167974,0.0006317433,0.0111906035],"genre_scores_gemma":[0.98542905,0.0001009618,0.009233337,0.0001471853,0.0002783066,0.0000015312912,0.000020356256,0.000023194136,0.004766095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733514,0.000554515,0.00028525587,0.0012537289,0.0001276622,0.00044368673],"domain_scores_gemma":[0.99762344,0.00031477783,0.00040161176,0.0012966379,0.00015268715,0.00021085968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00107595,0.0003925356,0.00069209415,0.00028506212,0.00027828288,0.00019609138,0.0021061169,0.00021887512,0.00006968251],"category_scores_gemma":[0.00021715052,0.00038528923,0.00043967707,0.00043418026,0.00022036213,0.00019662268,0.0028047177,0.00087858684,0.000214475],"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.005286208,0.00041741072,0.00344306,0.0003680271,0.00092638,0.0017211527,0.0021694794,0.31227136,0.000017440496,0.6585065,0.002663806,0.012209154],"study_design_scores_gemma":[0.019899946,0.00003449157,0.000073131116,0.000097155564,0.000069239766,0.0000097388,0.0000075656035,0.93694097,0.000026514685,0.041471355,0.0009405463,0.0004293454],"about_ca_topic_score_codex":0.0004999657,"about_ca_topic_score_gemma":0.000015204524,"teacher_disagreement_score":0.9087288,"about_ca_system_score_codex":0.00011169744,"about_ca_system_score_gemma":0.00011550122,"threshold_uncertainty_score":0.9998599},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033637743,0.00003363946,0.9574596,0.0013960872,0.000760854,0.00013125005,0.000001009586,0.00031300445,0.0062667807],"genre_scores_gemma":[0.9265111,0.000003841395,0.07201348,0.00025170489,0.00055449054,0.000007813136,0.0000013962224,0.00001110766,0.00064506294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823755,0.000109561384,0.00029631532,0.00050804345,0.00036189862,0.00048661404],"domain_scores_gemma":[0.99890894,0.000112528774,0.00005401468,0.000564346,0.00021732187,0.00014287738],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005592701,0.00014997325,0.00013849029,0.00010601643,0.00038632296,0.00039970328,0.0010496968,0.00005697558,0.00018624595],"category_scores_gemma":[0.00017791707,0.00013824474,0.000057810706,0.00063741504,0.00027763873,0.00027385526,0.00027463998,0.00026115341,0.0031144745],"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.000016640539,0.000111319816,0.00020180122,0.000009389843,0.000010887025,0.000031543266,0.0015421547,0.00045215414,0.001124267,0.54904073,0.00032990036,0.44712922],"study_design_scores_gemma":[0.000020185293,0.00045782357,0.00027984162,0.000020687232,0.000003980829,0.000031773816,0.00007099343,0.84301466,0.050766524,0.101133585,0.0038975119,0.00030243993],"about_ca_topic_score_codex":0.00022208177,"about_ca_topic_score_gemma":0.000046635716,"teacher_disagreement_score":0.89287335,"about_ca_system_score_codex":0.000030867744,"about_ca_system_score_gemma":0.00010360318,"threshold_uncertainty_score":0.9976617},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91162914,0.000007912692,0.052497827,0.011322523,0.0059698066,0.00037246442,9.344625e-7,0.00059772906,0.017601682],"genre_scores_gemma":[0.9580256,7.7638873e-7,0.03957279,0.0007551688,0.0010588462,0.000006670515,2.807096e-7,0.000012026264,0.0005678821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988316,0.000015513824,0.00025676386,0.00037612903,0.00032136537,0.00019859402],"domain_scores_gemma":[0.9987735,0.000061192375,0.00025724465,0.0006004487,0.00026019517,0.00004741786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030968254,0.00014404568,0.00015401139,0.00011945542,0.00026231093,0.00019047206,0.0026976967,0.000053615786,0.000033973465],"category_scores_gemma":[0.00015527545,0.00010103004,0.0001224356,0.00027056073,0.000054884,0.0004862579,0.0012658838,0.0003174444,0.00011131314],"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.00010161061,0.0007921328,0.0018104095,0.00014871848,0.00017765736,0.0000019428608,0.00535255,0.000086426335,0.13550071,0.37438866,0.13640851,0.34523067],"study_design_scores_gemma":[0.0011576228,0.0032672978,0.013782015,0.0007981699,0.00003581682,0.00016901894,0.000088693196,0.354006,0.45794645,0.11227296,0.055663098,0.00081286713],"about_ca_topic_score_codex":0.000020797443,"about_ca_topic_score_gemma":9.021295e-7,"teacher_disagreement_score":0.35391957,"about_ca_system_score_codex":0.00004045101,"about_ca_system_score_gemma":0.000008252866,"threshold_uncertainty_score":0.5013036},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019491254,0.00006954505,0.44780368,0.00038697114,0.0006122058,0.0022125605,0.0003331539,0.00042492495,0.54796207],"genre_scores_gemma":[0.0018113062,0.000010734813,0.59135085,0.00026126165,0.0020611691,0.00021176759,0.00021494292,0.0001477378,0.4039302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984497,0.0000043505365,0.0004248147,0.00050510286,0.00030274305,0.0003133205],"domain_scores_gemma":[0.99825644,0.0006716095,0.00046588076,0.00041267215,0.00008395683,0.00010945312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004280353,0.0003846097,0.0004928387,0.00003684585,0.00043116955,0.00032103504,0.0004011723,0.00052884704,0.000011524468],"category_scores_gemma":[0.000063223895,0.00033862685,0.0003280378,0.000032945398,0.00010812348,0.00004813521,0.00026935124,0.0006322084,0.000017114204],"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.000001998389,0.000012930045,6.6965896e-7,0.00014148308,0.00012144062,4.1974016e-7,0.00054537883,0.0000141426235,0.00011319441,0.97147703,0.0032030912,0.024368241],"study_design_scores_gemma":[0.0027371948,0.00021609769,0.0000028329391,0.0007127652,0.00036187892,0.000022179753,0.00019167544,0.054125443,0.00031746356,0.8070151,0.13286348,0.0014338485],"about_ca_topic_score_codex":0.0000066476573,"about_ca_topic_score_gemma":8.739576e-7,"teacher_disagreement_score":0.16446187,"about_ca_system_score_codex":0.000047523048,"about_ca_system_score_gemma":0.00023077162,"threshold_uncertainty_score":0.9999066},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050187627,0.0001691872,0.98597974,0.0006770088,0.0025180376,0.00024656722,9.524785e-7,0.00021877821,0.010184721],"genre_scores_gemma":[0.0042703957,0.00003993661,0.9910024,0.0018780134,0.0005105278,0.0000029702994,0.000008826144,0.000037283848,0.0022496462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686384,0.000037654187,0.00036479183,0.0013657565,0.00083702954,0.000530909],"domain_scores_gemma":[0.99783504,0.00025522083,0.00025242465,0.0013348326,0.00017650131,0.0001459937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006260365,0.00043350295,0.00041312855,0.000730363,0.00019368132,0.00053541875,0.0028822783,0.00028095298,0.00007384433],"category_scores_gemma":[0.00008657294,0.00039762727,0.00011326581,0.00054475554,0.00029761906,0.0005729656,0.0011628094,0.0008947198,0.00021566234],"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":[9.277935e-7,0.0000071693967,0.000024843102,0.000013404386,0.000003352925,0.000022666352,0.00021478541,0.7052806,0.0000036245963,0.005694447,0.000013206897,0.28872097],"study_design_scores_gemma":[0.0001865532,0.000098707336,0.000020129452,0.00013774252,0.0000038792796,0.000038441493,5.200104e-8,0.98072195,0.00004674277,0.016742328,0.0015388399,0.00046461844],"about_ca_topic_score_codex":0.000020649115,"about_ca_topic_score_gemma":0.000025938842,"teacher_disagreement_score":0.28825635,"about_ca_system_score_codex":0.00019041565,"about_ca_system_score_gemma":0.00047140237,"threshold_uncertainty_score":0.99984753},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006097136,0.0006241893,0.9527835,0.013720284,0.0018985375,0.00020674526,0.000008994377,0.0006258376,0.024034748],"genre_scores_gemma":[0.95318455,0.000015160138,0.040781174,0.0028768121,0.00046797,0.0000073765887,0.0000051443612,0.0000157424,0.0026460974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791586,0.00014499397,0.00028074638,0.0007128168,0.00048267306,0.00046292317],"domain_scores_gemma":[0.99823195,0.00019441084,0.00010382323,0.0010345922,0.00025411314,0.00018110465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069329026,0.00024193336,0.00021565772,0.00012871997,0.000324618,0.00020689746,0.0018161304,0.0002405202,0.00033103515],"category_scores_gemma":[0.0005930588,0.00019843417,0.00009920249,0.00084578426,0.00019408236,0.00022271073,0.00045415747,0.001404766,0.00019288596],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027513863,0.00023386025,0.00852242,0.00003768569,0.000045881345,0.0000495873,0.0016115156,0.0005632949,0.0004873136,0.24083537,0.006785316,0.74080026],"study_design_scores_gemma":[0.00024722877,0.00083812856,0.0068210177,0.000058966878,0.000016075832,0.00016526041,0.000063852705,0.5426968,0.054253966,0.08817215,0.30557615,0.0010904152],"about_ca_topic_score_codex":0.00063101604,"about_ca_topic_score_gemma":0.0003378981,"teacher_disagreement_score":0.9470874,"about_ca_system_score_codex":0.00007437233,"about_ca_system_score_gemma":0.000109813824,"threshold_uncertainty_score":0.80919105},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5681112,0.00004277847,0.41609126,0.008587705,0.0020022152,0.0013932257,0.000009776704,0.00026168727,0.0035001722],"genre_scores_gemma":[0.9925345,0.0000075048956,0.006627433,0.00021596998,0.00012607145,0.0000447963,7.669404e-7,0.00001427885,0.00042865222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831665,0.000020289875,0.00038292634,0.00048972626,0.0004212237,0.0003691767],"domain_scores_gemma":[0.99847513,0.0001924306,0.0003127195,0.0004611713,0.00048376012,0.0000747774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071753596,0.00020423281,0.00021232828,0.00007063349,0.00036061383,0.0005520703,0.0028504375,0.000070255875,0.0000797212],"category_scores_gemma":[0.00024308557,0.00012368028,0.00013112405,0.0003763687,0.0001766715,0.00042456842,0.0002485112,0.00029915286,0.00011537249],"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.00007826151,0.0001230133,0.00028983937,0.000038463975,0.000021710395,1.6702148e-7,0.0011793489,0.00096311374,0.053921863,0.774143,0.00015182323,0.16908944],"study_design_scores_gemma":[0.000040132272,0.00033321642,0.00023634719,0.0000658419,0.0000121558605,0.0000034649047,0.00023715674,0.7997209,0.14152978,0.05724448,0.00040089825,0.0001756616],"about_ca_topic_score_codex":0.000078458936,"about_ca_topic_score_gemma":0.0000070819656,"teacher_disagreement_score":0.79875773,"about_ca_system_score_codex":0.000020903972,"about_ca_system_score_gemma":0.00008176247,"threshold_uncertainty_score":0.5323627},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032949916,0.0003314483,0.9918885,0.00002259585,0.00024010285,0.0010784434,0.00004069741,0.00013067183,0.00297253],"genre_scores_gemma":[0.23472682,0.000015917605,0.76495415,0.000006876083,0.000030504621,0.00016636867,0.000021187407,0.000025715864,0.000052479725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981805,0.000017677085,0.0005993031,0.0005200053,0.0003723153,0.00031018764],"domain_scores_gemma":[0.9975239,0.0008141324,0.00069893646,0.0008063709,0.000109753695,0.000046905916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046843124,0.000303168,0.000746961,0.000114144386,0.000043972745,0.00008055483,0.0010249423,0.00011911487,2.9752258e-7],"category_scores_gemma":[0.000076028664,0.00024402997,0.000048035625,0.0002112455,0.00009541117,0.00009233819,0.0005897022,0.00045430777,0.0000023429254],"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.0000053827594,0.000094014016,0.00009480647,0.0036396622,0.000009740854,5.510238e-7,0.00046332268,0.73389846,0.000012695594,0.25892898,0.0000035825865,0.0028487989],"study_design_scores_gemma":[0.00025713496,0.000057747868,0.000007130219,0.00049068674,0.00001023039,0.0000026406756,0.000089376495,0.7493789,0.00001649304,0.2494513,0.000021377198,0.000216989],"about_ca_topic_score_codex":0.000015751973,"about_ca_topic_score_gemma":0.0000067604215,"teacher_disagreement_score":0.23143181,"about_ca_system_score_codex":0.00008347673,"about_ca_system_score_gemma":0.00013335404,"threshold_uncertainty_score":0.99512535},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6051303,0.00002754132,0.3813776,0.0035508196,0.00073549733,0.0010751211,0.000005601571,0.00012501203,0.007972495],"genre_scores_gemma":[0.9895657,0.0000020098237,0.00994067,0.00014937889,0.00007898578,0.00003121562,5.307613e-7,0.000011711729,0.00021983898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985023,0.000013674907,0.0003834377,0.00042713835,0.0003098743,0.0003635322],"domain_scores_gemma":[0.99890447,0.0002360255,0.00028589042,0.00022716104,0.00029000742,0.00005645198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046061687,0.0001867879,0.0002624969,0.00018154936,0.00011132633,0.00015815432,0.0013762082,0.00007311651,0.000014044519],"category_scores_gemma":[0.0004417554,0.00014222284,0.00009447114,0.0005062504,0.00010312753,0.00028571178,0.0002465566,0.00033733604,0.000047342728],"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.00012313196,0.00017635309,0.0011760837,0.00005604514,0.00001702704,4.6059105e-7,0.0077767572,0.012786822,0.016908407,0.9208343,0.000022589667,0.040122043],"study_design_scores_gemma":[0.00006105392,0.00027377866,0.00049000897,0.00026473397,0.000004814098,0.000003309367,0.0010563189,0.8806535,0.04134133,0.07559466,0.00005525101,0.00020124562],"about_ca_topic_score_codex":0.00008095622,"about_ca_topic_score_gemma":0.000008685588,"teacher_disagreement_score":0.8678667,"about_ca_system_score_codex":0.000044838354,"about_ca_system_score_gemma":0.00006885958,"threshold_uncertainty_score":0.5799679},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53939384,0.000090843445,0.45874804,0.0010713219,0.0005407394,0.00003799383,0.0000035745763,0.00005505858,0.000058607373],"genre_scores_gemma":[0.9097965,0.000013103421,0.089682944,0.0002461665,0.00022135561,6.036545e-7,1.845223e-7,0.0000040518826,0.000035124645],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99856716,0.0003828975,0.0003332053,0.00018961226,0.0003407574,0.0001863727],"domain_scores_gemma":[0.9985569,0.00026781423,0.0005167551,0.00029717133,0.00027961182,0.00008174576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011355514,0.00010327604,0.00017189943,0.000048647762,0.00043557948,0.00018619369,0.0005184705,0.000040743,0.000016022417],"category_scores_gemma":[0.001247122,0.00007142965,0.00005943541,0.00025626548,0.00041553695,0.00032685444,0.00021406102,0.00042542373,0.0000038798903],"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.000008225118,0.000025835943,0.682459,0.000050170926,0.000027806276,0.000006931996,0.0031493497,0.000119120574,0.0013237516,0.013514275,0.00006609264,0.29924947],"study_design_scores_gemma":[0.0012717127,0.00027314268,0.8068561,0.00092338165,0.000025685238,0.002220952,0.0009974488,0.016554933,0.0072238273,0.16210738,0.0009511731,0.00059424527],"about_ca_topic_score_codex":0.00017220392,"about_ca_topic_score_gemma":0.000048131675,"teacher_disagreement_score":0.37040263,"about_ca_system_score_codex":0.00002913802,"about_ca_system_score_gemma":0.00012995754,"threshold_uncertainty_score":0.33501694},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11889402,0.00017160841,0.86034596,0.0026225382,0.0010955937,0.0006428634,0.000006823538,0.0009853428,0.015235271],"genre_scores_gemma":[0.94228864,0.00007866306,0.0040677227,0.00018218515,0.00029139346,0.0000012021763,0.000016949763,0.00005823341,0.053015023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958818,0.0006771728,0.00017619356,0.002303491,0.00027758264,0.0006837576],"domain_scores_gemma":[0.9973032,0.00030244846,0.0002600524,0.0013725692,0.00024943234,0.00051231764],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004905022,0.0006596478,0.0006449343,0.00069490826,0.00038976263,0.0006008632,0.0024845805,0.0003542916,0.0001533622],"category_scores_gemma":[0.00037014077,0.0007120943,0.0004337411,0.0009932205,0.00004221917,0.00030085252,0.0026274282,0.0033499098,0.00084824],"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.00008412698,0.00007289463,0.00886608,0.000045791978,0.00013344476,0.00025805808,0.0028370025,0.9288415,0.00003466886,0.05310083,0.00063765905,0.005087959],"study_design_scores_gemma":[0.0010828807,0.0009080546,0.0015581704,0.00021194002,0.000059805196,0.000010748676,0.00060998776,0.9814373,0.00005648657,0.002931337,0.010093028,0.0010402298],"about_ca_topic_score_codex":0.0013286921,"about_ca_topic_score_gemma":0.00002660885,"teacher_disagreement_score":0.85627824,"about_ca_system_score_codex":0.00057399063,"about_ca_system_score_gemma":0.00038275632,"threshold_uncertainty_score":0.9999297},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10899653,0.0000044185863,0.66471875,0.022196008,0.00078819954,0.000258786,0.000007618108,0.0007879594,0.20224176],"genre_scores_gemma":[0.9616747,0.000004494149,0.012562295,0.00052684924,0.00039896352,0.000053983516,0.000059760125,0.000019015843,0.02469995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976991,0.00021137187,0.00025318417,0.0006570443,0.0008598489,0.00031944332],"domain_scores_gemma":[0.9982767,0.00026093668,0.00016466244,0.00031519867,0.0008047437,0.00017774712],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029446927,0.00020373904,0.00015660147,0.0003728735,0.0006326417,0.000591451,0.0009284702,0.00005957093,0.00064725266],"category_scores_gemma":[0.00061494816,0.00018525816,0.000060790615,0.0004504758,0.00014701915,0.00048476737,0.00023345498,0.000708896,0.0014658639],"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.00013467751,0.00020418824,0.03761658,0.0000075692838,0.00021122639,0.000087839835,0.011405233,0.09083288,0.0032065418,0.7975172,0.0021649844,0.05661108],"study_design_scores_gemma":[0.0012205337,0.0026261955,0.05205874,0.00016858299,0.000017887098,0.0001817984,0.0029097346,0.8354447,0.0018262437,0.0111048855,0.09159653,0.0008441579],"about_ca_topic_score_codex":0.00012437602,"about_ca_topic_score_gemma":0.00004368557,"teacher_disagreement_score":0.8526782,"about_ca_system_score_codex":0.000071860195,"about_ca_system_score_gemma":0.00015602837,"threshold_uncertainty_score":0.9993116},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010867976,0.0005783464,0.9495208,0.0014834852,0.002710312,0.000188525,0.0000025001611,0.00029653477,0.045208592],"genre_scores_gemma":[0.033392865,0.0001171418,0.9477392,0.004364989,0.0022239164,0.000010082089,0.0000066190337,0.000082002116,0.012063193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595165,0.000036651905,0.00044997275,0.00167239,0.0011259425,0.0007633634],"domain_scores_gemma":[0.9973989,0.00033186955,0.00024621934,0.0016407206,0.00015575878,0.00022654455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007124342,0.00056137395,0.00051474216,0.00083987415,0.0003143508,0.0006859862,0.004138493,0.0003169371,0.00012808018],"category_scores_gemma":[0.00008036432,0.00050358824,0.0001591609,0.00062815734,0.0005164228,0.00048344172,0.0014647933,0.0013587165,0.00032305668],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.651175e-7,0.000019734478,0.00002900954,0.00001707834,0.000006617236,0.00013427464,0.00040080913,0.012072395,0.00001400553,0.03655237,0.00012773633,0.9506252],"study_design_scores_gemma":[0.0002025237,0.00014815286,0.00006615129,0.00017917308,0.000004904989,0.00013056041,2.6102693e-8,0.7745585,0.00016331626,0.21060559,0.013219632,0.00072150637],"about_ca_topic_score_codex":0.000021236778,"about_ca_topic_score_gemma":0.0000110181645,"teacher_disagreement_score":0.9499037,"about_ca_system_score_codex":0.00017740243,"about_ca_system_score_gemma":0.00022579325,"threshold_uncertainty_score":0.99974155},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51271886,0.000039643655,0.48544186,0.00014113465,0.00026945907,0.00007301553,9.931803e-8,0.00019216472,0.0011237677],"genre_scores_gemma":[0.9059152,6.379507e-7,0.09365368,0.00022466552,0.00007378549,3.896058e-7,4.752016e-7,0.000009232298,0.000121909914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978985,0.0005020011,0.0004105151,0.00043466914,0.0003494567,0.0004048529],"domain_scores_gemma":[0.99762106,0.001041548,0.00031130848,0.00085118087,0.00009135706,0.000083534185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028633755,0.00017350912,0.00035204383,0.0001458255,0.00013072893,0.00007447047,0.0016934671,0.000043415912,0.000010479603],"category_scores_gemma":[0.000106384636,0.00015697861,0.00012304164,0.00044196198,0.000059319194,0.00033471602,0.00072379695,0.00027470948,0.000027658483],"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.000014275227,0.000051526018,0.014231306,0.000047619134,0.000023875064,0.0000040512546,0.005450391,0.028364481,0.003706849,0.696437,0.0000025870552,0.25166604],"study_design_scores_gemma":[0.0008421378,0.00028563564,0.044279385,0.00013092687,0.000004330605,0.00003786316,0.00028021896,0.86443937,0.0059032263,0.08344388,0.00006091296,0.0002920867],"about_ca_topic_score_codex":0.0000171658,"about_ca_topic_score_gemma":1.4201284e-7,"teacher_disagreement_score":0.8360749,"about_ca_system_score_codex":0.00001204653,"about_ca_system_score_gemma":0.000036796322,"threshold_uncertainty_score":0.64014024},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50991404,0.00005962412,0.37458515,0.0015261138,0.002161309,0.00025398075,3.3872033e-7,0.00041888855,0.11108053],"genre_scores_gemma":[0.9697158,8.128487e-7,0.01026489,0.000078521676,0.00008306058,0.0000025873444,0.0000017699623,0.0000070769847,0.019845534],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873066,0.00007677159,0.00023701072,0.00038209534,0.00032394848,0.00024953776],"domain_scores_gemma":[0.9992636,0.0001003794,0.00009574344,0.000415615,0.000072459035,0.00005220979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009314964,0.000101502024,0.00017570934,0.00013523396,0.000041757397,0.00018572662,0.00028464478,0.000043322612,0.000011737642],"category_scores_gemma":[0.00009959922,0.00008708759,0.000039817587,0.0003273167,0.000008130325,0.00024512678,0.00013666654,0.0002184523,0.00018731329],"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.0000128699485,0.00018616306,0.43327957,0.00020323158,0.000076669596,0.0075187725,0.008074333,0.04436572,0.0052637355,0.412374,0.0028379716,0.08580695],"study_design_scores_gemma":[0.00024027367,0.00003331613,0.014484709,0.00008652298,0.0000012518108,0.000567833,0.0002235135,0.97805333,0.0004533112,0.00020322383,0.005436563,0.00021614526],"about_ca_topic_score_codex":0.0008579506,"about_ca_topic_score_gemma":0.0000090285075,"teacher_disagreement_score":0.9336876,"about_ca_system_score_codex":0.00004360139,"about_ca_system_score_gemma":0.0000316836,"threshold_uncertainty_score":0.35513288},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119747244,0.005344182,0.24558616,0.00830989,0.0080609545,0.0021201307,0.000011411009,0.002843019,0.60797703],"genre_scores_gemma":[0.7237939,0.0004673909,0.0056068487,0.0003630724,0.00027022898,0.000040483097,0.00012355405,0.0000564927,0.26927802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974438,0.00068621547,0.0004093552,0.0006606683,0.00037960865,0.00042035498],"domain_scores_gemma":[0.99809235,0.0005799035,0.00037504116,0.00070873456,0.00010574678,0.0001382338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010788115,0.00041040184,0.00049744395,0.00012915152,0.00069884135,0.00066897186,0.0012483546,0.00023396566,0.00027899278],"category_scores_gemma":[0.00023040242,0.00025744643,0.00015557477,0.00029387383,0.00023026897,0.00020874497,0.000375217,0.0015743731,0.00035385453],"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.00013088807,0.00012194574,0.002979851,0.0002313825,0.00022097274,0.000033950088,0.056954652,0.00030969974,0.0000128184165,0.22038189,0.0011635651,0.71745837],"study_design_scores_gemma":[0.0016724836,0.0002099982,0.017447928,0.00019472791,0.000093931485,0.000057541743,0.0010529598,0.95957553,0.00002678716,0.0021423947,0.016982457,0.00054326426],"about_ca_topic_score_codex":0.0030115752,"about_ca_topic_score_gemma":0.00017990154,"teacher_disagreement_score":0.9592658,"about_ca_system_score_codex":0.000010057402,"about_ca_system_score_gemma":0.00009888843,"threshold_uncertainty_score":0.9999878},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8020926,0.000055442586,0.18658006,0.0018103898,0.0002798537,0.00027111438,0.000015808653,0.00013297185,0.008761771],"genre_scores_gemma":[0.97842526,0.000009481034,0.016665855,0.000046899106,0.000013008489,1.5207202e-7,0.0000022471982,0.0000051757834,0.004831904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989557,0.000118052514,0.00013531202,0.00032823454,0.00024304671,0.00021959958],"domain_scores_gemma":[0.99896306,0.00010784189,0.00013570685,0.00052903144,0.00016312719,0.00010123289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026717747,0.00011014224,0.00025633303,0.0001409447,0.00011992091,0.000012224541,0.0006778848,0.000058699345,0.00019925946],"category_scores_gemma":[0.000057203823,0.00012219475,0.00011563285,0.00035296584,0.000149689,0.00028517484,0.00046080103,0.00015203407,0.00018312469],"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.00076663116,0.0016522341,0.3634596,0.0006710067,0.00039578733,0.000056305365,0.027554238,0.020292051,0.025502432,0.40560827,0.008266807,0.14577465],"study_design_scores_gemma":[0.0037648303,0.002465199,0.80868,0.00019368231,0.000069373076,0.000016551263,0.004387269,0.034614775,0.004822399,0.002933979,0.13699985,0.0010521143],"about_ca_topic_score_codex":0.0019641828,"about_ca_topic_score_gemma":0.00014414197,"teacher_disagreement_score":0.44522038,"about_ca_system_score_codex":0.000058621285,"about_ca_system_score_gemma":0.0001184373,"threshold_uncertainty_score":0.49829572},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8853215,0.0002904475,0.055812016,0.007936896,0.0020555444,0.00039501794,0.000016719887,0.00076259306,0.04740925],"genre_scores_gemma":[0.97466314,0.000017039007,0.001379508,0.000665968,0.00033917668,0.0000033440472,0.0000068920763,0.0000131801535,0.022911724],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981428,0.00015617709,0.0002688945,0.0005216885,0.00046239546,0.0004480839],"domain_scores_gemma":[0.998285,0.00019759224,0.00013398066,0.0010634924,0.00018236291,0.00013755157],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005938451,0.00022354182,0.00023041051,0.00005512299,0.000570781,0.00032419505,0.0016957547,0.00010056689,0.0009021085],"category_scores_gemma":[0.00010995025,0.00014419445,0.00007641687,0.00046600896,0.0004246698,0.00023540122,0.0005533242,0.00038431992,0.0018022597],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002786864,0.00022723727,0.013532897,0.00004910559,0.000098218974,0.00008978786,0.011515748,0.000019736659,0.011361272,0.07513656,0.055038642,0.8326521],"study_design_scores_gemma":[0.0027720553,0.003623999,0.08579616,0.00023919824,0.00007995877,0.0005006305,0.00025641287,0.34969345,0.07394654,0.024199026,0.45668066,0.0022119272],"about_ca_topic_score_codex":0.00024658904,"about_ca_topic_score_gemma":0.00015360762,"teacher_disagreement_score":0.83044016,"about_ca_system_score_codex":0.000056891487,"about_ca_system_score_gemma":0.00009666785,"threshold_uncertainty_score":0.998975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10670466,0.00007192092,0.88603735,0.000471235,0.00095048005,0.00022082645,5.079019e-7,0.00081097597,0.004732021],"genre_scores_gemma":[0.90196055,0.000008052465,0.096843995,0.00019545201,0.00046646444,0.000012916909,0.00002879946,0.0000493275,0.0004344129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698067,0.00039424744,0.00033468413,0.0012898269,0.0005083471,0.00049221824],"domain_scores_gemma":[0.9983496,0.00016953833,0.0004724201,0.00068713375,0.00018416959,0.0001371363],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00029384423,0.00040852212,0.00042105207,0.00017779041,0.00041262174,0.001029463,0.0010048473,0.0001902433,0.000014306072],"category_scores_gemma":[0.00008032601,0.00038743857,0.00017710321,0.00038301694,0.000032380147,0.00021644995,0.002263763,0.0027756845,0.00001583233],"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.000008183263,0.000077927,0.002298361,0.00019400958,0.00008036138,0.00039747593,0.0024296609,0.4393817,0.0002161566,0.0002323489,0.00003314509,0.55465066],"study_design_scores_gemma":[0.00033333382,0.0001230082,0.008161565,0.0005135877,0.000020742002,0.00013416866,0.00013570776,0.9886972,0.0003900372,0.0001377182,0.0008439976,0.0005089485],"about_ca_topic_score_codex":0.000092421826,"about_ca_topic_score_gemma":0.000005306999,"teacher_disagreement_score":0.7952559,"about_ca_system_score_codex":0.000059284608,"about_ca_system_score_gemma":0.00018331953,"threshold_uncertainty_score":0.9998577},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21156915,0.0001629075,0.7821739,0.00007156243,0.00047526765,0.0001256691,0.00008218083,0.00024680138,0.005092572],"genre_scores_gemma":[0.99585325,0.00007850607,0.0026328522,0.000030008518,0.00014939511,6.5784525e-7,0.000105559324,0.000016522536,0.0011332341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981507,0.00029636335,0.00021329935,0.00071624335,0.00013014802,0.0004932332],"domain_scores_gemma":[0.9983391,0.00013990278,0.0003477097,0.0008964915,0.00007652758,0.00020028114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003661198,0.00030198396,0.00036157417,0.00018526545,0.00027051038,0.00007425094,0.0013536919,0.0002592386,0.00007326458],"category_scores_gemma":[0.000050636278,0.0003177113,0.00031785027,0.00047170045,0.000107492815,0.00032679344,0.0021439858,0.0013086107,0.000035433397],"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.000026942287,0.00032869412,0.065707974,0.00019376025,0.0002829052,0.0001968972,0.0008126849,0.05239232,0.00014578289,0.87767637,0.00046763988,0.001768041],"study_design_scores_gemma":[0.0012350178,0.0001406349,0.034875717,0.0003135644,0.0002314349,0.000013513598,0.00012781234,0.9121697,0.00044208067,0.039403584,0.009759631,0.0012873085],"about_ca_topic_score_codex":0.00023964082,"about_ca_topic_score_gemma":0.000011560347,"teacher_disagreement_score":0.8597774,"about_ca_system_score_codex":0.00011393052,"about_ca_system_score_gemma":0.000112532674,"threshold_uncertainty_score":0.9999275},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6237005,0.0005480751,0.3516513,0.0082525965,0.0023538156,0.00038938737,0.00000338338,0.0014890012,0.011611936],"genre_scores_gemma":[0.9576303,0.00003198035,0.024511699,0.001440623,0.00086329447,0.00006811513,0.000010171566,0.000055035493,0.015388786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690735,0.00029346193,0.00047725666,0.0012192349,0.0004503047,0.0006523661],"domain_scores_gemma":[0.9979471,0.00019726082,0.00031578713,0.0011054575,0.00013510659,0.000299281],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00056590076,0.00044302482,0.0005046815,0.0002323508,0.0003434889,0.00042686574,0.0019306558,0.00028106055,0.00022021847],"category_scores_gemma":[0.0004684319,0.00044668696,0.00021575566,0.00023517138,0.000038564554,0.00021731286,0.0030162367,0.0023910385,0.0020636858],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007965855,0.00014074093,0.33510154,0.00022269132,0.00014674754,0.00023183844,0.019729385,0.015844954,0.000430581,0.0020093017,0.00870344,0.6174308],"study_design_scores_gemma":[0.0010135452,0.00042009802,0.078326605,0.0014193333,0.000048649865,0.00006327434,0.0010007753,0.4952942,0.0009910562,0.0022370706,0.41636404,0.00282134],"about_ca_topic_score_codex":0.00031286853,"about_ca_topic_score_gemma":0.000011569557,"teacher_disagreement_score":0.6146095,"about_ca_system_score_codex":0.000109584405,"about_ca_system_score_gemma":0.00007887339,"threshold_uncertainty_score":0.9999105},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061124112,0.0001283712,0.9180121,0.00028037303,0.0011211842,0.0001816046,0.00000950728,0.0007715343,0.018371256],"genre_scores_gemma":[0.9705119,0.000093299335,0.008505125,0.00014682321,0.00020701594,6.108132e-7,0.000010205387,0.000022151993,0.02050286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978661,0.00015273147,0.00017895004,0.0012531604,0.000114089446,0.0004349809],"domain_scores_gemma":[0.99804646,0.00009022222,0.0002304274,0.001338586,0.00009037318,0.00020396181],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024084956,0.0003412049,0.00033509565,0.00026643442,0.00022749168,0.0002481959,0.0025383662,0.00026123988,0.00024299185],"category_scores_gemma":[0.00004369316,0.00039079855,0.00024773955,0.00051445473,0.00006238105,0.00030873087,0.0026916056,0.0011086486,0.00058396446],"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.000020920746,0.0002766561,0.00858262,0.00025891842,0.00026696088,0.002849914,0.0014412235,0.6399543,0.000038293503,0.3125233,0.0071025146,0.026684374],"study_design_scores_gemma":[0.0003224511,0.000033982462,0.00060145376,0.00008049441,0.000025259646,0.000011135836,0.000012686454,0.97749573,0.000025015272,0.012218035,0.008681656,0.0004920716],"about_ca_topic_score_codex":0.00017605344,"about_ca_topic_score_gemma":0.0000063276552,"teacher_disagreement_score":0.9095069,"about_ca_system_score_codex":0.00011259421,"about_ca_system_score_gemma":0.00007744407,"threshold_uncertainty_score":0.9998544},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.351937,0.0003384805,0.6362852,0.005149009,0.0017016068,0.0006569985,0.0000180946,0.0009499335,0.0029636798],"genre_scores_gemma":[0.97861207,0.00012833663,0.016694589,0.0014904388,0.0007982651,0.00028829373,0.00007693078,0.000047585745,0.0018634732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975312,0.00009110397,0.00045233112,0.001007863,0.0004238437,0.0004936676],"domain_scores_gemma":[0.99810815,0.0001321392,0.00020398284,0.0011644493,0.00013201247,0.00025929374],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031736796,0.0004418844,0.00047399686,0.00025599613,0.00016076888,0.00020411596,0.001445607,0.00025131038,0.00022039986],"category_scores_gemma":[0.00016130629,0.0004356077,0.00014323751,0.0004526025,0.00003246426,0.00013722073,0.0015944722,0.0008166874,0.0010552616],"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.000029276627,0.0008170642,0.3668837,0.00047263323,0.00030203784,0.00017439466,0.007177388,0.19502634,0.00041005365,0.005664072,0.033284545,0.3897585],"study_design_scores_gemma":[0.0021791419,0.00050025544,0.22253256,0.0006179102,0.00011659123,0.00004158599,0.000061184524,0.57228994,0.006677352,0.00095752097,0.19060981,0.0034161734],"about_ca_topic_score_codex":0.00018387995,"about_ca_topic_score_gemma":0.000014494391,"teacher_disagreement_score":0.62667507,"about_ca_system_score_codex":0.00008185327,"about_ca_system_score_gemma":0.00005032153,"threshold_uncertainty_score":0.99980956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030592058,0.000055231863,0.9608918,0.00023568039,0.0012030479,0.00040187177,0.000010288016,0.0007320124,0.0058780056],"genre_scores_gemma":[0.96024656,0.0001324237,0.012291871,0.000035668407,0.00042052977,0.000005223322,0.000052208354,0.00004781696,0.026767699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971296,0.00028577272,0.0002069848,0.0016186107,0.00013701073,0.0006220222],"domain_scores_gemma":[0.9972817,0.0003125191,0.0006873617,0.0012184965,0.00027392348,0.00022604385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005665021,0.0004652201,0.0005210948,0.00028808007,0.0012666014,0.0004976204,0.0028783234,0.00040798594,0.000021130654],"category_scores_gemma":[0.00040386477,0.0005408055,0.00042273794,0.00020779713,0.00012486975,0.00052054797,0.0025988943,0.0022948422,0.00008757778],"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.00005233795,0.00008576377,0.0017993259,0.00014609548,0.000246644,0.00025210643,0.0011912168,0.8253428,0.000022412778,0.03563086,0.00023860409,0.13499184],"study_design_scores_gemma":[0.0007139374,0.00020545044,0.0006614131,0.00012108464,0.0000624008,0.0000067241676,0.00013018367,0.967662,0.00009616631,0.015608886,0.014082916,0.00064885576],"about_ca_topic_score_codex":0.00025218664,"about_ca_topic_score_gemma":0.000009441924,"teacher_disagreement_score":0.94859993,"about_ca_system_score_codex":0.00018210454,"about_ca_system_score_gemma":0.00024919232,"threshold_uncertainty_score":0.99970436},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009337236,0.00002354151,0.98797405,0.0004419762,0.00014049621,0.0007878237,0.000037861246,0.00032364845,0.0009333979],"genre_scores_gemma":[0.8336337,0.000057594014,0.16207615,0.0002578176,0.0002574025,0.000055909095,0.00016789701,0.000037812737,0.0034557206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868274,0.000045912544,0.00014246294,0.00082275993,0.000066078,0.00024006395],"domain_scores_gemma":[0.9986211,0.000074454736,0.00013031383,0.00074304186,0.00018577304,0.00024531657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022385645,0.00019163158,0.00022363306,0.00018027113,0.0001550107,0.00013532829,0.0008927334,0.00016239028,0.000002585635],"category_scores_gemma":[0.00003107924,0.00020896162,0.00006606277,0.00037560408,0.000037289145,0.00015486008,0.0012435773,0.0002211462,0.00001462112],"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.00007648129,0.00028569938,0.00097147713,0.0004141364,0.00014359107,0.000033536853,0.001312928,0.117403194,0.000013514979,0.82625496,0.00575205,0.047338415],"study_design_scores_gemma":[0.00041030475,0.000052181127,0.00008214286,0.000025138848,0.000029562738,0.0000024442265,0.000017830755,0.9215494,0.000008923599,0.06740454,0.010177169,0.00024036219],"about_ca_topic_score_codex":0.00007083319,"about_ca_topic_score_gemma":0.000021039232,"teacher_disagreement_score":0.8258979,"about_ca_system_score_codex":0.000105405066,"about_ca_system_score_gemma":0.00022129057,"threshold_uncertainty_score":0.8521207},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046912536,0.000034235054,0.92431366,0.00035123935,0.00095922936,0.00016267359,0.000007868077,0.00053919386,0.026719362],"genre_scores_gemma":[0.9839793,0.0000154842,0.008895773,0.00009286498,0.00015325252,7.117688e-7,0.000014598732,0.000016029138,0.006831992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979815,0.00025318735,0.00014038231,0.0011503736,0.00011157813,0.00036299168],"domain_scores_gemma":[0.9970024,0.00010082049,0.00035480427,0.0022839825,0.00008156635,0.0001764149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044067827,0.00031767643,0.00031127493,0.00021228773,0.0005810217,0.00044770786,0.0038775278,0.00025906926,0.000025156296],"category_scores_gemma":[0.00011376975,0.00034444442,0.00021644893,0.000095463,0.000086843145,0.0003044726,0.002135615,0.0015516125,0.00013396803],"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.000026885267,0.0002538834,0.012045298,0.0002207976,0.00014115374,0.0008389826,0.0004794843,0.54321873,0.000020410202,0.39702958,0.0025647632,0.043159995],"study_design_scores_gemma":[0.0003592756,0.000042684704,0.001766023,0.00015564941,0.000027839043,0.0000020377158,0.0000070166875,0.9702079,0.000029637258,0.022099597,0.0048606573,0.00044162673],"about_ca_topic_score_codex":0.00048291782,"about_ca_topic_score_gemma":0.000018298866,"teacher_disagreement_score":0.93706673,"about_ca_system_score_codex":0.000105634244,"about_ca_system_score_gemma":0.00029883065,"threshold_uncertainty_score":0.99990076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29979753,0.0001892932,0.692219,0.0022609548,0.0006445906,0.0007704045,0.000007755031,0.000119611985,0.0039908397],"genre_scores_gemma":[0.92254263,0.000023162489,0.07170023,0.0009166393,0.00020070987,0.0003243277,0.000015510528,0.000035363384,0.0042414144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976858,0.00025739323,0.00032841862,0.00082458154,0.00037259012,0.00053123565],"domain_scores_gemma":[0.9982867,0.00020383818,0.0001742874,0.0011888834,0.000074201416,0.00007204598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015248554,0.00029794514,0.00028352306,0.00012410282,0.00023671254,0.00043649264,0.0023351968,0.00018811226,0.000005464627],"category_scores_gemma":[0.00011434341,0.00021970981,0.00017779668,0.00021782782,0.00004533135,0.00017399166,0.0008393255,0.0013554348,0.000026958567],"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.000083134015,0.002283896,0.120708704,0.002295964,0.00014836986,0.00014530997,0.03594181,0.7738179,0.0010943516,0.019949311,0.011810037,0.03172119],"study_design_scores_gemma":[0.00038322777,0.000074769734,0.003736152,0.00009969497,0.000010321888,0.000004704204,0.000027864016,0.9777234,0.00019880375,0.013999283,0.003374914,0.00036687395],"about_ca_topic_score_codex":0.000095169715,"about_ca_topic_score_gemma":0.000014975798,"teacher_disagreement_score":0.6227451,"about_ca_system_score_codex":0.000054245385,"about_ca_system_score_gemma":0.00027507372,"threshold_uncertainty_score":0.89595056},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033216279,0.000116526215,0.99211586,0.0015705923,0.0016972633,0.000395661,0.0000029936532,0.00036963954,0.00040982157],"genre_scores_gemma":[0.069803365,0.0000033039435,0.9293717,0.0005656652,0.00018920141,0.000030081448,0.000001950945,0.000008235625,0.000026495032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954943,0.00081185595,0.0005992987,0.0016598518,0.0005843406,0.00085037254],"domain_scores_gemma":[0.9953909,0.0027811537,0.0001740226,0.0010621626,0.00035732603,0.00023443293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062506627,0.00027545766,0.0004836993,0.00017048964,0.0005144781,0.00080737704,0.0025717218,0.000095253745,0.0000070498672],"category_scores_gemma":[0.0034637498,0.0002244393,0.00012456252,0.0026056238,0.0006035753,0.00049156795,0.0016734377,0.00043924586,0.00000456791],"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.000004150894,0.00025499085,0.000482855,0.000095308744,0.0000038310063,0.00004991794,0.00032304594,0.017819393,0.00031689313,0.13933626,0.000029496041,0.84128386],"study_design_scores_gemma":[0.0003202851,0.00014357716,0.0055853585,0.00006800153,0.0000032352764,0.00005272023,0.0000048451084,0.8507817,0.00036240043,0.14134872,0.0010473226,0.00028185628],"about_ca_topic_score_codex":0.000010380317,"about_ca_topic_score_gemma":0.0000064409755,"teacher_disagreement_score":0.841002,"about_ca_system_score_codex":0.00013491564,"about_ca_system_score_gemma":0.00040083003,"threshold_uncertainty_score":0.9152369},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30162743,0.000049940634,0.6953577,0.000115254064,0.0001897035,0.000057008703,0.000001406543,0.00037923467,0.0022223573],"genre_scores_gemma":[0.98473495,0.0000074412337,0.00492517,0.000089429814,0.000043348056,3.4441993e-7,0.000004077682,0.000013582042,0.010181642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985743,0.00020051004,0.00012648196,0.00058847625,0.00012313548,0.00038709946],"domain_scores_gemma":[0.9990248,0.000102929895,0.000120988196,0.0003596832,0.00012319331,0.0002684209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044516425,0.00017632643,0.00017486424,0.0001183162,0.0002617202,0.00011745865,0.00077159324,0.00006901789,0.000006732832],"category_scores_gemma":[0.0001500283,0.00018897039,0.000059704747,0.0005656143,0.00006330527,0.00026913953,0.00038825304,0.0003670999,0.00021464602],"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.000015901971,0.00030621715,0.011289831,0.000014995978,0.00003969235,0.0002407793,0.0015067739,0.9362213,0.00027472683,0.03977853,0.0018489216,0.0084623555],"study_design_scores_gemma":[0.0010612893,0.00008720709,0.00013179837,0.000017278293,0.000008625996,0.0000057768634,0.00043492095,0.9914744,0.00016814495,0.00015848533,0.006208107,0.00024398998],"about_ca_topic_score_codex":0.00012522053,"about_ca_topic_score_gemma":0.0000033379508,"teacher_disagreement_score":0.6904325,"about_ca_system_score_codex":0.00009959583,"about_ca_system_score_gemma":0.00006083334,"threshold_uncertainty_score":0.7705988},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07629576,0.00018838623,0.8492208,0.01247693,0.0049036387,0.0011206397,0.00014583228,0.0017522199,0.05389577],"genre_scores_gemma":[0.8764171,0.000015783457,0.11665363,0.00067305693,0.00059939636,0.00008262232,0.000110395034,0.000057826204,0.0053901854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757695,0.00014748127,0.00033486306,0.00079596305,0.0005707943,0.0005739318],"domain_scores_gemma":[0.99820745,0.0003619707,0.00018907647,0.0009175515,0.00012000829,0.00020397195],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003921039,0.0003174331,0.00027987448,0.00015082603,0.000341182,0.0004534248,0.0008917601,0.000099710844,0.00009099009],"category_scores_gemma":[0.000121829966,0.00027054898,0.00013255858,0.0007816085,0.00005337748,0.00057416887,0.00026727363,0.0003975596,0.00081495027],"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.00008309192,0.0012111254,0.06523225,0.00032557384,0.0005728656,0.000386456,0.0045586457,0.054362036,0.07231454,0.5930205,0.0121998135,0.19573313],"study_design_scores_gemma":[0.001055855,0.000612201,0.029091513,0.00015004973,0.000021594598,0.00004877159,0.00005996022,0.9537192,0.0021263207,0.0030321656,0.0092726955,0.00080967357],"about_ca_topic_score_codex":0.00024573188,"about_ca_topic_score_gemma":0.000003421882,"teacher_disagreement_score":0.89935714,"about_ca_system_score_codex":0.00008012302,"about_ca_system_score_gemma":0.000101652426,"threshold_uncertainty_score":0.99997467},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11066554,0.000007923937,0.8849184,0.00070082047,0.0001116388,0.000047841462,8.5983385e-7,0.0002299308,0.0033170856],"genre_scores_gemma":[0.98069066,0.000013816546,0.0063087083,0.00018698056,0.000045764456,2.270345e-7,2.8128844e-7,0.0000085987485,0.0127449855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991537,0.000060775015,0.00006579013,0.000416548,0.000056084456,0.00024711768],"domain_scores_gemma":[0.9992654,0.00008257619,0.00005589678,0.00045318337,0.000044878576,0.000098102035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010453513,0.000123207,0.000109107124,0.00008531403,0.00013308608,0.00005458785,0.0005670641,0.00003789447,0.00004408548],"category_scores_gemma":[0.00001556748,0.000083386505,0.00004087527,0.00031345565,0.00008066406,0.00057973125,0.00027087843,0.000086770204,0.00015026727],"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.00042102372,0.00030593338,0.15082122,0.00014509313,0.00030264136,0.0019573558,0.0028860455,0.09716369,0.0013432704,0.56993526,0.0025008242,0.17221765],"study_design_scores_gemma":[0.0034618678,0.0005710262,0.010438796,0.00022673303,0.000034204673,0.00010834177,0.00016992593,0.95047903,0.00070602476,0.008315564,0.024418874,0.001069626],"about_ca_topic_score_codex":0.00006378772,"about_ca_topic_score_gemma":0.000052920026,"teacher_disagreement_score":0.87860966,"about_ca_system_score_codex":0.000042558593,"about_ca_system_score_gemma":0.000031692292,"threshold_uncertainty_score":0.3400403},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60703546,0.000051579198,0.38680488,0.00046089053,0.0006399605,0.0005802492,0.00006558356,0.00016313604,0.004198252],"genre_scores_gemma":[0.95875967,0.000001964922,0.040670805,0.00016132912,0.00008822389,0.000032590233,0.0000101482865,0.000013612135,0.000261665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871314,0.00003278346,0.0004917639,0.0001773519,0.0002939814,0.00029095387],"domain_scores_gemma":[0.998307,0.00005869672,0.00051774463,0.00076597824,0.0002673793,0.000083189385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007630776,0.00017653855,0.00023405216,0.00010824564,0.0008138688,0.0005536785,0.0007175803,0.00008704697,0.000003607568],"category_scores_gemma":[0.00053307094,0.00014335447,0.000073793715,0.000085062995,0.00014537458,0.0013297683,0.00039001444,0.00021702943,0.00001636681],"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.00010443527,0.0007085464,0.43228367,0.0024519388,0.00037446374,0.0000031430634,0.030130258,0.0011831904,0.004145803,0.037034087,0.0010070828,0.49057338],"study_design_scores_gemma":[0.0016998838,0.00025897572,0.041004784,0.00027411705,0.000032728734,0.000040102783,0.00032240764,0.9425348,0.0022308258,0.0015624574,0.009658029,0.00038090587],"about_ca_topic_score_codex":0.00014866774,"about_ca_topic_score_gemma":0.000012589548,"teacher_disagreement_score":0.9413516,"about_ca_system_score_codex":0.000022390937,"about_ca_system_score_gemma":0.000049695398,"threshold_uncertainty_score":0.62597036},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35386747,0.000005046096,0.64345056,0.000048626156,0.00016873573,0.00006789562,9.461389e-7,0.0001550543,0.002235666],"genre_scores_gemma":[0.989582,0.0000017675454,0.0048517394,0.000034001994,0.0000755376,4.3191704e-7,0.000010217307,0.0000067294786,0.0054375897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925053,0.00006850426,0.000077934026,0.00034466494,0.00006294106,0.00019541106],"domain_scores_gemma":[0.99943554,0.000049565373,0.000074044496,0.00020973395,0.00011015806,0.00012097581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034092518,0.00009046881,0.0000844879,0.00008092533,0.00019305675,0.00012531051,0.00044781156,0.00004182078,0.000010024256],"category_scores_gemma":[0.00007889289,0.00010047756,0.000054595792,0.00029783198,0.000034402237,0.0005466354,0.00017336577,0.00012927789,0.000086330474],"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.000060577597,0.00009962662,0.09102914,0.000019235562,0.000038633094,0.000054540695,0.0009301845,0.6992121,0.00033900674,0.19783977,0.000719845,0.009657386],"study_design_scores_gemma":[0.0010115869,0.00016822103,0.0012833761,0.0000063064135,0.0000072489256,0.0000045246593,0.00012990783,0.98786217,0.0007105221,0.003585824,0.005057518,0.00017278027],"about_ca_topic_score_codex":0.00006363881,"about_ca_topic_score_gemma":0.0000025086174,"teacher_disagreement_score":0.6385988,"about_ca_system_score_codex":0.00007101874,"about_ca_system_score_gemma":0.00004762602,"threshold_uncertainty_score":0.4097356},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66349036,0.00032347091,0.325763,0.007599363,0.0012843371,0.00029553781,0.0000028659458,0.000476179,0.00076491345],"genre_scores_gemma":[0.95268476,0.00004477812,0.045152634,0.00046879827,0.00073738466,0.00000778515,0.000003283852,0.000039221304,0.0008613851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717295,0.000292493,0.00036729753,0.0009018117,0.0004938022,0.00077166496],"domain_scores_gemma":[0.99829316,0.0001459088,0.00036586067,0.0007290172,0.0001495103,0.00031657133],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001420558,0.00038488396,0.00041269485,0.00025173224,0.0028171355,0.0017945573,0.001349042,0.00017021186,0.000010001973],"category_scores_gemma":[0.0004033678,0.00035451533,0.00015634403,0.00030195693,0.00007529248,0.00069132587,0.00046577293,0.0010107362,0.00003449518],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016915784,0.00022884604,0.08119022,0.00017201723,0.00035411443,0.0003165089,0.018610278,0.002201784,0.11761617,0.008997814,0.0018177958,0.76832527],"study_design_scores_gemma":[0.005354774,0.0011606396,0.25819165,0.001601553,0.00023227998,0.001949164,0.00031553244,0.5916305,0.05840475,0.009966046,0.06705708,0.004135993],"about_ca_topic_score_codex":0.00021616385,"about_ca_topic_score_gemma":0.00003598077,"teacher_disagreement_score":0.7641893,"about_ca_system_score_codex":0.000087076995,"about_ca_system_score_gemma":0.00007948404,"threshold_uncertainty_score":0.9998907},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018408446,0.00019448991,0.95297873,0.0059617814,0.00021557247,0.000312402,0.000014160749,0.00039455513,0.02151985],"genre_scores_gemma":[0.46467212,0.000044322867,0.5178433,0.00019094461,0.0000690054,0.000067923254,0.00003430345,0.000034568537,0.017043496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970021,0.0010837362,0.00029741952,0.0006907906,0.0004470739,0.00047887623],"domain_scores_gemma":[0.9957624,0.0006604655,0.00024895204,0.0015042215,0.0016411854,0.00018276808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00326434,0.00023041954,0.00023100521,0.00013280423,0.000753207,0.00065268367,0.0014350826,0.000083376115,0.000051030005],"category_scores_gemma":[0.00044150543,0.00020188396,0.00008196535,0.0005681333,0.00024390737,0.00045170233,0.00036485383,0.00023111083,0.000043182983],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039479248,0.00072348287,0.0037223895,0.00008969082,0.00011507112,0.000009757964,0.019414047,0.00007498939,0.0018239771,0.38037676,0.0025422275,0.59106815],"study_design_scores_gemma":[0.0034327437,0.000022903863,0.004712541,0.0010285786,0.000046640853,0.00007509338,0.00039338673,0.5762724,0.12035507,0.0102344705,0.28208682,0.0013393118],"about_ca_topic_score_codex":0.00051221374,"about_ca_topic_score_gemma":0.00096978695,"teacher_disagreement_score":0.58972883,"about_ca_system_score_codex":0.000072096555,"about_ca_system_score_gemma":0.00022606118,"threshold_uncertainty_score":0.8232589},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29765382,0.000009696924,0.33538213,0.0009774171,0.0001240796,0.00007750082,2.307931e-7,0.00044361147,0.3653315],"genre_scores_gemma":[0.8198222,7.172728e-7,0.167182,0.0002980148,0.0001936396,0.0000030936965,0.0000010291031,0.000008059006,0.01249126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993801,0.000030907384,0.00007790074,0.00020658283,0.00012245493,0.00018205387],"domain_scores_gemma":[0.999655,0.000034933615,0.000023437406,0.00022151058,0.000022116797,0.000042996166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017389654,0.000066504464,0.0000769883,0.000063036656,0.00005525667,0.00006601345,0.00031923616,0.000021415743,0.000090151516],"category_scores_gemma":[0.000008831318,0.000046313493,0.000009340433,0.0002512513,0.00003057942,0.00016670694,0.00008603731,0.00009208089,0.000354893],"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.00013651588,0.00046288848,0.29884067,0.00004101606,0.00007903266,0.00090413203,0.026701331,0.004261522,0.006949951,0.1092713,0.026871823,0.5254798],"study_design_scores_gemma":[0.00068810297,0.00072741427,0.05726085,0.00007094321,0.000001724184,0.00006888049,0.000039251354,0.92987365,0.0011315882,0.0008862394,0.008915935,0.00033545346],"about_ca_topic_score_codex":0.00021828873,"about_ca_topic_score_gemma":0.0000102825325,"teacher_disagreement_score":0.9256121,"about_ca_system_score_codex":0.000010076666,"about_ca_system_score_gemma":0.00002608359,"threshold_uncertainty_score":0.456155},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02421663,0.000021319009,0.9625616,0.00027913452,0.00018909975,0.000023205885,1.9602267e-7,0.00014213758,0.012566669],"genre_scores_gemma":[0.8710631,7.223839e-7,0.1277394,0.00009067168,0.00009631958,6.949897e-7,4.0232317e-7,0.0000028520815,0.0010057889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993987,0.00004620277,0.00010328991,0.00016211177,0.00015370778,0.0001359682],"domain_scores_gemma":[0.9995308,0.00010792135,0.000048213355,0.00020845057,0.00006619133,0.00003843065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020751054,0.000055276116,0.00007643969,0.00005491267,0.00008690453,0.000032197764,0.00035736227,0.000020319645,0.00011685623],"category_scores_gemma":[0.00015008257,0.000041789004,0.00003254865,0.00020207127,0.000049320046,0.0000354836,0.00013909127,0.000094233495,0.000060024322],"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.000004116281,0.00008994569,0.0034861548,0.000013999267,0.000016214797,0.000002411495,0.0021724075,0.004698121,0.0039039857,0.70977455,0.001298544,0.27453956],"study_design_scores_gemma":[0.00008708361,0.0001453749,0.0016882888,0.0000064324463,0.0000010205501,0.000003151563,0.000014932735,0.97622496,0.010276432,0.0005183294,0.010966633,0.00006736376],"about_ca_topic_score_codex":0.00015477676,"about_ca_topic_score_gemma":5.364898e-7,"teacher_disagreement_score":0.97152686,"about_ca_system_score_codex":0.000004055555,"about_ca_system_score_gemma":0.000016212793,"threshold_uncertainty_score":0.17041062},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20329499,0.000012224669,0.7953824,0.00022518284,0.00026353082,0.00020083746,0.00000311263,0.00023804986,0.00037970595],"genre_scores_gemma":[0.551972,3.0351003e-7,0.44612724,0.0009262992,0.00006853483,0.000038620896,0.000004377,0.000016858505,0.00084582664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983438,0.00006557231,0.00027984317,0.0005733939,0.0002343499,0.00050298846],"domain_scores_gemma":[0.9988926,0.0003489534,0.00009961436,0.00045858324,0.000092478695,0.000107787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050381105,0.00017668631,0.00021485059,0.00013803056,0.00030107374,0.00016745838,0.0005706486,0.000045904937,0.000117336196],"category_scores_gemma":[0.0002337955,0.00015048769,0.000049698327,0.00033580902,0.000058863116,0.00020614736,0.00021399686,0.000121644276,0.000036071036],"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.0009307055,0.0010178539,0.16652271,0.00026466226,0.00017682613,0.0006872509,0.25099903,0.012127336,0.13775072,0.2707618,0.009100446,0.14966068],"study_design_scores_gemma":[0.0035045058,0.0009275228,0.0020071438,0.00012358422,0.0000063495586,0.000046894897,0.0009800498,0.8449908,0.1164356,0.018262103,0.011820612,0.0008948556],"about_ca_topic_score_codex":0.00023844489,"about_ca_topic_score_gemma":0.000105405765,"teacher_disagreement_score":0.83286345,"about_ca_system_score_codex":0.00008193509,"about_ca_system_score_gemma":0.00006481354,"threshold_uncertainty_score":0.61367095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004254878,0.00006159892,0.991332,0.0013604293,0.00033014666,0.0009681677,0.0000017683618,0.0005255388,0.0011654518],"genre_scores_gemma":[0.1106015,0.00000759842,0.87234044,0.00047969125,0.00012970115,0.00044084582,0.000011153259,0.000023548326,0.015965499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820614,0.0002310542,0.00031399945,0.00046747722,0.00023798374,0.0005433403],"domain_scores_gemma":[0.99863094,0.00060478825,0.000115604795,0.0003276627,0.0001515558,0.00016946682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010029363,0.00019752681,0.0004151641,0.00009040676,0.00030233728,0.00030615772,0.0005593713,0.00007069923,0.00019467619],"category_scores_gemma":[0.0002982308,0.00014754168,0.00025654671,0.00017948997,0.000031875315,0.00035309637,0.00021584271,0.0002432571,0.0003941283],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037510498,0.00043888658,0.0014300935,0.00004974384,0.000113545255,0.0000051253674,0.0026767196,0.00019445122,0.0004531991,0.0041793115,0.0050804988,0.9850033],"study_design_scores_gemma":[0.067750216,0.00004796785,0.00023492896,0.00001278065,0.0000074590293,0.0000058937685,0.00007519279,0.9201815,0.00033080904,0.0005690786,0.010572535,0.00021163932],"about_ca_topic_score_codex":0.00056496466,"about_ca_topic_score_gemma":0.000011720777,"teacher_disagreement_score":0.9847917,"about_ca_system_score_codex":0.00002290903,"about_ca_system_score_gemma":0.000030557265,"threshold_uncertainty_score":0.6016575},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27924412,0.000059788308,0.70573336,0.00020009374,0.00021851846,0.00005818382,8.135092e-7,0.0003085693,0.014176568],"genre_scores_gemma":[0.9901696,0.00003467243,0.0020455853,0.000040951374,0.000022223143,9.710601e-8,8.8534705e-7,0.0000072440976,0.007678749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906224,0.00012221452,0.00011512212,0.00038802592,0.00007441865,0.00023795597],"domain_scores_gemma":[0.99925727,0.00009550188,0.00012228586,0.00035975326,0.00006438749,0.000100824785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013850587,0.00011872361,0.00015383583,0.00015784107,0.00015293756,0.000032765114,0.00066658447,0.000064123495,0.00011200371],"category_scores_gemma":[0.000059989612,0.00012758987,0.000096148906,0.0007604073,0.00008085258,0.00030399964,0.00016709731,0.00027294474,0.00013404414],"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.000026817432,0.0003540498,0.053007092,0.000072356874,0.00016131137,0.00047820172,0.0025299028,0.2113894,0.0012245226,0.66482455,0.0017642704,0.06416756],"study_design_scores_gemma":[0.00037139578,0.00011654095,0.0012484671,0.000016011838,0.000010092206,0.000004960117,0.0000854605,0.9928918,0.00031268608,0.0011232484,0.0036519088,0.00016744998],"about_ca_topic_score_codex":0.00006397952,"about_ca_topic_score_gemma":0.0000027596714,"teacher_disagreement_score":0.78150237,"about_ca_system_score_codex":0.000029754954,"about_ca_system_score_gemma":0.000013719047,"threshold_uncertainty_score":0.5202964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0837506,0.000006485173,0.9087619,0.0036279242,0.00039736787,0.0008601114,0.00003057668,0.0000687273,0.0024963187],"genre_scores_gemma":[0.9642988,0.0000033714355,0.03521958,0.0000822773,0.00005461204,0.00004487507,0.0000073116335,0.0000087311655,0.0002804337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983319,0.000016508387,0.00043697548,0.0004070351,0.00055709813,0.00025045825],"domain_scores_gemma":[0.9978919,0.00023938734,0.0006310204,0.0002160461,0.0009676555,0.000053963187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004424577,0.00018737385,0.00024792668,0.00012744997,0.00012655433,0.00014015684,0.0011503265,0.00006537069,0.00011200912],"category_scores_gemma":[0.00023505816,0.00013406525,0.00009662032,0.00037473367,0.00014930162,0.00052651536,0.00014324648,0.0002109609,0.00004405112],"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.00010529452,0.00010701652,0.00087011396,0.00009908839,0.000024298022,6.341569e-8,0.0005397278,0.0023730004,0.010786529,0.97853065,0.000049836286,0.0065143974],"study_design_scores_gemma":[0.00011284879,0.0004629932,0.0008914975,0.00019929252,0.0000142356885,0.0000022410381,0.00018582476,0.6696907,0.114035904,0.21407488,0.00012784358,0.00020172728],"about_ca_topic_score_codex":0.000021371205,"about_ca_topic_score_gemma":0.000001693586,"teacher_disagreement_score":0.8805482,"about_ca_system_score_codex":0.00003249876,"about_ca_system_score_gemma":0.00018475633,"threshold_uncertainty_score":0.54670227},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12860405,0.0000054864345,0.84717345,0.0025939152,0.0015157696,0.00064312684,0.00001578074,0.00041999828,0.019028446],"genre_scores_gemma":[0.94212586,0.000008361312,0.045689028,0.00013511581,0.00025598955,0.00007336694,0.0002233366,0.000023960642,0.011464956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758536,0.00018282532,0.00047821816,0.00069928187,0.0007005974,0.00035372307],"domain_scores_gemma":[0.99785703,0.0005879533,0.00043058398,0.000352106,0.0006646382,0.00010767175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005146963,0.00023220613,0.00022801544,0.00031403577,0.00040614602,0.00059674005,0.0008635344,0.000098469885,0.00078583445],"category_scores_gemma":[0.001162338,0.00023931114,0.00015113525,0.00030268737,0.00005097192,0.0007894666,0.00019112276,0.0006246603,0.00017282789],"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.00004203055,0.00003557541,0.03720502,0.000015223648,0.00010463901,0.0000044421427,0.0013951028,0.45228675,0.0066869087,0.49769986,0.00008048894,0.004443946],"study_design_scores_gemma":[0.0007411995,0.00021050066,0.002629823,0.00005904821,0.000009633781,0.000013217544,0.0003013427,0.98855424,0.00030038596,0.004696483,0.0021957431,0.000288358],"about_ca_topic_score_codex":0.00014221415,"about_ca_topic_score_gemma":0.000004567565,"teacher_disagreement_score":0.81352186,"about_ca_system_score_codex":0.00013488717,"about_ca_system_score_gemma":0.00036715143,"threshold_uncertainty_score":0.97588253},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029406596,0.000016096468,0.9569759,0.0010317728,0.00031126387,0.0003591761,0.0000038682856,0.00028809594,0.011607245],"genre_scores_gemma":[0.9804278,0.000009209723,0.0112610385,0.0005392576,0.0002647439,0.0000022755169,0.0000019338802,0.000017199362,0.007476566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851495,0.00017206483,0.00013709725,0.0006274751,0.000097305616,0.00045113318],"domain_scores_gemma":[0.9982354,0.000517031,0.00012401195,0.000816962,0.00017513068,0.00013146702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054407486,0.00019860675,0.00017198041,0.00008150704,0.00064696145,0.00012935752,0.0016521256,0.00007959381,0.00004956032],"category_scores_gemma":[0.00009235264,0.00015340875,0.00014997208,0.0007378599,0.0002975086,0.00034665852,0.0004152162,0.00024984338,0.0001469929],"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.000094181865,0.00012844762,0.0020343224,0.00003147824,0.000095097814,0.00005458527,0.0018941917,0.0043707984,0.00021891767,0.95889676,0.0032645168,0.028916713],"study_design_scores_gemma":[0.00090663624,0.00042705375,0.0011043284,0.000021821681,0.000029839935,0.000018924069,0.00009053016,0.84777725,0.00036987965,0.11874679,0.030168407,0.00033856812],"about_ca_topic_score_codex":0.00006877682,"about_ca_topic_score_gemma":0.000054930635,"teacher_disagreement_score":0.9510212,"about_ca_system_score_codex":0.00005096311,"about_ca_system_score_gemma":0.00008657727,"threshold_uncertainty_score":0.62558275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099112496,0.00015327608,0.897161,0.00024607775,0.0008069619,0.00026223538,0.000008893912,0.000504028,0.0017450164],"genre_scores_gemma":[0.98587906,0.00017490618,0.0036155668,0.00019780296,0.00020615432,0.0000016342169,0.00007801583,0.00003487598,0.009812009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757725,0.0003069307,0.0002301971,0.0013259829,0.0001377511,0.0004218837],"domain_scores_gemma":[0.9980214,0.00009463186,0.00036595625,0.0010951019,0.0002681478,0.00015473992],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032183793,0.00041700856,0.0003867109,0.00029386734,0.00021305242,0.00035398037,0.0017539657,0.0003550482,0.00006258376],"category_scores_gemma":[0.00007157778,0.00044485263,0.00015442936,0.00098712,0.00007733299,0.00050277886,0.0013085415,0.0007056581,0.00019780392],"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.000020039619,0.00012129458,0.012952677,0.00044641775,0.00014280548,0.00013348395,0.00074921985,0.9577251,0.00006356375,0.024622625,0.0005591728,0.0024636202],"study_design_scores_gemma":[0.0003914105,0.00005750093,0.0018518785,0.000103003775,0.000051030165,0.0000046919145,0.000019275109,0.97688365,0.00016647202,0.018162044,0.0017221316,0.0005869076],"about_ca_topic_score_codex":0.00028785286,"about_ca_topic_score_gemma":0.00003116402,"teacher_disagreement_score":0.89354545,"about_ca_system_score_codex":0.00012647793,"about_ca_system_score_gemma":0.00035322664,"threshold_uncertainty_score":0.9998003},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017561987,0.00025515835,0.97774494,0.0017103375,0.00072480313,0.0004663596,0.0000041313947,0.00095113786,0.00058113405],"genre_scores_gemma":[0.80120814,0.000021423295,0.19711572,0.00089693745,0.00023003887,0.000088690875,0.00003333967,0.000036302994,0.00036941384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785924,0.00017878758,0.0003006783,0.00056158775,0.0004708551,0.0006288499],"domain_scores_gemma":[0.99848115,0.00011984928,0.00021158991,0.00080915116,0.0001421502,0.00023613195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045459945,0.0003020817,0.00029482317,0.0002747965,0.00024302055,0.00034377328,0.0008635241,0.00019114043,0.000051021452],"category_scores_gemma":[0.000038591614,0.0002676469,0.00011356807,0.00078992336,0.000063461164,0.00065562216,0.00023458236,0.0005636081,0.000015480684],"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.00004614939,0.00009678305,0.029244944,0.000008150621,0.000025513697,0.000020547552,0.000048478512,0.8825804,0.000043394306,0.083155364,0.00040571886,0.004324568],"study_design_scores_gemma":[0.00090344355,0.0003177047,0.010519969,0.00002301054,0.000009397924,0.00010944731,0.000008225203,0.9862944,0.00007693226,0.0010084378,0.00037896115,0.00035009484],"about_ca_topic_score_codex":0.001460615,"about_ca_topic_score_gemma":0.000045480545,"teacher_disagreement_score":0.78364617,"about_ca_system_score_codex":0.00014880927,"about_ca_system_score_gemma":0.00013301986,"threshold_uncertainty_score":0.9999776},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096141145,0.000047342215,0.891601,0.00090432056,0.0024522976,0.003997268,0.00045448754,0.0009554405,0.00344666],"genre_scores_gemma":[0.8022777,0.0000060422476,0.19508892,0.0008148628,0.00029892108,0.00022258241,0.00046265707,0.000067542125,0.00076078495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639064,0.0000689635,0.0012533912,0.00060621905,0.00060708856,0.0010737219],"domain_scores_gemma":[0.9967661,0.0006578408,0.00063738774,0.0012935104,0.00040288153,0.00024227658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013183063,0.00052075105,0.00067752606,0.00020872336,0.00054169446,0.00086874247,0.0019961577,0.00020896907,0.000018221228],"category_scores_gemma":[0.00048157742,0.00044782853,0.00033677238,0.0004396103,0.00012911743,0.0013472422,0.000620668,0.0005103045,0.00013547404],"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.0005119619,0.0028843114,0.035990275,0.021154143,0.00079283875,0.000016388673,0.032210175,0.031035481,0.00009616494,0.5479634,0.017412405,0.3099325],"study_design_scores_gemma":[0.0025145756,0.00045935842,0.0009783888,0.00023736978,0.000028608407,0.00003139126,0.00019762182,0.9220527,0.00004263471,0.0065279244,0.06630583,0.0006236101],"about_ca_topic_score_codex":0.000018138671,"about_ca_topic_score_gemma":0.000012440722,"teacher_disagreement_score":0.8910172,"about_ca_system_score_codex":0.00016193186,"about_ca_system_score_gemma":0.00016465843,"threshold_uncertainty_score":0.99979734},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04045706,0.000028705448,0.956948,0.00046927654,0.0004376601,0.0010995744,0.0000031549669,0.0000675313,0.00048907084],"genre_scores_gemma":[0.9117348,0.0000018384629,0.08752432,0.0004413443,0.00012691079,0.000019727187,0.0000029614123,0.000028147877,0.000119916454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958958,0.00006983366,0.0006142227,0.0017085832,0.0011811719,0.00053035584],"domain_scores_gemma":[0.997487,0.00024735116,0.0002574687,0.0017530299,0.0000775102,0.000177636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091342843,0.00055947027,0.0007489184,0.0012464119,0.00008222731,0.00022793587,0.0030115868,0.00016232983,0.000004751412],"category_scores_gemma":[0.000043991862,0.0004372958,0.00008195559,0.000507182,0.00010610578,0.00025076658,0.0015448282,0.0009570748,0.000011429944],"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.000022641767,0.0004406754,0.00046336043,0.000021842692,0.0000066569087,0.000018188104,0.0035113099,0.83926725,0.000013965251,0.0032847507,0.0000010110186,0.15294835],"study_design_scores_gemma":[0.0006484066,0.00347915,0.0006956764,0.0003017531,0.0000046250043,0.000004964207,0.0000015722254,0.9827064,0.00011360225,0.011579575,0.0000047970375,0.00045947538],"about_ca_topic_score_codex":0.000047747104,"about_ca_topic_score_gemma":0.00071280694,"teacher_disagreement_score":0.8712778,"about_ca_system_score_codex":0.00023448783,"about_ca_system_score_gemma":0.00025491344,"threshold_uncertainty_score":0.9998079},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004458352,0.00005226206,0.3830588,0.00004910835,0.00015432439,0.000052872987,0.0000013429541,0.00007075747,0.6165561],"genre_scores_gemma":[0.0016469109,0.000010139605,0.054788988,0.000118457276,0.000059240607,4.035588e-7,0.000025514604,0.000017455284,0.9433329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889815,0.000039058225,0.00027674713,0.00029798356,0.00036518506,0.00012290095],"domain_scores_gemma":[0.9991431,0.0001990746,0.00027187337,0.00026192018,0.00008761791,0.000036396847],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003668745,0.00016521047,0.00023547474,0.00012651856,0.000041431864,0.000034145716,0.00052553584,0.00009478532,0.000952647],"category_scores_gemma":[0.000017618007,0.00014469023,0.000106529085,0.000022517444,0.000029706838,0.00007203729,0.00025886166,0.00038862284,0.0006071573],"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.0000013630565,0.0000052801247,0.00004727413,0.000020315387,0.000038706006,0.0000021215749,0.000053465945,0.005472932,7.8555297e-7,0.9092967,0.00044791328,0.08461313],"study_design_scores_gemma":[0.0003725589,0.00021249769,0.00014925071,0.00014441785,0.000016538304,0.000011108536,0.000005812597,0.2426455,0.000008538445,0.40809247,0.34791705,0.00042425073],"about_ca_topic_score_codex":0.0000035713656,"about_ca_topic_score_gemma":2.3079555e-7,"teacher_disagreement_score":0.50120425,"about_ca_system_score_codex":0.000014565949,"about_ca_system_score_gemma":0.00009309614,"threshold_uncertainty_score":0.9999606},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001387642,0.00017041074,0.9880959,0.0004975289,0.0024424044,0.00048583891,0.0000056016806,0.0002925838,0.0066221366],"genre_scores_gemma":[0.27466783,0.0000058467685,0.7208119,0.00164026,0.0013777702,0.000011685866,0.00002986251,0.00005818785,0.0013966676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99502736,0.00008424339,0.00056580704,0.0023688835,0.0011799656,0.0007737226],"domain_scores_gemma":[0.99728423,0.0004557429,0.00052150944,0.0013183657,0.00019136784,0.0002287743],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009634191,0.0006422301,0.0006447706,0.0008120842,0.0003747909,0.0010971397,0.0031998828,0.0003849175,0.000024546085],"category_scores_gemma":[0.00025800994,0.000597131,0.00015545571,0.0006539727,0.00020749548,0.0006464446,0.0019188601,0.0017975705,0.00022815698],"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.0000059562385,0.000020660476,0.00035294992,0.000026608099,0.000011305146,0.000021622689,0.0018818165,0.16681716,0.0006534049,0.0025644873,0.000009082423,0.82763493],"study_design_scores_gemma":[0.000294079,0.00045273305,0.00074301375,0.00025526388,0.00000868407,0.000017111723,8.12325e-7,0.98755807,0.0004857066,0.0065923207,0.0027471632,0.0008450276],"about_ca_topic_score_codex":0.00017032042,"about_ca_topic_score_gemma":0.000023642058,"teacher_disagreement_score":0.8267899,"about_ca_system_score_codex":0.00028046806,"about_ca_system_score_gemma":0.00049473817,"threshold_uncertainty_score":0.9999398},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020261962,0.00055420655,0.9836812,0.0008969511,0.0013581128,0.00025281447,0.0000019856316,0.00038057723,0.012671506],"genre_scores_gemma":[0.14341761,0.00016107567,0.84378624,0.0017578347,0.00058650755,0.00000709385,0.000015935417,0.00010925539,0.010158459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961637,0.00012207775,0.0005543464,0.0014383058,0.0009579899,0.00076356344],"domain_scores_gemma":[0.99627346,0.0008970214,0.00045981182,0.0020139033,0.0001956833,0.0001601087],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015187388,0.00058643275,0.0006226377,0.0007201029,0.00049156736,0.00083123863,0.005438247,0.00021665482,0.0000302135],"category_scores_gemma":[0.00019295509,0.0005230224,0.00015403655,0.00054873474,0.00043352644,0.0005422906,0.003228846,0.0026224602,0.00020740923],"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.0000016218335,0.000010561734,0.00035972716,0.000031944248,0.000008039665,0.000029880895,0.0009759782,0.15550238,0.000039868286,0.0040596058,0.000006140985,0.83897424],"study_design_scores_gemma":[0.00020686365,0.00018909472,0.00017533256,0.0003787339,0.0000037901684,0.000060844362,1.3667311e-7,0.9575779,0.00009308962,0.035960376,0.0047047897,0.00064908486],"about_ca_topic_score_codex":0.00009428559,"about_ca_topic_score_gemma":0.000041266678,"teacher_disagreement_score":0.83832514,"about_ca_system_score_codex":0.00017402705,"about_ca_system_score_gemma":0.00046823663,"threshold_uncertainty_score":0.9999428},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6960852,0.00004698082,0.27675104,0.00006507237,0.00013428002,0.00009048454,6.324721e-7,0.0001784285,0.026647877],"genre_scores_gemma":[0.8524029,0.0000014326248,0.1430547,0.000023475503,0.000011213603,8.0164176e-7,2.1541483e-7,0.000004454025,0.004500752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993865,0.00005034136,0.000121873076,0.00020234876,0.00011087922,0.00012804524],"domain_scores_gemma":[0.9994332,0.00028439757,0.0000805105,0.00011990859,0.00004312656,0.000038816415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018115315,0.00007698876,0.0001237424,0.000053200944,0.00004632784,0.00004204022,0.00016800914,0.000014442021,0.000019935402],"category_scores_gemma":[0.00008326407,0.00006101811,0.000015956572,0.00014978014,0.000021362459,0.00011563962,0.00017303712,0.00013862718,0.000025694975],"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.000004597652,0.00001828612,0.1470682,0.000042241994,0.000011490196,0.000008843731,0.0007780959,0.00190751,0.0019279388,0.0038690162,0.000008451137,0.84435534],"study_design_scores_gemma":[0.00015628232,0.0003531457,0.010615017,0.000024028517,0.0000015976404,0.000016488091,0.000026417263,0.9875124,0.00023173036,0.0007699623,0.00020056832,0.00009233185],"about_ca_topic_score_codex":0.000104151106,"about_ca_topic_score_gemma":0.0000014952215,"teacher_disagreement_score":0.98560494,"about_ca_system_score_codex":0.0000032945397,"about_ca_system_score_gemma":0.000018692788,"threshold_uncertainty_score":0.24882463},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006399255,0.00079555897,0.9875501,0.001609956,0.0024133336,0.000050727696,0.0000012683346,0.00006128582,0.0011185372],"genre_scores_gemma":[0.23095529,0.0004174948,0.76772666,0.00017032905,0.00055548374,9.950184e-7,0.000014198653,0.000011399544,0.00014817018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982092,0.00026818356,0.0005447339,0.0002699842,0.0005215167,0.00018643207],"domain_scores_gemma":[0.9977351,0.0000407558,0.00096868566,0.0002972459,0.0008175356,0.00014070667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049499964,0.0001868291,0.00036776526,0.000082528015,0.00012664638,0.00055464084,0.0007404701,0.00018780517,0.000035179757],"category_scores_gemma":[0.00047189047,0.00017016537,0.0002524958,0.00037445777,0.000018221312,0.0003597934,0.00074689306,0.0011001442,0.0000033204637],"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.0000039254596,0.0000452363,0.0008147179,0.000014033948,0.000040936364,0.00010988267,0.000104264844,0.9830193,0.000004241201,0.00037650674,0.00032905804,0.01513788],"study_design_scores_gemma":[0.00024470635,0.00012040704,0.001570577,0.00025132668,0.000033760614,0.0004004757,0.000046239562,0.9962159,0.000006153674,0.0003234579,0.00061357033,0.00017342527],"about_ca_topic_score_codex":0.000020313371,"about_ca_topic_score_gemma":0.0000012571714,"teacher_disagreement_score":0.22455603,"about_ca_system_score_codex":0.00017464833,"about_ca_system_score_gemma":0.00047451336,"threshold_uncertainty_score":0.69391423},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011892917,0.000026190071,0.98965454,0.0013893353,0.0013615185,0.0002720215,0.000014195271,0.0003396988,0.005753232],"genre_scores_gemma":[0.36201602,0.000013483737,0.62342435,0.00041176763,0.00032014528,0.00035987177,0.0005939781,0.000018598736,0.012841813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904,0.000062641695,0.00016373032,0.0004085065,0.00019599113,0.0001291221],"domain_scores_gemma":[0.99920833,0.000115655486,0.00013071917,0.00045370767,0.000060113758,0.000031452066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003143357,0.00011239367,0.00012842573,0.00008701814,0.00015862678,0.00019523069,0.0007470513,0.000059771075,0.0001467314],"category_scores_gemma":[0.00004959936,0.00010931252,0.000098581215,0.00008837971,0.0000075317653,0.00008775812,0.0013424802,0.0003586954,0.000014922256],"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.0000074032414,0.00014621098,0.00902565,0.00029729374,0.000056760593,0.0000031862617,0.00058883784,0.10185454,0.00009349922,0.5057458,0.0066034067,0.37557736],"study_design_scores_gemma":[0.00011293419,0.000042056847,0.008129652,0.0000123855425,0.00000410715,7.4869143e-7,0.000005984276,0.9517393,0.000008794044,0.023569074,0.01621642,0.00015854347],"about_ca_topic_score_codex":0.00005555196,"about_ca_topic_score_gemma":0.0000027687458,"teacher_disagreement_score":0.84988475,"about_ca_system_score_codex":0.000039167422,"about_ca_system_score_gemma":0.000066971734,"threshold_uncertainty_score":0.4457635},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0953579,0.000023066688,0.88518065,0.0007913825,0.000798047,0.00009545035,8.475684e-7,0.00033816692,0.017414473],"genre_scores_gemma":[0.89912033,7.363978e-7,0.09976875,0.00080041366,0.0001964082,0.0000017173824,7.9977923e-7,0.0000080583295,0.000102785794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977925,0.00009605156,0.00019582403,0.00071117724,0.00061654655,0.00058794755],"domain_scores_gemma":[0.9985165,0.0002909755,0.00006372092,0.00082139723,0.00010819317,0.0001992037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111333,0.00016733947,0.00018631101,0.00013956647,0.0003022932,0.00071568694,0.0022576898,0.00003656933,0.00015836205],"category_scores_gemma":[0.00012807205,0.00013348446,0.00005684122,0.000806238,0.00062087114,0.00044966998,0.0010360726,0.00027999072,0.0006484921],"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.0000012825471,0.000031243235,0.0026917644,0.000010617285,0.000002346359,0.000021393522,0.00044374308,0.00032572253,0.00026010565,0.7101457,0.000039711547,0.28602636],"study_design_scores_gemma":[0.00018687863,0.00015645608,0.005166565,0.000048064685,0.0000017690512,0.00004422064,0.000008803341,0.9767786,0.00087411003,0.015857093,0.0006176571,0.00025977305],"about_ca_topic_score_codex":0.000018926996,"about_ca_topic_score_gemma":3.028308e-7,"teacher_disagreement_score":0.9764529,"about_ca_system_score_codex":0.000030573246,"about_ca_system_score_gemma":0.00006835267,"threshold_uncertainty_score":0.83352697},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.564136,0.00002254224,0.40076742,0.0007048806,0.00029880842,0.00019554203,1.7681823e-7,0.0006377929,0.033236828],"genre_scores_gemma":[0.91585594,0.0000014699785,0.06850869,0.00017282068,0.000056388108,0.000006330319,0.000005519653,0.000016563488,0.015376273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986984,0.00012267599,0.00014360293,0.0004433862,0.0003297584,0.00026217403],"domain_scores_gemma":[0.9992057,0.0001528661,0.00013966506,0.00032281122,0.00009843275,0.00008052982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022727338,0.0001616258,0.00016674402,0.00011970379,0.00012417528,0.00017317783,0.00038845962,0.000053512136,0.00009214848],"category_scores_gemma":[0.00005598351,0.00012117593,0.00004056126,0.0004117944,0.000023131774,0.0006187073,0.00012745181,0.00044561294,0.00042157626],"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.00008297654,0.000070023205,0.02867849,0.000039458097,0.00007498563,0.000037262915,0.011826751,0.07163978,0.006775368,0.01592015,0.00031092088,0.86454386],"study_design_scores_gemma":[0.001349396,0.0007143798,0.02472732,0.000076938624,0.000009889948,0.000030765976,0.00045571264,0.9577521,0.0031224482,0.0006104472,0.010647482,0.0005031003],"about_ca_topic_score_codex":0.0003371041,"about_ca_topic_score_gemma":0.000018973731,"teacher_disagreement_score":0.88611233,"about_ca_system_score_codex":0.000047540423,"about_ca_system_score_gemma":0.00005464531,"threshold_uncertainty_score":0.54186505},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59937805,0.00012143867,0.32527453,0.063808285,0.00036203445,0.0012798291,0.000012386027,0.0005745835,0.00918886],"genre_scores_gemma":[0.9789645,0.000010937305,0.019870466,0.0009012374,0.00007143112,0.000028316164,6.8788455e-7,0.000013995098,0.0001384266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826586,0.000022314412,0.0004116957,0.00053969125,0.0004524514,0.00030801096],"domain_scores_gemma":[0.9988306,0.00012398686,0.00036171242,0.00018283117,0.00035388177,0.0001469805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000324908,0.000227324,0.00026833644,0.000060550126,0.00026563028,0.00034518502,0.0012914609,0.00006473522,0.000015808726],"category_scores_gemma":[0.0003728126,0.00015658578,0.00005210431,0.0005069307,0.00018870733,0.00043241004,0.00035308112,0.00043194505,0.00002472065],"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.00011916818,0.00013623145,0.008282047,0.00020628772,0.000049992985,0.0000052026658,0.024028707,0.002712151,0.029287506,0.8788712,0.00049868436,0.055802815],"study_design_scores_gemma":[0.00011297718,0.0011940452,0.0031637955,0.0008125676,0.000028782582,0.000020091898,0.0011203693,0.7949023,0.08577616,0.11149394,0.0008011711,0.0005737561],"about_ca_topic_score_codex":0.000058631977,"about_ca_topic_score_gemma":0.0000024079468,"teacher_disagreement_score":0.7921902,"about_ca_system_score_codex":0.000017100996,"about_ca_system_score_gemma":0.000092862676,"threshold_uncertainty_score":0.6385383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63870835,0.000004619672,0.36068767,0.000047439113,0.00004158672,0.00005422253,0.000007812956,0.000055903096,0.0003923823],"genre_scores_gemma":[0.9926839,0.0000021446067,0.006952999,0.000011211018,0.000010841448,1.8118313e-7,0.000010529845,0.000003230047,0.0003249602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993946,0.000052866657,0.00008383757,0.00027423858,0.00005660914,0.00013787091],"domain_scores_gemma":[0.99923486,0.00025120698,0.00009640191,0.00023426373,0.00011551187,0.00006773193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012010427,0.000081546954,0.0001235993,0.00008680435,0.00021801994,0.000026060272,0.00017720387,0.00003126549,0.000014605633],"category_scores_gemma":[0.00004347956,0.000076164644,0.0000248962,0.00067708537,0.00007518946,0.00031193305,0.00011197678,0.00014126256,0.000011601338],"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.000057415113,0.00009710094,0.28609595,0.000023940878,0.000056308632,0.00006220581,0.000066481145,0.25635123,0.00028699348,0.45583862,0.00004443627,0.0010193302],"study_design_scores_gemma":[0.0021770084,0.00022196354,0.14245223,0.000055320703,0.000030733972,0.000042396085,0.000030637333,0.848246,0.00020592881,0.006302136,0.000050292605,0.00018536067],"about_ca_topic_score_codex":0.00040042825,"about_ca_topic_score_gemma":0.000012009472,"teacher_disagreement_score":0.59189475,"about_ca_system_score_codex":0.000024819397,"about_ca_system_score_gemma":0.000060900864,"threshold_uncertainty_score":0.3105904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009419992,0.000028998844,0.98671424,0.00045045445,0.0008642257,0.00010793626,0.000002455001,0.00021338067,0.0021982952],"genre_scores_gemma":[0.90956855,0.000008378137,0.08953622,0.00015819038,0.000016563856,0.000009081158,0.0000020637774,0.000005601626,0.0006953586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990079,0.00021695178,0.00025851626,0.00026104346,0.00013873515,0.00011689319],"domain_scores_gemma":[0.9988062,0.00055575685,0.000091948095,0.00039799846,0.000114592025,0.000033525717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003592797,0.0001032709,0.00013588891,0.00031618463,0.00016870587,0.000037081605,0.00041435304,0.000058221445,0.000025806841],"category_scores_gemma":[0.00007739753,0.000104029285,0.00008779496,0.0005539508,0.000058351598,0.00018780002,0.000009625879,0.00020351897,0.000025944442],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008066369,0.00007114957,0.000035573452,0.000016512633,0.000029692317,5.772833e-7,0.00021287453,0.047316767,0.0001967966,0.016238732,0.000010387156,0.9358629],"study_design_scores_gemma":[0.0011620577,0.00016942868,0.003445887,0.00015559551,0.000036613485,0.000028805738,0.00017471139,0.8080859,0.017919632,0.16812325,0.00044011205,0.00025799577],"about_ca_topic_score_codex":0.000012690733,"about_ca_topic_score_gemma":0.000002526448,"teacher_disagreement_score":0.9356049,"about_ca_system_score_codex":0.000026993566,"about_ca_system_score_gemma":0.00006421826,"threshold_uncertainty_score":0.42421913},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056663174,0.000009784152,0.9403349,0.0018096938,0.00032245758,0.00038458023,0.0000333181,0.00013176,0.0003103184],"genre_scores_gemma":[0.9658308,0.000012347528,0.033499077,0.000068598914,0.00012004832,0.0000037704767,0.00009361884,0.0000119851,0.0003597378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832165,0.00013911798,0.00015884242,0.0009972616,0.00012882645,0.00025432574],"domain_scores_gemma":[0.9987639,0.0003430963,0.00011701622,0.0005349152,0.00012881983,0.00011224034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032907218,0.00017675485,0.00020619249,0.00022003286,0.00011415323,0.000120087476,0.0008947323,0.000118709715,0.000012540548],"category_scores_gemma":[0.00017738712,0.00021195678,0.00012437085,0.00058283063,0.000038282993,0.00018750668,0.0010408937,0.0004906416,0.000029060893],"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.000022447492,0.000055766424,0.0013330455,0.000044003937,0.0000123445,0.00002719495,0.0006178538,0.81382453,0.00002046529,0.18336758,0.00012075445,0.00055402966],"study_design_scores_gemma":[0.0005022947,0.000040770905,0.001591186,0.00003060175,0.000007211093,6.44557e-7,0.0001040133,0.9696038,0.00009907484,0.02747018,0.0003411871,0.0002090409],"about_ca_topic_score_codex":0.0005916206,"about_ca_topic_score_gemma":0.000031540836,"teacher_disagreement_score":0.90916765,"about_ca_system_score_codex":0.00014123015,"about_ca_system_score_gemma":0.0002096879,"threshold_uncertainty_score":0.86433464},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010088177,0.000034591536,0.9693193,0.0016517111,0.004387522,0.0015366856,0.0009796253,0.00082473725,0.011177676],"genre_scores_gemma":[0.8401523,0.000019275703,0.14800043,0.005206248,0.00068167225,0.00063078414,0.0047861403,0.00010533945,0.0004177868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957771,0.00015986306,0.0013163972,0.00066493225,0.0011730628,0.00090867816],"domain_scores_gemma":[0.9965472,0.000277828,0.0011642834,0.0015084986,0.00029280054,0.00020933857],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017470506,0.0006774953,0.00065173407,0.00056992756,0.00090260594,0.0010856963,0.0020791197,0.00041374564,0.00018934613],"category_scores_gemma":[0.00013936148,0.00068495417,0.0005171448,0.00031703143,0.00011941913,0.0006694709,0.0019047619,0.002146986,0.00010788996],"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.00054189033,0.0031462233,0.008542947,0.009586899,0.00097554707,0.00012439533,0.025141865,0.52461475,0.000110505374,0.09496788,0.035648104,0.29659897],"study_design_scores_gemma":[0.001550953,0.0003114344,0.0003678951,0.00036116372,0.000033120807,0.000023861696,0.0002176357,0.95774186,0.0000716423,0.0011320633,0.037450116,0.0007382289],"about_ca_topic_score_codex":0.000054250475,"about_ca_topic_score_gemma":0.0000032367734,"teacher_disagreement_score":0.8300641,"about_ca_system_score_codex":0.00049927545,"about_ca_system_score_gemma":0.0003549874,"threshold_uncertainty_score":0.99995124},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021687794,0.000057885598,0.9738768,0.002299352,0.00027464767,0.0002584073,0.000008499023,0.00027637227,0.0012602494],"genre_scores_gemma":[0.5174486,0.000009045231,0.48096067,0.0002732832,0.00017435633,0.00008441478,0.00012515014,0.000019451078,0.0009050462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982158,0.00013494263,0.00022245219,0.000879286,0.00030830325,0.00023923091],"domain_scores_gemma":[0.99860865,0.00038343781,0.000347351,0.0003089707,0.0002650626,0.00008655389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031117516,0.00027213164,0.00032988263,0.00006836078,0.0002922699,0.00065375876,0.0004107966,0.0001358125,0.000009666992],"category_scores_gemma":[0.00017549352,0.00021484625,0.00006704382,0.00015111998,0.000040411258,0.00023611334,0.00093902805,0.0008818741,0.0000011746498],"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.00014323628,0.0004916858,0.04216062,0.0010696684,0.0010387483,0.000088320165,0.009283496,0.4892573,0.001837907,0.17993942,0.0015152268,0.27317438],"study_design_scores_gemma":[0.00042194524,0.00010881082,0.014834894,0.00014208209,0.000013391204,0.000021622138,0.00015127778,0.98149776,0.00011779343,0.0014975739,0.00083931873,0.0003535202],"about_ca_topic_score_codex":0.00011182475,"about_ca_topic_score_gemma":0.000031452626,"teacher_disagreement_score":0.4957608,"about_ca_system_score_codex":0.00004565246,"about_ca_system_score_gemma":0.00024666305,"threshold_uncertainty_score":0.8761176},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17891562,0.000027822767,0.81850386,0.00031721735,0.00010161361,0.000103852566,0.000011938963,0.0004634206,0.0015546608],"genre_scores_gemma":[0.9867094,0.000018371575,0.012584349,0.000038408416,0.00007609249,7.1928935e-7,0.0000548234,0.000013958207,0.0005038807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984972,0.00013839462,0.00011928848,0.0008981845,0.00007724726,0.0002697122],"domain_scores_gemma":[0.9989598,0.0002079205,0.00020410914,0.00032483978,0.00011792799,0.00018544677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014414593,0.00024056164,0.00024112334,0.00010101708,0.0005033061,0.00026410393,0.00056267326,0.00011361268,0.000011126855],"category_scores_gemma":[0.00015036186,0.0002574931,0.000054509215,0.0005978974,0.00011194013,0.00022990226,0.0012898355,0.001136608,0.000022661668],"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.000035122324,0.00009875342,0.20093256,0.000299994,0.00027007418,0.0019772751,0.0011950859,0.5650064,0.0001548653,0.2196127,0.00018289487,0.010234303],"study_design_scores_gemma":[0.00035631668,0.00015805714,0.005376037,0.0001612044,0.000056909917,0.00003358817,0.000092061775,0.9837419,0.00003565892,0.009064965,0.0005154418,0.0004078907],"about_ca_topic_score_codex":0.00018605315,"about_ca_topic_score_gemma":0.000008069194,"teacher_disagreement_score":0.8077938,"about_ca_system_score_codex":0.000063338324,"about_ca_system_score_gemma":0.00013296382,"threshold_uncertainty_score":0.9999877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02397884,0.0003835926,0.9659872,0.0025907734,0.0040992475,0.0009289052,0.00017760364,0.0018434427,0.0000104011615],"genre_scores_gemma":[0.8272737,0.000023936052,0.16861598,0.00077232573,0.0029674487,0.00025691898,6.4155296e-7,0.000083243176,0.0000057700236],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967152,0.00019421344,0.00051883183,0.0014461969,0.00040788084,0.0007177151],"domain_scores_gemma":[0.9974397,0.000114629,0.00041029797,0.0013649415,0.00027273953,0.0003977172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006396369,0.000539873,0.00055900036,0.00012490897,0.00034095522,0.0006013435,0.0015466689,0.00041914626,0.0000090993735],"category_scores_gemma":[0.0002505931,0.0005809502,0.00026952333,0.0006059641,0.000052373074,0.00025974435,0.0010193456,0.0010837413,0.000022879807],"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.0005272478,0.0019441302,0.080011845,0.008240591,0.0028793132,0.00085767964,0.0005124502,0.32414797,0.37442884,0.10992413,0.09499083,0.0015349849],"study_design_scores_gemma":[0.0004559313,0.00017105829,0.019754553,0.00018028711,0.000056288234,2.5289083e-8,3.7675838e-7,0.96363765,0.005653118,0.00008180501,0.009292419,0.0007164928],"about_ca_topic_score_codex":0.00002770621,"about_ca_topic_score_gemma":9.839863e-7,"teacher_disagreement_score":0.8032949,"about_ca_system_score_codex":0.0001329093,"about_ca_system_score_gemma":0.00035777455,"threshold_uncertainty_score":0.9996642},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23166645,0.0000024595204,0.7540155,0.0015426317,0.000019171384,0.00017919888,1.7005955e-7,0.00023280636,0.012341593],"genre_scores_gemma":[0.4547794,0.0000015800217,0.5418098,0.00033848794,0.000067405505,0.00006967245,0.0000060717493,0.000005733148,0.0029218805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885833,0.00013041915,0.00017355614,0.00044506698,0.00017726203,0.00021536245],"domain_scores_gemma":[0.9989109,0.0006166249,0.00006973329,0.00021159962,0.00006525669,0.00012587356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008235283,0.00010197957,0.00014533455,0.000066499735,0.0002816027,0.00011944112,0.00022257667,0.000054071617,0.000020454812],"category_scores_gemma":[0.00088699267,0.00008488632,0.000028884522,0.0002343832,0.000034228004,0.00013092521,0.00017301172,0.00015511797,0.00005752607],"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.000026338446,0.000031237538,0.031999655,0.000008967457,0.0000130010585,0.0000015145303,0.0014584085,0.044614606,0.0013668113,0.85427403,0.0011644114,0.06504102],"study_design_scores_gemma":[0.0005543736,0.000250948,0.20216967,0.000012606194,0.0000038456797,0.000015463982,0.000022918173,0.7595735,0.000052965446,0.026388234,0.010717443,0.00023797921],"about_ca_topic_score_codex":0.000101995174,"about_ca_topic_score_gemma":0.0000031156233,"teacher_disagreement_score":0.8278858,"about_ca_system_score_codex":0.000010600816,"about_ca_system_score_gemma":0.000015511085,"threshold_uncertainty_score":0.34615636},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015667009,0.000019525358,0.9815032,0.014978017,0.00044970537,0.00008196936,0.00006852633,0.00031668326,0.0010157088],"genre_scores_gemma":[0.82085353,0.00002922191,0.17612761,0.0027293717,0.000088257046,0.000005708147,0.000008238918,0.000008787587,0.00014924616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790466,0.000041746007,0.00016938036,0.0009480175,0.00059358444,0.0003426038],"domain_scores_gemma":[0.9969416,0.00008832551,0.00005133266,0.002580889,0.000049357997,0.0002884732],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00048969314,0.00013063359,0.000116203875,0.00011453369,0.0005602127,0.00043341037,0.008285082,0.000027698394,0.00009263845],"category_scores_gemma":[0.00020173735,0.00011486581,0.000031061132,0.0017021392,0.00023172732,0.002588109,0.00025711037,0.00032833632,0.0004901678],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009362915,0.000120090175,0.000070815666,0.000012159994,0.000011159513,0.000021624182,0.0012124529,0.0036941788,0.0036151474,0.0020578995,0.0014568279,0.9877183],"study_design_scores_gemma":[0.00028594915,0.00026294272,0.00090382405,0.000016465565,0.000008369916,0.000027398697,0.00007487123,0.934579,0.0032957112,0.0002829031,0.05994931,0.0003132114],"about_ca_topic_score_codex":0.00003478943,"about_ca_topic_score_gemma":0.000004819406,"teacher_disagreement_score":0.98740506,"about_ca_system_score_codex":0.00001851924,"about_ca_system_score_gemma":0.00016669523,"threshold_uncertainty_score":0.99708056},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06743161,0.00022423847,0.92887837,0.00063318573,0.0012804647,0.0002427929,0.0000050497297,0.00060898525,0.0006953039],"genre_scores_gemma":[0.52801514,0.000015166223,0.47082835,0.00012251266,0.00020138948,0.0000922351,0.00005467971,0.000018500305,0.00065204955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975051,0.00017560339,0.00036828278,0.0012368106,0.00030899592,0.00040516438],"domain_scores_gemma":[0.9973877,0.0004798429,0.00021062935,0.001610457,0.00012868113,0.00018269442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024853105,0.00033724666,0.0003960339,0.00009176523,0.0002726799,0.00086350885,0.0024161697,0.00027491953,0.000091393005],"category_scores_gemma":[0.0010089623,0.00032405133,0.00024549375,0.00017642832,0.000043947064,0.00022854011,0.002918387,0.0010123041,0.000011263855],"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.0000407039,0.0005802613,0.17946935,0.00041734404,0.00049817347,0.00035189607,0.06430059,0.16544648,0.0038439527,0.0048466944,0.004049329,0.57615525],"study_design_scores_gemma":[0.00026296385,0.00003519304,0.0011153806,0.00011001492,0.000008776323,0.0000037399623,0.00054964813,0.99037,0.0021732282,0.0013359683,0.0035641997,0.00047091403],"about_ca_topic_score_codex":0.0011701938,"about_ca_topic_score_gemma":0.000060974613,"teacher_disagreement_score":0.8249235,"about_ca_system_score_codex":0.00004219913,"about_ca_system_score_gemma":0.00021943367,"threshold_uncertainty_score":0.99992114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017179642,0.00009596806,0.9691318,0.011588023,0.00022600374,0.00037276137,0.00001646325,0.00013461111,0.0012547189],"genre_scores_gemma":[0.96935576,0.00016782753,0.029692447,0.00022763936,0.00018230439,0.00006070479,0.00022962243,0.000010255751,0.00007343195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842435,0.00029747098,0.0003438816,0.0005508116,0.00023974206,0.00014376736],"domain_scores_gemma":[0.9989675,0.00022416894,0.00023362317,0.00029397663,0.0001932396,0.00008745855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048448425,0.00015433821,0.00019830883,0.00011825085,0.00020333295,0.000530419,0.001016129,0.00006757139,0.0000048069073],"category_scores_gemma":[0.00009491139,0.00015672776,0.000021486147,0.00019000641,0.00003847286,0.00072769454,0.0004722951,0.00035800802,0.000005255496],"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.00012847253,0.000108457425,0.0023124458,0.000092399016,0.00009250998,0.000002096833,0.016868498,0.015096334,0.0007343894,0.42384133,0.0007629741,0.5399601],"study_design_scores_gemma":[0.0005653605,0.00016354727,0.009014576,0.0001068663,0.0000052920363,0.000012856773,0.00086654443,0.98470235,0.0000089159485,0.00026001225,0.004134773,0.00015890876],"about_ca_topic_score_codex":0.00005401731,"about_ca_topic_score_gemma":0.00001240711,"teacher_disagreement_score":0.96960604,"about_ca_system_score_codex":0.000043551936,"about_ca_system_score_gemma":0.000057572368,"threshold_uncertainty_score":0.6391173},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05272919,0.00009076815,0.9353035,0.0021698698,0.0005797329,0.00014548555,0.000019942923,0.00039868712,0.0085627865],"genre_scores_gemma":[0.99466103,0.000055776847,0.0017382933,0.0004939676,0.000194897,6.565562e-7,0.000030724827,0.000013480151,0.002811147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782884,0.00029617528,0.00018271408,0.0011888247,0.00015982379,0.0003436222],"domain_scores_gemma":[0.9978513,0.00017298941,0.00025133957,0.0014398855,0.00009696198,0.00018754094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031882734,0.00031928386,0.00041256013,0.00028360612,0.00036951844,0.00040235216,0.003012826,0.00018697533,0.000058962705],"category_scores_gemma":[0.000049994207,0.00027207413,0.0005351942,0.002033876,0.00013842314,0.0001929208,0.0027755792,0.0010703692,0.00011953773],"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.00002091044,0.00010980811,0.01608327,0.000059424146,0.0022475382,0.00048909965,0.0017283217,0.61425215,0.000012288445,0.3561365,0.003938425,0.004922255],"study_design_scores_gemma":[0.00016991844,0.000041908424,0.0038244799,0.000009311497,0.00048542809,0.0000022014485,0.0000685706,0.95155096,0.000013871765,0.039386254,0.0040858835,0.0003612076],"about_ca_topic_score_codex":0.00047171742,"about_ca_topic_score_gemma":0.00006856988,"teacher_disagreement_score":0.94193184,"about_ca_system_score_codex":0.000079819954,"about_ca_system_score_gemma":0.00016425092,"threshold_uncertainty_score":0.9999731},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027625207,0.000057760426,0.9695906,0.0012183706,0.00006256509,0.000073736184,0.0000049548416,0.000033512537,0.0013332888],"genre_scores_gemma":[0.9026388,0.0000030328713,0.0971066,0.000012061743,0.000007811926,0.0000047941003,0.0000012416729,0.000001315671,0.00022437453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994248,0.00005640087,0.00016668072,0.000088088746,0.00014248969,0.00012154396],"domain_scores_gemma":[0.99944526,0.00014186806,0.000053988242,0.0002209295,0.00010755703,0.000030374196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019354644,0.000043487595,0.000086237415,0.000012025127,0.00013871575,0.000055399076,0.0003600173,0.000011629729,0.000056478963],"category_scores_gemma":[0.00018290477,0.00002308686,0.000019291489,0.000106945074,0.00026484986,0.00010284149,0.00013606306,0.0000613243,0.000019080766],"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.0000011725268,0.000029921735,0.0009337595,0.000013947885,0.0000076199926,1.1318959e-7,0.000075806376,0.000028006429,0.0017448838,0.97108626,0.0014435753,0.02463493],"study_design_scores_gemma":[0.00023783927,0.00013273624,0.038177352,0.00004361311,0.000005211512,0.000008077438,0.00012869248,0.82059807,0.042275544,0.095118046,0.0031148752,0.00015994963],"about_ca_topic_score_codex":0.0012023011,"about_ca_topic_score_gemma":0.00001025638,"teacher_disagreement_score":0.8759682,"about_ca_system_score_codex":0.0000063591106,"about_ca_system_score_gemma":0.000025877938,"threshold_uncertainty_score":0.18175276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031365793,0.0001244776,0.96133184,0.0024574725,0.0009825607,0.0021270164,0.00055251754,0.0005801023,0.00047821118],"genre_scores_gemma":[0.41190577,0.000030984895,0.5849838,0.00035822944,0.00061945454,0.00058334175,0.0013059344,0.00006648691,0.00014599522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678534,0.00008106843,0.0012289349,0.00072016503,0.0003508934,0.00083358586],"domain_scores_gemma":[0.9972839,0.0007604569,0.0007250404,0.00067324244,0.00032559587,0.00023176757],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001280581,0.00055637985,0.0007148709,0.00029184646,0.0006358588,0.0010549481,0.0012243211,0.00026966698,0.0000020806056],"category_scores_gemma":[0.0027452735,0.0005469152,0.00021572913,0.00041451104,0.00008287176,0.0006758512,0.002062135,0.002236225,0.000012124403],"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.0002237496,0.0008533115,0.08695613,0.020434933,0.00069476716,0.000035964455,0.055873714,0.085849866,0.00028846512,0.031249495,0.0036514022,0.7138882],"study_design_scores_gemma":[0.0014375086,0.00020510425,0.002312095,0.00064398034,0.00003423166,0.000035745576,0.00025269078,0.9674003,0.00009640245,0.0048167477,0.02202457,0.0007406035],"about_ca_topic_score_codex":0.000080052414,"about_ca_topic_score_gemma":0.00000918062,"teacher_disagreement_score":0.88155043,"about_ca_system_score_codex":0.00013577381,"about_ca_system_score_gemma":0.00022032818,"threshold_uncertainty_score":0.99998206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050568045,0.00040279367,0.99014443,0.0016267954,0.0015422984,0.00040648115,0.0000015357878,0.00065746193,0.004712502],"genre_scores_gemma":[0.4000791,0.000049440237,0.5945619,0.0023571367,0.0016085259,0.000017078766,0.000029526143,0.000104164195,0.0011931728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993397,0.000121740144,0.0009595229,0.0027433096,0.0016416473,0.0011367763],"domain_scores_gemma":[0.99676955,0.0008003329,0.000570765,0.0011094902,0.00020794958,0.0005418869],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001332132,0.00088207744,0.0009084367,0.0008326701,0.00092028605,0.0012510956,0.003883063,0.00031402215,0.00010578431],"category_scores_gemma":[0.0006477139,0.00086911104,0.00023229708,0.0010996074,0.00015978815,0.0006844394,0.0029354785,0.003079321,0.00020856143],"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.000008821134,0.000008803956,0.0009303107,0.000035038105,0.000022185803,0.00023332096,0.0026967803,0.48056147,0.0005749204,0.0054163625,0.000019217276,0.5094928],"study_design_scores_gemma":[0.0003210503,0.00034862044,0.000126165,0.0006976458,0.0000116841575,0.000024280736,0.0000023401242,0.9831627,0.00060616696,0.00530231,0.008350198,0.0010468267],"about_ca_topic_score_codex":0.00012348758,"about_ca_topic_score_gemma":0.000026535747,"teacher_disagreement_score":0.508446,"about_ca_system_score_codex":0.00043978184,"about_ca_system_score_gemma":0.00036448403,"threshold_uncertainty_score":0.9997857},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009333368,0.00003488161,0.8978763,0.09203846,0.00006656504,0.0003997523,0.00020659293,0.00003158352,0.000012473313],"genre_scores_gemma":[0.07886087,0.000008521875,0.91504425,0.004371295,0.00051841635,0.0000787175,0.0010869999,0.000012147366,0.000018804858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832237,0.0003406711,0.00020784474,0.0004058157,0.00049209985,0.00023120253],"domain_scores_gemma":[0.99860847,0.00036693036,0.000023898529,0.0007836791,0.00012523774,0.00009180479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010070443,0.000072878145,0.00009430917,0.000045662695,0.0005667435,0.00039000507,0.0017612365,0.000015485404,0.00004230282],"category_scores_gemma":[0.00016435114,0.000055383072,0.00002463237,0.0003359041,0.00007059496,0.00054430065,0.0005104289,0.0002163825,0.0000124958415],"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.00001649413,0.0001469164,0.00032869383,0.000018722565,0.000100459336,0.0000038136245,0.009785055,0.03710837,0.052669555,0.006524995,0.027485205,0.8658117],"study_design_scores_gemma":[0.000323413,0.000114121496,0.00034209498,0.000008218022,0.0000034000936,4.5011188e-7,0.00027902803,0.9878913,0.00066246063,0.000045145367,0.010266246,0.000064085325],"about_ca_topic_score_codex":0.0018235634,"about_ca_topic_score_gemma":0.00011137921,"teacher_disagreement_score":0.95078295,"about_ca_system_score_codex":0.000023928113,"about_ca_system_score_gemma":0.00008658799,"threshold_uncertainty_score":0.43589902},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012552197,0.00007945644,0.9815708,0.0017912551,0.000576293,0.00019452268,0.0006522046,0.00026839756,0.0023149045],"genre_scores_gemma":[0.97213537,0.00016675763,0.025637904,0.00024300949,0.00022593931,1.1061974e-7,0.0011147645,0.000022404593,0.0004537263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677557,0.00023623863,0.00032214142,0.0021394442,0.00020469906,0.00032193735],"domain_scores_gemma":[0.9911749,0.00032445192,0.00048058052,0.0076436037,0.00012414779,0.00025233536],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00039452134,0.00032619847,0.00053698866,0.00019664763,0.00010893316,0.0001408318,0.01534702,0.00023713926,0.000036536258],"category_scores_gemma":[0.00042364048,0.00035785604,0.00011632015,0.0008593696,0.0001343217,0.00070975826,0.035267677,0.0011186787,0.000076584816],"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.00010384369,0.0008197156,0.060111675,0.0008349384,0.0015317181,0.0028691292,0.0013580448,0.72503823,0.00007048117,0.10766531,0.07703732,0.022559613],"study_design_scores_gemma":[0.0002794163,0.00004259696,0.0013079258,0.000050240495,0.00013659797,0.000004257923,0.00002586764,0.9825072,0.000009790456,0.009126837,0.0061547463,0.00035447822],"about_ca_topic_score_codex":0.0002147215,"about_ca_topic_score_gemma":0.00003190207,"teacher_disagreement_score":0.95958316,"about_ca_system_score_codex":0.00005286958,"about_ca_system_score_gemma":0.00047834567,"threshold_uncertainty_score":0.99988735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04530884,0.0002219477,0.93957174,0.009612639,0.0001317848,0.00013283847,0.0000017789903,0.0009741961,0.0040442157],"genre_scores_gemma":[0.94826585,0.000009702069,0.04918131,0.0011782275,0.0002960795,0.000007799868,0.000025610698,0.00003666487,0.0009987303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829966,0.00019292752,0.00022633922,0.000538905,0.00039640508,0.00034578762],"domain_scores_gemma":[0.9992928,0.00008089402,0.00014300265,0.0002504456,0.0000611263,0.00017174668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018645854,0.00023624825,0.0002439091,0.000083455554,0.00035553038,0.00034219195,0.0006287265,0.000057789464,0.000093512775],"category_scores_gemma":[0.00015155114,0.00018958857,0.000061980354,0.0005987673,0.00004805531,0.00035841603,0.00022659,0.00059654564,0.00013729703],"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.00016649732,0.00017735806,0.15618692,0.00019189267,0.00015994071,0.00043792094,0.01764915,0.3522128,0.0015774778,0.019788433,0.0010688868,0.45038274],"study_design_scores_gemma":[0.0006226169,0.00043625935,0.0030401598,0.000027180646,0.000009550289,0.00005315154,0.000061254956,0.97433376,0.000111775196,0.00006919225,0.020950725,0.00028435315],"about_ca_topic_score_codex":0.00011594221,"about_ca_topic_score_gemma":0.000013754258,"teacher_disagreement_score":0.902957,"about_ca_system_score_codex":0.00001660476,"about_ca_system_score_gemma":0.000042120268,"threshold_uncertainty_score":0.7731197},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032728945,0.000043771324,0.9863282,0.008486524,0.00029543537,0.00018142046,0.0000025203624,0.00023656563,0.0011526742],"genre_scores_gemma":[0.94497144,0.000022049991,0.0536009,0.0011082375,0.00020872832,0.000013772505,0.000008223096,0.000013203566,0.000053439933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814373,0.00014751026,0.00045556267,0.0005607036,0.0003237062,0.00036877228],"domain_scores_gemma":[0.9991722,0.00013402324,0.00012823903,0.00033039492,0.000056602912,0.00017850276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030341864,0.00019430589,0.00023030155,0.000110523004,0.00011796668,0.00031643038,0.0008130986,0.00007373893,0.00025224264],"category_scores_gemma":[0.00040214637,0.00017955032,0.00007818028,0.0009669163,0.00008058999,0.0003573909,0.00019041852,0.0003229004,0.000100201934],"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.000024241706,0.000029742101,0.00033601816,0.0000084374915,0.0000049825576,0.000023061508,0.0019961623,0.8936639,0.00015074392,0.03905076,0.000062980784,0.064649],"study_design_scores_gemma":[0.000044718523,0.00008781779,0.000056503635,0.00002262436,0.0000027116707,0.0000016017511,0.00017935604,0.9904122,0.0011216082,0.0072310423,0.0006107681,0.00022907696],"about_ca_topic_score_codex":0.00050678157,"about_ca_topic_score_gemma":0.00009083973,"teacher_disagreement_score":0.94169855,"about_ca_system_score_codex":0.00004473312,"about_ca_system_score_gemma":0.00006111203,"threshold_uncertainty_score":0.73218495},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07360693,0.00015817283,0.91456413,0.011240153,0.00029114826,0.00006783254,0.0000027452775,0.000023619341,0.000045296016],"genre_scores_gemma":[0.46280637,0.0000026477444,0.5367565,0.00022104458,0.00018151377,4.440623e-7,5.580909e-7,0.000006517113,0.00002435902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988822,0.00014759293,0.00034169352,0.00012973521,0.00033060415,0.00016817288],"domain_scores_gemma":[0.9984907,0.00024985615,0.00060284446,0.00042089095,0.0001316914,0.00010403532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039820807,0.000105018065,0.00025661528,0.000031740812,0.00028760242,0.00010401585,0.0024351408,0.00004094409,0.000022421802],"category_scores_gemma":[0.0014647337,0.0000652084,0.00021867955,0.00018764702,0.00009093715,0.00018961425,0.0007811951,0.00047944768,0.0000011162773],"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.0011889575,0.00081567175,0.09101736,0.000747303,0.0007767118,0.000051798717,0.027628005,0.54785323,0.049291007,0.009384706,0.042389974,0.22885525],"study_design_scores_gemma":[0.00067060126,0.00050409115,0.0077418177,0.00009389814,0.000023494138,0.000045948378,0.000060917126,0.96770716,0.0050592143,0.0030398162,0.01493329,0.00011977351],"about_ca_topic_score_codex":0.00003023809,"about_ca_topic_score_gemma":6.2101157e-7,"teacher_disagreement_score":0.4198539,"about_ca_system_score_codex":0.000013802626,"about_ca_system_score_gemma":0.000066052475,"threshold_uncertainty_score":0.45251378},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00858897,0.000050650564,0.9754525,0.0050887833,0.0014760841,0.0005081023,0.00000928054,0.00021242496,0.008613239],"genre_scores_gemma":[0.94456744,0.000109597975,0.054509558,0.00016634636,0.00012486272,0.00006633877,0.000011084125,0.000023780669,0.0004209727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683285,0.00006482463,0.00084189407,0.0011185583,0.0007409112,0.00040098178],"domain_scores_gemma":[0.99672055,0.000085229556,0.0010547894,0.0008068796,0.0012176682,0.00011489103],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00068626483,0.00042856464,0.00047798853,0.00018152938,0.0002506119,0.0010994608,0.0037491277,0.00028770772,0.00012254855],"category_scores_gemma":[0.000558448,0.00034468944,0.00025134417,0.0006977504,0.00026002384,0.0005405046,0.0021281717,0.0012502145,0.000027424523],"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.000063071406,0.0003623914,0.00028169464,0.00046810805,0.00010921791,0.0000031854931,0.0054779416,0.11697537,0.044868518,0.56884265,0.00016866771,0.2623792],"study_design_scores_gemma":[0.000013259989,0.0000687697,0.0000474958,0.00079379056,0.000021693031,0.000006208229,0.0002592224,0.89706457,0.06147345,0.03989432,0.000022853765,0.00033437574],"about_ca_topic_score_codex":0.00014684178,"about_ca_topic_score_gemma":0.0000064380324,"teacher_disagreement_score":0.9359785,"about_ca_system_score_codex":0.000117507996,"about_ca_system_score_gemma":0.00030170914,"threshold_uncertainty_score":0.9999375},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000810591,0.0001549135,0.96949023,0.000113914546,0.0002584712,0.0015773815,0.00004461368,0.00012684266,0.02822552],"genre_scores_gemma":[0.0003344922,0.000007907315,0.9048514,0.0001864474,0.00093374704,0.00034180103,0.000028930666,0.0000849998,0.09323032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982267,0.00000772905,0.00040315188,0.0006223073,0.00034123336,0.00039887283],"domain_scores_gemma":[0.99827915,0.00087235647,0.00020823137,0.0004154142,0.00007142286,0.0001534452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000613547,0.00041596158,0.0006034317,0.000033193777,0.00039932245,0.00028874355,0.00047042675,0.000889164,0.000016194293],"category_scores_gemma":[0.000022564172,0.0003823981,0.00056460284,0.000021262404,0.0001782195,0.000025473515,0.0003309103,0.0007853267,0.000004271694],"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.000014484711,0.000030510764,5.6232503e-9,0.00015529519,0.00016805701,8.555705e-7,0.001804893,0.000036806072,0.00010716136,0.94865656,0.0023296978,0.04669569],"study_design_scores_gemma":[0.0023825527,0.00044545994,6.6018693e-9,0.00057874323,0.00015269886,0.000018640365,0.0011149412,0.060309038,0.010215438,0.8625062,0.061263338,0.0010129581],"about_ca_topic_score_codex":0.0000011264636,"about_ca_topic_score_gemma":8.1008096e-8,"teacher_disagreement_score":0.08615036,"about_ca_system_score_codex":0.00006263866,"about_ca_system_score_gemma":0.00023514312,"threshold_uncertainty_score":0.9998628},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54773605,0.000018625522,0.45055434,0.00024896808,0.0002669127,0.0001676744,0.0000035601868,0.00022728545,0.0007765562],"genre_scores_gemma":[0.9970357,0.000032245764,0.0022474779,0.000097598306,0.00011219422,8.908304e-7,0.000017353903,0.000017767034,0.00043881178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775344,0.0004822516,0.00022377093,0.0010834906,0.00010274002,0.0003542999],"domain_scores_gemma":[0.99882495,0.0001515871,0.0003204933,0.00042478708,0.00007249228,0.00020571287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023865393,0.00027696922,0.00039810274,0.00018752257,0.0001533424,0.00013544897,0.00086966396,0.00021371011,0.000033390796],"category_scores_gemma":[0.00019190494,0.00034027244,0.00014652817,0.00074268994,0.000055963315,0.00033020502,0.00093643245,0.0013719535,0.000050855015],"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.000043391938,0.00008035305,0.0101607945,0.000048906622,0.000041890064,0.00066327804,0.0019713084,0.973955,0.00009295859,0.004336528,0.000025880947,0.008579738],"study_design_scores_gemma":[0.00054941594,0.000072360235,0.005920175,0.0000708948,0.00003464981,0.0000029649536,0.0001609257,0.9888342,0.0000871519,0.003474958,0.00043244445,0.0003598298],"about_ca_topic_score_codex":0.0006305207,"about_ca_topic_score_gemma":0.000057448346,"teacher_disagreement_score":0.4492996,"about_ca_system_score_codex":0.0002650014,"about_ca_system_score_gemma":0.00022667008,"threshold_uncertainty_score":0.99990493},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013149537,0.000017364246,0.98154557,0.0011105082,0.0014888922,0.00009513173,2.1629877e-7,0.0011303778,0.0014623989],"genre_scores_gemma":[0.083690844,0.000008060159,0.91556317,0.00052837527,0.00013887457,0.000012159567,3.0449166e-7,0.000005563867,0.000052657324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970028,0.00045673185,0.00032370735,0.0009238541,0.00054949627,0.0007434372],"domain_scores_gemma":[0.9980335,0.00078022963,0.000070596965,0.00086102705,0.00005540892,0.00019923331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059946417,0.000172231,0.00025909673,0.00059216295,0.00027596415,0.00046934094,0.0031886678,0.00006448481,0.000008564993],"category_scores_gemma":[0.0005458482,0.00013697242,0.0000605373,0.005714627,0.00028569586,0.0005942404,0.0025793905,0.00040362056,0.00016352846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.0267545e-7,0.000029826264,0.0012919017,0.0000061824394,0.0000011682703,0.000057980444,0.00035787545,0.009154502,0.00068363885,0.039874706,0.00004047338,0.9485012],"study_design_scores_gemma":[0.00014456721,0.00006722099,0.060114183,0.000023050361,5.0312076e-7,0.000026632932,0.0000023829361,0.9072665,0.00042557478,0.030925052,0.000822338,0.00018202316],"about_ca_topic_score_codex":0.000023564486,"about_ca_topic_score_gemma":6.9143766e-7,"teacher_disagreement_score":0.9483192,"about_ca_system_score_codex":0.000051245108,"about_ca_system_score_gemma":0.00009242882,"threshold_uncertainty_score":0.59253913},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06037666,0.00016749815,0.93463403,0.001923729,0.00047594684,0.00022398152,0.0000023730483,0.0011972204,0.000998582],"genre_scores_gemma":[0.97173893,0.0000029370058,0.027185233,0.0005669032,0.00032453405,0.000022339756,0.00006225951,0.000008773639,0.00008808631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854094,0.00008214915,0.0004824663,0.00020874247,0.00044313978,0.00024253593],"domain_scores_gemma":[0.9991072,0.000061907995,0.00031167493,0.00016451467,0.00017714071,0.00017758187],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00018892084,0.00015490399,0.00018478381,0.00006801968,0.00035425788,0.0012959546,0.0005836823,0.000070585316,0.0000047739586],"category_scores_gemma":[0.00025054297,0.00012965227,0.000052380496,0.0005118565,0.000020177318,0.003231478,0.00015373748,0.00041131477,0.00025681077],"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.0000082367405,0.000012636337,0.0007778322,0.00006576681,0.000007902135,0.0000043713726,0.009331874,0.21961308,0.00006033784,0.00032523673,0.00031920584,0.76947355],"study_design_scores_gemma":[0.00022317257,0.00012376718,0.00012299899,0.00007777399,0.000003190954,0.000012500389,0.00045098978,0.9590727,0.000040660532,0.000007876437,0.039711848,0.00015251453],"about_ca_topic_score_codex":0.00007132274,"about_ca_topic_score_gemma":1.9287316e-7,"teacher_disagreement_score":0.9113623,"about_ca_system_score_codex":0.000017768123,"about_ca_system_score_gemma":0.00006037614,"threshold_uncertainty_score":0.9997408},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006518299,0.00012796313,0.9916275,0.0006944636,0.00021855427,0.00040314413,0.000039646075,0.0003263925,0.000044008746],"genre_scores_gemma":[0.90211546,9.3213714e-7,0.09719712,0.00046061547,0.0000783151,0.00004022113,0.0000729005,0.0000069297166,0.000027496706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990308,0.000037869697,0.00037149107,0.00017506513,0.00021729054,0.00016745237],"domain_scores_gemma":[0.9992925,0.000051980154,0.00033004882,0.000108018816,0.0001348343,0.00008260893],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00010795645,0.0001470363,0.00017343315,0.00007049788,0.00025850654,0.0014463874,0.00022976003,0.000060032773,5.386661e-7],"category_scores_gemma":[0.00011046056,0.000120230834,0.000028025634,0.0002140827,0.000021491776,0.008554259,0.000061210136,0.00013580131,0.0000029425137],"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.000003699852,0.0000040310715,0.000013477578,0.00071065576,0.0000055690584,3.5637711e-7,0.0061130673,0.7809297,0.0000397527,0.0006725962,0.00022726993,0.21127985],"study_design_scores_gemma":[0.00039506637,0.000057353052,0.00011163771,0.000109356115,0.000006344716,0.000019091103,0.00025024472,0.9985508,0.000033388227,0.00011364471,0.00020627402,0.00014681289],"about_ca_topic_score_codex":0.000012080498,"about_ca_topic_score_gemma":2.5143842e-7,"teacher_disagreement_score":0.89559716,"about_ca_system_score_codex":0.000022324099,"about_ca_system_score_gemma":0.000051089453,"threshold_uncertainty_score":0.9995902},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042030215,0.00012185051,0.98509425,0.003650547,0.0006355405,0.00018226259,0.0000046005534,0.00080872397,0.0052991905],"genre_scores_gemma":[0.99178153,0.0000016754342,0.005231748,0.0024743315,0.0002444269,0.000014148723,0.000019230018,0.000008782696,0.00022415168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871016,0.00005878959,0.00048083827,0.00017036352,0.00033212843,0.0002477229],"domain_scores_gemma":[0.99920946,0.000059481245,0.00030248053,0.00015551689,0.000121402074,0.0001516832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022116635,0.00015623006,0.0001858119,0.000088028704,0.00023384507,0.0008213197,0.00051397196,0.000043909193,0.0000047858716],"category_scores_gemma":[0.00020935654,0.00013090792,0.000044449556,0.0005123769,0.000020177851,0.0032951473,0.000090055604,0.0002780811,0.00018698334],"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.0000064450737,0.000005748002,0.00012032061,0.00037007337,0.0000059875274,0.000007624943,0.026940871,0.23385964,0.000026211692,0.0007077113,0.00040350828,0.73754585],"study_design_scores_gemma":[0.00020835426,0.00005021492,0.00004014756,0.000041785104,0.0000017511512,0.00003471591,0.00014373302,0.9640981,0.000019105259,0.000021002343,0.0351859,0.00015520211],"about_ca_topic_score_codex":0.000064223044,"about_ca_topic_score_gemma":4.7038776e-7,"teacher_disagreement_score":0.9875785,"about_ca_system_score_codex":0.00001464903,"about_ca_system_score_gemma":0.00007274235,"threshold_uncertainty_score":0.7920005},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1333061,0.00023898428,0.83775055,0.02476113,0.00064432406,0.00021821131,0.000008991988,0.0009545873,0.0021171493],"genre_scores_gemma":[0.92709684,0.000034103516,0.06382603,0.008578006,0.00014681135,0.000018679986,0.00015592475,0.000020257816,0.0001233165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854606,0.000065830674,0.0003821645,0.00031442524,0.00041531827,0.00027617416],"domain_scores_gemma":[0.99861586,0.00003834061,0.000674972,0.00041018263,0.0001628381,0.000097829754],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00029547047,0.0002641524,0.00029483196,0.0002505295,0.00030147683,0.0029828548,0.0006342444,0.00014341576,0.0000081729995],"category_scores_gemma":[0.00006506718,0.00025354256,0.00005978551,0.0002643357,0.000052035222,0.0032537433,0.00047672377,0.000843514,0.000022611861],"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.000013154622,0.0000675435,0.0019581313,0.0026614661,0.000109354696,0.00004745961,0.016748983,0.020071127,0.0004260233,0.00026107774,0.009113311,0.9485224],"study_design_scores_gemma":[0.0004266104,0.00001428654,0.014925586,0.0008188269,0.000015277761,0.00006532456,0.00027512203,0.9700893,0.00047500842,0.00017466224,0.012192069,0.00052792707],"about_ca_topic_score_codex":0.000081506354,"about_ca_topic_score_gemma":7.6486316e-7,"teacher_disagreement_score":0.95001817,"about_ca_system_score_codex":0.000075688426,"about_ca_system_score_gemma":0.00018729692,"threshold_uncertainty_score":0.99999166},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7148517,0.00014510711,0.28141162,0.0031333717,0.00019586991,0.0002008333,7.117567e-7,0.000024212693,0.000036619826],"genre_scores_gemma":[0.9929092,0.000024640169,0.0065160347,0.00008005897,0.0004404161,0.0000034929687,2.0785528e-7,0.000010439573,0.00001552236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956856,0.001572674,0.00072362873,0.0003441502,0.0012488926,0.00042508024],"domain_scores_gemma":[0.99727404,0.0009929162,0.00019463907,0.00023791032,0.0008752011,0.00042527856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0084314,0.00012571432,0.00030449845,0.00030892412,0.00028518398,0.00044039084,0.0010418564,0.000059093385,0.000030023599],"category_scores_gemma":[0.0026890133,0.000101643585,0.000069738875,0.0013409978,0.00013055094,0.0003570342,0.0005486701,0.0014769982,0.00005507907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001300895,0.00053494057,0.083573125,0.00001136553,0.00003049358,0.0005404793,0.007847617,0.00023530332,0.00072812726,0.00026118482,0.00023639704,0.90587085],"study_design_scores_gemma":[0.00048635283,0.022160742,0.30649173,0.00014881979,0.00005130905,0.00074932375,0.012733023,0.63946176,0.007477134,0.007242729,0.0019297412,0.0010673028],"about_ca_topic_score_codex":0.00024457386,"about_ca_topic_score_gemma":0.00006116438,"teacher_disagreement_score":0.9048036,"about_ca_system_score_codex":0.0000443201,"about_ca_system_score_gemma":0.00023284531,"threshold_uncertainty_score":0.64169043},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061993394,0.00012662748,0.8818092,0.055216923,0.00021958126,0.00013417032,0.000007858253,0.000021681157,0.0004705655],"genre_scores_gemma":[0.98937815,0.00004106811,0.009935169,0.00017348712,0.00043539895,7.4886947e-7,0.0000025567845,0.0000075896587,0.000025847266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962269,0.0012250926,0.00063997094,0.00028222907,0.001334241,0.00029157466],"domain_scores_gemma":[0.99602175,0.0022481023,0.00033885924,0.00059696817,0.0006249752,0.00016936798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004485387,0.00009873666,0.00025356608,0.00013991773,0.0002982193,0.0002639735,0.0034667738,0.000047586673,0.00019687483],"category_scores_gemma":[0.005338718,0.00006390448,0.000076782526,0.0009483756,0.00041237884,0.00032089197,0.0007709243,0.0018342567,0.00011272921],"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.0003614617,0.0003547665,0.00029067302,0.000028004815,0.0001368432,0.00011210981,0.006752402,0.020071136,0.026773322,0.5856059,0.004449014,0.35506436],"study_design_scores_gemma":[0.000032855623,0.0007199048,0.000066624314,0.000056837656,0.0000039739557,0.000004360308,0.000945403,0.91361505,0.02284399,0.060137227,0.0015034929,0.00007030754],"about_ca_topic_score_codex":0.0001552664,"about_ca_topic_score_gemma":0.000014679056,"teacher_disagreement_score":0.92738473,"about_ca_system_score_codex":0.000028822702,"about_ca_system_score_gemma":0.00027199296,"threshold_uncertainty_score":0.79690343},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003684745,0.0003367663,0.13140793,0.00050491386,0.00059588434,0.00028912758,0.00008381174,0.00034891718,0.866429],"genre_scores_gemma":[0.000103878316,0.00014024704,0.008007948,0.0002845862,0.00028223623,0.0000010431178,0.000016361633,0.000035643265,0.991128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976319,0.00012445098,0.00027158795,0.00096321845,0.00056736654,0.00044146687],"domain_scores_gemma":[0.99761945,0.000284535,0.0003283572,0.0012379913,0.00021237442,0.00031730183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028305306,0.0004823405,0.00044031825,0.00008143753,0.0008751616,0.0005008253,0.0029461563,0.0002816166,0.000003625756],"category_scores_gemma":[0.000032281616,0.00044038467,0.0003203931,0.000021833283,0.00046433654,0.00020028156,0.0015837635,0.001116208,0.00007661571],"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.000014257914,0.000004606894,7.902403e-7,0.00002307998,0.00009739097,0.0003580257,0.000069569745,0.0000045264137,0.000004253368,0.9473365,0.023777226,0.028309792],"study_design_scores_gemma":[0.0003058424,0.0000777065,0.000015921969,0.000070443864,0.00006405008,0.00004046159,0.000018287808,0.024740197,0.00006119053,0.00014547758,0.973939,0.00052142097],"about_ca_topic_score_codex":0.00020210264,"about_ca_topic_score_gemma":0.0000010322482,"teacher_disagreement_score":0.95016176,"about_ca_system_score_codex":0.000131795,"about_ca_system_score_gemma":0.0002590082,"threshold_uncertainty_score":0.9998048},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000033492631,0.0002883531,0.17633484,0.00041918247,0.00060029456,0.00028552464,0.00005621274,0.00035863734,0.8216536],"genre_scores_gemma":[0.00019478831,0.00012696507,0.005730945,0.00027107558,0.0002707076,9.5276e-7,0.000014762292,0.00003685369,0.99335295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99763507,0.00013310894,0.0002666188,0.00094145775,0.00057697395,0.00044680122],"domain_scores_gemma":[0.9976213,0.00029294743,0.00031738877,0.0012422762,0.00020707876,0.000319031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028876736,0.00048043518,0.0004364591,0.000082823484,0.0008984207,0.0005202508,0.0028792715,0.000274013,0.0000034535947],"category_scores_gemma":[0.000034051278,0.00043749885,0.0003124982,0.000022632006,0.0004368964,0.00020180759,0.0015251454,0.0011557692,0.00008735485],"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.0000104408655,0.000004438866,9.921545e-7,0.000024083156,0.00010377294,0.00031218585,0.00005498358,0.000011236117,0.000002942208,0.96463317,0.012452758,0.022389008],"study_design_scores_gemma":[0.0003117607,0.0000801517,0.000022345324,0.00008361874,0.00007531074,0.000045237728,0.000013718651,0.038224313,0.000043868517,0.00020103804,0.96035933,0.0005393297],"about_ca_topic_score_codex":0.00018199095,"about_ca_topic_score_gemma":9.2071093e-7,"teacher_disagreement_score":0.9644321,"about_ca_system_score_codex":0.00014883398,"about_ca_system_score_gemma":0.00025896472,"threshold_uncertainty_score":0.99980766},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013811038,0.000012327071,0.94196635,0.008767909,0.000053256914,0.00023397141,9.785408e-7,0.000087384076,0.035066787],"genre_scores_gemma":[0.96208584,4.6620633e-7,0.033594158,0.0007362697,0.00008758542,0.00012189556,6.3442064e-7,0.0000054673824,0.003367703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992785,0.00006999677,0.000112315116,0.00017927936,0.000239558,0.00012038127],"domain_scores_gemma":[0.99873656,0.0002832544,0.000055249457,0.0007414928,0.00012213034,0.00006130809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078388996,0.000059021513,0.000053879146,0.000017032356,0.00033525738,0.00010108409,0.0005692244,0.000011763756,0.0000055880464],"category_scores_gemma":[0.00006817439,0.000024921483,0.000019692092,0.00028033648,0.000053687818,0.00005840465,0.000113924194,0.00011356104,0.00005169793],"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.00003035399,0.00018185606,0.0046714637,0.000007538381,0.00003294571,6.308773e-7,0.0029346107,0.006832669,0.00025657823,0.86210674,0.029286593,0.09365804],"study_design_scores_gemma":[0.0007092391,0.0007967901,0.01176055,0.00005261593,0.0000149123425,0.000014665541,0.0051407753,0.10206388,0.0018740126,0.032769214,0.8443506,0.00045274178],"about_ca_topic_score_codex":0.000082173654,"about_ca_topic_score_gemma":0.00003749511,"teacher_disagreement_score":0.9482748,"about_ca_system_score_codex":0.000013551274,"about_ca_system_score_gemma":0.000046891877,"threshold_uncertainty_score":0.25785628},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1640578,0.0002790009,0.82831997,0.00019996412,0.0013733415,0.00048370095,0.000003872246,0.0011788091,0.004103546],"genre_scores_gemma":[0.83051586,0.000041316496,0.11947201,0.00031434043,0.001198711,0.00011446832,0.00013350155,0.00016293734,0.04804683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959652,0.001045567,0.0004298384,0.0010854341,0.0005036027,0.00097038824],"domain_scores_gemma":[0.9976723,0.0007407088,0.00030904583,0.0008580284,0.0001680475,0.00025182246],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031613887,0.0004094112,0.0004597099,0.00025797606,0.00081323757,0.0006604522,0.0014666404,0.00019565028,0.0003567927],"category_scores_gemma":[0.00032559116,0.0004031949,0.00022189545,0.00033417382,0.00009546623,0.0010699474,0.00031414648,0.0012255536,0.00087974535],"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.00018389845,0.00034129736,0.0034510163,0.00016033388,0.00022777247,0.000042556236,0.00706206,0.06082353,0.009168512,0.1667878,0.0005145709,0.7512366],"study_design_scores_gemma":[0.0017167011,0.0010330089,0.0006184878,0.00006013973,0.000029613779,0.000049489005,0.0006004707,0.85523474,0.0006989055,0.016820319,0.12233186,0.00080625253],"about_ca_topic_score_codex":0.00008415195,"about_ca_topic_score_gemma":0.0000011054947,"teacher_disagreement_score":0.79441124,"about_ca_system_score_codex":0.000102997044,"about_ca_system_score_gemma":0.0001737787,"threshold_uncertainty_score":0.9998982},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004412466,0.000053564883,0.96108276,0.0111112585,0.00034031627,0.00014558581,0.000009460504,0.00021401753,0.02263058],"genre_scores_gemma":[0.98030406,0.000032348875,0.017801028,0.0009587807,0.0001380048,0.000028229515,0.00002089278,0.000010650636,0.0007060227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973905,0.00016118301,0.00038982494,0.0007188813,0.0010410718,0.0002985493],"domain_scores_gemma":[0.99741143,0.00031078394,0.0001744965,0.00044896145,0.00153549,0.0001188606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048720348,0.00021165427,0.00019401246,0.00016300548,0.0002649906,0.0005149736,0.00075813703,0.000082653205,0.00039036968],"category_scores_gemma":[0.000605143,0.0001863074,0.000060370334,0.000743362,0.00016505117,0.00047664702,0.00009478304,0.00039124908,0.00063773204],"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.000022316275,0.00011715322,0.00008152518,0.0000062557015,0.000010275532,0.000029080988,0.0002222166,0.0011972636,0.002507705,0.921377,0.00013144394,0.07429773],"study_design_scores_gemma":[0.00006564823,0.00020617947,0.002459525,0.00014195668,0.0000057520774,0.00006424584,0.0002759195,0.653001,0.04570741,0.29695266,0.0007142028,0.00040547492],"about_ca_topic_score_codex":0.000036577087,"about_ca_topic_score_gemma":0.00007917155,"teacher_disagreement_score":0.9758916,"about_ca_system_score_codex":0.00007224597,"about_ca_system_score_gemma":0.00076391647,"threshold_uncertainty_score":0.8196968},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5472466,0.0019121697,0.4306198,0.0010722133,0.0005046932,0.000110419605,0.0000025704803,0.0008700276,0.017661544],"genre_scores_gemma":[0.970624,0.000032313383,0.02509099,0.00011222842,0.0000744415,0.0000037164266,0.00003065496,0.00002055567,0.0040110713],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790716,0.0005255599,0.00034431773,0.000444229,0.0004331284,0.00034557751],"domain_scores_gemma":[0.9990581,0.0001721405,0.00020590315,0.0003070546,0.00016251196,0.00009427403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058760913,0.00019618479,0.0002889305,0.00014271236,0.00032438687,0.00016652663,0.00048655792,0.00006797566,0.00027816088],"category_scores_gemma":[0.0005509226,0.00019201606,0.00011421494,0.0007021855,0.000036656107,0.0003029121,0.00054035994,0.00081317953,0.000050707404],"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.000028238203,0.0003005016,0.45079693,0.0001900456,0.00020928672,0.00062203046,0.0064996537,0.09875194,0.09747313,0.020281991,0.00022007096,0.32462618],"study_design_scores_gemma":[0.0007426324,0.00021234596,0.009998688,0.000076961805,0.000013939454,0.00018232416,0.00022041277,0.94522625,0.022895249,0.00023102053,0.019834373,0.00036582726],"about_ca_topic_score_codex":0.0002132953,"about_ca_topic_score_gemma":0.000015596865,"teacher_disagreement_score":0.8464743,"about_ca_system_score_codex":0.000029682178,"about_ca_system_score_gemma":0.00008552711,"threshold_uncertainty_score":0.78301877},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5985577,0.00012695215,0.39902842,0.00022846511,0.00008347727,0.0000833789,0.000010633664,0.00005698602,0.0018239811],"genre_scores_gemma":[0.9160254,0.0003378473,0.08323284,0.00016753368,0.0000674584,0.000015040728,0.000004468796,0.000013399649,0.00013598832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991581,0.000025190719,0.0001999542,0.00035009853,0.000060775652,0.00020592111],"domain_scores_gemma":[0.9992804,0.00019373135,0.00014875595,0.00025227742,0.000051905507,0.00007296619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029586864,0.00012883378,0.00021520417,0.000036571637,0.00022873527,0.00018006422,0.00015445915,0.00008151261,0.0000060919187],"category_scores_gemma":[0.00013368513,0.00013384096,0.000025029765,0.00010914778,0.000011390054,0.00022948488,0.00015669604,0.00030010313,0.000012365919],"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.0000055757178,0.00017951951,0.002692568,0.00017085318,0.000046827,0.0000057458565,0.004162725,0.020154443,0.00024340692,0.90172267,0.000011839417,0.07060385],"study_design_scores_gemma":[0.00017988257,0.00002473322,0.0014233772,0.00006748232,0.000004140566,0.00002283148,0.00012092641,0.9228461,0.0005013239,0.07353599,0.0011077505,0.00016548068],"about_ca_topic_score_codex":0.00000749775,"about_ca_topic_score_gemma":0.0000020000527,"teacher_disagreement_score":0.90269166,"about_ca_system_score_codex":0.000021956257,"about_ca_system_score_gemma":0.000031591393,"threshold_uncertainty_score":0.54578763},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012790125,0.000033436376,0.98175716,0.011080693,0.001001138,0.000103825805,0.00035085512,0.00007901502,0.0043148454],"genre_scores_gemma":[0.90659314,0.00010163476,0.091633536,0.00037001463,0.00012814051,0.000015012277,0.0001814853,0.000011763808,0.0009652841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981817,0.00015339389,0.00032998557,0.0005527885,0.00051584764,0.0002662938],"domain_scores_gemma":[0.9983075,0.00034007215,0.00018403376,0.0002759027,0.00073247624,0.0001599785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021815165,0.00022965776,0.00020653516,0.00013907396,0.00026770792,0.0008802247,0.00047576125,0.00008471689,0.00016084842],"category_scores_gemma":[0.00040075896,0.00020928589,0.0000399389,0.00019840419,0.00013454283,0.00039036208,0.00019748049,0.00033489242,0.000025956371],"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.000048917427,0.000056572997,0.000046360637,0.000005994243,0.000023021074,0.00011294997,0.0006875971,0.009800689,0.00026192446,0.72891784,0.00022991357,0.2598082],"study_design_scores_gemma":[0.000038477,0.00012707783,0.00012756963,0.00007658726,0.0000071136474,0.000057372556,0.00028078153,0.6956477,0.0006063792,0.30276766,0.00010068966,0.00016258564],"about_ca_topic_score_codex":0.00007061971,"about_ca_topic_score_gemma":0.00019111551,"teacher_disagreement_score":0.90531415,"about_ca_system_score_codex":0.000062272935,"about_ca_system_score_gemma":0.0002668548,"threshold_uncertainty_score":0.8534431},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.98514e-7,0.00032749915,0.14922997,0.00041540473,0.00060222106,0.00021837113,0.000043748165,0.00032048792,0.8488413],"genre_scores_gemma":[0.00005521799,0.00014974005,0.0034313623,0.00028796648,0.00028875063,6.5690716e-7,0.000010627018,0.00003182207,0.9957439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981251,0.000080260164,0.00019935028,0.0007572746,0.00047478493,0.0003632308],"domain_scores_gemma":[0.9981032,0.00022106526,0.00024788914,0.0010127366,0.00015974465,0.00025537514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017589047,0.00039443193,0.00033753004,0.00007775642,0.00079139764,0.00043156272,0.002567178,0.00023183216,0.0000025311876],"category_scores_gemma":[0.000021077793,0.00035337746,0.0002518154,0.000017014816,0.0003308786,0.00015424845,0.0012788286,0.0009992226,0.0000916162],"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.0000063330026,0.0000022982324,3.0699874e-7,0.000013154504,0.000070270864,0.0003139813,0.000050354716,0.0000021618193,0.0000030508868,0.9271191,0.027155159,0.045263823],"study_design_scores_gemma":[0.00023881017,0.000058417278,0.000005875217,0.000063777064,0.000045169036,0.000037795937,0.000012051831,0.018037537,0.00004645539,0.00018527084,0.98085064,0.00041821421],"about_ca_topic_score_codex":0.00013288857,"about_ca_topic_score_gemma":8.6089125e-7,"teacher_disagreement_score":0.9536955,"about_ca_system_score_codex":0.00009925287,"about_ca_system_score_gemma":0.00019985414,"threshold_uncertainty_score":0.9998918},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15486044,0.000056533016,0.8427255,0.0015615214,0.0000732685,0.000012172662,1.5038266e-7,0.000057616486,0.0006527908],"genre_scores_gemma":[0.61652935,0.0000020584514,0.38235354,0.0006571319,0.000021276828,0.0000010515774,3.4688847e-7,0.000004563718,0.00043067557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910206,0.00008650811,0.00014430158,0.00025332515,0.00015624348,0.000257576],"domain_scores_gemma":[0.9994693,0.00008428046,0.00002861585,0.00034481427,0.000030221558,0.000042760363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025484807,0.00007481613,0.00008232688,0.000018658293,0.00020418887,0.0003304904,0.00030786466,0.000024129235,0.000015317057],"category_scores_gemma":[0.000043961143,0.000055357552,0.000037741673,0.0003645198,0.000025417778,0.00021161327,0.0002549026,0.00013801285,0.000003118836],"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":[9.660545e-7,0.000013843461,0.00026027803,0.0000012242966,0.0000025948648,0.000018760353,0.00055059546,0.96527463,0.0019844642,0.021277528,0.000028863275,0.01058625],"study_design_scores_gemma":[0.00011193187,0.0000055855858,0.00010639584,0.0000120812365,0.0000013762046,0.000018319435,0.00007707909,0.99456084,0.0031976192,0.0016130381,0.00021248052,0.00008323722],"about_ca_topic_score_codex":0.00039911256,"about_ca_topic_score_gemma":0.000038867234,"teacher_disagreement_score":0.4616689,"about_ca_system_score_codex":0.000023720184,"about_ca_system_score_gemma":0.000096316195,"threshold_uncertainty_score":0.31869268},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027834993,0.69504225,0.23881945,0.010861404,0.0035896457,0.007509011,0.000093174596,0.0011404152,0.015109646],"genre_scores_gemma":[0.483412,0.48056453,0.012466636,0.0107822325,0.0063018003,0.004113746,0.0004921707,0.0003631858,0.0015037035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898447,0.0022624822,0.00181037,0.0028821141,0.0018511603,0.0013491805],"domain_scores_gemma":[0.9930438,0.001126215,0.0011218835,0.0035621156,0.00045714178,0.00068887655],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0017979289,0.0013792128,0.0057370095,0.00012776128,0.0001400302,0.0006657003,0.0037311083,0.00022916152,0.000039695642],"category_scores_gemma":[0.0021982386,0.001134096,0.0017437162,0.0019017494,0.00017713771,0.0004958828,0.004082831,0.0042815288,0.00060926087],"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.00002484261,0.010638684,0.00086528313,0.23970202,0.0008807847,0.0013045742,0.0009835158,0.0023036844,0.004637452,0.34444472,0.032890685,0.36132374],"study_design_scores_gemma":[0.0008620278,0.00034774502,0.00046733362,0.24681447,0.00081698404,0.00008020705,0.000015003162,0.5521704,0.0004288677,0.026083987,0.16852763,0.003385356],"about_ca_topic_score_codex":0.00031252112,"about_ca_topic_score_gemma":0.0000040503373,"teacher_disagreement_score":0.5498667,"about_ca_system_score_codex":0.0003053546,"about_ca_system_score_gemma":0.00075701356,"threshold_uncertainty_score":0.9998959},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48078477,0.0002529394,0.45073202,0.03903157,0.00071017805,0.0001821296,0.0000151720715,0.0004968525,0.027794361],"genre_scores_gemma":[0.9807755,0.0000060884768,0.013276547,0.0024558203,0.000032180797,0.000002587902,0.000006319594,0.000005227349,0.0034397605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987753,0.00031165464,0.00017690276,0.00030563513,0.0002652768,0.0001652011],"domain_scores_gemma":[0.9990274,0.00015310838,0.000053600037,0.00058819534,0.0001043368,0.0000733673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006108284,0.00008459009,0.00014046936,0.00003400642,0.000058648722,0.000048586426,0.00040957765,0.000044755085,0.00043976353],"category_scores_gemma":[0.00021070268,0.000069096044,0.00006801333,0.00028500412,0.000038072525,0.00010319412,0.0003042256,0.00020068475,0.000007660618],"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.000023643273,0.0006703581,0.046323784,0.00015679924,0.00016225303,0.00020917537,0.009267555,0.0022844702,0.018211974,0.49450237,0.0062902365,0.42189738],"study_design_scores_gemma":[0.0034744604,0.00070352555,0.29486862,0.000113698195,0.00005966088,0.00031512624,0.0033476916,0.24341473,0.1524823,0.18103158,0.11830586,0.0018827618],"about_ca_topic_score_codex":0.00025155576,"about_ca_topic_score_gemma":0.00009106572,"teacher_disagreement_score":0.49999067,"about_ca_system_score_codex":0.000017831228,"about_ca_system_score_gemma":0.00008364076,"threshold_uncertainty_score":0.48151022},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008406205,0.0005915348,0.97593904,0.0011589484,0.00015416289,0.00024694015,0.0000052213936,0.00016600516,0.013331952],"genre_scores_gemma":[0.19162445,0.0009323713,0.7603261,0.00047459657,0.00024340741,0.000046946407,0.00020041865,0.00007767754,0.04607402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984337,0.00007197747,0.0003449016,0.0006882406,0.00024871237,0.00021245607],"domain_scores_gemma":[0.99936414,0.00007425781,0.00013797753,0.00017230978,0.00010594604,0.00014535498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028266737,0.00027450465,0.00035124307,0.0002900079,0.0003282667,0.0002126578,0.00018198736,0.00013124125,0.000017453107],"category_scores_gemma":[0.000025005813,0.0003071301,0.000033735923,0.00016253542,0.00007257604,0.000234547,0.00043862642,0.00048467115,0.0000031435713],"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.0000043411687,0.000029297444,0.00012280486,0.0001311028,0.000024070112,0.000012384584,0.0019625092,0.4213338,0.0000063581742,0.4666708,0.00016695193,0.109535575],"study_design_scores_gemma":[0.00017788855,0.00006860158,0.0009251403,0.00012427899,0.000010796876,0.000025343217,0.000036376936,0.95840627,0.0000010089776,0.03903609,0.0008605547,0.00032766638],"about_ca_topic_score_codex":0.000044759083,"about_ca_topic_score_gemma":0.00006511181,"teacher_disagreement_score":0.5370725,"about_ca_system_score_codex":0.000020171023,"about_ca_system_score_gemma":0.00006116922,"threshold_uncertainty_score":0.9999381},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28949967,0.00022976712,0.7089349,0.00010057564,0.00052086584,0.00011213443,0.000005202753,0.00032139395,0.0002754817],"genre_scores_gemma":[0.9910149,0.0000968172,0.0058158655,0.00007653376,0.00015517007,0.0000012141824,0.0001280862,0.000027300825,0.0026841373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997422,0.00042139087,0.00022668896,0.0013325536,0.00016134958,0.00043604046],"domain_scores_gemma":[0.9983744,0.00016033184,0.00032470364,0.0007641695,0.0001923129,0.00018406642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003169922,0.00037853088,0.00039369127,0.00021008097,0.00038342262,0.0006154769,0.0011435025,0.0002905399,0.000042327243],"category_scores_gemma":[0.00017138121,0.00046230594,0.00020811171,0.00063505146,0.000079377794,0.00040199934,0.0016737856,0.0011136709,0.000024588004],"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.0000066893454,0.00008986,0.0028464561,0.0000949896,0.00010274534,0.00018829915,0.0010215617,0.9830816,0.00020321092,0.009394942,0.00030055406,0.002669102],"study_design_scores_gemma":[0.00031607042,0.00005434482,0.00039343664,0.00013690935,0.000056560002,0.000008466538,0.00016215119,0.99496436,0.000109873145,0.002722384,0.0005452318,0.0005302326],"about_ca_topic_score_codex":0.0007188436,"about_ca_topic_score_gemma":0.00003676135,"teacher_disagreement_score":0.70311904,"about_ca_system_score_codex":0.00016187955,"about_ca_system_score_gemma":0.00021033513,"threshold_uncertainty_score":0.99978286},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22270454,0.00016785183,0.74918634,0.0011074655,0.0001552829,0.00009488367,0.0000029676632,0.0008151003,0.025765581],"genre_scores_gemma":[0.98593444,0.000029028912,0.010659431,0.0001309761,0.0000725207,0.000013714859,0.000035772708,0.000018808942,0.0031053144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798244,0.00059069204,0.00018499185,0.0006038086,0.00025032298,0.00038772754],"domain_scores_gemma":[0.9982083,0.0009534204,0.00015199087,0.00027583336,0.00024961703,0.00016085256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007277988,0.00022151165,0.00022572457,0.000089413785,0.0009823433,0.00052367884,0.00027748224,0.00007492203,0.00009167589],"category_scores_gemma":[0.002175063,0.00020040432,0.000036284084,0.0004950068,0.00016124707,0.00026225825,0.00023544463,0.0011970571,0.0000616066],"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.000019678087,0.00006426429,0.017233497,0.00003484018,0.000037487505,0.00020226768,0.0012289486,0.003984567,0.004067417,0.7620209,0.000037337857,0.2110688],"study_design_scores_gemma":[0.0034351815,0.00327109,0.05106119,0.0025160867,0.00013476938,0.0017387903,0.004742176,0.78203756,0.02031051,0.10722935,0.020568019,0.002955259],"about_ca_topic_score_codex":0.00000823212,"about_ca_topic_score_gemma":0.000001994898,"teacher_disagreement_score":0.778053,"about_ca_system_score_codex":0.000029782856,"about_ca_system_score_gemma":0.00023762384,"threshold_uncertainty_score":0.8172251},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20837925,0.00022368738,0.7813597,0.00072692387,0.00024198863,0.00008929834,1.650335e-7,0.00023564321,0.008743345],"genre_scores_gemma":[0.9895741,0.000008715325,0.0076486114,0.00017453152,0.000058552243,0.000010627096,0.0000058117043,0.000009315093,0.0025097318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986739,0.00042325954,0.00014627515,0.00038465793,0.00013988765,0.00023197851],"domain_scores_gemma":[0.9990638,0.0005121085,0.00008802529,0.00020971138,0.000071928844,0.000054458273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004989504,0.00013668396,0.00015152384,0.00005453868,0.00022227142,0.00026270354,0.00016680954,0.00004868591,0.00002571237],"category_scores_gemma":[0.00038971947,0.000113823706,0.000021965574,0.00031038982,0.00005263436,0.00023250973,0.00010202287,0.0008013946,0.0000069901866],"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.00007786448,0.00007214249,0.014391176,0.000025248935,0.000024409066,0.000105262625,0.0026252407,0.2248852,0.0004379823,0.22306022,0.00001760054,0.5342777],"study_design_scores_gemma":[0.00032162166,0.00011722194,0.014829961,0.000066270564,0.0000036970405,0.000050400395,0.0003600048,0.98227865,0.00002672965,0.0016844072,0.000102615115,0.00015845348],"about_ca_topic_score_codex":0.0000072963107,"about_ca_topic_score_gemma":0.000020479509,"teacher_disagreement_score":0.78119487,"about_ca_system_score_codex":0.000016858605,"about_ca_system_score_gemma":0.000055315526,"threshold_uncertainty_score":0.46415958},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012144372,0.000030637064,0.99110425,0.0005424715,0.00041114117,0.000035852332,4.7116157e-7,0.00020747056,0.0064532775],"genre_scores_gemma":[0.32988048,0.000007894876,0.6516169,0.00047879867,0.0003764506,0.000013741799,0.000019208368,0.000012861547,0.01759371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994252,0.00003509546,0.00007979078,0.00022536074,0.00009130246,0.0001432639],"domain_scores_gemma":[0.99947643,0.00019680367,0.000034056873,0.00013931672,0.00011531223,0.000038059174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120141136,0.00005910573,0.00007158864,0.000025652116,0.00018855542,0.00011422078,0.000119042226,0.00002718464,0.000032085645],"category_scores_gemma":[0.00025513404,0.0000552825,0.000044521024,0.00014968427,0.0000055971473,0.00011538546,0.00008167885,0.00014745112,0.000022439839],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007717221,0.000034398072,0.00033324969,0.000017671768,0.000023886823,0.000004720311,0.00028437996,0.0092363525,0.0010621327,0.09487262,0.00052091415,0.89360195],"study_design_scores_gemma":[0.0003058017,0.0001222646,0.0015246414,0.000010660735,0.000008338646,0.000014215131,0.00013651636,0.8115172,0.0024783532,0.0075340285,0.17618407,0.0001639006],"about_ca_topic_score_codex":0.000006798799,"about_ca_topic_score_gemma":0.0000016254965,"teacher_disagreement_score":0.89343804,"about_ca_system_score_codex":0.000012705709,"about_ca_system_score_gemma":0.000040912597,"threshold_uncertainty_score":0.2254355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020753154,0.00054712076,0.9889223,0.0032545358,0.00038175116,0.00015996085,0.0000054000384,0.00043677684,0.006084629],"genre_scores_gemma":[0.36109826,0.000002164683,0.6264121,0.00052855257,0.00020018293,0.000070202615,0.00009068135,0.00001794928,0.011579878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839485,0.0002862224,0.00015600053,0.00054357597,0.00026622007,0.00035313817],"domain_scores_gemma":[0.99888587,0.00029518572,0.000046712696,0.00045500556,0.00018178514,0.00013541167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006476123,0.0001563404,0.00023793483,0.00005004906,0.000250588,0.000396742,0.00042073303,0.00008169512,0.000010555744],"category_scores_gemma":[0.00037242429,0.00013070757,0.00013060446,0.00032147544,0.000024941937,0.00012335065,0.00013022954,0.0003587342,0.000011549762],"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.000032456694,0.0009079796,0.0055723316,0.0012421996,0.00012756312,0.00011783075,0.00024969797,0.1510462,0.001178065,0.74632436,0.013185845,0.08001544],"study_design_scores_gemma":[0.00044051537,0.0000552328,0.00011986483,0.000012980872,0.000007263832,0.000032382068,0.00002324794,0.95328367,0.0006786433,0.00018172902,0.044984184,0.00018027335],"about_ca_topic_score_codex":0.000066526016,"about_ca_topic_score_gemma":0.0000027875994,"teacher_disagreement_score":0.80223745,"about_ca_system_score_codex":0.000025217409,"about_ca_system_score_gemma":0.00010331975,"threshold_uncertainty_score":0.53301},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6178568,0.000007583748,0.38123283,0.000078107325,0.00015409681,0.0000405111,0.000001256564,0.000030710733,0.000598093],"genre_scores_gemma":[0.9986802,0.00000258251,0.00066097616,0.000098971555,0.000013121059,1.3677231e-7,0.0000015414889,0.0000046095706,0.000537873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989112,0.00027693072,0.00012548993,0.00041161096,0.000096733915,0.0001780235],"domain_scores_gemma":[0.9991449,0.00013940585,0.0000848262,0.0005177782,0.000066754204,0.00004629732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030668438,0.0000962684,0.00011928603,0.00007618061,0.0001110891,0.00001929752,0.00037680232,0.000045301604,0.000013007636],"category_scores_gemma":[0.00006504116,0.00008387577,0.00007523394,0.00085055054,0.00005903051,0.000084572916,0.00023784871,0.00025642308,0.000008451404],"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.00002090757,0.00010136448,0.0075281947,0.0000073947617,0.0000073855067,0.000035497622,0.00021761472,0.9044794,0.00006390787,0.08727524,0.000013404487,0.00024970798],"study_design_scores_gemma":[0.00034071933,0.00007926116,0.042062677,0.000040482853,0.000005866256,0.0000023197822,0.000115644296,0.95201063,0.0005402629,0.0046448065,0.00006194968,0.000095372015],"about_ca_topic_score_codex":0.00023618803,"about_ca_topic_score_gemma":0.000015746984,"teacher_disagreement_score":0.38082337,"about_ca_system_score_codex":0.00008259735,"about_ca_system_score_gemma":0.00010404824,"threshold_uncertainty_score":0.34203544},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43755227,0.0003775249,0.4069273,0.14196704,0.0005498421,0.00066150265,0.000003647696,0.0004178246,0.011543059],"genre_scores_gemma":[0.99678916,0.000032204538,0.0011431768,0.0016047619,0.00020503034,0.0000057765533,0.0000058704372,0.000005724205,0.0002082803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813294,0.00034858924,0.00032444997,0.0004210444,0.00051404134,0.00025891865],"domain_scores_gemma":[0.9990192,0.00031019383,0.00010074477,0.00037460588,0.00007896854,0.00011628777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000791165,0.00014875173,0.00020686453,0.000044094108,0.00009122969,0.00014071897,0.001086178,0.000059853082,0.00021068814],"category_scores_gemma":[0.0007276601,0.00009153779,0.00003644849,0.0008422554,0.00006808299,0.00026649336,0.0001124401,0.00040220076,0.00015942052],"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.00023105758,0.00020166172,0.0051019713,0.000071738104,0.000018403878,0.00015928359,0.07650328,0.0005158891,0.005677591,0.037000727,0.005747601,0.8687708],"study_design_scores_gemma":[0.0015348069,0.0014150143,0.0756369,0.0001253677,0.000018271578,0.000019850397,0.00041165404,0.89504117,0.0021463456,0.0052274363,0.018009089,0.00041410807],"about_ca_topic_score_codex":0.00008643723,"about_ca_topic_score_gemma":0.000012743818,"teacher_disagreement_score":0.8945253,"about_ca_system_score_codex":0.000015653515,"about_ca_system_score_gemma":0.000057802878,"threshold_uncertainty_score":0.3732803},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5467657,0.0000041047706,0.4525748,0.00015193856,0.00007118427,0.00024629457,0.000006591719,0.00013538953,0.000044037188],"genre_scores_gemma":[0.9390904,8.5274246e-7,0.060505107,0.00012998797,0.000106538995,0.000037231053,0.00005843905,0.0000289848,0.00004249326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794155,0.0002821352,0.00024786373,0.00090267084,0.00025811896,0.00036764378],"domain_scores_gemma":[0.99898297,0.0002314953,0.000021392158,0.00060200976,0.00006125946,0.000100862846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003314623,0.0002517614,0.00029717395,0.00012831784,0.00034118045,0.00061608426,0.00054275343,0.000082418126,0.000022138262],"category_scores_gemma":[0.000020018595,0.00020052731,0.000030770447,0.00028658166,0.000023555303,0.0008325595,0.00007387385,0.00055644364,0.0000018200741],"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.0024495407,0.009017435,0.025496492,0.00061643746,0.00048830063,0.023675075,0.10941013,0.07587275,0.01642815,0.003372884,0.000014270767,0.7331585],"study_design_scores_gemma":[0.0058583403,0.0052654115,0.0122666145,0.0005687289,0.0001116959,0.0017796154,0.020086726,0.6940385,0.25789088,0.00027005412,0.00035098536,0.0015124693],"about_ca_topic_score_codex":0.00022334474,"about_ca_topic_score_gemma":0.00036739963,"teacher_disagreement_score":0.73164606,"about_ca_system_score_codex":0.00002756823,"about_ca_system_score_gemma":0.000074136966,"threshold_uncertainty_score":0.8177267},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011703762,0.00014306307,0.9837835,0.0015058593,0.00070809986,0.00008521359,0.0000041525827,0.00011577723,0.0019505966],"genre_scores_gemma":[0.97895986,0.000043670847,0.020482406,0.00008854523,0.00007752008,0.000011620894,0.0000066580587,0.0000066012553,0.0003231109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984262,0.00015669323,0.0005060093,0.00038282495,0.00026354974,0.00026472614],"domain_scores_gemma":[0.9988704,0.00022906066,0.00011537623,0.0005249449,0.00018954449,0.000070721144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036410821,0.00011323339,0.00018983493,0.00018898108,0.00011848461,0.00009219883,0.00054334407,0.000065371154,0.00008682872],"category_scores_gemma":[0.00047527117,0.00011754345,0.000090324866,0.0013777084,0.00009107994,0.00020274054,0.00018034302,0.00028799273,0.000043606386],"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.0000075951702,0.00024420593,0.00043939048,0.000026073374,0.00001636315,0.000078688485,0.0031362022,0.13418524,0.003117717,0.72105724,0.00011107754,0.13758023],"study_design_scores_gemma":[0.00003355698,0.00004140624,0.00041825636,0.000108961925,0.00000546745,0.000026821108,0.0009631577,0.8492627,0.025378486,0.12291241,0.0006844457,0.00016429415],"about_ca_topic_score_codex":0.0004715599,"about_ca_topic_score_gemma":0.00036134466,"teacher_disagreement_score":0.9672561,"about_ca_system_score_codex":0.000048315236,"about_ca_system_score_gemma":0.00015086246,"threshold_uncertainty_score":0.4793283},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13117884,0.00008031986,0.8682694,0.00006867898,0.00021337644,0.000101148915,0.0000030381784,0.000074966054,0.000010248753],"genre_scores_gemma":[0.84461874,0.000007744777,0.15528452,0.000016149359,0.00004383307,0.000003268337,0.0000040103578,0.000006993,0.000014723665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888283,0.00015657135,0.00025402367,0.00035273706,0.00022507811,0.00012875978],"domain_scores_gemma":[0.99897766,0.00017951003,0.00005729059,0.00045036056,0.0002855348,0.000049642946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020985547,0.000106560896,0.00015090706,0.00011639501,0.0001921454,0.00010779869,0.00019111313,0.000033817207,0.0000012942411],"category_scores_gemma":[0.000011829454,0.0001087199,0.00004766035,0.00023705029,0.000016735305,0.00021919573,0.000018214841,0.0001615716,0.0000017390926],"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.00000556017,0.000077122306,0.0000053070326,0.00002575959,0.0000148750705,0.000001824,0.00024449342,0.9309022,0.000070323564,0.00096192234,1.5931846e-7,0.06769049],"study_design_scores_gemma":[0.0002492976,0.00009743077,0.000017628985,0.00007709061,0.000013488163,0.000019504185,0.000027762078,0.9977935,0.00021602433,0.0013777814,0.0000035146513,0.00010699428],"about_ca_topic_score_codex":0.00007582865,"about_ca_topic_score_gemma":7.204037e-7,"teacher_disagreement_score":0.7134399,"about_ca_system_score_codex":0.00002958483,"about_ca_system_score_gemma":0.000059457056,"threshold_uncertainty_score":0.44334686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022377567,0.000047831014,0.9646165,0.0011537236,0.00008513291,0.000034085417,0.0000011838443,0.00039536355,0.011288623],"genre_scores_gemma":[0.83490163,0.000006211431,0.16246518,0.00021428919,0.000069867696,0.0000062815643,0.000023415025,0.000011232917,0.0023018941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999006,0.000110549445,0.000093050505,0.00034393027,0.00019385536,0.0002526457],"domain_scores_gemma":[0.99939436,0.00010822637,0.000050680243,0.00025850462,0.00010903088,0.00007920935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011077267,0.00011098429,0.00012699656,0.000030265066,0.00021934627,0.00019000725,0.000251437,0.000033119624,0.00007839193],"category_scores_gemma":[0.000088245055,0.000086633416,0.00002568732,0.00041997124,0.000020107744,0.00025140718,0.00017657886,0.0003228295,0.000060778304],"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.000020981468,0.00033028715,0.012557674,0.00003894159,0.00017233237,0.0010125074,0.0023930108,0.017595278,0.0022158173,0.07970702,0.00057185494,0.8833843],"study_design_scores_gemma":[0.0016242717,0.00038647815,0.01110559,0.0000839019,0.00001688976,0.0003987357,0.00063976384,0.94687515,0.018301621,0.0008165865,0.019067258,0.00068375765],"about_ca_topic_score_codex":0.00006615196,"about_ca_topic_score_gemma":0.000018569666,"teacher_disagreement_score":0.92927986,"about_ca_system_score_codex":0.00004108559,"about_ca_system_score_gemma":0.0001350704,"threshold_uncertainty_score":0.35328084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058524087,0.000026928867,0.9911589,0.00086599233,0.000054015407,0.00003588574,0.0000016290396,0.0001159265,0.001888332],"genre_scores_gemma":[0.41605383,0.00001491864,0.56820893,0.00025088017,0.00012466923,0.0000058228306,0.00003837273,0.000008356431,0.015294235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939436,0.00003222816,0.000055040946,0.00033061323,0.0000741293,0.000113651535],"domain_scores_gemma":[0.99963695,0.00006778167,0.000022784036,0.00019702995,0.000040835424,0.000034601748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015146029,0.00005106914,0.00006152571,0.000020808437,0.00015450665,0.0001213796,0.00016215429,0.00002254829,0.0000071801105],"category_scores_gemma":[0.000097403885,0.000046302674,0.000010880334,0.00010476769,0.0000069481353,0.00034722133,0.00031209856,0.00012085511,0.0000020372302],"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.000010767311,0.000065194254,0.000674919,0.000027050744,0.000044931174,0.0000064849896,0.0010599218,0.08072506,0.003076845,0.04617673,0.0040312232,0.8641009],"study_design_scores_gemma":[0.00016384992,0.000030252659,0.0002960835,0.0000026958696,0.000003042302,0.000021063921,0.00003252186,0.9934135,0.00056717754,0.0010573704,0.0043463157,0.00006613089],"about_ca_topic_score_codex":0.000021416594,"about_ca_topic_score_gemma":0.000015916186,"teacher_disagreement_score":0.91268843,"about_ca_system_score_codex":0.0000064863457,"about_ca_system_score_gemma":0.000060380265,"threshold_uncertainty_score":0.18881682},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012631256,0.0009045778,0.9428683,0.000047527432,0.00029970883,0.00007268301,0.00000530989,0.000089487454,0.043081157],"genre_scores_gemma":[0.99685,0.000030555246,0.0024038418,0.000020745088,0.000022091317,0.0000039247498,0.00003615395,0.0000021556582,0.0006305463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991813,0.00018237272,0.00031092422,0.00009015535,0.00012929522,0.00010600536],"domain_scores_gemma":[0.99916124,0.00006477844,0.00014229344,0.0001814776,0.00039451342,0.00005568634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005991665,0.00007211404,0.00016366332,0.00007419771,0.00010060468,0.00014208801,0.00015826088,0.000041307245,0.000003398053],"category_scores_gemma":[0.0001253672,0.000064921376,0.000026768852,0.0002758492,0.00003075425,0.0010705983,0.00013201754,0.0001134388,0.000049228838],"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.000013659359,0.00015011561,0.02834709,0.0011793956,0.000080546415,0.0000024323756,0.035289586,0.05226162,0.00014987959,0.6317839,0.0020737287,0.24866806],"study_design_scores_gemma":[0.00018684646,0.000020853966,0.008182041,0.000021105827,0.0000013617857,0.00001474394,0.00011170683,0.97891015,0.00005589762,0.00009591159,0.012323055,0.0000763204],"about_ca_topic_score_codex":0.00006306011,"about_ca_topic_score_gemma":0.000015211937,"teacher_disagreement_score":0.9842187,"about_ca_system_score_codex":0.000010136056,"about_ca_system_score_gemma":0.000056467525,"threshold_uncertainty_score":0.2647417},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009715716,0.0014409457,0.99134034,0.001159329,0.0017761422,0.00030416832,0.000006313726,0.0002464331,0.0036291778],"genre_scores_gemma":[0.1305405,0.0002692145,0.86206555,0.0008603281,0.0013322234,0.000014475157,0.00005405939,0.00011402022,0.0047496376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534214,0.00025453628,0.00068955333,0.001604717,0.0013851791,0.00072385004],"domain_scores_gemma":[0.9966367,0.00096670806,0.0006409547,0.0012483995,0.0003392024,0.00016806307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016659512,0.00060637464,0.0007229867,0.0004910325,0.0007841041,0.0010012644,0.0029347672,0.0003387815,0.000020533664],"category_scores_gemma":[0.0002576488,0.00047754875,0.00021731034,0.001196721,0.00058112165,0.00047918985,0.0012100451,0.0016315877,0.0000073552123],"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.0000039155525,0.00008652842,0.00039035676,0.0001583613,0.00007478211,0.00009987988,0.003541644,0.04068274,0.00017636528,0.005956618,0.00009696797,0.94873184],"study_design_scores_gemma":[0.0002567464,0.00015182082,0.000086492306,0.00038232887,0.000025065965,0.000091756825,0.0000010652647,0.97894865,0.0016483665,0.0066728424,0.011104769,0.0006300664],"about_ca_topic_score_codex":0.00012707883,"about_ca_topic_score_gemma":0.000043234024,"teacher_disagreement_score":0.94810176,"about_ca_system_score_codex":0.00025946734,"about_ca_system_score_gemma":0.0006507772,"threshold_uncertainty_score":0.9997676},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025738928,0.000064173284,0.953275,0.010391044,0.00022842141,0.00022169805,0.0000010821531,0.00039708192,0.009682554],"genre_scores_gemma":[0.053817783,0.0000038892786,0.92556894,0.006074481,0.00039136637,0.000051204865,0.0000070407527,0.000015981368,0.014069287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988114,0.00007004512,0.00017756748,0.00041224403,0.0002506233,0.0002781167],"domain_scores_gemma":[0.9992297,0.000053133448,0.00003579612,0.00044110336,0.000112127374,0.000128114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024890734,0.00011614656,0.00014527942,0.000031508847,0.00012868334,0.00031625095,0.0004374958,0.00003875506,0.00023944138],"category_scores_gemma":[0.00011508069,0.000102758444,0.00003628857,0.00031411787,0.00000904222,0.00013543406,0.00035852988,0.00017682642,0.000422027],"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.0000065889008,0.00046274625,0.0005633436,0.000046429243,0.00006537781,0.00007814837,0.0013543547,0.0037635749,0.050239235,0.034647327,0.0030227285,0.90575016],"study_design_scores_gemma":[0.00045425465,0.00014705732,0.00021648183,0.000039428618,0.000006372219,0.000033683194,0.0000258452,0.9108215,0.0616972,0.0014465284,0.024755081,0.000356583],"about_ca_topic_score_codex":0.00006638388,"about_ca_topic_score_gemma":0.00001688824,"teacher_disagreement_score":0.9070579,"about_ca_system_score_codex":0.000013879097,"about_ca_system_score_gemma":0.00007544829,"threshold_uncertainty_score":0.5424444},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44774368,0.00011094233,0.4322343,0.01953469,0.0060368553,0.00044597956,0.0000083602845,0.010619705,0.08326551],"genre_scores_gemma":[0.9778212,0.0000060713423,0.0065710894,0.00015992396,0.00033719453,0.00001377181,0.000008136609,0.000015146251,0.015067516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998997,0.00007211611,0.00008122302,0.00032091746,0.00022417361,0.00030462138],"domain_scores_gemma":[0.9995226,0.00003450659,0.000046361834,0.00029324376,0.000032689597,0.00007059135],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012670291,0.000105545914,0.000117192656,0.000081290214,0.00020833722,0.000119954595,0.0005473371,0.000021678426,0.000015068596],"category_scores_gemma":[0.00005407093,0.00009815204,0.00006862456,0.00070502656,0.000024728188,0.0003206451,0.0002942738,0.0003047374,0.0016078942],"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.000013450145,0.00015483478,0.0007036952,0.000027744252,0.00009218142,0.000098362456,0.008637092,0.019176975,0.010959103,0.06050002,0.10995901,0.78967756],"study_design_scores_gemma":[0.0001828426,0.00008465792,0.006469612,0.000010472169,0.0000034888822,0.0000030818017,0.00010397563,0.8589856,0.0012741871,0.0011775292,0.13151246,0.00019210407],"about_ca_topic_score_codex":0.000034495177,"about_ca_topic_score_gemma":3.050515e-7,"teacher_disagreement_score":0.8398086,"about_ca_system_score_codex":0.000014011331,"about_ca_system_score_gemma":0.000023041997,"threshold_uncertainty_score":0.99916947},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000028374427,0.00041657285,0.12975332,0.0005487389,0.00070872746,0.0002909463,0.00007110733,0.00036498392,0.8678428],"genre_scores_gemma":[0.000082645514,0.00021856585,0.0033080122,0.00031920735,0.00034025512,0.0000010186668,0.000016384047,0.00004124914,0.99567264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977649,0.00009450949,0.00024274072,0.0008947153,0.00056937884,0.00043377624],"domain_scores_gemma":[0.99775845,0.00024803026,0.0003010123,0.0011760283,0.00019589688,0.00032057118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020104724,0.0004772656,0.0004063394,0.000094222334,0.0009035326,0.00048725313,0.0028958987,0.00027773483,0.0000034416057],"category_scores_gemma":[0.000025041541,0.0004338304,0.00030129676,0.000021838863,0.00039303736,0.00018796205,0.0014484812,0.0011552612,0.00011791978],"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.000010443821,0.0000040353984,8.192428e-7,0.000019551204,0.00009187881,0.0003919001,0.000078303965,0.0000046442315,0.0000059497597,0.93615675,0.02600359,0.03723212],"study_design_scores_gemma":[0.0003085114,0.00007073968,0.0000106457,0.00008523139,0.000065214095,0.000040980594,0.000015228583,0.01819663,0.00006131854,0.00016699311,0.9804652,0.00051332416],"about_ca_topic_score_codex":0.00022311494,"about_ca_topic_score_gemma":0.0000014386917,"teacher_disagreement_score":0.9544616,"about_ca_system_score_codex":0.0001238468,"about_ca_system_score_gemma":0.00023294943,"threshold_uncertainty_score":0.99981135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011812071,0.000030042009,0.9731899,0.006408173,0.00037638168,0.00078944414,0.0000029219282,0.00023459159,0.007156456],"genre_scores_gemma":[0.26936913,0.000043856726,0.72317255,0.0014100489,0.00025510113,0.0005870094,0.00009481491,0.00002651034,0.005040974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985239,0.0001078321,0.00037229015,0.00044106136,0.00031530834,0.00023962285],"domain_scores_gemma":[0.9983613,0.000059355043,0.00017573248,0.0012207448,0.00010348877,0.00007939176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044307584,0.00020974927,0.00021109844,0.00017684768,0.00016536968,0.0004894506,0.0010539009,0.00013036502,0.000023522169],"category_scores_gemma":[0.00007060954,0.00013155543,0.00006998639,0.00061039516,0.000019220533,0.00015381558,0.0016519233,0.0006950296,0.00004762524],"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.00000789988,0.00023834973,0.001387012,0.00020770766,0.0000373455,0.000010619422,0.028082643,0.071328856,0.0001357596,0.00951381,0.0075983903,0.8814516],"study_design_scores_gemma":[0.000111465924,0.000024778701,0.003151875,0.00018516216,0.0000045770685,0.000012645654,0.00082353543,0.987482,0.00016853494,0.00043415936,0.0073624346,0.00023881494],"about_ca_topic_score_codex":0.0024901107,"about_ca_topic_score_gemma":0.0015059661,"teacher_disagreement_score":0.91615313,"about_ca_system_score_codex":0.000090278525,"about_ca_system_score_gemma":0.00023907985,"threshold_uncertainty_score":0.5364675},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2817344,0.00014201639,0.7167492,0.000097887205,0.00089274184,0.00017265213,0.0000037719446,0.00011812396,0.00008918579],"genre_scores_gemma":[0.9748061,0.00010492388,0.023463031,0.00016023095,0.0002239621,0.0000011175799,0.000042220654,0.000021245518,0.0011772212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998293,0.00019273306,0.00017420352,0.0008960937,0.000121362165,0.0003226157],"domain_scores_gemma":[0.9983076,0.00015881822,0.0002959093,0.00086773484,0.00027925792,0.000090720314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003646581,0.00025083637,0.00024420666,0.00038948056,0.0005803454,0.0004915071,0.0013019628,0.00021572867,0.0000117504205],"category_scores_gemma":[0.00015656237,0.00023487212,0.00023461727,0.0015023147,0.000058749516,0.00039996585,0.0017063476,0.00045301247,0.0000035833727],"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.000008225958,0.000054828844,0.00350429,0.00015096973,0.00007423462,0.00004848174,0.00026016586,0.9743005,0.0004533955,0.014791326,0.00021719118,0.0061363983],"study_design_scores_gemma":[0.00026609382,0.000030970463,0.0002073828,0.00004508595,0.00007154306,0.0000046534924,0.00012674974,0.9963268,0.00022257022,0.0013827182,0.0010263508,0.00028909763],"about_ca_topic_score_codex":0.0007134065,"about_ca_topic_score_gemma":0.00002380729,"teacher_disagreement_score":0.6932862,"about_ca_system_score_codex":0.00022531366,"about_ca_system_score_gemma":0.00032631026,"threshold_uncertainty_score":0.95778066},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013485024,0.000010436871,0.9829736,0.0004453427,0.00026572344,0.0000743807,0.000003476625,0.00014648461,0.0025955373],"genre_scores_gemma":[0.9192237,0.000024895224,0.07919639,0.00048575818,0.000055373526,6.7920445e-7,0.000025154211,0.0000048654833,0.000983173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993982,0.00006119246,0.00009630397,0.00022590728,0.00005075565,0.00016764337],"domain_scores_gemma":[0.99923486,0.00007953163,0.00007017155,0.00035842447,0.00018586795,0.00007115264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001249368,0.00008677543,0.000090962974,0.00007930336,0.00015894465,0.00011805375,0.00038133253,0.00006918212,0.000039829527],"category_scores_gemma":[0.00016108678,0.000096176744,0.00006843364,0.000671367,0.00002657248,0.000573833,0.00012390057,0.000102894206,0.000044445784],"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.000004053178,0.00001381017,0.00020566063,0.000014381193,0.000010079507,0.000012060585,0.00023590468,0.038012225,0.000005804017,0.95755005,0.00018147276,0.0037544726],"study_design_scores_gemma":[0.00027050587,0.000027863143,0.00026886238,0.000012678228,0.00000961258,0.0000041233666,0.000054042914,0.7406585,0.0002522233,0.25145975,0.006856991,0.00012482543],"about_ca_topic_score_codex":0.000014961687,"about_ca_topic_score_gemma":0.0000020164468,"teacher_disagreement_score":0.9057387,"about_ca_system_score_codex":0.000035116933,"about_ca_system_score_gemma":0.00010760017,"threshold_uncertainty_score":0.39219737},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041675046,0.000015255038,0.9866679,0.003790766,0.0002692476,0.0006732113,0.000016276956,0.00012983842,0.0042700293],"genre_scores_gemma":[0.87075037,0.000006482341,0.12808853,0.0004820089,0.00008179385,0.000107006126,0.0000014785467,0.000019630637,0.00046268463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976319,0.00002741942,0.0006251904,0.0007378864,0.00047085385,0.0005067704],"domain_scores_gemma":[0.99768835,0.00038948088,0.0005339668,0.00034630788,0.0009053892,0.0001364751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007912909,0.00034096325,0.00042948616,0.00011006805,0.00035102174,0.00044767343,0.0020316055,0.00011528172,0.0000090505555],"category_scores_gemma":[0.001751269,0.0002565759,0.00017204272,0.00039893418,0.00027436772,0.0003889238,0.00031206998,0.00035951313,0.000012737743],"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.000057170895,0.0002290218,0.000006801988,0.0000415234,0.000018149482,3.5955804e-8,0.0012788296,0.016666453,0.11803138,0.7991924,0.00018827955,0.064289935],"study_design_scores_gemma":[0.000097044496,0.00031573206,0.0000016194423,0.00011845058,0.0000133989115,0.0000016043423,0.00009812311,0.8091842,0.10217485,0.08765261,0.0000871176,0.00025525878],"about_ca_topic_score_codex":0.000026517531,"about_ca_topic_score_gemma":0.000006541368,"teacher_disagreement_score":0.8665829,"about_ca_system_score_codex":0.00006258138,"about_ca_system_score_gemma":0.00012165959,"threshold_uncertainty_score":0.9999887},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005805606,0.0006177341,0.99530584,0.0012370079,0.001375987,0.00039645736,0.000009256692,0.00027830596,0.00019885795],"genre_scores_gemma":[0.035927083,0.000033004868,0.95954126,0.0032925594,0.00051268213,0.000010139702,0.000010330857,0.000046594003,0.0006263467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582237,0.000109486566,0.0005340391,0.0018981278,0.00084227964,0.0007936759],"domain_scores_gemma":[0.99693155,0.0009749961,0.000284153,0.0011838927,0.00024057903,0.00038483087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079577055,0.0006463125,0.00073890825,0.00067891023,0.00049660046,0.00080193806,0.0024979976,0.00030363144,0.000017003484],"category_scores_gemma":[0.000307878,0.0005624507,0.00007321511,0.00054620404,0.00045239125,0.00029723154,0.002114644,0.0009391722,0.000029926592],"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.000004690035,0.000030768384,0.00015863801,0.00003685316,0.000011751304,0.000026164786,0.0010260487,0.019875344,0.0010906574,0.0109863775,0.00007138249,0.9666813],"study_design_scores_gemma":[0.0007638036,0.000258376,0.00013075175,0.0004481445,0.000007843463,0.00003541299,1.9363897e-7,0.9829445,0.0010923321,0.008602592,0.0049419175,0.00077416317],"about_ca_topic_score_codex":0.0001606364,"about_ca_topic_score_gemma":0.00008302126,"teacher_disagreement_score":0.96590716,"about_ca_system_score_codex":0.00013467428,"about_ca_system_score_gemma":0.00021750575,"threshold_uncertainty_score":0.9996827},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010910489,0.00017712638,0.9952425,0.0013839253,0.00005586946,0.0013858976,0.0000074706772,0.00037850006,0.00027765566],"genre_scores_gemma":[0.65168655,0.000005003284,0.34073806,0.00013619446,0.00015794428,0.006122033,0.00023879226,0.000032961656,0.0008824646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984055,0.00016949918,0.00023237753,0.0006476166,0.0002985227,0.00024645095],"domain_scores_gemma":[0.9983156,0.00015877823,0.00020120945,0.0006384162,0.0005762358,0.00010978861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022170288,0.00018751003,0.00021418348,0.00007728547,0.00058982085,0.00023854534,0.00033036244,0.00007894646,0.0000030128504],"category_scores_gemma":[0.00004115252,0.00014724532,0.000037426726,0.00063709164,0.00004259163,0.00027919727,0.00003153395,0.00021985757,0.00001451464],"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.00048859214,0.005254841,0.014555589,0.0016421748,0.0006645611,0.00004254198,0.017200442,0.10604097,0.2283021,0.14730616,0.0017994259,0.4767026],"study_design_scores_gemma":[0.0014086252,0.00011292732,0.0012356916,0.00007643755,0.000011459241,0.000021590924,0.00048215777,0.9728338,0.003076323,0.000016755876,0.020476442,0.00024779886],"about_ca_topic_score_codex":0.00009966435,"about_ca_topic_score_gemma":0.000023599328,"teacher_disagreement_score":0.8667928,"about_ca_system_score_codex":0.00008451478,"about_ca_system_score_gemma":0.00027781373,"threshold_uncertainty_score":0.60044897},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27715334,0.00014133267,0.7186513,0.003153738,0.0005945746,0.0000638158,3.8737087e-7,0.00021620913,0.000025308998],"genre_scores_gemma":[0.52622855,0.000029382061,0.46757984,0.0047453553,0.0011378407,0.000011664393,0.000014612791,0.000031894037,0.00022087297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844944,0.0004269446,0.00021614297,0.0003619017,0.00023377097,0.00031176576],"domain_scores_gemma":[0.9993231,0.00008719736,0.00013072847,0.00029973945,0.000072276685,0.00008693531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003806764,0.0001651468,0.00016280395,0.00004678015,0.0008364969,0.0005856444,0.00023650836,0.00005257879,0.00000736128],"category_scores_gemma":[0.000023289369,0.00013452183,0.000048799597,0.0003350245,0.000045627272,0.00045313424,0.00007059104,0.00027348075,0.000004134327],"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":[4.81249e-7,0.000013857776,0.0003075738,0.000009105,0.000017146469,0.000028453918,0.001016049,0.9762396,0.013985035,0.0022559636,0.0004577287,0.0056690047],"study_design_scores_gemma":[0.00015840266,0.00003210384,0.0007567615,0.000021194273,0.000011742457,0.00006143491,0.00007824722,0.9956763,0.0021480953,0.00012097934,0.00074650475,0.00018824334],"about_ca_topic_score_codex":0.000019948993,"about_ca_topic_score_gemma":0.0000045732263,"teacher_disagreement_score":0.25107145,"about_ca_system_score_codex":0.00003909944,"about_ca_system_score_gemma":0.000075091055,"threshold_uncertainty_score":0.64337426},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04062268,0.00002070504,0.9562367,0.0014064814,0.0001256306,0.000052277628,4.569031e-7,0.00005587972,0.0014791435],"genre_scores_gemma":[0.96019065,0.000009339059,0.039617214,0.00015624029,0.00001112845,0.0000016651416,0.0000061554765,8.7089506e-7,0.000006733685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995718,0.00001946173,0.00017863873,0.00004057696,0.00012432016,0.00006521025],"domain_scores_gemma":[0.99965817,0.00004283918,0.00012388747,0.000068246634,0.000086584834,0.00002029898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020101212,0.000040186766,0.000045585995,0.000046356992,0.0002098038,0.00014007295,0.000115685325,0.000015251801,5.6274314e-7],"category_scores_gemma":[0.00003188167,0.00002919826,0.000012523179,0.00017885622,0.000046882942,0.0006412926,0.000044359433,0.000056888966,0.000010110876],"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.0000026446764,0.000007642372,0.00017213075,0.000015299916,0.000004137119,1.2844534e-7,0.002487921,0.034194417,0.000008326788,0.47750038,0.000042606036,0.48556438],"study_design_scores_gemma":[0.00050719525,0.00005989323,0.01766394,0.000019208463,0.0000015474922,0.000013982306,0.0002241149,0.91958654,0.00017489001,0.058862977,0.00280367,0.00008203709],"about_ca_topic_score_codex":0.00006569637,"about_ca_topic_score_gemma":0.0000039394004,"teacher_disagreement_score":0.91956794,"about_ca_system_score_codex":0.000010823573,"about_ca_system_score_gemma":0.00003221907,"threshold_uncertainty_score":0.16136624},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008557044,0.00030763118,0.9951684,0.0007233198,0.0011619673,0.00047714481,0.000017591326,0.0001541746,0.0011341022],"genre_scores_gemma":[0.6731956,0.000035419424,0.32349148,0.0012027423,0.00094845955,0.000045894372,0.000096586366,0.00008937221,0.0008944253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564934,0.000082920145,0.00055086106,0.0020101657,0.0009518667,0.0007548252],"domain_scores_gemma":[0.9964072,0.0013341177,0.0003470335,0.0016734828,0.00011113506,0.00012701147],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016048503,0.00049051153,0.00059902755,0.0011748635,0.0007488988,0.00057477324,0.0061464724,0.00019463294,0.000039425202],"category_scores_gemma":[0.0003968452,0.00047583753,0.000109215,0.00058500865,0.00031531372,0.0008702716,0.0054651676,0.0019355089,0.000007645676],"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.000011774572,0.000025024681,0.000136563,0.000022298475,0.000008319986,0.00005275587,0.0026776125,0.1079302,0.000042503314,0.00995314,0.00002005503,0.87911975],"study_design_scores_gemma":[0.0006824093,0.00025700277,0.00046176475,0.0003635286,0.000006365615,0.000052641964,0.000003555988,0.9345199,0.00013140179,0.0455092,0.01729329,0.0007189646],"about_ca_topic_score_codex":0.0005676799,"about_ca_topic_score_gemma":0.0007859472,"teacher_disagreement_score":0.8784008,"about_ca_system_score_codex":0.00039226798,"about_ca_system_score_gemma":0.00038729963,"threshold_uncertainty_score":0.99976933},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000026217717,0.000028258166,0.2422677,0.000078547826,0.00013102384,0.00009805007,0.000015173006,0.00019704625,0.7571816],"genre_scores_gemma":[0.0029354717,0.000019284314,0.0049876273,0.000040403203,0.00009871374,1.9030044e-7,0.000024776977,0.000023176699,0.99187034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998884,0.000057289417,0.0001712834,0.0004607828,0.00026026086,0.00016637148],"domain_scores_gemma":[0.9989177,0.000079584264,0.00028732122,0.00045055593,0.00011835633,0.00014649713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008061746,0.00023356419,0.00032362668,0.00015365942,0.00019963567,0.000059783724,0.0009940275,0.00016371989,0.0000045853076],"category_scores_gemma":[0.000021876736,0.00028439204,0.0001934536,0.00001745461,0.000111361376,0.000111850655,0.0006424009,0.00068917044,0.000018017268],"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.0000054029774,0.0000036893225,0.0000027580165,0.0000473645,0.000060470935,0.0000872591,0.00008604181,0.00006532368,0.000017298238,0.98864317,0.0026802197,0.008301],"study_design_scores_gemma":[0.00024513705,0.00008635163,0.000009886637,0.0000922371,0.00005520519,0.000009255894,0.000009632415,0.024087302,0.00007679908,0.000051634714,0.9749742,0.00030235926],"about_ca_topic_score_codex":0.0000752313,"about_ca_topic_score_gemma":4.2622963e-7,"teacher_disagreement_score":0.98859155,"about_ca_system_score_codex":0.00005296873,"about_ca_system_score_gemma":0.000121646975,"threshold_uncertainty_score":0.99996084},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006425278,0.00009520235,0.034640383,0.00019501867,0.0006603914,0.00015975452,0.000049628597,0.00048416227,0.96370906],"genre_scores_gemma":[0.00043245888,0.000024084828,0.0027886203,0.00031612063,0.00028221752,2.8525514e-7,0.000018621724,0.000037161157,0.9961004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983096,0.00004200874,0.00016931987,0.0008093793,0.00037003768,0.00029965554],"domain_scores_gemma":[0.99851257,0.000059275604,0.00020066339,0.00083624927,0.00010374736,0.0002874789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000080655846,0.00040196208,0.00040359594,0.00014237374,0.00023290589,0.00018443061,0.0017417604,0.00028190293,0.000006480735],"category_scores_gemma":[0.000010937877,0.0004681199,0.00028098607,0.000015300095,0.00014620699,0.00014682583,0.0011617325,0.0007956695,0.000116305695],"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.00001590033,0.000006229137,5.479695e-7,0.00003445223,0.000070775,0.00092589576,0.000047573172,0.0000032972125,0.000008492594,0.93178654,0.0604851,0.006615178],"study_design_scores_gemma":[0.00033129708,0.00011201063,0.000005202461,0.00007249101,0.000052522202,0.000024321267,0.0000033437257,0.0043014064,0.00003717879,0.000039822,0.9945174,0.0005030249],"about_ca_topic_score_codex":0.00006522957,"about_ca_topic_score_gemma":4.2482708e-7,"teacher_disagreement_score":0.93403226,"about_ca_system_score_codex":0.00010344441,"about_ca_system_score_gemma":0.00015047334,"threshold_uncertainty_score":0.9997771},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008164438,0.0005315228,0.067116424,0.00019594833,0.00035726913,0.00010508478,0.0000046123296,0.00018375796,0.9314972],"genre_scores_gemma":[0.0031113501,0.000076933204,0.013819136,0.0001283439,0.000073473195,6.575939e-7,0.000018709223,0.000028266542,0.98274314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987707,0.000023004644,0.00029113347,0.00039668023,0.00034803737,0.00017043775],"domain_scores_gemma":[0.9989882,0.00009435041,0.00028404678,0.000525758,0.00004912868,0.000058513844],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021969064,0.0002406942,0.00038856885,0.00015709524,0.000048690497,0.00005514963,0.0007340759,0.00014557308,0.0014974136],"category_scores_gemma":[0.000013176613,0.00020286992,0.00016717442,0.000030202149,0.000033984095,0.000093242124,0.0004296892,0.0005755082,0.000820291],"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.000002334454,0.000012420776,0.00018981614,0.000075400894,0.000065854016,0.000010660399,0.00009849243,0.00028441116,0.000050848357,0.8850137,0.00092993263,0.11326615],"study_design_scores_gemma":[0.00030828358,0.0003023323,0.00003844205,0.00016688295,0.000016570948,0.00002424111,0.000002819678,0.0881864,0.00014059327,0.0075471746,0.90278935,0.00047689982],"about_ca_topic_score_codex":0.000060300557,"about_ca_topic_score_gemma":0.000003108934,"teacher_disagreement_score":0.9018594,"about_ca_system_score_codex":0.000021780683,"about_ca_system_score_gemma":0.00006360708,"threshold_uncertainty_score":0.9999577},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000242035,0.000048658778,0.22784048,0.000049037662,0.0006460005,0.0001357461,0.000026135203,0.0002635925,0.7709879],"genre_scores_gemma":[0.00014250496,0.000022025682,0.0028793497,0.000044183464,0.00039110714,4.3907335e-7,0.00001779687,0.000021016967,0.9964816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836826,0.000081942504,0.0001722923,0.00070400385,0.0003281269,0.00034534978],"domain_scores_gemma":[0.9977723,0.000079424906,0.00032496254,0.0015201505,0.00012026906,0.00018290854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018655507,0.00032144284,0.0003443994,0.00016930954,0.0005414392,0.00034855926,0.0033854546,0.0002911416,0.000001694184],"category_scores_gemma":[0.000032360367,0.00037138167,0.000204468,0.000011199926,0.00021802346,0.00019975478,0.0013165966,0.00078733097,0.000084403895],"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.0000063158227,0.000008298506,2.8612635e-7,0.000030779574,0.00003390071,0.00037404295,0.00004491827,0.000011572016,0.0000028461964,0.8487894,0.05907075,0.091626905],"study_design_scores_gemma":[0.00004040006,0.000045610064,0.000004085525,0.00010528402,0.000034778313,0.000020004049,0.0000041285925,0.0117877,0.00021117029,0.00021412509,0.9870959,0.00043681895],"about_ca_topic_score_codex":0.00012832641,"about_ca_topic_score_gemma":0.0000011796583,"teacher_disagreement_score":0.9280251,"about_ca_system_score_codex":0.00015840313,"about_ca_system_score_gemma":0.00039148272,"threshold_uncertainty_score":0.9998738},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32484525,0.00011114125,0.6257333,0.0005791496,0.0019349369,0.0004408884,0.000020950965,0.00091465487,0.045419715],"genre_scores_gemma":[0.9895958,0.000027788226,0.003195935,0.00027401274,0.0001714071,0.0000012123196,0.00000838394,0.000019638888,0.0067058634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805695,0.0003331549,0.00015735054,0.000949234,0.00015149804,0.00035184316],"domain_scores_gemma":[0.9975666,0.0004247925,0.00026970103,0.0015584668,0.00007747502,0.00010295725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005557905,0.00026074945,0.00022971253,0.0001448128,0.00049572426,0.0001933754,0.0031999305,0.00011497452,0.00016890225],"category_scores_gemma":[0.0001513456,0.00023242114,0.00017382436,0.0008237137,0.0000777001,0.00016568697,0.0050730985,0.0013537506,0.000068094814],"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.000009460046,0.000114376606,0.016519178,0.00008082369,0.000107194675,0.0008565644,0.00056340423,0.8487254,0.000016605776,0.10899975,0.0020613,0.021945957],"study_design_scores_gemma":[0.00021225814,0.000048181435,0.014426554,0.000050562656,0.000030526848,0.000010164986,0.000048398408,0.96186465,0.000009977908,0.019063555,0.00386037,0.0003747773],"about_ca_topic_score_codex":0.0006968141,"about_ca_topic_score_gemma":0.000018210645,"teacher_disagreement_score":0.6647505,"about_ca_system_score_codex":0.00014070718,"about_ca_system_score_gemma":0.0001918016,"threshold_uncertainty_score":0.9477859},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09497034,0.00014331922,0.9005857,0.002446172,0.00053634593,0.0005523826,0.0000040624013,0.00011988544,0.00064178515],"genre_scores_gemma":[0.707623,0.0000026695752,0.29070804,0.0013680434,0.00006795799,0.00017610972,0.0000033170625,0.000008358519,0.00004250209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971281,0.0004103267,0.00024343182,0.00074350944,0.00053249736,0.0009420769],"domain_scores_gemma":[0.9986327,0.00052988296,0.00007256593,0.000451416,0.000051383464,0.00026201142],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008478399,0.00018119306,0.00022728037,0.00051862164,0.002816726,0.0007743343,0.0025863443,0.000026894766,0.000013118643],"category_scores_gemma":[0.00008376995,0.00014522433,0.000041940177,0.0018215519,0.00018982368,0.00030461216,0.00074324245,0.00053374434,0.0000014603645],"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.000016552083,0.000058768182,0.0031795423,0.00003327558,0.0000122887495,0.00002107028,0.051909354,0.06939751,0.0009246478,0.024813067,0.000044792323,0.8495891],"study_design_scores_gemma":[0.0005446431,0.00018493402,0.0020902297,0.0000037673285,0.0000016184206,0.000026282283,0.00030601572,0.98542875,0.00006685214,0.0032734345,0.007867224,0.00020625776],"about_ca_topic_score_codex":0.006310959,"about_ca_topic_score_gemma":0.0017039063,"teacher_disagreement_score":0.91603124,"about_ca_system_score_codex":0.00023844242,"about_ca_system_score_gemma":0.0004981806,"threshold_uncertainty_score":0.99848145},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96901655,0.00023523842,0.0031645761,0.026863165,0.0006347521,0.000032748874,0.0000016682401,0.0000116919755,0.000039598635],"genre_scores_gemma":[0.96724164,0.000012000092,0.031799488,0.0005157079,0.00012280526,4.7307927e-7,6.0177165e-8,0.000003601771,0.00030421466],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99915254,0.00020227097,0.00016691083,0.00008126019,0.00030779274,0.000089243396],"domain_scores_gemma":[0.9989254,0.000057043617,0.00030129356,0.0006400247,0.00003400936,0.00004225979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071407744,0.000046564364,0.00009658682,0.000032121734,0.00018891958,0.000032754306,0.0022228896,0.000007960963,0.000025268173],"category_scores_gemma":[0.0005696246,0.000028315391,0.00007099168,0.0001348081,0.000021597612,0.000089206216,0.0028919156,0.00046054932,5.494567e-7],"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.0001370709,0.0015097156,0.6324989,0.00010184326,0.00021888695,0.00034102885,0.009343373,0.020003896,0.0022491447,0.0043882965,0.01624092,0.3129669],"study_design_scores_gemma":[0.00080386206,0.0005791727,0.86145186,0.000041943214,0.000022776452,0.0011948991,0.00036389026,0.034146626,0.0002724291,0.05345588,0.047486223,0.00018041242],"about_ca_topic_score_codex":0.0000059033882,"about_ca_topic_score_gemma":5.253149e-7,"teacher_disagreement_score":0.3127865,"about_ca_system_score_codex":0.000035140954,"about_ca_system_score_gemma":0.000028950668,"threshold_uncertainty_score":0.41307187},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001598804,0.0009942495,0.48472965,0.0002874117,0.00047789796,0.00023089473,0.0000048161583,0.001575521,0.5116836],"genre_scores_gemma":[0.020982374,0.000118587646,0.10071999,0.0006436309,0.0005958809,0.000040336025,0.00018492056,0.0003431783,0.8763711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995838,0.00045105527,0.00065717596,0.0015305231,0.0006633809,0.000859898],"domain_scores_gemma":[0.99732673,0.00036244126,0.00090481807,0.00094956846,0.00017614834,0.00028031677],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012408709,0.0009903085,0.0009827996,0.0006390244,0.0007576053,0.00023691088,0.0016713514,0.00071074435,0.00094474206],"category_scores_gemma":[0.00023000507,0.0009600965,0.00046795586,0.00015764678,0.000193475,0.00024361411,0.00084761984,0.0055437405,0.00095592596],"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.00011105287,0.00010069851,0.0015402867,0.00023584635,0.0003529677,0.00092388043,0.0023108851,0.042559355,0.0000604353,0.49113563,0.00069444487,0.45997453],"study_design_scores_gemma":[0.0007248621,0.0007949797,0.00008883651,0.00029601995,0.000072869545,0.0000954782,0.000008338259,0.6045947,0.00003664458,0.013487917,0.37844983,0.0013495467],"about_ca_topic_score_codex":0.00014178653,"about_ca_topic_score_gemma":0.000011301383,"teacher_disagreement_score":0.5620353,"about_ca_system_score_codex":0.00010426299,"about_ca_system_score_gemma":0.00017184847,"threshold_uncertainty_score":0.9999685},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1447734,0.0001964012,0.104386844,0.7427627,0.0013584803,0.0014231838,0.000017336088,0.0010344427,0.0040472466],"genre_scores_gemma":[0.98236006,0.000004553641,0.008206671,0.008244528,0.00030660332,0.00007301355,0.0000066367634,0.000023940605,0.00077400316],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99779046,0.00020935171,0.0003290736,0.0005939845,0.0005021081,0.00057501],"domain_scores_gemma":[0.9985262,0.00008210166,0.000102930666,0.0008352971,0.00014749433,0.00030596176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034131817,0.00023889277,0.00021321252,0.00010955582,0.00050453324,0.00026429264,0.0008898763,0.000085277505,0.000012572111],"category_scores_gemma":[0.000033471206,0.00015247373,0.000065478765,0.0007710573,0.000032408203,0.00014898535,0.000053068878,0.00059310504,0.0006842269],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016122372,0.00018456222,0.00012591388,0.000058013316,0.000014325818,0.00007200072,0.047035478,0.0012036838,0.00013939025,0.17855345,0.0016720063,0.77092505],"study_design_scores_gemma":[0.0062314444,0.050424214,0.06853619,0.0024028975,0.000036930647,0.0006380469,0.0108809415,0.04303698,0.0015009788,0.08243607,0.7290055,0.0048697703],"about_ca_topic_score_codex":0.0016455572,"about_ca_topic_score_gemma":0.0002077094,"teacher_disagreement_score":0.83758664,"about_ca_system_score_codex":0.00011005721,"about_ca_system_score_gemma":0.00024532876,"threshold_uncertainty_score":0.8794581},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24984175,0.00009775531,0.72155726,0.009197566,0.00090274535,0.00044950936,0.00002060319,0.0007817754,0.017151045],"genre_scores_gemma":[0.8676373,0.000018407007,0.130962,0.0002030574,0.00012033034,0.000019863628,0.0000013674746,0.000015060474,0.0010226319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998637,0.0000033003603,0.00029850996,0.00030995876,0.00048227224,0.00026894643],"domain_scores_gemma":[0.9992978,0.000027906795,0.00015729725,0.00013641168,0.00031849887,0.00006208549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027784862,0.00018310815,0.00016876058,0.00020075765,0.000044909844,0.00021230981,0.0015367391,0.00006841561,0.00002468379],"category_scores_gemma":[0.00053385494,0.00014909763,0.00007097676,0.00030337338,0.000025697864,0.000744988,0.00026475108,0.00039675547,0.000012535771],"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.000042928816,0.0004009422,0.010473027,0.00015772722,0.00004895273,0.000002865204,0.0019499501,0.31793773,0.004758374,0.32977986,0.0026347372,0.33181292],"study_design_scores_gemma":[0.00023506673,0.000024882269,0.0017352407,0.00023251797,0.0000020425937,0.000008093974,0.000009173147,0.9944861,0.0013818425,0.0008310099,0.00088477466,0.00016927216],"about_ca_topic_score_codex":0.000008241146,"about_ca_topic_score_gemma":0.0000017715076,"teacher_disagreement_score":0.67654836,"about_ca_system_score_codex":0.00010329278,"about_ca_system_score_gemma":0.000075727556,"threshold_uncertainty_score":0.6080025},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005512509,0.00013639138,0.3469712,0.00019235411,0.00013415366,0.00018251137,0.000055491477,0.00012897518,0.6521934],"genre_scores_gemma":[0.001998842,0.000057589,0.005449735,0.00013712575,0.0001109306,0.0000013376862,0.00008634772,0.000026517653,0.9921316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988024,0.000077226825,0.00012710855,0.00058555603,0.00018804205,0.00021965335],"domain_scores_gemma":[0.9989014,0.00027611412,0.00012722834,0.00033331537,0.00022492516,0.00013696429],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015719757,0.00026091174,0.00030028776,0.0001330521,0.00045841446,0.00018694658,0.00047410815,0.00018636778,0.000008751663],"category_scores_gemma":[0.000060292135,0.00029048522,0.00014760256,0.000011928006,0.0002794845,0.00011706291,0.0006535667,0.00070930755,0.000002454088],"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.000010346829,0.00000512256,0.0000013261979,0.00003756194,0.00007431594,0.000060947754,0.00008938495,0.000013417576,0.000003885909,0.9862735,0.00083364494,0.012596514],"study_design_scores_gemma":[0.00052878977,0.00010321411,0.0000044794137,0.000098656725,0.000083632076,0.000032472286,0.000012837055,0.11063839,0.000052489693,0.0007962953,0.88726795,0.0003807808],"about_ca_topic_score_codex":0.000031131407,"about_ca_topic_score_gemma":0.000001039721,"teacher_disagreement_score":0.9854772,"about_ca_system_score_codex":0.00006284211,"about_ca_system_score_gemma":0.00010869472,"threshold_uncertainty_score":0.9999547},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016740354,0.00003081386,0.13168882,0.000065622895,0.00035628662,0.00017919413,0.000020386598,0.00042427817,0.86721784],"genre_scores_gemma":[0.0007778527,0.000017588161,0.0025358493,0.00010943126,0.00020406798,3.2489245e-7,0.00001452021,0.000029959021,0.9963104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825305,0.00006879651,0.00019217812,0.0007763338,0.00036540895,0.00034424066],"domain_scores_gemma":[0.9979585,0.00009781354,0.00024410387,0.0013078841,0.000159426,0.00023230344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026209353,0.00038876204,0.0004237162,0.00016836429,0.0002749568,0.00012481793,0.0017754886,0.0003325818,0.0000058521287],"category_scores_gemma":[0.000019386964,0.00043204217,0.00027297536,0.000011332564,0.0001765995,0.0001127248,0.001033283,0.0008768218,0.000087476736],"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.000008145413,0.0000049906307,0.0000025502613,0.00004931807,0.000040073886,0.000095708005,0.000030312598,0.000014065721,0.0000027992955,0.9605495,0.012313897,0.026888693],"study_design_scores_gemma":[0.0003130797,0.000073838986,0.000024820176,0.000063750456,0.00003731149,0.000021565356,0.0000024076426,0.007332905,0.000034031742,0.00006414613,0.9915576,0.00047453804],"about_ca_topic_score_codex":0.0001682084,"about_ca_topic_score_gemma":0.0000013124879,"teacher_disagreement_score":0.9792437,"about_ca_system_score_codex":0.00015612741,"about_ca_system_score_gemma":0.00011400406,"threshold_uncertainty_score":0.99981314},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5376262,0.000054755066,0.46161315,0.00008448232,0.00008689113,0.000055988465,3.5890085e-7,0.00021986976,0.00025827304],"genre_scores_gemma":[0.8861495,0.00000318509,0.113575846,0.0000921478,0.00014316454,0.0000012965319,0.0000023252935,0.00002050285,0.000012015179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835217,0.00014537518,0.00037794805,0.00051764265,0.00029371493,0.00031312794],"domain_scores_gemma":[0.99892354,0.0003769006,0.00032856458,0.0002090697,0.00006981712,0.000092133756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024782962,0.00020115104,0.00031004552,0.00011077672,0.00038572578,0.00016070755,0.0003802166,0.00008151246,3.8018985e-7],"category_scores_gemma":[0.0001855683,0.00020389179,0.000066101034,0.00027431044,0.000030104016,0.0003758087,0.0005015156,0.00046062004,9.988713e-7],"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.0000030426284,0.000019347668,0.00069370185,0.0000126613195,0.000011356488,0.000008629238,0.006329319,0.9719361,0.0028060733,0.003952105,3.5517604e-7,0.014227292],"study_design_scores_gemma":[0.0007706204,0.000070184615,0.00049114105,0.000121883,0.000006355477,0.0000035051867,0.000083040635,0.9793011,0.00060852064,0.018349178,0.000005183797,0.00018926417],"about_ca_topic_score_codex":0.0002186044,"about_ca_topic_score_gemma":0.0000030116753,"teacher_disagreement_score":0.3485233,"about_ca_system_score_codex":0.000026948745,"about_ca_system_score_gemma":0.000062191844,"threshold_uncertainty_score":0.8314466},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031959836,0.00031449512,0.2465159,0.0005176526,0.00050913246,0.0044058664,0.00012226292,0.00078502356,0.7436337],"genre_scores_gemma":[0.007902785,0.00010365366,0.3489955,0.0003399243,0.0014149984,0.00014981574,0.00007511468,0.00022485094,0.6407933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984948,0.0000065830754,0.00032481298,0.0005713781,0.00029107812,0.00031136],"domain_scores_gemma":[0.99875546,0.0003399757,0.0003858509,0.0003322796,0.00005119398,0.00013522901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050076476,0.00043201336,0.0006514312,0.00003601701,0.00035307062,0.00028535866,0.0002944369,0.000542913,0.0000058653586],"category_scores_gemma":[0.000015413189,0.00033797504,0.0001950043,0.000017236098,0.00019677877,0.000040513907,0.00028949452,0.0010115388,0.000006948065],"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.000023693507,0.000020729267,0.0000051616094,0.00043623493,0.00025872185,0.0000014262364,0.0022433943,0.000037718986,0.00005307729,0.93483555,0.0012301602,0.06085414],"study_design_scores_gemma":[0.010461593,0.0014722617,0.0000041352864,0.0018507839,0.001009143,0.000114096525,0.0010436942,0.073909506,0.00058706367,0.39754257,0.5083841,0.0036210555],"about_ca_topic_score_codex":0.000004728163,"about_ca_topic_score_gemma":0.0000014402887,"teacher_disagreement_score":0.53729296,"about_ca_system_score_codex":0.000022458442,"about_ca_system_score_gemma":0.0001360474,"threshold_uncertainty_score":0.99990726},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014765834,0.0008657148,0.07918315,0.00026982982,0.0016092521,0.00024860064,0.00002956507,0.00028284453,0.91749626],"genre_scores_gemma":[0.00019598087,0.007850405,0.13989104,0.00011064884,0.0011756236,0.000016617061,0.00003532311,0.000087522676,0.85063684],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971779,0.000043996573,0.0006654127,0.0008787466,0.0008224257,0.00041153637],"domain_scores_gemma":[0.99747795,0.00026157807,0.00062945427,0.0011443836,0.00028221472,0.00020441583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020027172,0.0005791472,0.00077405135,0.00038110482,0.00013920294,0.000043113752,0.0017027654,0.00046600122,0.00019951916],"category_scores_gemma":[0.000106586325,0.00048026862,0.00028497423,0.00014399154,0.000239703,0.00035017336,0.00062848086,0.0011615673,0.0003515795],"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.0000044577196,0.00006665293,0.000060440063,0.000056817236,0.00014632092,0.00022190473,0.0018482208,0.000059379836,0.000002697644,0.073312715,0.010983802,0.9132366],"study_design_scores_gemma":[0.00033587203,0.00029777744,0.00024410713,0.00019058704,0.00003010159,0.0000706941,0.000006794996,0.004547659,0.000030391793,0.017604519,0.97576183,0.00087966124],"about_ca_topic_score_codex":0.00008626542,"about_ca_topic_score_gemma":0.0000031586706,"teacher_disagreement_score":0.964778,"about_ca_system_score_codex":0.00006329382,"about_ca_system_score_gemma":0.00039435766,"threshold_uncertainty_score":0.9997649},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013770566,0.0034352762,0.041207384,0.00009794637,0.001665117,0.00035111696,0.000102844904,0.00037535254,0.9527512],"genre_scores_gemma":[0.0006356939,0.0019891164,0.011465352,0.000045117125,0.0012699747,0.000011791592,0.0005009949,0.00007396646,0.984008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99715906,0.00012415143,0.0007638747,0.0007914749,0.00078745274,0.00037399962],"domain_scores_gemma":[0.9974756,0.00018951685,0.0005858537,0.001404636,0.00014859575,0.00019579683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006590383,0.0004892328,0.0007806252,0.00033037318,0.00012830197,0.00010214212,0.0013968141,0.00025648033,0.00010822109],"category_scores_gemma":[0.000105104984,0.00046069865,0.00020663372,0.000098790624,0.000051639177,0.00036219967,0.00040060282,0.001001192,0.0003606012],"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.000015127521,0.00010057158,0.00016763042,0.0011502074,0.00022748786,0.00050683436,0.0009221753,0.0014182809,0.000072843715,0.5962037,0.033661455,0.3655537],"study_design_scores_gemma":[0.00028490822,0.0001621827,0.000017252341,0.0007847967,0.00003265877,0.000048416838,0.000011800514,0.019670127,0.0000051172146,0.00039836968,0.978034,0.00055033236],"about_ca_topic_score_codex":0.00016791957,"about_ca_topic_score_gemma":0.0000036093124,"teacher_disagreement_score":0.9443726,"about_ca_system_score_codex":0.000042374515,"about_ca_system_score_gemma":0.00017904007,"threshold_uncertainty_score":0.99978447},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014963334,0.000023982342,0.30678123,0.0024047494,0.00009070594,0.000018091245,6.3818554e-8,0.0004006951,0.67531717],"genre_scores_gemma":[0.7271599,0.000007627713,0.14227204,0.0012600895,0.00010392363,0.000001445178,3.702176e-7,0.0000031681548,0.1291914],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971426,0.000011306503,0.000036893973,0.00009453314,0.0000627787,0.00008023702],"domain_scores_gemma":[0.9997869,0.000012399569,0.0000044348353,0.00016293237,0.0000040890936,0.000029224946],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000056346944,0.000028193983,0.000027206574,0.000011561757,0.000034646673,0.000050358474,0.00024398914,0.000009431301,0.0021615233],"category_scores_gemma":[0.0000026801326,0.000021094233,0.000015678186,0.0000791663,0.0000041037815,0.00010692607,0.000014153406,0.000049730806,0.0015299576],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.5714512e-7,0.000009049428,0.00012259281,3.0900893e-7,8.3371634e-7,0.0000038981166,0.000042450472,0.00010621862,0.000011970445,0.013997463,0.002062906,0.98364216],"study_design_scores_gemma":[0.00012388417,0.000038856968,0.008358736,0.0000021832657,5.338103e-7,0.000027610082,0.0000017403528,0.40610206,0.00026668425,0.0028807067,0.58207995,0.00011709415],"about_ca_topic_score_codex":0.00003401853,"about_ca_topic_score_gemma":5.4359504e-7,"teacher_disagreement_score":0.98352504,"about_ca_system_score_codex":0.0000019022343,"about_ca_system_score_gemma":0.000005481342,"threshold_uncertainty_score":0.9992475},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.768151e-7,0.1562195,0.8342152,0.00033051378,0.0005425939,0.00015644163,0.0000012460396,0.00024862302,0.008285307],"genre_scores_gemma":[0.00018277326,0.5889747,0.35486615,0.0027393578,0.0027667377,0.00005105116,0.000022473012,0.00014724131,0.05024953],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836385,0.000014719116,0.0004482919,0.0005920803,0.0002291128,0.00035192803],"domain_scores_gemma":[0.9992394,0.00014598,0.00009673861,0.00036421235,0.00004986134,0.00010381204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018225732,0.00037365052,0.00051362946,0.00018730902,0.00006433875,0.00009950506,0.0005309404,0.00013491049,0.00004459985],"category_scores_gemma":[0.000031685795,0.0003541743,0.00008107786,0.00014006044,0.00007432257,0.0007455806,0.00025627125,0.00060611585,0.000040750267],"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.000003652501,0.000007907935,9.52126e-7,0.00040467104,0.000012253788,0.00004544928,0.000045929963,0.0015538465,9.072538e-7,0.31328923,0.00036864818,0.68426657],"study_design_scores_gemma":[0.000023577779,0.00034699508,0.000003210159,0.0018163726,0.0000106577645,0.00011666455,1.06963704e-7,0.22295482,0.000035017347,0.038280297,0.7358658,0.00054650137],"about_ca_topic_score_codex":0.0000012734679,"about_ca_topic_score_gemma":0.0000014514844,"teacher_disagreement_score":0.7354971,"about_ca_system_score_codex":0.00004182472,"about_ca_system_score_gemma":0.00003490536,"threshold_uncertainty_score":0.99989104},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04389124,0.000036627625,0.89610255,0.00043031172,0.004650321,0.001701282,0.0000079194215,0.0015110299,0.051668696],"genre_scores_gemma":[0.5675985,0.00001032612,0.03890053,0.00042635668,0.00036474847,0.0000603319,0.0014244954,0.00010347118,0.39111122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761456,0.00012044389,0.0003922937,0.0007652142,0.00079484825,0.00031263518],"domain_scores_gemma":[0.9985667,0.00005165261,0.00026520868,0.00067642727,0.00028482714,0.00015519196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045633147,0.00031925534,0.00040480346,0.00028306758,0.00009954612,0.00038849455,0.0007593132,0.00019399002,0.00009406144],"category_scores_gemma":[0.000038332724,0.00024145126,0.0000626803,0.0008139102,0.0000044388535,0.00023541486,0.00007390041,0.00025079734,0.0006845852],"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.0013374434,0.00036800123,0.0006225197,0.0038030762,0.00051981077,0.00029386632,0.011739085,0.0052961116,0.0006357053,0.80044854,0.027378581,0.14755729],"study_design_scores_gemma":[0.0143965585,0.033213068,0.0147713,0.009350418,0.0008612803,0.00051032606,0.0064939484,0.6701699,0.030969927,0.0006161657,0.20542215,0.013224985],"about_ca_topic_score_codex":0.00024697682,"about_ca_topic_score_gemma":0.00004194104,"teacher_disagreement_score":0.85720205,"about_ca_system_score_codex":0.00015055705,"about_ca_system_score_gemma":0.00029455978,"threshold_uncertainty_score":0.98460966},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010317518,0.000010327869,0.9833796,0.00015694874,0.0009183385,0.00017163638,0.00003327437,0.00032459266,0.0046877586],"genre_scores_gemma":[0.9952657,0.000029240633,0.0025424187,0.00022305183,0.00013135748,0.0000016207885,0.0005828724,0.0000109145685,0.0012128127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986244,0.00018805642,0.00021600124,0.0005102043,0.00020813257,0.00025319972],"domain_scores_gemma":[0.9988985,0.00006200439,0.00032626666,0.0005209009,0.00008781796,0.00010452405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027526394,0.00021974686,0.00019785886,0.00039192845,0.0004646583,0.0002244965,0.0009776076,0.00015596802,0.00030225408],"category_scores_gemma":[0.000026887528,0.00028845217,0.00013292435,0.0004258446,0.000057140944,0.0009962099,0.0014160055,0.00066152593,0.0001268833],"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.0000068222407,0.000022814813,0.0010430448,0.00003246681,0.00004187792,0.000021917058,0.00050206407,0.59314,0.0000045077986,0.40455118,0.00040793614,0.00022535311],"study_design_scores_gemma":[0.0003377384,0.000039163955,0.00058492617,0.000020256557,0.000025357065,0.0000043493646,0.00010845257,0.90345424,0.000013143857,0.093043946,0.0020458717,0.00032257647],"about_ca_topic_score_codex":0.00008330611,"about_ca_topic_score_gemma":0.000012278849,"teacher_disagreement_score":0.9849482,"about_ca_system_score_codex":0.00062948046,"about_ca_system_score_gemma":0.00018012615,"threshold_uncertainty_score":0.9999568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7914923,0.000041497904,0.16050948,0.01314556,0.00121836,0.0021639513,0.000060593982,0.0006157896,0.030752465],"genre_scores_gemma":[0.9968412,0.000010034751,0.0026341914,0.00017706043,0.00005595373,0.000043447693,0.0000100147645,0.000014614405,0.00021346983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977199,0.000055387165,0.00036204702,0.000687106,0.000852066,0.00032349417],"domain_scores_gemma":[0.99824405,0.00017489142,0.00055048143,0.00041925244,0.0005346467,0.00007668382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007118406,0.00021353834,0.00022317244,0.0001410019,0.00069074845,0.00027022962,0.0026940545,0.000037532038,0.00007280988],"category_scores_gemma":[0.00032299958,0.00016370349,0.000050275878,0.00081891875,0.00015442679,0.00055476016,0.0014336861,0.00091849687,0.000029533561],"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.00034024852,0.00049744593,0.00082547625,0.00002988049,0.00008197803,0.00000873577,0.014416636,0.015578862,0.011678247,0.2295821,0.000102531274,0.72685784],"study_design_scores_gemma":[0.0001021449,0.00086912833,0.0050482717,0.00011765775,0.000030600895,0.000032096963,0.010950176,0.8931105,0.081817605,0.0067246803,0.00074034807,0.00045677583],"about_ca_topic_score_codex":0.00009530993,"about_ca_topic_score_gemma":0.000014180827,"teacher_disagreement_score":0.87753165,"about_ca_system_score_codex":0.00007803337,"about_ca_system_score_gemma":0.00011127342,"threshold_uncertainty_score":0.66756344},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18780042,0.000028389435,0.8076231,0.001327134,0.00043542567,0.0006272051,0.000023768525,0.00004596138,0.002088637],"genre_scores_gemma":[0.9866087,0.0000022778936,0.013108602,0.00009695049,0.000033248467,0.000082668616,0.0000018859374,0.000009925995,0.000055751447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984174,0.000038560534,0.0004909126,0.00037657275,0.0003992551,0.00027734492],"domain_scores_gemma":[0.9985045,0.00032015526,0.00052098744,0.00017075411,0.000444729,0.00003883881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006465044,0.00016375056,0.00027359911,0.0002202735,0.00028296225,0.00012272804,0.0010818973,0.000038237376,0.00003623553],"category_scores_gemma":[0.00068504096,0.00013781147,0.000092887625,0.0007006733,0.0001512166,0.00016514973,0.00038264514,0.0003063689,0.0000010731602],"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.00017840236,0.00030045205,0.00048299928,0.000032723314,0.000014169829,4.6056078e-7,0.015615491,0.36786565,0.003850417,0.5959662,0.000019587977,0.015673425],"study_design_scores_gemma":[0.000054897817,0.00046143294,0.00012701217,0.000100782985,0.0000054308075,0.0000024747826,0.002578873,0.9373246,0.038060375,0.02109521,0.000042797063,0.00014610888],"about_ca_topic_score_codex":0.0001571131,"about_ca_topic_score_gemma":0.0000028601632,"teacher_disagreement_score":0.7988083,"about_ca_system_score_codex":0.00007593295,"about_ca_system_score_gemma":0.00007522106,"threshold_uncertainty_score":0.5619788},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1216079,0.00002302763,0.85863143,0.010957945,0.00059637177,0.0010097056,0.00005137055,0.00019998215,0.0069222874],"genre_scores_gemma":[0.97751766,0.0000055326136,0.021585107,0.00015664498,0.00004951979,0.00018718636,0.0000015309195,0.0000131120605,0.0004836799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984345,0.000021173935,0.0003111486,0.00048225193,0.00047178476,0.00027916575],"domain_scores_gemma":[0.9986635,0.00014221822,0.00042030608,0.00024722604,0.00047732692,0.000049408005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045273933,0.00017368105,0.00019281902,0.00009905285,0.0007008317,0.00017878809,0.001555411,0.00003213641,0.00003612587],"category_scores_gemma":[0.00022121194,0.00012987826,0.000075495525,0.00060688093,0.0001710651,0.0003203852,0.00029357072,0.00036083657,0.000006493775],"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.0001599078,0.000093196686,0.000102836035,0.000023435754,0.000012254147,1.09888404e-7,0.0020605596,0.00053376105,0.014553763,0.8570056,0.000061057886,0.1253935],"study_design_scores_gemma":[0.00012625256,0.0013071508,0.0018308047,0.00018696123,0.000024320014,0.000017344886,0.0070339586,0.49931642,0.27015498,0.21586177,0.0035137436,0.0006263017],"about_ca_topic_score_codex":0.00003804187,"about_ca_topic_score_gemma":0.000010369071,"teacher_disagreement_score":0.85590976,"about_ca_system_score_codex":0.00007825723,"about_ca_system_score_gemma":0.00014124635,"threshold_uncertainty_score":0.5390302},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045076746,0.000036255205,0.94982666,0.004603875,0.00003504866,0.0003742116,0.000008889217,0.000024999788,0.000013290295],"genre_scores_gemma":[0.76951456,0.0000057921698,0.23017663,0.00015543615,0.000056513818,0.00004285209,0.000008632985,0.00000819271,0.000031414234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996705,0.00063496886,0.0005687188,0.0001465521,0.0014995616,0.0004451964],"domain_scores_gemma":[0.9969152,0.00044838028,0.00038083058,0.00029838894,0.0015118895,0.00044526864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066571985,0.00010410166,0.00027784056,0.0012395416,0.0012396569,0.00017937919,0.00053320744,0.000024748439,0.0000021920018],"category_scores_gemma":[0.00047464442,0.000087529115,0.00013220757,0.0021261077,0.000018966213,0.00053577754,0.00039506855,0.0014593449,0.0000018260293],"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.00017101914,0.000036528872,0.0010628478,0.00006626493,0.000080077414,0.000010294865,0.0049206982,0.8673793,0.000006736484,0.00033624287,0.000014126135,0.12591584],"study_design_scores_gemma":[0.00037545743,0.00054137636,0.00093119155,0.000029625973,0.000021267591,0.000027305749,0.0037966974,0.9931215,0.00001033535,0.00006545737,0.0009805966,0.00009918609],"about_ca_topic_score_codex":0.00026245037,"about_ca_topic_score_gemma":0.000043498243,"teacher_disagreement_score":0.7244378,"about_ca_system_score_codex":0.00028203084,"about_ca_system_score_gemma":0.0004677447,"threshold_uncertainty_score":0.9534564},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.648599,0.000035919467,0.34924847,0.00013792528,0.0007715883,0.00045248677,0.00011144513,0.000096194046,0.0005469513],"genre_scores_gemma":[0.9731363,0.00008760865,0.024547104,0.000050476112,0.00050465734,5.80849e-7,0.00006932708,0.000040564166,0.001563369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952343,0.00052730314,0.00096500845,0.0022113754,0.00027719696,0.0007847812],"domain_scores_gemma":[0.9936845,0.00039543895,0.0018290513,0.002701225,0.0009769087,0.0004128845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010490514,0.0006913167,0.0011586417,0.0008336509,0.00034456112,0.0001263079,0.00301273,0.0005604677,0.000020749301],"category_scores_gemma":[0.00038335405,0.0007625704,0.0006455251,0.0010459467,0.00048204002,0.00058918237,0.0019258695,0.00080966525,0.000010429128],"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.0009254531,0.0003097447,0.0010676854,0.00070939853,0.0002479649,0.000040520918,0.0023985556,0.85089767,0.00052962743,0.13162427,0.00006986421,0.011179236],"study_design_scores_gemma":[0.002790483,0.0016720563,0.008020661,0.00030251467,0.00016447507,0.000013653034,0.00012871726,0.9728594,0.00064559205,0.0121635655,0.0005435667,0.0006953399],"about_ca_topic_score_codex":0.0017395829,"about_ca_topic_score_gemma":0.000024525354,"teacher_disagreement_score":0.32470137,"about_ca_system_score_codex":0.00020306354,"about_ca_system_score_gemma":0.0007966947,"threshold_uncertainty_score":0.9994825},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07331369,0.001385487,0.92146415,0.0033586249,0.0000694567,0.00028826125,0.000007866767,0.000016164773,0.00009632177],"genre_scores_gemma":[0.99684405,0.00017429015,0.0027140705,0.00006733856,0.00005040374,0.00003891059,0.0000011665885,0.000005172817,0.000104605366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999045,0.00008410017,0.0001801507,0.00011631647,0.0002094325,0.00036500508],"domain_scores_gemma":[0.99926823,0.00030545256,0.0001938998,0.00017114729,0.00004132727,0.000019921905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013503658,0.000059067428,0.000105892505,0.0000656397,0.0003943496,0.000022127968,0.00051539624,0.000008750341,0.0000058069595],"category_scores_gemma":[0.00004166226,0.000038821512,0.000054832955,0.0001565942,0.00006499965,0.00006382039,0.00012380024,0.0006019985,2.8683394e-7],"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.000009546685,0.000050347127,0.00010563499,0.0000053616322,0.000016733344,5.6758108e-8,0.00005930614,0.0013048932,0.0001479289,0.9127863,0.000037186088,0.08547668],"study_design_scores_gemma":[0.00022860413,0.00048737836,0.000226942,0.000005773245,0.00000476246,0.00008603313,0.000072764946,0.05417055,0.000051505885,0.94337,0.001253746,0.000041985684],"about_ca_topic_score_codex":0.000023094393,"about_ca_topic_score_gemma":0.00002120774,"teacher_disagreement_score":0.92353034,"about_ca_system_score_codex":0.00005846139,"about_ca_system_score_gemma":0.00027044333,"threshold_uncertainty_score":0.30330583},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17225294,0.0014672409,0.4975692,0.2798316,0.0016998685,0.006786907,0.0014846671,0.0014411432,0.037466444],"genre_scores_gemma":[0.9649148,0.00020956477,0.020001639,0.0018420466,0.00031202508,0.0007598908,0.0018439359,0.00003390116,0.010082172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935878,0.0014942534,0.0006923072,0.0012880968,0.0021432773,0.0007942999],"domain_scores_gemma":[0.9946267,0.0008950291,0.00023036916,0.0029396897,0.0011453886,0.00016281106],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006619284,0.00033046157,0.00034806918,0.0011994354,0.0003274416,0.0015873468,0.0064199767,0.0003513655,0.000022679013],"category_scores_gemma":[0.0020011538,0.00026008429,0.00013742491,0.0018234313,0.00009600066,0.00043640658,0.0052996655,0.0039718584,0.000051571416],"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.00005772847,0.0049583134,0.0148725,0.0016599714,0.00024577373,0.00019259861,0.016320145,0.20209953,0.000060616698,0.15567595,0.056456212,0.54740065],"study_design_scores_gemma":[0.00025357795,0.000028370801,0.014080974,0.00015919487,0.0000051482775,0.000006730131,0.00009778502,0.9651543,0.0000060954944,0.011242911,0.008726643,0.00023830678],"about_ca_topic_score_codex":0.00066787447,"about_ca_topic_score_gemma":0.00036184498,"teacher_disagreement_score":0.7926619,"about_ca_system_score_codex":0.00027730974,"about_ca_system_score_gemma":0.0016626419,"threshold_uncertainty_score":0.99998516},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013169191,0.00007328426,0.98027265,0.0044856872,0.0006091863,0.00039244333,0.00008254077,0.00036708312,0.0005479232],"genre_scores_gemma":[0.0253699,0.000004676521,0.969396,0.0006610175,0.0003371364,0.00015967895,0.00010189593,0.000031622512,0.003938106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832946,0.000109875065,0.00022484038,0.0006598404,0.00025928975,0.00041671682],"domain_scores_gemma":[0.99881613,0.00045986983,0.00019614631,0.00034042753,0.000088431545,0.00009901379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045183703,0.00019366384,0.00023697017,0.000112384085,0.0009140047,0.00010166857,0.0007193136,0.000036700796,0.00007806611],"category_scores_gemma":[0.00032523993,0.00019359098,0.00014966963,0.00040170221,0.000032726428,0.00024360827,0.0005667549,0.0006743071,0.0000071082677],"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.00029254463,0.00067247724,0.00034749106,0.000050716957,0.00028340897,0.00001939405,0.019076493,0.120553754,0.19029775,0.0076212985,0.0000655059,0.66071916],"study_design_scores_gemma":[0.0014089211,0.00048296934,0.0004617068,0.000007915202,0.000013667444,0.000040044233,0.001714925,0.9803156,0.0010374507,0.00032875605,0.013853558,0.00033443302],"about_ca_topic_score_codex":0.00017581841,"about_ca_topic_score_gemma":0.0000071811464,"teacher_disagreement_score":0.8597619,"about_ca_system_score_codex":0.00009743122,"about_ca_system_score_gemma":0.00008723374,"threshold_uncertainty_score":0.7894411},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19480301,0.000092956485,0.8001006,0.0002571448,0.00033902822,0.00065561384,0.0000663299,0.0001487794,0.003536501],"genre_scores_gemma":[0.884978,0.00015145041,0.11234635,0.000059917194,0.00008804675,0.0000033614383,0.000022953802,0.000037372592,0.0023125343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563813,0.0003700296,0.00061053573,0.0021834245,0.00048808343,0.00070982176],"domain_scores_gemma":[0.9928521,0.0011661724,0.0009247775,0.0021890597,0.0021134962,0.0007544212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011475794,0.00074458367,0.0009539735,0.00072395185,0.0003972405,0.00038953777,0.003234926,0.00034208983,0.00007951835],"category_scores_gemma":[0.0013011325,0.0007300048,0.0002184882,0.0037292328,0.00039871587,0.0007269453,0.0028465718,0.0009584244,0.0001290945],"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.00026113435,0.000430746,0.007578641,0.00066805736,0.00017393695,0.00012507862,0.001641377,0.97388726,0.0000022901645,0.011606738,0.00019039992,0.0034343272],"study_design_scores_gemma":[0.0010989475,0.00070992595,0.0038459029,0.0013173954,0.00023798361,0.000016880802,0.00045797857,0.97905546,0.000051653325,0.0114440685,0.0007411742,0.0010226186],"about_ca_topic_score_codex":0.00047702293,"about_ca_topic_score_gemma":0.0001625729,"teacher_disagreement_score":0.690175,"about_ca_system_score_codex":0.00022475971,"about_ca_system_score_gemma":0.0023036338,"threshold_uncertainty_score":0.9995151},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.475096,0.00003324517,0.5240658,0.0004834022,0.00011110468,0.00012845527,0.00002166307,0.000037579724,0.000022738512],"genre_scores_gemma":[0.66916317,0.000004067159,0.3306504,0.000023511975,0.00008126166,0.000009814507,0.000034500095,0.000016529251,0.000016756418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967531,0.00029181337,0.0006508209,0.0007989883,0.0009881181,0.0005171475],"domain_scores_gemma":[0.99850684,0.00012614689,0.00030880378,0.00066908187,0.0001516998,0.00023740553],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018781915,0.00029454826,0.00032059327,0.00028820484,0.0016058258,0.00033398587,0.0014639195,0.00006247641,0.0000053403937],"category_scores_gemma":[0.00007308632,0.00024674152,0.000045775952,0.0004548116,0.000054409607,0.0018033058,0.0030153552,0.0018664156,6.4131973e-7],"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.00006353828,0.00003565891,0.0037695277,0.00001579453,0.000013107186,0.00007525185,0.00403297,0.98187673,0.00013601285,0.00017246968,0.0000021520761,0.009806798],"study_design_scores_gemma":[0.0011251355,0.00021582308,0.0019336712,0.00005584572,0.000012942365,0.0008112425,0.0003909256,0.9758146,0.0000026322377,0.019296048,1.8908933e-7,0.000340941],"about_ca_topic_score_codex":0.00040502273,"about_ca_topic_score_gemma":0.00003999074,"teacher_disagreement_score":0.1940672,"about_ca_system_score_codex":0.00012869158,"about_ca_system_score_gemma":0.0003888539,"threshold_uncertainty_score":0.9999985},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0648552,0.000033319335,0.84752446,0.0029277469,0.00048324213,0.0003303219,6.18893e-7,0.0015447194,0.08230037],"genre_scores_gemma":[0.9806794,0.0000072675807,0.006389363,0.00071366335,0.0001220753,0.00006180808,0.000009262502,0.000034383705,0.011982779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710107,0.0010302861,0.00024611174,0.0006739831,0.0003880799,0.00056046783],"domain_scores_gemma":[0.99788845,0.00097343256,0.0002243348,0.0005236464,0.00018528008,0.00020488632],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008743241,0.0003140048,0.0002845686,0.00022465365,0.00051569263,0.00048334597,0.0010437096,0.00013652878,0.00097606523],"category_scores_gemma":[0.00084024854,0.00027689844,0.00011494911,0.0003086335,0.00012364876,0.00043898006,0.00023363675,0.001635897,0.0024911284],"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.000055542678,0.00010778712,0.0008501681,0.00002288152,0.000034349487,0.000014790154,0.0021703353,0.038633004,0.00073449156,0.24663976,0.00035245516,0.7103844],"study_design_scores_gemma":[0.0008908871,0.00076624623,0.0035955939,0.00015521537,0.000008727496,0.000009603684,0.0005341538,0.95841086,0.000902463,0.02234547,0.011784082,0.0005966782],"about_ca_topic_score_codex":0.000044842236,"about_ca_topic_score_gemma":7.409853e-7,"teacher_disagreement_score":0.91977787,"about_ca_system_score_codex":0.000052099807,"about_ca_system_score_gemma":0.00014285622,"threshold_uncertainty_score":0.9999683},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05687797,0.00008167193,0.9203483,0.0003156294,0.0011329082,0.00015951022,0.000016039978,0.0005917939,0.020476209],"genre_scores_gemma":[0.9890624,0.000038892318,0.004257685,0.00030381157,0.00009892395,0.000001032797,0.000029033676,0.000024741,0.006183425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977003,0.0003531555,0.00019864613,0.0011309553,0.00015544346,0.00046150025],"domain_scores_gemma":[0.9978096,0.00014983905,0.00024172846,0.0015555553,0.00006698165,0.00017628586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043891656,0.00032895885,0.00034048603,0.00025278964,0.0005729351,0.00016668026,0.0031590175,0.00018388298,0.00021127844],"category_scores_gemma":[0.000026022248,0.0004033842,0.00024819377,0.0006272242,0.00013008766,0.0001966857,0.006568356,0.0018696749,0.000103088714],"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.000008778912,0.000107021406,0.0044250702,0.00005979777,0.00008315803,0.0009197799,0.000790292,0.8263977,0.00000462434,0.15554443,0.0007320734,0.010927279],"study_design_scores_gemma":[0.00030684622,0.000061094004,0.0011170588,0.000032328386,0.0000314461,0.000013191488,0.0002107507,0.97197646,0.000009502228,0.017869078,0.007885441,0.0004868072],"about_ca_topic_score_codex":0.0006592776,"about_ca_topic_score_gemma":0.000027492946,"teacher_disagreement_score":0.93218446,"about_ca_system_score_codex":0.00027283543,"about_ca_system_score_gemma":0.00021161372,"threshold_uncertainty_score":0.9998418},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03728315,0.0002506703,0.9488248,0.009552257,0.0015166639,0.000207169,0.000010772486,0.0000654187,0.0022890684],"genre_scores_gemma":[0.52373916,0.00004927098,0.47535217,0.00044450356,0.00014000964,0.0000061705277,0.0000035909354,0.00000790182,0.00025722088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889517,0.00017195969,0.0003269469,0.0001311823,0.00033766023,0.00013707402],"domain_scores_gemma":[0.9993983,0.000040484665,0.00027466784,0.00011517612,0.00011093974,0.0000604576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047244263,0.00008029166,0.00014774696,0.00008638644,0.00014874933,0.000107994936,0.0003363354,0.00002476175,0.000088522625],"category_scores_gemma":[0.00014374038,0.00006422199,0.000056496843,0.0008044977,0.000019359006,0.00033229945,0.00011475837,0.00024748963,0.0000016035544],"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.00003855655,0.00012241963,0.003429593,0.0000028887566,0.000010400401,0.000050794402,0.00019423464,0.9879819,0.000004716318,0.001157126,0.0006291468,0.0063782344],"study_design_scores_gemma":[0.0006447728,0.00053463667,0.0010110219,0.000016112464,0.000006593909,0.0010146444,0.00023158905,0.9910348,0.0000048202874,0.00015852116,0.0052492153,0.00009327066],"about_ca_topic_score_codex":0.00009940136,"about_ca_topic_score_gemma":0.000037841703,"teacher_disagreement_score":0.486456,"about_ca_system_score_codex":0.00028087408,"about_ca_system_score_gemma":0.00034696018,"threshold_uncertainty_score":0.26188967},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.18878496e-7,0.00004869287,0.37237203,0.0016422867,0.00018493773,0.00004826112,0.0000040137766,0.00026196407,0.62543774],"genre_scores_gemma":[0.00017653246,0.000040057013,0.06737609,0.00043172276,0.00009978502,0.000009055621,0.000023748093,0.00002160947,0.9318214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885166,0.000013003866,0.00017042855,0.00044767058,0.00038547133,0.00013174358],"domain_scores_gemma":[0.99850816,0.000030269319,0.00011671213,0.0012549544,0.00003263181,0.0000572551],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016292605,0.00016989048,0.00014980655,0.00011639246,0.00014043051,0.0000852958,0.0016152243,0.000094171235,0.0015451265],"category_scores_gemma":[0.000011266345,0.00015898565,0.00009647815,0.000028892735,0.00001768123,0.00012821035,0.0007716044,0.0005078999,0.0002184869],"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":[3.5717983e-7,0.0000038818234,4.1590457e-7,0.0000037725567,0.0000067905453,0.000003707507,0.000030121584,0.0008573988,0.0000020786956,0.9375239,0.016535562,0.04503202],"study_design_scores_gemma":[0.000043190445,0.00001555046,0.000002066221,0.0000031288082,0.000002773589,0.0000039954425,4.2026204e-7,0.51240516,4.7054553e-7,0.11758423,0.36981547,0.0001235497],"about_ca_topic_score_codex":0.000013148717,"about_ca_topic_score_gemma":0.000002755299,"teacher_disagreement_score":0.8199397,"about_ca_system_score_codex":0.000053662025,"about_ca_system_score_gemma":0.000080197155,"threshold_uncertainty_score":0.9993676},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.4746415e-8,0.0002088691,0.68138343,0.00039182848,0.00045109188,0.00018687792,0.000007258396,0.00039993235,0.31697068],"genre_scores_gemma":[0.0000049872506,0.000032970976,0.19247979,0.00033386925,0.0001994289,0.000044892662,0.00043111356,0.00003390173,0.80643904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986934,0.0000708529,0.00021922532,0.0005005794,0.00029184457,0.00022410128],"domain_scores_gemma":[0.9991035,0.00022046042,0.00019568676,0.00035279393,0.00006338843,0.00006420881],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003687615,0.00021941411,0.00027201808,0.00015735226,0.00035164962,0.0001555478,0.00081031345,0.000110459514,0.0027402733],"category_scores_gemma":[0.00007412787,0.00021022889,0.00014230657,0.00009496819,0.000015885038,0.00011436074,0.00040337173,0.0006644404,0.000033269032],"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.000007279588,0.00003087639,0.000014307575,0.0001198855,0.00007047985,0.000013290084,0.00023857196,0.6164068,7.613601e-7,0.17647626,0.09949614,0.10712536],"study_design_scores_gemma":[0.00013421562,0.000089411296,2.3556107e-7,0.0000058242526,0.0000056412896,0.0000052445725,0.0000011746465,0.5245621,7.837163e-7,0.00094145944,0.4741099,0.00014398513],"about_ca_topic_score_codex":0.000016877557,"about_ca_topic_score_gemma":0.0000011071648,"teacher_disagreement_score":0.48946837,"about_ca_system_score_codex":0.000095905234,"about_ca_system_score_gemma":0.00021142315,"threshold_uncertainty_score":0.9981713},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014308406,0.0000065767276,0.99101454,0.0005675553,0.0014273645,0.00017814353,0.00004822935,0.0002971336,0.005029627],"genre_scores_gemma":[0.98867285,0.0000054357624,0.008567811,0.00063417864,0.00003269307,0.00016367613,0.000022039481,0.0000075289645,0.0018937921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987047,0.0001961993,0.0003685051,0.00016759725,0.00037289274,0.00019011582],"domain_scores_gemma":[0.9991537,0.00012287729,0.00017468886,0.00041566783,0.000067132314,0.00006593686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085027586,0.00012516479,0.00009857584,0.00029048428,0.0009256374,0.000210756,0.000557694,0.000035211935,0.00069125067],"category_scores_gemma":[0.000010382671,0.00013429135,0.00008467841,0.0005033236,0.000045266257,0.001557182,0.000006486668,0.00042044953,0.000497557],"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.00003898581,0.00019127638,7.472301e-7,0.000011761876,0.000028600489,0.0000017355169,0.0036804052,0.5036213,0.000111228495,0.075535655,0.00019707077,0.41658127],"study_design_scores_gemma":[0.0010526865,0.0004554013,0.000059768292,0.000014398388,0.000027213158,0.00015786648,0.001985769,0.9641205,0.004283738,0.006534106,0.02084931,0.00045924893],"about_ca_topic_score_codex":0.000012964755,"about_ca_topic_score_gemma":3.4810938e-7,"teacher_disagreement_score":0.987242,"about_ca_system_score_codex":0.0000883159,"about_ca_system_score_gemma":0.0000849859,"threshold_uncertainty_score":0.75687104},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016058965,0.00030575122,0.9923078,0.0013811105,0.00078030094,0.00026692468,0.000002415253,0.00019928643,0.00459585],"genre_scores_gemma":[0.6138784,0.00011302823,0.38259423,0.0008755831,0.000779154,0.000034998524,0.000017298486,0.000096525975,0.0016107765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672455,0.00015823425,0.00048560568,0.0009679478,0.0011303012,0.0005333768],"domain_scores_gemma":[0.9972114,0.0011179858,0.0003341215,0.0011814137,0.00007285334,0.000082224535],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019789902,0.00036362893,0.00038667134,0.0003336421,0.0012169936,0.00042289737,0.004080714,0.000118361175,0.000031602453],"category_scores_gemma":[0.00021566315,0.00024203217,0.00014378734,0.0008690623,0.0005780273,0.00030050537,0.0026104287,0.0028048046,0.000004471557],"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.0000028909467,0.000030607316,0.000018825715,0.000032145897,0.000021611268,0.000009238016,0.003012984,0.6087129,0.0010065208,0.017981483,0.0000166608,0.36915416],"study_design_scores_gemma":[0.00011860155,0.000097476855,0.000038678983,0.000088791574,0.000007715865,0.00009926635,0.0000026853513,0.98579717,0.00047951416,0.0054610353,0.007508523,0.0003005334],"about_ca_topic_score_codex":0.00010990247,"about_ca_topic_score_gemma":0.000009106606,"teacher_disagreement_score":0.6137178,"about_ca_system_score_codex":0.00014379881,"about_ca_system_score_gemma":0.00028820976,"threshold_uncertainty_score":0.99949574},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025042634,0.000037770777,0.9633465,0.0072744344,0.002663228,0.0005858458,0.0005113598,0.00027424353,0.00026402736],"genre_scores_gemma":[0.8573268,0.00004274159,0.13395812,0.0048316824,0.000948514,0.00024304763,0.001990978,0.00005713739,0.0006009526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674207,0.00032264544,0.0004188525,0.0013090648,0.0007296917,0.00047767887],"domain_scores_gemma":[0.9979623,0.00024966022,0.00033811943,0.0010584155,0.00017861558,0.00021289855],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007894691,0.0003830954,0.00039580528,0.00028061104,0.0009076283,0.0013751218,0.0015077208,0.00007813188,0.0002977069],"category_scores_gemma":[0.000039473332,0.00036227828,0.00009649215,0.00032215464,0.000057167283,0.00079115306,0.0013792684,0.000582374,0.000032736993],"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.000023701203,0.00017164138,0.00019993413,0.000059401158,0.000032008473,0.000027158952,0.00041567048,0.0001629992,0.00015607984,0.0001627825,0.015238574,0.98335004],"study_design_scores_gemma":[0.0013639546,0.0009829063,0.00023586325,0.00017036092,0.00001936858,0.00007483111,0.00020199007,0.9874207,0.00011140404,0.0019007068,0.007025153,0.0004928063],"about_ca_topic_score_codex":0.000043648557,"about_ca_topic_score_gemma":0.0000046061323,"teacher_disagreement_score":0.98725766,"about_ca_system_score_codex":0.00004591286,"about_ca_system_score_gemma":0.000071615956,"threshold_uncertainty_score":0.99988294},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6588882,0.0087336935,0.31021506,0.0032575785,0.0027490458,0.0005953812,0.00013370524,0.0010020102,0.014425298],"genre_scores_gemma":[0.99292403,0.000040881958,0.005638024,0.0003497668,0.0004286032,0.000021854628,0.000013307486,0.000019107689,0.00056443055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872667,0.00005405886,0.00019628495,0.00049101596,0.00028515607,0.00024679798],"domain_scores_gemma":[0.9991617,0.00032567105,0.00012270364,0.00015179024,0.000104864914,0.00013323572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000641336,0.00018680509,0.00022695023,0.00010328061,0.0008452852,0.0003001627,0.0003480377,0.000038929506,0.000025955178],"category_scores_gemma":[0.00045716116,0.00018043384,0.000038957653,0.00020844044,0.00006955358,0.000078625184,0.0004611656,0.00042344007,0.0000032520288],"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.00013196885,0.00035581537,0.017419325,0.00021985316,0.00029350742,0.00005093612,0.019307261,0.000305403,0.0052212076,0.90291464,0.0012271438,0.052552953],"study_design_scores_gemma":[0.0023899057,0.00040338718,0.009593496,0.00016800714,0.00028443243,0.00015236162,0.0014504718,0.6716326,0.00023979858,0.24459969,0.06788416,0.0012016976],"about_ca_topic_score_codex":0.00019438722,"about_ca_topic_score_gemma":0.0000013545159,"teacher_disagreement_score":0.6713272,"about_ca_system_score_codex":0.000018305522,"about_ca_system_score_gemma":0.000023427569,"threshold_uncertainty_score":0.73578787},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28766963,0.00031494943,0.7035375,0.0037679274,0.0005699703,0.00076766516,0.00014672859,0.00016450946,0.003061102],"genre_scores_gemma":[0.9880972,0.00002454141,0.009567857,0.0009012372,0.000055092343,0.00011040238,0.0000051346815,0.000015220035,0.0012233349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787885,0.00021933776,0.00035707728,0.0005616146,0.0006358417,0.00034724968],"domain_scores_gemma":[0.99791586,0.0009025946,0.00027492148,0.0005714091,0.00019385372,0.0001413698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081614667,0.00023959932,0.0005147911,0.00015899811,0.0005453967,0.0003104975,0.0007861606,0.00004920608,0.00017131247],"category_scores_gemma":[0.00015175113,0.00019024625,0.000108925255,0.00031438362,0.00014976984,0.00015491004,0.00019349641,0.0003391468,0.0000062974527],"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.0032350442,0.0008048961,0.0035632474,0.0000815956,0.0002540091,0.00008495797,0.004345664,0.049583185,0.0029633949,0.097305275,0.0052512763,0.83252746],"study_design_scores_gemma":[0.0061569354,0.0034390579,0.0031723345,0.0000607522,0.000039908697,0.000038689323,0.000849378,0.96285325,0.00032950527,0.0038753045,0.018687418,0.00049748144],"about_ca_topic_score_codex":0.00020709552,"about_ca_topic_score_gemma":0.000020619485,"teacher_disagreement_score":0.91327006,"about_ca_system_score_codex":0.000023215169,"about_ca_system_score_gemma":0.00016801838,"threshold_uncertainty_score":0.7758017},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04990838,0.00016393598,0.94570905,0.0009928644,0.00090408616,0.0004071491,0.000007605565,0.00012142248,0.0017854765],"genre_scores_gemma":[0.996028,0.000017351666,0.0023982462,0.0010629283,0.000044674885,0.0001624137,0.0000052315445,0.000009251761,0.00027191782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778444,0.0003252553,0.00045586925,0.00046079062,0.0005914583,0.00038221828],"domain_scores_gemma":[0.9986194,0.0006218805,0.00018326644,0.00037469948,0.00006835315,0.00013245117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010939083,0.00023210688,0.00040003084,0.0003111738,0.000392632,0.00031841814,0.0007107278,0.000069891095,0.00017966185],"category_scores_gemma":[0.00015056059,0.0001976257,0.00008713485,0.00043561315,0.00003992053,0.00030758485,0.00027807633,0.00092417176,0.000023306966],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004688823,0.000114972616,0.0010443432,0.00000796093,0.000022219192,0.00010974249,0.003574676,0.005568008,0.00007693048,0.004757357,0.0007421514,0.98351276],"study_design_scores_gemma":[0.006676978,0.00065808475,0.0019351686,0.000082970306,0.000006985438,0.000037629627,0.0009328086,0.9746068,0.000026701304,0.0031905824,0.011502248,0.0003430389],"about_ca_topic_score_codex":0.000083794715,"about_ca_topic_score_gemma":0.000016601614,"teacher_disagreement_score":0.98316973,"about_ca_system_score_codex":0.000047336962,"about_ca_system_score_gemma":0.000100283054,"threshold_uncertainty_score":0.80589426},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024312763,0.000023389039,0.9712306,0.00024084072,0.0020312916,0.000240199,0.000009378792,0.0012595418,0.0006519561],"genre_scores_gemma":[0.9588168,0.0001477947,0.007992747,0.00008484107,0.0003444357,0.0000010205838,0.0001407667,0.000037727055,0.032433856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753964,0.00022390042,0.00027022714,0.0012930379,0.00016898946,0.000504183],"domain_scores_gemma":[0.99814063,0.000127566,0.00033413185,0.0010595152,0.00012685859,0.00021128103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037999844,0.00038747126,0.00037797083,0.0003602466,0.00030080645,0.00016045941,0.002013253,0.0002971616,0.000036622223],"category_scores_gemma":[0.00013752529,0.00044608917,0.0002840417,0.00061933463,0.00006971804,0.0002451281,0.003788554,0.0016524028,0.00044952222],"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.000012943259,0.000064063344,0.0013094521,0.000044656656,0.00008818134,0.00036266883,0.00031251958,0.9869823,0.000010905639,0.0089663835,0.00024554168,0.0016003748],"study_design_scores_gemma":[0.0008461553,0.00008158368,0.0011944354,0.00009653575,0.000042748827,0.0000026481455,0.00008042388,0.9919767,0.0000100049965,0.0015412852,0.0036433593,0.00048412784],"about_ca_topic_score_codex":0.0008645176,"about_ca_topic_score_gemma":0.000058944333,"teacher_disagreement_score":0.9632379,"about_ca_system_score_codex":0.00019407104,"about_ca_system_score_gemma":0.00020342847,"threshold_uncertainty_score":0.9997991},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028890015,0.000027704273,0.9951828,0.0010509461,0.000580351,0.000024632627,0.00013996597,0.000024405093,0.000080176374],"genre_scores_gemma":[0.7928751,0.000008142141,0.20654258,0.00010641833,0.0001672357,7.4440214e-7,0.000054525666,0.000008465646,0.00023679294],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935603,0.000030937426,0.00019527572,0.000068888665,0.00015447062,0.00019438869],"domain_scores_gemma":[0.99923474,0.000060873845,0.00013224209,0.00009018483,0.00016718463,0.00031476823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022452949,0.000057550147,0.00008789674,0.00020463555,0.00012796641,0.00016097828,0.00031968273,0.000023885828,0.000022191174],"category_scores_gemma":[0.0005730483,0.000053494634,0.000021666701,0.00036738208,0.000029996672,0.00013868953,0.000012655046,0.00014782343,0.000042308104],"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.000005218798,0.000016250919,0.00502465,0.00011998302,0.00008087416,0.0033112948,0.0023757888,0.1033106,0.00007003818,0.19912218,0.41390285,0.2726603],"study_design_scores_gemma":[0.0002781946,0.00012488339,0.02037937,0.00005788816,0.0000134998,0.00029759697,0.000040459432,0.93906873,0.00004649982,0.026876876,0.012662896,0.00015309763],"about_ca_topic_score_codex":0.0006660922,"about_ca_topic_score_gemma":0.001571461,"teacher_disagreement_score":0.83575815,"about_ca_system_score_codex":0.000054055974,"about_ca_system_score_gemma":0.0011870894,"threshold_uncertainty_score":0.21814479},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032960933,0.00007130489,0.9940857,0.00049144635,0.0011649932,0.00048051556,0.0000034607115,0.00017189381,0.0002345888],"genre_scores_gemma":[0.8250301,0.000018135488,0.17326333,0.00043254188,0.0003206965,0.0000425768,0.0000072230505,0.000046894183,0.00083850103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677837,0.00018096721,0.000608614,0.0010924782,0.0008117647,0.0005277932],"domain_scores_gemma":[0.99633396,0.0021743733,0.00038107956,0.00086318085,0.00019931945,0.000048115722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0043017436,0.00034424965,0.00044981504,0.00064004865,0.00035001268,0.00034656105,0.0022160574,0.00018551403,0.0000022678348],"category_scores_gemma":[0.0006776432,0.00026637904,0.00015851732,0.0010107377,0.00029949305,0.0003531159,0.0005717622,0.001374494,0.000006512256],"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.000008175113,0.000020275143,0.00013969348,0.00008850936,0.000006028933,0.000013081831,0.0027614573,0.15963264,0.000178478,0.0009270332,0.000001681116,0.83622295],"study_design_scores_gemma":[0.00028756683,0.0002789265,0.0022664953,0.00031453493,0.0000054090046,0.000025285692,0.0000014517594,0.93504286,0.00063072395,0.060421158,0.0003714189,0.0003541515],"about_ca_topic_score_codex":0.00012857138,"about_ca_topic_score_gemma":0.00024182975,"teacher_disagreement_score":0.8358688,"about_ca_system_score_codex":0.00015768588,"about_ca_system_score_gemma":0.00026182435,"threshold_uncertainty_score":0.99997884},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91286707,0.0006099934,0.03276918,0.0062808227,0.0015829197,0.0012849842,0.000022425334,0.00083681586,0.04374577],"genre_scores_gemma":[0.9948067,0.0000067071355,0.0034758125,0.00024417517,0.000028720931,0.00008645527,9.852125e-7,0.000015625108,0.0013348022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830544,0.00003059281,0.00023102148,0.00036905863,0.00077139615,0.00029251515],"domain_scores_gemma":[0.9993998,0.000047604703,0.0002580055,0.00018914239,0.000052852472,0.000052629104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060503714,0.0001687919,0.00018065184,0.00010657921,0.00058907294,0.00009077561,0.0011765138,0.000018122899,0.000045658384],"category_scores_gemma":[0.000055240875,0.00011928632,0.00012031499,0.00040655458,0.00004167911,0.0001181296,0.0014752323,0.0004972352,0.0000033519282],"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.00004129985,0.00031019494,0.00079362764,0.00006430878,0.000037278412,0.0000013720656,0.003496643,0.45708725,0.0033401726,0.5279143,0.0007094203,0.006204132],"study_design_scores_gemma":[0.00041043022,0.000250817,0.0001357919,0.000025517367,0.000007677729,0.000014518399,0.00012315925,0.9787383,0.0055315276,0.011891608,0.002710026,0.00016060327],"about_ca_topic_score_codex":0.00009070305,"about_ca_topic_score_gemma":2.5011136e-7,"teacher_disagreement_score":0.5216511,"about_ca_system_score_codex":0.000099885416,"about_ca_system_score_gemma":0.00002136491,"threshold_uncertainty_score":0.4864355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39320007,0.00019077623,0.5792372,0.022517363,0.0024020832,0.0001417481,0.0000011860933,0.00016677426,0.002142777],"genre_scores_gemma":[0.99780035,0.000023295679,0.0015775145,0.00013343128,0.00014594053,5.644966e-7,3.0570618e-7,0.00000508234,0.00031350055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998919,0.00029509785,0.00018241367,0.00007498143,0.0003656525,0.00016283493],"domain_scores_gemma":[0.9993744,0.00013148753,0.00015593744,0.00022491737,0.00006798803,0.00004529688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013663607,0.00006110897,0.000076205564,0.00006230918,0.00035970713,0.00006740047,0.0009130976,0.000017863465,0.000009892718],"category_scores_gemma":[0.00008576088,0.000028747012,0.00006101777,0.0006489371,0.00004627747,0.000047664453,0.00020024522,0.00031606856,0.00006215008],"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.000004977112,0.000033258977,0.0006789099,0.000009788559,0.000032202133,0.000013730466,0.008575816,0.7714159,0.0006445486,0.0015244288,0.0048917984,0.21217465],"study_design_scores_gemma":[0.00019381405,0.000035666402,0.018557737,0.000049802056,0.0000072841685,0.00015643865,0.00015021613,0.9777418,0.00042153604,0.0017132311,0.00091425446,0.000058245205],"about_ca_topic_score_codex":0.000017687207,"about_ca_topic_score_gemma":0.0000019228387,"teacher_disagreement_score":0.6046003,"about_ca_system_score_codex":0.000014613802,"about_ca_system_score_gemma":0.000056258577,"threshold_uncertainty_score":0.27666128},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018759774,0.000008086534,0.9951562,0.00008053617,0.0003772,0.0002023665,0.00001175406,0.0022755913,0.000012258781],"genre_scores_gemma":[0.33142784,0.000010584141,0.6677558,0.000043811786,0.00004788479,0.0000940404,0.0000035247201,0.0000406682,0.000575889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887323,0.000013268716,0.00023419244,0.00032942754,0.00017818392,0.00037170545],"domain_scores_gemma":[0.99912953,0.00045580318,0.000037060057,0.0002711317,0.000022488928,0.00008395727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023391475,0.00018138395,0.00018001827,0.00072167267,0.00010901107,0.00008934643,0.0003287078,0.00007812324,0.0000041737762],"category_scores_gemma":[0.00005086315,0.00020253783,0.00009219098,0.0010502351,0.000004683089,0.0002720828,0.000004398675,0.0003477769,0.000013895617],"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.0000020546406,0.0000116988995,0.000015931924,0.00004871881,0.000010692256,0.0000055833407,0.0002369701,0.84642017,0.00012400211,0.00028556606,0.000048572543,0.15279004],"study_design_scores_gemma":[0.00022849982,0.000050075163,0.00008711365,0.00015966246,0.000006217571,0.000004431193,0.000007108324,0.9955756,0.003182017,0.00022379367,0.00025705076,0.00021841281],"about_ca_topic_score_codex":0.000041553936,"about_ca_topic_score_gemma":0.000003990452,"teacher_disagreement_score":0.32955185,"about_ca_system_score_codex":0.000074507654,"about_ca_system_score_gemma":0.000049530354,"threshold_uncertainty_score":0.8259253},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009577524,0.00008396532,0.89729244,0.0012758841,0.00028939778,0.0003526958,0.000026949356,0.00015063217,0.099570304],"genre_scores_gemma":[0.40161794,0.002061601,0.5917883,0.0005928717,0.00016118969,0.00002167462,0.000056340832,0.000034888086,0.0036651953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983483,0.00004895386,0.0005261152,0.00024838428,0.0005829592,0.00024526264],"domain_scores_gemma":[0.9971719,0.00037006653,0.00032537323,0.0015808318,0.00045993295,0.00009192984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010772076,0.00017929108,0.00024885658,0.0018463206,0.0003932673,0.00036442527,0.0030142274,0.00009091294,0.0000026625755],"category_scores_gemma":[0.00011909604,0.00017419753,0.000045014192,0.0010982518,0.0009064924,0.00154704,0.0033693332,0.00049603055,0.000032030297],"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.0000010881954,0.0000117587115,0.000031138872,0.000031758074,0.0000048908273,2.508103e-7,0.0046095,0.051775947,0.0000058213272,0.69262016,0.0000063471152,0.25090134],"study_design_scores_gemma":[0.00012140006,0.000035860852,0.00094745803,0.00022303055,0.0000022648605,0.000006779234,0.000040462895,0.9931331,0.000015275038,0.0027698637,0.0025328647,0.00017161528],"about_ca_topic_score_codex":0.00020596516,"about_ca_topic_score_gemma":0.000006853202,"teacher_disagreement_score":0.9413572,"about_ca_system_score_codex":0.00013137706,"about_ca_system_score_gemma":0.0007418311,"threshold_uncertainty_score":0.7103569},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009142198,0.000054190285,0.9833388,0.0031028779,0.0029837163,0.00014162365,0.0000029307178,0.0004522096,0.0007814707],"genre_scores_gemma":[0.52170205,0.000060585397,0.47640803,0.00046294922,0.00046192293,0.000036486683,0.000022670953,0.000024194645,0.00082112174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837506,0.00017225128,0.00024034322,0.00051658443,0.000297908,0.00039783856],"domain_scores_gemma":[0.99908155,0.00014860445,0.000077885095,0.0005088767,0.00007036213,0.00011273219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045966436,0.00015945011,0.0001853221,0.0003730123,0.00018336036,0.00019480522,0.0009530962,0.00014829154,0.000021668076],"category_scores_gemma":[0.00034005631,0.00016081594,0.000052181862,0.002262658,0.00007821676,0.00047781007,0.00012477025,0.00056834996,0.00027035645],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021518103,0.00005379888,0.0005165348,0.0000062605322,0.000009038533,0.000048599406,0.0056509273,0.007819761,0.00007117196,0.1343306,0.0030445913,0.8484272],"study_design_scores_gemma":[0.000015142677,0.00007920446,0.0015207265,0.000033629552,0.0000019968284,0.0000020465782,0.0016355104,0.6624551,0.0030506034,0.3283583,0.0026290435,0.00021874357],"about_ca_topic_score_codex":0.000049277092,"about_ca_topic_score_gemma":0.000021158981,"teacher_disagreement_score":0.8482085,"about_ca_system_score_codex":0.000053537457,"about_ca_system_score_gemma":0.00005528443,"threshold_uncertainty_score":0.65578836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036102668,0.0000063276607,0.9841169,0.0048642433,0.006916231,0.00026695133,7.3235367e-7,0.00017844065,0.00003986568],"genre_scores_gemma":[0.07282251,0.000008034801,0.92173827,0.00019061175,0.0050778785,0.000018550758,0.000014562693,0.000036707912,0.00009284503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980714,0.00023641078,0.00048223944,0.00026804867,0.000667951,0.0002739929],"domain_scores_gemma":[0.9986088,0.00016386512,0.00038480546,0.0002693908,0.00040165495,0.0001714725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014564514,0.00016948555,0.00027479828,0.0006401404,0.00020475047,0.0002681797,0.00045753428,0.00008013816,0.000012385286],"category_scores_gemma":[0.0004971051,0.00015091072,0.00013127463,0.0015214031,0.000011793823,0.00043892144,0.00007253548,0.0003822388,0.000033760145],"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.00005465748,0.00011064345,0.00003377982,0.0000091483125,0.000014006119,0.000024420333,0.00037867718,0.9354677,0.00006311261,0.0004482551,0.0007832086,0.06261235],"study_design_scores_gemma":[0.0013214343,0.00095651584,0.00006868987,0.000064656364,0.000014609037,0.00002200757,0.000027964488,0.99241805,0.00025483157,0.00032258886,0.004367645,0.00016098155],"about_ca_topic_score_codex":0.000004134058,"about_ca_topic_score_gemma":1.2028381e-7,"teacher_disagreement_score":0.06921224,"about_ca_system_score_codex":0.00011197077,"about_ca_system_score_gemma":0.00012618264,"threshold_uncertainty_score":0.6153961},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36542195,0.00006227905,0.63307995,0.00028484847,0.00040912532,0.000100954356,0.000022827167,0.0003360889,0.00028197118],"genre_scores_gemma":[0.99328864,0.00015111342,0.0024369543,0.000013432634,0.000084671185,3.2821745e-7,0.000041714637,0.000012153235,0.003971013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988115,0.00016209667,0.00015906709,0.0006037864,0.000075672484,0.00018790016],"domain_scores_gemma":[0.9990325,0.00020365791,0.00021631131,0.00037221276,0.00008519517,0.00009009798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014949293,0.0001645986,0.00024712613,0.00015743115,0.00013493739,0.000059609425,0.00057227106,0.0001287938,0.000013978604],"category_scores_gemma":[0.000120601704,0.00018512116,0.000093771225,0.00036932284,0.00013332297,0.00012925052,0.0013574454,0.0006015272,0.000013598727],"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.00000907686,0.0001693776,0.03143161,0.000115032715,0.00013030104,0.00013382208,0.0012036491,0.8515639,0.000036834408,0.1062481,0.00018583439,0.008772472],"study_design_scores_gemma":[0.00025905663,0.00006296163,0.008271982,0.000079710975,0.000037454804,0.000001667804,0.00017670162,0.9829417,0.000042804324,0.0071286685,0.00077791576,0.00021936269],"about_ca_topic_score_codex":0.00030317408,"about_ca_topic_score_gemma":0.000026639114,"teacher_disagreement_score":0.630643,"about_ca_system_score_codex":0.0000261235,"about_ca_system_score_gemma":0.000083157924,"threshold_uncertainty_score":0.7549022},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93408275,0.000060749608,0.0617975,0.00056843774,0.00037682187,0.00019285748,0.0000022208924,0.00044887062,0.0024697967],"genre_scores_gemma":[0.9957203,0.000040788287,0.0027746903,0.00012343447,0.00006187865,8.023172e-7,0.0000039379975,0.000014578722,0.0012595463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827826,0.0004443071,0.00013316172,0.00076978735,0.000090839705,0.0002836402],"domain_scores_gemma":[0.9984214,0.000807324,0.00012871818,0.00053604366,0.000041931766,0.000064596046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077843375,0.00020695344,0.00021355478,0.00020642755,0.0002385596,0.0001888371,0.0013000363,0.00013680234,0.0000034045959],"category_scores_gemma":[0.00027421105,0.00018773587,0.0000588802,0.0006186949,0.000071412476,0.00015587409,0.0017756453,0.0015808409,0.000051824467],"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.000008738794,0.00006806173,0.37881145,0.00016905193,0.00005315545,0.0036144804,0.0036590178,0.5794294,0.000032923886,0.012731285,0.00019921278,0.021223223],"study_design_scores_gemma":[0.0001826466,0.00003842295,0.07898133,0.00010493231,0.000011481216,0.000025925145,0.00022121973,0.9100656,0.0000012084023,0.0099277,0.00021761763,0.00022189457],"about_ca_topic_score_codex":0.0010742545,"about_ca_topic_score_gemma":0.000023090804,"teacher_disagreement_score":0.33063623,"about_ca_system_score_codex":0.000039514525,"about_ca_system_score_gemma":0.00006394164,"threshold_uncertainty_score":0.7655647},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01797853,0.00034445123,0.9736248,0.00045304396,0.0025058456,0.0006405968,0.000021104592,0.001840891,0.0025907138],"genre_scores_gemma":[0.9937193,0.0000020209657,0.002333464,0.00004704635,0.0005314326,0.00037019534,0.00012283165,0.000043485314,0.0028302178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778855,0.00039828668,0.00036045988,0.00061142945,0.00027119397,0.00057010667],"domain_scores_gemma":[0.99795866,0.001024878,0.00020703595,0.00043235873,0.00021498364,0.00016207721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010359692,0.000251022,0.00035541903,0.0003666198,0.0006725809,0.00037431877,0.00063732744,0.000081865066,0.000009399915],"category_scores_gemma":[0.00034350474,0.0002435771,0.00013816361,0.00078391633,0.00004195325,0.00029809095,0.0001157762,0.0003404468,0.0007571502],"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.0002664803,0.0012786756,0.0068577914,0.0047031944,0.00078748254,0.00038892377,0.023235027,0.2877297,0.00782283,0.14155318,0.03002574,0.49535096],"study_design_scores_gemma":[0.0013413918,0.000171575,0.00041970183,0.00016656998,0.000012074636,0.0000074683057,0.00016504989,0.9723144,0.0012086902,0.00041704785,0.023448534,0.00032748608],"about_ca_topic_score_codex":0.00006650682,"about_ca_topic_score_gemma":0.000013326069,"teacher_disagreement_score":0.9757408,"about_ca_system_score_codex":0.00010820597,"about_ca_system_score_gemma":0.00017665108,"threshold_uncertainty_score":0.99327856},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027857104,0.0003769688,0.99468726,0.0016218661,0.0013139736,0.00020931163,0.000004162655,0.00039458653,0.0013640262],"genre_scores_gemma":[0.09900966,0.00026420283,0.89150876,0.0031718013,0.001398309,0.000026450853,0.000022420902,0.00010640234,0.0044920095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970686,0.000045054116,0.0003660426,0.0012596837,0.0007847554,0.00047590103],"domain_scores_gemma":[0.9977587,0.0009143047,0.00018980583,0.000848876,0.00014508059,0.00014325016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090793724,0.00038062743,0.00036268038,0.0008970047,0.00034308142,0.0007841751,0.0015111035,0.00021210319,0.000011160792],"category_scores_gemma":[0.00020270214,0.00035183187,0.000073931646,0.0006343465,0.0004502398,0.00048161126,0.0011309324,0.0006955341,0.00011403913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012930492,0.000011577737,0.000041703635,0.00003548987,0.000007938272,0.00006652627,0.00042249676,0.01770202,0.000027835613,0.053939838,0.000018751089,0.92772454],"study_design_scores_gemma":[0.00014326638,0.00011547452,0.00027395636,0.0002970427,0.0000062850627,0.000049621172,1.4039931e-7,0.775968,0.00008512034,0.22225332,0.0004051407,0.00040258945],"about_ca_topic_score_codex":0.000040147454,"about_ca_topic_score_gemma":0.000028448729,"teacher_disagreement_score":0.9273219,"about_ca_system_score_codex":0.00010049626,"about_ca_system_score_gemma":0.00022193237,"threshold_uncertainty_score":0.99989337},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54213935,0.000014667907,0.44076288,0.004686024,0.00052517426,0.000108887034,0.0000025380505,0.00254784,0.009212652],"genre_scores_gemma":[0.66448236,0.000047534122,0.24214225,0.0020392549,0.00055374467,0.00003909504,0.000098521145,0.000050807885,0.09054642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987638,0.00009838472,0.00014392157,0.00041149405,0.00023376035,0.00034864314],"domain_scores_gemma":[0.99928844,0.0002588551,0.00003297917,0.00023574522,0.00003532853,0.00014865388],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039824477,0.00011105634,0.00013057792,0.0001371312,0.00019265368,0.00021476106,0.0004400938,0.000035268826,0.00016068641],"category_scores_gemma":[0.00014253738,0.00009578375,0.000040512285,0.0008006255,0.000009443497,0.00017646066,0.00037711277,0.00021779856,0.003855079],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000114377335,0.000066151,0.008456467,0.000009239175,0.00004898102,0.000109834575,0.00872678,0.020513402,0.0026711328,0.0026523587,0.037670486,0.91906375],"study_design_scores_gemma":[0.00025786564,0.00024108145,0.005567133,0.000019116793,0.000002667812,0.0000024063227,0.0004301944,0.89523005,0.0010443771,0.00406716,0.09286886,0.00026908913],"about_ca_topic_score_codex":0.0010878422,"about_ca_topic_score_gemma":0.000025923004,"teacher_disagreement_score":0.91879463,"about_ca_system_score_codex":0.00001625334,"about_ca_system_score_gemma":0.000022069074,"threshold_uncertainty_score":0.9969205},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013868487,0.008131942,0.35069644,0.0007992765,0.0030012892,0.0008441952,0.000022592445,0.0076307943,0.62873477],"genre_scores_gemma":[0.0041632415,0.0005529324,0.0053307703,0.00006466075,0.0004526018,0.000013455497,0.00003114985,0.00019695958,0.9891942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971684,0.00007176036,0.00044686903,0.0011181213,0.0006150781,0.00057973206],"domain_scores_gemma":[0.9983976,0.00025821978,0.0003616025,0.00062287285,0.00008690312,0.00027283304],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005417858,0.00063933677,0.0006201384,0.0004064315,0.00044266117,0.0004506989,0.0008145661,0.00036870697,0.00010308255],"category_scores_gemma":[0.00016720805,0.0006389932,0.00017331247,0.00006116131,0.00015683178,0.00010856102,0.0014164539,0.0023166132,0.0009004033],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002764063,0.000041195734,0.0006228606,0.00041238026,0.0005235799,0.00063781353,0.0023281565,0.0049399775,0.00010602453,0.36540228,0.001181316,0.6237768],"study_design_scores_gemma":[0.0010900658,0.000528509,0.0002677887,0.0012943484,0.00012091882,0.00013743939,0.0000089521955,0.51594126,0.000033128643,0.018049818,0.46073204,0.0017956888],"about_ca_topic_score_codex":0.00007590845,"about_ca_topic_score_gemma":0.000025223548,"teacher_disagreement_score":0.6219811,"about_ca_system_score_codex":0.000050827155,"about_ca_system_score_gemma":0.00008297359,"threshold_uncertainty_score":0.9999851},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10131765,0.000008301234,0.8945024,0.0011174965,0.0011512642,0.00028060828,0.000011108585,0.00051275775,0.0010984335],"genre_scores_gemma":[0.98755527,0.00000924039,0.0058067515,0.00025783453,0.00022529632,0.0000013249512,0.000013697536,0.000025833662,0.0061047287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983249,0.00013358232,0.00014305943,0.0009249634,0.00009717808,0.0003763726],"domain_scores_gemma":[0.99776715,0.00083820685,0.00019051982,0.0010233092,0.000093268856,0.00008753026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005852392,0.00025542284,0.00023095777,0.00015940261,0.00048607145,0.00027278552,0.0022231063,0.00015770156,0.000009459119],"category_scores_gemma":[0.00012678547,0.00022141464,0.00025303202,0.00041011188,0.00007491839,0.0000830768,0.0018824375,0.00076039904,0.00014923335],"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.000008512383,0.000024850504,0.00012177642,0.00002636526,0.000046222776,0.000048249403,0.00019401076,0.629212,0.0000016626607,0.36740923,0.0019795184,0.0009275907],"study_design_scores_gemma":[0.00021478896,0.00007406416,0.00032623523,0.00007269293,0.000018875238,0.000001567773,0.000038587,0.95580596,0.000013017366,0.04186989,0.0013077841,0.00025652983],"about_ca_topic_score_codex":0.00010333798,"about_ca_topic_score_gemma":0.000006694417,"teacher_disagreement_score":0.88869566,"about_ca_system_score_codex":0.00008753096,"about_ca_system_score_gemma":0.000111408066,"threshold_uncertainty_score":0.90290266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11441384,0.000026197524,0.8804822,0.0019334758,0.00017834912,0.00012713058,0.000001631461,0.0006916486,0.0021455183],"genre_scores_gemma":[0.7689443,0.00005551037,0.2260696,0.00005639666,0.00011685825,0.000015739162,0.000009181161,0.000026981917,0.004705415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991538,0.00004212647,0.00013034699,0.00025534607,0.00021093848,0.00020745498],"domain_scores_gemma":[0.999228,0.00030279075,0.000101463855,0.00025845697,0.000042026328,0.00006725773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030207806,0.00011166388,0.00013520426,0.00010541964,0.00023616184,0.0001495047,0.0002776923,0.00004707026,0.000013514076],"category_scores_gemma":[0.00024711966,0.00010184127,0.000033238208,0.00035809842,0.000024894387,0.00017331983,0.0002360279,0.00020389888,0.00025100342],"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.000017726303,0.00048418756,0.0065030414,0.0009761049,0.00026424814,0.00007156491,0.18657279,0.020944232,0.011997418,0.37743923,0.0047618337,0.38996762],"study_design_scores_gemma":[0.00020480633,0.00005181305,0.004124536,0.00004228623,0.000010177236,0.000012174109,0.00092886126,0.9784867,0.0007105101,0.0104624685,0.004756097,0.00020957488],"about_ca_topic_score_codex":0.0000104592145,"about_ca_topic_score_gemma":9.97282e-7,"teacher_disagreement_score":0.9575425,"about_ca_system_score_codex":0.00002000472,"about_ca_system_score_gemma":0.000016887327,"threshold_uncertainty_score":0.41529664},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2635052,0.000032965152,0.52924675,0.10937186,0.004664289,0.0011471682,0.000017324552,0.0019828423,0.0900316],"genre_scores_gemma":[0.98971134,0.000025349716,0.007672605,0.0005145417,0.0001545846,0.000020520121,0.0000011110036,0.000018495692,0.0018814375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737066,0.00002975674,0.00052466313,0.000633222,0.0008934595,0.0005482622],"domain_scores_gemma":[0.9983496,0.00019649358,0.00032208025,0.00042328268,0.0006119696,0.00009658508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079062243,0.00028026762,0.00029237065,0.00018480726,0.00032883312,0.0004425043,0.0027170258,0.000104992854,0.00008966231],"category_scores_gemma":[0.00089880783,0.00020737195,0.0001561433,0.001701447,0.00023252581,0.0006267497,0.0006799343,0.00055815803,0.00055260945],"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.000010162114,0.00005585605,0.001131606,0.000035206573,0.000015210407,0.0000019150314,0.0028917107,0.00015881554,0.007070849,0.90272003,0.0016172566,0.08429137],"study_design_scores_gemma":[0.000034120145,0.00016272045,0.00065776805,0.00024888612,0.000010490273,0.000006148432,0.00044939414,0.2988701,0.1499529,0.54759276,0.0016238546,0.00039084713],"about_ca_topic_score_codex":0.000064744854,"about_ca_topic_score_gemma":0.000003758551,"teacher_disagreement_score":0.7262062,"about_ca_system_score_codex":0.00003185914,"about_ca_system_score_gemma":0.00007701293,"threshold_uncertainty_score":0.84563833},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022676013,0.00001604742,0.97456616,0.00062852073,0.0010854659,0.000400539,0.000011765452,0.00043243394,0.00018304585],"genre_scores_gemma":[0.9671586,0.00008712929,0.029401151,0.0000689527,0.00021066859,0.000007739488,0.000076320124,0.000031885895,0.0029575096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998392,0.000088119436,0.00018418442,0.0009659017,0.000048877864,0.0003209062],"domain_scores_gemma":[0.9988097,0.00018301171,0.00017210309,0.00067493203,0.0000821642,0.000078105055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042831874,0.00021993871,0.00025736957,0.00033992613,0.000117696785,0.00014449438,0.0010379453,0.00020340618,0.0000036610625],"category_scores_gemma":[0.000090360816,0.00025573772,0.00014228464,0.0005105833,0.000021937263,0.0003560947,0.0009391514,0.0004994922,0.00003510954],"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.000027411475,0.000060660524,0.0006803504,0.00011687351,0.000032004664,0.000043479773,0.00060161157,0.941051,0.00009371933,0.043783944,0.00015529981,0.013353649],"study_design_scores_gemma":[0.00040320246,0.000041549807,0.00064664986,0.00007917177,0.000010248405,4.5655165e-7,0.00004656966,0.93104523,0.00003428188,0.06670003,0.00072295236,0.00026966288],"about_ca_topic_score_codex":0.00023317267,"about_ca_topic_score_gemma":0.00013224501,"teacher_disagreement_score":0.94516504,"about_ca_system_score_codex":0.00012478122,"about_ca_system_score_gemma":0.00010711641,"threshold_uncertainty_score":0.9999895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37059978,0.0000025987424,0.6271966,0.000119730124,0.0005267914,0.00013753597,0.000004860402,0.0002746212,0.0011374535],"genre_scores_gemma":[0.9981897,0.000011706967,0.0010035416,0.000046710156,0.000029968762,8.787302e-7,0.000015318448,0.000011765748,0.0006904388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983941,0.00018406275,0.00013834091,0.0009159452,0.000107618194,0.00025996054],"domain_scores_gemma":[0.998815,0.00036326732,0.0001600596,0.0005108688,0.000068861955,0.0000819384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022128134,0.00021409255,0.00022181516,0.00046653653,0.000085350395,0.00008511982,0.0009485902,0.0001572069,0.0000066924904],"category_scores_gemma":[0.000097556156,0.00024387827,0.00008957732,0.0007864203,0.000041130657,0.00008168931,0.0011550271,0.00083867327,0.00027772682],"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.000010709906,0.000067282315,0.00062889775,0.000018222321,0.0000111871195,0.00018540367,0.0003343589,0.9357826,0.0000014214103,0.0598868,0.000036495625,0.0030365936],"study_design_scores_gemma":[0.0002852974,0.00005086737,0.012292643,0.00012816327,0.0000052564355,5.029131e-7,0.000030274801,0.9480239,0.000014813322,0.038919024,0.00001473227,0.00023452003],"about_ca_topic_score_codex":0.0003802614,"about_ca_topic_score_gemma":0.000040636416,"teacher_disagreement_score":0.6275899,"about_ca_system_score_codex":0.00020711793,"about_ca_system_score_gemma":0.00012270264,"threshold_uncertainty_score":0.9945067},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16638756,0.0000048826873,0.8314455,0.00006360761,0.00042064206,0.00045727138,0.000039086455,0.00063806504,0.0005433473],"genre_scores_gemma":[0.9870939,0.000020581907,0.009892048,0.000023436865,0.00021142507,0.0000111617765,0.00012539366,0.000035630976,0.0025864209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795705,0.00020279388,0.00015154346,0.0011649731,0.000114493865,0.00040913187],"domain_scores_gemma":[0.9985283,0.00040186796,0.00035375176,0.00036105575,0.00021994424,0.00013509994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002832379,0.00031615264,0.00034425856,0.00024263543,0.00040102823,0.00014570128,0.0007248814,0.0002454684,0.00001024607],"category_scores_gemma":[0.00016738387,0.0003196094,0.00015446586,0.00035156767,0.00007452487,0.00036493302,0.00068976416,0.0009998751,0.00003399941],"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.0008269646,0.00011618885,0.0015180664,0.00020438529,0.00031814812,0.00031140354,0.009219938,0.86936355,0.00036000204,0.004162563,0.00016962588,0.11342916],"study_design_scores_gemma":[0.0015008568,0.0004134306,0.0024747574,0.00061092543,0.00008325261,0.0000053663216,0.0009268774,0.9743348,0.0007666869,0.017659614,0.00051711616,0.0007063672],"about_ca_topic_score_codex":0.00009929826,"about_ca_topic_score_gemma":0.000021410768,"teacher_disagreement_score":0.82155347,"about_ca_system_score_codex":0.00011492913,"about_ca_system_score_gemma":0.00019489348,"threshold_uncertainty_score":0.9999256},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22591089,0.000042840766,0.16644117,0.0949901,0.0016773958,0.0012370929,0.0000023488942,0.0027795038,0.50691867],"genre_scores_gemma":[0.9869783,0.0000029116738,0.0023979293,0.00016997202,0.00017641553,0.000018055796,0.000006523883,0.000011399693,0.010238489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837214,0.00019848773,0.00015157308,0.00038278758,0.00065668626,0.00023835666],"domain_scores_gemma":[0.99882776,0.000567419,0.00011380075,0.0003451633,0.00009500583,0.00005084592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013458361,0.000117501884,0.000096428455,0.000094946394,0.00029064418,0.0001219006,0.00038232558,0.000036403006,0.00007989887],"category_scores_gemma":[0.00028846462,0.000066418936,0.000038043127,0.000568795,0.000015993308,0.00016446396,0.000089108384,0.00044899847,0.00063207693],"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.00011361134,0.000086520835,0.00030857502,0.0000081914,0.00004219857,0.000033581604,0.003484938,0.05065524,0.00019287271,0.006520559,0.019094273,0.91945946],"study_design_scores_gemma":[0.0007269266,0.00041126958,0.04931471,0.000045416717,0.000008609951,0.00000834122,0.0001906297,0.92088145,0.00026795463,0.0007226524,0.027202543,0.0002195143],"about_ca_topic_score_codex":0.00009820652,"about_ca_topic_score_gemma":0.000008328236,"teacher_disagreement_score":0.91923994,"about_ca_system_score_codex":0.00017860527,"about_ca_system_score_gemma":0.000053572236,"threshold_uncertainty_score":0.81242806},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009800292,0.0000052157407,0.9870954,0.0010483607,0.00004923229,0.0002410524,6.4679483e-7,0.00020616934,0.0015536026],"genre_scores_gemma":[0.46675715,0.000008780235,0.531399,0.00018537958,0.000034344088,0.00010725411,0.0000055732116,0.000009050771,0.0014934489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944264,0.000013056597,0.0000980103,0.00021907635,0.00006250505,0.00016468884],"domain_scores_gemma":[0.99983597,0.000029832661,0.000007260279,0.000053525728,0.000025193365,0.000048231745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022795898,0.000056528177,0.00006669582,0.00018629669,0.0001059854,0.00007616235,0.000113169655,0.000019425646,0.0000019271447],"category_scores_gemma":[0.000038813152,0.000049235965,0.000012990003,0.0011676948,0.0000042136603,0.00011610022,0.000027754899,0.000050932915,0.000004134703],"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.0000032563214,0.000056317946,0.00028944976,0.000025382107,0.0000023734017,3.001222e-7,0.0018897005,0.9120137,0.0003461014,0.0073978007,0.00037927632,0.07759636],"study_design_scores_gemma":[0.00022865862,0.000044930068,0.00023784683,0.0000038145772,7.537462e-7,0.0000024043773,0.00006760855,0.9982131,0.00012711204,0.0000307949,0.00097118894,0.00007180243],"about_ca_topic_score_codex":0.00005105308,"about_ca_topic_score_gemma":0.000020294376,"teacher_disagreement_score":0.45695686,"about_ca_system_score_codex":0.000009869848,"about_ca_system_score_gemma":0.000022904653,"threshold_uncertainty_score":0.20077844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07155182,0.000080434555,0.9254903,0.00026380035,0.0010754608,0.00056233763,0.000047269616,0.0007782983,0.00015026447],"genre_scores_gemma":[0.8481788,0.00013857085,0.14402461,0.00013628742,0.00060443097,0.000013204117,0.00010923064,0.00011869512,0.0066761933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972297,0.00026888592,0.00026664627,0.0015026223,0.00015557933,0.0005765418],"domain_scores_gemma":[0.99680936,0.0005828477,0.0003802122,0.0016726371,0.00021495362,0.0003399621],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047226084,0.0004664429,0.00056158344,0.0004588794,0.00040266276,0.00025752163,0.0028181819,0.00029677807,0.000016145266],"category_scores_gemma":[0.00061323686,0.0005169988,0.00039051162,0.0009177736,0.00011696112,0.00033751864,0.002712621,0.00060910586,0.00002862963],"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.00031371374,0.0002788333,0.00248095,0.00032585845,0.00068588654,0.0010541395,0.0017413622,0.9316597,0.0002742265,0.055375814,0.002321758,0.0034877784],"study_design_scores_gemma":[0.0025021953,0.000054711774,0.00031234993,0.00012540132,0.000084909174,0.000005965566,0.00012219098,0.9556285,0.00021324378,0.039783612,0.00057690183,0.000590008],"about_ca_topic_score_codex":0.00079939666,"about_ca_topic_score_gemma":0.00006074479,"teacher_disagreement_score":0.7814657,"about_ca_system_score_codex":0.00017205795,"about_ca_system_score_gemma":0.00036147377,"threshold_uncertainty_score":0.99972814},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017101184,0.000018227534,0.9235348,0.004312054,0.00006831863,0.00006474569,4.2897827e-7,0.0008132506,0.05408695],"genre_scores_gemma":[0.9421256,0.00000488812,0.022335226,0.00034385704,0.000042480082,0.0000059884837,0.000001606196,0.0000075159455,0.03513283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918973,0.00004166957,0.000067215755,0.00023498849,0.00023930053,0.0002270751],"domain_scores_gemma":[0.99951404,0.00006266671,0.000011251042,0.0003092216,0.000034628065,0.00006818759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002446787,0.00006858125,0.00008062054,0.000082998646,0.00008393336,0.00011194576,0.0004536027,0.000018682906,0.00003195967],"category_scores_gemma":[0.0000059161453,0.000045576355,0.00002230723,0.00051857525,0.000020698542,0.00021888629,0.00015361901,0.00012357831,0.0005334127],"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.000004379691,0.000023814253,0.0005790567,0.000009210266,0.000015122449,0.000060902687,0.0013315835,0.023989255,0.000053485695,0.2169649,0.007841998,0.7491263],"study_design_scores_gemma":[0.00019456426,0.00007809782,0.0007608613,0.000007129617,6.6105997e-7,0.000007771899,0.000073876916,0.99480134,0.00016600415,0.0016146253,0.0022099921,0.00008504979],"about_ca_topic_score_codex":0.00022832426,"about_ca_topic_score_gemma":0.000044919667,"teacher_disagreement_score":0.9708121,"about_ca_system_score_codex":0.0000071482027,"about_ca_system_score_gemma":0.00003789999,"threshold_uncertainty_score":0.6856119},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024265673,0.000010267798,0.9733664,0.0004514279,0.0005528006,0.00054257445,0.00003369433,0.0004985296,0.00027863166],"genre_scores_gemma":[0.93917406,0.00008040981,0.052574575,0.00004479573,0.00003549447,0.000009656391,0.00017825558,0.000040775834,0.0078619765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832654,0.00012682666,0.00026198785,0.00086169114,0.00010129984,0.00032164966],"domain_scores_gemma":[0.9982718,0.00048634523,0.00030984252,0.0007245237,0.000118633245,0.00008880922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035871175,0.00024963723,0.00026372803,0.0005815565,0.00015121377,0.00013764655,0.0008711183,0.00019713251,0.0000049234372],"category_scores_gemma":[0.00015287526,0.00028552,0.00012747863,0.0008908499,0.0000332585,0.00020381263,0.0005666697,0.0006569549,0.000133946],"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.000006281443,0.00005234129,0.00070342823,0.00008449101,0.000018407278,0.000027425436,0.0001949139,0.8470628,0.0000012050907,0.15123373,0.00021962327,0.00039534364],"study_design_scores_gemma":[0.00035251878,0.00006126962,0.0007361396,0.00016584454,0.00001374023,6.475717e-7,0.0000072533,0.75182074,0.0000035721275,0.2465466,0.00006541204,0.0002262414],"about_ca_topic_score_codex":0.00022978237,"about_ca_topic_score_gemma":0.0000869671,"teacher_disagreement_score":0.9207918,"about_ca_system_score_codex":0.00020062276,"about_ca_system_score_gemma":0.00015059541,"threshold_uncertainty_score":0.9999597},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013106182,0.000013626232,0.9789292,0.0071472246,0.00007067867,0.00011443951,0.000002467675,0.00039850734,0.00021763674],"genre_scores_gemma":[0.8671776,0.00004395747,0.1264052,0.0012288974,0.00070535654,0.00026975182,0.00044528348,0.000060015347,0.0036639182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970281,0.00019541201,0.0002821901,0.00053761265,0.0015422663,0.00041440627],"domain_scores_gemma":[0.9981986,0.00085532217,0.00012297207,0.0002830655,0.0001442855,0.00039573538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013111539,0.0001732857,0.0003616384,0.00042180027,0.00026977167,0.00017212497,0.00066999666,0.0001011045,0.0005681377],"category_scores_gemma":[0.0022815624,0.00012869858,0.00020192625,0.0025773179,0.00015576593,0.00034541733,0.00020242059,0.00047596486,0.00014335144],"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.000078119,0.00025772644,0.0017837826,0.000104323604,0.0028483882,0.00077107374,0.0048923944,0.013935048,0.0007641993,0.00046724666,0.0039040225,0.9701937],"study_design_scores_gemma":[0.00063014036,0.00012326059,0.0015943778,0.000027867896,0.00027497462,0.000009402933,0.00035082444,0.9961903,0.00023518018,0.00015803146,0.00022994183,0.00017570074],"about_ca_topic_score_codex":0.00012666159,"about_ca_topic_score_gemma":0.000050427858,"teacher_disagreement_score":0.9822552,"about_ca_system_score_codex":0.00003474146,"about_ca_system_score_gemma":0.00016959649,"threshold_uncertainty_score":0.6220709},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001069821,0.00024236758,0.9905905,0.00036905418,0.0009376677,0.00037481554,0.0000023755274,0.00094043306,0.005472931],"genre_scores_gemma":[0.8547546,0.0002422631,0.13638316,0.0002862988,0.0013728664,0.000052704938,0.00003103751,0.00022462883,0.006652417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99477214,0.00013307763,0.00043403666,0.0022815422,0.0013778014,0.0010014339],"domain_scores_gemma":[0.99685955,0.0011071675,0.0005093095,0.0007133853,0.00062441325,0.00018615255],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007051446,0.0008106305,0.00069956726,0.0010588724,0.0008995333,0.0016628486,0.0025260984,0.0002757668,0.000016567656],"category_scores_gemma":[0.00020337828,0.0006675376,0.000120163255,0.0018051055,0.0008637468,0.001418529,0.0011856947,0.0033653886,0.00009022931],"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.000021540842,0.000018957591,0.00023042454,0.000076817305,0.000029206703,0.00026763944,0.005182871,0.51833016,0.000042360265,0.003101989,0.0000033734398,0.47269467],"study_design_scores_gemma":[0.00074045925,0.001909971,0.0018916051,0.0013443225,0.000021661948,0.000242724,0.00004689598,0.96230775,0.00062858383,0.026746765,0.002092317,0.0020269142],"about_ca_topic_score_codex":0.00004887684,"about_ca_topic_score_gemma":0.00008808868,"teacher_disagreement_score":0.8542074,"about_ca_system_score_codex":0.00023855515,"about_ca_system_score_gemma":0.0009751303,"threshold_uncertainty_score":0.9995776},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017610044,0.00008436086,0.9920442,0.0008384676,0.005434927,0.00028967098,0.0000030382748,0.0004593246,0.00082839734],"genre_scores_gemma":[0.16051553,0.00007200324,0.8318306,0.0015625546,0.0040926165,0.000037013084,0.00012365269,0.00019498494,0.0015710184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960548,0.00006331469,0.00044288207,0.001507708,0.0012682655,0.0006629885],"domain_scores_gemma":[0.9978713,0.00040481557,0.00033608402,0.00093936134,0.00026114902,0.00018730237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008245068,0.0005380922,0.00046695638,0.0007992877,0.00041827152,0.00076329935,0.0023066655,0.00028887752,0.000020917492],"category_scores_gemma":[0.000051672654,0.00044758234,0.00013474778,0.0011449201,0.0004927038,0.0005628323,0.00082882424,0.0012067518,0.000017238384],"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.000006706594,0.000017623765,0.00012936146,0.000011459609,0.000011770176,0.000092013506,0.00006984982,0.90449905,7.6656823e-7,0.01320144,0.000025646712,0.081934296],"study_design_scores_gemma":[0.00042665922,0.0002554186,0.00017784841,0.00018265538,0.000007929546,0.000071476425,6.995608e-8,0.9640653,0.000004966472,0.03415157,0.00012145457,0.00053465925],"about_ca_topic_score_codex":0.00003396597,"about_ca_topic_score_gemma":0.000014593041,"teacher_disagreement_score":0.16049792,"about_ca_system_score_codex":0.00011848824,"about_ca_system_score_gemma":0.00026540572,"threshold_uncertainty_score":0.9997976},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005282594,0.00008473445,0.9792858,0.014181693,0.00038558163,0.00015732231,0.0000024416572,0.0003288664,0.00029100297],"genre_scores_gemma":[0.7476931,0.000023360793,0.24939007,0.00023960501,0.00040227157,0.000029223202,0.00002603063,0.00002491351,0.0021714282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986961,0.00019472209,0.00023137963,0.00028904068,0.00028828747,0.0003004801],"domain_scores_gemma":[0.9979653,0.0013931592,0.00016483903,0.0003582306,0.00006238577,0.000056118537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010074669,0.00013621434,0.00016969055,0.0001037861,0.0004496594,0.00019905657,0.00043173024,0.000072486575,0.00002431538],"category_scores_gemma":[0.001682953,0.00009042491,0.00012434737,0.0006522961,0.00004904868,0.00017280233,0.0001620762,0.0005748645,0.000021728547],"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.000037647096,0.00006900111,0.01318367,0.00005744406,0.000085302,0.000015436144,0.0038842962,0.04050262,0.00045173062,0.61366814,0.0018496296,0.32619506],"study_design_scores_gemma":[0.00016629462,0.00014663114,0.0033159575,0.000021957556,0.000011607347,0.000011363496,0.00007657203,0.958629,0.00009878999,0.014502614,0.02290826,0.00011095128],"about_ca_topic_score_codex":0.0001514714,"about_ca_topic_score_gemma":0.000013666377,"teacher_disagreement_score":0.9181264,"about_ca_system_score_codex":0.000016066175,"about_ca_system_score_gemma":0.000051730203,"threshold_uncertainty_score":0.36874208},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27014938,0.00002090185,0.72651327,0.00013533435,0.00059157464,0.00017038427,0.000003261821,0.0009923322,0.0014235784],"genre_scores_gemma":[0.9881499,0.00002864559,0.0016654615,0.00003830422,0.00010134973,0.0000014406154,0.000015894451,0.000040173476,0.009958836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756324,0.0002443402,0.00016522712,0.001357302,0.0001793012,0.0004905764],"domain_scores_gemma":[0.99811715,0.00030033442,0.00024699728,0.0010163692,0.00012678801,0.00019238664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035732,0.0003752974,0.0003536847,0.00034391572,0.00033456227,0.00021513121,0.0016795676,0.00020015189,0.000023859213],"category_scores_gemma":[0.00010000183,0.0003729495,0.00015248849,0.0009197826,0.00009467375,0.000079174875,0.0021148825,0.001434474,0.00040494415],"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.000010594657,0.000047183545,0.0037008824,0.0000654219,0.000052076448,0.0011858573,0.00030848896,0.9799148,0.0000026778598,0.013908321,0.000047596026,0.0007561131],"study_design_scores_gemma":[0.00039819613,0.00009435317,0.003627707,0.00021294896,0.00003805626,0.000009731143,0.00004150267,0.99256223,0.000012441874,0.0020750128,0.00042792535,0.000499905],"about_ca_topic_score_codex":0.00032616098,"about_ca_topic_score_gemma":0.000020504773,"teacher_disagreement_score":0.7248478,"about_ca_system_score_codex":0.00012803596,"about_ca_system_score_gemma":0.00017996384,"threshold_uncertainty_score":0.99987227},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021101316,0.000048018326,0.980586,0.0021973427,0.0031547626,0.00033337966,0.00001943771,0.0039301394,0.0076208045],"genre_scores_gemma":[0.0597858,0.000013523998,0.93219286,0.00031821142,0.00066043175,0.000098979835,0.000041482577,0.00008138086,0.0068073547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617183,0.0002995091,0.0006091253,0.0017026906,0.0005653488,0.0006514743],"domain_scores_gemma":[0.99647903,0.000930556,0.00031495182,0.001836699,0.00024348263,0.00019527516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016179525,0.00048214511,0.0005743302,0.00022407951,0.00028769806,0.00063214434,0.0021555424,0.0002879049,0.00004997637],"category_scores_gemma":[0.0013581835,0.000431702,0.0002171007,0.00062669493,0.000046119087,0.00017077221,0.004871652,0.001406203,0.0003427203],"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":[4.7621518e-7,0.00005024857,0.00934661,0.00014111018,0.00003314856,0.000066488006,0.00029105076,0.010149781,0.000005964841,0.000041119572,0.0014077679,0.9784662],"study_design_scores_gemma":[0.00013846527,0.000037030273,0.008500106,0.00019993985,0.000011538365,0.000009678196,0.000014367028,0.98617995,0.00004876238,0.0035570788,0.0007586669,0.00054442533],"about_ca_topic_score_codex":0.003761415,"about_ca_topic_score_gemma":0.000051515988,"teacher_disagreement_score":0.9779218,"about_ca_system_score_codex":0.00011210583,"about_ca_system_score_gemma":0.00022027563,"threshold_uncertainty_score":0.9998135},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043646943,0.000032054042,0.950394,0.0004936509,0.0019933274,0.00034985747,0.00001337258,0.0010932826,0.00198355],"genre_scores_gemma":[0.9663122,0.00007253399,0.005233064,0.00009353675,0.00025477054,0.0000055794458,0.00005652853,0.000048061505,0.0279237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975182,0.00033871303,0.00018339709,0.0013933153,0.00008399166,0.00048239622],"domain_scores_gemma":[0.9981185,0.0004615589,0.00029910466,0.0008235993,0.00015128394,0.00014595162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005432793,0.00032894398,0.00041668618,0.00034952193,0.0003309464,0.000101541395,0.0017042484,0.00033355158,0.000018294448],"category_scores_gemma":[0.00024935993,0.00038965247,0.00029726184,0.0004474913,0.000090087175,0.00019089188,0.0019727517,0.0011999507,0.00015087845],"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.00010805893,0.00009928895,0.0019868717,0.00019252005,0.00011893643,0.0008293104,0.0012918134,0.8560493,0.000100107165,0.12803605,0.001632606,0.0095551675],"study_design_scores_gemma":[0.00056072016,0.00016081921,0.0038764905,0.00007044913,0.00006147765,0.000009897184,0.000097758035,0.9483457,0.000050786202,0.035430234,0.010760547,0.000575108],"about_ca_topic_score_codex":0.00021385541,"about_ca_topic_score_gemma":0.000030210276,"teacher_disagreement_score":0.9451609,"about_ca_system_score_codex":0.00021614248,"about_ca_system_score_gemma":0.00018797866,"threshold_uncertainty_score":0.9998555},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09390523,0.00001747009,0.8736685,0.0011071343,0.00016800544,0.000111663976,6.752905e-7,0.0009935854,0.030027727],"genre_scores_gemma":[0.9834825,0.0000081882645,0.014959031,0.00015581546,0.000029275581,0.000008882413,0.000004875999,0.0000049675045,0.0013464774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916685,0.00008648141,0.00015591468,0.00017626522,0.000145194,0.00026929306],"domain_scores_gemma":[0.999419,0.00035821952,0.000046452493,0.00009578371,0.00003295657,0.00004761719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043874403,0.00008892568,0.00011558737,0.00021601046,0.000116303454,0.000107550964,0.0002559991,0.000029604615,0.000016024942],"category_scores_gemma":[0.00017187234,0.00007607169,0.00003132825,0.0007681311,0.000021663163,0.0004468968,0.00017462626,0.00029797837,0.00025947503],"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.000017829878,0.00005977906,0.07248076,0.000036074638,0.000052607596,0.000103554594,0.05782646,0.1256834,0.00040445797,0.13657787,0.00049446087,0.60626274],"study_design_scores_gemma":[0.00030549403,0.0000727381,0.12953322,0.000036151247,7.155515e-7,0.000004517722,0.0018163425,0.86586213,0.00018019465,0.0010746786,0.00096351135,0.0001502916],"about_ca_topic_score_codex":0.00009422051,"about_ca_topic_score_gemma":0.0000072008297,"teacher_disagreement_score":0.88957727,"about_ca_system_score_codex":0.000020721529,"about_ca_system_score_gemma":0.000026085054,"threshold_uncertainty_score":0.33351132},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036642785,5.498192e-7,0.9731711,0.001916203,0.0002529149,0.01494674,2.0839379e-7,0.0007792512,0.0088963825],"genre_scores_gemma":[0.0031532855,1.6974208e-7,0.87705743,0.00051941857,0.00063187,0.103092425,0.0000044481635,0.00001519967,0.015525732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920595,0.000037186932,0.00011475427,0.0002313408,0.00013712634,0.00027362935],"domain_scores_gemma":[0.9995433,0.00010152222,0.00004036056,0.00023852807,0.000030104593,0.000046154724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005500833,0.00007039196,0.00008147869,0.000037559174,0.00021470302,0.00022152232,0.000353544,0.000023252638,0.00002293351],"category_scores_gemma":[0.000017778379,0.00005439538,0.000043245374,0.00040310668,0.00000775169,0.00014145393,0.00015719244,0.000081490194,0.00006228171],"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.0000036732356,0.00004205023,0.0027820393,0.00008110143,0.000015467542,0.000007751154,0.00015427487,0.020226955,0.00009020497,0.18570442,0.08452601,0.70636606],"study_design_scores_gemma":[0.00024313851,0.000047594436,0.002824976,0.0000133272,6.8981564e-7,0.0000012254001,0.0000046353757,0.8010387,0.000026469024,0.006026619,0.18969251,0.00008011326],"about_ca_topic_score_codex":0.000008482077,"about_ca_topic_score_gemma":0.0000011082091,"teacher_disagreement_score":0.7808117,"about_ca_system_score_codex":0.000012026769,"about_ca_system_score_gemma":0.000052093994,"threshold_uncertainty_score":0.22181793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2784383,0.00009311384,0.71701264,0.0011699118,0.0011536194,0.00038936827,0.00005317797,0.0008094054,0.00088047376],"genre_scores_gemma":[0.99147505,0.00007661484,0.005587352,0.00008784507,0.0002815424,0.000003830846,0.000118904194,0.00004006831,0.0023287872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970582,0.00035170867,0.0002602714,0.0015474049,0.00029819156,0.00048419382],"domain_scores_gemma":[0.9969365,0.0011123914,0.0004035186,0.0012010428,0.00018045332,0.00016608382],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00047787692,0.0004363354,0.00039219935,0.00019321442,0.0014225118,0.00071267487,0.0025828693,0.00035313555,0.00007211921],"category_scores_gemma":[0.00021800619,0.000388856,0.0003045489,0.00077926635,0.00029984352,0.00050579954,0.004449607,0.0021775877,0.00041824533],"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.00021935289,0.0002541847,0.017762396,0.00006105544,0.0006970951,0.0017491566,0.00620819,0.8530399,0.00006990809,0.07919765,0.003222803,0.037518304],"study_design_scores_gemma":[0.00047926276,0.0000844417,0.021318028,0.00022297964,0.00007632015,0.000007122781,0.0003146081,0.85053176,0.000015992238,0.11651966,0.009897444,0.0005323632],"about_ca_topic_score_codex":0.003987834,"about_ca_topic_score_gemma":0.00052153773,"teacher_disagreement_score":0.7130368,"about_ca_system_score_codex":0.00025275254,"about_ca_system_score_gemma":0.00058150355,"threshold_uncertainty_score":0.9998775},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032004595,0.0010942098,0.837494,0.004501009,0.1257217,0.00076546083,0.000081435996,0.0013702366,0.028939921],"genre_scores_gemma":[0.13058242,0.001829257,0.12855786,0.0065966076,0.046813805,0.001043341,0.0011304652,0.0011468602,0.6822994],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9900168,0.00061298464,0.0022933797,0.003232034,0.0017316444,0.002113142],"domain_scores_gemma":[0.9958366,0.00036512926,0.00062736653,0.0019068335,0.0005546154,0.0007094185],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.001582429,0.0014209507,0.0013320481,0.0006626984,0.0010004023,0.0024340923,0.004170644,0.0010960053,0.0020207807],"category_scores_gemma":[0.0016698607,0.0014423411,0.00064103416,0.0029970666,0.000835084,0.0007558973,0.0019358256,0.005678528,0.020277776],"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.00003545799,0.00015603266,0.0000036008244,0.00014540806,0.0001155183,0.0004632011,0.004645778,0.0026458432,0.00011778127,0.29420328,0.2039273,0.4935408],"study_design_scores_gemma":[0.000011266233,0.00063789217,0.0000026233547,0.0007068855,0.000085165026,0.000094581024,0.0011867069,0.21406987,0.0068363803,0.10151115,0.67301244,0.0018450428],"about_ca_topic_score_codex":0.0012801518,"about_ca_topic_score_gemma":0.00045307714,"teacher_disagreement_score":0.70893615,"about_ca_system_score_codex":0.00031855216,"about_ca_system_score_gemma":0.0013024325,"threshold_uncertainty_score":0.999854},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08151607,0.0000021571657,0.91384786,0.0003017838,0.00014628434,0.00023736073,0.0000044770095,0.00080657937,0.003137435],"genre_scores_gemma":[0.9225402,0.0000025797854,0.07402043,0.00008229253,0.00019439416,0.0001162524,0.000048511214,0.000015604815,0.00297975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908245,0.00006489659,0.00009750941,0.00032087066,0.00016642388,0.0002678532],"domain_scores_gemma":[0.99939406,0.0003009797,0.00007240901,0.00009205103,0.00008042846,0.000060062324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023219988,0.000105136154,0.00011948659,0.00009277938,0.00028474923,0.00009677537,0.0001745289,0.000042380838,0.00001894165],"category_scores_gemma":[0.00016135834,0.00007840754,0.000036507525,0.00028360353,0.000020524616,0.00033054515,0.00006567854,0.00019001047,0.00004340267],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009025351,0.000014869512,0.00018171968,0.000010161582,0.000017526461,0.0000063072534,0.006995769,0.0022792704,0.0029551685,0.00040092456,0.00025791576,0.9867901],"study_design_scores_gemma":[0.0021783395,0.001103513,0.009283407,0.00018331187,0.0000124441995,0.000015462421,0.0025234446,0.9512137,0.023245504,0.003147498,0.006595823,0.0004975127],"about_ca_topic_score_codex":0.000015858117,"about_ca_topic_score_gemma":0.0000035118333,"teacher_disagreement_score":0.9862926,"about_ca_system_score_codex":0.000013769244,"about_ca_system_score_gemma":0.000040702573,"threshold_uncertainty_score":0.31973666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007506926,0.00016695517,0.99008393,0.00047147326,0.0010042309,0.00036182665,0.000009116307,0.00022950287,0.00016603437],"genre_scores_gemma":[0.9478394,0.00037689027,0.050685156,0.00035814918,0.00037380258,0.000049568425,0.000012845104,0.00003745815,0.00026673963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858814,0.00007182995,0.00019164315,0.000614995,0.00020721025,0.00032616043],"domain_scores_gemma":[0.9991188,0.00034203057,0.000048589594,0.00039032474,0.00004134564,0.000058904938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005439707,0.0001814805,0.00015795288,0.0002838163,0.0003923143,0.00030733683,0.00038467752,0.000053760923,0.000002617992],"category_scores_gemma":[0.0000035644566,0.0001640696,0.00002884056,0.0018242048,0.000011414301,0.00037396906,0.000024109893,0.00042732293,0.0000042865627],"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.00002352839,0.000038188915,0.00000959036,0.00015054767,0.00006206802,0.000013947261,0.00026914713,0.6398065,0.000017980037,0.00010708493,0.000011010011,0.35949036],"study_design_scores_gemma":[0.00042213165,0.00016440265,0.000035519522,0.00022806606,0.00008259523,0.000010491163,0.00021755545,0.9888373,0.000086314714,0.00010374058,0.009610398,0.00020145574],"about_ca_topic_score_codex":0.00020667764,"about_ca_topic_score_gemma":0.00049214694,"teacher_disagreement_score":0.9403325,"about_ca_system_score_codex":0.00006727757,"about_ca_system_score_gemma":0.00001976006,"threshold_uncertainty_score":0.6690564},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1858138,0.000010272628,0.8124076,0.0008054117,0.000029534664,0.00037196244,0.00000311544,0.0002969468,0.00026135272],"genre_scores_gemma":[0.9474648,0.0000018900697,0.051638342,0.000064064974,0.000026256623,0.00007022668,0.000096025135,0.000010793143,0.0006275649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909383,0.000070163784,0.00012134563,0.00031036898,0.00020929378,0.00019502704],"domain_scores_gemma":[0.9987212,0.0003873932,0.00013642364,0.00062625145,0.00010597155,0.000022766022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005784825,0.00010344942,0.00011252082,0.00009286632,0.00020904787,0.00005098984,0.00074851286,0.000028486933,0.0000020321543],"category_scores_gemma":[0.00008110687,0.000054909397,0.000016903865,0.00070860446,0.00004463195,0.0002474616,0.00011463644,0.00025854495,0.0000032371515],"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.000654068,0.00012475412,0.0032624535,0.0004283541,0.00015605359,0.0000130917415,0.0074174837,0.23634283,0.3523888,0.0037110576,0.00055125245,0.3949498],"study_design_scores_gemma":[0.0002657019,0.0002993622,0.0013683463,0.00006702975,0.0000068616077,0.000004385671,0.00060757506,0.9198058,0.07713692,0.0000037990328,0.0003370261,0.00009714759],"about_ca_topic_score_codex":0.00008470363,"about_ca_topic_score_gemma":0.00010092965,"teacher_disagreement_score":0.76165104,"about_ca_system_score_codex":0.000017816905,"about_ca_system_score_gemma":0.00010726259,"threshold_uncertainty_score":0.22391401},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06087477,0.007823025,0.9243204,0.0024177972,0.0025720175,0.00016551855,0.000004599265,0.0004967761,0.0013251086],"genre_scores_gemma":[0.99820673,0.0002637204,0.0011399738,0.000020466843,0.00027920795,0.0000066737816,0.000032994252,0.000009818513,0.000040437455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987369,0.00019788096,0.00019212635,0.0003469895,0.00023095775,0.0002951092],"domain_scores_gemma":[0.99952877,0.0001650164,0.000062017396,0.00016693366,0.00002307008,0.00005417181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003553855,0.00013041489,0.00016729781,0.00010246243,0.000069274254,0.0001178941,0.00035631406,0.00007024313,0.0000073269707],"category_scores_gemma":[0.00008125038,0.00012059592,0.000076124306,0.00028021538,0.000028064722,0.00025518463,0.00017768003,0.0006064642,0.000014920438],"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.000007194187,0.000032029824,0.0006832367,0.000024447598,0.000032349504,0.0000641354,0.0035075843,0.12201119,0.000048901962,0.022261228,0.00006586295,0.85126185],"study_design_scores_gemma":[0.00017966541,0.00008381392,0.0044513824,0.000057164965,0.000005237026,0.0000040114824,0.00017981816,0.9910418,0.00007549335,0.00025313083,0.0035442302,0.00012429347],"about_ca_topic_score_codex":0.000008593628,"about_ca_topic_score_gemma":0.000004413333,"teacher_disagreement_score":0.9373319,"about_ca_system_score_codex":0.000054251843,"about_ca_system_score_gemma":0.00002174335,"threshold_uncertainty_score":0.49177587},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09423461,0.006775027,0.89579815,0.0020175157,0.0004096835,0.00005475621,2.6944625e-7,0.00026869823,0.00044128226],"genre_scores_gemma":[0.992182,0.0019181274,0.0019326701,0.000045537712,0.00032933123,8.4863274e-7,3.3351213e-7,0.000010434823,0.0035806869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982792,0.000083277555,0.00011153519,0.00022229574,0.00020995946,0.0010936987],"domain_scores_gemma":[0.9996957,0.000092371694,0.000015411679,0.00008260578,0.000038798873,0.00007506534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011005241,0.000090975635,0.000075142794,0.00013966968,0.00021407373,0.00023225172,0.00023825125,0.000038088867,0.000009766388],"category_scores_gemma":[0.000038755094,0.00007487999,0.000044730947,0.00031401557,0.000018469034,0.00027274035,0.000058171907,0.0019053048,0.000054307744],"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.0000048675556,0.0000139611,0.0001827231,0.0000103836865,0.00005838514,0.000054739543,0.00037947757,0.003737429,0.00026745535,0.18772432,0.00003818141,0.8075281],"study_design_scores_gemma":[0.00015595982,0.0003289033,0.000050434217,0.000034847424,0.000008037813,0.004542992,0.000115783594,0.94055355,0.00005931554,0.048601486,0.005420235,0.00012848037],"about_ca_topic_score_codex":0.000057185545,"about_ca_topic_score_gemma":0.00006237943,"teacher_disagreement_score":0.9368161,"about_ca_system_score_codex":0.00024929675,"about_ca_system_score_gemma":0.0008653766,"threshold_uncertainty_score":0.82777077},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037889353,0.00042149556,0.9919543,0.0023853306,0.0019449334,0.00032489712,0.000058452493,0.00028707305,0.0025855924],"genre_scores_gemma":[0.18083048,0.000032650176,0.80175793,0.0044778455,0.0031385215,0.000057496174,0.00018975513,0.00013602966,0.0093792705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973403,0.000019562052,0.00033624287,0.001249847,0.0005992403,0.00045476374],"domain_scores_gemma":[0.99826044,0.000685822,0.00016619006,0.00061699847,0.00015872587,0.00011179948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005430552,0.00039488776,0.0003518796,0.0005342003,0.00020487727,0.0005282888,0.0014165519,0.00021140909,0.000023531913],"category_scores_gemma":[0.00008143243,0.0003464431,0.0001431968,0.0002626232,0.00022656129,0.00028606562,0.0006754136,0.0007797117,0.000112076625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028278707,0.000014203737,0.000042176307,0.000076726385,0.000020089397,0.00013745941,0.0008723417,0.0040410995,0.000026756461,0.03699238,0.000054040862,0.9577199],"study_design_scores_gemma":[0.00014358285,0.00014887386,0.0005498684,0.0005063086,0.0000114292925,0.00009253581,1.1301192e-7,0.88676167,0.00007835131,0.10911367,0.0021176029,0.00047598573],"about_ca_topic_score_codex":0.000018752089,"about_ca_topic_score_gemma":0.000013182461,"teacher_disagreement_score":0.9572439,"about_ca_system_score_codex":0.00015714267,"about_ca_system_score_gemma":0.00023988904,"threshold_uncertainty_score":0.99989873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023515048,0.0007214287,0.98530346,0.005052608,0.0014458813,0.00029240956,0.0000026768896,0.00039896983,0.006547411],"genre_scores_gemma":[0.2456716,0.0002660889,0.730736,0.0033058883,0.0017106223,0.00003416325,0.00001045617,0.00015006975,0.0181151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661595,0.000027056372,0.00039946774,0.0015830953,0.0007571667,0.0006172684],"domain_scores_gemma":[0.9986121,0.0002890243,0.00009305272,0.00060962315,0.00013561454,0.00026057326],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007265537,0.00053260283,0.0005108616,0.00080103794,0.00034269123,0.0011726152,0.0015391136,0.00022372766,0.000015993312],"category_scores_gemma":[0.00009998709,0.00044036398,0.00010380798,0.0007395949,0.0003938249,0.00036994962,0.000979658,0.0015005535,0.00009369064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036083818,0.000007371327,0.000014428961,0.00007222443,0.000010207078,0.000101203,0.0040926784,0.021776881,0.000086160304,0.016571203,0.00001996013,0.9572441],"study_design_scores_gemma":[0.00025713065,0.00061271555,0.00012490162,0.000933192,0.00001482026,0.0002287156,0.0000014963442,0.8608212,0.00046380347,0.10421293,0.031245261,0.0010838377],"about_ca_topic_score_codex":0.000044294466,"about_ca_topic_score_gemma":0.00005914115,"teacher_disagreement_score":0.95616025,"about_ca_system_score_codex":0.00012202648,"about_ca_system_score_gemma":0.00021169848,"threshold_uncertainty_score":0.9998643},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38090575,0.000004417645,0.6184285,0.00034313934,0.000023020453,0.000105090345,8.477773e-7,0.00012670003,0.00006252254],"genre_scores_gemma":[0.98809814,0.0000088776915,0.010199373,0.00003750898,0.000011658226,0.000016252787,0.000046999623,0.000005549517,0.0015756637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992666,0.00006540774,0.00011116407,0.0002824026,0.00010030596,0.00017407865],"domain_scores_gemma":[0.9997231,0.00008460095,0.000041863175,0.00010341882,0.000006958505,0.00004008919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019139962,0.00007360583,0.00012325155,0.00025089248,0.00011479789,0.00006022118,0.00014016077,0.000030335079,0.00000942069],"category_scores_gemma":[0.000032587974,0.00006890419,0.00003665579,0.0008787991,0.000015427073,0.00014614455,0.00007793616,0.000093381714,0.000017523767],"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.000004876164,0.00005457379,0.012058376,0.0000074390914,0.000068279754,0.0000031595048,0.0018749058,0.8065638,0.0009955463,0.0006425203,0.00003701194,0.1776895],"study_design_scores_gemma":[0.00040145757,0.000029941893,0.15374714,8.797198e-7,0.000010347167,2.1020426e-7,0.00010429822,0.8447918,0.00007534894,0.000019771867,0.00074635714,0.000072450726],"about_ca_topic_score_codex":0.00005115044,"about_ca_topic_score_gemma":0.000047647834,"teacher_disagreement_score":0.6082291,"about_ca_system_score_codex":0.000022142942,"about_ca_system_score_gemma":0.000005978258,"threshold_uncertainty_score":0.28098315},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64090115,0.00008164536,0.35080415,0.0040641367,0.0009798626,0.00058051746,0.0000020602515,0.0002854965,0.0023009623],"genre_scores_gemma":[0.9936883,0.000006542374,0.005931212,0.00006350358,0.00010000346,0.00002724331,2.2666421e-7,0.000017748062,0.00016525651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978323,0.000021377138,0.0005517827,0.0005911654,0.00052027724,0.00048308936],"domain_scores_gemma":[0.9992374,0.00012453282,0.00014176086,0.00019263253,0.0001987851,0.00010488986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009685453,0.00022919849,0.00023669956,0.00033532907,0.00030862322,0.0006930815,0.0014291783,0.00007163736,0.00003189694],"category_scores_gemma":[0.00025800287,0.00018268444,0.00010170814,0.0011233938,0.00007219276,0.0004072241,0.0005754176,0.00082620303,0.00011162235],"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.0000118202015,0.00014597751,0.00010535093,0.00010792946,0.000018791998,0.0000032142445,0.015118235,0.4205437,0.061258126,0.3894154,0.000019657742,0.11325178],"study_design_scores_gemma":[0.000014714603,0.0001234135,0.0002314341,0.0012843219,0.000007923662,0.00000978558,0.00096827134,0.9450742,0.0057415827,0.046252456,0.000055517594,0.000236358],"about_ca_topic_score_codex":0.0002956327,"about_ca_topic_score_gemma":0.0000402353,"teacher_disagreement_score":0.52453053,"about_ca_system_score_codex":0.000107888816,"about_ca_system_score_gemma":0.00012273532,"threshold_uncertainty_score":0.74496555},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.051586e-9,0.00018691052,0.0009813915,0.00037019406,0.00034083752,0.00023815161,0.99775314,0.0000987939,0.000030570664],"genre_scores_gemma":[6.000363e-7,0.000004155682,0.0022807273,0.0012611111,0.0005129707,0.00014348766,0.99566907,0.000011566479,0.0001163037],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845445,0.00009544589,0.00018749294,0.00077935803,0.00023065017,0.00025258475],"domain_scores_gemma":[0.99688303,0.00067183503,0.00014816289,0.0021215265,0.0000601368,0.00011529338],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00012945411,0.00022201015,0.0002582529,0.000041671065,0.00010084462,0.00028863281,0.0048461286,0.00017142798,0.020566598],"category_scores_gemma":[0.0031674975,0.00020585548,0.00006013577,0.00013197871,0.0000017976772,0.00015237925,0.0027950737,0.000377922,0.0036402754],"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.0000031628047,0.000015713304,1.3122435e-7,0.00014709841,0.000015854372,0.00001219279,0.000008587482,0.0000018579043,9.455125e-8,7.867464e-7,0.99658227,0.003212263],"study_design_scores_gemma":[0.00011082231,0.0001372551,0.000008281103,0.0002719314,0.0000034629618,0.0000024050473,7.992538e-7,0.012318599,0.000017241016,0.0000035344385,0.9868741,0.0002515667],"about_ca_topic_score_codex":0.00013811866,"about_ca_topic_score_gemma":0.00004151727,"teacher_disagreement_score":0.016926322,"about_ca_system_score_codex":0.000012031952,"about_ca_system_score_gemma":0.00014343514,"threshold_uncertainty_score":0.9971355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008810925,0.00012811772,0.90518975,0.010935189,0.0022396585,0.00071901415,0.0000058183605,0.0003742585,0.07159724],"genre_scores_gemma":[0.96453196,0.0000020382865,0.020648194,0.00023705761,0.00008930227,0.00009949525,0.0000031673144,0.00001756078,0.014371228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999003,0.00009287321,0.00017172913,0.00041127764,0.00018273958,0.00013838663],"domain_scores_gemma":[0.99859047,0.00071959244,0.00013166551,0.00044932184,0.00008560511,0.000023342915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047081252,0.0001520473,0.00017562539,0.00008950432,0.000058866877,0.00017605854,0.0008354182,0.000077034456,0.00006411278],"category_scores_gemma":[0.0003040899,0.00008524935,0.00017213543,0.00009394484,0.00002257529,0.00002663221,0.0015532571,0.0012278801,0.00005159604],"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.000022678241,0.00008747413,0.000019508925,0.00027564907,0.0001996537,0.0000053433455,0.0073387544,0.015102338,0.000056518435,0.86119187,0.010432428,0.1052678],"study_design_scores_gemma":[0.00008115629,0.00029420137,0.000040505303,0.0003938511,0.000011132486,0.0000025213794,0.0001122498,0.7810865,0.0011812231,0.20918359,0.0074222563,0.00019081106],"about_ca_topic_score_codex":0.000030384652,"about_ca_topic_score_gemma":9.938664e-7,"teacher_disagreement_score":0.955721,"about_ca_system_score_codex":0.000021892434,"about_ca_system_score_gemma":0.000077722434,"threshold_uncertainty_score":0.53345966},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008856928,0.0009258888,0.95406145,0.01841809,0.0003830156,0.00022243288,0.000021342876,0.00069675484,0.016414106],"genre_scores_gemma":[0.8726448,0.000091249116,0.11129056,0.00017004422,0.00006399063,0.00006556191,0.00009177242,0.000032644806,0.01554937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971639,0.0011970361,0.00028790036,0.000636221,0.0003452765,0.0003696881],"domain_scores_gemma":[0.9965277,0.0015055354,0.0000971512,0.0011719648,0.0005470293,0.00015063325],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0037887995,0.00018958813,0.00017847594,0.00016419987,0.00043574275,0.0011827642,0.0012658308,0.00008995145,0.000069686845],"category_scores_gemma":[0.0006758651,0.00018018633,0.00016156436,0.00051258015,0.00007997245,0.00036815894,0.00044268463,0.00030765455,0.000075832584],"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.0000026020641,0.00017603674,0.00049114553,0.0000905922,0.00004874621,0.000007974939,0.0064271037,0.00005395241,0.0010152037,0.59566456,0.0063528707,0.38966918],"study_design_scores_gemma":[0.0003696057,0.0000015283117,0.0010529167,0.00031105013,0.000015758207,0.000023506054,0.00006141441,0.5740087,0.011829032,0.021405606,0.39057457,0.00034627665],"about_ca_topic_score_codex":0.00040049778,"about_ca_topic_score_gemma":0.00031580098,"teacher_disagreement_score":0.8637879,"about_ca_system_score_codex":0.000061455146,"about_ca_system_score_gemma":0.00017142067,"threshold_uncertainty_score":0.9998541},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16549852,0.00013037797,0.8248388,0.0009936879,0.002928041,0.00012870105,0.0000040146297,0.00014843702,0.005329405],"genre_scores_gemma":[0.9978103,0.00001631534,0.0013362726,0.0003173058,0.00011012816,0.0000010777093,7.889565e-7,0.0000037443356,0.00040404507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990917,0.00018152075,0.00032489793,0.000063773354,0.00021550352,0.00012264402],"domain_scores_gemma":[0.999251,0.00034156733,0.00013822925,0.00012384991,0.00010642826,0.000038913782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008430685,0.00007698852,0.0000884834,0.00027131682,0.00016960716,0.00025622462,0.00026789051,0.000036769947,0.000028910763],"category_scores_gemma":[0.00022084324,0.00004402331,0.000035051176,0.0008381592,0.000030386213,0.0007180323,0.000040134797,0.00053910987,0.000019051175],"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.00008427488,0.000049680566,0.0009191245,0.000102335565,0.00006487167,0.00001336513,0.010467689,0.026046356,0.00013318648,0.11120313,0.002796306,0.8481197],"study_design_scores_gemma":[0.00070826965,0.00029603744,0.02146811,0.0009019572,0.000015865811,0.0015266273,0.0004946146,0.939936,0.00063298637,0.013431092,0.020335656,0.00025282663],"about_ca_topic_score_codex":0.000003094159,"about_ca_topic_score_gemma":0.0000011373911,"teacher_disagreement_score":0.9138896,"about_ca_system_score_codex":0.00003938223,"about_ca_system_score_gemma":0.00013012293,"threshold_uncertainty_score":0.24707799},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14598437,0.00046959936,0.8493196,0.0008065408,0.0019410976,0.00041097583,0.000022101833,0.00030039763,0.0007453709],"genre_scores_gemma":[0.98135906,0.00028434594,0.012188281,0.00013365882,0.0002400457,0.000003859873,0.000011698039,0.00002584894,0.0057532014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824965,0.00006607571,0.00018336334,0.0011018428,0.00006801499,0.000331081],"domain_scores_gemma":[0.9989899,0.00020498078,0.00011056801,0.00052997156,0.0000595486,0.00010503542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029953726,0.00028557156,0.0003480947,0.00035887933,0.00013569045,0.00019420685,0.00081290357,0.0002155256,0.000008399784],"category_scores_gemma":[0.00004246364,0.00030363118,0.00015516234,0.00019051334,0.00007074703,0.00014400677,0.0027512154,0.0007881967,0.000042721276],"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.00009141267,0.00029160304,0.0041011167,0.0024773404,0.00034384595,0.0011918973,0.011425853,0.11996926,0.0002542116,0.8091388,0.0015606823,0.04915398],"study_design_scores_gemma":[0.0003436918,0.000038147035,0.00024455934,0.00019015517,0.00002446417,0.0000043752057,0.0000623549,0.80596393,0.000023799297,0.19012761,0.0026628536,0.0003140287],"about_ca_topic_score_codex":0.00018806384,"about_ca_topic_score_gemma":0.00004050876,"teacher_disagreement_score":0.83713126,"about_ca_system_score_codex":0.00009921499,"about_ca_system_score_gemma":0.00009427749,"threshold_uncertainty_score":0.9999416},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014578117,0.00017258956,0.99269116,0.002205466,0.00031720745,0.00014590967,0.0000036368253,0.000044394208,0.0042738756],"genre_scores_gemma":[0.07246377,0.000014400221,0.9270137,0.000055767807,0.00017492013,0.0000015748429,0.000008527138,0.000013122364,0.00025423765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855644,0.00014488045,0.00056283065,0.0002279468,0.00035719958,0.000150734],"domain_scores_gemma":[0.9988898,0.00021561423,0.00022683661,0.00042901628,0.00013654855,0.000102152495],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021656863,0.00011201921,0.00027430063,0.0000977713,0.00008901272,0.0014592189,0.0019142567,0.00004576888,0.00015999828],"category_scores_gemma":[0.00043584316,0.00007922773,0.00006159644,0.00033624607,0.000029865072,0.0016119982,0.00055886555,0.00029871703,0.00001432754],"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.000009816555,0.00011136066,0.000025186573,0.00040983115,0.00022360812,0.00015652215,0.001721244,0.71601766,0.00012030754,0.13039069,0.0019875925,0.14882615],"study_design_scores_gemma":[0.00020189889,0.000063667,0.0000059326717,0.00035867724,0.000029489522,0.00049701217,0.00003230489,0.9776734,0.000034294815,0.019895956,0.0011107088,0.00009664403],"about_ca_topic_score_codex":0.0000025873258,"about_ca_topic_score_gemma":1.605782e-7,"teacher_disagreement_score":0.26165572,"about_ca_system_score_codex":0.000024030347,"about_ca_system_score_gemma":0.00014610041,"threshold_uncertainty_score":0.99957734},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12539749,0.0027281593,0.36197993,0.28887004,0.007924831,0.0073489132,0.000722348,0.0021727388,0.20285554],"genre_scores_gemma":[0.46415532,0.000085417574,0.5248211,0.00049519783,0.00022756109,0.00002937693,0.00001907054,0.00003437268,0.01013256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990421,0.000002946939,0.00016826313,0.00036826116,0.00028369186,0.00013474621],"domain_scores_gemma":[0.99862707,0.000054736873,0.00009046533,0.001167165,0.00004163506,0.000018915936],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005499376,0.00008838597,0.000105353036,0.000077623095,0.000043453623,0.00013396035,0.007413268,0.000017124108,0.0000051657694],"category_scores_gemma":[0.00010893865,0.00005797269,0.000052616146,0.0002938019,0.000026260894,0.00048454278,0.0059605157,0.00008609196,0.000009448492],"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.00002242446,0.000121926845,0.0004725463,0.002934276,0.000276796,0.0000013233945,0.0003405233,0.000028310842,0.0005532343,0.4557271,0.16309194,0.37642962],"study_design_scores_gemma":[0.00088769454,0.00051250367,0.002607276,0.002309021,0.00021874692,0.0000066188336,0.00028996024,0.42493284,0.005908987,0.101273306,0.46060336,0.00044969434],"about_ca_topic_score_codex":0.0000030439833,"about_ca_topic_score_gemma":6.870899e-8,"teacher_disagreement_score":0.42490453,"about_ca_system_score_codex":0.000006932418,"about_ca_system_score_gemma":0.0000059529602,"threshold_uncertainty_score":0.9979571},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3741718,0.00018331718,0.6245048,0.00016157138,0.00013086929,0.00019881086,0.000018807605,0.00017803183,0.00045197256],"genre_scores_gemma":[0.99594516,0.000031995438,0.0036149076,0.000022382803,0.00003911997,0.000016230873,0.0000054824113,0.0000050968015,0.0003196352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934417,0.00006592018,0.000116702366,0.00024187913,0.000111960646,0.00011937842],"domain_scores_gemma":[0.99970263,0.00008477958,0.000035555877,0.00010090382,0.00003311841,0.000043019387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036230544,0.000057835576,0.00008262265,0.00013955527,0.000043078424,0.00006428454,0.00008726386,0.000040601357,0.000005773315],"category_scores_gemma":[0.00011790209,0.00005478752,0.000013058595,0.000498339,0.0000041155013,0.00032044094,0.0001015125,0.00020996884,0.0000116098445],"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.000028914805,0.0001968421,0.11080572,0.00020621621,0.00004966717,0.000020992125,0.0070917606,0.033443745,0.007924963,0.059448015,0.000622603,0.78016055],"study_design_scores_gemma":[0.00007316051,0.00005694019,0.0573687,0.00005075142,0.000003556043,0.0000038225803,0.00001875849,0.919193,0.0007733144,0.000331415,0.02206798,0.000058564463],"about_ca_topic_score_codex":0.00032840855,"about_ca_topic_score_gemma":0.000008425814,"teacher_disagreement_score":0.8857493,"about_ca_system_score_codex":0.000020443944,"about_ca_system_score_gemma":0.00002591304,"threshold_uncertainty_score":0.22341703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027897197,0.00056992273,0.99051565,0.0006689048,0.0011898922,0.0013812257,0.00001883636,0.0006770285,0.004950665],"genre_scores_gemma":[0.013852805,0.000017089871,0.98004735,0.0005245496,0.0010229517,0.00013400856,0.0000576945,0.00010008249,0.004243466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947591,0.000039700335,0.00055374944,0.0025030526,0.0011575734,0.0009868486],"domain_scores_gemma":[0.9973175,0.00031993556,0.0002834476,0.0014935301,0.00030522828,0.00028036724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010331246,0.0008356685,0.00077775,0.0007577746,0.0003650881,0.0010188138,0.0033485126,0.00039314508,0.0000069142257],"category_scores_gemma":[0.000041659732,0.00062173506,0.00022618359,0.00090798875,0.00089015043,0.00041128986,0.001210522,0.0010119961,0.000025125579],"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.00004795203,0.00013818812,0.00003903026,0.00034091313,0.00008466379,0.00019734641,0.0022031676,0.2118617,0.00003132997,0.014693282,0.000061751234,0.7703007],"study_design_scores_gemma":[0.00056960975,0.0011351132,0.0000074339277,0.0005840669,0.00003222248,0.00018421745,8.789332e-7,0.9825934,0.00008847733,0.011204263,0.0027831646,0.0008171597],"about_ca_topic_score_codex":0.000028526678,"about_ca_topic_score_gemma":0.0000069161647,"teacher_disagreement_score":0.7707317,"about_ca_system_score_codex":0.00017859861,"about_ca_system_score_gemma":0.00055764493,"threshold_uncertainty_score":0.9996234},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014701525,0.00005772435,0.9910832,0.00042592618,0.000941555,0.00017431784,0.000008908407,0.00075650803,0.005081708],"genre_scores_gemma":[0.960213,0.000047580776,0.034589805,0.00010061511,0.00016836557,0.0000012397016,0.000052347532,0.000024705212,0.004802319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841875,0.000112890775,0.00015426306,0.0009822156,0.00009434282,0.00023753112],"domain_scores_gemma":[0.9987062,0.00004480995,0.00013702652,0.00085943687,0.00013383212,0.00011868672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018725949,0.0002530373,0.0002095742,0.00029159948,0.00013843007,0.00030742915,0.0012095039,0.00022137459,0.00006066151],"category_scores_gemma":[0.000026336349,0.00028166623,0.00015800403,0.00063509913,0.000039240604,0.00019821279,0.0019814952,0.000778198,0.0001697354],"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.0000017271815,0.000022324315,0.00009522865,0.00010202806,0.000033126846,0.00011121045,0.00015591027,0.9199285,7.0120285e-7,0.0775372,0.00037068027,0.0016413694],"study_design_scores_gemma":[0.00011281067,0.000017270479,0.000027073102,0.00009910445,0.000032711672,0.000004523418,0.000024142124,0.9661351,0.0000117489735,0.032987963,0.00025204237,0.00029553284],"about_ca_topic_score_codex":0.0000823734,"about_ca_topic_score_gemma":0.0000040145105,"teacher_disagreement_score":0.95874286,"about_ca_system_score_codex":0.00011794735,"about_ca_system_score_gemma":0.00016042114,"threshold_uncertainty_score":0.9999635},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014087932,0.00023071103,0.9944427,0.0025311287,0.00030662384,0.00020538815,0.0000063983007,0.00064650254,0.0014896373],"genre_scores_gemma":[0.2337117,0.000009763376,0.75954926,0.00017965116,0.00006091962,0.000051064126,0.000015068564,0.000018507728,0.0064040306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891347,0.00002551511,0.00017362284,0.00044819145,0.00018513131,0.00025405243],"domain_scores_gemma":[0.99946606,0.0000794602,0.000019709598,0.0003023438,0.0000467047,0.00008569793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024337419,0.00012959779,0.000106854975,0.00013158325,0.00012343361,0.00033821867,0.00042133132,0.00004047686,0.000033005654],"category_scores_gemma":[0.000028642824,0.000103674094,0.00009586713,0.00031906867,0.000014461591,0.00011640521,0.00011653009,0.00013068631,0.000035110505],"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.0000012605291,0.000027369075,7.777622e-7,0.000029221583,0.000007270509,0.0000017583307,0.0006049505,0.9043403,0.0000012602271,0.028384432,0.00079850917,0.065802865],"study_design_scores_gemma":[0.00012247106,0.000049884053,9.320165e-7,0.000035253768,0.0000057792217,0.0000070889473,0.000011784724,0.9973135,0.0000031766253,0.0011659141,0.0011373973,0.00014679327],"about_ca_topic_score_codex":0.0000052610117,"about_ca_topic_score_gemma":9.4220746e-7,"teacher_disagreement_score":0.23489344,"about_ca_system_score_codex":0.000049143844,"about_ca_system_score_gemma":0.00008699561,"threshold_uncertainty_score":0.42277068},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4678949,0.00006898852,0.5207894,0.0007827142,0.0008326846,0.00020537307,0.000006422048,0.0003926576,0.009026873],"genre_scores_gemma":[0.9970844,0.000018605526,0.00085698674,0.000054728316,0.00006328882,4.057994e-7,0.0000036168142,0.000013564965,0.0019044371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981888,0.00040350744,0.00017555708,0.00087201665,0.00012426308,0.00023584125],"domain_scores_gemma":[0.99805176,0.00053785904,0.00019493682,0.0010443558,0.00009478282,0.000076296565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006525768,0.0002440063,0.00028222473,0.00015299942,0.00016295967,0.00011208683,0.0016333042,0.00015662592,0.000048686685],"category_scores_gemma":[0.0001234246,0.00019499609,0.0002532234,0.0005469351,0.00013515433,0.000054005,0.00293731,0.0018652369,0.00012119388],"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.0000046652485,0.000036523536,0.0005481376,0.000073448,0.00004014244,0.000044477536,0.00021433768,0.6996714,0.000002557917,0.2980012,0.00018957684,0.001173552],"study_design_scores_gemma":[0.000082317536,0.00006600507,0.00053598406,0.00013492152,0.000024894533,0.0000016848103,0.00004310513,0.88701975,0.000027945582,0.11158033,0.00029804968,0.00018503798],"about_ca_topic_score_codex":0.0001825191,"about_ca_topic_score_gemma":0.0000062143577,"teacher_disagreement_score":0.52918947,"about_ca_system_score_codex":0.00008241105,"about_ca_system_score_gemma":0.0001254273,"threshold_uncertainty_score":0.810363},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027221654,0.0029672275,0.9649725,0.0022693677,0.0005627339,0.0001952529,0.00000141422,0.0003565644,0.0014532736],"genre_scores_gemma":[0.9897174,0.0022773673,0.005054465,0.00005879184,0.00062317715,0.000012260015,0.00003107279,0.000066591674,0.0021588707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948595,0.00074992917,0.0005390011,0.0008184616,0.0005579018,0.002475195],"domain_scores_gemma":[0.99914217,0.000039332866,0.00007646711,0.0004120437,0.00014188989,0.0001880777],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003350703,0.0003925304,0.00039101954,0.00062223553,0.00025290006,0.0014373783,0.0016361676,0.0003338086,0.00007244186],"category_scores_gemma":[0.000021694887,0.00036764584,0.00016610701,0.0007391327,0.000032149437,0.00047544925,0.0004555782,0.019896535,0.000026527368],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009191235,0.000050152314,0.000080462996,0.00003037185,0.000068215435,0.00006610497,0.00059764757,0.84738725,0.000018894665,0.0464212,0.0000041643716,0.10526633],"study_design_scores_gemma":[0.000346009,0.00039416525,0.000042228545,0.00012939905,0.000015314356,0.0003998406,0.00045267044,0.928867,0.000025514137,0.06886939,0.00007434028,0.00038416497],"about_ca_topic_score_codex":0.00025346965,"about_ca_topic_score_gemma":0.00030099472,"teacher_disagreement_score":0.96249574,"about_ca_system_score_codex":0.00083952636,"about_ca_system_score_gemma":0.0073020416,"threshold_uncertainty_score":0.9998776},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068861246,0.00056205556,0.9838211,0.0026227527,0.00086072733,0.00006551268,9.4314436e-7,0.002796327,0.0023844757],"genre_scores_gemma":[0.92959964,0.0000060113225,0.06316136,0.00017009045,0.00023312795,0.000012198421,0.0000039539977,0.000028257371,0.0067853634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873763,0.00004022461,0.00016280297,0.00043519208,0.00027305467,0.00035111827],"domain_scores_gemma":[0.9993433,0.00011398785,0.000018177107,0.0003768503,0.000026300777,0.00012138906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031372896,0.00016845336,0.00014247284,0.00016782062,0.00008279195,0.0005115281,0.0007063585,0.00006283106,0.00016461272],"category_scores_gemma":[0.000099113786,0.00014311359,0.000102694336,0.00054624316,0.000012237536,0.00023338353,0.0001485605,0.00048126947,0.00034000378],"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":[8.87149e-7,0.000019996469,0.00005258367,0.00008381999,0.000015164854,0.00008514552,0.0004080085,0.83468115,0.00013217599,0.0036803077,0.001658669,0.1591821],"study_design_scores_gemma":[0.00014231529,0.00007798101,0.00010650226,0.00004937805,0.0000041071185,0.000012593489,0.0000120350915,0.9541586,0.00030805432,0.0000825185,0.04484924,0.00019668936],"about_ca_topic_score_codex":0.000044740456,"about_ca_topic_score_gemma":0.0000014446133,"teacher_disagreement_score":0.9227135,"about_ca_system_score_codex":0.000031485088,"about_ca_system_score_gemma":0.0000765182,"threshold_uncertainty_score":0.5836003},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019402254,0.0008246482,0.9867698,0.009232243,0.0007873382,0.00014996668,0.00005562337,0.00020968,0.000030509927],"genre_scores_gemma":[0.5529882,0.0005891311,0.4459765,0.00021487559,0.00013075843,0.000015838472,0.0000057778457,0.000016439137,0.000062527186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866474,0.000104028346,0.00021484931,0.00045413352,0.00030593804,0.0002562936],"domain_scores_gemma":[0.99680316,0.0026221552,0.000032751082,0.00022826245,0.000039131195,0.00027455844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035782607,0.00017646998,0.00019203572,0.0000985008,0.0005112851,0.00027719804,0.00022443532,0.00022248572,0.000027711945],"category_scores_gemma":[0.0002628238,0.00014402608,0.0000743648,0.00025030412,0.00015679706,0.000068748646,0.000009721901,0.0009130003,0.000005380634],"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.000042111013,0.00021217008,0.00005895232,0.00009149116,0.00025475802,0.00005485221,0.0010719897,0.02953125,0.00011097515,0.19939026,0.00024884773,0.76893234],"study_design_scores_gemma":[0.00036188166,0.0005041931,0.000031572414,0.00020870246,0.00005674754,0.000034912926,0.000071541086,0.97547525,0.00010787122,0.02217302,0.0007906664,0.00018365042],"about_ca_topic_score_codex":0.000115861396,"about_ca_topic_score_gemma":0.000064388485,"teacher_disagreement_score":0.945944,"about_ca_system_score_codex":0.000022535784,"about_ca_system_score_gemma":0.0001696315,"threshold_uncertainty_score":0.5873213},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004426612,0.0015872411,0.98399734,0.00054017815,0.0009759648,0.00032884657,8.56739e-7,0.0006079536,0.007534974],"genre_scores_gemma":[0.8156516,0.00010023601,0.1794585,0.00026632924,0.0011015517,0.000019078348,0.000006043445,0.00013848658,0.0032581605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949779,0.0000849152,0.00046106637,0.0024031675,0.0010805619,0.0009924081],"domain_scores_gemma":[0.997941,0.00047102376,0.0003335162,0.00076738617,0.00019872688,0.00028833942],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001046144,0.00080350717,0.0007381181,0.001214076,0.0007728746,0.0014701046,0.0016640627,0.00032482675,0.000014185089],"category_scores_gemma":[0.00017860506,0.00066250644,0.000109805864,0.0010093182,0.00082600577,0.00038261013,0.0018406408,0.0038287647,0.00005589795],"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.0000069388616,0.00002101771,0.00053274847,0.00011272421,0.000042568106,0.00025828223,0.006173064,0.4510806,0.00009409673,0.028052755,0.0000023887978,0.5136228],"study_design_scores_gemma":[0.00026490053,0.0004781707,0.00028099853,0.0016019577,0.000023987921,0.00035195926,0.0000033777112,0.98547107,0.00019730795,0.008411653,0.0019957833,0.0009188359],"about_ca_topic_score_codex":0.00010223384,"about_ca_topic_score_gemma":0.000023784427,"teacher_disagreement_score":0.811225,"about_ca_system_score_codex":0.00030498358,"about_ca_system_score_gemma":0.0004908845,"threshold_uncertainty_score":0.9995826},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019988815,0.02769907,0.919766,0.003957247,0.0002030375,0.00050182396,0.000013492792,0.0001009654,0.04775633],"genre_scores_gemma":[0.0007624907,0.0136292735,0.98425764,0.00039597906,0.000011026698,0.000042964188,0.000026581069,0.000005619344,0.0008684237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872553,0.00002726875,0.0007107756,0.00023239001,0.00017121441,0.00013283077],"domain_scores_gemma":[0.9975419,0.0004229719,0.00034660698,0.0013237975,0.00031687762,0.000047857582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017454769,0.00015402492,0.00039197615,0.00087229634,0.00021614999,0.0002902823,0.002002447,0.00010289483,0.00000165774],"category_scores_gemma":[0.00013773124,0.00013814896,0.000043270386,0.00055434037,0.00066600105,0.0018401005,0.0019887544,0.00039124445,0.0000055214737],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.0353778e-7,0.0000038062512,0.000007138859,0.0002628942,0.000002922923,1.7339504e-8,0.00018774215,0.0000052683135,0.0000018777864,0.41725832,0.00009756021,0.5821723],"study_design_scores_gemma":[0.00010209461,0.000070726055,0.000119339464,0.0019730036,0.000013788744,0.000017809434,0.000008609184,0.5701528,0.00001601395,0.022422759,0.40493557,0.00016749577],"about_ca_topic_score_codex":0.000001635351,"about_ca_topic_score_gemma":6.8082016e-7,"teacher_disagreement_score":0.5820047,"about_ca_system_score_codex":0.00003475029,"about_ca_system_score_gemma":0.00012207385,"threshold_uncertainty_score":0.5633551},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013926781,0.000054926953,0.9978449,0.00037180987,0.00006854485,0.000110451125,2.4248968e-7,0.00006249777,0.00009395613],"genre_scores_gemma":[0.36333528,0.000013672756,0.636477,0.00002791486,0.00011256813,0.0000074298323,0.0000025153877,0.000008650566,0.000014966828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941665,0.000022342465,0.00016761904,0.0001386971,0.0001428034,0.00011189866],"domain_scores_gemma":[0.99952054,0.00019725766,0.000107185595,0.000032481654,0.00008341654,0.00005913438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018859061,0.00007961143,0.00013441814,0.00009811608,0.00012634075,0.00023862915,0.00007724841,0.000031119514,0.0000045033603],"category_scores_gemma":[0.000038682796,0.000055736215,0.000033119813,0.00031761944,0.000012474318,0.00026445827,0.000013738463,0.00021029572,3.8634442e-7],"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.000074637974,0.000025216372,0.00004277782,0.000035104833,0.00003395923,0.0000012266912,0.0007158167,0.625298,0.000104604886,0.0036605168,0.000012026297,0.36999607],"study_design_scores_gemma":[0.0003104484,0.00057759683,0.000032470438,0.000036598856,0.000021838205,0.00003496995,0.000074637814,0.9954226,0.00017016681,0.000519238,0.002720601,0.000078824],"about_ca_topic_score_codex":0.00000418503,"about_ca_topic_score_gemma":1.2341316e-7,"teacher_disagreement_score":0.37012458,"about_ca_system_score_codex":0.000023609311,"about_ca_system_score_gemma":0.000051170387,"threshold_uncertainty_score":0.23011063},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027730883,0.0018130803,0.9889627,0.0045381086,0.0017176081,0.00040990088,0.0000069105267,0.000026130285,0.0022482348],"genre_scores_gemma":[0.06325282,0.00026166806,0.9304822,0.00017920375,0.00067279884,0.000012467749,0.00000814654,0.000052478616,0.0050782342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974573,0.00019070509,0.0010846803,0.00034318754,0.0005781215,0.00034597272],"domain_scores_gemma":[0.99793243,0.00053369405,0.00046907796,0.00033179278,0.00046405566,0.00026894233],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020338458,0.0002616321,0.0005849719,0.00026299563,0.00021988623,0.0034437086,0.0013197156,0.000111121284,0.00067286944],"category_scores_gemma":[0.0004887787,0.000188665,0.00037469692,0.0006021521,0.00007015027,0.0011451966,0.00028562994,0.00038294023,0.00006297145],"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.00017587128,0.0013591757,0.000012460083,0.0011841392,0.00076126267,0.00028773717,0.0032670074,0.7736562,0.000096794516,0.13657206,0.01736605,0.06526125],"study_design_scores_gemma":[0.0005355274,0.0007735094,0.000005997278,0.0015090284,0.0002585387,0.00023285953,0.00003886286,0.9756187,0.00014496953,0.010223974,0.010430557,0.00022745082],"about_ca_topic_score_codex":0.0000035358808,"about_ca_topic_score_gemma":3.819471e-7,"teacher_disagreement_score":0.20196253,"about_ca_system_score_codex":0.0001289136,"about_ca_system_score_gemma":0.00033901786,"threshold_uncertainty_score":0.99759084},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082287836,0.0015669371,0.8304228,0.008530332,0.0016731349,0.0012804877,0.0005044677,0.00059439795,0.15534516],"genre_scores_gemma":[0.007822576,0.001229176,0.1193545,0.00051821163,0.0012385917,0.000056936202,0.0012369954,0.00016609694,0.8683769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735594,0.000098722965,0.00027879587,0.0011913114,0.00064166746,0.00043354716],"domain_scores_gemma":[0.99793595,0.0006077034,0.000032378364,0.0010657931,0.00019864435,0.00015950619],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013206789,0.00031935773,0.00033452408,0.0005604357,0.001398841,0.001568279,0.0013818335,0.00016444267,0.000024362835],"category_scores_gemma":[0.00011505686,0.00028057751,0.00007608131,0.00012801225,0.00014990059,0.00058843684,0.001747196,0.0016556002,0.000056546665],"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.00001593668,0.000010836774,1.295224e-7,0.00005646448,0.00005144313,0.000041204163,0.00093805674,0.087564476,0.0000022119896,0.7704124,0.0023147413,0.13859214],"study_design_scores_gemma":[0.00018089253,0.00065445283,2.9768822e-7,0.0004182294,0.000007639667,0.000019498197,0.000056757544,0.8558839,0.0000014280807,0.022097934,0.12042283,0.00025614284],"about_ca_topic_score_codex":0.00008506001,"about_ca_topic_score_gemma":0.000096124306,"teacher_disagreement_score":0.7683194,"about_ca_system_score_codex":0.000063687374,"about_ca_system_score_gemma":0.000177309,"threshold_uncertainty_score":0.99996465},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28093952,0.00009063275,0.7107404,0.0031216089,0.00006734492,0.00014943581,0.000001522623,0.0004295629,0.0044599734],"genre_scores_gemma":[0.94303054,0.0000165884,0.052554518,0.000043041746,0.000010781086,0.00002213724,0.000036462414,0.0000185886,0.0042673587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613535,0.002317751,0.00027096897,0.00051473046,0.0003682962,0.00039291783],"domain_scores_gemma":[0.9968689,0.0017994599,0.00017258854,0.0005241072,0.0005211678,0.00011377787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004400696,0.00016205503,0.00019469572,0.00021721599,0.00038013852,0.00023876023,0.0006589362,0.000061165716,0.00002083472],"category_scores_gemma":[0.00081877114,0.00015352345,0.000053837364,0.0013316276,0.0001122214,0.00024060985,0.00042819016,0.00044048805,0.00005712838],"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.000053845783,0.0008312412,0.11834538,0.00013387551,0.00012039466,0.00021447096,0.037506357,0.09184214,0.0049744244,0.2379845,0.0004893858,0.507504],"study_design_scores_gemma":[0.0007887459,0.0000013575875,0.026559759,0.0006784308,0.0000049626647,0.0000200193,0.00021073307,0.9639718,0.005021079,0.00072821754,0.0017554684,0.00025942852],"about_ca_topic_score_codex":0.0004906658,"about_ca_topic_score_gemma":0.0005277941,"teacher_disagreement_score":0.8721297,"about_ca_system_score_codex":0.000052834435,"about_ca_system_score_gemma":0.00013145468,"threshold_uncertainty_score":0.6260505},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9986064,0.00015687228,0.0004882269,0.00008450554,0.00015364042,0.00025367574,0.0000057183574,0.00012426649,0.00012668454],"genre_scores_gemma":[0.9942112,0.000016310849,0.00569124,0.000005413304,0.000028983975,0.000014338319,0.0000030977048,0.000012224737,0.000017217822],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877596,0.000018020704,0.0005232648,0.0003360564,0.0001618045,0.00018490039],"domain_scores_gemma":[0.9990282,0.00015621723,0.0005385801,0.00007300297,0.00017576946,0.000028244014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010195478,0.00013965742,0.00021729752,0.00004649884,0.00027109298,0.00014743887,0.00020587306,0.00007178301,4.6161776e-7],"category_scores_gemma":[0.00018670001,0.000106101324,0.0001620494,0.00019138708,0.000062858235,0.0005009368,0.00020410454,0.00024293027,4.5240775e-8],"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.000089633024,0.0002518066,0.14397737,0.0033479533,0.00050738786,7.9868903e-7,0.5173317,0.071017556,0.1239827,0.06741114,0.00046956536,0.07161234],"study_design_scores_gemma":[0.0001746355,0.0002878917,0.08417416,0.0006743288,0.000027612114,0.000002269471,0.029907467,0.87578505,0.00564429,0.0029900658,0.00011469483,0.00021752308],"about_ca_topic_score_codex":0.0000834134,"about_ca_topic_score_gemma":0.0000017291713,"teacher_disagreement_score":0.8047675,"about_ca_system_score_codex":0.00008373683,"about_ca_system_score_gemma":0.00006433032,"threshold_uncertainty_score":0.43266866},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038709138,0.00029224955,0.95974654,0.00028743965,0.0002737047,0.00028215293,0.000006001511,0.00025808945,0.00014467338],"genre_scores_gemma":[0.22891104,0.0000024996682,0.7709188,0.000013792134,0.000069594345,0.000014323624,0.0000083183895,0.000015285194,0.00004635936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998983,0.00004974305,0.00032266226,0.00023123625,0.00025778357,0.00015556738],"domain_scores_gemma":[0.99857515,0.0008104517,0.00014155907,0.00025238958,0.00015682813,0.00006359543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040659786,0.00013322079,0.00023367733,0.00018268074,0.00008778057,0.00019306681,0.00038305236,0.000040683994,0.000005272055],"category_scores_gemma":[0.00039029183,0.00011664951,0.00010069363,0.00037808294,0.000032219537,0.0002679359,0.000100999154,0.00007510802,0.000003640425],"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.00008233461,0.0009671341,0.000084642415,0.0055228416,0.00063611096,0.000055014592,0.050699193,0.22090639,0.01385407,0.33550733,0.0034788405,0.36820608],"study_design_scores_gemma":[0.0006174417,0.0000562682,0.000017736313,0.00017647604,0.000019787427,0.000013977711,0.0000902846,0.8993457,0.002114257,0.09735585,0.00007535114,0.000116894334],"about_ca_topic_score_codex":0.000016061473,"about_ca_topic_score_gemma":8.7793074e-7,"teacher_disagreement_score":0.67843926,"about_ca_system_score_codex":0.000023599796,"about_ca_system_score_gemma":0.00008125398,"threshold_uncertainty_score":0.4756829},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06086727,0.00019015268,0.9287422,0.0009935934,0.0001275398,0.00005195386,3.517784e-7,0.00084191974,0.00818504],"genre_scores_gemma":[0.7759561,0.0000036792453,0.22096503,0.000082024344,0.00004740575,0.0000048567363,4.598269e-7,0.000008630646,0.0029317916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909127,0.000021341071,0.00009693264,0.0003411164,0.00024670883,0.00020262081],"domain_scores_gemma":[0.9995615,0.00011597812,0.000016231303,0.00021926369,0.000019358564,0.00006768576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017567677,0.00010203529,0.00008699909,0.00022578018,0.0001245718,0.00042763274,0.00030953894,0.000030879408,0.000010280283],"category_scores_gemma":[0.000032383432,0.00006457851,0.00003377337,0.00079832494,0.000013049396,0.0003238716,0.00014617597,0.00022009606,0.000033797827],"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.000006533158,0.0000800833,0.007969829,0.00014379257,0.00006706448,0.00023941309,0.0033758213,0.18423875,0.0010904105,0.29916462,0.001527298,0.5020964],"study_design_scores_gemma":[0.00007121407,0.00005368559,0.00023238,0.000055827255,0.000004338988,0.00007034842,0.000020302941,0.99750286,0.00008719371,0.0011742602,0.00062135176,0.00010623166],"about_ca_topic_score_codex":0.00019445848,"about_ca_topic_score_gemma":0.000008343673,"teacher_disagreement_score":0.81326413,"about_ca_system_score_codex":0.000019914192,"about_ca_system_score_gemma":0.00004325551,"threshold_uncertainty_score":0.41236725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01134661,0.007108792,0.94448227,0.005815023,0.0023412593,0.00020158982,0.000021815438,0.002816783,0.025865853],"genre_scores_gemma":[0.9416656,0.00006324442,0.040523995,0.00082323723,0.00025812935,0.000007753699,0.000072130926,0.000032171305,0.016553774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821657,0.0001216622,0.0002222217,0.0007814013,0.00032526717,0.00033286473],"domain_scores_gemma":[0.9987001,0.00015900793,0.000032493146,0.0009693133,0.000019423132,0.00011969412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049140863,0.00019270784,0.00017341781,0.000120213495,0.00017621304,0.00060632266,0.0013317489,0.00006250778,0.00039133136],"category_scores_gemma":[0.00006779486,0.00015256347,0.00004966991,0.00030728255,0.000036861908,0.00069081725,0.0013545343,0.00057151244,0.00068457826],"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.000011094251,0.00020945784,0.008100689,0.00016507052,0.00034468796,0.0010063003,0.004858573,0.0013034899,0.0032360933,0.27764603,0.073354416,0.6297641],"study_design_scores_gemma":[0.00015244704,0.00003408944,0.00012619913,0.00002866672,0.0000063530742,0.00007404654,0.00003217241,0.8650171,0.0004412175,0.00076946,0.13311167,0.00020654275],"about_ca_topic_score_codex":0.0004080734,"about_ca_topic_score_gemma":0.000017297112,"teacher_disagreement_score":0.93031895,"about_ca_system_score_codex":0.000029030685,"about_ca_system_score_gemma":0.000056450714,"threshold_uncertainty_score":0.8799097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012816072,0.0007013321,0.98906094,0.002834089,0.003139266,0.00031436767,0.00008813783,0.0005367059,0.003312354],"genre_scores_gemma":[0.045466278,0.00002539851,0.949069,0.0012634883,0.001560579,0.000005012563,0.00016966517,0.00007477813,0.0023657905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932428,0.00004417146,0.00060814794,0.0037430846,0.00156759,0.0007941826],"domain_scores_gemma":[0.9927767,0.00071937,0.00022826898,0.0057981685,0.00016256349,0.00031495406],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020562585,0.0006436777,0.0005723963,0.0008564669,0.00045413047,0.0016555106,0.012518108,0.00033451186,0.000025944697],"category_scores_gemma":[0.0005382223,0.0005675381,0.00007754547,0.0011446488,0.00035164674,0.0005483959,0.015089702,0.0026598389,0.00041983224],"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.0000013512034,0.000010264495,0.000007475683,0.000028616201,0.000008294158,0.00005367648,0.00041917906,0.688013,0.000004070608,0.032776073,0.00008160193,0.27859634],"study_design_scores_gemma":[0.000055872282,0.00006586272,0.000016082566,0.00059359666,0.000013662229,0.000042294527,1.4201764e-7,0.91545504,0.0000049504592,0.0629302,0.0202001,0.0006222139],"about_ca_topic_score_codex":0.000018487099,"about_ca_topic_score_gemma":0.000016422959,"teacher_disagreement_score":0.27797413,"about_ca_system_score_codex":0.0001916756,"about_ca_system_score_gemma":0.0006037608,"threshold_uncertainty_score":0.9996776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05902001,0.024244146,0.6384712,0.19691485,0.0118528865,0.00071311515,0.000015362833,0.013571487,0.055196945],"genre_scores_gemma":[0.8575629,0.000029749483,0.13951765,0.00048626724,0.0006636808,0.000025778907,0.0000040453447,0.00003202853,0.0016778972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986587,0.000073118186,0.00016630166,0.00049161434,0.00023383828,0.00037643543],"domain_scores_gemma":[0.99860615,0.0004920526,0.00004075259,0.00072048436,0.000044769164,0.00009580836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004145113,0.00017530243,0.00015951545,0.00018227696,0.00024241478,0.00055734103,0.001180248,0.000057857666,0.000080249716],"category_scores_gemma":[0.0005653803,0.00015192601,0.000064581734,0.0006505877,0.000021820731,0.00036188506,0.000694313,0.0003053514,0.0002708723],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.519964e-7,0.000018540235,0.0004665158,0.00008456479,0.00003194752,0.00017728956,0.0012200451,0.00011482996,0.00070828764,0.0119890515,0.002028971,0.9831592],"study_design_scores_gemma":[0.0003178137,0.0002756568,0.0064302,0.00041549327,0.00003841104,0.00024180072,0.00018540808,0.6552356,0.0015943409,0.017226584,0.31712952,0.0009091879],"about_ca_topic_score_codex":0.00011719404,"about_ca_topic_score_gemma":0.000008477138,"teacher_disagreement_score":0.98225003,"about_ca_system_score_codex":0.000028852,"about_ca_system_score_gemma":0.000031770476,"threshold_uncertainty_score":0.61953634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7505108,0.00012457953,0.23657593,0.000949066,0.0019226776,0.00069323496,0.0001248457,0.00041040307,0.0086884275],"genre_scores_gemma":[0.9818973,0.000020783136,0.013678013,0.000305797,0.00014251219,0.0000018751034,0.0000031308637,0.000026610087,0.0039240066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728864,0.00016326913,0.00039829637,0.0014962037,0.00015814567,0.0004954363],"domain_scores_gemma":[0.99771684,0.00028749427,0.0002655095,0.0010708183,0.00019374966,0.00046557304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007604049,0.00040164238,0.00063966407,0.0005667296,0.00012571782,0.00021688102,0.0016345694,0.00019561911,0.00003985328],"category_scores_gemma":[0.00033280576,0.0004484744,0.00013959949,0.0010292851,0.0001248273,0.00014939588,0.006173426,0.00059569534,0.00018956531],"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.00037975563,0.00059884,0.051173586,0.0040453747,0.0010006069,0.006274864,0.008696183,0.46207786,0.023313647,0.31201807,0.020084111,0.110337116],"study_design_scores_gemma":[0.0026770537,0.0026338848,0.010524763,0.005506565,0.00087289384,0.00036696982,0.0007299536,0.87553453,0.009782769,0.074500464,0.010226331,0.006643826],"about_ca_topic_score_codex":0.00066139334,"about_ca_topic_score_gemma":0.00001663696,"teacher_disagreement_score":0.41345668,"about_ca_system_score_codex":0.00010942368,"about_ca_system_score_gemma":0.00043832892,"threshold_uncertainty_score":0.9997967},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023508716,0.008592862,0.9672928,0.000318715,0.0002004055,0.000045447305,5.946456e-7,0.000033578875,0.000006869117],"genre_scores_gemma":[0.9634627,0.000021039894,0.03617703,0.00004303268,0.00024794592,0.0000019868608,4.2479354e-7,0.000011182943,0.00003466293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993267,0.00001428228,0.00014413607,0.00015998437,0.00009201735,0.00026289275],"domain_scores_gemma":[0.99923927,0.00029083792,0.000026983827,0.00004825572,0.000048895927,0.0003457389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017356056,0.000111080284,0.00016915989,0.0004034692,0.00009107204,0.00036861998,0.00016206343,0.000027328839,8.8080054e-7],"category_scores_gemma":[0.000040297142,0.0000840681,0.000035655263,0.00051086297,0.000015286643,0.00019032453,0.000012664801,0.00030620678,2.367266e-7],"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.0000107187725,0.000008926914,0.00055729644,0.00017997187,0.00014792466,0.00033766637,0.0007085625,0.22013241,0.00006941787,0.021080459,0.00025182392,0.75651485],"study_design_scores_gemma":[0.00018972723,0.0004735936,0.0006065335,0.000101144564,0.000014889659,0.00042959978,0.000002126274,0.9934162,0.000008806585,0.00016150954,0.004474377,0.000121520636],"about_ca_topic_score_codex":0.00007735202,"about_ca_topic_score_gemma":0.000026990781,"teacher_disagreement_score":0.939954,"about_ca_system_score_codex":0.000031217092,"about_ca_system_score_gemma":0.00015711716,"threshold_uncertainty_score":0.3554611},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.091891e-7,0.00041092403,0.05707315,0.0010330611,0.00089989847,0.000053335632,0.0000033151478,0.0006151127,0.9399109],"genre_scores_gemma":[0.00015766382,0.000018631821,0.008096446,0.00024504782,0.00023322226,0.0000015513127,0.0000038251583,0.00001689138,0.99122673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903125,0.000004106312,0.00014425955,0.0004624482,0.00023684214,0.00012111834],"domain_scores_gemma":[0.9992231,0.00004247941,0.000033206026,0.0006104571,0.000033455628,0.00005729913],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016965008,0.00017478579,0.00016290204,0.00006405811,0.00003667856,0.00018138041,0.0005773858,0.00012641915,0.0009982514],"category_scores_gemma":[0.0000049257283,0.00013549738,0.000112414535,0.000021226935,0.000029349154,0.00006285538,0.00032017898,0.000467157,0.004542929],"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":[1.295068e-7,0.0000017835274,9.549724e-7,0.000022766282,0.000011356732,0.000018669585,0.000023640765,0.0000025589263,2.6233175e-7,0.9604373,0.0068472503,0.032633338],"study_design_scores_gemma":[0.000015339048,0.000016091592,0.0000026605094,0.000027500899,0.0000046383034,0.000010659802,2.4002605e-7,0.013318227,0.0000016130527,0.27377233,0.71269375,0.00013694316],"about_ca_topic_score_codex":0.00002410511,"about_ca_topic_score_gemma":0.0000056720537,"teacher_disagreement_score":0.7058465,"about_ca_system_score_codex":0.000034047687,"about_ca_system_score_gemma":0.000050622835,"threshold_uncertainty_score":0.99991494},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32304868,0.00014038515,0.6709946,0.0009950394,0.00006748785,0.00009097915,5.21231e-7,0.00033701345,0.004325308],"genre_scores_gemma":[0.98949313,0.000010418064,0.008198386,0.000032989545,0.00008221603,0.000019082709,0.000012281807,0.000010571305,0.0021409409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990231,0.00016594512,0.0001244579,0.0003643942,0.00015163473,0.00017048692],"domain_scores_gemma":[0.99965346,0.00018994871,0.000015843812,0.000053717096,0.00004340904,0.000043604075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021703048,0.00011631967,0.00010048112,0.00019274704,0.00021834971,0.00039784543,0.00006425672,0.00003871124,0.00003979999],"category_scores_gemma":[0.000023393266,0.00009381116,0.000021008065,0.00052106695,0.000028021426,0.0007804172,0.000028040069,0.0005373431,0.000017087863],"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.000025833235,0.000022781966,0.004448404,0.00007882234,0.00005520533,0.00008657939,0.05036722,0.0856466,0.0044440203,0.014263293,0.000017602044,0.8405436],"study_design_scores_gemma":[0.00029438626,0.00029367468,0.004235228,0.0002119151,0.0000071913664,0.00004054194,0.0023968837,0.9903396,0.0005003502,0.00025234785,0.0012508101,0.00017707449],"about_ca_topic_score_codex":0.000105392995,"about_ca_topic_score_gemma":0.000018852972,"teacher_disagreement_score":0.904693,"about_ca_system_score_codex":0.000032571184,"about_ca_system_score_gemma":0.000031599116,"threshold_uncertainty_score":0.38364327},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013650052,0.00053051225,0.9905653,0.0016632682,0.0030939193,0.00053636864,0.000016816191,0.0004583854,0.0029989178],"genre_scores_gemma":[0.040527202,0.00013826818,0.9315458,0.0032690652,0.00326089,0.000086595865,0.00007628722,0.00021245317,0.020883461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559927,0.00004417507,0.0004905489,0.002094894,0.00091983366,0.0008513049],"domain_scores_gemma":[0.99763244,0.0006510809,0.0002792367,0.0009829792,0.0002480877,0.00020619844],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00083804183,0.00069484126,0.0006789164,0.00083271164,0.0004539419,0.0010551247,0.0027624152,0.0003702643,0.000028475308],"category_scores_gemma":[0.00016581923,0.0006158032,0.00029643194,0.00062062446,0.00044964175,0.00049804064,0.0013702656,0.0018088004,0.000067518115],"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.000010320889,0.000016484655,0.0000074748973,0.00010344452,0.000026314448,0.00009592665,0.0010532463,0.4786248,0.00006167609,0.02485583,0.000058779475,0.49508572],"study_design_scores_gemma":[0.00038818887,0.000196239,0.000018121658,0.00043452808,0.000014609924,0.000056019533,2.4797683e-7,0.8969299,0.00048544994,0.09019065,0.010579021,0.000706983],"about_ca_topic_score_codex":0.00003463587,"about_ca_topic_score_gemma":0.000015855287,"teacher_disagreement_score":0.49437872,"about_ca_system_score_codex":0.00031412242,"about_ca_system_score_gemma":0.00047247147,"threshold_uncertainty_score":0.9999819},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006020363,0.001917931,0.98825026,0.0009953906,0.0023525003,0.00031095676,0.0000020400448,0.0006310614,0.0049378145],"genre_scores_gemma":[0.81304735,0.00028723356,0.17772917,0.0009850347,0.0013214399,0.00009502533,0.000014715636,0.00019278911,0.0063272654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99440664,0.00015754723,0.0008036861,0.0023834202,0.0011755907,0.0010731338],"domain_scores_gemma":[0.99713206,0.0012676036,0.00036709398,0.00083077216,0.00018957416,0.00021288647],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0023017772,0.0008514508,0.0011356685,0.0018218791,0.00042044904,0.0010491519,0.0024787493,0.00029017252,0.000043925702],"category_scores_gemma":[0.00044192007,0.0007564831,0.0003250462,0.0013377258,0.00030120835,0.0012425609,0.0015869659,0.005053993,0.00015824186],"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.0000053031827,0.000013184303,0.000033522752,0.00008363966,0.00009690595,0.00032668735,0.0075722276,0.32211745,0.00018056876,0.010878396,0.0000016398749,0.6586905],"study_design_scores_gemma":[0.0003163313,0.00027065206,0.00003146076,0.0012095384,0.00008141522,0.00009247335,0.0000124164035,0.95776826,0.0025504946,0.028704932,0.0077691954,0.0011928264],"about_ca_topic_score_codex":0.0001919872,"about_ca_topic_score_gemma":0.00024316063,"teacher_disagreement_score":0.8124453,"about_ca_system_score_codex":0.00045996977,"about_ca_system_score_gemma":0.00044518552,"threshold_uncertainty_score":0.99998784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038274082,0.00022664158,0.9934771,0.00050233235,0.00040551508,0.00016499448,0.000002587195,0.0013177629,0.000075623124],"genre_scores_gemma":[0.77173924,0.000007989285,0.22756582,0.00007434549,0.00034894623,0.000025238742,0.00008686443,0.000056512057,0.000095035735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984323,0.000033181168,0.00025940716,0.0006063753,0.00020697332,0.0004618028],"domain_scores_gemma":[0.9992675,0.00017957868,0.000010725165,0.0002486627,0.00005991344,0.0002336107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025669063,0.0002486026,0.00022113514,0.00012942591,0.000088628294,0.0006848551,0.0006220327,0.00010929068,0.000025832733],"category_scores_gemma":[0.000021303591,0.00025191272,0.00010739484,0.00047264242,0.000018939307,0.0005788332,0.00009736115,0.0005626872,0.000006162467],"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.0000025656514,0.00002249887,0.0000016751825,0.00010201994,0.000027931897,0.000011812965,0.0003167667,0.9492107,0.015009021,0.0015843371,0.0002970007,0.033413656],"study_design_scores_gemma":[0.0002624907,0.00011086026,0.0000020329367,0.00008942887,0.0000065220433,0.000029606239,0.000010034223,0.98588187,0.012184885,0.000028357732,0.0010894467,0.00030445107],"about_ca_topic_score_codex":0.000006653247,"about_ca_topic_score_gemma":4.2786095e-8,"teacher_disagreement_score":0.76791185,"about_ca_system_score_codex":0.00006380648,"about_ca_system_score_gemma":0.00004835513,"threshold_uncertainty_score":0.9999933},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.3303223e-8,0.0005304335,0.66574943,0.0011255745,0.00026719857,0.00022645015,0.0000130559865,0.00014134649,0.33194646],"genre_scores_gemma":[0.00029983363,0.000017803224,0.16468804,0.00006883125,0.0001064357,0.000022870328,0.00006286311,0.000026747784,0.8347066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991448,0.000004415628,0.00024438527,0.00033670483,0.00016291715,0.000106800675],"domain_scores_gemma":[0.9993268,0.000045209632,0.00012045013,0.00033344,0.00013436939,0.000039693332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118584765,0.00016518519,0.00018674936,0.00014945242,0.000049709215,0.00007201858,0.00039203782,0.00016480182,0.00010695003],"category_scores_gemma":[0.000008211718,0.00013692859,0.00013407285,0.000050761715,0.00002712642,0.00008015721,0.000057947844,0.000203903,0.000024187826],"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":[4.46479e-7,0.000006808921,1.50119e-7,0.00019126438,0.000025055155,6.073112e-7,0.00023497643,0.16030186,0.0000023719185,0.82986844,0.0041033793,0.0052646087],"study_design_scores_gemma":[0.000077416444,0.00005976669,1.9773255e-7,0.00013203069,0.000025170422,0.0000058634264,0.0000031338516,0.82104594,0.000012046114,0.045822166,0.13264777,0.00016848509],"about_ca_topic_score_codex":0.000020502554,"about_ca_topic_score_gemma":0.0000075894764,"teacher_disagreement_score":0.7840463,"about_ca_system_score_codex":0.000016854157,"about_ca_system_score_gemma":0.00007798223,"threshold_uncertainty_score":0.5583786},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003450142,0.00032720045,0.49366194,0.0020949251,0.0010040869,0.0069945864,0.00065346714,0.0005518563,0.4912618],"genre_scores_gemma":[0.02592504,0.00015586644,0.74320585,0.0008085859,0.0008616827,0.00062387675,0.00026654036,0.00027687624,0.22787566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983358,0.000009695145,0.0006306889,0.0004376332,0.0002918166,0.00029440908],"domain_scores_gemma":[0.99847287,0.00042578345,0.00052864524,0.0004778061,0.000043423246,0.000051495914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081143016,0.00037817372,0.000679888,0.00007119974,0.00024860102,0.00012170509,0.00071313634,0.0004521597,0.0000026511532],"category_scores_gemma":[0.000015763877,0.0002789245,0.00042353335,0.000051609004,0.00033477356,0.000025802652,0.0004197993,0.0009065668,6.3388967e-7],"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.0000066025673,0.000022309905,3.3579516e-7,0.00046438814,0.00012218837,3.1943776e-7,0.001965739,0.00002766511,0.000041333595,0.9429286,0.00041833628,0.054002166],"study_design_scores_gemma":[0.0010276376,0.000040920855,4.5672047e-7,0.00053048815,0.00009056279,0.0000030253595,0.00030745557,0.06564057,0.00009157343,0.9292277,0.0026948985,0.00034468342],"about_ca_topic_score_codex":0.000018035447,"about_ca_topic_score_gemma":0.000006846773,"teacher_disagreement_score":0.26338613,"about_ca_system_score_codex":0.000038496997,"about_ca_system_score_gemma":0.000110973764,"threshold_uncertainty_score":0.99996626},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00783477,0.00016057886,0.98755485,0.0011981259,0.002229842,0.0003401253,0.0000017893323,0.00013224679,0.0005476753],"genre_scores_gemma":[0.6956803,0.000041701525,0.30263752,0.00019606904,0.000041186842,0.00008302264,0.000014543403,0.0000116210085,0.0012940505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856335,0.00011795488,0.0003472041,0.0004752139,0.00015513929,0.00034116584],"domain_scores_gemma":[0.99939877,0.0001585915,0.00008133053,0.00023953685,0.00007829626,0.000043494685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004232169,0.00015439348,0.00020922451,0.00035715973,0.00022555125,0.00015907332,0.00057139684,0.00007733336,0.000006601143],"category_scores_gemma":[0.0002840703,0.00016339858,0.00007671099,0.0007267342,0.00006336639,0.0003107289,0.000111070985,0.00031154748,0.00001619116],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039429244,0.00007307693,0.0016561958,0.000034958895,0.000022638327,0.0000039107354,0.0017105768,0.025070146,0.00087547314,0.01988523,0.00044278766,0.9501856],"study_design_scores_gemma":[0.000051164847,0.000065957145,0.0003224302,0.000050268507,0.0000064670144,8.199867e-7,0.0011437344,0.91896033,0.013755446,0.06436299,0.0011201107,0.00016030365],"about_ca_topic_score_codex":0.000057286165,"about_ca_topic_score_gemma":0.00004207036,"teacher_disagreement_score":0.95002526,"about_ca_system_score_codex":0.00013322195,"about_ca_system_score_gemma":0.00007744998,"threshold_uncertainty_score":0.6663201},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.037293e-9,0.0001145107,0.46859267,0.0015584839,0.00041261356,0.000024447558,8.9019426e-7,0.0005242373,0.5287721],"genre_scores_gemma":[0.0000019204845,0.000014267191,0.10168172,0.0023124667,0.00020446972,0.0000025693535,0.000004030651,0.00003821102,0.89574033],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993612,0.000028759463,0.000066955545,0.0002865166,0.00012317258,0.00013339707],"domain_scores_gemma":[0.9993456,0.00001732048,0.000035778063,0.00055398373,0.000011311555,0.000036025096],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000061363884,0.000120485034,0.0001316326,0.00015917556,0.000023613682,0.000092115726,0.00071494066,0.00010721187,0.003852147],"category_scores_gemma":[0.000015199742,0.00009548206,0.00004921156,0.00015965701,0.000009813383,0.000021275877,0.00021326724,0.00021656475,0.0018838681],"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":[4.468167e-8,0.000005744186,0.000006962151,0.000010367334,0.000008668741,0.0000017399491,0.0000065890267,0.0000018954885,1.3546615e-7,0.04920714,0.88139445,0.06935628],"study_design_scores_gemma":[0.00004669818,0.0000041125822,0.000010032607,0.00004464097,0.0000019947247,0.0000012256877,2.1101218e-7,0.002697209,0.0000012979077,0.00094552716,0.9961311,0.00011593273],"about_ca_topic_score_codex":0.0006737185,"about_ca_topic_score_gemma":0.00007010789,"teacher_disagreement_score":0.3669682,"about_ca_system_score_codex":0.000005921739,"about_ca_system_score_gemma":0.0000653819,"threshold_uncertainty_score":0.99889326},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022023631,0.95021033,0.006394934,0.015110356,0.0005243844,0.00043753293,0.0000013719244,0.00008121996,0.005216213],"genre_scores_gemma":[0.2481401,0.7446765,0.0033289036,0.0013087712,0.000074753385,0.000017424733,2.87949e-7,0.000004210101,0.0024490752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995685,0.00007166919,0.00014484378,0.00011841779,0.000025685627,0.00007087556],"domain_scores_gemma":[0.9994171,0.00035464196,0.000040087583,0.00015072963,0.000028841578,0.0000085436795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048875686,0.000052680803,0.00018922651,0.000024787903,0.00009330239,0.0000064047663,0.00019235563,0.0000070701576,0.0000043575533],"category_scores_gemma":[0.0001271648,0.000032828608,0.000032192704,0.00007709666,0.00005537698,0.00003612153,0.0001875001,0.000061287436,0.000014456936],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029445393,0.000013376394,0.0007152897,0.0042117815,0.00027148018,0.0000011468481,0.0006924299,0.0022115882,0.0000091227475,0.039507944,0.0030897176,0.94927317],"study_design_scores_gemma":[0.0009122214,0.0003301509,0.0027217255,0.022587432,0.00024827287,0.000063618914,0.0006488754,0.7953097,0.00049442204,0.009943719,0.16618022,0.00055959413],"about_ca_topic_score_codex":0.000026872198,"about_ca_topic_score_gemma":0.0000051445572,"teacher_disagreement_score":0.9487136,"about_ca_system_score_codex":0.000022678256,"about_ca_system_score_gemma":0.00002568029,"threshold_uncertainty_score":0.13387118},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024206031,0.000061487575,0.9698378,0.00032059356,0.00017810127,0.00013181393,1.5398636e-7,0.00025642043,0.005007622],"genre_scores_gemma":[0.8400904,7.9262173e-7,0.15763772,0.00008558921,0.000014051164,0.000009464812,0.0000014037292,0.0000038880758,0.0021566842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989625,0.000115452625,0.00022218081,0.00029914826,0.00018163591,0.00021905213],"domain_scores_gemma":[0.99938077,0.00014657633,0.00008882232,0.00023469226,0.00010745243,0.000041696407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030996453,0.000115473624,0.00018036396,0.00016871211,0.00014062776,0.000060408736,0.00038339532,0.000039019927,0.000014874977],"category_scores_gemma":[0.0000944979,0.00009333523,0.00007785531,0.00079601025,0.000039608196,0.000048680762,0.00017115245,0.00021585889,0.000010031601],"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.000018446519,0.00028471212,0.0063808886,0.00010124842,0.000083984465,0.0000123316795,0.0031265256,0.109238096,0.008244826,0.18269046,0.000098958284,0.6897195],"study_design_scores_gemma":[0.0002840782,0.00012601177,0.0006249036,0.00004660035,0.0000038817284,0.0000012999087,0.000046871017,0.9930515,0.004139088,0.0003868488,0.0011862514,0.00010264854],"about_ca_topic_score_codex":0.00004340717,"about_ca_topic_score_gemma":7.93195e-7,"teacher_disagreement_score":0.88381344,"about_ca_system_score_codex":0.0000134774,"about_ca_system_score_gemma":0.00004072079,"threshold_uncertainty_score":0.38061002},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005906331,0.00019499181,0.9954191,0.0025775568,0.00030026695,0.0003209235,0.0000032167045,0.00036998297,0.00022332765],"genre_scores_gemma":[0.46497944,0.000117445365,0.5327802,0.00008736325,0.000036016216,0.0001718594,0.00006085676,0.000011152771,0.0017557272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988717,0.00014347112,0.00021442017,0.00042336044,0.00014447613,0.00020261238],"domain_scores_gemma":[0.9991957,0.00022491108,0.000083569576,0.00028234863,0.00015740773,0.000056080924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002925416,0.00013575434,0.00013156944,0.000232065,0.0009167998,0.000112196,0.00021467484,0.000087916625,0.0000054743386],"category_scores_gemma":[0.00014954034,0.00014046107,0.00007849212,0.00051516615,0.000046187477,0.00026770763,0.000012119884,0.00025969476,0.0000025114775],"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.000028888322,0.00009004724,0.00037721783,0.000037511243,0.000027257096,2.817562e-7,0.00012957049,0.73524827,0.000015471167,0.0024908078,0.000048455146,0.26150623],"study_design_scores_gemma":[0.00044753883,0.000176809,0.0025251715,0.00006006541,0.00002598855,0.000005268397,0.000087346234,0.98643875,0.000027512895,0.000639894,0.0094257,0.00013997765],"about_ca_topic_score_codex":0.000018282135,"about_ca_topic_score_gemma":0.000001781682,"teacher_disagreement_score":0.4643888,"about_ca_system_score_codex":0.000092497154,"about_ca_system_score_gemma":0.000066944376,"threshold_uncertainty_score":0.70513755},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000204509,0.00017434066,0.9839912,0.000085364474,0.0011461267,0.0002966884,4.1708202e-7,0.00038218973,0.013719158],"genre_scores_gemma":[0.10681576,0.0000016795851,0.8920807,0.00006511694,0.00003863762,0.00006178487,3.643108e-7,0.000010039596,0.00092588237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997219,0.0011116349,0.00049818034,0.00042149873,0.00022809643,0.0005215375],"domain_scores_gemma":[0.99871236,0.00051705533,0.00015791896,0.00050624285,0.00005365204,0.0000527497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009831081,0.00018639615,0.00034239225,0.00033616,0.00024423574,0.00027253805,0.0009085201,0.00010038198,9.826766e-7],"category_scores_gemma":[0.00022669116,0.00016709675,0.000068166664,0.00078173156,0.000017869348,0.00072323915,0.00031514242,0.00029195275,0.000008140378],"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.000014242804,0.000029494782,0.00030596583,0.0005070849,0.000025193012,0.000019129835,0.0011100229,0.23369868,0.0014373626,0.5591782,0.00012142836,0.20355321],"study_design_scores_gemma":[0.00026564518,0.000020236517,0.000040629773,0.0003061996,0.0000054988895,0.000018040852,0.00010398819,0.993738,0.001878224,0.0031155243,0.00034172207,0.00016629984],"about_ca_topic_score_codex":0.00003816184,"about_ca_topic_score_gemma":4.895547e-7,"teacher_disagreement_score":0.7600393,"about_ca_system_score_codex":0.00016922696,"about_ca_system_score_gemma":0.00010249004,"threshold_uncertainty_score":0.6814008},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020145897,0.000060305818,0.9892454,0.002102799,0.00062186236,0.00012099744,6.832275e-7,0.00038408014,0.005449266],"genre_scores_gemma":[0.5135001,0.000004172094,0.4766735,0.0013204871,0.00017009093,0.000038218936,0.0000049115883,0.00000820589,0.008280287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992543,0.000023674358,0.00013499605,0.00027854275,0.00009623219,0.0002122744],"domain_scores_gemma":[0.99944264,0.00017135759,0.000033710374,0.00026011973,0.000060265997,0.00003191767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028241536,0.00008756293,0.0001100378,0.00009860356,0.00020210241,0.0001759917,0.0005021351,0.00003342664,0.000013933316],"category_scores_gemma":[0.00009793981,0.000070441114,0.000076048054,0.00032531482,0.000008916737,0.00013538326,0.00016427092,0.000102310405,0.000014281994],"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.0000021474282,0.00006518364,0.007741189,0.00008449997,0.00003099268,0.0000022290922,0.00028560622,0.0026492001,0.000077579316,0.34481943,0.007792594,0.63644934],"study_design_scores_gemma":[0.00035376195,0.000026185711,0.0006375337,0.00005517021,0.0000044134486,0.0000020343493,0.00005843867,0.92987657,0.0003273283,0.0082954625,0.060220193,0.00014290503],"about_ca_topic_score_codex":0.000076398865,"about_ca_topic_score_gemma":0.0000060843245,"teacher_disagreement_score":0.9272274,"about_ca_system_score_codex":0.000015350273,"about_ca_system_score_gemma":0.00003977923,"threshold_uncertainty_score":0.28725052},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007861985,0.0001639363,0.9957837,0.0007214095,0.0012920065,0.0007327451,0.0000059035,0.00014802818,0.00036607482],"genre_scores_gemma":[0.118931405,0.00002272484,0.8793578,0.0006170011,0.00050351454,0.000031320065,0.000035105768,0.00003579978,0.0004653047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644196,0.00016153448,0.00050352875,0.0016182549,0.00063209294,0.0006426496],"domain_scores_gemma":[0.99784476,0.0008670263,0.00039853874,0.0005545025,0.00020849255,0.00012667481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010540568,0.0004929689,0.0005819121,0.00096328015,0.00037519977,0.00059178035,0.0014657862,0.00028631446,0.0000068179897],"category_scores_gemma":[0.00018074241,0.00047890857,0.0001733569,0.0007286333,0.0002573226,0.0006935262,0.0006098165,0.0014506794,0.0000035472517],"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.000019186291,0.000027754177,0.00022841227,0.000048209586,0.000011684663,0.000031869018,0.0005221808,0.39367467,0.00021610511,0.0012415524,0.0000051289103,0.60397327],"study_design_scores_gemma":[0.00059153175,0.0002760852,0.0003973518,0.00069705147,0.000016681417,0.000039823877,0.0000015016797,0.98315096,0.0007274501,0.013495343,0.00013117693,0.0004750458],"about_ca_topic_score_codex":0.000071796596,"about_ca_topic_score_gemma":0.00015488632,"teacher_disagreement_score":0.6034982,"about_ca_system_score_codex":0.0005778525,"about_ca_system_score_gemma":0.00071837875,"threshold_uncertainty_score":0.99976623},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61499345,0.0005384469,0.3758189,0.0044579715,0.0006051307,0.0005620455,0.0000020313255,0.00027600364,0.002746026],"genre_scores_gemma":[0.9341886,0.000026111242,0.06533749,0.00020040723,0.000023335568,0.000029060593,0.0000029657526,0.0000057536577,0.00018630186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987246,0.00004150381,0.0003596774,0.0003836086,0.00026162213,0.00022901727],"domain_scores_gemma":[0.99904525,0.00007412889,0.00023343912,0.00012661346,0.0004627198,0.000057862137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022241802,0.00016956788,0.00020298241,0.0001244306,0.00032045395,0.00019698642,0.00061768154,0.00006553711,0.0000055092537],"category_scores_gemma":[0.000058046007,0.00013682472,0.00007049838,0.0005845614,0.00014935958,0.00024660368,0.000507305,0.00019505547,0.0000023588047],"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.000059992723,0.00050414586,0.18535446,0.00046158,0.00017179736,7.946635e-7,0.0019869106,0.029084513,0.005522447,0.50513154,0.0067821643,0.26493967],"study_design_scores_gemma":[0.00026650462,0.00007518879,0.20964682,0.00020176407,0.00001583667,0.000009109264,0.00012278468,0.70342183,0.00018247675,0.085465685,0.00046535063,0.00012663488],"about_ca_topic_score_codex":0.00004613746,"about_ca_topic_score_gemma":0.0000023045943,"teacher_disagreement_score":0.6743373,"about_ca_system_score_codex":0.000033573688,"about_ca_system_score_gemma":0.00011507604,"threshold_uncertainty_score":0.55795497},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020391808,0.000042624288,0.7959527,0.0025776976,0.00030512962,0.000049928476,4.4865638e-7,0.0003149475,0.19871736],"genre_scores_gemma":[0.53395474,0.00000830888,0.4193005,0.0027818938,0.00012563392,0.000014943463,0.000004163089,0.000010221543,0.0437996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917036,0.000035299923,0.00013476686,0.0002804598,0.00014668966,0.00023243498],"domain_scores_gemma":[0.9994658,0.0000644717,0.00003588985,0.00036766994,0.000027607357,0.00003851526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029202874,0.00009390623,0.00010575688,0.00007940811,0.00018739229,0.00024183781,0.0005671598,0.000030231771,0.000028478],"category_scores_gemma":[0.00003406701,0.000073550895,0.000044389246,0.00036395268,0.00002477856,0.00019903698,0.00030367868,0.00014467082,0.00004881862],"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.0000012314172,0.000015560143,0.0020479576,0.000025433803,0.000017764653,0.000008659354,0.0002234294,0.00021325501,0.000211299,0.9032795,0.003309456,0.090646476],"study_design_scores_gemma":[0.00037555993,0.000024498517,0.0022225957,0.000031206186,0.000006038756,0.000006436155,0.000045513567,0.9082911,0.0008432833,0.04261331,0.045315634,0.00022483528],"about_ca_topic_score_codex":0.00006862405,"about_ca_topic_score_gemma":0.0000052324262,"teacher_disagreement_score":0.90807784,"about_ca_system_score_codex":0.000014187684,"about_ca_system_score_gemma":0.00003305066,"threshold_uncertainty_score":0.29993185},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017738147,0.000084225736,0.9907374,0.0036464997,0.000116083385,0.000118396565,2.1872822e-7,0.0004251203,0.0030982879],"genre_scores_gemma":[0.32993835,0.0000014932558,0.66920954,0.00047912108,0.00005877166,0.000018063069,0.0000010204161,0.0000026971004,0.00029096653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993778,0.000026798029,0.00014191614,0.00023992886,0.000074565796,0.00013897757],"domain_scores_gemma":[0.9993725,0.00039348486,0.000029400302,0.00008784628,0.0000862822,0.000030513418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001977183,0.000080060454,0.00012447279,0.00010569512,0.00025955663,0.00016663721,0.00017327428,0.000039399878,0.000007734627],"category_scores_gemma":[0.000090605514,0.0000725516,0.00002602652,0.00028321941,0.000009346206,0.0001231468,0.00010302533,0.00014689415,0.0000012773089],"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.000002868679,0.000019543852,0.0054507516,0.00004311927,0.0000151242575,3.990214e-7,0.00007339226,0.00048385398,0.000020834203,0.9011902,0.00078243343,0.09191748],"study_design_scores_gemma":[0.00012555427,0.00003550768,0.0019286724,0.00006566904,0.000004333404,0.000008515538,0.000008946968,0.80711824,0.00049546646,0.18759578,0.0025346659,0.00007864746],"about_ca_topic_score_codex":0.000027290795,"about_ca_topic_score_gemma":0.000003794662,"teacher_disagreement_score":0.80663437,"about_ca_system_score_codex":0.000014829456,"about_ca_system_score_gemma":0.000028454242,"threshold_uncertainty_score":0.29585683},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09160861,0.000559852,0.90220433,0.003842695,0.0005673967,0.00042786886,0.000005428012,0.00013626779,0.000647537],"genre_scores_gemma":[0.8440783,0.00019078894,0.1544107,0.00017680865,0.00011791311,0.00007961924,0.000013297639,0.00000835982,0.00092418236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988012,0.00017698198,0.0002871544,0.00042495437,0.0001619922,0.00014773443],"domain_scores_gemma":[0.9988251,0.00024099275,0.00023511807,0.0005817966,0.00008438267,0.000032635275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006497119,0.00016091645,0.00026038525,0.00008146255,0.00012256257,0.00009311201,0.00067320326,0.00009927767,0.0000037442314],"category_scores_gemma":[0.00013824117,0.00011239343,0.000074376665,0.00014675586,0.000113803486,0.0001231435,0.0012350644,0.0005132556,0.000005097979],"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.000112425805,0.00049708213,0.25646514,0.0027403797,0.0006198359,0.000016650345,0.05174643,0.077162676,0.0020407957,0.063393466,0.00043209112,0.54477304],"study_design_scores_gemma":[0.0024395676,0.000057650217,0.06397236,0.0008007768,0.00007119717,0.000005102897,0.00017619472,0.9110633,0.0012579462,0.016964315,0.0026514435,0.00054016046],"about_ca_topic_score_codex":0.0002876102,"about_ca_topic_score_gemma":0.000014561713,"teacher_disagreement_score":0.83390063,"about_ca_system_score_codex":0.000014458154,"about_ca_system_score_gemma":0.00009827421,"threshold_uncertainty_score":0.45832708},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065858506,0.00016181936,0.9323831,0.00054671254,0.00037679568,0.00006639696,0.0000016456148,0.00047317753,0.00013179568],"genre_scores_gemma":[0.84414166,0.000008013302,0.15552321,0.000088454544,0.00012536779,0.0000048223246,0.000022840113,0.000010337282,0.000075270276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987739,0.00001651257,0.00023449086,0.00044955668,0.00018916711,0.00033639616],"domain_scores_gemma":[0.9993771,0.00025215643,0.00003660022,0.00019516694,0.00003871422,0.00010027542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011670268,0.0002072588,0.00022428819,0.000050711442,0.00013015755,0.00009239121,0.0004188157,0.00009355725,0.0000032115056],"category_scores_gemma":[0.0000922786,0.00021283611,0.00007380127,0.00027655272,0.00003624807,0.00017245117,0.00023970594,0.00047520213,0.0000032820078],"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.0000063743682,0.000029234287,0.00015794832,0.00004673829,0.00002546694,0.000044761255,0.00024119712,0.97326547,0.0063509555,0.0044916268,0.00005357696,0.015286667],"study_design_scores_gemma":[0.0003419344,0.000025610621,0.00012090848,0.000090045054,0.000009319337,0.0000229268,0.00000405746,0.98973215,0.003719668,0.000048092632,0.005668034,0.00021727715],"about_ca_topic_score_codex":0.00001131009,"about_ca_topic_score_gemma":4.668224e-8,"teacher_disagreement_score":0.7782832,"about_ca_system_score_codex":0.000053079853,"about_ca_system_score_gemma":0.000030136785,"threshold_uncertainty_score":0.86792046},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047762576,0.00036986606,0.89070284,0.00045311375,0.0007478398,0.00025084132,7.231359e-7,0.00024422733,0.10245427],"genre_scores_gemma":[0.9926482,0.00000939176,0.0019241496,0.0003913725,0.000088884895,0.000032213502,0.0000129466125,0.0000033703398,0.0048894784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991453,0.00010671015,0.00029263168,0.00014821446,0.00012246006,0.00018466255],"domain_scores_gemma":[0.9994598,0.00005903081,0.00007134265,0.00019422981,0.00013519333,0.00008042708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045851467,0.00011463176,0.00016154409,0.0002774864,0.000248581,0.0005174648,0.00027247806,0.000055103275,0.0000014808113],"category_scores_gemma":[0.000055155713,0.00009538212,0.00003124026,0.00058517675,0.000013358042,0.001213412,0.00017259174,0.00018622643,0.00010768897],"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.0000085855045,0.00002576371,0.00057565444,0.00032108495,0.000030045327,3.3897507e-7,0.012052589,0.64782166,0.000008797171,0.1246482,0.0061682933,0.20833898],"study_design_scores_gemma":[0.00026299714,0.00003522455,0.00049504486,0.000043259977,0.0000026015446,0.0000080949985,0.00083871477,0.8323424,0.0000025147342,0.000018176028,0.16585435,0.00009665219],"about_ca_topic_score_codex":0.00006461511,"about_ca_topic_score_gemma":0.0000012137039,"teacher_disagreement_score":0.98787194,"about_ca_system_score_codex":0.000034292334,"about_ca_system_score_gemma":0.00005025634,"threshold_uncertainty_score":0.49899253},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003166677,0.000058710015,0.9165126,0.0041598314,0.00041118255,0.0001365382,1.1335351e-7,0.0003575048,0.07804682],"genre_scores_gemma":[0.4393093,0.000014698406,0.24882363,0.0023501755,0.00016515166,0.00008755691,0.000010226309,0.000011355316,0.3092279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992118,0.000031464682,0.00016393559,0.0002603898,0.00011368789,0.00021873447],"domain_scores_gemma":[0.9994782,0.000118743395,0.000041623935,0.00026868144,0.000053388343,0.000039343002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031644825,0.000099011115,0.00011466904,0.000106139225,0.00022436997,0.00014482244,0.0004737005,0.000032516302,0.00003956738],"category_scores_gemma":[0.00013600815,0.0000790165,0.000072020346,0.00024328566,0.000011904076,0.00013148232,0.00019642651,0.00014070938,0.000029098157],"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.000008291312,0.00002096049,0.0016570056,0.00005094499,0.000032860684,0.0000017459256,0.00022076216,0.026125703,0.00017833475,0.50345653,0.011990567,0.4562563],"study_design_scores_gemma":[0.0003034318,0.0000710693,0.00030154712,0.000016422455,0.0000035411108,0.0000012945644,0.0000094747975,0.7970735,0.00040972655,0.004702569,0.19700788,0.00009953499],"about_ca_topic_score_codex":0.00007390305,"about_ca_topic_score_gemma":0.0000032971923,"teacher_disagreement_score":0.7709478,"about_ca_system_score_codex":0.000018126526,"about_ca_system_score_gemma":0.00004007018,"threshold_uncertainty_score":0.3222199},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5911718,0.0003733413,0.39863825,0.0012605115,0.0016870983,0.00041473092,0.000014654223,0.00021469254,0.0062249205],"genre_scores_gemma":[0.9665343,0.00011881281,0.010372633,0.000786789,0.0010494812,0.00007537144,0.00020944305,0.000023534873,0.020829596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966712,0.0004303965,0.00058041496,0.0013069551,0.00053823664,0.0004727988],"domain_scores_gemma":[0.9974936,0.0001596169,0.0005212027,0.0013131184,0.00036908017,0.00014334623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071164937,0.0005438088,0.00050041516,0.0003347263,0.00042315054,0.00045617553,0.0010928961,0.000340856,0.00012371746],"category_scores_gemma":[0.00016775481,0.00049702736,0.0001443623,0.0006476243,0.000099051045,0.00038627547,0.00095352705,0.0013218714,0.00026026592],"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.000049578586,0.00039759206,0.45211685,0.0005343425,0.00038409105,0.00026379083,0.021943757,0.031979073,0.0022388843,0.005305334,0.0005957358,0.48419097],"study_design_scores_gemma":[0.0011391477,0.00035030133,0.22003257,0.00064747303,0.00011745174,0.000034044242,0.0001864285,0.76634693,0.003666883,0.000048654463,0.0064780368,0.0009520555],"about_ca_topic_score_codex":0.00065139803,"about_ca_topic_score_gemma":0.00012051604,"teacher_disagreement_score":0.7343679,"about_ca_system_score_codex":0.0001311142,"about_ca_system_score_gemma":0.000460914,"threshold_uncertainty_score":0.9997481},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067351624,0.00033962785,0.92091334,0.00043381192,0.0016515001,0.0005623023,0.000004060834,0.00038564808,0.008358073],"genre_scores_gemma":[0.9817929,0.00011127584,0.016465394,0.0003264461,0.00018719505,0.00006265434,0.00007236179,0.00001815103,0.00096360955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637246,0.00050555693,0.0012014423,0.0005279326,0.00051252206,0.00088009797],"domain_scores_gemma":[0.9977662,0.00034585578,0.00081857876,0.00037109802,0.0005743605,0.00012389837],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016655045,0.00051078387,0.00056195195,0.0013514647,0.0012714437,0.001243924,0.00062697165,0.0004831778,0.000034419998],"category_scores_gemma":[0.0013887685,0.00055993424,0.00016838117,0.003523848,0.00012740392,0.0056657977,0.0003532483,0.002037837,0.0000906063],"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.00009023172,0.000042070336,0.0023091,0.0006503758,0.00006118569,0.000002565718,0.022288168,0.2284138,0.000544895,0.0022318142,0.000068255875,0.7432975],"study_design_scores_gemma":[0.00091507134,0.00024106375,0.015450635,0.0022487398,0.000030724026,0.00004092385,0.0021526546,0.9648427,0.002381408,0.0031087121,0.008005407,0.0005819875],"about_ca_topic_score_codex":0.0013663697,"about_ca_topic_score_gemma":0.00024102141,"teacher_disagreement_score":0.9144413,"about_ca_system_score_codex":0.0016945368,"about_ca_system_score_gemma":0.00057671446,"threshold_uncertainty_score":0.9997929},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85629505,0.00013537887,0.13962027,0.000607413,0.0005195007,0.000053530413,8.5803373e-7,0.000114724106,0.002653251],"genre_scores_gemma":[0.9958259,0.0000054226443,0.0029513706,0.00031351557,0.00007548214,0.0000021659218,0.000001330773,0.000004373656,0.0008204804],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992189,0.000048178572,0.00018110222,0.00024722473,0.00012901891,0.00017559416],"domain_scores_gemma":[0.99940395,0.00012013621,0.00007241753,0.0003190056,0.00004935415,0.000035157263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109790846,0.000094389485,0.00015640099,0.00006681858,0.000094168,0.000027389118,0.00037662228,0.00004431056,0.00001663884],"category_scores_gemma":[0.00008423778,0.000085683365,0.000055420714,0.00029068385,0.00004406487,0.00014893402,0.0002726281,0.00014046968,0.000021983189],"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.000018313667,0.00015379736,0.8019047,0.000063704145,0.000057713813,0.000028954672,0.0009885901,0.002674943,0.04199505,0.03938697,0.0022918296,0.11043546],"study_design_scores_gemma":[0.0010388201,0.0002212215,0.80378884,0.00019824848,0.000022311186,0.000008290061,0.00008693054,0.108463,0.06401511,0.0013072223,0.020454025,0.00039595793],"about_ca_topic_score_codex":0.00009338162,"about_ca_topic_score_gemma":0.0000038770813,"teacher_disagreement_score":0.1395308,"about_ca_system_score_codex":0.000015436503,"about_ca_system_score_gemma":0.000054307824,"threshold_uncertainty_score":0.34940663},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29672304,0.00044091637,0.6866415,0.007612565,0.004057252,0.0010696066,0.0009077738,0.0003683592,0.0021789726],"genre_scores_gemma":[0.9673215,0.000070013986,0.012371512,0.0018122492,0.0012519638,0.00020383287,0.0009215319,0.00003894456,0.01600842],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9963631,0.00031602877,0.00071251864,0.0015427907,0.0004204075,0.0006451737],"domain_scores_gemma":[0.99685234,0.0009790743,0.0005801846,0.0010184789,0.00038568908,0.0001842324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006348526,0.00060730864,0.0006439467,0.00024028406,0.00053032505,0.00026650415,0.0012925946,0.00041204473,0.00019238763],"category_scores_gemma":[0.0004359123,0.0006309623,0.00040557462,0.00026461275,0.00010107518,0.0002354174,0.001533248,0.0013488354,0.00035380627],"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.00006444778,0.00039566652,0.6063458,0.0009083445,0.0006092976,0.0001381439,0.006105119,0.0015236017,0.00013682485,0.002793175,0.0013134184,0.3796662],"study_design_scores_gemma":[0.0005338394,0.00013678266,0.7478773,0.0008058144,0.00009625674,0.000017397835,0.000040304672,0.24599266,0.000117959564,0.00042337895,0.0033338575,0.00062443095],"about_ca_topic_score_codex":0.00027330263,"about_ca_topic_score_gemma":0.000009030833,"teacher_disagreement_score":0.67427,"about_ca_system_score_codex":0.00013214689,"about_ca_system_score_gemma":0.00040923594,"threshold_uncertainty_score":0.9996142},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7938647,0.000021258933,0.2035898,0.0007428775,0.00014987707,0.0002671455,0.000008299734,0.000083983425,0.0012720148],"genre_scores_gemma":[0.98586994,8.6336433e-7,0.013753872,0.00019812818,0.000026778793,0.000035099107,0.000004223277,0.0000047280137,0.000106358435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865603,0.00028401756,0.0003304617,0.0002879026,0.0002581455,0.00018344962],"domain_scores_gemma":[0.99740624,0.0014932663,0.00033417143,0.00058753125,0.0001531745,0.000025638708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000845172,0.00018966098,0.00022930803,0.00020968886,0.00010056222,0.000081050486,0.00074118754,0.000093355615,0.00000446693],"category_scores_gemma":[0.0010084674,0.00012915579,0.0000452839,0.00045466455,0.00005998148,0.00028005097,0.0006088802,0.0008868808,0.0000067456604],"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.00019124938,0.000099020115,0.069513045,0.00015603959,0.0000466117,0.000015417636,0.0038499539,0.8989037,0.000019688345,0.0030593225,0.0000718308,0.024074081],"study_design_scores_gemma":[0.00019439195,0.00021558025,0.28542915,0.0011430413,0.000009093886,0.0000026088805,0.0001098591,0.7120406,0.00006094067,0.00060773245,0.00001225757,0.00017477307],"about_ca_topic_score_codex":0.00043032112,"about_ca_topic_score_gemma":0.000008405509,"teacher_disagreement_score":0.2159161,"about_ca_system_score_codex":0.000054984004,"about_ca_system_score_gemma":0.00027136086,"threshold_uncertainty_score":0.526682},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025256483,0.000010354708,0.99105114,0.0030970944,0.000111677444,0.00032349024,0.000002773943,0.000060317205,0.0028175283],"genre_scores_gemma":[0.97895235,0.000002011075,0.017504305,0.003367969,0.0000071070936,0.00005875644,0.000015194013,0.000001327621,0.000090966125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995717,0.000023559494,0.00016882813,0.000070061804,0.000091238646,0.00007464578],"domain_scores_gemma":[0.9995645,0.00021025013,0.00006881616,0.00008074699,0.000059768572,0.000015881747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020319021,0.00006159614,0.000054063068,0.00006668568,0.00017593232,0.00023172378,0.00011600604,0.000018534638,0.0000011437945],"category_scores_gemma":[0.000025072419,0.000041433585,0.00001899008,0.000073819065,0.000011682662,0.00039847696,0.00003653064,0.000055250097,0.0000067146857],"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.0000109517305,0.0000123552145,0.000010017943,0.000029643052,0.0000072864714,7.415357e-8,0.0010058217,0.06464785,0.000001341477,0.5531566,0.0005594305,0.38055858],"study_design_scores_gemma":[0.00037417372,0.000058316826,0.00016439124,0.000020973146,0.0000025343027,0.0000011115749,0.000033767254,0.9346277,0.000010994549,0.06239126,0.0022700275,0.000044720306],"about_ca_topic_score_codex":0.000009882541,"about_ca_topic_score_gemma":9.151109e-7,"teacher_disagreement_score":0.9764267,"about_ca_system_score_codex":0.00001731072,"about_ca_system_score_gemma":0.000019515533,"threshold_uncertainty_score":0.22345178},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011123568,0.00019349744,0.9898009,0.0008988893,0.0003622028,0.0011028096,0.000053791267,0.0005516645,0.0059239063],"genre_scores_gemma":[0.36568195,0.000095035975,0.6313373,0.00017783024,0.00016092921,0.0000354891,0.00011568841,0.00003534344,0.00236044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663913,0.00030604762,0.00066505594,0.0013781642,0.00035048017,0.0006611323],"domain_scores_gemma":[0.9980824,0.00041959572,0.00040121833,0.00042312825,0.00045249242,0.00022118336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012325987,0.00046986373,0.0005533416,0.00051107997,0.0009956865,0.0008309704,0.00056696683,0.00031347552,0.00003758825],"category_scores_gemma":[0.00092490297,0.0004777986,0.00011138582,0.0015423676,0.0003231961,0.0009209908,0.00020522659,0.0008075878,0.0000011057986],"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.00020414323,0.00046430592,0.00009240351,0.00018283396,0.00008154057,0.0000012663327,0.0033742478,0.00045733535,0.040789805,0.015333882,0.00021883675,0.9387994],"study_design_scores_gemma":[0.001415347,0.0004796502,0.00002673805,0.000116131894,0.00007850681,0.000051082654,0.0029023932,0.9586145,0.03161306,0.00025035435,0.003956812,0.00049541605],"about_ca_topic_score_codex":0.00005744292,"about_ca_topic_score_gemma":8.082278e-7,"teacher_disagreement_score":0.9581572,"about_ca_system_score_codex":0.000114399656,"about_ca_system_score_gemma":0.00033607113,"threshold_uncertainty_score":0.99976736},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013081601,0.00042034182,0.9939617,0.00010019696,0.00048144316,0.00012947466,0.0000019790905,0.00012725392,0.0034694294],"genre_scores_gemma":[0.81753993,0.000031934178,0.18175384,0.00011450018,0.00013917772,0.000002220261,0.0000024684534,0.000025829715,0.00039006464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975578,0.00006193363,0.0005462533,0.0007464877,0.00071398605,0.00037351067],"domain_scores_gemma":[0.99780744,0.00045622472,0.00059910066,0.0008663725,0.00018785005,0.00008300837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072926626,0.00034079637,0.00060056394,0.00068806217,0.000085399355,0.00008377657,0.0023818645,0.00018518837,0.00007109039],"category_scores_gemma":[0.00014214814,0.000293443,0.00013546742,0.00039288815,0.0004934352,0.00024046731,0.00088399503,0.0007372422,0.00001471735],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.524606e-7,0.000022921527,0.00091586687,0.00014604919,0.000011787621,0.000028957718,0.001506121,0.005286063,0.00015252695,0.0038702318,0.0000028726731,0.98805577],"study_design_scores_gemma":[0.00023531303,0.00044451648,0.0016613193,0.0010640887,0.000014094409,0.000051153045,7.5429534e-7,0.96433717,0.005512765,0.025850728,0.00027558222,0.0005525197],"about_ca_topic_score_codex":0.00014868248,"about_ca_topic_score_gemma":0.000019369161,"teacher_disagreement_score":0.98750323,"about_ca_system_score_codex":0.000045139743,"about_ca_system_score_gemma":0.00024481796,"threshold_uncertainty_score":0.9999518},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02332056,0.000052276093,0.9605703,0.0009933242,0.00034787552,0.00010984483,0.000001077215,0.00032603712,0.0142787015],"genre_scores_gemma":[0.9930641,0.00002724412,0.004524777,0.00016732322,0.00008228744,0.000010071079,0.000004738235,0.00001975776,0.002099682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969442,0.0015030878,0.00032235892,0.0004324303,0.00036420661,0.00043370115],"domain_scores_gemma":[0.9918431,0.0069565764,0.0003166755,0.00061791536,0.00015228505,0.00011346047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002371976,0.00022596907,0.00029008283,0.000086679356,0.0008604725,0.00023603326,0.0012017387,0.00007541143,0.00008483312],"category_scores_gemma":[0.0054211416,0.00016535804,0.000093270464,0.00023061536,0.0005146993,0.00010195834,0.00029966343,0.00094479043,0.00013617083],"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.000016345517,0.000025789454,0.00058611744,0.000013016917,0.000014301167,0.0000013148203,0.000448426,0.0091813365,0.0001528226,0.84191126,0.000013693206,0.14763555],"study_design_scores_gemma":[0.00037907483,0.00072356925,0.006255157,0.00013144017,0.000014352298,0.000008807525,0.0002118629,0.57920194,0.00021610077,0.4048427,0.0077057346,0.00030927887],"about_ca_topic_score_codex":0.00003538209,"about_ca_topic_score_gemma":0.000005210585,"teacher_disagreement_score":0.96974355,"about_ca_system_score_codex":0.000022528706,"about_ca_system_score_gemma":0.00008706133,"threshold_uncertainty_score":0.6743105},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.56972e-7,0.00034444424,0.5819515,0.00057598826,0.000714417,0.0001331092,0.000011750248,0.0006268252,0.4156417],"genre_scores_gemma":[0.00008448556,0.000021567419,0.101300895,0.00080052187,0.0008354648,0.000008855139,0.00016197358,0.00007715447,0.8967091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967953,0.00030238958,0.0003890543,0.001092887,0.00089361356,0.0005267675],"domain_scores_gemma":[0.9976831,0.0004977973,0.0002105393,0.0009733983,0.00011080546,0.00052435964],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011830257,0.00055530434,0.00060315547,0.00036870202,0.00024303648,0.00045991113,0.0019101923,0.00034858784,0.00057836116],"category_scores_gemma":[0.0001985207,0.00047616442,0.00018146519,0.00024575886,0.000053329422,0.00020727879,0.0010703533,0.0014529496,0.0016750284],"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.000020531874,0.000048717397,0.000035124027,0.000023938506,0.00022928874,0.00018175313,0.0020277242,0.0023778812,0.000005279608,0.5754282,0.30679432,0.11282726],"study_design_scores_gemma":[0.00026781278,0.00017254674,0.000003072083,0.00008159287,0.000021424956,0.000010645611,0.000031804444,0.11771411,0.000004525726,0.28262007,0.5984801,0.00059227867],"about_ca_topic_score_codex":0.00018261104,"about_ca_topic_score_gemma":0.00002525966,"teacher_disagreement_score":0.48106736,"about_ca_system_score_codex":0.00067396037,"about_ca_system_score_gemma":0.00050340313,"threshold_uncertainty_score":0.99976903},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009265175,0.00014059278,0.9910288,0.0007099173,0.0014192999,0.00041444247,0.000004082782,0.00034891712,0.0058412906],"genre_scores_gemma":[0.25517765,0.000031760774,0.7375465,0.0017203557,0.0020293386,0.000047988407,0.000025584428,0.00010949178,0.003311321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620384,0.00007184293,0.00043781934,0.001685389,0.0007869833,0.0008141545],"domain_scores_gemma":[0.99727124,0.0009328915,0.0003233125,0.0009891468,0.00028992523,0.0001935043],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010009146,0.00060685433,0.00063334056,0.00065156614,0.00051496486,0.001059242,0.003092175,0.00033044085,0.000022201875],"category_scores_gemma":[0.00016670623,0.0005494309,0.0002060043,0.00041150756,0.0004460872,0.0005455557,0.00085833966,0.001371,0.00003085438],"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.0000067886494,0.00000961598,0.00001538497,0.00005028182,0.000012384447,0.000011958915,0.0011257847,0.14886066,0.000086476146,0.033405002,0.000021326501,0.8163943],"study_design_scores_gemma":[0.00035277844,0.0003555232,0.000036259047,0.00023790084,0.000007803252,0.000027912445,0.0000010133585,0.89094555,0.00032733183,0.09828056,0.008779885,0.00064746494],"about_ca_topic_score_codex":0.00004125831,"about_ca_topic_score_gemma":0.000035795158,"teacher_disagreement_score":0.8157469,"about_ca_system_score_codex":0.00018335496,"about_ca_system_score_gemma":0.0006944347,"threshold_uncertainty_score":0.99997777},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027694083,0.00014146938,0.9508992,0.00034243768,0.00021767223,0.00010850875,0.00001577784,0.000101724734,0.048145548],"genre_scores_gemma":[0.023911953,0.000052095,0.7026891,0.00091331516,0.001016391,0.000028467017,0.000028011425,0.00026857184,0.27109212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993294,0.000023078324,0.00014125292,0.00021221366,0.00018592198,0.000108138534],"domain_scores_gemma":[0.99954873,0.000062468745,0.00006869656,0.0002273626,0.00002590454,0.00006684481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014444823,0.0001087239,0.0001653983,0.00019798361,0.000040038944,0.000042686537,0.0002443693,0.000073376184,0.0003940207],"category_scores_gemma":[0.000078657264,0.00008961866,0.000026157646,0.00011726551,0.0000127034,0.000020790994,0.00014138083,0.00011376779,0.000024014897],"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":[5.211958e-7,0.000013243108,0.000011210652,0.00003293362,0.0000121061385,0.0000020002385,0.00012826314,0.00009238638,0.000011134873,0.9881346,0.008643595,0.0029179826],"study_design_scores_gemma":[0.00016987136,0.00008163797,0.00014892526,0.00013269238,0.0000130940225,0.000052527088,0.000025069414,0.39095712,0.000059441314,0.04228326,0.5657934,0.0002829994],"about_ca_topic_score_codex":0.000041364834,"about_ca_topic_score_gemma":0.000013016855,"teacher_disagreement_score":0.9458514,"about_ca_system_score_codex":0.0000071069817,"about_ca_system_score_gemma":0.000031898977,"threshold_uncertainty_score":0.43142503},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025992263,0.00047109366,0.667655,0.006487185,0.0006574175,0.00034510394,0.000029762898,0.0067711864,0.314984],"genre_scores_gemma":[0.97332656,0.00007952535,0.012374728,0.0005076161,0.0006250829,6.132961e-8,0.00033946772,0.0016159876,0.01113098],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862546,0.00022568896,0.00015134871,0.00041597817,0.0003064909,0.00027504444],"domain_scores_gemma":[0.99921143,0.000030693947,0.000029312232,0.00044197543,0.00015792847,0.0001286836],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006310421,0.000102509446,0.00008437051,0.00019439097,0.0011948139,0.0028714882,0.0013697715,0.000037711234,0.0031444184],"category_scores_gemma":[0.00024729912,0.00009725749,0.000044981993,0.000715267,0.00005430194,0.0004322616,0.0011104881,0.0003121705,0.015443766],"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.0000035060089,0.000053771208,6.902266e-7,0.00006831015,0.000026251766,0.00006497558,0.0015528837,0.00011541359,0.0011536685,0.16563512,0.19460616,0.6367193],"study_design_scores_gemma":[0.00009161037,0.000112266396,0.000073502415,0.00003016962,0.0000033438268,0.00015679667,0.000028353334,0.06555113,0.0001388719,0.00094535144,0.9327526,0.00011597084],"about_ca_topic_score_codex":0.000006086845,"about_ca_topic_score_gemma":3.8799566e-8,"teacher_disagreement_score":0.9707273,"about_ca_system_score_codex":0.000057851157,"about_ca_system_score_gemma":0.000004737467,"threshold_uncertainty_score":0.99816364},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054005188,0.0009160063,0.041035846,0.0076858276,0.0014341966,0.00041143,0.00012769944,0.0015580949,0.94677687],"genre_scores_gemma":[0.0031847649,0.00023635992,0.0012944672,0.00039168302,0.0021592102,4.8839354e-8,0.0006411258,0.0061479793,0.9859444],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962159,0.00079784315,0.0004102308,0.0011557868,0.00068464305,0.0007356437],"domain_scores_gemma":[0.9978596,0.00003926633,0.00020769701,0.0010046711,0.0004852325,0.00040352112],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010797415,0.00042800876,0.00034268203,0.0005162521,0.0017348035,0.004363876,0.00298209,0.00035396006,0.4295929],"category_scores_gemma":[0.00089871907,0.00044390594,0.00015088904,0.0013150487,0.0003237469,0.00029898566,0.003995674,0.0015956812,0.60358745],"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.0000051002103,0.00008574977,0.0000010796523,0.00013484228,0.00008404126,0.00013519422,0.0010367701,0.00004702375,0.00004640033,0.031654794,0.62956965,0.33719936],"study_design_scores_gemma":[0.00031956722,0.0002639241,0.00007311495,0.00032729236,0.000040608047,0.00039348062,0.000072558345,0.010632369,0.000021279773,0.00069098175,0.9866989,0.00046588993],"about_ca_topic_score_codex":0.00007519949,"about_ca_topic_score_gemma":4.5833528e-7,"teacher_disagreement_score":0.35712928,"about_ca_system_score_codex":0.00023498562,"about_ca_system_score_gemma":0.00001772864,"threshold_uncertainty_score":0.9998013},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023123408,0.000841477,0.07401596,0.0014717242,0.0011040241,0.0009120592,0.00057993183,0.0027928872,0.9180507],"genre_scores_gemma":[0.011334312,0.0009789484,0.0073923483,0.0006062306,0.0017010149,2.20589e-7,0.0019612666,0.0068755173,0.9691501],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99365264,0.0013942206,0.00073903264,0.001857818,0.0011304502,0.0012258103],"domain_scores_gemma":[0.99601614,0.00011167055,0.0005279244,0.0019115495,0.0009030635,0.000529657],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016226979,0.00074422004,0.0007103316,0.0010395916,0.0039570318,0.0037088206,0.0049366094,0.00040156688,0.05536299],"category_scores_gemma":[0.0014485737,0.00079288677,0.00026129626,0.0018077198,0.00033315906,0.00036766258,0.0056047677,0.0015417127,0.046226256],"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.000037438294,0.00027042092,0.000006085344,0.00037418937,0.0002143723,0.00014957826,0.0012613055,0.00037008364,0.00030861772,0.005390936,0.54449016,0.4471268],"study_design_scores_gemma":[0.00090037787,0.0004072416,0.00022153465,0.0004367534,0.000067754656,0.00017661606,0.00008539995,0.0117418915,0.0002294393,0.00024055946,0.9846968,0.0007956287],"about_ca_topic_score_codex":0.00031828927,"about_ca_topic_score_gemma":0.0000017223638,"teacher_disagreement_score":0.44633117,"about_ca_system_score_codex":0.00031098968,"about_ca_system_score_gemma":0.00005461965,"threshold_uncertainty_score":0.99945223},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011838088,0.00022079899,0.70173,0.03758056,0.0009199558,0.0007376215,0.00013423851,0.0066139833,0.24022476],"genre_scores_gemma":[0.9769404,0.0001370958,0.01101282,0.003852214,0.0021266998,8.422125e-8,0.00079375086,0.0018475686,0.0032893575],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99784124,0.00034307077,0.0002499564,0.0006292099,0.0005121049,0.00042442768],"domain_scores_gemma":[0.99868035,0.00002671903,0.00010220064,0.00050793117,0.00030894787,0.0003738475],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000450044,0.00017584601,0.00017134569,0.000106471256,0.001455536,0.0012198314,0.0020128503,0.00006667372,0.004732937],"category_scores_gemma":[0.0006393797,0.00017417705,0.000074590884,0.0008769433,0.00008803086,0.0003898905,0.0019554254,0.00044873916,0.016530473],"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.000046389818,0.00012824908,0.000022819524,0.00007316343,0.00004622524,0.00008837838,0.003125877,0.00065679825,0.0043943813,0.013837076,0.6946454,0.28293526],"study_design_scores_gemma":[0.00040820855,0.00023620472,0.0004587566,0.000013803184,0.000005895708,0.00007027963,0.000043691634,0.034888923,0.000279169,0.00010379829,0.963286,0.0002052853],"about_ca_topic_score_codex":0.00001165283,"about_ca_topic_score_gemma":8.454431e-8,"teacher_disagreement_score":0.9651023,"about_ca_system_score_codex":0.000053426054,"about_ca_system_score_gemma":0.000006526909,"threshold_uncertainty_score":0.99984443},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006299772,0.00012227855,0.3689551,0.0013670792,0.00037597725,0.0003227543,0.000043138236,0.003408862,0.61910504],"genre_scores_gemma":[0.9562382,0.00007646771,0.033593893,0.000862813,0.00038045386,5.5851363e-8,0.00044339176,0.0017215795,0.006683129],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832326,0.0002957974,0.00019105093,0.00047623354,0.0003287752,0.0003848767],"domain_scores_gemma":[0.9986242,0.00001544169,0.00008364153,0.0007825898,0.00029981782,0.00019429513],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006885273,0.00013313194,0.000120546814,0.000185357,0.0015823117,0.000688816,0.0023896021,0.00005135274,0.006983938],"category_scores_gemma":[0.00029150047,0.0001335716,0.000047628924,0.000611289,0.00009172868,0.00048383727,0.0017905389,0.0003029095,0.01253649],"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.000024160812,0.0002685598,0.000032014006,0.000039267852,0.000051793904,0.000072721785,0.0057267165,0.00004929677,0.0011797509,0.099670276,0.22760822,0.66527724],"study_design_scores_gemma":[0.00029804098,0.00021649993,0.0022084997,0.00001547331,0.000004649801,0.00013412941,0.000060829207,0.009750242,0.00042443533,0.0012447514,0.9854289,0.00021352599],"about_ca_topic_score_codex":0.000035779503,"about_ca_topic_score_gemma":1.11964496e-7,"teacher_disagreement_score":0.9499384,"about_ca_system_score_codex":0.00004475154,"about_ca_system_score_gemma":0.0000032878725,"threshold_uncertainty_score":0.9997175},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97750324,0.0006836625,0.00047691693,0.00031463258,0.0011918311,0.0006483215,0.00046089297,0.0008730388,0.017847475],"genre_scores_gemma":[0.98650306,0.00025577095,0.006896834,0.00017350708,0.00010797299,0.00008108898,0.00066236977,0.00009712966,0.0052222605],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9959175,0.0007130739,0.0007086864,0.0013371826,0.00066113914,0.0006624272],"domain_scores_gemma":[0.996462,0.00093142927,0.0005549873,0.0015314765,0.0002706697,0.0002494596],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001059839,0.000740632,0.00073585374,0.00026687715,0.0022199166,0.0008277722,0.0020917314,0.00045268194,0.000027249152],"category_scores_gemma":[0.00069930404,0.00054490496,0.00026724383,0.00087384693,0.00010976175,0.00067967805,0.0006287695,0.0020889253,0.000074861666],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067487417,0.00009739804,0.0003297946,0.00039526168,0.00023100476,0.000023312643,0.0002347749,0.000026898988,0.0035246431,0.14500016,0.000005637266,0.85012436],"study_design_scores_gemma":[0.004989361,0.0009636033,0.31946462,0.0073490404,0.0011929295,0.00039534143,0.007809148,0.15271346,0.1275471,0.2527222,0.112566024,0.012287192],"about_ca_topic_score_codex":0.00028596766,"about_ca_topic_score_gemma":0.00043234395,"teacher_disagreement_score":0.83783716,"about_ca_system_score_codex":0.000109739776,"about_ca_system_score_gemma":0.00007824555,"threshold_uncertainty_score":0.99970025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014060101,0.0013660281,0.96530545,0.00025774643,0.000937363,0.0004013871,0.0000075870125,0.00075823447,0.030825634],"genre_scores_gemma":[0.016679717,0.00030231042,0.8659517,0.000046170222,0.00049695343,0.000022392836,0.00011771801,0.00060932594,0.11577368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983341,0.00007218295,0.0001336268,0.0006693712,0.0003817035,0.00040898158],"domain_scores_gemma":[0.99935687,0.000027850176,0.000105027,0.00030832514,0.00003331737,0.00016861987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019650834,0.00031924705,0.0002673437,0.0004003374,0.00011822935,0.00028178148,0.0004771004,0.00023091186,0.000042911055],"category_scores_gemma":[0.00000782496,0.00030096472,0.00005296569,0.0002778769,0.00006872309,0.00017952078,0.00030103838,0.00050982594,0.000029270286],"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.00010132122,0.00049532636,0.00038147668,0.0031781765,0.0017437204,0.003539392,0.03475487,0.7757039,0.00004358272,0.06521429,0.025570326,0.0892736],"study_design_scores_gemma":[0.00073284225,0.00012611935,0.0000019876363,0.00048515364,0.00006844086,0.00005115371,0.0003395467,0.97802854,3.2384176e-7,0.0012230703,0.018528938,0.00041386607],"about_ca_topic_score_codex":0.00022108639,"about_ca_topic_score_gemma":0.000050808976,"teacher_disagreement_score":0.20232464,"about_ca_system_score_codex":0.00017063526,"about_ca_system_score_gemma":0.00013717196,"threshold_uncertainty_score":0.99994427},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010734152,0.0012492473,0.000102148144,0.00058873824,0.0002358105,0.0040346896,0.00012804747,0.00033050755,0.99332005],"genre_scores_gemma":[0.0000314634,0.0003088074,0.008239449,0.0010751263,0.00026117233,0.00044519248,0.00017070326,0.00009312044,0.989375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975289,0.00020450303,0.000730273,0.00050121406,0.0006338604,0.00040122456],"domain_scores_gemma":[0.9977176,0.00017112149,0.00078389305,0.00081106037,0.00017965038,0.00033664226],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036879073,0.0004891253,0.00074968016,0.00012646244,0.0001481689,0.00033692303,0.00079859263,0.00043745205,0.07179013],"category_scores_gemma":[0.00043226813,0.000449339,0.00019200251,0.0000187616,0.00012187043,8.196481e-7,0.00043590527,0.00046851503,0.00070331804],"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.00002057195,0.000027362707,0.000014155224,0.0017805775,0.000051360697,0.000092934664,0.0011605251,0.00028837443,1.12925875e-7,0.000084184976,0.9858377,0.010642131],"study_design_scores_gemma":[0.001228357,0.00031003292,0.00002506991,0.0007063367,0.000021434276,0.000081462946,0.0001380792,0.00052339473,0.0000058589294,0.000017685106,0.99642843,0.00051383267],"about_ca_topic_score_codex":0.0037490816,"about_ca_topic_score_gemma":0.00035797257,"teacher_disagreement_score":0.07108682,"about_ca_system_score_codex":0.00007343925,"about_ca_system_score_gemma":0.00014856101,"threshold_uncertainty_score":0.99979585},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091693714,0.00701411,0.032647233,0.042672224,0.0038333135,0.007109689,0.0010524163,0.0063993256,0.80757797],"genre_scores_gemma":[0.073909715,0.00045337414,0.019187082,0.0026622622,0.0009603876,0.00010708697,0.0005843544,0.0013006268,0.9008351],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.994553,0.000760365,0.0012241718,0.0013748924,0.00085427304,0.0012332419],"domain_scores_gemma":[0.9961468,0.00026508336,0.0011013944,0.0020050302,0.000049821898,0.00043189438],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004196784,0.00087926496,0.0010806135,0.0008406914,0.0002376776,0.00055443443,0.0029926149,0.0002970795,0.0003163151],"category_scores_gemma":[0.000021224341,0.0007240112,0.0002675278,0.0010885342,0.0001763246,0.0021109118,0.0007475764,0.0009863314,0.000028440507],"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.0004934488,0.00042989405,0.037113924,0.0005772867,0.0007617995,0.00025503233,0.0032957667,0.0025087898,0.0039583724,0.0074567837,0.9139774,0.029171523],"study_design_scores_gemma":[0.00088676397,0.0016952102,0.0064743813,0.00056241744,0.00007359354,0.000058366048,0.000038604812,0.007276178,0.015613068,0.0031056837,0.9627633,0.0014523999],"about_ca_topic_score_codex":0.0017496478,"about_ca_topic_score_gemma":0.000056605277,"teacher_disagreement_score":0.09325714,"about_ca_system_score_codex":0.00004773096,"about_ca_system_score_gemma":0.00072577497,"threshold_uncertainty_score":0.9995211},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028199278,0.000037594735,0.020749755,0.0027662783,0.0024672598,0.0017737189,0.00025740793,0.0017274036,0.9699386],"genre_scores_gemma":[0.0014896546,0.0005575147,0.015870325,0.0007024539,0.0009220806,0.00010993164,0.00022903409,0.0005763653,0.9795426],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9898043,0.0010270857,0.0009895377,0.0056790384,0.0012307806,0.0012692396],"domain_scores_gemma":[0.9872923,0.00043270184,0.0011379159,0.010353063,0.00019067228,0.00059333164],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0027310029,0.0012598684,0.0014041517,0.0007096845,0.00020073443,0.00051033235,0.006807039,0.0010550139,0.3762469],"category_scores_gemma":[0.00085868733,0.0013271257,0.000599718,0.00051395973,0.0002306883,0.0004143985,0.0054504634,0.002182507,0.8465537],"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.000048680762,0.0008833766,0.0015408505,0.0003191992,0.00050543697,0.000109401495,0.0008362153,0.000764313,0.00009970067,0.0017239224,0.9490535,0.044115394],"study_design_scores_gemma":[0.0011327441,0.000011077988,0.0027150088,0.000648876,0.00009020732,0.00008176869,0.000035783836,0.018232998,0.00011562294,0.0006655275,0.974801,0.0014693934],"about_ca_topic_score_codex":0.0028596683,"about_ca_topic_score_gemma":0.00020132739,"teacher_disagreement_score":0.47030675,"about_ca_system_score_codex":0.00029274676,"about_ca_system_score_gemma":0.00045701314,"threshold_uncertainty_score":0.9989178},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90458125,0.000011292696,0.09214256,0.0002612621,0.00012931909,0.00005652394,0.0000023971534,0.00008331612,0.002732071],"genre_scores_gemma":[0.9384104,0.0000020055206,0.06143017,0.000045556688,0.00004609609,0.000004761957,0.000001786073,0.000006137786,0.000053074626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928594,0.000043428347,0.000113791044,0.00020705786,0.00016940013,0.00018035993],"domain_scores_gemma":[0.999204,0.00024195258,0.00007708704,0.00032157666,0.00007795057,0.00007748141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026392384,0.00010901984,0.00014974005,0.0000981811,0.00008837244,0.00008063177,0.00031308157,0.000051790303,0.00008561316],"category_scores_gemma":[0.00009969345,0.00008299479,0.000058818256,0.0002374352,0.00008236524,0.00016080559,0.000049042686,0.00027724262,0.000004543478],"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.0000672742,0.00029087136,0.44174373,0.00012341737,0.0000476097,0.000009874845,0.00043447097,0.0061458745,0.07876945,0.0025744925,0.0005769844,0.46921596],"study_design_scores_gemma":[0.00043299026,0.00025319995,0.20183614,0.000030865278,0.0000045627426,0.000004310573,0.000004568862,0.78425354,0.01252741,0.00039023836,0.00012923623,0.00013295026],"about_ca_topic_score_codex":0.00003862644,"about_ca_topic_score_gemma":0.000008804462,"teacher_disagreement_score":0.77810764,"about_ca_system_score_codex":0.000010217616,"about_ca_system_score_gemma":0.00018837934,"threshold_uncertainty_score":0.33844292},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020952543,0.0000027785293,0.9289111,0.0013633254,0.000051633277,0.000017579585,1.3700497e-7,0.000064652624,0.04863624],"genre_scores_gemma":[0.89423937,0.0000059487074,0.02819441,0.00001902963,0.000015773758,4.5285784e-8,1.739618e-7,0.00000238895,0.07752289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961525,0.000046427213,0.000036903493,0.00013607104,0.00007408043,0.00009125408],"domain_scores_gemma":[0.99961334,0.00014152414,0.00003926987,0.00014186386,0.000029534462,0.000034456163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006602408,0.000039433275,0.00005999237,0.000030034564,0.000054476997,0.0000066758644,0.0003064349,0.00001907871,0.00022602813],"category_scores_gemma":[0.000043370444,0.00002654396,0.000028353716,0.00009728655,0.00002460062,0.00017479555,0.00013299573,0.00005643474,0.000094673436],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010457398,0.00004167672,0.0062477672,0.0000053277795,0.000026652791,0.000008241381,0.0019485736,0.0012910148,0.0016079792,0.05231115,0.00083680585,0.93566436],"study_design_scores_gemma":[0.004298321,0.0009452654,0.07754202,0.0002173031,0.00002699564,0.000041830674,0.0011846693,0.6247129,0.018152973,0.004181893,0.267518,0.0011778703],"about_ca_topic_score_codex":0.0009807558,"about_ca_topic_score_gemma":0.00005340065,"teacher_disagreement_score":0.9344865,"about_ca_system_score_codex":0.000010061974,"about_ca_system_score_gemma":0.000018651699,"threshold_uncertainty_score":0.24748495},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49616137,0.0000886993,0.47394696,0.023536641,0.00058322586,0.0022641732,0.00039219068,0.00049860036,0.0025281417],"genre_scores_gemma":[0.95425874,0.000052295673,0.036806583,0.0002745706,0.00009707332,0.00065744255,0.00085884175,0.000022647857,0.006971828],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99513364,0.0007784919,0.0009055097,0.001730657,0.0006900596,0.00076164346],"domain_scores_gemma":[0.9941018,0.0032702892,0.00031626687,0.0014564062,0.0004303434,0.0004248935],"candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013448888,0.00047553037,0.0005127309,0.00025690603,0.0015892853,0.0005463251,0.00066207227,0.00018616913,0.000083054525],"category_scores_gemma":[0.0151590295,0.00043239494,0.00009771078,0.0011745511,0.00035040276,0.0008071544,0.0003268951,0.0012453042,0.0000106000925],"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.0003644903,0.0026875932,0.5552638,0.00027957847,0.00011786062,0.00003486774,0.004386984,0.031558193,0.000070048205,0.2825343,0.076291315,0.046410926],"study_design_scores_gemma":[0.0024199423,0.00058848155,0.8315456,0.00035375054,0.000040635627,0.000048526166,0.00045977707,0.06643416,0.00010734409,0.035034996,0.061512608,0.0014541677],"about_ca_topic_score_codex":0.059641063,"about_ca_topic_score_gemma":0.18470971,"teacher_disagreement_score":0.45809737,"about_ca_system_score_codex":0.0005649949,"about_ca_system_score_gemma":0.0008361971,"threshold_uncertainty_score":0.9998128},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051243464,0.000059891838,0.9548064,0.023573926,0.0005043737,0.00015919334,0.0000018843797,0.00022009072,0.015549932],"genre_scores_gemma":[0.6840099,0.000002538335,0.29400805,0.002441344,0.000118059324,0.000022991446,0.000016703007,0.000009941515,0.019370489],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990906,0.00004921209,0.00013168766,0.0002444115,0.00025226807,0.0002317905],"domain_scores_gemma":[0.99928296,0.000058410464,0.000063775544,0.00039352814,0.00006868925,0.00013262313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057060995,0.000114563634,0.00010621689,0.000036423844,0.00013501379,0.00019912796,0.0005134579,0.0000375443,0.00052005076],"category_scores_gemma":[0.000029737253,0.000086481385,0.000023054512,0.00015339674,0.000014870279,0.00031863697,0.00010942381,0.00016879746,0.00033226775],"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":[5.925208e-7,0.000029766758,0.00055864913,0.00001649673,0.000017731847,0.000010497021,0.00032719824,0.008560657,0.00017162859,0.016808657,0.79148406,0.1820141],"study_design_scores_gemma":[0.00013649106,0.000014837704,0.0073762983,0.00001213848,0.0000019348076,0.000018949728,0.00001125907,0.8948313,0.00015656176,0.0015116555,0.09573915,0.00018942135],"about_ca_topic_score_codex":0.7714677,"about_ca_topic_score_gemma":0.20006672,"teacher_disagreement_score":0.88627064,"about_ca_system_score_codex":0.000037447768,"about_ca_system_score_gemma":0.00018370051,"threshold_uncertainty_score":0.81453},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7502962,0.00011938897,0.24910142,0.000085339394,0.000106396794,0.0001321367,0.0000019994923,0.0000573283,0.0000997963],"genre_scores_gemma":[0.9891407,0.0000019593404,0.01076132,0.000011836212,0.000023547847,0.000008363135,0.000011726925,0.000004170251,0.000036361693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902594,0.00004293205,0.00031606233,0.00034181663,0.00015776703,0.00011546031],"domain_scores_gemma":[0.9994748,0.000092927134,0.000064547276,0.00028961818,0.000037877027,0.00004022718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011985409,0.00011717461,0.0001545101,0.00019153417,0.00005415529,0.00005489757,0.00018109346,0.000032922042,0.0000013836681],"category_scores_gemma":[0.0001359771,0.00011431279,0.000015612288,0.00035168687,0.000005992953,0.00021705455,0.00012268544,0.0001408485,6.9100815e-7],"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.00018733791,0.0025030638,0.0035033708,0.00010470599,0.0000924978,0.000012696661,0.058123562,0.61530745,0.22117667,0.0021978153,0.000028034445,0.09676279],"study_design_scores_gemma":[0.0011718489,0.00024975662,0.07360492,0.0002191332,0.000004541593,1.9584827e-7,0.0007571463,0.85469985,0.069065005,0.000076462886,0.000019610532,0.00013153418],"about_ca_topic_score_codex":0.00024559023,"about_ca_topic_score_gemma":0.000022535565,"teacher_disagreement_score":0.2393924,"about_ca_system_score_codex":0.00007381112,"about_ca_system_score_gemma":0.00004199373,"threshold_uncertainty_score":0.466154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15091957,0.000027700797,0.83223164,0.0019173871,0.0012115099,0.00028399585,0.0000072835846,0.00035727138,0.013043648],"genre_scores_gemma":[0.6745632,0.0000073295646,0.3141956,0.00027945553,0.0009823177,0.000010041857,0.000014219033,0.000052438376,0.009895357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952271,0.00047409502,0.000843857,0.0013386877,0.00081731187,0.0012989759],"domain_scores_gemma":[0.997083,0.0002994507,0.00045602868,0.0015357011,0.000048047237,0.00057778036],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016669064,0.00066895847,0.00048652056,0.00038061815,0.0015575897,0.00094579154,0.0020202883,0.0003928711,0.0006139729],"category_scores_gemma":[0.00043877857,0.00064787,0.00030002234,0.0003892783,0.0002572709,0.00082402345,0.001384795,0.0035897116,0.0004414521],"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.00000523459,0.0004459075,0.07715711,0.000031197862,0.00003818472,0.00002482054,0.0021271107,0.0012939831,0.008056804,0.056469057,0.00009117677,0.85425943],"study_design_scores_gemma":[0.0006022387,0.00015912566,0.016355898,0.000036834386,0.00003070609,0.00011521947,0.00011885851,0.978773,0.00061723567,0.0009747265,0.0014066875,0.00080944865],"about_ca_topic_score_codex":0.0042391615,"about_ca_topic_score_gemma":0.00012563706,"teacher_disagreement_score":0.97747904,"about_ca_system_score_codex":0.00021894505,"about_ca_system_score_gemma":0.0002484668,"threshold_uncertainty_score":0.99974227},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06915915,0.00097641454,0.89887345,0.002695369,0.000999469,0.00027235303,0.000002030259,0.00066200254,0.026359785],"genre_scores_gemma":[0.96814877,0.00017913159,0.018735383,0.00009363329,0.00047976425,0.00001599611,0.000017623985,0.00003264114,0.012297041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972262,0.00036317817,0.00045932079,0.0011081686,0.00040561028,0.00043756247],"domain_scores_gemma":[0.99901456,0.00029807913,0.00016689315,0.0002759164,0.00012831176,0.00011627177],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000472597,0.00032295717,0.00026411816,0.00020662376,0.00093984645,0.0015553589,0.00030033023,0.00016444092,0.000268132],"category_scores_gemma":[0.00009825085,0.000308867,0.00009346258,0.00079084706,0.0001282902,0.0016299954,0.0002551385,0.0010370229,0.00029603142],"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.000006728511,0.00009056665,0.0006126338,0.0002609516,0.00009458953,0.000027066282,0.029789576,0.0007664662,0.031842668,0.15942658,0.00018629174,0.7768959],"study_design_scores_gemma":[0.00023732093,0.00046954906,0.0069654537,0.00043050764,0.00004397229,0.00003252922,0.0017764799,0.9641201,0.0038864864,0.0020714065,0.019511342,0.00045486624],"about_ca_topic_score_codex":0.000302321,"about_ca_topic_score_gemma":0.00003575708,"teacher_disagreement_score":0.96335363,"about_ca_system_score_codex":0.00011207872,"about_ca_system_score_gemma":0.000120321834,"threshold_uncertainty_score":0.99993634},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006170519,0.0012272262,0.9878039,0.0005689459,0.002073851,0.00017595675,0.0000022239383,0.00009679332,0.007989393],"genre_scores_gemma":[0.72816,0.0003190316,0.26523042,0.0009935023,0.0019930121,0.000011171028,0.0000049175683,0.00007354055,0.0032143986],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971067,0.000050009334,0.00046730528,0.0007812907,0.0009479622,0.00064674666],"domain_scores_gemma":[0.99680996,0.0008269822,0.00038117255,0.0016445845,0.00019226312,0.00014501665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018046313,0.00037688224,0.00039781127,0.00030344893,0.00038333246,0.00030119004,0.0040796436,0.00021974432,0.000015397354],"category_scores_gemma":[0.00014535873,0.00025507685,0.00015351038,0.00044270235,0.0009511422,0.00039175915,0.0012427444,0.00097537786,0.000040227114],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017435639,0.000022892857,0.000115556235,0.000014874195,0.0000078422345,0.000008841697,0.00035803005,0.0017463594,0.000020146292,0.06665928,0.000012248728,0.9310322],"study_design_scores_gemma":[0.00034872562,0.00044979353,0.001363536,0.0004977354,0.000020583988,0.00015128596,3.256147e-7,0.36613935,0.001269776,0.60102946,0.027530354,0.0011990704],"about_ca_topic_score_codex":0.00003897057,"about_ca_topic_score_gemma":0.000028812236,"teacher_disagreement_score":0.9298331,"about_ca_system_score_codex":0.00011371216,"about_ca_system_score_gemma":0.00033007722,"threshold_uncertainty_score":0.99999017},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018589733,0.00026851209,0.98909754,0.0006020375,0.0006023383,0.0002887624,0.0000028969616,0.00014862529,0.008803369],"genre_scores_gemma":[0.11464377,0.00009752771,0.8821236,0.0004737013,0.00043787836,0.000012066376,0.000007228899,0.000044086104,0.0021601608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964445,0.000088409215,0.0003515224,0.0013841076,0.0010668947,0.00066454074],"domain_scores_gemma":[0.997843,0.00039074602,0.00016436711,0.0010682199,0.0003451192,0.00018852337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024032868,0.00033996758,0.0003640421,0.0009390155,0.00045697682,0.00064237666,0.002261075,0.00017438586,0.000021588703],"category_scores_gemma":[0.0000910729,0.00030091748,0.000045272616,0.00057416386,0.0016128174,0.0004837572,0.0019040501,0.0014389628,0.0000543492],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037458963,0.00002397821,0.00006371851,0.000040917443,0.0000047158283,0.000034514585,0.0014951577,0.0008834854,0.00002064965,0.09684442,0.000015466696,0.9005692],"study_design_scores_gemma":[0.00010900116,0.00017299833,0.00030065855,0.00012357406,9.77829e-7,0.000038130052,6.508821e-8,0.37312436,0.00018621364,0.62482315,0.00085216697,0.00026868496],"about_ca_topic_score_codex":0.00013083134,"about_ca_topic_score_gemma":0.000057447698,"teacher_disagreement_score":0.90030056,"about_ca_system_score_codex":0.00012889587,"about_ca_system_score_gemma":0.00026352206,"threshold_uncertainty_score":0.99994427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039964616,0.0010039961,0.99368453,0.00075296196,0.0014594983,0.00038849283,0.000008243349,0.00035448084,0.002307856],"genre_scores_gemma":[0.05607391,0.00006884468,0.92504793,0.001912757,0.0052073197,0.000041157367,0.00005419862,0.00016349231,0.011430406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653345,0.000059764832,0.00044031919,0.0013167871,0.0006989465,0.0009507036],"domain_scores_gemma":[0.99762326,0.0006921363,0.0003293816,0.00094941835,0.00017375061,0.00023206996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012096601,0.00057163177,0.0005962308,0.00062586804,0.00038242462,0.00052750576,0.0025453991,0.00033843782,0.00007442166],"category_scores_gemma":[0.00015441657,0.00051665254,0.00019975766,0.00033302113,0.0002904116,0.00045456874,0.0009936254,0.0011077586,0.00022170949],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026082214,0.000017393693,0.00007578966,0.00003004046,0.000012685363,0.000019891366,0.00057568855,0.006478002,0.00012312402,0.00020037647,0.00010919551,0.9923552],"study_design_scores_gemma":[0.0004413792,0.00028083895,0.00012899912,0.00023302139,0.000016745682,0.00007618902,3.2767838e-7,0.96949154,0.00062302453,0.0024489902,0.025306761,0.0009521989],"about_ca_topic_score_codex":0.00005721967,"about_ca_topic_score_gemma":0.000010433129,"teacher_disagreement_score":0.991403,"about_ca_system_score_codex":0.0001652482,"about_ca_system_score_gemma":0.00026087795,"threshold_uncertainty_score":0.9997285},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18135877,0.0000082668985,0.8153969,0.0005943245,0.00083579595,0.00020078768,0.0000027701774,0.000057434227,0.0015449708],"genre_scores_gemma":[0.98349476,0.000005159933,0.012982798,0.00053380907,0.000079963946,6.246221e-7,0.000002373882,0.000011316994,0.0028892215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981333,0.0008369074,0.0001444757,0.0005816042,0.00011668559,0.00018704296],"domain_scores_gemma":[0.99779236,0.00026020524,0.00025259558,0.0015147194,0.00011348734,0.000066612854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058936194,0.00019932528,0.00021588469,0.00011164115,0.00022125838,0.00009415251,0.0022606503,0.00013537463,0.00001527888],"category_scores_gemma":[0.00017087445,0.00013045818,0.00016797768,0.00049655454,0.000062040715,0.000048611462,0.0015341222,0.00045861115,0.000014587054],"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.000004900055,0.00001157471,0.00022936262,0.000014466106,0.000028667482,0.0000019992563,0.0002928298,0.6690864,0.00013832792,0.32670957,0.0005546547,0.0029272675],"study_design_scores_gemma":[0.00012391548,0.00004176005,0.002047685,0.000051732644,0.000029522573,0.0000011797464,0.000013454912,0.87724495,0.00174365,0.1169068,0.0015950039,0.00020037375],"about_ca_topic_score_codex":0.0001709039,"about_ca_topic_score_gemma":0.000019870731,"teacher_disagreement_score":0.80241406,"about_ca_system_score_codex":0.000059348928,"about_ca_system_score_gemma":0.000084505635,"threshold_uncertainty_score":0.53199303},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018458838,0.00041271315,0.9958158,0.00030385054,0.0024968174,0.00027145236,0.000020294647,0.00017636755,0.0003180732],"genre_scores_gemma":[0.1749422,0.00003392855,0.82355005,0.00052818714,0.00074661867,0.000004215794,0.00001861097,0.000045807028,0.00013040767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578446,0.00009403492,0.00063423446,0.0014497904,0.0011331568,0.00090431113],"domain_scores_gemma":[0.996998,0.0005124508,0.0004796385,0.0013641616,0.00038793235,0.00025782507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010638288,0.00060609484,0.0005807796,0.0011785342,0.00036827754,0.0009345626,0.0025675548,0.00034939178,0.00008877662],"category_scores_gemma":[0.00018577582,0.0005695349,0.000091629256,0.0011849492,0.0004649859,0.00065682956,0.00095864147,0.0011250873,0.00007350405],"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.0000015237881,0.000041943105,0.0004349845,0.000047018053,0.000011589245,0.00004597275,0.00037677403,0.08055334,0.00009030983,0.0029915099,0.000027103299,0.9153779],"study_design_scores_gemma":[0.00016942079,0.00008163411,0.00086716283,0.00015267059,0.000015743377,0.00010118829,1.5736626e-7,0.9905059,0.00010689599,0.006469132,0.00085214496,0.0006779545],"about_ca_topic_score_codex":0.00007222329,"about_ca_topic_score_gemma":0.000007967676,"teacher_disagreement_score":0.9147,"about_ca_system_score_codex":0.00027653342,"about_ca_system_score_gemma":0.00046802906,"threshold_uncertainty_score":0.99967563},"labels":[],"label_agreement":null}]}