{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":118,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":118,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"bc50ec644ded","filters":{"venue":"Computational Intelligence"}},"results":[{"id":"W2040467972","doi":"10.1111/j.1467-8640.2012.00460.x","title":"CROWDSOURCING A WORD–EMOTION ASSOCIATION LEXICON","year":2012,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":2584,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"National Research Council Canada","keywords":"Lexicon; Crowdsourcing; Computer science; Annotation; Word (group theory); Natural language processing; Polarity (international relations); Term (time); Sentiment analysis; Association (psychology); Artificial intelligence; Quality (philosophy); Psychology; Linguistics; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.03803301095524386,"gpt":0.2981967277978994,"spread":0.2601637168426555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006741221,0.0001045572,0.0001148825,0.0001491668,0.0001628364,0.0001840631,0.0003421992,0.00005183916,0.0001107326],"category_scores_gemma":[0.0001139361,0.0001074142,0.00008784296,0.0005114548,0.00001341884,0.0008773456,0.0001100469,0.0001045862,0.0005280208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000163002,"about_ca_system_score_gemma":0.00003838384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007491012,"about_ca_topic_score_gemma":6.288315e-7,"domain_scores_codex":[0.9986927,0.00007621993,0.0002838167,0.0002176479,0.000441524,0.0002880985],"domain_scores_gemma":[0.9990757,0.0003119016,0.0001948368,0.0001587857,0.0001638539,0.00009492831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004889281,0.0002487156,0.09458412,0.00001431043,0.0001234566,0.000001758771,0.004508726,0.238667,0.0002122091,0.4818862,0.003086878,0.1766617],"study_design_scores_gemma":[0.00007131066,0.00001990555,0.04181354,0.00003078272,0.0000130926,0.000007118207,0.0001562032,0.9310315,0.002164239,0.02219823,0.002241629,0.0002524717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01786597,0.0002409151,0.9789659,0.0006685962,0.0006268375,0.00005774135,5.07862e-7,0.0001048745,0.001468632],"genre_scores_gemma":[0.9236347,0.000007643431,0.07535514,0.0003095857,0.0002181402,0.000004821127,0.0000132226,0.000005370056,0.0004513861],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9057688,"threshold_uncertainty_score":0.6786815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023639956","doi":"10.1111/j.0824-7935.2004.t01-1-00228.x","title":"A Multiple Resampling Method for Learning from Imbalanced Data Sets","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":1022,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Medical Protective Association; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Dalhousie University","keywords":"Undersampling; Oversampling; Resampling; Computer science; Machine learning; Artificial intelligence; Class (philosophy); Scheme (mathematics); Task (project management); Data mining; Pattern recognition (psychology); Mathematics; Bandwidth (computing); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1485671637564458,"gpt":0.3960542626513615,"spread":0.2474870988949157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005912044,0.000170555,0.0001904352,0.0001114447,0.0002466361,0.0002240389,0.002510355,0.00007432677,0.000007587821],"category_scores_gemma":[0.001042111,0.0001820849,0.00004833495,0.0003715914,0.0000523561,0.0008704952,0.0006677986,0.0002127445,0.00006528133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001046047,"about_ca_system_score_gemma":0.0001884907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001156245,"about_ca_topic_score_gemma":0.00001310205,"domain_scores_codex":[0.9980307,0.00007360439,0.0004202985,0.0008785095,0.0003250194,0.0002719278],"domain_scores_gemma":[0.996691,0.001698712,0.0002172096,0.001003679,0.0003043317,0.00008505763],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002143019,0.00007855353,0.0002387481,0.00001541981,0.00003085788,0.000003436541,0.000499364,0.7082524,0.001750825,0.138056,0.0005056058,0.1505474],"study_design_scores_gemma":[0.000135511,0.00003150521,0.00060933,0.00003526195,0.000003530049,0.000005079946,0.00002751347,0.7290077,0.008515215,0.2593768,0.002085436,0.0001671906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002567119,0.0001015517,0.9973353,0.0009668512,0.0002035663,0.0003522985,0.0001619051,0.0005615682,0.00006026378],"genre_scores_gemma":[0.2495023,0.00001107783,0.7489188,0.0003085135,0.00005589297,0.00005307359,0.001123354,0.0000128791,0.00001411219],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2492456,"threshold_uncertainty_score":0.7425206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063596712","doi":"10.1111/j.1467-8640.2006.00277.x","title":"SENTIMENT CLASSIFICATION of MOVIE REVIEWS USING CONTEXTUAL VALENCE SHIFTERS","year":2006,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":750,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bigram; Valence (chemistry); Negation; Natural language processing; Computer science; Artificial intelligence; Term (time); Sentiment analysis; Support vector machine; Pattern recognition (psychology); Physics; Trigram","retraction":null,"screen_n_in":null,"score":{"opus":0.09465421034018377,"gpt":0.3375719904772647,"spread":0.2429177801370809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004280611,0.0001319492,0.0002261127,0.0001614489,0.00009451438,0.00008038547,0.0005265999,0.00003388226,0.00006176437],"category_scores_gemma":[0.00002853288,0.0001268565,0.0001371166,0.0005361907,0.0000862653,0.0003320824,0.0001042013,0.0000651099,0.00007448354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005283663,"about_ca_system_score_gemma":0.00005549703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003970307,"about_ca_topic_score_gemma":0.000002105275,"domain_scores_codex":[0.9982965,0.0000967189,0.0006977329,0.0003550827,0.0003915083,0.0001624371],"domain_scores_gemma":[0.998912,0.0001612859,0.0004027694,0.0002726413,0.0002073565,0.00004395803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008272749,0.000261599,0.005787299,0.00005986757,0.00004830297,0.000004048345,0.0005537206,0.4503601,0.004117923,0.4721464,0.001793716,0.0648587],"study_design_scores_gemma":[0.00005291087,0.00002133852,0.004955175,0.00008407907,0.00001277069,0.000004439608,0.00004720559,0.9798491,0.002798646,0.011006,0.001021031,0.0001473137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01489046,0.001093298,0.9830535,0.0001570538,0.0002027777,0.0001489339,0.000002566321,0.00003127481,0.0004201132],"genre_scores_gemma":[0.8433369,0.00004209953,0.1563237,0.0000990761,0.00005410193,0.000006199239,0.00002600729,0.000004916903,0.000107055],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8284464,"threshold_uncertainty_score":0.5173057,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1569507287","doi":"10.1111/coin.12024","title":"Using Hashtags to Capture Fine Emotion Categories from Tweets","year":2014,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":412,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"","keywords":"Lexicon; Social media; Computer science; Emotion classification; Sentiment analysis; Big Five personality traits; Word (group theory); Microblogging; Admiration; Natural language processing; Artificial intelligence; Emotion detection; Personality; Psychology; Emotion recognition; Linguistics; Social psychology; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.06287620001503862,"gpt":0.3180379788060219,"spread":0.2551617787909832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001973091,0.0001381531,0.0001624932,0.0001496124,0.0001643399,0.0002342863,0.0005443624,0.0000441646,0.00009610151],"category_scores_gemma":[0.00007588007,0.0001347817,0.00006966509,0.0005128829,0.00003042899,0.0003100786,0.0001768972,0.00008474543,0.0002635564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004207456,"about_ca_system_score_gemma":0.00004294517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001798384,"about_ca_topic_score_gemma":0.00001624441,"domain_scores_codex":[0.998681,0.000063317,0.0002923652,0.0004183052,0.00036128,0.0001837142],"domain_scores_gemma":[0.9990798,0.0002333894,0.000102185,0.000259231,0.0002151085,0.0001102511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003571844,0.00003358218,0.001764902,0.000003525105,0.00002843663,0.000002187335,0.001698946,0.8799006,0.0002983691,0.08247226,0.0006458497,0.0331478],"study_design_scores_gemma":[0.00003876674,0.00002441688,0.003687653,0.00002607241,0.000007652896,0.000002769915,0.00006658957,0.9491493,0.001767894,0.04410637,0.0009520356,0.0001705378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04487142,0.00007955726,0.9533576,0.0007448538,0.0005074251,0.00006419532,0.000002884675,0.0000717099,0.0003003041],"genre_scores_gemma":[0.7442498,8.246187e-7,0.255022,0.0004759918,0.0001364094,0.0000021266,0.00003324643,0.000005575652,0.00007395504],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6993784,"threshold_uncertainty_score":0.5496238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130202378","doi":"10.1111/j.0824-7935.2004.00234.x","title":"Preference‐Based Constrained Optimization with CP‐Nets","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":177,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Backtracking; Mathematical optimization; Computer science; Preference; Set (abstract data type); Pareto principle; Property (philosophy); Optimization problem; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04561028564651798,"gpt":0.2598856250634991,"spread":0.2142753394169811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001119695,0.0001688328,0.0001257861,0.0001734627,0.0001698173,0.0001922833,0.0003780184,0.00005727599,0.0001679775],"category_scores_gemma":[0.00004337315,0.0001558832,0.00003974597,0.0006097857,0.0001561705,0.0005185257,0.00004234674,0.000120182,0.00006745875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009737752,"about_ca_system_score_gemma":0.0005172011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001233139,"about_ca_topic_score_gemma":0.00000958282,"domain_scores_codex":[0.9986959,0.00003704357,0.0002815987,0.0004010809,0.0003831467,0.000201221],"domain_scores_gemma":[0.9990003,0.0001338093,0.000131255,0.0002311965,0.0003883956,0.0001150054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008527532,0.00004232502,0.0001589474,0.000004399599,0.000007941056,0.000005914398,0.0001116292,0.8564628,0.000005874734,0.1303721,0.00001130922,0.01280823],"study_design_scores_gemma":[0.0003325352,0.0001189994,0.000825321,0.00004797427,0.000004636108,0.00004567389,0.00002689072,0.9821427,0.0009632795,0.01520871,0.00006087499,0.0002223582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005527618,0.0000176146,0.9949422,0.001905087,0.0001476877,0.0002320314,0.000004742795,0.0002834154,0.001914421],"genre_scores_gemma":[0.5305465,0.000002741541,0.4689223,0.0004567966,0.00001076971,0.00001149209,0.00003021258,0.000005427376,0.00001376643],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5299937,"threshold_uncertainty_score":0.6356732,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W45569842","doi":"10.1111/j.1467-8640.2012.00417.x","title":"MULTI‐DOCUMENT SUMMARIZATION OF EVALUATIVE TEXT","year":2012,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of British Columbia","funders":"","keywords":"Automatic summarization; Computer science; Multi-document summarization; Information retrieval; Natural language processing","retraction":null,"screen_n_in":null,"score":{"opus":0.06534615047374848,"gpt":0.3594688220181262,"spread":0.2941226715443778,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004699308,0.00008939971,0.0001207373,0.0001344805,0.00006752372,0.00004228358,0.0003636479,0.00002599505,0.0001403399],"category_scores_gemma":[0.00007344597,0.00008393175,0.00006753109,0.0004630916,0.0000440422,0.0005464691,0.0001340748,0.00004909963,0.0001464936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003559961,"about_ca_system_score_gemma":0.00004387846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008112697,"about_ca_topic_score_gemma":5.21583e-7,"domain_scores_codex":[0.9988462,0.00007868531,0.0003285749,0.0001797668,0.0004032279,0.0001635277],"domain_scores_gemma":[0.9990786,0.0002318427,0.0001795478,0.0001669563,0.0002752803,0.00006772439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006767459,0.0003564988,0.02308769,0.00001909062,0.0001158336,5.849089e-7,0.005591016,0.3895454,0.0005438941,0.4687931,0.0004252451,0.1115148],"study_design_scores_gemma":[0.00006899868,0.00002978041,0.01819632,0.00002216499,0.00001014542,0.000001740577,0.0001311755,0.967091,0.006776234,0.007292449,0.0002581224,0.0001218574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005299142,0.0003672358,0.9933924,0.0001227466,0.0002771801,0.0000877588,9.8599e-7,0.00002699485,0.000425519],"genre_scores_gemma":[0.7441867,0.000009592966,0.2555622,0.00007444168,0.00003486482,0.000004953693,0.00001476407,0.000003007041,0.0001093863],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7388876,"threshold_uncertainty_score":0.3422638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081707439","doi":"10.1111/j.0824-7935.2004.00247.x","title":"Detecting New Forms of Network Intrusion Using Genetic Programming","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Crossover; False positive rate; Genetic programming; Intrusion detection system; Computer science; Constant false alarm rate; Artificial intelligence; Data mining; Machine learning; Pattern recognition (psychology)","retraction":null,"screen_n_in":null,"score":{"opus":0.03434656504020275,"gpt":0.2826377729728897,"spread":0.248291207932687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002417284,0.000146437,0.0001715152,0.0001187922,0.0002497459,0.0001011302,0.0005319514,0.000076284,0.00001648139],"category_scores_gemma":[0.00005984359,0.000145493,0.00008608687,0.0009652889,0.00006259943,0.0004301617,0.0002657488,0.0001782548,0.00001991704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009673768,"about_ca_system_score_gemma":0.0002114439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001079421,"about_ca_topic_score_gemma":0.00001909388,"domain_scores_codex":[0.998462,0.00003461346,0.000496088,0.0003389859,0.0003653363,0.0003029988],"domain_scores_gemma":[0.9990956,0.0001237173,0.0002536067,0.0002301928,0.0001844469,0.0001124692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005679962,0.00001853718,0.0000544891,0.000008748154,0.000006382699,0.000002725933,0.0002955664,0.699855,0.00008675293,0.03469471,0.000004688477,0.2649667],"study_design_scores_gemma":[0.00009292952,0.0001331796,0.0004032434,0.0001252512,0.00000502141,0.00007661986,0.00002211088,0.6378323,0.004935753,0.3560233,0.0001948371,0.0001554255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1062728,0.0003338724,0.8925297,0.00007780952,0.0004418424,0.0001784113,2.3143e-7,0.0001032644,0.00006208329],"genre_scores_gemma":[0.5629991,0.00001109598,0.4367619,0.00006547812,0.0001500854,0.000002031201,9.655357e-7,0.000006065767,0.000003318354],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4567263,"threshold_uncertainty_score":0.5933033,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163462657","doi":"10.1111/1467-8640.00184","title":"Trends in Agent Communication Language","year":2002,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Teamwork; Flexibility (engineering); Negotiation; Function (biology); Multi-agent system; Proactivity; Software agent; Knowledge management; Order (exchange); Artificial intelligence; Software engineering; Human–computer interaction","retraction":null,"screen_n_in":null,"score":{"opus":0.06936328498053794,"gpt":0.3179263097049285,"spread":0.2485630247243906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002120989,0.0000929403,0.00009902645,0.0002689624,0.00007345891,0.00008515406,0.0005970728,0.0000382859,0.0002764428],"category_scores_gemma":[0.00002374682,0.00009432936,0.00004422438,0.0006114409,0.00002499287,0.0003515617,0.0001065291,0.0001005378,0.0003923663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007220068,"about_ca_system_score_gemma":0.000006832724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008394763,"about_ca_topic_score_gemma":0.00003848175,"domain_scores_codex":[0.9989636,0.00009910799,0.0003051317,0.0002385107,0.0002469359,0.0001467448],"domain_scores_gemma":[0.9993107,0.0001402125,0.00009503134,0.0003463021,0.00005911327,0.00004858424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002357488,0.0002710355,0.00182567,0.00001439785,0.00001226923,0.00001982155,0.01193528,0.2158166,0.00009088276,0.1612592,0.003342678,0.6054097],"study_design_scores_gemma":[0.00007497999,0.00001624501,0.01359442,0.00002626128,9.00444e-7,0.000009214368,0.0000738206,0.9821596,0.0002144098,0.002936045,0.0007766467,0.0001175097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01551319,0.000964421,0.9773555,0.001012468,0.0001911536,0.00009686893,0.000001939847,0.0001027457,0.004761692],"genre_scores_gemma":[0.9717442,0.0000324929,0.02722854,0.0002054081,0.00002345585,0.00001427385,0.00001846926,0.000004859226,0.0007283158],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.956231,"threshold_uncertainty_score":0.5043206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162068502","doi":"10.1111/j.0824-7935.2004.00240.x","title":"A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; European Commission","keywords":"Preference; Artificial intelligence; Set (abstract data type); Variety (cybernetics); Computer science; Representation (politics); Machine learning; Qualitative reasoning; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1967773018483017,"gpt":0.3044729413807262,"spread":0.1076956395324244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000667777,0.0001169045,0.0001705978,0.0001395529,0.00006876713,0.0000738448,0.0004498929,0.00005857991,0.000002227786],"category_scores_gemma":[0.0003118329,0.0001130453,0.00002380525,0.000558138,0.000112567,0.0003071177,0.0001440565,0.0001306235,0.00001171068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000648918,"about_ca_system_score_gemma":0.0002248781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002458416,"about_ca_topic_score_gemma":0.0002075783,"domain_scores_codex":[0.998816,0.0000921947,0.0003331876,0.0003931553,0.000191538,0.0001739961],"domain_scores_gemma":[0.9990233,0.0003892465,0.0001506839,0.0001967299,0.0001828837,0.00005715005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001626706,0.000162638,0.06920705,0.0000410386,0.00001142626,0.000002814597,0.003557516,0.2216778,0.00005761099,0.6652869,0.000002378127,0.03997651],"study_design_scores_gemma":[0.00009534768,0.00004020296,0.44877,0.00007145036,0.000001324786,0.000008031058,0.00004661111,0.5060926,0.0005351647,0.04423392,0.000002964918,0.0001023489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2150272,0.000487256,0.7835643,0.00004951524,0.00005863311,0.0001195984,0.000001592842,0.00002934903,0.0006625714],"genre_scores_gemma":[0.9274231,0.00004197811,0.07247086,0.00001581941,0.000009129388,0.00001344061,0.00001113876,0.000004551409,0.00001004072],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7123958,"threshold_uncertainty_score":0.4609853,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124137748","doi":"10.1111/1467-8640.t01-1-00201","title":"Reputation Formalization for an Information–Sharing Multi–Agent System","year":2002,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reputation; Computer science; Sensibility; Multidisciplinary approach; Reputation system; Relation (database); Information sharing; Knowledge management; World Wide Web; Data mining; Sociology; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.06398183211286278,"gpt":0.3200983920745432,"spread":0.2561165599616804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001326408,0.0001010736,0.00009429055,0.00006918248,0.0002746172,0.0001647014,0.0001570484,0.00003086969,0.00007793249],"category_scores_gemma":[0.00001250661,0.0001106547,0.00006029845,0.0001451609,0.00002630797,0.001005727,0.00002693956,0.00005289564,0.00009752707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005722312,"about_ca_system_score_gemma":0.00001694448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004961888,"about_ca_topic_score_gemma":0.000001341025,"domain_scores_codex":[0.999161,0.0000147668,0.0003718344,0.0001537129,0.0001517948,0.0001468974],"domain_scores_gemma":[0.9992222,0.00005660794,0.0001707968,0.0001053104,0.000378813,0.00006632254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000287985,0.00003888712,0.001332625,0.00002560168,0.00001173554,4.4509e-8,0.001276098,0.5436435,0.000001853878,0.4310393,0.00006830153,0.02255908],"study_design_scores_gemma":[0.0001079381,0.00003469417,0.0005893075,0.00002403267,0.000005771231,6.88901e-7,0.001025924,0.9848393,0.00004978959,0.0125049,0.0006891528,0.0001285568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01199949,0.00001356597,0.9856959,0.00003678793,0.000260628,0.0003304493,0.00006450368,0.00006451608,0.001534153],"genre_scores_gemma":[0.9797894,0.000001303538,0.01936006,0.00007627883,0.0001126608,0.00007735413,0.0004844781,0.000008356175,0.00009010378],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9677899,"threshold_uncertainty_score":0.4512367,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106004777","doi":"10.1111/j.1467-8640.2010.00366.x","title":"DECISION TREES DO NOT GENERALIZE TO NEW VARIATIONS","year":2010,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Canadian Institute for Advanced Research","keywords":"Decision tree; Curse of dimensionality; Machine learning; Computer science; Artificial intelligence; Partition (number theory); Representation (politics); Decision tree learning; Set (abstract data type); Mathematics; Theoretical computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.03635067146760383,"gpt":0.3192401414954662,"spread":0.2828894700278624,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001310427,0.0001246694,0.0001021879,0.0001082464,0.0002051885,0.0003031581,0.001027617,0.00004958033,0.000136529],"category_scores_gemma":[0.00008059004,0.0001177198,0.00005946578,0.0007204532,0.00002748225,0.0002714101,0.0002340573,0.0001735704,0.0006904519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001595706,"about_ca_system_score_gemma":0.0001148561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004285597,"about_ca_topic_score_gemma":0.00006063186,"domain_scores_codex":[0.9987581,0.00001599885,0.0002830462,0.0004244096,0.0003195281,0.0001989505],"domain_scores_gemma":[0.9985937,0.0004691208,0.00006349607,0.0004383128,0.0001847654,0.0002505476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001906474,0.00002355666,0.00002887413,3.599725e-7,0.000002778122,9.667447e-7,0.0001034805,0.2443379,0.000690955,0.5142455,0.006815484,0.2337482],"study_design_scores_gemma":[0.00004930888,0.00003232862,0.004382227,0.000009313873,0.000002882287,0.00001921027,0.000002770796,0.541927,0.001528985,0.4161429,0.03570059,0.0002024921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006668793,0.00001813481,0.9870438,0.004773848,0.0007151125,0.0001775483,0.000004657465,0.0001272201,0.0004708965],"genre_scores_gemma":[0.4638746,0.000002653871,0.5341672,0.001307349,0.0002113413,0.00001740372,0.00000503524,0.000005600203,0.0004088003],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4572058,"threshold_uncertainty_score":0.8874593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050513812","doi":"10.1111/j.0824-7935.2004.00255.x","title":"A Weighted‐Tree Similarity Algorithm for Multi‐Agent Systems in E‐Business Environments","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Canarie","keywords":"Computer science; Tree traversal; Serialization; Similarity (geometry); Tree (set theory); Theoretical computer science; XML; Algorithm; Node (physics); Artificial intelligence; Data mining; Programming language; Mathematics; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.0680886334964266,"gpt":0.3066998051356149,"spread":0.2386111716391883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002368055,0.0001662183,0.0001989527,0.0001385931,0.0001011078,0.0001207684,0.0007342801,0.00007486913,0.000002604863],"category_scores_gemma":[0.00005787339,0.0001596097,0.00005481152,0.0003655007,0.00008148072,0.000315345,0.0001684056,0.00009126817,0.0000602418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001673262,"about_ca_system_score_gemma":0.000110667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001592907,"about_ca_topic_score_gemma":0.00003186289,"domain_scores_codex":[0.9985397,0.00003621453,0.0003757345,0.0004600622,0.0002998205,0.0002884346],"domain_scores_gemma":[0.9992715,0.0002154413,0.00009764275,0.0002489381,0.0001008168,0.00006564392],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007124159,0.0004718477,0.0005980379,0.0000453914,0.00002555055,0.00005373484,0.0005782244,0.7132546,0.00003314399,0.1208529,0.00007021235,0.1640092],"study_design_scores_gemma":[0.0003197124,0.00003837632,0.01509897,0.00005847126,0.000003297123,0.00002176848,0.00006450572,0.9456027,0.0004548877,0.03739682,0.0007453202,0.0001952024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002368317,0.0006363939,0.9954355,0.0004649406,0.0005455888,0.0004245928,0.000009339625,0.00007198834,0.0000433207],"genre_scores_gemma":[0.3315324,0.00004088541,0.668022,0.0001924273,0.00004911089,0.00008144462,0.00001673515,0.000008086291,0.00005681785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3291641,"threshold_uncertainty_score":0.6508693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041738807","doi":"10.1111/0824-7935.00154","title":"Rule Quality Measures for Rule Induction Systems: Description and Evaluation","year":2001,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Government of Canada","keywords":"Rule induction; Generalization; Rule-based system; Computer science; Quality (philosophy); Selection (genetic algorithm); Learning rule; Set (abstract data type); Artificial intelligence; Mathematics; Machine learning; Data mining; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.1869578875199459,"gpt":0.3860733665908063,"spread":0.1991154790708604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001153511,0.0001009403,0.0001089972,0.0000911403,0.0002572853,0.0003104569,0.0002851879,0.00004845317,0.000005015973],"category_scores_gemma":[0.0001577967,0.0001027539,0.00002962087,0.0002846945,0.00005147623,0.0006829968,0.00006342063,0.0000638106,0.00003420974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000786726,"about_ca_system_score_gemma":0.00008630077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008299186,"about_ca_topic_score_gemma":0.000004716892,"domain_scores_codex":[0.9986686,0.00009162277,0.0003206852,0.0003847778,0.0003913534,0.0001430021],"domain_scores_gemma":[0.9987296,0.0002216315,0.0001343684,0.0002229466,0.0006265739,0.00006491988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001172509,0.00008457177,0.0003486747,0.00002540181,0.00001980258,3.224029e-7,0.000545983,0.09161925,0.0002476356,0.2237473,0.000477671,0.6828716],"study_design_scores_gemma":[0.00008432165,0.00004341702,0.006114673,0.00002003015,0.000008652376,0.00002543467,0.0001642083,0.889559,0.0001193092,0.1019269,0.001809764,0.000124245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04547563,0.0003918545,0.9526654,0.0004005232,0.0003377126,0.0004161795,0.0000180653,0.00009268758,0.0002019838],"genre_scores_gemma":[0.8516961,0.00003632649,0.147659,0.00006361504,0.0001197703,0.0002428725,0.0001046264,0.000006253729,0.00007145341],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8062205,"threshold_uncertainty_score":0.4190182,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100364829","doi":"10.1111/0824-7935.00165","title":"Probabilistic Decision Tables in the Variable Precision Rough Set Model","year":2001,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Dominance-based rough set approach; Rough set; Decision table; Extension (predicate logic); Probabilistic logic; Decision rule; Mathematics; Data mining; Computer science; Table (database); Focus (optics); Decision model; Variable (mathematics); Set (abstract data type); Weighted sum model; Artificial intelligence; Algorithm; Decision tree; Machine learning; Influence diagram","retraction":null,"screen_n_in":null,"score":{"opus":0.06367058592232826,"gpt":0.311166960714331,"spread":0.2474963747920028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008214336,0.0001548532,0.0001455075,0.0001087642,0.000176788,0.0002893658,0.001533655,0.00006338191,0.00003326611],"category_scores_gemma":[0.0002461478,0.0001058758,0.00004504645,0.001025601,0.00005929632,0.0005138047,0.0002353033,0.0001824801,0.0001046174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006173625,"about_ca_system_score_gemma":0.0001366012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004133396,"about_ca_topic_score_gemma":0.00001421687,"domain_scores_codex":[0.9981846,0.00009959891,0.0004023917,0.0004590755,0.0005667384,0.000287615],"domain_scores_gemma":[0.9980169,0.001236076,0.00008171668,0.0004522201,0.0001610599,0.00005201297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008599929,0.0000700125,0.00007544451,0.000003066482,0.000001520163,0.00001068349,0.0005070381,0.7461773,0.00000101621,0.2141288,0.0006021076,0.03841449],"study_design_scores_gemma":[0.00003474723,0.00002781201,0.0003700823,0.00002205987,0.000001074679,0.00003360484,0.00001945052,0.5382968,0.000002229732,0.4604456,0.0006709121,0.00007563561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005565478,0.0001966182,0.9891729,0.0005703886,0.0001708847,0.0002855099,0.000005066896,0.00005351346,0.003979684],"genre_scores_gemma":[0.651503,0.00004165277,0.3476738,0.0006540047,0.00003302871,0.00002828736,0.00001367649,0.000005145946,0.00004735935],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6459376,"threshold_uncertainty_score":0.431749,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087393302","doi":"10.1111/j.1467-8640.2005.00278.x","title":"APPLYING MACHINE LEARNING TO LOW-KNOWLEDGE CONTROL OF OPTIMIZATION ALGORITHMS","year":2005,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Irish Research Council; Science Foundation Ireland","keywords":"Computer science; Machine learning; Domain knowledge; Algorithm; Artificial intelligence; Control (management); Set (abstract data type); Optimization algorithm; Scheduling (production processes); Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01517091568407795,"gpt":0.2613674780904295,"spread":0.2461965624063516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000162923,0.000134273,0.000162189,0.0001748874,0.0000691254,0.00002893953,0.0001521996,0.00005210752,0.0001496517],"category_scores_gemma":[0.0001075817,0.0001497509,0.00004648065,0.0003956691,0.00002555755,0.000109617,0.00002109666,0.0001429812,0.0001386694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005836579,"about_ca_system_score_gemma":0.00002381762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002766836,"about_ca_topic_score_gemma":0.000001329884,"domain_scores_codex":[0.9991186,0.00002680536,0.0003547259,0.0001642253,0.0001764323,0.0001591797],"domain_scores_gemma":[0.9992562,0.0001884615,0.00004796797,0.00008338904,0.0003301993,0.00009376949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004970265,0.00002647106,0.00003980549,0.00001963243,0.00001854272,3.604419e-7,0.0003627842,0.9251245,0.00003427809,0.0003475004,0.00001860897,0.0740026],"study_design_scores_gemma":[0.0001269584,0.0000240295,0.00002299655,0.00004125373,0.000007470315,0.000003841767,0.00005764913,0.9973548,0.00158558,0.00007974034,0.0005414417,0.0001542598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006209782,0.0005920987,0.9973856,0.00007010338,0.0001988979,0.0002437507,0.000008286212,0.0002371814,0.0006431633],"genre_scores_gemma":[0.5590617,0.00002103797,0.4405839,0.00008347938,0.00009775974,0.00003899682,0.00003429924,0.00002061954,0.00005814178],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5584407,"threshold_uncertainty_score":0.6106666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972560688","doi":"10.1111/j.0824-7935.2004.00260.x","title":"Agent‐Based Web Services Framework and Development Environment","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; National Research Council Canada","funders":"","keywords":"Computer science; Web service; Key (lock); Service-oriented architecture; WS-Policy; Web modeling; Semantics (computer science); Service (business); World Wide Web; Semantic Web; Software engineering; Web development; Computer security; Web application security; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03243894243564606,"gpt":0.2647605053819598,"spread":0.2323215629463138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001567386,0.0001333763,0.0001033411,0.00008342045,0.000171694,0.0001263304,0.0003549019,0.00005407807,0.00003506588],"category_scores_gemma":[0.00000798185,0.0001293554,0.00002410266,0.0001204462,0.00003389164,0.0002260617,0.0001223504,0.00008211091,0.000342055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009641064,"about_ca_system_score_gemma":0.0001146023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001120394,"about_ca_topic_score_gemma":0.000003455056,"domain_scores_codex":[0.998802,0.00002855859,0.000283897,0.0003620768,0.0003589259,0.0001645575],"domain_scores_gemma":[0.9994425,0.0001259297,0.0001049003,0.0001848354,0.00004400661,0.00009784747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004016391,0.0001298402,0.001120412,0.00007454626,0.0000208625,0.00001077842,0.002833178,0.8727731,0.0001012996,0.08785259,0.0000142757,0.03506514],"study_design_scores_gemma":[0.0003009622,0.00007405798,0.02004013,0.0002649768,0.000005027985,0.00001859071,0.000137511,0.9251572,0.004669949,0.04006052,0.008773243,0.0004978187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02631252,0.0002522624,0.972569,0.0003733675,0.0002068775,0.0001559377,0.000001544114,0.0000745943,0.00005384725],"genre_scores_gemma":[0.628051,0.00001008445,0.3714952,0.0003821304,0.00002446915,0.00001277976,0.000008437448,0.000004200916,0.00001170883],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6017385,"threshold_uncertainty_score":0.527496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113472489","doi":"10.1111/j.1467-8640.2009.00348.x","title":"POYRAZ: CONTEXT‐AWARE SERVICE SELECTION UNDER DECEPTION","year":2009,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Service provider; Service (business); Context (archaeology); Selection (genetic algorithm); Service design; Computer science; Deception; Service level objective; Service delivery framework; Business service provider; Consumer behaviour; Marketing; Business; Psychology; Social psychology; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02096013433539515,"gpt":0.2781498017645634,"spread":0.2571896674291682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001593464,0.0002230495,0.0001652606,0.0001973488,0.0002656968,0.0002134625,0.0009056299,0.0000902676,0.00007285131],"category_scores_gemma":[0.000006728299,0.000218376,0.00007382013,0.001264508,0.00002325607,0.000664021,0.0001044499,0.0002141342,0.0004249119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007517306,"about_ca_system_score_gemma":0.000119342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001070733,"about_ca_topic_score_gemma":0.0002180285,"domain_scores_codex":[0.9982502,0.00007708427,0.0003528187,0.0005431905,0.0004609318,0.0003157012],"domain_scores_gemma":[0.9986722,0.0001925074,0.0001372592,0.0002816339,0.0005804889,0.0001358361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002130046,0.0001343139,0.0001429872,0.00001870258,0.00002311761,0.000004401261,0.001733603,0.4792189,0.0004125501,0.3309485,0.0002328502,0.1871087],"study_design_scores_gemma":[0.0001324778,0.0001772078,0.01034655,0.00005303858,0.000008783075,0.00007810607,0.0003082186,0.7190676,0.0034798,0.2643383,0.001668408,0.0003415323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01814922,0.0001418657,0.9731033,0.006878743,0.0003366166,0.0001771753,0.000002557164,0.0003772243,0.0008333069],"genre_scores_gemma":[0.9504088,0.000008686627,0.02921407,0.0201263,0.0001423327,0.00000807197,0.00003768356,0.000008841118,0.00004517123],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9438892,"threshold_uncertainty_score":0.8905115,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2760845379","doi":"10.1111/coin.12146","title":"Threaded ensembles of autoencoders for stream learning","year":2017,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Anomaly detection; Autoencoder; Benchmark (surveying); Data stream; Artificial intelligence; Data stream mining; Concept drift; Streaming data; Class (philosophy); Machine learning; Data mining; Pattern recognition (psychology); Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.07278026847176025,"gpt":0.3580306338209599,"spread":0.2852503653491997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003119141,0.0001177744,0.0001627213,0.00008967106,0.0003381435,0.0002354638,0.002058766,0.00004720213,0.000007001346],"category_scores_gemma":[0.0005452317,0.0001193735,0.00007179653,0.00006858239,0.0001789707,0.000552764,0.0003954016,0.00009248677,0.00001187151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002265706,"about_ca_system_score_gemma":0.0001019359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004193754,"about_ca_topic_score_gemma":0.000004995391,"domain_scores_codex":[0.9989371,0.00002546079,0.0002750391,0.0003285742,0.0002532862,0.000180531],"domain_scores_gemma":[0.9982475,0.0005009785,0.0003432737,0.0005787289,0.0002796913,0.00004981375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000143199,0.00008170187,0.001730582,0.00004788897,0.00003670027,0.000004131604,0.000754443,0.09181251,0.000191231,0.6150451,0.001498435,0.288783],"study_design_scores_gemma":[0.00006159287,0.0001606448,0.002066944,0.00006965447,0.000004904966,0.00000718308,0.00004585377,0.731242,0.01736825,0.2481288,0.0006935679,0.0001505816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002559531,0.00003763402,0.9952007,0.0004008511,0.0001388208,0.0001637684,0.00001492889,0.0001902814,0.001293489],"genre_scores_gemma":[0.5437852,0.000006146034,0.4560681,0.00002446455,0.00001706811,0.00001496864,0.00001354646,0.000005233327,0.00006533822],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6394295,"threshold_uncertainty_score":0.486791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012352792","doi":"10.1111/0824-7935.00160","title":"Rough Neural Computing in Signal Analysis","year":2001,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Rough set; Artificial neural network; Computer science; Dominance-based rough set approach; Function (biology); Pattern recognition (psychology); Artificial intelligence; Equivalence class (music); Set (abstract data type); Knowledge extraction; Decision table; Data mining; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0422500873711024,"gpt":0.303428735858981,"spread":0.2611786484878786,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003033524,0.0001563226,0.000228355,0.0003882052,0.0001183824,0.000192555,0.0008922867,0.00004934892,0.00007339633],"category_scores_gemma":[0.00002614713,0.0001497199,0.0001300115,0.002851689,0.00005886283,0.0003699292,0.000226501,0.0001824655,0.00009778793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005856654,"about_ca_system_score_gemma":0.00004604552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000085003,"about_ca_topic_score_gemma":0.00002811787,"domain_scores_codex":[0.9983031,0.00008826447,0.0004298498,0.0004814397,0.0003647854,0.0003325483],"domain_scores_gemma":[0.9990766,0.0003642947,0.0001039198,0.0002509004,0.0001169446,0.00008733999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003569994,0.00006085092,0.01409446,0.000001819313,0.00002798258,0.00006934578,0.000346472,0.885455,0.000001333692,0.03154376,0.00003438967,0.06836107],"study_design_scores_gemma":[0.00005028823,0.00003643654,0.0532089,0.000006162644,0.000009335751,0.00002916489,0.00002418094,0.9159566,0.00001085839,0.03035656,0.0001480061,0.0001635581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03921207,0.0001698123,0.9572909,0.0005885587,0.000143647,0.00008651253,0.000001161202,0.0001023969,0.002404872],"genre_scores_gemma":[0.9028803,0.000009912523,0.09639939,0.0006064192,0.00005641874,0.000002969622,0.00001281638,0.000004698035,0.00002708078],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8636682,"threshold_uncertainty_score":0.6105402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169503695","doi":"10.1111/0824-7935.00118","title":"Choosing Rhetorical Structures To Plan Instructional Texts","year":2000,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Rhetorical question; Computer science; Heuristics; Natural language processing; Natural language generation; Artificial intelligence; Natural language; Set (abstract data type); Natural (archaeology); Linguistics; Natural language understanding; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02982690102393405,"gpt":0.3150887033177501,"spread":0.2852618022938161,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001124377,0.0001630935,0.000130777,0.0001607582,0.0001918038,0.0002488385,0.0009878624,0.0000676131,0.000301222],"category_scores_gemma":[0.00006294349,0.0001503452,0.00004846133,0.0006246383,0.0000549229,0.0004502898,0.000140415,0.000211146,0.0002311901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009522922,"about_ca_system_score_gemma":0.00009398426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001621133,"about_ca_topic_score_gemma":0.00000146443,"domain_scores_codex":[0.9985191,0.00003771791,0.0002725174,0.0004484418,0.0004779781,0.000244251],"domain_scores_gemma":[0.9992663,0.0001401162,0.00004923255,0.0002374073,0.000158927,0.0001480243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001001932,0.00001911139,0.00004742887,0.000005627493,0.000006372824,0.00001154329,0.0002663749,0.04213585,0.00007299216,0.3213057,0.0008270481,0.6352919],"study_design_scores_gemma":[0.00004390733,0.00006548937,0.001370987,0.00003964143,0.000002277642,0.0002199664,0.000006822017,0.09235083,0.005677053,0.8951712,0.004737131,0.0003147486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008577114,0.0003450518,0.98857,0.0008827424,0.0002602914,0.0001223944,0.000004437359,0.0004729644,0.0007649489],"genre_scores_gemma":[0.4502463,0.00000264477,0.5488266,0.0006894275,0.0001017781,0.000006771836,0.000006672626,0.000006018071,0.0001136928],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6349772,"threshold_uncertainty_score":0.6130899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079989187","doi":"10.1111/1467-8640.t01-1-00205","title":"Agent Reasoning Mechanism for Long–Term Coalitions Based on Decision Making and Trust","year":2002,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mechanism (biology); Term (time); Vendor; Computer science; State (computer science); Operations research; Artificial intelligence; Microeconomics; Business; Economics; Marketing; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1763292147975107,"gpt":0.4231556787079246,"spread":0.2468264639104139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007670492,0.0001218988,0.0001364808,0.0002080131,0.0005742591,0.0002172343,0.0003149452,0.00005376026,0.001024019],"category_scores_gemma":[0.001438758,0.0001067269,0.00008511475,0.0003988409,0.0001091443,0.0001494281,0.00004623808,0.00009147694,0.0003381444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003887065,"about_ca_system_score_gemma":0.0000191994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.768067e-7,"about_ca_topic_score_gemma":0.000001851027,"domain_scores_codex":[0.9982688,0.00007281367,0.0004549283,0.000462635,0.0005794736,0.0001613179],"domain_scores_gemma":[0.9947336,0.0043273,0.0001776135,0.0002665143,0.0004021036,0.00009289639],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003078634,0.00008397378,0.0003447079,0.000003000528,0.000004712263,0.000001513553,0.0001607069,0.1564289,0.000006778803,0.6698924,0.0008271913,0.1722154],"study_design_scores_gemma":[0.00006194283,0.0000399758,0.001732867,0.00003870648,0.000004535612,0.000008010144,0.00008029048,0.5299046,0.0001301706,0.4676397,0.0002812078,0.00007801691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01743401,0.00003713898,0.9801499,0.0007263419,0.0001909893,0.0002852061,0.00004510799,0.00004545194,0.001085916],"genre_scores_gemma":[0.9453791,0.000005765063,0.05308703,0.000945077,0.00006964998,0.00007818451,0.00001229268,0.000009496704,0.0004134002],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9279451,"threshold_uncertainty_score":0.9998892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2887804579","doi":"10.1111/coin.12189","title":"Exploring deep neural networks for multitarget stance detection","year":2018,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subjectivity; Computer science; Artificial intelligence; Independence (probability theory); Dependency (UML); Machine learning; Epistemology; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1375294110464483,"gpt":0.3197177453846248,"spread":0.1821883343381765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002202053,0.0001158646,0.00011415,0.0001126843,0.0002889636,0.0001543612,0.0004432147,0.0000267813,0.00002085942],"category_scores_gemma":[0.00005394635,0.0001176722,0.00008902611,0.0004470341,0.0000590591,0.0007052788,0.00009140946,0.0000707389,0.0000384694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003734505,"about_ca_system_score_gemma":0.00001177343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005104145,"about_ca_topic_score_gemma":0.00001305921,"domain_scores_codex":[0.9988737,0.00002965768,0.0002746926,0.0003735495,0.0002133487,0.0002350122],"domain_scores_gemma":[0.9990015,0.0002824778,0.0001048906,0.000184345,0.0003612056,0.00006557117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001026303,0.00001834479,0.0001260413,0.000003645855,0.0000186282,6.826338e-7,0.0003567126,0.7167226,0.00004016444,0.01674352,0.00003294897,0.2659265],"study_design_scores_gemma":[0.00005796383,0.0000907344,0.000743569,0.000009053033,0.000004284006,0.000002730545,0.00005625422,0.9900434,0.002519974,0.005968243,0.000365034,0.0001387291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006930112,0.0001600048,0.9912723,0.0001143222,0.001233524,0.000121193,7.332178e-7,0.0001009271,0.00006690453],"genre_scores_gemma":[0.8449991,0.000009356896,0.154359,0.0001690849,0.000390005,0.0000381183,0.000007743686,0.000006948553,0.00002055862],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.838069,"threshold_uncertainty_score":0.4798532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111516132","doi":"10.1111/j.1467-8640.2012.00428.x","title":"COMBINING TRUST MODELING AND MECHANISM DESIGN FOR PROMOTING HONESTY IN E‐MARKETPLACES","year":2012,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Honesty; Reputation; Forward auction; Mechanism (biology); Incentive; Trustworthiness; Profit (economics); Business; Computer science; Ask price; Mechanism design; Internet privacy; Microeconomics; Marketing; Economics; Psychology; Auction theory","retraction":null,"screen_n_in":null,"score":{"opus":0.2276978986219307,"gpt":0.4137043746597988,"spread":0.1860064760378681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003954094,0.00009193172,0.0001341868,0.0001522203,0.0002456456,0.0001000701,0.000224879,0.00004403949,0.00004562343],"category_scores_gemma":[0.00116192,0.00008090741,0.0000317607,0.0003639178,0.00005837376,0.0003989335,0.0000593391,0.0000848889,0.00003979364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002109525,"about_ca_system_score_gemma":0.00003476383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003011182,"about_ca_topic_score_gemma":9.741633e-7,"domain_scores_codex":[0.9986396,0.0001461167,0.0004519395,0.0002658348,0.0002985789,0.0001978805],"domain_scores_gemma":[0.9964379,0.003045809,0.0001310387,0.0001114802,0.0001898312,0.00008393042],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002805611,0.00005632652,0.0008417005,0.000004554342,0.000003814871,1.460606e-7,0.00213493,0.5959252,0.0001048079,0.3765059,0.00002472875,0.02436983],"study_design_scores_gemma":[0.00003497588,0.00001131143,0.0001267892,0.000008212563,0.00000162302,0.00000499355,0.0007486016,0.5403865,0.0005876606,0.4580022,0.00003300951,0.00005410051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1276571,0.00009948981,0.8714637,0.0002194802,0.0001188367,0.0002906448,0.000003480547,0.00002363372,0.000123748],"genre_scores_gemma":[0.9127074,0.000003841999,0.0869935,0.00007513172,0.00005173783,0.00007655202,0.000003417124,0.000006849989,0.00008150671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7850504,"threshold_uncertainty_score":0.3299308,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115867043","doi":"10.1111/0824-7935.00116","title":"Temporal Reasoning and Bayesian Networks","year":2000,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan; University of Prince Edward Island","funders":"","keywords":"Computer science; Representation (politics); Bayesian network; Event (particle physics); Probabilistic logic; Context (archaeology); Artificial intelligence; Temporal logic; Machine learning; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01966282983123858,"gpt":0.266020653424988,"spread":0.2463578235937495,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001986052,0.0001322489,0.0001173612,0.00005220216,0.0001729846,0.0002262602,0.0004475893,0.00005661306,0.0001255174],"category_scores_gemma":[0.00001652304,0.0001320599,0.00003240454,0.0002830112,0.00008371075,0.0003493181,0.00007737481,0.0001638602,0.00007776059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001667808,"about_ca_system_score_gemma":0.00005226004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003084822,"about_ca_topic_score_gemma":0.000002659692,"domain_scores_codex":[0.9989091,0.00004832891,0.0002333511,0.0003854468,0.0001950229,0.000228722],"domain_scores_gemma":[0.9994115,0.0001295736,0.00004286132,0.0002002772,0.00008202002,0.0001337692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003467929,0.0000158743,0.0003732605,0.000002776307,0.000005410711,0.000008357133,0.0001717506,0.469657,8.352987e-7,0.1459988,0.0001512107,0.3836113],"study_design_scores_gemma":[0.00002919007,0.00003401272,0.000890539,0.00003076809,0.000001758607,0.0000534431,0.000007781849,0.9141094,0.0000184227,0.08431424,0.0003614235,0.0001490106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003352182,0.0004284129,0.9929476,0.0004186868,0.00009186394,0.00005968527,7.914995e-7,0.0001624445,0.002538361],"genre_scores_gemma":[0.8099247,0.0000517314,0.1892575,0.0004688163,0.00005171687,0.000004969117,0.000005133579,0.000005843892,0.0002295705],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8065725,"threshold_uncertainty_score":0.5385244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118546500","doi":"10.1111/j.1467-8640.2007.00307.x","title":"A COMPREHENSIVE APPROACH FOR SHARING SEMANTIC WEB TRUST RATINGS","year":2007,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Access Control and Trust","field":"Social Sciences","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Context (archaeology); Computer science; Reliability (semiconductor); Internet privacy; Population; Value (mathematics); World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.06712032298964195,"gpt":0.3648640827619355,"spread":0.2977437597722936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005924123,0.0001081722,0.0001492336,0.00008920846,0.0006759562,0.0001315204,0.0003676216,0.0000663379,0.00006602558],"category_scores_gemma":[0.0001899471,0.0001096526,0.00008456521,0.0002955062,0.0002323599,0.000204778,0.00005403017,0.0001048669,0.00003288122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006297633,"about_ca_system_score_gemma":0.000117328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001877007,"about_ca_topic_score_gemma":0.00007497698,"domain_scores_codex":[0.9987254,0.00002653201,0.0002893521,0.0002965553,0.0003274344,0.0003347612],"domain_scores_gemma":[0.9985474,0.0007313805,0.000109385,0.00008358522,0.0004187685,0.0001094673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000971987,0.0001558247,0.007617241,0.00008497869,0.00006380731,0.000007059968,0.008214604,0.1161383,0.00007413877,0.8147469,0.0004721351,0.05232782],"study_design_scores_gemma":[0.0002931094,0.0000536363,0.004450806,0.00002975659,0.00002470262,0.000005150457,0.008497168,0.8783713,0.0001488627,0.09415775,0.01360727,0.0003605209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02302116,0.0001835641,0.9558929,0.0002778794,0.0002007534,0.0004475322,0.000006408268,0.00009127829,0.01987857],"genre_scores_gemma":[0.962617,0.000008289308,0.03613029,0.0003806013,0.0003352425,0.00002593818,0.00002586171,0.00001030836,0.0004664102],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9395959,"threshold_uncertainty_score":0.5198977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3128553169","doi":"10.1111/coin.12434","title":"Incremental learning framework for real‐world fraud detection environment","year":2021,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Common value auction; Bidding; Classifier (UML); Artificial intelligence; Machine learning; Incremental learning","retraction":null,"screen_n_in":null,"score":{"opus":0.1370016524655445,"gpt":0.4210140903400276,"spread":0.2840124378744831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008422573,0.00009905846,0.0001256994,0.0001163881,0.0004902877,0.0001384774,0.0002563223,0.00005129495,0.001808004],"category_scores_gemma":[0.001063513,0.0000967466,0.0001061592,0.000560476,0.0001023718,0.0001491002,0.00009352144,0.0001851312,0.0009329042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007792762,"about_ca_system_score_gemma":0.00005082587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004607145,"about_ca_topic_score_gemma":0.000009893527,"domain_scores_codex":[0.9982246,0.0001449428,0.0004640319,0.0004474923,0.0005729286,0.0001460267],"domain_scores_gemma":[0.9961113,0.003153316,0.0001948542,0.0002180407,0.0002462147,0.00007629276],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001959639,0.00006051044,0.0004451495,0.000002152574,0.00001259667,0.00000106326,0.000238676,0.4306875,0.0004700193,0.400566,0.0001638165,0.1673329],"study_design_scores_gemma":[0.00003518257,0.00003053733,0.001834597,0.000008140557,0.000006246964,0.000006711944,0.001058508,0.07303081,0.02161878,0.8808154,0.02144392,0.0001111436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01289456,0.00005491166,0.9846962,0.0005110157,0.0002395944,0.0001555522,0.00001157298,0.00004587523,0.001390708],"genre_scores_gemma":[0.9186372,0.00001936726,0.07861251,0.0002181267,0.0001606997,0.00007105258,0.00002624577,0.000008984215,0.002245784],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9060837,"threshold_uncertainty_score":0.999845,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039438466","doi":"10.1111/0824-7935.00169","title":"Discovering Maximal Generalized Decision Rules Through Horizontal and Vertical Data Reduction","year":2001,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Rough set; Tuple; Discretization of continuous features; Mathematics; Discretization; Generalization; Reduction (mathematics); Data mining; Decision table; Set (abstract data type); Rank (graph theory); Context (archaeology); Computer science; Pattern recognition (psychology); Algorithm; Artificial intelligence; Discrete mathematics; Discretization error","retraction":null,"screen_n_in":null,"score":{"opus":0.08435124012887192,"gpt":0.329374151765076,"spread":0.245022911636204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001787181,0.0001425353,0.000140467,0.00005660399,0.0001979996,0.0002932379,0.0008737471,0.00005067512,0.00002166887],"category_scores_gemma":[0.00006573152,0.0001243887,0.00003049994,0.0002546877,0.0001141168,0.001317831,0.0007919125,0.000114648,0.00006848783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003556678,"about_ca_system_score_gemma":0.0000477009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007767181,"about_ca_topic_score_gemma":0.000005826776,"domain_scores_codex":[0.99851,0.00003915172,0.0002854774,0.0005939905,0.0003471217,0.0002242498],"domain_scores_gemma":[0.9991817,0.0001649048,0.00003978508,0.0004661873,0.00006615902,0.00008122507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007837031,0.0001290187,0.0004398612,0.00000899871,0.00002562643,0.00006943385,0.0006185721,0.04170055,0.0001149739,0.4920265,0.0006716788,0.4641164],"study_design_scores_gemma":[0.0001047144,0.00007576966,0.002964173,0.00002220009,0.000005059243,0.0003797274,0.00003470365,0.7488965,0.0001189488,0.2454502,0.00177081,0.0001771791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1625682,0.0003785573,0.8354578,0.0004479105,0.0004072043,0.00008517278,0.00000647741,0.00007286925,0.0005758648],"genre_scores_gemma":[0.614935,0.0002632471,0.3845371,0.00008798122,0.0001145895,0.000003089793,0.00004715813,0.000005431333,0.000006339663],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7071959,"threshold_uncertainty_score":0.5072422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039001632","doi":"10.1111/0824-7935.00156","title":"Applications of Rough Genetic Algorithms","year":2001,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rough set; Genetic algorithm; Generalization; Interval (graph theory); Algorithm; Computer science; Quality control and genetic algorithms; Artificial intelligence; Data mining; Mathematics; Machine learning; Meta-optimization; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.03296094597918826,"gpt":0.2959399751979899,"spread":0.2629790292188016,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009372229,0.00009260705,0.0001111645,0.00008575262,0.00008016741,0.00004752569,0.000792607,0.00003488685,0.00004353624],"category_scores_gemma":[0.00001336813,0.00008725438,0.0000542853,0.0006354509,0.00007950937,0.0001556001,0.000132766,0.00006731372,0.0001557935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001875817,"about_ca_system_score_gemma":0.00005944597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001939054,"about_ca_topic_score_gemma":0.000001048459,"domain_scores_codex":[0.9989833,0.00002454208,0.0002986656,0.0002742181,0.0002649933,0.000154318],"domain_scores_gemma":[0.9991798,0.0001570971,0.0001008099,0.0003020053,0.0001986725,0.00006163179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001512766,0.00008545087,0.0004660672,0.000006483763,0.000009079708,0.000006645146,0.000184013,0.2102209,0.00000537586,0.1756082,0.0001527747,0.6132534],"study_design_scores_gemma":[0.00003388991,0.00004675668,0.00408556,0.000006955328,0.000002571458,0.00005533155,0.00001552082,0.7069708,0.0001095418,0.2809587,0.007599175,0.0001152263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005212501,0.0004170846,0.9940237,0.0003301353,0.0001005816,0.0001539106,0.000002919689,0.00006857064,0.004381886],"genre_scores_gemma":[0.5337599,0.00006132768,0.465851,0.0001779629,0.00005006245,0.00002560541,0.000005103941,0.000003776726,0.00006528986],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6131382,"threshold_uncertainty_score":0.355813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2496887120","doi":"10.1111/coin.12097","title":"Bagged Subspaces for Unsupervised Outlier Detection","year":2016,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Anomaly detection; Outlier; Computer science; Linear subspace; Pattern recognition (psychology); Artificial intelligence; Ensemble learning; Data mining; Curse of dimensionality; Local outlier factor; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02869893347468921,"gpt":0.2844621595874893,"spread":0.2557632261128001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001671955,0.0001081096,0.0000920138,0.0001052351,0.0002066743,0.00007636187,0.0004809454,0.00005246134,0.00003052675],"category_scores_gemma":[0.00005759914,0.00008160112,0.00008209296,0.0003030788,0.00005916602,0.0003295067,0.00006963554,0.00004284291,0.0001231581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005552285,"about_ca_system_score_gemma":0.00004316976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005368689,"about_ca_topic_score_gemma":0.000005430629,"domain_scores_codex":[0.9990599,0.00002331942,0.0002279963,0.0003541623,0.0001628761,0.000171785],"domain_scores_gemma":[0.998949,0.000372519,0.00008292645,0.0002540251,0.0002726376,0.00006889903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001107017,0.0000491736,0.00007973777,0.000007177205,0.00001328465,4.238743e-7,0.000101609,0.001932819,0.004862418,0.3014005,0.0003759477,0.6911659],"study_design_scores_gemma":[0.0001836575,0.0002027942,0.001581913,0.00002978449,0.000006528383,0.00001923089,0.0000285899,0.311307,0.1855459,0.4816453,0.01910807,0.0003411274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002403626,0.00003458321,0.9945096,0.001950028,0.0001507905,0.0003101908,0.000007278097,0.0003808576,0.0002529977],"genre_scores_gemma":[0.8484064,0.00001239595,0.150701,0.0001913434,0.00005926565,0.0002009298,0.000002058601,0.000008134035,0.0004184659],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8460028,"threshold_uncertainty_score":0.3327597,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140572229","doi":"10.1111/1467-8640.00186","title":"To Commit or Not to Commit: Modeling Agent Conversations for Action","year":2002,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Conversation; Commit; Negotiation; Computer science; Action (physics); Contract Net Protocol; Limiting; Knowledge management; Human–computer interaction; Multi-agent system; Artificial intelligence; Communication; Psychology; Sociology; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.2973553537488464,"gpt":0.3833441511490506,"spread":0.08598879740020421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002784597,0.0001644007,0.0001724496,0.0002229738,0.0003271348,0.0001987726,0.0006001493,0.0000556675,0.0001190199],"category_scores_gemma":[0.0001555763,0.0001592056,0.00008125641,0.0004944138,0.00001391157,0.0003883126,0.0001308694,0.00008444457,0.0007860947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001631649,"about_ca_system_score_gemma":0.00003839488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000062744,"about_ca_topic_score_gemma":0.00005470544,"domain_scores_codex":[0.9983765,0.00005691118,0.0004586562,0.0004503914,0.0003991073,0.0002584423],"domain_scores_gemma":[0.9985255,0.0004188643,0.0001007682,0.0003231954,0.0004223676,0.0002092966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002066595,0.00007307177,0.00002981431,0.00002173635,0.00001546587,0.000001233634,0.002535654,0.9429847,0.0001024289,0.02282629,0.004601943,0.02678701],"study_design_scores_gemma":[0.000112989,0.0001232823,0.0002451583,0.00004047651,0.000005472877,0.000006413093,0.0001415597,0.9922513,0.0008158862,0.001449045,0.004599113,0.0002092578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006885539,0.00001773323,0.9871376,0.003988357,0.0008442338,0.0008244697,0.0000209053,0.0001394324,0.0001417433],"genre_scores_gemma":[0.8393879,0.00000531892,0.1575481,0.002115779,0.0001228141,0.0001071331,0.00001609604,0.00001172695,0.0006851257],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8325024,"threshold_uncertainty_score":0.9999919,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135390635","doi":"10.1111/j.1467-8640.2012.00411.x","title":"PROBABILISTIC MODELS FOR FOCUSED WEB CRAWLING","year":2012,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Conditional random field; Web crawler; Crawling; Hidden Markov model; Probabilistic logic; Graphical model; Maximum-entropy Markov model; Artificial intelligence; Web page; Markov chain; Statistical model; Data mining; Information retrieval; Machine learning; Markov model; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.08854326872503002,"gpt":0.3113353877588746,"spread":0.2227921190338446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004348239,0.000118808,0.0001374144,0.0001112186,0.0001591432,0.0001351145,0.0006790468,0.00003713623,0.00001183537],"category_scores_gemma":[0.0001587013,0.0001127798,0.00009084678,0.0003591493,0.00004449924,0.0008481736,0.000137117,0.00007091108,0.00008522197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000376939,"about_ca_system_score_gemma":0.00009775555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005084312,"about_ca_topic_score_gemma":0.000001220602,"domain_scores_codex":[0.9988493,0.00003366722,0.0002691339,0.0002942649,0.0002417401,0.000311835],"domain_scores_gemma":[0.998701,0.0005947987,0.00008493027,0.0002824239,0.0002140908,0.0001227934],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002870555,0.00007387056,0.00008823478,0.00001736029,0.00002151058,4.238943e-7,0.0004500988,0.5766867,0.00002647227,0.3873499,0.000418766,0.03486373],"study_design_scores_gemma":[0.00003954427,0.00002017779,0.00004706051,0.00001433025,0.000009103594,0.00000438473,0.00001737201,0.8392422,0.0002413174,0.1596203,0.0006181389,0.0001260982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002156929,0.0002211101,0.9963366,0.0003378137,0.0002478654,0.000133901,0.00001532634,0.000128883,0.0004215571],"genre_scores_gemma":[0.6796272,0.00000267891,0.3199988,0.0001425227,0.0001007581,0.00002994771,0.00002243161,0.000005930524,0.00006979528],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6774703,"threshold_uncertainty_score":0.4599028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2744423752","doi":"10.1111/coin.12122","title":"One‐class SVM for biometric authentication by keystroke dynamics for remote evaluation","year":2017,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Cisco Systems","keywords":"Keystroke dynamics; Computer science; Support vector machine; Biometrics; Authentication (law); Pattern recognition (psychology); Artificial intelligence; Anomaly detection; Class (philosophy); Word error rate; Identifier; Identification (biology); Data mining; Machine learning; Password; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.09944384755894252,"gpt":0.3727990923741439,"spread":0.2733552448152014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001190925,0.0001509363,0.0001844357,0.0002722653,0.0006939395,0.0007376693,0.001527647,0.00009222539,0.000009125249],"category_scores_gemma":[0.0009659498,0.0001730204,0.0001258063,0.0002790844,0.0000954311,0.0005846597,0.0001219258,0.00006731859,0.00006552328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002166726,"about_ca_system_score_gemma":0.0001573872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002811672,"about_ca_topic_score_gemma":0.00001552703,"domain_scores_codex":[0.9980527,0.000063315,0.0004821713,0.0005434369,0.0006000116,0.000258431],"domain_scores_gemma":[0.9967828,0.0005701656,0.0004848574,0.000759892,0.001297146,0.0001051801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002615887,0.0002557805,0.0001756587,0.0001410948,0.00009294728,1.559501e-7,0.003045779,0.002210372,0.0003565453,0.4602485,0.002179405,0.5312676],"study_design_scores_gemma":[0.0002072927,0.00006702218,0.001067503,0.0000260534,0.00002192762,0.000001851016,0.00002556496,0.8339859,0.0007143556,0.1621214,0.001597564,0.0001636418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004021697,0.0001286791,0.9896989,0.003549385,0.0008058595,0.001383549,0.0001012426,0.00008885402,0.0002217795],"genre_scores_gemma":[0.9281219,0.000006253874,0.07074112,0.0001206892,0.00008281531,0.000142466,0.0003238687,0.00001419468,0.0004467292],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9241002,"threshold_uncertainty_score":0.7113362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096990926","doi":"10.1111/0824-7935.00143","title":"A Case‐Addition Policy for Case‐Base Maintenance","year":2001,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Convergence (economics); Computer science; Base (topology); Reuse; Key (lock); Case-based reasoning; Reduction (mathematics); Mathematical optimization; Quality (philosophy); Algorithm; Mathematics; Artificial intelligence; Engineering; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.06589625762017931,"gpt":0.3236130193185369,"spread":0.2577167616983576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003683364,0.0001747921,0.0001438661,0.000207959,0.0004394858,0.0001809392,0.0004004414,0.00006495992,0.00003682031],"category_scores_gemma":[0.0002493116,0.0001776099,0.00009195513,0.0006272038,0.00006786147,0.0004102213,0.00009152151,0.0001398411,0.0000975496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001038424,"about_ca_system_score_gemma":0.0002256524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001845028,"about_ca_topic_score_gemma":0.0000239172,"domain_scores_codex":[0.9985706,0.00005868067,0.0003344803,0.0004593417,0.0001983468,0.0003785707],"domain_scores_gemma":[0.9980316,0.001045987,0.0001356146,0.0002861012,0.0003602311,0.0001404416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002396185,0.00007343843,0.0001023285,0.00003743941,0.0000233606,0.01401179,0.0009384563,0.4652322,0.00001164412,0.3802797,0.006605227,0.1326604],"study_design_scores_gemma":[0.0001037131,0.0001023363,0.00001809166,0.00004791682,0.000004439983,0.06143938,0.00007899623,0.8158466,0.0001384228,0.1180986,0.003905696,0.0002158176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004564291,0.0001032052,0.9918275,0.002027014,0.0002286737,0.0002522357,0.00005486351,0.0002050558,0.0007371883],"genre_scores_gemma":[0.7586249,0.000006223832,0.2397752,0.000970493,0.0001984139,0.0000544934,0.00004451249,0.00001083977,0.0003149676],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7540606,"threshold_uncertainty_score":0.7242723,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1881830221","doi":"10.1111/coin.12064","title":"Document Clustering With Dual Supervision Through Feature Reweighting","year":2015,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Computer science; Feature (linguistics); Brown clustering; Artificial intelligence; Pairwise comparison; Correlation clustering; Pattern recognition (psychology); Fuzzy clustering; Consensus clustering; Data mining; Conceptual clustering; Machine learning; Canopy clustering algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.05995408911021713,"gpt":0.3051056388127768,"spread":0.2451515497025597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002121207,0.0001579239,0.0001269802,0.00008918119,0.0001425519,0.0002984332,0.0006972788,0.0000655879,0.00001359674],"category_scores_gemma":[0.000064504,0.0001244577,0.00003183646,0.0005138105,0.0000897615,0.001072017,0.0003722766,0.0001681345,0.0001262852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009938571,"about_ca_system_score_gemma":0.0001123177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001429206,"about_ca_topic_score_gemma":0.000004808185,"domain_scores_codex":[0.9985623,0.00003686202,0.0002242806,0.0004220202,0.0005302088,0.0002242868],"domain_scores_gemma":[0.9990165,0.0001370786,0.0001089059,0.0003658402,0.0002914594,0.00008021694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002758804,0.00006838173,0.0005005694,0.00001790349,0.00002572777,0.00003707669,0.002940456,0.1840316,0.00004589419,0.7090959,0.004680601,0.09852829],"study_design_scores_gemma":[0.0003105182,0.0003880777,0.0007132747,0.0001097651,0.000007191028,0.0001640523,0.001323656,0.5287066,0.005800617,0.4459996,0.0159581,0.0005185931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003365144,0.0002686328,0.9883863,0.004954608,0.0002490197,0.0001416742,8.786894e-7,0.0004997524,0.002133942],"genre_scores_gemma":[0.5979967,0.00001088224,0.4013847,0.0002457411,0.00003859177,0.00001448647,0.000009100088,0.000006551547,0.0002932383],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5946316,"threshold_uncertainty_score":0.5075239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046812432","doi":"10.1111/j.0824-7935.2004.00244.x","title":"Introduction to the Applications of Evolutionary Computation in Computer Security and Cryptography","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional; King's College London; University of East Anglia; York University","keywords":"Library science; Computer science; Humanities; Art","retraction":null,"screen_n_in":null,"score":{"opus":0.01047764469429499,"gpt":0.262569110807172,"spread":0.252091466112877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002266319,0.0001198195,0.0001252856,0.0002666909,0.0001932347,0.00004739992,0.0004496497,0.00004113092,0.00000527801],"category_scores_gemma":[0.00001517002,0.0001084444,0.00004457525,0.001562586,0.0001472898,0.0002859682,0.000193328,0.0001386672,0.00003734426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000684815,"about_ca_system_score_gemma":0.00008691921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005872796,"about_ca_topic_score_gemma":0.00001632472,"domain_scores_codex":[0.9986995,0.00004843305,0.0003929753,0.0004232922,0.0002782945,0.0001575356],"domain_scores_gemma":[0.999098,0.000176191,0.0001083118,0.0002639074,0.0002808886,0.00007271059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002207233,0.000106892,0.0001330453,0.000007481699,0.000005102887,3.485462e-7,0.0005788521,0.6500859,0.000006448836,0.3251434,0.0002860512,0.02364432],"study_design_scores_gemma":[0.0001003739,0.00006677843,0.01626462,0.00001702037,0.000003038356,0.00003777877,0.00007006888,0.4807647,0.00007549555,0.500683,0.001788157,0.0001290341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004993265,0.0002365932,0.9810632,0.012956,0.0001141866,0.0005258837,0.000009493908,0.00005518645,0.00004616585],"genre_scores_gemma":[0.5992132,0.00001845667,0.4002226,0.0002098978,0.000193807,0.0001146344,0.00002143031,0.000004050124,0.000001899477],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.59422,"threshold_uncertainty_score":0.4422233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966903283","doi":"10.1111/1467-8640.t01-1-00203","title":"A Reputation–Oriented Reinforcement Learning Strategy for Agents in Electronic Marketplaces","year":2002,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Purchasing; Quality (philosophy); Reinforcement learning; Product (mathematics); Computer science; Order (exchange); Value (mathematics); Business; Marketing; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.04287348294934867,"gpt":0.3032769528661741,"spread":0.2604034699168254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003432161,0.0001227602,0.0001204305,0.0002058111,0.00017812,0.00006167776,0.0005130428,0.00007711671,0.00007213256],"category_scores_gemma":[0.00009845609,0.0001349,0.00004670784,0.0006589518,0.00005875952,0.000207185,0.00009175161,0.0002274945,0.0000512663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001143009,"about_ca_system_score_gemma":0.00004718553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001078774,"about_ca_topic_score_gemma":0.00001045039,"domain_scores_codex":[0.99867,0.0000464592,0.0003652203,0.0004034744,0.0001923336,0.000322527],"domain_scores_gemma":[0.9991569,0.0002974774,0.0001268892,0.0002107317,0.0001654638,0.00004252192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004022403,0.00005165572,0.0001790341,0.000006763652,0.000007501666,0.000001208932,0.0002578198,0.5472358,0.000002559872,0.4176069,0.0002228674,0.03442384],"study_design_scores_gemma":[0.0001170005,0.0001121605,0.0004267156,0.00001094115,0.000001800466,0.000006654519,0.00005925388,0.8753384,0.0001460571,0.120803,0.00285676,0.000121264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01000505,0.0002762581,0.9875988,0.0007297368,0.00005201796,0.0003977164,8.791049e-7,0.0001631177,0.0007763926],"genre_scores_gemma":[0.9777754,0.00007114244,0.0213817,0.0001534269,0.00001409587,0.0002062405,0.00001888618,0.000006670758,0.0003724388],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9677703,"threshold_uncertainty_score":0.5501062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988366874","doi":"10.1111/j.1467-8640.2011.00401.x","title":"EFFECTIVE BIO-EVENT EXTRACTION USING TRIGGER WORDS AND SYNTACTIC DEPENDENCIES","year":2011,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Negation; Natural language processing; Event (particle physics); Heuristics; Artificial intelligence; Syntax; Parsing; Task (project management); Biomedical text mining; Annotation; Scope (computer science); Machine learning; Programming language; Text mining","retraction":null,"screen_n_in":null,"score":{"opus":0.05472830275994485,"gpt":0.336575975424708,"spread":0.2818476726647631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001421294,0.00009358991,0.00008234189,0.00004308316,0.00007832567,0.00001399805,0.00007681116,0.00009536667,0.00003165485],"category_scores_gemma":[0.0001551908,0.0000835754,0.0000361112,0.00007165807,0.0001626078,0.000005325252,0.00005646845,0.00007509092,0.000009894724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001530972,"about_ca_system_score_gemma":0.00003999221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003436203,"about_ca_topic_score_gemma":0.000006148295,"domain_scores_codex":[0.9993666,0.00004808317,0.0001359848,0.0002280989,0.0001019808,0.0001192254],"domain_scores_gemma":[0.999667,0.00007653359,0.00006060704,0.00007680373,0.00006576327,0.00005328519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006585885,0.0005507226,0.0197238,0.0001369896,0.0003994308,0.00005927083,0.002964772,0.00883898,0.09768496,0.003502364,0.0003849656,0.8650951],"study_design_scores_gemma":[0.0006786299,0.002141603,0.1434391,0.0002480032,0.0001792938,0.001068214,0.003743221,0.08566245,0.7156088,0.03930972,0.006545235,0.001375751],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4966086,0.0007649846,0.5022058,0.00002283762,0.0001396772,0.00007607831,0.000002327473,0.00001061813,0.0001689538],"genre_scores_gemma":[0.9836398,0.00005624632,0.01608122,0.00006574607,0.00006442725,0.00000956919,0.00001045087,0.000006569061,0.00006600773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8637194,"threshold_uncertainty_score":0.3408106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155575510","doi":"10.1111/j.1467-8640.2010.00354.x","title":"TRUST AS A TRADABLE COMMODITY: A FOUNDATION FOR SAFE ELECTRONIC MARKETPLACES","year":2010,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Foundation (evidence); Commodity; Business; Commerce; Computer science; Advertising; Computer security; Finance; Political science; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.01424029840918296,"gpt":0.2826232118043598,"spread":0.2683829133951769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005012537,0.0001353678,0.0001343626,0.0001273862,0.0003557959,0.0001364954,0.00100654,0.0001289367,0.00009517791],"category_scores_gemma":[0.0001231181,0.0001404972,0.00006765699,0.0004152429,0.0001473126,0.0002590613,0.0001093076,0.0003444007,0.0001463188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004507193,"about_ca_system_score_gemma":0.0002525386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002070016,"about_ca_topic_score_gemma":0.00006694694,"domain_scores_codex":[0.9987888,0.0000265694,0.0002647513,0.00041874,0.0001952352,0.0003059214],"domain_scores_gemma":[0.998661,0.000518861,0.0001130666,0.0004057165,0.0002381021,0.00006327486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001000615,0.00007894078,0.0000504201,0.000006897134,0.00001176779,4.062769e-7,0.00009889995,0.001345447,0.0001178377,0.9001921,0.000481413,0.09760582],"study_design_scores_gemma":[0.00005936937,0.0000581095,0.0001539298,0.000002498043,0.000003043976,0.00002173651,0.0000138932,0.4461294,0.001522521,0.5252655,0.02666652,0.0001035428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03331697,0.00005818651,0.961066,0.003582264,0.0002296515,0.0004129049,0.000005718859,0.0002325729,0.001095737],"genre_scores_gemma":[0.8608835,0.00001103313,0.1382526,0.0003713919,0.00005147936,0.0001970237,0.00003456902,0.000007796053,0.0001905688],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8275666,"threshold_uncertainty_score":0.5729309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170530489","doi":"10.1111/coin.12049","title":"Creating Decision Trees from Rules using RBDT‐1","year":2014,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"George Mason University","keywords":"Decision tree; ID3 algorithm; Incremental decision tree; Computer science; Decision tree learning; Decision stump; Decision rule; Machine learning; Artificial intelligence; Data mining; Alternating decision tree; ID3; Set (abstract data type); Tree (set theory); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04623239976232268,"gpt":0.320815491402463,"spread":0.2745830916401403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002086951,0.0001181832,0.0001228632,0.00007758495,0.0002646738,0.0002844277,0.0008559931,0.00003732074,0.00003266883],"category_scores_gemma":[0.0001558974,0.0001144722,0.00004501264,0.0002690642,0.00005412655,0.0004051827,0.0002553877,0.00008671721,0.0002445998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000316137,"about_ca_system_score_gemma":0.00004769014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001540063,"about_ca_topic_score_gemma":0.000006582296,"domain_scores_codex":[0.9988011,0.00003743857,0.0002863482,0.0004173157,0.0002948473,0.0001629149],"domain_scores_gemma":[0.9982516,0.001057226,0.0001052564,0.0003670155,0.0001359407,0.00008294561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001243502,0.00003431505,0.0001320561,0.000001307522,0.000007029,9.715851e-7,0.000248527,0.2046269,0.00009477978,0.1823515,0.0001463884,0.6123551],"study_design_scores_gemma":[0.00002953179,0.00001448184,0.002112406,0.00003786887,0.000002973199,0.000004953837,0.00001755097,0.813098,0.0003789921,0.1828743,0.001315718,0.0001133122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03260992,0.00006963484,0.9661078,0.0001437758,0.0001659718,0.00005675784,0.00002183334,0.0001162082,0.0007081419],"genre_scores_gemma":[0.3678002,0.000002928242,0.6318696,0.0001752917,0.00009450599,0.000004680953,0.000034178,0.000005252532,0.00001341347],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6122417,"threshold_uncertainty_score":0.4668039,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2743178907","doi":"10.1111/coin.12128","title":"Learning over subconcepts: Strategies for 1‐class classification","year":2017,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Health Canada","keywords":"Computer science; Property (philosophy); Class (philosophy); Machine learning; Artificial intelligence; Domain (mathematical analysis); Multiclass classification; One-class classification; Classifier (UML); Support vector machine; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0847742673357272,"gpt":0.374068715977271,"spread":0.2892944486415438,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003803201,0.0001616754,0.0001504938,0.0001020225,0.0008566866,0.001281153,0.00206664,0.00008369211,0.0000199907],"category_scores_gemma":[0.0003909987,0.0001692694,0.00007490601,0.0001117505,0.0002277929,0.002141704,0.000228822,0.0001742174,0.00007719747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008488153,"about_ca_system_score_gemma":0.0002159285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001388372,"about_ca_topic_score_gemma":0.000004032617,"domain_scores_codex":[0.9985125,0.00004880902,0.0003498834,0.0005325604,0.000308295,0.0002479446],"domain_scores_gemma":[0.9978055,0.0003801246,0.0004439252,0.0008484655,0.0004508024,0.00007120302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005693292,0.00002719456,0.0004739162,0.00001350404,0.00000886521,8.005321e-7,0.0002399907,0.008761499,0.0004776136,0.9254338,0.001142125,0.06341501],"study_design_scores_gemma":[0.00007426437,0.00006997061,0.01566815,0.00002174245,0.000002954283,0.000003922797,0.0001423866,0.6979563,0.001823478,0.2747761,0.009263449,0.0001972522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001252496,0.00003070449,0.9932513,0.001294728,0.0002943131,0.0003087161,0.00001287236,0.0003815762,0.003173298],"genre_scores_gemma":[0.8057242,0.00001503331,0.1935593,0.0001745362,0.00007663004,0.0001178094,0.0000596073,0.00001115101,0.0002617293],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8044717,"threshold_uncertainty_score":0.9997556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053123000","doi":"10.1111/0824-7935.00166","title":"A Complexity‐Level Analysis of the Sensor Planning Task for Object Search","year":2001,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"National Research Council Canada","keywords":"Task (project management); Object (grammar); Computer science; Computer vision; Point (geometry); Artificial intelligence; Field (mathematics); Cognitive neuroscience of visual object recognition; Object detection; Pattern recognition (psychology); Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.196244090453975,"gpt":0.4080703288778841,"spread":0.2118262384239092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003096044,0.0001158129,0.0002177587,0.0002470113,0.0001789021,0.00005972563,0.0009410532,0.00003630203,0.00001173394],"category_scores_gemma":[0.0001685093,0.00009021632,0.0002128662,0.002121023,0.0001670412,0.0002304824,0.0002329453,0.0001131434,0.000004458985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004112885,"about_ca_system_score_gemma":0.0001080075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002078969,"about_ca_topic_score_gemma":0.000004262791,"domain_scores_codex":[0.9987095,0.00006304696,0.0003287725,0.0003136067,0.0003725456,0.0002125512],"domain_scores_gemma":[0.9982168,0.0007694339,0.0001312161,0.0003511936,0.000484439,0.00004689134],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004566746,0.0001072986,0.005121306,0.00003243351,0.0003234461,0.000007695737,0.001288811,0.7406911,0.0005313064,0.1905907,0.0002068886,0.06105338],"study_design_scores_gemma":[0.00004947614,0.00006908776,0.01890465,0.00003550354,0.00004717623,0.00001265305,0.0000682793,0.8860976,0.01614661,0.07783713,0.0005909277,0.0001408909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004695959,0.0001165041,0.9941665,0.0003308111,0.00006869781,0.0002568498,0.00003418138,0.0000774971,0.0002529887],"genre_scores_gemma":[0.6861832,0.000008786255,0.3133886,0.0002372511,0.00002011462,0.00000919348,0.00001172962,0.000005089388,0.0001360678],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6814872,"threshold_uncertainty_score":0.3678915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951586423","doi":"10.1111/coin.12225","title":"Multi‐representational convolutional neural networks for text classification","year":2019,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nexen (Canada)","funders":"Natural Science Foundation of Tianjin City; National Natural Science Foundation of China","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Natural language processing; Embedding; Focus (optics); Word embedding; Word (group theory); Semantics (computer science); Categorization; Domain (mathematical analysis); Pattern recognition (psychology)","retraction":null,"screen_n_in":null,"score":{"opus":0.0945598607666244,"gpt":0.3378425082975396,"spread":0.2432826475309152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000243366,0.0001404018,0.0001309454,0.0001018836,0.0001372933,0.0001349544,0.0007093078,0.00006823122,0.00007081683],"category_scores_gemma":[0.00007350522,0.000149218,0.00009641964,0.0002462115,0.00005493527,0.0005029435,0.0001279331,0.0001304616,0.0001641141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007703783,"about_ca_system_score_gemma":0.0001078196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000077812,"about_ca_topic_score_gemma":0.000001629322,"domain_scores_codex":[0.9984044,0.00004720628,0.0003847682,0.0005570806,0.0003552179,0.000251348],"domain_scores_gemma":[0.9983171,0.0007128493,0.0001409715,0.0003076018,0.0004403397,0.00008120373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006405781,0.00003170178,0.00175002,0.000006297154,0.000008681892,3.334352e-7,0.00006584331,0.7127671,0.00004731528,0.273244,0.0001414641,0.01193081],"study_design_scores_gemma":[0.0001712396,0.0000292972,0.01549201,0.000008581899,0.000002565089,0.00001221562,0.00003120987,0.9582679,0.00003925576,0.02552499,0.0002586147,0.0001621129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005230157,0.0001180024,0.9919708,0.000968979,0.0009274548,0.0004606668,0.000007787346,0.000119688,0.0001964408],"genre_scores_gemma":[0.6951298,0.000001814038,0.3039733,0.0003945711,0.0001107474,0.00004987748,0.00006851488,0.00000739437,0.0002640305],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6898996,"threshold_uncertainty_score":0.6084934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022929953","doi":"10.1111/j.1467-8640.2012.00453.x","title":"DART: A DISTRIBUTED ANALYSIS OF REPUTATION AND TRUST FRAMEWORK","year":2012,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Access Control and Trust","field":"Social Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Reputation; Computer science; Computational trust; Computer security; Witness; Vulnerability (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.03782939743585722,"gpt":0.3669817028838487,"spread":0.3291523054479915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003982883,0.0000590965,0.0001477117,0.0001302514,0.0002065952,0.00003907219,0.0001081491,0.00005762617,0.0002178891],"category_scores_gemma":[0.0004943404,0.00005802676,0.00005862043,0.0009752267,0.0002387168,0.0002746818,0.00002602879,0.0000659564,0.00001043977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002728108,"about_ca_system_score_gemma":0.00004459765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002638475,"about_ca_topic_score_gemma":0.00004406374,"domain_scores_codex":[0.999154,0.00008004426,0.0002165527,0.0001180342,0.0002735916,0.0001577565],"domain_scores_gemma":[0.9988673,0.0006584767,0.0001241697,0.00006605808,0.0001874115,0.00009662462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0000156493,0.00007634846,0.2076005,0.000006539558,0.0002449261,5.163063e-7,0.008314606,0.05083481,0.000002393433,0.7074793,0.00003358328,0.02539084],"study_design_scores_gemma":[0.00005772929,0.00002370753,0.7342324,0.0000218533,0.0004452929,7.368396e-7,0.003736347,0.1232315,0.00006122133,0.1366182,0.001372264,0.0001987257],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1797366,0.0004185669,0.8180611,0.0003532286,0.0001096921,0.00008125097,0.00002872987,0.00002555395,0.001185315],"genre_scores_gemma":[0.9943361,0.00003148734,0.005379849,0.00007191094,0.00008807608,0.000005426077,0.00005671747,0.000002744824,0.0000276912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8145995,"threshold_uncertainty_score":0.2385733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030117041","doi":"10.1111/j.0824-7935.2004.00259.x","title":"Negotiating Exchanges of P3p‐Labeled Information for Compensation","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Negotiation; Compensation (psychology); Private information retrieval; Protocol (science); Value (mathematics); Commodity; Space (punctuation); Computer science; Information exchange; Microeconomics; Computer security; Business; Telecommunications; Economics; Psychology; Social psychology; Finance; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.1634126903018644,"gpt":0.4240360326895398,"spread":0.2606233423876753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009200972,0.00007834595,0.0001347318,0.0001973628,0.0001912293,0.00009618261,0.0003138327,0.00004141745,0.00008853993],"category_scores_gemma":[0.001277144,0.0000699726,0.00006392234,0.0005438245,0.0001065183,0.0006257393,0.00003736869,0.00005214133,0.0002060684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003599288,"about_ca_system_score_gemma":0.00008356086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001174454,"about_ca_topic_score_gemma":0.000002671614,"domain_scores_codex":[0.998515,0.00004000098,0.0006799718,0.0001594767,0.0005022425,0.0001033789],"domain_scores_gemma":[0.9967592,0.001442321,0.0004567614,0.0001652899,0.001133113,0.00004334656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001136094,0.00001866416,0.00004015268,0.000003791447,0.000003416365,1.679461e-8,0.0005203467,0.5551018,0.00005667808,0.4217855,0.00009334704,0.0223649],"study_design_scores_gemma":[0.0001457727,0.00005412339,0.001238455,0.00001272824,0.000004962666,0.000003704345,0.001454528,0.13395,0.00410274,0.8566983,0.002248896,0.00008579507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03395168,0.00003328464,0.9641061,0.0007684696,0.000198683,0.0003171343,0.00004184462,0.00003065143,0.0005520869],"genre_scores_gemma":[0.9615343,0.000002963445,0.03806584,0.0001659189,0.00005061248,0.00004881712,0.0000671379,0.000003586411,0.0000608048],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9275826,"threshold_uncertainty_score":0.28534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090250652","doi":"10.1111/j.1467-8640.2012.00458.x","title":"A BOOTSTRAPPING METHOD FOR EXTRACTING PARAPHRASES OF EMOTION EXPRESSIONS FROM TEXTS","year":2012,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Bootstrapping (finance); WordNet; Computer science; Natural language processing; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09356020941455963,"gpt":0.3895464476941189,"spread":0.2959862382795593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004042041,0.0001012217,0.000161057,0.0001334122,0.0001335226,0.00005499315,0.0003329948,0.00003819733,0.00005742764],"category_scores_gemma":[0.0001347515,0.00009728318,0.000129806,0.0002841596,0.00002337153,0.0005638725,0.00008144291,0.00006121034,0.00001272361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001465121,"about_ca_system_score_gemma":0.00003113679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001827198,"about_ca_topic_score_gemma":3.941194e-7,"domain_scores_codex":[0.998871,0.00007068556,0.0003845585,0.000236361,0.0002419165,0.0001954901],"domain_scores_gemma":[0.9976626,0.001678403,0.0002586454,0.0001713362,0.0001524543,0.00007658133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002030513,0.0004474669,0.008042501,0.00004217421,0.0002081743,9.460538e-7,0.005271943,0.4121194,0.01245366,0.2038589,0.0006042505,0.3569303],"study_design_scores_gemma":[0.00005960381,0.00001995685,0.007323961,0.00008637841,0.00001673289,0.000002334522,0.0004248635,0.9476633,0.02424806,0.01970951,0.0003131865,0.0001321282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01038708,0.0005264252,0.9884006,0.00009986977,0.0002444737,0.0001081257,0.000007674509,0.00003844409,0.0001873315],"genre_scores_gemma":[0.5635036,0.000004606939,0.436325,0.00004282363,0.00007954127,0.000008618927,0.00001948093,0.000003246192,0.00001303608],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5531165,"threshold_uncertainty_score":0.3967093,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149177098","doi":"10.1111/j.0824-7935.2004.00253.x","title":"Purpose‐Based Expert Finding in a Portfolio Management System","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Expert system; Viewpoints; Intelligent agent; Variety (cybernetics); Subject-matter expert; Legal expert system; Context (archaeology); Knowledge management; Artificial intelligence; Data science","retraction":null,"screen_n_in":null,"score":{"opus":0.04634554656754414,"gpt":0.3030290473205264,"spread":0.2566835007529822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003004714,0.0001463615,0.000149919,0.0003306209,0.00009847616,0.0001256765,0.0005639976,0.00004685813,0.00001493737],"category_scores_gemma":[0.00001019783,0.0001486753,0.00006048083,0.000599854,0.00002093676,0.000328162,0.0001008829,0.0000830626,0.0002085207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003485145,"about_ca_system_score_gemma":0.00007644267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009694907,"about_ca_topic_score_gemma":0.000007656131,"domain_scores_codex":[0.998417,0.00004715314,0.0004459649,0.0004218835,0.0004288456,0.0002391892],"domain_scores_gemma":[0.9993755,0.00007604883,0.0001301679,0.0002646905,0.00007914595,0.00007443927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003785307,0.00008839231,0.0002836254,0.00005950198,0.000008220102,0.00009550777,0.0004851055,0.6255346,0.00003096837,0.3602916,0.00006381793,0.01305488],"study_design_scores_gemma":[0.0003787194,0.00004447729,0.005501408,0.0004743427,0.000002480864,0.0000325233,0.0002150551,0.9815711,0.002096662,0.00877553,0.0006141934,0.0002935169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005980885,0.0001480429,0.991017,0.0002312199,0.0004804421,0.0003587202,9.943795e-7,0.0001348312,0.001647815],"genre_scores_gemma":[0.8518547,0.000005104045,0.1477607,0.0002198138,0.0000353694,0.00005632229,0.000008964827,0.00000708751,0.0000519293],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8458738,"threshold_uncertainty_score":0.6062801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2777581989","doi":"10.1111/coin.12155","title":"A hybrid trust model using reinforcement learning and fuzzy logic","year":2017,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Access Control and Trust","field":"Social Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Reinforcement learning; Fuzzy logic; Trustworthiness; Term (time); Artificial intelligence; Machine learning; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.09582395210740642,"gpt":0.3850028450483746,"spread":0.2891788929409682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002927842,0.00007776174,0.00009781102,0.00003780379,0.002104852,0.0003410169,0.0002606388,0.00002985461,0.00005121421],"category_scores_gemma":[0.0002941228,0.0000767196,0.00003132795,0.0000272847,0.0003618538,0.0003663756,0.0001100332,0.0001078307,0.00002300454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004704885,"about_ca_system_score_gemma":0.0001239155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005159416,"about_ca_topic_score_gemma":0.00002196388,"domain_scores_codex":[0.9991894,0.00003348659,0.0001530786,0.000179103,0.0002615026,0.0001833712],"domain_scores_gemma":[0.9994602,0.0000891466,0.0001507453,0.00008237906,0.0001413748,0.00007613296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007353364,0.000006997991,0.002128444,0.000003556146,0.000007672282,0.000003955882,0.0007029051,0.7727665,0.000005194327,0.2099624,0.000009691461,0.01439536],"study_design_scores_gemma":[0.00004642609,0.00001053007,0.0005215934,0.00001211878,0.000006442024,0.000001843609,0.0002476264,0.794706,0.00001329408,0.2038876,0.0004601697,0.00008629153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07421868,0.0001869841,0.878873,0.0005835888,0.0001406883,0.0001490453,0.00000151387,0.00004501852,0.04580149],"genre_scores_gemma":[0.9932774,0.00005005105,0.005593942,0.0001592932,0.0001050181,0.000004166841,0.000002551745,0.000004859204,0.0008027524],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9190587,"threshold_uncertainty_score":0.9991943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151620419","doi":"10.1111/coin.12016","title":"EFFICIENT ABSTRACTION SELECTION IN REINFORCEMENT LEARNING","year":2013,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Abstraction; Markov decision process; Action selection; Selection (genetic algorithm); Context (archaeology); Artificial intelligence; Set (abstract data type); Machine learning; State space; Class (philosophy); Theoretical computer science; Markov process; Programming language; Mathematics; Agency (philosophy)","retraction":null,"screen_n_in":null,"score":{"opus":0.02106858788774564,"gpt":0.2715625062281282,"spread":0.2504939183403826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002628168,0.0001311871,0.0001051841,0.000248718,0.0001334875,0.0002068463,0.0003778057,0.00005319104,0.0001949292],"category_scores_gemma":[0.0001112455,0.0001389468,0.00003319366,0.0005995125,0.0000327411,0.0003306111,0.0001145156,0.0003145914,0.001187821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002036024,"about_ca_system_score_gemma":0.00006746529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001006025,"about_ca_topic_score_gemma":0.000001879299,"domain_scores_codex":[0.9985027,0.00005782307,0.0004241246,0.0003091645,0.0004336165,0.0002726099],"domain_scores_gemma":[0.9992269,0.0002201459,0.0001554489,0.0001096667,0.000221166,0.00006666577],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001456734,0.00001925004,0.000683996,0.000006718573,0.000004422254,0.000001201673,0.0003000528,0.9697675,0.0001172439,0.02018131,0.00004969171,0.008867132],"study_design_scores_gemma":[0.00005747757,0.00008520791,0.013368,0.00002455254,0.000001016204,0.00001049316,0.00004757371,0.9829576,0.0003533816,0.002799134,0.0001507543,0.0001447819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01701595,0.00001473206,0.9795288,0.0002331844,0.0001990311,0.0002583573,2.602871e-8,0.0001543412,0.002595602],"genre_scores_gemma":[0.9560931,0.000004122202,0.04320315,0.0001177766,0.00003062712,0.00003614579,0.000004971205,0.00000721583,0.000502901],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9390771,"threshold_uncertainty_score":0.9995899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055849934","doi":"10.1111/j.1467-8640.2010.00357.x","title":"AN EFFICIENT MODEL FOR ENHANCING TEXT CATEGORIZATION USING SENTENCE SEMANTICS","year":2010,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Natural language processing; Categorization; Computer science; Sentence; Phrase; Artificial intelligence; Term (time); Meaning (existential); Semantics (computer science); Set (abstract data type); Word (group theory); Linguistics; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.05018632138260581,"gpt":0.3334549231747679,"spread":0.2832686017921621,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002522901,0.0001358497,0.0001084917,0.0001626495,0.0002697419,0.0002454647,0.0008670637,0.00008316991,0.000006843834],"category_scores_gemma":[0.000129087,0.0001370383,0.00004597558,0.000374958,0.00009867283,0.000473232,0.0001070843,0.0001445873,0.00001941667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003309573,"about_ca_system_score_gemma":0.0001587729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005966288,"about_ca_topic_score_gemma":0.00001379678,"domain_scores_codex":[0.998735,0.00001453247,0.0003216268,0.0004323921,0.0002715967,0.0002248875],"domain_scores_gemma":[0.9987645,0.0001717571,0.000156662,0.0004037839,0.0004336771,0.00006960686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001299596,0.00004134909,0.00003770252,0.000005926459,0.000001983268,2.264763e-7,0.00024707,0.6120922,0.008512221,0.372273,0.000009931422,0.00677711],"study_design_scores_gemma":[0.00003586597,0.00002380723,0.00007107913,0.000007054099,0.000003374284,0.000006775845,0.00009637201,0.8731547,0.02112244,0.1053085,0.00002052313,0.0001495134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03545609,0.00001371015,0.9630983,0.0003997252,0.0004058394,0.000245335,0.000004124046,0.0003456725,0.00003116801],"genre_scores_gemma":[0.6031734,0.00000134469,0.3966781,0.0000677257,0.00002546792,0.00001389658,0.0000109331,0.000006174734,0.00002292729],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5677174,"threshold_uncertainty_score":0.5588259,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034589153","doi":"10.1111/j.1467-8640.2007.00311.x","title":"THE DATALOG<sup><scp>DL</scp></sup> COMBINATION OF DEDUCTION RULES AND DESCRIPTION LOGICS","year":2007,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Research and Productivity Council; University of New Brunswick","funders":"","keywords":"Datalog; Description logic; Computer science; Semantic reasoner; Decidability; Programming language; RuleML; Web Ontology Language; Semantic Web; Semantic Web Rule Language; Parameterized complexity; Theoretical computer science; Ontology language; Artificial intelligence; XML; Algorithm; World Wide Web; Social Semantic Web","retraction":null,"screen_n_in":null,"score":{"opus":0.0440552765355806,"gpt":0.2839098260728724,"spread":0.2398545495372917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008510294,0.0001176025,0.0001193258,0.0001114267,0.0002732597,0.0001610065,0.0005424852,0.00006520381,0.000001172395],"category_scores_gemma":[0.0005050625,0.0000922031,0.00003644636,0.000290721,0.0002921456,0.0005210946,0.0001843683,0.0001128642,0.00002233587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003559044,"about_ca_system_score_gemma":0.00004845517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003345243,"about_ca_topic_score_gemma":0.00001408303,"domain_scores_codex":[0.9987391,0.00006340524,0.0003728547,0.0002802383,0.0003337135,0.0002106548],"domain_scores_gemma":[0.9976534,0.001559162,0.0001771983,0.0002359905,0.0003242591,0.00004999572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006620106,0.00008698385,0.002476228,0.00002066279,0.00002199986,0.000004741662,0.001759797,0.03218812,0.0001353255,0.830145,0.0005639787,0.1325905],"study_design_scores_gemma":[0.0000829635,0.0001130605,0.0547972,0.00002515331,0.00000765182,0.00007278165,0.001395219,0.5290737,0.003159729,0.4102381,0.0009622027,0.00007219904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.230285,0.0008475119,0.7679561,0.0002020343,0.0002535928,0.0001092182,0.000001956526,0.00006043792,0.0002841203],"genre_scores_gemma":[0.9468183,0.0001524354,0.05283351,0.00007166434,0.00004239312,0.000003636427,0.00002145765,0.000004295493,0.00005232602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7165332,"threshold_uncertainty_score":0.3759933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}