{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29619348,0.007700363,0.6701958,0.00035751626,0.00016526284,0.00016205989,0.00008493991,0.000998312,0.02414226],"genre_scores_gemma":[0.8689094,0.0021726731,0.12579988,0.000076171214,0.000033012046,0.00012668673,0.00009615022,0.000060551734,0.0027254727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995152,0.00010882243,0.00004339466,0.000072663366,0.0002145357,0.000045358876],"domain_scores_gemma":[0.999042,0.00056811236,0.000078202844,0.000070040165,0.00022030847,0.000021272856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011774522,0.00059655274,0.00068621064,0.00096790266,0.00028084242,0.0008243824,0.00049287203,0.00072825403,0.0006615922],"category_scores_gemma":[0.003304396,0.00019134827,0.00038923652,0.0006725582,0.00027821286,0.0006216597,0.00031715937,0.00048119357,0.00010856906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034962982,0.00016820998,0.004065526,0.00044055618,0.00017614878,0.00017946445,0.00013051312,0.64202267,0.013661662,0.008333167,0.00087434595,0.32959804],"study_design_scores_gemma":[0.000026725651,0.00016959036,0.0017775715,0.00002010484,0.000038320606,0.00009242513,0.00003787636,0.98905075,0.006432258,0.00074248936,0.0015956013,0.000016296106],"about_ca_topic_score_codex":0.0035142826,"about_ca_topic_score_gemma":0.0030404385,"teacher_disagreement_score":0.0035142826,"about_ca_system_score_codex":0.0003874872,"about_ca_system_score_gemma":0.00050516904,"threshold_uncertainty_score":0.006987691},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32337713,0.008026164,0.5449504,0.00912947,0.0008006516,0.0005853122,0.002624072,0.003764612,0.106742196],"genre_scores_gemma":[0.8921016,0.0016026594,0.08941452,0.0010526817,0.00035822424,0.00020614134,0.0019783012,0.00035615344,0.012929709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979518,0.00036912612,0.00007178248,0.00082929747,0.0003441185,0.00043389533],"domain_scores_gemma":[0.99633235,0.00202168,0.00038940407,0.00087825564,0.00014767221,0.00023062892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009416671,0.0008220271,0.0010888485,0.0005786664,0.001290488,0.00293191,0.0022706739,0.001864895,0.008710297],"category_scores_gemma":[0.0052496474,0.0004869825,0.001055082,0.0014246806,0.0021030626,0.0059796614,0.0021811437,0.002301989,0.0010415923],"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.001135676,0.00032855783,0.0020265223,0.0010008563,0.00012710571,0.0008959228,0.00058944325,0.25787127,0.016274743,0.46317676,0.029111318,0.22746184],"study_design_scores_gemma":[0.00010488444,0.00022007313,0.0010314011,0.00012425012,0.000059601527,0.0008341619,0.00028747984,0.31943113,0.010098314,0.63469476,0.03306027,0.00005369084],"about_ca_topic_score_codex":0.0020388723,"about_ca_topic_score_gemma":0.0017411496,"teacher_disagreement_score":0.008710297,"about_ca_system_score_codex":0.002075798,"about_ca_system_score_gemma":0.0010458585,"threshold_uncertainty_score":0.029138863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40771145,0.0021368975,0.51261216,0.0058740363,0.00035648904,0.00037477777,0.00035070855,0.0010442979,0.06953916],"genre_scores_gemma":[0.9714522,0.0005543582,0.021769341,0.00022829308,0.00007789833,0.00025555643,0.00010176924,0.00006105185,0.0054995446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927584,0.0022740525,0.00035561243,0.00078614487,0.0027807606,0.0010450237],"domain_scores_gemma":[0.99195576,0.0039635072,0.0006893407,0.0023434644,0.0006551429,0.0003927524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006511971,0.0005924038,0.0021728612,0.0013553578,0.003333531,0.00454011,0.0020644395,0.003422981,0.0037502542],"category_scores_gemma":[0.014488158,0.0006412184,0.00082151307,0.0017618831,0.007507784,0.0056692604,0.008804723,0.0035711962,0.0012422712],"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.00032406935,0.000042050284,0.00043510718,0.000104306186,0.000044294666,0.00018297299,0.00057456334,0.022895996,0.0056096013,0.957383,0.00104322,0.011360889],"study_design_scores_gemma":[0.00017383038,0.00012578987,0.0002910936,0.000078434925,0.000039616658,0.00026878584,0.00015036279,0.117482446,0.011125649,0.86402446,0.0061233453,0.0001161291],"about_ca_topic_score_codex":0.00070224097,"about_ca_topic_score_gemma":0.0003045288,"teacher_disagreement_score":0.006511971,"about_ca_system_score_codex":0.0017353583,"about_ca_system_score_gemma":0.0027100346,"threshold_uncertainty_score":0.034439027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.869518,0.0005114426,0.12738723,0.00010307479,0.000029261451,0.000031189138,0.00023016418,0.00030430593,0.0018853549],"genre_scores_gemma":[0.9891678,0.000118013835,0.009378279,0.00001211531,0.0000055825562,0.00003897641,0.00018728402,0.000008553004,0.0010833733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999249,0.000021283333,0.0000061787814,0.000022651582,0.000015677684,0.000009257758],"domain_scores_gemma":[0.99967957,0.00019878647,0.000040716026,0.000009830817,0.00006311468,0.000007906165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004263298,0.00046809064,0.0002520663,0.0002718364,0.0001352711,0.00033490476,0.0002704508,0.00036062906,0.0004054356],"category_scores_gemma":[0.00091080554,0.000177243,0.0002879309,0.00022609328,0.00011645491,0.00029091706,0.00013822231,0.0003101347,0.000099818695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004226776,0.000020770909,0.002460931,0.000012878736,0.0000148084555,0.000010190698,0.000009708252,0.9883144,0.0013668879,0.0000909628,0.00007417282,0.0075819693],"study_design_scores_gemma":[7.590837e-7,0.000008281534,0.00045418873,7.6124405e-7,0.0000016791391,9.950752e-7,0.0000010558109,0.9991635,0.00029068533,0.00005417121,0.000022740849,0.0000011822187],"about_ca_topic_score_codex":0.019097904,"about_ca_topic_score_gemma":0.014877026,"teacher_disagreement_score":0.019097904,"about_ca_system_score_codex":0.0008246228,"about_ca_system_score_gemma":0.00039727066,"threshold_uncertainty_score":0.037973464},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5430854,0.005058152,0.4266998,0.0046438286,0.000105104766,0.00018006061,0.0005529433,0.0013366588,0.018338135],"genre_scores_gemma":[0.972029,0.0008757333,0.02450653,0.00025407414,0.000094370705,0.00009508148,0.00014963123,0.00015651682,0.0018390194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963973,0.0017819199,0.00010805921,0.0005995251,0.0007114484,0.0004016886],"domain_scores_gemma":[0.9516103,0.038540334,0.0040523154,0.0029783002,0.0014806993,0.0013379811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024025033,0.00061562087,0.0017347555,0.0010971581,0.0017938286,0.0021938195,0.0024314565,0.001457737,0.0030959842],"category_scores_gemma":[0.031494122,0.0006238362,0.00058725214,0.0019837986,0.0022228877,0.0053991154,0.0029340284,0.0017587586,0.0006012044],"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.0011780775,0.00035152622,0.007722456,0.0010214394,0.0001651881,0.0005767012,0.00085777574,0.7929594,0.009134703,0.13203004,0.0067797336,0.047223024],"study_design_scores_gemma":[0.000074461874,0.00023099541,0.001474886,0.00005753567,0.000074517935,0.00047011927,0.00030915067,0.89878255,0.005131841,0.090625554,0.0027348178,0.00003366476],"about_ca_topic_score_codex":0.001539347,"about_ca_topic_score_gemma":0.0019803208,"teacher_disagreement_score":0.0030959842,"about_ca_system_score_codex":0.0019191315,"about_ca_system_score_gemma":0.00079611025,"threshold_uncertainty_score":0.01392436},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028592587,0.00040506604,0.967775,0.00007019585,0.000051769246,0.0001499671,0.00005708853,0.00086447515,0.0020337498],"genre_scores_gemma":[0.340749,0.000390393,0.65691996,0.00006247711,0.00004763563,0.00018399785,0.0001877017,0.000036589743,0.0014222512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857557,0.00038113273,0.00016695487,0.0002201355,0.0005939958,0.000062128325],"domain_scores_gemma":[0.99861836,0.00063551473,0.00013894288,0.00015124974,0.0004286531,0.000027268226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017504352,0.00057918014,0.00083047745,0.0017477643,0.00057633757,0.0018888633,0.0011104272,0.0009579923,0.0012500576],"category_scores_gemma":[0.0042944164,0.0003010282,0.00078659336,0.0011536832,0.0005424274,0.00092689204,0.0003900736,0.0006165507,0.0007520904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026051266,0.00026400603,0.0037217187,0.00042260764,0.0002571359,0.00028948404,0.0003871084,0.22079152,0.040184606,0.0064986586,0.0013499851,0.7255727],"study_design_scores_gemma":[0.000027084256,0.00010926746,0.0021627715,0.00007434946,0.00008724489,0.00017272182,0.00006713897,0.97902465,0.011874072,0.0042551085,0.0020989338,0.000046634694],"about_ca_topic_score_codex":0.0037719733,"about_ca_topic_score_gemma":0.0033036578,"teacher_disagreement_score":0.0037719733,"about_ca_system_score_codex":0.00051354175,"about_ca_system_score_gemma":0.0005202871,"threshold_uncertainty_score":0.009257317},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.248001,0.002204252,0.6970792,0.006480894,0.00045327347,0.0007706762,0.0014803481,0.001916028,0.04161446],"genre_scores_gemma":[0.5408916,0.0012237673,0.44623172,0.0007376338,0.0002867905,0.0006220341,0.0024323144,0.00032737077,0.007246755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970265,0.00091538887,0.0001574731,0.000737637,0.0007777147,0.00038532694],"domain_scores_gemma":[0.9871911,0.009089769,0.0005946016,0.001875913,0.00081892684,0.0004295609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024359515,0.0016302484,0.0017340834,0.0014502903,0.001671491,0.0027143955,0.00391308,0.0016971494,0.01218719],"category_scores_gemma":[0.014441641,0.0006801861,0.002206258,0.0038473906,0.0019200597,0.0075427094,0.002702533,0.003690019,0.0011849462],"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.0021642079,0.00084761094,0.0037056985,0.0011702151,0.00017960949,0.00037819325,0.00024632164,0.72954345,0.008346844,0.11743486,0.018888941,0.117094085],"study_design_scores_gemma":[0.00014870171,0.0001643846,0.0004492305,0.000018493285,0.000057927788,0.00016839894,0.00006864205,0.9592011,0.0016368526,0.03498666,0.003079748,0.000019862457],"about_ca_topic_score_codex":0.0058486685,"about_ca_topic_score_gemma":0.00579113,"teacher_disagreement_score":0.01218719,"about_ca_system_score_codex":0.0030847376,"about_ca_system_score_gemma":0.0032474,"threshold_uncertainty_score":0.040770173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009582908,0.0005130149,0.9835864,0.0009363729,0.00013100175,0.00021906114,0.00036908354,0.001473039,0.0031891102],"genre_scores_gemma":[0.15955654,0.0007470224,0.82960755,0.00052782416,0.00032932332,0.0009204955,0.0019219329,0.00039818438,0.0059911157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653256,0.0009683417,0.00028232404,0.0008921956,0.0010492592,0.00027532672],"domain_scores_gemma":[0.99336183,0.0037997658,0.0005482216,0.001339373,0.0006763696,0.00027432878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002812657,0.0017549595,0.0027671906,0.0011929526,0.0011698401,0.0022317201,0.0039880048,0.0032542478,0.009837071],"category_scores_gemma":[0.017036147,0.00072351354,0.0015338659,0.0040411684,0.0013672782,0.0071002427,0.0028940043,0.003719941,0.0037059656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009702731,0.0004573317,0.0011582113,0.00073275965,0.00015955754,0.0002514286,0.000354396,0.5033935,0.005156176,0.10844808,0.030336577,0.3485818],"study_design_scores_gemma":[0.00013398415,0.00013572095,0.00015777619,0.000022419867,0.000022795808,0.00019668663,0.000075167045,0.9116369,0.0012371087,0.08295157,0.003411681,0.000018243343],"about_ca_topic_score_codex":0.0025739265,"about_ca_topic_score_gemma":0.0024509672,"teacher_disagreement_score":0.009837071,"about_ca_system_score_codex":0.0018926564,"about_ca_system_score_gemma":0.0026587965,"threshold_uncertainty_score":0.03290826},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3120741,0.00044693524,0.6705245,0.0005454661,0.0001077173,0.00009399751,0.00030480674,0.0019589297,0.013943517],"genre_scores_gemma":[0.58633244,0.00018993508,0.40733042,0.00011552347,0.000021664628,0.00014179834,0.00053016143,0.00017399412,0.0051639853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996433,0.00010440812,0.0000204851,0.00006782928,0.000101436606,0.00006254575],"domain_scores_gemma":[0.99934417,0.000322277,0.00004986502,0.00010176363,0.00014323366,0.000038717688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049403263,0.0003860544,0.00043028974,0.00041183905,0.00046056174,0.00084246247,0.00084745226,0.00062180485,0.0035371785],"category_scores_gemma":[0.002112589,0.00021525071,0.00043204604,0.00091569277,0.00025345973,0.00058384525,0.0005076535,0.0005833324,0.0004770019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023290887,0.0001393274,0.0029718773,0.00009682585,0.000045551773,0.00017038743,0.0001344912,0.73109895,0.00964126,0.009819437,0.005149855,0.24049911],"study_design_scores_gemma":[0.000021693853,0.000039883562,0.0004746132,0.000004863759,0.000006463806,0.000036345406,0.000039672756,0.9909196,0.0021098235,0.0037857546,0.0025571787,0.0000041486724],"about_ca_topic_score_codex":0.0071664043,"about_ca_topic_score_gemma":0.008991179,"teacher_disagreement_score":0.0071664043,"about_ca_system_score_codex":0.0005545571,"about_ca_system_score_gemma":0.00094717764,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12671499,0.0013817514,0.82468116,0.00086620735,0.0005824838,0.0005328361,0.0009410073,0.010275641,0.03402396],"genre_scores_gemma":[0.71376145,0.000834928,0.26962376,0.00028235203,0.00024356243,0.0002786781,0.0006223177,0.0001387726,0.014214137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993837,0.00014611853,0.000024099914,0.00010937523,0.00029712872,0.000039621205],"domain_scores_gemma":[0.9993044,0.00014957176,0.000117200994,0.00012708952,0.00022512153,0.00007653108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599375,0.0005328778,0.00038982026,0.0009799416,0.00025954895,0.0009815426,0.0005271331,0.0004890257,0.0026891092],"category_scores_gemma":[0.0011863348,0.00019244666,0.00020589195,0.000650371,0.00041568096,0.0012584176,0.0006480538,0.0006506444,0.0009264996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070883083,0.000207877,0.020093214,0.0004924047,0.00007833881,0.00047654047,0.0007870034,0.011943574,0.22668591,0.02570533,0.019392122,0.6934289],"study_design_scores_gemma":[0.00019752058,0.0038421573,0.082010664,0.00025274482,0.0002363793,0.0042475667,0.0010094303,0.45461965,0.24763207,0.019831058,0.18569669,0.0004241355],"about_ca_topic_score_codex":0.00070330256,"about_ca_topic_score_gemma":0.0010266835,"teacher_disagreement_score":0.0026891092,"about_ca_system_score_codex":0.00035343776,"about_ca_system_score_gemma":0.00041576457,"threshold_uncertainty_score":0.00899601},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006163544,0.00018474874,0.9911805,0.0004361749,0.000056470682,0.00015742336,0.00014005396,0.0007120046,0.0009692095],"genre_scores_gemma":[0.08815927,0.00022584989,0.9098667,0.00015749656,0.00007236924,0.00026217816,0.00042610132,0.00007573527,0.0007542788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982645,0.00030349346,0.00015779908,0.0003228952,0.0008057563,0.00014554444],"domain_scores_gemma":[0.9974692,0.0012219714,0.00021573581,0.0003605914,0.00061469426,0.000117789765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018831257,0.0011234847,0.0011771426,0.0020308373,0.0018699265,0.0025122534,0.0025948256,0.0013843187,0.0013921527],"category_scores_gemma":[0.008616394,0.00046051547,0.0010194407,0.00341693,0.0010400119,0.003911374,0.0024071294,0.0018089294,0.00063613575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005226631,0.0004984964,0.0054802503,0.00039366222,0.0001544587,0.00046393988,0.00056493504,0.3349125,0.010293978,0.08387656,0.021670071,0.5411685],"study_design_scores_gemma":[0.000048253176,0.000041614614,0.00018632598,0.00001502854,0.00001814047,0.0001982715,0.00011427906,0.9649639,0.0029468404,0.026803585,0.0046460894,0.000017630975],"about_ca_topic_score_codex":0.0052822586,"about_ca_topic_score_gemma":0.003855261,"teacher_disagreement_score":0.0052822586,"about_ca_system_score_codex":0.0012686381,"about_ca_system_score_gemma":0.0035921258,"threshold_uncertainty_score":0.010502994},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027215101,0.95549816,0.025865825,0.0005386794,0.00074745016,0.000038719834,0.00009245966,0.00013915876,0.0143579915],"genre_scores_gemma":[0.02411776,0.9466354,0.019718334,0.00065701175,0.0012441037,0.000043392436,0.00031297753,0.00003555052,0.0072353464],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972135,0.000022674138,0.000041962598,0.0000686122,0.00012792765,0.000017504111],"domain_scores_gemma":[0.999469,0.00022126296,0.000045502005,0.000021173399,0.00022243019,0.000020693275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045495536,0.0006934623,0.00061548885,0.0017535657,0.0002873772,0.00069365505,0.0009088827,0.00084608793,0.00448064],"category_scores_gemma":[0.00097347423,0.00028633873,0.00051852484,0.0021395455,0.0002326653,0.0010118821,0.0003821287,0.00059703825,0.0015430357],"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.000076054064,0.00006296294,0.00033261275,0.0070315236,0.000050957835,0.00017249996,0.00005875512,0.0037351802,0.004619223,0.005457838,0.01462378,0.96377844],"study_design_scores_gemma":[0.000018816876,0.0002964985,0.0012115292,0.002252867,0.00018023752,0.0014512225,0.00011659871,0.0119507015,0.007582764,0.0053725922,0.9694884,0.00007769134],"about_ca_topic_score_codex":0.0014611474,"about_ca_topic_score_gemma":0.0012970477,"teacher_disagreement_score":0.00448064,"about_ca_system_score_codex":0.00036958663,"about_ca_system_score_gemma":0.0006217699,"threshold_uncertainty_score":0.014989197},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03506842,0.00094214134,0.94482785,0.0021196122,0.00041829704,0.00042583022,0.00050210656,0.0038563015,0.011839402],"genre_scores_gemma":[0.16015947,0.00036198998,0.8297544,0.0006877838,0.00020399236,0.0006971699,0.001527677,0.0005936791,0.0060139024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742836,0.00048530425,0.00015709296,0.00066148065,0.00063003943,0.0006377087],"domain_scores_gemma":[0.99794513,0.00091197854,0.00018991943,0.00054108276,0.00021562271,0.00019639394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019304694,0.0025277126,0.0022273255,0.0014726958,0.0017455119,0.0025939385,0.0037356915,0.003868018,0.009751904],"category_scores_gemma":[0.0065968176,0.0010818745,0.0024000749,0.002915068,0.0010150388,0.0045139883,0.0029998787,0.005205171,0.0035032171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002003583,0.0012383003,0.001578964,0.0005877819,0.00025847694,0.00034058426,0.000526434,0.47060713,0.012245127,0.06247427,0.04550836,0.402631],"study_design_scores_gemma":[0.00041029058,0.00016658046,0.0002712608,0.00003956776,0.000048271915,0.00024186746,0.00010128545,0.9262427,0.002149488,0.06446547,0.0058303038,0.00003282235],"about_ca_topic_score_codex":0.005223747,"about_ca_topic_score_gemma":0.006028931,"teacher_disagreement_score":0.009751904,"about_ca_system_score_codex":0.003342561,"about_ca_system_score_gemma":0.0039632865,"threshold_uncertainty_score":0.03262341},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07338902,0.00020074297,0.9231911,0.00004385802,0.000041737698,0.00003418133,0.000006372836,0.00022147338,0.0028714396],"genre_scores_gemma":[0.9508396,0.00013936225,0.047164243,0.00003163155,0.0000149098305,0.00004721396,0.00001549159,0.000014860854,0.001732648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962676,0.000039051825,0.000026116239,0.00010432606,0.00017772375,0.00002605904],"domain_scores_gemma":[0.9995609,0.00008684648,0.00012606682,0.000054804743,0.00014637683,0.000025075602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063091115,0.0004642296,0.00029882384,0.0002963976,0.00033143308,0.00041963413,0.00074247003,0.00037835143,0.00067789067],"category_scores_gemma":[0.0008257444,0.00024812503,0.000295568,0.00029718337,0.0005843881,0.0005166634,0.0008171062,0.00041455374,0.00009910962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024892847,0.000106966465,0.0013855981,0.00020854804,0.00005993338,0.0002907137,0.00041524717,0.64059216,0.12982182,0.0156732,0.000731979,0.2104649],"study_design_scores_gemma":[0.000022507056,0.00022597332,0.00054902595,0.0000068806817,0.0000126111245,0.00007584839,0.000009164898,0.9861356,0.0107526155,0.0012195846,0.0009776194,0.0000125618635],"about_ca_topic_score_codex":0.0018954166,"about_ca_topic_score_gemma":0.0011188484,"teacher_disagreement_score":0.0018954166,"about_ca_system_score_codex":0.00030011294,"about_ca_system_score_gemma":0.00038204688,"threshold_uncertainty_score":0.0037688017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030987263,0.00026472844,0.9663757,0.0002558962,0.000025351319,0.000036890942,0.00004372473,0.00010996914,0.0019004461],"genre_scores_gemma":[0.73757243,0.0007390182,0.25587368,0.0002136747,0.00016356938,0.00019969622,0.0002887981,0.00015587936,0.0047933087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799585,0.0007012605,0.00008674441,0.00036045304,0.0006994558,0.00015628566],"domain_scores_gemma":[0.98752105,0.008481035,0.0012800273,0.0011283809,0.0011135173,0.00047608334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00443378,0.00080626376,0.0013522415,0.0026668517,0.00092319696,0.0022977807,0.0019256676,0.0018336375,0.0018064548],"category_scores_gemma":[0.020245608,0.0004742549,0.0010437449,0.0016652975,0.0020408574,0.0049757445,0.002183431,0.002481434,0.0003623038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010489432,0.00007029376,0.0019908142,0.000084176674,0.000058793714,0.00015828891,0.0001988446,0.4313798,0.0031584157,0.52459955,0.001180512,0.03701562],"study_design_scores_gemma":[0.0000039201577,0.000016112088,0.0001594852,0.0000056437243,0.000005526954,0.000037620255,0.0000126186205,0.9322193,0.00045890512,0.06667622,0.00039452864,0.000010156709],"about_ca_topic_score_codex":0.0023217285,"about_ca_topic_score_gemma":0.001783056,"teacher_disagreement_score":0.00443378,"about_ca_system_score_codex":0.0016952867,"about_ca_system_score_gemma":0.0013160538,"threshold_uncertainty_score":0.023448348},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022214118,0.0074762953,0.6434177,0.15756944,0.0009756229,0.0002958259,0.0002248592,0.00042168016,0.16740446],"genre_scores_gemma":[0.8638394,0.004255984,0.1052743,0.011308629,0.0013802196,0.0004985634,0.00015846336,0.00028110825,0.013003336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96966994,0.015643,0.0018659163,0.0030198125,0.007874152,0.0019272392],"domain_scores_gemma":[0.9376105,0.038660463,0.004199442,0.013113886,0.0049283886,0.0014872896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031026172,0.000692252,0.0012177803,0.00353212,0.008331593,0.022251396,0.003042703,0.010231866,0.0049021943],"category_scores_gemma":[0.08754898,0.00093352806,0.0016141513,0.0039404235,0.04452303,0.049996573,0.010553621,0.01396643,0.0010049394],"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.0000052266523,0.0000056494946,0.00009908408,0.000011123989,0.0000033093766,0.000018369747,0.00055834313,0.00032926447,0.000035908775,0.9948538,0.00087752996,0.003202301],"study_design_scores_gemma":[0.000009215086,0.0000063678544,0.00008841383,0.00007528773,0.0000056861627,0.000032888547,0.0003488358,0.0019275784,0.0001496954,0.9801522,0.017190889,0.000013025356],"about_ca_topic_score_codex":0.0103426725,"about_ca_topic_score_gemma":0.004076103,"teacher_disagreement_score":0.031026172,"about_ca_system_score_codex":0.012673401,"about_ca_system_score_gemma":0.011714801,"threshold_uncertainty_score":0.16408402},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021831268,0.000094410774,0.99617875,0.000048472142,0.000021757824,0.000015913687,0.0000056507743,0.000091432696,0.0013604062],"genre_scores_gemma":[0.31268495,0.00043741212,0.6824461,0.00012973887,0.00008351047,0.00026616474,0.000040098388,0.00019088267,0.0037211124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997546,0.00010029497,0.000016368924,0.000035632354,0.00007856118,0.000014652454],"domain_scores_gemma":[0.99976903,0.0001439994,0.000020317155,0.000021565833,0.00003696419,0.000008233664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000806648,0.00074426335,0.00068169093,0.00036766962,0.00023222006,0.00056946644,0.00044823973,0.0009740002,0.0014264949],"category_scores_gemma":[0.0017635538,0.00027491088,0.0005288838,0.00029773157,0.0006844916,0.00046425776,0.0006100031,0.0008498459,0.0002946578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003785375,0.000023610599,0.00016341434,0.00013079557,0.00003777719,0.00014237764,0.00010081664,0.866568,0.008917004,0.047790706,0.00072907296,0.07535861],"study_design_scores_gemma":[0.000006903546,0.000025740255,0.00004556575,0.000006139169,0.0000039774795,0.000017404906,0.0000036191782,0.9912617,0.000874076,0.0067170435,0.0010318209,0.0000060715174],"about_ca_topic_score_codex":0.0009756078,"about_ca_topic_score_gemma":0.00066782,"teacher_disagreement_score":0.0014264949,"about_ca_system_score_codex":0.00027495308,"about_ca_system_score_gemma":0.00034354866,"threshold_uncertainty_score":0.004772067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004563825,0.00004997275,0.99497354,0.0000149482385,0.0000060907373,0.000009302193,0.000006047986,0.00012928377,0.0002469688],"genre_scores_gemma":[0.22034158,0.00015684597,0.7778826,0.00005207178,0.00002377408,0.00011453951,0.00010207164,0.00011372382,0.0012127274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993279,0.00014570128,0.00003070264,0.00015333688,0.0002863544,0.000055923283],"domain_scores_gemma":[0.9993293,0.00027210708,0.000116672956,0.000076066724,0.00018114748,0.000024690396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085225515,0.0008773792,0.001144312,0.0010646574,0.0004176634,0.00047580444,0.0012014632,0.0009750758,0.0008257806],"category_scores_gemma":[0.002338856,0.00052428694,0.0007758593,0.00088947173,0.0006320513,0.00063102454,0.00082256197,0.0009139804,0.00028224496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051193016,0.000046889625,0.0006881866,0.00007723991,0.00009562519,0.000088809036,0.0000802821,0.82163465,0.0135266725,0.009867426,0.00070228276,0.15314071],"study_design_scores_gemma":[0.0000041247126,0.000020948997,0.00013305909,0.000003564627,0.000006388419,0.000029139635,0.0000067013107,0.99650013,0.0017242648,0.0010880451,0.00047755535,0.0000060946395],"about_ca_topic_score_codex":0.0034540275,"about_ca_topic_score_gemma":0.0026640703,"teacher_disagreement_score":0.0034540275,"about_ca_system_score_codex":0.00058098114,"about_ca_system_score_gemma":0.0008634988,"threshold_uncertainty_score":0.006867826},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028952877,0.095948905,0.5852987,0.013417409,0.009695749,0.000352119,0.0017293905,0.0024748526,0.28818762],"genre_scores_gemma":[0.11969711,0.18392485,0.49999362,0.019639576,0.022819564,0.001313596,0.0037096422,0.0022202213,0.14668189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730515,0.0004890963,0.00022672604,0.0009999311,0.0007213824,0.00025761916],"domain_scores_gemma":[0.9965424,0.0020471367,0.00019012023,0.00061558257,0.0004286698,0.00017618934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012208214,0.0021405646,0.0013380547,0.0021716375,0.001500675,0.004466836,0.0027759746,0.0031269195,0.03360787],"category_scores_gemma":[0.0048940233,0.0009831851,0.002053383,0.005224087,0.004543376,0.007071408,0.0026769023,0.00628924,0.013824569],"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.000054040676,0.000042516884,0.0002644585,0.0009678903,0.000034802055,0.00016940791,0.0002725501,0.006583157,0.0008826502,0.75553083,0.075603746,0.159594],"study_design_scores_gemma":[0.000011164265,0.000037325437,0.00018717759,0.00034312427,0.000016562619,0.0005053128,0.00006833531,0.0035977843,0.00033291883,0.37347445,0.62139964,0.00002618984],"about_ca_topic_score_codex":0.0022573746,"about_ca_topic_score_gemma":0.0016567553,"teacher_disagreement_score":0.03360787,"about_ca_system_score_codex":0.0024927445,"about_ca_system_score_gemma":0.0017085391,"threshold_uncertainty_score":0.1124295},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07824017,0.018021265,0.88461626,0.00051667966,0.00020723959,0.00008669387,0.0000497154,0.00028468092,0.017977301],"genre_scores_gemma":[0.53523827,0.013042402,0.4449295,0.00025975142,0.00016178878,0.00022429226,0.0001964538,0.00019393353,0.005753576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992175,0.0003221059,0.000043239357,0.00007216873,0.00031874573,0.000026189682],"domain_scores_gemma":[0.9984999,0.0009969444,0.00010860619,0.000115853836,0.00025092033,0.00002791252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016222988,0.00072011055,0.0007217956,0.0010096154,0.00028726598,0.00072727096,0.00059165416,0.00091352116,0.0011079061],"category_scores_gemma":[0.0028377804,0.0002067879,0.00085874024,0.0011846382,0.0005132782,0.000717778,0.00045678508,0.0006948731,0.00022054283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009889183,0.00012303743,0.0026174493,0.00078457576,0.00018401694,0.00010792151,0.00016330431,0.66068447,0.0071053025,0.01746581,0.0013669457,0.3092983],"study_design_scores_gemma":[0.000017792745,0.0002680481,0.0018683235,0.00008841708,0.000057010624,0.00016282874,0.000046623238,0.9809316,0.0044562216,0.0029803424,0.009098624,0.000024152689],"about_ca_topic_score_codex":0.0011003577,"about_ca_topic_score_gemma":0.0015751154,"teacher_disagreement_score":0.0016222988,"about_ca_system_score_codex":0.00037240065,"about_ca_system_score_gemma":0.0005405348,"threshold_uncertainty_score":0.008579671},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026576086,0.000112870024,0.99578875,0.00006127309,0.000023497865,0.00003832222,0.0000069200505,0.00013528434,0.0011756022],"genre_scores_gemma":[0.1239876,0.00034459995,0.8727523,0.00008807522,0.00007335739,0.00020911051,0.00006546875,0.00015215116,0.0023273567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986405,0.0004804228,0.00005572425,0.00019139319,0.0005794016,0.000052537693],"domain_scores_gemma":[0.99919313,0.00041190383,0.000051162235,0.000093124014,0.00022958644,0.00002114397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015020925,0.0005966855,0.0007178263,0.0009879764,0.0007078798,0.0009857477,0.0010463245,0.00090971834,0.0014779866],"category_scores_gemma":[0.0035388463,0.00027454548,0.0007525062,0.0010774836,0.0009568417,0.0009060015,0.00080390467,0.0009970198,0.00051697524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008811665,0.00007223986,0.001047461,0.00017634535,0.00016272273,0.0002034099,0.00032392214,0.46130463,0.01582983,0.13535112,0.0024691666,0.38297102],"study_design_scores_gemma":[0.00001941128,0.00005580405,0.00024859046,0.00002221822,0.000026548905,0.000079695994,0.000019320174,0.97343135,0.0038639358,0.016704002,0.005509152,0.000019873063],"about_ca_topic_score_codex":0.0015269876,"about_ca_topic_score_gemma":0.0012967897,"teacher_disagreement_score":0.0015269876,"about_ca_system_score_codex":0.00068585144,"about_ca_system_score_gemma":0.00086380536,"threshold_uncertainty_score":0.007943928},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055898656,0.0001783701,0.9915379,0.00016878983,0.00002990402,0.000053613752,0.00007865454,0.0003759175,0.001987033],"genre_scores_gemma":[0.28220743,0.001296808,0.70825416,0.0004362272,0.00033708496,0.0008733214,0.0009906694,0.0014189234,0.0041853255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942557,0.0022925632,0.00044302642,0.00087559223,0.0017387427,0.00039438118],"domain_scores_gemma":[0.93433404,0.055333253,0.0032837796,0.0037173207,0.0025577832,0.0007738365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0104879085,0.0022271485,0.002019009,0.009466494,0.0022319856,0.006464858,0.0035169187,0.002205049,0.0061029885],"category_scores_gemma":[0.10048448,0.0013867926,0.0025520106,0.004749884,0.0060252803,0.009158369,0.003928042,0.0045650997,0.0020231388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035403224,0.000041646224,0.0018009831,0.00019105848,0.000050458493,0.00015737339,0.0001955162,0.16403022,0.001003375,0.80505526,0.0017261842,0.025712522],"study_design_scores_gemma":[0.000008870014,0.000013421553,0.0001653458,0.000040138588,0.000011815621,0.00006846543,0.000027076936,0.4103727,0.0008414472,0.587015,0.0014103547,0.00002549272],"about_ca_topic_score_codex":0.001527997,"about_ca_topic_score_gemma":0.0013872088,"teacher_disagreement_score":0.0104879085,"about_ca_system_score_codex":0.0044025574,"about_ca_system_score_gemma":0.0026988983,"threshold_uncertainty_score":0.055466056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8914128,0.00050643994,0.08424667,0.00052964635,0.000030594947,0.00012670567,0.0011842665,0.0002737333,0.021689193],"genre_scores_gemma":[0.98322636,0.00025732277,0.013420134,0.00006021046,0.000023751201,0.000101331934,0.0009854689,0.00003842013,0.001886959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948716,0.00011212559,0.000027683376,0.00015654202,0.000107049265,0.000109470144],"domain_scores_gemma":[0.99644583,0.0018336104,0.00073055783,0.00024940175,0.0003988469,0.0003417254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032115844,0.00033103017,0.00027709152,0.0013871196,0.00065188797,0.0013288537,0.0006316307,0.00051989494,0.0022193824],"category_scores_gemma":[0.0037860025,0.00044992834,0.0004486418,0.0015526725,0.001758068,0.0013251915,0.00082348933,0.00056946237,0.00015077717],"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.0005468892,0.00011848712,0.02063003,0.00040246398,0.00007706731,0.0017078843,0.002112746,0.0896682,0.019740077,0.8182474,0.0057821516,0.040966634],"study_design_scores_gemma":[0.00007914327,0.00012096645,0.01867933,0.00006462708,0.00007952033,0.0012878554,0.0008124649,0.1923741,0.005795383,0.7723992,0.008244087,0.000063291365],"about_ca_topic_score_codex":0.0039397893,"about_ca_topic_score_gemma":0.0040845787,"teacher_disagreement_score":0.0039397893,"about_ca_system_score_codex":0.0010046182,"about_ca_system_score_gemma":0.00048573216,"threshold_uncertainty_score":0.007833719},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002352,0.005255271,0.95360094,0.0046125087,0.0010862804,0.00064964435,0.001881854,0.023392549,0.0071690166],"genre_scores_gemma":[0.008800978,0.0038768686,0.9721296,0.0017227182,0.0004558415,0.00070109294,0.00063837855,0.004438984,0.0072355326],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978198,0.0007838518,0.0002093612,0.00021056442,0.0009018397,0.00007454816],"domain_scores_gemma":[0.983214,0.011169311,0.0004941211,0.0015577939,0.0031970246,0.00036778138],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.007457089,0.002427699,0.000910184,0.0032212238,0.0011726695,0.004328624,0.0026811769,0.002518333,0.027644092],"category_scores_gemma":[0.025330165,0.0013082162,0.0008275964,0.0014000422,0.0019448957,0.0025919727,0.0023027249,0.0037817857,0.022731446],"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.0005062763,0.00013011417,0.0013137984,0.00171022,0.00013536522,0.0008707029,0.00068740133,0.0050287712,0.034492597,0.013363286,0.26479945,0.67696214],"study_design_scores_gemma":[0.00028422466,0.00046033156,0.0065082824,0.0023775632,0.00011601365,0.0048827645,0.0010031967,0.06570667,0.05078859,0.10756298,0.7597559,0.0005534707],"about_ca_topic_score_codex":0.0037883036,"about_ca_topic_score_gemma":0.008131225,"teacher_disagreement_score":0.9925429,"about_ca_system_score_codex":0.0008405352,"about_ca_system_score_gemma":0.0018672397,"threshold_uncertainty_score":0.09247869},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01188765,0.00027423186,0.98365146,0.00014918161,0.00006333595,0.000039903673,0.00017370551,0.00040751076,0.003353104],"genre_scores_gemma":[0.28013682,0.0007653263,0.7126436,0.00008142013,0.0000829607,0.00013130702,0.0004374441,0.00042661242,0.0052945255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994112,0.00008169053,0.000037027723,0.00009982127,0.00033620928,0.000033977474],"domain_scores_gemma":[0.9989737,0.0004706812,0.00008207213,0.000105889434,0.000320971,0.000046748668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007088556,0.0004956439,0.00041607226,0.0008894963,0.00031133657,0.0016249927,0.0008992429,0.0006750019,0.0041305125],"category_scores_gemma":[0.0049371463,0.00032966334,0.00043725583,0.0009382121,0.00073964486,0.001407126,0.0011013965,0.0008519479,0.0013657256],"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.00018290404,0.000095066076,0.0033563846,0.00053395255,0.00004640916,0.000280342,0.0003482912,0.47522512,0.024364905,0.1914501,0.009170831,0.29494575],"study_design_scores_gemma":[0.00001002855,0.000027786877,0.0010621732,0.000027421382,0.000006517573,0.00020718148,0.000043749427,0.960709,0.004739296,0.027677314,0.005463677,0.000025978288],"about_ca_topic_score_codex":0.003298363,"about_ca_topic_score_gemma":0.0036293352,"teacher_disagreement_score":0.0041305125,"about_ca_system_score_codex":0.0006437242,"about_ca_system_score_gemma":0.00091282243,"threshold_uncertainty_score":0.013817966},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015572955,0.000094883675,0.981339,0.00013419964,0.00004239153,0.00006122371,0.00010699512,0.0020405718,0.000607759],"genre_scores_gemma":[0.19622399,0.00013055914,0.80128,0.00006889662,0.00005024717,0.00023323834,0.00043176636,0.00037375832,0.0012075035],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968454,0.0008989585,0.00035960064,0.0009864153,0.00069833646,0.00021119561],"domain_scores_gemma":[0.98335385,0.012618362,0.00071622455,0.0019468797,0.0011415301,0.0002232099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025604202,0.0011849835,0.0013339015,0.0017849742,0.00087792566,0.002354077,0.0022012994,0.0016872984,0.0034251856],"category_scores_gemma":[0.017857326,0.0006498992,0.0014624617,0.0013519428,0.0018093245,0.0054499027,0.002589581,0.002035182,0.0011095812],"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.00079827494,0.00026943887,0.003066377,0.0007637203,0.00015865572,0.00030938225,0.0013501231,0.24930727,0.035749044,0.25067106,0.005101773,0.45245486],"study_design_scores_gemma":[0.00007248332,0.00014492607,0.00024396,0.000024643929,0.00003337724,0.00017538296,0.00015075735,0.7748743,0.018277988,0.20339145,0.0025633085,0.000047372578],"about_ca_topic_score_codex":0.001553781,"about_ca_topic_score_gemma":0.0023422686,"teacher_disagreement_score":0.0034251856,"about_ca_system_score_codex":0.0015628434,"about_ca_system_score_gemma":0.0023630902,"threshold_uncertainty_score":0.013540983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008440276,0.00016292346,0.9983392,0.00005241071,0.000030667376,0.0000069404077,0.000006826638,0.000048724945,0.0005083385],"genre_scores_gemma":[0.23811114,0.0021667657,0.7533031,0.00017852672,0.00028918448,0.0001581638,0.000097573655,0.00012530868,0.0055701486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993449,0.00018586416,0.00006534329,0.00018414503,0.0001773043,0.00004252861],"domain_scores_gemma":[0.99906343,0.00052144134,0.00012305657,0.00010521963,0.00016500587,0.000021949647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010605559,0.0007701222,0.0006212957,0.00061764993,0.00029439776,0.0007487165,0.00059863424,0.0010167394,0.0022905117],"category_scores_gemma":[0.004326567,0.0003739182,0.0005976275,0.0007488921,0.000937315,0.0018091687,0.00082272495,0.0014653835,0.0006732065],"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.00011981279,0.00005032205,0.00087638805,0.0003572299,0.000100211066,0.00013945326,0.00028272637,0.39035466,0.018456575,0.29185593,0.0015424894,0.29586408],"study_design_scores_gemma":[0.00001426628,0.00009648562,0.0003590487,0.000041338368,0.00002351215,0.00013953523,0.000019885125,0.92487186,0.00573097,0.058613453,0.010047682,0.000042009102],"about_ca_topic_score_codex":0.0015928835,"about_ca_topic_score_gemma":0.0009935608,"teacher_disagreement_score":0.0022905117,"about_ca_system_score_codex":0.00044908357,"about_ca_system_score_gemma":0.0008088254,"threshold_uncertainty_score":0.0076625347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15713686,0.0009458849,0.8318,0.00036145523,0.000078709,0.0002272721,0.00016257979,0.00036650014,0.008920681],"genre_scores_gemma":[0.69001746,0.000262801,0.30475074,0.00010690174,0.000029634144,0.00027902707,0.00028148797,0.00007321034,0.004198667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996351,0.0001755294,0.000013418417,0.000059644604,0.000065376094,0.000050772014],"domain_scores_gemma":[0.99946934,0.00034342357,0.000053229025,0.000026483902,0.00006323472,0.000044223114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081083574,0.0005124396,0.0008096764,0.00067888334,0.0004585589,0.0006046803,0.0015353813,0.0008549922,0.0016267512],"category_scores_gemma":[0.0014671518,0.0002944668,0.0004577444,0.0006670462,0.00046379305,0.0007345302,0.00053769926,0.00039068895,0.00015567745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047131085,0.0000577537,0.00036321708,0.000032553322,0.000017768867,0.00005235341,0.000022571317,0.9804105,0.00040386006,0.0026730509,0.000639574,0.01527965],"study_design_scores_gemma":[0.000010685084,0.000024595587,0.00006104086,0.0000031575348,0.0000037840477,0.000010790075,0.00001333828,0.99874216,0.00012395027,0.00067597954,0.0003277739,0.0000027437536],"about_ca_topic_score_codex":0.01363849,"about_ca_topic_score_gemma":0.016031938,"teacher_disagreement_score":0.01363849,"about_ca_system_score_codex":0.0010144777,"about_ca_system_score_gemma":0.0011980303,"threshold_uncertainty_score":0.027118206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013420657,0.00044023927,0.99437416,0.00009322954,0.000059488324,0.00001476882,0.000016870494,0.000036582787,0.0036225666],"genre_scores_gemma":[0.5188803,0.004121021,0.4592941,0.00034780116,0.00051397615,0.00044863112,0.00013298175,0.00008005776,0.0161811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978465,0.000038444316,0.000011636405,0.000051809595,0.00010142318,0.000012044938],"domain_scores_gemma":[0.9998715,0.00004428713,0.000028870369,0.000013584242,0.000034162087,0.0000075842113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002599241,0.0005609158,0.00043596685,0.00029226954,0.00033981827,0.0006334863,0.00096933945,0.00081024255,0.0018973282],"category_scores_gemma":[0.00045735756,0.00023755735,0.00057486806,0.00033868031,0.0007021838,0.00063239626,0.00071761553,0.0009749936,0.00032659515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034215926,0.00003862373,0.0002302925,0.00038023567,0.000052795353,0.00030145008,0.00025035377,0.5885936,0.01631911,0.33075425,0.0016539975,0.061391108],"study_design_scores_gemma":[0.000012316996,0.000093524875,0.00015842757,0.000035107703,0.000011952589,0.00008590186,0.000022001836,0.94776905,0.0018947696,0.036531143,0.013366384,0.000019336354],"about_ca_topic_score_codex":0.0021011713,"about_ca_topic_score_gemma":0.0012628783,"teacher_disagreement_score":0.0021011713,"about_ca_system_score_codex":0.00039631347,"about_ca_system_score_gemma":0.0005493648,"threshold_uncertainty_score":0.006347239},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008761619,0.0004709338,0.98637635,0.000108740875,0.00007858566,0.000058743204,0.00011299555,0.0014884074,0.0025436028],"genre_scores_gemma":[0.09909737,0.00041366077,0.8936515,0.00018058416,0.00007920001,0.00021284916,0.00066053844,0.00033496955,0.0053694095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981881,0.0003463865,0.00020796999,0.00039299746,0.00064159685,0.00022288636],"domain_scores_gemma":[0.99723405,0.0010943018,0.00019058869,0.0007919732,0.00058608,0.00010310917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014585555,0.00087621587,0.0010862035,0.0017737808,0.0010032128,0.0020057238,0.0014940881,0.0011128751,0.004849016],"category_scores_gemma":[0.0075735627,0.000419312,0.0009304317,0.0020027424,0.0012735709,0.0037836598,0.0019693165,0.0014826265,0.0023005665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094860885,0.00016602836,0.0010026504,0.0003488223,0.00006455162,0.00035909013,0.00049307704,0.059911545,0.032268055,0.20143677,0.010701345,0.6922995],"study_design_scores_gemma":[0.00017845457,0.00031142213,0.0005260983,0.00019465377,0.000048863047,0.0008078755,0.00028481954,0.6592748,0.07160707,0.21776742,0.048831787,0.00016669829],"about_ca_topic_score_codex":0.0032339368,"about_ca_topic_score_gemma":0.004554522,"teacher_disagreement_score":0.004849016,"about_ca_system_score_codex":0.0013768971,"about_ca_system_score_gemma":0.0016693121,"threshold_uncertainty_score":0.016221583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14879833,0.0014787315,0.8055324,0.0013161363,0.00021300973,0.00042711804,0.0021648686,0.0008408036,0.03922865],"genre_scores_gemma":[0.3872148,0.0019187607,0.58776635,0.0010294592,0.00015820924,0.0004410013,0.0046489974,0.0003511127,0.016471261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988399,0.00025948285,0.000092146336,0.00043188658,0.00024232245,0.00013423871],"domain_scores_gemma":[0.9959984,0.001761916,0.0005389332,0.0005810191,0.00082730886,0.0002924678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077398284,0.0005572097,0.0005586594,0.0017014934,0.0014226042,0.0024071569,0.0009733467,0.0007358624,0.006259041],"category_scores_gemma":[0.0058825323,0.00060721824,0.0010007027,0.0019598447,0.0018367053,0.005317373,0.002030187,0.0015367469,0.0012953498],"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.000101201535,0.000035255478,0.0017737496,0.00023394334,0.000038532184,0.00022908919,0.000818914,0.00887801,0.0046592657,0.93956727,0.0056467894,0.038018063],"study_design_scores_gemma":[0.000016488662,0.000045032313,0.0009228318,0.00007645643,0.000035971985,0.0007315073,0.00044581972,0.015144622,0.003094648,0.9335249,0.045941755,0.000019974052],"about_ca_topic_score_codex":0.0014673504,"about_ca_topic_score_gemma":0.0014696032,"teacher_disagreement_score":0.006259041,"about_ca_system_score_codex":0.0008821873,"about_ca_system_score_gemma":0.0007086408,"threshold_uncertainty_score":0.020938635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00670717,0.00013805414,0.9897886,0.000077025856,0.00006236174,0.00002245757,0.00004336181,0.00029173316,0.0028691832],"genre_scores_gemma":[0.30573413,0.00032038405,0.685513,0.0001659545,0.00009512304,0.00013463855,0.00024117836,0.000094283016,0.0077012503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997931,0.000041947525,0.0000138451,0.00005116631,0.000084434636,0.000015596926],"domain_scores_gemma":[0.9997657,0.0000747095,0.00001945213,0.000032618653,0.000091943686,0.000015655301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003198601,0.00038965436,0.00051331753,0.00032884092,0.0001744766,0.000547656,0.00053835363,0.0007310027,0.0024005487],"category_scores_gemma":[0.0011486291,0.00015033744,0.00020798738,0.00042839156,0.0002745604,0.0004534964,0.00040774216,0.00039585622,0.0007472353],"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.00030868207,0.00006105564,0.0007397472,0.00021712386,0.000057512072,0.00011973269,0.00006821422,0.5310959,0.049235795,0.066410944,0.005078219,0.34660703],"study_design_scores_gemma":[0.000023668183,0.00003889309,0.00018259909,0.000006313221,0.000008363317,0.00005102391,0.0000037677407,0.98832303,0.0056844256,0.0027657824,0.0029049104,0.0000072276043],"about_ca_topic_score_codex":0.0007587955,"about_ca_topic_score_gemma":0.0008232449,"teacher_disagreement_score":0.0024005487,"about_ca_system_score_codex":0.00038760802,"about_ca_system_score_gemma":0.00062802725,"threshold_uncertainty_score":0.008030653},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006474028,0.00047166346,0.99135137,0.00011612296,0.00004817776,0.000034989047,0.00009556753,0.00043189334,0.0009761948],"genre_scores_gemma":[0.3658152,0.0017669405,0.6272335,0.00024767942,0.00031444206,0.00020299388,0.0012195173,0.00030464624,0.0028950016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899334,0.00019129291,0.00006267233,0.00028457036,0.00040912456,0.000059062302],"domain_scores_gemma":[0.9988317,0.0003018077,0.00013194223,0.00037355354,0.00031486852,0.000046201774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010232569,0.0007492111,0.0009943699,0.0026797084,0.00047457055,0.0011184035,0.0011247091,0.0007935778,0.001733343],"category_scores_gemma":[0.003554039,0.00027578612,0.0010332804,0.0034346094,0.0011807757,0.0018936285,0.001651997,0.0012282484,0.0009364215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007536783,0.00006928057,0.0021162091,0.00023709291,0.00010395178,0.00011888186,0.00020715792,0.12706561,0.021457538,0.0779474,0.0062389756,0.7643625],"study_design_scores_gemma":[0.000011410345,0.00012954294,0.0015929306,0.00003366254,0.000029879924,0.00033601074,0.0000933994,0.9159693,0.008338472,0.059502658,0.013912225,0.000050511342],"about_ca_topic_score_codex":0.0017351179,"about_ca_topic_score_gemma":0.0010893433,"teacher_disagreement_score":0.0026797084,"about_ca_system_score_codex":0.0006664031,"about_ca_system_score_gemma":0.00054796634,"threshold_uncertainty_score":0.0057985783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007839788,0.98448074,0.0100328615,0.00051073346,0.0005224043,0.00001955562,0.00009024939,0.00009928786,0.0034600797],"genre_scores_gemma":[0.0054546986,0.98369366,0.007892016,0.00029006813,0.0005687955,0.000023592213,0.00022270816,0.000022878156,0.0018316112],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996024,0.00004945719,0.000069054724,0.0000875381,0.00016844294,0.000023076718],"domain_scores_gemma":[0.9988263,0.00060996605,0.00008585967,0.000037382397,0.00041253873,0.000027846922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008243945,0.0010632348,0.0011024305,0.0021694098,0.00027603077,0.0012543817,0.0012237582,0.0010839718,0.003075428],"category_scores_gemma":[0.0020778617,0.00042043292,0.00077381986,0.0029510877,0.00036051133,0.0022237592,0.00051290356,0.0009048708,0.001965214],"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.0000501491,0.000064137035,0.00039958546,0.0134633165,0.000075765005,0.00009109957,0.00005979107,0.0032732538,0.0018282924,0.007140531,0.017688878,0.9558652],"study_design_scores_gemma":[0.00001400276,0.0002918728,0.0012673606,0.0061241454,0.00033607875,0.001242007,0.00014567103,0.007591918,0.0035225118,0.010048761,0.96932954,0.00008600568],"about_ca_topic_score_codex":0.0013595821,"about_ca_topic_score_gemma":0.0010748892,"teacher_disagreement_score":0.003075428,"about_ca_system_score_codex":0.000436635,"about_ca_system_score_gemma":0.0012479698,"threshold_uncertainty_score":0.010288298},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05561269,0.00016144803,0.9378393,0.00053333543,0.000044626042,0.00023500991,0.00025832411,0.00017890893,0.0051362915],"genre_scores_gemma":[0.79194653,0.00030156446,0.20349354,0.00008905884,0.0000325444,0.00071937917,0.00028913986,0.00001967419,0.0031085273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862826,0.0006499328,0.00008207599,0.00021971589,0.00028130782,0.0001387537],"domain_scores_gemma":[0.9975007,0.001649439,0.0002095555,0.000045738114,0.0004922632,0.00010230076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003191286,0.0009966105,0.0008959285,0.0018537617,0.0009943978,0.0025269648,0.0017705213,0.0018541596,0.0038510405],"category_scores_gemma":[0.005880038,0.00043699145,0.00096489274,0.0014531943,0.00067428435,0.0018510371,0.00095291284,0.0015202558,0.00032572792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006694551,0.00006330704,0.00092709245,0.000050317634,0.000035635418,0.00008458002,0.00015573924,0.972816,0.00043788546,0.013311991,0.00031936698,0.011731054],"study_design_scores_gemma":[0.0000073136603,0.000020775493,0.000087670946,0.000008540487,0.000008211286,0.000007744734,0.000023421953,0.9964282,0.00007506936,0.003134748,0.00019255988,0.0000056924796],"about_ca_topic_score_codex":0.018146785,"about_ca_topic_score_gemma":0.011806131,"teacher_disagreement_score":0.018146785,"about_ca_system_score_codex":0.003491425,"about_ca_system_score_gemma":0.0026829524,"threshold_uncertainty_score":0.036082327},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004374241,0.000043270287,0.99920017,0.000022250897,0.000008262257,0.0000072680828,0.000007965174,0.0001493988,0.00012400498],"genre_scores_gemma":[0.042210106,0.00023803202,0.95536315,0.00006136697,0.00004158447,0.00012580234,0.00016581142,0.00014482203,0.0016493194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916744,0.00028350085,0.000061059814,0.0001998122,0.00023161937,0.000056470773],"domain_scores_gemma":[0.9987949,0.0005554909,0.00015731734,0.00018334993,0.0002697649,0.000039146802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001411945,0.0013295979,0.00093493186,0.000799424,0.00046164216,0.00082838064,0.0012000627,0.0011940661,0.0026476046],"category_scores_gemma":[0.004067964,0.0005876531,0.0011585238,0.001075363,0.0008720942,0.0014449024,0.0010822981,0.002051585,0.002309985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013021,0.000095084775,0.00072543556,0.00031637136,0.00013537683,0.00011153034,0.0002120638,0.48208278,0.03004589,0.05054138,0.004754645,0.43084922],"study_design_scores_gemma":[0.000006105212,0.00003528672,0.00007604718,0.000008462403,0.0000073567803,0.000046838974,0.000009913782,0.98943514,0.0028242413,0.005374316,0.0021624563,0.0000137829975],"about_ca_topic_score_codex":0.0026579923,"about_ca_topic_score_gemma":0.0032236024,"teacher_disagreement_score":0.0026579923,"about_ca_system_score_codex":0.00048964936,"about_ca_system_score_gemma":0.0013845889,"threshold_uncertainty_score":0.008857131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009849635,0.00018752323,0.9851774,0.00019947927,0.000043361462,0.000053799056,0.000078177494,0.00016314814,0.0042473795],"genre_scores_gemma":[0.64956236,0.00050312845,0.34376135,0.00017158494,0.00011646514,0.0003982969,0.00025665975,0.0000621934,0.0051679914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989466,0.00035132878,0.000059516395,0.00022462966,0.00033046835,0.000087498454],"domain_scores_gemma":[0.9988285,0.00061122637,0.00019831589,0.00006011341,0.00026151526,0.000040351308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017304627,0.0009769636,0.000747355,0.001402264,0.00054890127,0.0018910409,0.0017261517,0.0017843329,0.0027064788],"category_scores_gemma":[0.0033934664,0.0003597387,0.0015357769,0.00082822866,0.0004966337,0.0015706904,0.0007953004,0.0012506542,0.00041308845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004451727,0.00003129631,0.0010572373,0.000081224076,0.000054514578,0.0001530749,0.00010665601,0.93045676,0.0013831441,0.033312242,0.0010754005,0.032244053],"study_design_scores_gemma":[0.000003092497,0.000024626197,0.00014492295,0.000012329662,0.000011150303,0.000055345154,0.000012453425,0.992172,0.00020798012,0.00662626,0.0007194137,0.000010396537],"about_ca_topic_score_codex":0.004711444,"about_ca_topic_score_gemma":0.0034947612,"teacher_disagreement_score":0.004711444,"about_ca_system_score_codex":0.0011626967,"about_ca_system_score_gemma":0.0012590435,"threshold_uncertainty_score":0.009368062},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050686365,0.00049542874,0.9918777,0.00009037764,0.00007652021,0.00012790586,0.000060021557,0.00046868192,0.0017346989],"genre_scores_gemma":[0.08378393,0.0005432808,0.9127035,0.00006887659,0.000050268314,0.00034504736,0.00024640711,0.00006693579,0.0021916563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816847,0.00022153315,0.000120544195,0.000481336,0.000882906,0.00012524826],"domain_scores_gemma":[0.99888855,0.00027041094,0.000082745624,0.00009994124,0.0006292209,0.000029120029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015382678,0.0013671011,0.0017047387,0.0024453935,0.0019119477,0.0015354626,0.002120067,0.0020316646,0.0015031492],"category_scores_gemma":[0.0037677365,0.0005725714,0.0013712196,0.0030950753,0.0007166403,0.0014289764,0.000981176,0.0016400589,0.00079098187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019069044,0.000100876925,0.0014697852,0.0004360496,0.00025553777,0.00016972124,0.00033969455,0.36321247,0.015072742,0.020710418,0.0078352485,0.59020674],"study_design_scores_gemma":[0.000027125949,0.000040872026,0.00061646476,0.000040660958,0.000040462746,0.0001589967,0.000040892413,0.9765768,0.007879425,0.0068184,0.0077008116,0.000059061113],"about_ca_topic_score_codex":0.019680986,"about_ca_topic_score_gemma":0.012349476,"teacher_disagreement_score":0.019680986,"about_ca_system_score_codex":0.0017808125,"about_ca_system_score_gemma":0.002948074,"threshold_uncertainty_score":0.039132833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117576145,0.00012259714,0.87918746,0.00009367517,0.000023350905,0.000038656155,0.00002232132,0.00021622199,0.002719671],"genre_scores_gemma":[0.8248739,0.00015773115,0.17165625,0.000029921825,0.000024733636,0.00011552003,0.00006278218,0.00010910048,0.0029699889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999012,0.000038651477,0.0000053316935,0.000012884507,0.0000271555,0.000014789527],"domain_scores_gemma":[0.9994887,0.00032201727,0.00006701014,0.000039641734,0.000053621454,0.00002903157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005100783,0.00049062184,0.00043614602,0.00058247376,0.0003919235,0.00039096113,0.0005984942,0.0005378249,0.001178878],"category_scores_gemma":[0.0018281919,0.00026211934,0.00043587084,0.00024986587,0.0008310367,0.0006996845,0.00068435003,0.0005600575,0.00013511613],"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.000038759877,0.000036650457,0.0007612983,0.000074083495,0.00002720687,0.00014197637,0.00017514863,0.8675351,0.009843889,0.10555101,0.00029370686,0.01552118],"study_design_scores_gemma":[0.0000015144664,0.000007366522,0.000042937394,0.0000015250407,0.000001284795,0.000005182284,0.0000049467903,0.99350244,0.00069073006,0.0055919294,0.00014819948,0.000001976646],"about_ca_topic_score_codex":0.0025958833,"about_ca_topic_score_gemma":0.0023149455,"teacher_disagreement_score":0.0025958833,"about_ca_system_score_codex":0.00075009593,"about_ca_system_score_gemma":0.0006575891,"threshold_uncertainty_score":0.0054423213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010063854,0.00024266854,0.9852604,0.00017409153,0.000022261498,0.00011924753,0.000101481935,0.00003999865,0.0039759357],"genre_scores_gemma":[0.4530982,0.0007974385,0.54051054,0.000114448325,0.00006862457,0.0008243337,0.00024339573,0.0000340359,0.004308951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968532,0.0020272618,0.0001289989,0.00030400575,0.00046323185,0.00022332632],"domain_scores_gemma":[0.9977418,0.0015486814,0.00018151285,0.00005982412,0.00035731454,0.00011093976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053434814,0.001251923,0.0011671275,0.0018126174,0.0007245675,0.00260183,0.0016474945,0.0009930332,0.003286847],"category_scores_gemma":[0.0053740893,0.0007255345,0.0019050618,0.0024633058,0.0009737715,0.002205203,0.0010375971,0.0018610805,0.00036619417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006484326,0.00012671684,0.0010570331,0.0002187083,0.00014147222,0.00022173209,0.00032602178,0.764927,0.0008854975,0.19171005,0.0011365872,0.039184317],"study_design_scores_gemma":[0.000010663693,0.000052171486,0.00016867828,0.000024564542,0.000017251763,0.000024626608,0.000094493065,0.9371241,0.00016265611,0.06123593,0.001070049,0.000014843085],"about_ca_topic_score_codex":0.010846745,"about_ca_topic_score_gemma":0.011525798,"teacher_disagreement_score":0.010846745,"about_ca_system_score_codex":0.0028337017,"about_ca_system_score_gemma":0.0023742386,"threshold_uncertainty_score":0.028259397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10816388,0.0005207844,0.8851298,0.0002884134,0.00005587374,0.00007760994,0.00025679116,0.00025713397,0.005249694],"genre_scores_gemma":[0.96292776,0.00027037563,0.03344673,0.000051860614,0.00001589874,0.0001420102,0.00018724515,0.000017220927,0.0029408103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997379,0.00007623765,0.000014884979,0.00007174847,0.000055776927,0.000043377222],"domain_scores_gemma":[0.99957556,0.00024510382,0.000060294726,0.0000124253975,0.00008858449,0.000018127463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006812912,0.0006309382,0.0007507292,0.00068972696,0.00040103827,0.0009874179,0.0012177768,0.0013690112,0.0012979889],"category_scores_gemma":[0.0013442681,0.00037137198,0.0009393794,0.0007440481,0.00053403835,0.0005817406,0.00049375155,0.0008391232,0.00016202248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007134427,0.0000047966705,0.00014984224,0.000004986897,0.0000059626686,0.000013416185,0.000008333102,0.99781823,0.00017070549,0.0006206353,0.00002700461,0.0011689167],"study_design_scores_gemma":[0.0000013058064,0.000004150133,0.00005268911,0.0000013276101,0.0000024001954,0.0000021310332,0.0000014972758,0.9996159,0.000044639673,0.00023975875,0.000032652195,0.0000015494979],"about_ca_topic_score_codex":0.044172157,"about_ca_topic_score_gemma":0.021741882,"teacher_disagreement_score":0.044172157,"about_ca_system_score_codex":0.0012524764,"about_ca_system_score_gemma":0.001393396,"threshold_uncertainty_score":0.08783013},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13574322,0.0056744376,0.8364112,0.005148958,0.0005306059,0.00022894627,0.0007372918,0.0028942763,0.012631026],"genre_scores_gemma":[0.42063382,0.0016788061,0.5663654,0.00083009264,0.0007962815,0.0003759623,0.0014059991,0.0009448428,0.006968758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98941165,0.0026289101,0.0013661641,0.002687092,0.0031175197,0.0007885369],"domain_scores_gemma":[0.9462426,0.03349225,0.0028692654,0.014091746,0.0022937185,0.0010103557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075361407,0.0017649771,0.0022504453,0.0029183575,0.0017622731,0.003985301,0.0035500624,0.0030726253,0.014820595],"category_scores_gemma":[0.04549723,0.0010100603,0.0026212714,0.0053505623,0.0027758293,0.024589712,0.0040470106,0.003928837,0.0030985374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003580821,0.0011670256,0.0068588075,0.0015514429,0.0003103901,0.0004930849,0.0016319801,0.18773308,0.045019887,0.21783952,0.014634243,0.5191797],"study_design_scores_gemma":[0.00034777884,0.0009075478,0.0017095392,0.000112093214,0.00016237704,0.0011096763,0.00039475234,0.67819226,0.023119338,0.28167188,0.012122629,0.00015009317],"about_ca_topic_score_codex":0.0014671184,"about_ca_topic_score_gemma":0.0023755222,"teacher_disagreement_score":0.014820595,"about_ca_system_score_codex":0.002886906,"about_ca_system_score_gemma":0.001794633,"threshold_uncertainty_score":0.04957986},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09644933,0.0005593869,0.8887429,0.0002508037,0.00016491587,0.00012373817,0.00086904265,0.0053127087,0.00752713],"genre_scores_gemma":[0.33339062,0.0002762981,0.6539387,0.00026609746,0.00010766675,0.0001691716,0.0029486893,0.0010215176,0.007881163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822956,0.00019144182,0.00026051333,0.0005956262,0.00043720283,0.0002856776],"domain_scores_gemma":[0.9968226,0.001453266,0.0002625326,0.00071763207,0.0005925964,0.00015141797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010553318,0.00088473834,0.0016842538,0.00197903,0.0012265192,0.0028934167,0.0012741382,0.0013186982,0.009185466],"category_scores_gemma":[0.009189859,0.00055248156,0.0016232012,0.0018937242,0.0015195735,0.0057226177,0.0023363193,0.0013105664,0.0042305086],"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.0026757785,0.00026826735,0.009067236,0.0013645292,0.00019423227,0.0015983596,0.0022896228,0.0551142,0.10984993,0.2462787,0.009719708,0.56157947],"study_design_scores_gemma":[0.0001377365,0.0005842911,0.002289074,0.00033962677,0.00011353453,0.0009383694,0.0009794848,0.2964989,0.10075802,0.56372505,0.03341923,0.00021669756],"about_ca_topic_score_codex":0.00181665,"about_ca_topic_score_gemma":0.0032343655,"teacher_disagreement_score":0.009185466,"about_ca_system_score_codex":0.0010636835,"about_ca_system_score_gemma":0.0016790855,"threshold_uncertainty_score":0.03072846},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01196478,0.00037481103,0.9833878,0.00028413016,0.00003558708,0.000050449562,0.00001858082,0.00005857003,0.0038251656],"genre_scores_gemma":[0.24461003,0.001965604,0.7468334,0.00015241471,0.00014250253,0.00029621692,0.000113135444,0.00007711996,0.0058096107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942327,0.00026199885,0.000047047462,0.000066491404,0.00015784444,0.00004335369],"domain_scores_gemma":[0.99654585,0.0027529353,0.00018045591,0.00017444644,0.00028284793,0.000063480235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024054148,0.0008525248,0.0007814581,0.0014008065,0.00069960114,0.001197919,0.0009291309,0.0009706481,0.0020276168],"category_scores_gemma":[0.008555256,0.00033438503,0.00087952666,0.0014323251,0.002366618,0.0021806809,0.0015461479,0.0017359168,0.00051875546],"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.00002502517,0.00005135238,0.0007306612,0.00014797182,0.000020800284,0.00007460015,0.0002595602,0.072456226,0.0028017014,0.8696792,0.0007368833,0.05301602],"study_design_scores_gemma":[0.000026352674,0.000047380563,0.0001403643,0.00004730088,0.0000101173,0.00008161339,0.000046135847,0.63846123,0.002555852,0.35516033,0.0034053905,0.000017898667],"about_ca_topic_score_codex":0.0008001045,"about_ca_topic_score_gemma":0.0007472468,"teacher_disagreement_score":0.0024054148,"about_ca_system_score_codex":0.00091327704,"about_ca_system_score_gemma":0.0012884623,"threshold_uncertainty_score":0.0127212405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02526331,0.00026540688,0.9709529,0.00012449245,0.0000446961,0.000067267916,0.0001291934,0.0023263043,0.0008264641],"genre_scores_gemma":[0.1720254,0.00034271582,0.8248114,0.00009057086,0.000041277093,0.00012074565,0.0005342311,0.00080445106,0.0012293156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991849,0.00020840095,0.00005160091,0.00015039617,0.0003315537,0.00007304965],"domain_scores_gemma":[0.99714124,0.0010166301,0.00030793645,0.0006357341,0.00067711144,0.00022130771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010054642,0.0010932116,0.0009645817,0.0029139596,0.0007298308,0.0016919441,0.0010427475,0.0007405363,0.0030575825],"category_scores_gemma":[0.005751602,0.0006707145,0.0008471366,0.0028530657,0.00066442264,0.0029275713,0.002517241,0.0013271797,0.0010603272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050264184,0.000301526,0.0036545992,0.0006467786,0.00011197062,0.00030716913,0.0021270148,0.115162075,0.09549726,0.040355373,0.011995324,0.7293383],"study_design_scores_gemma":[0.00008220903,0.00025934234,0.0018413434,0.000080265614,0.00006467533,0.00055498263,0.0005172433,0.8583679,0.06015763,0.05633458,0.021634804,0.00010509602],"about_ca_topic_score_codex":0.0016541115,"about_ca_topic_score_gemma":0.0022978715,"teacher_disagreement_score":0.0030575825,"about_ca_system_score_codex":0.00042407995,"about_ca_system_score_gemma":0.0008182708,"threshold_uncertainty_score":0.010228574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010187553,0.00004856095,0.98873234,0.000037701084,0.0000052873047,0.000021413402,0.000034159533,0.00008599779,0.0008469932],"genre_scores_gemma":[0.772667,0.00027209445,0.22552207,0.000034737925,0.000025335676,0.00017930535,0.00011312648,0.000056393343,0.0011300087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987907,0.00068930414,0.000048013524,0.00011114083,0.0002880861,0.000072776245],"domain_scores_gemma":[0.99803406,0.0013751396,0.00020032295,0.00009777021,0.00024493012,0.000047750975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026644988,0.0008569367,0.00080073037,0.0013753702,0.00045141325,0.0014464236,0.0008409843,0.00067071157,0.0022390874],"category_scores_gemma":[0.005120368,0.00039109198,0.0012015977,0.000987614,0.00053087424,0.00090436445,0.0008249592,0.0011224722,0.00018319357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015953212,0.000015457075,0.00043227765,0.000022174816,0.000022332608,0.000016544669,0.000024929985,0.9789039,0.00045479272,0.0100479815,0.00008426823,0.009959573],"study_design_scores_gemma":[7.901961e-7,0.0000065190998,0.000087542096,0.0000036810334,0.000003341827,0.0000033068081,0.0000037633345,0.997334,0.0001376998,0.0023147862,0.00010187944,0.000002689834],"about_ca_topic_score_codex":0.006170655,"about_ca_topic_score_gemma":0.0052834284,"teacher_disagreement_score":0.006170655,"about_ca_system_score_codex":0.0011608509,"about_ca_system_score_gemma":0.0011774802,"threshold_uncertainty_score":0.0140913725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006262334,0.0007037058,0.9967546,0.0000823639,0.000088497065,0.000020907059,0.00002049611,0.00015520465,0.0015480325],"genre_scores_gemma":[0.1051451,0.004466214,0.8766192,0.00031846974,0.00047689208,0.00035379804,0.00035230885,0.00047491054,0.011793156],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863666,0.0003751741,0.00006903513,0.00022139243,0.0006156397,0.00008214481],"domain_scores_gemma":[0.9992791,0.00017901132,0.000055491513,0.00006609355,0.0003874891,0.00003281317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001438847,0.0013734121,0.0012747336,0.0013304194,0.0006010268,0.0015178077,0.0022654221,0.0015262761,0.0032600733],"category_scores_gemma":[0.0023249227,0.0005193791,0.0014321227,0.0015784499,0.00086412433,0.0021488327,0.0012334349,0.0021091376,0.0024380798],"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.00021802759,0.000110527784,0.0010655199,0.0009178061,0.00016069625,0.00034369022,0.00038109708,0.26487324,0.035401665,0.24805145,0.018756302,0.42972],"study_design_scores_gemma":[0.000014114958,0.00005155509,0.00015568972,0.000039789706,0.000024973413,0.00022366656,0.000029644558,0.96233416,0.004738719,0.013035891,0.01931122,0.000040676885],"about_ca_topic_score_codex":0.0029479042,"about_ca_topic_score_gemma":0.0021439355,"teacher_disagreement_score":0.0032600733,"about_ca_system_score_codex":0.0008611505,"about_ca_system_score_gemma":0.0011339481,"threshold_uncertainty_score":0.010906041},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21734223,0.0006852376,0.7683734,0.000908817,0.000090244954,0.00030585864,0.0013983939,0.0024393261,0.0084564565],"genre_scores_gemma":[0.46756598,0.0005335257,0.51987773,0.0003374838,0.00005448115,0.00023785724,0.004107628,0.0003714289,0.0069138957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984112,0.0002909572,0.00013848931,0.0006983133,0.00024101883,0.00022000168],"domain_scores_gemma":[0.99645436,0.0018108357,0.0004952974,0.0008284402,0.0002232289,0.00018790085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010244293,0.0006752895,0.00095886714,0.0009862488,0.00078439753,0.0022303362,0.0019500916,0.0015971609,0.005722669],"category_scores_gemma":[0.0048809755,0.00050669146,0.0012850778,0.0021164515,0.0011093509,0.0046377718,0.0016686996,0.001369435,0.0010048155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012798866,0.00055165164,0.0053537,0.0010404377,0.0001842389,0.00053608604,0.0006172222,0.3637608,0.04603257,0.2301606,0.010318955,0.34016383],"study_design_scores_gemma":[0.00019610184,0.00031338836,0.0014531922,0.00008748255,0.00009600065,0.00085602724,0.00028231382,0.6677989,0.029830676,0.2831389,0.015885783,0.000061207415],"about_ca_topic_score_codex":0.0012378631,"about_ca_topic_score_gemma":0.0015672335,"teacher_disagreement_score":0.005722669,"about_ca_system_score_codex":0.0016421466,"about_ca_system_score_gemma":0.0011807942,"threshold_uncertainty_score":0.019144237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016624592,0.00021496837,0.979634,0.00071987713,0.000046338213,0.0000780907,0.000046646102,0.0003500263,0.0022854554],"genre_scores_gemma":[0.8280748,0.00022969172,0.1658551,0.00090410706,0.000125775,0.0003091245,0.00021989942,0.00021486856,0.0040666526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952887,0.002538253,0.00017749165,0.00087190943,0.0008094989,0.00031407288],"domain_scores_gemma":[0.97908735,0.015197141,0.001021912,0.0033041844,0.0009063504,0.00048307716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00963337,0.0012072824,0.0015004664,0.0007534835,0.0010341445,0.0016656616,0.0023975656,0.0018241839,0.0028234557],"category_scores_gemma":[0.027860368,0.00058043154,0.0008808135,0.0005462286,0.0041461904,0.0030001241,0.00523267,0.0046536056,0.0005534168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036020868,0.00015778052,0.0036216464,0.00014826364,0.0001251416,0.00021780108,0.0004898207,0.7734585,0.0042965175,0.13853076,0.0037312882,0.07486238],"study_design_scores_gemma":[0.000017573399,0.000036790436,0.00015962089,0.000021977354,0.000009631238,0.00004700195,0.000022070082,0.92805713,0.0012623734,0.069631696,0.0007235194,0.0000106452335],"about_ca_topic_score_codex":0.0012222339,"about_ca_topic_score_gemma":0.0019054807,"teacher_disagreement_score":0.00963337,"about_ca_system_score_codex":0.0016190705,"about_ca_system_score_gemma":0.0018761731,"threshold_uncertainty_score":0.050946772},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005969078,0.26042968,0.7200859,0.0031942618,0.00059284887,0.000115307535,0.00033443247,0.0007670334,0.008511392],"genre_scores_gemma":[0.06622186,0.29900134,0.6248491,0.0010493686,0.0021446405,0.00032913417,0.0017529537,0.00057512725,0.004076447],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793434,0.0005680607,0.00019904063,0.0006659245,0.0005325765,0.000100059675],"domain_scores_gemma":[0.9918475,0.0068499297,0.00027313014,0.00033348287,0.000580412,0.000115517745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036767267,0.001815166,0.0017051914,0.0035732905,0.0007097238,0.0036165905,0.0044103246,0.0027397168,0.0025606297],"category_scores_gemma":[0.012459841,0.00139147,0.0015314769,0.004453992,0.0021014852,0.005756012,0.0019711102,0.0028322414,0.0021096244],"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.00006345191,0.00015601513,0.0039520264,0.0024653112,0.00025565282,0.00018512117,0.0002139271,0.1564361,0.0012407894,0.13069732,0.015094447,0.68923986],"study_design_scores_gemma":[0.00005924497,0.00016734932,0.003023857,0.0017805768,0.00022961647,0.0009622843,0.00023343493,0.42581415,0.002576727,0.39701664,0.1679476,0.00018839758],"about_ca_topic_score_codex":0.0041692704,"about_ca_topic_score_gemma":0.0023447648,"teacher_disagreement_score":0.0044103246,"about_ca_system_score_codex":0.0019959365,"about_ca_system_score_gemma":0.0018987854,"threshold_uncertainty_score":0.019444644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0367312,0.0009341575,0.93469906,0.00028838674,0.00019177933,0.00012789399,0.00068040134,0.018989157,0.007358054],"genre_scores_gemma":[0.40561166,0.0007310553,0.573368,0.00071871706,0.00008615509,0.0002445418,0.0035910571,0.0010193703,0.014629411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997601,0.000025060755,0.000012090445,0.000107603846,0.00005211442,0.000043117645],"domain_scores_gemma":[0.9998153,0.00003852242,0.00001773934,0.000041650757,0.00006179658,0.000025064193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004687698,0.0011508737,0.0006979865,0.0010215071,0.0006007101,0.0009929196,0.0021649625,0.0014284867,0.005645738],"category_scores_gemma":[0.00083940517,0.000614597,0.0008141626,0.0009041258,0.000630084,0.0025337467,0.0012486926,0.0009782689,0.0021611708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009454986,0.00021638283,0.0025806953,0.00027128166,0.00023253242,0.00023142624,0.00017494895,0.16024874,0.030464726,0.019943224,0.027740346,0.7569503],"study_design_scores_gemma":[0.000018800167,0.000107966305,0.00042576966,0.000019690158,0.000050363604,0.00009874059,0.00003073954,0.9653666,0.018885938,0.0071932105,0.0077765025,0.000025651874],"about_ca_topic_score_codex":0.009573595,"about_ca_topic_score_gemma":0.014674378,"teacher_disagreement_score":0.009573595,"about_ca_system_score_codex":0.0012072783,"about_ca_system_score_gemma":0.0013573691,"threshold_uncertainty_score":0.019035757},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8814667,0.00024069117,0.1052164,0.00027696782,0.000064194806,0.00011358305,0.0015518353,0.008042168,0.003027436],"genre_scores_gemma":[0.84009236,0.00007442946,0.15321966,0.00011877268,0.000013360013,0.00010196127,0.0044956603,0.0006612625,0.0012226393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985911,0.00054627226,0.000059642523,0.00040798556,0.0002549478,0.00013995178],"domain_scores_gemma":[0.99402606,0.0033119805,0.00019929998,0.001509551,0.0008206198,0.00013244901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032678393,0.0006652054,0.0007442293,0.0007444797,0.0007790011,0.0012590962,0.0021719981,0.0017830458,0.0030687526],"category_scores_gemma":[0.0113844145,0.00044858278,0.00071160693,0.0007082924,0.0007842776,0.0012504678,0.001195122,0.0010509663,0.00077456125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016195631,0.0005183805,0.024128618,0.00020774422,0.0002702922,0.00026642825,0.00040613525,0.8355363,0.023034874,0.010609029,0.003674945,0.09972768],"study_design_scores_gemma":[0.00007414032,0.00012784424,0.0027115974,0.00001335801,0.000016717493,0.00007577758,0.00006282877,0.98455,0.009483283,0.0015750191,0.0012913978,0.000018097755],"about_ca_topic_score_codex":0.011347022,"about_ca_topic_score_gemma":0.011415616,"teacher_disagreement_score":0.011347022,"about_ca_system_score_codex":0.0010380326,"about_ca_system_score_gemma":0.0016684652,"threshold_uncertainty_score":0.022561967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122586645,0.014607971,0.80713594,0.036602333,0.0010851866,0.00016880441,0.0009667601,0.0031474098,0.013699009],"genre_scores_gemma":[0.68342364,0.0055747973,0.29043368,0.010918202,0.0008572636,0.000148773,0.0012190274,0.00089883816,0.0065258555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652797,0.0013901826,0.00017823659,0.00087843766,0.0007455872,0.00027970897],"domain_scores_gemma":[0.9862698,0.007884561,0.0009324291,0.0019013718,0.0020574953,0.00095432444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0080658095,0.0012310094,0.0018045333,0.00082231156,0.0006139296,0.0022767684,0.0019243439,0.0035295163,0.0045404183],"category_scores_gemma":[0.030145125,0.0007486495,0.00053631776,0.00082579756,0.0021798145,0.0105030965,0.0020924052,0.0036935112,0.0024885884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019831713,0.00055759813,0.022430722,0.0015689569,0.0003873923,0.00054209237,0.0013231284,0.08875073,0.024497557,0.04786828,0.059065882,0.7510245],"study_design_scores_gemma":[0.00018217199,0.0007434587,0.0105838245,0.0013961637,0.00019549475,0.0010860132,0.0015763124,0.6341094,0.031705372,0.26726538,0.05095492,0.00020155832],"about_ca_topic_score_codex":0.0022107942,"about_ca_topic_score_gemma":0.0041302927,"teacher_disagreement_score":0.0080658095,"about_ca_system_score_codex":0.00093843427,"about_ca_system_score_gemma":0.0011601279,"threshold_uncertainty_score":0.04265654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062051967,0.0005719947,0.9291872,0.00028536812,0.000072543975,0.00006386288,0.0001547382,0.00032318747,0.0072892434],"genre_scores_gemma":[0.9146566,0.000348062,0.080232345,0.0000857037,0.000046912606,0.00021061697,0.00023811309,0.000029398258,0.0041523934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968266,0.00009040771,0.000018301698,0.000073957846,0.00009018321,0.000044449363],"domain_scores_gemma":[0.99976116,0.000116777155,0.00003216546,0.000014285932,0.00006342595,0.000012169004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059891987,0.0007056164,0.00073293835,0.00069317623,0.00028854783,0.0007616567,0.0009631031,0.00075351796,0.0012609102],"category_scores_gemma":[0.00090553716,0.00031291458,0.0008557254,0.0007499858,0.00030886,0.00055129564,0.00050139433,0.0005181807,0.00019724386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000235217,0.000034245873,0.0014445923,0.000028420245,0.00004766463,0.000028083461,0.00001579636,0.971556,0.00048968825,0.002037362,0.00041692052,0.023877734],"study_design_scores_gemma":[0.000002545181,0.0000125158895,0.00021134508,0.0000021125682,0.0000049743717,0.0000049493297,0.0000024666292,0.9991647,0.00007695172,0.0003579166,0.0001574556,0.000002112014],"about_ca_topic_score_codex":0.010797002,"about_ca_topic_score_gemma":0.0066301404,"teacher_disagreement_score":0.010797002,"about_ca_system_score_codex":0.0004681292,"about_ca_system_score_gemma":0.00079149194,"threshold_uncertainty_score":0.021468282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23758262,0.0003887197,0.75513166,0.0004808744,0.000042012045,0.0005270979,0.000103899125,0.00015396663,0.005589173],"genre_scores_gemma":[0.8209103,0.0001732525,0.17782778,0.00004690694,0.000013185881,0.00033227383,0.00006518076,0.00001132001,0.00061970064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972516,0.0014219054,0.00014434563,0.0002695744,0.0006358857,0.00027669477],"domain_scores_gemma":[0.9955575,0.003175617,0.0003962424,0.00008544314,0.00060172146,0.00018344905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047423807,0.001326062,0.0011627255,0.0037058617,0.0010473831,0.0030389833,0.0012896181,0.0010908066,0.0015666799],"category_scores_gemma":[0.009254179,0.0006312642,0.0013985691,0.0018164607,0.000921316,0.001980352,0.0013693301,0.0009634454,0.00011082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026815996,0.00033657288,0.005397261,0.00032408917,0.0002561901,0.00021536779,0.000901382,0.8757025,0.0023286168,0.020864043,0.00068998086,0.09271588],"study_design_scores_gemma":[0.000030222987,0.00010124577,0.0006485114,0.000033054843,0.00004132912,0.000016761958,0.00022847703,0.9874456,0.00071159087,0.010339614,0.0003748415,0.00002879517],"about_ca_topic_score_codex":0.011183414,"about_ca_topic_score_gemma":0.009548538,"teacher_disagreement_score":0.011183414,"about_ca_system_score_codex":0.0033902538,"about_ca_system_score_gemma":0.0034168276,"threshold_uncertainty_score":0.025080442},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062949345,0.00018261593,0.99192786,0.00007375233,0.000037341517,0.000051440114,0.000026742855,0.00033522383,0.0010701442],"genre_scores_gemma":[0.15322904,0.0002225595,0.84351873,0.00010228968,0.000043142412,0.00021340887,0.00017616924,0.00006539769,0.0024293126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991172,0.00011336778,0.00004735382,0.00023791238,0.00042502276,0.000059153343],"domain_scores_gemma":[0.99925715,0.00016431013,0.00006872227,0.000058861442,0.00042071092,0.0000302115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008635774,0.00083879783,0.0013168331,0.0011803753,0.0010735799,0.0010647334,0.0019906682,0.0015676774,0.0012279167],"category_scores_gemma":[0.0017767857,0.00044273198,0.0010392616,0.0012920826,0.00066661683,0.0011082973,0.0007889182,0.0011778595,0.00055724365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016932075,0.00010733796,0.0015480809,0.00023057,0.00015911645,0.00013726039,0.0003189382,0.44078618,0.023646874,0.017895967,0.005736105,0.50926423],"study_design_scores_gemma":[0.000010570287,0.000018373741,0.00020257477,0.000008732175,0.0000092193395,0.000057478726,0.00001155154,0.9940295,0.0024283521,0.0015457412,0.001662349,0.000015615853],"about_ca_topic_score_codex":0.012278357,"about_ca_topic_score_gemma":0.011756367,"teacher_disagreement_score":0.012278357,"about_ca_system_score_codex":0.0011155572,"about_ca_system_score_gemma":0.0020479283,"threshold_uncertainty_score":0.024413764},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013953475,0.00086966786,0.97527766,0.00029504352,0.000088846275,0.00010320817,0.00009098218,0.00027438626,0.009046694],"genre_scores_gemma":[0.39334226,0.0011589587,0.59938323,0.00027048038,0.00012190319,0.00048179197,0.00030474315,0.00013217432,0.0048044627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924904,0.00032810698,0.00002710282,0.00007008917,0.0002680609,0.000057608595],"domain_scores_gemma":[0.9991467,0.00045476752,0.000069677204,0.00006514939,0.00022232537,0.00004126718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010802854,0.0009426115,0.00089152256,0.00085397606,0.00036747532,0.001023448,0.0013426265,0.00086398766,0.0023511269],"category_scores_gemma":[0.0018090724,0.00031702485,0.00069809036,0.0011481822,0.00060901814,0.0007479488,0.00091140025,0.001221766,0.0004925118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002723309,0.00003306991,0.00029793676,0.00007682615,0.0000378239,0.000054090408,0.000025479105,0.94771165,0.0009674469,0.01694348,0.0011729541,0.032651946],"study_design_scores_gemma":[0.000004125125,0.000014454233,0.0000407727,0.0000041556827,0.0000033478582,0.000011254585,0.000004524816,0.9960163,0.0001515472,0.003071422,0.00067548285,0.0000024899439],"about_ca_topic_score_codex":0.005323747,"about_ca_topic_score_gemma":0.0047604768,"teacher_disagreement_score":0.005323747,"about_ca_system_score_codex":0.00073300995,"about_ca_system_score_gemma":0.0013625226,"threshold_uncertainty_score":0.010585487},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8263209,0.0030825199,0.15234792,0.0005066537,0.0002091005,0.00024066404,0.008193599,0.0068558184,0.0022428718],"genre_scores_gemma":[0.89160246,0.0005732886,0.09043286,0.00005555272,0.0000969315,0.00016076982,0.01551393,0.00028119463,0.0012830045],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99697196,0.0005871729,0.00028334907,0.0008796433,0.0010530903,0.0002247512],"domain_scores_gemma":[0.978779,0.011286748,0.0031759755,0.0019533886,0.0040489133,0.00075595116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031473432,0.0015800993,0.001032269,0.007957292,0.000409162,0.0010641265,0.00086545147,0.0012198293,0.00062596146],"category_scores_gemma":[0.02044155,0.00032052494,0.000671418,0.0045502177,0.00028096375,0.0018587841,0.00066663785,0.0012976874,0.0010793647],"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.00047130312,0.00067691796,0.45374456,0.00049047207,0.0002991487,0.00017003919,0.00035556,0.035281938,0.008451591,0.0006946002,0.009362284,0.49000162],"study_design_scores_gemma":[0.000043160835,0.00057917996,0.21914206,0.00013062786,0.00012379291,0.00035321192,0.0003201749,0.758829,0.01250793,0.0023692492,0.00552767,0.000073882286],"about_ca_topic_score_codex":0.0069764494,"about_ca_topic_score_gemma":0.010480779,"teacher_disagreement_score":0.007957292,"about_ca_system_score_codex":0.0005361067,"about_ca_system_score_gemma":0.0009537348,"threshold_uncertainty_score":0.016644955},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055635776,0.00020191073,0.93873686,0.00012489701,0.000027626904,0.00007883386,0.000074031224,0.000476833,0.0046432028],"genre_scores_gemma":[0.5483559,0.00020358253,0.4435501,0.00009115061,0.000024545208,0.00041935797,0.00028727335,0.00023947142,0.0068287207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990046,0.000031731808,0.0000042532997,0.000020322965,0.00002525257,0.00001792659],"domain_scores_gemma":[0.99964905,0.00022046169,0.000040529027,0.000014552289,0.00005851779,0.000016909356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037339705,0.0007613432,0.00063663005,0.00040469784,0.00021698282,0.0003505995,0.0006484001,0.00094318506,0.0023653214],"category_scores_gemma":[0.000921611,0.0004563296,0.0004931782,0.00026585892,0.00030913338,0.00034118348,0.00045340456,0.0005822648,0.00045520478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014075615,0.000017541779,0.00015741235,0.000019876641,0.0000078066805,0.000011183641,0.000010770064,0.9889698,0.0008385028,0.0006971173,0.00013733651,0.00911863],"study_design_scores_gemma":[0.0000023715231,0.000005685078,0.000017493965,0.0000016353767,0.0000010247511,0.0000013163024,0.0000023268096,0.999605,0.00013148144,0.00013674841,0.00009420359,7.4732395e-7],"about_ca_topic_score_codex":0.006715116,"about_ca_topic_score_gemma":0.008270401,"teacher_disagreement_score":0.006715116,"about_ca_system_score_codex":0.0004371439,"about_ca_system_score_gemma":0.00086795125,"threshold_uncertainty_score":0.0133520365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26402527,0.001227144,0.7300873,0.0003504433,0.000053688156,0.0000727528,0.0003985369,0.0021888458,0.0015959585],"genre_scores_gemma":[0.93870515,0.0002632015,0.059017215,0.00006071466,0.00001963969,0.0000685796,0.00055011554,0.000037131544,0.0012782377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998908,0.0000285764,0.0000061109577,0.000032109463,0.00002455287,0.00001785665],"domain_scores_gemma":[0.9998447,0.000061248094,0.00002726175,0.000024076267,0.00003341116,0.000009361981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047918712,0.00053845474,0.00031935793,0.0004723386,0.00012542875,0.00030247698,0.00044711062,0.00034637217,0.00065203774],"category_scores_gemma":[0.0009787882,0.00016547139,0.00036958224,0.0004781464,0.00022540517,0.0004862021,0.00045937157,0.0006009815,0.0002116009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003040683,0.0003203201,0.0058450913,0.00009174937,0.00012387388,0.00025938087,0.000112726935,0.4475338,0.04314466,0.0032893193,0.0029812893,0.49599367],"study_design_scores_gemma":[0.000004893277,0.00003854407,0.0010466663,0.0000031658878,0.0000069290877,0.000023864115,0.0000073004926,0.99403965,0.003164317,0.0013859003,0.00027341757,0.000005399849],"about_ca_topic_score_codex":0.0043105315,"about_ca_topic_score_gemma":0.0042647882,"teacher_disagreement_score":0.0043105315,"about_ca_system_score_codex":0.0004041893,"about_ca_system_score_gemma":0.0004491142,"threshold_uncertainty_score":0.00857085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018948672,0.00057172636,0.9682916,0.0009327139,0.00015649645,0.00014523721,0.00030241755,0.0023725643,0.00827861],"genre_scores_gemma":[0.20137559,0.0006542757,0.78663254,0.00057028397,0.00025024934,0.00049607194,0.0018667799,0.0009236046,0.0072305533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543023,0.0009702473,0.00036060426,0.0009938531,0.0016402785,0.0006048074],"domain_scores_gemma":[0.9919958,0.004106785,0.0006668819,0.0021382594,0.0007972707,0.00029509317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002688773,0.0016547471,0.001938909,0.0012191347,0.0015332301,0.0031011943,0.002977939,0.0015774056,0.012048613],"category_scores_gemma":[0.014387047,0.00078060286,0.0021859559,0.0023878033,0.0019420506,0.009848908,0.004335284,0.0057152803,0.003884405],"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.0010416119,0.0005867155,0.0014185172,0.00097125856,0.00016723065,0.00017134586,0.0006515099,0.21388823,0.011739359,0.38328105,0.027689818,0.3583933],"study_design_scores_gemma":[0.0002512697,0.00014300145,0.00022437333,0.000063610285,0.000031651987,0.00018400032,0.00017004464,0.5167359,0.007516301,0.46277827,0.011843282,0.000058314712],"about_ca_topic_score_codex":0.0016306333,"about_ca_topic_score_gemma":0.0020952187,"teacher_disagreement_score":0.012048613,"about_ca_system_score_codex":0.002137241,"about_ca_system_score_gemma":0.0025288514,"threshold_uncertainty_score":0.04030657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009134514,0.000079150246,0.9814346,0.00025946723,0.00013733456,0.00013644852,0.00012818837,0.0017355806,0.0069546984],"genre_scores_gemma":[0.06428889,0.000065790366,0.93110645,0.00018218844,0.0000467779,0.00032900096,0.00040504275,0.0004751589,0.003100704],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992035,0.00013730572,0.000071793605,0.00023819401,0.000237193,0.000112020345],"domain_scores_gemma":[0.99810886,0.0010703875,0.00011969904,0.00030694166,0.00029671233,0.000097338205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009958488,0.0012073899,0.0011330502,0.0020154428,0.0012671755,0.0023207918,0.002103423,0.0018132413,0.013520945],"category_scores_gemma":[0.007359713,0.00067516847,0.0014758798,0.0012617325,0.0013509607,0.0023395927,0.0033985113,0.001994388,0.0026819725],"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.00038694954,0.00023002086,0.0023943365,0.00053059123,0.00012743351,0.00045705464,0.00046041323,0.16750616,0.018084902,0.29050082,0.018515173,0.50080615],"study_design_scores_gemma":[0.00014061599,0.00008339044,0.0002697808,0.00007025408,0.00003986366,0.0002214425,0.00009697069,0.7704814,0.006793789,0.20890617,0.012852915,0.00004336351],"about_ca_topic_score_codex":0.0015917129,"about_ca_topic_score_gemma":0.002392292,"teacher_disagreement_score":0.013520945,"about_ca_system_score_codex":0.001153058,"about_ca_system_score_gemma":0.001813325,"threshold_uncertainty_score":0.045232117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002908976,0.00012976104,0.99636155,0.00003763448,0.000027595805,0.000015276708,0.0000070257483,0.0001689415,0.00034329403],"genre_scores_gemma":[0.13008724,0.00030717658,0.8660333,0.00009572884,0.000062077976,0.00016451199,0.00011696136,0.00008750541,0.0030455296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917513,0.00017285827,0.00005531836,0.00018430117,0.000367273,0.00004514195],"domain_scores_gemma":[0.99903524,0.00042375474,0.00009444108,0.00015323336,0.000265118,0.000028190554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008532977,0.00063001644,0.0006529133,0.0005736609,0.00027382164,0.00065897434,0.0013541405,0.0008658812,0.001262832],"category_scores_gemma":[0.003091837,0.000313519,0.00068302633,0.0009443437,0.00064310216,0.0010287581,0.00075453153,0.0010635878,0.0007607482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036166576,0.000109717264,0.00074500794,0.00022200643,0.00011754509,0.00011005176,0.00018836142,0.23155828,0.064723305,0.024555756,0.0022074792,0.67510074],"study_design_scores_gemma":[0.000029763323,0.000114254864,0.00019867219,0.000014715139,0.000017094359,0.00012769605,0.000010154399,0.97794515,0.014350767,0.0030441433,0.004126615,0.000021089923],"about_ca_topic_score_codex":0.001888563,"about_ca_topic_score_gemma":0.001678229,"teacher_disagreement_score":0.001888563,"about_ca_system_score_codex":0.00043179924,"about_ca_system_score_gemma":0.0010346737,"threshold_uncertainty_score":0.0045127273},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06697444,0.00023013914,0.92916554,0.00011732585,0.00004452363,0.000036281228,0.000053056174,0.0023507287,0.0010279197],"genre_scores_gemma":[0.839778,0.00025374358,0.1585038,0.000033730223,0.000029012288,0.000029545847,0.0001195032,0.00008427431,0.001168259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978405,0.00003759207,0.00002100026,0.00004968243,0.00008405041,0.000023714087],"domain_scores_gemma":[0.999385,0.00024295025,0.00010368279,0.00005324631,0.00019390437,0.000021186948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004259524,0.0005934148,0.00030418058,0.001294262,0.00022714277,0.00056274177,0.00029513237,0.00046806404,0.001248],"category_scores_gemma":[0.0022852262,0.0001072178,0.00019419538,0.00043245955,0.00020989751,0.000684486,0.00026216256,0.00024432805,0.0004752405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042185176,0.00012421068,0.007354974,0.00017947183,0.000032502412,0.00025917494,0.00020193114,0.14155503,0.113109164,0.0036627704,0.0017582463,0.7313407],"study_design_scores_gemma":[0.000008937494,0.00011895142,0.0044487175,0.000024751644,0.00001950431,0.00018065472,0.00005738822,0.96082187,0.030727556,0.0022998282,0.0012738103,0.000017934814],"about_ca_topic_score_codex":0.0010369344,"about_ca_topic_score_gemma":0.00063190405,"teacher_disagreement_score":0.001294262,"about_ca_system_score_codex":0.00025632858,"about_ca_system_score_gemma":0.00026722153,"threshold_uncertainty_score":0.0041750073},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042202617,0.00005376163,0.99447757,0.00007543222,0.000007465768,0.000027134813,0.000016148388,0.00021903984,0.0009032942],"genre_scores_gemma":[0.42727217,0.00022966726,0.5689378,0.0001493261,0.000018140241,0.00032468681,0.0001352024,0.0002483229,0.0026847494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999456,0.00018386188,0.000020074738,0.00009886373,0.00019857756,0.000042685595],"domain_scores_gemma":[0.99902046,0.0005248008,0.00013473578,0.000116722586,0.00016585797,0.0000374354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015377158,0.00069937384,0.00061653124,0.00053747353,0.00029017302,0.0010210775,0.0009672605,0.0011229496,0.0024532017],"category_scores_gemma":[0.0035344586,0.0004438334,0.0006444071,0.0005054467,0.0008802216,0.000977681,0.0011527039,0.0011537523,0.00062295387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004617594,0.000035550212,0.00039739546,0.000060750695,0.000015722113,0.00003987264,0.00005422549,0.9587307,0.0051478096,0.009543987,0.00044666842,0.02548113],"study_design_scores_gemma":[0.000005223094,0.000019824582,0.000044720226,0.0000049586224,0.0000026372898,0.000012274114,0.000005935589,0.9947891,0.0018949395,0.0025419511,0.0006732273,0.0000051153825],"about_ca_topic_score_codex":0.0012689354,"about_ca_topic_score_gemma":0.0013565884,"teacher_disagreement_score":0.0024532017,"about_ca_system_score_codex":0.00071865856,"about_ca_system_score_gemma":0.00094312395,"threshold_uncertainty_score":0.008206785},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00705612,0.00012922577,0.98574823,0.00019938653,0.00005117399,0.00005883308,0.000058868438,0.0005354088,0.0061628143],"genre_scores_gemma":[0.08961776,0.00022749708,0.9060368,0.00014320463,0.00004652575,0.00022926781,0.00017772592,0.00019856506,0.0033227063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957055,0.00010579599,0.000018572813,0.00011159162,0.0001273471,0.000066038214],"domain_scores_gemma":[0.99950457,0.00028006834,0.000053115484,0.000056842873,0.00007614474,0.000029228579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006288239,0.0009778901,0.0007187195,0.00046529312,0.00050317054,0.0012077654,0.0010809272,0.00079702795,0.005212841],"category_scores_gemma":[0.0015244589,0.0005621044,0.0011881188,0.0008501995,0.00091300334,0.0010151032,0.0010428597,0.0017156515,0.00095486135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058007154,0.00005806571,0.00021220118,0.00010668273,0.000014553812,0.000092367256,0.000055280547,0.92855686,0.0045147706,0.023453053,0.0017804144,0.041097622],"study_design_scores_gemma":[0.00001589858,0.00002033029,0.000030794934,0.00000697725,0.0000045423094,0.0000157413,0.000011923168,0.987748,0.0008851139,0.009511706,0.0017447326,0.000004220868],"about_ca_topic_score_codex":0.0041856593,"about_ca_topic_score_gemma":0.007749136,"teacher_disagreement_score":0.005212841,"about_ca_system_score_codex":0.0009611291,"about_ca_system_score_gemma":0.0013868072,"threshold_uncertainty_score":0.01743871},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072871945,0.000057617057,0.92576313,0.00013198992,0.000034155895,0.00059934,0.0028315692,0.0619306,0.0013643719],"genre_scores_gemma":[0.07264448,0.0001162455,0.9146467,0.000106126754,0.000030360043,0.0014897627,0.0069341213,0.0018914153,0.0021407304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788684,0.00025014553,0.0003457388,0.0005621799,0.00085275294,0.000102331665],"domain_scores_gemma":[0.99615806,0.001477096,0.00045096406,0.0007882817,0.000987968,0.00013749665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018833249,0.0013133222,0.00066962733,0.0036436317,0.00065710075,0.001446843,0.0013514272,0.00054883666,0.00419246],"category_scores_gemma":[0.009709274,0.0006111705,0.0011980229,0.0028399539,0.00038475613,0.0013828995,0.0010860121,0.001606817,0.0028604795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076710706,0.0008901509,0.026788715,0.0011643709,0.00026673553,0.0008736285,0.001101138,0.018332634,0.044199422,0.015704675,0.03519312,0.8547182],"study_design_scores_gemma":[0.00022103402,0.0003247896,0.023577144,0.00014092342,0.00014922941,0.0011425107,0.00029707118,0.7493044,0.11328817,0.015994048,0.09537956,0.00018121625],"about_ca_topic_score_codex":0.0039056875,"about_ca_topic_score_gemma":0.003770073,"teacher_disagreement_score":0.00419246,"about_ca_system_score_codex":0.00057839626,"about_ca_system_score_gemma":0.0026267623,"threshold_uncertainty_score":0.014025211},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004918908,0.00015879571,0.99290085,0.00014212963,0.000016200573,0.000072556584,0.00067268254,0.0008330761,0.00028484882],"genre_scores_gemma":[0.12934273,0.00028401075,0.86694765,0.00011782335,0.00002970578,0.00019616683,0.002426167,0.00009278096,0.0005629619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990853,0.00017873285,0.000097255186,0.000248075,0.00033616569,0.00005430973],"domain_scores_gemma":[0.9976459,0.0012614426,0.00027966194,0.00026075463,0.00049390225,0.000058251902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015572915,0.0007592808,0.0006810507,0.0030439212,0.0005766656,0.0014367446,0.00126233,0.0008970957,0.0019215845],"category_scores_gemma":[0.006733365,0.0003464296,0.0015569185,0.001877395,0.0004903245,0.0018209005,0.00100112,0.0012642358,0.0005696287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018537142,0.00021742294,0.009119187,0.00060449884,0.00018780846,0.0005804188,0.00041349986,0.5194864,0.011002829,0.05944699,0.0059234654,0.39283204],"study_design_scores_gemma":[0.000012482641,0.00005083089,0.00054526667,0.00004463602,0.00003349268,0.00011706182,0.000047029273,0.9500774,0.003064776,0.04210804,0.0038835376,0.000015369851],"about_ca_topic_score_codex":0.005893588,"about_ca_topic_score_gemma":0.007047927,"teacher_disagreement_score":0.005893588,"about_ca_system_score_codex":0.001218914,"about_ca_system_score_gemma":0.0019068307,"threshold_uncertainty_score":0.011718571},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5440771,0.0003271794,0.45154756,0.0007760379,0.000037683338,0.000138735,0.0009290545,0.0007984329,0.0013682159],"genre_scores_gemma":[0.9561971,0.000118406766,0.042328175,0.000033729124,0.000015635795,0.00006543159,0.0007928217,0.000020865362,0.00042785166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719965,0.0011982193,0.0002545338,0.0005024121,0.0006302747,0.00021498279],"domain_scores_gemma":[0.98321944,0.012063601,0.0021795353,0.0010038749,0.0012897867,0.00024380021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008508596,0.0010942322,0.00077431445,0.0027183846,0.0003987563,0.0017961578,0.0009719747,0.00092353165,0.0012155465],"category_scores_gemma":[0.020757886,0.0003146845,0.0012984155,0.0017573601,0.0006078638,0.0014256318,0.0010440313,0.00111,0.00033715172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003049432,0.00021065072,0.055993255,0.00012942009,0.00024135475,0.00017581687,0.00021015851,0.8780217,0.0028179542,0.008071399,0.0006633709,0.05315992],"study_design_scores_gemma":[0.0000031344173,0.00005140782,0.002547057,0.000007006872,0.00001620483,0.000017393024,0.00001923553,0.994279,0.0008684147,0.0020941573,0.00008819481,0.000008811674],"about_ca_topic_score_codex":0.00677437,"about_ca_topic_score_gemma":0.0040360778,"teacher_disagreement_score":0.008508596,"about_ca_system_score_codex":0.0012497659,"about_ca_system_score_gemma":0.0014688359,"threshold_uncertainty_score":0.04499829},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019691841,0.0014083973,0.0050408784,0.075891145,0.9091755,0.000026964974,0.0036770948,0.0013595341,0.0032236648],"genre_scores_gemma":[0.04131973,0.012307737,0.025661632,0.15073179,0.48772728,0.0004704179,0.011511588,0.010623145,0.25964662],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98974633,0.0019002255,0.001444933,0.0019186354,0.0042238794,0.00076583505],"domain_scores_gemma":[0.8820069,0.027834553,0.004142814,0.007370619,0.07548056,0.003164467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007903802,0.0034277774,0.003154747,0.005605941,0.0057251304,0.008553355,0.005458889,0.0073010013,0.083185926],"category_scores_gemma":[0.17925957,0.0015853099,0.0030026995,0.006042047,0.004790091,0.006555666,0.003629497,0.015918354,0.054636948],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018674418,0.0000027463325,0.000039891944,0.00009993756,0.000015362419,0.00006347888,0.000051301417,0.00006768508,0.000039284605,0.0024423755,0.9944141,0.0027450535],"study_design_scores_gemma":[0.000048065358,0.000012387214,0.00043367172,0.00029473272,0.000059721573,0.0003756414,0.000082151164,0.000539925,0.00041239653,0.007491186,0.9901786,0.00007149993],"about_ca_topic_score_codex":0.019803612,"about_ca_topic_score_gemma":0.019023547,"teacher_disagreement_score":0.083185926,"about_ca_system_score_codex":0.0070555997,"about_ca_system_score_gemma":0.0091659585,"threshold_uncertainty_score":0.27828467},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027633738,0.000101431746,0.9699912,0.00015353833,0.000028698814,0.000110767265,0.000024528723,0.00025737047,0.0016987042],"genre_scores_gemma":[0.47257638,0.00014477261,0.5242228,0.00013500135,0.000025271256,0.00036847146,0.00011505375,0.00005375558,0.0023585174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996551,0.000121876714,0.0000131468905,0.000062397536,0.00010307011,0.00004439302],"domain_scores_gemma":[0.99967957,0.00017387445,0.00003457133,0.000016794369,0.000066385204,0.000028899974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092251325,0.00073547615,0.0007007218,0.00056137383,0.00046056093,0.0005902655,0.0013774388,0.0013693463,0.001246717],"category_scores_gemma":[0.0014893564,0.00045861097,0.00077203667,0.000633324,0.00046366602,0.00059824495,0.0006749279,0.0009078636,0.00015935756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033165168,0.000040299416,0.0002820392,0.000025975967,0.000020414649,0.000045613073,0.000034225162,0.9705221,0.0014669239,0.0029390268,0.00030517357,0.024284896],"study_design_scores_gemma":[0.000009152812,0.000020509024,0.00003574293,0.0000016445103,0.0000025205788,0.0000071629725,0.0000031932761,0.99910563,0.00014298086,0.0005442761,0.00012489593,0.0000023381144],"about_ca_topic_score_codex":0.0067115743,"about_ca_topic_score_gemma":0.00510441,"teacher_disagreement_score":0.0067115743,"about_ca_system_score_codex":0.00081867434,"about_ca_system_score_gemma":0.0017655501,"threshold_uncertainty_score":0.013345003},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070725076,0.0009382811,0.9264505,0.0002854599,0.000042203585,0.000023360306,0.00015040727,0.00014931025,0.0012353602],"genre_scores_gemma":[0.83711123,0.0015547324,0.15813391,0.0000651834,0.00016006046,0.00007210928,0.00037010282,0.000072651135,0.0024599242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997838,0.00006732532,0.000011637772,0.000055144515,0.000057970963,0.000024118164],"domain_scores_gemma":[0.99949586,0.00022927567,0.00012380861,0.000055007476,0.00007331145,0.000022784781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051983976,0.0004578714,0.0003888992,0.0010642482,0.00023290569,0.0007338819,0.00048949674,0.0006789157,0.0006445555],"category_scores_gemma":[0.0022876868,0.00015884706,0.000555937,0.0005747114,0.00035311677,0.000841835,0.00035672996,0.0006110164,0.00021545253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007768818,0.00008154558,0.005284436,0.0002251447,0.00011026185,0.00038445732,0.00032023693,0.73086685,0.04325215,0.11752759,0.0012764301,0.10059329],"study_design_scores_gemma":[0.0000010452087,0.0000118325515,0.00089712936,0.000005012377,0.0000051724146,0.000048016573,0.000010356542,0.9905896,0.00061944325,0.0071897428,0.0006156452,0.000006886126],"about_ca_topic_score_codex":0.002220691,"about_ca_topic_score_gemma":0.0011987506,"teacher_disagreement_score":0.002220691,"about_ca_system_score_codex":0.0003102426,"about_ca_system_score_gemma":0.00036715265,"threshold_uncertainty_score":0.004415512},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030782608,0.00026882614,0.9651429,0.00016342071,0.00012249759,0.00014180999,0.00016715228,0.0014588273,0.0017519663],"genre_scores_gemma":[0.516669,0.00035847924,0.4761588,0.00025706436,0.00017979988,0.00045335,0.001147696,0.00019340866,0.004582508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983689,0.00020108662,0.0002329993,0.00039693606,0.0006659477,0.00013409174],"domain_scores_gemma":[0.99804807,0.00062153034,0.00029637953,0.00021463877,0.000735372,0.00008398941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012064857,0.00080511067,0.0010314083,0.0031224433,0.0005273047,0.0014619959,0.0010410274,0.00083984033,0.0031258825],"category_scores_gemma":[0.004804691,0.00024330987,0.0012211028,0.0024492363,0.0007160392,0.0018538251,0.0010797422,0.0012557608,0.0013129702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047585974,0.00018601955,0.0022733144,0.00025321345,0.00010471716,0.00014815561,0.00019349097,0.11869264,0.025704658,0.01043402,0.0035479998,0.83798593],"study_design_scores_gemma":[0.000015649688,0.00014859116,0.00092713325,0.000018423878,0.000027472395,0.000100399135,0.000064785105,0.97551876,0.014281262,0.0072163013,0.0016576424,0.00002349973],"about_ca_topic_score_codex":0.0012810535,"about_ca_topic_score_gemma":0.00088574877,"teacher_disagreement_score":0.0031258825,"about_ca_system_score_codex":0.0007489238,"about_ca_system_score_gemma":0.0009514739,"threshold_uncertainty_score":0.0104570985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0328413,0.000601746,0.9613988,0.00018732404,0.000023281782,0.000087577166,0.0000647933,0.00046781177,0.004327412],"genre_scores_gemma":[0.71854985,0.0004196765,0.27703446,0.0001357476,0.000029485733,0.0004497112,0.0002383724,0.000154306,0.0029884486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997229,0.000098334145,0.000015887726,0.0000640455,0.00005678837,0.00004200827],"domain_scores_gemma":[0.99898463,0.00071390043,0.000111879555,0.000029654095,0.00013713328,0.000022752462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011254525,0.0016782256,0.0012123424,0.00093149836,0.00037611584,0.0010037922,0.0006703761,0.0012475698,0.001838471],"category_scores_gemma":[0.0024711627,0.00083895255,0.0009254982,0.0006739814,0.0005952235,0.00057057966,0.0006946255,0.0009424471,0.00034697083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000130295175,0.000012391765,0.00012062977,0.00002575722,0.00001237987,0.000014008672,0.000011384584,0.9917372,0.00031415006,0.00056197407,0.00014371211,0.007033414],"study_design_scores_gemma":[0.000004498997,0.000009972071,0.00004312495,0.0000040872524,0.000003255998,0.0000019629636,0.0000050413537,0.9993813,0.00012542389,0.00031214952,0.00010722929,0.0000019739307],"about_ca_topic_score_codex":0.007157666,"about_ca_topic_score_gemma":0.004562571,"teacher_disagreement_score":0.007157666,"about_ca_system_score_codex":0.00060767645,"about_ca_system_score_gemma":0.0012687027,"threshold_uncertainty_score":0.01423198},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004006754,0.0002015789,0.9917395,0.000087640714,0.000032661203,0.000039079532,0.000037882637,0.00022837266,0.003626549],"genre_scores_gemma":[0.3429309,0.00042207728,0.6469631,0.00019688897,0.000053629177,0.00063067774,0.00043143475,0.00015377603,0.008217454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949455,0.00018223432,0.00002398201,0.00005667575,0.00019755783,0.000044976645],"domain_scores_gemma":[0.99925727,0.00038457048,0.00006733025,0.00005076299,0.0002067129,0.000033366956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012674949,0.00078610814,0.0011990091,0.0006223189,0.0004612944,0.0011513244,0.0012864909,0.0016611606,0.003636372],"category_scores_gemma":[0.0020580285,0.00046991758,0.0009034959,0.0007447213,0.0005339083,0.0006512496,0.0011869615,0.0012711423,0.00086978456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032392465,0.000023374178,0.00022150931,0.000051609717,0.000022220402,0.000041815074,0.000019532707,0.97034204,0.0012158992,0.0053111003,0.00070247136,0.022016108],"study_design_scores_gemma":[0.0000052237806,0.000010743267,0.000025478214,0.000005190241,0.0000020025436,0.000009311881,0.000001846824,0.9984862,0.00020057354,0.0007165977,0.00053470244,0.0000021186],"about_ca_topic_score_codex":0.0018663823,"about_ca_topic_score_gemma":0.0014979658,"teacher_disagreement_score":0.003636372,"about_ca_system_score_codex":0.00058130635,"about_ca_system_score_gemma":0.0010348231,"threshold_uncertainty_score":0.012164831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012891678,0.99828416,0.0007150015,0.00026368684,0.00008476302,0.000039721148,0.000048978447,0.0000098604905,0.0004248225],"genre_scores_gemma":[0.0017068088,0.9966897,0.0010438489,0.00024051906,0.000058445803,0.00008046129,0.000048049937,0.000005344781,0.00012688589],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.9979353,0.00067587156,0.00056828937,0.0002145161,0.0005398167,0.000066236265],"domain_scores_gemma":[0.981699,0.015539361,0.001181563,0.00029857247,0.0011595153,0.00012205922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004137965,0.001312587,0.0023616944,0.0051571075,0.00046232142,0.0018631802,0.0014801268,0.0018303083,0.0050602984],"category_scores_gemma":[0.023081591,0.000692096,0.0029964934,0.004394101,0.000741584,0.0021663834,0.0012111339,0.0015167191,0.00085135136],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010411574,0.00006167007,0.00037547178,0.38676026,0.0012002442,0.00010466069,0.00014047821,0.0016922023,0.0003732808,0.0055098245,0.011897274,0.5917804],"study_design_scores_gemma":[0.00010884883,0.00039144105,0.0019304786,0.5244196,0.0069907135,0.0009807136,0.00024328618,0.001239374,0.0009225964,0.010191056,0.45248252,0.00009942437],"about_ca_topic_score_codex":0.0028396796,"about_ca_topic_score_gemma":0.0055795205,"teacher_disagreement_score":0.0051571075,"about_ca_system_score_codex":0.0014913268,"about_ca_system_score_gemma":0.006027637,"threshold_uncertainty_score":0.021883905},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6055413,0.0024190908,0.34235847,0.0022177286,0.0005459224,0.00085123983,0.015326658,0.008221039,0.022518441],"genre_scores_gemma":[0.89003366,0.0004951881,0.095153116,0.00022535668,0.0001354584,0.00024000122,0.009238636,0.000093699266,0.0043848692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989742,0.0003281031,0.00006830326,0.00021575636,0.00031235671,0.00010119437],"domain_scores_gemma":[0.99635905,0.0019726835,0.0005425736,0.0006067071,0.00042988863,0.0000891476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015988826,0.0009998627,0.0003619401,0.0017852343,0.00042339612,0.0011062298,0.00058300945,0.0009596559,0.0016644447],"category_scores_gemma":[0.007216368,0.00016364889,0.0006093665,0.00077225815,0.00046777862,0.0013725739,0.001293734,0.0014753221,0.00080015685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009610624,0.00071137346,0.09383761,0.0013675321,0.000499273,0.001960988,0.0021527866,0.061937567,0.030055158,0.02040493,0.04083213,0.7452796],"study_design_scores_gemma":[0.000042873897,0.00038178847,0.054245833,0.00019035095,0.00013545087,0.000999442,0.001085198,0.85554916,0.04225993,0.019954689,0.025032438,0.00012291376],"about_ca_topic_score_codex":0.0019226256,"about_ca_topic_score_gemma":0.0032762245,"teacher_disagreement_score":0.0019226256,"about_ca_system_score_codex":0.00060666376,"about_ca_system_score_gemma":0.0003962721,"threshold_uncertainty_score":0.008455813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88748306,0.010901589,0.089326456,0.0016605279,0.0002952535,0.000107069965,0.003008356,0.0015789507,0.005638697],"genre_scores_gemma":[0.9820238,0.0011535209,0.012118477,0.0001224972,0.00004495534,0.000038491085,0.0031715455,0.000039913477,0.0012867594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992995,0.00017948986,0.00007557147,0.0001385853,0.00018986368,0.000116938274],"domain_scores_gemma":[0.99842995,0.00078903435,0.00012387418,0.00014048677,0.00044203358,0.00007453998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032019522,0.0012372761,0.0008162537,0.0011636108,0.0003007981,0.0008891574,0.00058257754,0.0008213718,0.000742453],"category_scores_gemma":[0.004572401,0.00021133413,0.0007105918,0.0007263515,0.00019468632,0.0010603676,0.00068430504,0.0008646832,0.00025087228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010376632,0.0006059555,0.10365316,0.000322869,0.00084095297,0.00024692173,0.000087729975,0.62286407,0.0029695604,0.0012052726,0.007766459,0.25839934],"study_design_scores_gemma":[0.000011994385,0.00028755906,0.012745275,0.000057681646,0.00010183159,0.00005949161,0.000039113605,0.9835355,0.0016270422,0.0007703035,0.00074563705,0.000018490482],"about_ca_topic_score_codex":0.015415069,"about_ca_topic_score_gemma":0.014022892,"teacher_disagreement_score":0.015415069,"about_ca_system_score_codex":0.00079756934,"about_ca_system_score_gemma":0.0010729787,"threshold_uncertainty_score":0.030650675},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07614272,0.00022090347,0.9177602,0.0012860908,0.000041213505,0.00015965405,0.00048592806,0.00087738334,0.0030258426],"genre_scores_gemma":[0.71361166,0.00014657727,0.28407606,0.00030527657,0.000051280535,0.00025057205,0.0009439857,0.00015865114,0.00045599346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9572077,0.016203756,0.004913346,0.005931449,0.013851302,0.001892383],"domain_scores_gemma":[0.7597541,0.18977429,0.017764648,0.012075484,0.018760396,0.0018710081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0331895,0.0013991578,0.0013822964,0.0062149516,0.0011306821,0.0070712203,0.0026005176,0.0026288794,0.0021481642],"category_scores_gemma":[0.23782739,0.0012594572,0.002679817,0.0031354972,0.002917393,0.0098512145,0.005972837,0.003572009,0.0005566953],"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.0014252969,0.00063992693,0.07946907,0.0014615407,0.0010984197,0.001277451,0.0076899044,0.36752775,0.013333326,0.27131817,0.004653502,0.25010568],"study_design_scores_gemma":[0.0000978202,0.00028686895,0.008414289,0.000350688,0.00019037358,0.00036129588,0.0010106668,0.696776,0.012297277,0.27690923,0.0031185318,0.0001870111],"about_ca_topic_score_codex":0.0041157436,"about_ca_topic_score_gemma":0.0027379496,"teacher_disagreement_score":0.0331895,"about_ca_system_score_codex":0.002816063,"about_ca_system_score_gemma":0.0018345857,"threshold_uncertainty_score":0.17552495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022059165,0.0002133775,0.97331285,0.00010947068,0.000026266149,0.00015411172,0.00003581259,0.00027499048,0.0038138835],"genre_scores_gemma":[0.54370975,0.00029033725,0.45006952,0.00014693299,0.000029724773,0.0009556522,0.00017190039,0.00015270311,0.0044734105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978393,0.00005016089,0.0000116373185,0.000051611118,0.000067966,0.00003469325],"domain_scores_gemma":[0.9998022,0.000089543246,0.00002803959,0.000008308953,0.000055906356,0.00001606399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047587205,0.00074717944,0.00076941727,0.000722584,0.00045214273,0.0006743441,0.00089331326,0.0010860157,0.0025789335],"category_scores_gemma":[0.0010915622,0.00051212974,0.0006390215,0.00037641462,0.00044517746,0.0005585417,0.00076940475,0.00051988085,0.00028513628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034870052,0.000023414419,0.00027120163,0.000032196607,0.000013805354,0.000048684462,0.000033407,0.96877164,0.0024038341,0.00262638,0.00044332887,0.0252973],"study_design_scores_gemma":[0.0000064232213,0.00001627773,0.000052016658,0.0000027099245,0.0000032441098,0.0000101434,0.000007614057,0.99864906,0.00034998948,0.0005405058,0.0003588492,0.000003265104],"about_ca_topic_score_codex":0.0031326683,"about_ca_topic_score_gemma":0.002159956,"teacher_disagreement_score":0.0031326683,"about_ca_system_score_codex":0.00065326464,"about_ca_system_score_gemma":0.001144928,"threshold_uncertainty_score":0.008627415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007995248,0.0004993325,0.9835285,0.00035427962,0.00008255926,0.00019809035,0.00013290471,0.00050146715,0.006707586],"genre_scores_gemma":[0.1234836,0.0005760119,0.8664885,0.00016633299,0.00007130917,0.0006569419,0.00044600744,0.00027887698,0.007832301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999132,0.00032164884,0.000040018684,0.00012404112,0.0002050537,0.00017725874],"domain_scores_gemma":[0.9986713,0.0009097527,0.00010539642,0.00006544375,0.00014724396,0.000100913916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020580844,0.0015307355,0.0020700456,0.0012602342,0.0011396181,0.00168906,0.002440225,0.0018983524,0.011632215],"category_scores_gemma":[0.0029274346,0.000967085,0.0011442231,0.002461467,0.0007951137,0.0022069425,0.0013281445,0.0024448608,0.0015695207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001263252,0.00014921615,0.0003742143,0.00013974369,0.000060578266,0.000107614,0.000079379635,0.86941624,0.00054438406,0.04748207,0.007159975,0.07436026],"study_design_scores_gemma":[0.000030370245,0.000030173358,0.000040884937,0.000009875905,0.0000074246977,0.000014828303,0.000009774503,0.9870884,0.00014305577,0.011250004,0.0013701266,0.0000050402286],"about_ca_topic_score_codex":0.009795895,"about_ca_topic_score_gemma":0.0107114995,"teacher_disagreement_score":0.011632215,"about_ca_system_score_codex":0.0020141504,"about_ca_system_score_gemma":0.0032092794,"threshold_uncertainty_score":0.038913608},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18583497,0.00079257163,0.8059376,0.0004813317,0.00014696197,0.000118579854,0.0005974748,0.0034654923,0.00262502],"genre_scores_gemma":[0.8254015,0.00035261348,0.17008294,0.00015255937,0.00004391632,0.00012462559,0.0013460501,0.00017235569,0.002323466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979144,0.000049383772,0.000012548105,0.00006398481,0.000059458383,0.000023177296],"domain_scores_gemma":[0.9994116,0.00023471894,0.00007579881,0.00013111168,0.00012950078,0.000017307015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008703454,0.00070310186,0.0003576838,0.00033086233,0.00018761524,0.00041700815,0.00069606217,0.0004957027,0.0013768511],"category_scores_gemma":[0.002284911,0.00022648534,0.00074408535,0.00043268673,0.00039631972,0.0008636428,0.0005748659,0.0010162301,0.00070353353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004167243,0.0002712913,0.0036622796,0.00019111088,0.00009820556,0.00013229957,0.0001552896,0.540786,0.07805055,0.0039986935,0.003467497,0.36877003],"study_design_scores_gemma":[0.000005210701,0.000060408693,0.0006223887,0.000007180831,0.000010661994,0.000024894856,0.000011793324,0.9830646,0.014239447,0.0010319187,0.0009137233,0.000007824905],"about_ca_topic_score_codex":0.0031029978,"about_ca_topic_score_gemma":0.0028422908,"teacher_disagreement_score":0.0031029978,"about_ca_system_score_codex":0.00044469503,"about_ca_system_score_gemma":0.0004620703,"threshold_uncertainty_score":0.0061698556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08531086,0.0012319139,0.9072089,0.00070702157,0.000118854885,0.000073700634,0.00016935996,0.0022727107,0.0029066096],"genre_scores_gemma":[0.917218,0.00031164964,0.08032409,0.00012885006,0.000070173184,0.000038869686,0.00021597554,0.00004124879,0.0016512007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994814,0.00013549069,0.00003558747,0.00011809472,0.0001485152,0.00008101628],"domain_scores_gemma":[0.9992749,0.0002827456,0.00014564632,0.00009737426,0.0001721779,0.000027135642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005562577,0.0007377111,0.00056874176,0.0011572372,0.00041184807,0.0008291317,0.00064842484,0.0007793056,0.0006704106],"category_scores_gemma":[0.00200686,0.00017099617,0.00030548402,0.0006889231,0.00043613603,0.000815793,0.00045292333,0.00058742764,0.00025088617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022327097,0.00017347798,0.0087529365,0.000119522694,0.00007236336,0.00019039113,0.00010830999,0.33533713,0.017098257,0.0051384633,0.0053159217,0.62746996],"study_design_scores_gemma":[0.000005927754,0.000040265466,0.0031474726,0.000012356045,0.000011043917,0.00008370239,0.000031717384,0.9836488,0.0064453753,0.0049235905,0.0016354815,0.000014219971],"about_ca_topic_score_codex":0.006388632,"about_ca_topic_score_gemma":0.005977873,"teacher_disagreement_score":0.006388632,"about_ca_system_score_codex":0.0009597935,"about_ca_system_score_gemma":0.00074996264,"threshold_uncertainty_score":0.012702882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101852044,0.00047167417,0.8929672,0.00035667655,0.00010604974,0.00010840448,0.00008212461,0.0016301656,0.0024256932],"genre_scores_gemma":[0.93948627,0.00013876113,0.058683164,0.00013490321,0.000026332851,0.00007409555,0.0001267481,0.00003967702,0.0012901312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991259,0.00020212171,0.00004594289,0.00028910604,0.00020775208,0.00012923779],"domain_scores_gemma":[0.99823666,0.0009313212,0.00024104358,0.00019960264,0.0002937768,0.00009750007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015162592,0.0008965527,0.0008753247,0.00062034756,0.00026033184,0.0007454441,0.0012005743,0.00069197797,0.00080496067],"category_scores_gemma":[0.0043817707,0.00033485974,0.0005938573,0.00033069425,0.0008440932,0.0012988707,0.0011439201,0.0015731346,0.00017213737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001705706,0.00014658306,0.0037239455,0.000057311783,0.00005558569,0.00008993531,0.00005648845,0.8991021,0.0047419122,0.0057737636,0.0009566838,0.085125126],"study_design_scores_gemma":[0.0000020196396,0.000018003462,0.00013406848,0.0000013352951,0.0000030186359,0.000009053693,0.0000017162607,0.9980996,0.0009202551,0.0007284574,0.00007985237,0.0000025911997],"about_ca_topic_score_codex":0.0034525194,"about_ca_topic_score_gemma":0.0018662286,"teacher_disagreement_score":0.0034525194,"about_ca_system_score_codex":0.001068236,"about_ca_system_score_gemma":0.0009430903,"threshold_uncertainty_score":0.008018792},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42514908,0.001407926,0.52439475,0.021595623,0.00037012054,0.000069360845,0.0002850069,0.000556549,0.026171599],"genre_scores_gemma":[0.98409015,0.000426163,0.011824766,0.00042391897,0.00008972049,0.000030822222,0.00003937871,0.00004766142,0.0030273667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990734,0.0004463411,0.000040084476,0.00017624997,0.0001410247,0.00012285271],"domain_scores_gemma":[0.9885805,0.0077404324,0.0013951785,0.0012746962,0.00058425224,0.00042484223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002606928,0.00044614667,0.0008364051,0.00047437134,0.0006308387,0.0029958782,0.0013484276,0.002485371,0.0044427807],"category_scores_gemma":[0.020330563,0.00041094626,0.0006202325,0.0002980309,0.0027562263,0.005970202,0.0011753114,0.0019388085,0.0005520694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025415255,0.000094844334,0.005575656,0.00011742444,0.00010021255,0.00041073805,0.00041791188,0.148289,0.002003121,0.822124,0.0031745704,0.017438352],"study_design_scores_gemma":[0.000047633122,0.000046251556,0.0007255288,0.00002212551,0.000020150848,0.0000997988,0.00004738655,0.58833766,0.0005667059,0.40885213,0.0012049412,0.000029764471],"about_ca_topic_score_codex":0.0011607037,"about_ca_topic_score_gemma":0.0006751543,"teacher_disagreement_score":0.0044427807,"about_ca_system_score_codex":0.0008040595,"about_ca_system_score_gemma":0.0006018127,"threshold_uncertainty_score":0.014862597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014532174,0.000090716574,0.98448086,0.00009558562,0.000010050257,0.00003995123,0.00004906143,0.0002474328,0.00045413518],"genre_scores_gemma":[0.4730966,0.00021328438,0.5239029,0.00012727919,0.00006813706,0.00025519374,0.00037522803,0.000116279036,0.0018450834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978638,0.0007015684,0.00007803579,0.0005546109,0.0006373564,0.00016461061],"domain_scores_gemma":[0.9950676,0.0026860826,0.0008094012,0.00046434585,0.0007700524,0.00020248852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025481137,0.0006683372,0.0009958664,0.0028753087,0.0012189315,0.0014324568,0.002353609,0.0013583539,0.0011283525],"category_scores_gemma":[0.009640206,0.0005883188,0.0010047762,0.0019966748,0.0014860344,0.0018979079,0.0023656243,0.0010231911,0.00038744122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010490058,0.000059398582,0.003984681,0.00012989293,0.00012683241,0.000157243,0.0002554244,0.8434999,0.0054668686,0.05360346,0.0018284285,0.09078303],"study_design_scores_gemma":[0.0000056138224,0.0000099635145,0.0002433505,0.0000052246896,0.000005231411,0.00002957773,0.000015733682,0.9808996,0.0007732195,0.017580396,0.0004239096,0.000008252848],"about_ca_topic_score_codex":0.005152806,"about_ca_topic_score_gemma":0.004863621,"teacher_disagreement_score":0.005152806,"about_ca_system_score_codex":0.0013533913,"about_ca_system_score_gemma":0.0012212144,"threshold_uncertainty_score":0.013475895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02172183,0.00052834733,0.9734655,0.00037802805,0.000084723215,0.000052540363,0.000018017778,0.00033955104,0.003411545],"genre_scores_gemma":[0.6081971,0.0008377951,0.38731548,0.00027477334,0.000129549,0.0001224187,0.00009999474,0.0004930619,0.0025298584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99456716,0.0024519137,0.0002461835,0.00068793714,0.0016245029,0.00042233415],"domain_scores_gemma":[0.9611819,0.032799583,0.0008476984,0.0022246426,0.0024237856,0.00052248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012383721,0.0012510694,0.0013818672,0.001093843,0.0013532354,0.0029006356,0.0013463994,0.0020331687,0.0033414678],"category_scores_gemma":[0.059517387,0.00056505774,0.0013586003,0.0008669164,0.0026311735,0.0043282006,0.0020212384,0.0038984574,0.00054098526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005200803,0.00010908401,0.001310724,0.00020809173,0.00011876435,0.00010655964,0.0002696397,0.8436583,0.0033807498,0.08923595,0.0011671465,0.05991491],"study_design_scores_gemma":[0.000014928134,0.000060415256,0.00013361608,0.000016239284,0.000020745932,0.00002556492,0.00002054299,0.9813477,0.0016236816,0.016350457,0.00037057852,0.000015582547],"about_ca_topic_score_codex":0.008918937,"about_ca_topic_score_gemma":0.0033439286,"teacher_disagreement_score":0.012383721,"about_ca_system_score_codex":0.0018731866,"about_ca_system_score_gemma":0.0034199012,"threshold_uncertainty_score":0.06549215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050106323,0.00013880293,0.99237365,0.000094231786,0.000020864296,0.00003234686,0.000019345702,0.00015930006,0.0021507682],"genre_scores_gemma":[0.3180457,0.00019475089,0.6763711,0.00016603511,0.000033390636,0.00026791712,0.00009901861,0.00011604037,0.0047060465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996979,0.00008768869,0.00001326024,0.000048405975,0.00012959041,0.000023245806],"domain_scores_gemma":[0.9995896,0.00023818496,0.000041368246,0.000026554671,0.000080389844,0.000023904275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086780026,0.00063630246,0.0007818662,0.0005084126,0.00032087349,0.0006927608,0.0008551922,0.0010141892,0.0023214875],"category_scores_gemma":[0.0014313366,0.00045817596,0.00051303994,0.00054676377,0.0005020239,0.0006579599,0.000782653,0.0007408282,0.00036352215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047512367,0.00004417929,0.00021884407,0.00007831724,0.000022106367,0.00003721504,0.000028589411,0.93707925,0.0025864318,0.006797021,0.00076809595,0.052292462],"study_design_scores_gemma":[0.00000787436,0.000014049176,0.000017041692,0.0000025549998,0.0000017670677,0.0000048150564,0.0000014220051,0.9986469,0.0002277795,0.00064491836,0.00042804948,0.0000027534127],"about_ca_topic_score_codex":0.0040908256,"about_ca_topic_score_gemma":0.004201751,"teacher_disagreement_score":0.0040908256,"about_ca_system_score_codex":0.0005160226,"about_ca_system_score_gemma":0.0012892865,"threshold_uncertainty_score":0.008134007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012005484,0.98147535,0.013858506,0.00032892625,0.00026606745,0.00003086452,0.00009029622,0.000121870915,0.002627517],"genre_scores_gemma":[0.0073033436,0.9809914,0.009061324,0.00022740464,0.00027573254,0.00003418773,0.00021270497,0.000025800005,0.0018680883],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960357,0.000037312573,0.00005490533,0.000097930024,0.0001818049,0.000024461036],"domain_scores_gemma":[0.99907035,0.0004984197,0.00009423944,0.000029849076,0.00028418712,0.00002306052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008159205,0.0013181644,0.0012177455,0.0027832664,0.0002073591,0.00096698647,0.0014059071,0.0012358722,0.0030474365],"category_scores_gemma":[0.0016132486,0.0006120609,0.0011249327,0.0024161818,0.00037576226,0.0017276182,0.000633506,0.0009512188,0.0018662837],"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.000025435555,0.00006244596,0.00039194367,0.00895948,0.00008492252,0.000070708855,0.00003698177,0.0022625702,0.0017196801,0.00197083,0.008407489,0.97600764],"study_design_scores_gemma":[0.000026832728,0.00046316904,0.00417964,0.010966903,0.0007649691,0.0023426746,0.00017446218,0.021621766,0.010843455,0.008304651,0.94013214,0.00017932683],"about_ca_topic_score_codex":0.0018099955,"about_ca_topic_score_gemma":0.0017352509,"teacher_disagreement_score":0.0030474365,"about_ca_system_score_codex":0.00039805347,"about_ca_system_score_gemma":0.0009178179,"threshold_uncertainty_score":0.010194719},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16908117,0.00020037047,0.8277574,0.00021763412,0.000023327622,0.00031289487,0.000066787645,0.0011820592,0.0011583235],"genre_scores_gemma":[0.45800632,0.000067216286,0.5407249,0.0001222531,0.000011521403,0.00041525462,0.00013821,0.00010757503,0.0004068025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945083,0.0033303134,0.00030583178,0.0009801243,0.0006789385,0.00019642609],"domain_scores_gemma":[0.9634437,0.030725347,0.0023132062,0.0012739056,0.001840494,0.0004032674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008623094,0.0009904305,0.0015330943,0.0029593261,0.0005245208,0.0015746416,0.0017228303,0.0018185249,0.0008716596],"category_scores_gemma":[0.048385378,0.0006407187,0.00088083907,0.0011418331,0.0011630629,0.001670212,0.0011289583,0.0015510714,0.0003227696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010105369,0.00076717464,0.03930184,0.00036445205,0.00036139952,0.00019094646,0.00071845914,0.58278173,0.016781313,0.011107572,0.0010930147,0.3455215],"study_design_scores_gemma":[0.000066069515,0.00012672112,0.0027301959,0.000029708464,0.000023959825,0.000052560245,0.000058328886,0.98901296,0.0032473046,0.0044084457,0.0002081631,0.00003557191],"about_ca_topic_score_codex":0.004946467,"about_ca_topic_score_gemma":0.0046075354,"teacher_disagreement_score":0.008623094,"about_ca_system_score_codex":0.0013647896,"about_ca_system_score_gemma":0.0019817906,"threshold_uncertainty_score":0.04560381},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060855825,0.0026834744,0.9098915,0.00074792886,0.00088666886,0.00030547086,0.0013430621,0.015532381,0.0077537387],"genre_scores_gemma":[0.6105275,0.0011472849,0.34396598,0.0012513483,0.00065345864,0.0006679209,0.007028749,0.0011510581,0.03360661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951255,0.00014611968,0.000017743816,0.00019184954,0.00007501052,0.000056600824],"domain_scores_gemma":[0.9994667,0.00025426745,0.000033185424,0.00009142139,0.00011760185,0.000036815894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011349272,0.0013680402,0.00092164084,0.0005636762,0.0004621177,0.0006755267,0.0019426107,0.001220847,0.004277906],"category_scores_gemma":[0.0027267132,0.00036092795,0.0011106842,0.00043704166,0.0006254099,0.0013576063,0.0014338121,0.0022296198,0.0024241428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011158059,0.00048765336,0.0016488325,0.00034854456,0.00028555762,0.00033943972,0.00035265996,0.17747231,0.034011394,0.005550208,0.03301105,0.7453765],"study_design_scores_gemma":[0.000047584046,0.00016830444,0.0004244725,0.000017594315,0.00004038228,0.00009125342,0.00004532113,0.9836053,0.008315894,0.0032414566,0.00398089,0.000021575022],"about_ca_topic_score_codex":0.00369346,"about_ca_topic_score_gemma":0.005884267,"teacher_disagreement_score":0.004277906,"about_ca_system_score_codex":0.0008161375,"about_ca_system_score_gemma":0.0007226748,"threshold_uncertainty_score":0.014311075},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032117858,0.00013524618,0.9928134,0.00024838978,0.000018003799,0.00014872526,0.00037576392,0.0023249108,0.00072378124],"genre_scores_gemma":[0.066256225,0.00028122254,0.9293428,0.00018350864,0.00006498098,0.00045933085,0.0016114393,0.00079010165,0.0010103792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9876193,0.004181041,0.0013240606,0.0023161601,0.0038821574,0.00067733834],"domain_scores_gemma":[0.9657966,0.02262109,0.0028668852,0.006137834,0.002054821,0.00052266853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012188534,0.003032574,0.0025458618,0.006483934,0.0029368165,0.008806733,0.006142401,0.0033168446,0.007016993],"category_scores_gemma":[0.049419276,0.0032369278,0.010973055,0.0045173797,0.003766378,0.026147494,0.008721623,0.0053396435,0.0014369629],"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.00044212435,0.00025602535,0.0052242447,0.0010027938,0.00057500496,0.000898767,0.002227411,0.27329656,0.003137265,0.5391248,0.010199442,0.1636156],"study_design_scores_gemma":[0.000043610915,0.000040559575,0.00013363137,0.00016088643,0.00012806535,0.00020480306,0.00026647022,0.60096866,0.0026007683,0.38678366,0.008614892,0.000054045737],"about_ca_topic_score_codex":0.014660411,"about_ca_topic_score_gemma":0.01905963,"teacher_disagreement_score":0.014660411,"about_ca_system_score_codex":0.0048072813,"about_ca_system_score_gemma":0.004812424,"threshold_uncertainty_score":0.06445992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2193923,0.00055773376,0.77066356,0.0011156782,0.00015369225,0.00013881508,0.0011801444,0.001141999,0.005656045],"genre_scores_gemma":[0.8689637,0.00011786736,0.1280959,0.00016648187,0.000021572201,0.0001036253,0.0012926058,0.00010815871,0.0011301204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937636,0.00032965626,0.000031262505,0.00012444366,0.00009861311,0.00003974876],"domain_scores_gemma":[0.9974451,0.001918466,0.00010799885,0.00017876561,0.00030057674,0.000049138278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002389469,0.00055668305,0.00031459267,0.00078110996,0.0003365507,0.00098684,0.0006744794,0.0010363632,0.0025308223],"category_scores_gemma":[0.009373001,0.00022964484,0.0005260399,0.00045971372,0.0007847748,0.000795465,0.0007967421,0.0011179349,0.0001772545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019279357,0.00004283294,0.0028657394,0.000107624306,0.000038901773,0.00015078617,0.00014982765,0.928835,0.0032143309,0.023102658,0.0020397918,0.039259735],"study_design_scores_gemma":[0.0000048401816,0.000008376758,0.00024716798,0.000008538424,0.0000015831018,0.00001332017,0.000012902831,0.99439347,0.0010908205,0.0039561116,0.00025840855,0.0000045347047],"about_ca_topic_score_codex":0.004813406,"about_ca_topic_score_gemma":0.0036450154,"teacher_disagreement_score":0.004813406,"about_ca_system_score_codex":0.00093619456,"about_ca_system_score_gemma":0.0005920087,"threshold_uncertainty_score":0.0126369},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051526586,0.0005366183,0.99101454,0.0010707019,0.00006179234,0.00012998207,0.00045732883,0.00018672043,0.0013897326],"genre_scores_gemma":[0.41385233,0.0022814677,0.5702114,0.0009350786,0.0005917845,0.0022292081,0.0018967325,0.00016843146,0.007833433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934418,0.0041002766,0.0003243266,0.001005665,0.0007725993,0.0003552618],"domain_scores_gemma":[0.9712052,0.024937933,0.0015266207,0.000750929,0.0011203983,0.0004589221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015914058,0.0018704319,0.003086728,0.0039068046,0.00086338446,0.002777674,0.0048109326,0.0033152057,0.007113941],"category_scores_gemma":[0.03808649,0.001208045,0.004139946,0.0024074845,0.0025141228,0.002296396,0.0033480313,0.0033318885,0.0006188331],"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.00009453631,0.00009748244,0.004131134,0.00021599024,0.0003326216,0.0002461044,0.00015409327,0.7710939,0.00024392737,0.19992523,0.0011036174,0.02236135],"study_design_scores_gemma":[0.000027556027,0.000044292963,0.00033884333,0.000038519443,0.00008330752,0.000045752087,0.000021872329,0.894126,0.00007998597,0.10374777,0.001426619,0.000019431402],"about_ca_topic_score_codex":0.01919862,"about_ca_topic_score_gemma":0.010666707,"teacher_disagreement_score":0.01919862,"about_ca_system_score_codex":0.0024743502,"about_ca_system_score_gemma":0.004277851,"threshold_uncertainty_score":0.08416253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001831908,0.9975237,0.00014244455,0.00030523638,0.0001390065,0.000005279038,0.000016058806,0.0000053041745,0.0016798194],"genre_scores_gemma":[0.0012315558,0.9982584,0.00012900398,0.00012343373,0.000073744246,0.000004052372,0.000013643316,0.0000015931671,0.0001645418],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992508,0.00016524203,0.000121122146,0.000121203724,0.00028772803,0.00005382236],"domain_scores_gemma":[0.9961927,0.0028010702,0.00031913628,0.00007290621,0.00053349475,0.00008080395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012336387,0.0009893416,0.0011833383,0.005104911,0.00059678085,0.0023487315,0.0008931422,0.0014874969,0.004124905],"category_scores_gemma":[0.0035147918,0.00044256976,0.00087451685,0.008724748,0.0009131661,0.0029489712,0.0009547868,0.0013047837,0.0010636016],"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.000043667776,0.00007022151,0.0005361574,0.087638274,0.00014800031,0.00019786281,0.00042427215,0.00070583366,0.0006285662,0.017280381,0.019919585,0.87240714],"study_design_scores_gemma":[0.000004909745,0.000072876275,0.001636612,0.045338288,0.00027225708,0.0007521999,0.0004911297,0.00015392077,0.00043028957,0.004110018,0.94670635,0.000031083055],"about_ca_topic_score_codex":0.0033835326,"about_ca_topic_score_gemma":0.005161912,"teacher_disagreement_score":0.005104911,"about_ca_system_score_codex":0.0013540623,"about_ca_system_score_gemma":0.0042588315,"threshold_uncertainty_score":0.0137991905},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33180696,0.00021804811,0.65889156,0.00054850493,0.00004570633,0.00014187064,0.00012726604,0.00034347008,0.007876679],"genre_scores_gemma":[0.8895392,0.00017412525,0.105875924,0.000071245966,0.000038442784,0.00012041087,0.00012342902,0.00004122641,0.004016045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826956,0.0005244628,0.00008155271,0.0004899016,0.0003269212,0.00030769658],"domain_scores_gemma":[0.9939865,0.0031994206,0.0009878777,0.00082043296,0.00031998876,0.0006858362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018476511,0.00055652525,0.0008036359,0.00061030115,0.0016494752,0.001507506,0.0017370111,0.0010393601,0.0025575892],"category_scores_gemma":[0.00808928,0.00045077986,0.00089514774,0.0004984059,0.0017031052,0.0034909258,0.0032886253,0.0011467629,0.00046390275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011538339,0.00015315137,0.0046911878,0.0002835252,0.00012429811,0.0019463392,0.0015454389,0.63242835,0.02566842,0.30569112,0.0017536158,0.024560763],"study_design_scores_gemma":[0.00008140017,0.00023646175,0.00064845476,0.000018837627,0.000041885116,0.00039616833,0.0004243755,0.9078639,0.006529411,0.07931367,0.0044066086,0.000038798848],"about_ca_topic_score_codex":0.0010766356,"about_ca_topic_score_gemma":0.00075999676,"teacher_disagreement_score":0.0025575892,"about_ca_system_score_codex":0.0007831018,"about_ca_system_score_gemma":0.0006404683,"threshold_uncertainty_score":0.009771466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12905341,0.0023563015,0.8345336,0.0006574927,0.00031675212,0.00021634778,0.0030428928,0.025708143,0.004115065],"genre_scores_gemma":[0.5464425,0.0010852515,0.42379582,0.00053860276,0.00016666498,0.00027888434,0.015644029,0.0011950702,0.01085324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994543,0.000073937714,0.000030563595,0.00024090876,0.000104535524,0.00009570323],"domain_scores_gemma":[0.99931276,0.00018246564,0.000088017536,0.00017687031,0.0001880659,0.00005180945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005453723,0.0019639716,0.0012794555,0.002370793,0.00049900706,0.0016134628,0.002259499,0.0017342451,0.0026206782],"category_scores_gemma":[0.002152283,0.00065031275,0.0015188623,0.0027384588,0.0007059066,0.0030174516,0.0008978042,0.0023446442,0.003299829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005322011,0.0003943247,0.0037394222,0.00022550118,0.00019460413,0.0001558944,0.00023005955,0.34681776,0.015474735,0.0068895253,0.025781488,0.59956455],"study_design_scores_gemma":[0.000011517853,0.00002690232,0.00026070085,0.000010084205,0.0000103235225,0.000025628642,0.000025016267,0.990935,0.0032533905,0.004299288,0.0011314569,0.000010563078],"about_ca_topic_score_codex":0.020006355,"about_ca_topic_score_gemma":0.021918166,"teacher_disagreement_score":0.020006355,"about_ca_system_score_codex":0.0018057413,"about_ca_system_score_gemma":0.00138217,"threshold_uncertainty_score":0.039779842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038287308,0.00039156186,0.9584854,0.00018645173,0.000035656478,0.00003271679,0.00028935962,0.00049339887,0.0017981663],"genre_scores_gemma":[0.9227826,0.00031908776,0.073730215,0.00009254634,0.000050890558,0.00011568039,0.0005434148,0.000085068605,0.0022803564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973935,0.00006268403,0.000013515336,0.00008347367,0.000060060163,0.00004093096],"domain_scores_gemma":[0.9996215,0.00022806964,0.000049094037,0.000027517783,0.000056744662,0.000017066768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051175547,0.00068171177,0.0006183862,0.00038373945,0.0003012751,0.00068494154,0.0009949043,0.0007702763,0.0014376615],"category_scores_gemma":[0.0013506764,0.00048838917,0.00083969755,0.00052564073,0.0003945348,0.00064960314,0.0006287609,0.0010297941,0.0002922623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012702368,0.000011850256,0.0004969805,0.000016762746,0.00001394751,0.0000119731585,0.0000107700225,0.98789227,0.00056067074,0.0017371413,0.00024781804,0.008987096],"study_design_scores_gemma":[6.287714e-7,0.0000024188007,0.00009880045,8.4873807e-7,0.000001518912,0.0000012516686,0.0000010355254,0.9992993,0.00007204198,0.00045501723,0.00006586992,0.000001351911],"about_ca_topic_score_codex":0.030769585,"about_ca_topic_score_gemma":0.030661916,"teacher_disagreement_score":0.030769585,"about_ca_system_score_codex":0.0008208878,"about_ca_system_score_gemma":0.0010776395,"threshold_uncertainty_score":0.06118095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09441085,0.0012046736,0.8750813,0.0019639507,0.0002501364,0.0004075185,0.00020501169,0.00256862,0.02390799],"genre_scores_gemma":[0.6090944,0.0012016229,0.38211998,0.00029684827,0.00028802693,0.00028479256,0.0002474907,0.0002060217,0.0062607485],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999108,0.00034044485,0.000039866653,0.000117132375,0.00032317452,0.00007133598],"domain_scores_gemma":[0.9973423,0.00150653,0.00028824556,0.00025618493,0.0005428134,0.000063938336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015130694,0.0010725652,0.0005468821,0.0016026908,0.00056262896,0.0018318432,0.00087478274,0.000929079,0.0034847986],"category_scores_gemma":[0.007896959,0.00026614906,0.0004810232,0.0009119318,0.00043871882,0.0035763308,0.001131496,0.0009424911,0.0013940823],"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.00021677015,0.00095840613,0.0038932748,0.00039602403,0.00014526374,0.00015107228,0.00017573374,0.22885652,0.02028952,0.02109976,0.006212983,0.7176047],"study_design_scores_gemma":[0.000013608784,0.00010293794,0.00054947374,0.00003167434,0.00002499737,0.000025810063,0.00007388958,0.97627705,0.005678312,0.013475892,0.0037297015,0.000016670587],"about_ca_topic_score_codex":0.0022917872,"about_ca_topic_score_gemma":0.0033127079,"teacher_disagreement_score":0.0034847986,"about_ca_system_score_codex":0.00089567626,"about_ca_system_score_gemma":0.00047524413,"threshold_uncertainty_score":0.011657774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038637014,0.000055008455,0.99545926,0.00003255912,0.000009697243,0.000022391367,0.000029667252,0.0003208442,0.00020684344],"genre_scores_gemma":[0.119728155,0.000134255,0.8777738,0.00013042618,0.00005122743,0.00023224209,0.0005362076,0.00026958212,0.0011441096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998207,0.0005522838,0.00011206562,0.00036138436,0.0006536007,0.00011361176],"domain_scores_gemma":[0.99232364,0.0048385924,0.00053112535,0.0010047377,0.0011701524,0.00013174614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033640089,0.00096467853,0.0013088288,0.0017887352,0.0007680656,0.0010486761,0.0022815121,0.0013591608,0.0019910878],"category_scores_gemma":[0.019039769,0.00085045665,0.0012943032,0.0016602033,0.0012011298,0.0020636183,0.0017816494,0.0021947422,0.00084755407],"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.0001706856,0.00011441598,0.0030961053,0.00013243266,0.00013385083,0.00012444328,0.0002930892,0.6693931,0.007726929,0.022985198,0.002605215,0.29322454],"study_design_scores_gemma":[0.000006933121,0.000013192849,0.00024181194,0.00000568241,0.0000043168857,0.000031030188,0.000009384753,0.9918731,0.001172787,0.0060703605,0.0005606153,0.000010756144],"about_ca_topic_score_codex":0.006674901,"about_ca_topic_score_gemma":0.0075739715,"teacher_disagreement_score":0.006674901,"about_ca_system_score_codex":0.0008401505,"about_ca_system_score_gemma":0.0018362383,"threshold_uncertainty_score":0.017790794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026876224,0.0002743319,0.96919817,0.00022344987,0.000020856567,0.000032143485,0.00002567203,0.00006859717,0.003280633],"genre_scores_gemma":[0.6646633,0.00032265563,0.33229035,0.00007487054,0.000031823987,0.000107953616,0.00006653595,0.000040143364,0.0024023796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950266,0.0001927139,0.000018378221,0.00008571468,0.00016287614,0.00003769416],"domain_scores_gemma":[0.9991067,0.00064862147,0.000058721333,0.000060251386,0.00009070512,0.000034963537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011565351,0.00042436225,0.0007475398,0.0005358901,0.000627525,0.0010618338,0.00071607676,0.0007865371,0.0017202107],"category_scores_gemma":[0.0024757157,0.0003016755,0.0006420139,0.00074920186,0.0016302195,0.0015599189,0.0011536959,0.0013981848,0.0001629075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009227691,0.00005875437,0.00022933607,0.000074812255,0.000022558008,0.000029473791,0.000098828314,0.7569024,0.0044526956,0.20100933,0.0004251775,0.03660434],"study_design_scores_gemma":[0.0000047370177,0.000013090419,0.000030316,0.0000036712024,0.0000033363872,0.0000054823845,0.000007202962,0.97779363,0.0006193246,0.021280037,0.00023444238,0.000004699401],"about_ca_topic_score_codex":0.0029876486,"about_ca_topic_score_gemma":0.0025694952,"teacher_disagreement_score":0.0029876486,"about_ca_system_score_codex":0.0013583248,"about_ca_system_score_gemma":0.0012401822,"threshold_uncertainty_score":0.009855449},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038388178,0.00020901544,0.955152,0.00016661621,0.000028738707,0.000040933057,0.00006578569,0.0001829464,0.005765804],"genre_scores_gemma":[0.8401995,0.0003238298,0.15410236,0.000104308725,0.000019019904,0.00028691342,0.00026498965,0.000057801426,0.004641318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976987,0.0001005431,0.000008315091,0.000035749952,0.000066003275,0.000019488698],"domain_scores_gemma":[0.99964166,0.0001947391,0.000042198102,0.000020938323,0.000087748755,0.000012767314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005734327,0.00058000465,0.00060672476,0.00041757544,0.00021448653,0.000484133,0.0005430513,0.0011339221,0.0011474774],"category_scores_gemma":[0.0011825125,0.00031508884,0.00051986624,0.0004520441,0.00051157456,0.0005516007,0.00043341352,0.00057205645,0.00019700988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005574479,0.0000047433773,0.000054569937,0.000007231283,0.0000028538525,0.000006463524,0.0000029382275,0.99705875,0.00027791082,0.00067395414,0.0000414032,0.0018635946],"study_design_scores_gemma":[9.231552e-7,0.000004008489,0.000016227137,8.3479057e-7,5.79614e-7,0.0000014830295,7.3154587e-7,0.999658,0.00006233158,0.00020697691,0.00004731768,5.4885544e-7],"about_ca_topic_score_codex":0.0034565066,"about_ca_topic_score_gemma":0.002997776,"teacher_disagreement_score":0.0034565066,"about_ca_system_score_codex":0.0005569148,"about_ca_system_score_gemma":0.0007392044,"threshold_uncertainty_score":0.006872773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32381198,0.0019408596,0.6632941,0.0005676422,0.00015916572,0.00027745948,0.00026938278,0.004544983,0.005134364],"genre_scores_gemma":[0.84494054,0.00034811455,0.14894122,0.00031846415,0.000051835756,0.00008653356,0.00048185556,0.00012411021,0.0047072484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954516,0.00007509972,0.000024694695,0.00014291327,0.00012792522,0.00008416321],"domain_scores_gemma":[0.9994149,0.00023006002,0.00012278798,0.000073000505,0.000118499425,0.00004060351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001009472,0.0014633344,0.0011397803,0.0016112607,0.00051162014,0.00084267725,0.0015087934,0.0015053857,0.0012439501],"category_scores_gemma":[0.0020773208,0.0004156786,0.00077945594,0.000553849,0.00069297187,0.0013120351,0.00095913804,0.00071018725,0.00039028563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085165136,0.00031098945,0.0056386786,0.00014083902,0.00021160688,0.00046087807,0.00012859398,0.55567497,0.010738475,0.0024102968,0.003752981,0.41968003],"study_design_scores_gemma":[0.000004585371,0.000037997554,0.0003695055,0.000004431487,0.00001068102,0.000039488186,0.000011885701,0.99647886,0.0024032684,0.0004601885,0.0001741885,0.0000049912337],"about_ca_topic_score_codex":0.009939036,"about_ca_topic_score_gemma":0.010214448,"teacher_disagreement_score":0.009939036,"about_ca_system_score_codex":0.0013046259,"about_ca_system_score_gemma":0.00079353777,"threshold_uncertainty_score":0.019762397},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2591918,0.0016305391,0.7340619,0.0002841268,0.00008256262,0.00014366613,0.00105351,0.0022064233,0.0013454937],"genre_scores_gemma":[0.75070983,0.00038195128,0.24409701,0.00021530305,0.00009527092,0.0002392075,0.0024009116,0.00007680741,0.001783755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972004,0.000047978887,0.000015822088,0.000109208755,0.000068907655,0.00003797354],"domain_scores_gemma":[0.9998467,0.000058961134,0.000027871702,0.000011078341,0.000043512337,0.000011870363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004902871,0.00072170375,0.0006653056,0.0010780806,0.00029435652,0.00033905392,0.00050744694,0.00041351415,0.0005540237],"category_scores_gemma":[0.00043071472,0.00018280272,0.0009913708,0.0006006586,0.0001660049,0.00029385963,0.00024042433,0.0003403437,0.0002557181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007060189,0.00047202717,0.032612473,0.00038129877,0.0005633927,0.0005140528,0.00013620095,0.18591678,0.1646221,0.0016431698,0.0036682102,0.60876435],"study_design_scores_gemma":[0.000039685438,0.00022899655,0.00978909,0.000012559211,0.000097606935,0.00021575867,0.000030955278,0.9735131,0.012992651,0.0011993763,0.0018531033,0.000027166161],"about_ca_topic_score_codex":0.0014036301,"about_ca_topic_score_gemma":0.001986525,"teacher_disagreement_score":0.0014036301,"about_ca_system_score_codex":0.0002442058,"about_ca_system_score_gemma":0.00042107588,"threshold_uncertainty_score":0.002790928},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022178972,0.00008155179,0.97693676,0.00004466305,0.0000071355526,0.000028361364,0.000070932336,0.0003168878,0.00033473817],"genre_scores_gemma":[0.667238,0.0001965448,0.33095658,0.000032347838,0.000022193342,0.00016322893,0.00030938507,0.0000654099,0.0010163699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994475,0.000109377834,0.000032745793,0.00015753623,0.00017646585,0.00007637689],"domain_scores_gemma":[0.99913824,0.00040051749,0.00016755296,0.00005297382,0.00019513765,0.00004560231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011544307,0.0007606986,0.0006165604,0.0021412289,0.0004960648,0.0010263328,0.0017022857,0.00094078295,0.00096376764],"category_scores_gemma":[0.0034353295,0.0005659876,0.00083506916,0.0012939101,0.00088090246,0.0010988802,0.0009236997,0.000871528,0.00023671763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021780083,0.00003872986,0.0033014908,0.000028741266,0.000024886685,0.00005254682,0.000052505748,0.9671038,0.0010866731,0.0049738283,0.00020211567,0.023112988],"study_design_scores_gemma":[0.0000020006107,0.000017178883,0.0005504637,0.0000048822685,0.0000042920556,0.00001751415,0.000011185455,0.99732554,0.0002849606,0.0015766689,0.00019601929,0.000009235647],"about_ca_topic_score_codex":0.027357774,"about_ca_topic_score_gemma":0.01809504,"teacher_disagreement_score":0.027357774,"about_ca_system_score_codex":0.0011392663,"about_ca_system_score_gemma":0.0015283178,"threshold_uncertainty_score":0.054397106},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033206355,0.37727275,0.55510867,0.0020247104,0.0012702757,0.0008477114,0.002890544,0.003083654,0.024295274],"genre_scores_gemma":[0.17533638,0.34997797,0.45111617,0.0010467335,0.0014106483,0.0006383164,0.00571098,0.00018938363,0.014573411],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984157,0.00020545321,0.00024957114,0.00038208117,0.0006565737,0.000090679045],"domain_scores_gemma":[0.99799204,0.0007762498,0.00012292202,0.00026168578,0.0007978633,0.000049336002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014811137,0.0011968367,0.001891411,0.0032088629,0.0007033897,0.001699159,0.0019459893,0.0012610753,0.0034852175],"category_scores_gemma":[0.0041440823,0.00068137236,0.00147644,0.008424214,0.00027827916,0.0023969633,0.0005756044,0.000888979,0.0027631656],"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.00015860763,0.00017457924,0.0047203037,0.0031966663,0.00032552553,0.00015142646,0.000096501506,0.009984577,0.002748696,0.0064374814,0.013954943,0.9580507],"study_design_scores_gemma":[0.00018856511,0.0012989675,0.02438027,0.002528709,0.0015260475,0.0051474352,0.0004048833,0.45419872,0.013779603,0.031229006,0.46490437,0.00041344613],"about_ca_topic_score_codex":0.00959451,"about_ca_topic_score_gemma":0.007342746,"teacher_disagreement_score":0.00959451,"about_ca_system_score_codex":0.0006347452,"about_ca_system_score_gemma":0.0013808346,"threshold_uncertainty_score":0.019077301},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05914241,0.00023737688,0.9353207,0.00025677797,0.000059211543,0.00013798234,0.00006660927,0.00036957397,0.00440938],"genre_scores_gemma":[0.8634378,0.00018784612,0.13231811,0.000054693137,0.000021325648,0.00019155325,0.00010346105,0.00004220196,0.003643074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920195,0.0002716125,0.000048548354,0.00013083428,0.0002655003,0.00008149431],"domain_scores_gemma":[0.99799263,0.0009008792,0.00021674509,0.00030889944,0.0004791652,0.00010162378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014906474,0.00039829282,0.0005852434,0.00044681213,0.0006496766,0.00077170314,0.0007790472,0.0007025781,0.00256427],"category_scores_gemma":[0.0042876177,0.00018623908,0.00022867841,0.0005243641,0.000773309,0.0013776487,0.0014588743,0.0008589137,0.00035763351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039486284,0.00008041405,0.0014025676,0.00016309529,0.000038642625,0.00011578286,0.00020246573,0.75840724,0.0100918785,0.06385884,0.001273107,0.16397116],"study_design_scores_gemma":[0.00002425944,0.000105714396,0.00011221742,0.0000075710104,0.000004505023,0.000031965006,0.000028230468,0.98360634,0.002635586,0.012306152,0.0011316004,0.000005895561],"about_ca_topic_score_codex":0.0020243968,"about_ca_topic_score_gemma":0.0022409663,"teacher_disagreement_score":0.00256427,"about_ca_system_score_codex":0.0007171538,"about_ca_system_score_gemma":0.0017085497,"threshold_uncertainty_score":0.00857836},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045195684,0.0008326151,0.9456241,0.0007730292,0.000077574514,0.00014153402,0.00009592283,0.0012117093,0.0060478733],"genre_scores_gemma":[0.74966973,0.0006660489,0.2402077,0.0005154219,0.00011231946,0.00041045534,0.00020977795,0.00023499595,0.007973455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99542505,0.001508897,0.00023057565,0.0007518567,0.0013937567,0.0006899201],"domain_scores_gemma":[0.98686814,0.005934943,0.0008504385,0.0047941958,0.0011483509,0.0004039517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003335583,0.00062408444,0.0011662102,0.00091177115,0.0012805754,0.002577944,0.0030593448,0.0018145709,0.0043180306],"category_scores_gemma":[0.016591217,0.00071216805,0.0008196087,0.002487016,0.003025724,0.008978824,0.006024173,0.0024654123,0.0012529494],"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.0012324535,0.00028977852,0.0055802846,0.0007709291,0.00013550313,0.00054448214,0.0014965174,0.088414975,0.03061151,0.5582793,0.007198459,0.3054459],"study_design_scores_gemma":[0.00013800092,0.0005648269,0.0010195225,0.000078879544,0.00006594763,0.0022413759,0.00047867984,0.6414569,0.0346099,0.30157536,0.017652266,0.000118216674],"about_ca_topic_score_codex":0.00048598036,"about_ca_topic_score_gemma":0.0003743723,"teacher_disagreement_score":0.0043180306,"about_ca_system_score_codex":0.001333554,"about_ca_system_score_gemma":0.0012167733,"threshold_uncertainty_score":0.017640471},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5226435,0.0018104308,0.45951644,0.0025352458,0.00035366774,0.0005095193,0.002256854,0.0015705373,0.008803747],"genre_scores_gemma":[0.9340128,0.0003935022,0.062143665,0.00018766613,0.00010915236,0.00016698567,0.0008982975,0.000012163044,0.0020757508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999605,0.00013630194,0.000042140055,0.00008355811,0.00008062679,0.000052306834],"domain_scores_gemma":[0.9988335,0.00076248264,0.00009460317,0.00003812804,0.00022703213,0.00004417332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011512066,0.0005676359,0.0005275541,0.0019870517,0.0003086725,0.00080661185,0.0006996905,0.00080426637,0.0016034388],"category_scores_gemma":[0.0031100651,0.00012349462,0.00065779185,0.00088582054,0.00014132063,0.0005556412,0.0003067173,0.0007753474,0.00066712877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038974814,0.0016368481,0.18835893,0.00020797204,0.0003498379,0.00036779192,0.00019312497,0.3844377,0.0029931613,0.0025159232,0.0052009406,0.41334793],"study_design_scores_gemma":[0.000010003044,0.00011557973,0.009601504,0.00002674713,0.00003571115,0.00007607611,0.000056399746,0.9874527,0.0006554091,0.0012655571,0.000691765,0.0000125329],"about_ca_topic_score_codex":0.005625758,"about_ca_topic_score_gemma":0.004275297,"teacher_disagreement_score":0.005625758,"about_ca_system_score_codex":0.00049434917,"about_ca_system_score_gemma":0.00085492834,"threshold_uncertainty_score":0.011186004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023932508,0.00023377665,0.99665797,0.000117249445,0.000022012728,0.000027827891,0.00004511876,0.00018031056,0.0003224663],"genre_scores_gemma":[0.1522181,0.0012183331,0.8424911,0.00026169323,0.00016287487,0.00029663174,0.00067167665,0.00023838077,0.0024411646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687374,0.00109397,0.00021818824,0.0007170736,0.0009345173,0.00016244898],"domain_scores_gemma":[0.9960841,0.001690257,0.0003839852,0.00094272575,0.00076494314,0.00013399836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004952439,0.001419466,0.0018860087,0.0020793106,0.00091630843,0.001891501,0.002104446,0.001162431,0.0025851843],"category_scores_gemma":[0.015267951,0.0005817519,0.0017575694,0.0025083132,0.0019048813,0.004774257,0.003731768,0.0025903338,0.0013144597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016438404,0.00012771,0.0034481883,0.00041691618,0.0002660275,0.00019536741,0.0005319421,0.20321804,0.009787908,0.22065969,0.009626382,0.55155736],"study_design_scores_gemma":[0.000009722121,0.00004919693,0.0005126145,0.000028145654,0.000026530466,0.000122005,0.000054035765,0.91367,0.0024151036,0.07985053,0.0032287147,0.00003335807],"about_ca_topic_score_codex":0.0029020677,"about_ca_topic_score_gemma":0.0024340055,"teacher_disagreement_score":0.004952439,"about_ca_system_score_codex":0.0008750653,"about_ca_system_score_gemma":0.0020749508,"threshold_uncertainty_score":0.026191354},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021107983,0.00024157875,0.97390944,0.00013736941,0.00009462318,0.00009470732,0.00021562123,0.0030256195,0.0011731393],"genre_scores_gemma":[0.29569638,0.0002868726,0.6959819,0.00024634067,0.000069983944,0.0002578149,0.0017118816,0.00035094,0.0053979363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997086,0.00003991459,0.00001679537,0.00010738078,0.00009091179,0.00003639658],"domain_scores_gemma":[0.9996038,0.00012023899,0.000043907225,0.000100271616,0.000107,0.000024826943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000374534,0.0009831701,0.00069317163,0.0009576953,0.00032021003,0.00050064456,0.0014073652,0.0008233599,0.0034981673],"category_scores_gemma":[0.0015650763,0.0002985801,0.0005729227,0.0011624941,0.0005921721,0.001175424,0.0010078436,0.0012448848,0.0013225733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016807187,0.00012256198,0.00075391424,0.00009414447,0.0000655078,0.00006819845,0.000044159227,0.20059484,0.021902867,0.0070661237,0.005293708,0.7638259],"study_design_scores_gemma":[0.000011256645,0.000044385783,0.0003124832,0.0000055154273,0.00000852951,0.00003880586,0.0000070184983,0.9895902,0.0046533076,0.0043018535,0.0010164728,0.000010198405],"about_ca_topic_score_codex":0.008442928,"about_ca_topic_score_gemma":0.012510125,"teacher_disagreement_score":0.008442928,"about_ca_system_score_codex":0.00072694256,"about_ca_system_score_gemma":0.00083465874,"threshold_uncertainty_score":0.016787589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07141282,0.0011786161,0.92125255,0.001411262,0.00011624195,0.00012679973,0.0006273406,0.00087257824,0.00300172],"genre_scores_gemma":[0.8989491,0.000709522,0.0913277,0.00034747072,0.00012844469,0.0005677551,0.0011286244,0.000043421976,0.006797923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996176,0.00012661317,0.000023616327,0.00011170431,0.00006284853,0.00005763908],"domain_scores_gemma":[0.9994948,0.0003004631,0.000053516946,0.000023142418,0.00011339245,0.000014644512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013117815,0.000587258,0.0007455621,0.0008703147,0.0004026533,0.000829356,0.0010752128,0.0010152376,0.001983608],"category_scores_gemma":[0.0019170903,0.00020693049,0.0008720563,0.0006166171,0.00034738125,0.00048182879,0.0005360924,0.0012679513,0.0006089685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016828536,0.00016684299,0.009783541,0.00009906931,0.00015352338,0.00018255814,0.00010819946,0.87199306,0.001940909,0.010516848,0.0030108497,0.10187625],"study_design_scores_gemma":[0.0000036511333,0.000014790264,0.0005843223,0.000005058458,0.000009789938,0.0000135601085,0.0000054379684,0.9969944,0.00014872321,0.001940413,0.0002757035,0.0000042166516],"about_ca_topic_score_codex":0.009661329,"about_ca_topic_score_gemma":0.0063869166,"teacher_disagreement_score":0.009661329,"about_ca_system_score_codex":0.00089156756,"about_ca_system_score_gemma":0.0011560968,"threshold_uncertainty_score":0.01921016},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028616488,0.00029946922,0.96128243,0.0001903533,0.00007297472,0.000079506506,0.00016365676,0.0015397657,0.007755402],"genre_scores_gemma":[0.2163966,0.00022301811,0.77713513,0.00007214277,0.000038436207,0.00020509645,0.00049410475,0.00024792447,0.0051874635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997557,0.000047606438,0.00001471981,0.000024977135,0.00012855073,0.00002832913],"domain_scores_gemma":[0.9995394,0.00012674752,0.000041685595,0.000107890795,0.00015297259,0.000031308606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032157692,0.00053074246,0.00046873,0.00058442145,0.00048297035,0.0007055787,0.001022338,0.00052927964,0.0046755983],"category_scores_gemma":[0.0017167897,0.00028475103,0.00039521352,0.0011752397,0.00043919747,0.0007515742,0.0011962617,0.00068554754,0.0015206113],"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.0003251229,0.00019172965,0.0023269607,0.00024002104,0.00007928112,0.00027608027,0.00031737666,0.5141839,0.0210595,0.1320386,0.016810374,0.31215116],"study_design_scores_gemma":[0.000030839932,0.00002373782,0.00010292926,0.000006217566,0.000002620304,0.000030878193,0.000018250981,0.98386616,0.0020801255,0.01106548,0.0027678702,0.0000049314244],"about_ca_topic_score_codex":0.004320608,"about_ca_topic_score_gemma":0.00895718,"teacher_disagreement_score":0.0046755983,"about_ca_system_score_codex":0.00050436525,"about_ca_system_score_gemma":0.0011855452,"threshold_uncertainty_score":0.01564145},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32121027,0.0007836991,0.6722403,0.0013513847,0.00007307774,0.00065577944,0.0017209521,0.0006649666,0.0012995781],"genre_scores_gemma":[0.88272715,0.00043719204,0.11304765,0.000114716546,0.00005195023,0.0006680101,0.0013410355,0.00009832722,0.0015140529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97786486,0.017669756,0.00074949354,0.0022480527,0.00090875564,0.0005589849],"domain_scores_gemma":[0.8211184,0.16723566,0.0057593137,0.0033211096,0.0017320779,0.00083346094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03242116,0.0015283717,0.0018104472,0.0036099863,0.000594578,0.0023825795,0.001859178,0.0013780128,0.0048467526],"category_scores_gemma":[0.08479497,0.0006783841,0.0035698477,0.0031114419,0.0010954373,0.0019875064,0.0020346611,0.0026133421,0.0005965047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016702648,0.00070354674,0.2086895,0.00027532663,0.0027073803,0.0003494667,0.0003850452,0.68448406,0.00061060005,0.011880332,0.0012433085,0.087001175],"study_design_scores_gemma":[0.000046200144,0.00041021407,0.010163392,0.000036494657,0.0003016057,0.0001022912,0.00008864013,0.98150325,0.0002503224,0.0065636537,0.00051108596,0.000022803213],"about_ca_topic_score_codex":0.009530057,"about_ca_topic_score_gemma":0.003430812,"teacher_disagreement_score":0.03242116,"about_ca_system_score_codex":0.0014517308,"about_ca_system_score_gemma":0.00289226,"threshold_uncertainty_score":0.17146152},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041373363,0.15611552,0.66570884,0.04809986,0.0058383704,0.00022595176,0.00076933904,0.001168583,0.1179363],"genre_scores_gemma":[0.23010418,0.14626642,0.55091727,0.008231066,0.006136224,0.00063209696,0.0021853552,0.00036041156,0.055166993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986141,0.0005918812,0.000083047526,0.0001855277,0.00046867854,0.00005678216],"domain_scores_gemma":[0.99787664,0.0012856226,0.000102488644,0.00027608118,0.00039305844,0.000066097666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020390365,0.00083001854,0.00075027713,0.001227795,0.0005894672,0.0036784231,0.001148511,0.0019697177,0.008052647],"category_scores_gemma":[0.008110319,0.00024281692,0.0004989749,0.0016677609,0.0016058352,0.0028822182,0.0017399961,0.0027825995,0.004581365],"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.00005298043,0.00005745445,0.0007192449,0.00089074956,0.00012825833,0.00009936759,0.00014623233,0.018579742,0.00064301066,0.5566331,0.07393388,0.34811595],"study_design_scores_gemma":[0.000019898149,0.00003355554,0.0003096256,0.00039450976,0.000026846152,0.00015232836,0.000085284024,0.043050308,0.0004129692,0.744099,0.21139467,0.00002099746],"about_ca_topic_score_codex":0.0012099653,"about_ca_topic_score_gemma":0.0008561552,"teacher_disagreement_score":0.008052647,"about_ca_system_score_codex":0.00095389015,"about_ca_system_score_gemma":0.0017288515,"threshold_uncertainty_score":0.026938796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.206271,0.00044242025,0.78655845,0.00046233667,0.000118091135,0.0000994703,0.00015973633,0.00451123,0.0013772659],"genre_scores_gemma":[0.79062283,0.000068075125,0.20677714,0.0002735655,0.000042982294,0.00006573811,0.00041435464,0.00010899247,0.0016262596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993773,0.00015556274,0.00004221745,0.00017434584,0.00017033164,0.00008030672],"domain_scores_gemma":[0.9986192,0.0005761521,0.00013610366,0.0002575756,0.00031720765,0.00009370249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024205293,0.00069343025,0.0008076883,0.0005547654,0.0004071244,0.0006539567,0.0014822369,0.00090876024,0.0010151739],"category_scores_gemma":[0.004512881,0.00021692367,0.00053861184,0.00039558177,0.00052175886,0.0011211669,0.0010921214,0.0015748154,0.0003247896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011226495,0.000658545,0.015880039,0.00010200207,0.00017826943,0.0002583739,0.0002723113,0.39063722,0.033618387,0.0089654345,0.0048809876,0.54342574],"study_design_scores_gemma":[0.000007730729,0.000041176896,0.00034396528,0.0000022884965,0.0000056819695,0.000027422453,0.000007756628,0.9934907,0.004784794,0.0009423512,0.00034158857,0.0000045720435],"about_ca_topic_score_codex":0.0055487906,"about_ca_topic_score_gemma":0.0065903277,"teacher_disagreement_score":0.0055487906,"about_ca_system_score_codex":0.00080976397,"about_ca_system_score_gemma":0.0010744311,"threshold_uncertainty_score":0.012801111},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18748713,0.0024676109,0.8024033,0.0010132677,0.00023242696,0.000273944,0.0005801259,0.0032228597,0.0023194004],"genre_scores_gemma":[0.665117,0.0013445434,0.32935703,0.00056049414,0.0001360251,0.00021993919,0.0010048622,0.0008431685,0.0014169045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762625,0.00058799714,0.00029180956,0.0005366549,0.0008531077,0.00010421881],"domain_scores_gemma":[0.9856835,0.009376064,0.0015105496,0.0014188014,0.0018182066,0.00019287223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037200048,0.0007675721,0.0010128765,0.0010493561,0.0007030097,0.0025551952,0.0009611744,0.001847085,0.0013471043],"category_scores_gemma":[0.02599908,0.00042100198,0.00039044674,0.00094799825,0.0012039692,0.0012426109,0.0010796953,0.0009860717,0.0009716844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016433693,0.0001509021,0.02903768,0.0015098249,0.0002145369,0.0017595472,0.0015536719,0.05127202,0.21377543,0.0032590404,0.005200659,0.69062334],"study_design_scores_gemma":[0.00010834717,0.0009942919,0.08841413,0.00063373224,0.00024135935,0.0056934794,0.0012707936,0.6376995,0.22684473,0.01464957,0.023236979,0.00021305049],"about_ca_topic_score_codex":0.0026144648,"about_ca_topic_score_gemma":0.0054054926,"teacher_disagreement_score":0.0037200048,"about_ca_system_score_codex":0.00031889396,"about_ca_system_score_gemma":0.0011756367,"threshold_uncertainty_score":0.019673467},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9099291,0.00007556262,0.08548952,0.00013596668,0.000051278334,0.000100468606,0.00017827611,0.0010472224,0.0029925043],"genre_scores_gemma":[0.9813105,0.000028107022,0.017379442,0.00002655395,0.0000025376708,0.000033234344,0.00017624546,0.00001914854,0.0010241586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990165,0.000009915578,0.0000041754565,0.000037966965,0.000021266564,0.000025050587],"domain_scores_gemma":[0.9997522,0.00009500742,0.00002118574,0.000029373068,0.00006943504,0.00003268164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021029996,0.00053722877,0.00028917548,0.00025246604,0.00030966933,0.00048365013,0.00070576736,0.00084985927,0.001835161],"category_scores_gemma":[0.0008511202,0.00023547189,0.000394623,0.00012133009,0.00025682396,0.0005593027,0.00037609792,0.0005456094,0.00028659878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000244088,0.00019793918,0.0024993883,0.00005239302,0.000037698755,0.0001085117,0.000054491553,0.96285796,0.012102458,0.0006751869,0.00027301023,0.020896964],"study_design_scores_gemma":[0.00000908839,0.00006139501,0.00029446735,0.0000017671654,0.0000035783346,0.00000627743,0.000009705054,0.9978567,0.0016100402,0.00009001729,0.000054380253,0.000002561924],"about_ca_topic_score_codex":0.043653384,"about_ca_topic_score_gemma":0.025170503,"teacher_disagreement_score":0.043653384,"about_ca_system_score_codex":0.000488861,"about_ca_system_score_gemma":0.0011423212,"threshold_uncertainty_score":0.08679855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17749108,0.00067953364,0.7982067,0.00032236712,0.00013298145,0.00017627921,0.000086113985,0.0007603567,0.022144558],"genre_scores_gemma":[0.9797151,0.00013007416,0.018244328,0.000039269387,0.000014647122,0.00008412166,0.000031033873,0.000010853038,0.0017306327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998853,0.000018173107,0.0000072913244,0.000031014188,0.000041748885,0.000016491158],"domain_scores_gemma":[0.9998586,0.000042989188,0.000029193321,0.000009849914,0.000048884016,0.000010500068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030004713,0.00083856937,0.00052572537,0.00022836817,0.0003980015,0.00079059415,0.00057994603,0.00045359865,0.00066002744],"category_scores_gemma":[0.0004998544,0.00021852212,0.00035530515,0.0002497518,0.0003446458,0.00023402425,0.00041411276,0.00044145677,0.00011980449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009273644,0.00005010519,0.0005886196,0.00008825105,0.000033648048,0.00007408754,0.000052344094,0.9654264,0.005836956,0.0012472763,0.00062218687,0.02588746],"study_design_scores_gemma":[0.000009547737,0.000049894676,0.00015053316,0.0000048517263,0.000010093733,0.000008007021,0.0000092332675,0.9984388,0.0008893039,0.00019985261,0.00022655923,0.0000032003734],"about_ca_topic_score_codex":0.008305035,"about_ca_topic_score_gemma":0.0051644156,"teacher_disagreement_score":0.008305035,"about_ca_system_score_codex":0.00045646075,"about_ca_system_score_gemma":0.0006692264,"threshold_uncertainty_score":0.016513407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021120291,0.00009240451,0.9772149,0.00023827472,0.000011260824,0.000056385798,0.00007646188,0.0007478052,0.00044230424],"genre_scores_gemma":[0.40572748,0.0001680694,0.59185076,0.00017387529,0.00003608469,0.00025131495,0.00053178956,0.0002455121,0.001015168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971554,0.0009299079,0.00022117519,0.000609941,0.0009503436,0.00013308412],"domain_scores_gemma":[0.9809294,0.013153464,0.001329653,0.0017741602,0.0025258237,0.00028746497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007999206,0.001098743,0.0009874329,0.0015686324,0.0004546222,0.0018874994,0.0017260062,0.0013290182,0.0013482345],"category_scores_gemma":[0.035001628,0.0006711934,0.0010018516,0.0008317117,0.00090160477,0.0023196496,0.0015688468,0.0022074087,0.00047391217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021492211,0.00018117737,0.0053520035,0.00014270049,0.00013961036,0.00006510577,0.00011982186,0.81020516,0.011757341,0.017074412,0.0012436503,0.15350413],"study_design_scores_gemma":[0.000004025148,0.000016748434,0.00027888807,0.0000044908825,0.0000038273165,0.000008003824,0.0000057892134,0.9930529,0.0021580416,0.004285453,0.00017658058,0.0000052238324],"about_ca_topic_score_codex":0.0053894194,"about_ca_topic_score_gemma":0.00742516,"teacher_disagreement_score":0.007999206,"about_ca_system_score_codex":0.0014717017,"about_ca_system_score_gemma":0.0021367802,"threshold_uncertainty_score":0.042304397},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021598618,0.00015170903,0.97050834,0.00016192012,0.000055511566,0.0001082742,0.0006461813,0.0044589974,0.0023105459],"genre_scores_gemma":[0.14595051,0.00011238912,0.84784824,0.00015478817,0.000037185026,0.00030890582,0.0023492093,0.0015093344,0.0017294228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859565,0.00047485353,0.00009295531,0.0003450565,0.00037090472,0.00012049105],"domain_scores_gemma":[0.9959978,0.002412858,0.0002536035,0.0009780452,0.00025694206,0.000100724326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032845123,0.0010883217,0.0011525118,0.001815015,0.0011663829,0.0018184036,0.0025946763,0.0013965413,0.007783327],"category_scores_gemma":[0.011765063,0.00078352576,0.0019148883,0.0014755003,0.0012621208,0.002767109,0.003840564,0.0018856432,0.0012893289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005482865,0.00019593899,0.006152678,0.00064819935,0.00042940857,0.00052059203,0.0009984253,0.41294685,0.013527981,0.1422785,0.011688387,0.41006473],"study_design_scores_gemma":[0.00010047267,0.00010874352,0.00081910286,0.000071773364,0.00006550775,0.00030422898,0.00016362974,0.8379099,0.010672366,0.13572814,0.014004393,0.00005175699],"about_ca_topic_score_codex":0.00089283806,"about_ca_topic_score_gemma":0.002305565,"teacher_disagreement_score":0.007783327,"about_ca_system_score_codex":0.00080901163,"about_ca_system_score_gemma":0.0014672637,"threshold_uncertainty_score":0.026037812},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10554036,0.0051405146,0.856071,0.0007069141,0.0006514535,0.00028794687,0.0018300685,0.024408007,0.005363803],"genre_scores_gemma":[0.19486833,0.0014822397,0.79180497,0.00047785993,0.000110450535,0.00050756254,0.0052575828,0.003927445,0.001563545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953915,0.0017799708,0.00033706584,0.0015729865,0.00065128156,0.00026716894],"domain_scores_gemma":[0.9942134,0.0031487485,0.0007224358,0.00092611887,0.00075661764,0.00023258824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067373808,0.0032794976,0.0033371372,0.0038347743,0.0029587792,0.0031731215,0.0035651454,0.0028192822,0.0044868807],"category_scores_gemma":[0.017586611,0.0015389945,0.004671896,0.0035938774,0.0013140116,0.00500959,0.00263441,0.0058093583,0.0038231486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020392144,0.0009251432,0.03217995,0.00361722,0.0033246223,0.0031838922,0.002770018,0.30896142,0.14351794,0.058602862,0.034477748,0.40639997],"study_design_scores_gemma":[0.0001511727,0.00045311716,0.0056790872,0.00023307528,0.0006419257,0.0012947225,0.00028554857,0.8644546,0.035409268,0.046065725,0.04506064,0.00027106502],"about_ca_topic_score_codex":0.0029494928,"about_ca_topic_score_gemma":0.005497084,"teacher_disagreement_score":0.0067373808,"about_ca_system_score_codex":0.0014076829,"about_ca_system_score_gemma":0.0017766022,"threshold_uncertainty_score":0.03563112},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2342279,0.0008657248,0.75592124,0.00056511955,0.00017441495,0.000109831584,0.00037667053,0.0026217303,0.0051373304],"genre_scores_gemma":[0.91655755,0.0002734751,0.077408396,0.00027694402,0.00004799187,0.000044882858,0.00078676414,0.0000775706,0.0045264983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999726,0.000051584804,0.000009416481,0.00008152049,0.00007351241,0.000057967944],"domain_scores_gemma":[0.99967384,0.00010912261,0.000063679254,0.000048091006,0.00008049228,0.00002490901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005954709,0.00079182006,0.00038168125,0.00064295967,0.00018631671,0.00039238972,0.00085045665,0.00055911083,0.0006717351],"category_scores_gemma":[0.0011965054,0.00027219093,0.00043257436,0.00024306963,0.0004720062,0.00048319044,0.00085597043,0.0009196597,0.00033689465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003029943,0.00016969166,0.013845044,0.00009863218,0.00013336423,0.0002186125,0.00012246502,0.6779203,0.024303082,0.004256784,0.0033672394,0.27526188],"study_design_scores_gemma":[0.0000034498057,0.00004132834,0.0013085312,0.000011277517,0.000012688229,0.000046194004,0.000013369043,0.9924941,0.0044236486,0.0009586534,0.0006799449,0.0000068100035],"about_ca_topic_score_codex":0.0053533292,"about_ca_topic_score_gemma":0.007185381,"teacher_disagreement_score":0.0053533292,"about_ca_system_score_codex":0.00050804875,"about_ca_system_score_gemma":0.0007181673,"threshold_uncertainty_score":0.010644317},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03129766,0.0019060124,0.9435245,0.0011108594,0.00018271814,0.00018289055,0.0006227165,0.00030752094,0.020865299],"genre_scores_gemma":[0.49630696,0.0048517026,0.48308665,0.00092434726,0.0006060549,0.0005600742,0.0018447469,0.00037856278,0.011440948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970504,0.0010216681,0.00014765466,0.0005668884,0.0007662024,0.00044720288],"domain_scores_gemma":[0.9933924,0.004174684,0.00075626327,0.0008035147,0.0005853044,0.00028772373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028237,0.0016794221,0.0016446523,0.0015628954,0.0011021433,0.0031883277,0.002365333,0.001893061,0.0073541],"category_scores_gemma":[0.0129353255,0.0010281383,0.0013061134,0.0056744474,0.0015916828,0.0069697993,0.00266422,0.004407792,0.0009726297],"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.00013854561,0.00028613347,0.00095778384,0.0005781378,0.00006803847,0.00020969017,0.00016566057,0.6655675,0.0014345009,0.24940088,0.008642988,0.07255011],"study_design_scores_gemma":[0.000020541685,0.000056889687,0.0003490407,0.00006499441,0.000015427415,0.00018508741,0.00013814382,0.8089582,0.00071948057,0.18373676,0.0057269945,0.000028405222],"about_ca_topic_score_codex":0.005585707,"about_ca_topic_score_gemma":0.0042928667,"teacher_disagreement_score":0.0073541,"about_ca_system_score_codex":0.0014895344,"about_ca_system_score_gemma":0.0016729063,"threshold_uncertainty_score":0.024601936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7189797,0.002882903,0.2609695,0.004811154,0.00053733017,0.00013664135,0.00096798415,0.0009103557,0.009804552],"genre_scores_gemma":[0.96405315,0.00049094216,0.03364494,0.00012262106,0.00022310423,0.000027265174,0.00031322418,0.00001809161,0.0011067672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942565,0.00023450902,0.000050931096,0.000108052736,0.00013561136,0.00004530549],"domain_scores_gemma":[0.9939365,0.0046508415,0.00050186954,0.00035400287,0.00045980496,0.000096944525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026919728,0.00072597025,0.0003762998,0.0011890216,0.00030444693,0.0014395143,0.0005254068,0.0007713943,0.0009615215],"category_scores_gemma":[0.009702935,0.0002629105,0.00039102786,0.00093653845,0.0003098486,0.0020616003,0.00055966474,0.0010656163,0.00046397792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006699435,0.00056727865,0.18921809,0.00037157623,0.00051492546,0.00035806932,0.00046460587,0.25427106,0.012219957,0.0090362495,0.0040661553,0.52824205],"study_design_scores_gemma":[0.0000089045225,0.000064497755,0.011345258,0.000036488666,0.000036409587,0.00003096782,0.00009503294,0.9805188,0.0025230348,0.004383528,0.00094427844,0.000012801936],"about_ca_topic_score_codex":0.0048764334,"about_ca_topic_score_gemma":0.0077747847,"teacher_disagreement_score":0.0048764334,"about_ca_system_score_codex":0.00038472514,"about_ca_system_score_gemma":0.00043405147,"threshold_uncertainty_score":0.014236689},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7047033,0.010242171,0.21973728,0.0020833628,0.0022753845,0.00054073706,0.009522965,0.025861615,0.025033241],"genre_scores_gemma":[0.9042309,0.00131535,0.064438015,0.00069315924,0.00012271764,0.00015361971,0.017856237,0.0006112554,0.010578769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995029,0.000073629366,0.00003918673,0.00018014312,0.00010192044,0.00010223332],"domain_scores_gemma":[0.99965787,0.0001078686,0.000025837433,0.000092242815,0.000098886725,0.000017217399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013298937,0.0018382951,0.00072773616,0.001403298,0.00034721039,0.0009622909,0.00096769194,0.00086952146,0.002280478],"category_scores_gemma":[0.0031046693,0.00017271757,0.0008665948,0.00085942494,0.00031749214,0.0010796974,0.0006576756,0.0011689167,0.001643663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009591388,0.00054064725,0.010020167,0.00037024356,0.00041092592,0.00024523,0.000120798286,0.15134929,0.026641367,0.0016263088,0.045975473,0.76174045],"study_design_scores_gemma":[0.000080256534,0.00035347024,0.012632666,0.00011104338,0.00013462428,0.00024261946,0.00015485246,0.9418309,0.03058497,0.004172455,0.009646314,0.00005575555],"about_ca_topic_score_codex":0.012847694,"about_ca_topic_score_gemma":0.014533072,"teacher_disagreement_score":0.012847694,"about_ca_system_score_codex":0.0009548026,"about_ca_system_score_gemma":0.00056092057,"threshold_uncertainty_score":0.025545835},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21909271,0.00084017956,0.77470624,0.0008982323,0.00005658403,0.00024270933,0.00021404402,0.0004867632,0.00346253],"genre_scores_gemma":[0.92865354,0.00030407234,0.0694521,0.00009164216,0.000062292995,0.000134044,0.00013562279,0.000110361216,0.0010563028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968945,0.0008973683,0.00016693244,0.00067872636,0.00068021356,0.0006822367],"domain_scores_gemma":[0.9880679,0.008450327,0.0011181127,0.0009758047,0.00080964615,0.0005780663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032306106,0.0011351812,0.001963251,0.0009806808,0.0009946915,0.0018265628,0.0031012178,0.0017282737,0.0016537745],"category_scores_gemma":[0.01984547,0.0005725299,0.00053860515,0.0016710686,0.0014505528,0.004645414,0.0021801519,0.0012376728,0.00024108932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042657863,0.00018694956,0.0023200277,0.00026274004,0.00008955339,0.00019084092,0.00020901267,0.92777586,0.015921105,0.021490468,0.001420698,0.029706238],"study_design_scores_gemma":[0.000018334265,0.00022864752,0.00077981595,0.000009292045,0.00003864872,0.0001639507,0.00013295517,0.985488,0.0029118173,0.009503927,0.0007084146,0.000016058184],"about_ca_topic_score_codex":0.0032752776,"about_ca_topic_score_gemma":0.002439855,"teacher_disagreement_score":0.0032752776,"about_ca_system_score_codex":0.0018175868,"about_ca_system_score_gemma":0.0015756434,"threshold_uncertainty_score":0.017085314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13577706,0.0006096253,0.8565748,0.00022967109,0.00008989744,0.00016887902,0.0005455068,0.0043788785,0.0016257806],"genre_scores_gemma":[0.688941,0.0002589988,0.30317953,0.00043729832,0.00005088397,0.00027503274,0.0027594361,0.00031897298,0.0037787927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959904,0.000090782705,0.000016912736,0.00019427671,0.0000464709,0.00005250944],"domain_scores_gemma":[0.9991291,0.00040314655,0.00009189032,0.00013888381,0.00019011556,0.00004682787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011452804,0.001058876,0.0006224354,0.00066020613,0.00026530187,0.0006187128,0.0015038871,0.0012447359,0.0007076528],"category_scores_gemma":[0.0025498825,0.00050065573,0.00083599275,0.0005836847,0.0005967475,0.0009961695,0.00085117295,0.0013238153,0.00047275098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002072955,0.00018317612,0.0021002057,0.00009932167,0.0000968881,0.00013412026,0.000104374085,0.7866964,0.020671636,0.001343808,0.003187673,0.18517517],"study_design_scores_gemma":[0.0000047633525,0.000019903786,0.00025610707,0.0000042591537,0.000004512519,0.000011781767,0.000008699285,0.9959416,0.0029406287,0.00053730974,0.00026544763,0.000004874052],"about_ca_topic_score_codex":0.007982933,"about_ca_topic_score_gemma":0.010360972,"teacher_disagreement_score":0.007982933,"about_ca_system_score_codex":0.00093105744,"about_ca_system_score_gemma":0.0010319484,"threshold_uncertainty_score":0.015872955},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009227066,0.000036036425,0.9881787,0.000041954427,0.000014637062,0.000018276362,0.000007770364,0.00018590703,0.0022897355],"genre_scores_gemma":[0.6667202,0.00014466676,0.3300098,0.00006225055,0.00003251014,0.00010256892,0.000041742893,0.00016039026,0.0027257935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981564,0.00004012857,0.000012221656,0.000041353374,0.00006952367,0.000021186559],"domain_scores_gemma":[0.99959093,0.00020552562,0.000056766905,0.00007032469,0.00004901366,0.000027516731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041546588,0.00044720116,0.00033269243,0.0004926926,0.0002706081,0.00093843695,0.00095656636,0.0004997608,0.0033773652],"category_scores_gemma":[0.0016919095,0.00024231762,0.000490677,0.00019772611,0.0010448975,0.0012471136,0.0010556963,0.0006174342,0.0004597744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012760292,0.00006466916,0.0009827917,0.00012231097,0.00003858086,0.00013378692,0.00026276623,0.57448167,0.03257565,0.24919003,0.0007182023,0.14130197],"study_design_scores_gemma":[0.0000077316145,0.00006092415,0.00015522937,0.000009334347,0.000006656029,0.000057672478,0.000027725813,0.9637126,0.0038503504,0.030926747,0.0011713043,0.000013726673],"about_ca_topic_score_codex":0.0009149776,"about_ca_topic_score_gemma":0.00085452275,"teacher_disagreement_score":0.0033773652,"about_ca_system_score_codex":0.0004944352,"about_ca_system_score_gemma":0.00057590817,"threshold_uncertainty_score":0.011298478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018426365,0.00007581691,0.9959144,0.000037638765,0.000025407064,0.000048704373,0.000012905545,0.00044237808,0.0016000693],"genre_scores_gemma":[0.0328158,0.00013290076,0.9643966,0.0000598159,0.000021075113,0.00021905176,0.00007966349,0.00019786844,0.0020771776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989606,0.00039089294,0.00003415151,0.00009217874,0.00045801935,0.00006415468],"domain_scores_gemma":[0.9989091,0.0006245158,0.000065730324,0.00012654516,0.00023230644,0.000041741787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015144316,0.0010974031,0.0010257185,0.0006968131,0.00042383588,0.0008775665,0.0015809836,0.0010201975,0.004680016],"category_scores_gemma":[0.0031712777,0.00054188736,0.0008635219,0.00076641876,0.0007011517,0.001054785,0.0013426547,0.0026298587,0.001868762],"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.00024402159,0.00037733885,0.00068071723,0.00051041844,0.00008439839,0.000204162,0.00015774342,0.63125455,0.017094335,0.04249002,0.004634293,0.302268],"study_design_scores_gemma":[0.00003670581,0.00006280452,0.00006284659,0.000024043555,0.0000064159112,0.000054614615,0.000010161834,0.9895271,0.0027885719,0.003826933,0.0035890108,0.000010785448],"about_ca_topic_score_codex":0.0021266292,"about_ca_topic_score_gemma":0.0023724164,"teacher_disagreement_score":0.004680016,"about_ca_system_score_codex":0.00038680388,"about_ca_system_score_gemma":0.0013778041,"threshold_uncertainty_score":0.015656173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05146856,0.0011377773,0.9347903,0.001170545,0.0001307772,0.000089698005,0.00019151512,0.00058736786,0.010433482],"genre_scores_gemma":[0.8708736,0.0011938962,0.12177992,0.0002523924,0.000111154426,0.00017622989,0.00016586683,0.00015266765,0.0052943444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990101,0.00041389687,0.00004430945,0.00020059153,0.00020764224,0.0001233902],"domain_scores_gemma":[0.99767,0.0012467727,0.0002590388,0.0005516041,0.00016655563,0.0001060427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010839191,0.00036099573,0.00086304394,0.00063242315,0.0009205868,0.0014071206,0.0011857309,0.00086388935,0.0025387844],"category_scores_gemma":[0.0058840103,0.0003265964,0.00043831498,0.0011507893,0.001722113,0.002816861,0.0015475501,0.0010195845,0.00045802354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020939455,0.000026835365,0.0006570328,0.00016796657,0.000027981674,0.000100918114,0.0003628284,0.37953424,0.0021996608,0.58445716,0.004329363,0.027926564],"study_design_scores_gemma":[0.000044987162,0.000049683687,0.00017157596,0.000018145318,0.000012692831,0.00008083539,0.000117074735,0.59127533,0.00095316157,0.4008839,0.0063727046,0.000019786172],"about_ca_topic_score_codex":0.0040794746,"about_ca_topic_score_gemma":0.0027040436,"teacher_disagreement_score":0.0040794746,"about_ca_system_score_codex":0.0018180497,"about_ca_system_score_gemma":0.0008660433,"threshold_uncertainty_score":0.013190925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076713404,0.00014071475,0.9884974,0.000084087864,0.000045113633,0.000040994797,0.000013977738,0.00030179377,0.0032045182],"genre_scores_gemma":[0.5249246,0.00025195413,0.46925363,0.00018248825,0.000057530953,0.00023512855,0.00008303931,0.000058111877,0.0049535865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972874,0.00004489371,0.000015511552,0.000067515015,0.00010867733,0.00003466233],"domain_scores_gemma":[0.9997687,0.000052905023,0.000038137834,0.000022786307,0.00010326315,0.000014343062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029658616,0.00056197075,0.00046310943,0.00026955083,0.00031469017,0.00072794425,0.0008133053,0.0006037563,0.0033517964],"category_scores_gemma":[0.00066918874,0.00022473713,0.00038223615,0.00025294407,0.00026293733,0.00049723935,0.00031963145,0.0005171369,0.001100307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033911155,0.00020393443,0.0013745222,0.00024650828,0.0001235932,0.0002326587,0.0002527298,0.41227624,0.120315425,0.020854024,0.0048664585,0.43891484],"study_design_scores_gemma":[0.000020020927,0.0001671442,0.00016131735,0.0000088869865,0.0000129683895,0.00007774099,0.000018185365,0.9856104,0.009347077,0.0010592211,0.0035070265,0.000010082825],"about_ca_topic_score_codex":0.0013388246,"about_ca_topic_score_gemma":0.0019043329,"teacher_disagreement_score":0.0033517964,"about_ca_system_score_codex":0.00044793842,"about_ca_system_score_gemma":0.0005973778,"threshold_uncertainty_score":0.011212885},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017209599,0.000047515976,0.9807401,0.00006418479,0.000015990256,0.000025440773,0.00004620985,0.0005362965,0.0013148034],"genre_scores_gemma":[0.11549632,0.00010813227,0.8822479,0.000051984305,0.000018162993,0.000062844236,0.00022239775,0.00018558349,0.0016065439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996885,0.000051967316,0.000016235233,0.00005524437,0.00015506824,0.00003301225],"domain_scores_gemma":[0.99961877,0.00010614785,0.000049529797,0.00009437997,0.00010853706,0.000022582966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068887224,0.0007453905,0.0004597262,0.0005444496,0.0004023366,0.0008058486,0.00093015743,0.0007546365,0.0016594384],"category_scores_gemma":[0.0019501426,0.00034254792,0.0006738562,0.00059128925,0.00057754485,0.0011187604,0.0016685805,0.0010639163,0.00070936955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024780424,0.00015469322,0.004023018,0.00019406271,0.000089482186,0.0003808544,0.0006840408,0.46673304,0.19532117,0.05318531,0.0026170227,0.27636954],"study_design_scores_gemma":[0.000019937583,0.00007378275,0.00070098654,0.000016794524,0.000015599806,0.00014347724,0.000068452,0.9358494,0.05009533,0.0070056957,0.0059657744,0.00004473281],"about_ca_topic_score_codex":0.0020656127,"about_ca_topic_score_gemma":0.0034728865,"teacher_disagreement_score":0.0020656127,"about_ca_system_score_codex":0.00040961744,"about_ca_system_score_gemma":0.00093941786,"threshold_uncertainty_score":0.005551398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5986173,0.00032202606,0.39779574,0.00018680483,0.000036971927,0.000046455425,0.00019726346,0.0010168067,0.0017806828],"genre_scores_gemma":[0.98423,0.00011388111,0.0145566175,0.00001829407,0.000006859282,0.000013218031,0.0001596454,0.00001520313,0.00088627875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998658,0.000018197412,0.000008993454,0.000039141636,0.000046061392,0.000021881193],"domain_scores_gemma":[0.9995741,0.0001457711,0.00010642337,0.000033581076,0.00012387263,0.00001622511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031212592,0.00085141225,0.00029286477,0.00069596793,0.00011467009,0.0003795477,0.00047157452,0.00037733186,0.0004883624],"category_scores_gemma":[0.0013115904,0.0002376407,0.00039728978,0.0002900314,0.00025650876,0.00051064644,0.0002871184,0.00034240392,0.0001299872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019186658,0.00009438156,0.015900802,0.00008433982,0.000058617046,0.00018821191,0.000056812172,0.84806186,0.023883492,0.00080558826,0.0005803693,0.110093616],"study_design_scores_gemma":[8.442991e-7,0.000014232502,0.0014950141,0.0000022862566,0.0000037684117,0.000011735193,0.0000053200833,0.99571997,0.0025862756,0.000111518406,0.000046633653,0.000002424578],"about_ca_topic_score_codex":0.008243736,"about_ca_topic_score_gemma":0.009251123,"teacher_disagreement_score":0.008243736,"about_ca_system_score_codex":0.00059403986,"about_ca_system_score_gemma":0.00040505585,"threshold_uncertainty_score":0.016391516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084544525,0.00018601613,0.89552504,0.00022913085,0.00004124023,0.00015835266,0.00045455003,0.00035946106,0.018501723],"genre_scores_gemma":[0.5006968,0.0003459817,0.4873006,0.00017159144,0.00004540723,0.00019559574,0.0008004667,0.00020089233,0.010242607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999435,0.00015549563,0.000022299299,0.000117663636,0.00013892369,0.00013058442],"domain_scores_gemma":[0.9989027,0.00053662254,0.00012743704,0.00017829861,0.00016113684,0.00009386594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058072683,0.000501967,0.0004417963,0.00066931255,0.0006709117,0.00076799357,0.00089886686,0.00048472523,0.006769754],"category_scores_gemma":[0.0022508437,0.0003674622,0.000595857,0.0010419943,0.00086801243,0.0014290403,0.00090843905,0.0014155592,0.0007783882],"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.00028495287,0.00014960053,0.0013119582,0.00039549396,0.000034589106,0.00028998742,0.00031396962,0.49305934,0.025884675,0.33845422,0.009913125,0.1299081],"study_design_scores_gemma":[0.000038041777,0.00012954234,0.0006241038,0.000034225017,0.000010041067,0.00014193574,0.00013030211,0.81715214,0.008849076,0.16328283,0.009583355,0.000024404202],"about_ca_topic_score_codex":0.0034394094,"about_ca_topic_score_gemma":0.0063680164,"teacher_disagreement_score":0.006769754,"about_ca_system_score_codex":0.000766414,"about_ca_system_score_gemma":0.0007037679,"threshold_uncertainty_score":0.022647083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99935347,0.000056691857,0.000117739786,0.00001921712,0.0000035159624,0.000053526375,0.0002079344,0.0000016787234,0.00018602643],"genre_scores_gemma":[0.9990915,0.00007826649,0.00027146254,0.00002580428,0.000010644176,0.00010685433,0.0002751979,0.0000011754233,0.00013909423],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991392,0.00029634836,0.00011956588,0.00013345205,0.00018302925,0.00012837519],"domain_scores_gemma":[0.99771935,0.00056868466,0.00072645,0.00014550575,0.00053940405,0.00030055415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014836744,0.0003744585,0.00039858112,0.0008479265,0.00053570984,0.0005844173,0.00026446115,0.00045723986,0.0011620756],"category_scores_gemma":[0.005735487,0.00019739628,0.0006747179,0.0006928272,0.0002667201,0.0004994315,0.00081481534,0.0005849793,0.00020710992],"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.00022484415,0.0004493989,0.9919442,0.000046196685,0.00011910823,0.000057755828,0.00062176,0.000057623125,0.00023282836,0.000016033702,0.00012230196,0.006107997],"study_design_scores_gemma":[0.000012453961,0.0010016918,0.99706095,0.00001857501,0.00005367968,0.00007553735,0.0011315637,0.00033622363,0.00008196344,0.000023563925,0.00019571776,0.000008022093],"about_ca_topic_score_codex":0.005428565,"about_ca_topic_score_gemma":0.01065607,"teacher_disagreement_score":0.005428565,"about_ca_system_score_codex":0.00036401182,"about_ca_system_score_gemma":0.00045588656,"threshold_uncertainty_score":0.010793924},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003565017,0.0016364566,0.00713503,0.053938348,0.9213515,0.000045632994,0.009595484,0.0034132586,0.002527736],"genre_scores_gemma":[0.041661218,0.012103974,0.054055687,0.15505834,0.40886867,0.00081458595,0.033789475,0.018977482,0.27467063],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99353516,0.000885822,0.0009679921,0.0010455182,0.0030646974,0.00050079834],"domain_scores_gemma":[0.9228215,0.011526553,0.0024466726,0.0047899457,0.05646665,0.0019485805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055438043,0.002971585,0.0025108447,0.004942399,0.0032366477,0.0056066513,0.004579047,0.0059826006,0.09021189],"category_scores_gemma":[0.11922405,0.0014051722,0.0022753465,0.004282887,0.0024475523,0.0033799985,0.0030284468,0.00963873,0.05950079],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028501214,0.000003251235,0.00007277603,0.00012466808,0.000017243014,0.00006399443,0.000028265447,0.000054111184,0.00007764001,0.00060454075,0.99385154,0.0050734705],"study_design_scores_gemma":[0.00008996557,0.000020922518,0.0008758538,0.00045832936,0.000070685666,0.00048873865,0.000089075984,0.00082182547,0.0008815328,0.0036841147,0.9924418,0.00007716526],"about_ca_topic_score_codex":0.02175256,"about_ca_topic_score_gemma":0.026339078,"teacher_disagreement_score":0.09021189,"about_ca_system_score_codex":0.0026267548,"about_ca_system_score_gemma":0.007340179,"threshold_uncertainty_score":0.30178887},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021207926,0.000057737863,0.9941848,0.00006228299,0.000028376606,0.00010138898,0.00010811705,0.0011404325,0.0021961008],"genre_scores_gemma":[0.021818139,0.00008157078,0.9753059,0.0000352154,0.000009973052,0.00027613598,0.0003328226,0.00013954443,0.0020006457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997094,0.0000400278,0.00002192481,0.00008616824,0.00010648773,0.00003586731],"domain_scores_gemma":[0.99974173,0.000112029506,0.00002673821,0.000029112676,0.00007131705,0.000019159685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003394417,0.0014243611,0.0007744273,0.0012040323,0.0011563667,0.00095038133,0.0015624162,0.0012106576,0.00813189],"category_scores_gemma":[0.0008740495,0.00070136954,0.0009128385,0.0011516348,0.0006052767,0.0012459031,0.0016563926,0.0010688961,0.002388602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118945776,0.00013165093,0.0008837433,0.00037418192,0.00007845029,0.00023531352,0.00019564742,0.43122557,0.0099494,0.035385292,0.014436885,0.50698495],"study_design_scores_gemma":[0.000081014434,0.00010355176,0.00024368908,0.000030756502,0.000020792917,0.00020894724,0.000070296664,0.95636857,0.003031794,0.020513535,0.019295435,0.000031603136],"about_ca_topic_score_codex":0.0073936363,"about_ca_topic_score_gemma":0.008475897,"teacher_disagreement_score":0.00813189,"about_ca_system_score_codex":0.0007803976,"about_ca_system_score_gemma":0.0017690313,"threshold_uncertainty_score":0.027203858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07620804,0.00059070945,0.91952866,0.0003059791,0.000064292195,0.000071732844,0.000050791357,0.0010090395,0.0021707371],"genre_scores_gemma":[0.71550477,0.000244317,0.28143057,0.00018601127,0.0000814614,0.00011641287,0.00015584241,0.00008493814,0.002195646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906284,0.0003026129,0.00007262031,0.00017671415,0.0002929952,0.000092276314],"domain_scores_gemma":[0.9980453,0.0010125872,0.00039686562,0.00016910423,0.0003161498,0.000059968515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015123348,0.0012196527,0.0016300721,0.0020786794,0.00041269168,0.0013948021,0.0008925914,0.0010670603,0.0007101792],"category_scores_gemma":[0.0043072524,0.0004925343,0.00076107733,0.0011136561,0.00064840104,0.0014454364,0.00083839754,0.0007670687,0.00029352505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025797004,0.00018016307,0.011063962,0.0001319511,0.00024960976,0.00012319973,0.000108039036,0.62706465,0.0061269286,0.004451679,0.0013643544,0.3488775],"study_design_scores_gemma":[0.000005728484,0.0000256416,0.0008853027,0.0000048298702,0.000008846537,0.000018530505,0.000010543281,0.9971405,0.00083342247,0.0008713459,0.00018843972,0.000006794451],"about_ca_topic_score_codex":0.0036314102,"about_ca_topic_score_gemma":0.0022321385,"teacher_disagreement_score":0.0036314102,"about_ca_system_score_codex":0.00062448636,"about_ca_system_score_gemma":0.00066980167,"threshold_uncertainty_score":0.007998109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73573196,0.0026174788,0.25105372,0.0015536173,0.00018904015,0.00034636844,0.003976477,0.0013846488,0.0031468498],"genre_scores_gemma":[0.8572449,0.0008126845,0.13645005,0.000108674496,0.00007143045,0.00016364524,0.004215784,0.00009219181,0.0008405394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984351,0.0006842923,0.00014886714,0.00022679706,0.00044140292,0.00006350712],"domain_scores_gemma":[0.9919412,0.005283024,0.0006413349,0.0008081746,0.0012150368,0.00011117776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027555474,0.00080778485,0.0005969836,0.0013503883,0.00034118837,0.00075365155,0.00083794346,0.0012961401,0.00032922393],"category_scores_gemma":[0.008970838,0.00025931816,0.00080334954,0.0013379196,0.00066141627,0.0008314133,0.0005531639,0.0007694158,0.00017400728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060047617,0.00063556194,0.043601446,0.0013869444,0.00027133722,0.0012437707,0.00055245444,0.75141513,0.019641034,0.004262916,0.010066634,0.16632216],"study_design_scores_gemma":[0.000040739993,0.00033296278,0.016577797,0.000086998225,0.00004172716,0.00075313635,0.0003680027,0.95298254,0.019360716,0.0026287867,0.0067790486,0.000047503225],"about_ca_topic_score_codex":0.0031839558,"about_ca_topic_score_gemma":0.0047841454,"teacher_disagreement_score":0.0031839558,"about_ca_system_score_codex":0.00060534396,"about_ca_system_score_gemma":0.0004221872,"threshold_uncertainty_score":0.014572918},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010662973,0.0025089192,0.9727386,0.0006328646,0.00014372825,0.00010109325,0.00014809663,0.0002727855,0.012790949],"genre_scores_gemma":[0.30119413,0.0049399803,0.6822858,0.00066489185,0.00034420032,0.0005463123,0.0006434048,0.00040931985,0.008971962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993932,0.00021150231,0.000029989484,0.00012121846,0.00017491536,0.00006914082],"domain_scores_gemma":[0.99875665,0.00081386487,0.00015162988,0.00013532802,0.000095685224,0.00004674091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010476406,0.0015077529,0.0010774123,0.0007240346,0.00054932415,0.0013130021,0.001728625,0.0013150626,0.0040623094],"category_scores_gemma":[0.00473416,0.0006081527,0.00085451454,0.0012745576,0.001507806,0.0016277706,0.0013673693,0.0017946963,0.00082116754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030941104,0.00004412434,0.00044857492,0.00025705135,0.000038466304,0.00006280431,0.000052485375,0.89308834,0.0006682345,0.07173731,0.0031870124,0.030384662],"study_design_scores_gemma":[0.000010592152,0.000020510603,0.00008990305,0.000035108165,0.000009097915,0.00003061987,0.000020967422,0.95608634,0.00029335052,0.039629135,0.0037662764,0.000008081573],"about_ca_topic_score_codex":0.0038269751,"about_ca_topic_score_gemma":0.004362711,"teacher_disagreement_score":0.0040623094,"about_ca_system_score_codex":0.0012618275,"about_ca_system_score_gemma":0.0012677846,"threshold_uncertainty_score":0.01358974},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9423616,0.00021371672,0.039470304,0.000118965334,0.000018446133,0.00007290168,0.0004923667,0.00015663847,0.01709512],"genre_scores_gemma":[0.9974657,0.00004018071,0.0019266114,0.000005423222,0.000001424614,0.000007759425,0.000117350515,0.00000743425,0.00042807707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997845,0.00006137498,0.0000066818106,0.000030297952,0.00009526998,0.000021900187],"domain_scores_gemma":[0.99979943,0.00008210105,0.000022179896,0.000016053196,0.00006232394,0.000017966626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050739467,0.0003992578,0.00022895375,0.0004825845,0.00017620112,0.00075001305,0.0002739436,0.00037699603,0.001084169],"category_scores_gemma":[0.00075016666,0.00013686057,0.00027125832,0.00043564572,0.00023714773,0.00054635823,0.0005007901,0.00024843775,0.00016608089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031008196,0.00006935598,0.031410195,0.00009965321,0.000048509606,0.00015711373,0.000053651118,0.9243882,0.010152149,0.0046953433,0.00041395042,0.028201843],"study_design_scores_gemma":[0.000020874397,0.00023718587,0.03111015,0.00001554805,0.000023301245,0.000060642407,0.00012483676,0.953559,0.010665877,0.002942307,0.0012245601,0.000015676154],"about_ca_topic_score_codex":0.0026730848,"about_ca_topic_score_gemma":0.0043409416,"teacher_disagreement_score":0.0026730848,"about_ca_system_score_codex":0.0005088955,"about_ca_system_score_gemma":0.00026062268,"threshold_uncertainty_score":0.0053150654},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28797823,0.0021929776,0.7002634,0.0001889631,0.00015158336,0.00043358013,0.0011381119,0.0016166917,0.006036436],"genre_scores_gemma":[0.8698572,0.0015251834,0.120873936,0.00024617888,0.00008902507,0.000847472,0.001488316,0.0005380442,0.0045345454],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894005,0.00028133875,0.0001158764,0.00024275917,0.00034384948,0.00007621278],"domain_scores_gemma":[0.99648404,0.0019290025,0.0005502616,0.0003116254,0.0006478564,0.00007716506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025234625,0.0013846258,0.0007468143,0.0013240585,0.00027298855,0.0008474233,0.00086820434,0.0009730899,0.0027695445],"category_scores_gemma":[0.009673669,0.000477919,0.00077422545,0.0009804678,0.00040111147,0.0013382554,0.0006193323,0.00077262433,0.0011342436],"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.0035588513,0.0009635795,0.117778756,0.0014512374,0.0004064865,0.00044235933,0.0007440255,0.047457088,0.12604828,0.0048547476,0.0044000465,0.6918946],"study_design_scores_gemma":[0.00018706331,0.004442686,0.42707103,0.00050441583,0.00050925463,0.0021660638,0.00062282523,0.44557595,0.088028215,0.0118757365,0.018589128,0.00042762863],"about_ca_topic_score_codex":0.0023747198,"about_ca_topic_score_gemma":0.0036364913,"teacher_disagreement_score":0.0027695445,"about_ca_system_score_codex":0.00031246565,"about_ca_system_score_gemma":0.0006257178,"threshold_uncertainty_score":0.01334554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019010886,0.000104241364,0.9969566,0.00003790091,0.000013350582,0.00003163241,0.000031176944,0.0006099939,0.0003140276],"genre_scores_gemma":[0.0841183,0.00025956435,0.91317755,0.00012518371,0.000040553776,0.00026734828,0.00045837444,0.00044920822,0.0011038651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644107,0.0010966663,0.00022935291,0.0008495914,0.0011897318,0.00019351378],"domain_scores_gemma":[0.99713886,0.0009146067,0.00032002575,0.0005510734,0.0009823252,0.00009315687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027437222,0.0016284164,0.0016846877,0.003255447,0.0014383051,0.0014633887,0.0031512743,0.001627759,0.001268063],"category_scores_gemma":[0.0066732448,0.0011176042,0.0017247365,0.0028207141,0.0013388047,0.0019110853,0.0023988124,0.0019087545,0.000975153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028720082,0.00011190732,0.0020788158,0.000445556,0.0002804709,0.00013422221,0.000755955,0.5348838,0.024676705,0.026530912,0.00979535,0.40001914],"study_design_scores_gemma":[0.000012112926,0.000023263396,0.0003313905,0.000019714993,0.000014369826,0.000057008612,0.000044177414,0.981729,0.004899774,0.009615311,0.003222113,0.00003183209],"about_ca_topic_score_codex":0.0076035983,"about_ca_topic_score_gemma":0.011299825,"teacher_disagreement_score":0.0076035983,"about_ca_system_score_codex":0.001361378,"about_ca_system_score_gemma":0.002636216,"threshold_uncertainty_score":0.015118659},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040759217,0.0003443105,0.9558069,0.00009089043,0.00004098355,0.000046021072,0.00010808915,0.0016187666,0.001184842],"genre_scores_gemma":[0.6773955,0.00041853686,0.31565592,0.00018444605,0.000058273683,0.0001533538,0.00086915813,0.00019316016,0.0050716046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996182,0.00007078868,0.000014051351,0.00018758861,0.00007198351,0.000037430018],"domain_scores_gemma":[0.99955183,0.0001553272,0.00006494785,0.000111816225,0.00008099759,0.00003508455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071313104,0.0005856197,0.0005529309,0.0005993122,0.00022265824,0.00036993384,0.0011267602,0.00051586056,0.0010075264],"category_scores_gemma":[0.0016083585,0.00030125503,0.0006459081,0.0007345207,0.00064647716,0.0008233261,0.00074281293,0.00090656744,0.00045612085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001635442,0.00015445884,0.0022019204,0.00006888604,0.00008512101,0.00012491686,0.00011722538,0.3358594,0.03981622,0.0049579786,0.0031009614,0.6133494],"study_design_scores_gemma":[0.000003116356,0.000038083206,0.00070730934,0.000004163068,0.0000060532443,0.0000460505,0.000014608652,0.9911108,0.0049498924,0.002406966,0.0007062148,0.0000068125146],"about_ca_topic_score_codex":0.0052386206,"about_ca_topic_score_gemma":0.008526088,"teacher_disagreement_score":0.0052386206,"about_ca_system_score_codex":0.00050852937,"about_ca_system_score_gemma":0.00073784054,"threshold_uncertainty_score":0.010416269},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0331362,0.0009050805,0.96014947,0.00029478825,0.00018319991,0.00016904599,0.00025138992,0.0021653636,0.0027455732],"genre_scores_gemma":[0.3807426,0.0003556574,0.6134729,0.00023717889,0.0004647532,0.00028752492,0.0015182511,0.00023965942,0.0026814523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99477404,0.0012321568,0.00044491905,0.0012900792,0.0020498994,0.00020894082],"domain_scores_gemma":[0.992527,0.0032956232,0.0007358799,0.0013660715,0.0018646778,0.000210773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049899747,0.0011125855,0.002562505,0.004898195,0.0013121977,0.0018781377,0.002234808,0.0018022336,0.0024439238],"category_scores_gemma":[0.019305026,0.0003337223,0.0012657781,0.0044022924,0.00088982214,0.0032969902,0.001387777,0.002545668,0.0019113955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034146258,0.00041305117,0.006599746,0.00014391674,0.00013009038,0.00013635095,0.00016087796,0.08172832,0.0050238296,0.01076427,0.011377745,0.8831804],"study_design_scores_gemma":[0.000048876736,0.00018887677,0.001265966,0.000028604241,0.00003192559,0.0001802029,0.00004514035,0.9716428,0.004209065,0.019054908,0.0032682917,0.00003534349],"about_ca_topic_score_codex":0.0027858326,"about_ca_topic_score_gemma":0.0026538481,"teacher_disagreement_score":0.0049899747,"about_ca_system_score_codex":0.0009882532,"about_ca_system_score_gemma":0.0015610697,"threshold_uncertainty_score":0.026389837},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1306628,0.0009897149,0.86372536,0.0007335177,0.00016754068,0.00007627802,0.00014324434,0.001044838,0.0024566657],"genre_scores_gemma":[0.91319454,0.00032427633,0.082743146,0.00057145563,0.00011450582,0.00003999149,0.00018172161,0.000069299844,0.0027610147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903524,0.00033208783,0.000044643322,0.00024983296,0.0002360634,0.00010219319],"domain_scores_gemma":[0.99792284,0.0010150557,0.0003483737,0.00035276337,0.00026372142,0.0000972567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028690803,0.00072712684,0.00058049435,0.00058745174,0.00030669218,0.0006428393,0.00086452835,0.00075556,0.0009357433],"category_scores_gemma":[0.006284346,0.000229603,0.00056642015,0.0002862255,0.0007516594,0.0011970332,0.0014929617,0.0013147785,0.00038258178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059052015,0.0002623299,0.01902176,0.00016741715,0.000195895,0.00032514296,0.00023731966,0.50384766,0.03368101,0.010899935,0.00482737,0.42594367],"study_design_scores_gemma":[0.000009540797,0.00010596124,0.0020865812,0.000019550305,0.000026070291,0.0002507209,0.000022339456,0.9772619,0.013772717,0.005247826,0.0011809367,0.000015918677],"about_ca_topic_score_codex":0.000932852,"about_ca_topic_score_gemma":0.0012908526,"teacher_disagreement_score":0.0028690803,"about_ca_system_score_codex":0.0005814695,"about_ca_system_score_gemma":0.0004905487,"threshold_uncertainty_score":0.015173376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16091241,0.00041738476,0.8265481,0.0006407539,0.000051597086,0.00026088362,0.00067984115,0.00037799848,0.010111014],"genre_scores_gemma":[0.6495868,0.0005527643,0.3403409,0.00019526508,0.00006255002,0.00025745292,0.0009946688,0.00014975964,0.007859729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992036,0.00029638468,0.0000314264,0.0002222452,0.00012846259,0.00011789189],"domain_scores_gemma":[0.9960044,0.0024262194,0.000482648,0.0004491876,0.00033791634,0.00029957722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013094628,0.00028221993,0.00057178445,0.00053525326,0.0009141659,0.0011309216,0.0008707519,0.0007162812,0.0034977167],"category_scores_gemma":[0.005843907,0.00042815236,0.0005436051,0.0010545392,0.0008819468,0.002517866,0.0010830712,0.0008096815,0.0005108928],"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.00056945,0.00017558144,0.003928982,0.00042836738,0.00010558598,0.0003353489,0.0008429662,0.3835142,0.016190967,0.5112676,0.011295243,0.07134568],"study_design_scores_gemma":[0.00010170577,0.0001997223,0.0012971889,0.000031661984,0.000038945946,0.0002890212,0.00032302216,0.6872721,0.005309251,0.29113272,0.013978489,0.000026166677],"about_ca_topic_score_codex":0.0026933376,"about_ca_topic_score_gemma":0.0036429898,"teacher_disagreement_score":0.0034977167,"about_ca_system_score_codex":0.0010299751,"about_ca_system_score_gemma":0.0011076544,"threshold_uncertainty_score":0.011701047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034483084,0.00011374763,0.9956896,0.00006563643,0.00001405001,0.00001516097,0.000026179574,0.00017876302,0.00044858377],"genre_scores_gemma":[0.2897074,0.0007009656,0.7066652,0.00018179936,0.00011569534,0.0002268694,0.00031576693,0.0001484484,0.0019379082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982147,0.0008419701,0.00007356905,0.00023635657,0.00054530636,0.000088082714],"domain_scores_gemma":[0.9914466,0.006581916,0.00040364385,0.0009882412,0.00050474005,0.00007487114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038258974,0.0007589101,0.0012300519,0.0015620028,0.0004344776,0.0017579744,0.0012517488,0.0013122032,0.0014824761],"category_scores_gemma":[0.018897675,0.00059969985,0.0010335422,0.0012430879,0.0011699854,0.0025609073,0.001477665,0.0023490018,0.000606149],"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.00027074612,0.00013489302,0.002931663,0.000333738,0.00020420594,0.00032812252,0.0002678012,0.632026,0.011800818,0.15612039,0.0025829873,0.19299865],"study_design_scores_gemma":[0.000012457689,0.00003027555,0.0004238439,0.00001807877,0.000009530678,0.0001331328,0.000016488451,0.97457063,0.0028229582,0.020779477,0.001152449,0.000030578754],"about_ca_topic_score_codex":0.0011767901,"about_ca_topic_score_gemma":0.0009069061,"teacher_disagreement_score":0.0038258974,"about_ca_system_score_codex":0.00058504567,"about_ca_system_score_gemma":0.0009678178,"threshold_uncertainty_score":0.020233572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80689406,0.0005640325,0.17810293,0.00016194297,0.00012546426,0.00012834418,0.00029037686,0.0014862459,0.012246647],"genre_scores_gemma":[0.9927598,0.00008578698,0.004496501,0.000011895172,0.0000033501515,0.00004124486,0.00012434622,0.000012072726,0.002465066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979,0.000036796493,0.000019939676,0.000037798643,0.00008072312,0.00003483197],"domain_scores_gemma":[0.9996927,0.000085387954,0.000036427846,0.00003336285,0.00013252984,0.000019568464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039498188,0.0005179321,0.00056065974,0.00039248285,0.0003430726,0.0007822668,0.00074809,0.0008386048,0.0024652856],"category_scores_gemma":[0.00056256726,0.00025729794,0.0006373479,0.00016363671,0.00021409486,0.0003849185,0.0003880713,0.0003859236,0.0006790807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001251801,0.00045379275,0.004173233,0.00094112195,0.00016088756,0.00036289814,0.00031525365,0.7854896,0.14565325,0.0015727343,0.001002185,0.05862321],"study_design_scores_gemma":[0.00003131413,0.0007541238,0.0013650971,0.000014500049,0.000045430887,0.0000398804,0.000059129085,0.97699326,0.019013193,0.00014263304,0.001521475,0.000019973308],"about_ca_topic_score_codex":0.0064080614,"about_ca_topic_score_gemma":0.0046831467,"teacher_disagreement_score":0.0064080614,"about_ca_system_score_codex":0.00027828582,"about_ca_system_score_gemma":0.0004976265,"threshold_uncertainty_score":0.012741506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08889185,0.00028458345,0.90396774,0.00051652174,0.00005555035,0.00008353686,0.00019015014,0.0003916041,0.0056184805],"genre_scores_gemma":[0.88162935,0.0004648357,0.112611316,0.00017561873,0.00006401327,0.00025589467,0.00027834857,0.000081429826,0.004439287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987674,0.000036113386,0.0000052890437,0.000033527012,0.000033318014,0.000015013152],"domain_scores_gemma":[0.99974996,0.00013132668,0.00003476215,0.000013568649,0.000054671746,0.000015681922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034964486,0.00054168724,0.0003716275,0.00029713835,0.00029992443,0.0005834789,0.0005739699,0.0010720412,0.00091600814],"category_scores_gemma":[0.00094633293,0.00019194104,0.00049370807,0.00024110563,0.0004138263,0.0004968058,0.00057232945,0.00057548727,0.00019536243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000255871,0.000035426023,0.0009519922,0.000032788597,0.000015655734,0.000093631395,0.00003765604,0.9788776,0.0058418033,0.007898839,0.0004060028,0.0057830187],"study_design_scores_gemma":[0.0000016859565,0.000007040399,0.00006406039,0.0000011959988,0.0000014274073,0.0000058260125,0.0000021723554,0.99895644,0.0002387894,0.0005911574,0.00012768075,0.0000024549408],"about_ca_topic_score_codex":0.0063197045,"about_ca_topic_score_gemma":0.003591283,"teacher_disagreement_score":0.0063197045,"about_ca_system_score_codex":0.0004273802,"about_ca_system_score_gemma":0.0009321559,"threshold_uncertainty_score":0.012565851},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032598328,0.0004603842,0.96157795,0.00018956335,0.00008150289,0.00006054666,0.00007414196,0.0015252447,0.0034323505],"genre_scores_gemma":[0.80220383,0.0006554868,0.18683782,0.0004388151,0.00007168004,0.00012767849,0.00023565262,0.0002238749,0.009205121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999138,0.000010398324,0.0000039769016,0.000024404262,0.000030727086,0.00001669397],"domain_scores_gemma":[0.9998994,0.00003177932,0.000010748668,0.000012606317,0.000035121895,0.000010338796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030819405,0.00053706265,0.00032585434,0.00036028388,0.00014194661,0.00048685202,0.00097140623,0.00060579216,0.0019520443],"category_scores_gemma":[0.00067031215,0.00019874357,0.0005549915,0.00020053497,0.00029546823,0.00055889715,0.000569569,0.0007089566,0.00056914956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024838626,0.00018740061,0.0018020783,0.0002186533,0.00011171707,0.0002539563,0.00009794988,0.4723394,0.098644026,0.009797125,0.0044945343,0.41180477],"study_design_scores_gemma":[0.000006660803,0.000064772874,0.00029472835,0.000009263215,0.000025017504,0.00010200636,0.000005846913,0.9838067,0.012894892,0.0013385518,0.00144513,0.00000639977],"about_ca_topic_score_codex":0.0030968734,"about_ca_topic_score_gemma":0.0039807837,"teacher_disagreement_score":0.0030968734,"about_ca_system_score_codex":0.00046499536,"about_ca_system_score_gemma":0.00059680926,"threshold_uncertainty_score":0.006530285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047872506,0.00013182062,0.9484468,0.00010243111,0.000019904424,0.00003461476,0.00004446916,0.0009486054,0.0023988232],"genre_scores_gemma":[0.9253791,0.000053975225,0.07238634,0.000059403166,0.000022909278,0.00006916162,0.000092565606,0.00006505324,0.0018714494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979967,0.000048094582,0.00000878288,0.00006007467,0.000050506333,0.00003277724],"domain_scores_gemma":[0.99981445,0.000101946964,0.000024204483,0.000014300162,0.00003580976,0.000009373535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003698774,0.00056788424,0.0005331572,0.00032782706,0.0003080269,0.00045768026,0.00070098566,0.00054115185,0.0016127111],"category_scores_gemma":[0.00080885243,0.000296727,0.00039567647,0.00037735936,0.0004151404,0.0005575037,0.00055732916,0.00062279595,0.00023886557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033123266,0.000031931682,0.0004901418,0.000016354898,0.000017520326,0.000022822325,0.000018303484,0.9597168,0.0016721823,0.0011942592,0.00029737057,0.036489293],"study_design_scores_gemma":[0.0000011031636,0.0000037175255,0.000056969126,4.82527e-7,6.8968944e-7,0.0000010792545,0.000001168527,0.9993981,0.0001682403,0.00031551495,0.00005213815,7.3324406e-7],"about_ca_topic_score_codex":0.010311083,"about_ca_topic_score_gemma":0.011019026,"teacher_disagreement_score":0.010311083,"about_ca_system_score_codex":0.00068615115,"about_ca_system_score_gemma":0.00057373935,"threshold_uncertainty_score":0.02050215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015676512,0.9953212,0.0018267977,0.00081493973,0.00019592913,0.000007723965,0.000017228063,0.000012245046,0.0016471532],"genre_scores_gemma":[0.0018585175,0.99628204,0.0010138608,0.000225416,0.00028872918,0.000012381823,0.000020592246,0.0000040190343,0.0002945207],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963987,0.00010829152,0.00004086737,0.000057346148,0.000126248,0.000027417856],"domain_scores_gemma":[0.99819344,0.001412221,0.00008874796,0.000040766576,0.00021998223,0.000044732482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011885449,0.0009060619,0.0013189116,0.0021527268,0.00042219582,0.0013559245,0.0009874927,0.001534498,0.0038493618],"category_scores_gemma":[0.0025052093,0.00041306578,0.0007031045,0.00334834,0.0010237991,0.0021422317,0.00091159996,0.001987725,0.001255213],"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.00004473224,0.00009409267,0.00032540498,0.023439312,0.00013270383,0.00013442825,0.0001386944,0.0036243265,0.00071234314,0.060392253,0.029339312,0.8816224],"study_design_scores_gemma":[0.000016374142,0.00013400053,0.000778058,0.009599492,0.0001539756,0.0007147063,0.000116004856,0.0022981714,0.0006417189,0.05062403,0.9348522,0.00007124164],"about_ca_topic_score_codex":0.001708452,"about_ca_topic_score_gemma":0.0017924707,"teacher_disagreement_score":0.0038493618,"about_ca_system_score_codex":0.0009805514,"about_ca_system_score_gemma":0.0022762432,"threshold_uncertainty_score":0.012877405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013193567,0.00027033748,0.98488706,0.00017402507,0.000045062774,0.000054779477,0.000036002908,0.00032734303,0.0010118936],"genre_scores_gemma":[0.37144798,0.00033909624,0.6251737,0.00029714452,0.00004201558,0.00036950078,0.00022990089,0.00009290422,0.0020077075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993851,0.00017614765,0.000034022145,0.00011963763,0.0002287425,0.00005626598],"domain_scores_gemma":[0.9990602,0.0005273332,0.00008216664,0.00007496299,0.00022464534,0.00003068692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010884202,0.00059769757,0.0010304605,0.0008873233,0.00061597716,0.0007762371,0.0012447656,0.0010112822,0.001338416],"category_scores_gemma":[0.0034465722,0.00032339455,0.00077799143,0.0014260169,0.00083006994,0.00084150414,0.00083376997,0.00092015055,0.00025410287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010383355,0.000111070716,0.0019165064,0.000110591915,0.000115045004,0.0001284604,0.00013426285,0.71853685,0.009710206,0.021939414,0.002442355,0.2447514],"study_design_scores_gemma":[0.000014964176,0.0000338293,0.00019178564,0.0000056794897,0.000011240544,0.000029940784,0.0000075846756,0.9939354,0.00071345037,0.0042581777,0.0007898023,0.000008176656],"about_ca_topic_score_codex":0.005748575,"about_ca_topic_score_gemma":0.0046164626,"teacher_disagreement_score":0.005748575,"about_ca_system_score_codex":0.00087446644,"about_ca_system_score_gemma":0.0016064484,"threshold_uncertainty_score":0.011430204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041144997,0.00031600334,0.9521609,0.0002680208,0.000058857942,0.00013193446,0.00001396264,0.00031833633,0.005586995],"genre_scores_gemma":[0.8909075,0.0002032779,0.10703069,0.000099786215,0.000018463523,0.00010678131,0.000014555125,0.00002626419,0.0015925929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996488,0.00009864893,0.000021721651,0.00005811923,0.00013295544,0.000039732116],"domain_scores_gemma":[0.99897754,0.0005297573,0.00011833093,0.00008871939,0.00024890085,0.00003672587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012959599,0.0004718974,0.00034025463,0.00017387873,0.00020250908,0.00058479817,0.00090234523,0.0006711467,0.0010434168],"category_scores_gemma":[0.002799155,0.00026315553,0.00024458865,0.00011593272,0.00064832444,0.0005530954,0.0003367407,0.0010114994,0.00015620979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005247275,0.00007910517,0.00072279753,0.00011308353,0.000027411192,0.000049910806,0.000062803454,0.941374,0.0058102375,0.009774826,0.00022231619,0.041711032],"study_design_scores_gemma":[0.0000075698727,0.00005681927,0.000073748575,0.0000073869533,0.000003630752,0.000010249756,0.00000396562,0.9968045,0.0018872335,0.00061911845,0.0005233334,0.0000025051745],"about_ca_topic_score_codex":0.0033959264,"about_ca_topic_score_gemma":0.0029944798,"teacher_disagreement_score":0.0033959264,"about_ca_system_score_codex":0.0007389301,"about_ca_system_score_gemma":0.0009454573,"threshold_uncertainty_score":0.0068537593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010907648,0.00026256213,0.98282385,0.00017530922,0.00009282214,0.000068599584,0.000028688615,0.000112517846,0.005528049],"genre_scores_gemma":[0.60551906,0.00056863984,0.385944,0.00019093361,0.00015164741,0.0003018182,0.000108548185,0.000070287395,0.007145012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983096,0.000057175137,0.000008806229,0.000036269877,0.000044172422,0.0000224997],"domain_scores_gemma":[0.99974734,0.00014035533,0.000026774158,0.000010725645,0.000055296645,0.000019491157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046746767,0.0006750987,0.0008816511,0.0004693781,0.00032254134,0.00073846546,0.0006787197,0.0009543284,0.0021014803],"category_scores_gemma":[0.0011426171,0.0004038933,0.00062948046,0.00061839534,0.00042838484,0.0004819859,0.00048380665,0.0006754301,0.00022916995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020518419,0.00002988312,0.00017581703,0.000042326144,0.000027398844,0.00003901882,0.000021597101,0.977768,0.0008302685,0.005773602,0.0007060465,0.014565544],"study_design_scores_gemma":[0.0000057544107,0.000013593897,0.000035730645,0.0000028742145,0.0000037194177,0.000006194512,0.000004176999,0.9989079,0.00008315662,0.0006785437,0.00025647262,0.0000018697343],"about_ca_topic_score_codex":0.004847259,"about_ca_topic_score_gemma":0.004235797,"teacher_disagreement_score":0.004847259,"about_ca_system_score_codex":0.00052792055,"about_ca_system_score_gemma":0.0009215333,"threshold_uncertainty_score":0.009638071},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007774823,0.0001376183,0.9900816,0.00041312762,0.000020308165,0.00009861001,0.0002840433,0.0006885887,0.0005011776],"genre_scores_gemma":[0.32273164,0.00028296377,0.6731795,0.00034301187,0.000072432944,0.000630665,0.0013410741,0.00011072231,0.0013079128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989802,0.0004545584,0.0000828152,0.00025681496,0.00016003744,0.000065497225],"domain_scores_gemma":[0.99489814,0.004107467,0.00033095555,0.00019193698,0.0004073223,0.00006424561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026199066,0.0011245217,0.00059885223,0.0014854989,0.00039144835,0.0011745229,0.0015456341,0.0010093263,0.002539689],"category_scores_gemma":[0.009877952,0.000500021,0.0016318022,0.00083487306,0.00056016375,0.0011531289,0.0012260211,0.0016993062,0.00037141467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118221185,0.00014775437,0.005409754,0.0003359423,0.00018433311,0.00041332055,0.000419552,0.8300563,0.0027642916,0.028267052,0.002492832,0.12939067],"study_design_scores_gemma":[0.000008362514,0.000019561621,0.00017907009,0.000014566037,0.000014954968,0.000023963814,0.0000161909,0.98925495,0.00046494222,0.009358754,0.0006385163,0.000006116331],"about_ca_topic_score_codex":0.0071459482,"about_ca_topic_score_gemma":0.007685422,"teacher_disagreement_score":0.0071459482,"about_ca_system_score_codex":0.0013258304,"about_ca_system_score_gemma":0.0016506433,"threshold_uncertainty_score":0.014208674},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033015817,0.0008135526,0.9540193,0.00036228495,0.00011071904,0.000056908655,0.00006236035,0.00012273352,0.011436254],"genre_scores_gemma":[0.8133599,0.0018668867,0.1738583,0.0005197263,0.0002671519,0.00027788198,0.00014772649,0.00022238721,0.009479983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989108,0.00040839062,0.000068694266,0.00013618688,0.00038742868,0.000088451656],"domain_scores_gemma":[0.9938974,0.004147248,0.00053909014,0.0003629187,0.0007708049,0.0002825534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050298073,0.00095629256,0.00082326296,0.0020945498,0.0007268421,0.0015462722,0.0012223287,0.00096718356,0.0027536782],"category_scores_gemma":[0.014082284,0.00036444518,0.0013988181,0.0007963288,0.003439088,0.003596315,0.0017606566,0.002314831,0.00039998468],"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.00002420563,0.000016606693,0.0003045789,0.00010739263,0.000016409085,0.00012604348,0.00012960078,0.025861455,0.0024077566,0.96569043,0.00034799194,0.004967483],"study_design_scores_gemma":[0.000014896524,0.00006428303,0.00042496654,0.00006965244,0.000016160928,0.0003185877,0.00007190094,0.42632154,0.0033794092,0.56730664,0.0019680315,0.00004391806],"about_ca_topic_score_codex":0.000831102,"about_ca_topic_score_gemma":0.00050770433,"teacher_disagreement_score":0.0050298073,"about_ca_system_score_codex":0.0011446172,"about_ca_system_score_gemma":0.001075785,"threshold_uncertainty_score":0.02660048},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71201366,0.0006378137,0.28411534,0.00017817602,0.000029152057,0.00015589285,0.00011387105,0.0013575519,0.0013986058],"genre_scores_gemma":[0.9156145,0.00013196972,0.0827009,0.00007659194,0.000007887088,0.00009143874,0.00017486383,0.00011277144,0.0010891211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980515,0.00006345717,0.000013802644,0.00005262089,0.00003548457,0.000029472554],"domain_scores_gemma":[0.99952054,0.00026965595,0.00004868422,0.000043774675,0.000091624446,0.0000256583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010769325,0.00081807043,0.0004547247,0.00039762037,0.0001513454,0.0004294125,0.00063297094,0.0008086555,0.0005131904],"category_scores_gemma":[0.0016939121,0.00032100076,0.00046175657,0.0003223025,0.00024511345,0.00031471538,0.00043567436,0.0004961414,0.00010613304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034842218,0.00019689422,0.0028651126,0.0000694731,0.00009375305,0.00009696313,0.00008062034,0.8325571,0.016221754,0.0002739248,0.0004204881,0.14677544],"study_design_scores_gemma":[0.000011316717,0.00007517383,0.0005514689,0.0000030258616,0.000009516906,0.000019995236,0.0000051212724,0.9951427,0.0040014256,0.00006789292,0.00010804921,0.0000042839847],"about_ca_topic_score_codex":0.0069419905,"about_ca_topic_score_gemma":0.0057291626,"teacher_disagreement_score":0.0069419905,"about_ca_system_score_codex":0.0007215484,"about_ca_system_score_gemma":0.00072138436,"threshold_uncertainty_score":0.013803184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93875915,0.002103322,0.05018994,0.0022617998,0.00014947858,0.00016567907,0.003911442,0.00036667075,0.0020924504],"genre_scores_gemma":[0.96679157,0.00038602823,0.027480481,0.0001587195,0.00010361529,0.000042140633,0.0048433524,0.000010554456,0.00018344901],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997546,0.0013246578,0.00021615258,0.0003683558,0.00039525633,0.00014949567],"domain_scores_gemma":[0.98842245,0.008055744,0.0011526105,0.0011709904,0.0009258456,0.00027233415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045643565,0.00061434635,0.0008415619,0.0027133385,0.00038503922,0.0011138895,0.0006179464,0.0005372838,0.00048266933],"category_scores_gemma":[0.017057218,0.00018742302,0.0008068448,0.0019059915,0.0003065273,0.00105963,0.00093422655,0.0011144547,0.0003054217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005960986,0.0005048468,0.7568729,0.00016667954,0.00042501095,0.00035130294,0.00019936568,0.055934433,0.0017305686,0.0012538002,0.0037033595,0.17826152],"study_design_scores_gemma":[0.00007726272,0.00059694663,0.26957563,0.00022706675,0.00019536278,0.0005728609,0.0006438219,0.7100095,0.0038236566,0.0098946225,0.0043157986,0.000067466644],"about_ca_topic_score_codex":0.003690468,"about_ca_topic_score_gemma":0.005415469,"teacher_disagreement_score":0.0045643565,"about_ca_system_score_codex":0.0003927027,"about_ca_system_score_gemma":0.0008425456,"threshold_uncertainty_score":0.024138927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89024854,0.0032401066,0.01683769,0.005579864,0.00016239437,0.00011858364,0.06858896,0.00092339684,0.014300494],"genre_scores_gemma":[0.96550757,0.0013360373,0.0077643017,0.00018814007,0.000026784337,0.000025922911,0.020595478,0.000031420914,0.0045242216],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997743,0.00002255428,0.000010760368,0.000037881553,0.00008611107,0.00006843226],"domain_scores_gemma":[0.99916625,0.00010121073,0.000067825946,0.0000237911,0.0005657331,0.00007522132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052671146,0.0003841529,0.00023340431,0.0017082107,0.0006407336,0.0007750386,0.00071364944,0.0003012682,0.0012970782],"category_scores_gemma":[0.0022324773,0.00014633092,0.00065404736,0.0026615455,0.00017432097,0.00028480426,0.00032549634,0.0004894249,0.00038496125],"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.00021688562,0.00008550325,0.59285945,0.00017944185,0.00018252891,0.00020154218,0.0002457928,0.2812464,0.00053410744,0.002864111,0.025244242,0.09614001],"study_design_scores_gemma":[0.000022980445,0.00004599134,0.30833894,0.0001094422,0.000086030705,0.000066744666,0.0006104675,0.67082125,0.00075901893,0.0012649477,0.017834624,0.000039530954],"about_ca_topic_score_codex":0.9926783,"about_ca_topic_score_gemma":0.9922454,"teacher_disagreement_score":0.016176123,"about_ca_system_score_codex":0.016176123,"about_ca_system_score_gemma":0.020963242,"threshold_uncertainty_score":0.11736649},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9084175,0.00054894615,0.08916126,0.00005086772,0.00006552426,0.00022912522,0.00015086103,0.00079045753,0.00058546296],"genre_scores_gemma":[0.93013245,0.00009154639,0.06870539,0.00003193767,0.000019451687,0.00014340265,0.00025477106,0.00028359928,0.0003374354],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99412495,0.0029683344,0.000592446,0.0011975223,0.0009612181,0.0001556287],"domain_scores_gemma":[0.9796948,0.011939154,0.0019803941,0.001978061,0.0039840885,0.00042346364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011567851,0.00069615734,0.00057805126,0.0011516442,0.0004472647,0.0008940682,0.0008432548,0.0008626851,0.0005635757],"category_scores_gemma":[0.030249663,0.00036631618,0.0005775292,0.0006456169,0.000544584,0.0005275337,0.000932178,0.00039615444,0.00020971986],"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.015162633,0.0007119865,0.13290548,0.00088663265,0.0011694832,0.00027330674,0.004365056,0.10736534,0.1348322,0.0006388936,0.001955045,0.5997339],"study_design_scores_gemma":[0.0003246019,0.0033469014,0.28654563,0.00007654357,0.00054058665,0.0008587754,0.0007458886,0.62301165,0.08201169,0.0005261006,0.0017415272,0.00026998715],"about_ca_topic_score_codex":0.0022920235,"about_ca_topic_score_gemma":0.0028858369,"teacher_disagreement_score":0.011567851,"about_ca_system_score_codex":0.0005563709,"about_ca_system_score_gemma":0.0005193759,"threshold_uncertainty_score":0.061177373},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008537448,0.0005829987,0.988282,0.00031500522,0.000059310452,0.00004532812,0.00006406553,0.0009864683,0.0011273187],"genre_scores_gemma":[0.6716511,0.00071202277,0.32325113,0.00049301516,0.0001734703,0.00022037169,0.0002592079,0.000321178,0.002918422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932396,0.00023274205,0.000031391723,0.00013233384,0.0001625147,0.000117072355],"domain_scores_gemma":[0.99911636,0.000524671,0.00008864469,0.00005646191,0.0001469749,0.00006692981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019364561,0.00091075955,0.0010901624,0.00047218418,0.0004278343,0.00092439837,0.0019234795,0.0009928175,0.0016331761],"category_scores_gemma":[0.004138203,0.00040618645,0.0005074097,0.0005927543,0.0006356297,0.0013402241,0.001019597,0.0014776419,0.00035463477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007040007,0.000059492806,0.00037292208,0.000036867357,0.000025811843,0.000030167927,0.000026580377,0.9524422,0.0011757282,0.0047971904,0.0018708421,0.03909174],"study_design_scores_gemma":[0.0000034733828,0.000008661363,0.000024798814,0.000001965132,0.0000017456757,0.0000043830278,0.0000022173351,0.9983941,0.00011280027,0.0012790958,0.0001646797,0.0000021034627],"about_ca_topic_score_codex":0.009451072,"about_ca_topic_score_gemma":0.0101321805,"teacher_disagreement_score":0.009451072,"about_ca_system_score_codex":0.0011478799,"about_ca_system_score_gemma":0.0023015342,"threshold_uncertainty_score":0.018792093},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01871823,0.0003078985,0.9753194,0.00019105914,0.00007609845,0.00010723356,0.000038885155,0.0003543765,0.004886894],"genre_scores_gemma":[0.37292126,0.0003769188,0.6209981,0.0003576774,0.00009390436,0.00052476214,0.00020981561,0.0001459037,0.0043716216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997305,0.000102606224,0.000017691093,0.000031374977,0.00009409222,0.000023728608],"domain_scores_gemma":[0.9994802,0.0002978415,0.00005657676,0.000039124152,0.00009656963,0.0000297055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010290145,0.000973107,0.0007282721,0.00086150627,0.00035703942,0.0006403887,0.0010389878,0.0011352196,0.0021150894],"category_scores_gemma":[0.0024385334,0.0002984102,0.0006708276,0.0005023657,0.0005300481,0.00069506816,0.0010811223,0.00069590664,0.0003929096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090151436,0.00010599819,0.001597663,0.00015669967,0.00008694991,0.00011619416,0.000114256894,0.8342697,0.0030022578,0.013499703,0.0024416319,0.14451869],"study_design_scores_gemma":[0.000016072278,0.00005117628,0.0001272189,0.000011417077,0.000008083298,0.000022885048,0.000015174148,0.9956867,0.00047435996,0.0023298012,0.0012525271,0.0000046579717],"about_ca_topic_score_codex":0.0012511803,"about_ca_topic_score_gemma":0.0016617167,"teacher_disagreement_score":0.0021150894,"about_ca_system_score_codex":0.00032256226,"about_ca_system_score_gemma":0.0006966103,"threshold_uncertainty_score":0.007075727},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39574057,0.003642521,0.558745,0.0013650676,0.0005732203,0.00024311173,0.013187223,0.019754192,0.0067490838],"genre_scores_gemma":[0.7596805,0.00089079153,0.19312155,0.0004509733,0.0001555469,0.00029954387,0.038897306,0.0005572273,0.005946533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946123,0.00018787208,0.00003799732,0.00013167833,0.000120446995,0.00006073159],"domain_scores_gemma":[0.99922884,0.0003123431,0.00007702414,0.00016288897,0.00017479804,0.000044154745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006870319,0.0015959517,0.00064727303,0.0011046965,0.00026362637,0.0006562371,0.0008623933,0.00061914284,0.0018747814],"category_scores_gemma":[0.0022433246,0.00025847644,0.000616747,0.0012417288,0.00037335505,0.001712648,0.000851132,0.0012289715,0.0019562151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090196077,0.00073480874,0.010341352,0.0004769964,0.0002887972,0.00028009075,0.00020316726,0.26854962,0.01661576,0.010244229,0.04921355,0.6421497],"study_design_scores_gemma":[0.000025703372,0.000118433454,0.0007126862,0.000014358608,0.00001815737,0.000045619727,0.000039296145,0.986541,0.0046878792,0.0049654287,0.0028166962,0.0000148626405],"about_ca_topic_score_codex":0.0043616015,"about_ca_topic_score_gemma":0.010475861,"teacher_disagreement_score":0.0043616015,"about_ca_system_score_codex":0.0005765123,"about_ca_system_score_gemma":0.00083325256,"threshold_uncertainty_score":0.008672416},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033850314,0.011364629,0.8084941,0.15533364,0.0033799526,0.000080783495,0.0001760638,0.0004887999,0.017296942],"genre_scores_gemma":[0.30736178,0.0208798,0.5347607,0.096331894,0.014555577,0.0010097151,0.00020041315,0.0014041936,0.023495963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99220204,0.004967801,0.00026832585,0.000909557,0.0015346148,0.00011761671],"domain_scores_gemma":[0.9491598,0.043402527,0.0009471165,0.00431226,0.0017412707,0.0004369827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018956015,0.0012227487,0.0016387384,0.0012302814,0.0015776347,0.0040503945,0.0040772823,0.005249742,0.003458059],"category_scores_gemma":[0.06318335,0.00065283675,0.0009116976,0.0007559356,0.016453678,0.009160503,0.0039942297,0.024666352,0.0013913402],"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.00008195533,0.000027082244,0.0006381491,0.00029954835,0.00010353674,0.00028311295,0.00060767744,0.014245715,0.0004782302,0.9188635,0.030654682,0.033716783],"study_design_scores_gemma":[0.000028012804,0.000033666474,0.00014356137,0.00027463143,0.000016110458,0.00023592578,0.00009935143,0.028299967,0.0004961138,0.93821096,0.0321189,0.00004295487],"about_ca_topic_score_codex":0.0014903034,"about_ca_topic_score_gemma":0.0021255668,"teacher_disagreement_score":0.018956015,"about_ca_system_score_codex":0.0015089716,"about_ca_system_score_gemma":0.001125089,"threshold_uncertainty_score":0.100250244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9888587,0.001109933,0.007821508,0.00019945565,0.00012686821,0.00034790015,0.00060220517,0.000046787274,0.0008867461],"genre_scores_gemma":[0.9957722,0.0003119217,0.002423525,0.000059051967,0.00005009783,0.00044718877,0.0005495933,0.000009955303,0.0003765012],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99048585,0.0065371185,0.0007531428,0.00074569776,0.0010026832,0.00047543852],"domain_scores_gemma":[0.9697823,0.022571836,0.004337142,0.0014536697,0.0011934845,0.00066155754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012252067,0.0005092679,0.0012859593,0.0007698811,0.00024446135,0.000670593,0.0006702972,0.0005844516,0.0027030844],"category_scores_gemma":[0.03590655,0.00017363981,0.0018794835,0.0010721387,0.000298421,0.00044811415,0.0005903916,0.0010832053,0.00016887434],"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.07816906,0.011048282,0.63093334,0.0027204365,0.015440046,0.00053515896,0.0014834217,0.025541067,0.0030367146,0.0018599923,0.0018699951,0.22736241],"study_design_scores_gemma":[0.0016489351,0.038761914,0.825208,0.00039120665,0.008164383,0.00020974419,0.00082299707,0.1175593,0.0026114504,0.0009915985,0.0035229188,0.000107631495],"about_ca_topic_score_codex":0.004325553,"about_ca_topic_score_gemma":0.0017087066,"teacher_disagreement_score":0.012252067,"about_ca_system_score_codex":0.0008376018,"about_ca_system_score_gemma":0.0009956377,"threshold_uncertainty_score":0.06479585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3558499,0.0012457899,0.63098264,0.0006115713,0.00013182536,0.00014517906,0.00050211744,0.0017644177,0.008766606],"genre_scores_gemma":[0.9593966,0.00015450058,0.038723327,0.00009064396,0.000020406362,0.000075905074,0.00038234735,0.000046599216,0.0011096519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958223,0.00011917425,0.000031493735,0.00012345945,0.00007606741,0.00006766194],"domain_scores_gemma":[0.9988368,0.00070256594,0.00014882679,0.00007005243,0.00021006483,0.000031752606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016704432,0.0009487021,0.00072020735,0.000591394,0.00026840018,0.0006554442,0.000807142,0.0008250488,0.0010426412],"category_scores_gemma":[0.0051985634,0.0005191356,0.0004693457,0.0005673314,0.00032815416,0.0009333618,0.00052381115,0.0011696406,0.0003601134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006111816,0.000046266767,0.0010435664,0.000023145354,0.000029011295,0.000015159318,0.000017970659,0.973438,0.0006268021,0.0008856341,0.00036939167,0.023443928],"study_design_scores_gemma":[0.0000036758286,0.0000091425645,0.00019498475,0.000002893979,0.0000024578853,0.0000022730314,0.0000020351472,0.9990526,0.00022443764,0.00043971825,0.00006395411,0.0000019172705],"about_ca_topic_score_codex":0.023229973,"about_ca_topic_score_gemma":0.021025522,"teacher_disagreement_score":0.023229973,"about_ca_system_score_codex":0.0012180784,"about_ca_system_score_gemma":0.0013557929,"threshold_uncertainty_score":0.046189547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036375877,0.00006970131,0.96099156,0.0002113819,0.000028842473,0.000430806,0.00005433916,0.0006379,0.0011996148],"genre_scores_gemma":[0.5862817,0.00006615042,0.41244876,0.00007044913,0.000025029498,0.0004991527,0.00012607587,0.00008213402,0.0004004674],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9903858,0.0055551813,0.0006390213,0.001078546,0.0020961412,0.00024534404],"domain_scores_gemma":[0.9774049,0.0138578415,0.0026692795,0.0014107854,0.0040719756,0.0005852547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012192685,0.0010146338,0.0007982981,0.0027705743,0.00074607274,0.0016259575,0.0015496771,0.00064458064,0.001263841],"category_scores_gemma":[0.053531136,0.00031051485,0.0006233283,0.0014119361,0.000843528,0.0018087279,0.0031241595,0.0013805788,0.00021925362],"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.0004935831,0.000803771,0.019095544,0.0004227321,0.00024430268,0.000099148165,0.0025916568,0.18403798,0.00524379,0.013297628,0.0017901943,0.77187973],"study_design_scores_gemma":[0.00005632912,0.0003374649,0.0038057403,0.00008450665,0.000059847665,0.000034591485,0.00045128432,0.9682919,0.0048926827,0.020583214,0.0013357386,0.000066668814],"about_ca_topic_score_codex":0.0026006163,"about_ca_topic_score_gemma":0.0028936684,"teacher_disagreement_score":0.012192685,"about_ca_system_score_codex":0.0012869469,"about_ca_system_score_gemma":0.0026298687,"threshold_uncertainty_score":0.064481854},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11290635,0.00044508566,0.8748734,0.0008908809,0.00005221855,0.0019942524,0.0005821255,0.0007941785,0.007461541],"genre_scores_gemma":[0.5026873,0.00026769104,0.4915913,0.00027730994,0.000020604522,0.0028247302,0.0005085363,0.00009338454,0.0017291644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965933,0.0024900434,0.00014641162,0.0003301108,0.00023964595,0.00020048008],"domain_scores_gemma":[0.951825,0.042902775,0.0016537429,0.0007897722,0.0022305239,0.00059819815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013368903,0.001149064,0.001415773,0.0015976058,0.0008739196,0.0015433736,0.0021119416,0.002105606,0.0051543363],"category_scores_gemma":[0.038086295,0.0009984476,0.0010916246,0.0012604857,0.0009773578,0.0009955098,0.0012818439,0.0016179172,0.000338946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001423675,0.000046485853,0.0025385658,0.00005214989,0.00006335843,0.00007539235,0.000079855825,0.97991484,0.00009934124,0.007959363,0.00047584038,0.008552464],"study_design_scores_gemma":[0.00007727365,0.00004813709,0.00019519932,0.000023854576,0.000019340257,0.000022660335,0.000021369366,0.995567,0.0000708869,0.0035127085,0.00043432764,0.0000072989333],"about_ca_topic_score_codex":0.031222353,"about_ca_topic_score_gemma":0.021509431,"teacher_disagreement_score":0.031222353,"about_ca_system_score_codex":0.0028842348,"about_ca_system_score_gemma":0.0066593606,"threshold_uncertainty_score":0.070702374},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017059209,0.000116223186,0.98153716,0.00007958096,0.000027569433,0.000032403976,0.000041370084,0.0005457423,0.00056077004],"genre_scores_gemma":[0.5780198,0.0002080867,0.4178755,0.00014265742,0.00005443276,0.000105475476,0.0004237174,0.0000777496,0.003092586],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997253,0.000025276959,0.00002024814,0.000082640894,0.00010352223,0.00004295534],"domain_scores_gemma":[0.999772,0.00004547025,0.000033839508,0.00002833346,0.00010095551,0.000019339013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004569647,0.00081583153,0.0006849784,0.0010330928,0.00024841595,0.00047056418,0.00082398613,0.0007026309,0.0010178695],"category_scores_gemma":[0.00088600744,0.00027678444,0.0008067749,0.0006171948,0.00026833825,0.0009416348,0.00080157316,0.0009015284,0.00030577544],"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.00015265105,0.00013577711,0.003112601,0.00009186648,0.00009023134,0.00018845861,0.000115797026,0.21168873,0.05101198,0.004269175,0.002600368,0.72654235],"study_design_scores_gemma":[0.0000050921085,0.000031988475,0.0005634956,0.0000032604603,0.000012015016,0.000044337965,0.000010033313,0.99233913,0.0054954593,0.00094515475,0.0005421618,0.000007807933],"about_ca_topic_score_codex":0.003586326,"about_ca_topic_score_gemma":0.0032278646,"teacher_disagreement_score":0.003586326,"about_ca_system_score_codex":0.00037949038,"about_ca_system_score_gemma":0.0006580154,"threshold_uncertainty_score":0.007130921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001597883,0.00005038075,0.9978569,0.000029282819,0.000013607026,0.00000921148,0.000011578116,0.00021683262,0.00021437144],"genre_scores_gemma":[0.09485239,0.00021561189,0.90254414,0.000047602156,0.000036693313,0.00009569673,0.00019032002,0.00013367043,0.0018838538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949193,0.00013102173,0.00003318329,0.00009948718,0.0001982441,0.000046026697],"domain_scores_gemma":[0.99937123,0.0002156771,0.00009773385,0.00008418815,0.00020372689,0.000027495995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008594504,0.0010639329,0.0010086255,0.00055748835,0.00031524993,0.0007122196,0.00088890153,0.0008049142,0.0013789239],"category_scores_gemma":[0.0019671584,0.0003705178,0.0010235874,0.00070691877,0.00052350195,0.00081743643,0.0006544533,0.0012902213,0.0007568835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018703667,0.000063321764,0.00073300273,0.0001810073,0.00015355577,0.000107752174,0.00014437245,0.64183843,0.039223626,0.031467024,0.0030254766,0.28287542],"study_design_scores_gemma":[0.0000050981544,0.000017242919,0.00005746604,0.0000028166203,0.000005667807,0.000023445536,0.0000033762265,0.9955973,0.0021746599,0.0013296135,0.00077598175,0.000007219348],"about_ca_topic_score_codex":0.0044458797,"about_ca_topic_score_gemma":0.0037171377,"teacher_disagreement_score":0.0044458797,"about_ca_system_score_codex":0.00045809997,"about_ca_system_score_gemma":0.0015195104,"threshold_uncertainty_score":0.0088400245},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1740514,0.00023774928,0.8179994,0.000709573,0.00010381704,0.00024374388,0.00015087177,0.0032440736,0.0032593508],"genre_scores_gemma":[0.74261993,0.00008474872,0.25214162,0.00068105856,0.00005494478,0.00028082135,0.00062487554,0.0003517809,0.0031602078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990557,0.00037997175,0.000051754745,0.0001742239,0.00019706678,0.0001412214],"domain_scores_gemma":[0.9960795,0.0025512825,0.00020963843,0.0005159611,0.0004981299,0.00014559933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026434187,0.0008203654,0.0009570021,0.0009614002,0.0007050101,0.0010575041,0.001962033,0.0011959911,0.003674172],"category_scores_gemma":[0.009219539,0.00054264045,0.00095785095,0.0006166853,0.001074162,0.0018421307,0.001325013,0.0017380442,0.00093602284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011426335,0.0007726358,0.014877597,0.00017715206,0.00020666052,0.00041401558,0.0005268692,0.38102168,0.025010644,0.026303818,0.009500416,0.5400459],"study_design_scores_gemma":[0.000041839096,0.00008748094,0.0004816739,0.000009849869,0.000026001162,0.00003867325,0.00004368742,0.9894908,0.0037372734,0.005393211,0.0006412541,0.0000081417775],"about_ca_topic_score_codex":0.004165625,"about_ca_topic_score_gemma":0.008024248,"teacher_disagreement_score":0.004165625,"about_ca_system_score_codex":0.0010913553,"about_ca_system_score_gemma":0.0017293963,"threshold_uncertainty_score":0.013979912},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17519477,0.001234873,0.81713086,0.0006325601,0.00007476726,0.000057998415,0.000175114,0.0011810702,0.004317961],"genre_scores_gemma":[0.8956774,0.00044397905,0.101226665,0.00016560804,0.000037743794,0.00007769631,0.00034006854,0.00009981696,0.0019311281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996768,0.0001036136,0.000023591007,0.000054305983,0.00009381703,0.000047919108],"domain_scores_gemma":[0.9987708,0.0007643073,0.00015817721,0.00006195703,0.00020655828,0.000038119902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014869573,0.00095133216,0.00084006763,0.00045568906,0.0002541518,0.00077131385,0.0007935869,0.00096802856,0.0007818226],"category_scores_gemma":[0.004410917,0.00059639645,0.00054919615,0.000518078,0.00041794102,0.0010123295,0.00076209055,0.0011842652,0.00026402154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024269286,0.00003079833,0.00048435386,0.000016178165,0.000020239762,0.000008774693,0.000007853487,0.9859321,0.00045849197,0.0010404031,0.00017746622,0.011799155],"study_design_scores_gemma":[0.000002252521,0.00000527984,0.000040246756,0.0000013985554,0.0000019090335,8.1866153e-7,5.6008327e-7,0.99942553,0.00018457712,0.00030100724,0.00003499067,0.0000014115557],"about_ca_topic_score_codex":0.022248091,"about_ca_topic_score_gemma":0.019354165,"teacher_disagreement_score":0.022248091,"about_ca_system_score_codex":0.00092928845,"about_ca_system_score_gemma":0.0018812796,"threshold_uncertainty_score":0.044237196},"labels":[],"label_agreement":null}]}