{"meta":{"query_hash":"570c963e0112","filters":{"venue":"Algorithms"},"cohort_total":175,"direct_labels_cover":0,"predictions_cover":175,"exported":175,"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/570c963e0112","api":"https://metacan.xera.ac/api/v1/cohort?venue=Algorithms"},"results":[{"id":"W1686172019","doi":"10.3390/a8030697","title":"Comparative Study of DE, PSO and GA for Position Domain PID Controller Tuning","year":2015,"lang":"en","type":"article","venue":"Algorithms","topic":"Iterative Learning Control Systems","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"PID controller; Particle swarm optimization; Control theory (sociology); Position (finance); Computer science; Controller (irrigation); Nonlinear system; Differential evolution; Tracking (education); Premature convergence; Genetic algorithm; Convergence (economics); Domain (mathematical analysis); Evolutionary algorithm; Mathematics; Artificial intelligence; Algorithm; Control engineering; Engineering; Control (management); Machine learning","score_opus":0.026532161292259326,"score_gpt":0.2781023755583094,"score_spread":0.2515702142660501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1686172019","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.8480824,0.0005575475,0.14941768,0.000026389022,0.00016899117,0.00086165,0.000011024749,0.0000866831,0.00078762585],"genre_scores_gemma":[0.9955843,7.4166536e-7,0.004084314,0.0000124510925,0.00012599994,0.00010095091,0.00000521428,0.000017728282,0.000068299036],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993164,0.00010388812,0.00019727039,0.00011462887,0.000109362256,0.00015843431],"domain_scores_gemma":[0.9995618,0.00013053262,0.00004969598,0.000077924706,0.00011490774,0.00006516459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003692912,0.00011107918,0.0003226868,0.000063082465,0.000042389194,0.000029329127,0.000051459185,0.000040103747,0.0000014288406],"category_scores_gemma":[0.000021576892,0.00010469969,0.00002444001,0.00006791767,0.000020210744,0.00009199888,0.0000109551775,0.00008154429,0.0000029367955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001384202,0.0011795716,0.025554217,0.000458171,0.003145868,0.00008341101,0.5008217,0.23907605,0.1961635,0.002727596,0.009996513,0.01940918],"study_design_scores_gemma":[0.011812244,0.0015184652,0.0042291577,0.00006399803,0.00006761386,0.000023963805,0.011938264,0.96701384,0.0007899527,0.0004981736,0.0017588836,0.00028547447],"about_ca_topic_score_codex":0.000034067685,"about_ca_topic_score_gemma":0.000012098443,"teacher_disagreement_score":0.72793776,"about_ca_system_score_codex":0.00005873683,"about_ca_system_score_gemma":0.000010347593,"threshold_uncertainty_score":0.42695296},"labels":[],"label_agreement":null},{"id":"W1791945965","doi":"10.3390/a11020020","title":"Vertex Cover Reconfiguration and Beyond","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"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; European Commission","keywords":"Vertex cover; Combinatorics; Parameterized complexity; Bipartite graph; Vertex (graph theory); Control reconfiguration; Feedback vertex set; Mathematics; Edge cover; Bounded function; Discrete mathematics; Graph; Computer science","score_opus":0.017390398062897928,"score_gpt":0.2864005603685251,"score_spread":0.2690101623056272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791945965","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.010936383,0.00016223277,0.96015686,0.00090727763,0.0005029769,0.00014878217,0.000002736337,0.0001237068,0.027059019],"genre_scores_gemma":[0.8052851,0.00008841698,0.18808897,0.0013871993,0.00033332896,0.0000249522,0.0000049551672,0.000021207481,0.004765865],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992551,0.000041736545,0.00008549501,0.00026065507,0.00016447068,0.00019252142],"domain_scores_gemma":[0.9994064,0.00008048084,0.00002438115,0.00031764546,0.00009570499,0.00007540352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021577155,0.00006694268,0.000070708964,0.00006898833,0.00013111277,0.00009351114,0.00029710864,0.00003424387,0.00006702528],"category_scores_gemma":[0.000042487736,0.000061128114,0.000015184986,0.00024259102,0.0001435587,0.0005623208,0.00011942776,0.0000738637,0.00033952022],"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.000008698022,0.000021372107,0.0001124485,0.0000036003523,0.000013230057,0.000014660876,0.0006646758,0.0000016490868,0.0025557477,0.15609317,0.0023945838,0.83811617],"study_design_scores_gemma":[0.0011040177,0.0008894209,0.0046370397,0.000018925888,0.000006179517,0.00017337357,0.00007913531,0.29142958,0.03557836,0.5878494,0.07770078,0.00053381064],"about_ca_topic_score_codex":0.000004555384,"about_ca_topic_score_gemma":0.000002074109,"teacher_disagreement_score":0.83758235,"about_ca_system_score_codex":0.000014119596,"about_ca_system_score_gemma":0.000022948123,"threshold_uncertainty_score":0.43639588},"labels":[],"label_agreement":null},{"id":"W1974177770","doi":"10.3390/a2020790","title":"Security of the Bennett-Brassard Quantum Key Distribution Protocol against Collective Attacks","year":2009,"lang":"en","type":"article","venue":"Algorithms","topic":"Quantum Information and Cryptography","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":"Université de Montréal","funders":"","keywords":"BB84; Quantum key distribution; Computer security; Computer science; Protocol (science); Key (lock); Scheme (mathematics); Joint (building); Quantum cryptography; Quantum; Mathematics; Physics; Engineering; Quantum mechanics; Quantum information","score_opus":0.009761001643572019,"score_gpt":0.2539894597872283,"score_spread":0.2442284581436563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974177770","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.036391903,0.000034109464,0.8762424,0.0050502038,0.00096260494,0.0570265,0.00016728553,0.00054277084,0.02358222],"genre_scores_gemma":[0.99193734,0.0000035713263,0.0024350889,0.0010828134,0.00007501768,0.004382305,0.000021886048,0.000006357194,0.00005561768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987119,0.00008953379,0.00034333923,0.00020272279,0.00040453655,0.0002479659],"domain_scores_gemma":[0.9989397,0.000037865582,0.00023612483,0.0005057368,0.00020950242,0.000071065544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002777563,0.00014156566,0.00016522217,0.00006191747,0.00022637912,0.00009342955,0.0007726765,0.000079531565,0.0000080328755],"category_scores_gemma":[0.000039791757,0.00010086411,0.00015768863,0.0010986209,0.00008006705,0.0004939372,0.000105565654,0.00018141429,0.000016020995],"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.000107119544,0.0012969116,0.0028221204,0.000115139606,0.00013449992,0.000013981426,0.010505627,0.00047998704,0.00084548484,0.74521637,0.0788437,0.15961908],"study_design_scores_gemma":[0.0029782744,0.0009652217,0.08173026,0.00013844873,0.00001897123,0.000032161595,0.0003208817,0.6816829,0.02411501,0.12228889,0.084944166,0.00078480685],"about_ca_topic_score_codex":0.000008250611,"about_ca_topic_score_gemma":0.0000023701318,"teacher_disagreement_score":0.9555454,"about_ca_system_score_codex":0.00006421938,"about_ca_system_score_gemma":0.00013010023,"threshold_uncertainty_score":0.41131192},"labels":[],"label_agreement":null},{"id":"W2003562462","doi":"10.3390/a2020623","title":"Neural Network Modeling to Predict Shelf Life of Greenhouse Lettuce","year":2009,"lang":"en","type":"article","venue":"Algorithms","topic":"Greenhouse Technology and Climate Control","field":"Agricultural and Biological Sciences","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":"Agriculture and Agri-Food Canada","funders":"Agriculture and Agri-Food Canada; University of Pittsburgh","keywords":"Shelf life; Postharvest; Lactuca; Environmental science; Greenhouse; Horticulture; Meteorology; Food science; Chemistry; Physics; Biology","score_opus":0.019292543729166983,"score_gpt":0.2192305979188266,"score_spread":0.19993805418965963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003562462","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.9924354,0.00031142973,0.00043239293,0.005851051,0.00014209749,0.0002192775,0.000017641256,0.00031616652,0.00027454636],"genre_scores_gemma":[0.9969208,0.00003265867,0.0006706574,0.0019093379,0.00039601038,0.000009207089,0.000009962055,0.0000012684992,0.000050076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887425,0.00003304744,0.0002677736,0.00026523965,0.00016678972,0.00039291845],"domain_scores_gemma":[0.99958515,0.000056853372,0.00006134221,0.00009790062,0.000059505357,0.00013922276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017494973,0.00014360003,0.00025149446,0.000013722016,0.00013568893,0.000016075373,0.00036643873,0.00014745264,0.000099041965],"category_scores_gemma":[0.000049639693,0.000060127888,0.000094017094,0.00036033257,0.000031106374,0.00008330383,0.00005759961,0.00015444325,0.000040881132],"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.00020137694,0.00033491984,0.010153013,0.0000075716825,0.00006711566,0.00004490361,0.00013563831,0.027404912,0.049540922,0.001130155,0.005104265,0.9058752],"study_design_scores_gemma":[0.0015230343,0.005237551,0.23812759,0.0001345672,0.00016273042,0.00006975071,0.00048162084,0.7351499,0.0020813143,0.0086720055,0.0069420175,0.0014179059],"about_ca_topic_score_codex":0.00010351764,"about_ca_topic_score_gemma":0.00011923734,"teacher_disagreement_score":0.9044573,"about_ca_system_score_codex":0.0000084158755,"about_ca_system_score_gemma":0.000004872428,"threshold_uncertainty_score":0.24519442},"labels":[],"label_agreement":null},{"id":"W2029278215","doi":"10.3390/a1010002","title":"Impact of Locality on Location Aware Unit Disk Graphs","year":2008,"lang":"en","type":"article","venue":"Algorithms","topic":"Complexity and Algorithms in Graphs","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":"Carleton University","funders":"","keywords":"Locality; Unit disk graph; Dominating set; Computer science; Vertex (graph theory); Vertex cover; Connected dominating set; Unit disk; Set (abstract data type); Constant (computer programming); Wireless network; Set cover problem; Cover (algebra); Approximation algorithm; Maximal independent set; Theoretical computer science; Wireless; Graph; Algorithm; Combinatorics; Mathematics; Chordal graph; 1-planar graph; Telecommunications","score_opus":0.05234068564554768,"score_gpt":0.30624244218194935,"score_spread":0.2539017565364017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029278215","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.21614572,0.00014140357,0.78145015,0.00018350116,0.00046350498,0.00023451255,0.00003454091,0.00024555915,0.0011010789],"genre_scores_gemma":[0.9872472,0.000058033424,0.012434332,0.000079133206,0.000060926726,0.000009830795,0.000014795737,0.000010794314,0.0000849274],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983836,0.00009738073,0.00032070966,0.00041764963,0.00045780497,0.00032286847],"domain_scores_gemma":[0.9984139,0.00014058585,0.00014200331,0.0009125085,0.00024919465,0.00014176499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002178843,0.0002078997,0.0002682698,0.00022110429,0.00023164743,0.00003233712,0.0008970494,0.000081404505,0.000032643333],"category_scores_gemma":[0.00003787305,0.0001779145,0.00023347231,0.0013907305,0.00024389109,0.00035294308,0.00016810163,0.00020795898,0.00004918929],"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.00010564723,0.00340413,0.10694987,0.00013188187,0.00056501775,0.0003447134,0.004149564,0.013512106,0.00020057466,0.17622758,0.005305628,0.6891033],"study_design_scores_gemma":[0.0011361295,0.0014245766,0.6143746,0.00009528903,0.000017413044,0.00019740826,0.00004750951,0.3330635,0.0014769637,0.046860382,0.00061687577,0.0006893724],"about_ca_topic_score_codex":0.00061248685,"about_ca_topic_score_gemma":0.0000098585715,"teacher_disagreement_score":0.77110153,"about_ca_system_score_codex":0.000050305607,"about_ca_system_score_gemma":0.00015340815,"threshold_uncertainty_score":0.72551423},"labels":[],"label_agreement":null},{"id":"W2030428246","doi":"10.3390/a6040762","title":"Very High Resolution Satellite Image Classification Using Fuzzy Rule-Based Systems","year":2013,"lang":"en","type":"article","venue":"Algorithms","topic":"Remote-Sensing Image Classification","field":"Engineering","cited_by":68,"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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fuzzy logic; Artificial intelligence; Image (mathematics); Pattern recognition (psychology); Fuzzy classification; Contextual image classification; Fuzzy rule; Classification rule; Data mining; Computer science; Satellite; Object (grammar); Rule-based system; Mathematics; Fuzzy set; Computer vision","score_opus":0.026471729881210364,"score_gpt":0.23228585718033554,"score_spread":0.20581412729912518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030428246","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.35973528,0.0012270933,0.6283499,0.0003456988,0.003008924,0.0011434146,0.000024346127,0.0016975345,0.004467816],"genre_scores_gemma":[0.9240379,0.000072028,0.075024106,0.000028217513,0.00040176685,0.000030302079,0.00014568774,0.00010069358,0.00015933873],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984391,0.000088705194,0.00043862537,0.00033382952,0.0003062132,0.00039358053],"domain_scores_gemma":[0.99886405,0.000080839854,0.00011146798,0.00059391157,0.0002353232,0.000114412345],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022713287,0.00024746938,0.00023254835,0.00020440815,0.00012220707,0.00028601586,0.00016052638,0.00018596384,0.000018234072],"category_scores_gemma":[0.00004741639,0.00026548858,0.00006754272,0.0003605879,0.00008475068,0.0005870273,0.00001597175,0.00021178625,0.0007829224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064999767,0.00004262003,0.00012690568,0.00018016636,0.000044855253,0.0000113642,0.00007815783,0.03667278,0.90680176,0.0001763875,0.0012622498,0.054596275],"study_design_scores_gemma":[0.00028736304,0.000013418569,0.016613044,0.00008320176,0.000028851415,0.000017447226,0.000070785216,0.97051513,0.010688638,0.00013935924,0.0012453817,0.00029739336],"about_ca_topic_score_codex":0.00038534348,"about_ca_topic_score_gemma":0.0000017063844,"teacher_disagreement_score":0.93384236,"about_ca_system_score_codex":0.0004615176,"about_ca_system_score_gemma":0.000039227987,"threshold_uncertainty_score":0.9999951},"labels":[],"label_agreement":null},{"id":"W2039826584","doi":"10.3390/a6010043","title":"Computational Study on a PTAS for Planar Dominating Set Problem","year":2013,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","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":"Simon Fraser University","funders":"","keywords":"Dominating set; Mathematics; Polynomial-time approximation scheme; Approximation algorithm; Planar; Planar graph; Combinatorics; Planar straight-line graph; Bounded function; Computational complexity theory; Graph; Independent set; Discrete mathematics; Algorithm; Pathwidth; Computer science; Line graph; Mathematical analysis","score_opus":0.03896625998283992,"score_gpt":0.3349611390252531,"score_spread":0.2959948790424132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039826584","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.025760436,0.000014765669,0.97074896,0.0007057019,0.00009903715,0.0018532166,0.000014065841,0.00014153043,0.000662304],"genre_scores_gemma":[0.43300563,3.6351975e-7,0.5656673,0.00021177897,0.00007611669,0.0006773857,0.000012689705,0.00001756032,0.0003312173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998534,0.000095103045,0.00019705933,0.0004206867,0.00040425494,0.00034886255],"domain_scores_gemma":[0.9986569,0.00065692025,0.00006569775,0.00032992603,0.00019604024,0.00009447357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048876,0.00012799939,0.0001458703,0.00014315474,0.000220295,0.0001592194,0.0006971774,0.000029740124,0.000013493295],"category_scores_gemma":[0.00005899082,0.00011142676,0.000048000056,0.00032115713,0.000040665214,0.0004102927,0.00012243899,0.00013798886,0.00016890072],"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.000057085384,0.0015036738,0.002047442,0.00006174582,0.00022875637,0.00007868868,0.010272753,0.01784282,0.0003071375,0.28125533,0.008014471,0.67833006],"study_design_scores_gemma":[0.0016010428,0.0012890968,0.003506078,0.000019256699,0.000003900957,0.000016828562,0.0006433557,0.5759477,0.00014387758,0.41611665,0.00044977645,0.00026242223],"about_ca_topic_score_codex":0.000020222527,"about_ca_topic_score_gemma":0.0000014331603,"teacher_disagreement_score":0.6780677,"about_ca_system_score_codex":0.00003814218,"about_ca_system_score_gemma":0.000037819867,"threshold_uncertainty_score":0.45438513},"labels":[],"label_agreement":null},{"id":"W2077513533","doi":"10.3390/a1020043","title":"A PTAS For The k-Consensus Structures Problem Under Squared Euclidean Distance","year":2008,"lang":"en","type":"article","venue":"Algorithms","topic":"Algorithms and Data Compression","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":"Combinatorics; Mathematics; Euclidean distance; Fragment (logic); Sequence (biology); Euclidean space; Simple (philosophy); Euclidean geometry; Polynomial; Translation (biology); Square (algebra); Set (abstract data type); Space (punctuation); Discrete mathematics; Algorithm; Computer science; Geometry; Mathematical analysis","score_opus":0.03394619564574629,"score_gpt":0.2649064998975932,"score_spread":0.23096030425184688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077513533","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.000959401,0.0010810277,0.9939951,0.0021679713,0.00066533627,0.0005517362,0.00006629193,0.00020216845,0.00031098528],"genre_scores_gemma":[0.23055032,0.00012909592,0.76607585,0.0010756114,0.0006039176,0.00017781861,0.000038384693,0.000042667394,0.0013063194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835974,0.000049570644,0.00028240727,0.0005222794,0.0003596239,0.00042640237],"domain_scores_gemma":[0.99824065,0.00042797416,0.0001284625,0.0009670269,0.00012890907,0.00010696166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021188134,0.00021617935,0.00020708727,0.00004713958,0.00078824564,0.00014425072,0.0012045458,0.00007289339,0.0000135785685],"category_scores_gemma":[0.000033193435,0.00013659256,0.000118514305,0.00028291545,0.00015597988,0.0002456612,0.0003069397,0.00016470093,0.000018476332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084704974,0.0002251242,0.00028549798,0.00006426311,0.00024247704,0.00020310291,0.002927962,0.005556668,0.00038958056,0.28875563,0.118826374,0.58243865],"study_design_scores_gemma":[0.0016636802,0.000220017,0.0067050694,0.00004051197,0.0000316814,0.0005221618,0.00016389706,0.707464,0.0008247109,0.09620748,0.18546286,0.0006939651],"about_ca_topic_score_codex":0.000118316726,"about_ca_topic_score_gemma":0.0000132898585,"teacher_disagreement_score":0.7019073,"about_ca_system_score_codex":0.000036290734,"about_ca_system_score_gemma":0.00009952589,"threshold_uncertainty_score":0.6062628},"labels":[],"label_agreement":null},{"id":"W2080574925","doi":"10.3390/a7030295","title":"Solving the Examination Timetabling Problem in GPUs","year":2014,"lang":"en","type":"article","venue":"Algorithms","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"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":"Computer science; Component (thermodynamics); Selection (genetic algorithm); Tournament selection; Greedy algorithm; Population; Genetic algorithm; Evolutionary algorithm; Mathematical optimization; Process (computing); Matrix (chemical analysis); Class (philosophy); Algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.07567459497612149,"score_gpt":0.3472196176140333,"score_spread":0.2715450226379118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080574925","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.30631742,0.0012259467,0.616005,0.0072757383,0.0024209574,0.0007545295,0.000007616924,0.00032395747,0.06566882],"genre_scores_gemma":[0.9524275,0.000007611663,0.044423196,0.00018535549,0.00023886962,0.00002379933,0.0000025802472,0.000011592061,0.0026795133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974496,0.00046090197,0.0004969537,0.00039096118,0.00085356075,0.00034801854],"domain_scores_gemma":[0.9966566,0.002372963,0.00015700208,0.00054254016,0.00020913008,0.00006177108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011749337,0.00011321987,0.00019973991,0.00032909494,0.0003246334,0.0003436709,0.00064643426,0.00006876666,0.000121201316],"category_scores_gemma":[0.0042346204,0.0000698477,0.00007785315,0.0014674653,0.00007949491,0.00030084816,0.000099539306,0.0002388616,0.00067488843],"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.0000026822559,0.00007277647,0.0030446122,0.0000018808183,0.0000116087895,0.0000030272033,0.0012202421,0.005909008,0.0003537591,0.00694014,0.0007525209,0.9816877],"study_design_scores_gemma":[0.00060938497,0.00005526282,0.07359337,0.000037106875,0.00002291152,0.000033906646,0.0007832567,0.813231,0.00055962784,0.077094026,0.03370072,0.00027943487],"about_ca_topic_score_codex":0.00014949992,"about_ca_topic_score_gemma":0.00005560352,"teacher_disagreement_score":0.9814083,"about_ca_system_score_codex":0.000031762127,"about_ca_system_score_gemma":0.000043202537,"threshold_uncertainty_score":0.86745507},"labels":[],"label_agreement":null},{"id":"W2145137929","doi":"10.3390/a2010183","title":"The Autonomous Stress Indicator for Remotely Monitoring Power System State and Watching for Potential Instability","year":2009,"lang":"en","type":"article","venue":"Algorithms","topic":"Power System Optimization and Stability","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Operator (biology); Electric power system; Task (project management); State (computer science); Reliability engineering; Principal (computer security); Power (physics); Simulation; Real-time computing; Computer security; Engineering","score_opus":0.007432960844734895,"score_gpt":0.22513456817449062,"score_spread":0.21770160732975574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145137929","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.12913147,0.00073145225,0.86580133,0.00015946243,0.0018494524,0.001279483,0.0001606453,0.00039524634,0.0004914549],"genre_scores_gemma":[0.98722166,0.000025275469,0.012533556,0.000005946219,0.0000774906,0.000054060813,0.000007833796,0.000023967994,0.00005019162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988969,0.00003951228,0.00035477086,0.0002470597,0.0001307062,0.00033104257],"domain_scores_gemma":[0.9993133,0.00017205912,0.00005925043,0.00027734583,0.00007170824,0.00010634713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000513981,0.00016690933,0.00021149496,0.000034623703,0.00032288878,0.00014849583,0.00014927512,0.00007540853,0.0000011225299],"category_scores_gemma":[0.000048492948,0.00013271216,0.00007544765,0.000062976476,0.000029538387,0.0001481518,0.000019186607,0.00009890674,0.000001277806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004981342,0.000336557,0.005137255,0.002772264,0.0006398155,0.000015337586,0.014016834,0.14906412,0.0026044224,0.0044258055,0.0006337944,0.81985563],"study_design_scores_gemma":[0.0011671075,0.00017099339,0.012414476,0.000076670425,0.000032694043,0.000012999776,0.0010760956,0.9756189,0.0023232384,0.00042238453,0.00628688,0.0003975592],"about_ca_topic_score_codex":0.000007709724,"about_ca_topic_score_gemma":0.0000025039278,"teacher_disagreement_score":0.8580902,"about_ca_system_score_codex":0.0001398256,"about_ca_system_score_gemma":0.000022437225,"threshold_uncertainty_score":0.5411845},"labels":[],"label_agreement":null},{"id":"W2191117394","doi":"10.3390/a8041175","title":"A Data Analytic Algorithm for Managing, Querying, and Processing Uncertain Big Data in Cloud Environments","year":2015,"lang":"en","type":"article","venue":"Algorithms","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":68,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Big data; Computer science; Cloud computing; Database transaction; Transaction data; Uncertain data; Data mining; Data science; Analytics; Database","score_opus":0.15240265186952173,"score_gpt":0.3367926949173147,"score_spread":0.184390043047793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2191117394","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.00014550047,0.0011440802,0.9960335,0.0009811725,0.00031708763,0.00040079336,0.00075434375,0.00008357051,0.00013994443],"genre_scores_gemma":[0.0027148544,0.00016349109,0.99385035,0.00033392722,0.0005246511,0.00009708247,0.0018081083,0.000035281562,0.00047222842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973418,0.00004788833,0.00038749044,0.001373825,0.00037199352,0.00047697057],"domain_scores_gemma":[0.99646896,0.00009646802,0.0001576177,0.0030079603,0.00003272749,0.00023624166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014306607,0.00023490694,0.00028332436,0.00017469122,0.00015671295,0.00040972498,0.003730504,0.00007542466,9.649351e-7],"category_scores_gemma":[0.00009692773,0.0002304224,0.000017133789,0.0005402162,0.000105209365,0.0014835544,0.0031661468,0.00016812832,0.00001555033],"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.0000013100173,0.000085576976,0.00013332642,0.000013744197,0.000016348391,0.000017856255,0.00026066325,0.000018481065,0.000004206371,0.00020101875,0.003051891,0.99619555],"study_design_scores_gemma":[0.00074850844,0.000047555677,0.00019379114,0.000044142016,0.000023148752,0.000037371112,0.00020291307,0.8984322,0.0000093513945,0.002479207,0.09751047,0.00027132305],"about_ca_topic_score_codex":0.00047821488,"about_ca_topic_score_gemma":0.00008578177,"teacher_disagreement_score":0.99592423,"about_ca_system_score_codex":0.00007366919,"about_ca_system_score_gemma":0.0001797041,"threshold_uncertainty_score":0.93963534},"labels":[],"label_agreement":null},{"id":"W2411453843","doi":"10.3390/a9020039","title":"Review of Recent Type-2 Fuzzy Controller Applications","year":2016,"lang":"en","type":"article","venue":"Algorithms","topic":"Fuzzy Logic and Control Systems","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":"University of Guelph","funders":"","keywords":"Computer science; Robotics; Fuzzy logic; Control engineering; Controller (irrigation); Automotive industry; Control system; Fuzzy control system; Artificial intelligence; Intelligent control; Robot; Engineering; Electrical engineering","score_opus":0.0238075384630063,"score_gpt":0.26613068471800594,"score_spread":0.24232314625499965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411453843","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":[0.000008461671,0.09681688,0.7867871,0.013842059,0.0006205831,0.0011867085,0.0000115576895,0.00019085834,0.10053582],"genre_scores_gemma":[0.23696332,0.5659845,0.1482507,0.03040461,0.0024124163,0.0025037671,0.000017440729,0.000096328964,0.013366914],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909306,0.00005841354,0.00028283257,0.00022656702,0.00017789566,0.00016123566],"domain_scores_gemma":[0.99896806,0.00010477329,0.00012977928,0.0004807597,0.00025226566,0.000064362626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031608678,0.00008484099,0.00024725022,0.000028334733,0.000034422774,0.000010814203,0.0005500041,0.000035988072,0.00002927174],"category_scores_gemma":[0.000052804833,0.000048831283,0.000062269144,0.00029387497,0.000033744684,0.00010974807,0.000075668504,0.00003276,0.00029503214],"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.0000024867652,0.00003689808,0.000023768358,0.0001463532,0.00002541285,0.0000012489498,0.000010881031,1.9321021e-7,0.0006200902,0.080584735,0.008123386,0.91042453],"study_design_scores_gemma":[0.0010573334,0.000121615434,0.00017707096,0.0011079217,0.000020335257,0.000023829967,0.0000043775094,0.00021929784,0.00021136214,0.030539297,0.96630645,0.0002110922],"about_ca_topic_score_codex":0.000009058071,"about_ca_topic_score_gemma":4.394767e-7,"teacher_disagreement_score":0.9581831,"about_ca_system_score_codex":0.000024290674,"about_ca_system_score_gemma":0.000052335065,"threshold_uncertainty_score":0.379214},"labels":[],"label_agreement":null},{"id":"W2412591217","doi":"10.3390/a9020038","title":"A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights","year":2016,"lang":"en","type":"article","venue":"Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Approximation algorithm; Job shop scheduling; Graph; Algorithm; Computer science; Mathematics; Combinatorics; Discrete mathematics; Theoretical computer science","score_opus":0.007907320130312992,"score_gpt":0.21292157516769591,"score_spread":0.2050142550373829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412591217","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.0006226067,0.0003786174,0.9962987,0.00044211393,0.00045293776,0.00064490834,0.000036980076,0.00060635543,0.0005167878],"genre_scores_gemma":[0.010000046,0.00014528325,0.9881067,0.00008928195,0.000541486,0.0004959741,0.000022380951,0.000096280695,0.00050252554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987849,0.00001979569,0.000262461,0.0002738823,0.0002562578,0.0004027279],"domain_scores_gemma":[0.99907005,0.00030201275,0.000060299768,0.000321863,0.00015283003,0.00009297214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027915844,0.00024372191,0.00019760309,0.00010548847,0.00022011684,0.00008060996,0.00022992783,0.000074092364,0.000035193963],"category_scores_gemma":[0.000015671858,0.00012364167,0.00008350762,0.00033856303,0.00006959225,0.000254323,0.00001802591,0.00010598463,0.000035015284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001007951,0.000027706765,0.00005564934,0.000028974253,0.0001794787,0.00000418608,0.0003802119,0.018019672,0.0002070798,0.0008934685,0.0005122789,0.9796812],"study_design_scores_gemma":[0.0018745724,0.000078440775,0.000070564325,0.000098493525,0.00006130369,0.000043166063,0.00011796332,0.9891372,0.0036586958,0.0016624767,0.0028589605,0.00033818375],"about_ca_topic_score_codex":0.000012617691,"about_ca_topic_score_gemma":0.000007998119,"teacher_disagreement_score":0.97934306,"about_ca_system_score_codex":0.00006269067,"about_ca_system_score_gemma":0.000027929054,"threshold_uncertainty_score":0.5041961},"labels":[],"label_agreement":null},{"id":"W2549472344","doi":"10.3390/a9040081","title":"Cross-Coupled Contouring Control of Multi-DOF Robotic Manipulator","year":2016,"lang":"en","type":"article","venue":"Algorithms","topic":"Iterative Learning Control Systems","field":"Engineering","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Contouring; Control theory (sociology); Computer science; Jacobian matrix and determinant; Tracking (education); Serial manipulator; Trajectory; Tracking error; Lyapunov function; Artificial intelligence; Nonlinear system; Computer vision; Mathematics; Robot; Parallel manipulator; Control (management)","score_opus":0.013662584827397026,"score_gpt":0.24685385451931588,"score_spread":0.23319126969191886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549472344","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.17471959,0.0010168651,0.82187444,0.000052317355,0.0011252089,0.00043693377,0.000017954388,0.00041436698,0.00034235805],"genre_scores_gemma":[0.9967332,0.0000064916303,0.0015636821,0.000017215534,0.00027939447,0.000036105972,0.000001569546,0.000062739186,0.001299642],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875164,0.000044542794,0.0004295722,0.00021066802,0.00020000638,0.0003635495],"domain_scores_gemma":[0.9991898,0.00020536162,0.00008916753,0.00030122028,0.00012804366,0.000086436856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024134862,0.0002196195,0.00045418914,0.00008979354,0.000046262216,0.000040335777,0.0001908031,0.00010299386,0.00010976182],"category_scores_gemma":[0.000107196654,0.0001572737,0.00011941385,0.000088412824,0.000066302055,0.00020424376,0.00001878356,0.000112579786,0.00014938632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006653907,0.0001012938,0.065587714,0.00029409895,0.0008793276,0.00011434828,0.0007808845,0.18612294,0.7170851,0.00067465135,0.00011520825,0.02817787],"study_design_scores_gemma":[0.005767788,0.0000655907,0.03147002,0.00018663133,0.00003306046,0.000019237605,0.000016295258,0.9542077,0.0072097443,0.00001844682,0.00067670597,0.00032877398],"about_ca_topic_score_codex":0.000048578226,"about_ca_topic_score_gemma":0.000007946109,"teacher_disagreement_score":0.82201356,"about_ca_system_score_codex":0.000092870454,"about_ca_system_score_gemma":0.00001193136,"threshold_uncertainty_score":0.64134353},"labels":[],"label_agreement":null},{"id":"W2599023482","doi":"10.3390/a10020040","title":"Fuzzy Random Walkers with Second Order Bounds: An Asymmetric Analysis","year":2017,"lang":"en","type":"article","venue":"Algorithms","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Waterloo","funders":"","keywords":"Computer science; Theoretical computer science; Random graph; Fuzzy logic; Null graph; Graph; Mathematics; Algorithm; Voltage graph; Artificial intelligence; Line graph","score_opus":0.011544065930279871,"score_gpt":0.27818790118790826,"score_spread":0.2666438352576284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599023482","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.36956516,0.00024151723,0.37884018,0.00032193205,0.00020607591,0.00072430127,0.00011410759,0.000365831,0.24962088],"genre_scores_gemma":[0.9796739,0.0000039307834,0.017585844,0.000039474147,0.00041275166,0.000044126202,0.0001394618,0.00003017736,0.002070338],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99853677,0.00006367673,0.0002624297,0.00048461577,0.00027582745,0.00037671052],"domain_scores_gemma":[0.9979195,0.000062401916,0.00031164847,0.0013582658,0.0001874899,0.00016069696],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003120778,0.00025369966,0.00055501284,0.00037718413,0.00066713645,0.00054254907,0.0006374897,0.000045795234,0.0011460686],"category_scores_gemma":[0.0000069418334,0.00020614048,0.0002663448,0.0010360234,0.00015093504,0.00042717482,0.00011118645,0.00019218694,0.000034838795],"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.00014760977,0.00062384957,0.42299277,0.000010793191,0.011806214,0.0000392676,0.00042770294,0.0008271297,0.00006415643,0.006706146,0.004437737,0.55191666],"study_design_scores_gemma":[0.021723395,0.0015946425,0.40925884,0.000102211,0.02176202,0.00001893946,0.0020951808,0.3234568,0.005451999,0.083407104,0.124748245,0.006380617],"about_ca_topic_score_codex":0.0019234226,"about_ca_topic_score_gemma":0.00055614836,"teacher_disagreement_score":0.61010873,"about_ca_system_score_codex":0.000026741402,"about_ca_system_score_gemma":0.000050065766,"threshold_uncertainty_score":0.999767},"labels":[],"label_agreement":null},{"id":"W2610431249","doi":"10.3390/a10020047","title":"Trust in the Balance: Data Protection Laws as Tools for Privacy and Security in the Cloud","year":2017,"lang":"en","type":"article","venue":"Algorithms","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","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 British Columbia","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Cloud computing; Internet privacy; Jurisdiction; Computer security; Information privacy; Balance (ability); Data Protection Act 1998; Computer science; Data breach; Order (exchange); Privacy law; Cloud computing security; Law; Business; Privacy policy; Political science","score_opus":0.10080489616230008,"score_gpt":0.3699310243454843,"score_spread":0.2691261281831842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610431249","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.8781582,0.0009976039,0.00432219,0.08585852,0.002452001,0.011643984,0.00059839594,0.00012863764,0.01584044],"genre_scores_gemma":[0.99735445,0.00040900527,0.000418535,0.00033002574,0.0010710987,0.00032051737,0.00005412446,0.0000067611854,0.00003547418],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852705,0.00037409368,0.00017061678,0.00033554665,0.0003107063,0.00028200535],"domain_scores_gemma":[0.99829006,0.00023901276,0.00012703858,0.0012786773,0.000033477918,0.000031738775],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004438017,0.00009861172,0.00012639917,0.00003484947,0.0013767866,0.00090561766,0.0022963027,0.000119559714,0.000009654516],"category_scores_gemma":[0.0042118398,0.00006555308,0.000023891647,0.00013716432,0.0002607486,0.0015326112,0.00042009016,0.00030739678,0.000007951152],"study_design_candidate":"not_applicable","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.00030682964,0.00081379706,0.01172298,0.00018252549,0.000043145905,0.00005241877,0.22464819,0.0000012050435,0.00011695186,0.07047435,0.014321303,0.6773163],"study_design_scores_gemma":[0.0017023392,0.00019039876,0.055100847,0.000059704103,0.000024540632,0.000021889713,0.020513708,0.0049474565,0.00006089278,0.24765125,0.66939455,0.00033241566],"about_ca_topic_score_codex":0.018177893,"about_ca_topic_score_gemma":0.009053037,"teacher_disagreement_score":0.6769839,"about_ca_system_score_codex":0.00004240414,"about_ca_system_score_gemma":0.00008593735,"threshold_uncertainty_score":0.9999233},"labels":[],"label_agreement":null},{"id":"W2622310785","doi":"10.3390/a10020068","title":"An Easily Understandable Grey Wolf Optimizer and Its Application to Fuzzy Controller Tuning","year":2017,"lang":"en","type":"article","venue":"Algorithms","topic":"Fuzzy Logic and Control Systems","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 Ottawa","funders":"","keywords":"Control theory (sociology); Parametric statistics; Sensitivity (control systems); Fuzzy logic; Convergence (economics); Nonlinear system; Controller (irrigation); Computer science; Discrete time and continuous time; Fuzzy control system; Mathematics; Mathematical optimization; Control (management); Engineering; Artificial intelligence","score_opus":0.02292381124100923,"score_gpt":0.26760691015653437,"score_spread":0.24468309891552514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622310785","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.005019686,0.0004949099,0.9697197,0.0025317937,0.00037768183,0.0007131412,0.0000052434966,0.0001837167,0.020954093],"genre_scores_gemma":[0.9780358,0.000015116097,0.020410212,0.0005336326,0.0002019832,0.000094485025,0.0000013992022,0.000011407739,0.0006959557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986789,0.00005237627,0.00019242657,0.0005075189,0.0002473691,0.00032136618],"domain_scores_gemma":[0.9986428,0.000043192485,0.00013588795,0.00079823425,0.00012954966,0.0002503139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043753884,0.00015630022,0.00025940474,0.000057368063,0.00061726826,0.0006767414,0.0010068351,0.00008185088,0.0000015927875],"category_scores_gemma":[0.000046032863,0.00013416466,0.000038004084,0.0000762023,0.00003445952,0.0008837248,0.00018206735,0.00009146492,0.00007332814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015618505,0.00023842315,0.002223981,0.000046006582,0.00017464101,0.000085623054,0.0030846386,0.0036529133,0.015960295,0.41320926,0.0018655997,0.55930245],"study_design_scores_gemma":[0.0032155374,0.00035327236,0.0055948,0.00003918977,0.00002186478,0.00004545751,0.00020280523,0.95948565,0.00023798078,0.026701363,0.003535045,0.0005670174],"about_ca_topic_score_codex":0.00018947091,"about_ca_topic_score_gemma":0.000013761683,"teacher_disagreement_score":0.97301614,"about_ca_system_score_codex":0.00004263757,"about_ca_system_score_gemma":0.000036762027,"threshold_uncertainty_score":0.6525833},"labels":[],"label_agreement":null},{"id":"W2737053732","doi":"10.3390/a10030087","title":"Evolutionary Optimization for Robust Epipolar-Geometry Estimation and Outlier Detection","year":2017,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Vision and Imaging","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":"York University; Université de Sherbrooke; University of Calgary","funders":"","keywords":"RANSAC; Epipolar geometry; Outlier; Artificial intelligence; Robustness (evolution); Mathematics; Computer science; Anomaly detection; Pattern recognition (psychology); Computer vision; Image (mathematics)","score_opus":0.021583257710157323,"score_gpt":0.2861554588779791,"score_spread":0.26457220116782176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737053732","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.00022970697,0.00015993409,0.9980093,0.0005697088,0.0006246498,0.00016786484,0.0000029205833,0.00009287287,0.00014300132],"genre_scores_gemma":[0.07160922,0.000031174564,0.92797846,0.00008164005,0.00007902686,0.0000193213,0.0000056432864,0.000008108766,0.00018738286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993409,0.000012364432,0.00011966187,0.000264027,0.00011728397,0.00014579966],"domain_scores_gemma":[0.99931246,0.000044432592,0.00012154421,0.00036885397,0.00009712844,0.000055563607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015327298,0.00008268623,0.00008414267,0.00009059901,0.000743204,0.00026764136,0.00025843168,0.000041173404,0.0000048500233],"category_scores_gemma":[0.00020982733,0.00008215259,0.000027238331,0.00007297217,0.00004459383,0.0016969204,0.00013247706,0.00005900867,0.0000062196355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029555447,0.000013557171,0.00009637844,0.0000072022613,0.000004386156,8.966568e-7,0.000042386466,0.029984614,0.00008025165,0.00044153247,0.00010880101,0.96921706],"study_design_scores_gemma":[0.0003292699,0.000039562972,0.0031909416,0.000012226369,0.000004397696,0.000018720299,0.000008902792,0.9930812,0.0003937124,0.0020290138,0.00078584923,0.00010617136],"about_ca_topic_score_codex":0.000010383304,"about_ca_topic_score_gemma":9.4901276e-7,"teacher_disagreement_score":0.96911085,"about_ca_system_score_codex":0.0000341523,"about_ca_system_score_gemma":0.000014714925,"threshold_uncertainty_score":0.5716199},"labels":[],"label_agreement":null},{"id":"W2754517646","doi":"10.3390/a11040052","title":"Introduction to Reconfiguration","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":181,"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":"Control reconfiguration; Sequence (biology); Computer science; Graph; Space (punctuation); Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics","score_opus":0.01935662206999441,"score_gpt":0.30259472380446173,"score_spread":0.28323810173446734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754517646","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.002609905,0.000009841509,0.9846249,0.008601993,0.0008957475,0.00012891799,5.5692993e-7,0.00014632689,0.0029818069],"genre_scores_gemma":[0.17583759,0.0000092066675,0.80668306,0.001264083,0.008331616,0.00006944848,0.0000057635034,0.000022745617,0.0077764625],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914867,0.000045974397,0.00009649818,0.0003235694,0.00018077735,0.0002045087],"domain_scores_gemma":[0.99919367,0.000025921574,0.000021035097,0.0004902114,0.00018202538,0.00008711185],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031258355,0.000059380225,0.000059326187,0.00012789946,0.000121772806,0.00007701658,0.0004256755,0.00002465179,0.00011115098],"category_scores_gemma":[0.00009455487,0.000056506822,0.000017966164,0.0006223512,0.000047417212,0.0004756301,0.00009770647,0.000066621215,0.0018125302],"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.000009031311,0.000019876861,0.000012527887,0.0000014347588,0.0000062902864,0.0000037340149,0.00052523887,0.000019684472,0.010234439,0.100768,0.015599762,0.8728],"study_design_scores_gemma":[0.00035983912,0.0011163432,0.001386946,0.000009899152,0.0000028068082,0.00009859808,0.00006928554,0.054365993,0.20579056,0.1528844,0.58347625,0.00043910684],"about_ca_topic_score_codex":0.0000054129155,"about_ca_topic_score_gemma":0.000004285872,"teacher_disagreement_score":0.8723609,"about_ca_system_score_codex":0.000032053915,"about_ca_system_score_gemma":0.000019701969,"threshold_uncertainty_score":0.99896467},"labels":[],"label_agreement":null},{"id":"W2765104507","doi":"10.3390/a10040120","title":"A Comparative Study on Recently-Introduced Nature-Based Global Optimization Methods in Complex Mechanical System Design","year":2017,"lang":"en","type":"article","venue":"Algorithms","topic":"Metaheuristic Optimization Algorithms Research","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 Victoria","funders":"","keywords":"Mathematical optimization; Firefly algorithm; Robustness (evolution); Metaheuristic; Computer science; Multi-objective optimization; Global optimization; Optimization problem; Benchmark (surveying); Cuckoo search; Engineering optimization; Derivative-free optimization; Imperialist competitive algorithm; Mathematics; Meta-optimization; Particle swarm optimization","score_opus":0.14554111394063857,"score_gpt":0.4533124861904382,"score_spread":0.3077713722497996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765104507","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.00016441169,0.00002723659,0.9946009,0.000901401,0.0008890267,0.001877932,0.000012443915,0.00023351771,0.0012931464],"genre_scores_gemma":[0.17504096,0.000002241939,0.8245354,0.00010918649,0.00010134825,0.00014316618,0.000013931901,0.000017876962,0.000035870213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934534,0.0028972824,0.0006877619,0.0012175037,0.0011288136,0.00061527296],"domain_scores_gemma":[0.9958332,0.0006548004,0.00042392442,0.0022981083,0.00052474195,0.0002651967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0038832778,0.00037878106,0.00077618955,0.0002799481,0.0006159879,0.00095326925,0.0028647052,0.00022314377,0.000041697982],"category_scores_gemma":[0.0010423916,0.000347959,0.00009406863,0.00084618217,0.00010345811,0.00046747894,0.0005326932,0.0006193593,0.000068705674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033085904,0.0028096982,0.00034317252,0.000047545953,0.00022611572,0.00043731823,0.0006163204,0.9313543,0.00024529907,0.021039607,0.0011130393,0.041436713],"study_design_scores_gemma":[0.0024616132,0.00057913014,0.0035787022,0.00003727442,0.000016272652,0.000013183456,0.00017608987,0.9915504,0.0010198605,0.0001749041,0.00006265778,0.00032991526],"about_ca_topic_score_codex":0.000094408475,"about_ca_topic_score_gemma":0.0000103273605,"teacher_disagreement_score":0.17487654,"about_ca_system_score_codex":0.00058518903,"about_ca_system_score_gemma":0.00028420548,"threshold_uncertainty_score":0.99989724},"labels":[],"label_agreement":null},{"id":"W2765572224","doi":"10.3390/a10040123","title":"A Selection Process for Genetic Algorithm Using Clustering Analysis","year":2017,"lang":"en","type":"article","venue":"Algorithms","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":38,"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é du Québec à Rimouski; Université du Québec à Chicoutimi","funders":"","keywords":"Cluster analysis; Selection (genetic algorithm); Benchmark (surveying); Fitness function; Population; Genetic algorithm; Computer science; Fitness proportionate selection; Mathematical optimization; Mathematics; Data mining; Artificial intelligence","score_opus":0.06824753057029719,"score_gpt":0.37790900271863154,"score_spread":0.30966147214833434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765572224","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.0008686606,0.00004671291,0.99761546,0.00018685259,0.00042599897,0.00052498234,0.0000150174865,0.00015024697,0.00016607335],"genre_scores_gemma":[0.016427968,0.000014091442,0.9825414,0.000050229108,0.00029699685,0.00010769837,0.000008006661,0.000028576855,0.0005250337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997585,0.00007277285,0.00039416214,0.00077078614,0.00059671607,0.0005805512],"domain_scores_gemma":[0.9975907,0.00009562291,0.00033709288,0.0011202444,0.00064898573,0.00020733058],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061270315,0.00022702992,0.0003862681,0.0005048891,0.001273235,0.0011759823,0.0017923148,0.000107587206,0.000036691108],"category_scores_gemma":[0.00030534103,0.00023010006,0.00020094517,0.000908514,0.00008735942,0.0008532624,0.00036200904,0.00015498442,0.00001508755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000108954755,0.00015473687,0.0015105302,0.000079633,0.00093739684,0.000042102234,0.0004442908,0.17613472,0.00021179815,0.00027219602,0.00006837369,0.8201333],"study_design_scores_gemma":[0.00049082347,0.00006424819,0.0026410704,0.000009243105,0.00015787182,0.00003965264,0.000013799344,0.9948293,0.0005924633,0.00066181883,0.00022463419,0.00027507567],"about_ca_topic_score_codex":0.00016905802,"about_ca_topic_score_gemma":0.000017744209,"teacher_disagreement_score":0.81985825,"about_ca_system_score_codex":0.00010383744,"about_ca_system_score_gemma":0.0001825688,"threshold_uncertainty_score":0.9998609},"labels":[],"label_agreement":null},{"id":"W2782701038","doi":"10.3390/a11010003","title":"Analytic Combinatorics for Computing Seeding Probabilities","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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":"Ministerio de Economía y Competitividad; Generalitat de Catalunya; Centres de Recerca de Catalunya","keywords":"Heuristics; Seeding; Heuristic; Computer science; Set (abstract data type); Algorithm; Estimator; Function (biology); Simple (philosophy); Generating function; Sequence (biology); Construct (python library); Enumerative combinatorics; Theoretical computer science; Mathematics; Mathematical optimization; Artificial intelligence; Discrete mathematics; Statistics","score_opus":0.019105735749371983,"score_gpt":0.27174509590401297,"score_spread":0.252639360154641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782701038","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.98292005,0.00070122065,0.013255966,0.00012263743,0.0007023748,0.00029506936,0.000021934062,0.000008938096,0.0019718],"genre_scores_gemma":[0.99037266,0.00003216785,0.00801887,0.000115857416,0.00088061544,0.000013968774,0.000015399019,0.00001707651,0.0005334011],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931353,0.000010649745,0.00013893376,0.00025036107,0.000058719936,0.00022780268],"domain_scores_gemma":[0.99953556,0.000022434486,0.00004755666,0.00016981353,0.000183978,0.0000406769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016396862,0.00010759877,0.000121025194,0.000021592106,0.00018097006,0.000021735086,0.00012049426,0.000060811388,0.000002500304],"category_scores_gemma":[0.00006355692,0.000103378836,0.00006798544,0.000060116956,0.0001120899,4.4347053e-7,0.000104329396,0.000027492504,0.0000040379396],"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.00024062094,0.0005035495,0.06366017,0.00038284514,0.0015962715,0.0000058217565,0.0038592569,0.00033699544,0.79396224,0.019748125,0.025802808,0.08990128],"study_design_scores_gemma":[0.0051635015,0.0072435406,0.030017674,0.00008371197,0.00029770745,0.000086891865,0.0030116471,0.042058423,0.42865807,0.043003835,0.43810886,0.0022661437],"about_ca_topic_score_codex":0.0000091973,"about_ca_topic_score_gemma":0.000006019592,"teacher_disagreement_score":0.41230607,"about_ca_system_score_codex":0.000011242396,"about_ca_system_score_gemma":0.000028759656,"threshold_uncertainty_score":0.42156667},"labels":[],"label_agreement":null},{"id":"W2794856912","doi":"10.3390/a11040040","title":"Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Multipartite; Bipartite graph; Discrete mathematics; Graph; Physics","score_opus":0.03247363405629961,"score_gpt":0.2995775671209701,"score_spread":0.2671039330646705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794856912","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.94486517,0.00035936967,0.05413264,0.00009015412,0.00009644044,0.00021516587,0.000024258166,0.000044330172,0.00017248842],"genre_scores_gemma":[0.96486336,0.00008164926,0.03497304,0.000032713808,0.000014216226,0.000009686142,6.399271e-7,0.000009049293,0.000015670294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99840707,0.00017532808,0.00030871786,0.00044778016,0.00029604393,0.0003650358],"domain_scores_gemma":[0.9984342,0.00050560455,0.00015160604,0.00050443545,0.00023842526,0.00016573958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007169692,0.00014889977,0.00036001348,0.00020597746,0.00015334431,0.000030593597,0.00041142886,0.0000654412,0.0000055243586],"category_scores_gemma":[0.00014164897,0.00013941877,0.000059182377,0.0006074791,0.0014414464,0.000337467,0.0005412316,0.0001624267,0.0000019045177],"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.00025980498,0.00048439912,0.14163703,0.00026277156,0.00030305647,0.000049409166,0.0033078757,0.000060968956,0.18857889,0.579943,0.00006786674,0.08504491],"study_design_scores_gemma":[0.0031724144,0.0020841437,0.43161222,0.00017759507,0.000038967613,0.00012983065,0.00011675028,0.19358899,0.14428884,0.22326235,0.00081192696,0.0007159796],"about_ca_topic_score_codex":0.00024388458,"about_ca_topic_score_gemma":0.00017307924,"teacher_disagreement_score":0.35668066,"about_ca_system_score_codex":0.000012219934,"about_ca_system_score_gemma":0.000049160004,"threshold_uncertainty_score":0.56853324},"labels":[],"label_agreement":null},{"id":"W2801171575","doi":"10.3390/a11050067","title":"Automated Processing of fNIRS Data—A Visual Guide to the Pitfalls and Consequences","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"Optical Imaging and Spectroscopy Techniques","field":"Medicine","cited_by":125,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alberta Children's Hospital; University of Calgary","funders":"National Institute of Neurological Disorders and Stroke; Natural Sciences and Engineering Research Council of Canada; California HIV/AIDS Research Program","keywords":"Computer science; Pipeline (software); Data processing; Software; Visual processing; Image processing; Data science; Artificial intelligence; Machine learning; Human–computer interaction; Perception; Psychology; Database; Image (mathematics)","score_opus":0.02710437604773647,"score_gpt":0.411028818294151,"score_spread":0.38392444224641453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801171575","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.7785129,0.0028335394,0.123151235,0.05609006,0.0005808362,0.002319186,0.00013738613,0.0037363,0.032638542],"genre_scores_gemma":[0.79445285,0.00003934437,0.20364532,0.0012557587,0.00021459708,0.0000075733237,0.000014129431,0.00001387955,0.0003565441],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924076,0.000020268653,0.00018578098,0.00021984275,0.00016890372,0.00016442552],"domain_scores_gemma":[0.99939495,0.000041325777,0.00004253626,0.00029921587,0.00014075339,0.00008120749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003274462,0.00008296941,0.00017762672,0.000045418707,0.00007762398,0.00003325338,0.00015388877,0.000034590987,0.000017727247],"category_scores_gemma":[0.00019665537,0.00005036299,0.0000124317185,0.00017504786,0.0005204767,0.00007894609,0.00011360452,0.000078276535,0.000012248964],"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.00024376383,0.00054454623,0.010649221,0.00037695927,0.00025053055,0.00016162776,0.0028945892,7.8974335e-7,0.41958568,0.0012550061,0.18925828,0.37477902],"study_design_scores_gemma":[0.0013227109,0.0039190515,0.01581725,0.0012105608,0.00038494778,0.0007514332,0.0011628022,0.3898609,0.4942914,0.00074345985,0.08996004,0.0005754443],"about_ca_topic_score_codex":0.00021509612,"about_ca_topic_score_gemma":0.000009760977,"teacher_disagreement_score":0.38986012,"about_ca_system_score_codex":0.000012382825,"about_ca_system_score_gemma":0.00008928468,"threshold_uncertainty_score":0.2053743},"labels":[],"label_agreement":null},{"id":"W2820985545","doi":"10.3390/a11070104","title":"The Gradient and the Hessian of the Distance between Point and Triangle in 3D","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Hessian matrix; Point (geometry); Computation; Mathematics; Space (punctuation); Algorithm; Combinatorics; Geometry; Mathematical analysis; Computer science; Applied mathematics","score_opus":0.0050633926883951975,"score_gpt":0.22057641395743985,"score_spread":0.21551302126904465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2820985545","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.5262216,0.014202783,0.43834332,0.010286338,0.00048293953,0.0018805207,0.00005340501,0.00043660926,0.008092532],"genre_scores_gemma":[0.9970973,0.00023523551,0.002510788,0.000024754152,0.00005615593,0.000017742559,3.4622235e-7,0.000008749324,0.000048894915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950814,0.000041471645,0.00016253394,0.00008646074,0.000082555045,0.000118828524],"domain_scores_gemma":[0.9995299,0.0001873724,0.00003625207,0.0002126916,0.00001331791,0.000020481228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023987338,0.00007137773,0.00015596749,0.000015293812,0.000087857494,0.000014020379,0.00014208506,0.000022350605,0.0000017530706],"category_scores_gemma":[0.000042121665,0.00003076929,0.00003112873,0.00019957605,0.0004376008,0.00004039232,0.00005610828,0.00009777734,6.137823e-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.000044807897,0.000025451762,0.013005235,0.000036430658,0.00016096397,0.0000027389071,0.0027097089,0.00010453476,0.00021969483,0.008067698,0.00045381222,0.97516894],"study_design_scores_gemma":[0.005870521,0.0003964764,0.27542302,0.00040711372,0.00034491302,0.000021935059,0.0016705833,0.31335515,0.02969412,0.2398511,0.13182145,0.0011436044],"about_ca_topic_score_codex":0.00005056127,"about_ca_topic_score_gemma":0.000093314695,"teacher_disagreement_score":0.9740253,"about_ca_system_score_codex":0.000017689374,"about_ca_system_score_gemma":0.0000021607527,"threshold_uncertainty_score":0.16123584},"labels":[],"label_agreement":null},{"id":"W2898086057","doi":"10.3390/a11110165","title":"Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"semigroups and automata theory","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; Saint Mary's University; University of Waterloo","funders":"","keywords":"Edit distance; Computer science; Nondeterministic algorithm; Cardinality (data modeling); Algorithm; Nondeterministic finite automaton; Correctness; Word (group theory); Automaton; Theoretical computer science; Mathematics; Automata theory","score_opus":0.01009466810539971,"score_gpt":0.2554369351228916,"score_spread":0.2453422670174919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898086057","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.02804784,0.00042083216,0.9690594,0.00059999764,0.001138494,0.00033836343,0.000021686345,0.00014149485,0.00023190105],"genre_scores_gemma":[0.85367227,0.0000026987489,0.14485453,0.0003693331,0.0009111713,0.000020714846,0.0000061008436,0.00002255727,0.00014065727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984501,0.000069645,0.0003233126,0.00041870098,0.00033345638,0.00040479132],"domain_scores_gemma":[0.99860066,0.0002753689,0.00015972073,0.0007496268,0.00014652757,0.00006809019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083970366,0.00017902584,0.0002395871,0.00006288535,0.0002515349,0.00006848306,0.0011413643,0.00006390064,0.000011711806],"category_scores_gemma":[0.00003380783,0.00012390182,0.00014025699,0.00045511796,0.00029611343,0.00008689307,0.00014832246,0.00010734936,0.000012023435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027683407,0.00022447569,0.000015133686,0.00007643013,0.000114052535,0.000021499889,0.021061448,0.0008864776,0.010512166,0.034780968,0.002326991,0.9299527],"study_design_scores_gemma":[0.0004995818,0.00016950819,0.0001646255,0.00004873532,0.000016000442,0.000024579562,0.0004278172,0.975329,0.017185815,0.0019654625,0.0039634113,0.0002055007],"about_ca_topic_score_codex":0.000048897316,"about_ca_topic_score_gemma":0.000004324661,"teacher_disagreement_score":0.9744425,"about_ca_system_score_codex":0.00003315457,"about_ca_system_score_gemma":0.00003457438,"threshold_uncertainty_score":0.50525695},"labels":[],"label_agreement":null},{"id":"W2905357467","doi":"10.3390/a11120211","title":"A Connection Between the Kalman Filter and an Optimized LMS Algorithm for Bilinear Forms","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Strong","keywords":"Kalman filter; Bilinear interpolation; Algorithm; Adaptive filter; Computer science; Identification (biology); System identification; Finite impulse response; Wiener filter; Context (archaeology); Least mean squares filter; Impulse (physics); Connection (principal bundle); Mathematics; Control theory (sociology); Artificial intelligence; Data mining","score_opus":0.027553744833675713,"score_gpt":0.28624931228135464,"score_spread":0.2586955674476789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905357467","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.016400034,0.000068328176,0.98148596,0.000058828366,0.00022495026,0.00058885204,0.00009672576,0.0008412034,0.00023508587],"genre_scores_gemma":[0.094570905,0.00004925007,0.90322965,0.00007951475,0.0015148849,0.00025910145,0.00007006109,0.000102724094,0.00012392392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999113,0.000018257782,0.00020619045,0.00025661915,0.000101200516,0.0003046794],"domain_scores_gemma":[0.9993501,0.00012156228,0.000037514706,0.00032151976,0.00008772098,0.000081590995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023543187,0.00020265504,0.00021544413,0.00006740679,0.00018310104,0.000052466425,0.00018279997,0.00009968028,0.00001869126],"category_scores_gemma":[0.000025034169,0.00014736436,0.00005129636,0.00011559085,0.00015188385,0.0003286549,0.000055333287,0.00013607577,0.0000079578285],"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.000022162629,0.000022895278,0.000068134796,0.000029639146,0.00012738648,0.0000028846846,0.0004912995,0.00035269643,0.0022510416,0.00029478507,0.00095909357,0.99537796],"study_design_scores_gemma":[0.0009796295,0.0007277074,0.00057529175,0.00003217266,0.000046903006,0.000024981371,0.00010748193,0.91999185,0.04230396,0.007128927,0.027644912,0.00043617265],"about_ca_topic_score_codex":0.000013664169,"about_ca_topic_score_gemma":0.00000452328,"teacher_disagreement_score":0.99494183,"about_ca_system_score_codex":0.0000419746,"about_ca_system_score_gemma":0.000006094848,"threshold_uncertainty_score":0.60093445},"labels":[],"label_agreement":null},{"id":"W2917261650","doi":"10.3390/a12020039","title":"A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem","year":2019,"lang":"en","type":"article","venue":"Algorithms","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"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":"Computer science; Heuristic; Benchmark (surveying); Adaptability; Vehicle routing problem; Routing (electronic design automation); Mathematical optimization; Heuristics; Real-time computing; Artificial intelligence; Mathematics; Computer network","score_opus":0.013412085036412865,"score_gpt":0.2512406010561653,"score_spread":0.23782851601975244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917261650","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.014755561,0.00015166654,0.97675425,0.000063719024,0.0006502721,0.0010106013,0.00016514373,0.00072381715,0.005724984],"genre_scores_gemma":[0.644175,0.00006473274,0.35429615,0.00010973507,0.00033854478,0.00019365875,0.00006267766,0.00014834625,0.00061115954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854213,0.000060187813,0.00034666844,0.00032815905,0.00019400106,0.0005288363],"domain_scores_gemma":[0.998996,0.00031319103,0.00007029761,0.00034640945,0.000112221176,0.00016184297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047423606,0.00023997166,0.00034374013,0.00009624864,0.00007292074,0.000048646078,0.00019685732,0.00008607443,0.000097756936],"category_scores_gemma":[0.00014401299,0.00025284066,0.000109311244,0.0001941958,0.000015422935,0.00015527425,0.00005002331,0.00018200175,0.00016837088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002072185,0.00041009608,0.0041466304,0.0010820468,0.00097431923,0.00008334295,0.0039660456,0.8751337,0.0020357086,0.02368955,0.010081565,0.078189805],"study_design_scores_gemma":[0.0012624877,0.00011526574,0.0004645763,0.000043046188,0.000039346218,0.000013399695,0.000076718745,0.99410367,0.00059741305,0.0010264068,0.0019142509,0.00034343053],"about_ca_topic_score_codex":0.00002124423,"about_ca_topic_score_gemma":0.0000019736578,"teacher_disagreement_score":0.62941945,"about_ca_system_score_codex":0.000088990186,"about_ca_system_score_gemma":0.00005159516,"threshold_uncertainty_score":0.9999924},"labels":[],"label_agreement":null},{"id":"W2934347310","doi":"10.3390/a12030066","title":"An Approach to the Dynamics and Control of Uncertain Robot Manipulators","year":2019,"lang":"en","type":"article","venue":"Algorithms","topic":"Dynamics and Control of Mechanical Systems","field":"Engineering","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":"Carleton University","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"SCARA; Control theory (sociology); Lagrange multiplier; Constraint (computer-aided design); Robot; Computer science; Robot manipulator; Equations of motion; Bounded function; Robotics; System dynamics; Mathematics; Mathematical optimization; Control (management); Artificial intelligence","score_opus":0.006193508420673377,"score_gpt":0.19689689209008868,"score_spread":0.1907033836694153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2934347310","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.1314734,0.00023269057,0.8654923,0.0000941224,0.0004101871,0.0005202057,0.000028710885,0.00007377966,0.0016746268],"genre_scores_gemma":[0.99831456,0.0000052789014,0.0013765293,0.000062069594,0.00006117134,0.000018970097,0.0000067821425,0.000021681162,0.00013294934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993765,0.000021293863,0.0001692818,0.00013560109,0.00013326033,0.00016411564],"domain_scores_gemma":[0.9995771,0.000031256397,0.000023038821,0.0002667817,0.000021971826,0.00007985627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021170554,0.00010361475,0.00020872743,0.000027813061,0.000019856907,0.00002644963,0.00018913098,0.0000583302,0.000003948878],"category_scores_gemma":[0.0000038375533,0.000073200434,0.00003590151,0.00008591465,0.000008712135,0.000046508958,0.000015385538,0.00008199643,0.000012354513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002184699,0.00007466989,0.0021821184,0.00011242282,0.00019186288,0.000002402576,0.00027900992,0.8149701,0.0032349143,0.091290526,0.000036420453,0.08760375],"study_design_scores_gemma":[0.00037531237,0.00006499458,0.001430386,0.00000808881,0.00001344091,0.0000053185636,0.00013952698,0.9975997,0.000015308256,0.000103556515,0.00014403964,0.00010031928],"about_ca_topic_score_codex":0.0001198805,"about_ca_topic_score_gemma":0.000025724477,"teacher_disagreement_score":0.86684114,"about_ca_system_score_codex":0.000036146568,"about_ca_system_score_gemma":0.000004825447,"threshold_uncertainty_score":0.2985027},"labels":[],"label_agreement":null},{"id":"W2952991946","doi":"10.3390/a12060124","title":"Lyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings","year":2019,"lang":"en","type":"article","venue":"Algorithms","topic":"Algorithms and Data Compression","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":"Sheridan College","funders":"","keywords":"Factorization; String (physics); Algorithm; Time complexity; Character (mathematics); Space (punctuation); Computer science; Combinatorics; Running time; Constant (computer programming); Mathematics; Edit distance; Discrete mathematics","score_opus":0.022270548047491047,"score_gpt":0.24867346058979645,"score_spread":0.2264029125423054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952991946","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.025913797,0.0004004982,0.9702483,0.00026523048,0.0015304389,0.00089136505,0.00007668203,0.00030588082,0.0003678279],"genre_scores_gemma":[0.22845148,0.00033084216,0.7677589,0.000504021,0.0006847116,0.0001506418,0.00028226792,0.00008552058,0.0017515821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976398,0.000053013977,0.00039705556,0.000950522,0.0003859226,0.00057368533],"domain_scores_gemma":[0.9983078,0.0002552009,0.00020081211,0.00081739714,0.00019047603,0.0002282657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038184895,0.0003399392,0.00038669416,0.00017072556,0.00023256501,0.00035221942,0.0008908218,0.00018421315,0.000028989192],"category_scores_gemma":[0.00004771554,0.00030466396,0.00009703155,0.00033640309,0.00004297635,0.0011258386,0.00054420886,0.00019463427,0.00005745386],"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.000025479772,0.00017213458,0.0012996421,0.00010250383,0.00007540379,0.000015378688,0.0008592155,0.00008224389,0.0038044278,0.009208415,0.0013605008,0.9829947],"study_design_scores_gemma":[0.0026670627,0.00058391347,0.0036266583,0.00009528816,0.000027717857,0.000049170234,0.00010387364,0.943114,0.008529686,0.0051085395,0.035295118,0.00079899846],"about_ca_topic_score_codex":0.00011204639,"about_ca_topic_score_gemma":0.0000052271466,"teacher_disagreement_score":0.9821957,"about_ca_system_score_codex":0.00006012027,"about_ca_system_score_gemma":0.000078593876,"threshold_uncertainty_score":0.9999406},"labels":[],"label_agreement":null},{"id":"W2953528653","doi":"10.3390/a12080153","title":"γ-Graphs of Trees","year":2019,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","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 Waterloo; St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Vertex (graph theory); Graph; Dominating set; Product (mathematics); Cartesian coordinate system; Tree (set theory)","score_opus":0.014962383509411167,"score_gpt":0.2805596362697304,"score_spread":0.26559725276031926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953528653","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.2912763,0.0007055392,0.67849535,0.0004871563,0.00085905485,0.0005162423,0.0000079396395,0.0002882184,0.027364181],"genre_scores_gemma":[0.9076493,0.000020747868,0.09069658,0.000055131724,0.00001533245,0.000006663386,8.710516e-7,0.000008201805,0.0015471929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991257,0.00004130909,0.00012278344,0.00022595385,0.00027349207,0.00021071828],"domain_scores_gemma":[0.999098,0.00011574316,0.000043769673,0.00061949424,0.00006965848,0.000053353633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002189468,0.000068832815,0.00012877234,0.0001385501,0.000023200573,0.000018541807,0.00083502656,0.000029295104,0.000051953855],"category_scores_gemma":[0.00001705625,0.00005958415,0.00006327101,0.0005411051,0.00005926076,0.000298836,0.00019511297,0.00008620622,0.00019647833],"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.000009531147,0.0000880777,0.0073720957,0.000019208985,0.000035257686,0.000016896673,0.0004098347,0.00013965844,0.011128389,0.7250682,0.00023623537,0.25547662],"study_design_scores_gemma":[0.0015945091,0.00083906285,0.029633395,0.000059181017,0.000006316622,0.000054008782,0.00016104507,0.09043255,0.07511996,0.79071766,0.010785973,0.0005963581],"about_ca_topic_score_codex":0.000008592128,"about_ca_topic_score_gemma":0.0000020738005,"teacher_disagreement_score":0.616373,"about_ca_system_score_codex":0.0000075174216,"about_ca_system_score_gemma":0.00002416908,"threshold_uncertainty_score":0.2525397},"labels":[],"label_agreement":null},{"id":"W2963256822","doi":"10.3390/a12080147","title":"An Optimized Differential Step-Size LMS Algorithm","year":2019,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Algorithm; Benchmark (surveying); Computer science; Computational complexity theory; Heuristic; Filter (signal processing); Field (mathematics); Basis (linear algebra); Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.0069008103061633606,"score_gpt":0.233508813884699,"score_spread":0.22660800357853564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963256822","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.035430547,0.000087758766,0.95791566,0.000011009743,0.001112619,0.00042314662,0.000058978032,0.0027213458,0.002238954],"genre_scores_gemma":[0.21781574,0.000067870045,0.780828,0.000035381883,0.00032909008,0.00005389697,0.000041636682,0.00014159945,0.0006868166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986615,0.000031093787,0.00025945704,0.00035973074,0.00024087736,0.0004473116],"domain_scores_gemma":[0.99907315,0.00007158703,0.000038589307,0.0006198828,0.000049406786,0.0001473809],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000079540754,0.0003122115,0.00035964992,0.00008038086,0.00004439654,0.000059215075,0.00038600384,0.0001406933,0.00066489814],"category_scores_gemma":[0.0000101336145,0.0003137355,0.000094073475,0.00014654541,0.000039965817,0.00038961467,0.000071515125,0.00027993505,0.00024224914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000648928,0.00026865755,0.00022503354,0.0001236711,0.00032783338,0.00012800813,0.00040275065,0.026113436,0.17860441,0.00078513403,0.0019218763,0.7910343],"study_design_scores_gemma":[0.0013352998,0.00025141463,0.0012647101,0.00005039509,0.000023811739,0.00003285609,0.000055126,0.9550059,0.032827314,0.0005961542,0.007783734,0.00077331375],"about_ca_topic_score_codex":0.000015530271,"about_ca_topic_score_gemma":7.493057e-7,"teacher_disagreement_score":0.92889243,"about_ca_system_score_codex":0.00009240867,"about_ca_system_score_gemma":0.000009820064,"threshold_uncertainty_score":0.99993145},"labels":[],"label_agreement":null},{"id":"W2967540505","doi":"10.3390/a12080171","title":"An Application of Manifold Learning in Global Shape Descriptors","year":2019,"lang":"en","type":"article","venue":"Algorithms","topic":"3D Shape Modeling and Analysis","field":"Engineering","cited_by":5,"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":"GE Healthcare","keywords":"Artificial intelligence; Computer science; Invariant (physics); Pattern recognition (psychology); Discriminative model; Laplace operator; Mathematics; Heat kernel signature; Discretization; Normalization (sociology); Active shape model","score_opus":0.006134791287187404,"score_gpt":0.22060739568669316,"score_spread":0.21447260439950575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967540505","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.9067778,0.00014803543,0.09148095,0.0000067668993,0.00006333997,0.000054366898,0.0000025599527,0.00013095261,0.0013352266],"genre_scores_gemma":[0.99760175,0.00001613526,0.002278048,0.0000070643446,0.000028334163,0.0000047650656,0.000014638691,0.000011127888,0.000038125032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952066,0.000010734758,0.0001430239,0.00011728976,0.00009107357,0.00011724555],"domain_scores_gemma":[0.9997972,0.00000596644,0.000018729514,0.00013120267,0.000017449125,0.00002942691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092952,0.00006854478,0.0001245052,0.00004986775,0.000009619422,0.000009079773,0.00009522605,0.000048227426,0.000031675158],"category_scores_gemma":[0.0000026214695,0.00007308696,0.00003332265,0.00022075987,0.0000041297676,0.00007977749,0.000007852553,0.0000798554,0.00006178126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018188682,0.000025832782,0.07748687,0.000031289772,0.000022729773,0.0000014424193,0.0001426186,0.78087217,0.00406824,0.00013811243,0.0000101924215,0.13719867],"study_design_scores_gemma":[0.00010887089,0.000018793182,0.0055532297,0.000009774408,0.000007744553,9.606256e-7,0.00010437524,0.99360305,0.0003196281,0.00008861349,0.00010550078,0.00007943033],"about_ca_topic_score_codex":0.0001562435,"about_ca_topic_score_gemma":0.000020861718,"teacher_disagreement_score":0.2127309,"about_ca_system_score_codex":0.000040826824,"about_ca_system_score_gemma":0.0000047977373,"threshold_uncertainty_score":0.29803997},"labels":[],"label_agreement":null},{"id":"W3009569330","doi":"10.3390/a13030062","title":"A Review of Lithium-Ion Battery Fault Diagnostic Algorithms: Current Progress and Future Challenges","year":2020,"lang":"en","type":"review","venue":"Algorithms","topic":"Advanced Battery Technologies Research","field":"Engineering","cited_by":289,"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":"Battery (electricity); Thermal runaway; Fault (geology); Reliability engineering; Computer science; Energy density; Lithium-ion battery; Lithium (medication); Power (physics); Function (biology); Fault detection and isolation; Algorithm; Engineering; Artificial intelligence; Medicine; Engineering physics","score_opus":0.04812904358534624,"score_gpt":0.34412873545154776,"score_spread":0.2959996918662015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009569330","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":[8.301451e-8,0.9947047,0.00056872517,0.0008140511,0.00095273484,0.0019094436,0.00028071276,0.0006673981,0.000102143866],"genre_scores_gemma":[1.1842671e-7,0.9941916,0.0032932444,0.000038877126,0.0010741773,0.0010440579,0.00016179789,0.0001887505,0.000007401109],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968346,0.0001537619,0.0010219184,0.00080363563,0.0005344151,0.0006516747],"domain_scores_gemma":[0.99789375,0.0006146284,0.0002793629,0.00087300834,0.00013786736,0.00020138406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002776528,0.00086759264,0.002801809,0.00031316167,0.00005012106,0.000034844226,0.0008516333,0.00051135704,0.000033817854],"category_scores_gemma":[0.0003179151,0.0007159077,0.0003651376,0.0007338148,0.00024817942,0.00018539457,0.0005325778,0.001648775,0.000066658744],"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":[3.9431845e-7,0.000024293793,2.1909855e-7,0.28317508,0.00012550587,0.000066556735,0.000022605906,5.170413e-7,4.7573504e-8,0.000012808644,0.0021722384,0.71439976],"study_design_scores_gemma":[0.0001088639,0.0000957583,0.0000012044299,0.12582281,0.00029305575,0.00013562766,0.000022661397,0.00017020888,0.0000039898764,0.00003608201,0.87275636,0.00055336225],"about_ca_topic_score_codex":7.001913e-7,"about_ca_topic_score_gemma":3.482176e-7,"teacher_disagreement_score":0.87058413,"about_ca_system_score_codex":0.00017075942,"about_ca_system_score_gemma":0.00008021753,"threshold_uncertainty_score":0.9995292},"labels":[],"label_agreement":null},{"id":"W3021080851","doi":"10.3390/a13050115","title":"A Fuzzy-Based Decision Support Model for Risk Maturity Evaluation of Construction Organizations","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Construction Project Management and Performance","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"","keywords":"Capability Maturity Model; Maturity (psychological); Interdependence; Ambiguity; Risk management; Risk analysis (engineering); Process (computing); Identification (biology); Computer science; Quality (philosophy); Process management; Fuzzy logic; Service Integration Maturity Model; Set (abstract data type); Business; Artificial intelligence","score_opus":0.12517312428090172,"score_gpt":0.3833211543716089,"score_spread":0.2581480300907072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021080851","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.090404436,0.000020462086,0.9063041,0.00068076176,0.00045621383,0.0007014793,0.00017790456,0.000056134828,0.0011984762],"genre_scores_gemma":[0.8148528,0.000013748393,0.18467124,0.0001920009,0.00010042416,0.000037517064,0.00004955203,0.000011908205,0.000070849885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971751,0.00010869103,0.00066461955,0.0004072283,0.0014947598,0.00014961696],"domain_scores_gemma":[0.9965687,0.00040472497,0.00045651075,0.00033936204,0.002145537,0.00008521428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028419867,0.00012087255,0.00022905819,0.00024421717,0.00021548044,0.000095398296,0.00033029154,0.00007605597,0.0006147299],"category_scores_gemma":[0.003522435,0.00010350344,0.00010258194,0.0015138722,0.00009887095,0.0003997284,0.000065046755,0.00009391913,0.00007585934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114302915,0.00004111722,0.008950726,0.000013904813,0.000025788831,2.1624345e-7,0.0006974422,0.084478416,0.00010331457,0.0018011921,0.006387423,0.89738613],"study_design_scores_gemma":[0.00118558,0.00007399545,0.0011446099,0.0000051534835,0.00010102643,0.0000019493423,0.00026311452,0.95610625,0.00068442203,0.03873246,0.0015891696,0.00011225352],"about_ca_topic_score_codex":0.0000094413635,"about_ca_topic_score_gemma":0.000014548842,"teacher_disagreement_score":0.8972739,"about_ca_system_score_codex":0.000034533383,"about_ca_system_score_gemma":0.0003691687,"threshold_uncertainty_score":0.67308617},"labels":[],"label_agreement":null},{"id":"W3029815899","doi":"10.3390/a13060135","title":"A Recursive Least-Squares Algorithm for the Identification of Trilinear Forms","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Tensor decomposition and applications","field":"Mathematics","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Recursive least squares filter; Algorithm; Impulse response; Least-squares function approximation; Identification (biology); Impulse (physics); Rank (graph theory); Tensor (intrinsic definition); Mathematics; Computer science; Tensor decomposition; System identification; Rank condition; Mathematical optimization; Applied mathematics; Adaptive filter; Statistics; Data mining","score_opus":0.0642865499699324,"score_gpt":0.340926401923273,"score_spread":0.2766398519533406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029815899","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.0018937885,0.00012512243,0.98901516,0.0073546222,0.000082860955,0.0009962135,0.00030084956,0.00008736625,0.00014399017],"genre_scores_gemma":[0.32251802,0.00018764204,0.6697142,0.0023679421,0.0012369285,0.0017462793,0.0002794029,0.00014931743,0.0018002552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904615,0.00002011943,0.0004379445,0.00018980008,0.00017263384,0.00013332695],"domain_scores_gemma":[0.99870175,0.00050422276,0.00025343182,0.0002676098,0.00021234584,0.000060644434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002006873,0.00010042487,0.00017603932,0.00002675612,0.00014081105,0.000027334012,0.00024740005,0.000050295024,0.00003794839],"category_scores_gemma":[0.00018560233,0.00007104587,0.00014264569,0.0002146471,0.00006538282,0.000074562966,0.00002707749,0.00008203014,0.000033019227],"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.000069842805,0.00043164345,0.000014072146,0.00016437718,0.00028828238,0.0000018404471,0.0043979683,0.000044244647,0.0069473963,0.26849073,0.034382228,0.68476737],"study_design_scores_gemma":[0.0021414359,0.0003468653,0.0002493482,0.000034309156,0.00032868923,0.000019978435,0.0036203298,0.6112204,0.06934293,0.23624018,0.07604502,0.00041051387],"about_ca_topic_score_codex":0.0000048994325,"about_ca_topic_score_gemma":0.0000010575541,"teacher_disagreement_score":0.68435687,"about_ca_system_score_codex":0.000013674802,"about_ca_system_score_gemma":0.000022070464,"threshold_uncertainty_score":0.28971663},"labels":[],"label_agreement":null},{"id":"W3038410581","doi":"10.3390/a13070163","title":"An Interval Type-2 Fuzzy Risk Analysis Model (IT2FRAM) for Determining Construction Project Contingency Reserve","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fuzzy set; Vagueness; Membership function; Fuzzy logic; Ambiguity; Computer science; Contingency; Interval (graph theory); Fuzzy number; Data mining; Contingency table; Risk management; Mathematics; Artificial intelligence; Machine learning; Linguistics","score_opus":0.32993763002430737,"score_gpt":0.4803315673796275,"score_spread":0.15039393735532014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038410581","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.38155535,0.00006744152,0.61651963,0.00020477583,0.0005221088,0.0004693533,0.00017768593,0.00012069472,0.0003629469],"genre_scores_gemma":[0.63582784,0.000010083253,0.3634302,0.00022910075,0.00030810694,0.000033901302,0.000024717625,0.000029516825,0.000106555926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952902,0.00042925324,0.0012950508,0.00124195,0.0012829386,0.00046058316],"domain_scores_gemma":[0.99574834,0.0012355327,0.00073119643,0.0009356433,0.0010908847,0.00025837508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003196522,0.0002878251,0.0007630151,0.0006701012,0.00034941267,0.00075762643,0.0012656981,0.00017461486,0.00013042979],"category_scores_gemma":[0.008233539,0.00023672213,0.00044928183,0.0027207616,0.00012382149,0.00087227114,0.00025798831,0.00027715598,0.00007786308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003951087,0.00008296219,0.032543745,0.000010655995,0.0003234152,0.000027284348,0.005571832,0.017846067,0.0017360077,0.00026917868,0.0020868238,0.93910694],"study_design_scores_gemma":[0.00066839217,0.00030189057,0.0011072743,0.000011213305,0.0002651513,0.000007917369,0.001908299,0.98709804,0.0003428658,0.0061776084,0.0018137596,0.00029757278],"about_ca_topic_score_codex":0.00009191371,"about_ca_topic_score_gemma":0.00007217331,"teacher_disagreement_score":0.969252,"about_ca_system_score_codex":0.00004510257,"about_ca_system_score_gemma":0.00014285579,"threshold_uncertainty_score":0.98569095},"labels":[],"label_agreement":null},{"id":"W3038456932","doi":"10.3390/a13070158","title":"Fuzzy C-Means Clustering Algorithm with Multiple Fuzzification Coefficients","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Clustering Algorithms Research","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":"University of Waterloo","funders":"National Foundation for Science and Technology Development","keywords":"Cluster analysis; Fuzzy clustering; Correlation clustering; CURE data clustering algorithm; Canopy clustering algorithm; Data mining; Computer science; FLAME clustering; Fuzzy set; Artificial intelligence; Algorithm; Data stream clustering; Fuzzy logic; Mathematics; Pattern recognition (psychology)","score_opus":0.02957732675180462,"score_gpt":0.27321826288198814,"score_spread":0.2436409361301835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038456932","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.0005584008,0.00010817614,0.9943923,0.0022824528,0.00028363476,0.00052644097,0.000022832812,0.00080149586,0.0010242616],"genre_scores_gemma":[0.102658354,0.00003273985,0.89568067,0.00079337036,0.00036180022,0.0001014442,0.000028969034,0.000073574585,0.0002691075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964557,0.00010766596,0.00040766646,0.0011426145,0.0010315224,0.0008547754],"domain_scores_gemma":[0.9979031,0.00017559755,0.00015180411,0.0009335548,0.00029345969,0.0005424836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002707788,0.0003711742,0.00035798576,0.000154597,0.00033861445,0.00033176542,0.0017603036,0.000110599736,0.000011749482],"category_scores_gemma":[0.00012181612,0.0003362516,0.00008415452,0.0014114283,0.00013677185,0.0009225229,0.0007882463,0.00045409944,0.00034332633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030107898,0.00012467743,0.00016687156,0.000043751847,0.000054199252,0.00021243705,0.0017923552,0.022276288,0.0010167905,0.00022459842,0.0002106389,0.97384727],"study_design_scores_gemma":[0.001256782,0.0003931818,0.0005090293,0.0000328119,0.00000769391,0.00009380523,0.00015852108,0.9892045,0.0016587011,0.00013495315,0.0060848366,0.00046513422],"about_ca_topic_score_codex":0.00004954915,"about_ca_topic_score_gemma":0.0000086248765,"teacher_disagreement_score":0.9733822,"about_ca_system_score_codex":0.00013808362,"about_ca_system_score_gemma":0.000117748335,"threshold_uncertainty_score":0.9999089},"labels":[],"label_agreement":null},{"id":"W3080655855","doi":"10.3390/a13090209","title":"Perturbative-Iterative Computation of Inertial Manifolds of Systems of Delay-Differential Equations with Small Delays","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Nonlinear Dynamics and Pattern Formation","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 Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inertial frame of reference; Ode; Attractor; Manifold (fluid mechanics); Mathematics; Center manifold; Slow manifold; Computation; Context (archaeology); Ordinary differential equation; Delay differential equation; Mathematical analysis; Applied mathematics; Differential equation; Nonlinear system; Hopf bifurcation; Physics; Classical mechanics; Algorithm; Bifurcation","score_opus":0.03059801282425994,"score_gpt":0.23769078021912565,"score_spread":0.2070927673948657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080655855","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.18683255,0.00003416268,0.8126752,0.00006925553,0.000103344195,0.00015746296,0.000043797347,0.00001557001,0.00006868247],"genre_scores_gemma":[0.95654964,0.0000025228742,0.04330129,0.000020997204,0.000051684336,0.0000049565256,0.00005517093,0.000006439041,0.0000072685625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990382,0.00006552344,0.00040346646,0.00015393907,0.000245102,0.000093733564],"domain_scores_gemma":[0.9990433,0.00007218969,0.00037077378,0.00012870543,0.00033890517,0.000046139583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007336651,0.0001019449,0.00023026665,0.000076590055,0.000030094532,0.000025974598,0.00024469197,0.000042228414,0.0000029125647],"category_scores_gemma":[0.000011578209,0.000082976,0.000047166046,0.00028024128,0.000040957188,0.00022534706,0.00007061359,0.000065078915,0.0000018445445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005390924,0.0016678765,0.009829559,0.0026632536,0.0015225118,0.000055950437,0.12176842,0.44560206,0.07066753,0.21987098,0.00014888213,0.12566386],"study_design_scores_gemma":[0.0004719778,0.00051538245,0.0008947662,0.00006348896,0.000018318719,0.0000053526064,0.000097178054,0.99505806,0.0027248699,0.000058460835,0.0000057912503,0.00008634208],"about_ca_topic_score_codex":0.00014800891,"about_ca_topic_score_gemma":0.000012982997,"teacher_disagreement_score":0.7697171,"about_ca_system_score_codex":0.000012535188,"about_ca_system_score_gemma":0.000051117844,"threshold_uncertainty_score":0.33836633},"labels":[],"label_agreement":null},{"id":"W3081779567","doi":"10.3390/a13090220","title":"Fuzzy Preference Programming Framework for Functional assessment of Subway Networks","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Concordia University","keywords":"Criticality; Computer science; Fuzzy logic; Plan (archaeology); Asset management; Operations research; Process (computing); Operations management; Business; Finance; Engineering","score_opus":0.03406496791034198,"score_gpt":0.26106443277331975,"score_spread":0.22699946486297778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081779567","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.00375941,0.00014737879,0.99394506,0.000054758308,0.0011031413,0.00024542035,0.000008214941,0.00015871346,0.00057792035],"genre_scores_gemma":[0.75198764,0.000018842527,0.24682312,0.000042947493,0.0010107199,0.00007069516,0.000015946998,0.000023127743,0.0000070007645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928147,0.000005605809,0.00018815615,0.00014615004,0.00012819593,0.0002504444],"domain_scores_gemma":[0.9996491,0.00007093317,0.00003802681,0.00010322881,0.000068194444,0.00007053274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006471998,0.00012197466,0.00016640403,0.00002084432,0.00004297647,0.000021233003,0.0001018582,0.00009497045,0.0000116614965],"category_scores_gemma":[0.00002723125,0.000114701244,0.00006546622,0.00013671971,0.000020634578,0.00007368773,0.000023555955,0.00021672751,0.0000011064324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036925816,0.00003276692,0.0059264745,0.0004638016,0.00027605888,0.000007677701,0.00065290026,0.53223366,0.0013400052,0.04896233,0.0018908532,0.40817657],"study_design_scores_gemma":[0.000814454,0.00035438902,0.019719252,0.00021875328,0.000078412035,0.0000070845895,0.00034251658,0.94770575,0.0036055646,0.009532034,0.017039476,0.0005823271],"about_ca_topic_score_codex":0.0000020031594,"about_ca_topic_score_gemma":4.3091657e-7,"teacher_disagreement_score":0.7482282,"about_ca_system_score_codex":0.00003193659,"about_ca_system_score_gemma":0.000019254572,"threshold_uncertainty_score":0.4677381},"labels":[],"label_agreement":null},{"id":"W3082280326","doi":"10.3390/a13090210","title":"A Hybrid Genetic Algorithm-Based Fuzzy Markovian Model for the Deterioration Modeling of Healthcare Facilities","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Facilities and Workplace Management","field":"Psychology","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":"Concordia University","funders":"","keywords":"Computer science; Fuzzy logic; Robustness (evolution); Sensitivity (control systems); Genetic algorithm; Reliability engineering; Markov process; Mathematical optimization; Risk analysis (engineering); Operations research; Machine learning; Engineering; Artificial intelligence; Mathematics; Statistics","score_opus":0.05581104288570456,"score_gpt":0.2898256326750171,"score_spread":0.23401458978931253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082280326","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.005121188,0.0012280025,0.98083854,0.010371519,0.00034906,0.0010375108,0.00073353044,0.00007625107,0.00024438644],"genre_scores_gemma":[0.9248727,0.00004122128,0.069519766,0.0026909655,0.00025560276,0.0005758033,0.000094388604,0.0000478093,0.0019017542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984895,0.000072564486,0.00043835636,0.00038901513,0.000231899,0.0003786707],"domain_scores_gemma":[0.99915427,0.00012117209,0.00010228672,0.0003949842,0.00012520689,0.00010209999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021348859,0.00020138499,0.00026771252,0.000049726823,0.00017065753,0.00003791957,0.0002897641,0.00006414662,0.0000878831],"category_scores_gemma":[0.00002231415,0.00016473948,0.0001642588,0.00010246006,0.00007332932,0.00005138208,0.000057581285,0.00012592397,0.000020856549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030328045,0.00008105985,0.000054658954,0.00039801787,0.00018984915,0.000011630764,0.008647151,0.553046,0.000018057233,0.001162727,0.0044548535,0.4316327],"study_design_scores_gemma":[0.0007452451,0.00027216613,0.000024892184,0.00001476879,0.000042406824,0.0000017230861,0.0037383866,0.9912645,0.000016338503,0.001020488,0.0026877823,0.0001712893],"about_ca_topic_score_codex":0.000746628,"about_ca_topic_score_gemma":0.000030033934,"teacher_disagreement_score":0.9197515,"about_ca_system_score_codex":0.000039172584,"about_ca_system_score_gemma":0.000062987594,"threshold_uncertainty_score":0.6717881},"labels":[],"label_agreement":null},{"id":"W3087695592","doi":"10.3390/a13090234","title":"More Time-Space Tradeoffs for Finding a Shortest Unique Substring","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Algorithms and Data Compression","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":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Academy of Finland","keywords":"Substring; Combinatorics; Sublinear function; Binary logarithm; Mathematics; Generalization; Space (punctuation); Constant (computer programming); Workspace; Algorithm; Discrete mathematics; Computer science; Data structure; Artificial intelligence","score_opus":0.038314744892572784,"score_gpt":0.2697027902965243,"score_spread":0.2313880454039515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087695592","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.0022586337,0.00018698031,0.9903746,0.0058648605,0.00022360492,0.00037609576,0.000046984416,0.00039012104,0.00027808174],"genre_scores_gemma":[0.10028645,0.000041230338,0.8960391,0.0019171982,0.0009215222,0.00010548266,0.00011284481,0.00006148649,0.0005146852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984206,0.000030005207,0.00024436766,0.0006074594,0.00027305877,0.00042450303],"domain_scores_gemma":[0.99894065,0.00018161423,0.00009132878,0.00045615793,0.0000628452,0.0002674347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018097977,0.00021439041,0.00025740216,0.000062189305,0.00022319198,0.00021358409,0.0010469642,0.00009569277,0.000020324787],"category_scores_gemma":[0.000067071574,0.00019797913,0.00010859602,0.00043755816,0.000033816807,0.0006892328,0.00036265457,0.00019099037,0.00006274001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007552786,0.0003449319,0.0009907763,0.00017793494,0.00020712272,0.0004696675,0.009692206,0.002584214,0.023101721,0.026483558,0.07478246,0.8610899],"study_design_scores_gemma":[0.0004930153,0.00015679949,0.00039707357,0.000038779595,0.000011014334,0.000026011972,0.00004893025,0.9585103,0.0069641247,0.00043056963,0.032591615,0.0003318124],"about_ca_topic_score_codex":0.000022216504,"about_ca_topic_score_gemma":6.059808e-7,"teacher_disagreement_score":0.95592606,"about_ca_system_score_codex":0.000033994245,"about_ca_system_score_gemma":0.00007114232,"threshold_uncertainty_score":0.80733544},"labels":[],"label_agreement":null},{"id":"W3087991744","doi":"10.3390/a13110294","title":"Computing Maximal Lyndon Substrings of a String","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Algorithms and Data Compression","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 Toronto; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Suffix array; Suffix tree; Algorithm; String (physics); Generalized suffix tree; Time complexity; Mathematics; Suffix; Combinatorics; Compressed suffix array; String searching algorithm; Sorting; Computer science; Discrete mathematics; Data structure","score_opus":0.027067470436966008,"score_gpt":0.24094479113280345,"score_spread":0.21387732069583745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087991744","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.03431583,0.00021305803,0.9638263,0.00060340523,0.00021998471,0.0001071417,0.000009135811,0.00020076675,0.000504362],"genre_scores_gemma":[0.7408081,0.000012664239,0.25871435,0.00025195038,0.00018358445,0.0000014021019,0.0000064879973,0.000010407732,0.000010993728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986068,0.00003276717,0.0003183275,0.0004138731,0.00034381513,0.0002843961],"domain_scores_gemma":[0.99915946,0.00007552447,0.0001554181,0.00036835752,0.00007505309,0.00016618232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001587762,0.00014568721,0.00024687304,0.000055131335,0.000093927134,0.00008138293,0.0009821309,0.000052925992,0.0000171628],"category_scores_gemma":[0.000038112146,0.00013534681,0.00007631976,0.00046348304,0.00003567751,0.00047349875,0.0008062438,0.00016886716,0.000030774598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020754711,0.00012162664,0.0017212224,0.000096897136,0.00005479352,0.0001679296,0.0026727305,0.000644316,0.006680342,0.015012658,0.002049578,0.9707571],"study_design_scores_gemma":[0.0006221523,0.00016700893,0.0026683735,0.000053314805,0.000006875734,0.000027710665,0.00006259247,0.9777567,0.014379499,0.0004200308,0.0035935505,0.00024221551],"about_ca_topic_score_codex":0.00006555879,"about_ca_topic_score_gemma":3.2488842e-7,"teacher_disagreement_score":0.97711235,"about_ca_system_score_codex":0.000015145382,"about_ca_system_score_gemma":0.000043379245,"threshold_uncertainty_score":0.5519283},"labels":[],"label_agreement":null},{"id":"W3099203848","doi":"10.3390/a13110286","title":"On the Solutions of Second-Order Differential Equations with Polynomial Coefficients: Theory, Algorithm, Application","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","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":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Polynomial; Differential equation; Applied mathematics; Matrix polynomial; Linear differential equation; Constructive; Mathematical analysis; Computer science","score_opus":0.014546909797618475,"score_gpt":0.2381875946018187,"score_spread":0.22364068480420024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099203848","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.013428124,0.000011629547,0.98193014,0.00093831547,0.0000789753,0.0003330769,0.0004670797,0.00002415451,0.0027884792],"genre_scores_gemma":[0.99633497,3.5309787e-7,0.0023401305,0.0002059435,0.00055387,0.000050114868,0.0001627498,0.000020231088,0.00033163122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991672,0.00006349767,0.00018512488,0.00020678352,0.00017212248,0.00020528518],"domain_scores_gemma":[0.99927735,0.00021809002,0.00010271256,0.00023658037,0.00008718025,0.00007805719],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007935004,0.00013108064,0.00014923523,0.0000238023,0.00023229994,0.000030444653,0.0001906022,0.000028138436,0.0009484941],"category_scores_gemma":[0.000009116826,0.00008556754,0.000076644785,0.00023258645,0.000120802186,0.00004417185,0.00005108035,0.00016207392,0.00006075145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011714428,0.0012905616,0.00025265515,0.000016462693,0.00060259487,0.0000012720969,0.0025550057,0.0017066457,0.00219534,0.8077059,0.003963804,0.17959265],"study_design_scores_gemma":[0.0034125168,0.00089853565,0.0015800026,0.000046657162,0.00031883444,0.0000018443548,0.003552852,0.95247227,0.005786957,0.0153407175,0.015736008,0.00085280335],"about_ca_topic_score_codex":0.000055243803,"about_ca_topic_score_gemma":0.0000031531672,"teacher_disagreement_score":0.9829069,"about_ca_system_score_codex":0.000009208193,"about_ca_system_score_gemma":0.0000638615,"threshold_uncertainty_score":0.9999648},"labels":[],"label_agreement":null},{"id":"W3105843598","doi":"10.3390/a13110290","title":"Similarity-Driven Edge Bundling: Data-Oriented Clutter Reduction in Graphs Layouts","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Data Visualization and Analytics","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":"Dalhousie University","funders":"","keywords":"Computer science; Visualization; Similarity (geometry); Clutter; Graph; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Graph drawing; Representation (politics); Data mining; Artificial intelligence; Image (mathematics)","score_opus":0.07093788200561514,"score_gpt":0.3178110354048003,"score_spread":0.2468731533991852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105843598","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.0024716756,0.000059023492,0.9868753,0.008984138,0.00069323083,0.00016328305,0.0000832518,0.00026239766,0.00040772048],"genre_scores_gemma":[0.7299728,0.00025709896,0.2522082,0.0134515,0.0011144788,0.00001697141,0.002521398,0.00006591063,0.0003916869],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985809,0.00006848272,0.00027784455,0.0005690965,0.00027260496,0.00023110176],"domain_scores_gemma":[0.9989745,0.000021601554,0.000077266996,0.0007170007,0.000067045476,0.00014260561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001881668,0.00012555634,0.00016371872,0.000117443415,0.000073891075,0.00014579228,0.0011193786,0.00006228427,0.000021925704],"category_scores_gemma":[0.00008008388,0.0001267739,0.000032794065,0.0010514908,0.000033534736,0.00094463315,0.00064885407,0.00018078237,0.000095751646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008252987,0.0026827985,0.025593758,0.00033400892,0.00044967575,0.0009569275,0.029484129,0.008067404,0.003644679,0.29155678,0.32625628,0.31089106],"study_design_scores_gemma":[0.0004049226,0.00004476861,0.00039616582,0.000013199803,0.000008367309,0.000009287545,0.00008946194,0.93738776,0.00021720916,0.00048326282,0.06076342,0.00018218237],"about_ca_topic_score_codex":0.00003600259,"about_ca_topic_score_gemma":0.000012222118,"teacher_disagreement_score":0.92932034,"about_ca_system_score_codex":0.000020536763,"about_ca_system_score_gemma":0.000054962464,"threshold_uncertainty_score":0.51696897},"labels":[],"label_agreement":null},{"id":"W3107220894","doi":"10.3390/a13120325","title":"Fuzzy-Based Multivariate Analysis for Input Modeling of Risk Assessment in Wind Farm Projects","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","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":"Canadian Natural Resources; University of Alberta","funders":"","keywords":"Monte Carlo method; Computer science; Fuzzy logic; Bivariate analysis; Multivariate statistics; Schedule; Sensitivity (control systems); Multivariate normal distribution; Copula (linguistics); Data mining; Econometrics; Machine learning; Statistics; Artificial intelligence; Mathematics; Engineering","score_opus":0.1288904907946143,"score_gpt":0.3623020091042172,"score_spread":0.23341151830960294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107220894","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.023862964,0.000043336837,0.9750815,0.00025619168,0.00009750697,0.000388039,0.0000885436,0.000032775766,0.00014916384],"genre_scores_gemma":[0.7582115,0.0000022268991,0.24163865,0.000055877157,0.00004416111,0.000020155383,0.000009577069,0.000009494804,0.000008358929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977763,0.00012738867,0.0007092632,0.0005019909,0.0006452072,0.00023980896],"domain_scores_gemma":[0.99782753,0.0012336647,0.00021200982,0.00033546746,0.0002856978,0.00010561877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019796682,0.00014992051,0.00051162153,0.00039424337,0.000054327826,0.000058282534,0.00043423343,0.00008421781,0.000012837851],"category_scores_gemma":[0.0028314658,0.00011285005,0.00021678345,0.0020061724,0.000031683958,0.00008966232,0.00005922537,0.00017087799,0.000004723777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028786679,0.00006202811,0.0046402602,0.000011771564,0.00008375012,0.0000035284331,0.00061750505,0.9873665,0.00007985025,0.0002970967,0.000013255715,0.0067956857],"study_design_scores_gemma":[0.0008068737,0.00008536363,0.0036243405,0.000010767734,0.0001275207,1.3601814e-7,0.00026382977,0.9908056,0.00007464014,0.004027584,0.000035309018,0.00013802337],"about_ca_topic_score_codex":0.00020620282,"about_ca_topic_score_gemma":0.000021085036,"teacher_disagreement_score":0.73434854,"about_ca_system_score_codex":0.000044515775,"about_ca_system_score_gemma":0.00019359718,"threshold_uncertainty_score":0.46018913},"labels":[],"label_agreement":null},{"id":"W3115331974","doi":"10.3390/a14010001","title":"New Approach for Radial Basis Function Based on Partition of Unity of Taylor Series Expansion with Respect to Shape Parameter","year":2020,"lang":"en","type":"article","venue":"Algorithms","topic":"Numerical methods in engineering","field":"Engineering","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 Calgary","funders":"","keywords":"Radial basis function; Partition of unity; Taylor series; Radial basis function network; Mathematics; Applied mathematics; Basis function; Series expansion; Shape parameter; Series (stratigraphy); Function (biology); Mathematical optimization; Computer science; Mathematical analysis; Artificial intelligence; Artificial neural network; Finite element method","score_opus":0.03797628343909921,"score_gpt":0.2534880287162576,"score_spread":0.21551174527715838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115331974","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.0141768,0.0000139634485,0.9848823,0.00009658258,0.00015309613,0.00034447774,0.000026539914,0.00013477856,0.00017144794],"genre_scores_gemma":[0.3033542,0.0000014822687,0.69633657,0.00006196152,0.00013927948,0.000050489794,0.000014212511,0.000036181336,0.0000056287477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992187,0.00003408071,0.00021525593,0.00019060944,0.0001792253,0.0001621099],"domain_scores_gemma":[0.9994064,0.00019813054,0.000036873233,0.00018165946,0.00004467072,0.00013227535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013781364,0.00014548659,0.00026676332,0.00007925498,0.000018829156,0.000008119653,0.00008603129,0.00006219558,0.000041545958],"category_scores_gemma":[0.00019991095,0.00013171913,0.000060589955,0.0004076648,0.000017632143,0.00009453738,0.000011276267,0.000105816245,0.0000021227675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006986399,0.00003277727,0.000042625914,0.00026288087,0.0000497252,9.808437e-7,0.00025019885,0.8053995,0.018815758,0.00006538124,0.00035824077,0.17402332],"study_design_scores_gemma":[0.0005334023,0.0011258478,0.00037877134,0.000032839864,0.000042388838,7.8645036e-7,0.00005711576,0.90600604,0.090900905,0.00006839598,0.0006923004,0.00016122899],"about_ca_topic_score_codex":0.000010244214,"about_ca_topic_score_gemma":5.1133327e-7,"teacher_disagreement_score":0.2891774,"about_ca_system_score_codex":0.00003249539,"about_ca_system_score_gemma":0.000014263041,"threshold_uncertainty_score":0.53713506},"labels":[],"label_agreement":null},{"id":"W3122720315","doi":"10.3390/a14060169","title":"Sorting by Multi-Cut Rearrangements","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Deutscher Akademischer Austauschdienst; Providence Health Care","keywords":"Combinatorics; Parameterized complexity; String (physics); Multiset; Sorting; Permutation (music); Mathematics; Block (permutation group theory); Alphabet; Discrete mathematics; Algorithm; Physics","score_opus":0.01653608025971589,"score_gpt":0.2673613106534354,"score_spread":0.2508252303937195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122720315","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.8563374,0.018293362,0.10248299,0.0015267291,0.0023048997,0.0010640892,0.00028871527,0.00023499959,0.01746677],"genre_scores_gemma":[0.7124993,0.003074442,0.16528307,0.0031464202,0.002237494,0.0002630086,0.004735826,0.0003609178,0.1083995],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984765,0.00006409003,0.0002590993,0.0005481611,0.00022964847,0.00042252045],"domain_scores_gemma":[0.9991589,0.00000671347,0.00008622957,0.00047356967,0.00014731867,0.00012725717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018362825,0.00020255835,0.00017261706,0.000030088147,0.0001167213,0.00005198853,0.00020740421,0.00013872545,0.00016250112],"category_scores_gemma":[0.000081657054,0.00021871304,0.00011403793,0.00015439291,0.0000469462,0.0000056577214,0.00021464407,0.00010638619,0.00013590985],"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.000008824631,0.00023280733,0.002755881,0.000020200374,0.00019922295,0.000061361796,0.00007195386,0.000013289249,0.9402368,0.0000085429865,0.019124847,0.03726624],"study_design_scores_gemma":[0.0022434436,0.00015930692,0.0015230284,0.000021000858,0.000056385645,0.00008233418,0.00035082258,0.0009736693,0.65529007,0.000051018007,0.3386182,0.00063073507],"about_ca_topic_score_codex":0.000021025544,"about_ca_topic_score_gemma":0.000020355556,"teacher_disagreement_score":0.31949335,"about_ca_system_score_codex":0.000021263015,"about_ca_system_score_gemma":0.00006137412,"threshold_uncertainty_score":0.89188594},"labels":[],"label_agreement":null},{"id":"W3139108984","doi":"10.3390/a14030087","title":"Local Data Debiasing for Fairness Based on Generative Adversarial Training","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","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":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Debiasing; Adversarial system; Interpretability; Computer science; Machine learning; Generative grammar; Artificial intelligence; Process (computing); Data-driven","score_opus":0.24622703470118854,"score_gpt":0.4319499415195026,"score_spread":0.18572290681831408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139108984","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.0026908906,0.0001256111,0.9134175,0.0400162,0.0031696712,0.00049814244,0.00037817587,0.00013785607,0.039565943],"genre_scores_gemma":[0.9440385,0.00003247537,0.047380872,0.0048138294,0.002643261,0.000014884583,0.00030852,0.00002903818,0.0007386045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985014,0.00022595505,0.0001452443,0.00034366004,0.0004153234,0.00036840484],"domain_scores_gemma":[0.99833506,0.0008540581,0.00005674117,0.00027917855,0.0003250642,0.0001498956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013250319,0.00010073201,0.00017872815,0.000028765953,0.0010147367,0.00024949934,0.0003349714,0.00018111059,0.000071433955],"category_scores_gemma":[0.00215516,0.000105133346,0.00006861451,0.00019706118,0.00027124656,0.0003680566,0.000060607632,0.00019870793,0.0000062623208],"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.00011254103,0.00032593144,0.000058915473,0.000028872228,0.00015980561,0.00016422797,0.10913564,0.0020676113,0.00025313086,0.12702931,0.008911622,0.7517524],"study_design_scores_gemma":[0.004367138,0.000408744,0.00026006906,0.00021066937,0.00017437857,0.0000030140704,0.14956667,0.4711865,0.0025607806,0.06009308,0.30996963,0.0011993578],"about_ca_topic_score_codex":0.001022712,"about_ca_topic_score_gemma":0.002796624,"teacher_disagreement_score":0.9413476,"about_ca_system_score_codex":0.000099481906,"about_ca_system_score_gemma":0.0014166026,"threshold_uncertainty_score":0.7804637},"labels":[],"label_agreement":null},{"id":"W3160029165","doi":"10.3390/a14050152","title":"Predicting the Evolution of Syntenies—An Algorithmic Review","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gene; Gene duplication; Gene family; Generalization; Extant taxon; Biology; Similarity (geometry); Order (exchange); Tree (set theory); Phylogenetic tree; Genetics; Computational biology; Evolutionary biology; Genome; Computer science; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.010713509042368726,"score_gpt":0.2546116138955052,"score_spread":0.24389810485313645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160029165","genre_codex":"review","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.42980513,0.4824841,0.06947684,0.0041015614,0.0024694873,0.002561992,0.0003064114,0.0001721903,0.0086222915],"genre_scores_gemma":[0.9080466,0.045724127,0.03461503,0.0016836672,0.002819993,0.0003108408,0.0010906716,0.00018825078,0.005520811],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99849355,0.00017388805,0.00035375045,0.00040467997,0.00029196835,0.00028217403],"domain_scores_gemma":[0.99864537,0.000019462315,0.00015426139,0.00075968757,0.00034407206,0.000077153134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004932361,0.0001735403,0.00023082165,0.00002880199,0.0001119834,0.000017306678,0.00033244735,0.000101032434,0.0000677852],"category_scores_gemma":[0.0001810297,0.00013841559,0.00014946828,0.00027833646,0.00010062881,0.000008870571,0.0001871148,0.00012654795,0.000016046022],"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.000041798074,0.0006926986,0.0093350075,0.0015865377,0.00094545085,0.00008471055,0.0004441796,0.0001847795,0.77754647,0.00055563595,0.0071486076,0.20143415],"study_design_scores_gemma":[0.005730233,0.0035734763,0.040036798,0.004054596,0.0020356039,0.003014932,0.009575222,0.02717264,0.59125537,0.0021951038,0.30774215,0.0036138443],"about_ca_topic_score_codex":0.00007850927,"about_ca_topic_score_gemma":0.000027421514,"teacher_disagreement_score":0.47824147,"about_ca_system_score_codex":0.00004068407,"about_ca_system_score_gemma":0.0001968274,"threshold_uncertainty_score":0.5644424},"labels":[],"label_agreement":null},{"id":"W3164538928","doi":"10.3390/a14060159","title":"Circle-U-Net: An Efficient Architecture for Semantic Segmentation","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":17,"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":"Petroleum Technology Research Centre; National Natural Science Foundation of China - State Grid Corporation Joint Fund for Smart Grid; National Natural Science Foundation of China","keywords":"Net (polyhedron); Computer science; Intersection (aeronautics); Bottleneck; Segmentation; Context (archaeology); Architecture; Residual; Artificial intelligence; Pixel; Algorithm; Data mining; Mathematics; Cartography; Geometry; Embedded system; Geography","score_opus":0.01652831685320631,"score_gpt":0.28439586679994167,"score_spread":0.26786754994673534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164538928","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.008728349,0.00012439257,0.9885265,0.0017940359,0.00024469252,0.0003272504,0.000007784941,0.00016996772,0.000077006785],"genre_scores_gemma":[0.12803183,0.000011335838,0.8701988,0.0010592629,0.00022998564,0.00018817803,0.00006475948,0.000019013129,0.0001968292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989523,0.000035491787,0.00015006431,0.00045179605,0.00016934008,0.00024097374],"domain_scores_gemma":[0.99909663,0.00011179409,0.000057324974,0.0005420527,0.00010076418,0.00009142937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079100246,0.000097190736,0.00010310798,0.000038152917,0.00017406837,0.00007919481,0.00035218752,0.000035614667,0.0000046002774],"category_scores_gemma":[0.000016467264,0.000103994724,0.0000500372,0.00040323997,0.000023245406,0.0001323409,0.000094856085,0.000083340405,0.000020492496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029023086,0.00015636372,0.00001695705,0.000017302316,0.000015016453,0.000020010475,0.00059427804,0.089662135,0.011462746,0.008905202,0.0003299231,0.88881713],"study_design_scores_gemma":[0.0004915759,0.0000936772,0.00090668455,0.00001165621,0.00001239851,0.000107489475,0.00005152118,0.9483939,0.026875393,0.017440794,0.0053609163,0.0002539995],"about_ca_topic_score_codex":0.0000024800445,"about_ca_topic_score_gemma":0.000007101633,"teacher_disagreement_score":0.88856316,"about_ca_system_score_codex":0.000028600532,"about_ca_system_score_gemma":0.000041358155,"threshold_uncertainty_score":0.4240782},"labels":[],"label_agreement":null},{"id":"W3165188249","doi":"10.3390/a14060160","title":"Validation of Automated Chromosome Recovery in the Reconstruction of Ancestral Gene Order","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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 Saskatchewan; University of Ottawa","funders":"Joint Genome Institute; U.S. Department of Energy","keywords":"Phylogenetic tree; Genome; Ancestor; Biology; Extant taxon; Contig; Evolutionary biology; Phylogenetic network; Chromosome; Tree (set theory); Phylogenetics; Gene; Most recent common ancestor; Genetics; Combinatorics; Mathematics; Geography","score_opus":0.01343291730378296,"score_gpt":0.2481605847985338,"score_spread":0.23472766749475085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165188249","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.99837863,0.0009248995,0.00013307892,0.000053897158,0.00016799514,0.000061455794,0.000027038006,0.0000016656919,0.00025133113],"genre_scores_gemma":[0.9933273,0.00066202733,0.005824871,0.000025868885,0.00006836086,0.000006564415,0.00005369603,0.0000046049095,0.000026674825],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99951094,0.000049259477,0.00017737088,0.00012605084,0.000058772068,0.000077613004],"domain_scores_gemma":[0.999635,0.00001133538,0.000079732374,0.00015611101,0.00010971768,0.0000081449325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112621376,0.0000557321,0.0000999426,0.000017610653,0.000017335551,0.000003990128,0.000066822366,0.00005288704,0.0000068717213],"category_scores_gemma":[0.00003597145,0.00004636278,0.00003718419,0.00013626197,0.00004555405,8.561779e-7,0.000027145004,0.000026172578,4.7686046e-7],"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.000009020573,0.00003806351,0.0042913887,0.000011557006,0.000040600695,0.000001953566,0.000080779275,0.0005136132,0.9867737,0.00000903279,0.00004991745,0.00818037],"study_design_scores_gemma":[0.00025303342,0.000115172166,0.02272986,0.000008778132,0.000011726276,0.000052256113,0.00018410191,0.00025619456,0.9759378,0.00017005068,0.00022061785,0.000060404403],"about_ca_topic_score_codex":0.00002961094,"about_ca_topic_score_gemma":0.000013883418,"teacher_disagreement_score":0.018438471,"about_ca_system_score_codex":0.0000039387924,"about_ca_system_score_gemma":0.000058934846,"threshold_uncertainty_score":0.18906192},"labels":[],"label_agreement":null},{"id":"W3180552095","doi":"10.3390/a14070212","title":"Deep Learning Based Cardiac MRI Segmentation: Do We Need Experts?","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Cardiac Imaging and Diagnostics","field":"Medicine","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":"Université de Sherbrooke","funders":"","keywords":"Ground truth; Deep learning; Segmentation; Hausdorff distance; Artificial neural network; Generalization; Data set; Interpretability","score_opus":0.011841511059834208,"score_gpt":0.2759254271493967,"score_spread":0.2640839160895625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180552095","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.052827276,0.17474127,0.6228602,0.0623287,0.014542868,0.002037862,0.00007862668,0.0020986497,0.06848456],"genre_scores_gemma":[0.7964686,0.005566507,0.17022826,0.006748217,0.005653657,0.00025859277,0.0011297949,0.00025899417,0.01368736],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988629,0.00008655982,0.00018009573,0.00028530552,0.0003317583,0.00025334625],"domain_scores_gemma":[0.99902076,0.0002881498,0.00004175843,0.0002831562,0.00019891304,0.00016726206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013585419,0.00014647686,0.00030875366,0.00006874985,0.00010803081,0.00006553935,0.000035825495,0.00006912306,0.00032527716],"category_scores_gemma":[0.000283083,0.00014647447,0.00021629862,0.00027167366,0.000040478728,0.00006006454,0.000033882625,0.00019307742,0.000121301906],"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.00010872086,0.0005492207,0.23357779,0.00028128407,0.00071128894,0.0038028632,0.0049923663,0.0058958307,0.010289314,0.00013274299,0.058348894,0.6813097],"study_design_scores_gemma":[0.010681047,0.00049720565,0.03426609,0.0008706246,0.0014792214,0.00059968437,0.028657973,0.07511066,0.12075476,0.00016487326,0.7255014,0.0014164284],"about_ca_topic_score_codex":0.000025380898,"about_ca_topic_score_gemma":7.423772e-7,"teacher_disagreement_score":0.7436413,"about_ca_system_score_codex":0.00007454589,"about_ca_system_score_gemma":0.00013646983,"threshold_uncertainty_score":0.5973056},"labels":[],"label_agreement":null},{"id":"W3182197800","doi":"10.3390/a14070214","title":"Hybrid Artificial Intelligence HFS-RF-PSO Model for Construction Labor Productivity Prediction and Optimization","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"BIM and Construction Integration","field":"Engineering","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Random forest; Computer science; Feature selection; Selection (genetic algorithm); Artificial intelligence; Productivity; Mathematical optimization; Machine learning; Mathematics","score_opus":0.016254053047665435,"score_gpt":0.2224982946134684,"score_spread":0.20624424156580295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182197800","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.017936917,0.00019347135,0.9797551,0.00021491859,0.0011961494,0.00021723968,0.00012784885,0.00023561897,0.00012274677],"genre_scores_gemma":[0.51749355,0.00037675697,0.48065758,0.000032679447,0.00077710376,0.00017052688,0.00025398328,0.0000449871,0.00019284023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992983,0.000013004459,0.00021526097,0.00024185375,0.00009847739,0.00013312069],"domain_scores_gemma":[0.9995511,0.000020162497,0.00003318712,0.00012555481,0.00022623167,0.000043764787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008825868,0.00011420103,0.00011277579,0.000059032856,0.00011411262,0.000067072,0.000030178158,0.000070113536,0.000021551728],"category_scores_gemma":[0.000048495644,0.00012742491,0.000027201708,0.00014176627,0.000060978306,0.00032222972,0.00001006485,0.000100095815,0.000002357992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075934163,0.000013075769,0.000023104009,0.000028706518,0.000017526165,6.635904e-7,0.000084119536,0.57960325,0.0030556724,0.0048153833,0.000078563644,0.41227233],"study_design_scores_gemma":[0.000060712213,0.000018374589,0.000018427409,0.0000105645,0.000024096174,0.00009317407,0.000116904666,0.9080004,0.07855438,0.012765888,0.00022682731,0.00011025832],"about_ca_topic_score_codex":0.000003106088,"about_ca_topic_score_gemma":0.00000776959,"teacher_disagreement_score":0.49955663,"about_ca_system_score_codex":0.00004665449,"about_ca_system_score_gemma":0.00004337172,"threshold_uncertainty_score":0.5196237},"labels":[],"label_agreement":null},{"id":"W3193955682","doi":"10.3390/a14090254","title":"Prioritizing Construction Labor Productivity Improvement Strategies Using Fuzzy Multi-Criteria Decision Making and Fuzzy Cognitive Maps","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Cognitive Science and Mapping","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fuzzy cognitive map; Computer science; Productivity; Fuzzy logic; Selection (genetic algorithm); Operations research; Risk analysis (engineering); Management science; Fuzzy set; Artificial intelligence; Engineering; Business; Fuzzy number; Economics","score_opus":0.033637373755973254,"score_gpt":0.3210083553485911,"score_spread":0.28737098159261787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193955682","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.4140698,0.00035903847,0.5837909,0.00019467046,0.0008717085,0.00027065136,0.00002185071,0.00010009744,0.00032126042],"genre_scores_gemma":[0.6275563,0.000047248403,0.37205845,0.00013613244,0.00016088365,0.000011371389,0.0000039203014,0.000009059124,0.00001663924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788845,0.000100095196,0.00028895878,0.0009212867,0.0003650694,0.00043615798],"domain_scores_gemma":[0.998714,0.0001676258,0.00013878137,0.00027973708,0.0006046207,0.00009519226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051312655,0.00021991445,0.00024177879,0.00014793979,0.00047036397,0.0008880556,0.0002131185,0.0000689142,0.0000042003803],"category_scores_gemma":[0.0002488445,0.00022595117,0.000051445477,0.00073291466,0.00019142171,0.0021190129,0.00056811544,0.00018377588,0.0000057633847],"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.000008715754,0.000074892254,0.00050434173,0.00004065438,0.000026307009,0.00015472977,0.001300227,0.000004885177,0.08498827,0.0030532323,0.00000520021,0.90983856],"study_design_scores_gemma":[0.010613745,0.00119067,0.12783054,0.007503799,0.00034672066,0.006478617,0.07816372,0.36658555,0.17585088,0.21850123,0.0014883227,0.0054462156],"about_ca_topic_score_codex":0.00003875133,"about_ca_topic_score_gemma":0.000033592853,"teacher_disagreement_score":0.9043923,"about_ca_system_score_codex":0.00007454808,"about_ca_system_score_gemma":0.00032460265,"threshold_uncertainty_score":0.9214021},"labels":[],"label_agreement":null},{"id":"W3198815918","doi":"10.3390/a14090258","title":"A Novel Semi-Supervised Fuzzy C-Means Clustering Algorithm Using Multiple Fuzzification Coefficients","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Clustering Algorithms Research","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 Waterloo","funders":"National Foundation for Science and Technology Development","keywords":"Cluster analysis; Fuzzy clustering; Computer science; Artificial intelligence; Data mining; Pattern recognition (psychology); Fuzzy logic; Fuzzy set; Correlation clustering; Mathematics; Algorithm; Machine learning","score_opus":0.05065401274004585,"score_gpt":0.3084842384201754,"score_spread":0.2578302256801296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198815918","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.002140587,0.00031016732,0.99465126,0.00032931266,0.0012064886,0.0004034323,0.00005701091,0.0005075596,0.0003942022],"genre_scores_gemma":[0.024460338,0.000053538053,0.9739863,0.0002532777,0.00035158306,0.000057984067,0.000059720656,0.0000820246,0.00069523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954057,0.00016286282,0.000651175,0.0014344122,0.0011853878,0.0011604741],"domain_scores_gemma":[0.99670076,0.00029046476,0.00017590934,0.0016926539,0.0007370749,0.0004031372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005540406,0.0004496832,0.00047123837,0.0002993948,0.0005695595,0.0005303819,0.0015422213,0.00020705695,0.000024532226],"category_scores_gemma":[0.00027899977,0.00050118734,0.00018885954,0.0019340146,0.00012512889,0.0010884331,0.0015723538,0.000519705,0.00011886639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008477387,0.00047809273,0.00007442886,0.00006118785,0.000082373685,0.0003316407,0.0010860354,0.068848975,0.06861692,0.00015077993,0.000043922417,0.86021715],"study_design_scores_gemma":[0.0015048571,0.00005506271,0.00020874498,0.000087144566,0.000013567653,0.0006399539,0.00024413182,0.9853602,0.009431403,0.00017791812,0.0017105112,0.00056649075],"about_ca_topic_score_codex":0.00016182095,"about_ca_topic_score_gemma":0.00002489645,"teacher_disagreement_score":0.91651124,"about_ca_system_score_codex":0.0004333813,"about_ca_system_score_gemma":0.00036379957,"threshold_uncertainty_score":0.999744},"labels":[],"label_agreement":null},{"id":"W3202513398","doi":"10.3390/a14100286","title":"Enhanced Hyper-Cube Framework Ant Colony Optimization for Combinatorial Optimization Problems","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Multi-Objective Optimization 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":"École de Technologie Supérieure","funders":"","keywords":"Ant colony optimization algorithms; Mathematical optimization; Computer science; Domain (mathematical analysis); Heuristic; Optimization problem; Combinatorial optimization; Metaheuristic; Engineering design process; Discrete optimization; Set (abstract data type); Continuous optimization; Sequence (biology); Truss; Algorithm; Mathematics; Engineering; Multi-swarm optimization","score_opus":0.015335681380706772,"score_gpt":0.27116537417371767,"score_spread":0.2558296927930109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202513398","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.00006635335,0.0003022515,0.992705,0.00063803885,0.0041529844,0.0011537679,0.00003180916,0.0005315227,0.00041826986],"genre_scores_gemma":[0.005050231,0.00027950868,0.9926383,0.00045309332,0.0005068056,0.00042916127,0.00021163053,0.000076958444,0.00035432403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687344,0.00016107355,0.0006215223,0.0011550343,0.0005433877,0.00064556446],"domain_scores_gemma":[0.9964329,0.000481234,0.0003549872,0.00088643114,0.0016236337,0.00022081261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003242666,0.00040123425,0.0004825687,0.00013967215,0.00048682673,0.00038065633,0.0007294564,0.00032965798,0.00012795483],"category_scores_gemma":[0.00091208576,0.00044335963,0.00016738517,0.0014858847,0.00009334376,0.0012694068,0.00031156713,0.00029702802,0.000021358263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001650872,0.00028092935,0.000008764109,0.0000266302,0.000044178458,0.00001364065,0.0004364947,0.96907204,0.0002529345,0.011274057,0.00011648964,0.01845735],"study_design_scores_gemma":[0.0020253179,0.00020576833,0.000011076712,0.00006959896,0.00002163532,0.00004088108,0.000055704666,0.98066276,0.009362372,0.005842926,0.001156882,0.0005450673],"about_ca_topic_score_codex":0.00000795697,"about_ca_topic_score_gemma":0.0000018634288,"teacher_disagreement_score":0.017912282,"about_ca_system_score_codex":0.00027042194,"about_ca_system_score_gemma":0.00035276747,"threshold_uncertainty_score":0.9998018},"labels":[],"label_agreement":null},{"id":"W3203221575","doi":"10.3390/a14100289","title":"Comparing Commit Messages and Source Code Metrics for the Prediction Refactoring Activities","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Software Engineering Research","field":"Computer Science","cited_by":27,"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":"Code refactoring; Computer science; Commit; Java; Code smell; Metric (unit); Source code; Code (set theory); Class (philosophy); Software; Software metric; Data mining; Programming language; Machine learning; Artificial intelligence; Software quality; Software development; Set (abstract data type); Database","score_opus":0.05110975156882941,"score_gpt":0.2871362250593349,"score_spread":0.23602647349050548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203221575","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.0410041,0.0013478581,0.95640814,0.00037255275,0.00047159244,0.00011876123,0.000006675836,0.00023063463,0.000039694634],"genre_scores_gemma":[0.94892514,0.00016660868,0.05002451,0.0000299026,0.00017396097,0.000051430114,0.0000032569396,0.000016729684,0.00060845434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991021,0.000032481577,0.00010633256,0.00024469278,0.00027824406,0.00023614462],"domain_scores_gemma":[0.99649894,0.0029639953,0.000027320079,0.00037400977,0.00008007008,0.00005567082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003541296,0.000089930254,0.00012510607,0.00007819844,0.00024848388,0.00026878377,0.00036508343,0.00003960168,0.0000015533628],"category_scores_gemma":[0.00052810874,0.00007384183,0.000034400648,0.0004045573,0.00004547472,0.0002821161,0.00033931938,0.00018050769,0.0000011108136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017499304,0.00015929899,0.19037068,0.00033562066,0.0005674896,0.00006153985,0.00994052,0.015852083,0.002483765,0.0059965868,0.0044892207,0.7697257],"study_design_scores_gemma":[0.00041845182,0.000049162772,0.045441408,0.000034692435,0.00001772047,0.000054535296,0.000538176,0.9141279,0.012932846,0.00017516881,0.026040427,0.00016951775],"about_ca_topic_score_codex":0.000025574484,"about_ca_topic_score_gemma":0.0000060431234,"teacher_disagreement_score":0.9079211,"about_ca_system_score_codex":0.000051456707,"about_ca_system_score_gemma":0.000035649016,"threshold_uncertainty_score":0.30111825},"labels":[],"label_agreement":null},{"id":"W4200069408","doi":"10.3390/a15010012","title":"Optimization of Fiber-Reinforced Polymer Bars for Reinforced Concrete Column Using Nonlinear Finite Element Algorithms","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Structural Behavior of Reinforced Concrete","field":"Engineering","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":"Carleton University","funders":"","keywords":"Fibre-reinforced plastic; Materials science; Stiffness; Finite element method; Carbon fiber reinforced polymer; Structural engineering; Ductility (Earth science); Composite material; Reinforced concrete column; Ultimate tensile strength; Bilinear interpolation; Column (typography); Reinforced concrete; Computer science; Engineering; Creep","score_opus":0.01752607771072558,"score_gpt":0.2514952235889236,"score_spread":0.23396914587819803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200069408","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.07932368,0.00080550084,0.9143524,0.00005661594,0.0017692243,0.0014242416,0.0006802079,0.0006042797,0.0009838212],"genre_scores_gemma":[0.030567262,0.00020423482,0.95849323,0.00021528699,0.0006418793,0.00016318136,0.0017124277,0.00031672098,0.00768575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974851,0.00002752726,0.00094342703,0.00039509352,0.00047446307,0.0006743988],"domain_scores_gemma":[0.99829054,0.00021833157,0.00022151707,0.00057771435,0.0004822907,0.00020959323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016164882,0.00044675524,0.0006349208,0.00017871572,0.00013825821,0.00008454159,0.00029997982,0.00027443763,0.0007069696],"category_scores_gemma":[0.00010546885,0.00051345845,0.0003138571,0.00052170735,0.00009679809,0.0003931642,0.000102113714,0.00022575042,0.00001603173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026332089,2.1318374e-7,0.0000044799212,0.000107943975,0.00016692463,0.000021263646,0.00014578122,0.9461919,0.046580367,0.00009930849,0.00009866488,0.006556835],"study_design_scores_gemma":[0.0011918403,0.00007959236,0.000003994571,0.000059169302,0.000118853786,0.000033079843,0.00009028628,0.64084786,0.3564279,0.0000015265788,0.00076564134,0.00038025473],"about_ca_topic_score_codex":0.000084148385,"about_ca_topic_score_gemma":4.3530505e-7,"teacher_disagreement_score":0.30984753,"about_ca_system_score_codex":0.00017946723,"about_ca_system_score_gemma":0.00016583226,"threshold_uncertainty_score":0.9997317},"labels":[],"label_agreement":null},{"id":"W4200237354","doi":"10.3390/a15010005","title":"Deep Transfer Learning for Parkinson’s Disease Monitoring by Image-Based Representation of Resting-State EEG Using Directional Connectivity","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"University of British Columbia","funders":"","keywords":"Pattern recognition (psychology); Artificial intelligence; Computer science; Electroencephalography; Transfer of learning; Deep learning; Convolutional neural network; Psychology; Neuroscience","score_opus":0.04312599659452293,"score_gpt":0.31421859779050415,"score_spread":0.2710926011959812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200237354","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.66379744,0.00007956598,0.33538893,0.00010628064,0.00038569854,0.00012862703,0.000027956174,0.00005756585,0.000027973841],"genre_scores_gemma":[0.98696005,0.000012102818,0.01268914,0.000039481205,0.0001098596,0.000026208496,0.000011984156,0.000023059649,0.0001281196],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985759,0.00022363166,0.00023327889,0.0004800587,0.00025835598,0.00022874413],"domain_scores_gemma":[0.99852216,0.0010265982,0.00007329128,0.0001432773,0.00014386658,0.00009078331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015942931,0.00012876003,0.00017775656,0.00005604617,0.00022661807,0.000081305545,0.0001013374,0.00003054217,0.000012207686],"category_scores_gemma":[0.00079375284,0.00013733952,0.00011176858,0.00026232516,0.000075734584,0.00024184164,0.000027431675,0.00013845752,0.00000114006],"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.000095697564,0.0001241185,0.00839301,0.00005958859,0.00001113547,0.000035457953,0.00023855205,0.042085655,0.9363549,0.000006053052,0.000026152957,0.012569717],"study_design_scores_gemma":[0.000417131,0.000037163485,0.003000862,0.000049118593,0.000015558157,0.0000064297196,0.00004222177,0.314018,0.6819254,0.00010547537,0.0002749391,0.000107659864],"about_ca_topic_score_codex":0.0000623405,"about_ca_topic_score_gemma":0.0000026001921,"teacher_disagreement_score":0.32316262,"about_ca_system_score_codex":0.00004592805,"about_ca_system_score_gemma":0.00007816232,"threshold_uncertainty_score":0.5600543},"labels":[],"label_agreement":null},{"id":"W4200554845","doi":"10.3390/a14120362","title":"Faster Provable Sieving Algorithms for the Shortest Vector Problem and the Closest Vector Problem on Lattices in ℓp Norm","year":2021,"lang":"en","type":"article","venue":"Algorithms","topic":"Cryptography and Data Security","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":"Norm (philosophy); Mathematics; Algorithm; Lattice problem; Computer science; Combinatorics; Mathematical optimization; Discrete mathematics","score_opus":0.021799614808538828,"score_gpt":0.25792646635235533,"score_spread":0.23612685154381652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200554845","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.04317788,0.017618516,0.8487091,0.062462006,0.004110052,0.01480765,0.0006893454,0.0009742453,0.007451221],"genre_scores_gemma":[0.4896096,0.0010609735,0.5010348,0.0036008658,0.0014252071,0.002541506,0.00012766423,0.000121997335,0.0004773862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761474,0.0001567024,0.0004306409,0.0007988126,0.000405386,0.00059370743],"domain_scores_gemma":[0.99721104,0.0014528651,0.0001495988,0.0009256387,0.00016103184,0.00009980889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011371694,0.00030322516,0.00035476635,0.00009132674,0.0004597002,0.0007733697,0.001007348,0.00010528059,0.000013746904],"category_scores_gemma":[0.00010639045,0.00018061684,0.00014655909,0.00086613424,0.00022642876,0.00071403844,0.00047872055,0.00039764307,0.000011650408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022538546,0.0012286921,0.0035951056,0.0004539299,0.00039588,0.0001781357,0.01254016,0.00030572014,0.00050272094,0.5174238,0.0022364946,0.460914],"study_design_scores_gemma":[0.012772171,0.0014402871,0.028659485,0.0009409084,0.00030137374,0.00042686315,0.002020859,0.7163406,0.0049770763,0.08687275,0.14283077,0.0024168387],"about_ca_topic_score_codex":0.0002055308,"about_ca_topic_score_gemma":0.00052167894,"teacher_disagreement_score":0.7160349,"about_ca_system_score_codex":0.000036422363,"about_ca_system_score_gemma":0.00013459612,"threshold_uncertainty_score":0.74576217},"labels":[],"label_agreement":null},{"id":"W4212792388","doi":"10.3390/a15020065","title":"A New Algorithm Based on Colouring Arguments for Identifying Impossible Polyomino Tiling Problems","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Cellular Automata and Applications","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":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Diophantine equation; Polyomino; Parity (physics); Mathematics; MATLAB; Algorithm; Computer science; Discrete mathematics; Combinatorics; Geometry","score_opus":0.03184907674239302,"score_gpt":0.2825712594889295,"score_spread":0.2507221827465365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212792388","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.0010755467,0.0001152404,0.99623007,0.00062551646,0.0005077616,0.0007630624,0.000032047185,0.0002969375,0.00035379615],"genre_scores_gemma":[0.06479069,0.0000037798084,0.9301453,0.00065465225,0.0002257592,0.0010827448,0.000081647784,0.000046905214,0.002968503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823594,0.00003898383,0.00028051142,0.00057685236,0.0004388965,0.00042881595],"domain_scores_gemma":[0.99894994,0.0001208499,0.00013298653,0.0006153704,0.000035103472,0.00014574903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039117198,0.00016995675,0.00017267186,0.00018216984,0.0008132014,0.00027230865,0.00097608153,0.000034088425,0.00006817834],"category_scores_gemma":[0.000009323855,0.00018860148,0.00012883214,0.00055682234,0.000012267249,0.00023646055,0.000369839,0.00018183545,0.000032797798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011601648,0.00047353978,0.000120107165,0.000058857335,0.00006490089,0.00003912081,0.0011240289,0.015191463,0.0088249715,0.005024238,0.0052502006,0.963817],"study_design_scores_gemma":[0.0009234314,0.00016148083,0.00010159476,0.000017174993,0.000010291909,0.000018945846,0.00004130199,0.96948206,0.0064320713,0.0026387637,0.01994118,0.00023172669],"about_ca_topic_score_codex":0.00009975017,"about_ca_topic_score_gemma":0.000002059596,"teacher_disagreement_score":0.96358526,"about_ca_system_score_codex":0.00015117644,"about_ca_system_score_gemma":0.00019400468,"threshold_uncertainty_score":0.7690945},"labels":[],"label_agreement":null},{"id":"W4220839798","doi":"10.3390/a15040111","title":"A Variable Step Size Normalized Least-Mean-Square Algorithm Based on Data Reuse","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Algorithm; Robustness (evolution); Least mean squares filter; Computer science; Rate of convergence; A priori and a posteriori; Adaptive filter; Mathematics; Key (lock)","score_opus":0.02400114600795815,"score_gpt":0.25119629501369634,"score_spread":0.22719514900573817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220839798","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.0002243433,0.00019013359,0.98968685,0.00015171003,0.00079409644,0.0005757883,0.0022436269,0.0028935843,0.003239876],"genre_scores_gemma":[0.009207622,0.000020982907,0.9885444,0.00034598517,0.00022811892,0.00033007044,0.00054833165,0.00018542881,0.00058908056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777675,0.0001060799,0.0003552924,0.00062057684,0.0005726779,0.00056862127],"domain_scores_gemma":[0.99577236,0.00029169922,0.00007125198,0.0036748273,0.000055078457,0.00013478239],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045485614,0.0003698709,0.00036752073,0.00015278776,0.00026813435,0.000052086034,0.0024603275,0.00007925261,0.00094460783],"category_scores_gemma":[0.00022339032,0.00042171925,0.00006764792,0.00055794476,0.000043999553,0.00035018055,0.0016471935,0.00063954917,0.00004862177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023549427,0.0007469871,0.00007119863,0.0002535689,0.0003362151,0.0009224255,0.0005043425,0.5641528,0.007639099,0.0013023745,0.13403958,0.28979594],"study_design_scores_gemma":[0.00078074133,0.00021762477,0.000039003033,0.000038433725,0.0000216717,0.000027763337,0.00006871319,0.80198044,0.000982616,0.0008007194,0.19458579,0.00045649282],"about_ca_topic_score_codex":0.000077641576,"about_ca_topic_score_gemma":0.0000030277579,"teacher_disagreement_score":0.28933945,"about_ca_system_score_codex":0.00031670457,"about_ca_system_score_gemma":0.000057342255,"threshold_uncertainty_score":0.99996865},"labels":[],"label_agreement":null},{"id":"W4220974349","doi":"10.3390/a15030094","title":"Mechanical Fault Prognosis through Spectral Analysis of Vibration Signals","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Machine Fault Diagnosis Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Vibration; Acceleration; Fault (geology); SIGNAL (programming language); Displacement (psychology); Computer science; Cepstrum; Frequency domain; Integrator; Algorithm; Accelerometer; Acoustics; Fault detection and isolation; Fast Fourier transform; Spectrum analyzer; Control theory (sociology); Physics; Artificial intelligence; Computer vision; Telecommunications","score_opus":0.01469356736136031,"score_gpt":0.28109836591058446,"score_spread":0.26640479854922416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220974349","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.6093364,0.00060367543,0.3803864,0.0007127658,0.00048480046,0.0012237991,0.000539511,0.0025929518,0.0041197166],"genre_scores_gemma":[0.9636467,0.00004424159,0.03568828,0.00008298131,0.000050136434,0.00032134686,0.000121059,0.000031366966,0.00001388742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878585,0.00006466437,0.00035027487,0.00021346608,0.00037343052,0.00021231169],"domain_scores_gemma":[0.9995313,0.00008851184,0.00006275514,0.00024533216,0.000033049062,0.000039016228],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002189235,0.0001476525,0.00034967935,0.00024567067,0.00007163958,0.000017846387,0.00024696012,0.000051192103,0.0010766297],"category_scores_gemma":[0.000022402124,0.00015917579,0.0002146736,0.0013401984,0.000017530623,0.00014381316,0.000086070024,0.0002107937,0.0000042230226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003845877,0.0014964094,0.007449299,0.0001909158,0.008378541,0.000105716885,0.0033132578,0.70799136,0.17099029,0.01252597,0.033027545,0.05449225],"study_design_scores_gemma":[0.00017012129,0.00018845437,0.0015440701,0.0000058771902,0.00059821544,0.0000051124252,0.000102997794,0.76441705,0.22861427,0.0014543005,0.0026209448,0.0002785754],"about_ca_topic_score_codex":0.000107572596,"about_ca_topic_score_gemma":0.000029148836,"teacher_disagreement_score":0.35431033,"about_ca_system_score_codex":0.00008923879,"about_ca_system_score_gemma":0.000010623597,"threshold_uncertainty_score":0.9998365},"labels":[],"label_agreement":null},{"id":"W4221068686","doi":"10.3390/a15040102","title":"Dynamic Line Scan Thermography Parameter Design via Gaussian Process Emulation","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Multi-Objective Optimization 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":"Université Laval","funders":"Vlaamse regering; Universiteit Antwerpen; Fonds Wetenschappelijk Onderzoek","keywords":"Emulation; Computer science; Gaussian process; Surrogate model; Process (computing); Set (abstract data type); Thermography; Gaussian; Machine learning; Artificial intelligence; Simulation","score_opus":0.016238384567365757,"score_gpt":0.27751105129380016,"score_spread":0.2612726667264344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221068686","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.000613879,0.00015152025,0.99685633,0.00047450382,0.00055787957,0.0006874021,0.000013535622,0.00046501073,0.00017996428],"genre_scores_gemma":[0.33003452,0.000010178446,0.6689861,0.00034323125,0.00003965914,0.00029820128,0.00003374014,0.000042988566,0.0002113901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974408,0.00027776093,0.00036854733,0.000793865,0.0006465583,0.0004724689],"domain_scores_gemma":[0.99853504,0.00019711166,0.00024879907,0.0006894702,0.00018391557,0.00014569116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039260855,0.00028985977,0.0002588617,0.00039389447,0.000611149,0.00012406394,0.0010174636,0.000060554714,0.00011684857],"category_scores_gemma":[0.000049085393,0.0002952393,0.00011678991,0.0018591125,0.00007809086,0.0007819309,0.00031763467,0.0003487518,0.000024000692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021320133,0.0002588,0.00013202094,0.000008263161,0.00005560458,0.000051027248,0.0012373931,0.7000604,0.00035611412,0.00032103484,0.00003108421,0.2974669],"study_design_scores_gemma":[0.0006052292,0.00026096954,0.0010586804,0.0000054829115,0.000011526824,0.00008322216,0.00006968335,0.9892243,0.0005398189,0.0075716386,0.00018152867,0.00038788596],"about_ca_topic_score_codex":0.000020492917,"about_ca_topic_score_gemma":0.0000029463051,"teacher_disagreement_score":0.32942066,"about_ca_system_score_codex":0.00020103475,"about_ca_system_score_gemma":0.000101332815,"threshold_uncertainty_score":0.99995},"labels":[],"label_agreement":null},{"id":"W4280520414","doi":"10.3390/a15050164","title":"A Parallelizable Integer Linear Programming Approach for Tiling Finite Regions of the Plane with Polyominoes","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Image Processing and 3D Reconstruction","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 Guelph","funders":"","keywords":"Parallelizable manifold; Polyomino; Integer programming; Integer (computer science); Speedup; Mathematics; Computer science; Time complexity; Combinatorics; Algorithm; Parallel computing; Regular polygon; Geometry","score_opus":0.018432779344705667,"score_gpt":0.2298843537926756,"score_spread":0.21145157444796994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280520414","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.001236776,0.00016979518,0.99756247,0.0002789405,0.00018345009,0.00024971034,0.000005420456,0.000065537526,0.0002479203],"genre_scores_gemma":[0.15913619,0.0000026167854,0.8394849,0.000072482035,0.000071939576,0.00017805345,0.000011246987,0.000011001899,0.001031589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992268,0.000037878923,0.00014262235,0.00022728043,0.00017927079,0.0001861466],"domain_scores_gemma":[0.99945885,0.00005944582,0.00012579156,0.00026899073,0.00006266309,0.0000242679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021541596,0.00008258473,0.00011463656,0.00005409867,0.0004333548,0.000048413272,0.00046391596,0.00002113358,0.0000020726113],"category_scores_gemma":[0.00001934196,0.000054018386,0.000053776912,0.00035961362,0.000074277705,0.00014087044,0.00015928854,0.00015473636,3.1616528e-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.00011749424,0.000550834,0.0014159885,0.00030849653,0.0001730788,0.000011465869,0.0079085855,0.054597296,0.00043294457,0.007225967,0.00085574714,0.9264021],"study_design_scores_gemma":[0.00042576293,0.00016650447,0.000016085618,0.00002164997,0.00001707333,0.00023067628,0.0007022122,0.9881146,0.002209397,0.0005613206,0.0074012014,0.00013350052],"about_ca_topic_score_codex":0.000033577664,"about_ca_topic_score_gemma":0.0000014223433,"teacher_disagreement_score":0.93351734,"about_ca_system_score_codex":0.000016894553,"about_ca_system_score_gemma":0.00012131467,"threshold_uncertainty_score":0.33330587},"labels":[],"label_agreement":null},{"id":"W4281483746","doi":"10.3390/a15060180","title":"Data Preprocessing Method and API for Mining Processes from Cloud-Based Application Event Logs","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"Cloud computing; Computer science; Scripting language; Executable; Event (particle physics); Data mining; Exploit; Process mining; Preprocessor; Process (computing); Work in process; Operating system; Artificial intelligence; Business process","score_opus":0.05457402353891096,"score_gpt":0.31146508826732994,"score_spread":0.256891064728419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281483746","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.01373692,0.0012635137,0.9828395,0.0013309635,0.00015064905,0.00029084878,0.00013715879,0.00017266556,0.000077736],"genre_scores_gemma":[0.9064902,0.0000132665145,0.08605185,0.0017909941,0.0016136686,0.0005728339,0.0033100524,0.000067075634,0.00009003895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834216,0.000013483101,0.00031000754,0.00079297693,0.0003019849,0.00023936147],"domain_scores_gemma":[0.9987379,0.0001606619,0.00033725557,0.0004884465,0.00026122498,0.000014549541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008052936,0.00018653696,0.00026290506,0.00016882805,0.0007164416,0.00030202288,0.00055951765,0.000043287066,0.00004132666],"category_scores_gemma":[0.0002103639,0.00018734486,0.000039842686,0.0007422882,0.000028963903,0.0007690295,0.0005134601,0.00010858688,0.000004095994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015981215,0.00043593245,0.0051143332,0.0022194136,0.00020446791,0.00000614968,0.00027296305,0.07037865,0.000642378,0.000277824,0.0026445494,0.91764355],"study_design_scores_gemma":[0.0005355367,0.0000063090456,0.00008490712,0.00003809811,0.0002757233,0.0000011910196,0.00042683017,0.9490966,0.00006297539,0.005503127,0.04371003,0.00025867438],"about_ca_topic_score_codex":0.00068416906,"about_ca_topic_score_gemma":0.000047880556,"teacher_disagreement_score":0.91738486,"about_ca_system_score_codex":0.000021751139,"about_ca_system_score_gemma":0.00008760117,"threshold_uncertainty_score":0.76397014},"labels":[],"label_agreement":null},{"id":"W4281486186","doi":"10.3390/a15060178","title":"A Data-Driven Fault Tree for a Time Causality Analysis in an Aging System","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Fault Detection and Control Systems","field":"Engineering","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":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fault tree analysis; Causality (physics); Computer science; Fault (geology); Set (abstract data type); Tree (set theory); Data mining; Turbofan; Root cause; Fault detection and isolation; Artificial intelligence; Reliability engineering; Mathematics; Engineering","score_opus":0.020850859171847997,"score_gpt":0.26561396773910234,"score_spread":0.24476310856725433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281486186","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.7245767,0.0013334821,0.25153834,0.00034373024,0.0033724227,0.0035320767,0.0069972323,0.0043333387,0.003972678],"genre_scores_gemma":[0.9982089,9.3789504e-7,0.0006788077,0.00001997344,0.00013080503,0.0003198475,0.00039323684,0.00002851116,0.00021900085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988355,0.00010873386,0.00030413634,0.00030834822,0.0001999365,0.00024335076],"domain_scores_gemma":[0.9992303,0.000050242375,0.000040735948,0.0005891604,0.000021001088,0.00006851002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000496914,0.00012571222,0.0003356024,0.00026524207,0.0001146865,0.00005012879,0.00035968563,0.000036816367,0.00004066942],"category_scores_gemma":[0.000008529796,0.0001378692,0.00008763105,0.0007281175,0.000006989276,0.00016604642,0.00007589777,0.00013816585,0.000015947244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033843786,0.00008837924,0.0014049142,0.00017565246,0.0011843872,0.000080713624,0.001011583,0.9517467,0.0024822277,0.00006731681,0.0011722354,0.040552024],"study_design_scores_gemma":[0.0005601161,0.000037616544,0.0005847632,0.0000053691415,0.00013960725,0.000012040629,0.0008171946,0.98950315,0.000017645938,0.000003084711,0.008158064,0.00016133752],"about_ca_topic_score_codex":0.0003823131,"about_ca_topic_score_gemma":0.0008673003,"teacher_disagreement_score":0.27363217,"about_ca_system_score_codex":0.00024475312,"about_ca_system_score_gemma":0.000013647437,"threshold_uncertainty_score":0.56221426},"labels":[],"label_agreement":null},{"id":"W4281818989","doi":"10.3390/a15060196","title":"Process Mining the Performance of a Real-Time Healthcare 4.0 Systems Using Conditional Survival Models","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"Ontario Tech University","funders":"Directorate for Biological Sciences; Queen's University; Queen's University Belfast","keywords":"Robustness (evolution); Health care; Computer science; Process (computing); Healthcare system; Intensive care; Risk analysis (engineering); Medicine; Intensive care medicine","score_opus":0.04302586941610657,"score_gpt":0.2621128415100697,"score_spread":0.21908697209396313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281818989","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.9951257,0.00032743518,0.0025555757,0.00055383175,0.00034073138,0.00019898996,0.00003516668,0.000102241545,0.00076033245],"genre_scores_gemma":[0.99867034,0.000016351949,0.00016526433,0.00017624049,0.00059969415,0.00007123329,0.00013088356,0.00003303594,0.0001369408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829733,0.00002981252,0.00040133393,0.0002874638,0.00069851684,0.00028552464],"domain_scores_gemma":[0.99882966,0.000041613428,0.00041786398,0.00022438164,0.00047462538,0.0000118676335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072097545,0.00016845898,0.0003180989,0.00020469264,0.0008754834,0.00010724975,0.00038577622,0.000036489982,0.00007237001],"category_scores_gemma":[0.0000137711095,0.00013718849,0.00008506563,0.0009789274,0.0000658024,0.0007464213,0.00018707602,0.00016314583,0.0000075995367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027451206,0.00006494189,0.002540063,0.00056170585,0.00006858167,0.000005113523,0.00022168057,0.9937208,0.00013046342,0.0016555332,0.00008995807,0.0009136906],"study_design_scores_gemma":[0.00021594012,0.000009863542,0.00012689648,0.000057915615,0.00008915466,0.000010726144,0.001893907,0.99666053,0.0000078305175,0.0006130153,0.00014064628,0.00017355916],"about_ca_topic_score_codex":0.0025064263,"about_ca_topic_score_gemma":0.0000052978976,"teacher_disagreement_score":0.00354466,"about_ca_system_score_codex":0.000043743832,"about_ca_system_score_gemma":0.000104693805,"threshold_uncertainty_score":0.67335993},"labels":[],"label_agreement":null},{"id":"W4282821942","doi":"10.3390/a15060206","title":"Correction: Filion, G.J. Analytic Combinatorics for Computing Seeding Probabilities. Algorithms 2018, 11, 3","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Data Management 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":"Seeding; Computer science; Algorithm; Combinatorics; Mathematics; Physics","score_opus":0.024576397843192536,"score_gpt":0.2545848241560057,"score_spread":0.23000842631281315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282821942","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.0006628363,0.00024044186,0.9773709,0.0015481119,0.016375886,0.0011546465,0.00009274148,0.00080872246,0.0017456922],"genre_scores_gemma":[0.17620312,0.00011191363,0.71875536,0.00379105,0.004593069,0.0018464507,0.0014774882,0.00036647578,0.09285507],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620384,0.00013889068,0.00066600944,0.0011610676,0.0009348126,0.0008953567],"domain_scores_gemma":[0.99772567,0.00046214001,0.00032497253,0.0010501281,0.00023884316,0.00019822901],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016086792,0.0003965403,0.00047419645,0.00043035945,0.0016176573,0.0005741974,0.0022030727,0.000071043054,0.00009110286],"category_scores_gemma":[0.00013359248,0.00043724326,0.00025156152,0.0019319132,0.000090302776,0.0011566384,0.0020438877,0.0004025138,0.000032609976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002206141,0.0009683323,0.0013063918,0.00019063396,0.0002931763,0.00013897823,0.0022409684,0.010685879,0.000032246448,0.0654892,0.56438607,0.35424602],"study_design_scores_gemma":[0.0008899694,0.0003232918,0.00019167179,0.0000172857,0.000036089277,0.00007543017,0.0006192434,0.83187056,0.00005465917,0.0059260214,0.15948807,0.000507726],"about_ca_topic_score_codex":0.00011900903,"about_ca_topic_score_gemma":0.0000051964957,"teacher_disagreement_score":0.8211847,"about_ca_system_score_codex":0.00044037533,"about_ca_system_score_gemma":0.00013801709,"threshold_uncertainty_score":0.99980795},"labels":[],"label_agreement":null},{"id":"W4285395502","doi":"10.3390/a15070246","title":"A Two-Stage Multi-Objective Genetic Algorithm for a Flexible Job Shop Scheduling Problem with Lot Streaming","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Guelph","funders":"","keywords":"Job shop scheduling; Computer science; Mathematical optimization; Genetic algorithm; Flow shop scheduling; Scheduling (production processes); Algorithm; Mathematics; Schedule","score_opus":0.01700707728161659,"score_gpt":0.25110872562482583,"score_spread":0.23410164834320923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285395502","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.00637186,0.00083953136,0.9886174,0.00003271495,0.0007306163,0.0011949376,0.00026316041,0.0013805551,0.0005692167],"genre_scores_gemma":[0.010893306,0.00003478788,0.9847935,0.00008955058,0.00031071831,0.0013654146,0.00012216163,0.00023855148,0.0021520115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997478,0.00006610483,0.00047681056,0.0006704646,0.00049844454,0.0008101698],"domain_scores_gemma":[0.9989022,0.00014569082,0.00011476818,0.00042641902,0.0001920824,0.00021882239],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035443337,0.00047526212,0.00044932176,0.00033410822,0.00065832556,0.00014604315,0.0003950542,0.000090492984,0.0001539792],"category_scores_gemma":[0.000022163138,0.0004945451,0.00014827342,0.0008657598,0.00006861722,0.00022168046,0.00013756535,0.00053498265,0.000018261853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000206504,0.000101561134,0.00014927333,0.00005276549,0.00019679841,0.000044877495,0.00090137473,0.91088074,0.00013082832,0.000072497096,0.00003464323,0.08741398],"study_design_scores_gemma":[0.0033512695,0.00032817948,0.00007512044,0.000040226038,0.00008101929,0.000105472405,0.0034765785,0.98973835,0.001206891,0.00005732447,0.0008408059,0.00069874787],"about_ca_topic_score_codex":0.000104334926,"about_ca_topic_score_gemma":0.000020340733,"teacher_disagreement_score":0.08671523,"about_ca_system_score_codex":0.00033046992,"about_ca_system_score_gemma":0.0001403548,"threshold_uncertainty_score":0.9997506},"labels":[],"label_agreement":null},{"id":"W4288038597","doi":"10.3390/a15080259","title":"Multifractal Characterization and Modeling of Blood Pressure Signals","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","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":"Toronto Metropolitan University","funders":"","keywords":"Multifractal system; Detrended fluctuation analysis; Statistical physics; Fractal; Multiplicative function; SIGNAL (programming language); Mathematics; Range (aeronautics); Scaling; Stability (learning theory); Statistics; Mathematical analysis; Computer science; Physics; Materials science","score_opus":0.02789182837232058,"score_gpt":0.20697190039930463,"score_spread":0.17908007202698406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288038597","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.96703273,0.0049947584,0.025758341,0.00022610146,0.00018618756,0.00020975208,0.0006575823,0.000028462688,0.00090609293],"genre_scores_gemma":[0.99861616,0.000048091333,0.0003803257,0.00002139425,0.00004978297,0.00002006239,0.00005918256,0.0000114920695,0.00079350744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927217,0.000012435641,0.00036737058,0.00020750261,0.000036817277,0.00010368288],"domain_scores_gemma":[0.99957055,0.000012452217,0.00022422665,0.0001432943,0.00002058677,0.00002889386],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021801317,0.00006885344,0.0002706551,0.00011590866,0.0001257156,0.00002207645,0.000086042935,0.000021236776,0.00092450983],"category_scores_gemma":[0.000011092971,0.00008475652,0.00006111247,0.00016401567,0.000012163248,0.00010784061,0.000104658495,0.00006484749,0.0000062802706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025543285,0.003586435,0.12492928,0.0014806789,0.01037358,0.00010714641,0.023499755,0.3675955,0.06935003,0.24477212,0.00047617216,0.15357387],"study_design_scores_gemma":[0.0002758,0.00005992345,0.0007048031,0.000003076834,0.000058078916,0.000009505828,0.00014548081,0.9885681,0.00006600271,0.0009244379,0.009062032,0.00012271694],"about_ca_topic_score_codex":0.00057276775,"about_ca_topic_score_gemma":0.000004623633,"teacher_disagreement_score":0.62097263,"about_ca_system_score_codex":0.000004601978,"about_ca_system_score_gemma":0.000004562146,"threshold_uncertainty_score":0.9999888},"labels":[],"label_agreement":null},{"id":"W4289101974","doi":"10.3390/a15080267","title":"Short Text Classification with Tolerance-Based Soft Computing Method","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Sentiment Analysis and Opinion Mining","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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; University of Winnipeg","keywords":"Computer science; Artificial intelligence; Categorization; Pattern recognition (psychology); Support vector machine; Precision and recall; F1 score; Data mining; Machine learning","score_opus":0.03455356625980585,"score_gpt":0.29744387198076366,"score_spread":0.26289030572095784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289101974","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.005695333,0.000092079405,0.9924815,0.0007058874,0.0002645205,0.00008494058,0.0000026821917,0.00012162302,0.00055143033],"genre_scores_gemma":[0.51629275,7.828306e-7,0.48299173,0.00046708857,0.00009086438,0.000017416281,0.00003206682,0.000008454236,0.000098851095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852276,0.00013979455,0.00020728563,0.00045233843,0.0004742529,0.00020358284],"domain_scores_gemma":[0.9992134,0.00015854918,0.000095152136,0.00042479867,0.000053069372,0.00005505886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046172933,0.00011292771,0.00016828308,0.0001085968,0.00040454316,0.0001327779,0.0005880762,0.000018514582,0.00008488435],"category_scores_gemma":[0.000004797037,0.00010236473,0.000067940615,0.0006752973,0.000017020047,0.0001535137,0.00016743636,0.00015138443,0.000015195657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000841944,0.00010822559,0.006852336,0.0000026800265,0.00006164391,0.000020066345,0.0006254,0.05070972,0.00050303823,0.0018345425,0.00070068415,0.93857324],"study_design_scores_gemma":[0.00022871485,0.000057640693,0.0073230355,0.000006292094,0.000013796793,0.0000053295166,0.00018672612,0.9854428,0.00055451377,0.00007042059,0.005955006,0.00015568323],"about_ca_topic_score_codex":0.000039999202,"about_ca_topic_score_gemma":0.000001629836,"teacher_disagreement_score":0.93841755,"about_ca_system_score_codex":0.000060442315,"about_ca_system_score_gemma":0.000053800668,"threshold_uncertainty_score":0.41743124},"labels":[],"label_agreement":null},{"id":"W4289704826","doi":"10.3390/a15080271","title":"Optimal Motorcycle Engine Mount Design Parameter Identification Using Robust Optimization Algorithms","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Vehicle Noise and Vibration Control","field":"Engineering","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":"","keywords":"Powertrain; Vibration; Sequential quadratic programming; Computer science; Frame (networking); Automotive engineering; Stiffness; Engineering; Control theory (sociology); Quadratic programming; Structural engineering; Mathematical optimization; Mechanical engineering; Torque; Mathematics; Artificial intelligence","score_opus":0.030203757386195386,"score_gpt":0.2310018178750036,"score_spread":0.20079806048880822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289704826","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.026043016,0.0002721856,0.9718556,0.00005702222,0.00079374196,0.0004655798,0.00004745992,0.00042481534,0.00004060759],"genre_scores_gemma":[0.5431522,0.000041250023,0.45556805,0.00010255383,0.00040873996,0.00032033163,0.00015996832,0.00011636704,0.00013049753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984667,0.00010850903,0.00040666328,0.0003068687,0.00037300293,0.00033826835],"domain_scores_gemma":[0.9993583,0.00008600095,0.00007708868,0.00031183168,0.00007242474,0.000094377705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039261588,0.00021594639,0.0002113012,0.00018946659,0.000333043,0.0001326914,0.00022504647,0.000072924166,0.00042662225],"category_scores_gemma":[0.000024788955,0.00025665914,0.00008370936,0.00041478957,0.000020982092,0.0004552161,0.00005985654,0.00025041396,0.000024683328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094505,0.000039451257,0.000009494652,0.000008155665,0.000054481232,0.000010659212,0.00014767506,0.9848616,0.0050508357,0.000014377626,0.00022776739,0.009566012],"study_design_scores_gemma":[0.0005376617,0.000054595777,0.00008120978,0.0000041352155,0.000046161353,0.000035161727,0.000106772946,0.99370867,0.0045386846,0.00002340105,0.00057076325,0.00029278192],"about_ca_topic_score_codex":0.000029764456,"about_ca_topic_score_gemma":3.0304628e-7,"teacher_disagreement_score":0.5171092,"about_ca_system_score_codex":0.0003505893,"about_ca_system_score_gemma":0.00003585775,"threshold_uncertainty_score":0.99998856},"labels":[],"label_agreement":null},{"id":"W4290466112","doi":"10.3390/a15080279","title":"High-Fidelity Surrogate Based Multi-Objective Optimization Algorithm","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Multi-Objective Optimization 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 Victoria","funders":"","keywords":"Pareto principle; Surrogate model; Mathematical optimization; Multi-objective optimization; Engineering design process; Benchmark (surveying); Computer science; Weighting; Evolutionary algorithm; Algorithm; Optimization problem; Mathematics; Engineering","score_opus":0.016092029970673504,"score_gpt":0.2590570821470061,"score_spread":0.24296505217633263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290466112","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.0000668104,0.00014731342,0.9948519,0.00053172343,0.0021154364,0.0008787324,0.00018891715,0.001040486,0.00017866454],"genre_scores_gemma":[0.009486853,0.000021171016,0.9878802,0.0011377651,0.00014180536,0.00041611513,0.00021478666,0.00008466887,0.0006166521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99516183,0.00065653486,0.0007088317,0.0014981595,0.0011360003,0.0008386627],"domain_scores_gemma":[0.9969772,0.00030016145,0.00046892193,0.001288742,0.0006657777,0.0002991999],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00094211934,0.00052951265,0.0005358066,0.0005107572,0.0013065285,0.00021925863,0.0016695762,0.00011746756,0.00041529664],"category_scores_gemma":[0.00018026544,0.000604451,0.00021789277,0.002333947,0.00014402834,0.0013058424,0.0011072828,0.0006999238,0.00006745919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011588274,0.00042778096,0.00004897513,0.000004860566,0.000044366465,0.00010385173,0.0002909625,0.9235477,0.00003897782,0.0006533299,0.00013547322,0.07469215],"study_design_scores_gemma":[0.0027397254,0.0002307758,0.000491447,0.0000071829436,0.000019142566,0.00006676509,0.00014593339,0.99300325,0.0009885894,0.0004893606,0.0011188677,0.0006989606],"about_ca_topic_score_codex":0.00033573576,"about_ca_topic_score_gemma":0.000010241459,"teacher_disagreement_score":0.07399319,"about_ca_system_score_codex":0.00084407756,"about_ca_system_score_gemma":0.0003848512,"threshold_uncertainty_score":0.9999936},"labels":[],"label_agreement":null},{"id":"W4291414590","doi":"10.3390/a15080283","title":"Adversarial Training Methods for Deep Learning: A Systematic Review","year":2022,"lang":"en","type":"review","venue":"Algorithms","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":111,"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":"Adversarial system; Computer science; Artificial intelligence; Overfitting; Machine learning; Deep learning; Artificial neural network","score_opus":0.10578144414399059,"score_gpt":0.43023792526573557,"score_spread":0.32445648112174497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291414590","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":[5.9620205e-11,0.5024111,0.49297267,0.000027992828,0.0014282832,0.002620981,0.0000031300488,0.00027621264,0.00025956883],"genre_scores_gemma":[3.2292393e-9,0.5883238,0.40830222,0.0001248708,0.00031332715,0.002312482,0.00007908642,0.000095076735,0.00044916687],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9902001,0.0049651666,0.0018696495,0.0014314959,0.0006716674,0.00086191535],"domain_scores_gemma":[0.9895979,0.0065515516,0.0020211092,0.0015179678,0.000101229656,0.00021021497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008007681,0.00090824143,0.005843192,0.00038844137,0.00072897546,0.0002349368,0.004061373,0.00033323743,0.00016545516],"category_scores_gemma":[0.007699854,0.0007861341,0.0018519025,0.0014751329,0.000056083813,0.00040646578,0.0014014819,0.0019616252,0.000052495987],"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":[4.403478e-7,0.000009703628,3.0330358e-9,0.40286654,0.00021513982,0.00001880289,0.00024142288,0.00007226197,3.4586507e-9,0.0011272178,0.000033815937,0.59541464],"study_design_scores_gemma":[0.00019691355,0.00010836021,2.319502e-9,0.1610344,0.0026669158,0.00030088003,0.000047158825,0.057805605,1.2452387e-8,0.00021607552,0.7769479,0.0006757322],"about_ca_topic_score_codex":0.0000080074415,"about_ca_topic_score_gemma":3.3017614e-7,"teacher_disagreement_score":0.7769141,"about_ca_system_score_codex":0.00045160076,"about_ca_system_score_gemma":0.0006053746,"threshold_uncertainty_score":0.99945897},"labels":[],"label_agreement":null},{"id":"W4292259045","doi":"10.3390/a15080291","title":"Social Media Hate Speech Detection Using Explainable Artificial Intelligence (XAI)","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Computer science; Artificial intelligence; Categorical variable; Naive Bayes classifier; Machine learning; Preprocessor; Artificial neural network; Random forest; Decision tree; Support vector machine","score_opus":0.05529092021416768,"score_gpt":0.3014220145942617,"score_spread":0.24613109438009403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292259045","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.023491412,0.000034384397,0.9732646,0.00031378167,0.002254765,0.00013155735,0.000002178361,0.00026169984,0.00024564736],"genre_scores_gemma":[0.881059,0.0000016436704,0.11794677,0.000088618464,0.00078873144,0.000027315471,0.000004272274,0.000024473617,0.00005921574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782145,0.00027042025,0.00030360708,0.000503975,0.0006471096,0.00045346314],"domain_scores_gemma":[0.999196,0.00018129118,0.00017068995,0.00031153107,0.00007160076,0.00006887127],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008432704,0.00017159645,0.00019408591,0.0001973165,0.0015411853,0.00017289059,0.00094550225,0.0000604774,0.0001292694],"category_scores_gemma":[0.00016019322,0.0002024762,0.00008669062,0.0009994087,0.00006416506,0.0005538492,0.0010364403,0.0005903126,0.000037671438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016191814,0.00006305224,0.000019892766,0.000007752702,0.000018644014,0.00021529675,0.004596856,0.09384675,0.0013033125,0.0140159875,0.00002408444,0.8858722],"study_design_scores_gemma":[0.00007025424,0.000048089278,0.00004259697,0.0000034630696,0.0000101321375,0.00012510232,0.0010449315,0.9647282,0.005877183,0.026929598,0.00085578224,0.00026466622],"about_ca_topic_score_codex":0.00017970189,"about_ca_topic_score_gemma":0.000019563284,"teacher_disagreement_score":0.8856075,"about_ca_system_score_codex":0.00030588498,"about_ca_system_score_gemma":0.00008539258,"threshold_uncertainty_score":0.99975866},"labels":[],"label_agreement":null},{"id":"W4293420779","doi":"10.3390/a15090308","title":"Early Prediction of Chronic Kidney Disease: A Comprehensive Performance Analysis of Deep Learning Models","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Artificial Intelligence in Healthcare","field":"Health Professions","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 Saskatchewan; Lakehead University","funders":"","keywords":"Kidney disease; Computer science; Survivability; Artificial intelligence; Artificial neural network; Predictive modelling; Machine learning; Binary classification; Deep learning; F1 score; Medicine; Internal medicine; Support vector machine","score_opus":0.10569034216189938,"score_gpt":0.38954651189370393,"score_spread":0.28385616973180455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293420779","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.988924,0.0010595348,0.007667981,0.00019725862,0.0006120446,0.0006816203,0.00044754555,0.00008251276,0.000327496],"genre_scores_gemma":[0.998494,0.00022769476,0.00024117381,0.00012370032,0.00012616371,0.00025305827,0.00022071067,0.00002323295,0.00029025352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973103,0.0006362861,0.0008299805,0.00029046054,0.00054376543,0.0003892407],"domain_scores_gemma":[0.99810994,0.00032403262,0.00051576894,0.0003629497,0.00046571967,0.00022161366],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041155898,0.00012642413,0.00042612743,0.00038990637,0.0009083669,0.0000022159193,0.0002347309,0.00007437913,0.0011668646],"category_scores_gemma":[0.0000950998,0.00013426725,0.00015696694,0.00133754,0.00009530743,0.00016546548,0.00023133309,0.0007737982,0.000016923344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017460961,0.00013612279,0.38768506,0.00069128466,0.00051294704,0.0000057813727,0.014556288,0.5655609,0.0002580027,0.00048781198,0.00014097418,0.029790275],"study_design_scores_gemma":[0.00012414645,0.00031571553,0.073311225,0.000069769456,0.00031407236,2.791901e-7,0.0038778235,0.9207004,0.00004217179,0.00018500707,0.00097477046,0.000084665626],"about_ca_topic_score_codex":0.002133713,"about_ca_topic_score_gemma":0.000061431274,"teacher_disagreement_score":0.3551395,"about_ca_system_score_codex":0.00038175835,"about_ca_system_score_gemma":0.00047182012,"threshold_uncertainty_score":0.9997462},"labels":[],"label_agreement":null},{"id":"W4297152001","doi":"10.3390/a15100343","title":"Reasoning about Confidence in Goal Satisfaction","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Software Engineering Techniques and Practices","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 Ottawa","funders":"","keywords":"Computer science; Stakeholder; Quality (philosophy); Notation; Risk analysis (engineering); Data mining; Management science; Mathematics","score_opus":0.010808079976273064,"score_gpt":0.2586111610744728,"score_spread":0.24780308109819973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297152001","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.016425898,0.00034569929,0.9812765,0.00034385835,0.0006209101,0.0000943653,0.0000017967186,0.00048938923,0.00040155035],"genre_scores_gemma":[0.79305506,0.000034907254,0.20658587,0.00014258755,0.00003686297,0.00006849176,0.0000012459267,0.0000064215096,0.000068555775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926007,0.000058139853,0.00011344738,0.00020589684,0.00020714114,0.00015531856],"domain_scores_gemma":[0.99946475,0.00018973419,0.000050495353,0.0002523882,0.000013492055,0.000029138078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041633693,0.000064598484,0.000075305565,0.000087559616,0.00010966764,0.00006838455,0.0003598709,0.000019861282,0.000046806967],"category_scores_gemma":[0.00008244627,0.000073606396,0.000020562602,0.00035544165,0.000007860038,0.00043162477,0.00023052306,0.0002520253,0.000008224742],"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.000012494928,0.000064731685,0.051570937,0.000015670334,0.000018403556,0.00040634107,0.0019472908,0.010084087,0.00038628237,0.075544894,0.00266285,0.85728604],"study_design_scores_gemma":[0.00047595132,0.00028850103,0.20913877,0.00004188026,0.0000053518124,0.00054440944,0.00012527638,0.70954007,0.00079638633,0.010421431,0.06807663,0.0005453297],"about_ca_topic_score_codex":0.00081211905,"about_ca_topic_score_gemma":0.000016951259,"teacher_disagreement_score":0.8567407,"about_ca_system_score_codex":0.00007702039,"about_ca_system_score_gemma":0.000031308504,"threshold_uncertainty_score":0.30015817},"labels":[],"label_agreement":null},{"id":"W4307949351","doi":"10.3390/a15110399","title":"Design of HIFU Treatment Plans Using Thermodynamic Equilibrium Algorithm","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Ultrasound and Hyperthermia Applications","field":"Engineering","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":"Korea Electrotechnology Research Institute","keywords":"Thermodynamic equilibrium; Benchmark (surveying); Population; Computer science; High-intensity focused ultrasound; Thermodynamic process; Evolutionary algorithm; Mathematical optimization; Algorithm; Mathematics; Ultrasound; Material properties; Physics; Thermodynamics; Geology","score_opus":0.026182471008133014,"score_gpt":0.23398817949742534,"score_spread":0.20780570848929233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307949351","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.1638157,0.00079407875,0.8326382,0.000031680116,0.0003577849,0.00052112713,0.00042073982,0.0003590965,0.0010615822],"genre_scores_gemma":[0.87060076,0.00009912901,0.12829992,0.00003070208,0.00016775135,0.00022743359,0.000109873414,0.00011628233,0.00034814148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992541,0.000034394714,0.00018642304,0.00015454744,0.0001519813,0.00021853643],"domain_scores_gemma":[0.9995833,0.00006887165,0.00003327676,0.00025378074,0.000014514954,0.00004623908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007056154,0.00014606336,0.00018623665,0.000074903204,0.0001037328,0.000011083426,0.00016800886,0.00003253117,0.00023263838],"category_scores_gemma":[0.0000010321642,0.0001442201,0.00006336976,0.00020332442,0.000029257175,0.000051902374,0.000029800374,0.00008940648,0.000011035997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000080477585,0.0002398888,0.00007088703,0.000015753072,0.00027277015,0.00002078936,0.0013709447,0.5709722,0.2636667,0.00012912948,0.00008845708,0.16314448],"study_design_scores_gemma":[0.00032295816,0.00010657201,0.000076351724,0.00000293983,0.000047304235,0.00006533634,0.00018394565,0.9924518,0.0037433193,0.00028751933,0.0025400748,0.00017186237],"about_ca_topic_score_codex":0.000081134924,"about_ca_topic_score_gemma":0.0000014176959,"teacher_disagreement_score":0.7067851,"about_ca_system_score_codex":0.00019900622,"about_ca_system_score_gemma":0.000037045356,"threshold_uncertainty_score":0.5881125},"labels":[],"label_agreement":null},{"id":"W4308453111","doi":"10.3390/a15110412","title":"Branch and Price Algorithm for Multi-Trip Vehicle Routing with a Variable Number of Wagons and Time Windows","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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 Lethbridge","funders":"","keywords":"Column generation; Vehicle routing problem; Computer science; Variable (mathematics); TRIPS architecture; Truck; Routing (electronic design automation); Column (typography); Mathematical optimization; Branch and price; Variable neighborhood search; Algorithm; Integer programming; Mathematics; Metaheuristic; Parallel computing; Engineering; Computer network","score_opus":0.013957518895598283,"score_gpt":0.2573606026811846,"score_spread":0.2434030837855863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308453111","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.03666838,0.00021729473,0.96163076,0.00002634391,0.00009772316,0.0005054636,0.0001232739,0.00020021941,0.0005305589],"genre_scores_gemma":[0.044272203,0.000013399749,0.95493853,0.000036548245,0.000044062817,0.000119471,0.000018934177,0.00007358815,0.0004832712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989429,0.00007269794,0.0002529606,0.00025900293,0.0001710971,0.00030135285],"domain_scores_gemma":[0.99935627,0.00024559384,0.000074668154,0.00016981637,0.00007130665,0.00008232841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061840715,0.00016729026,0.00027901147,0.00006138718,0.00022216215,0.000032226417,0.00010241916,0.00005438599,0.00007494576],"category_scores_gemma":[0.00004459039,0.00017506654,0.000026333206,0.00036390117,0.00004603338,0.00012860898,0.00010349274,0.00018384053,0.0000015854738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008215238,0.00033082897,0.011538288,0.00045752715,0.0006748814,0.000025066942,0.0052030203,0.40172166,0.0115525285,0.00084432826,0.0003883749,0.56718135],"study_design_scores_gemma":[0.0016780625,0.0000768506,0.00065007247,0.000018829289,0.000043493215,0.00011129478,0.000106660955,0.99531144,0.00090419274,0.00007381619,0.0008032599,0.00022201771],"about_ca_topic_score_codex":0.000036656867,"about_ca_topic_score_gemma":4.1355744e-7,"teacher_disagreement_score":0.5935898,"about_ca_system_score_codex":0.00004681335,"about_ca_system_score_gemma":0.000029716555,"threshold_uncertainty_score":0.7139006},"labels":[],"label_agreement":null},{"id":"W4308757313","doi":"10.3390/a15110401","title":"Image-to-Image Translation-Based Data Augmentation for Improving Crop/Weed Classification Models for Precision Agriculture Applications","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Smart Agriculture and AI","field":"Agricultural and Biological Sciences","cited_by":52,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Artificial intelligence; Computer science; Support vector machine; Pattern recognition (psychology); Machine learning; Convolutional neural network; Feature extraction; Feature (linguistics); Transfer of learning; Deep learning; Contextual image classification; Image (mathematics)","score_opus":0.06930151153362646,"score_gpt":0.2886477255569941,"score_spread":0.21934621402336762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308757313","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.018287685,0.00028215724,0.94447064,0.013993036,0.00046403322,0.012279798,0.0094990255,0.0003730502,0.0003505631],"genre_scores_gemma":[0.42796606,0.000011554869,0.45894754,0.0020583118,0.0027489539,0.027938569,0.079244405,0.00001725441,0.0010673632],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998408,0.000052424304,0.0003139981,0.0006506711,0.0003029687,0.00027190856],"domain_scores_gemma":[0.99897337,0.00036707937,0.00015637968,0.00018115767,0.00022396854,0.00009802758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003898985,0.00017496539,0.00016461611,0.00002379177,0.0010088328,0.00014863691,0.000609129,0.00007200822,0.00006792055],"category_scores_gemma":[0.000028800381,0.00007826221,0.00011371117,0.0005225532,0.00002014257,0.00044366738,0.0000884186,0.000102878555,0.000008625058],"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.000060190152,0.00015868315,0.00000682701,0.000016042977,0.000010353353,1.5428155e-7,0.00007906462,0.0006563235,0.714334,0.000094169634,0.009431466,0.27515274],"study_design_scores_gemma":[0.0013753679,0.0007416466,0.004835248,0.000012332849,0.00016585187,0.000004979154,0.0018252908,0.68395567,0.008396789,0.00199534,0.29598317,0.0007083428],"about_ca_topic_score_codex":0.00013740036,"about_ca_topic_score_gemma":0.00013599583,"teacher_disagreement_score":0.7059372,"about_ca_system_score_codex":0.00006778276,"about_ca_system_score_gemma":0.00002182424,"threshold_uncertainty_score":0.77592283},"labels":[],"label_agreement":null},{"id":"W4309609412","doi":"10.3390/a15110432","title":"Automatic Fault Detection and Diagnosis in Cellular Networks and Beyond 5G: Intelligent Network Management","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Ontario Tech University","funders":"","keywords":"Computer science; Handover; Artificial neural network; Fault detection and isolation; Fault (geology); Fault management; Data mining; Task (project management); Real-time computing; Artificial intelligence; Machine learning; Computer network","score_opus":0.005148682831609283,"score_gpt":0.19303740624607704,"score_spread":0.18788872341446777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309609412","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.03890914,0.0062072673,0.95267445,0.000021625112,0.0008396898,0.00065747276,0.0000029718271,0.00025884062,0.00042855658],"genre_scores_gemma":[0.9880476,0.0012909024,0.0099352645,0.000030265104,0.00009103826,0.0005083751,0.0000122114725,0.000039601324,0.00004472493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992313,0.00004192806,0.00022446009,0.00018886331,0.000095297946,0.00021817247],"domain_scores_gemma":[0.9997438,0.000045568864,0.0000333481,0.00012478062,0.000007278116,0.000045178527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018290177,0.00012700567,0.00014678622,0.00009641976,0.000112664085,0.000026305885,0.000055781547,0.000037956415,0.000028463914],"category_scores_gemma":[0.0000031414563,0.00015121022,0.000015473268,0.000317933,0.000013970251,0.000094103794,0.000082842584,0.00015563304,0.0000015646101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011411955,0.000010856298,0.00030833564,0.00004144418,0.000019450115,0.000019316072,0.00014785223,0.80608124,0.000007784187,0.00003149482,0.000061789826,0.19326931],"study_design_scores_gemma":[0.00020686559,0.00004182706,0.0003655412,0.00002278454,0.00001713936,0.000013033045,0.00034430402,0.99725443,0.00010332717,0.00024253436,0.0012334598,0.00015475007],"about_ca_topic_score_codex":0.000015309688,"about_ca_topic_score_gemma":0.000022174985,"teacher_disagreement_score":0.94913846,"about_ca_system_score_codex":0.00013273687,"about_ca_system_score_gemma":0.0000012992006,"threshold_uncertainty_score":0.6166174},"labels":[],"label_agreement":null},{"id":"W4310376617","doi":"10.3390/a15120453","title":"Packet-Level and Flow-Level Network Intrusion Detection Based on Reinforcement Learning and Adversarial Training","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Network Security and Intrusion Detection","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reinforcement learning; Intrusion detection system; Network packet; Artificial intelligence; Robustness (evolution); Machine learning; Convolutional neural network; Network security; Computer security","score_opus":0.02858019655789462,"score_gpt":0.2324489749003067,"score_spread":0.20386877834241207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310376617","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.017716248,0.00010924692,0.9787664,0.00035085625,0.0020713597,0.0002756642,0.0000034980917,0.00019593239,0.00051079853],"genre_scores_gemma":[0.9744019,0.000058052487,0.024179256,0.0005810452,0.0005418497,0.000049424933,0.000012598182,0.00001565392,0.00016020758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983013,0.00021949752,0.00023894214,0.00046553923,0.000435606,0.00033907773],"domain_scores_gemma":[0.9993769,0.00016206081,0.00012287154,0.0001934405,0.000033529897,0.00011120279],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00083468953,0.00017296565,0.00017521308,0.0001377644,0.0013589954,0.00013121207,0.00018177817,0.000070905895,0.00009420704],"category_scores_gemma":[0.000046204073,0.00018298744,0.000045121986,0.00043371267,0.000040132036,0.00026949504,0.00042428507,0.0005299732,0.000004208555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006609959,0.000016254078,0.000029689432,0.0000054128923,0.000010834359,0.000011856928,0.0010713183,0.15229008,0.00012245259,0.00039543607,0.00015311522,0.84582746],"study_design_scores_gemma":[0.00089483603,0.0009040676,0.00041401232,0.000021029273,0.000008886072,0.000043692817,0.00019757895,0.97862834,0.00021840192,0.0007464672,0.017703587,0.0002191082],"about_ca_topic_score_codex":0.000054698903,"about_ca_topic_score_gemma":0.000019549696,"teacher_disagreement_score":0.95668566,"about_ca_system_score_codex":0.00009674147,"about_ca_system_score_gemma":0.000041453153,"threshold_uncertainty_score":0.9999411},"labels":[],"label_agreement":null},{"id":"W4313282199","doi":"10.3390/a15120475","title":"On Deep-Fake Stock Prices and Why Investor Behavior Might Not Matter","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","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":"Bishop's University","funders":"","keywords":"Randomness; Simple (philosophy); Margin (machine learning); Financial market; Stock (firearms); Asset (computer security); Economics; Stock market; Econometrics; Computer science; Financial economics; Finance; Mathematics","score_opus":0.02863651195687255,"score_gpt":0.20940411586080074,"score_spread":0.18076760390392818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313282199","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.97434974,0.0033935441,0.0018277842,0.0034787674,0.0011086351,0.00060186256,0.00065979187,0.000077410245,0.01450245],"genre_scores_gemma":[0.9804078,0.000025267303,0.0015756071,0.0033015718,0.00019557656,0.0003429888,0.000051614483,0.000054075743,0.014045519],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988375,0.000017730152,0.0004019356,0.00043779373,0.00006924426,0.00023582975],"domain_scores_gemma":[0.999303,0.000038124435,0.00022531058,0.00033246534,0.000014163185,0.00008694485],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002272357,0.00015054915,0.00035909592,0.00022842495,0.00032421338,0.000091743634,0.00019602702,0.000037271067,0.008562744],"category_scores_gemma":[0.000008479961,0.00016856122,0.000112880596,0.0002490711,0.000037368125,0.000115710056,0.00017343016,0.00015452215,0.00046790182],"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.00017781803,0.0017960313,0.45275518,0.0002147679,0.0012478655,0.00029752028,0.0061766854,0.0008287031,0.0001537283,0.34217086,0.15920866,0.034972206],"study_design_scores_gemma":[0.0007714684,0.00036150406,0.12123635,0.0000060213288,0.000049705126,0.000048234735,0.00028969452,0.010895894,0.000019094396,0.00469514,0.8609978,0.00062911643],"about_ca_topic_score_codex":0.0012258069,"about_ca_topic_score_gemma":0.00006895103,"teacher_disagreement_score":0.70178914,"about_ca_system_score_codex":0.00008034217,"about_ca_system_score_gemma":0.000006059573,"threshold_uncertainty_score":0.99234354},"labels":[],"label_agreement":null},{"id":"W4313427655","doi":"10.3390/a16010022","title":"Stochastic Local Community Detection in Networks","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Vertex (graph theory); Computer science; Theoretical computer science; Local community; Binary number; Algorithm; Mathematics; Graph","score_opus":0.017022459714544733,"score_gpt":0.2738733043787054,"score_spread":0.25685084466416064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313427655","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.09911753,0.00001317892,0.8996887,0.00002246658,0.00008163308,0.00010663047,0.0000024658502,0.00020925372,0.00075812516],"genre_scores_gemma":[0.999303,0.0000012513536,0.00025392408,0.000012801364,0.00021748828,0.00005167083,0.000053617205,0.000015091638,0.00009114285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992322,0.00012872196,0.0001726342,0.0001237398,0.00009219109,0.00025056236],"domain_scores_gemma":[0.9994869,0.00013778065,0.000042275264,0.00026694508,0.00002466903,0.00004139365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034579568,0.00010293762,0.00016061465,0.0001354731,0.00014514792,0.000024119778,0.00016340837,0.000034523695,0.000080505524],"category_scores_gemma":[0.0000030931797,0.0001084766,0.00007104108,0.0008830531,0.00004562282,0.000058001457,0.00011649527,0.00041557814,0.00006203665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006159152,0.000086138294,0.0029779163,0.0000021940073,0.000044068838,0.0000036166844,0.00018570384,0.11197515,0.000038185288,0.00054542127,0.0005063921,0.8836291],"study_design_scores_gemma":[0.00016938966,0.000029182964,0.009605392,0.00001465799,0.000013244768,5.8734116e-7,0.00038105107,0.97958463,0.00012535597,0.009741819,0.00020291147,0.0001317916],"about_ca_topic_score_codex":0.002376955,"about_ca_topic_score_gemma":0.00033543352,"teacher_disagreement_score":0.90018547,"about_ca_system_score_codex":0.000036141064,"about_ca_system_score_gemma":0.000008937284,"threshold_uncertainty_score":0.4423547},"labels":[],"label_agreement":null},{"id":"W4319083910","doi":"10.3390/a16020084","title":"About the Performance of a Calculus-Based Approach to Building Model Functions in a Derivative-Free Trust-Region Algorithm","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Calculus (dental); Computer science; Algorithm; Function (biology); Derivative (finance); Situation calculus; Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.08335352694491616,"score_gpt":0.3509549059097146,"score_spread":0.26760137896479846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319083910","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.037276506,0.000041259507,0.9599741,0.00052799593,0.00009216904,0.0010781505,0.000047495258,0.00022711628,0.0007351818],"genre_scores_gemma":[0.04223903,0.00005156911,0.9536865,0.00020492169,0.00011193683,0.00075933145,0.000048276856,0.00012319628,0.0027752703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722826,0.00013518073,0.0006264323,0.0005194451,0.00080750167,0.0006831985],"domain_scores_gemma":[0.99774915,0.00053646567,0.00017293729,0.0010107455,0.00033902246,0.00019166518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007954371,0.00029345797,0.00042444823,0.00054197497,0.0002697768,0.0000429084,0.0008286736,0.00013763478,0.000012102988],"category_scores_gemma":[0.0009722579,0.00023476493,0.00012533039,0.0034672874,0.00018596996,0.00025845756,0.00035195408,0.00043774984,0.000028153474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006274713,0.0003350105,0.00030164697,0.00015847155,0.000047014983,0.00001121383,0.0019359742,0.9505326,0.0001377651,0.00304213,0.0020750924,0.041360296],"study_design_scores_gemma":[0.0011263834,0.00011370229,0.0001594494,0.0000889799,0.000014555509,0.000009912342,0.00073488674,0.9935737,0.0007514704,0.0029023357,0.00026547644,0.0002591445],"about_ca_topic_score_codex":0.000033767963,"about_ca_topic_score_gemma":0.0000057402,"teacher_disagreement_score":0.043041065,"about_ca_system_score_codex":0.00019370067,"about_ca_system_score_gemma":0.000246486,"threshold_uncertainty_score":0.9573436},"labels":[],"label_agreement":null},{"id":"W4319597796","doi":"10.3390/a16020092","title":"A Hybrid Direct Search and Model-Based Derivative-Free Optimization Method with Dynamic Decision Processing and Application in Solid-Tank Design","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Multi-Objective Optimization 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":"Kelowna General Hospital; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Benchmark (surveying); Computer science; Robustness (evolution); Mathematical optimization; Derivative (finance); Mathematics","score_opus":0.01851464791214632,"score_gpt":0.3200928443406451,"score_spread":0.3015781964284988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319597796","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.00071281247,0.000116947536,0.9977547,0.00023949883,0.000023660645,0.00079299597,0.000007278452,0.00032339533,0.00002869209],"genre_scores_gemma":[0.061473507,0.00008674833,0.938078,0.00007239935,0.000009449853,0.00019261408,0.00001896568,0.000039258477,0.000029082446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788874,0.00017660137,0.00028738944,0.000877305,0.0004011422,0.000368841],"domain_scores_gemma":[0.99856347,0.0004477564,0.00011189436,0.00047460216,0.00028210043,0.00012020276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083019765,0.0002472323,0.00028437338,0.00052439113,0.0002466663,0.00019254207,0.00040214777,0.00006867917,7.2675505e-7],"category_scores_gemma":[0.00016699033,0.00022793443,0.000018175147,0.0016086027,0.00010474821,0.0008992864,0.00026284007,0.0001711991,0.0000020977077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002389749,0.0000272706,0.000036850957,0.000013560559,0.000004722743,0.000012286617,0.00029372566,0.7294079,0.00016464914,0.000036635913,0.000002023912,0.26997647],"study_design_scores_gemma":[0.0013693838,0.00009503284,0.0004653612,0.00007272161,0.0000074340965,0.000026916894,0.000037857015,0.9940026,0.0015999045,0.0020388553,0.0000025514519,0.0002814176],"about_ca_topic_score_codex":0.000023431092,"about_ca_topic_score_gemma":0.000014398679,"teacher_disagreement_score":0.26969507,"about_ca_system_score_codex":0.00013906934,"about_ca_system_score_gemma":0.00017302437,"threshold_uncertainty_score":0.9294896},"labels":[],"label_agreement":null},{"id":"W4319597842","doi":"10.3390/a16020095","title":"Defect Detection Methods for Industrial Products Using Deep Learning Techniques: A Review","year":2023,"lang":"en","type":"review","venue":"Algorithms","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":284,"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; Deep learning; Artificial intelligence; Digitization; Machine learning; Sample (material); Identification (biology); Task (project management); Pattern recognition (psychology); Computer vision; Engineering; Systems engineering","score_opus":0.2189905129289432,"score_gpt":0.43321507070519505,"score_spread":0.21422455777625185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319597842","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":[1.5200096e-7,0.78962606,0.20090078,0.00000212871,0.0034797434,0.0044032945,0.000013469315,0.0015192215,0.00005517781],"genre_scores_gemma":[1.1890242e-7,0.9731887,0.021658089,0.000010784591,0.0028914441,0.001650755,0.0000666171,0.00035581616,0.00017770054],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99646366,0.00076139724,0.001304422,0.00067723804,0.0002509517,0.00054233824],"domain_scores_gemma":[0.9981771,0.00059463846,0.00046527557,0.00047736595,0.00018063065,0.000104993574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037712539,0.0006811779,0.0024561118,0.00057882356,0.00024650255,0.0001012171,0.00023036155,0.0010699593,0.000009545088],"category_scores_gemma":[0.0015723478,0.00060745026,0.0010405314,0.0020231076,0.000020939086,0.00014449752,0.000065936976,0.0014120977,0.00006425621],"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.0000018831765,0.0000038207377,1.1891091e-8,0.03032058,0.00022578327,0.0000034404407,0.0000069906587,0.000028554268,0.00003179273,6.144908e-7,0.0003377058,0.96903884],"study_design_scores_gemma":[0.00014636651,0.00012819309,4.9781517e-9,0.047456685,0.0012728898,0.00017504684,0.0000068160384,0.0039798976,0.00030158742,0.0000068065883,0.94593686,0.0005888545],"about_ca_topic_score_codex":0.000036813504,"about_ca_topic_score_gemma":0.000002214599,"teacher_disagreement_score":0.96844995,"about_ca_system_score_codex":0.0005292433,"about_ca_system_score_gemma":0.00012753712,"threshold_uncertainty_score":0.99963766},"labels":[],"label_agreement":null},{"id":"W4319598807","doi":"10.3390/a16020089","title":"Rapid Guessing in Low-Stakes Assessments: Finding the Optimal Response Time Threshold with Random Search and Genetic Algorithm","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Behavioral and Psychological Studies","field":"Psychology","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":"Flagging; Computer science; Response time; Algorithm; Threshold model; Machine learning","score_opus":0.1531013219795476,"score_gpt":0.3784307984303121,"score_spread":0.22532947645076448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319598807","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.99442476,0.0014274046,0.0010398309,0.00094927195,0.00036689642,0.00052417535,0.000031648186,0.00014292485,0.0010931159],"genre_scores_gemma":[0.9728517,0.00060078077,0.014508385,0.00065644766,0.00061871053,0.00048484319,0.000048256632,0.00012088769,0.01011],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99762607,0.00049412146,0.0003133641,0.000564018,0.00032789796,0.00067451515],"domain_scores_gemma":[0.99884695,0.00060522935,0.000056241675,0.0003317386,0.00006444492,0.00009541511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012157442,0.00025872226,0.0003544976,0.00016697103,0.00035253252,0.00011428452,0.00027002455,0.00014165047,0.0004818758],"category_scores_gemma":[0.000027637156,0.00015300604,0.00005765433,0.0008051151,0.0003532693,0.0000900549,0.00013871743,0.0004467743,0.0003280854],"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.003687745,0.0004549918,0.022642324,0.000018369004,0.00027238045,0.0027314655,0.006561119,0.00031099777,0.0006132209,0.00003712803,0.0040083043,0.958662],"study_design_scores_gemma":[0.0071287733,0.0012420897,0.9694469,0.00015741789,0.00007392909,0.0001727754,0.005277598,0.012019262,0.00008229408,0.000119156146,0.003682964,0.00059681473],"about_ca_topic_score_codex":0.000119544406,"about_ca_topic_score_gemma":0.0000059969357,"teacher_disagreement_score":0.95806515,"about_ca_system_score_codex":0.00003597152,"about_ca_system_score_gemma":0.000021286216,"threshold_uncertainty_score":0.6239405},"labels":[],"label_agreement":null},{"id":"W4319971251","doi":"10.3390/a16020097","title":"Nemesis: Neural Mean Teacher Learning-Based Emotion-Centric Speaker","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Multimodal Machine Learning Applications","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":"Laurentian University","funders":"","keywords":"Closed captioning; Computer science; Natural language processing; Artificial intelligence; Task (project management); Natural language; Principle of maximum entropy; Image (mathematics); Perceptron; Artificial neural network; Speech recognition","score_opus":0.017980481412018783,"score_gpt":0.2741770904438704,"score_spread":0.2561966090318516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319971251","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.23856291,0.000077697565,0.7410672,0.012186175,0.0007469144,0.0005253482,0.0000035366265,0.004344125,0.0024861384],"genre_scores_gemma":[0.97635084,0.000004426039,0.021211488,0.0003303604,0.00023458786,0.000061029546,0.000035689238,0.000032817876,0.0017387373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980984,0.00018935351,0.00023752394,0.00055914966,0.00045109706,0.00046449617],"domain_scores_gemma":[0.9988167,0.00016604167,0.0001078404,0.0006623991,0.00009296894,0.00015400503],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046043802,0.00018879492,0.00016646108,0.00027221098,0.0003109202,0.00017472413,0.0008439913,0.000074296135,0.00010882987],"category_scores_gemma":[0.0001468855,0.00018320882,0.00010539499,0.0017503812,0.000042120886,0.00021466373,0.00021001896,0.00049640366,0.0025438573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006228163,0.00034203834,0.036199156,0.0000337613,0.00006683283,0.00011167523,0.0026956783,0.25943345,0.0002982124,0.002475566,0.009092323,0.6892451],"study_design_scores_gemma":[0.0003089934,0.000037806098,0.13715541,0.0000059380027,0.0000068704035,0.00000662231,0.00003858926,0.8574295,0.000050622933,0.00016873894,0.0046066227,0.00018429199],"about_ca_topic_score_codex":0.0003898521,"about_ca_topic_score_gemma":0.0000052194882,"teacher_disagreement_score":0.73778796,"about_ca_system_score_codex":0.000053083055,"about_ca_system_score_gemma":0.000058774593,"threshold_uncertainty_score":0.9982328},"labels":[],"label_agreement":null},{"id":"W4320494682","doi":"10.3390/a16020105","title":"Union Models for Model Families: Efficient Reasoning over Space and Time","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Model-Driven Software Engineering Techniques","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; Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Trillium Foundation","keywords":"Computer science; Metamodeling; Representation (politics); Theoretical computer science; Graph; Set (abstract data type); Dimension (graph theory); Artificial intelligence; Mathematics; Programming language","score_opus":0.014515689753517788,"score_gpt":0.2445755208529662,"score_spread":0.2300598310994484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320494682","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.0036305408,0.000058024336,0.993687,0.0001631773,0.00009524545,0.0002987174,0.000013927948,0.0018955611,0.0001578129],"genre_scores_gemma":[0.026986584,0.000047868558,0.9720172,0.000045415098,0.0000370428,0.000093268216,0.000009560915,0.000030834726,0.0007321976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988607,0.000018186862,0.00014170435,0.00042632414,0.00022262165,0.00033045822],"domain_scores_gemma":[0.99927723,0.00008330632,0.000039152605,0.00045011597,0.00006295788,0.0000872279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041881812,0.00015964144,0.0001691476,0.0001733004,0.00009897962,0.00008071735,0.00037978467,0.00008097693,6.356852e-7],"category_scores_gemma":[0.000009880584,0.0001604421,0.000049977454,0.00037514803,0.000026151909,0.00025553902,0.00031643972,0.00008953531,0.000011559287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014228629,0.0000117178115,0.0000031592615,0.000017039009,0.0000089502855,0.0000042305555,0.00068142684,0.80190337,0.00027766568,0.15709186,0.0017469969,0.03825218],"study_design_scores_gemma":[0.00017190201,0.000038754657,0.000023154227,0.000041538646,0.0000042996717,0.000005167625,0.0000027057313,0.98690504,0.00037323622,0.010144372,0.0020972476,0.00019255874],"about_ca_topic_score_codex":0.000025026515,"about_ca_topic_score_gemma":2.436214e-7,"teacher_disagreement_score":0.18500172,"about_ca_system_score_codex":0.000048404534,"about_ca_system_score_gemma":0.000031687046,"threshold_uncertainty_score":0.65426385},"labels":[],"label_agreement":null},{"id":"W4321105135","doi":"10.3390/a16020121","title":"Interpretation for Variational Autoencoder Used to Generate Financial Synthetic Tabular Data","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"FinTech, Crowdfunding, Digital Finance","field":"Business, Management and Accounting","cited_by":14,"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; Royal Bank of Canada; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Autoencoder; Computer science; Synthetic data; Domain (mathematical analysis); Interpretation (philosophy); Artificial intelligence; Black box; Sensitivity (control systems); Data mining; Deep learning; Machine learning; Mathematics","score_opus":0.059121371337118964,"score_gpt":0.2841893760242902,"score_spread":0.2250680046871712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321105135","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.02867867,0.000027773716,0.96346205,0.0027685098,0.0021032912,0.0008357232,0.00027806402,0.0005447674,0.00130117],"genre_scores_gemma":[0.92586035,0.0000055822084,0.054942347,0.0043349806,0.0049907095,0.0005323475,0.004874652,0.00017667221,0.0042823562],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861145,0.000004576571,0.00027252056,0.00051520125,0.00025158792,0.00034464628],"domain_scores_gemma":[0.99921596,0.00008137771,0.00012298979,0.0004063939,0.000158321,0.000014974259],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045781903,0.00016752322,0.00017794404,0.00029005014,0.00016916708,0.00039367826,0.000530036,0.000067292975,0.000065448265],"category_scores_gemma":[0.0009108538,0.000175744,0.000051452014,0.0008478054,0.000024736592,0.0014187769,0.00042561736,0.00007275968,0.0013435326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000268419,0.0003142607,0.0025373143,0.0006159816,0.00016239975,0.00010071626,0.00054885936,0.02593354,0.00242395,0.16979976,0.50854105,0.28875375],"study_design_scores_gemma":[0.00028252875,0.000013959243,0.0030079526,0.000052691867,0.000025452002,9.93328e-7,0.000015416246,0.8514893,0.00007041138,0.007408591,0.13739473,0.00023797368],"about_ca_topic_score_codex":0.00008093687,"about_ca_topic_score_gemma":0.000068762194,"teacher_disagreement_score":0.9085197,"about_ca_system_score_codex":0.000037748247,"about_ca_system_score_gemma":0.00004906909,"threshold_uncertainty_score":0.99943405},"labels":[],"label_agreement":null},{"id":"W4327973727","doi":"10.3390/a16030166","title":"Framework for Evaluating Potential Causes of Health Risk Factors Using Average Treatment Effect and Uplift Modelling","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Causal Inference Techniques","field":"Mathematics","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":"Humber Polytechnic; University of Toronto","funders":"Canadian Institutes of Health Research","keywords":"Causation; Counterfactual thinking; Logistic regression; Statistics; Computer science; Econometrics; Psychology; Machine learning; Mathematics; Social psychology","score_opus":0.313532333990839,"score_gpt":0.4935268919504549,"score_spread":0.1799945579596159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327973727","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.45068362,0.00007739066,0.5484359,0.0000083482455,0.000058393543,0.00052405446,0.000055145814,0.00015562821,0.0000014880338],"genre_scores_gemma":[0.49049914,0.00017984309,0.5091659,0.000003981478,0.00003963889,0.000047018475,0.000015550177,0.000037961156,0.000010988592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986392,0.00014705688,0.0004008623,0.00027409807,0.00020725344,0.00033151408],"domain_scores_gemma":[0.99733204,0.0019400176,0.00035991776,0.00023864547,0.000066140885,0.00006324011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084919936,0.00022059989,0.000506242,0.00011654147,0.00022000079,0.000021560152,0.0000712223,0.00010645251,0.000006064242],"category_scores_gemma":[0.00047866744,0.00017370496,0.00010250439,0.00017709077,0.000043859076,0.00009598125,0.00004936612,0.000119193035,7.8682757e-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.00023188267,0.0005888726,0.007837027,0.0030091277,0.0013508943,0.000035795736,0.020594208,0.47769275,0.0068090586,0.031977326,0.00008197483,0.4497911],"study_design_scores_gemma":[0.00030127505,0.00089683424,0.000043235395,0.00017684004,0.00010816475,0.0000025603024,0.0001679184,0.6860107,0.010793476,0.3013477,0.0000039069982,0.00014738993],"about_ca_topic_score_codex":0.00040508836,"about_ca_topic_score_gemma":0.0000035677554,"teacher_disagreement_score":0.4496437,"about_ca_system_score_codex":0.000123002,"about_ca_system_score_gemma":0.000053433512,"threshold_uncertainty_score":0.7083483},"labels":[],"label_agreement":null},{"id":"W4366348185","doi":"10.3390/a16040211","title":"Impact of Digital Transformation on the Energy Sector: A Review","year":2023,"lang":"en","type":"review","venue":"Algorithms","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":85,"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; Government of Alberta","keywords":"Digital transformation; Scope (computer science); Transformative learning; Computer science; Transformation (genetics); Key (lock); Risk analysis (engineering); Data science; Knowledge management; Computer security; Business; Sociology; World Wide Web","score_opus":0.07794594311526891,"score_gpt":0.3176272752449045,"score_spread":0.23968133212963555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366348185","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":[4.6295978e-7,0.95732826,0.00060114596,0.00001280153,0.00026353812,0.000523511,0.000991409,0.0003074324,0.039971415],"genre_scores_gemma":[0.000031885465,0.9989309,0.0000054548846,0.000011399095,0.000102829326,0.00018778355,0.00047260054,0.000099859,0.00015729474],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984326,0.00003005046,0.0008414826,0.00013109627,0.00032229003,0.00024253248],"domain_scores_gemma":[0.99911505,0.00027214974,0.00012851796,0.00038057685,0.00003931718,0.000064416454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015036711,0.0003945726,0.0009860382,0.0001638182,0.000026875734,0.000076911565,0.00036373435,0.0002242465,0.00011194329],"category_scores_gemma":[0.000026015614,0.00023907884,0.00086835737,0.0007376269,0.000034573866,0.0003814515,0.00001158376,0.00035833384,0.00036106064],"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.8155836e-7,0.000010638647,3.133498e-8,0.024975413,0.00031333353,0.0000018554606,0.00002743179,0.00011164107,1.0821536e-8,0.00043905198,0.0063476004,0.9677727],"study_design_scores_gemma":[0.000053213043,0.00005586188,3.3135007e-7,0.046815358,0.0001992206,0.0000338935,0.0000075574803,0.00034418824,0.0000012112858,0.000077797726,0.95212257,0.00028879367],"about_ca_topic_score_codex":0.000004925662,"about_ca_topic_score_gemma":3.441049e-7,"teacher_disagreement_score":0.96748394,"about_ca_system_score_codex":0.00016322236,"about_ca_system_score_gemma":0.000083753024,"threshold_uncertainty_score":0.97493523},"labels":[],"label_agreement":null},{"id":"W4367183818","doi":"10.3390/a16050222","title":"Asynchronous Gathering in a Dangerous Ring","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Optimization and Search Problems","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":"Carleton University; University of Ottawa","funders":"Gruppo Nazionale per il Calcolo Scientifico; Natural Sciences and Engineering Research Council of Canada; Università di Pisa; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Rendezvous; Asynchronous communication; Computer science; Node (physics); Mathematical proof; Ring (chemistry); Constructive; Set (abstract data type); Mobile agent; A priori and a posteriori; Ring network; Process (computing); Distributed computing; Computer network; Mathematics","score_opus":0.02803209220788296,"score_gpt":0.2773430951888817,"score_spread":0.24931100298099876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367183818","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.0094901435,0.00006659427,0.98325926,0.00071310205,0.00028156213,0.00015295472,6.6886327e-7,0.0005877482,0.0054479656],"genre_scores_gemma":[0.4339218,0.00028314698,0.56278,0.00055933243,0.00020901737,0.00013322677,0.000010276036,0.000048067537,0.0020550888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991769,0.000032046722,0.000121022385,0.00021741932,0.00016282564,0.0002897647],"domain_scores_gemma":[0.999618,0.000044375694,0.000019314104,0.00023983997,0.000020726293,0.000057768124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000305787,0.00006495923,0.00008217058,0.00017312744,0.000055727658,0.00009921305,0.0003851627,0.000029874833,0.000014609161],"category_scores_gemma":[0.000023741453,0.00006507803,0.00002153175,0.0009246753,0.000013584736,0.00025883093,0.00021253273,0.000099212986,0.0003664217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013351965,0.00006232774,0.0011851748,0.000023521066,0.000012082431,0.00042727214,0.005332307,0.047418598,0.0006019707,0.012945101,0.00027207666,0.93171823],"study_design_scores_gemma":[0.00024245637,0.000025824309,0.002196089,0.000017608563,3.3913224e-7,0.000011240241,0.000042429496,0.9940854,0.0001380047,0.0010909222,0.0020453758,0.000104333674],"about_ca_topic_score_codex":0.000054360913,"about_ca_topic_score_gemma":0.000015515958,"teacher_disagreement_score":0.9466668,"about_ca_system_score_codex":0.00003801601,"about_ca_system_score_gemma":0.0000309898,"threshold_uncertainty_score":0.4709732},"labels":[],"label_agreement":null},{"id":"W4377104115","doi":"10.3390/a16050259","title":"Using Deep-Learned Vector Representations for Page Stream Segmentation by Agglomerative Clustering","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":2,"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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute of Steel Construction","keywords":"Computer science; Cluster analysis; Task (project management); Digitization; Artificial intelligence; Segmentation; Information retrieval; Pattern recognition (psychology); Computer vision","score_opus":0.07573312849697603,"score_gpt":0.3630044820616022,"score_spread":0.2872713535646262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377104115","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.00082173274,0.000045774883,0.9968255,0.0009964226,0.0001911684,0.00041286723,0.000026034417,0.0005414818,0.00013901464],"genre_scores_gemma":[0.13226002,0.00015019688,0.86341727,0.00028497467,0.000209224,0.00041997252,0.0003022091,0.000044176195,0.0029119714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899685,0.000051243474,0.00020175004,0.00033912456,0.00019287616,0.00021813961],"domain_scores_gemma":[0.9993209,0.00013207612,0.00010312687,0.0002674777,0.00012162749,0.00005477281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019555823,0.00010475414,0.00010911203,0.00010498037,0.00024754732,0.00018551947,0.00027553845,0.000046325287,0.000008068437],"category_scores_gemma":[0.000057491277,0.00010427025,0.000057727335,0.0006937378,0.000033644086,0.0005223119,0.00010008998,0.00006104004,0.000027620079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014798327,0.000115437964,0.00009663743,0.000059697508,0.00008319995,0.0000139725435,0.0029001576,0.00028749954,0.42871734,0.0043048,0.005007149,0.5583993],"study_design_scores_gemma":[0.00025005167,0.000060416336,0.00015445126,0.0000109072025,0.000008213732,0.0000045655165,0.00027114712,0.8240486,0.17250346,0.0018072004,0.0007346115,0.0001463903],"about_ca_topic_score_codex":0.000038425675,"about_ca_topic_score_gemma":0.000002737134,"teacher_disagreement_score":0.8237611,"about_ca_system_score_codex":0.00007535715,"about_ca_system_score_gemma":0.000034252298,"threshold_uncertainty_score":0.42520174},"labels":[],"label_agreement":null},{"id":"W4377107329","doi":"10.3390/a16050256","title":"Hierarchical Modelling for CO2 Variation Prediction for HVAC System Operation","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Building Energy and Comfort Optimization","field":"Engineering","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":"HVAC; Computer science; Indoor air quality; Ventilation (architecture); Estimator; Occupancy; Variation (astronomy); Energy consumption; Air conditioning; Implementation; Environmental science; Architectural engineering; Engineering; Statistics; Environmental engineering; Mathematics","score_opus":0.01914573218045686,"score_gpt":0.21767557507128482,"score_spread":0.19852984289082795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377107329","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.00507269,0.000022689586,0.99233806,0.000045475834,0.0009829635,0.00036479172,0.00006145664,0.0009942531,0.00011764189],"genre_scores_gemma":[0.8675766,0.00005527001,0.12862867,0.000016125832,0.0009193204,0.000990742,0.0013524516,0.00007406331,0.0003867527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994619,0.000007700873,0.00016492956,0.0001324719,0.00008138119,0.00015160993],"domain_scores_gemma":[0.99975705,0.0000604672,0.000017210981,0.00008843883,0.00004791492,0.00002894234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018583915,0.00007950105,0.000088356,0.00008286806,0.00013703958,0.000037203292,0.00005067163,0.00009833604,0.0000015317282],"category_scores_gemma":[0.0000074512,0.000084987194,0.000041885196,0.00014567238,0.0000043414407,0.00014910524,0.000006184986,0.000046635578,0.0000029631324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000802405,0.000003978123,0.0000025766658,0.000074560456,0.000021187921,1.6355547e-7,0.00009892588,0.98795706,0.0002364721,0.008240623,0.00052947795,0.0028269414],"study_design_scores_gemma":[0.00033699436,0.000035480844,0.000018613373,0.000021897795,0.000019211702,0.0000018601175,0.000021073756,0.99680024,0.00056225585,0.0007401806,0.0013561482,0.00008603133],"about_ca_topic_score_codex":0.000005158318,"about_ca_topic_score_gemma":8.6572174e-7,"teacher_disagreement_score":0.8637094,"about_ca_system_score_codex":0.00006384456,"about_ca_system_score_gemma":0.000010030901,"threshold_uncertainty_score":0.34656772},"labels":[],"label_agreement":null},{"id":"W4378695905","doi":"10.3390/a16060271","title":"Enhancing Social Media Platforms with Machine Learning Algorithms and Neural Networks","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University Canada West","funders":"","keywords":"Machine learning; Computer science; Artificial neural network; Artificial intelligence; Social media; Upload; Context (archaeology); Social network (sociolinguistics); Workload; Algorithm; World Wide Web","score_opus":0.02024740755852831,"score_gpt":0.24908366809520022,"score_spread":0.22883626053667191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378695905","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.18806231,0.0007307882,0.8085022,0.0006824048,0.0009163906,0.00013989682,0.000005248379,0.0007988669,0.00016188214],"genre_scores_gemma":[0.956342,0.00019941003,0.04129598,0.00023679063,0.00130357,0.000021041335,0.0001901809,0.00004564792,0.00036541774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983927,0.00003218853,0.00024850882,0.00048271255,0.0003979907,0.00044592048],"domain_scores_gemma":[0.9992517,0.0002804725,0.00012240243,0.0001825411,0.00004634937,0.00011651235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037135108,0.00020015927,0.00027852965,0.00017221157,0.00043840086,0.00027685703,0.00035685644,0.00007745551,0.00002464823],"category_scores_gemma":[0.000024642311,0.00015601171,0.000067381145,0.0009470537,0.000055534765,0.00047198444,0.0003064119,0.00029784016,0.000024527379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018100516,0.00004647328,0.00873051,0.000010557922,0.00026826307,0.0002745726,0.010397751,0.006278175,0.00017391627,0.0012879894,0.00040069027,0.972113],"study_design_scores_gemma":[0.0005248631,0.00004876271,0.0043276767,0.000014234869,0.00001990819,0.00001240218,0.00038317565,0.9937044,0.00019117506,0.00021933159,0.00031909987,0.00023500856],"about_ca_topic_score_codex":0.000070841714,"about_ca_topic_score_gemma":0.00005752871,"teacher_disagreement_score":0.98742616,"about_ca_system_score_codex":0.00001794747,"about_ca_system_score_gemma":0.000015411044,"threshold_uncertainty_score":0.6361973},"labels":[],"label_agreement":null},{"id":"W4381512122","doi":"10.3390/a16070310","title":"Probability Density Estimation through Nonparametric Adaptive Partitioning and Stitching","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Gaussian Processes and Bayesian Inference","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":"University of North Carolina at Charlotte","keywords":"Kernel density estimation; Probability density function; Density estimation; Algorithm; Nonparametric statistics; Cumulative distribution function; Mathematics; Ranging; Block (permutation group theory); Probability distribution; Parametric statistics; Variable kernel density estimation; Computer science; Multivariate kernel density estimation; Principle of maximum entropy; Statistics; Kernel method; Artificial intelligence; Estimator","score_opus":0.04335569242947228,"score_gpt":0.27074102419238905,"score_spread":0.22738533176291675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381512122","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.06373832,0.000043912063,0.93463933,0.0005392419,0.00013840689,0.00013373424,0.0000017165537,0.00030765898,0.00045768943],"genre_scores_gemma":[0.6602482,0.000016123575,0.33960882,0.000059883478,0.00002260749,0.00001466448,0.0000024759954,0.0000035449318,0.000023655255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989834,0.000037199938,0.0001607168,0.00037958112,0.00020114516,0.00023797595],"domain_scores_gemma":[0.9994086,0.00013402857,0.00007066363,0.00024864945,0.00007865725,0.000059390368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028447792,0.00010464476,0.00012713796,0.00008060178,0.00025113925,0.00022191815,0.00022935116,0.00004685693,0.0000038483217],"category_scores_gemma":[0.00014301334,0.000096047785,0.000024182273,0.001187289,0.00005303667,0.0009474461,0.00020508262,0.00011903218,0.000078450474],"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.000006247176,0.0000794147,0.0058204904,0.00008744441,0.000031053125,0.00007412174,0.0034927803,0.0026486479,0.000057638514,0.23887487,0.00035869822,0.7484686],"study_design_scores_gemma":[0.00010882338,0.00005600363,0.03429268,0.000028729988,0.000004674427,0.00002154478,0.00003185464,0.7256878,0.00037511624,0.2392214,0.000040664723,0.0001307312],"about_ca_topic_score_codex":0.00010033597,"about_ca_topic_score_gemma":0.000008957818,"teacher_disagreement_score":0.74833786,"about_ca_system_score_codex":0.000029761832,"about_ca_system_score_gemma":0.000052216834,"threshold_uncertainty_score":0.3916715},"labels":[],"label_agreement":null},{"id":"W4382137162","doi":"10.3390/a16070313","title":"Entanglement Distillation Optimization Using Fuzzy Relations for Quantum State Tomography","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Quantum Information and Cryptography","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":"Quantum annealing; Quantum entanglement; Density matrix; Distillation; Fuzzy logic; Quantum tomography; Quantum; Computer science; Quantum computer; Mathematical optimization; Statistical physics; Simulated annealing; Quantum state; Mathematics; Quantum mechanics; Physics; Artificial intelligence; Chemistry","score_opus":0.027353259822524612,"score_gpt":0.2763259174206937,"score_spread":0.24897265759816906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382137162","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.005638639,0.000028633342,0.9920971,0.00040431914,0.0005716628,0.00038575052,0.000036062647,0.0004547751,0.0003830651],"genre_scores_gemma":[0.35930145,0.00007857255,0.6393313,0.000354116,0.00013429085,0.00015378938,0.00046358773,0.000032284323,0.0001506324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989068,0.00002735946,0.00032478094,0.00021522805,0.00026235564,0.00026351295],"domain_scores_gemma":[0.9993001,0.00007185992,0.00014245916,0.00026425632,0.00014670072,0.00007459501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029026484,0.000115097224,0.000102882186,0.0004683039,0.0003173226,0.00017430983,0.00023684034,0.000040134222,0.000014211499],"category_scores_gemma":[0.000019554249,0.00011565847,0.000114324175,0.0017148567,0.000026020878,0.0008369785,0.00006531835,0.000050358307,0.000044186057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012011059,0.00007712738,0.0021093565,0.000042105192,0.00008988871,0.0000041841445,0.003084939,0.7393343,0.00012339729,0.1978279,0.0048780767,0.05241671],"study_design_scores_gemma":[0.0003247156,0.00004835146,0.0014494121,0.000010610608,0.00000815789,0.0000026822397,0.00009757909,0.98018855,0.00007505552,0.014398533,0.0032446415,0.0001516959],"about_ca_topic_score_codex":0.00001239,"about_ca_topic_score_gemma":0.000001976142,"teacher_disagreement_score":0.3536628,"about_ca_system_score_codex":0.000034631023,"about_ca_system_score_gemma":0.000034636036,"threshold_uncertainty_score":0.47164157},"labels":[],"label_agreement":null},{"id":"W4385636399","doi":"10.3390/a16080380","title":"Design Optimization of Truss Structures Using a Graph Neural Network-Based Surrogate Model","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Topology Optimization in Engineering","field":"Engineering","cited_by":41,"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; Alberta Motor Association Foundation for Traffic Safety","keywords":"Truss; Finite element method; Computer science; Artificial neural network; Planar; Particle swarm optimization; Surrogate model; Mathematical optimization; Structural engineering; Mathematics; Engineering; Artificial intelligence","score_opus":0.028069352150906838,"score_gpt":0.2408274461852581,"score_spread":0.21275809403435125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385636399","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.011855781,0.000122054415,0.98641264,0.000013280818,0.0005729439,0.00016194042,0.00001195085,0.0008171559,0.000032264954],"genre_scores_gemma":[0.41356066,0.000029845667,0.58618623,0.000014570302,0.0000728045,0.000014095667,0.00003718682,0.00007414927,0.000010450106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990686,0.00003087149,0.00026990805,0.00015890088,0.00014079962,0.00033090194],"domain_scores_gemma":[0.99957436,0.00007645357,0.000045731438,0.00019694044,0.00005174752,0.000054745826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014201431,0.00017616131,0.00021088055,0.00022847841,0.00006128596,0.000016136291,0.00014080391,0.0001203432,0.00002431877],"category_scores_gemma":[0.000016522788,0.00019609857,0.000055394044,0.0008094437,0.000048896145,0.00012611676,0.000021213484,0.00012049232,0.0000018586478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004335172,0.0000026900532,0.000041775493,0.000026771959,0.00003005925,0.0000048891993,0.00006906007,0.99898803,0.00029521427,0.000064327265,0.0001012664,0.00037158869],"study_design_scores_gemma":[0.00031394817,0.000012514525,0.00004917187,0.000014036041,0.00002338427,0.000004626304,0.000009498148,0.99799013,0.0010551955,0.000350625,0.0000019207962,0.00017492917],"about_ca_topic_score_codex":0.000006563415,"about_ca_topic_score_gemma":5.00343e-7,"teacher_disagreement_score":0.40170488,"about_ca_system_score_codex":0.000031705327,"about_ca_system_score_gemma":0.000021304153,"threshold_uncertainty_score":0.7996667},"labels":[],"label_agreement":null},{"id":"W4386091953","doi":"10.3390/a16090399","title":"Detecting Image Forgery over Social Media Using U-NET with Grasshopper Optimization","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Digital Media Forensic Detection","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":"Laurentian University","funders":"","keywords":"Computer science; Artificial intelligence; Elastic net regularization; F1 score; Segmentation; Convolutional neural network; Pattern recognition (psychology); Machine learning; Feature selection","score_opus":0.0226730800973824,"score_gpt":0.24946474004068045,"score_spread":0.22679165994329806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386091953","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.08312995,0.000006447655,0.91393036,0.00013154677,0.0014314952,0.00012807848,0.000004488311,0.0006942202,0.0005434444],"genre_scores_gemma":[0.72998327,0.000005073731,0.26883706,0.00013038825,0.0008355477,0.000029089337,0.000026183381,0.00006433438,0.00008901426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854463,0.0000317174,0.00019014574,0.00037210382,0.00046277093,0.0003986574],"domain_scores_gemma":[0.99930817,0.0001696587,0.00010457623,0.00023251885,0.00010397622,0.00008110386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002493034,0.00015790992,0.0001619769,0.0002408915,0.00020941645,0.00029431758,0.0002662576,0.00007474876,0.000008116761],"category_scores_gemma":[0.0001434866,0.00014334566,0.000055547684,0.001375431,0.000073287,0.001376123,0.00017441282,0.00012904314,0.000050106137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034007728,0.00008420908,0.00053082703,0.000048919002,0.00012372782,0.00045358218,0.006127974,0.042103045,0.0033176953,0.00085649476,0.002418642,0.9439009],"study_design_scores_gemma":[0.00035767516,0.000044395772,0.00072957925,0.000022558525,0.000011994246,0.00006256757,0.0001784523,0.9948929,0.002476599,0.0008268668,0.00013415595,0.00026224437],"about_ca_topic_score_codex":0.000020406882,"about_ca_topic_score_gemma":0.000016466918,"teacher_disagreement_score":0.95278984,"about_ca_system_score_codex":0.00008113072,"about_ca_system_score_gemma":0.000058185615,"threshold_uncertainty_score":0.5845467},"labels":[],"label_agreement":null},{"id":"W4386220430","doi":"10.3390/a16090407","title":"A Novel Machine-Learning Approach to Predict Stress-Responsive Genes in Arabidopsis","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Genetic Mapping and Diversity in Plants and Animals","field":"Biochemistry, Genetics and Molecular Biology","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 Manitoba","funders":"","keywords":"Random forest; Lasso (programming language); Artificial intelligence; Feature selection; Machine learning; Computer science; Gene; Elastic net regularization; Arabidopsis; Multilayer perceptron; Perceptron; Computational biology; Pattern recognition (psychology); Artificial neural network; Biology; Genetics","score_opus":0.01981946571871739,"score_gpt":0.24000914450270502,"score_spread":0.22018967878398762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386220430","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.99008787,0.00040150274,0.004752741,0.00019992613,0.00016466826,0.00023429727,0.00030368898,0.000060564067,0.0037947614],"genre_scores_gemma":[0.9861263,0.00040470995,0.006779439,0.00024413124,0.00026433423,0.00003550706,0.0006182155,0.000022672342,0.0055047064],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990513,0.00003766194,0.00013028795,0.00035637306,0.00013616691,0.0002882591],"domain_scores_gemma":[0.9996548,0.000016360318,0.000031526237,0.00015885523,0.00003925232,0.00009919518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019031434,0.00013073934,0.0001356068,0.0001286675,0.00008748571,0.000028155191,0.0001845968,0.00009940946,0.000009874967],"category_scores_gemma":[0.00008820271,0.00012529097,0.00005574384,0.000264362,0.000023573297,0.00000212196,0.00018582736,0.000089510126,0.00005347976],"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.00037976113,0.0006326447,0.14961614,0.0001313792,0.0002745606,0.00010597393,0.0016153305,0.0738816,0.71681964,0.00012788895,0.011869221,0.044545885],"study_design_scores_gemma":[0.0066562565,0.0023438819,0.30863038,0.00025185177,0.0001287054,0.00025025744,0.008511859,0.14993742,0.09872445,0.000112385314,0.42164138,0.0028112072],"about_ca_topic_score_codex":0.0001517586,"about_ca_topic_score_gemma":0.000018501698,"teacher_disagreement_score":0.61809516,"about_ca_system_score_codex":0.0000062484414,"about_ca_system_score_gemma":0.000030178786,"threshold_uncertainty_score":0.5109218},"labels":[],"label_agreement":null},{"id":"W4386475935","doi":"10.3390/a16090426","title":"A Framework for Determining Collision Likelihood Using Continuous Friction Values in a Connected Vehicle Environment","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Smart Materials for Construction","field":"Environmental 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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Collision; Computer science; Kriging; Ambiguity; Range (aeronautics); Collision avoidance; Road surface; Simulation; Artificial intelligence; Environmental science; Machine learning; Data mining; Marine engineering; Engineering; Aerospace engineering; Civil engineering; Computer security","score_opus":0.022768216005298332,"score_gpt":0.26756762548945767,"score_spread":0.24479940948415935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386475935","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.97958565,0.000009962553,0.018953586,0.00006486821,0.0007043043,0.0005054718,0.000015757758,0.00013516076,0.00002527002],"genre_scores_gemma":[0.9368311,0.0000205554,0.06279638,0.000047911253,0.00013331692,0.00010404534,0.000019292725,0.000032266635,0.0000151124395],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868065,0.000060495528,0.0002828805,0.00037002668,0.00022680048,0.000379119],"domain_scores_gemma":[0.9994703,0.00016569174,0.000107746244,0.00018742673,0.000005230437,0.0000635816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036091634,0.00014114959,0.00019111735,0.000088925604,0.00017455492,0.000044944565,0.000110728346,0.00013103672,0.00013834785],"category_scores_gemma":[0.00010712862,0.00014940092,0.000051687362,0.00036505365,0.00007318289,0.00020183077,0.00012989293,0.00008355456,0.00027561974],"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.00020915017,0.00024953953,0.49598145,0.000045438144,0.000054888336,0.000103853825,0.003993133,0.024850894,0.37923703,0.00015215305,0.000574167,0.094548315],"study_design_scores_gemma":[0.0020827008,0.00041992494,0.2852241,0.00016255278,0.00006178356,0.000059887865,0.001373073,0.6412802,0.044647958,0.021825166,0.0021743528,0.00068831514],"about_ca_topic_score_codex":0.00032248785,"about_ca_topic_score_gemma":0.000021644453,"teacher_disagreement_score":0.61642927,"about_ca_system_score_codex":0.00027343398,"about_ca_system_score_gemma":0.000008411554,"threshold_uncertainty_score":0.6092393},"labels":[],"label_agreement":null},{"id":"W4387310124","doi":"10.3390/a16100467","title":"A Survey of Sequential Pattern Based E-Commerce Recommendation Systems","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Recommender Systems and Techniques","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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; University of Windsor","keywords":"Computer science; Recommender system; Collaborative filtering; Novelty; Scalability; E-commerce; Domain (mathematical analysis); Sequential Pattern Mining; Clickstream; Data mining; Information retrieval; Artificial intelligence; World Wide Web; Database; The Internet","score_opus":0.07878952732151877,"score_gpt":0.3098257615905473,"score_spread":0.23103623426902853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387310124","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.0024188405,0.000033155873,0.9938347,0.00073385367,0.0014128654,0.000277175,0.00005342447,0.0005626541,0.00067333353],"genre_scores_gemma":[0.9948846,0.000015060208,0.004483399,0.00013212566,0.0000700602,0.000064781336,0.00016781325,0.000018302924,0.00016382213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983554,0.0004008277,0.00042426723,0.00032343186,0.00024159608,0.00025451387],"domain_scores_gemma":[0.99880946,0.00023308447,0.00020246595,0.00052654854,0.000163819,0.00006459918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016320742,0.00013590715,0.0002644377,0.0002256378,0.00007007949,0.00011610661,0.0006101583,0.000081286926,0.00001600597],"category_scores_gemma":[0.000031529657,0.00012678732,0.000063948464,0.0008427953,0.000018085962,0.00027240397,0.00017828494,0.00009845971,0.00006520323],"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.000004884782,0.00014711445,0.025238926,0.00019304661,0.00009386954,0.000031207528,0.00044582988,0.00014345929,0.0004121784,0.0009429418,0.049553443,0.9227931],"study_design_scores_gemma":[0.00037994515,0.00012731133,0.04807631,0.00007476572,0.0000047845465,0.000010988059,0.00002694253,0.9411499,0.0015775075,0.00008649971,0.0082314,0.00025363982],"about_ca_topic_score_codex":0.0068971254,"about_ca_topic_score_gemma":0.00008472445,"teacher_disagreement_score":0.9924658,"about_ca_system_score_codex":0.000038833357,"about_ca_system_score_gemma":0.000055569064,"threshold_uncertainty_score":0.99971604},"labels":[],"label_agreement":null},{"id":"W4387457561","doi":"10.3390/a16100472","title":"Blockchain PoS and PoW Consensus Algorithms for Airspace Management Application to the UAS-S4 Ehécatl","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Blockchain Technology Applications and Security","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada; Shandong Academy of Sciences","keywords":"Computer science; Consensus algorithm; Swarm behaviour; Blockchain; Heading (navigation); Block (permutation group theory); Algorithm; Computer security; Artificial intelligence; Mathematics; Engineering; Aerospace engineering","score_opus":0.01427011232431856,"score_gpt":0.2669325275746524,"score_spread":0.25266241525033384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387457561","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.0059286174,0.00020737485,0.91259664,0.077563025,0.00021088026,0.0021679373,0.00003611169,0.0008761762,0.00041320527],"genre_scores_gemma":[0.42027292,0.00016881363,0.56231517,0.003680408,0.00040415538,0.007165862,0.000048513855,0.000076900214,0.00586728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983226,0.00003730389,0.00023768375,0.00071842235,0.00022588871,0.00045809316],"domain_scores_gemma":[0.9983352,0.00021121521,0.00008634261,0.0011398408,0.000109322886,0.00011807868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007212336,0.00019832716,0.00018725004,0.00021859662,0.00050715223,0.00009825988,0.001046538,0.00012945938,0.0000023126242],"category_scores_gemma":[0.000026767313,0.00016382021,0.00006018235,0.0012972435,0.00011371994,0.000029930565,0.0006073236,0.00015663561,0.00019760829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006321356,0.00007985041,0.000040414656,0.000032009913,0.000076797696,0.000012814927,0.000990372,0.00031017503,0.00020485382,0.2848614,0.031161014,0.682224],"study_design_scores_gemma":[0.0005572941,0.000121577854,0.0011798465,0.000012138288,0.000024203704,0.00005307885,0.0005247458,0.72425604,0.0009274124,0.036590982,0.23540509,0.00034758128],"about_ca_topic_score_codex":0.000043942513,"about_ca_topic_score_gemma":0.000021208232,"teacher_disagreement_score":0.72394586,"about_ca_system_score_codex":0.000038313075,"about_ca_system_score_gemma":0.00002139103,"threshold_uncertainty_score":0.6680394},"labels":[],"label_agreement":null},{"id":"W4388023877","doi":"10.3390/a16110500","title":"Two-Way Linear Probing Revisited","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Algorithms and Data Compression","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":"Linear hashing; Hash function; Computer science; Hash table; Algorithm; Sequence (biology); Cluster (spacecraft); Cluster analysis; Mathematics; Perfect hash function; Statistics","score_opus":0.02678644394421046,"score_gpt":0.2875815398217454,"score_spread":0.2607950958775349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388023877","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.0032311545,0.0003006102,0.9878312,0.0011646721,0.0011772212,0.00034549527,0.00002444916,0.0021236755,0.0038015523],"genre_scores_gemma":[0.04916169,0.000322174,0.941081,0.0013258298,0.0019141529,0.000108384476,0.0002961559,0.000087047105,0.005703598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983751,0.00005752052,0.00024560094,0.00052526355,0.0003670289,0.00042946692],"domain_scores_gemma":[0.9987632,0.00008949159,0.000076581375,0.00085219357,0.00008392831,0.00013460394],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043514612,0.00016469794,0.00019211289,0.00018014527,0.00022929112,0.00016579247,0.0009950841,0.000057419627,0.00002960748],"category_scores_gemma":[0.000042465228,0.0001390958,0.000070834845,0.0013246775,0.000028379889,0.0006808862,0.00082833273,0.00018002314,0.0014899875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056391564,0.00009387765,0.00021325005,0.000046318328,0.000047453286,0.00053707993,0.000979856,0.0007122492,0.0027634858,0.024864487,0.038490757,0.93124557],"study_design_scores_gemma":[0.00045734545,0.000054608157,0.0006562971,0.0000712754,0.0000049769524,0.00004151888,0.0000277306,0.9385925,0.001289795,0.0024008115,0.05611461,0.0002885412],"about_ca_topic_score_codex":0.00004185836,"about_ca_topic_score_gemma":7.779583e-7,"teacher_disagreement_score":0.9378802,"about_ca_system_score_codex":0.000024729958,"about_ca_system_score_gemma":0.00003719421,"threshold_uncertainty_score":0.9992875},"labels":[],"label_agreement":null},{"id":"W4388107968","doi":"10.3390/a16110503","title":"Machine Learning-Based Approach for Predicting Diabetes Employing Socio-Demographic Characteristics","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Artificial Intelligence in Healthcare","field":"Health Professions","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":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polyuria; Polydipsia; Diabetes mellitus; Machine learning; Artificial intelligence; Medicine; Classifier (UML); Computer science","score_opus":0.12617736418784742,"score_gpt":0.4190133564460259,"score_spread":0.29283599225817847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388107968","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.93334186,0.0003855371,0.051827632,0.0029465538,0.0029222756,0.0042712046,0.00056274503,0.0032536858,0.0004885008],"genre_scores_gemma":[0.987551,0.00006657471,0.006082628,0.00085451297,0.0015242188,0.0016650467,0.0011989266,0.00015511707,0.00090200803],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965264,0.0005008131,0.0008652468,0.0005251878,0.00034331423,0.0012390142],"domain_scores_gemma":[0.99611586,0.0025780532,0.00038541737,0.00033063453,0.00036669665,0.00022330723],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0020522224,0.0002612511,0.0004460141,0.00029703745,0.0025418256,0.000028891913,0.00029531433,0.00037999227,0.000079106976],"category_scores_gemma":[0.0016278267,0.0002531656,0.00017107872,0.00079338835,0.000115578056,0.000106808584,0.00012089181,0.0011898921,0.00023432242],"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.000019938154,0.00003930501,0.9810366,0.0007639784,0.00003405615,0.0000034123134,0.0019633158,0.00067516696,0.00008210122,0.00011469542,0.000515625,0.014751778],"study_design_scores_gemma":[0.00024316424,0.00016802106,0.013931563,0.00017442228,0.000035798254,2.7061625e-7,0.0033192749,0.9760533,0.000073839234,0.0006062227,0.00512047,0.00027366268],"about_ca_topic_score_codex":0.00040749638,"about_ca_topic_score_gemma":0.000038018425,"teacher_disagreement_score":0.9753781,"about_ca_system_score_codex":0.00012346586,"about_ca_system_score_gemma":0.00023313297,"threshold_uncertainty_score":0.9999921},"labels":[],"label_agreement":null},{"id":"W4388695206","doi":"10.3390/a16110522","title":"Relational Fisher Analysis: Dimensionality Reduction in Relational Data with Global Convergence","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Face and Expression Recognition","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":"École de Technologie Supérieure","funders":"National Key Research and Development Program of China","keywords":"Dimensionality reduction; Computer science; Convergence (economics); Relational database; Kernel (algebra); Curse of dimensionality; Discriminative model; Reduction (mathematics); Representation (politics); Statistical relational learning; Generalization; Grey relational analysis; Artificial intelligence; Machine learning; Data mining; Mathematics","score_opus":0.07379055914236558,"score_gpt":0.29603289971799596,"score_spread":0.22224234057563036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388695206","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.19217607,0.00012226145,0.7950963,0.008016936,0.0011828352,0.00035532273,0.00025137342,0.00054488174,0.0022540425],"genre_scores_gemma":[0.74933875,0.00005109048,0.24593799,0.00024611645,0.00018001255,0.000046320358,0.00315693,0.000011198492,0.0010315949],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984209,0.000081037964,0.00023367116,0.0005523256,0.0005215014,0.00019056236],"domain_scores_gemma":[0.9991059,0.00007061083,0.00008068449,0.0005806186,0.00009850594,0.000063714375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046035604,0.000099260295,0.00013002986,0.00015971361,0.000117596544,0.000040388004,0.00040200131,0.0000695737,0.00010841808],"category_scores_gemma":[0.000038903643,0.00008590285,0.00003457012,0.0028938048,0.000042686606,0.0011750816,0.0002765481,0.00011678737,0.00028490458],"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.00020332132,0.00074889604,0.565469,0.000044914465,0.0013506291,0.00042430978,0.0010754699,0.11571924,0.0004913561,0.08720239,0.11125807,0.11601241],"study_design_scores_gemma":[0.00025726258,0.000016233125,0.36897036,0.000017793745,0.00002736088,0.000017671313,0.000036958285,0.62472373,0.000021543901,0.0046907207,0.0010955379,0.00012482454],"about_ca_topic_score_codex":0.00013599222,"about_ca_topic_score_gemma":0.000045973247,"teacher_disagreement_score":0.5571627,"about_ca_system_score_codex":0.00005413187,"about_ca_system_score_gemma":0.00009896475,"threshold_uncertainty_score":0.3661967},"labels":[],"label_agreement":null},{"id":"W4389238242","doi":"10.3390/a16120552","title":"A Lightweight Graph Neural Network Algorithm for Action Recognition Based on Self-Distillation","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Human Pose and Action Recognition","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":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Computer science; Silhouette; Artificial neural network; Artificial intelligence; Graph; RGB color model; Pattern recognition (psychology); Algorithm; Machine learning; Data mining; Theoretical computer science","score_opus":0.04174954569593984,"score_gpt":0.27724004096091237,"score_spread":0.23549049526497254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389238242","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.0046587074,0.000015527681,0.9880187,0.0008462389,0.002735367,0.0006874536,0.000044294055,0.0021217663,0.00087195967],"genre_scores_gemma":[0.1828841,0.00020365384,0.799051,0.004336125,0.007747195,0.0014410747,0.0029721728,0.00016877014,0.0011959344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983324,0.00009254212,0.00028441858,0.0005263825,0.00033552738,0.00042876686],"domain_scores_gemma":[0.99897575,0.00027260924,0.00015506627,0.00030366602,0.00018291007,0.000109983754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038032603,0.00020659309,0.00017572657,0.00035296933,0.00045295057,0.00018739094,0.00022745314,0.00012917389,0.000029835335],"category_scores_gemma":[0.000021983646,0.00020456771,0.00016849284,0.0011294334,0.000017006087,0.00059628824,0.000033325607,0.00015463571,0.0003832038],"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.0000108636195,0.0000758772,0.000013733463,0.000015714626,0.000023046068,0.000011485171,0.00007145557,0.001434785,0.000030653842,0.00018900019,0.0095254695,0.9885979],"study_design_scores_gemma":[0.0007219858,0.000288762,0.0009108745,0.000034653636,0.000022713415,0.000010181406,0.00001160839,0.974365,0.0009033053,0.012858953,0.009599592,0.00027238857],"about_ca_topic_score_codex":0.000009515781,"about_ca_topic_score_gemma":0.0000051677093,"teacher_disagreement_score":0.98832554,"about_ca_system_score_codex":0.00006735665,"about_ca_system_score_gemma":0.00003882911,"threshold_uncertainty_score":0.8342029},"labels":[],"label_agreement":null},{"id":"W4390347126","doi":"10.3390/a17010013","title":"Machine Learning Model for Multiomics Biomarkers Identification for Menopause Status in Breast Cancer","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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":"Lakehead University","funders":"","keywords":"Breast cancer; Computer science; Artificial intelligence; Cancer; Machine learning; Medicine; Internal medicine","score_opus":0.023725300659337464,"score_gpt":0.3120450289008868,"score_spread":0.28831972824154933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390347126","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.42772442,0.0015319402,0.5625143,0.0027611542,0.00094454427,0.002126473,0.002195409,0.00013635901,0.000065410204],"genre_scores_gemma":[0.98614246,0.0019958501,0.0046674428,0.00011509907,0.00015850371,0.001329863,0.0023053836,0.00004766105,0.0032377332],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991825,0.000019093075,0.00018331438,0.00031228355,0.000069883325,0.00023290295],"domain_scores_gemma":[0.99960214,0.000013131038,0.00008436622,0.00015800942,0.00009147924,0.00005085028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020769505,0.00009415625,0.00008325149,0.00009579848,0.0000839865,0.00002177354,0.00009265439,0.000089289024,0.0000033408153],"category_scores_gemma":[0.000036357134,0.00009604787,0.000044511064,0.00016319224,0.000019424624,0.0000059191107,0.000029163772,0.000038858245,0.0000027058584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019152992,0.00003449441,0.0015890675,0.00003214937,0.000035461726,1.634495e-7,0.00012571865,0.018174104,0.91902053,0.000027211445,0.0032846192,0.05748495],"study_design_scores_gemma":[0.0012219206,0.000032814005,0.00386376,0.0000098543915,0.000013217136,9.2346187e-7,0.00012420588,0.94418114,0.03821938,0.00014826826,0.012039903,0.00014462811],"about_ca_topic_score_codex":0.000065602755,"about_ca_topic_score_gemma":0.00006223587,"teacher_disagreement_score":0.92600703,"about_ca_system_score_codex":0.0000401099,"about_ca_system_score_gemma":0.00007384002,"threshold_uncertainty_score":0.39167187},"labels":[],"label_agreement":null},{"id":"W4390821557","doi":"10.3390/a17010031","title":"GPU Algorithms for Structured Sparse Matrix Multiplication with Diagonal Storage Schemes","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Parallel Computing and Optimization Techniques","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":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Qassim University; University of Northern British Columbia","keywords":"Matrix multiplication; Computer science; Multiplication (music); Diagonal; Sparse matrix; Overhead (engineering); Parallel computing; Matrix (chemical analysis); Diagonal matrix; Locality; Algorithm; Set (abstract data type); Computer data storage; Computational science; Mathematics; Computer hardware","score_opus":0.020400943916873627,"score_gpt":0.2955937275811731,"score_spread":0.27519278366429945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390821557","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.00084504846,0.0009513846,0.9948745,0.00068008236,0.00042378792,0.00048780628,0.000027138534,0.0015929019,0.000117378935],"genre_scores_gemma":[0.057552107,0.000042773056,0.94103163,0.00010909859,0.00029245368,0.00015143966,0.0000526954,0.00003301663,0.0007347737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984312,0.00003644538,0.00025205928,0.0006498332,0.0002981685,0.00033230789],"domain_scores_gemma":[0.99897283,0.00016380193,0.000080119586,0.00050766335,0.00016970142,0.00010585872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026671428,0.00022920476,0.0002024106,0.00018795309,0.00017818173,0.0004187995,0.0006435828,0.000104450715,0.000008835423],"category_scores_gemma":[0.00002769621,0.00018783091,0.000088900924,0.00053274614,0.00005442356,0.00047491494,0.0001269374,0.00016820848,0.000022215736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003404846,0.00013967163,0.000102204,0.00017590412,0.00020621026,0.00008552593,0.0011146698,0.019879721,0.00078216795,0.062782705,0.012249064,0.9024481],"study_design_scores_gemma":[0.0003111965,0.00013182788,0.0001577082,0.000051978535,0.000014030568,0.00005570248,0.0000076055358,0.95892465,0.003326884,0.0030174043,0.033715233,0.00028579793],"about_ca_topic_score_codex":0.000015370395,"about_ca_topic_score_gemma":0.000001908399,"teacher_disagreement_score":0.9390449,"about_ca_system_score_codex":0.00006757588,"about_ca_system_score_gemma":0.00012122096,"threshold_uncertainty_score":0.7659522},"labels":[],"label_agreement":null},{"id":"W4391592232","doi":"10.3390/a17020075","title":"Assessing the Impact of Patient Characteristics on Genetic Clinical Pathways: A Regression Approach","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Statistical Methods in Clinical Trials","field":"Mathematics","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; Centre hospitalier universitaire de Québec","funders":"","keywords":"Regression; Computer science; Regression analysis; Computational biology; Statistics; Mathematics; Biology; Machine learning","score_opus":0.594224206129209,"score_gpt":0.6069177949075084,"score_spread":0.012693588778299403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391592232","genre_codex":"empirical","genre_gemma":"methods","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.6411808,0.00034936308,0.3504408,0.00016130507,0.003135307,0.0011566792,0.00025847956,0.0002491585,0.0030680515],"genre_scores_gemma":[0.41011998,0.000070693015,0.5889449,0.00005037616,0.00069639366,0.000033779976,0.0000038535713,0.000051725547,0.000028303573],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955447,0.0015416736,0.0015797869,0.00048298694,0.00054133317,0.00030953964],"domain_scores_gemma":[0.95433366,0.044301417,0.00039681976,0.000718426,0.00011121565,0.00013846358],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.003560162,0.00026260005,0.0007749268,0.00006704447,0.000084189094,0.00015889987,0.00031997476,0.00023924679,0.00010027766],"category_scores_gemma":[0.031171132,0.00013074097,0.0005292562,0.00029027776,0.00027311928,0.00006416932,0.00014096279,0.00068780885,0.000033428252],"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.000054151322,0.00082446996,0.0006303932,0.00020242165,0.00027170323,0.000096042546,0.00038538716,0.000009747216,0.00010105549,0.00898268,0.002378273,0.98606366],"study_design_scores_gemma":[0.0008158072,0.0023346152,0.03360382,0.0016114593,0.00039247546,0.000071802555,0.00031142723,0.12837446,0.00040153388,0.83122206,0.00032057424,0.0005399931],"about_ca_topic_score_codex":0.000008916228,"about_ca_topic_score_gemma":3.8492853e-8,"teacher_disagreement_score":0.9855237,"about_ca_system_score_codex":0.00006816395,"about_ca_system_score_gemma":0.00016013275,"threshold_uncertainty_score":0.97698975},"labels":[],"label_agreement":null},{"id":"W4392239242","doi":"10.3390/a17030105","title":"Artificial Intelligence Algorithms for Healthcare","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","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 Waterloo","funders":"","keywords":"Computer science; Health care; Artificial intelligence; Algorithm; Data science; Machine learning; Political science","score_opus":0.294210619071563,"score_gpt":0.4851282320287391,"score_spread":0.19091761295717613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392239242","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.026605483,0.013955454,0.81940854,0.11824832,0.015044633,0.003876687,0.00016768131,0.0013229805,0.0013702003],"genre_scores_gemma":[0.9385744,0.0006269701,0.048761275,0.002414034,0.006707347,0.00054309255,0.0002558191,0.00010828898,0.0020087846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796754,0.00003127248,0.0006441431,0.00054441,0.000289337,0.0005232889],"domain_scores_gemma":[0.9986367,0.0003763302,0.000045834404,0.00032402916,0.00032148734,0.00029562067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005309129,0.0002028436,0.0002924072,0.00023018634,0.00020280466,0.00010295421,0.00011569912,0.00020057375,0.00019205884],"category_scores_gemma":[0.00020802658,0.00018235017,0.00019593889,0.0005421992,0.000098027056,0.0001574482,0.00002314116,0.0003297161,0.0005666287],"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.000053580254,0.00008742354,0.00008296759,0.0004277814,0.00003889807,0.00004251013,0.0013088045,0.000007770004,0.00017933815,0.012674212,0.0022590675,0.9828376],"study_design_scores_gemma":[0.00004925019,0.0031063831,0.00027812045,0.0013626388,0.00033087216,0.0007750149,0.008259933,0.36177844,0.12082219,0.29869938,0.20350233,0.0010354512],"about_ca_topic_score_codex":0.0005642569,"about_ca_topic_score_gemma":0.000054843174,"teacher_disagreement_score":0.98180217,"about_ca_system_score_codex":0.00020320145,"about_ca_system_score_gemma":0.0005671218,"threshold_uncertainty_score":0.7436024},"labels":[],"label_agreement":null},{"id":"W4392659383","doi":"10.3390/a17030114","title":"Deep-Shallow Metaclassifier with Synthetic Minority Oversampling for Anomaly Detection in a Time Series","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Anomaly Detection Techniques and Applications","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 Alberta","funders":"Enbridge; Natural Sciences and Engineering Research Council of Canada","keywords":"Anomaly detection; Computer science; Oversampling; Anomaly (physics); Artificial intelligence; Deep learning; Pipeline (software); Series (stratigraphy); Machine learning; Time series; Pattern recognition (psychology); Geology","score_opus":0.012388342570198135,"score_gpt":0.24312112211814535,"score_spread":0.23073277954794721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392659383","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.0058905026,0.0001585096,0.9922421,0.00037261713,0.000095044335,0.00037033914,0.0000051523953,0.00050036056,0.00036537458],"genre_scores_gemma":[0.6296052,0.000020563515,0.36808932,0.00006030347,0.00011238647,0.00067248766,0.000004406213,0.000021692293,0.0014136732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990129,0.000019015368,0.00016925661,0.00043844388,0.00014437846,0.00021600412],"domain_scores_gemma":[0.9994705,0.00009261277,0.00003545209,0.0003040428,0.000047851383,0.000049579765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021380957,0.0001309558,0.00014030693,0.00016318777,0.000119047545,0.0002565577,0.00029693497,0.000073095565,0.00001170016],"category_scores_gemma":[0.000010531784,0.000113193804,0.00007265058,0.00058016693,0.000038762224,0.000510928,0.00006283707,0.000121737095,0.000030174073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006173733,0.00022311327,0.00039956713,0.00020146267,0.00016464539,0.00007295347,0.0007891829,0.00039652552,0.015890967,0.042410042,0.00016072529,0.9392291],"study_design_scores_gemma":[0.00019098917,0.0003255202,0.00097143935,0.00005001758,0.000033273445,0.00015224448,0.000033711498,0.94096017,0.03011703,0.0074652657,0.019383064,0.0003172852],"about_ca_topic_score_codex":0.00007682976,"about_ca_topic_score_gemma":0.000085245454,"teacher_disagreement_score":0.9405636,"about_ca_system_score_codex":0.00008014635,"about_ca_system_score_gemma":0.00003917599,"threshold_uncertainty_score":0.46159092},"labels":[],"label_agreement":null},{"id":"W4393006460","doi":"10.3390/a17030128","title":"On the Need for Accurate Brushstroke Segmentation of Tablet-Acquired Kinematic and Pressure Data: The Case of Unconstrained Tracing","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Shoulder Injury and Treatment","field":"Medicine","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":"Holland Bloorview Kids Rehabilitation Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tracing; Kinematics; Computer science; Artificial intelligence; Segmentation; Computer vision; Physics; Classical mechanics; Programming language","score_opus":0.059048926804416715,"score_gpt":0.354402584488308,"score_spread":0.2953536576838913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393006460","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.96634895,0.0041134735,0.015374546,0.007646523,0.00050079136,0.0036627885,0.0016604367,0.000067682326,0.00062483415],"genre_scores_gemma":[0.99740666,0.00002194672,0.0019958878,0.00010090457,0.00006345007,0.00006380997,0.000091439964,0.000011460441,0.00024441595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937946,0.00003722743,0.00022150551,0.00016384429,0.00010115898,0.00009678256],"domain_scores_gemma":[0.99874437,0.00078552845,0.0000709846,0.00033495954,0.000038413287,0.000025762203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031497568,0.00009702406,0.00018375747,0.000035408848,0.000066571716,0.000022110473,0.0000664178,0.000032704138,0.00003860591],"category_scores_gemma":[0.00008898133,0.000047524958,0.000041100324,0.00011425202,0.00009539157,0.00008635748,0.000026776423,0.0000516365,7.28509e-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.0026611616,0.0018374752,0.00047601783,0.013463593,0.01358563,0.003127875,0.026702262,0.001156099,0.122052066,0.03219173,0.020632045,0.76211405],"study_design_scores_gemma":[0.010732925,0.0042997203,0.0011164773,0.0024071042,0.013648258,0.00549554,0.028589688,0.6181228,0.30758923,0.005844357,0.0016305635,0.0005233011],"about_ca_topic_score_codex":0.00009798838,"about_ca_topic_score_gemma":0.0000107366695,"teacher_disagreement_score":0.7615907,"about_ca_system_score_codex":0.000007989445,"about_ca_system_score_gemma":0.000047288595,"threshold_uncertainty_score":0.19380115},"labels":[],"label_agreement":null},{"id":"W4393234702","doi":"10.3390/a17040139","title":"Testing a Vision-Based Autonomous Drone Navigation Model in a Forest Environment","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Robotic Path Planning 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":"","keywords":"Drone; Computer science; Artificial intelligence; Computer vision; Human–computer interaction","score_opus":0.024032155411139344,"score_gpt":0.265282071233722,"score_spread":0.24124991582258265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393234702","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.007771028,0.00041210107,0.98972404,0.00067791704,0.0003442622,0.00024970016,0.0000065622203,0.00050791714,0.0003064863],"genre_scores_gemma":[0.27636814,0.0000021818419,0.7232232,0.00010217871,0.000068675385,0.00006694944,0.00001632099,0.000023732086,0.00012861603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980154,0.00005302915,0.00036527996,0.0006973356,0.0004259889,0.00044296225],"domain_scores_gemma":[0.9989648,0.00031866337,0.000059041442,0.00051784154,0.000022692186,0.000116975054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005361005,0.00022012512,0.00020158265,0.00024344219,0.000090661386,0.00026216722,0.0005642369,0.00009928653,0.0000033827241],"category_scores_gemma":[0.00004647031,0.00021659677,0.00005778743,0.00061856135,0.000049753744,0.00048515128,0.00016596656,0.00029549372,0.00020149184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.840493e-7,0.000069358604,0.00034141686,0.000028331147,0.000006634755,0.00045728678,0.0004163424,0.82504773,0.00035842683,0.000626441,0.00007374632,0.17257331],"study_design_scores_gemma":[0.00025300233,0.00010723065,0.002255539,0.00028312363,0.0000060264547,0.000051859937,0.000006582253,0.9929148,0.00012764057,0.0035835372,0.00015818635,0.0002524465],"about_ca_topic_score_codex":0.000113900416,"about_ca_topic_score_gemma":0.0000013229961,"teacher_disagreement_score":0.26859713,"about_ca_system_score_codex":0.00029579634,"about_ca_system_score_gemma":0.00023850812,"threshold_uncertainty_score":0.883256},"labels":[],"label_agreement":null},{"id":"W4393254982","doi":"10.3390/a17040140","title":"Minimizing Voltage Ripple of a DC Microgrid via a Particle-Swarm-Optimization-Based Fuzzy Controller","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Microgrid Control and Optimization","field":"Engineering","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 Calgary","funders":"","keywords":"Microgrid; Control theory (sociology); Particle swarm optimization; Ripple; Voltage; Controller (irrigation); Fuzzy logic; Computer science; Swarm behaviour; Multi-swarm optimization; Mathematical optimization; Mathematics; Control (management); Engineering; Artificial intelligence; Electrical engineering; Biology","score_opus":0.005732228395483557,"score_gpt":0.19831366615624377,"score_spread":0.1925814377607602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393254982","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.00312489,0.014550519,0.97992,0.0001519183,0.00070693163,0.00037974026,0.00007268557,0.00067176536,0.00042151022],"genre_scores_gemma":[0.9363488,0.0004697515,0.06217564,0.0001656875,0.00037072,0.00011476983,0.000097106786,0.0001180898,0.00013943354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987952,0.000024066678,0.00042097448,0.0002524293,0.0001739636,0.00033335685],"domain_scores_gemma":[0.99945325,0.00013178072,0.000040477593,0.0001948193,0.00008702594,0.00009262137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016773755,0.00022038598,0.00031107545,0.00013225313,0.000052006017,0.00008728213,0.00013663394,0.00010686209,0.00015143903],"category_scores_gemma":[0.000020818114,0.00021294646,0.00015483856,0.0004286219,0.000045341585,0.00015741964,0.00001763083,0.00014300497,0.000053206935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020192172,0.000035707424,0.00004293491,0.000117652125,0.00013092619,0.000018926723,0.00017921875,0.9484395,0.013305753,0.00003184979,0.00071032945,0.036967006],"study_design_scores_gemma":[0.0010787889,0.000042132713,0.000017450475,0.0000703407,0.00008680851,0.000007740764,0.000025965262,0.9816607,0.012427921,0.000056214456,0.0042997804,0.00022615198],"about_ca_topic_score_codex":0.000029123234,"about_ca_topic_score_gemma":0.000005127463,"teacher_disagreement_score":0.9332239,"about_ca_system_score_codex":0.00005148009,"about_ca_system_score_gemma":0.000036824047,"threshold_uncertainty_score":0.8683704},"labels":[],"label_agreement":null},{"id":"W4395004638","doi":"10.3390/a17040167","title":"Evaluating Diffusion Models for the Automation of Ultrasonic Nondestructive Evaluation Data Analysis","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Flow Measurement and Analysis","field":"Engineering","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":"Automation; Ultrasonic sensor; Nondestructive testing; Computer science; Diffusion; Acoustics; Mechanical engineering; Engineering; Physics; Thermodynamics","score_opus":0.1341312036888487,"score_gpt":0.36286392379802485,"score_spread":0.22873272010917614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395004638","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.053286117,0.003021606,0.9425856,0.000054081618,0.00028317427,0.00038576336,0.00008910349,0.00012864613,0.00016592015],"genre_scores_gemma":[0.9810959,0.00009689434,0.018173426,0.0000028356887,0.000120343044,0.00006514926,0.00039704956,0.000016477325,0.000031893887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998842,0.000042002022,0.0002495111,0.00022001575,0.0005265582,0.000119936965],"domain_scores_gemma":[0.99907416,0.00027286776,0.000036640136,0.000446442,0.00015197576,0.00001790386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017165405,0.00010002723,0.00016381877,0.00018824771,0.00007218291,0.00005690356,0.00023469789,0.000041065705,0.000070154885],"category_scores_gemma":[0.00009414102,0.00007234898,0.00013110088,0.00087574363,0.000016604075,0.0003412658,0.000027272552,0.000066608794,0.000004398944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015200291,0.000005814768,0.000022792061,0.000043927004,0.001167462,9.009775e-8,0.00029011627,0.73688483,0.0040980773,0.00009169389,0.00008939296,0.25730428],"study_design_scores_gemma":[0.00014374273,0.00001499666,0.00046797746,0.00003049585,0.0041835527,4.0766142e-7,0.00012366437,0.9927308,0.0007039594,0.0014940732,0.00002257831,0.000083772895],"about_ca_topic_score_codex":0.00003284101,"about_ca_topic_score_gemma":0.000030173833,"teacher_disagreement_score":0.92780983,"about_ca_system_score_codex":0.00007292955,"about_ca_system_score_gemma":0.000030248373,"threshold_uncertainty_score":0.29503056},"labels":[],"label_agreement":null},{"id":"W4396232166","doi":"10.3390/a17050186","title":"Synesth: Comprehensive Syntenic Reconciliation with Unsampled Lineages","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Color perception and design","field":"Psychology","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":"Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Synteny; Computer science; Biology; Genetics; Genome; Gene","score_opus":0.05817741703776378,"score_gpt":0.34565108864466726,"score_spread":0.28747367160690346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396232166","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.7444491,0.007361882,0.17278126,0.006624478,0.010124948,0.0019018523,0.00014578165,0.0033231329,0.05328758],"genre_scores_gemma":[0.9688992,0.0000850688,0.0048838384,0.0011634801,0.00071405,0.00015676895,0.00008869704,0.000064044245,0.023944855],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895024,0.00009459035,0.000191234,0.0003828766,0.00015439308,0.00022666171],"domain_scores_gemma":[0.99924463,0.00027801082,0.000032441643,0.000261813,0.00010567064,0.00007741557],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011762405,0.00015050021,0.00017654405,0.00012843887,0.00006508838,0.000075730146,0.000098346165,0.00010550898,0.0047025196],"category_scores_gemma":[0.000013070256,0.00011991917,0.000068583635,0.00032065273,0.00006334717,0.000095238094,0.000014398553,0.0001953982,0.0037720562],"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.00048768273,0.00035459088,0.0013305154,0.0001490247,0.000905617,0.0017977946,0.012579031,0.00012178254,0.0030096348,0.013471792,0.122819126,0.8429734],"study_design_scores_gemma":[0.003123177,0.0021589678,0.101290844,0.00034730256,0.00035178714,0.0018456072,0.007040411,0.029448692,0.00033420185,0.001413012,0.8512344,0.0014116311],"about_ca_topic_score_codex":0.00015640346,"about_ca_topic_score_gemma":0.00003827463,"teacher_disagreement_score":0.8415618,"about_ca_system_score_codex":0.00005610267,"about_ca_system_score_gemma":0.000049111666,"threshold_uncertainty_score":0.9970036},"labels":[],"label_agreement":null},{"id":"W4396803394","doi":"10.3390/a17050205","title":"Three-Way Alignment Improves Multiple Sequence Alignment of Highly Diverged Sequences","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Multiple sequence alignment; Sequence (biology); Alignment-free sequence analysis; Sequence alignment; Structural alignment; Computer science; Computational biology; Artificial intelligence; Genetics; Biology; Peptide sequence; Gene","score_opus":0.019446228034199847,"score_gpt":0.25194643667053646,"score_spread":0.2325002086363366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396803394","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.98388195,0.011061179,0.0031152177,0.0002763208,0.00079084735,0.00028038738,0.00018701269,0.000013966149,0.00039314484],"genre_scores_gemma":[0.99363136,0.0012141842,0.0044622472,0.00007865058,0.00024311796,0.000048437858,0.000039585535,0.000020580414,0.00026181334],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988572,0.000020846477,0.00025416745,0.00042741015,0.00018428912,0.00025606333],"domain_scores_gemma":[0.99950236,0.000026778955,0.000058238504,0.0002913065,0.000055861157,0.000065453096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016261134,0.00018854432,0.00018238452,0.00003449516,0.000072474584,0.000027700455,0.00021706951,0.0000879241,0.000010788069],"category_scores_gemma":[0.000019540576,0.00015775548,0.00011993435,0.00008246672,0.00014382515,0.000001619151,0.0002036105,0.000051925494,0.000012234636],"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.000011516486,0.000031963562,0.0015680788,0.000039745788,0.00022825948,0.000011317214,0.00013627442,0.000055363696,0.9796613,0.00020887723,0.000685993,0.017361332],"study_design_scores_gemma":[0.00033723228,0.0005507398,0.005145098,0.00004429696,0.00006604525,0.00001727811,0.00018330863,0.0019372131,0.9589795,0.0013304217,0.031062782,0.00034610444],"about_ca_topic_score_codex":0.00027566557,"about_ca_topic_score_gemma":0.000068338726,"teacher_disagreement_score":0.03037679,"about_ca_system_score_codex":0.00002407093,"about_ca_system_score_gemma":0.00006181625,"threshold_uncertainty_score":0.64330816},"labels":[],"label_agreement":null},{"id":"W4396806155","doi":"10.3390/a17050202","title":"Enforcing Traffic Safety: A Deep Learning Approach for Detecting Motorcyclists’ Helmet Violations Using YOLOv8 and Deep Convolutional Generative Adversarial Network-Generated Images","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Traffic and Road Safety","field":"Engineering","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 British Columbia","funders":"","keywords":"Adversarial system; Computer science; Artificial intelligence; Generative adversarial network; Deep learning; Convolutional neural network; Generative grammar; Machine learning; Computer security","score_opus":0.013682792107842158,"score_gpt":0.23205115923233186,"score_spread":0.2183683671244897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396806155","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.041282482,0.007163625,0.94899064,0.000013191781,0.0010515129,0.0004501278,0.00004100095,0.000745964,0.0002614608],"genre_scores_gemma":[0.80050653,0.00019700409,0.19717008,0.000012475008,0.0016943654,0.00005451725,0.00021524217,0.00008141685,0.00006833631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845606,0.00006988777,0.00038755746,0.00041350134,0.00016012286,0.0005128621],"domain_scores_gemma":[0.9994166,0.00025188382,0.000044277414,0.00010226911,0.00007119006,0.00011381923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036474282,0.00029952315,0.0003063784,0.00013343559,0.00066566444,0.00015138196,0.00008777876,0.0001920413,0.000017838887],"category_scores_gemma":[0.000044207805,0.00030208196,0.00012355801,0.00037243546,0.00007228892,0.00028105982,0.00004125407,0.0004092796,0.0000028991738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021434093,0.000007678945,0.000041473722,0.00007301154,0.0002032206,0.0000075108055,0.0008640323,0.9285178,0.0009761874,0.00017780186,0.000030218074,0.0690796],"study_design_scores_gemma":[0.0005940643,0.00004238616,0.00018910691,0.000055075438,0.00012032301,0.00007963942,0.0003577601,0.99684477,0.00017859896,0.000033646087,0.001146117,0.00035848632],"about_ca_topic_score_codex":0.000016862221,"about_ca_topic_score_gemma":0.000014217582,"teacher_disagreement_score":0.75922406,"about_ca_system_score_codex":0.00018932663,"about_ca_system_score_gemma":0.00005226779,"threshold_uncertainty_score":0.99994314},"labels":[],"label_agreement":null},{"id":"W4398138850","doi":"10.3390/a17050219","title":"The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Optimization and Packing Problems","field":"Engineering","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Bipartite graph; Multipartite; Mathematics; Combinatorics; Integer programming; Discrete mathematics; Mathematical optimization; Computer science; Graph","score_opus":0.013115610279355849,"score_gpt":0.2225104173048545,"score_spread":0.20939480702549865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398138850","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.13433596,0.069277406,0.25556645,0.027815137,0.012753777,0.009413163,0.00070544257,0.027143398,0.46298927],"genre_scores_gemma":[0.98377955,0.002181983,0.011029938,0.00032309417,0.000085359876,0.000087084874,0.000025916219,0.00010513758,0.0023819637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994191,0.000015130217,0.000116351985,0.00015235842,0.0001074389,0.00018962186],"domain_scores_gemma":[0.9996242,0.00012652925,0.00000963933,0.0001395891,0.00002796646,0.00007206642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012443686,0.00012332859,0.00008720992,0.000054295408,0.00012964476,0.00017005792,0.000054595577,0.00004352797,0.000047321417],"category_scores_gemma":[0.000005582794,0.000075691394,0.000023775325,0.00020780711,0.00015297954,0.00006163187,0.00001059109,0.00016175535,0.00005937254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027875072,0.000059976403,0.00054102764,0.00036841104,0.0006924368,0.0002342778,0.003709422,0.14148699,0.0005867811,0.09380694,0.049787402,0.70869845],"study_design_scores_gemma":[0.0005321958,0.0002332802,0.00058954715,0.00051188556,0.000053585183,0.00019045609,0.00018137603,0.6212844,0.00059158634,0.0015641022,0.37380627,0.0004612665],"about_ca_topic_score_codex":0.0000037735576,"about_ca_topic_score_gemma":0.000006676643,"teacher_disagreement_score":0.84944355,"about_ca_system_score_codex":0.0000092161235,"about_ca_system_score_gemma":0.000014277393,"threshold_uncertainty_score":0.30866054},"labels":[],"label_agreement":null},{"id":"W4399091994","doi":"10.3390/a17060234","title":"Unleashing the Power of Tweets and News in Stock-Price Prediction Using Machine-Learning Techniques","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Stock price; Computer science; Stock (firearms); Artificial intelligence; Machine learning; Predictive power; Sentiment analysis; Econometrics; Economics; History","score_opus":0.09190739289537232,"score_gpt":0.3989999113664047,"score_spread":0.3070925184710324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399091994","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.7848913,0.0025910558,0.20491274,0.00053010945,0.0009961457,0.00047717048,0.000017260461,0.0002393369,0.005344889],"genre_scores_gemma":[0.8802527,0.000042891515,0.11908146,0.0000508645,0.00012637058,0.000012752978,0.0000011080175,0.000029288745,0.0004025478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733853,0.00070175674,0.0005654533,0.00043136155,0.0007436094,0.00021925836],"domain_scores_gemma":[0.99590147,0.0034763697,0.00015772761,0.0003112755,0.00010335444,0.00004981459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075732823,0.00013916481,0.0002426102,0.00044960182,0.00013714684,0.00024959794,0.0003515228,0.00009217297,0.0000661988],"category_scores_gemma":[0.0043448466,0.00008771743,0.00006794385,0.0013489586,0.00011069417,0.00035765042,0.0002484969,0.0004447494,0.000003585663],"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.000021564887,0.000018004226,0.06336185,0.000016964079,0.000021795096,0.000027154718,0.0034630522,0.00027562884,0.0036271065,0.00015795749,0.00018746087,0.92882144],"study_design_scores_gemma":[0.00020709349,0.0002003032,0.04518961,0.0003934462,0.00003442326,0.00024247229,0.00218466,0.9165895,0.0033459265,0.013617225,0.017732646,0.00026270782],"about_ca_topic_score_codex":0.00051270536,"about_ca_topic_score_gemma":0.0000305434,"teacher_disagreement_score":0.92855877,"about_ca_system_score_codex":0.00005760691,"about_ca_system_score_gemma":0.00005152928,"threshold_uncertainty_score":0.5201501},"labels":[],"label_agreement":null},{"id":"W4399290995","doi":"10.3390/a17060238","title":"Simple Histogram Equalization Technique Improves Performance of VGG Models on Facial Emotion Recognition Datasets","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Emotion and Mood Recognition","field":"Psychology","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 Winnipeg","funders":"","keywords":"Histogram equalization; Adaptive histogram equalization; Computer science; Histogram; Simple (philosophy); Pattern recognition (psychology); Artificial intelligence; Equalization (audio); Histogram matching; Computer vision; Image (mathematics); Algorithm","score_opus":0.05486558358259571,"score_gpt":0.3333654704945068,"score_spread":0.27849988691191113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399290995","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.47465447,0.0005151034,0.47543147,0.00028113197,0.005885705,0.0026346715,0.003568482,0.0013655262,0.035663456],"genre_scores_gemma":[0.99057287,0.00011675129,0.0016557118,0.00015819333,0.00026027512,0.00017485474,0.006598279,0.000038899376,0.00042414473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987731,0.000103701015,0.0003491653,0.00036655556,0.00020241877,0.00020508493],"domain_scores_gemma":[0.9994831,0.000047490317,0.0001021173,0.00022895554,0.000085040665,0.000053295957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031757916,0.0001574234,0.00015849703,0.0002894551,0.00007675995,0.00003086896,0.00009213505,0.00019848332,0.00046757114],"category_scores_gemma":[0.000018221286,0.00015442118,0.00007753871,0.00030410246,0.00005294108,0.000335877,0.000021684142,0.0001906934,0.0003257029],"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.00006822663,0.00024747316,0.0000073540946,0.00014174754,0.00004669443,0.000008199213,0.0006578354,0.00005410901,0.007010191,0.001315802,0.0053903274,0.98505205],"study_design_scores_gemma":[0.005421271,0.010382624,0.004752781,0.0022220858,0.00072722905,0.00048428666,0.002114107,0.5751518,0.19376494,0.09803782,0.1036449,0.0032961867],"about_ca_topic_score_codex":0.000087883534,"about_ca_topic_score_gemma":0.000005501444,"teacher_disagreement_score":0.98175585,"about_ca_system_score_codex":0.00006098229,"about_ca_system_score_gemma":0.000027056956,"threshold_uncertainty_score":0.62971133},"labels":[],"label_agreement":null},{"id":"W4399386969","doi":"10.3390/a17060246","title":"Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Data Management 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","keywords":"Computer science; Upper and lower bounds; Mathematical optimization; Mathematics; Mathematical analysis","score_opus":0.011892679398638221,"score_gpt":0.24317464642662545,"score_spread":0.23128196702798723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399386969","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.005755265,0.00093314314,0.9855203,0.0021131986,0.0033590242,0.00058833143,0.00013483013,0.0006717152,0.00092416623],"genre_scores_gemma":[0.016319267,0.000059833557,0.9502992,0.0008126678,0.0014012322,0.00027578446,0.00037012633,0.00006894366,0.030392937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816036,0.00003764142,0.00028947415,0.0006866921,0.00033832132,0.00048748153],"domain_scores_gemma":[0.9991837,0.00011614645,0.000049083406,0.00044894227,0.00007365595,0.00012845987],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000430774,0.00022225702,0.00021163958,0.00027661273,0.00028479003,0.0012146496,0.00075611396,0.000068550384,0.000108847824],"category_scores_gemma":[0.000050201048,0.00022231214,0.00013225645,0.0003918065,0.000040609433,0.0015280652,0.0005997147,0.00009770984,0.00061774475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003878524,0.00020887991,0.00006592564,0.0006320672,0.0005956518,0.001012578,0.0030107144,0.0014699982,0.02129479,0.050105125,0.25816885,0.66339666],"study_design_scores_gemma":[0.0003709749,0.00016569317,0.00016833744,0.00015766945,0.000051054787,0.000040663883,0.000062702515,0.9262614,0.0013159192,0.008534106,0.062308714,0.00056274247],"about_ca_topic_score_codex":0.00006573423,"about_ca_topic_score_gemma":0.000006140728,"teacher_disagreement_score":0.9247914,"about_ca_system_score_codex":0.00013212285,"about_ca_system_score_gemma":0.000060783947,"threshold_uncertainty_score":0.9998222},"labels":[],"label_agreement":null},{"id":"W4399743014","doi":"10.3390/a17060267","title":"Semi-Self-Supervised Domain Adaptation: Developing Deep Learning Models with Limited Annotated Data for Wheat Head Segmentation","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Domain Adaptation and Few-Shot Learning","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 Calgary","funders":"","keywords":"Domain adaptation; Computer science; Artificial intelligence; Head (geology); Segmentation; Adaptation (eye); Domain (mathematical analysis); Machine learning; Deep learning; Training set; Pattern recognition (psychology); Mathematics; Psychology; Biology","score_opus":0.08303672847703203,"score_gpt":0.29578710347106485,"score_spread":0.21275037499403282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399743014","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.0018131982,0.00074078364,0.9933037,0.0015833932,0.0003664786,0.0005736357,0.000013954912,0.001149386,0.00045542882],"genre_scores_gemma":[0.05209255,0.0000987656,0.9460839,0.0003853634,0.00013871695,0.000111116955,0.0007272866,0.000052155174,0.0003101466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762803,0.0001598582,0.00038851213,0.0009006193,0.0004750408,0.0004479129],"domain_scores_gemma":[0.9986172,0.00036028796,0.000096195545,0.0005780132,0.00021912264,0.0001292126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069676695,0.0002691307,0.00023537934,0.00025099202,0.0004244348,0.00080321054,0.0007935316,0.00009088729,0.000011508976],"category_scores_gemma":[0.00003912565,0.00024680662,0.000050113802,0.0010848165,0.00003432773,0.002525421,0.0002113367,0.00027618412,0.000041659525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084029976,0.00009062644,0.000077562,0.00028024436,0.0003868815,0.0001617312,0.03159756,0.19192763,0.0008943072,0.034487635,0.0004958851,0.7395159],"study_design_scores_gemma":[0.0009579273,0.00016146836,0.000072448966,0.00014747145,0.00002755932,0.000060302187,0.00171647,0.98041475,0.000089942565,0.001710585,0.014267229,0.00037387534],"about_ca_topic_score_codex":0.00003343746,"about_ca_topic_score_gemma":0.00003409459,"teacher_disagreement_score":0.7884871,"about_ca_system_score_codex":0.00014063893,"about_ca_system_score_gemma":0.00025308665,"threshold_uncertainty_score":0.9999984},"labels":[],"label_agreement":null},{"id":"W4399976912","doi":"10.3390/a17070277","title":"Algorithmic Implementation of Visually Guided Interceptive Actions: Harmonic Ratios and Stimulation Invariants","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Visual perception and processing mechanisms","field":"Neuroscience","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":"Glenrose Rehabilitation Hospital; University of Alberta","funders":"National Research Foundation of Korea","keywords":"Computer science; Harmonic; Stimulation; Artificial intelligence; Theoretical computer science; Psychology; Acoustics; Physics; Neuroscience","score_opus":0.11861427464549859,"score_gpt":0.4199568452309379,"score_spread":0.30134257058543934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399976912","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.71590424,0.00016764458,0.27962545,0.0007194003,0.0013186309,0.00089331385,0.00009818058,0.00040689958,0.0008662868],"genre_scores_gemma":[0.9956474,0.00013559396,0.003413775,0.00028633323,0.000107654305,0.000034826106,0.000016565607,0.000023835271,0.0003340465],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872684,0.000111062385,0.0003441949,0.00039504282,0.00025357518,0.000169274],"domain_scores_gemma":[0.9995581,0.00011257673,0.00008809923,0.00011235109,0.0000656435,0.00006326456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023332243,0.00014338842,0.00014580143,0.00021453593,0.00013680813,0.00016508556,0.00009906501,0.000066557426,0.00068391225],"category_scores_gemma":[0.00007044054,0.000136156,0.00004444665,0.00038087607,0.000071563714,0.0006301637,0.000052872725,0.00013264567,0.000094305906],"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.000010192753,0.000029370325,0.000027898295,0.00006221213,0.000012009827,0.00000860201,0.002832486,0.00001858836,0.63735604,0.0017673695,0.0003164737,0.3575588],"study_design_scores_gemma":[0.0012452534,0.0006952992,0.003923752,0.0002231842,0.0000860395,0.0001412905,0.002686642,0.27089483,0.7097692,0.008159745,0.0017064692,0.00046831588],"about_ca_topic_score_codex":0.000058549307,"about_ca_topic_score_gemma":0.0000094939205,"teacher_disagreement_score":0.35709047,"about_ca_system_score_codex":0.000059653335,"about_ca_system_score_gemma":0.0000939334,"threshold_uncertainty_score":0.748836},"labels":[],"label_agreement":null},{"id":"W4400408820","doi":"10.3390/a17070303","title":"On Implementing a Two-Step Interior Point Method for Solving Linear Programs","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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 Lethbridge","funders":"","keywords":"Interior point method; Point (geometry); Algorithm; Mathematical optimization; Mathematics; Dual (grammatical number); Regular polygon; Linear programming; Computer science; Inverse; Value (mathematics); Applied mathematics; Geometry; Statistics","score_opus":0.07593134455603959,"score_gpt":0.45626274862926486,"score_spread":0.3803314040732253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400408820","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.00021980163,0.00013267055,0.9956432,0.0005637202,0.00042205406,0.001457518,0.00004188834,0.0005790296,0.0009400949],"genre_scores_gemma":[0.0008940012,0.000013732556,0.9947888,0.00011322407,0.00047417302,0.0005980305,0.00005205796,0.00015291225,0.0029130322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975151,0.00007880102,0.00055151246,0.0006124317,0.00045779682,0.00078437105],"domain_scores_gemma":[0.997583,0.0015259972,0.00009952073,0.00040272478,0.00024212133,0.00014665212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001603019,0.0002816772,0.00034906223,0.0002619421,0.00022303246,0.00025964616,0.00029259903,0.00008404044,0.00025320466],"category_scores_gemma":[0.00086062745,0.00024808708,0.00022391957,0.00047743352,0.000043477976,0.00025746756,0.00023060165,0.00036037187,0.00007931178],"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.000036811714,0.00012037299,0.000002838615,0.0004605044,0.00019703723,0.00006177224,0.0009047478,0.00026272685,0.0005389594,0.045740005,0.0020952767,0.94957894],"study_design_scores_gemma":[0.00075523084,0.00030433486,3.1019383e-7,0.00030120966,0.000043308224,0.000041509178,0.00042799735,0.9290216,0.002375914,0.048168562,0.018273884,0.00028616076],"about_ca_topic_score_codex":0.00002062032,"about_ca_topic_score_gemma":0.000017413584,"teacher_disagreement_score":0.9492928,"about_ca_system_score_codex":0.00017983736,"about_ca_system_score_gemma":0.000088543726,"threshold_uncertainty_score":0.99999714},"labels":[],"label_agreement":null},{"id":"W4400576495","doi":"10.3390/a17070310","title":"Messy Broadcasting in Grid","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Distributed and Parallel Computing Systems","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":"Concordia University","funders":"","keywords":"Computer science; Distributed computing; Scalability; Robustness (evolution); Grid; Broadcasting (networking); Fault tolerance; Node (physics); Focus (optics); Theoretical computer science; Set (abstract data type); Computer network; Database","score_opus":0.014582674151675364,"score_gpt":0.2630596049171663,"score_spread":0.24847693076549093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400576495","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.00637919,0.0028523887,0.9707131,0.0007559295,0.0069729974,0.000121426456,0.000007436224,0.00077506894,0.011422481],"genre_scores_gemma":[0.9789618,0.000012373732,0.019298228,0.00010143038,0.00097167474,0.000011111094,0.000009529178,0.00001236985,0.0006214766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989277,0.000048211932,0.0002093923,0.00035143484,0.00018392481,0.00027933295],"domain_scores_gemma":[0.9995239,0.00011853548,0.000021412845,0.00026156858,0.000020544881,0.000054068933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039275695,0.00010405655,0.00012779869,0.00011902755,0.000043803415,0.0003610883,0.0005361873,0.000044369524,0.000007726482],"category_scores_gemma":[0.000018965535,0.00009416057,0.00004844326,0.00070845796,0.000012915572,0.00027140233,0.00015477368,0.00016324321,0.00026789933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019529755,0.00009215285,0.0013753795,0.00020581744,0.00005654295,0.002463618,0.0037699903,0.00978625,0.00017392922,0.07021745,0.03546073,0.8763962],"study_design_scores_gemma":[0.000101456564,0.000023116865,0.0007048201,0.00017820543,0.0000015364243,0.00013978437,0.000016278978,0.900578,0.000048343867,0.0010798005,0.09697196,0.00015665466],"about_ca_topic_score_codex":0.000095719464,"about_ca_topic_score_gemma":0.0000036163901,"teacher_disagreement_score":0.97258264,"about_ca_system_score_codex":0.000038423506,"about_ca_system_score_gemma":0.000058196732,"threshold_uncertainty_score":0.38397565},"labels":[],"label_agreement":null},{"id":"W4401206271","doi":"10.3390/a17080338","title":"Design of Multichannel Spectrum Intelligence Systems Using Approximate Discrete Fourier Transform Algorithm for Antenna Array-Based Spectrum Perception Applications","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"National Research Council Canada; Herzberg Institute of Astrophysics","funders":"","keywords":"Fast Fourier transform; Computer science; Algorithm; Wideband; Cognitive radio; Discrete Fourier transform (general); Fourier transform; Electronic engineering; Telecommunications; Wireless; Mathematics; Fractional Fourier transform; Engineering","score_opus":0.032687629557926534,"score_gpt":0.27821967805788145,"score_spread":0.2455320484999549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401206271","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.000031341377,0.0011229811,0.995271,0.0006071108,0.00083279365,0.0016874495,0.00008305871,0.00030719102,0.00005701965],"genre_scores_gemma":[0.1690425,0.00015679162,0.82976997,0.00004413191,0.0006451942,0.00016311987,0.000033166863,0.0000657111,0.000079419195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973892,0.00009896263,0.0005998702,0.00086282025,0.00039093127,0.0006581971],"domain_scores_gemma":[0.9986709,0.00036326956,0.00013520916,0.0005319178,0.00015144936,0.00014726951],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062839576,0.0003530109,0.00044340227,0.00029333011,0.0002765995,0.0003942203,0.00045654757,0.00013147396,0.0000069792945],"category_scores_gemma":[0.000009978036,0.00033378162,0.0002477,0.0009701593,0.00013116903,0.00047851403,0.000042645,0.0002385304,0.000010966151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003771915,0.00022263393,0.00000290515,0.0005555627,0.0002733466,0.00009917191,0.0017043047,0.06965192,0.012602119,0.009724747,0.000027744743,0.90509784],"study_design_scores_gemma":[0.00023871294,0.00016905487,0.0000035384005,0.00028895692,0.00008464369,0.0001514314,0.00020029861,0.9791633,0.008595012,0.010484926,0.00021532994,0.00040482954],"about_ca_topic_score_codex":0.000076086246,"about_ca_topic_score_gemma":0.000005926379,"teacher_disagreement_score":0.9095113,"about_ca_system_score_codex":0.00020027731,"about_ca_system_score_gemma":0.00022546071,"threshold_uncertainty_score":0.9999114},"labels":[],"label_agreement":null},{"id":"W4401389220","doi":"10.3390/a17080344","title":"Inversion-Based Deblending in Common Midpoint Domain Using Time Domain High-Resolution Radon","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Geophysical Methods and Applications","field":"Engineering","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 Calgary","funders":"","keywords":"Midpoint; Inversion (geology); Radon; Time domain; Radon transform; Geology; High resolution; Domain (mathematical analysis); Geodesy; Mathematics; Remote sensing; Geometry; Computer science; Seismology; Mathematical analysis; Physics; Computer vision","score_opus":0.01313775342726043,"score_gpt":0.2557253331229838,"score_spread":0.24258757969572337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401389220","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.73465645,0.00031532117,0.26344648,0.0003391687,0.00032828865,0.00022202,0.000022859384,0.0003754581,0.00029396935],"genre_scores_gemma":[0.72192204,0.000008306299,0.2777091,0.000043834425,0.0001793174,0.0000355863,0.0000327781,0.00004414372,0.000024917392],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911475,0.000059692597,0.00021395831,0.00021343572,0.00013232243,0.00026586195],"domain_scores_gemma":[0.9995498,0.00017074498,0.000015137196,0.00018475008,0.000009205701,0.00007038074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002410589,0.00014648377,0.00018737375,0.00015528893,0.00006815498,0.00005019711,0.00010479913,0.00008128575,0.000049632235],"category_scores_gemma":[0.000005259124,0.00014785428,0.00006620049,0.0005126957,0.000031310527,0.00009720886,0.000027749209,0.00021541085,0.0001582728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019865021,0.00019857216,0.00016819497,0.00045510198,0.000100841986,0.00019560431,0.00067599537,0.20619532,0.6089647,0.014247785,0.0016191462,0.16715886],"study_design_scores_gemma":[0.00023430529,0.000017135699,0.0005402074,0.00016372142,0.000013093115,0.0000035853518,0.000031282194,0.9734201,0.0037516248,0.019448135,0.0021787283,0.00019810475],"about_ca_topic_score_codex":0.00020896262,"about_ca_topic_score_gemma":0.000007832672,"teacher_disagreement_score":0.7672247,"about_ca_system_score_codex":0.00021854635,"about_ca_system_score_gemma":0.000018191691,"threshold_uncertainty_score":0.6029323},"labels":[],"label_agreement":null},{"id":"W4401425951","doi":"10.3390/a17080347","title":"Classification and Regression of Pinhole Corrosions on Pipelines Based on Magnetic Flux Leakage Signals Using Convolutional Neural Networks","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Non-Destructive Testing Techniques","field":"Engineering","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":"Western University","funders":"","keywords":"Convolutional neural network; Pinhole (optics); Magnetic flux leakage; Computer science; Pipeline transport; Integrity management; Artificial neural network; Deep learning; Leakage (economics); Pinhole camera; Artificial intelligence; Pipeline (software); Finite element method; Pattern recognition (psychology); Optics; Engineering; Structural engineering; Mechanical engineering; Physics","score_opus":0.0343583286751648,"score_gpt":0.2819269094442049,"score_spread":0.2475685807690401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401425951","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.5017258,0.002080514,0.4905042,0.00018033742,0.0014716871,0.00057429395,0.00006997188,0.0017830157,0.0016101702],"genre_scores_gemma":[0.92914385,0.000015709942,0.07056065,0.00003071335,0.00014103812,0.000015000313,0.000032482647,0.000040564253,0.000020021527],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917245,0.000043362106,0.00022044603,0.00022509064,0.00017574495,0.00016288333],"domain_scores_gemma":[0.9993705,0.0003068984,0.000035298992,0.00018080264,0.00005483348,0.000051663974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014419592,0.00017038661,0.0001575184,0.00016595735,0.0000641384,0.000033896897,0.00008011399,0.00009710453,0.000034513436],"category_scores_gemma":[0.00005233111,0.00014825148,0.000042304677,0.00023736502,0.00009155556,0.000077506586,0.000020511201,0.00022595166,0.0000034827463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008809404,0.00017545775,0.0042004725,0.0005306397,0.000034210134,0.00008446577,0.00014708706,0.3065367,0.6063115,0.00695971,0.0055353036,0.06939637],"study_design_scores_gemma":[0.000120986915,0.00015146506,0.0055271876,0.0005716352,0.000019691232,0.000013578544,0.0000086513455,0.98917943,0.0024817132,0.0017573559,0.00002727591,0.00014102072],"about_ca_topic_score_codex":0.000010895399,"about_ca_topic_score_gemma":6.2235205e-7,"teacher_disagreement_score":0.68264276,"about_ca_system_score_codex":0.00006630721,"about_ca_system_score_gemma":0.000018184774,"threshold_uncertainty_score":0.604552},"labels":[],"label_agreement":null},{"id":"W4401894174","doi":"10.3390/a17090377","title":"Star Bicolouring of Bipartite Graphs","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Constraint Satisfaction and Optimization","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 Northern British Columbia; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Star (game theory); Combinatorics; Mathematics; Computer science; Graph; Mathematical analysis","score_opus":0.012670345737966942,"score_gpt":0.24758944935122024,"score_spread":0.2349191036132533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401894174","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.013371324,0.00039072038,0.9827158,0.00067555025,0.0009121488,0.000073522206,0.0000035592484,0.00028924792,0.0015681324],"genre_scores_gemma":[0.83690786,0.000095575815,0.1625553,0.00008135576,0.00004015015,0.000006296664,0.000002103367,0.0000071037575,0.00030424286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999498,0.000014268689,0.000121955636,0.000152209,0.000118960095,0.000094601244],"domain_scores_gemma":[0.9997274,0.000037005935,0.00002027404,0.00015009343,0.00003037318,0.000034795758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103066755,0.000050379585,0.000062429826,0.00014360271,0.000029207971,0.00007380399,0.00013688795,0.000023641487,0.0000596534],"category_scores_gemma":[0.0000074189593,0.0000465157,0.000042382097,0.00044484955,0.000025404615,0.00028371485,0.000044655586,0.00005369323,0.000038600774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011327153,0.000024497076,0.00063023,0.00004465285,0.000043389955,0.00004216629,0.00086981547,0.0009828642,0.0016853885,0.16307081,0.00073638937,0.83186865],"study_design_scores_gemma":[0.000119472716,0.00004964775,0.0039115543,0.000053954092,0.0000074676536,0.0000310234,0.000025522377,0.97495705,0.0050093145,0.0062196124,0.009481104,0.00013430492],"about_ca_topic_score_codex":0.0000156065,"about_ca_topic_score_gemma":0.000003781479,"teacher_disagreement_score":0.97397417,"about_ca_system_score_codex":0.000011310039,"about_ca_system_score_gemma":0.00003761255,"threshold_uncertainty_score":0.18968551},"labels":[],"label_agreement":null},{"id":"W4402146772","doi":"10.3390/a17090383","title":"Correlations between Social Isolation and Functional Decline in Older Adults after Lower Limb Fractures Using Multimodal Sensors: A Pilot Study","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Health disparities and outcomes","field":"Social Sciences","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":"Toronto Rehabilitation Institute; University of Toronto; University Health Network","funders":"","keywords":"Social isolation; Isolation (microbiology); Physical medicine and rehabilitation; Lower limb; Multimodal therapy; Older people; Gerontology; Psychology; Physical therapy; Medicine; Psychiatry; Surgery; Psychotherapist; Bioinformatics; Biology","score_opus":0.039648300049802944,"score_gpt":0.36203487164797304,"score_spread":0.3223865715981701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402146772","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.99347425,0.0003339473,0.0016615168,0.0030458958,0.0008117349,0.0004669705,0.00003270263,0.000061781975,0.0001112228],"genre_scores_gemma":[0.997186,0.000014828352,0.00058286445,0.00040675307,0.0015636708,0.00002711087,0.000013188903,0.000013982823,0.00019159848],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987291,0.00015103973,0.00026397165,0.0002531982,0.00031285494,0.00028983442],"domain_scores_gemma":[0.9993485,0.0004159699,0.000035249635,0.00005288053,0.00005603849,0.00009133362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044265532,0.00010919637,0.0001606148,0.00012412555,0.00042928834,0.0001435943,0.0000414965,0.0000904419,0.00024852742],"category_scores_gemma":[0.00008876027,0.00010323003,0.00003632322,0.0002567429,0.000080662845,0.0002988355,0.000040145795,0.000229422,0.000015380432],"study_design_candidate":"observational","study_design_consensus":"observational","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.00023664837,0.00051409035,0.9351033,0.00007157192,0.00005850778,0.00006022363,0.04263002,0.00014311694,0.0000010606551,0.00028209033,0.0004160678,0.020483289],"study_design_scores_gemma":[0.0005167805,0.00011446829,0.9804445,0.00006300212,0.000027394673,7.2526586e-7,0.004734968,0.01273557,1.8700955e-7,0.00019253067,0.001044386,0.00012548076],"about_ca_topic_score_codex":0.01218889,"about_ca_topic_score_gemma":0.008037196,"teacher_disagreement_score":0.045341194,"about_ca_system_score_codex":0.00011774202,"about_ca_system_score_gemma":0.00014768034,"threshold_uncertainty_score":0.99438906},"labels":[],"label_agreement":null},{"id":"W4402282043","doi":"10.3390/a17090392","title":"Correction: Reshadi et al. Deep-Shallow Metaclassifier with Synthetic Minority Oversampling for Anomaly Detection in a Time Series. Algorithms 2024, 17, 114","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Anomaly Detection Techniques and Applications","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":"Oversampling; Series (stratigraphy); Anomaly (physics); Computer science; Algorithm; Anomaly detection; Wish; Artificial intelligence; Geology; Telecommunications; Physics; Art; Literature","score_opus":0.014431596062621128,"score_gpt":0.2619960801712845,"score_spread":0.24756448410866339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402282043","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.0007859475,0.00034106502,0.9922133,0.0023527478,0.0009783724,0.00078533194,0.000024046454,0.0008634579,0.0016557465],"genre_scores_gemma":[0.13105285,0.0003654547,0.81668025,0.002965803,0.00067253,0.0042436225,0.00007412329,0.00018868939,0.043756694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977068,0.000071119684,0.00040281127,0.0010039058,0.00036555302,0.00044983026],"domain_scores_gemma":[0.99872845,0.000265408,0.000105087376,0.0006249221,0.00014413473,0.0001319768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006751516,0.000314067,0.00031489268,0.00036589647,0.00026812658,0.00053288415,0.00052969524,0.00015698669,0.000064689695],"category_scores_gemma":[0.000035658926,0.00029045125,0.00017050558,0.0013833188,0.00008515463,0.0009840666,0.00014484287,0.00043912116,0.000057179077],"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.00018768874,0.00059430604,0.00031893852,0.00017559528,0.00043601048,0.00022686673,0.0011985425,0.0014820383,0.00807682,0.00872923,0.033506516,0.94506747],"study_design_scores_gemma":[0.00030395918,0.00046413802,0.00054808153,0.00009774094,0.00004733219,0.00039817987,0.000054998905,0.7776441,0.0077250795,0.0015998271,0.21065015,0.00046642235],"about_ca_topic_score_codex":0.00027162844,"about_ca_topic_score_gemma":0.00029085545,"teacher_disagreement_score":0.944601,"about_ca_system_score_codex":0.00023784721,"about_ca_system_score_gemma":0.00012742233,"threshold_uncertainty_score":0.99995476},"labels":[],"label_agreement":null},{"id":"W4402677380","doi":"10.3390/a17090420","title":"An Algorithm to Find the Shortest Path through Obstacles of Arbitrary Shapes and Positions in 2D","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Robotic Path Planning 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":"Royal Military College of Canada","funders":"","keywords":"Shortest path problem; Path (computing); Algorithm; Computer science; Shortest Path Faster Algorithm; K shortest path routing; Yen's algorithm; Mathematics; Combinatorics; Mathematical optimization; Dijkstra's algorithm; Graph","score_opus":0.01892442466466172,"score_gpt":0.2890340159810184,"score_spread":0.2701095913163567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402677380","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.020152895,0.0034269954,0.9715284,0.002861777,0.0006163089,0.0004575784,0.00011010075,0.00029757732,0.0005483799],"genre_scores_gemma":[0.15772758,0.00011374109,0.8410887,0.00066025485,0.00020620183,0.00006396926,0.00001771675,0.00003201221,0.00008981347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979813,0.000122433,0.00040478096,0.00067234464,0.00039263428,0.00042648712],"domain_scores_gemma":[0.99875796,0.00041481358,0.000049344606,0.00057656504,0.00005962535,0.00014169139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046052676,0.00024543775,0.00028711976,0.0001974571,0.00014162804,0.00031582074,0.00092799065,0.00009888778,0.000007865908],"category_scores_gemma":[0.00003227188,0.00018756615,0.00006380409,0.0010596327,0.00012884226,0.00090045884,0.00023964421,0.00033016512,0.000026870099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000554986,0.0004188486,0.000947081,0.00006277652,0.000120148456,0.0012271579,0.025494205,0.0050633647,0.002111587,0.0210556,0.0013899996,0.9421037],"study_design_scores_gemma":[0.0001646637,0.0003237092,0.030489007,0.00025250213,0.000020573341,0.00024716134,0.000383361,0.95788485,0.0005402084,0.00862139,0.00074548024,0.00032707758],"about_ca_topic_score_codex":0.00033220663,"about_ca_topic_score_gemma":0.000008142302,"teacher_disagreement_score":0.9528215,"about_ca_system_score_codex":0.00004149618,"about_ca_system_score_gemma":0.00012673515,"threshold_uncertainty_score":0.7648726},"labels":[],"label_agreement":null},{"id":"W4402765523","doi":"10.3390/a17100425","title":"Detecting Fake Accounts on Instagram Using Machine Learning and Hybrid Optimization Algorithms","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Spam and Phishing Detection","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":"Laurentian University","funders":"","keywords":"Computer science; Algorithm; Optimization algorithm; Machine learning; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.019815741501395204,"score_gpt":0.26567871338396065,"score_spread":0.24586297188256545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402765523","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.044158492,0.0009091449,0.95202774,0.00013222925,0.001639382,0.00014080809,0.000005052959,0.00070202595,0.0002851437],"genre_scores_gemma":[0.78623503,0.00017098317,0.21269828,0.00014986836,0.00051095895,0.000011297544,0.0000116731435,0.000048437276,0.00016346155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852806,0.00008131872,0.00021281859,0.00056946685,0.0003132786,0.0002950433],"domain_scores_gemma":[0.9994351,0.00014867411,0.00006581366,0.00020647339,0.000054827982,0.000089070556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000459678,0.0002025731,0.00015723374,0.00026749275,0.00038862074,0.00090572546,0.00023434714,0.00007548053,0.000012699435],"category_scores_gemma":[0.00008231618,0.00019395904,0.000053411775,0.0005576108,0.000029346513,0.0008346881,0.00015870594,0.00043269902,0.00002159763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061005985,0.000026962809,0.0002560194,0.000040141153,0.00004296441,0.0001237746,0.00063066534,0.055707403,0.0008782165,0.0002405218,0.000016281516,0.94203097],"study_design_scores_gemma":[0.00016620116,0.00014769551,0.00006649418,0.000090946596,0.000013486834,0.00024285328,0.000024401515,0.9934447,0.002808675,0.00029441743,0.0024705809,0.00022957286],"about_ca_topic_score_codex":0.0002581528,"about_ca_topic_score_gemma":0.0000063054863,"teacher_disagreement_score":0.94180137,"about_ca_system_score_codex":0.000096236225,"about_ca_system_score_gemma":0.000039437702,"threshold_uncertainty_score":0.8733931},"labels":[],"label_agreement":null},{"id":"W4403028417","doi":"10.3390/a17100439","title":"Methods for Corrosion Detection in Pipes Using Thermography: A Case Study on Synthetic Datasets","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Structural Integrity and Reliability Analysis","field":"Engineering","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Université Laval","keywords":"Thermography; Corrosion; Computer science; Data mining; Artificial intelligence; Materials science; Remote sensing; Geology; Metallurgy; Physics; Optics; Infrared","score_opus":0.0375859643272865,"score_gpt":0.3614692335370241,"score_spread":0.3238832692097376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403028417","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.7510528,0.0005438658,0.2468581,0.000012519607,0.0008788183,0.00039664342,0.00006828309,0.00017751713,0.000011454472],"genre_scores_gemma":[0.98815763,0.000015821955,0.011671676,0.0000069920525,0.0000633031,0.000044636694,0.000013815489,0.000022381118,0.0000037644588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992121,0.00009852117,0.00019848668,0.0002544044,0.00007521388,0.00016129033],"domain_scores_gemma":[0.9993819,0.0003481464,0.000010798003,0.00020938597,0.000015286441,0.000034489425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043298886,0.00014095832,0.0001848945,0.0002829676,0.00007590931,0.000065070526,0.000070920665,0.00008570247,0.000015602436],"category_scores_gemma":[0.000044068296,0.000111253634,0.00011372307,0.00049752806,0.000024978866,0.000100213,0.000015283189,0.00023935389,0.0000033781218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024004126,0.00011192906,0.00005754658,0.00021438634,0.0001556188,0.00075770187,0.002082612,0.031074824,0.03412286,0.000013520566,0.000023032484,0.931362],"study_design_scores_gemma":[0.00013703994,0.00012798613,0.00007593041,0.00006991082,0.00014706838,0.0003468399,0.0017259797,0.980037,0.016449658,0.00042464535,0.00030076125,0.00015721036],"about_ca_topic_score_codex":0.0007952111,"about_ca_topic_score_gemma":0.0002810171,"teacher_disagreement_score":0.94896215,"about_ca_system_score_codex":0.00007903699,"about_ca_system_score_gemma":0.000005382812,"threshold_uncertainty_score":0.45367917},"labels":[],"label_agreement":null},{"id":"W4403764673","doi":"10.3390/a17110480","title":"Nonlinear Optimization and Adaptive Heuristics for Solving Irregular Object Packing Problems","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Optimization and Packing Problems","field":"Engineering","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":"Wilfrid Laurier University","funders":"","keywords":"Heuristics; Mathematical optimization; Nonlinear system; Computer science; Object (grammar); Packing problems; Algorithm; Mathematics; Artificial intelligence; Physics","score_opus":0.016850108700707564,"score_gpt":0.23207164758118895,"score_spread":0.2152215388804814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403764673","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.00020756217,0.0028923014,0.99422485,0.000060568636,0.00078511384,0.00038730467,0.00005270081,0.00069873413,0.0006908452],"genre_scores_gemma":[0.110289656,0.0013164053,0.8865732,0.00006243695,0.0006375842,0.0001154263,0.0002049411,0.0002020717,0.0005982695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921876,0.000008954331,0.00020376858,0.00022671472,0.000107229855,0.00023458051],"domain_scores_gemma":[0.9996333,0.00010589184,0.000019403926,0.00010969113,0.000067706234,0.00006397508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016638651,0.00016799611,0.00015199177,0.000113291404,0.000096298696,0.0002033888,0.000060936887,0.00009471437,0.000021963904],"category_scores_gemma":[0.000025674533,0.00017004798,0.000045788358,0.00021783309,0.000029272733,0.0001889094,0.000021524169,0.0001253608,0.0000073377128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017191156,0.000007655853,0.000014073813,0.00027572416,0.000060695547,0.0000041755184,0.0006136932,0.9845294,0.00013429952,0.00040864522,0.00048569115,0.01346427],"study_design_scores_gemma":[0.000193955,0.00004916345,0.0000051776165,0.00019268395,0.00003015025,0.000017335136,0.00004970259,0.9921833,0.00036399002,0.00031427958,0.0063840696,0.00021617312],"about_ca_topic_score_codex":0.0000047759095,"about_ca_topic_score_gemma":0.000002668636,"teacher_disagreement_score":0.1100821,"about_ca_system_score_codex":0.000040408926,"about_ca_system_score_gemma":0.000020930363,"threshold_uncertainty_score":0.69343555},"labels":[],"label_agreement":null},{"id":"W4404528717","doi":"10.3390/a17110528","title":"Assessment of Solar Energy Generation Toward Net-Zero Energy Buildings","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Building Energy and Comfort Optimization","field":"Engineering","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":"Zero-energy building; Zero (linguistics); Zero-point energy; Solar energy; Energy (signal processing); Net (polyhedron); Net energy; Environmental science; Computer science; Architectural engineering; Engineering physics; Physics; Mathematics; Electrical engineering; Engineering; Geometry; Quantum mechanics","score_opus":0.011820817321288707,"score_gpt":0.23138498904072496,"score_spread":0.21956417171943626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404528717","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.0030689605,0.0017697446,0.99112284,0.000045659395,0.0013108335,0.000022462613,0.0000074200275,0.00039716696,0.002254884],"genre_scores_gemma":[0.9602631,0.0009393102,0.03777622,0.00006296928,0.00036110915,0.00003090199,0.00010820627,0.000051365038,0.00040686052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991793,0.00001707701,0.00023772659,0.00019753113,0.00018530923,0.00018306285],"domain_scores_gemma":[0.9997034,0.000021974194,0.000022739161,0.00016565277,0.00003736124,0.000048882208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001000136,0.00015132106,0.00015875312,0.00014096039,0.000039468145,0.00006315579,0.00011642196,0.00011697716,0.000057849196],"category_scores_gemma":[0.0000024285453,0.0001526813,0.000073280644,0.00028600966,0.000018709878,0.00020640387,0.000028216373,0.00008807836,8.90649e-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":[6.3597173e-7,0.00001553191,0.000013662928,0.00003981795,0.00009722559,0.000010441994,0.000050861385,0.80806595,0.0098250685,0.06671989,0.0033823987,0.11177853],"study_design_scores_gemma":[0.00007836747,0.000031573676,0.000023601206,0.000031756146,0.000023644709,0.000010016122,0.0000040639834,0.93197393,0.027185425,0.00078666,0.039690245,0.00016070303],"about_ca_topic_score_codex":0.00013472541,"about_ca_topic_score_gemma":0.0000095799705,"teacher_disagreement_score":0.9571941,"about_ca_system_score_codex":0.00007062967,"about_ca_system_score_gemma":0.000035010682,"threshold_uncertainty_score":0.6226163},"labels":[],"label_agreement":null},{"id":"W4404540205","doi":"10.3390/a17110532","title":"Exponential Functions Permit Estimation of Anaerobic Work Capacity and Critical Power from Less than 2 Min All-Out Test","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Sports Performance and Training","field":"Medicine","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 Victoria; University of Toronto; Canadian Sport Centre Pacific","funders":"University of Toronto; Ontario Ministry of Health and Long-Term Care","keywords":"Exponential function; Mathematics; Work (physics); Anaerobic exercise; Power (physics); Control theory (sociology); Exponential growth; Applied mathematics; Nonlinear system; Linear regression; Statistics; Simulation; Computer science; Mathematical analysis; Artificial intelligence; Engineering","score_opus":0.0399365059317678,"score_gpt":0.299099832010209,"score_spread":0.2591633260784412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404540205","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.9936907,0.00087290496,0.0035379191,0.0005259001,0.00070268166,0.000110154186,0.000050439445,0.000079227924,0.00043005135],"genre_scores_gemma":[0.9932497,0.00002355826,0.0060794465,0.00007370337,0.00022676277,0.000012172021,0.00011865976,0.000017667233,0.00019832648],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992061,0.000005166089,0.00020620109,0.00022906328,0.00018502837,0.00016841882],"domain_scores_gemma":[0.99957716,0.000118162265,0.000020687155,0.00015364165,0.000034195877,0.000096145835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089871304,0.00011272457,0.00019626961,0.00009178178,0.000054367054,0.000032682266,0.00003136315,0.00008602954,0.00021729588],"category_scores_gemma":[0.00005066689,0.00009823372,0.00005927283,0.00013488815,0.00014339549,0.0001680704,0.00001932567,0.0001856574,0.000032439657],"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.00041363962,0.0016978105,0.44607374,0.00091816654,0.0013284044,0.0014773244,0.036515206,0.000109987246,0.025206145,0.0010513357,0.005201695,0.48000655],"study_design_scores_gemma":[0.0018536656,0.00084555603,0.9201862,0.0016536213,0.0011859211,0.00027762615,0.0032993732,0.058847327,0.008263012,0.00032234154,0.0027338264,0.00053150137],"about_ca_topic_score_codex":0.00015523951,"about_ca_topic_score_gemma":0.000015039389,"teacher_disagreement_score":0.47947505,"about_ca_system_score_codex":0.000017379976,"about_ca_system_score_gemma":0.000041225092,"threshold_uncertainty_score":0.4005855},"labels":[],"label_agreement":null},{"id":"W4404973628","doi":"10.3390/a17120551","title":"Ellipsoidal K-Means: An Automatic Clustering Approach for Non-Uniform Data Distributions","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Clustering Algorithms Research","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":"Thompson Rivers University","funders":"King Abdulaziz City for Science and Technology","keywords":"Cluster analysis; Ellipsoid; Computer science; Mathematics; Artificial intelligence; Physics","score_opus":0.06264586508325108,"score_gpt":0.3495320024963194,"score_spread":0.2868861374130683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404973628","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.00011540686,0.00020081326,0.9960382,0.00041281807,0.00073190674,0.000715383,0.00040408436,0.0010433511,0.00033805583],"genre_scores_gemma":[0.008879453,0.0000293009,0.98882496,0.000040400035,0.0005301538,0.0002445596,0.00081861136,0.00005436451,0.00057821325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969481,0.00005074867,0.00040150955,0.0012303037,0.0005382094,0.0008311162],"domain_scores_gemma":[0.99689585,0.00024551977,0.0000505238,0.0024020835,0.00012005633,0.0002859473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089486514,0.00029135452,0.000283492,0.00021275243,0.00039677645,0.0009648855,0.0035246355,0.00011617756,0.000009393639],"category_scores_gemma":[0.00009161141,0.00027221334,0.000090819216,0.0008555767,0.0001050356,0.0027968057,0.0018322113,0.0003636691,0.00006698927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003738455,0.00015456001,0.0000021513524,0.0003908374,0.000080801714,0.00006380571,0.0005343822,0.010741594,0.00018003721,0.0016472581,0.0010563233,0.9851445],"study_design_scores_gemma":[0.0002767728,0.00016277935,0.000020601845,0.00006528891,0.000015473292,0.00016317618,0.00008930602,0.9911536,0.00012285434,0.0013077232,0.0062776785,0.000344756],"about_ca_topic_score_codex":0.000040309427,"about_ca_topic_score_gemma":0.000010045449,"teacher_disagreement_score":0.98479974,"about_ca_system_score_codex":0.00019736186,"about_ca_system_score_gemma":0.00022378161,"threshold_uncertainty_score":0.999973},"labels":[],"label_agreement":null},{"id":"W4405427552","doi":"10.3390/a17120581","title":"Unsupervised Temporal Adaptation in Skeleton-Based Human Action Recognition","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Human Pose and Action Recognition","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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Ottawa","keywords":"Skeleton (computer programming); Adaptation (eye); Computer science; Action recognition; Artificial intelligence; Human skeleton; Action (physics); Pattern recognition (psychology); Psychology; Neuroscience","score_opus":0.08183868303031432,"score_gpt":0.31284061696525745,"score_spread":0.23100193393494312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405427552","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.22175848,0.00014235043,0.7722404,0.0010863225,0.0014104142,0.00036716077,0.000012271607,0.0009356964,0.002046879],"genre_scores_gemma":[0.98448133,0.0000135521595,0.0145127,0.00025050552,0.00025207925,0.000064805245,0.00020882642,0.000016222566,0.0001999493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883354,0.000086545275,0.00025776215,0.0003904642,0.00023204266,0.0001996268],"domain_scores_gemma":[0.99959683,0.000062577674,0.000041770516,0.00017855132,0.00006381145,0.000056430166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026653465,0.00012991969,0.00011021827,0.00043011585,0.00011267544,0.0002841116,0.00016556392,0.000090195535,0.00013817735],"category_scores_gemma":[0.000010145636,0.00013507064,0.000071334835,0.0006182823,0.00001902672,0.0010368617,0.000019645911,0.00020535753,0.00046155063],"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.000004267004,0.00009800142,0.0000682627,0.000055313696,0.000010820115,0.000079175545,0.0004883354,0.00013377695,0.0020153967,0.00067528064,0.00046487592,0.9959065],"study_design_scores_gemma":[0.0006887145,0.00017183526,0.0018664178,0.00021783142,0.00001179952,0.000020330595,0.00014233628,0.9643739,0.009250333,0.017272312,0.005637844,0.00034633477],"about_ca_topic_score_codex":0.00023564075,"about_ca_topic_score_gemma":0.00015592811,"teacher_disagreement_score":0.99556017,"about_ca_system_score_codex":0.00011268685,"about_ca_system_score_gemma":0.0000833149,"threshold_uncertainty_score":0.5932454},"labels":[],"label_agreement":null},{"id":"W4405967252","doi":"10.3390/a18010007","title":"A Closest Resemblance Classifier with Feature Interval Learning and Outranking Measures for Improved Performance","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Machine Learning and Data Classification","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":"National Research Council Canada","funders":"National Research Council Canada","keywords":"Interpretability; Overfitting; Artificial intelligence; Computer science; Support vector machine; Random forest; Machine learning; Naive Bayes classifier; Pairwise comparison; Pattern recognition (psychology); Robustness (evolution); Classifier (UML); Data mining; Artificial neural network","score_opus":0.01683321575566576,"score_gpt":0.27398368608844426,"score_spread":0.2571504703327785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405967252","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.0095076775,0.0018372635,0.9818135,0.0048711905,0.00036857728,0.00026832975,0.0000074381564,0.00048996834,0.0008360693],"genre_scores_gemma":[0.8851946,0.00024548444,0.11102735,0.00012216489,0.00029044936,0.000077158285,0.000034663673,0.0000294889,0.0029786504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989247,0.00004809075,0.000120423814,0.0004996625,0.00015772216,0.00024940813],"domain_scores_gemma":[0.9994347,0.00014082881,0.00004858015,0.0002416491,0.00007274464,0.00006150122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044024992,0.00014783724,0.00014341192,0.00009639708,0.00021574758,0.00051578647,0.00029578747,0.00006996695,0.0000013953476],"category_scores_gemma":[0.00005969396,0.00010976902,0.000034146215,0.00025620285,0.000046447287,0.00054494204,0.0000779218,0.00042094724,0.0000066933744],"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.000033466495,0.000012959209,0.001761919,0.0001452058,0.000039183353,0.000007371847,0.0006874758,0.000037929913,0.0013931816,0.0023754102,0.0007202191,0.9927857],"study_design_scores_gemma":[0.00026917196,0.0003062628,0.0034320368,0.00017193877,0.000013829623,0.00006899855,0.000041257725,0.82090867,0.00029359054,0.00012379033,0.17418885,0.00018158175],"about_ca_topic_score_codex":0.000013762764,"about_ca_topic_score_gemma":0.00001340881,"teacher_disagreement_score":0.9926041,"about_ca_system_score_codex":0.000025074627,"about_ca_system_score_gemma":0.000054617423,"threshold_uncertainty_score":0.49737406},"labels":[],"label_agreement":null},{"id":"W4406677985","doi":"10.3390/a18020055","title":"Mitigating Digital Ageism in Skin Lesion Detection with Adversarial Learning","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Cutaneous Melanoma Detection and Management","field":"Medicine","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 Health Network; Toronto Rehabilitation Institute; University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Skin Aging; Adversarial system; Computer science; Artificial intelligence; Lesion; Computer vision; Skin lesion; Pattern recognition (psychology); Machine learning; Medicine; Pathology; Dermatology","score_opus":0.0073812273879046136,"score_gpt":0.2423796257355944,"score_spread":0.2349983983476898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406677985","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.91644067,0.000051794523,0.04600089,0.0004007829,0.0005404503,0.0005352431,7.619273e-7,0.0002191934,0.03581019],"genre_scores_gemma":[0.99215317,0.000007760179,0.000933343,0.00012141313,0.00012740381,0.000016196907,0.000009189289,0.000011705852,0.0066198334],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993,0.000020183488,0.00015658667,0.00021239466,0.0001504287,0.00016040672],"domain_scores_gemma":[0.99975246,0.000035961388,0.000041039784,0.000101952784,0.000027138243,0.000041468433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090749505,0.00009808997,0.00014629653,0.00021158162,0.00008203421,0.000042613457,0.000031218275,0.000057673118,0.000024521236],"category_scores_gemma":[0.000063521824,0.000086203014,0.00003999895,0.00033087895,0.000025727577,0.000071238734,0.00003532868,0.00024197249,0.00002345539],"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.00027260373,0.00008252469,0.0034291171,0.000044929253,0.00005558955,0.00041770397,0.00025397027,0.00026477623,0.0035753662,0.00004283454,0.000050886123,0.9915097],"study_design_scores_gemma":[0.039717548,0.007000338,0.17412025,0.003523994,0.00072358496,0.003049066,0.019094098,0.2566749,0.13684195,0.0009286074,0.35631314,0.002012546],"about_ca_topic_score_codex":0.00013038756,"about_ca_topic_score_gemma":0.00008066477,"teacher_disagreement_score":0.9894971,"about_ca_system_score_codex":0.00012006335,"about_ca_system_score_gemma":0.000029528093,"threshold_uncertainty_score":0.35152566},"labels":[],"label_agreement":null},{"id":"W4407098172","doi":"10.3390/a18020076","title":"Broadcasting in Stars of Cliques and Path-Connected Cliques","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Opportunistic and Delay-Tolerant Networks","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":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Path (computing); Stars; Clique; Computer network; Topology (electrical circuits); Mathematics; Combinatorics","score_opus":0.010648348919158964,"score_gpt":0.25848931393942465,"score_spread":0.24784096502026567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407098172","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.10816102,0.0012057599,0.88299996,0.00041317826,0.0003166349,0.0001560849,0.00000489104,0.00012566046,0.006616825],"genre_scores_gemma":[0.9342734,0.00023048872,0.064930595,0.00031855953,0.00003166557,0.00000648019,0.0000030507135,0.0000049439163,0.00020081866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989894,0.00006992702,0.00032967128,0.00028287532,0.000113491034,0.0002146416],"domain_scores_gemma":[0.9992885,0.00024987033,0.000083626124,0.00025042877,0.000077051605,0.000050542738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033548014,0.00010857651,0.00023470016,0.00013228036,0.00004229433,0.000050546943,0.00026697264,0.00007842159,0.000004138921],"category_scores_gemma":[0.000020563322,0.00010333032,0.000029028446,0.00037896005,0.000064105094,0.00018873683,0.00020366,0.00013694998,9.784756e-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.000011291419,0.00006196893,0.0078863865,0.000042412652,0.000019157713,0.00009331506,0.00069425645,0.00001625393,0.00010855216,0.018137977,0.00067040627,0.97225803],"study_design_scores_gemma":[0.00046381116,0.00010671556,0.007420021,0.000243885,0.00000766308,0.000013056465,0.00008133865,0.9787559,0.00031506477,0.011405739,0.0010171372,0.00016967946],"about_ca_topic_score_codex":0.00018754625,"about_ca_topic_score_gemma":0.000016800579,"teacher_disagreement_score":0.9787396,"about_ca_system_score_codex":0.000016688597,"about_ca_system_score_gemma":0.0000899595,"threshold_uncertainty_score":0.4213688},"labels":[],"label_agreement":null},{"id":"W4407223974","doi":"10.3390/a18020088","title":"Nonparametric Probability Density Function Estimation Using the Padé Approximation","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Statistical Methods and Models","field":"Mathematics","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":"Carleton University","funders":"","keywords":"Nonparametric statistics; Probability density function; Density estimation; Mathematics; Estimation; Function (biology); Statistics; Multivariate kernel density estimation; Applied mathematics; Computer science; Artificial intelligence; Variable kernel density estimation; Estimator; Kernel method","score_opus":0.12262109126277514,"score_gpt":0.4155277002482057,"score_spread":0.2929066089854305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407223974","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.019369176,0.000034694178,0.9790079,0.0001486737,0.00028077426,0.0005622432,0.0000050936915,0.00008343951,0.0005079768],"genre_scores_gemma":[0.11004804,0.0000022920726,0.889649,0.00008568814,0.00003578201,0.000035010096,0.000004852241,0.000008527408,0.00013082502],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892765,0.00017737201,0.0002876405,0.00024403188,0.00019211632,0.00017116504],"domain_scores_gemma":[0.99820435,0.0011611014,0.00011183353,0.000333264,0.00015872375,0.000030739167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008545365,0.00011854388,0.00018381448,0.00007326222,0.0002470283,0.000040434366,0.00009208492,0.00007572222,0.000011206697],"category_scores_gemma":[0.0022444003,0.00008292904,0.000052671396,0.0005392854,0.00007325378,0.00014500541,0.00005073057,0.00016015604,0.0000037847879],"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.000033105855,0.0001480362,0.00008815383,0.0001609432,0.000041356838,0.0000011095001,0.00013325861,0.0032374084,0.0003051744,0.464861,0.00013401019,0.53085643],"study_design_scores_gemma":[0.000096624746,0.000013751248,0.00024847325,0.000014442214,0.000054809534,0.0000017869473,0.000022694374,0.4552054,0.00035633487,0.5438985,0.000037770973,0.000049394024],"about_ca_topic_score_codex":0.00002542789,"about_ca_topic_score_gemma":0.0000038037244,"teacher_disagreement_score":0.530807,"about_ca_system_score_codex":0.00011378732,"about_ca_system_score_gemma":0.000041927102,"threshold_uncertainty_score":0.3381748},"labels":[],"label_agreement":null},{"id":"W4407349494","doi":"10.3390/a18020100","title":"Performance Investigation of Active, Semi-Active and Passive Suspension Using Quarter Car Model","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Vibration Control and Rheological Fluids","field":"Engineering","cited_by":13,"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 suspension; Car model; Quarter (Canadian coin); Suspension (topology); Computer science; Automotive engineering; Mathematics; Engineering; Artificial intelligence; Geography; Actuator","score_opus":0.012253367350894042,"score_gpt":0.21926080954584057,"score_spread":0.20700744219494652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407349494","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.929527,0.000060209593,0.06937355,0.000082193044,0.00010867977,0.00010245547,0.000007740126,0.00004780827,0.00069039955],"genre_scores_gemma":[0.99692655,0.00005947617,0.0028623599,0.00005961111,0.000023103757,0.0000063352804,0.0000066955367,0.000005513966,0.000050362843],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995731,0.000014793301,0.00014099073,0.00010591196,0.0000675034,0.000097668984],"domain_scores_gemma":[0.9997715,0.000037413065,0.000028332795,0.00007192225,0.00005974892,0.00003109715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002521145,0.00008587555,0.00014161385,0.000056516186,0.00005005157,0.000007718065,0.000035062927,0.00007619832,0.00000609503],"category_scores_gemma":[0.000013583376,0.00007275337,0.000020929483,0.00011559021,0.00005077694,0.00019151809,0.000018055038,0.000085007,0.0000010262529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005393112,0.000016495895,0.0019323095,0.00013641418,0.00013629132,0.000002913462,0.0015782585,0.41291434,0.52314365,0.0009085913,0.0003245427,0.058852263],"study_design_scores_gemma":[0.0002478221,0.00002345117,0.0060297865,0.000037408343,0.000016948508,0.0000013242046,0.00009473717,0.91209483,0.08093867,0.0004371812,0.0000073702895,0.00007044401],"about_ca_topic_score_codex":0.000011459042,"about_ca_topic_score_gemma":0.0000017953283,"teacher_disagreement_score":0.49918053,"about_ca_system_score_codex":0.00003156636,"about_ca_system_score_gemma":0.000019843937,"threshold_uncertainty_score":0.29667965},"labels":[],"label_agreement":null},{"id":"W4407924474","doi":"10.3390/a18030128","title":"Using Coherent Hemodynamic Spectroscopy Model to Investigate Cardiac Arrest","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Non-Invasive Vital Sign Monitoring","field":"Engineering","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":"St. Michael's Hospital; Schwartz/Reisman Emergency Medicine Institute; North York General Hospital; Toronto Metropolitan University","funders":"","keywords":"Hemodynamics; Spectroscopy; Cardiology; Internal medicine; Computer science; Physics; Materials science; Nuclear engineering; Medicine; Engineering; Quantum mechanics","score_opus":0.024139584969024942,"score_gpt":0.27688902810541055,"score_spread":0.2527494431363856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407924474","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.46924153,0.00042281617,0.5213569,0.00005752359,0.0037575332,0.00039079753,0.00003222482,0.00045773387,0.0042829816],"genre_scores_gemma":[0.814505,0.000040948373,0.18450588,0.00010657831,0.00046069632,0.000065166554,0.000009399395,0.000089186484,0.00021716008],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883217,0.00001754027,0.0002230174,0.0002907669,0.00018295772,0.00045357028],"domain_scores_gemma":[0.99938333,0.000034618213,0.000017733444,0.00034605517,0.00004001449,0.00017827663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009016536,0.0002516704,0.00028133683,0.0001752652,0.00008536256,0.000070461465,0.00021899625,0.000083550774,0.0000044362964],"category_scores_gemma":[0.000021989335,0.00028520118,0.00008552827,0.0004646196,0.000034435154,0.00013015784,0.00010204619,0.00021341178,0.00006061059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023454531,0.000008711451,0.0009278416,0.000056129793,0.00006913591,0.000009450784,0.00007866969,0.34286684,0.65376455,0.00021046087,0.0004520153,0.0015538476],"study_design_scores_gemma":[0.00017709444,0.000015573625,0.00023427414,0.00017452276,0.00003955297,9.475814e-7,0.00003722268,0.6838753,0.31232384,0.0025240732,0.00024727677,0.0003502659],"about_ca_topic_score_codex":0.000091222166,"about_ca_topic_score_gemma":0.000008340273,"teacher_disagreement_score":0.34526348,"about_ca_system_score_codex":0.00044182176,"about_ca_system_score_gemma":0.00006286258,"threshold_uncertainty_score":0.99996},"labels":[],"label_agreement":null},{"id":"W4408093993","doi":"10.3390/a18030134","title":"Edge Detection Attention Module in Pure Vision Transformer for Low-Dose X-Ray Computed Tomography Image Denoising","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Image and Signal Denoising Methods","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 Saskatchewan; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computed tomography; Artificial intelligence; Computer vision; Noise reduction; Computer science; Tomography; Image denoising; Image (mathematics); Edge detection; Enhanced Data Rates for GSM Evolution; Image processing; Pattern recognition (psychology); Radiology; Medicine","score_opus":0.009944173788143992,"score_gpt":0.2834033836160767,"score_spread":0.2734592098279327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408093993","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.021886121,0.00035407182,0.9752438,0.00042177763,0.0011226906,0.0005660487,0.0000038267335,0.00016717511,0.00023445536],"genre_scores_gemma":[0.49036247,0.000019986272,0.5086083,0.00030760202,0.00019366555,0.00008431991,0.00001862863,0.000025250143,0.00037980525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827,0.0001703534,0.00038402228,0.00055270246,0.00022273429,0.0004002041],"domain_scores_gemma":[0.9991611,0.00016101851,0.0000724373,0.0003671429,0.00017784727,0.000060416867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008398823,0.00020679767,0.00026672575,0.00062866573,0.0002489433,0.00031025094,0.00046315047,0.00013840679,0.0000026826754],"category_scores_gemma":[0.000031746582,0.0002045207,0.00020600832,0.0014561658,0.000049795988,0.0009543191,0.000056804733,0.00021078707,0.000008151702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038549853,0.00011778169,0.000041336873,0.00008540085,0.000022188126,0.000017058323,0.00016082544,0.000287025,0.25456056,0.0003027767,0.00013601968,0.74423045],"study_design_scores_gemma":[0.0033054885,0.0003071667,0.016316922,0.00033477932,0.000032718224,0.000013420551,0.000027177526,0.81398654,0.15516537,0.008958184,0.0011465767,0.00040564203],"about_ca_topic_score_codex":0.000042114498,"about_ca_topic_score_gemma":0.000025603247,"teacher_disagreement_score":0.81369954,"about_ca_system_score_codex":0.00009802606,"about_ca_system_score_gemma":0.00005473062,"threshold_uncertainty_score":0.83401114},"labels":[],"label_agreement":null},{"id":"W4408117798","doi":"10.3390/a18030132","title":"Adaptive Machine Learning for Automatic Load Optimization in Connected Smart Green Townhouses","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Building Energy and Comfort Optimization","field":"Engineering","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":"Herzberg Institute of Astrophysics; University of Victoria","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Embedded system","score_opus":0.00916757352071776,"score_gpt":0.2147486333264129,"score_spread":0.20558105980569513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408117798","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.0040808967,0.00042418178,0.99287796,0.000077189376,0.00024866447,0.00023961053,0.0000050702274,0.0006342809,0.0014121572],"genre_scores_gemma":[0.8076702,0.00017089864,0.19002418,0.0001495271,0.00006743264,0.00025631345,0.0001633544,0.00007007246,0.0014280473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999417,0.000020195297,0.00018692587,0.00013593065,0.00007313098,0.00016681172],"domain_scores_gemma":[0.99971515,0.00009345228,0.000024956287,0.00009317252,0.000052252406,0.000021027137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103283055,0.00011788634,0.00015328644,0.0001396832,0.00006220703,0.00002133198,0.00008306413,0.00008711498,0.000028192495],"category_scores_gemma":[0.000046226512,0.00012610524,0.0000327759,0.0003642555,0.000012109664,0.00011420675,0.000017894794,0.000113162256,0.0000010158133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000766774,0.000013756676,0.0002119255,0.000032122185,0.00003392615,0.0000013224515,0.00008367942,0.97998494,0.000017140661,0.00034973634,0.000113398986,0.019150393],"study_design_scores_gemma":[0.0005672478,0.00003264547,0.00011926384,0.00006608058,0.000016917735,0.0000012966742,0.00002575287,0.99780184,0.00036213815,0.00023750834,0.00063931406,0.00012996861],"about_ca_topic_score_codex":0.0001628045,"about_ca_topic_score_gemma":0.00011215185,"teacher_disagreement_score":0.8035893,"about_ca_system_score_codex":0.000111539026,"about_ca_system_score_gemma":0.000029756926,"threshold_uncertainty_score":0.51424223},"labels":[],"label_agreement":null},{"id":"W4408275769","doi":"10.3390/a18030156","title":"Quantum Computing and Machine Learning in Medical Decision-Making: A Comprehensive Review","year":2025,"lang":"en","type":"review","venue":"Algorithms","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Princess Margaret Cancer Centre; University of Toronto; University Health Network","funders":"","keywords":"Computer science; Quantum computer; Quantum machine learning; Artificial intelligence; Machine learning; Quantum; Data science; Physics; Quantum mechanics","score_opus":0.02532823859094355,"score_gpt":0.34200575095454755,"score_spread":0.316677512363604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408275769","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":[9.730591e-7,0.8433521,0.1545619,0.00031349098,0.0007202994,0.00068206224,0.000007899081,0.00027542617,0.000085847074],"genre_scores_gemma":[0.0000036185806,0.94652694,0.052260205,0.0009007229,0.00018915987,0.000023543576,0.000024525965,0.000043151635,0.000028103459],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943625,0.00086655293,0.0015188371,0.001511849,0.00096066226,0.0007796168],"domain_scores_gemma":[0.99278724,0.0053831525,0.0005777664,0.00086765684,0.000121051395,0.00026310532],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0014005277,0.0008547185,0.003294506,0.00071505347,0.00030415587,0.0002253583,0.0022010792,0.00046778523,0.000019525365],"category_scores_gemma":[0.0011733182,0.0006803581,0.00047767206,0.0021649033,0.00012455453,0.00012193832,0.0028543202,0.0025752652,0.000028146886],"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.6274134e-7,0.000037231268,0.0000021881237,0.024737177,0.000048467744,0.0006394408,0.00005865217,0.000039386163,2.9132414e-9,0.0004612791,0.00023414417,0.97374135],"study_design_scores_gemma":[0.00015205635,0.000044562028,0.000004194621,0.20953137,0.00006303381,0.00077209267,0.0000017424085,0.31450668,7.0811907e-9,0.00041787073,0.47409308,0.00041330562],"about_ca_topic_score_codex":0.000038019436,"about_ca_topic_score_gemma":0.00000560129,"teacher_disagreement_score":0.97332805,"about_ca_system_score_codex":0.000093025905,"about_ca_system_score_gemma":0.00077003683,"threshold_uncertainty_score":0.9997258},"labels":[],"label_agreement":null},{"id":"W4408296160","doi":"10.3390/a18030154","title":"An Adaptive Feature-Based Quantum Genetic Algorithm for Dimension Reduction with Applications in Outlier Detection","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Fault Detection and Control Systems","field":"Engineering","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 Ottawa","funders":"","keywords":"Outlier; Dimension (graph theory); Reduction (mathematics); Computer science; Feature (linguistics); Anomaly detection; Dimensionality reduction; Algorithm; Quantum; Genetic algorithm; Pattern recognition (psychology); Artificial intelligence; Mathematics; Machine learning; Physics; Combinatorics; Quantum mechanics","score_opus":0.005790280417164423,"score_gpt":0.22695302321693822,"score_spread":0.2211627427997738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408296160","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.0103548225,0.0003003594,0.9871141,0.00003506932,0.0005428249,0.0011692584,0.000015703845,0.00034883549,0.00011904805],"genre_scores_gemma":[0.96480423,0.000007600251,0.033217844,0.000033319146,0.00016345557,0.001567964,0.000029008119,0.000040824336,0.00013578056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915946,0.00003529516,0.00019140056,0.00028659852,0.000112703434,0.00021457612],"domain_scores_gemma":[0.99954635,0.00003270551,0.00003485312,0.00025001407,0.00008128118,0.00005480677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009900145,0.0001744242,0.000189656,0.0002609175,0.000113708484,0.000037442547,0.000080107435,0.00013474737,0.000001447915],"category_scores_gemma":[0.0000026938262,0.00016113586,0.000048848364,0.00049031526,0.000024247212,0.000103581726,0.0000037248726,0.00015287021,0.0000046302057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110045774,0.00012121393,0.0000375895,0.000054587003,0.00008146897,0.0000025674215,0.00011158221,0.123120636,0.020139638,0.0001235072,0.000116175965,0.855981],"study_design_scores_gemma":[0.0011312506,0.00025677436,0.0007872058,0.000035225643,0.000033249864,0.000006478829,0.0003354659,0.98068273,0.013074381,0.00016254302,0.0033078666,0.00018683843],"about_ca_topic_score_codex":0.000079783866,"about_ca_topic_score_gemma":0.00007870706,"teacher_disagreement_score":0.95444936,"about_ca_system_score_codex":0.00017061066,"about_ca_system_score_gemma":0.000028702303,"threshold_uncertainty_score":0.6570929},"labels":[],"label_agreement":null},{"id":"W4408534506","doi":"10.3390/a18030170","title":"Investigations into the Design and Implementation of Reinforcement Learning Using Deep Learning Neural Networks","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Research in Systems and Signal Processing","field":"Engineering","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":"John Abbott College; Concordia University","funders":"","keywords":"Reinforcement learning; Computer science; Artificial neural network; Artificial intelligence; Deep learning; Machine learning; Deep neural networks","score_opus":0.021880674094617594,"score_gpt":0.3093974119279932,"score_spread":0.2875167378333756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408534506","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.031696863,0.0015546895,0.96626836,0.000031469277,0.00008643132,0.00020131333,5.6244502e-8,0.000051116967,0.00010967211],"genre_scores_gemma":[0.98361444,0.000111070105,0.016132185,0.000013898914,0.00004324466,0.000020605054,0.0000033995136,0.000012056275,0.000049071525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929816,0.00008260161,0.00022995491,0.00009421111,0.00012017412,0.00017487377],"domain_scores_gemma":[0.9996397,0.00015778322,0.00004969295,0.00006256619,0.000055368713,0.00003489684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036483686,0.000085520194,0.00010680966,0.00007155423,0.00033448698,0.000049594204,0.00006988827,0.000033156764,0.000006389325],"category_scores_gemma":[0.000038551534,0.00006841352,0.000019391242,0.0002657003,0.00006503401,0.000158138,0.000044386856,0.0002551542,2.1562742e-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.0000013691678,6.3975347e-7,0.00046603166,0.00004521429,0.000022629585,6.7396655e-7,0.0009211946,0.8898236,0.001902931,0.00010283901,0.0000045924803,0.10670826],"study_design_scores_gemma":[0.00016381317,0.000026215142,0.000113551665,0.00005386242,0.000012462447,0.0000022988982,0.0019870682,0.9953464,0.0017297128,0.00026523988,0.0002362206,0.0000631179],"about_ca_topic_score_codex":0.000100860634,"about_ca_topic_score_gemma":0.000004742059,"teacher_disagreement_score":0.9519176,"about_ca_system_score_codex":0.000046612073,"about_ca_system_score_gemma":0.000018208146,"threshold_uncertainty_score":0.27898225},"labels":[],"label_agreement":null},{"id":"W4408657342","doi":"10.3390/a18030175","title":"A PSO-Based Approach for the Optimal Allocation of Electric Vehicle Parking Lots to the Electricity Distribution Network","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Electric Vehicles and Infrastructure","field":"Engineering","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":"Concordia University","funders":"","keywords":"Electric vehicle; Electricity; Computer science; Particle swarm optimization; Parking lot; Distribution (mathematics); Mathematical optimization; Operations research; Mathematics; Power (physics); Algorithm; Engineering; Electrical engineering","score_opus":0.006029424344537182,"score_gpt":0.2120899765644973,"score_spread":0.2060605522199601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408657342","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.017632881,0.0015959053,0.9791723,0.00046697995,0.00015516016,0.0007110852,0.000014589016,0.000090067726,0.00016103582],"genre_scores_gemma":[0.9931312,0.00004206004,0.0060697976,0.0002225593,0.00024836417,0.0001803512,0.000057208417,0.000016932965,0.00003151323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906635,0.000030247393,0.00022655065,0.0001659876,0.00014523472,0.00036563212],"domain_scores_gemma":[0.9993504,0.00022401266,0.000044568747,0.00025286232,0.00009806017,0.000030070112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034747843,0.00013738735,0.000153966,0.000043516953,0.00022055658,0.000037821017,0.00029329653,0.000085292115,0.0000021453068],"category_scores_gemma":[0.000047876205,0.000090076974,0.0000841795,0.0014225625,0.00001545398,0.000042755557,0.000018640563,0.00020593981,8.972893e-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.00002803757,0.000016894348,0.00014201668,0.000032071013,0.00007076611,1.1103374e-7,0.0000286175,0.84903127,0.0018164853,0.00090938696,0.009331192,0.13859314],"study_design_scores_gemma":[0.00023882826,0.0000743481,0.004174227,0.000011170582,0.00005649885,0.0000011923388,0.0000112336365,0.9739357,0.013923672,0.00017058804,0.0073039406,0.0000985855],"about_ca_topic_score_codex":0.000034889454,"about_ca_topic_score_gemma":0.0000039789825,"teacher_disagreement_score":0.9754983,"about_ca_system_score_codex":0.00010811524,"about_ca_system_score_gemma":0.00005350039,"threshold_uncertainty_score":0.36732322},"labels":[],"label_agreement":null},{"id":"W4408944579","doi":"10.3390/a18040190","title":"A Data-Driven Intelligent Methodology for Developing Explainable Diagnostic Model for Febrile Diseases","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Artificial Intelligence in Healthcare","field":"Health Professions","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":"Mount Royal University","funders":"","keywords":"Computer science; Intensive care medicine; Medicine; Data science","score_opus":0.5297542341434482,"score_gpt":0.5696175165723699,"score_spread":0.039863282428921676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408944579","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.0022635888,0.0011754604,0.98168373,0.005336728,0.0024190824,0.004873447,0.0019214476,0.00019496068,0.00013157394],"genre_scores_gemma":[0.040520776,0.0007447254,0.9263611,0.0077603343,0.0013013602,0.0136245685,0.0019436689,0.00012646144,0.0076170065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661785,0.0004557448,0.0009820038,0.0007777864,0.00015044378,0.001016138],"domain_scores_gemma":[0.9757162,0.02231333,0.00023291554,0.00090475037,0.0006740383,0.00015878567],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.0013450271,0.00024888077,0.0005626855,0.00019511071,0.0014246377,0.000018961462,0.0008120785,0.00028780373,0.00004475872],"category_scores_gemma":[0.013896256,0.00023951723,0.000107649896,0.00029605793,0.00009606984,0.0002203559,0.00058215833,0.00032198543,0.00006763522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077694946,0.00037114555,0.016973922,0.0079729995,0.00049451605,0.000022133587,0.011718022,0.017353026,0.00008659993,0.2623958,0.22629619,0.45553872],"study_design_scores_gemma":[0.00023596913,0.00006833272,0.00015096994,0.00041080572,0.00010735531,6.27987e-7,0.0046246243,0.8528296,0.00023641827,0.093301415,0.047791194,0.00024272986],"about_ca_topic_score_codex":0.0009881308,"about_ca_topic_score_gemma":0.0020543626,"teacher_disagreement_score":0.8354765,"about_ca_system_score_codex":0.00041222075,"about_ca_system_score_gemma":0.0017797351,"threshold_uncertainty_score":0.99987537},"labels":[],"label_agreement":null},{"id":"W4409373372","doi":"10.3390/a18040218","title":"Korovkin-Type Theorems for Positive Linear Operators Based on the Statistical Derivative of Deferred Cesàro Summability","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Approximation Theory and Sequence Spaces","field":"Mathematics","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 Victoria","funders":"","keywords":"Linear operators; Mathematics; Derivative (finance); Type (biology); Pure mathematics; Operator theory; Applied mathematics; Discrete mathematics; Mathematical analysis; Business","score_opus":0.047990789696757574,"score_gpt":0.3589261506953947,"score_spread":0.3109353609986371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409373372","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.10292367,0.000025379735,0.8879133,0.001957892,0.00024938118,0.0015866476,0.00045555178,0.000070070826,0.0048181],"genre_scores_gemma":[0.92565924,0.0000019541922,0.07357009,0.00036649563,0.000034396453,0.00007641355,0.00004006819,0.000015802738,0.00023551109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987745,0.00030858943,0.00030806643,0.0002382851,0.00018443327,0.00018611517],"domain_scores_gemma":[0.9936254,0.00555552,0.00011470699,0.00033707498,0.00033060228,0.000036709633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009897596,0.00015802722,0.00027403884,0.000053267,0.00017879583,0.00002184065,0.0002247602,0.00008283317,0.000115643976],"category_scores_gemma":[0.0030082234,0.000101221194,0.00007681389,0.0002706739,0.00044389637,0.000059455124,0.00003279868,0.00014030398,0.000005223361],"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.00029945833,0.0001955578,0.00008403117,0.00009242001,0.000069207206,0.0000012635206,0.000853373,0.000092856,0.00030601386,0.99582905,0.00049109006,0.0016856837],"study_design_scores_gemma":[0.0005507558,0.00035944572,0.00021517371,0.000101589096,0.00006337121,5.658003e-7,0.0015667928,0.08212233,0.05028031,0.8644052,0.0001802544,0.00015417811],"about_ca_topic_score_codex":0.000012139022,"about_ca_topic_score_gemma":0.0000035700125,"teacher_disagreement_score":0.8227356,"about_ca_system_score_codex":0.00004743673,"about_ca_system_score_gemma":0.00014405925,"threshold_uncertainty_score":0.41276804},"labels":[],"label_agreement":null},{"id":"W4409567218","doi":"10.3390/a18040233","title":"Patient-Specific Hyperparameter Optimization of a Deep Learning-Based Tumor Autocontouring Algorithm on 2D Liver, Prostate, and Lung Cine MR Images: A Pilot Study","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","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 Calgary; University of Alberta","funders":"Canadian Institutes of Health Research","keywords":"Hyperparameter; Prostate; Lung; Algorithm; Artificial intelligence; Computer science; Medicine; Internal medicine","score_opus":0.007089357906349622,"score_gpt":0.2507818295171732,"score_spread":0.24369247161082358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409567218","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.031990655,0.00060450105,0.9650756,0.000020888801,0.00007923547,0.0017578368,0.000024147337,0.00015010187,0.00029704356],"genre_scores_gemma":[0.69446963,0.00003250643,0.30470031,0.000057274385,0.000074677795,0.00042097564,0.000032144755,0.000051214673,0.00016129005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868923,0.00010522396,0.00035324463,0.0004239062,0.00017875664,0.000249664],"domain_scores_gemma":[0.9992129,0.00013295157,0.00020443437,0.00026994283,0.00012707502,0.000052669195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012216993,0.0002560108,0.00035223202,0.00020700839,0.00014123514,0.000051045543,0.000111629495,0.000021646556,0.00007721647],"category_scores_gemma":[0.000008631244,0.00024030339,0.000052306546,0.0002776224,0.00008088912,0.00015972377,0.00004940106,0.00023776981,6.9915114e-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.00032082852,0.003072676,0.018190911,0.000067730034,0.00034186206,0.00003664007,0.001127613,0.10706978,0.0013737775,0.000106267216,0.00014095475,0.86815095],"study_design_scores_gemma":[0.0035191537,0.004995586,0.0019430865,0.00018643467,0.000072626084,0.0000016443096,0.00059575995,0.9749911,0.012599383,0.00010801737,0.00056002836,0.000427173],"about_ca_topic_score_codex":0.00011675163,"about_ca_topic_score_gemma":7.2074795e-7,"teacher_disagreement_score":0.86792135,"about_ca_system_score_codex":0.00006100588,"about_ca_system_score_gemma":0.000028002753,"threshold_uncertainty_score":0.97992873},"labels":[],"label_agreement":null},{"id":"W4409893307","doi":"10.3390/a18050257","title":"Early Risk Prediction in Acute Aortic Syndrome on Clinical Data Using Machine Learning","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Cardiac Valve Diseases and Treatments","field":"Medicine","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":"NOSM University; Science North; Laurentian University","funders":"","keywords":"Artificial intelligence; Internal medicine; Computer science; Machine learning; Medicine; Cardiology","score_opus":0.047719460885662646,"score_gpt":0.4229917483475785,"score_spread":0.3752722874619159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409893307","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.99743325,0.000503442,0.000509681,0.000069624184,0.00049837586,0.00031095388,0.00031233308,0.00006212034,0.0003002219],"genre_scores_gemma":[0.9975216,0.00039025178,0.0007902919,0.000106809835,0.000082736384,0.000008628502,0.0005086949,0.000017695216,0.000573339],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99871117,0.00011168219,0.0003628057,0.0004183336,0.00019627449,0.00019971574],"domain_scores_gemma":[0.99914587,0.00010325911,0.00007853119,0.00053989247,0.000028114835,0.0001043597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031749732,0.00013019599,0.00035088978,0.0001487417,0.000077601464,0.000021203137,0.000082024744,0.00008735577,0.000032859494],"category_scores_gemma":[0.00018500647,0.00011331902,0.0002675169,0.00027101926,0.000033325992,0.00009376961,0.00012483925,0.00038173955,0.000055670567],"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.00015526247,0.00032826595,0.9678255,0.000012789266,0.001076686,0.0002696296,0.000013720307,0.00003445316,0.0000058528794,0.000003743387,0.00005610313,0.030218044],"study_design_scores_gemma":[0.002651797,0.00046142313,0.935084,0.0001784905,0.0017813499,0.000027270416,0.000014667573,0.05950789,0.000003973191,0.00003628427,0.00018440768,0.00006847978],"about_ca_topic_score_codex":0.00087007356,"about_ca_topic_score_gemma":0.0000036562712,"teacher_disagreement_score":0.05947344,"about_ca_system_score_codex":0.00008969539,"about_ca_system_score_gemma":0.00008274406,"threshold_uncertainty_score":0.46210158},"labels":[],"label_agreement":null},{"id":"W4410071166","doi":"10.3390/a18050265","title":"Forecasting Cancer Incidence in Canada by Age, Sex, and Region Until 2026 Using Machine Learning Techniques","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Artificial Intelligence in Healthcare","field":"Health Professions","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Laurentian University","funders":"","keywords":"Incidence (geometry); Cancer incidence; Cancer; Computer science; Artificial intelligence; Demography; Medicine; Machine learning; Mathematics; Internal medicine","score_opus":0.12916660872842856,"score_gpt":0.4414684905899365,"score_spread":0.3123018818615079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410071166","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.9884427,0.0036658146,0.0033227655,0.001848408,0.0007676799,0.0010023984,0.00002721556,0.000111468486,0.0008115544],"genre_scores_gemma":[0.99190855,0.0008222262,0.0032655601,0.0015036832,0.00014606616,0.00015819089,0.000013331905,0.00003110959,0.0021512883],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998011,0.0003615437,0.00057185045,0.0003426444,0.0001786013,0.0005343723],"domain_scores_gemma":[0.9988366,0.0006139804,0.0001901872,0.00015828524,0.00010867422,0.000092294176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000515144,0.00015635064,0.00028325128,0.00012625898,0.0006978257,0.000011440872,0.00014081634,0.00015457322,0.000042550695],"category_scores_gemma":[0.00036556178,0.00015852459,0.000015563759,0.0004629737,0.000053560383,0.0001239392,0.00018016982,0.0010309158,0.0000010387926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011990464,0.0000056120416,0.8761281,0.00022110969,0.000006723131,0.00009823967,0.001184608,0.00010353915,0.0002482927,0.00003225633,0.0008698156,0.121089704],"study_design_scores_gemma":[0.00021945716,0.000056098273,0.0045375936,0.0045972317,0.000029124358,0.000016551221,0.013697755,0.94173175,0.0070329537,0.0014964954,0.026034571,0.0005504379],"about_ca_topic_score_codex":0.99422556,"about_ca_topic_score_gemma":0.98766804,"teacher_disagreement_score":0.9416282,"about_ca_system_score_codex":0.0015017182,"about_ca_system_score_gemma":0.0019190117,"threshold_uncertainty_score":0.64644456},"labels":[],"label_agreement":null},{"id":"W4410480866","doi":"10.3390/a18050290","title":"Quantifying Intra- and Inter-Observer Variabilities in Manual Contours for Radiotherapy: Evaluation of an MR Tumor Autocontouring Algorithm for Liver, Prostate, and Lung Cancer Patients","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","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; University of Alberta","funders":"Canadian Institutes of Health Research","keywords":"Radiation therapy; Observer (physics); Prostate cancer; Prostate; Algorithm; Medicine; Computer science; Lung; Radiology; Cancer; Internal medicine; Physics","score_opus":0.018693125994986143,"score_gpt":0.3487875434455778,"score_spread":0.33009441745059165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410480866","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.50207096,0.0017033288,0.49209654,0.000031463234,0.00016735033,0.0036167854,0.00026085397,0.000033811608,0.0000188718],"genre_scores_gemma":[0.5953916,0.0001046429,0.40025055,0.000069216745,0.00020092446,0.0037469477,0.00008720741,0.00005577658,0.00009318886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989015,0.00006945361,0.00033365743,0.00034304443,0.000119656754,0.00023267399],"domain_scores_gemma":[0.9992555,0.00016217807,0.00015471812,0.00013415782,0.00025567587,0.000037805763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005765417,0.000182823,0.0003284146,0.00012176063,0.00007751399,0.00004115774,0.00008992043,0.000043933946,0.000013419809],"category_scores_gemma":[0.000016173066,0.00018106916,0.000046209414,0.000085839405,0.00007899022,0.0003784143,0.000024516557,0.00008154099,5.268495e-9],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007713908,0.0001608271,0.053089816,0.00016394262,0.00015155136,1.722125e-7,0.0014484392,0.00007905945,0.0006941652,0.0007905062,0.000035461908,0.94330895],"study_design_scores_gemma":[0.006641797,0.00039754942,0.015113182,0.00035551336,0.00012354131,3.5524835e-7,0.0005806832,0.96089053,0.011386935,0.0037965688,0.00038954872,0.00032382392],"about_ca_topic_score_codex":0.0006721888,"about_ca_topic_score_gemma":0.00006985641,"teacher_disagreement_score":0.96081144,"about_ca_system_score_codex":0.000141038,"about_ca_system_score_gemma":0.00009001502,"threshold_uncertainty_score":0.7383786},"labels":[],"label_agreement":null},{"id":"W4410840727","doi":"10.3390/a18060325","title":"ML-RASPF: A Machine Learning-Based Rate-Adaptive Framework for Dynamic Resource Allocation in Smart Healthcare IoT","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"IoT and Edge/Fog Computing","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 Calgary","funders":"","keywords":"Computer science; Internet of Things; Resource allocation; Health care; Resource (disambiguation); Artificial intelligence; Distributed computing; Machine learning; Embedded system; Computer network","score_opus":0.016036763106468704,"score_gpt":0.28690581503998275,"score_spread":0.27086905193351407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410840727","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.0046021477,0.0005464272,0.9809416,0.011032598,0.0020858059,0.00045460113,0.0000011193302,0.00022354884,0.000112138136],"genre_scores_gemma":[0.5615387,0.000011115588,0.43290398,0.0037402424,0.0005487213,0.00015930226,0.00007140782,0.00004202725,0.0009845342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982747,0.0002148867,0.00032513204,0.00055294344,0.00016454939,0.0004678118],"domain_scores_gemma":[0.99857014,0.00071050145,0.00011877394,0.00040393748,0.00012370643,0.00007294648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007783748,0.00019486742,0.00025299235,0.00029356408,0.00027562602,0.00010799168,0.0005872769,0.00016124806,9.575875e-7],"category_scores_gemma":[0.00023364267,0.0002025271,0.000083272345,0.0009765306,0.00003561679,0.00008949608,0.00016325043,0.00048952154,0.000012784015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022017707,0.0003830644,0.008147223,0.00033398383,0.00011000358,0.000058553116,0.0042458,0.027513914,0.00015422887,0.03043898,0.0022770425,0.926117],"study_design_scores_gemma":[0.0005261581,0.00018176233,0.004587093,0.00022138438,0.0000064214864,0.000001560086,0.000043602293,0.97583586,0.00017529185,0.011461108,0.0067619192,0.00019786847],"about_ca_topic_score_codex":0.00038610905,"about_ca_topic_score_gemma":0.00007705294,"teacher_disagreement_score":0.94832194,"about_ca_system_score_codex":0.00021832889,"about_ca_system_score_gemma":0.00022702725,"threshold_uncertainty_score":0.82588154},"labels":[],"label_agreement":null},{"id":"W4411026218","doi":"10.3390/a18060341","title":"S-EPSO: A Socio-Emotional Particle Swarm Optimization Algorithm for Multimodal Search in Low-Dimensional Engineering Applications","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Metaheuristic Optimization Algorithms Research","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Mathematical optimization; Algorithm; Computer science; Multi-swarm optimization; Mathematics","score_opus":0.015046567215443863,"score_gpt":0.29457266506491114,"score_spread":0.2795260978494673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411026218","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.00021614347,0.00014370777,0.996081,0.0015599405,0.00031094035,0.0013316128,0.00004362262,0.0002067701,0.000106250896],"genre_scores_gemma":[0.004384146,0.000022122018,0.99331206,0.00021209868,0.00013569149,0.0009871807,0.00010125985,0.000027341828,0.0008180865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972764,0.00010381776,0.00056074886,0.0007575597,0.0006376937,0.0006637381],"domain_scores_gemma":[0.99802244,0.0006098259,0.00006836392,0.00055640657,0.00055988395,0.00018307343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094043213,0.00024078575,0.0002985459,0.0004770555,0.0002609833,0.00021369815,0.0008268946,0.00014815385,0.000052285577],"category_scores_gemma":[0.00018161772,0.0002636122,0.00011407951,0.0017405372,0.00007385511,0.00047250863,0.00035718875,0.00029620854,0.000044312852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005050773,0.0003019712,0.00005878686,0.000044634748,0.000038354196,0.0000070661235,0.00009376209,0.8735647,0.00007255254,0.009698921,0.00015918637,0.11595502],"study_design_scores_gemma":[0.001445334,0.000036518162,0.0004296092,0.00004823606,0.0000073075516,0.000007419091,0.000023725961,0.9957572,0.00097271096,0.00052952615,0.00050481874,0.00023755725],"about_ca_topic_score_codex":0.00004295922,"about_ca_topic_score_gemma":0.0000016044116,"teacher_disagreement_score":0.12219254,"about_ca_system_score_codex":0.00025895986,"about_ca_system_score_gemma":0.00041820918,"threshold_uncertainty_score":0.9999816},"labels":[],"label_agreement":null},{"id":"W4413934912","doi":"10.3390/a18090547","title":"Learning SMILES Semantics: Word2Vec and Transformer Embeddings for Molecular Property Prediction","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Computational Drug Discovery Methods","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":"Wilfrid Laurier University","funders":"","keywords":"Word2vec; Property (philosophy); Computer science; Semantics (computer science); Natural language processing; Transformer; Artificial intelligence; Theoretical computer science; Programming language; Embedding; Epistemology; Engineering; Philosophy; Electrical engineering","score_opus":0.009134015020651417,"score_gpt":0.28206960696073696,"score_spread":0.27293559194008554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413934912","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.018113982,0.00022291562,0.97858936,0.0015098637,0.00028190034,0.00037994416,0.00000415681,0.00013232346,0.00076554925],"genre_scores_gemma":[0.27630153,0.000068085435,0.72104126,0.00049745635,0.00008090359,0.00017053317,0.000015019235,0.000019152443,0.0018060543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904597,0.00006905211,0.00018002551,0.00035429775,0.00015873503,0.00019191268],"domain_scores_gemma":[0.99948055,0.00020346692,0.000036204405,0.0001396314,0.00009780783,0.000042348645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040158507,0.00011656947,0.0001397301,0.00012168427,0.00016193299,0.00015414556,0.00022600825,0.000049255188,0.0000019780002],"category_scores_gemma":[0.00008704068,0.000091954505,0.000059526443,0.0002821598,0.000040076084,0.00037098798,0.00006562495,0.00011645698,0.0000018231793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014355136,0.000050005518,0.00036550267,0.00012234913,0.00008446282,0.000006953688,0.0013153078,0.018722769,0.002451989,0.026986787,0.00035299102,0.94952655],"study_design_scores_gemma":[0.0004081205,0.00009399241,0.0011274798,0.00006193875,0.000019247267,0.00001053634,0.00006490234,0.96555454,0.004541838,0.01751712,0.010477905,0.0001224114],"about_ca_topic_score_codex":0.000015063342,"about_ca_topic_score_gemma":9.823341e-7,"teacher_disagreement_score":0.9494041,"about_ca_system_score_codex":0.00002941489,"about_ca_system_score_gemma":0.000076051634,"threshold_uncertainty_score":0.3749796},"labels":[],"label_agreement":null},{"id":"W4414018262","doi":"10.3390/a18090564","title":"The Generative Adversarial Approach: A Cautionary Tale of Finite Samples","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","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":"Adversarial system; Generative grammar; Computer science; Artificial intelligence","score_opus":0.018328674342640714,"score_gpt":0.2573769284330431,"score_spread":0.2390482540904024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414018262","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.012489849,0.0005021656,0.92698807,0.0011491969,0.0014423941,0.00038213693,0.000110715424,0.000034753426,0.05690075],"genre_scores_gemma":[0.98835534,0.000022885873,0.0049654255,0.00007691923,0.0006141774,0.000045986093,0.00007119634,0.000005925073,0.0058421423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995177,0.000041295607,0.00013330138,0.00012241976,0.00007418356,0.00011111284],"domain_scores_gemma":[0.9996487,0.000108736676,0.00004910325,0.00013262065,0.0000397669,0.000021076838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006704568,0.0000712337,0.00009342317,0.00002091254,0.0001935684,0.000016635951,0.00009747464,0.000021914757,0.000064168315],"category_scores_gemma":[0.0000037422108,0.000049307462,0.00007471576,0.00013049736,0.00009124699,0.000041512292,0.000041365045,0.00009319837,0.0000035385647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110948225,0.00035174587,0.0018738268,0.000014799175,0.00052150304,0.0000010516073,0.00075456494,0.035661653,0.0006196312,0.50137275,0.036879953,0.4218376],"study_design_scores_gemma":[0.0017330516,0.0000715459,0.0015463175,0.00003295685,0.00011500868,0.0000020165633,0.002323045,0.7665692,0.0065138517,0.058600616,0.16211836,0.00037401947],"about_ca_topic_score_codex":0.00008740906,"about_ca_topic_score_gemma":7.958438e-7,"teacher_disagreement_score":0.9758655,"about_ca_system_score_codex":0.0000067415945,"about_ca_system_score_gemma":0.000047220557,"threshold_uncertainty_score":0.20107},"labels":[],"label_agreement":null},{"id":"W4414609280","doi":"10.3390/a18100606","title":"Impact of an Educational Intervention on BPPV Management: An Interrupted Time Series Analysis","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Vestibular and auditory disorders","field":"Neuroscience","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":"NOSM University; Science North; Laurentian University","funders":"","keywords":"Interrupted Time Series Analysis; Supine position; Interrupted time series; Intervention (counseling); Benign paroxysmal positional vertigo; Confounding","score_opus":0.011485167044781213,"score_gpt":0.33457352951168007,"score_spread":0.32308836246689887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414609280","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.98746103,0.000014647559,0.0055618314,0.00020698097,0.00037622254,0.00018082456,0.000066125634,0.000062177074,0.00607017],"genre_scores_gemma":[0.9951085,0.0000055093838,0.0007514438,0.00008586689,0.00004172098,0.000012719896,0.00010006586,0.0000074879017,0.0038866869],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991097,0.00011821127,0.00019103152,0.00029745087,0.00015478057,0.00012886678],"domain_scores_gemma":[0.9995142,0.000031155698,0.00008101678,0.00029519256,0.000030227216,0.000048199727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000976987,0.00010775224,0.00015060887,0.00042258448,0.00007356979,0.000045501958,0.00024210114,0.000031885054,0.00058783125],"category_scores_gemma":[0.000050377093,0.00009808547,0.00017832445,0.00083942374,0.00007791181,0.00034910362,0.000040441217,0.00006415392,0.000049579707],"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.0011918993,0.015906608,0.03507899,0.0002975273,0.0047341012,0.000086789376,0.0030793347,0.079545975,0.073944345,0.01593548,0.007187146,0.7630118],"study_design_scores_gemma":[0.0027430146,0.0042748097,0.6744421,0.00027724128,0.0015565989,0.000016184904,0.00088965124,0.25430986,0.04570737,0.013550029,0.001237888,0.0009952582],"about_ca_topic_score_codex":0.000060482034,"about_ca_topic_score_gemma":0.000013174115,"teacher_disagreement_score":0.76201653,"about_ca_system_score_codex":0.000043843065,"about_ca_system_score_gemma":0.000024502056,"threshold_uncertainty_score":0.643634},"labels":[],"label_agreement":null},{"id":"W4415819927","doi":"10.3390/a18110695","title":"Machine Learning Systems Tuned by Bayesian Optimization to Forecast Electricity Demand and Production","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Energy Load and Power Forecasting","field":"Engineering","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":"Concordia University","funders":"","keywords":"Hyperparameter; Bayesian optimization; Renewable energy; Wind power; Electricity generation; Convolutional neural network; Artificial neural network; Electricity; Hyperparameter optimization; Production (economics)","score_opus":0.004489227441855999,"score_gpt":0.19348468133431648,"score_spread":0.18899545389246047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415819927","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.014094829,0.003166326,0.9785046,0.00016621659,0.00078185456,0.0002286793,0.00000623276,0.00038054286,0.0026707232],"genre_scores_gemma":[0.9896653,0.00036514254,0.0076454724,0.00003399043,0.00016011679,0.00003961666,0.000066254965,0.000033783166,0.0019902675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993325,0.000028282288,0.00016504685,0.00019340275,0.000079734025,0.00020104813],"domain_scores_gemma":[0.99976414,0.000027133105,0.000021469401,0.00008466058,0.000030293635,0.00007229999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016400234,0.00012727929,0.000141485,0.00012875094,0.00015255707,0.000063704945,0.00005076394,0.00006305961,0.0000054375228],"category_scores_gemma":[0.000066782515,0.00013013947,0.000016253221,0.00039513814,0.000008997226,0.000106983156,0.000019140936,0.0001360479,0.000001595647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004906273,0.0000065926065,0.0005015614,0.00006734576,0.0000300083,0.0000014723265,0.00010619789,0.9679863,0.001149592,0.00006003796,0.0007393078,0.029346716],"study_design_scores_gemma":[0.00014315202,0.00003452004,0.000026366915,0.000058270754,0.000015367475,0.000014801412,0.000023992057,0.9888816,0.0032492203,0.00001690054,0.007400325,0.0001355156],"about_ca_topic_score_codex":0.00009662361,"about_ca_topic_score_gemma":0.000011499999,"teacher_disagreement_score":0.9755705,"about_ca_system_score_codex":0.000053697506,"about_ca_system_score_gemma":0.000007874206,"threshold_uncertainty_score":0.53069335},"labels":[],"label_agreement":null},{"id":"W4415820012","doi":"10.3390/a18110691","title":"Attribution-Driven Teaching Interventions: Linking I-AHP Weighted Assessment to Explainable Student Clustering","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Analytic hierarchy process; Key (lock); Cluster analysis; Process (computing); Hierarchy; Random forest; Hierarchical clustering","score_opus":0.02988479999133863,"score_gpt":0.36055208487639395,"score_spread":0.3306672848850553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415820012","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.006440319,0.00017581473,0.98747665,0.0008039053,0.0020554082,0.0004057079,0.0000016648689,0.00028403345,0.0023564796],"genre_scores_gemma":[0.636269,0.000012400909,0.34513924,0.00037942492,0.00035136394,0.00018398526,0.000011201519,0.000020723452,0.017632665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788916,0.00021286623,0.0005115323,0.0005539552,0.00037450812,0.00045796938],"domain_scores_gemma":[0.99898875,0.00012011149,0.00013037122,0.0004927626,0.0001685009,0.0000995056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010659765,0.00020648287,0.00027841056,0.00033481818,0.0006700725,0.0005597727,0.00092631544,0.00006912721,0.000012001577],"category_scores_gemma":[0.000034876794,0.0002037924,0.00018272812,0.0004309021,0.000011687653,0.00045878565,0.00096803525,0.00043717786,0.00006921459],"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.0000055552396,0.00033572526,0.008800757,0.00024092032,0.00028667928,0.000111891655,0.004094324,0.013014872,0.0007555239,0.8077639,0.00045752068,0.16413234],"study_design_scores_gemma":[0.0010697116,0.00069163705,0.0232135,0.0073394193,0.00006499757,0.000041563442,0.0027337195,0.60287195,0.0010834965,0.0019825674,0.3577944,0.0011130405],"about_ca_topic_score_codex":0.00016138534,"about_ca_topic_score_gemma":0.000015944566,"teacher_disagreement_score":0.8057813,"about_ca_system_score_codex":0.00052175316,"about_ca_system_score_gemma":0.00008489843,"threshold_uncertainty_score":0.8310413},"labels":[],"label_agreement":null},{"id":"W4416782102","doi":"10.3390/a18120747","title":"A Monte Carlo Simulation Algorithm to Assess Rollout Feasibility in Stepped-Wedge Trials: A Case Study of National CPR Training Kiosk Deployment","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Cardiac Arrest and Resuscitation","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"NOSM University; Health Sciences North","funders":"","keywords":"Monte Carlo method; Context (archaeology); Interactive kiosk; Software deployment; Productivity; Cluster (spacecraft)","score_opus":0.19410598243628593,"score_gpt":0.45427333847262313,"score_spread":0.2601673560363372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416782102","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.9871635,0.00014233515,0.0075376434,0.00020152457,0.0010568368,0.003583489,0.000044578162,0.000054704433,0.00021537597],"genre_scores_gemma":[0.99551845,0.0000037705388,0.003767046,0.00010996656,0.00023684891,0.00021077844,0.0000112722955,0.000019072031,0.00012279401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714035,0.00047936992,0.0009887767,0.0004617672,0.0006799025,0.0002498263],"domain_scores_gemma":[0.9979723,0.0009557871,0.00018575165,0.00027801498,0.00047885696,0.0001292939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002848385,0.00020635425,0.00083620904,0.00053286314,0.000085687556,0.000028753788,0.00007448482,0.00011753644,0.000008787442],"category_scores_gemma":[0.0013597484,0.00018407118,0.00020137198,0.0008729134,0.00003067352,0.00012360238,0.00006438251,0.0002140992,0.0000031766335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017465042,0.0053170933,0.1604667,0.0002730546,0.0012004633,0.0025983125,0.0604225,0.15190409,0.00051215716,0.000021282065,0.00032510576,0.61521274],"study_design_scores_gemma":[0.031088125,0.0011243927,0.25009465,0.00050615676,0.00073037075,0.00010383088,0.060134627,0.65478396,0.00016246935,0.00017894917,0.0005681423,0.0005242743],"about_ca_topic_score_codex":0.0011701975,"about_ca_topic_score_gemma":0.00067722145,"teacher_disagreement_score":0.61468846,"about_ca_system_score_codex":0.000417583,"about_ca_system_score_gemma":0.00041228053,"threshold_uncertainty_score":0.7506205},"labels":[],"label_agreement":null},{"id":"W4416786302","doi":"10.3390/a18120753","title":"A Variable-Speed and Multi-Condition Bearing Fault Diagnosis Method Based on Adaptive Signal Decomposition and Deep Feature Fusion","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Machine Fault Diagnosis Techniques","field":"Engineering","cited_by":3,"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":"Beijing Municipal Commission of Education; National Natural Science Foundation of China","keywords":"Pattern recognition (psychology); Robustness (evolution); Feature extraction; Deep learning; Interference (communication); Fault (geology); Feature (linguistics); Noise (video); Deep belief network; Sparse approximation","score_opus":0.00896701633650218,"score_gpt":0.29995606859240853,"score_spread":0.2909890522559064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416786302","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.013542704,0.0006721549,0.98338574,0.00023562805,0.00013504739,0.0005839919,0.000061117,0.00063195697,0.0007516604],"genre_scores_gemma":[0.36687267,0.00017338019,0.6321172,0.00037886706,0.0000605066,0.0002374632,0.00009731785,0.00004066772,0.000021886368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989924,0.00009013299,0.00018099142,0.00035841574,0.00014972809,0.00022832194],"domain_scores_gemma":[0.9991486,0.00050627976,0.00003781431,0.00016980256,0.000055316214,0.000082173414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025118495,0.00025927916,0.0002628456,0.00028594933,0.00014480187,0.0000777915,0.00008659526,0.00021503438,0.00003088982],"category_scores_gemma":[0.000045250363,0.00026426543,0.0000420312,0.00027612585,0.000028769373,0.00016679916,0.000055277742,0.0003354125,0.0000020946766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015839362,0.00060493924,0.0070176055,0.00053577585,0.00038018415,0.00008472366,0.0006274415,0.10500418,0.029744651,0.0023690767,0.0045119794,0.84896106],"study_design_scores_gemma":[0.00087050616,0.00012680599,0.008396974,0.0003147454,0.000083561856,0.0000064325286,0.000022158752,0.9618501,0.026796658,0.00077344093,0.0005060407,0.00025254226],"about_ca_topic_score_codex":0.00011429601,"about_ca_topic_score_gemma":0.00002166904,"teacher_disagreement_score":0.856846,"about_ca_system_score_codex":0.00010429104,"about_ca_system_score_gemma":0.000010749968,"threshold_uncertainty_score":0.9999809},"labels":[],"label_agreement":null},{"id":"W4417054803","doi":"10.3390/a18120768","title":"Robust Regularized Recursive Least-Squares Algorithm Based on Third-Order Tensor Decomposition","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Tensor decomposition; Robustness (evolution); Regularization (linguistics); Kronecker delta; Adaptive filter; Kronecker product; Filter (signal processing)","score_opus":0.01334258388753797,"score_gpt":0.25615741983115814,"score_spread":0.24281483594362016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417054803","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.0005293938,0.00015336603,0.99009836,0.0003416391,0.0005891862,0.00046811535,0.00006505353,0.0019595537,0.0057953484],"genre_scores_gemma":[0.012482032,0.00005181707,0.98556024,0.00044014427,0.00016945638,0.00021186241,0.00010642269,0.00009577705,0.00088227517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985564,0.000057368103,0.00030586115,0.0004200705,0.00024550973,0.00041479265],"domain_scores_gemma":[0.9990066,0.00015525465,0.000050886643,0.0005258598,0.00018048294,0.00008090724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014149249,0.00035237698,0.0003446449,0.0003273839,0.00013629292,0.00005468566,0.0002337223,0.00019112784,0.00004805744],"category_scores_gemma":[0.00006479581,0.00036618332,0.0001121221,0.00051134865,0.00007716189,0.00017649651,0.000052242205,0.00037869427,0.00004640122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019536565,0.000353289,0.00006095696,0.00023324786,0.0003192002,0.00027034196,0.00018563376,0.48762986,0.015030412,0.004558572,0.01872212,0.472441],"study_design_scores_gemma":[0.00096344436,0.00018400163,0.000570034,0.00040471574,0.000042471722,0.00001157901,0.00004432386,0.9451756,0.03740435,0.0048994627,0.009784286,0.00051574124],"about_ca_topic_score_codex":0.00001596336,"about_ca_topic_score_gemma":0.000002827353,"teacher_disagreement_score":0.47192526,"about_ca_system_score_codex":0.00026154562,"about_ca_system_score_gemma":0.000034327677,"threshold_uncertainty_score":0.999879},"labels":[],"label_agreement":null},{"id":"W4417420641","doi":"10.3390/a18120798","title":"Genetic-Based Lottery Ticket Pruning for Transformers in Sentiment Classification: Realized Through Lottery Sample Selection","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Sentiment Analysis and Opinion Mining","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 Windsor","funders":"","keywords":"Inference; Lottery; Ticket; Transformer; Pruning; Sample (material); Selection (genetic algorithm); Language model","score_opus":0.035167542418044734,"score_gpt":0.3140874068677849,"score_spread":0.27891986444974015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417420641","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.009927098,0.00012983567,0.9865699,0.0022680166,0.00038978452,0.00035599165,0.000008370127,0.00008327679,0.00026773626],"genre_scores_gemma":[0.22563265,0.000059399994,0.7716536,0.0017686026,0.00015254687,0.00022626943,0.00014479141,0.000018612716,0.00034353367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984751,0.00007279155,0.0004327017,0.0005054709,0.00021632446,0.00029761108],"domain_scores_gemma":[0.9992252,0.00029231183,0.00010474855,0.00026629033,0.00007472684,0.000036731828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026625837,0.00015790037,0.00023662111,0.00022563562,0.00015075167,0.00015980998,0.0003180514,0.00007413346,0.000034004857],"category_scores_gemma":[0.000020827401,0.00016133988,0.00013186313,0.000827504,0.000027375994,0.0002810451,0.000031042928,0.00008730727,0.000007387459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019302992,0.0010150503,0.061876446,0.00019644285,0.0007960297,0.000015889851,0.004691303,0.010977241,0.01068631,0.015133481,0.012674562,0.8817442],"study_design_scores_gemma":[0.0014176355,0.000051366256,0.011108906,0.00007220276,0.000043897493,6.675202e-7,0.00014204832,0.96570784,0.0065737423,0.0015413223,0.013132658,0.000207739],"about_ca_topic_score_codex":0.00031879646,"about_ca_topic_score_gemma":0.00007093468,"teacher_disagreement_score":0.9547306,"about_ca_system_score_codex":0.00011688024,"about_ca_system_score_gemma":0.00011221677,"threshold_uncertainty_score":0.65792495},"labels":[],"label_agreement":null},{"id":"W7108647109","doi":"10.3390/a18120762","title":"Improving Deep Learning Models by Bayesian Optimization to Predict Crude Oil Prices","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Market Dynamics and Volatility","field":"Economics, Econometrics and Finance","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":"Concordia University","funders":"","keywords":"Deep learning; Robustness (evolution); Artificial neural network; Mean squared error; Convolutional neural network; Crude oil; Bayesian probability; Mean absolute error; Mean absolute percentage error","score_opus":0.010816820502018574,"score_gpt":0.20656305052771215,"score_spread":0.19574623002569358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7108647109","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.005568469,0.0009917682,0.9499323,0.0003234759,0.00030299788,0.000116769064,0.00005746493,0.0000782857,0.042628467],"genre_scores_gemma":[0.84694827,0.0006023873,0.1368089,0.00057843013,0.00014049318,0.00011211806,0.00015142125,0.000058645084,0.014599364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872595,0.00001646128,0.00045709324,0.00047109427,0.000041171283,0.00028825604],"domain_scores_gemma":[0.9993825,0.00005428234,0.00017306312,0.0002558485,0.000042672254,0.000091618276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000535528,0.00014765831,0.00027302766,0.00019950276,0.00017631851,0.0001391621,0.00022561658,0.00011149579,0.00015163682],"category_scores_gemma":[0.00014049573,0.00018086018,0.00006827665,0.00037191965,0.000018664254,0.0002838834,0.00011140406,0.00017551973,0.000013046034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058841022,0.000256893,0.060563862,0.00025780918,0.00019814224,0.0000049183436,0.0007772859,0.4011929,0.000039576684,0.02853809,0.0010970301,0.50701463],"study_design_scores_gemma":[0.0002254625,0.00003104505,0.0004199167,0.00001385478,0.0000057226057,3.892449e-7,0.000033976106,0.9898234,0.000007747596,0.0038135084,0.0054499265,0.00017507358],"about_ca_topic_score_codex":0.0005153283,"about_ca_topic_score_gemma":0.00002424629,"teacher_disagreement_score":0.84137976,"about_ca_system_score_codex":0.0001138554,"about_ca_system_score_gemma":0.000017905133,"threshold_uncertainty_score":0.7375264},"labels":[],"label_agreement":null}]}