{"meta":{"query_hash":"bc50ec644ded","filters":{"venue":"Computational Intelligence"},"cohort_total":118,"direct_labels_cover":0,"predictions_cover":118,"exported":118,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/bc50ec644ded","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computational+Intelligence"},"results":[{"id":"W1562324652","doi":"10.1111/coin.12060","title":"Concurrent Individual And Social Learning In Robot Teams","year":2015,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute for Christian Studies; University of Toronto","funders":"","keywords":"Robot; Computer science; Team learning; Relation (database); Human–computer interaction; Artificial intelligence; Knowledge management; Cooperative learning; Psychology; Teaching method; Open learning","score_opus":0.07697776732268413,"score_gpt":0.3196348699339635,"score_spread":0.24265710261127937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562324652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064601847,0.000111563575,0.9918087,0.00055188563,0.00026200595,0.00009230395,4.237922e-7,0.00009469482,0.0006182434],"genre_scores_gemma":[0.97265375,0.0000041031194,0.026953198,0.00019733072,0.000048986385,0.000006041789,0.000014528304,0.0000062100926,0.00011588012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864566,0.000099999066,0.00028736613,0.0002825212,0.0004641624,0.00022029046],"domain_scores_gemma":[0.9993763,0.0002182843,0.00010514194,0.00007807214,0.0001395346,0.00008265068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004841859,0.000118727476,0.00013180748,0.00014107172,0.00010184942,0.00020327818,0.0004773619,0.000050790906,0.000006401582],"category_scores_gemma":[0.00013688135,0.00012662556,0.00002308031,0.00029755424,0.00010191989,0.00034205435,0.0003614388,0.0003000517,0.00007166407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011097703,0.000013844436,0.004076176,0.0000054336247,0.000005466779,0.0000051350994,0.0032322558,0.89080715,0.0000012567388,0.05634881,0.00010075223,0.045402598],"study_design_scores_gemma":[0.0001430735,0.00008895948,0.008253476,0.000015816368,0.00000214471,0.000013953917,0.00034051342,0.9838639,0.000030403085,0.006143024,0.0009477448,0.00015700886],"about_ca_topic_score_codex":0.000013473365,"about_ca_topic_score_gemma":0.00000192071,"teacher_disagreement_score":0.96619356,"about_ca_system_score_codex":0.00007831584,"about_ca_system_score_gemma":0.00016809205,"threshold_uncertainty_score":0.51636404},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06287620001503862,"score_gpt":0.31803797880602186,"score_spread":0.25516177879098323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569507287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044871416,0.00007955726,0.95335764,0.0007448538,0.00050742505,0.00006419532,0.0000028846746,0.0000717099,0.00030030406],"genre_scores_gemma":[0.7442498,8.2461867e-7,0.25502205,0.00047599184,0.00013640936,0.0000021266,0.00003324643,0.000005575652,0.00007395504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998681,0.000063317,0.0002923652,0.0004183052,0.00036127996,0.00018371419],"domain_scores_gemma":[0.9990798,0.00023338941,0.00010218497,0.00025923105,0.0002151085,0.000110251065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019730908,0.0001381531,0.0001624932,0.00014961243,0.0001643399,0.00023428634,0.0005443624,0.000044164597,0.00009610151],"category_scores_gemma":[0.00007588007,0.0001347817,0.00006966509,0.0005128829,0.000030428988,0.00031007864,0.00017689719,0.00008474543,0.00026355637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035718442,0.000033582175,0.0017649021,0.0000035251046,0.00002843663,0.0000021873345,0.0016989458,0.8799006,0.0002983691,0.08247226,0.0006458497,0.0331478],"study_design_scores_gemma":[0.000038766735,0.000024416877,0.0036876528,0.000026072414,0.000007652896,0.0000027699152,0.00006658957,0.94914925,0.001767894,0.04410637,0.0009520356,0.00017053775],"about_ca_topic_score_codex":0.0001798384,"about_ca_topic_score_gemma":0.000016244407,"teacher_disagreement_score":0.69937843,"about_ca_system_score_codex":0.000042074564,"about_ca_system_score_gemma":0.00004294517,"threshold_uncertainty_score":0.5496238},"labels":[],"label_agreement":null},{"id":"W1769238403","doi":"10.1111/coin.12055","title":"zTrust: Adaptive Decentralized Trust Model for Quality of Service Selection in Electronic Marketplaces","year":2014,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Access Control and Trust","field":"Social Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of New Brunswick","funders":"","keywords":"Computer science; Merge (version control); Procurement; Service provider; Crowdsourcing; Trustworthiness; Quality (philosophy); Probabilistic logic; Selection (genetic algorithm); Service quality; Service (business); Risk analysis (engineering); Artificial intelligence; Computer security; Business; Marketing; World Wide Web; Information retrieval","score_opus":0.07000378182490972,"score_gpt":0.3818909784316101,"score_spread":0.31188719660670033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1769238403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10207801,0.00010020544,0.8949506,0.00064367364,0.000054726333,0.00036184536,0.000010520977,0.000032385346,0.0017679852],"genre_scores_gemma":[0.9928461,0.000033992976,0.006619724,0.00024757185,0.000048357288,0.000045673365,0.0000099872705,0.00000717716,0.00014143862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985336,0.0002559641,0.00037795206,0.00022610307,0.00029915068,0.00030723776],"domain_scores_gemma":[0.9981916,0.0010518236,0.00018832552,0.000049904178,0.00046293053,0.000055443772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012894667,0.000096385746,0.0002019877,0.0000849148,0.00018732931,0.000029181387,0.00025139048,0.000076958815,0.00005751985],"category_scores_gemma":[0.00042046243,0.00010106334,0.00006371553,0.00043019914,0.00010255939,0.00022615261,0.000019449837,0.00010109971,0.0000065352406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028430775,0.000058624806,0.0027121953,0.000019442905,0.0000140418115,2.6623985e-8,0.0016386316,0.4482316,0.000021766638,0.53869104,0.000028091217,0.0083002085],"study_design_scores_gemma":[0.00019396495,0.000028037135,0.005247049,0.0000117039335,0.000006058587,1.0102907e-7,0.00039868118,0.75946766,0.00006170763,0.23430566,0.00018939376,0.00008997282],"about_ca_topic_score_codex":0.0017199585,"about_ca_topic_score_gemma":0.00909047,"teacher_disagreement_score":0.89076805,"about_ca_system_score_codex":0.00014270654,"about_ca_system_score_gemma":0.00036372172,"threshold_uncertainty_score":0.50726956},"labels":[],"label_agreement":null},{"id":"W182494199","doi":"10.1111/j.1467-8640.2012.00419.x","title":"DETONATION CLASSIFICATION FROM ACOUSTIC SIGNATURE WITH THE RESTRICTED BOLTZMANN MACHINE","year":2012,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Université de Montréal","funders":"","keywords":"Discriminative model; Signature (topology); Preprocessor; Task (project management); Pattern recognition (psychology); Support vector machine; Property (philosophy); Boltzmann machine","score_opus":0.027353602024745155,"score_gpt":0.2552475120779182,"score_spread":0.22789391005317303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182494199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022979553,0.0007099029,0.9937143,0.0023645104,0.00028042382,0.00017329247,0.0000095205805,0.00007872901,0.0003713849],"genre_scores_gemma":[0.9220841,0.000013580294,0.076947525,0.00053656904,0.0002575741,0.000019732228,0.000063920816,0.00000837387,0.00006865049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879515,0.00014226927,0.0001860579,0.0002717006,0.00038234488,0.00022248965],"domain_scores_gemma":[0.9985,0.0007250437,0.00014031604,0.00028192776,0.00027222428,0.00008052687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017960063,0.0001460392,0.00010033172,0.000060341485,0.0002694268,0.00015380314,0.0005896174,0.000056132638,0.000040679755],"category_scores_gemma":[0.00007527775,0.00009469335,0.0000367749,0.0005387837,0.00008337083,0.00065503456,0.00008713319,0.0001918849,0.000082338185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020920806,0.00009742855,0.0006810582,0.0000029094401,0.00004901224,0.0000022096738,0.0009018144,0.9087896,0.0012943607,0.03321815,0.0024128587,0.052529715],"study_design_scores_gemma":[0.00005029598,0.000031249503,0.03869052,0.000010723237,0.000015156093,0.0000055861597,0.000072550785,0.9534104,0.0012124676,0.005105472,0.0012492754,0.0001463064],"about_ca_topic_score_codex":0.00003701719,"about_ca_topic_score_gemma":0.000017890097,"teacher_disagreement_score":0.9197861,"about_ca_system_score_codex":0.00005093529,"about_ca_system_score_gemma":0.000060387174,"threshold_uncertainty_score":0.38614827},"labels":[],"label_agreement":null},{"id":"W1868020197","doi":"10.1111/coin.12009","title":"EXPLORING A SUBGRAPH MATCHING APPROACH FOR EXTRACTING BIOLOGICAL EVENTS FROM LITERATURE","year":2013,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Parsing; Subgraph isomorphism problem; Event (particle physics); Task (project management); Matching (statistics); Artificial intelligence; Natural language processing; Data mining; Graph; Machine learning; Information retrieval; Theoretical computer science","score_opus":0.15139652313491275,"score_gpt":0.31821172745195253,"score_spread":0.16681520431703978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1868020197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4146431,0.00090689596,0.58402866,0.0000729796,0.000111352245,0.0001297297,0.000017824208,0.000022612925,0.00006687193],"genre_scores_gemma":[0.7841993,0.00009845512,0.21463613,0.00014810113,0.00021567411,0.00014630979,0.00051516556,0.000008324544,0.000032540713],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991126,0.000038252314,0.00020272963,0.00035124732,0.00010355865,0.00019160601],"domain_scores_gemma":[0.99946034,0.00017355806,0.00006643014,0.000110429464,0.0001223621,0.000066852306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120845034,0.00012599737,0.00011263673,0.000035108165,0.000097773045,0.00004216895,0.00020520811,0.00012175486,0.000015053757],"category_scores_gemma":[0.00020098178,0.00010255338,0.000089589215,0.00009395738,0.00006557399,0.000011217601,0.000074360316,0.00011451749,0.000012730759],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023919056,0.00053581386,0.008348287,0.00012232583,0.00033656994,0.0000060011075,0.002280363,0.045811422,0.09347689,0.002671958,0.0020309587,0.84414023],"study_design_scores_gemma":[0.0016854096,0.0021132885,0.18051885,0.000861767,0.00008351717,0.00015753006,0.009851526,0.21489382,0.12084861,0.45141205,0.014162921,0.003410701],"about_ca_topic_score_codex":0.0000228285,"about_ca_topic_score_gemma":5.0682644e-7,"teacher_disagreement_score":0.84072953,"about_ca_system_score_codex":0.000007123395,"about_ca_system_score_gemma":0.000018586763,"threshold_uncertainty_score":0.41820052},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05995408911021713,"score_gpt":0.3051056388127768,"score_spread":0.24515154970255967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1881830221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033651444,0.0002686328,0.98838633,0.004954608,0.00024901968,0.00014167416,8.7868943e-7,0.00049975235,0.0021339417],"genre_scores_gemma":[0.5979967,0.000010882235,0.40138468,0.00024574113,0.00003859177,0.00001448647,0.000009100088,0.000006551547,0.0002932383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856234,0.000036862024,0.00022428062,0.00042202024,0.00053020875,0.00022428678],"domain_scores_gemma":[0.9990165,0.00013707865,0.000108905864,0.00036584018,0.00029145944,0.00008021694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002121207,0.00015792392,0.00012698016,0.000089181194,0.00014255194,0.00029843315,0.0006972788,0.000065587905,0.000013596736],"category_scores_gemma":[0.000064504,0.00012445773,0.000031836462,0.00051381055,0.000089761495,0.0010720165,0.00037227658,0.00016813446,0.00012628519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002758804,0.00006838173,0.00050056935,0.000017903492,0.00002572777,0.00003707669,0.002940456,0.18403164,0.00004589419,0.7090959,0.0046806014,0.09852829],"study_design_scores_gemma":[0.00031051823,0.0003880777,0.0007132747,0.00010976508,0.000007191028,0.00016405234,0.0013236556,0.52870655,0.005800617,0.44599962,0.015958104,0.00051859306],"about_ca_topic_score_codex":0.000014292062,"about_ca_topic_score_gemma":0.000004808185,"teacher_disagreement_score":0.59463155,"about_ca_system_score_codex":0.00009938571,"about_ca_system_score_gemma":0.00011231773,"threshold_uncertainty_score":0.5075239},"labels":[],"label_agreement":null},{"id":"W1910978492","doi":"10.1111/coin.12071","title":"Mining Evolving Data Streams with Particle Filters","year":2015,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Resampling; Computer science; Data stream; Data stream mining; Particle filter; Logistic regression; Data mining; Gradient descent; Artificial intelligence; Key (lock); Feature (linguistics); Noise (video); Filter (signal processing); Pattern recognition (psychology); Regression; Machine learning; Artificial neural network; Mathematics; Statistics; Kalman filter","score_opus":0.15412026395266853,"score_gpt":0.3415073941507162,"score_spread":0.18738713019804765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1910978492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009112593,0.00010157755,0.98857355,0.0005303001,0.000108798245,0.00009806197,0.000019813842,0.0004193451,0.0010359735],"genre_scores_gemma":[0.51696706,0.0000011674155,0.48275462,0.00014545194,0.000023612392,0.0000058882047,0.00006580714,0.000006660394,0.000029738047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983435,0.00005289823,0.00024434453,0.00056971976,0.0005315319,0.00025798022],"domain_scores_gemma":[0.99804604,0.00030750316,0.00010550669,0.0011001325,0.000261547,0.00017927984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047829142,0.00014471138,0.0001255722,0.00006613186,0.00008110685,0.0003428968,0.0027612387,0.000029830433,0.0000140273505],"category_scores_gemma":[0.00025080802,0.00012897115,0.000014568784,0.00045896522,0.000107010805,0.0015637313,0.001165792,0.00009435211,0.00008807747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046127,0.00032179625,0.014652931,0.00002724668,0.00010315624,0.00021691559,0.005053949,0.16082604,0.0000481407,0.13323462,0.07100506,0.614464],"study_design_scores_gemma":[0.00006980619,0.00015601207,0.00043972372,0.00005652069,0.000005082672,0.00006205245,0.00022095424,0.9846644,0.0014560795,0.011759567,0.0009092383,0.00020056545],"about_ca_topic_score_codex":0.00004797505,"about_ca_topic_score_gemma":0.000012299571,"teacher_disagreement_score":0.82383835,"about_ca_system_score_codex":0.000055717042,"about_ca_system_score_gemma":0.00022864236,"threshold_uncertainty_score":0.5259291},"labels":[],"label_agreement":null},{"id":"W1923069598","doi":"10.1111/coin.12026","title":"A SUPER‐AGENT‐BASED FRAMEWORK FOR REPUTATION MANAGEMENT AND COMMUNITY FORMATION IN DECENTRALIZED SYSTEMS","year":2014,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Access Control and Trust","field":"Social Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Reputation; Judgement; Computer science; Context (archaeology); Incentive; Scalability; Multi-agent system; Service (business); Reputation system; Knowledge management; Business; Internet privacy; Marketing; Artificial intelligence; Microeconomics; Database","score_opus":0.06784883740683885,"score_gpt":0.3628416792312453,"score_spread":0.29499284182440644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923069598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03725912,0.00013291392,0.96036255,0.00042756725,0.00017097738,0.0005729427,0.000004941819,0.0000395413,0.0010294629],"genre_scores_gemma":[0.97514904,0.00003380563,0.024399472,0.00020502404,0.0000373364,0.00010336963,0.00004242537,0.0000051397424,0.00002441436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987676,0.0004536599,0.00026193575,0.000120470555,0.00022178878,0.000174529],"domain_scores_gemma":[0.99790776,0.0017249924,0.000088020584,0.000081563914,0.0001397514,0.00005792205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001068378,0.00007371659,0.000112437316,0.00009657954,0.0005731874,0.00015378898,0.00016129439,0.00005846507,0.000012718282],"category_scores_gemma":[0.00048869447,0.000077330704,0.000028062717,0.00020077905,0.00009738984,0.0002732661,0.000022351805,0.0001228857,0.0000075356656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044026343,0.00007279679,0.0014590253,0.00010357934,0.000008357422,6.015122e-7,0.0045078318,0.14385916,7.2396426e-7,0.8277917,0.000027529124,0.022124661],"study_design_scores_gemma":[0.0002706019,0.000040010123,0.005452689,0.000116464544,0.000009480693,5.89458e-7,0.0052075847,0.65325737,0.0000126151945,0.33329105,0.0022272612,0.00011429428],"about_ca_topic_score_codex":0.0004761861,"about_ca_topic_score_gemma":0.00025328685,"teacher_disagreement_score":0.9378899,"about_ca_system_score_codex":0.00008673553,"about_ca_system_score_gemma":0.00002209091,"threshold_uncertainty_score":0.44085523},"labels":[],"label_agreement":null},{"id":"W1966716618","doi":"10.1111/j.1467-8640.2011.00388.x","title":"TRUST BY ASSOCIATION: A META‐REPUTATION SYSTEM FOR PEER‐TO‐PEER NETWORKS","year":2011,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Access Control and Trust","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reputation; Incentive; Tying; Computer science; Association (psychology); Peer-to-peer; Trustworthiness; Internet privacy; Social network (sociolinguistics); Computer security; Psychology; World Wide Web; Microeconomics; Social media; Political science","score_opus":0.08788817194564025,"score_gpt":0.33806407521982584,"score_spread":0.2501759032741856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966716618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073321,0.0002493494,0.97813004,0.002834225,0.00081123505,0.0006438767,0.00006124506,0.00015362007,0.016383214],"genre_scores_gemma":[0.98350537,0.000004976218,0.0087788,0.0005111728,0.00035742752,0.00023433316,0.00007634113,0.000014732369,0.0065168594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979732,0.0001354936,0.00037088018,0.00031203983,0.00086609484,0.00034229597],"domain_scores_gemma":[0.99691355,0.0007543335,0.00022759505,0.000091111295,0.0018407911,0.00017262455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015438613,0.00014113687,0.00024537672,0.000071466435,0.0006070134,0.00016749234,0.00035470733,0.00013098134,0.0002837851],"category_scores_gemma":[0.00084873225,0.00013627234,0.00016545677,0.0003863113,0.0000628967,0.00032240117,0.00003390342,0.00010561701,0.00014728031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015446547,0.00019035515,0.0030730367,0.000040740233,0.0010890557,0.0000049664472,0.015870504,0.19825567,0.0000030797826,0.6994899,0.04985849,0.03196976],"study_design_scores_gemma":[0.0008521959,0.00042968936,0.0057528364,0.000086016335,0.0016649762,0.0000061243964,0.016173486,0.5949063,0.0005758544,0.113097794,0.26479316,0.0016615808],"about_ca_topic_score_codex":0.0007461725,"about_ca_topic_score_gemma":0.00013897632,"teacher_disagreement_score":0.9827722,"about_ca_system_score_codex":0.00029820346,"about_ca_system_score_gemma":0.00012311914,"threshold_uncertainty_score":0.55570245},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04287348294934867,"score_gpt":0.30327695286617407,"score_spread":0.2604034699168254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966903283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010005049,0.0002762581,0.98759884,0.0007297368,0.00005201796,0.00039771636,8.791049e-7,0.00016311769,0.00077639264],"genre_scores_gemma":[0.9777754,0.000071142436,0.021381702,0.00015342694,0.000014095873,0.00020624045,0.000018886176,0.000006670758,0.00037243878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867,0.0000464592,0.00036522033,0.0004034744,0.00019233357,0.00032252696],"domain_scores_gemma":[0.9991569,0.0002974774,0.00012688924,0.00021073173,0.0001654638,0.000042521915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034321615,0.0001227602,0.00012043046,0.0002058111,0.00017812,0.00006167776,0.00051304285,0.00007711671,0.00007213256],"category_scores_gemma":[0.00009845609,0.0001349,0.000046707843,0.00065895176,0.00005875952,0.00020718503,0.00009175161,0.00022749453,0.000051266303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040224027,0.000051655716,0.00017903412,0.0000067636515,0.0000075016656,0.0000012089321,0.0002578198,0.54723585,0.0000025598722,0.4176069,0.00022286737,0.034423843],"study_design_scores_gemma":[0.00011700051,0.00011216054,0.00042671565,0.0000109411485,0.0000018004662,0.0000066545185,0.00005925388,0.8753384,0.0001460571,0.12080299,0.0028567596,0.00012126402],"about_ca_topic_score_codex":0.000010787742,"about_ca_topic_score_gemma":0.000010450388,"teacher_disagreement_score":0.96777034,"about_ca_system_score_codex":0.00011430089,"about_ca_system_score_gemma":0.000047185527,"threshold_uncertainty_score":0.5501062},"labels":[],"label_agreement":null},{"id":"W1968935703","doi":"10.1111/j.1467-8640.2007.00310.x","title":"Using Patterns to Explain Inferences in","year":2007,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Soundness; Completeness (order theory); Computer science; Mathematical proof; Contradiction; Construct (python library); Resolution (logic); Focus (optics); Theoretical computer science; Process (computing); Artificial intelligence; Algorithm; Mathematics; Programming language; Epistemology","score_opus":0.12993887897278775,"score_gpt":0.3816141243576403,"score_spread":0.25167524538485253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968935703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25227135,0.00003555365,0.7468003,0.00020084233,0.00022198867,0.000069873204,5.473231e-7,0.000047386784,0.00035216034],"genre_scores_gemma":[0.7860326,0.0000018193109,0.21350044,0.0004249446,0.000026617661,0.0000020563741,9.197293e-7,0.0000023727132,0.0000081999715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989143,0.000027394357,0.00028654357,0.00027784097,0.00024026609,0.000253639],"domain_scores_gemma":[0.9991889,0.00044485685,0.00004517968,0.00015961494,0.00008831283,0.0000731551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044238378,0.00009466469,0.0001081,0.0002492476,0.00005193178,0.00008249655,0.000636135,0.000035026416,0.00001616781],"category_scores_gemma":[0.00011069475,0.0000910343,0.000025303976,0.00051144126,0.000027275048,0.00025030633,0.00018344063,0.00008103817,0.00006699882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010158871,0.00008030932,0.09421358,0.00001322029,0.0000067022934,0.00010183938,0.0031646295,0.4375171,0.00011337912,0.29206434,0.000038414248,0.17267631],"study_design_scores_gemma":[0.00006457871,0.000071496004,0.22342618,0.00009369533,0.0000012971682,0.000037349644,0.00072059245,0.65250164,0.0040423316,0.11860346,0.00013812816,0.0002992723],"about_ca_topic_score_codex":0.00017366785,"about_ca_topic_score_gemma":0.0002518215,"teacher_disagreement_score":0.53376126,"about_ca_system_score_codex":0.00005269754,"about_ca_system_score_gemma":0.000061436935,"threshold_uncertainty_score":0.3712271},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03243894243564606,"score_gpt":0.26476050538195983,"score_spread":0.2323215629463138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972560688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026312515,0.00025226237,0.97256905,0.00037336754,0.00020687746,0.00015593773,0.0000015441142,0.000074594296,0.00005384725],"genre_scores_gemma":[0.628051,0.000010084448,0.3714952,0.00038213038,0.000024469147,0.000012779764,0.000008437448,0.000004200916,0.0000117088275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998802,0.000028558592,0.000283897,0.00036207683,0.00035892587,0.00016455752],"domain_scores_gemma":[0.99944246,0.00012592974,0.00010490028,0.00018483541,0.000044006614,0.00009784747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001567386,0.00013337626,0.00010334112,0.00008342045,0.00017169399,0.00012633044,0.00035490192,0.00005407807,0.000035065885],"category_scores_gemma":[0.00000798185,0.00012935541,0.000024102656,0.00012044623,0.000033891636,0.0002260617,0.00012235036,0.000082110906,0.000342055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004016391,0.0001298402,0.001120412,0.00007454626,0.000020862495,0.000010778418,0.002833178,0.87277305,0.00010129956,0.08785259,0.000014275703,0.03506514],"study_design_scores_gemma":[0.00030096225,0.00007405798,0.020040134,0.00026497684,0.000005027985,0.000018590714,0.00013751097,0.9251572,0.0046699494,0.040060524,0.008773243,0.0004978187],"about_ca_topic_score_codex":0.0000112039415,"about_ca_topic_score_gemma":0.0000034550555,"teacher_disagreement_score":0.60173845,"about_ca_system_score_codex":0.000096410644,"about_ca_system_score_gemma":0.000114602335,"threshold_uncertainty_score":0.52749604},"labels":[],"label_agreement":null},{"id":"W1980737156","doi":"10.1111/1467-8640.00225","title":"A Constructive Graphical Model Approach for Knowledge‐Based Systems: A Vehicle Monitoring Case Study","year":2003,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; A priori and a posteriori; Graphical model; Inference; Set (abstract data type); Construct (python library); Domain (mathematical analysis); Constructive; Artificial intelligence; Machine learning; Combinatorial explosion; Class (philosophy); Data mining; Theoretical computer science; Mathematics; Programming language","score_opus":0.11505055853673078,"score_gpt":0.34738845178505406,"score_spread":0.23233789324832327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980737156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034282,0.00023890338,0.96396774,0.0000139933645,0.00036298129,0.0006554877,0.0000064559263,0.0001562291,0.00031622202],"genre_scores_gemma":[0.68014836,6.6465907e-7,0.31959373,0.000016842432,0.000033899745,0.00018086818,0.0000017158573,0.000009747523,0.000014156661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981363,0.00018694805,0.0004195461,0.0006557966,0.00028696423,0.00031443726],"domain_scores_gemma":[0.9980935,0.0006302462,0.00010620031,0.0003322501,0.00067655393,0.00016127208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005596795,0.00022021348,0.00023804278,0.0001691922,0.0003316819,0.0002509393,0.00050399493,0.00007947137,8.058329e-7],"category_scores_gemma":[0.00012429857,0.00021927292,0.000092254624,0.0005349658,0.000106738305,0.00026421255,0.00006715869,0.00020612976,0.000007183793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006129505,0.00036579603,0.00035828174,0.000027882883,0.000023131794,0.000038733906,0.0011432089,0.82528454,0.00000883209,0.17075163,0.000009906492,0.0019819168],"study_design_scores_gemma":[0.00021921092,0.00014919811,0.000011706009,0.00002497305,0.000013502148,0.00035568824,0.0017964753,0.9669323,0.00021317165,0.030036766,0.0000038743283,0.00024311397],"about_ca_topic_score_codex":0.000025055513,"about_ca_topic_score_gemma":0.00000106292,"teacher_disagreement_score":0.6458664,"about_ca_system_score_codex":0.000071296075,"about_ca_system_score_gemma":0.00037904602,"threshold_uncertainty_score":0.894169},"labels":[],"label_agreement":null},{"id":"W1984223417","doi":"10.1111/j.1467-8640.2008.01328.x","title":"FAULT‐TOLERANT MULTI‐AGENT EXACT BELIEF PROPAGATION","year":2009,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Tree traversal; Belief propagation; Inference; Probabilistic logic; Hyperbolic tree; Bayesian network; Scalability; Distributed computing; Fault tolerance; Theoretical computer science; Artificial intelligence; Process (computing); Machine learning; Algorithm; Mathematics","score_opus":0.053599076645023926,"score_gpt":0.31298538605778753,"score_spread":0.2593863094127636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984223417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002767538,0.0002114919,0.994059,0.0014977601,0.00026643282,0.00018914868,0.0000024691642,0.0002724701,0.0007336806],"genre_scores_gemma":[0.7761953,0.000014060454,0.22250421,0.0010620186,0.000052985804,0.000009002959,0.00001238517,0.0000049568016,0.00014507615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998269,0.00006674238,0.00040803617,0.0005150387,0.00044674074,0.00029443062],"domain_scores_gemma":[0.9989758,0.00010566017,0.0001149933,0.00032058623,0.00034080667,0.00014215082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026632968,0.00019414663,0.00015956294,0.00012010707,0.00019426782,0.00023585247,0.0008155166,0.000068914436,0.000019909512],"category_scores_gemma":[0.00005874809,0.0001841653,0.00007575429,0.0004172006,0.000050655493,0.0004903214,0.00007919585,0.0001979638,0.00036995066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005582883,0.00019264246,0.000028639559,0.000006674133,0.0000076239303,0.000014111599,0.00055021007,0.5159249,0.00026280043,0.20198281,0.000313852,0.2807102],"study_design_scores_gemma":[0.000071845825,0.000121555575,0.0019207055,0.00004154955,0.0000028794157,0.000027869797,0.000013733796,0.91904813,0.0019022549,0.076400466,0.00022547689,0.00022355276],"about_ca_topic_score_codex":0.000010590395,"about_ca_topic_score_gemma":0.0000014897228,"teacher_disagreement_score":0.7734278,"about_ca_system_score_codex":0.00006748828,"about_ca_system_score_gemma":0.000132806,"threshold_uncertainty_score":0.7510043},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05472830275994485,"score_gpt":0.33657597542470796,"score_spread":0.2818476726647631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988366874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49660864,0.0007649846,0.50220585,0.000022837616,0.00013967715,0.00007607831,0.0000023274729,0.000010618128,0.00016895382],"genre_scores_gemma":[0.9836398,0.000056246325,0.016081216,0.00006574607,0.00006442725,0.00000956919,0.000010450866,0.000006569061,0.000066007735],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99936664,0.000048083166,0.00013598481,0.00022809886,0.00010198077,0.000119225355],"domain_scores_gemma":[0.999667,0.000076533586,0.00006060704,0.00007680373,0.00006576327,0.000053285192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014212939,0.00009358991,0.00008234189,0.000043083157,0.00007832567,0.00001399805,0.00007681116,0.000095366675,0.00003165485],"category_scores_gemma":[0.0001551908,0.000083575396,0.0000361112,0.00007165807,0.00016260776,0.000005325252,0.000056468452,0.000075090924,0.000009894724],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006585885,0.00055072265,0.019723803,0.0001369896,0.0003994308,0.00005927083,0.0029647718,0.00883898,0.097684965,0.0035023643,0.00038496556,0.86509514],"study_design_scores_gemma":[0.0006786299,0.002141603,0.14343908,0.0002480032,0.00017929384,0.0010682143,0.0037432206,0.08566245,0.7156088,0.03930972,0.0065452354,0.0013757512],"about_ca_topic_score_codex":0.00003436203,"about_ca_topic_score_gemma":0.0000061482947,"teacher_disagreement_score":0.8637194,"about_ca_system_score_codex":0.000015309724,"about_ca_system_score_gemma":0.000039992214,"threshold_uncertainty_score":0.34081057},"labels":[],"label_agreement":null},{"id":"W1990060580","doi":"10.1111/coin.12003","title":"A UNIFIED FRAMEWORK OF TARGETED MARKETING USING CUSTOMER PREFERENCES","year":2012,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Beijing University of Technology","keywords":"Marketing; Business; Computer science; Customer lifetime value; Marketing management; Customer retention; Service quality","score_opus":0.06711992172642273,"score_gpt":0.3074683154637047,"score_spread":0.24034839373728195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990060580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8254472,0.0004581866,0.16619807,0.000040230232,0.00064298575,0.00015639738,0.0000027115245,0.0000706188,0.0069836196],"genre_scores_gemma":[0.9843519,0.0000042121846,0.015119368,0.00015533982,0.00031327468,0.000003934414,0.000014674266,0.000013254558,0.00002405795],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989674,0.000030734183,0.00033229069,0.0001549401,0.00026853898,0.0002461127],"domain_scores_gemma":[0.9988747,0.0005084473,0.00023201513,0.00011072377,0.00025653938,0.00001757181],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00067209353,0.00013032735,0.00015641293,0.00021330694,0.00012090838,0.00006987486,0.00019917669,0.000058025355,0.00096975773],"category_scores_gemma":[0.0003565274,0.0001272387,0.000060764858,0.0005934483,0.00007592211,0.0006424949,0.00012972955,0.00014083234,0.00010319535],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015052728,0.00023622703,0.7867296,0.00037849837,0.000067240966,0.0000025342893,0.00047485236,0.033308197,0.00070842623,0.06395087,0.00023831475,0.11375476],"study_design_scores_gemma":[0.00016429258,0.000009303078,0.7159419,0.000712671,0.00024189023,0.000011211444,0.0012833815,0.22435619,0.0009308621,0.050731104,0.0046967473,0.00092045905],"about_ca_topic_score_codex":0.0001511425,"about_ca_topic_score_gemma":0.0000028972656,"teacher_disagreement_score":0.191048,"about_ca_system_score_codex":0.00001554245,"about_ca_system_score_gemma":0.000027252163,"threshold_uncertainty_score":0.9999435},"labels":[],"label_agreement":null},{"id":"W2002038683","doi":"10.1111/j.1467-8640.2007.00306.x","title":"INTRODUCTION TO THE SPECIAL ISSUE ON CANADIAN SEMANTIC WEB","year":2007,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval","funders":"","keywords":"Citation; Computer science; World Wide Web; Library science","score_opus":0.022854170038005845,"score_gpt":0.28285357516410164,"score_spread":0.2599994051260958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002038683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034775003,0.000031762305,0.92328125,0.05974862,0.0036487528,0.00020361826,0.0000019340084,0.00008496744,0.009521604],"genre_scores_gemma":[0.95558095,0.000004749419,0.024228454,0.0054537123,0.013905426,0.000005736358,0.0000052793057,0.000007348496,0.00080835895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987384,0.000033509925,0.00022322228,0.0003564427,0.00032366364,0.0003247747],"domain_scores_gemma":[0.9989894,0.00031178023,0.000041349023,0.0003393263,0.00015955452,0.00015858005],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005549973,0.00011423997,0.00009257115,0.00022790686,0.000253631,0.00014571051,0.00086688023,0.000040309664,0.00018830659],"category_scores_gemma":[0.00021063432,0.0000874166,0.000038949893,0.0006033606,0.00005511743,0.00013092959,0.000081656115,0.00013631461,0.0030898517],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013265111,0.000032987315,0.00019035263,0.0000040890573,0.000012872391,0.000036387522,0.0012446087,0.16275246,0.0000116241,0.35716203,0.18158326,0.29695606],"study_design_scores_gemma":[0.0000496293,0.00017022417,0.016714483,0.000019157784,0.0000045841693,0.00007491031,0.00031484035,0.14026742,0.0016007018,0.031831183,0.8086563,0.0002965686],"about_ca_topic_score_codex":0.0017513693,"about_ca_topic_score_gemma":0.0234901,"teacher_disagreement_score":0.95210344,"about_ca_system_score_codex":0.00012065474,"about_ca_system_score_gemma":0.00018386613,"threshold_uncertainty_score":0.9976864},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.042250087371102404,"score_gpt":0.303428735858981,"score_spread":0.2611786484878786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012352792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03921207,0.0001698123,0.95729095,0.00058855873,0.00014364699,0.000086512526,0.0000011612017,0.00010239686,0.0024048719],"genre_scores_gemma":[0.9028803,0.000009912523,0.09639939,0.00060641917,0.00005641874,0.0000029696223,0.000012816384,0.000004698035,0.00002708078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983031,0.00008826447,0.00042984978,0.0004814397,0.00036478537,0.00033254825],"domain_scores_gemma":[0.9990766,0.00036429474,0.000103919825,0.00025090037,0.000116944626,0.00008733999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030335243,0.00015632261,0.00022835504,0.00038820517,0.00011838237,0.00019255503,0.00089228665,0.000049348917,0.00007339633],"category_scores_gemma":[0.000026147132,0.00014971994,0.00013001154,0.0028516895,0.00005886283,0.00036992924,0.00022650097,0.00018246546,0.00009778793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003569994,0.00006085092,0.014094463,0.0000018193131,0.000027982582,0.000069345784,0.00034647196,0.88545495,0.0000013336922,0.031543758,0.000034389668,0.068361074],"study_design_scores_gemma":[0.000050288232,0.000036436544,0.053208902,0.000006162644,0.000009335751,0.000029164894,0.000024180945,0.91595656,0.000010858388,0.030356556,0.00014800613,0.00016355814],"about_ca_topic_score_codex":0.000085003,"about_ca_topic_score_gemma":0.000028117867,"teacher_disagreement_score":0.8636682,"about_ca_system_score_codex":0.000058566537,"about_ca_system_score_gemma":0.000046045523,"threshold_uncertainty_score":0.6105402},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Reputation; Computer science; Computational trust; Computer security; Witness; Vulnerability (computing)","score_opus":0.03782939743585722,"score_gpt":0.3669817028838487,"score_spread":0.32915230544799146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022929953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17973657,0.00041856687,0.8180611,0.00035322856,0.000109692104,0.00008125097,0.000028729872,0.000025553953,0.0011853152],"genre_scores_gemma":[0.99433607,0.000031487336,0.005379849,0.00007191094,0.00008807608,0.000005426077,0.00005671747,0.000002744824,0.000027691203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99915403,0.000080044265,0.0002165527,0.00011803421,0.00027359158,0.00015775645],"domain_scores_gemma":[0.9988673,0.0006584767,0.00012416972,0.00006605808,0.00018741145,0.00009662462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003982883,0.000059096496,0.00014771167,0.00013025143,0.00020659523,0.000039072187,0.00010814914,0.000057626174,0.00021788912],"category_scores_gemma":[0.0004943404,0.00005802676,0.00005862043,0.0009752267,0.00023871684,0.00027468184,0.000026028787,0.0000659564,0.000010439772],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015649304,0.00007634846,0.20760052,0.000006539558,0.00024492614,5.1630633e-7,0.008314606,0.050834812,0.0000023934326,0.7074793,0.000033583277,0.025390837],"study_design_scores_gemma":[0.000057729292,0.000023707533,0.7342324,0.000021853299,0.0004452929,7.3683964e-7,0.0037363472,0.12323149,0.000061221326,0.13661818,0.0013722638,0.00019872574],"about_ca_topic_score_codex":0.00026384753,"about_ca_topic_score_gemma":0.00004406374,"teacher_disagreement_score":0.8145995,"about_ca_system_score_codex":0.00002728108,"about_ca_system_score_gemma":0.00004459765,"threshold_uncertainty_score":0.2385733},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.14856716375644577,"score_gpt":0.39605426265136146,"score_spread":0.24748709889491569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023639956","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025671194,0.00010155171,0.99733526,0.0009668512,0.00020356632,0.0003522985,0.00016190506,0.0005615682,0.000060263777],"genre_scores_gemma":[0.24950235,0.00001107783,0.7489188,0.00030851352,0.000055892968,0.000053073585,0.0011233544,0.0000128791025,0.000014112193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803066,0.00007360439,0.00042029854,0.0008785095,0.0003250194,0.0002719278],"domain_scores_gemma":[0.996691,0.0016987117,0.00021720964,0.001003679,0.0003043317,0.00008505763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059120444,0.00017055498,0.0001904352,0.00011144474,0.0002466361,0.00022403889,0.0025103549,0.00007432677,0.0000075878206],"category_scores_gemma":[0.0010421113,0.00018208487,0.000048334947,0.00037159145,0.000052356103,0.0008704952,0.0006677986,0.00021274455,0.00006528133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002143019,0.00007855353,0.00023874808,0.00001541981,0.000030857882,0.0000034365405,0.00049936405,0.7082524,0.0017508254,0.13805598,0.00050560577,0.15054743],"study_design_scores_gemma":[0.00013551103,0.000031505206,0.00060933,0.000035261954,0.0000035300488,0.0000050799463,0.000027513472,0.72900766,0.008515215,0.2593768,0.0020854357,0.00016719059],"about_ca_topic_score_codex":0.000115624476,"about_ca_topic_score_gemma":0.000013102049,"teacher_disagreement_score":0.24924563,"about_ca_system_score_codex":0.00010460465,"about_ca_system_score_gemma":0.00018849065,"threshold_uncertainty_score":0.7425206},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.16341269030186445,"score_gpt":0.42403603268953977,"score_spread":0.2606233423876753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030117041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03395168,0.00003328464,0.96410614,0.0007684696,0.00019868296,0.00031713425,0.00004184462,0.000030651434,0.00055208686],"genre_scores_gemma":[0.9615343,0.0000029634448,0.038065836,0.0001659189,0.00005061248,0.00004881712,0.0000671379,0.0000035864107,0.0000608048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851495,0.00004000098,0.0006799718,0.00015947665,0.0005022425,0.00010337887],"domain_scores_gemma":[0.9967592,0.0014423209,0.00045676142,0.00016528991,0.0011331126,0.000043346558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092009717,0.00007834595,0.00013473179,0.00019736275,0.00019122932,0.00009618261,0.0003138327,0.00004141745,0.00008853993],"category_scores_gemma":[0.0012771438,0.0000699726,0.000063922336,0.00054382446,0.00010651826,0.0006257393,0.000037368693,0.000052141335,0.00020606839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011360945,0.000018664157,0.00004015268,0.0000037914467,0.000003416365,1.6794607e-8,0.00052034674,0.5551018,0.00005667808,0.42178547,0.00009334704,0.022364901],"study_design_scores_gemma":[0.0001457727,0.00005412339,0.0012384552,0.0000127282365,0.0000049626665,0.0000037043446,0.0014545278,0.13394997,0.0041027395,0.85669833,0.0022488956,0.00008579507],"about_ca_topic_score_codex":0.000011744535,"about_ca_topic_score_gemma":0.0000026716139,"teacher_disagreement_score":0.9275826,"about_ca_system_score_codex":0.000035992878,"about_ca_system_score_gemma":0.00008356086,"threshold_uncertainty_score":0.28533998},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0440552765355806,"score_gpt":0.28390982607287235,"score_spread":0.23985454953729174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034589153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23028503,0.0008475119,0.7679561,0.00020203428,0.0002535928,0.00010921821,0.0000019565261,0.000060437924,0.00028412032],"genre_scores_gemma":[0.9468183,0.00015243539,0.05283351,0.00007166434,0.000042393123,0.0000036364272,0.000021457647,0.0000042954935,0.00005232602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987391,0.00006340524,0.00037285467,0.00028023825,0.0003337135,0.00021065476],"domain_scores_gemma":[0.99765337,0.0015591616,0.0001771983,0.00023599053,0.0003242591,0.00004999572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085102936,0.00011760254,0.00011932577,0.00011142674,0.0002732597,0.00016100651,0.0005424852,0.000065203814,0.0000011723952],"category_scores_gemma":[0.0005050625,0.000092203096,0.000036446363,0.000290721,0.0002921456,0.0005210946,0.00018436833,0.00011286422,0.000022335875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006620106,0.000086983855,0.0024762284,0.000020662792,0.000021999858,0.0000047416615,0.0017597971,0.032188125,0.00013532549,0.830145,0.00056397874,0.13259052],"study_design_scores_gemma":[0.0000829635,0.000113060516,0.054797202,0.000025153311,0.00000765182,0.00007278165,0.0013952185,0.5290737,0.003159729,0.41023812,0.0009622027,0.00007219904],"about_ca_topic_score_codex":0.000033452427,"about_ca_topic_score_gemma":0.000014083026,"teacher_disagreement_score":0.71653324,"about_ca_system_score_codex":0.000035590438,"about_ca_system_score_gemma":0.00004845517,"threshold_uncertainty_score":0.3759933},"labels":[],"label_agreement":null},{"id":"W2038818712","doi":"10.1111/j.0824-7935.2004.00252.x","title":"The Advantages of Designing Adaptive Business Agents Using Reputation Modeling Compared to the Approach of Recursive Modeling","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Computer science; Purchasing; Exploit; Reinforcement learning; Quality (philosophy); Risk analysis (engineering); Complex adaptive system; Artificial intelligence; Computer security; Business; Marketing","score_opus":0.1203924856587944,"score_gpt":0.32916524780149004,"score_spread":0.20877276214269563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038818712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01648185,0.000134941,0.9824988,0.00016281393,0.0001947315,0.00039898697,0.0000015771942,0.000031873955,0.0000944082],"genre_scores_gemma":[0.6055266,0.0000103127195,0.39438674,0.000037221103,0.00001713911,0.0000064625783,0.0000044697795,0.0000074235572,0.0000036006466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799895,0.00011269599,0.0006665705,0.0003245012,0.0006619087,0.00023536794],"domain_scores_gemma":[0.9975445,0.0003998779,0.00036457868,0.00035282256,0.0012874563,0.000050724666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006514619,0.00016134969,0.00019893263,0.00012855619,0.00038445642,0.00009339595,0.0010973628,0.00003891966,5.7487085e-7],"category_scores_gemma":[0.00028276804,0.00011886874,0.000066013396,0.0009333374,0.000119909535,0.00036788182,0.00028148553,0.00015748126,0.0000041226353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022063614,0.000021512087,0.000010901322,0.000014963751,0.00002813111,6.6746225e-7,0.0045772097,0.9546034,0.000057650945,0.039495587,0.0000016585216,0.001166253],"study_design_scores_gemma":[0.000077524506,0.000043676035,0.000029827317,0.00015937856,0.000012363673,0.000008706319,0.0014506852,0.9800886,0.0005925661,0.017411195,0.0000017097054,0.00012376634],"about_ca_topic_score_codex":0.00010967853,"about_ca_topic_score_gemma":0.0000018732243,"teacher_disagreement_score":0.5890448,"about_ca_system_score_codex":0.00012225144,"about_ca_system_score_gemma":0.00023846536,"threshold_uncertainty_score":0.48473266},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03296094597918826,"score_gpt":0.29593997519798987,"score_spread":0.2629790292188016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039001632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052125007,0.00041708464,0.9940237,0.00033013534,0.000100581645,0.00015391059,0.0000029196888,0.00006857064,0.0043818858],"genre_scores_gemma":[0.5337599,0.00006132768,0.46585098,0.00017796287,0.00005006245,0.000025605406,0.000005103941,0.0000037767256,0.00006528986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898326,0.000024542078,0.00029866563,0.0002742181,0.0002649933,0.000154318],"domain_scores_gemma":[0.9991798,0.0001570971,0.00010080994,0.0003020053,0.00019867254,0.00006163179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009372229,0.00009260705,0.000111164496,0.000085752625,0.00008016741,0.000047525686,0.000792607,0.000034886845,0.000043536238],"category_scores_gemma":[0.000013368131,0.000087254375,0.0000542853,0.0006354509,0.000079509366,0.0001556001,0.00013276596,0.00006731372,0.00015579355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015127664,0.00008545087,0.0004660672,0.000006483763,0.000009079708,0.000006645146,0.00018401296,0.21022092,0.00000537586,0.17560825,0.00015277472,0.6132534],"study_design_scores_gemma":[0.000033889908,0.00004675668,0.00408556,0.000006955328,0.0000025714578,0.000055331555,0.000015520816,0.70697075,0.00010954176,0.28095874,0.007599175,0.00011522628],"about_ca_topic_score_codex":0.000019390538,"about_ca_topic_score_gemma":0.0000010484589,"teacher_disagreement_score":0.6131382,"about_ca_system_score_codex":0.000018758174,"about_ca_system_score_gemma":0.000059445974,"threshold_uncertainty_score":0.35581303},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08435124012887192,"score_gpt":0.32937415176507595,"score_spread":0.24502291163620404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039438466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16256815,0.00037855728,0.8354578,0.00044791045,0.0004072043,0.00008517278,0.0000064774104,0.00007286925,0.0005758648],"genre_scores_gemma":[0.61493504,0.0002632471,0.3845371,0.00008798122,0.00011458947,0.0000030897934,0.00004715813,0.000005431333,0.000006339663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851,0.00003915172,0.00028547744,0.0005939905,0.0003471217,0.00022424977],"domain_scores_gemma":[0.99918175,0.00016490485,0.000039785078,0.00046618728,0.00006615902,0.00008122507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017871811,0.00014253531,0.00014046702,0.00005660399,0.00019799959,0.00029323788,0.0008737471,0.00005067512,0.000021668875],"category_scores_gemma":[0.00006573152,0.00012438865,0.000030499936,0.0002546877,0.00011411683,0.0013178308,0.00079191255,0.00011464801,0.00006848783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007837031,0.00012901869,0.00043986124,0.00000899871,0.000025626428,0.000069433845,0.0006185721,0.04170055,0.00011497389,0.49202654,0.0006716788,0.4641164],"study_design_scores_gemma":[0.00010471443,0.00007576966,0.002964173,0.000022200093,0.000005059243,0.00037972743,0.00003470365,0.74889654,0.000118948796,0.2454502,0.00177081,0.0001771791],"about_ca_topic_score_codex":0.00007767181,"about_ca_topic_score_gemma":0.000005826776,"teacher_disagreement_score":0.70719594,"about_ca_system_score_codex":0.000035566776,"about_ca_system_score_gemma":0.000047700898,"threshold_uncertainty_score":0.5072422},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"National Research Council Canada","keywords":"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","score_opus":0.038033010955243855,"score_gpt":0.29819672779789935,"score_spread":0.2601637168426555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040467972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017865965,0.00024091509,0.97896594,0.0006685962,0.0006268375,0.000057741352,5.0786196e-7,0.0001048745,0.0014686317],"genre_scores_gemma":[0.9236347,0.000007643431,0.07535514,0.00030958565,0.00021814022,0.000004821127,0.000013222602,0.0000053700564,0.00045138615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986927,0.00007621993,0.00028381665,0.00021764793,0.000441524,0.00028809853],"domain_scores_gemma":[0.9990757,0.00031190165,0.0001948368,0.00015878573,0.00016385391,0.00009492831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006741221,0.000104557206,0.00011488249,0.00014916676,0.00016283644,0.00018406314,0.00034219923,0.00005183916,0.0001107326],"category_scores_gemma":[0.0001139361,0.00010741417,0.000087842964,0.0005114548,0.000013418841,0.0008773456,0.00011004691,0.00010458622,0.0005280208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004889281,0.00024871557,0.09458412,0.000014310429,0.00012345664,0.0000017587705,0.004508726,0.23866697,0.00021220912,0.48188624,0.0030868775,0.17666173],"study_design_scores_gemma":[0.000071310664,0.000019905548,0.04181354,0.00003078272,0.000013092598,0.000007118207,0.00015620321,0.93103147,0.0021642393,0.02219823,0.0022416294,0.00025247168],"about_ca_topic_score_codex":0.000007491012,"about_ca_topic_score_gemma":6.2883146e-7,"teacher_disagreement_score":0.90576875,"about_ca_system_score_codex":0.00016300201,"about_ca_system_score_gemma":0.00003838384,"threshold_uncertainty_score":0.6786815},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.18695788751994588,"score_gpt":0.38607336659080627,"score_spread":0.19911547907086039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041738807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04547563,0.0003918545,0.9526654,0.00040052322,0.00033771264,0.0004161795,0.000018065299,0.00009268758,0.00020198381],"genre_scores_gemma":[0.8516961,0.00003632649,0.14765899,0.00006361504,0.00011977031,0.0002428725,0.0001046264,0.000006253729,0.00007145341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866855,0.00009162277,0.0003206852,0.0003847778,0.00039135345,0.00014300206],"domain_scores_gemma":[0.9987296,0.00022163149,0.00013436835,0.00022294662,0.00062657386,0.000064919885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011535106,0.00010094026,0.000108997214,0.0000911403,0.00025728534,0.00031045693,0.00028518785,0.00004845317,0.0000050159733],"category_scores_gemma":[0.00015779672,0.0001027539,0.000029620875,0.00028469448,0.000051476225,0.0006829968,0.00006342063,0.0000638106,0.00003420974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011725088,0.000084571766,0.00034867466,0.000025401809,0.000019802585,3.224029e-7,0.00054598297,0.09161925,0.00024763562,0.2237473,0.00047767095,0.68287164],"study_design_scores_gemma":[0.00008432165,0.000043417018,0.006114673,0.000020030147,0.000008652376,0.000025434667,0.00016420826,0.88955903,0.00011930923,0.10192691,0.0018097638,0.00012424504],"about_ca_topic_score_codex":0.000082991864,"about_ca_topic_score_gemma":0.000004716892,"teacher_disagreement_score":0.8062205,"about_ca_system_score_codex":0.0000786726,"about_ca_system_score_gemma":0.000086300766,"threshold_uncertainty_score":0.41901824},"labels":[],"label_agreement":null},{"id":"W2046633649","doi":"10.1111/j.1467-8640.2006.00283.x","title":"VISIO‐SPATIAL CASE‐BASED REASONING: A CASE STUDY IN PREDICTION OF PROTEIN STRUCTURE","year":2006,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Software Engineering Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Carleton University","funders":"","keywords":"Similarity (geometry); Artificial intelligence; Computer science; Metric (unit); Case-based reasoning; Pattern recognition (psychology); Data mining; Image (mathematics)","score_opus":0.025771312733067,"score_gpt":0.3037859787183627,"score_spread":0.27801466598529573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046633649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4780567,0.000020968719,0.5214352,0.000016043903,0.000060731007,0.00033068517,0.0000099430445,0.000063300664,0.0000064611813],"genre_scores_gemma":[0.9362271,6.676491e-8,0.063655995,0.0000056061035,0.00004796139,0.00003574649,0.000008600071,0.00000974229,0.000009171777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835145,0.0001115944,0.00041577226,0.00039563465,0.00051533454,0.00021019723],"domain_scores_gemma":[0.99864846,0.00061982434,0.000090492555,0.00030651508,0.0002818727,0.000052850362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031902804,0.00013798488,0.00015194525,0.0003351375,0.00007224534,0.000071589675,0.00037215627,0.000056494995,0.000016172275],"category_scores_gemma":[0.00028980276,0.00014209421,0.000035162277,0.0008490021,0.000051848197,0.00020397463,0.00012108081,0.00022231869,0.000003975463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009715516,0.00025633335,0.028216409,0.000028788532,0.000007282171,0.008158282,0.0004856067,0.9533471,0.00009560259,0.0016840675,0.00002193712,0.007688893],"study_design_scores_gemma":[0.00019956155,0.00024514843,0.022511145,0.000047731526,0.0000022845006,0.0026600813,0.00011712437,0.96989083,0.0016127824,0.0025935548,0.0000058989453,0.000113833914],"about_ca_topic_score_codex":0.003279526,"about_ca_topic_score_gemma":0.00045497392,"teacher_disagreement_score":0.4581704,"about_ca_system_score_codex":0.000105259256,"about_ca_system_score_gemma":0.00018013595,"threshold_uncertainty_score":0.5794434},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010477644694294994,"score_gpt":0.26256911080717205,"score_spread":0.252091466112877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046812432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004993265,0.00023659322,0.98106325,0.012956,0.000114186565,0.0005258837,0.000009493908,0.000055186447,0.000046165846],"genre_scores_gemma":[0.59921324,0.000018456672,0.40022257,0.00020989784,0.00019380699,0.00011463439,0.000021430305,0.0000040501236,0.0000018994765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986995,0.00004843305,0.00039297526,0.00042329216,0.00027829446,0.00015753564],"domain_scores_gemma":[0.999098,0.000176191,0.00010831183,0.0002639074,0.00028088863,0.000072710594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022663188,0.000119819495,0.0001252856,0.00026669094,0.0001932347,0.000047399917,0.00044964967,0.000041130916,0.0000052780097],"category_scores_gemma":[0.000015170018,0.00010844438,0.000044575252,0.001562586,0.0001472898,0.00028596816,0.00019332804,0.00013866716,0.000037344264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002207233,0.00010689202,0.00013304525,0.0000074816994,0.000005102887,3.4854622e-7,0.0005788521,0.65008587,0.0000064488363,0.3251434,0.00028605125,0.023644317],"study_design_scores_gemma":[0.00010037389,0.00006677843,0.016264625,0.000017020366,0.0000030383558,0.000037778773,0.000070068876,0.48076466,0.00007549555,0.500683,0.0017881567,0.00012903407],"about_ca_topic_score_codex":0.000058727965,"about_ca_topic_score_gemma":0.000016324724,"teacher_disagreement_score":0.59422,"about_ca_system_score_codex":0.0000684815,"about_ca_system_score_gemma":0.00008691921,"threshold_uncertainty_score":0.44222334},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; 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)","score_opus":0.0680886334964266,"score_gpt":0.3066998051356149,"score_spread":0.2386111716391883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050513812","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023683165,0.0006363939,0.99543554,0.0004649406,0.00054558885,0.00042459278,0.000009339625,0.00007198834,0.000043320702],"genre_scores_gemma":[0.33153245,0.000040885407,0.66802204,0.00019242728,0.000049110895,0.00008144462,0.000016735154,0.000008086291,0.00005681785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853975,0.000036214533,0.00037573453,0.00046006223,0.00029982053,0.00028843465],"domain_scores_gemma":[0.9992715,0.00021544134,0.000097642755,0.0002489381,0.00010081684,0.00006564392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023680554,0.00016621829,0.00019895274,0.00013859312,0.00010110782,0.000120768425,0.0007342801,0.00007486913,0.0000026048629],"category_scores_gemma":[0.00005787339,0.00015960966,0.000054811524,0.00036550072,0.00008148072,0.00031534498,0.00016840565,0.00009126817,0.000060241797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007124159,0.00047184774,0.0005980379,0.000045391396,0.000025550546,0.000053734842,0.00057822437,0.71325463,0.000033143988,0.12085289,0.00007021235,0.1640092],"study_design_scores_gemma":[0.00031971245,0.00003837632,0.01509897,0.00005847126,0.000003297123,0.000021768477,0.00006450572,0.94560266,0.0004548877,0.037396822,0.0007453202,0.00019520236],"about_ca_topic_score_codex":0.0001592907,"about_ca_topic_score_gemma":0.000031862888,"teacher_disagreement_score":0.32916415,"about_ca_system_score_codex":0.00016732624,"about_ca_system_score_gemma":0.00011066695,"threshold_uncertainty_score":0.6508693},"labels":[],"label_agreement":null},{"id":"W2051940511","doi":"10.1111/j.1467-8640.2008.00326.x","title":"AN INTERACTIVE SEARCH ASSISTANT ARCHITECTURE BASED ON INTRINSIC QUERY STREAM CHARACTERISTICS","year":2008,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Web search query; Information retrieval; Web query classification; Ranking (information retrieval); Search engine; Sargable; Phrase; Phrase search; Metric (unit); Query expansion; Data stream mining; Data stream; Query language; Data mining; Sequence (biology); Artificial intelligence","score_opus":0.03594127529118811,"score_gpt":0.30793452600318705,"score_spread":0.2719932507119989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051940511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022140542,0.000009250946,0.9763601,0.0005512847,0.00015561812,0.00014445289,0.00008847564,0.00016036726,0.00038990102],"genre_scores_gemma":[0.7572133,0.0000054931284,0.24192137,0.00054525235,0.00008881199,0.000023053537,0.00016277627,0.0000099344525,0.00003003623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998382,0.00009152808,0.00029167795,0.00054445537,0.000451428,0.00023896279],"domain_scores_gemma":[0.9983481,0.00055161386,0.00009830904,0.00056211726,0.00027608985,0.00016373378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016965372,0.00017741673,0.00015877186,0.00015765405,0.0002935485,0.00016113781,0.0009863214,0.00004828482,0.00003494152],"category_scores_gemma":[0.00006108749,0.00016739365,0.000054260145,0.00048261991,0.00014198036,0.00032000782,0.000116171504,0.00032243616,0.00016244216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003193426,0.0006101115,0.00055272557,0.000010201551,0.00001703297,0.00007159942,0.001053451,0.186186,0.000050749022,0.030026745,0.00032949424,0.78106],"study_design_scores_gemma":[0.00006108353,0.00023174872,0.023752159,0.000037272326,0.0000023746234,0.000046362937,0.000035084835,0.97101426,0.0006606682,0.0032998614,0.0006526882,0.00020642526],"about_ca_topic_score_codex":0.000023622404,"about_ca_topic_score_gemma":0.0000021247606,"teacher_disagreement_score":0.78482825,"about_ca_system_score_codex":0.00008376784,"about_ca_system_score_gemma":0.00026680055,"threshold_uncertainty_score":0.6826115},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.19624409045397498,"score_gpt":0.40807032887788414,"score_spread":0.21182623842390916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053123000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046959594,0.0001165041,0.9941665,0.00033081108,0.00006869781,0.00025684983,0.000034181376,0.000077497105,0.00025298874],"genre_scores_gemma":[0.68618315,0.0000087862545,0.31338862,0.00023725106,0.000020114625,0.00000919348,0.000011729616,0.0000050893877,0.00013606784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987095,0.00006304696,0.00032877247,0.00031360667,0.0003725456,0.00021255123],"domain_scores_gemma":[0.9982168,0.0007694339,0.00013121613,0.0003511936,0.00048443896,0.000046891342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030960442,0.00011581289,0.00021775867,0.00024701125,0.00017890208,0.000059725633,0.0009410532,0.000036302026,0.000011733943],"category_scores_gemma":[0.00016850929,0.00009021632,0.00021286625,0.0021210227,0.00016704125,0.00023048236,0.00023294528,0.00011314336,0.000004458985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045667464,0.00010729858,0.005121306,0.000032433512,0.00032344606,0.000007695737,0.0012888105,0.74069107,0.0005313064,0.19059072,0.00020688864,0.061053384],"study_design_scores_gemma":[0.000049476144,0.00006908776,0.018904647,0.000035503544,0.000047176232,0.0000126530485,0.000068279296,0.8860976,0.016146611,0.07783713,0.00059092767,0.00014089094],"about_ca_topic_score_codex":0.000020789688,"about_ca_topic_score_gemma":0.000004262791,"teacher_disagreement_score":0.6814872,"about_ca_system_score_codex":0.000041128846,"about_ca_system_score_gemma":0.000108007494,"threshold_uncertainty_score":0.3678915},"labels":[],"label_agreement":null},{"id":"W2054098217","doi":"10.1111/j.0824-7935.2004.t01-1-00230.x","title":"Reasoning with Sets of Defaults in Default Logic","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Default logic; Default; Default rule; Computer science; Non-monotonic logic; Extension (predicate logic); Set (abstract data type); Artificial intelligence; Theoretical computer science; Autoepistemic logic; Description logic; Programming language; Economics; Multimodal logic; Finance","score_opus":0.02536463840298186,"score_gpt":0.2859904590066911,"score_spread":0.26062582060370926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054098217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062969744,0.00031135092,0.9321759,0.00017338121,0.00010534161,0.00012764262,0.0000014238622,0.00007191627,0.0040632975],"genre_scores_gemma":[0.80648625,0.000009679643,0.19333734,0.0001095829,0.000014401881,0.000008306918,0.000004916059,0.0000059697704,0.000023579667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864715,0.000043642507,0.0003268284,0.0003920914,0.0003290488,0.00026123438],"domain_scores_gemma":[0.99903387,0.00022347049,0.00014690653,0.0002436765,0.00027244785,0.00007962018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024506546,0.00015522906,0.00019828649,0.00016243105,0.00006675858,0.00005212523,0.00070149644,0.000059141745,0.000010714567],"category_scores_gemma":[0.00012703301,0.00012824907,0.000047697715,0.0007682072,0.00012216636,0.0003069715,0.00014150442,0.0001512472,0.00007768399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011458858,0.00010416667,0.0024039156,0.000014404511,0.0000074885593,0.000037883186,0.0012340908,0.52108914,0.000013811275,0.46575156,0.0000104255105,0.009321696],"study_design_scores_gemma":[0.00054101314,0.0004129903,0.046723377,0.00039180135,0.00000660215,0.00020946251,0.0001855418,0.3031855,0.0039854045,0.64380324,0.00009612226,0.00045896744],"about_ca_topic_score_codex":0.00010203144,"about_ca_topic_score_gemma":0.00009929652,"teacher_disagreement_score":0.7435165,"about_ca_system_score_codex":0.00009193399,"about_ca_system_score_gemma":0.00026196428,"threshold_uncertainty_score":0.52298456},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.050186321382605814,"score_gpt":0.33345492317476794,"score_spread":0.2832686017921621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055849934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03545609,0.000013710152,0.96309835,0.0003997252,0.0004058394,0.00024533502,0.0000041240464,0.00034567245,0.000031168005],"genre_scores_gemma":[0.60317343,0.00000134469,0.39667806,0.0000677257,0.000025467916,0.000013896576,0.000010933104,0.000006174734,0.000022927294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873495,0.000014532474,0.00032162675,0.00043239215,0.0002715967,0.00022488748],"domain_scores_gemma":[0.9987645,0.00017175713,0.00015666203,0.00040378392,0.0004336771,0.00006960686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025229008,0.0001358497,0.000108491666,0.00016264952,0.00026974187,0.0002454647,0.0008670637,0.000083169914,0.0000068438344],"category_scores_gemma":[0.000129087,0.0001370383,0.000045975576,0.00037495804,0.00009867283,0.00047323204,0.00010708431,0.00014458733,0.000019416671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012995961,0.000041349085,0.000037702524,0.000005926459,0.0000019832685,2.2647627e-7,0.00024707,0.6120922,0.008512221,0.37227297,0.000009931422,0.00677711],"study_design_scores_gemma":[0.000035865967,0.000023807233,0.00007107913,0.000007054099,0.0000033742836,0.000006775845,0.00009637201,0.8731547,0.021122439,0.105308466,0.000020523126,0.00014951339],"about_ca_topic_score_codex":0.000005966288,"about_ca_topic_score_gemma":0.000013796783,"teacher_disagreement_score":0.5677174,"about_ca_system_score_codex":0.000033095734,"about_ca_system_score_gemma":0.00015877289,"threshold_uncertainty_score":0.5588259},"labels":[],"label_agreement":null},{"id":"W2057505677","doi":"10.1111/j.1467-8640.2007.00293.x","title":"KEYWORD EXTRACTION STRATEGY FOR ITEM BANKS TEXT CATEGORIZATION","year":2007,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Categorization; Computer science; Selection (genetic algorithm); Keyword extraction; Natural language processing; Phrase; Sentence; Artificial intelligence; Text categorization; Feature selection; Information retrieval","score_opus":0.04857456591788745,"score_gpt":0.37604187604377143,"score_spread":0.327467310125884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057505677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082633295,0.00010701224,0.99676096,0.00017207551,0.00020078213,0.00029741708,0.000002284321,0.00038142572,0.001251718],"genre_scores_gemma":[0.65529704,0.000009138666,0.3442036,0.00012633449,0.0000829675,0.000021627302,0.000036149726,0.000010068839,0.00021309136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983733,0.00002657408,0.00048551863,0.00047760282,0.00034127722,0.0002957224],"domain_scores_gemma":[0.99794143,0.0008921009,0.00022389686,0.00028069303,0.0005703491,0.00009151287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005329649,0.0001692565,0.00015398463,0.0002734088,0.00019236907,0.00015108768,0.00060722156,0.00008990734,0.000022320797],"category_scores_gemma":[0.00014634241,0.00017870052,0.00009842662,0.0007608148,0.000056086737,0.00091546064,0.000072726834,0.0001362026,0.000053912387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009914154,0.000052109634,0.000106858424,0.00000863338,0.000012607507,0.0000034213333,0.00010608244,0.16017292,0.0003826218,0.42684302,0.000186924,0.4121149],"study_design_scores_gemma":[0.000047363294,0.00009253085,0.0020149392,0.000011315576,0.000007120181,0.000016390579,0.000035588288,0.63742447,0.018835446,0.33936512,0.0019324603,0.00021724723],"about_ca_topic_score_codex":0.000011786195,"about_ca_topic_score_gemma":0.000017272541,"teacher_disagreement_score":0.6544707,"about_ca_system_score_codex":0.00013515953,"about_ca_system_score_gemma":0.00008251334,"threshold_uncertainty_score":0.7287196},"labels":[],"label_agreement":null},{"id":"W2059263702","doi":"10.1111/1467-8640.t01-1-00208","title":"Architectural Components of Information–Sharing Societies","year":2002,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Component (thermodynamics); Relation (database); Set (abstract data type); Architecture; Anonymity; Interface (matter); Directory; World Wide Web; Distributed computing; Computer security; Database","score_opus":0.0643110623505487,"score_gpt":0.26652713936947153,"score_spread":0.20221607701892283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059263702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030367468,0.00010295797,0.96768844,0.0002860578,0.00027365616,0.000117224205,0.0000046419846,0.000070235394,0.0010893216],"genre_scores_gemma":[0.95505,0.000006639835,0.044619188,0.00016534932,0.000025560908,0.00000599484,0.000017380604,0.0000027125864,0.00010718316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989079,0.000026268284,0.00041280952,0.00014904657,0.0003684145,0.00013554154],"domain_scores_gemma":[0.9992494,0.0001324824,0.00019879825,0.0001861408,0.00018581901,0.00004737413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013892874,0.00009393693,0.00011682748,0.00012332182,0.00009967005,0.00008992376,0.00058065867,0.00003157484,0.0000640708],"category_scores_gemma":[0.00003518541,0.000089727226,0.00006617922,0.00024759705,0.000049398623,0.0007441002,0.00015118584,0.000077007906,0.0002268423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004521759,0.000104907704,0.0024333245,0.00013834641,0.00004607504,0.0000015421913,0.010850426,0.645141,0.00026185124,0.250473,0.0014388168,0.08910621],"study_design_scores_gemma":[0.000060565497,0.000021502936,0.008647734,0.000030384981,0.0000014643019,0.000013301863,0.00004004891,0.97404253,0.00080537144,0.01587997,0.00035645568,0.00010067579],"about_ca_topic_score_codex":0.000022723842,"about_ca_topic_score_gemma":4.5848228e-7,"teacher_disagreement_score":0.9246825,"about_ca_system_score_codex":0.000029482111,"about_ca_system_score_gemma":0.000009220647,"threshold_uncertainty_score":0.36589703},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bigram; Valence (chemistry); Negation; Natural language processing; Computer science; Artificial intelligence; Term (time); Sentiment analysis; Support vector machine; Pattern recognition (psychology); Physics; Trigram","score_opus":0.09465421034018377,"score_gpt":0.3375719904772647,"score_spread":0.24291778013708093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063596712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014890464,0.0010932984,0.9830535,0.00015705377,0.00020277766,0.00014893393,0.0000025663205,0.00003127481,0.00042011318],"genre_scores_gemma":[0.8433369,0.000042099535,0.15632369,0.000099076104,0.000054101925,0.0000061992387,0.000026007292,0.0000049169034,0.000107054955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982965,0.000096718904,0.0006977329,0.0003550827,0.00039150834,0.0001624371],"domain_scores_gemma":[0.998912,0.00016128586,0.00040276936,0.00027264134,0.00020735648,0.000043958033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004280611,0.00013194921,0.0002261127,0.0001614489,0.000094514384,0.00008038547,0.0005265999,0.000033882257,0.00006176437],"category_scores_gemma":[0.000028532882,0.00012685647,0.00013711663,0.0005361907,0.0000862653,0.00033208245,0.00010420131,0.0000651099,0.00007448354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008272749,0.000261599,0.0057872985,0.00005986757,0.00004830297,0.0000040483446,0.0005537206,0.45036015,0.0041179233,0.4721464,0.0017937155,0.064858705],"study_design_scores_gemma":[0.000052910866,0.000021338516,0.0049551753,0.000084079074,0.0000127706935,0.0000044396083,0.000047205587,0.9798491,0.0027986455,0.011005996,0.0010210313,0.0001473137],"about_ca_topic_score_codex":0.000039703067,"about_ca_topic_score_gemma":0.0000021052747,"teacher_disagreement_score":0.8284464,"about_ca_system_score_codex":0.00005283663,"about_ca_system_score_gemma":0.00005549703,"threshold_uncertainty_score":0.5173057},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mechanism (biology); Term (time); Vendor; Computer science; State (computer science); Operations research; Artificial intelligence; Microeconomics; Business; Economics; Marketing; Algorithm; Mathematics","score_opus":0.17632921479751074,"score_gpt":0.42315567870792464,"score_spread":0.2468264639104139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079989187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017434008,0.000037138976,0.98014987,0.00072634185,0.00019098926,0.0002852061,0.00004510799,0.000045451936,0.0010859158],"genre_scores_gemma":[0.9453791,0.0000057650627,0.05308703,0.000945077,0.000069649985,0.00007818451,0.0000122926795,0.0000094967045,0.00041340015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826884,0.00007281367,0.00045492835,0.00046263495,0.0005794736,0.00016131789],"domain_scores_gemma":[0.9947336,0.0043272995,0.00017761353,0.00026651428,0.00040210361,0.00009289639],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007670492,0.00012189879,0.00013648081,0.00020801305,0.0005742591,0.00021723425,0.00031494518,0.00005376026,0.0010240191],"category_scores_gemma":[0.0014387578,0.00010672695,0.00008511475,0.00039884087,0.00010914432,0.00014942813,0.00004623808,0.00009147694,0.00033814443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030786337,0.000083973784,0.00034470792,0.0000030005276,0.0000047122626,0.0000015135533,0.00016070687,0.15642892,0.000006778803,0.6698924,0.0008271913,0.17221537],"study_design_scores_gemma":[0.00006194283,0.000039975796,0.0017328672,0.000038706476,0.0000045356123,0.0000080101445,0.000080290476,0.5299046,0.00013017062,0.46763968,0.00028120776,0.000078016914],"about_ca_topic_score_codex":5.7680666e-7,"about_ca_topic_score_gemma":0.000001851027,"teacher_disagreement_score":0.9279451,"about_ca_system_score_codex":0.00003887065,"about_ca_system_score_gemma":0.000019199397,"threshold_uncertainty_score":0.9998892},"labels":[],"label_agreement":null},{"id":"W2080390169","doi":"10.1111/0824-7935.00125","title":"Realizing Presuppositions in a Montague Grammar‐Like Fragment of English","year":2000,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Presupposition; Linguistics; Sentence; Focus (optics); Projection (relational algebra); Semantics (computer science); Interpretation (philosophy); Computer science; Mathematics; Natural language processing; Artificial intelligence; Philosophy; Algorithm","score_opus":0.015172452451037542,"score_gpt":0.2850867162630434,"score_spread":0.26991426381200584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080390169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005195175,0.0009690763,0.9911519,0.00014375069,0.00010389041,0.00017301146,0.0000062848844,0.00022669056,0.0020301654],"genre_scores_gemma":[0.6075913,0.000020198471,0.39215258,0.0001262294,0.000023477185,0.000017035658,0.000010471821,0.000004248754,0.000054511227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998823,0.000054826898,0.0003587182,0.00029446025,0.00029125452,0.00017773645],"domain_scores_gemma":[0.9991555,0.00018260293,0.000077655655,0.00024035794,0.00029519806,0.000048676822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019091825,0.00010986108,0.00013433427,0.00015990282,0.00005245515,0.00006503289,0.0007207356,0.00005337994,0.00007417666],"category_scores_gemma":[0.00007865022,0.00011157121,0.00004647766,0.00055307505,0.000060984054,0.00042129532,0.0001014894,0.00015872407,0.000013810901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027529913,0.00032422206,0.00048278092,0.000062784435,0.000019238376,0.000055828885,0.0070799747,0.1869579,0.00016896812,0.44365585,0.00088379375,0.3602811],"study_design_scores_gemma":[0.00013379286,0.00013793893,0.0011557988,0.00031129448,0.0000056121335,0.000022456883,0.000091747184,0.43416163,0.014773916,0.5476327,0.001204197,0.0003689144],"about_ca_topic_score_codex":0.00015742857,"about_ca_topic_score_gemma":0.000020109987,"teacher_disagreement_score":0.6023961,"about_ca_system_score_codex":0.00006149551,"about_ca_system_score_gemma":0.00007050614,"threshold_uncertainty_score":0.45497417},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.03434656504020275,"score_gpt":0.2826377729728897,"score_spread":0.24829120793268697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081707439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10627276,0.0003338724,0.8925297,0.00007780952,0.0004418424,0.00017841133,2.3143004e-7,0.00010326437,0.000062083294],"genre_scores_gemma":[0.5629991,0.0000110959845,0.43676186,0.00006547812,0.00015008535,0.000002031201,9.655357e-7,0.0000060657667,0.000003318354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846196,0.000034613462,0.000496088,0.00033898588,0.00036533634,0.00030299876],"domain_scores_gemma":[0.99909556,0.00012371728,0.0002536067,0.00023019279,0.0001844469,0.00011246921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002417284,0.00014643697,0.00017151519,0.00011879222,0.0002497459,0.00010113021,0.00053195143,0.000076284,0.000016481388],"category_scores_gemma":[0.000059843594,0.000145493,0.000086086875,0.0009652889,0.00006259943,0.00043016172,0.00026574882,0.00017825476,0.000019917039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056799618,0.000018537177,0.000054489105,0.000008748154,0.000006382699,0.0000027259325,0.0002955664,0.699855,0.00008675293,0.03469471,0.0000046884766,0.26496673],"study_design_scores_gemma":[0.00009292952,0.00013317955,0.00040324344,0.0001252512,0.0000050214103,0.000076619865,0.000022110878,0.63783234,0.004935753,0.35602328,0.00019483708,0.00015542547],"about_ca_topic_score_codex":0.000107942105,"about_ca_topic_score_gemma":0.000019093877,"teacher_disagreement_score":0.45672634,"about_ca_system_score_codex":0.00009673768,"about_ca_system_score_gemma":0.00021144385,"threshold_uncertainty_score":0.59330326},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015170915684077952,"score_gpt":0.26136747809042954,"score_spread":0.2461965624063516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087393302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062097824,0.00059209875,0.99738556,0.00007010338,0.00019889789,0.00024375072,0.000008286212,0.00023718138,0.0006431633],"genre_scores_gemma":[0.5590617,0.000021037966,0.44058394,0.00008347938,0.00009775974,0.000038996815,0.000034299235,0.000020619542,0.000058141784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991186,0.000026805363,0.00035472587,0.00016422528,0.00017643225,0.00015917973],"domain_scores_gemma":[0.9992562,0.0001884615,0.000047967973,0.00008338904,0.00033019925,0.00009376949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000162923,0.00013427295,0.000162189,0.00017488743,0.000069125395,0.000028939528,0.00015219956,0.000052107524,0.00014965166],"category_scores_gemma":[0.000107581676,0.00014975094,0.000046480647,0.00039566908,0.000025557554,0.00010961704,0.000021096665,0.00014298121,0.00013866939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004970265,0.00002647106,0.000039805487,0.000019632434,0.000018542722,3.6044193e-7,0.00036278417,0.92512447,0.000034278088,0.00034750043,0.000018608967,0.0740026],"study_design_scores_gemma":[0.00012695836,0.000024029498,0.000022996546,0.000041253727,0.000007470315,0.0000038417675,0.000057649133,0.9973548,0.0015855796,0.00007974034,0.0005414417,0.0001542598],"about_ca_topic_score_codex":0.000002766836,"about_ca_topic_score_gemma":0.0000013298843,"teacher_disagreement_score":0.55844074,"about_ca_system_score_codex":0.000058365786,"about_ca_system_score_gemma":0.00002381762,"threshold_uncertainty_score":0.61066663},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Bootstrapping (finance); WordNet; Computer science; Natural language processing; Artificial intelligence; Mathematics","score_opus":0.09356020941455963,"score_gpt":0.3895464476941189,"score_spread":0.2959862382795593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090250652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010387075,0.0005264252,0.9884006,0.00009986977,0.00024447375,0.00010812571,0.000007674509,0.00003844409,0.00018733153],"genre_scores_gemma":[0.56350356,0.000004606939,0.43632504,0.000042823627,0.00007954127,0.0000086189275,0.00001948093,0.0000032461921,0.000013036076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887097,0.000070685564,0.00038455846,0.00023636098,0.00024191651,0.00019549011],"domain_scores_gemma":[0.9976626,0.0016784035,0.00025864536,0.00017133621,0.00015245433,0.00007658133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040420407,0.00010122175,0.00016105702,0.0001334122,0.00013352255,0.00005499315,0.00033299476,0.000038197326,0.000057427642],"category_scores_gemma":[0.00013475148,0.00009728318,0.00012980597,0.00028415959,0.000023371533,0.0005638725,0.000081442915,0.00006121034,0.000012723611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002030513,0.00044746685,0.008042501,0.00004217421,0.00020817427,9.4605383e-7,0.0052719433,0.4121194,0.012453658,0.20385888,0.00060425047,0.35693032],"study_design_scores_gemma":[0.00005960381,0.000019956846,0.0073239612,0.00008637841,0.000016732885,0.0000023345222,0.00042486354,0.9476633,0.024248058,0.019709514,0.0003131865,0.00013212816],"about_ca_topic_score_codex":0.000018271976,"about_ca_topic_score_gemma":3.9411935e-7,"teacher_disagreement_score":0.5531165,"about_ca_system_score_codex":0.000014651209,"about_ca_system_score_gemma":0.000031136795,"threshold_uncertainty_score":0.39670926},"labels":[],"label_agreement":null},{"id":"W2091480242","doi":"10.1111/0824-7935.00122","title":"Introduction To the Special Issue on the 1999 Pacific Association for Computational Linguistics Conference","year":2000,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Library science; Citation; Computational linguistics; Association (psychology); Computer science; Linguistics; Information retrieval; Artificial intelligence; Philosophy; Epistemology","score_opus":0.02423773006766811,"score_gpt":0.30050979031448505,"score_spread":0.27627206024681694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091480242","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007621715,0.000065974695,0.9469904,0.04835611,0.0011744075,0.0005451331,0.00002376985,0.00019039559,0.0025776096],"genre_scores_gemma":[0.39144674,0.00001785657,0.57066697,0.00530428,0.026596397,0.00018977579,0.000110601744,0.000027296604,0.0056400667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982595,0.000109721754,0.0003292191,0.00044363388,0.0006088098,0.00024913618],"domain_scores_gemma":[0.9969807,0.0014913877,0.00015287312,0.00031030367,0.0010079055,0.00005679979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074927084,0.00016822817,0.00012819565,0.000080824575,0.0005110848,0.00046351246,0.001087386,0.000069813614,0.00035380083],"category_scores_gemma":[0.001515443,0.000113755144,0.0000678447,0.0005357338,0.00006122586,0.00011984071,0.00007914732,0.00025748456,0.00060337875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021199128,0.000037464677,0.000006554354,0.0000050545377,0.000012768235,6.902321e-7,0.0006561883,0.206936,0.0000027467627,0.5036068,0.18533748,0.10337704],"study_design_scores_gemma":[0.000031873493,0.00009428712,0.000059741637,0.000019768877,0.0000051361435,0.0000041543512,0.000037930247,0.30283841,0.0005661924,0.35120934,0.3449851,0.00014805606],"about_ca_topic_score_codex":0.000008361039,"about_ca_topic_score_gemma":0.000004774255,"teacher_disagreement_score":0.3913705,"about_ca_system_score_codex":0.0001893173,"about_ca_system_score_gemma":0.00011904861,"threshold_uncertainty_score":0.7755415},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06589625762017931,"score_gpt":0.32361301931853687,"score_spread":0.25771676169835755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096990926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045642913,0.00010320519,0.9918275,0.0020270143,0.00022867374,0.00025223565,0.00005486351,0.0002050558,0.00073718827],"genre_scores_gemma":[0.7586249,0.0000062238323,0.23977517,0.00097049295,0.00019841387,0.000054493397,0.00004451249,0.00001083977,0.00031496762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857056,0.000058680667,0.00033448028,0.00045934165,0.0001983468,0.00037857072],"domain_scores_gemma":[0.9980316,0.0010459867,0.0001356146,0.00028610116,0.00036023106,0.00014044163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003683364,0.00017479212,0.00014386608,0.00020795899,0.0004394858,0.00018093918,0.00040044144,0.00006495992,0.000036820307],"category_scores_gemma":[0.00024931156,0.00017760994,0.00009195513,0.0006272038,0.000067861474,0.00041022134,0.000091521506,0.00013984114,0.0000975496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023961851,0.00007343843,0.000102328544,0.00003743941,0.000023360599,0.01401179,0.0009384563,0.46523222,0.000011644121,0.38027975,0.0066052275,0.13266037],"study_design_scores_gemma":[0.00010371307,0.000102336315,0.00001809166,0.000047916816,0.000004439983,0.061439384,0.00007899623,0.81584656,0.00013842275,0.11809862,0.0039056956,0.00021581756],"about_ca_topic_score_codex":0.00018450285,"about_ca_topic_score_gemma":0.000023917202,"teacher_disagreement_score":0.7540606,"about_ca_system_score_codex":0.00010384243,"about_ca_system_score_gemma":0.00022565243,"threshold_uncertainty_score":0.7242723},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06367058592232826,"score_gpt":0.31116696071433103,"score_spread":0.24749637479200276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100364829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055654785,0.0001966182,0.9891729,0.00057038857,0.00017088474,0.00028550994,0.0000050668964,0.00005351346,0.0039796843],"genre_scores_gemma":[0.651503,0.00004165277,0.3476738,0.0006540047,0.000033028708,0.00002828736,0.000013676487,0.0000051459456,0.000047359346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818456,0.00009959891,0.00040239174,0.00045907553,0.00056673837,0.000287615],"domain_scores_gemma":[0.9980169,0.0012360755,0.00008171668,0.00045222012,0.00016105986,0.000052012972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082143355,0.0001548532,0.00014550747,0.00010876419,0.000176788,0.00028936582,0.0015336554,0.000063381915,0.000033266115],"category_scores_gemma":[0.00024614777,0.00010587581,0.00004504645,0.0010256009,0.000059296315,0.0005138047,0.00023530328,0.0001824801,0.00010461737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008599929,0.0000700125,0.000075444514,0.000003066482,0.0000015201633,0.000010683489,0.0005070381,0.74617726,0.00000101621,0.21412876,0.0006021076,0.03841449],"study_design_scores_gemma":[0.000034747234,0.000027812013,0.00037008233,0.000022059869,0.0000010746786,0.000033604836,0.000019450517,0.53829676,0.0000022297315,0.4604456,0.0006709121,0.00007563561],"about_ca_topic_score_codex":0.00004133396,"about_ca_topic_score_gemma":0.000014216872,"teacher_disagreement_score":0.64593756,"about_ca_system_score_codex":0.00006173625,"about_ca_system_score_gemma":0.00013660119,"threshold_uncertainty_score":0.43174902},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03635067146760383,"score_gpt":0.3192401414954662,"score_spread":0.28288947002786236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106004777","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066687926,0.000018134808,0.9870438,0.0047738478,0.00071511255,0.00017754834,0.0000046574646,0.00012722013,0.00047089646],"genre_scores_gemma":[0.46387458,0.0000026538705,0.53416723,0.0013073488,0.0002113413,0.000017403723,0.0000050352396,0.0000056002027,0.00040880026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987581,0.000015998847,0.00028304622,0.0004244096,0.0003195281,0.00019895048],"domain_scores_gemma":[0.99859375,0.0004691208,0.000063496074,0.00043831277,0.00018476543,0.0002505476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013104269,0.00012466942,0.00010218787,0.000108246386,0.00020518852,0.0003031581,0.0010276174,0.00004958033,0.000136529],"category_scores_gemma":[0.00008059004,0.00011771984,0.00005946578,0.0007204532,0.000027482254,0.0002714101,0.00023405725,0.00017357043,0.00069045194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001906474,0.000023556659,0.000028874127,3.5997246e-7,0.0000027781216,9.667447e-7,0.00010348051,0.24433793,0.000690955,0.5142455,0.0068154843,0.23374823],"study_design_scores_gemma":[0.000049308877,0.00003232862,0.004382227,0.000009313873,0.0000028822872,0.000019210269,0.0000027707958,0.541927,0.0015289851,0.41614288,0.03570059,0.00020249208],"about_ca_topic_score_codex":0.000042855965,"about_ca_topic_score_gemma":0.00006063186,"teacher_disagreement_score":0.4572058,"about_ca_system_score_codex":0.000015957059,"about_ca_system_score_gemma":0.0001148561,"threshold_uncertainty_score":0.8874593},"labels":[],"label_agreement":null},{"id":"W2106854223","doi":"10.1111/j.1467-8640.2012.00436.x","title":"EXPLOITING SYNTACTIC, SEMANTIC, AND LEXICAL REGULARITIES IN LANGUAGE MODELING VIA DIRECTED MARKOV RANDOM FIELDS","year":2012,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Language model; Perplexity; Computer science; Trigram; Probabilistic latent semantic analysis; Artificial intelligence; Natural language processing; Smoothing; Context (archaeology); Algorithm","score_opus":0.02393159905830056,"score_gpt":0.2965222874839078,"score_spread":0.27259068842560724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106854223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03710725,0.0045566387,0.95730823,0.0003292116,0.00011446876,0.00011277864,7.618976e-7,0.00034184297,0.00012879472],"genre_scores_gemma":[0.63056135,0.000015353791,0.3691904,0.00014990578,0.000046854784,0.000010013796,0.0000035220883,0.0000059281256,0.00001667386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881285,0.00009282542,0.0002914668,0.00026446133,0.00024788562,0.0002905284],"domain_scores_gemma":[0.9991032,0.00050115655,0.00006447081,0.00016055447,0.000089754765,0.00008089578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045538752,0.00013919103,0.0001767193,0.0001583472,0.00009665332,0.00013763762,0.0003538554,0.000083839666,0.000011633999],"category_scores_gemma":[0.0002427063,0.00013343313,0.000033381297,0.00027616738,0.000050385166,0.0008467692,0.00023760016,0.0002447695,0.0000057710436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015228947,0.0003905135,0.0046400824,0.00043493812,0.00006721892,0.00017165997,0.03051685,0.0452129,0.0023515732,0.24410303,0.00015420439,0.6718047],"study_design_scores_gemma":[0.00008201195,0.000012167004,0.00012721906,0.00010615373,0.000003197486,0.00007395484,0.00018907055,0.9209285,0.004035176,0.07427141,0.00000281465,0.00016837213],"about_ca_topic_score_codex":0.000115345254,"about_ca_topic_score_gemma":0.00001175313,"teacher_disagreement_score":0.87571555,"about_ca_system_score_codex":0.00004024643,"about_ca_system_score_gemma":0.000027412028,"threshold_uncertainty_score":0.54412454},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.22769789862193068,"score_gpt":0.41370437465979876,"score_spread":0.18600647603786807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111516132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12765706,0.00009948981,0.87146366,0.00021948022,0.00011883665,0.00029064476,0.000003480547,0.000023633718,0.00012374796],"genre_scores_gemma":[0.91270745,0.0000038419994,0.0869935,0.00007513172,0.000051737832,0.00007655202,0.000003417124,0.000006849989,0.00008150671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863964,0.00014611668,0.00045193953,0.00026583477,0.00029857893,0.00019788048],"domain_scores_gemma":[0.9964379,0.0030458085,0.00013103866,0.0001114802,0.00018983122,0.00008393042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003954094,0.00009193172,0.00013418679,0.00015222025,0.00024564564,0.00010007014,0.00022487904,0.000044039494,0.000045623434],"category_scores_gemma":[0.0011619201,0.00008090741,0.0000317607,0.0003639178,0.000058373756,0.00039893348,0.0000593391,0.000084888896,0.000039793642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002805611,0.000056326517,0.00084170053,0.000004554342,0.000003814871,1.4606064e-7,0.00213493,0.59592515,0.00010480792,0.37650594,0.000024728752,0.024369827],"study_design_scores_gemma":[0.00003497588,0.000011311433,0.00012678918,0.0000082125625,0.00000162302,0.0000049935497,0.00074860157,0.5403865,0.00058766064,0.45800224,0.00003300951,0.000054100507],"about_ca_topic_score_codex":0.000003011182,"about_ca_topic_score_gemma":9.741633e-7,"teacher_disagreement_score":0.7850504,"about_ca_system_score_codex":0.000021095246,"about_ca_system_score_gemma":0.000034763834,"threshold_uncertainty_score":0.32993084},"labels":[],"label_agreement":null},{"id":"W2112601612","doi":"10.1111/coin.12034","title":"Automated Testing of Physical Security: Red Teaming Through Machine Learning","year":2014,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Software deployment; Scalability; Machine learning; Artificial intelligence; Process (computing); Focus (optics); Physical security; Computer security; Distributed computing; Software engineering; Operating system","score_opus":0.02705983597648274,"score_gpt":0.3107460439531918,"score_spread":0.283686207976709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112601612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084944265,0.000028864315,0.98823196,0.00007717663,0.00007893028,0.00010245371,0.0000012982274,0.0018386287,0.0011462523],"genre_scores_gemma":[0.6586468,0.0000011196933,0.34123775,0.000051881285,0.000032448872,0.0000069655675,0.0000036673796,0.00000835391,0.000010995593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986857,0.00011363163,0.00032437177,0.00035892535,0.000328712,0.0001886361],"domain_scores_gemma":[0.9980101,0.0011104849,0.00024396558,0.0002246063,0.0003668317,0.00004400417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002449305,0.00014560006,0.00020115949,0.00010227752,0.00014652457,0.00004500468,0.0005300194,0.000041256426,0.000004061841],"category_scores_gemma":[0.0008795343,0.00015036605,0.000057490644,0.00071286265,0.000090220085,0.00046012766,0.00024771044,0.00024074162,0.000017754428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065732697,0.00010917748,0.0005035666,0.000055886303,0.000016678845,0.000004349637,0.0023488363,0.7511585,0.002955962,0.09704573,0.00004525833,0.14574951],"study_design_scores_gemma":[0.000030991334,0.0001511041,0.00015840043,0.000046041034,0.0000020755465,0.000017201593,0.000011935165,0.77819085,0.041730467,0.17919749,0.00034396778,0.00011948202],"about_ca_topic_score_codex":0.000028005132,"about_ca_topic_score_gemma":9.720895e-7,"teacher_disagreement_score":0.6501524,"about_ca_system_score_codex":0.000040293395,"about_ca_system_score_gemma":0.000035818433,"threshold_uncertainty_score":0.613175},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.02096013433539515,"score_gpt":0.2781498017645634,"score_spread":0.2571896674291682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113472489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01814922,0.00014186573,0.9731033,0.006878743,0.00033661665,0.00017717535,0.0000025571644,0.00037722432,0.0008333069],"genre_scores_gemma":[0.9504088,0.000008686627,0.029214066,0.020126304,0.00014233273,0.00000807197,0.00003768356,0.000008841118,0.000045171233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825025,0.000077084274,0.00035281872,0.0005431905,0.00046093177,0.0003157012],"domain_scores_gemma":[0.99867225,0.0001925074,0.00013725922,0.00028163393,0.00058048894,0.00013583609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015934643,0.00022304953,0.00016526064,0.00019734877,0.0002656968,0.00021346251,0.00090562995,0.0000902676,0.00007285131],"category_scores_gemma":[0.0000067282995,0.000218376,0.00007382013,0.0012645082,0.00002325607,0.000664021,0.00010444989,0.00021413415,0.00042491188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021300457,0.00013431392,0.00014298724,0.000018702582,0.00002311761,0.0000044012613,0.001733603,0.4792189,0.0004125501,0.3309485,0.00023285022,0.18710874],"study_design_scores_gemma":[0.00013247775,0.00017720781,0.010346547,0.00005303858,0.000008783075,0.00007810607,0.00030821864,0.7190676,0.0034798004,0.26433828,0.0016684077,0.00034153226],"about_ca_topic_score_codex":0.00010707333,"about_ca_topic_score_gemma":0.00021802845,"teacher_disagreement_score":0.9438892,"about_ca_system_score_codex":0.00007517306,"about_ca_system_score_gemma":0.00011934195,"threshold_uncertainty_score":0.8905115},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01966282983123858,"score_gpt":0.26602065342498804,"score_spread":0.24635782359374947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115867043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003352182,0.0004284129,0.9929476,0.0004186868,0.00009186394,0.000059685273,7.914995e-7,0.00016244446,0.0025383611],"genre_scores_gemma":[0.80992466,0.0000517314,0.18925755,0.00046881635,0.00005171687,0.0000049691166,0.000005133579,0.000005843892,0.0002295705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989091,0.00004832891,0.0002333511,0.0003854468,0.00019502295,0.00022872195],"domain_scores_gemma":[0.9994115,0.00012957359,0.000042861324,0.00020027724,0.00008202002,0.0001337692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001986052,0.00013224891,0.0001173612,0.000052202162,0.00017298463,0.00022626024,0.0004475893,0.000056613062,0.0001255174],"category_scores_gemma":[0.000016523043,0.00013205985,0.000032404536,0.00028301118,0.00008371075,0.00034931808,0.00007737481,0.00016386024,0.00007776059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034679288,0.000015874299,0.00037326053,0.0000027763072,0.000005410711,0.000008357133,0.00017175055,0.46965697,8.3529875e-7,0.14599882,0.00015121073,0.3836113],"study_design_scores_gemma":[0.000029190067,0.000034012723,0.000890539,0.000030768093,0.0000017586067,0.0000534431,0.0000077818495,0.9141094,0.0000184227,0.08431424,0.0003614235,0.0001490106],"about_ca_topic_score_codex":0.00003084822,"about_ca_topic_score_gemma":0.0000026596917,"teacher_disagreement_score":0.8065725,"about_ca_system_score_codex":0.000016678085,"about_ca_system_score_gemma":0.00005226004,"threshold_uncertainty_score":0.53852445},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Context (archaeology); Computer science; Reliability (semiconductor); Internet privacy; Population; Value (mathematics); World Wide Web","score_opus":0.06712032298964195,"score_gpt":0.36486408276193555,"score_spread":0.2977437597722936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118546500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023021163,0.0001835641,0.95589286,0.0002778794,0.00020075339,0.0004475322,0.0000064082683,0.00009127829,0.019878572],"genre_scores_gemma":[0.96261704,0.0000082893075,0.036130294,0.00038060133,0.0003352425,0.000025938183,0.000025861713,0.000010308357,0.0004664102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872535,0.000026532009,0.00028935215,0.0002965553,0.0003274344,0.0003347612],"domain_scores_gemma":[0.99854743,0.0007313805,0.00010938499,0.00008358522,0.00041876853,0.000109467284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005924123,0.00010817223,0.00014923357,0.000089208464,0.0006759562,0.00013152041,0.00036762163,0.0000663379,0.000066025576],"category_scores_gemma":[0.00018994708,0.000109652625,0.00008456521,0.00029550624,0.0002323599,0.00020477799,0.000054030173,0.00010486694,0.000032881217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097198696,0.0001558247,0.007617241,0.00008497869,0.00006380731,0.0000070599676,0.008214604,0.11613835,0.00007413877,0.81474686,0.0004721351,0.052327815],"study_design_scores_gemma":[0.0002931094,0.000053636297,0.004450806,0.00002975659,0.000024702618,0.0000051504567,0.008497168,0.8783713,0.0001488627,0.09415775,0.013607267,0.0003605209],"about_ca_topic_score_codex":0.00018770075,"about_ca_topic_score_gemma":0.000074976975,"teacher_disagreement_score":0.9395959,"about_ca_system_score_codex":0.00006297633,"about_ca_system_score_gemma":0.00011732804,"threshold_uncertainty_score":0.5198977},"labels":[],"label_agreement":null},{"id":"W2123409753","doi":"10.1111/0824-7935.00126","title":"Probability‐Based Chinese Text Processing and Retrieval","year":2000,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; University of Regina","keywords":"Weighting; Computer science; Artificial intelligence; Natural language processing; Probabilistic logic; Word (group theory); Text processing; Term (time); Focus (optics); Relevance (law); Pattern recognition (psychology); Speech recognition; Information retrieval; Mathematics","score_opus":0.027998545217532894,"score_gpt":0.31411299535793963,"score_spread":0.2861144501404067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123409753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03305197,0.00026670043,0.96474373,0.00054769655,0.000018068647,0.00015089397,0.0000011127307,0.00033837484,0.0008814767],"genre_scores_gemma":[0.63018155,0.0000068799313,0.36942968,0.00026180423,0.000018333387,0.000009620883,0.000003517037,0.0000054949364,0.00008312109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998622,0.00004888588,0.00030297795,0.00049819855,0.0003369371,0.00019097768],"domain_scores_gemma":[0.9991316,0.0002165204,0.000077463985,0.00027826708,0.00020796437,0.000088184104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023641122,0.00015998815,0.00016199758,0.00011220679,0.00016517015,0.00017759512,0.0005478349,0.00004681724,0.000119542594],"category_scores_gemma":[0.000092826594,0.00014224075,0.000050224757,0.00086374726,0.00015967932,0.0006164617,0.00008314145,0.00013417866,0.000053994274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021472142,0.00010617657,0.0012377301,0.000034004366,0.0000080176005,0.000008336348,0.00029841054,0.20094147,0.00006454538,0.018480787,0.000039743914,0.7787593],"study_design_scores_gemma":[0.00003313465,0.000035954392,0.002288854,0.000020817346,0.0000024942701,0.000011695916,0.0000022270317,0.7123978,0.00069242466,0.2840789,0.0002965295,0.00013914013],"about_ca_topic_score_codex":0.0000038326025,"about_ca_topic_score_gemma":0.0000017027854,"teacher_disagreement_score":0.7786202,"about_ca_system_score_codex":0.00004695488,"about_ca_system_score_gemma":0.00010133823,"threshold_uncertainty_score":0.58004093},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reputation; Computer science; Sensibility; Multidisciplinary approach; Reputation system; Relation (database); Information sharing; Knowledge management; World Wide Web; Data mining; Sociology; Political science","score_opus":0.06398183211286278,"score_gpt":0.3200983920745432,"score_spread":0.2561165599616804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124137748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011999492,0.000013565968,0.9856959,0.000036787933,0.000260628,0.00033044931,0.00006450368,0.00006451608,0.0015341535],"genre_scores_gemma":[0.9797894,0.0000013035383,0.01936006,0.000076278826,0.00011266076,0.00007735413,0.0004844781,0.000008356175,0.00009010378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999161,0.000014766799,0.0003718344,0.00015371291,0.00015179481,0.00014689744],"domain_scores_gemma":[0.99922216,0.00005660794,0.00017079676,0.000105310384,0.00037881298,0.000066322544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013264078,0.0001010736,0.00009429055,0.000069182475,0.00027461722,0.00016470137,0.0001570484,0.00003086969,0.00007793249],"category_scores_gemma":[0.000012506607,0.000110654684,0.000060298455,0.00014516088,0.000026307966,0.0010057274,0.000026939564,0.00005289564,0.00009752707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028798502,0.000038887116,0.0013326246,0.000025601683,0.000011735542,4.4508997e-8,0.001276098,0.54364353,0.0000018538775,0.43103933,0.00006830153,0.022559078],"study_design_scores_gemma":[0.00010793812,0.000034694174,0.00058930746,0.000024032666,0.0000057712314,6.88901e-7,0.0010259238,0.98483926,0.000049789593,0.012504898,0.0006891528,0.0001285568],"about_ca_topic_score_codex":0.000049618877,"about_ca_topic_score_gemma":0.0000013410246,"teacher_disagreement_score":0.9677899,"about_ca_system_score_codex":0.00005722312,"about_ca_system_score_gemma":0.000016944481,"threshold_uncertainty_score":0.4512367},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04561028564651798,"score_gpt":0.2598856250634991,"score_spread":0.21427533941698113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130202378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055276183,0.000017614604,0.99494225,0.0019050868,0.00014768771,0.00023203144,0.0000047427948,0.00028341537,0.0019144213],"genre_scores_gemma":[0.5305465,0.0000027415415,0.46892235,0.00045679658,0.000010769712,0.000011492088,0.000030212583,0.0000054273755,0.000013766429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986959,0.00003704357,0.00028159874,0.00040108094,0.00038314675,0.00020122102],"domain_scores_gemma":[0.9990003,0.00013380928,0.00013125503,0.00023119646,0.00038839562,0.00011500536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111969464,0.00016883276,0.0001257861,0.0001734627,0.0001698173,0.00019228335,0.0003780184,0.000057275985,0.00016797752],"category_scores_gemma":[0.000043373155,0.00015588319,0.000039745966,0.0006097857,0.00015617046,0.0005185257,0.000042346735,0.00012018201,0.00006745875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008527532,0.000042325017,0.00015894744,0.000004399599,0.000007941056,0.0000059143977,0.000111629175,0.85646284,0.000005874734,0.13037209,0.000011309218,0.01280823],"study_design_scores_gemma":[0.00033253516,0.000118999385,0.00082532095,0.00004797427,0.0000046361083,0.00004567389,0.000026890722,0.98214275,0.00096327945,0.015208712,0.000060874987,0.00022235815],"about_ca_topic_score_codex":0.00001233139,"about_ca_topic_score_gemma":0.00000958282,"teacher_disagreement_score":0.5299937,"about_ca_system_score_codex":0.00009737752,"about_ca_system_score_gemma":0.0005172011,"threshold_uncertainty_score":0.63567317},"labels":[],"label_agreement":null},{"id":"W2132319264","doi":"10.1111/j.1467-8640.2012.00439.x","title":"ROBUSTNESS INSTEAD OF ACCURACY SHOULD BE THE PRIMARY OBJECTIVE FOR SUBJECTIVE PATTERN RECOGNITION RESEARCH: STABILITY ANALYSIS ON MULTICANDIDATE ELECTORAL COLLEGE VERSUS DIRECT POPULAR VOTE","year":2012,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Robustness (evolution); Computer science; Facial recognition system; Artificial intelligence; Pattern recognition (psychology); Machine learning; Stability (learning theory); Metric (unit); Algorithm","score_opus":0.26024305123216745,"score_gpt":0.39922220223903987,"score_spread":0.13897915100687241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132319264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27080053,0.000081174796,0.72698796,0.0004327978,0.0003702321,0.0007711984,0.00029604245,0.00004865174,0.00021140628],"genre_scores_gemma":[0.98785317,0.000011811962,0.011434496,0.00017761011,0.000080693535,0.00018002001,0.00024136793,0.000011658018,0.00000916464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721074,0.0006573034,0.00044795062,0.0005130166,0.0007228189,0.00044816724],"domain_scores_gemma":[0.9924642,0.00548771,0.00023598745,0.0004046014,0.0012888509,0.00011868741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017479111,0.00019709326,0.00031109052,0.00036310375,0.000398014,0.00007665879,0.0006237293,0.00009762425,0.000025405943],"category_scores_gemma":[0.0011160241,0.00015388116,0.0002153318,0.0017128281,0.00021531676,0.0007333115,0.00019484501,0.0003238496,0.00001216709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00464809,0.0036686498,0.017513929,0.0003527252,0.0023144018,0.000008170425,0.012169971,0.49300063,0.0018183623,0.006664956,0.0017492429,0.45609087],"study_design_scores_gemma":[0.0007066907,0.00074117,0.033058926,0.000113332666,0.00019100016,0.0000028724573,0.0010526181,0.9087429,0.04893717,0.0058217263,0.00014308134,0.00048849353],"about_ca_topic_score_codex":0.00020935667,"about_ca_topic_score_gemma":0.00015442402,"teacher_disagreement_score":0.71705264,"about_ca_system_score_codex":0.00024812808,"about_ca_system_score_gemma":0.00016045461,"threshold_uncertainty_score":0.6275092},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08854326872503002,"score_gpt":0.31133538775887465,"score_spread":0.22279211903384463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135390635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021569286,0.0002211101,0.99633664,0.00033781375,0.00024786542,0.00013390103,0.000015326339,0.00012888304,0.0004215571],"genre_scores_gemma":[0.6796272,0.0000026789098,0.31999877,0.00014252268,0.00010075812,0.00002994771,0.000022431612,0.000005930524,0.00006979528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884933,0.00003366722,0.00026913395,0.00029426493,0.00024174007,0.00031183503],"domain_scores_gemma":[0.998701,0.00059479865,0.00008493027,0.00028242386,0.0002140908,0.00012279335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043482395,0.000118807955,0.00013741436,0.0001112186,0.00015914321,0.00013511455,0.0006790468,0.000037136226,0.0000118353655],"category_scores_gemma":[0.00015870127,0.000112779824,0.00009084678,0.00035914927,0.000044499237,0.00084817363,0.00013711704,0.000070911075,0.00008522197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028705547,0.00007387056,0.00008823478,0.00001736029,0.000021510577,4.2389433e-7,0.00045009877,0.57668674,0.000026472268,0.3873499,0.00041876597,0.034863733],"study_design_scores_gemma":[0.000039544266,0.000020177795,0.00004706051,0.000014330252,0.000009103594,0.00000438473,0.000017372005,0.8392422,0.00024131738,0.15962027,0.00061813893,0.00012609817],"about_ca_topic_score_codex":0.0000050843123,"about_ca_topic_score_gemma":0.0000012206017,"teacher_disagreement_score":0.67747027,"about_ca_system_score_codex":0.0000376939,"about_ca_system_score_gemma":0.00009775555,"threshold_uncertainty_score":0.45990276},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.2973553537488464,"score_gpt":0.3833441511490506,"score_spread":0.08598879740020421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140572229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006885539,0.000017733233,0.9871376,0.0039883573,0.00084423384,0.0008244697,0.000020905298,0.0001394324,0.0001417433],"genre_scores_gemma":[0.8393879,0.0000053189196,0.15754811,0.0021157789,0.0001228141,0.0001071331,0.000016096044,0.000011726955,0.0006851257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983765,0.000056911183,0.00045865617,0.0004503914,0.00039910732,0.00025844228],"domain_scores_gemma":[0.9985255,0.00041886434,0.00010076818,0.00032319542,0.0004223676,0.00020929663],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027845975,0.00016440074,0.0001724496,0.00022297382,0.0003271348,0.00019877256,0.00060014933,0.0000556675,0.00011901989],"category_scores_gemma":[0.0001555763,0.00015920562,0.00008125641,0.0004944138,0.000013911574,0.0003883126,0.00013086936,0.00008444457,0.0007860947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002066595,0.00007307177,0.000029814315,0.000021736349,0.000015465868,0.0000012336343,0.0025356542,0.9429847,0.000102428916,0.022826288,0.0046019433,0.026787011],"study_design_scores_gemma":[0.000112989015,0.00012328228,0.00024515833,0.000040476505,0.000005472877,0.000006413093,0.00014155968,0.99225134,0.0008158862,0.0014490455,0.0045991126,0.00020925784],"about_ca_topic_score_codex":0.000062744,"about_ca_topic_score_gemma":0.000054705437,"teacher_disagreement_score":0.83250237,"about_ca_system_score_codex":0.0001631649,"about_ca_system_score_gemma":0.000038394875,"threshold_uncertainty_score":0.9999919},"labels":[],"label_agreement":null},{"id":"W2147795446","doi":"10.1111/0824-7935.00130","title":"Using Images As a Foundation for Natural Language Processing","year":2000,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Premise; Natural (archaeology); Sight; Artificial intelligence; Natural language processing; Natural language; Consistency (knowledge bases); Representation (politics); Question answering; Modality (human–computer interaction); Space (punctuation); Linguistics","score_opus":0.05284459605095852,"score_gpt":0.3684025520063976,"score_spread":0.31555795595543906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147795446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028813997,0.0007856864,0.96883035,0.00035072383,0.00016827283,0.00015041581,9.699801e-7,0.00013783238,0.0007617533],"genre_scores_gemma":[0.69391483,0.0000034253567,0.3054835,0.00026981044,0.00005448903,0.0000073507103,0.000007704508,0.000004090385,0.00025479923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991766,0.000020706953,0.00018159249,0.00026662866,0.00018092903,0.00017351973],"domain_scores_gemma":[0.9994394,0.00020011791,0.000056694415,0.00012247832,0.00015068841,0.000030617797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012500657,0.00009620347,0.000093596864,0.000062475214,0.00018269884,0.00024193127,0.00041074352,0.000027429165,0.00006106845],"category_scores_gemma":[0.00007566787,0.000089330795,0.00004619907,0.00021489862,0.000058538204,0.0005632171,0.00003959656,0.000059314145,0.00009550991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010877103,0.000023155722,0.000034461093,0.000020363557,0.0000061687733,0.0000055384244,0.0009457823,0.06557893,0.00019271522,0.0143453125,0.000056961086,0.91877973],"study_design_scores_gemma":[0.000054813285,0.00002702,0.00043666532,0.000028340339,0.0000037275543,0.00005165773,0.00012215674,0.9513657,0.0023448723,0.045154724,0.00028728115,0.00012300581],"about_ca_topic_score_codex":0.000032532756,"about_ca_topic_score_gemma":0.0000024872206,"teacher_disagreement_score":0.9186567,"about_ca_system_score_codex":0.000035000816,"about_ca_system_score_gemma":0.0001094179,"threshold_uncertainty_score":0.3642804},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Expert system; Viewpoints; Intelligent agent; Variety (cybernetics); Subject-matter expert; Legal expert system; Context (archaeology); Knowledge management; Artificial intelligence; Data science","score_opus":0.046345546567544145,"score_gpt":0.3030290473205264,"score_spread":0.25668350075298224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149177098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059808847,0.00014804293,0.99101704,0.00023121989,0.0004804421,0.0003587202,9.943795e-7,0.0001348312,0.0016478149],"genre_scores_gemma":[0.8518547,0.000005104045,0.14776072,0.00021981382,0.000035369405,0.00005632229,0.0000089648265,0.0000070875103,0.000051929303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841696,0.00004715314,0.0004459649,0.00042188354,0.00042884555,0.00023918922],"domain_scores_gemma":[0.9993755,0.00007604883,0.0001301679,0.00026469052,0.00007914595,0.00007443927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030047135,0.00014636146,0.00014991901,0.00033062088,0.00009847616,0.00012567645,0.0005639976,0.000046858135,0.000014937365],"category_scores_gemma":[0.000010197829,0.00014867526,0.000060480834,0.00059985404,0.000020936759,0.00032816202,0.00010088286,0.0000830626,0.00020852065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037853074,0.00008839231,0.00028362544,0.00005950198,0.000008220102,0.00009550777,0.00048510547,0.6255346,0.000030968375,0.3602916,0.00006381793,0.013054878],"study_design_scores_gemma":[0.00037871941,0.00004447729,0.005501408,0.00047434273,0.0000024808642,0.000032523305,0.00021505514,0.9815711,0.0020966616,0.00877553,0.0006141934,0.00029351687],"about_ca_topic_score_codex":0.00009694907,"about_ca_topic_score_gemma":0.000007656131,"teacher_disagreement_score":0.84587383,"about_ca_system_score_codex":0.0003485145,"about_ca_system_score_gemma":0.00007644267,"threshold_uncertainty_score":0.60628015},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; 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)","score_opus":0.02106858788774564,"score_gpt":0.2715625062281282,"score_spread":0.2504939183403826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151620419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017015945,0.000014732059,0.9795288,0.00023318437,0.00019903114,0.00025835732,2.6028712e-8,0.00015434122,0.0025956016],"genre_scores_gemma":[0.9560931,0.0000041222024,0.043203153,0.0001177766,0.00003062712,0.00003614579,0.000004971205,0.0000072158296,0.000502901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985027,0.00005782307,0.00042412456,0.00030916452,0.0004336165,0.00027260988],"domain_scores_gemma":[0.9992269,0.00022014594,0.00015544891,0.00010966671,0.00022116599,0.00006666577],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026281676,0.00013118706,0.00010518414,0.000248718,0.00013348745,0.00020684632,0.00037780567,0.00005319104,0.0001949292],"category_scores_gemma":[0.00011124552,0.0001389468,0.00003319366,0.00059951254,0.000032741096,0.0003306111,0.000114515584,0.00031459137,0.0011878206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014567343,0.000019250036,0.000683996,0.000006718573,0.000004422254,0.0000012016732,0.00030005278,0.9697675,0.00011724386,0.020181313,0.000049691705,0.008867132],"study_design_scores_gemma":[0.000057477566,0.00008520791,0.013368005,0.000024552535,0.0000010162044,0.000010493158,0.000047573707,0.9829576,0.00035338156,0.0027991335,0.00015075426,0.00014478194],"about_ca_topic_score_codex":0.00010060251,"about_ca_topic_score_gemma":0.0000018792991,"teacher_disagreement_score":0.93907714,"about_ca_system_score_codex":0.00020360241,"about_ca_system_score_gemma":0.00006746529,"threshold_uncertainty_score":0.99958986},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Foundation (evidence); Commodity; Business; Commerce; Computer science; Advertising; Computer security; Finance; Political science; Law","score_opus":0.014240298409182957,"score_gpt":0.28262321180435984,"score_spread":0.2683829133951769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155575510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033316966,0.000058186506,0.961066,0.0035822643,0.00022965147,0.00041290495,0.000005718859,0.0002325729,0.0010957366],"genre_scores_gemma":[0.86088353,0.000011033133,0.13825259,0.00037139188,0.00005147936,0.0001970237,0.000034569024,0.000007796053,0.0001905688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987888,0.000026569396,0.00026475132,0.00041874003,0.00019523516,0.0003059214],"domain_scores_gemma":[0.998661,0.000518861,0.00011306663,0.00040571654,0.00023810207,0.00006327486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005012537,0.00013536782,0.00013436256,0.00012738617,0.00035579587,0.0001364954,0.00100654,0.00012893668,0.00009517791],"category_scores_gemma":[0.00012311806,0.00014049718,0.00006765699,0.0004152429,0.0001473126,0.0002590613,0.00010930764,0.00034440067,0.0001463188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001000615,0.00007894078,0.0000504201,0.0000068971335,0.000011767786,4.0627688e-7,0.000098899945,0.0013454474,0.00011783771,0.90019214,0.00048141298,0.097605824],"study_design_scores_gemma":[0.000059369373,0.0000581095,0.0001539298,0.0000024980434,0.0000030439762,0.000021736505,0.000013893201,0.44612938,0.0015225215,0.52526546,0.02666652,0.0001035428],"about_ca_topic_score_codex":0.00002070016,"about_ca_topic_score_gemma":0.000066946945,"teacher_disagreement_score":0.82756656,"about_ca_system_score_codex":0.00004507193,"about_ca_system_score_gemma":0.00025253856,"threshold_uncertainty_score":0.5729309},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.19677730184830175,"score_gpt":0.30447294138072617,"score_spread":0.10769563953242442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162068502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21502718,0.00048725604,0.7835643,0.000049515238,0.000058633108,0.000119598364,0.0000015928421,0.000029349032,0.0006625714],"genre_scores_gemma":[0.92742306,0.000041978114,0.07247086,0.00001581941,0.000009129388,0.0000134406055,0.000011138764,0.000004551409,0.0000100407215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881595,0.0000921947,0.0003331876,0.0003931553,0.00019153797,0.00017399609],"domain_scores_gemma":[0.9990233,0.00038924653,0.0001506839,0.0001967299,0.00018288368,0.00005715005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066777697,0.000116904535,0.00017059778,0.0001395529,0.00006876713,0.0000738448,0.00044989295,0.000058579913,0.0000022277864],"category_scores_gemma":[0.00031183293,0.00011304528,0.000023805245,0.00055813795,0.00011256697,0.0003071177,0.0001440565,0.00013062349,0.000011710681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001626706,0.00016263798,0.06920705,0.000041038602,0.000011426258,0.0000028145967,0.0035575156,0.22167782,0.000057610985,0.6652869,0.0000023781272,0.03997651],"study_design_scores_gemma":[0.00009534768,0.00004020296,0.44877002,0.00007145036,0.0000013247856,0.000008031058,0.000046611112,0.5060926,0.00053516467,0.04423392,0.0000029649182,0.00010234891],"about_ca_topic_score_codex":0.00024584157,"about_ca_topic_score_gemma":0.00020757825,"teacher_disagreement_score":0.71239585,"about_ca_system_score_codex":0.0000648918,"about_ca_system_score_gemma":0.00022487811,"threshold_uncertainty_score":0.46098527},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06936328498053794,"score_gpt":0.3179263097049285,"score_spread":0.24856302472439057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163462657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015513189,0.00096442096,0.97735554,0.0010124678,0.00019115358,0.000096868935,0.0000019398474,0.00010274574,0.004761692],"genre_scores_gemma":[0.9717442,0.000032492902,0.027228536,0.00020540808,0.000023455854,0.000014273852,0.00001846926,0.0000048592265,0.0007283158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989636,0.000099107994,0.00030513172,0.00023851074,0.0002469359,0.00014674483],"domain_scores_gemma":[0.99931073,0.00014021246,0.00009503134,0.00034630208,0.000059113274,0.000048584243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021209894,0.000092940296,0.000099026445,0.00026896235,0.00007345891,0.00008515406,0.00059707277,0.000038285903,0.0002764428],"category_scores_gemma":[0.000023746823,0.000094329356,0.000044224384,0.00061144086,0.00002499287,0.00035156173,0.0001065291,0.000100537785,0.00039236635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023574876,0.00027103547,0.0018256702,0.000014397847,0.00001226923,0.000019821546,0.011935277,0.21581663,0.00009088276,0.1612592,0.0033426783,0.60540974],"study_design_scores_gemma":[0.000074979995,0.00001624501,0.013594417,0.000026261283,9.00444e-7,0.000009214368,0.0000738206,0.98215955,0.00021440978,0.0029360452,0.00077664666,0.00011750975],"about_ca_topic_score_codex":0.00008394763,"about_ca_topic_score_gemma":0.000038481747,"teacher_disagreement_score":0.956231,"about_ca_system_score_codex":0.00007220068,"about_ca_system_score_gemma":0.0000068327245,"threshold_uncertainty_score":0.5043206},"labels":[],"label_agreement":null},{"id":"W2166769824","doi":"10.1111/0824-7935.00190","title":"Generate and Repair Machine Translation","year":2002,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Synchronous context-free grammar; Rule-based machine translation; Computer science; Machine translation; Example-based machine translation; Transfer-based machine translation; Machine translation software usability; Natural language processing; Phrase; Artificial intelligence; Translation (biology); Evaluation of machine translation; Dynamic and formal equivalence; Computer-assisted translation; Programming language; Syntax","score_opus":0.044620027198693665,"score_gpt":0.28815948407822406,"score_spread":0.24353945687953038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166769824","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040688555,0.014084536,0.9834591,0.00095688936,0.000067131026,0.00007351031,0.0000015996744,0.00058208196,0.00036826648],"genre_scores_gemma":[0.4380917,0.000047192378,0.561475,0.00028081652,0.00001838734,0.0000037388372,0.0000026733908,0.0000034291488,0.000077074226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992301,0.000032357206,0.00017042647,0.00027309748,0.00017979642,0.00011422893],"domain_scores_gemma":[0.9995525,0.00011398844,0.00004782522,0.00014506099,0.00009141408,0.000049246235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012268858,0.000092646726,0.00007569043,0.00008403024,0.00010064018,0.00010219314,0.000287498,0.00003704907,0.000037031274],"category_scores_gemma":[0.00002838848,0.000085773914,0.000030444033,0.00025979526,0.000048144964,0.0003956001,0.00006717835,0.00010196822,0.000032797972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022405766,0.00003835568,0.0001241095,0.000025152834,0.000010334769,0.000019012818,0.0008070161,0.006358634,0.00017583252,0.22793093,0.0006242214,0.7638842],"study_design_scores_gemma":[0.000022128814,0.000024005216,0.00004759055,0.000011171727,0.000001627947,0.000039641272,0.0000019208355,0.8751701,0.0015002663,0.1226012,0.00048196703,0.00009835854],"about_ca_topic_score_codex":0.000008315057,"about_ca_topic_score_gemma":0.000001772727,"teacher_disagreement_score":0.8688115,"about_ca_system_score_codex":0.000015870148,"about_ca_system_score_gemma":0.000008403432,"threshold_uncertainty_score":0.34977585},"labels":[],"label_agreement":null},{"id":"W2167549499","doi":"10.1111/0824-7935.00136","title":"Architectural Methodology Based on Intentional Configuration of Behaviors","year":2001,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Architecture; Mechanism (biology); Artificial intelligence; Control (management); Robot; Object (grammar); Human–computer interaction; Fuzzy logic; Behavioral pattern; Software engineering","score_opus":0.11090979690513524,"score_gpt":0.36240733125684155,"score_spread":0.2514975343517063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167549499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059142653,0.000016933916,0.99210715,0.0007587563,0.00042686556,0.00011700079,0.000004261773,0.00008243561,0.0005723431],"genre_scores_gemma":[0.5477698,4.6913888e-7,0.4519189,0.00021573658,0.00002190299,0.0000073639226,0.000022141805,0.0000036960562,0.00004002704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844074,0.0002127177,0.000388279,0.0003361958,0.0004377701,0.0001843184],"domain_scores_gemma":[0.9981299,0.001079396,0.00017506556,0.00024455108,0.00030275856,0.000068321206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004488844,0.00013251451,0.0001720427,0.00025622032,0.00007287486,0.000034442903,0.0005976817,0.000055204662,0.000052944994],"category_scores_gemma":[0.00025578556,0.00012777657,0.000082893646,0.00041958052,0.00014058994,0.00013190409,0.000056261128,0.00015987604,0.00007069511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001709881,0.00007053088,0.00060136575,0.000004134738,0.0000065185527,0.000015783598,0.00015433229,0.88321435,0.00016834188,0.06418013,0.000035014516,0.05153238],"study_design_scores_gemma":[0.00008605981,0.00019763563,0.013547222,0.00003552371,0.0000043376485,0.000079900194,0.000021018113,0.9520424,0.0029825529,0.030851658,0.00002640155,0.00012531519],"about_ca_topic_score_codex":0.000016217045,"about_ca_topic_score_gemma":5.00902e-7,"teacher_disagreement_score":0.5418555,"about_ca_system_score_codex":0.000041002622,"about_ca_system_score_gemma":0.00011533407,"threshold_uncertainty_score":0.5210577},"labels":[],"label_agreement":null},{"id":"W2168727904","doi":"10.1111/0824-7935.00107","title":"Integrating Web‐Based Documents, Shared Knowledge Bases, and Information Retrieval for User Help","year":2000,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Information retrieval; Paragraph; Terminology; World Wide Web; Sentence; Knowledge base; Search engine; Frame (networking); Artificial intelligence","score_opus":0.018403862805794646,"score_gpt":0.30848898935031954,"score_spread":0.2900851265445249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168727904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013591397,0.00082882115,0.9959858,0.00051985285,0.00009967034,0.0003268197,0.000022482303,0.00036287017,0.0004945555],"genre_scores_gemma":[0.2865161,0.000013707395,0.71236753,0.0007934242,0.000038699003,0.000027273883,0.0000824865,0.00000683653,0.00015394732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988894,0.00004111822,0.00035717114,0.0002756356,0.00023543894,0.00020127739],"domain_scores_gemma":[0.99877906,0.00045431597,0.00010794849,0.00018132586,0.0004006151,0.0000767336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003218729,0.00015890264,0.00013153226,0.00016326224,0.00018959593,0.00046979432,0.0005558286,0.00007093282,0.00008986176],"category_scores_gemma":[0.00022973592,0.00014697015,0.000047037953,0.00044078432,0.000059322945,0.00243089,0.000091063725,0.0001426014,0.000050399867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008387696,0.00006973933,0.00010442546,0.00015066021,0.000015695428,0.0000026058995,0.0009094605,0.00583805,0.00014230631,0.23629004,0.0035147432,0.75287837],"study_design_scores_gemma":[0.00016144231,0.000092552975,0.00006327057,0.0001288001,0.000004588568,0.0000117069985,0.00001866145,0.92042243,0.0049992115,0.057445068,0.016436368,0.00021590081],"about_ca_topic_score_codex":0.0000094936595,"about_ca_topic_score_gemma":0.0000024923247,"teacher_disagreement_score":0.9145844,"about_ca_system_score_codex":0.000072928655,"about_ca_system_score_gemma":0.0001814102,"threshold_uncertainty_score":0.5993269},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029826901023934045,"score_gpt":0.31508870331775013,"score_spread":0.2852618022938161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169503695","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008577114,0.00034505184,0.98857003,0.0008827424,0.0002602914,0.00012239438,0.0000044373587,0.0004729644,0.0007649489],"genre_scores_gemma":[0.45024633,0.0000026447697,0.54882663,0.00068942754,0.00010177814,0.0000067718356,0.000006672626,0.0000060180714,0.00011369281],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985191,0.000037717913,0.00027251744,0.00044844183,0.00047797812,0.00024425104],"domain_scores_gemma":[0.99926627,0.0001401162,0.000049232553,0.00023740731,0.00015892695,0.00014802434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011243772,0.00016309351,0.00013077699,0.00016075818,0.00019180385,0.0002488385,0.0009878624,0.0000676131,0.000301222],"category_scores_gemma":[0.000062943494,0.00015034518,0.000048461334,0.00062463834,0.000054922897,0.00045028984,0.00014041504,0.000211146,0.0002311901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010019321,0.000019111394,0.000047428868,0.0000056274935,0.0000063728244,0.00001154329,0.00026637493,0.042135853,0.00007299216,0.3213057,0.0008270481,0.63529193],"study_design_scores_gemma":[0.00004390733,0.00006548937,0.0013709874,0.000039641433,0.000002277642,0.00021996636,0.0000068220165,0.092350826,0.005677053,0.89517117,0.004737131,0.00031474864],"about_ca_topic_score_codex":0.000016211327,"about_ca_topic_score_gemma":0.0000014644297,"teacher_disagreement_score":0.63497716,"about_ca_system_score_codex":0.00009522922,"about_ca_system_score_gemma":0.000093984265,"threshold_uncertainty_score":0.61308986},"labels":[],"label_agreement":null},{"id":"W2169636436","doi":"10.1111/j.0824-7935.2004.t01-1-00229.x","title":"Iterated Belief Change","year":2004,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Belief revision; Iterated function; Belief structure; State (computer science); Computer science; Set (abstract data type); Artificial intelligence; Cognitive psychology; Epistemology; Cognitive science; Mathematics; Psychology; Algorithm; Philosophy","score_opus":0.0611266769740203,"score_gpt":0.29352131358405786,"score_spread":0.23239463661003756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169636436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032414107,0.0005334933,0.98969257,0.0008793297,0.00053135515,0.00014657428,0.0000021422277,0.00024576308,0.0047273687],"genre_scores_gemma":[0.9325844,0.000020511781,0.065969706,0.0010465223,0.00017120606,0.00002597859,0.000013555044,0.0000074991804,0.0001606079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988326,0.000030660325,0.00022524816,0.00038339465,0.00026857833,0.00025954735],"domain_scores_gemma":[0.9991784,0.0001116262,0.00007317997,0.00024209764,0.00027860896,0.000116105155],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014735259,0.00014742868,0.00012488593,0.00011095545,0.00016201251,0.00017295225,0.00078633206,0.00005497705,0.00004561651],"category_scores_gemma":[0.000057144352,0.00013579676,0.0000627324,0.0005801668,0.00006959896,0.00051640935,0.00019207736,0.00012383233,0.0011329392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002640972,0.000112517155,0.00021041701,0.000008393665,0.000010848118,0.000029694416,0.0023884405,0.03848287,0.000017306498,0.9148795,0.0001632333,0.04369413],"study_design_scores_gemma":[0.0002309483,0.00019797352,0.008044591,0.00007831924,0.000004979,0.00011496325,0.00003870707,0.25538263,0.0022906323,0.728718,0.004431316,0.00046698062],"about_ca_topic_score_codex":0.00003228139,"about_ca_topic_score_gemma":0.000007722942,"teacher_disagreement_score":0.929343,"about_ca_system_score_codex":0.000078795754,"about_ca_system_score_gemma":0.00011826712,"threshold_uncertainty_score":0.9996448},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.046232399762322685,"score_gpt":0.320815491402463,"score_spread":0.27458309164014033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170530489","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032609917,0.000069634836,0.9661078,0.00014377577,0.00016597177,0.00005675784,0.000021833339,0.000116208226,0.0007081419],"genre_scores_gemma":[0.36780018,0.0000029282417,0.63186955,0.00017529172,0.000094505995,0.0000046809528,0.000034178003,0.000005252532,0.000013413472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988011,0.00003743857,0.00028634822,0.00041731566,0.00029484733,0.00016291493],"domain_scores_gemma":[0.9982516,0.0010572255,0.00010525641,0.00036701548,0.00013594069,0.00008294561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020869506,0.00011818325,0.0001228632,0.000077584955,0.00026467376,0.00028442766,0.00085599313,0.000037320737,0.000032668828],"category_scores_gemma":[0.00015589736,0.00011447216,0.00004501264,0.0002690642,0.00005412655,0.00040518265,0.0002553877,0.000086717206,0.0002445998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001243502,0.00003431505,0.00013205614,0.0000013075221,0.0000070290002,9.715851e-7,0.000248527,0.20462686,0.00009477978,0.18235146,0.00014638843,0.61235505],"study_design_scores_gemma":[0.000029531786,0.0000144818405,0.0021124056,0.00003786887,0.000002973199,0.0000049538367,0.000017550969,0.81309795,0.0003789921,0.18287426,0.001315718,0.0001133122],"about_ca_topic_score_codex":0.0001540063,"about_ca_topic_score_gemma":0.0000065822956,"teacher_disagreement_score":0.61224174,"about_ca_system_score_codex":0.000031613698,"about_ca_system_score_gemma":0.000047690144,"threshold_uncertainty_score":0.4668039},"labels":[],"label_agreement":null},{"id":"W2355272074","doi":"10.1111/coin.12092","title":"An Empirical Comparison of Search Approaches for Moving Agents","year":2016,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Range (aeronautics); Computer science; Domain (mathematical analysis); Grid; Path (computing); Search algorithm; Search problem; Hyperparameter optimization; Artificial intelligence; Random search; Algorithm; Mathematical optimization; Data mining; Machine learning; Mathematics","score_opus":0.3099315419918374,"score_gpt":0.4372872349717034,"score_spread":0.127355692979866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2355272074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014173919,0.00004555034,0.9847546,0.00047959996,0.00018117583,0.0001851945,0.000009909454,0.0000781209,0.00009192517],"genre_scores_gemma":[0.55940956,4.979125e-7,0.4404802,0.00003600619,0.000030961557,0.000009749901,0.000005282509,0.0000050288245,0.000022703935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984522,0.000090602785,0.0003844416,0.00040925492,0.00041538657,0.00024810416],"domain_scores_gemma":[0.99822325,0.0009926752,0.00011389526,0.00031593913,0.00023990199,0.00011437099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004345273,0.000117867,0.0001957461,0.00012180116,0.000095943506,0.00005192089,0.0010060901,0.00005430519,0.000008007069],"category_scores_gemma":[0.00012233315,0.00009009726,0.000060991828,0.0002520074,0.00011531963,0.0003492652,0.00012963385,0.00006795181,0.00003227878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009518357,0.00019084425,0.010539575,0.00002074114,0.000016815327,0.0000015830793,0.0015525488,0.7163682,0.00009712695,0.025445491,0.000255393,0.24550219],"study_design_scores_gemma":[0.000080745594,0.0001785668,0.009564729,0.000041251653,0.000002616968,0.000005361269,0.000076070995,0.9688295,0.0035246098,0.01753153,0.000042041083,0.00012293842],"about_ca_topic_score_codex":0.0000041630215,"about_ca_topic_score_gemma":2.5238964e-7,"teacher_disagreement_score":0.54523563,"about_ca_system_score_codex":0.00004713908,"about_ca_system_score_gemma":0.00012189675,"threshold_uncertainty_score":0.36740595},"labels":[],"label_agreement":null},{"id":"W2397197605","doi":"10.1111/coin.12094","title":"Improving Shift‐Reduce Phrase‐Structure Parsing with Constituent Boundary Information","year":2016,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"National Natural Science Foundation of China; Ministry of Education - Singapore","keywords":"Parsing; Computer science; Parser combinator; Artificial intelligence; Classifier (UML); Top-down parsing; Phrase; Bottom-up parsing; Natural language processing; Boundary (topology); LR parser; Mathematics","score_opus":0.011009476967291787,"score_gpt":0.2611931464031279,"score_spread":0.25018366943583614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397197605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052828556,0.00030659337,0.9924263,0.0010931584,0.00019669406,0.0001575079,0.000011752728,0.0004288366,0.00009634339],"genre_scores_gemma":[0.5981736,0.0000019007456,0.4014279,0.000340231,0.000029920679,0.0000052727237,0.000007717507,0.0000040979803,0.000009369849],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873346,0.000032659675,0.00029350692,0.00028594385,0.00041418654,0.00024025983],"domain_scores_gemma":[0.99900055,0.0001656216,0.00020265068,0.00025673356,0.0002895738,0.000084863415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014369324,0.00017107255,0.00012240143,0.00015618747,0.00020790371,0.0003819409,0.00070239516,0.00006287594,0.000025216481],"category_scores_gemma":[0.00009358687,0.00011070145,0.00003057829,0.00035202762,0.00020719129,0.0025637257,0.0001784283,0.0001431627,0.00004344049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019590414,0.000015039173,0.00014587922,0.000034686695,0.000012263942,0.000012603422,0.00060797506,0.0013821393,0.0012897763,0.25919318,0.00013790937,0.73714894],"study_design_scores_gemma":[0.00035383683,0.0002313557,0.00060115574,0.00072430854,0.000016726523,0.00045682685,0.00007378122,0.14618815,0.1451876,0.703708,0.0015041658,0.00095408165],"about_ca_topic_score_codex":0.000018709647,"about_ca_topic_score_gemma":0.0000038271237,"teacher_disagreement_score":0.7361949,"about_ca_system_score_codex":0.00013381486,"about_ca_system_score_gemma":0.00033447993,"threshold_uncertainty_score":0.4514274},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028698933474689207,"score_gpt":0.2844621595874893,"score_spread":0.2557632261128001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496887120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024036262,0.00003458321,0.99450964,0.0019500277,0.00015079054,0.00031019084,0.000007278097,0.00038085764,0.00025299768],"genre_scores_gemma":[0.8484064,0.0000123959535,0.15070102,0.00019134342,0.000059265654,0.00020092976,0.0000020586006,0.000008134035,0.00041846593],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905986,0.000023319419,0.0002279963,0.00035416227,0.00016287605,0.00017178497],"domain_scores_gemma":[0.998949,0.00037251896,0.000082926446,0.00025402507,0.00027263758,0.000068899026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016719545,0.000108109554,0.000092013805,0.00010523512,0.00020667426,0.00007636187,0.00048094543,0.000052461342,0.00003052675],"category_scores_gemma":[0.000057599136,0.000081601116,0.00008209296,0.00030307882,0.00005916602,0.00032950667,0.00006963554,0.00004284291,0.00012315811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011070169,0.0000491736,0.000079737765,0.0000071772047,0.000013284649,4.2387427e-7,0.00010160899,0.001932819,0.004862418,0.30140048,0.00037594774,0.69116586],"study_design_scores_gemma":[0.00018365745,0.0002027942,0.0015819132,0.000029784487,0.0000065283825,0.000019230885,0.000028589897,0.31130704,0.18554594,0.48164532,0.01910807,0.00034112736],"about_ca_topic_score_codex":0.0000053686886,"about_ca_topic_score_gemma":0.0000054306292,"teacher_disagreement_score":0.84600276,"about_ca_system_score_codex":0.00005552285,"about_ca_system_score_gemma":0.00004316976,"threshold_uncertainty_score":0.33275968},"labels":[],"label_agreement":null},{"id":"W2597928294","doi":"10.1111/coin.12101","title":"On Darwinian Networks","year":2017,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inference; Computer science; Simple (philosophy); Bayesian network; Artificial intelligence; Theoretical computer science; Machine learning","score_opus":0.05302418717932137,"score_gpt":0.3238600684726603,"score_spread":0.2708358812933389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597928294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000974193,0.00004061657,0.9869461,0.0012282863,0.000567135,0.000056872614,0.000001170705,0.00011840725,0.010067231],"genre_scores_gemma":[0.94628865,0.000008397373,0.052590974,0.00084259955,0.00008364053,0.000006263942,0.0000028219142,0.0000060929437,0.00017057607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989184,0.000028823786,0.00019268638,0.0003786101,0.00026262048,0.00021883358],"domain_scores_gemma":[0.9986684,0.00020861985,0.00012852502,0.000739604,0.00014515876,0.000109729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020524363,0.0001267567,0.000107739696,0.000052855285,0.0005982781,0.0006488777,0.0018870723,0.00005446904,0.00003262315],"category_scores_gemma":[0.00012859565,0.00012060985,0.000053120388,0.000071380586,0.00011146342,0.00039370763,0.00025212992,0.00018886768,0.00036572016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021544777,0.00001871142,0.00004282186,0.0000010525843,0.0000037240964,0.0000068377526,0.000042753774,0.3749027,8.6493236e-7,0.54387075,0.00034882379,0.0807588],"study_design_scores_gemma":[0.0000242337,0.000042591353,0.0015915645,0.000023518764,8.7219917e-7,0.0000064205406,0.0000018943543,0.6977513,0.00006039467,0.30027246,0.000117807656,0.00010699207],"about_ca_topic_score_codex":0.000013138809,"about_ca_topic_score_gemma":0.000001942086,"teacher_disagreement_score":0.94531447,"about_ca_system_score_codex":0.000022834061,"about_ca_system_score_gemma":0.00006446475,"threshold_uncertainty_score":0.62571424},"labels":[],"label_agreement":null},{"id":"W2608294675","doi":"10.1111/coin.12117","title":"Finding Diachronic Like‐Minded Users","year":2017,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"","keywords":"Latent Dirichlet allocation; Computer science; Timestamp; Friendship; Topic model; Social media; Similarity (geometry); Context (archaeology); Data science; Interpersonal ties; Information retrieval; World Wide Web; Artificial intelligence; Sociology; Geography","score_opus":0.04944606780090331,"score_gpt":0.352443335402613,"score_spread":0.3029972676017097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608294675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059871145,0.000042534335,0.9305501,0.00016410855,0.00016434722,0.00011288609,0.000007848451,0.00006438137,0.00902266],"genre_scores_gemma":[0.98928565,0.0000019293932,0.00995394,0.00003989066,0.00024249344,0.000017171362,0.00004093953,0.000011867486,0.0004061237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991099,0.000022004166,0.00021126594,0.00025134257,0.00018122219,0.00022422119],"domain_scores_gemma":[0.9991186,0.00013526161,0.00019806842,0.00038494094,0.00010124284,0.00006183244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014279572,0.00012577605,0.00014600829,0.00005994941,0.0006053809,0.00023277957,0.0005587177,0.000022054148,0.0008477338],"category_scores_gemma":[0.00001216705,0.00013150666,0.0001221428,0.000070465736,0.00012398486,0.00019882375,0.00020074967,0.00013529419,0.00019401456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001249348,0.00015292091,0.15029304,0.000010003864,0.00023300106,0.0000052914647,0.0003344003,0.13910875,0.00006299034,0.4630362,0.005347978,0.24140291],"study_design_scores_gemma":[0.000111168396,0.000038693455,0.05435147,0.00006910613,0.00004691424,0.0000016469135,0.00010310149,0.45670873,0.0021217254,0.48134205,0.004640779,0.00046461125],"about_ca_topic_score_codex":0.0001212523,"about_ca_topic_score_gemma":0.000007731029,"teacher_disagreement_score":0.9294145,"about_ca_system_score_codex":0.000037439626,"about_ca_system_score_gemma":0.000057896694,"threshold_uncertainty_score":0.92820907},"labels":[],"label_agreement":null},{"id":"W2729052508","doi":"10.1111/coin.12120","title":"From French Wikipedia to Erudit: A test case for cross‐domain open information extraction","year":2017,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Classifier (UML); Pipeline (software); Information extraction; Entity linking; Information retrieval; Open domain; Domain (mathematical analysis); Natural language processing; Task (project management); Artificial intelligence; Named-entity recognition; Precision and recall; Question answering; Knowledge base; Mathematics; Programming language","score_opus":0.07660808466055637,"score_gpt":0.39096216997523464,"score_spread":0.3143540853146783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2729052508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031266246,0.0000120380255,0.9647953,0.0015139361,0.0008932475,0.0005802934,0.00007603879,0.00006390868,0.00079901365],"genre_scores_gemma":[0.5717735,6.8603634e-7,0.4275386,0.00033129854,0.00017853048,0.000074069656,0.000024191717,0.000004083094,0.00007498797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987212,0.000019205638,0.00041869085,0.00037610007,0.0002542895,0.00021053596],"domain_scores_gemma":[0.9977964,0.0006722561,0.00028354404,0.00068234594,0.00043174572,0.00013368596],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00038797694,0.00013714634,0.00013723415,0.00008897043,0.0007581273,0.0025115462,0.001949213,0.00006453392,0.000028850442],"category_scores_gemma":[0.00079162064,0.00014641292,0.000048151323,0.00009221332,0.000047485868,0.0037831168,0.0007076523,0.000105561776,0.00023154407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024508441,0.00011391552,0.0019486409,0.000027808486,0.000026489954,0.000099782,0.0056807143,0.4217655,0.00007009559,0.0785963,0.004057541,0.4875887],"study_design_scores_gemma":[0.00015088898,0.000058220765,0.004907923,0.000028983475,0.000003145538,0.000109892804,0.00006495398,0.7937128,0.00038436012,0.1946621,0.0057174047,0.00019935319],"about_ca_topic_score_codex":0.0011632148,"about_ca_topic_score_gemma":0.00012238901,"teacher_disagreement_score":0.5405073,"about_ca_system_score_codex":0.00009142874,"about_ca_system_score_gemma":0.00014378836,"threshold_uncertainty_score":0.99852395},"labels":[],"label_agreement":null},{"id":"W2738186538","doi":"10.1111/coin.12125","title":"An open source and modular search engine for biomedical literature retrieval","year":2017,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université du Québec à Montréal","funders":"","keywords":"Computer science; Information retrieval; Search engine; Metadata; License; Full text search; World Wide Web; Natural language user interface; Natural language; Table (database); Modular design; Natural language processing; Database; Programming language","score_opus":0.04971705101010006,"score_gpt":0.38567683937158487,"score_spread":0.3359597883614848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738186538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2939016,0.00057440606,0.7044848,0.00065558363,0.00011190655,0.00016045144,0.000054600503,0.000012650853,0.000044023847],"genre_scores_gemma":[0.9528593,0.000039115457,0.045991305,0.00013478393,0.00020242482,0.000006185955,0.00047847742,0.000010226309,0.00027822325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925107,0.000027525279,0.0001226296,0.000320788,0.00012582606,0.00015216791],"domain_scores_gemma":[0.9993619,0.000058467776,0.000045463596,0.00026800684,0.0001411567,0.00012504452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029398673,0.00009391522,0.00010428202,0.000026850294,0.00030771105,0.00027823704,0.00064542575,0.00014682522,0.0000066002535],"category_scores_gemma":[0.00042663058,0.000078527904,0.000025918493,0.00003407412,0.00035851507,0.000009833036,0.00029190828,0.000086096225,0.0000018139375],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014685014,0.00076873065,0.004700365,0.0002711191,0.00030436256,0.00003279439,0.002074388,0.023286758,0.075261965,0.009859015,0.006458961,0.875513],"study_design_scores_gemma":[0.0015257385,0.0053966464,0.031145634,0.0002597152,0.000044937897,0.00014645101,0.00074589986,0.704467,0.08423036,0.035074137,0.13587177,0.0010917269],"about_ca_topic_score_codex":0.000008189428,"about_ca_topic_score_gemma":0.0000013971136,"teacher_disagreement_score":0.8744213,"about_ca_system_score_codex":0.000004717829,"about_ca_system_score_gemma":0.00005877454,"threshold_uncertainty_score":0.3202275},"labels":[],"label_agreement":null},{"id":"W2738230492","doi":"10.1111/coin.12126","title":"NAT model–based compression of Bayesian network CPTs over multivalued variables","year":2017,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Nat; Conditional independence; Computer science; Bayesian network; Inference; Pairwise comparison; Treebank; Artificial intelligence; Theoretical computer science; Algorithm; Parsing","score_opus":0.05524887728047287,"score_gpt":0.33197893633625697,"score_spread":0.2767300590557841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738230492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018258474,0.00010433497,0.9952113,0.0002691982,0.00035871993,0.00013990642,0.000008297642,0.000097967735,0.0019844058],"genre_scores_gemma":[0.6404197,0.0000046947416,0.35927883,0.00018324226,0.00004504882,0.0000068607496,0.000006654209,0.00000816576,0.000046764868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811053,0.00008856896,0.00045963484,0.0005031446,0.00051996246,0.0003181421],"domain_scores_gemma":[0.9978552,0.0003531965,0.00039910717,0.0008657991,0.00038998434,0.00013673688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043848122,0.00021167834,0.00027020276,0.00008072695,0.00053268846,0.0002751513,0.0020000963,0.000106985106,0.000030733878],"category_scores_gemma":[0.00013820251,0.00020054936,0.000101526886,0.00015146387,0.00020419541,0.0005499169,0.00040723314,0.00020219808,0.000019643321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012219438,0.000059567206,0.00036061206,0.000016594766,0.000010360046,0.0000029143396,0.000081645034,0.78483886,0.00010988408,0.20324773,0.00030505352,0.010954593],"study_design_scores_gemma":[0.00010023636,0.000030240462,0.0009638922,0.00015692017,0.0000046046066,0.000001844578,0.0000021754813,0.7182588,0.0011434649,0.27915758,0.000018282912,0.00016193443],"about_ca_topic_score_codex":0.000057212746,"about_ca_topic_score_gemma":0.0000039332763,"teacher_disagreement_score":0.6385939,"about_ca_system_score_codex":0.000034283832,"about_ca_system_score_gemma":0.00024303266,"threshold_uncertainty_score":0.8178165},"labels":[],"label_agreement":null},{"id":"W2738976000","doi":"10.1111/coin.12130","title":"On a simple method for testing independencies in Bayesian networks","year":2017,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Separation (statistics); Undirected graph; Bayesian network; Directed acyclic graph; Simple (philosophy); Computer science; Pruning; Source separation; Bayesian probability; Mathematics; Graph; Artificial intelligence; Algorithm; Theoretical computer science; Machine learning","score_opus":0.10184041488739405,"score_gpt":0.3762096041712589,"score_spread":0.2743691892838649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738976000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064357085,0.000032696404,0.9974202,0.0004637318,0.00021434648,0.00018968403,0.0000030993106,0.00007890588,0.00095378637],"genre_scores_gemma":[0.59159064,0.0000011789962,0.40800768,0.00029894907,0.00004023368,0.000027387154,0.000002792479,0.0000060092107,0.00002512388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857384,0.000057127374,0.00031866966,0.00048932014,0.00024257081,0.00031848744],"domain_scores_gemma":[0.99731,0.0016764058,0.00018654719,0.0004917885,0.00024920687,0.00008607521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007118393,0.00015834912,0.00017664972,0.00011560654,0.00045811367,0.0004933718,0.0014388447,0.00008139391,0.0000058600313],"category_scores_gemma":[0.00093538716,0.00015838566,0.000055160253,0.00017321574,0.000060997078,0.00039385172,0.00022115125,0.00022146554,0.000015408586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054299558,0.000023846816,0.00030068887,0.0000049911823,0.0000031737677,0.000004366276,0.000098924414,0.606392,0.000004723999,0.26215366,0.000063113526,0.13094506],"study_design_scores_gemma":[0.00004972731,0.000060428527,0.0014043369,0.0000371463,0.0000010296268,0.0000055197143,0.0000086445225,0.5903183,0.00008145738,0.40790793,0.000014990472,0.000110433306],"about_ca_topic_score_codex":0.000113721675,"about_ca_topic_score_gemma":0.000041163017,"teacher_disagreement_score":0.5909471,"about_ca_system_score_codex":0.000049782884,"about_ca_system_score_gemma":0.00012986804,"threshold_uncertainty_score":0.645878},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0847742673357272,"score_gpt":0.374068715977271,"score_spread":0.2892944486415438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743178907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012524961,0.00003070449,0.9932513,0.0012947277,0.0002943131,0.0003087161,0.000012872359,0.00038157625,0.0031732984],"genre_scores_gemma":[0.8057242,0.0000150333135,0.1935593,0.00017453617,0.00007663004,0.00011780944,0.000059607304,0.0000111510135,0.00026172926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985125,0.00004880902,0.00034988337,0.0005325604,0.00030829496,0.00024794458],"domain_scores_gemma":[0.9978055,0.00038012463,0.00044392524,0.0008484655,0.00045080238,0.000071203016],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00038032007,0.00016167543,0.00015049381,0.00010202246,0.0008566866,0.0012811534,0.0020666404,0.00008369211,0.000019990704],"category_scores_gemma":[0.00039099867,0.00016926943,0.00007490601,0.00011175054,0.00022779289,0.0021417039,0.00022882198,0.00017421736,0.00007719747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005693292,0.000027194565,0.00047391624,0.000013504038,0.00000886521,8.005321e-7,0.00023999067,0.008761499,0.0004776136,0.9254338,0.0011421252,0.063415006],"study_design_scores_gemma":[0.00007426437,0.00006997061,0.015668146,0.000021742446,0.000002954283,0.0000039227966,0.00014238665,0.6979563,0.0018234783,0.2747761,0.009263449,0.00019725216],"about_ca_topic_score_codex":0.0000138837195,"about_ca_topic_score_gemma":0.000004032617,"teacher_disagreement_score":0.80447173,"about_ca_system_score_codex":0.000084881525,"about_ca_system_score_gemma":0.00021592852,"threshold_uncertainty_score":0.9997556},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09944384755894252,"score_gpt":0.37279909237414394,"score_spread":0.2733552448152014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744423752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040216967,0.00012867908,0.98969895,0.003549385,0.0008058595,0.0013835487,0.000101242644,0.00008885402,0.00022177953],"genre_scores_gemma":[0.92812186,0.000006253874,0.070741124,0.00012068918,0.000082815306,0.00014246599,0.00032386873,0.000014194685,0.0004467292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805266,0.000063315,0.0004821713,0.00054343685,0.0006000116,0.000258431],"domain_scores_gemma":[0.9967828,0.00057016563,0.00048485745,0.00075989205,0.0012971464,0.00010518013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011909248,0.00015093629,0.0001844357,0.00027226532,0.00069393945,0.0007376693,0.0015276468,0.00009222539,0.000009125249],"category_scores_gemma":[0.00096594985,0.00017302044,0.00012580628,0.00027908437,0.000095431096,0.00058465975,0.00012192576,0.000067318586,0.00006552328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002615887,0.00025578047,0.00017565869,0.00014109476,0.00009294728,1.5595008e-7,0.0030457787,0.0022103721,0.00035654532,0.46024853,0.0021794047,0.5312676],"study_design_scores_gemma":[0.00020729272,0.00006702218,0.0010675035,0.000026053402,0.000021927615,0.0000018510159,0.00002556496,0.83398587,0.00071435556,0.16212139,0.0015975636,0.0001636418],"about_ca_topic_score_codex":0.000028116723,"about_ca_topic_score_gemma":0.000015527032,"teacher_disagreement_score":0.92410016,"about_ca_system_score_codex":0.00021667259,"about_ca_system_score_gemma":0.00015738724,"threshold_uncertainty_score":0.7113362},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07278026847176025,"score_gpt":0.3580306338209599,"score_spread":0.2852503653491997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760845379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025595312,0.000037634025,0.9952007,0.0004008511,0.00013882082,0.00016376836,0.000014928885,0.00019028144,0.0012934889],"genre_scores_gemma":[0.54378515,0.0000061460337,0.4560681,0.000024464545,0.000017068109,0.000014968638,0.00001354646,0.0000052333266,0.00006533822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893713,0.000025460786,0.0002750391,0.00032857424,0.00025328615,0.00018053099],"domain_scores_gemma":[0.9982475,0.0005009785,0.00034327366,0.00057872885,0.00027969127,0.000049813745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003119141,0.00011777439,0.0001627213,0.00008967106,0.00033814347,0.00023546383,0.0020587659,0.00004720213,0.0000070013457],"category_scores_gemma":[0.0005452317,0.00011937349,0.00007179653,0.00006858239,0.0001789707,0.000552764,0.0003954016,0.00009248677,0.000011871514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014319897,0.00008170187,0.001730582,0.00004788897,0.00003670027,0.0000041316043,0.000754443,0.091812514,0.00019123095,0.6150451,0.0014984347,0.28878298],"study_design_scores_gemma":[0.00006159287,0.00016064483,0.0020669436,0.00006965447,0.000004904966,0.00000718308,0.00004585377,0.731242,0.01736825,0.24812883,0.00069356785,0.00015058165],"about_ca_topic_score_codex":0.000041937543,"about_ca_topic_score_gemma":0.000004995391,"teacher_disagreement_score":0.63942945,"about_ca_system_score_codex":0.000022657063,"about_ca_system_score_gemma":0.0001019359,"threshold_uncertainty_score":0.48679098},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Reinforcement learning; Fuzzy logic; Trustworthiness; Term (time); Artificial intelligence; Machine learning; Computer security","score_opus":0.09582395210740642,"score_gpt":0.3850028450483746,"score_spread":0.2891788929409682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777581989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07421868,0.00018698406,0.878873,0.00058358884,0.00014068828,0.00014904527,0.0000015138698,0.000045018518,0.045801487],"genre_scores_gemma":[0.9932774,0.00005005105,0.005593942,0.00015929324,0.000105018094,0.0000041668413,0.0000025517447,0.000004859204,0.00080275245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918944,0.000033486587,0.0001530786,0.00017910302,0.00026150257,0.0001833712],"domain_scores_gemma":[0.9994602,0.000089146604,0.00015074527,0.00008237906,0.00014137477,0.00007613296],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00029278416,0.00007776174,0.00009781102,0.000037803788,0.0021048519,0.00034101686,0.00026063877,0.000029854606,0.000051214214],"category_scores_gemma":[0.0002941228,0.0000767196,0.000031327952,0.000027284703,0.00036185377,0.0003663756,0.0001100332,0.00010783071,0.000023004535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007353364,0.000006997991,0.0021284444,0.000003556146,0.000007672282,0.0000039558818,0.00070290506,0.77276653,0.0000051943266,0.20996235,0.000009691461,0.014395355],"study_design_scores_gemma":[0.00004642609,0.000010530069,0.0005215934,0.000012118782,0.0000064420237,0.0000018436089,0.00024762645,0.79470605,0.000013294081,0.20388763,0.00046016971,0.000086291526],"about_ca_topic_score_codex":0.00051594165,"about_ca_topic_score_gemma":0.000021963879,"teacher_disagreement_score":0.9190587,"about_ca_system_score_codex":0.000047048852,"about_ca_system_score_gemma":0.0001239155,"threshold_uncertainty_score":0.99919426},"labels":[],"label_agreement":null},{"id":"W2783530388","doi":"10.1111/coin.12152","title":"Improving text relatedness by incorporating phrase relatedness with word relatedness","year":2018,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"SemEval; Phrase; Computer science; Word (group theory); Natural language processing; Artificial intelligence; n-gram; Mathematics; Task (project management); Language model","score_opus":0.02036011953862601,"score_gpt":0.25799002373788116,"score_spread":0.23762990419925514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783530388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06271214,0.00025362452,0.9339357,0.00050794514,0.0007552212,0.00027353203,0.0000047430963,0.00047789392,0.0010792022],"genre_scores_gemma":[0.83388096,0.0000043249233,0.16513301,0.00034477384,0.00013102518,0.00002306194,0.000024716446,0.000035615085,0.00042251422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677545,0.00013755831,0.0007600052,0.0010823796,0.0007159578,0.0005286691],"domain_scores_gemma":[0.99746794,0.00031910837,0.00046288778,0.0007215788,0.0007941068,0.00023439327],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005871854,0.00037618086,0.00030293156,0.0002163814,0.0005645081,0.00037256946,0.0014322882,0.00020968147,0.000049340026],"category_scores_gemma":[0.0001678638,0.0003463172,0.00006516125,0.0014015072,0.00036752934,0.0012695328,0.0004577073,0.0005780013,0.00036524312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119398144,0.00032355273,0.0019189371,0.000099645884,0.00014515263,0.00019646891,0.006149685,0.4414406,0.0008920923,0.17155182,0.0011966135,0.375966],"study_design_scores_gemma":[0.00021543962,0.00016266352,0.00012469293,0.0001980614,0.000014669482,0.00012401212,0.00018280982,0.9678158,0.0019840943,0.028403101,0.00024950705,0.0005251169],"about_ca_topic_score_codex":0.00015015552,"about_ca_topic_score_gemma":0.000015656076,"teacher_disagreement_score":0.7711688,"about_ca_system_score_codex":0.0001824503,"about_ca_system_score_gemma":0.0003594838,"threshold_uncertainty_score":0.9998989},"labels":[],"label_agreement":null},{"id":"W2790556469","doi":"10.1111/coin.12164","title":"SupAUTH: A new approach to supply chain authentication for the IoT","year":2018,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of New Brunswick","funders":"","keywords":"Computer science; Authentication (law); Computer security; Encryption; Homomorphic encryption; Radio-frequency identification; Cryptography; Authentication protocol; Scalability; Computer network","score_opus":0.06871555083666217,"score_gpt":0.354856359198096,"score_spread":0.28614080836143385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790556469","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008711935,0.00003173435,0.98973614,0.0052996795,0.00029990045,0.004031811,0.000008321954,0.0001406834,0.00036461826],"genre_scores_gemma":[0.44190803,7.7432736e-7,0.5547061,0.0012319632,0.00024971482,0.001272623,0.000011463449,0.0000113616925,0.0006079882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838406,0.000048858325,0.00034490656,0.0005652647,0.00036876806,0.00028816663],"domain_scores_gemma":[0.99785286,0.0007163516,0.00012293778,0.000629322,0.00051828823,0.0001602504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046064207,0.00015462114,0.00011714285,0.00010520481,0.00036933937,0.00020722082,0.0016461387,0.000044471257,0.000045409815],"category_scores_gemma":[0.0003620714,0.00012593725,0.00006986867,0.00069547957,0.00014643301,0.00021764262,0.00025185035,0.000095583935,0.0005854987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001359373,0.00007598472,0.00001359943,0.000008080298,0.0000136361805,8.3857465e-8,0.0035174908,0.026250632,0.000059695434,0.9151987,0.0016849535,0.053163555],"study_design_scores_gemma":[0.00005678293,0.000053102172,0.000536294,0.000009612459,0.0000036177078,0.000005316715,0.000041151954,0.588536,0.0015290453,0.40323466,0.005884444,0.000109943205],"about_ca_topic_score_codex":0.000010238635,"about_ca_topic_score_gemma":0.0000038178105,"teacher_disagreement_score":0.5622854,"about_ca_system_score_codex":0.000066650675,"about_ca_system_score_gemma":0.00020044368,"threshold_uncertainty_score":0.75255966},"labels":[],"label_agreement":null},{"id":"W2801529300","doi":"10.1111/coin.12173","title":"Adaptable image segmentation via simple pixel classification","year":2018,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada); Concordia University","funders":"","keywords":"Computer science; Overfitting; Artificial intelligence; Segmentation; Scale-space segmentation; Image segmentation; Pattern recognition (psychology); Scalability; Pixel; Segmentation-based object categorization; Classifier (UML); Support vector machine; Computer vision; Artificial neural network","score_opus":0.05035750775478622,"score_gpt":0.3522796258483824,"score_spread":0.3019221180935962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801529300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061480654,0.000068045,0.9963837,0.00029883266,0.0001677292,0.00020797894,0.0000033667527,0.00037330226,0.0018821894],"genre_scores_gemma":[0.52793497,0.000014504018,0.471472,0.00034625945,0.000089873996,0.000016667867,0.000020398784,0.000007618139,0.00009768937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860334,0.000051569343,0.00032966567,0.0004337311,0.00034691757,0.00023477312],"domain_scores_gemma":[0.9986315,0.00016620562,0.00015069387,0.00033854292,0.00063076155,0.00008232511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022587043,0.00014537985,0.00011146522,0.00012601347,0.00024387044,0.000176162,0.0006441622,0.000048260463,0.00009045446],"category_scores_gemma":[0.000085269116,0.00014774755,0.000048653543,0.00060577557,0.00017257083,0.0014016517,0.00016005208,0.000106073734,0.0005600609],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020786196,0.00012787101,0.0001719977,0.000016451268,0.000017693817,0.000006513833,0.00054290955,0.0015875922,0.032235198,0.15674931,0.0026646203,0.805859],"study_design_scores_gemma":[0.000046356614,0.00015599132,0.0011778616,0.000010638126,0.0000031073926,0.000022013626,0.00004131629,0.51593333,0.15479705,0.32488754,0.0027332024,0.00019159728],"about_ca_topic_score_codex":0.000012106711,"about_ca_topic_score_gemma":0.0000019353945,"teacher_disagreement_score":0.80566746,"about_ca_system_score_codex":0.00008953309,"about_ca_system_score_gemma":0.000073857365,"threshold_uncertainty_score":0.71986365},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.13752941104644828,"score_gpt":0.31971774538462483,"score_spread":0.18218833433817655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887804579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006930112,0.00016000475,0.9912723,0.00011432215,0.0012335244,0.000121193,7.332178e-7,0.000100927115,0.000066904526],"genre_scores_gemma":[0.84499913,0.000009356896,0.15435903,0.00016908489,0.00039000498,0.0000381183,0.000007743686,0.000006948553,0.000020558617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988737,0.000029657676,0.0002746926,0.00037354953,0.00021334873,0.00023501215],"domain_scores_gemma":[0.9990015,0.0002824778,0.00010489061,0.000184345,0.00036120557,0.00006557117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022020529,0.0001158646,0.00011415002,0.00011268432,0.00028896364,0.00015436117,0.00044321467,0.000026781297,0.000020859416],"category_scores_gemma":[0.00005394635,0.00011767218,0.00008902611,0.00044703405,0.0000590591,0.00070527877,0.00009140946,0.0000707389,0.000038469396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010263029,0.000018344786,0.0001260413,0.000003645855,0.000018628203,6.8263375e-7,0.00035671264,0.7167226,0.000040164443,0.016743524,0.000032948974,0.26592645],"study_design_scores_gemma":[0.000057963833,0.0000907344,0.00074356905,0.000009053033,0.0000042840056,0.0000027305448,0.00005625422,0.9900434,0.002519974,0.0059682433,0.00036503398,0.00013872907],"about_ca_topic_score_codex":0.0000051041447,"about_ca_topic_score_gemma":0.000013059214,"teacher_disagreement_score":0.838069,"about_ca_system_score_codex":0.00003734505,"about_ca_system_score_gemma":0.000011773425,"threshold_uncertainty_score":0.4798532},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.0945598607666244,"score_gpt":0.3378425082975396,"score_spread":0.2432826475309152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951586423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005230157,0.00011800243,0.99197084,0.00096897903,0.0009274548,0.00046066678,0.000007787346,0.00011968796,0.00019644079],"genre_scores_gemma":[0.69512975,0.0000018140385,0.3039733,0.0003945711,0.00011074743,0.000049877475,0.00006851488,0.00000739437,0.00026403053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984044,0.000047206282,0.0003847682,0.0005570806,0.0003552179,0.00025134798],"domain_scores_gemma":[0.99831706,0.00071284926,0.00014097149,0.00030760176,0.00044033973,0.000081203725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024336597,0.00014040175,0.00013094535,0.00010188357,0.00013729332,0.00013495442,0.0007093078,0.000068231224,0.00007081683],"category_scores_gemma":[0.00007350522,0.00014921802,0.00009641964,0.00024621148,0.000054935274,0.0005029435,0.0001279331,0.00013046157,0.00016411408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006405781,0.00003170178,0.0017500202,0.0000062971535,0.000008681892,3.3343522e-7,0.00006584331,0.7127671,0.00004731528,0.273244,0.00014146412,0.011930813],"study_design_scores_gemma":[0.0001712396,0.000029297204,0.015492005,0.000008581899,0.0000025650888,0.000012215616,0.00003120987,0.9582679,0.00003925576,0.025524994,0.00025861472,0.00016211295],"about_ca_topic_score_codex":0.0000077812,"about_ca_topic_score_gemma":0.000001629322,"teacher_disagreement_score":0.68989956,"about_ca_system_score_codex":0.00007703783,"about_ca_system_score_gemma":0.00010781956,"threshold_uncertainty_score":0.60849345},"labels":[],"label_agreement":null},{"id":"W2990321249","doi":"10.1111/coin.12248","title":"A topic‐based term frequency normalization framework to enhance probabilistic information retrieval","year":2019,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; York University","funders":"Natural Sciences and Engineering Research Council of Canada; Yenepoya Research Centre","keywords":"Computer science; Divergence-from-randomness model; Normalization (sociology); Term Discrimination; Probabilistic logic; Artificial intelligence; Term (time); Language model; Natural language processing; Embedding; Sentence; Vector space model; Information retrieval; Visual Word","score_opus":0.017773968724452867,"score_gpt":0.2958569037642808,"score_spread":0.27808293503982795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990321249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02911799,0.00001815246,0.9679973,0.0007987516,0.00065854704,0.00047794342,0.0000031102916,0.00015549094,0.0007727025],"genre_scores_gemma":[0.64195746,7.645368e-7,0.35670823,0.0012235189,0.000041209194,0.000011915942,0.000015933068,0.00000396909,0.000036955284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984164,0.00004579233,0.0004563119,0.00034734196,0.0005016762,0.00023247092],"domain_scores_gemma":[0.99858344,0.0002909573,0.0001348673,0.00045946156,0.00042854674,0.000102705526],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024666887,0.0001445663,0.0001340823,0.00017152121,0.000084706415,0.00022640635,0.0007734105,0.00008192835,0.00009630279],"category_scores_gemma":[0.0003749074,0.00015138571,0.000047220634,0.00067258644,0.000021941863,0.001062346,0.00013756323,0.00015218253,0.00096973026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071184804,0.00002034035,0.0009896202,0.00004448757,0.0000034612412,8.8589724e-7,0.0007602185,0.6919637,0.000054583765,0.28310597,0.000019259187,0.023030356],"study_design_scores_gemma":[0.000033195647,0.00008226902,0.0020570958,0.00010393041,0.0000019937243,0.0000044859275,0.000012882764,0.86691225,0.0015146014,0.12887025,0.00020501626,0.00020203271],"about_ca_topic_score_codex":0.000011287268,"about_ca_topic_score_gemma":0.0000013011302,"teacher_disagreement_score":0.6128395,"about_ca_system_score_codex":0.0001297843,"about_ca_system_score_gemma":0.00020058194,"threshold_uncertainty_score":0.99980813},"labels":[],"label_agreement":null},{"id":"W2990773367","doi":"10.1111/coin.12246","title":"Proportional data modeling via selection and estimation of a finite mixture of scaled Dirichlet distributions","year":2019,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Dirichlet distribution; Generalized Dirichlet distribution; Computer science; Mathematics; Latent Dirichlet allocation; Flexibility (engineering); Model selection; Selection (genetic algorithm); Minimum description length; Algorithm; Artificial intelligence; Applied mathematics; Statistics; Topic model; Dirichlet's principle","score_opus":0.03672841445888648,"score_gpt":0.3151502190633023,"score_spread":0.27842180460441585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990773367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0098487595,0.00018375754,0.9893324,0.00021922533,0.0000890159,0.00019155552,0.000049835897,0.000027320135,0.000058179525],"genre_scores_gemma":[0.5471075,0.000009029537,0.4527507,0.00001650058,0.000008963302,0.0000024595374,0.00009365296,0.000002534116,0.000008627179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987808,0.00006872344,0.00040247184,0.00034994236,0.00028854172,0.00010950994],"domain_scores_gemma":[0.9988534,0.00025800042,0.00019458191,0.00030008802,0.0003479845,0.000045960423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042097727,0.00010074522,0.00017255121,0.000099316625,0.000055906265,0.000028024157,0.00042799252,0.000057620357,0.000014861369],"category_scores_gemma":[0.00008409637,0.0000950988,0.000032434415,0.0003621311,0.00004988713,0.00048650653,0.00022647007,0.00010558364,0.0000049571304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008524539,0.00005733181,0.00017092454,0.00005480109,0.000015863208,2.6553533e-7,0.00010651822,0.76162684,0.0002960717,0.1753927,0.000020547957,0.062249627],"study_design_scores_gemma":[0.000047258305,0.000038361246,0.00029655456,0.00004034278,0.0000073938304,0.00001331673,0.000002009196,0.7955412,0.0008574105,0.20307416,0.000008038979,0.0000739268],"about_ca_topic_score_codex":0.0000145023905,"about_ca_topic_score_gemma":0.0000012820212,"teacher_disagreement_score":0.53725874,"about_ca_system_score_codex":0.000017375865,"about_ca_system_score_gemma":0.00011508934,"threshold_uncertainty_score":0.38780168},"labels":[],"label_agreement":null},{"id":"W2991027952","doi":"10.1111/coin.12249","title":"CSBF: A static ensemble fusion method based on the centrality score of complex networks","year":2019,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Centrality; Pairwise comparison; Artificial intelligence; Ensemble learning; Computer science; Classifier (UML); Weighting; Fusion; Machine learning; Pattern recognition (psychology); Data mining; Mathematics; Statistics","score_opus":0.04642834771364663,"score_gpt":0.3273409589880015,"score_spread":0.28091261127435485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991027952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03488469,0.000011813836,0.96154505,0.00028152112,0.000050136816,0.00033638853,0.000015195932,0.000030719857,0.002844497],"genre_scores_gemma":[0.96120757,8.028959e-7,0.038212445,0.0003182747,0.00005742977,0.000014938678,0.00011979991,0.0000114549375,0.000057262037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985946,0.00022382798,0.00037935743,0.00026425527,0.00031663408,0.00022135276],"domain_scores_gemma":[0.99768305,0.0015093455,0.00022481971,0.00033165718,0.00020458728,0.000046523153],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004886078,0.00015309655,0.00024154474,0.00006214656,0.0001009542,0.00003448654,0.0003306794,0.000023934514,0.002192328],"category_scores_gemma":[0.000010890601,0.000116296294,0.0001624435,0.00038276988,0.000068378824,0.000041518066,0.000081879654,0.0001727213,0.00004567253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020359847,0.000093476265,0.00888647,0.000008104262,0.000030275995,1.8307252e-7,0.000047289144,0.84246397,0.000055985754,0.12958223,0.00077479106,0.018036854],"study_design_scores_gemma":[0.000048814505,0.000051632473,0.0055716196,0.00005705246,0.000016699085,1.766685e-7,0.00006138819,0.9111429,0.0008420272,0.08186642,0.00023235645,0.00010891892],"about_ca_topic_score_codex":0.0001104081,"about_ca_topic_score_gemma":0.000002795951,"teacher_disagreement_score":0.9263229,"about_ca_system_score_codex":0.00002806397,"about_ca_system_score_gemma":0.00005616715,"threshold_uncertainty_score":0.9987198},"labels":[],"label_agreement":null},{"id":"W3045507721","doi":"10.1111/coin.12386","title":"Conditional Preference Networks with User's Genuine Decisions","year":2020,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Preference; Ceteris paribus; Pareto principle; Net (polyhedron); Outcome (game theory); Preference relation; Relation (database); Computer science; Mathematics; Mathematical optimization; Mathematical economics; Economics; Statistics; Microeconomics; Data mining","score_opus":0.4358606671887069,"score_gpt":0.4281798976902216,"score_spread":0.00768076949848534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045507721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021967817,0.00014601587,0.97450566,0.0019885295,0.00024267781,0.0002723868,0.00007296186,0.0001021043,0.00070184196],"genre_scores_gemma":[0.8882164,0.000007954773,0.108429715,0.002821607,0.0002354601,0.00002056098,0.00007170866,0.00002169437,0.000174907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99468637,0.00022012893,0.0010845348,0.001005013,0.0026473105,0.00035665632],"domain_scores_gemma":[0.9897377,0.0074433396,0.00037024243,0.00046692556,0.0015371483,0.00044465554],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00088379247,0.00028120284,0.00038385805,0.00022713335,0.00031221512,0.00070791284,0.0015701287,0.00009603611,0.0033745128],"category_scores_gemma":[0.0048484355,0.00020894734,0.00012315533,0.0013048974,0.0002817731,0.0005536628,0.00037067087,0.00033811794,0.0019990858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012751036,0.000043850796,0.0019373706,0.0000011739505,0.000018076065,0.000035637826,0.00027450625,0.930914,0.00001878803,0.025556391,0.007272258,0.03380045],"study_design_scores_gemma":[0.00019702343,0.00015334139,0.013874964,0.000041082454,0.000009167328,0.000050832936,0.00019705197,0.8833838,0.0000717948,0.08653437,0.01519378,0.00029276684],"about_ca_topic_score_codex":0.000004126785,"about_ca_topic_score_gemma":0.000008360164,"teacher_disagreement_score":0.86624855,"about_ca_system_score_codex":0.00004329547,"about_ca_system_score_gemma":0.00020688798,"threshold_uncertainty_score":0.998778},"labels":[],"label_agreement":null},{"id":"W3083277177","doi":"10.1111/coin.12398","title":"Group recommendation with noisy subjective preferences","year":2020,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voting; Preference; Majority rule; Computer science; Noise (video); Probabilistic logic; Reliability (semiconductor); Context (archaeology); Artificial intelligence; Machine learning; Cognitive psychology; Psychology; Social psychology; Econometrics; Mathematics; Statistics","score_opus":0.09311460311899544,"score_gpt":0.2496705710176706,"score_spread":0.15655596789867515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083277177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08999835,0.000111160036,0.89566183,0.0011374047,0.00016036941,0.00016957117,0.000046902,0.00006984499,0.012644566],"genre_scores_gemma":[0.9953948,0.0000057522357,0.003877999,0.00048055343,0.00009959369,0.000014258488,0.000054833425,0.000009852634,0.00006231777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919236,0.000027319182,0.0003257216,0.00030300472,0.000033150616,0.00011842856],"domain_scores_gemma":[0.9994492,0.00016169462,0.00020953211,0.00006131767,0.000052776388,0.00006545749],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023953579,0.00009691943,0.00016753394,0.000053477408,0.000080059806,0.000057162848,0.00015347032,0.000033580007,0.00047519125],"category_scores_gemma":[0.00008456733,0.00009757602,0.000032599688,0.0002377162,0.00005203506,0.00018757132,0.000024710836,0.000102882266,0.00093540514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007071107,0.000047760863,0.021093631,0.00003236616,0.00004534546,0.0000013918445,0.002171613,0.026191782,0.0000046976043,0.9450689,0.00015181192,0.0051199696],"study_design_scores_gemma":[0.00027658537,0.0007272011,0.023738116,0.000058262438,0.000007217278,0.000013821156,0.0009797813,0.17633778,0.0003367903,0.7891304,0.007848577,0.00054548477],"about_ca_topic_score_codex":0.000032791224,"about_ca_topic_score_gemma":0.000005494274,"teacher_disagreement_score":0.90539646,"about_ca_system_score_codex":0.000028753986,"about_ca_system_score_gemma":0.000012377473,"threshold_uncertainty_score":0.99984246},"labels":[],"label_agreement":null},{"id":"W3092146487","doi":"10.1111/coin.12404","title":"A machine learning approach for optimizing heuristic decision‐making in Web Ontology Language reasoners","year":2020,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nuance Communications (Canada); Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semantic reasoner; Computer science; Heuristics; Web Ontology Language; Description logic; Heuristic; Rotation formalisms in three dimensions; Ontology; Artificial intelligence; Nondeterministic algorithm; Ontology language; Theoretical computer science; Natural language processing; Programming language; Machine learning; Semantic Web; Mathematics","score_opus":0.048817305393317516,"score_gpt":0.320169333672621,"score_spread":0.2713520282793035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092146487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036138848,0.0010588879,0.9935766,0.0006221562,0.00010647518,0.00020122659,0.0000026847888,0.00016159465,0.0006565246],"genre_scores_gemma":[0.5404499,0.0000076462375,0.4590787,0.00040510384,0.000025140904,0.000014669395,0.000007966988,0.0000054442,0.0000054004418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861413,0.00007718988,0.00034023938,0.0004937122,0.00021186535,0.00026285992],"domain_scores_gemma":[0.9982134,0.0013812473,0.00010789009,0.00014064334,0.00008736319,0.00006942951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028488165,0.00014708859,0.00023714305,0.00012521104,0.000106943204,0.00010269302,0.00074845244,0.00006074094,0.00000858331],"category_scores_gemma":[0.0010881297,0.00014231414,0.000068929694,0.00043614695,0.000057540758,0.00018688482,0.0002179297,0.00021669462,0.000016971617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000383443,0.00003110524,0.0009322784,0.000027660672,0.000009376571,0.000029475073,0.0027798042,0.89443046,0.000020692398,0.043168258,0.000054660857,0.058477897],"study_design_scores_gemma":[0.00014666701,0.0000795678,0.00037609134,0.000037769732,0.0000034513284,0.000029214587,0.00044957522,0.9890881,0.00004017116,0.00948758,0.00010338226,0.0001583823],"about_ca_topic_score_codex":0.000017003516,"about_ca_topic_score_gemma":0.000014978947,"teacher_disagreement_score":0.536836,"about_ca_system_score_codex":0.000042175823,"about_ca_system_score_gemma":0.000093209455,"threshold_uncertainty_score":0.5803402},"labels":[],"label_agreement":null},{"id":"W3106657271","doi":"10.1111/coin.12422","title":"Classifying and clustering malicious advertisement uniform resource locators using deep learning","year":2020,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Atlantic Canada Opportunities Agency; Allianz Industrie Forschung","keywords":"Computer science; Cluster analysis; Latency (audio); Autoencoder; Deep learning; Artificial intelligence; Preprocessor; Artificial neural network; Data mining; Dimensionality reduction; Machine learning","score_opus":0.05010105212257533,"score_gpt":0.27155726744565223,"score_spread":0.2214562153230769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106657271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026924545,0.00025509653,0.97157055,0.00061205286,0.00013185294,0.00008696505,2.9074394e-7,0.00017365628,0.0002449669],"genre_scores_gemma":[0.92800605,0.0000119180595,0.07113996,0.0007303978,0.00008704341,0.000002541444,0.000002605508,0.000010159147,0.000009324982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885684,0.000058661604,0.00024984722,0.00036948567,0.00027024074,0.0001949466],"domain_scores_gemma":[0.99944186,0.00014339772,0.00010059788,0.00010050384,0.00007194139,0.0001416991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016890382,0.00012929986,0.000114515904,0.000079166,0.00029528904,0.00020913697,0.0003256039,0.000045970384,0.000009103214],"category_scores_gemma":[0.00007320571,0.0001407033,0.000033870423,0.00039132562,0.000047415,0.0003515729,0.00030361066,0.00021450756,0.000021146016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069015487,0.000006003662,0.0006503213,0.000024900719,0.000009422914,0.000008035612,0.0021377308,0.9069297,0.00014769721,0.0033497622,0.000009407774,0.08672015],"study_design_scores_gemma":[0.000055115117,0.000080711616,0.0006266635,0.00003641501,0.0000048335028,0.00003841591,0.00024129194,0.9950698,0.00063228345,0.0019478637,0.001106408,0.0001602088],"about_ca_topic_score_codex":0.000025257552,"about_ca_topic_score_gemma":0.000004442885,"teacher_disagreement_score":0.9010815,"about_ca_system_score_codex":0.000071753224,"about_ca_system_score_gemma":0.00003379222,"threshold_uncertainty_score":0.57377136},"labels":[],"label_agreement":null},{"id":"W3116578073","doi":"10.1111/coin.12429","title":"Mixture‐based clustering for count data using approximated Fisher Scoring and Minorization–Maximization approaches","year":2020,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cluster analysis; Mixture model; Count data; Dirichlet distribution; Multinomial distribution; Computer science; Hyperparameter; Burstiness; Overdispersion; Mathematics; Algorithm; Artificial intelligence; Statistics; Poisson distribution","score_opus":0.34864057237599905,"score_gpt":0.34046367904344504,"score_spread":0.008176893332554003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116578073","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029691655,0.00018953296,0.9978302,0.0009429141,0.00015428639,0.00038620803,0.000026302167,0.000111038185,0.000062587744],"genre_scores_gemma":[0.17547898,0.0000035867756,0.8235506,0.00070939155,0.000098501674,0.0000117576365,0.0001281959,0.000014220389,0.000004818562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985443,0.000066881265,0.00030898434,0.00066513923,0.0002217641,0.00019293306],"domain_scores_gemma":[0.9990053,0.00025945462,0.00013304992,0.00031771962,0.00016831202,0.0001161203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032462552,0.0001670044,0.00017439394,0.00006741295,0.000185663,0.000285861,0.00073433085,0.00006544715,0.000003883537],"category_scores_gemma":[0.00015918833,0.00017021762,0.000028776414,0.0003813434,0.000051938387,0.00066114025,0.0003493717,0.0000901656,0.000001507452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001961369,0.000030270696,0.00013269224,0.00017051569,0.00001933505,0.0000018156657,0.0005169917,0.8833002,0.00013918967,0.045518253,0.00009822508,0.0700529],"study_design_scores_gemma":[0.00012041926,0.000030495856,0.000053067055,0.000034834982,0.000012853973,0.000007083495,0.000014731369,0.98432624,0.00053335575,0.0145145925,0.00015796382,0.00019436853],"about_ca_topic_score_codex":0.0000052089,"about_ca_topic_score_gemma":0.0000012196815,"teacher_disagreement_score":0.17518206,"about_ca_system_score_codex":0.000027776121,"about_ca_system_score_gemma":0.00011077694,"threshold_uncertainty_score":0.6941273},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Common value auction; Bidding; Classifier (UML); Artificial intelligence; Machine learning; Incremental learning","score_opus":0.13700165246554447,"score_gpt":0.42101409034002757,"score_spread":0.2840124378744831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128553169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012894559,0.00005491166,0.9846962,0.0005110157,0.00023959443,0.00015555225,0.000011572979,0.000045875233,0.0013907079],"genre_scores_gemma":[0.9186372,0.000019367257,0.07861251,0.00021812669,0.00016069971,0.00007105258,0.000026245774,0.000008984215,0.0022457836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822456,0.00014494277,0.00046403188,0.0004474923,0.00057292863,0.00014602668],"domain_scores_gemma":[0.9961113,0.0031533162,0.00019485422,0.00021804072,0.00024621468,0.00007629276],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008422573,0.00009905846,0.00012569936,0.00011638813,0.0004902877,0.00013847738,0.0002563223,0.000051294952,0.0018080038],"category_scores_gemma":[0.0010635131,0.0000967466,0.000106159205,0.00056047604,0.000102371756,0.00014910025,0.00009352144,0.00018513121,0.0009329042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019596388,0.000060510443,0.0004451495,0.0000021525736,0.000012596669,0.00000106326,0.000238676,0.43068752,0.00047001932,0.40056595,0.00016381645,0.16733295],"study_design_scores_gemma":[0.000035182573,0.000030537325,0.0018345965,0.000008140557,0.000006246964,0.0000067119445,0.001058508,0.073030815,0.021618778,0.88081545,0.02144392,0.00011114356],"about_ca_topic_score_codex":0.000004607145,"about_ca_topic_score_gemma":0.000009893527,"teacher_disagreement_score":0.9060837,"about_ca_system_score_codex":0.00007792762,"about_ca_system_score_gemma":0.00005082587,"threshold_uncertainty_score":0.99984497},"labels":[],"label_agreement":null},{"id":"W3183740574","doi":"10.1111/coin.70150","title":"Precision‐Weighted Federated Learning","year":2025,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cybernet Systems Corporation (Canada); Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MNIST database; Computer science; Speedup; Stability (learning theory); Reliability (semiconductor); Federated learning; Variance (accounting); Artificial intelligence; Machine learning; Scheme (mathematics); Convergence (economics); Index (typography); Data mining; Deep learning; Mathematics","score_opus":0.03595431002690719,"score_gpt":0.3214281582734608,"score_spread":0.2854738482465536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183740574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017459154,0.0002854996,0.9814787,0.010393184,0.00045423917,0.00014087697,0.00000236147,0.0010921409,0.0044070836],"genre_scores_gemma":[0.52657866,0.000025818636,0.47263065,0.00034225546,0.000012305218,0.000015170836,0.000020920297,0.0000053164295,0.00036887798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836916,0.00009906942,0.00035747635,0.000573137,0.00033470851,0.00026644263],"domain_scores_gemma":[0.99683183,0.0009542461,0.00009681575,0.0017396293,0.00033143137,0.000046035973],"candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00034783024,0.00015761438,0.00015398124,0.00029745186,0.00033447184,0.00035901807,0.012984946,0.00010234088,0.000045086123],"category_scores_gemma":[0.010594256,0.00015648182,0.000048534213,0.0014516354,0.00010964864,0.0005091744,0.02629344,0.00037100853,0.00024945318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001279102,0.00010249912,0.0009189492,0.000023769104,0.000058146965,0.000024621324,0.000072028284,0.051150963,0.00011074326,0.2745444,0.094844,0.5781371],"study_design_scores_gemma":[0.00002889542,0.000015936293,0.0004323032,0.000036710248,0.0000013270311,0.0000043272457,0.0000111023,0.5342718,0.0020482063,0.4608788,0.0021853338,0.00008532367],"about_ca_topic_score_codex":0.000011301317,"about_ca_topic_score_gemma":0.0000018451758,"teacher_disagreement_score":0.5780518,"about_ca_system_score_codex":0.00010318381,"about_ca_system_score_gemma":0.00019449435,"threshold_uncertainty_score":0.9977399},"labels":[],"label_agreement":null},{"id":"W3192289992","doi":"10.1111/coin.12438","title":"Improving stochastic local search for uniform <scp><i>k</i>‐SAT</scp> by generating appropriate initial assignment","year":2021,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nutrasource","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Heuristics; Random variable; Local search (optimization); Heuristic; Algorithm; Computer science; Variable (mathematics); Mathematical optimization; Mathematics; Statistics","score_opus":0.02984284784506302,"score_gpt":0.2886217986190427,"score_spread":0.25877895077397967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192289992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023576254,0.00011054854,0.9961988,0.00023442494,0.00047700753,0.00029156514,0.000031848427,0.00012187983,0.00017634877],"genre_scores_gemma":[0.686659,0.0000032642206,0.31249934,0.0003765535,0.00009480875,0.000041281994,0.00016906169,0.0000127428375,0.00014394952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981111,0.00009401964,0.0004298317,0.0005481318,0.00047131756,0.00034558837],"domain_scores_gemma":[0.9978796,0.0010351143,0.00012938264,0.00020880369,0.0005986519,0.00014842518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040292804,0.00018135594,0.00016276704,0.00009410284,0.00039925164,0.0003629157,0.00035141868,0.00007811813,0.000031265627],"category_scores_gemma":[0.00026197516,0.000199479,0.00008438185,0.00039950368,0.000099825156,0.00041164213,0.00020653044,0.0002194452,0.000038372094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015578986,0.00003973649,0.000017556446,0.000015303049,0.000014699273,0.0000036230977,0.00039030993,0.80041605,0.0007002324,0.015811054,0.0001615143,0.18242837],"study_design_scores_gemma":[0.0001646383,0.00006197656,0.0000325316,0.00002048944,0.0000065504028,0.000041246672,0.0004135949,0.97999734,0.014567719,0.004464034,0.00012630982,0.00010357037],"about_ca_topic_score_codex":0.000012889084,"about_ca_topic_score_gemma":0.000005849084,"teacher_disagreement_score":0.6843014,"about_ca_system_score_codex":0.00015548326,"about_ca_system_score_gemma":0.0005115766,"threshold_uncertainty_score":0.8134517},"labels":[],"label_agreement":null},{"id":"W4206923042","doi":"10.1111/coin.12502","title":"A deep learning and heuristic methodology for predicting breakups in social network structures","year":2022,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Breakup; Artificial intelligence; Heuristic; False positive paradox; Statement (logic); Scripting language; Social network (sociolinguistics); Machine learning; Social psychology; Psychology; Social media; Epistemology; World Wide Web","score_opus":0.04982887560549292,"score_gpt":0.36071245255421003,"score_spread":0.3108835769487171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206923042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018182,0.00022373945,0.98099095,0.00005680013,0.000054869477,0.0001587381,0.000004857828,0.00003462064,0.00029343765],"genre_scores_gemma":[0.92341983,0.0000010659775,0.07599859,0.000037044345,0.00032683864,0.00010047312,0.00006798575,0.000010143379,0.000038017923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989531,0.0002505462,0.0002526996,0.00022657478,0.00010923969,0.00020784778],"domain_scores_gemma":[0.99856913,0.0011985343,0.0001227782,0.00003518012,0.000051742107,0.000022625489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005197282,0.00009102314,0.00018186665,0.0000739667,0.00054366235,0.000026144195,0.00011611158,0.000015042152,0.00022319623],"category_scores_gemma":[0.000028747578,0.00010700496,0.00005987859,0.00024804947,0.000048202863,0.000027977601,0.0001888058,0.00024108276,3.554779e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018290812,0.0000123050395,0.031736195,0.0000043232258,0.0000270897,5.053816e-7,0.00039060996,0.74610466,0.000002946099,0.15421025,0.00009590251,0.067396924],"study_design_scores_gemma":[0.000041822095,0.000030759154,0.003944554,0.0000027728329,0.000011035613,0.0000019190647,0.00034464317,0.5115065,0.000005595506,0.4834729,0.0005668545,0.00007061069],"about_ca_topic_score_codex":0.000048699254,"about_ca_topic_score_gemma":0.000008421352,"teacher_disagreement_score":0.90523785,"about_ca_system_score_codex":0.000031246447,"about_ca_system_score_gemma":0.000024008787,"threshold_uncertainty_score":0.4363536},"labels":[],"label_agreement":null},{"id":"W4253833210","doi":"10.1111/j.1467-8640.2006.00279.x","title":"INTRODUCTION TO THE SPECIAL ISSUE ON CASE‐BASED REASONING IN THE HEALTH SCIENCES","year":2006,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Cancer Institute, University of Pittsburgh; Università degli Studi di Pavia; University of Aberdeen; Victoria University; Robert Gordon University; University of Victoria","keywords":"Domain (mathematical analysis); Case-based reasoning; Computer science; Data science; Artificial intelligence; Management science; Engineering; Mathematics","score_opus":0.033234817317546884,"score_gpt":0.31821249749381164,"score_spread":0.28497768017626474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253833210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028983809,0.00009288971,0.9081397,0.08640856,0.00060614257,0.00023153595,0.00000277087,0.000047489073,0.0015724925],"genre_scores_gemma":[0.8927367,0.0000012105564,0.09366179,0.0071406746,0.006326511,0.00002334,0.000011961982,0.000005526728,0.00009233133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983411,0.00027347452,0.00027539136,0.00039713673,0.0004473421,0.0002655512],"domain_scores_gemma":[0.99868387,0.0008631767,0.00009886896,0.0002472331,0.000071409384,0.00003541968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019017522,0.00011246542,0.000092053124,0.0001554256,0.0007342069,0.00030502822,0.0008063703,0.000022919045,0.0000318188],"category_scores_gemma":[0.000112348054,0.000072833944,0.00003123485,0.001159292,0.00008658782,0.00014779597,0.000051417825,0.00020859699,0.00017148185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046015693,0.000027053737,0.00011469442,0.0000028535987,7.417327e-7,0.000026591488,0.00089205254,0.8342794,3.8857667e-7,0.09361684,0.041216534,0.029818244],"study_design_scores_gemma":[0.00004446321,0.00032369705,0.0015832706,0.00006668848,0.0000011185385,0.0002512356,0.00028382585,0.9329834,0.00008370159,0.016047096,0.048177768,0.00015375475],"about_ca_topic_score_codex":0.000509948,"about_ca_topic_score_gemma":0.00014596163,"teacher_disagreement_score":0.8898383,"about_ca_system_score_codex":0.000075833515,"about_ca_system_score_gemma":0.0001929768,"threshold_uncertainty_score":0.56469995},"labels":[],"label_agreement":null},{"id":"W4293769253","doi":"10.1111/coin.12546","title":"Cluster‐based improvement rates for trust establishment models in single or distributed multi‐agent systems","year":2022,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Access Control and Trust","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Trustworthiness; Computer science; Cluster (spacecraft); Cluster analysis; Artificial intelligence; Computer security; Computer network","score_opus":0.09754477033518438,"score_gpt":0.3660383583734495,"score_spread":0.2684935880382651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293769253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005672773,0.0003544896,0.99044836,0.0008991682,0.0007411439,0.0013761716,0.00032549858,0.00005463815,0.00012778946],"genre_scores_gemma":[0.99496406,0.000008746867,0.0031743522,0.00029850614,0.000081120066,0.0009657695,0.00020346997,0.000011473947,0.00029251905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826616,0.00013108582,0.00042605304,0.00032190696,0.0005240207,0.00033076407],"domain_scores_gemma":[0.99841124,0.0010167061,0.00015277267,0.00010187903,0.0002245994,0.00009279609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071730214,0.0001278837,0.00017917095,0.00010905901,0.00075935957,0.00020058775,0.000401258,0.00003603213,0.00016004997],"category_scores_gemma":[0.00016610157,0.00012158329,0.00006723233,0.0004226574,0.000092164875,0.00024166467,0.00010635795,0.00011061758,0.0000047062267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015861925,0.00037896656,0.0002986871,0.000023146398,0.00001669331,0.0000044422477,0.00092760834,0.9747152,0.0000072768853,0.01498712,0.00024811272,0.00823416],"study_design_scores_gemma":[0.00051182555,0.00015791845,0.00017053664,0.00001657411,0.00001055815,4.5765663e-7,0.005225077,0.98536855,0.00004848418,0.0038874915,0.0044399183,0.00016262424],"about_ca_topic_score_codex":0.0018905591,"about_ca_topic_score_gemma":0.0005787638,"teacher_disagreement_score":0.98929125,"about_ca_system_score_codex":0.0006415869,"about_ca_system_score_gemma":0.0003700905,"threshold_uncertainty_score":0.58404565},"labels":[],"label_agreement":null},{"id":"W4308298782","doi":"10.1111/coin.12558","title":"Hierarchical Dirichlet and Pitman–Yor process mixtures of shifted‐scaled Dirichlet distributions for proportional data modeling","year":2022,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Hierarchical Dirichlet process; Dirichlet distribution; Dirichlet process; Computer science; Latent Dirichlet allocation; Inference; Cluster analysis; Model selection; Mixture model; Artificial intelligence; Mathematics; Algorithm; Topic model; Pattern recognition (psychology); Data mining","score_opus":0.07561757794380095,"score_gpt":0.35869497653702404,"score_spread":0.2830773985932231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308298782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045217695,0.00068825996,0.9913218,0.0020554818,0.00016635924,0.00045537876,0.00066771696,0.00006465957,0.000058574788],"genre_scores_gemma":[0.5405857,0.000011412925,0.45861906,0.0001769038,0.000047409758,0.00010303085,0.0004265217,0.000008238622,0.000021724505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778396,0.00014825285,0.0005291186,0.00071453914,0.0005576376,0.0002664634],"domain_scores_gemma":[0.9983373,0.0005588319,0.00017928214,0.00047719633,0.0003274404,0.00011993905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008630792,0.00017489164,0.00024933202,0.00012941637,0.00046879688,0.00007942084,0.0013845686,0.000046323647,0.000023872006],"category_scores_gemma":[0.00017897431,0.00016828746,0.000066572065,0.0004381212,0.00014570702,0.00036430926,0.0009730397,0.0002635041,9.3655444e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005231674,0.00026408106,0.0000872575,0.00009076478,0.00004317249,0.0000048363004,0.0005091627,0.15869053,0.000048343692,0.801046,0.0006052377,0.038558256],"study_design_scores_gemma":[0.0000725267,0.000061354585,0.00006851125,0.000009758436,0.000009685739,0.000026218504,0.000011606966,0.5814288,0.00010127779,0.41787502,0.00021927904,0.00011596373],"about_ca_topic_score_codex":0.0000068327663,"about_ca_topic_score_gemma":9.947273e-7,"teacher_disagreement_score":0.5360639,"about_ca_system_score_codex":0.000036943995,"about_ca_system_score_gemma":0.0002999123,"threshold_uncertainty_score":0.68625635},"labels":[],"label_agreement":null},{"id":"W4365513588","doi":"10.1111/coin.12577","title":"Discrete wavelet transform based branched deep hybrid network for environmental noise classification","year":2023,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Music and Audio Processing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Environmental noise; Noise (video); Computer science; Noise pollution; Component (thermodynamics); Discrete wavelet transform; Artificial intelligence; Wavelet; Environmental pollution; Background noise; Pattern recognition (psychology); Noise reduction; Wavelet transform; Environmental science; Telecommunications","score_opus":0.0369286842265121,"score_gpt":0.2791603019271742,"score_spread":0.24223161770066212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365513588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001526577,0.00007585576,0.99452835,0.0026659153,0.00029675316,0.00030381975,0.000020796007,0.0002104003,0.00037153493],"genre_scores_gemma":[0.8470755,0.000010354179,0.15119871,0.0010604828,0.0001516149,0.000077399774,0.00027123114,0.0000139194035,0.00014074263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985613,0.000029605068,0.0003209583,0.0004446318,0.00031367398,0.00032980012],"domain_scores_gemma":[0.99914664,0.00040421326,0.000106887055,0.00020536267,0.000046019864,0.00009089454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030517112,0.00015466262,0.00013841498,0.0000842907,0.00030821303,0.00014129547,0.00054270704,0.000038645303,0.00003442758],"category_scores_gemma":[0.000024965815,0.000154742,0.0001014049,0.0003950568,0.00008588542,0.0003508316,0.000050864386,0.000092052775,0.00015606923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015279822,0.000029509547,0.00011244513,0.000033269396,0.0000109660405,0.000003509785,0.00020574698,0.5957048,0.00017031164,0.013928373,0.001545792,0.38824],"study_design_scores_gemma":[0.00011642469,0.000035827117,0.0032396081,0.000025329691,0.000005023904,0.000004248381,0.000019939218,0.9319116,0.0017699976,0.060202096,0.0024860774,0.00018381864],"about_ca_topic_score_codex":9.381096e-7,"about_ca_topic_score_gemma":9.64344e-7,"teacher_disagreement_score":0.8455489,"about_ca_system_score_codex":0.00005851045,"about_ca_system_score_gemma":0.0000812377,"threshold_uncertainty_score":0.63101953},"labels":[],"label_agreement":null},{"id":"W4383913721","doi":"10.1111/coin.12593","title":"Online short text clustering using infinite extensions of discrete mixture models","year":2023,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Dirichlet distribution; Computer science; Multinomial distribution; Gibbs sampling; Prior probability; Artificial intelligence; Latent Dirichlet allocation; Benchmark (surveying); Outlier; Topic model; Pattern recognition (psychology); Machine learning; Mathematics; Statistics; Bayesian probability","score_opus":0.11313478187495078,"score_gpt":0.3644947936831115,"score_spread":0.2513600118081607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383913721","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009354228,0.00014433639,0.9892987,0.00029403405,0.00031251318,0.00014315076,0.00002715995,0.00016189797,0.00026396036],"genre_scores_gemma":[0.47327086,0.00002635485,0.5264531,0.000127525,0.000041299678,0.0000026963583,0.000018994178,0.000010179916,0.00004900468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983098,0.00009523718,0.00047563316,0.00043900305,0.00039356932,0.00028675934],"domain_scores_gemma":[0.9986733,0.0004054703,0.00010273019,0.00039450167,0.00030903943,0.00011496588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036762634,0.00018310074,0.0002523799,0.00027540713,0.00013600488,0.00006395503,0.0007174131,0.00008367057,0.000008270063],"category_scores_gemma":[0.00006579962,0.00017100804,0.00011723287,0.0011271626,0.00009420593,0.00045084386,0.00051167124,0.00019451905,0.000015326419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000349859,0.00003003179,0.000022914135,0.00002000276,0.00001467721,0.000010387431,0.00049739727,0.87164086,0.00038539054,0.08060743,0.00006341033,0.04670398],"study_design_scores_gemma":[0.000023578456,0.000021648711,0.0003683138,0.000075228236,0.0000058617857,0.00002552891,0.000024026558,0.75291055,0.00037735573,0.2459962,0.000030910316,0.00014076883],"about_ca_topic_score_codex":0.000018815492,"about_ca_topic_score_gemma":0.0000058136693,"teacher_disagreement_score":0.46391663,"about_ca_system_score_codex":0.000027879758,"about_ca_system_score_gemma":0.00011598361,"threshold_uncertainty_score":0.6973505},"labels":[],"label_agreement":null},{"id":"W4387183694","doi":"10.1111/coin.12603","title":"A semantically enhanced text retrieval framework with abstractive summarization","year":2023,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Barrie Urology Group; York University","funders":"China Scholarship Council; Natural Science Foundation of Hubei Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Hubei Provincial Department of Education","keywords":"Computer science; Automatic summarization; Natural language processing; Artificial intelligence; Question answering; Encoder; Language model; Information retrieval; Generative grammar; Transformer; Semantics (computer science); Sequence (biology); Programming language","score_opus":0.029918996281097184,"score_gpt":0.299368928543697,"score_spread":0.26944993226259983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387183694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020674465,0.000014632899,0.9766853,0.0009227115,0.00023862829,0.00016161414,0.0000019300837,0.0003802165,0.00092049193],"genre_scores_gemma":[0.7653726,0.0000072349703,0.23419061,0.0002031342,0.000061135856,0.0000065215545,0.0000125381,0.000009070177,0.00013720038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839354,0.000040388735,0.0002773311,0.0004850722,0.0005410565,0.00026259685],"domain_scores_gemma":[0.9983805,0.0007852574,0.000100709796,0.00030465293,0.00034215022,0.000086766435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023850403,0.0001376502,0.00013077585,0.0001542742,0.00014185127,0.00016711168,0.0005943907,0.00007635392,0.00003100621],"category_scores_gemma":[0.00025248097,0.00012689971,0.00003703246,0.0012413599,0.00006900868,0.0004129898,0.00016113649,0.00022174887,0.00056613534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020089878,0.000024774354,0.00009542298,0.000010790799,0.000016022623,0.000017677445,0.00091865787,0.67180026,0.00013440565,0.30816922,0.000037339636,0.01875535],"study_design_scores_gemma":[0.000041932763,0.000054047363,0.0027324692,0.000064188054,0.0000029487285,0.000008379169,0.00005990433,0.77573395,0.003083401,0.21802221,0.00004345908,0.0001531133],"about_ca_topic_score_codex":0.000005322008,"about_ca_topic_score_gemma":0.0000017735352,"teacher_disagreement_score":0.7446981,"about_ca_system_score_codex":0.000049827788,"about_ca_system_score_gemma":0.00015630505,"threshold_uncertainty_score":0.7276713},"labels":[],"label_agreement":null},{"id":"W4394760812","doi":"10.1111/coin.12641","title":"Novel mixture allocation models for topic learning","year":2024,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Latent Dirichlet allocation; Inference; Topic model; Dirichlet distribution; Computer science; Mixture model; Artificial intelligence; Prior probability; Latent variable; Categorization; Machine learning; Pattern recognition (psychology); Mathematics","score_opus":0.054653766304620065,"score_gpt":0.3294408408894598,"score_spread":0.27478707458483975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394760812","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022056916,0.0010154524,0.99462503,0.001905987,0.00062169944,0.00019887557,0.0000034374686,0.00025476588,0.0013526814],"genre_scores_gemma":[0.19741684,0.000017207292,0.8007954,0.00038015045,0.0001380843,0.000039289524,0.000016016813,0.000010579524,0.0011864637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989236,0.000034523735,0.0002233692,0.00043300053,0.00019959715,0.00018590181],"domain_scores_gemma":[0.9988667,0.0006849845,0.000036388978,0.00015717378,0.0001922203,0.00006253179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035710714,0.0001257541,0.000109240485,0.00011122132,0.00012356283,0.00028238224,0.00044461683,0.00006939118,0.000008046264],"category_scores_gemma":[0.00006945063,0.00011757439,0.00009056526,0.00032044726,0.000028443961,0.00052349,0.00007842169,0.0001744837,0.00002599127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010728758,0.000009690267,3.2216062e-7,0.000025164538,0.000008188862,9.499326e-7,0.00034798568,0.24898975,0.00008983326,0.5660193,0.00024042914,0.18426734],"study_design_scores_gemma":[0.000016425649,0.000022157417,0.0000036065749,0.000029265893,0.0000029349194,0.000013258023,0.0000040790014,0.54069626,0.00039908188,0.45626295,0.002472203,0.00007779329],"about_ca_topic_score_codex":0.000003830479,"about_ca_topic_score_gemma":7.424368e-7,"teacher_disagreement_score":0.2917065,"about_ca_system_score_codex":0.000041499585,"about_ca_system_score_gemma":0.000123751,"threshold_uncertainty_score":0.47945443},"labels":[],"label_agreement":null},{"id":"W4399441286","doi":"10.1111/coin.12656","title":"Utilizing passage‐level relevance and kernel pooling for enhancing BERT‐based document reranking","year":2024,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Pooling; Relevance (law); Information retrieval; Ranking (information retrieval); Learning to rank; Artificial intelligence; Kernel (algebra); Rank (graph theory); Machine learning; Data mining; Natural language processing; Mathematics","score_opus":0.06767963765381896,"score_gpt":0.33028697392846934,"score_spread":0.2626073362746504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399441286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023631912,0.002157878,0.99284047,0.0012498023,0.0006768201,0.00025546484,0.000004627098,0.00024899095,0.00020277002],"genre_scores_gemma":[0.60989714,0.000016462074,0.38956395,0.0003206039,0.000090727204,0.000028658458,0.0000045192146,0.0000116359,0.000066292196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981803,0.000036899164,0.0004360848,0.00069547584,0.00034096907,0.00031022372],"domain_scores_gemma":[0.9977935,0.0016525516,0.0000700365,0.0002386815,0.00016124493,0.000083980645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006069287,0.0001809972,0.0001645895,0.00015656574,0.00022345917,0.0004989592,0.00043970565,0.00005505373,0.000007409621],"category_scores_gemma":[0.00019126233,0.0001867158,0.00007489244,0.00028907537,0.00004372333,0.00053641375,0.00016207815,0.00017665394,0.000016786451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005310842,0.000010072247,0.00002475755,0.00017293422,0.000018800778,0.000013905762,0.00086851226,0.4262008,0.00036775557,0.39363244,0.000040888215,0.17864381],"study_design_scores_gemma":[0.00005023568,0.000023955283,0.00005045701,0.00036198486,0.0000061680416,0.000015657026,0.00003966085,0.7822581,0.0032918204,0.21314996,0.00058376294,0.00016822873],"about_ca_topic_score_codex":0.000019783169,"about_ca_topic_score_gemma":0.000012032934,"teacher_disagreement_score":0.607534,"about_ca_system_score_codex":0.00010584095,"about_ca_system_score_gemma":0.00017276633,"threshold_uncertainty_score":0.7614049},"labels":[],"label_agreement":null},{"id":"W4405559952","doi":"10.1111/coin.70015","title":"Mining User Study Data to Judge the Merit of a Model for Supporting User‐Specific Explanations of <scp>AI</scp> Systems","year":2024,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Value (mathematics); Computer science; Focus (optics); User modeling; Artificial intelligence; Order (exchange); Machine learning; User interface","score_opus":0.20998704697061374,"score_gpt":0.3958272314168007,"score_spread":0.18584018444618697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405559952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025906693,0.00047506375,0.9707506,0.00056014356,0.00069447816,0.0012453581,0.000136005,0.00011133196,0.00012037757],"genre_scores_gemma":[0.9286919,0.000009906202,0.070532836,0.00012103892,0.00009060289,0.00015817973,0.00004545741,0.000025860449,0.0003241806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671155,0.00012334186,0.001189995,0.00083174795,0.00074223016,0.0004011488],"domain_scores_gemma":[0.9938873,0.0036905138,0.00028545567,0.0011329026,0.0008921082,0.000111735455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017084477,0.00022714563,0.00034280494,0.00036088296,0.00023785696,0.00041558713,0.003028539,0.00005672059,0.0000051756306],"category_scores_gemma":[0.0007796657,0.00019564829,0.000099234574,0.0014903967,0.000116194904,0.0009888402,0.000783939,0.00016829945,0.000043035507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034968857,0.00013092121,0.000109778324,0.00006998507,0.00005838561,0.0000055629994,0.011348652,0.74039984,0.00022227255,0.23765662,0.0048916154,0.0051028673],"study_design_scores_gemma":[0.000028532351,0.00015376126,0.00006016812,0.00013091408,0.000021488573,0.000009630559,0.007663341,0.97684705,0.0033011085,0.009369201,0.0023151243,0.000099673925],"about_ca_topic_score_codex":0.000085308435,"about_ca_topic_score_gemma":0.000046006473,"teacher_disagreement_score":0.90278524,"about_ca_system_score_codex":0.00006549791,"about_ca_system_score_gemma":0.00035510992,"threshold_uncertainty_score":0.7978306},"labels":[],"label_agreement":null},{"id":"W4407311311","doi":"10.1111/coin.70024","title":"Personalized Recommendation Method Based on Rating Matrix and Review Text","year":2025,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Natural language processing; Information retrieval; Artificial intelligence; Speech recognition","score_opus":0.03820724382141988,"score_gpt":0.39215082325156114,"score_spread":0.35394357943014126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407311311","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007923878,0.00220601,0.98170066,0.011461719,0.0001829048,0.00031655622,0.000002322666,0.00015643013,0.0039654993],"genre_scores_gemma":[0.06713677,0.00041130555,0.9239416,0.007891794,0.000027106926,0.00008399252,0.000023904384,0.000007913395,0.00047557594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866694,0.00025058587,0.00037636605,0.0003931458,0.00018043544,0.00013251812],"domain_scores_gemma":[0.99850184,0.0009431724,0.00013342411,0.00020918304,0.0001674603,0.000044933724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009441583,0.00013896002,0.00020838433,0.00016739192,0.00015545484,0.00014074707,0.00034644155,0.000041223382,0.000053198837],"category_scores_gemma":[0.00013883978,0.00012723662,0.00006008146,0.0004786231,0.000027492604,0.00019744558,0.000105973515,0.0001293391,0.00001741904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041718017,0.000036266374,0.0000681754,0.0003015169,0.000012774676,0.0000014687295,0.00006551465,0.0034567586,0.00000836344,0.46516812,0.006859623,0.5240172],"study_design_scores_gemma":[0.000069630594,0.000048362945,0.00011859515,0.0010763594,0.0000063643984,0.000008411728,0.000013098354,0.937725,0.00030050267,0.03952455,0.020974604,0.0001344984],"about_ca_topic_score_codex":0.000016549067,"about_ca_topic_score_gemma":9.404506e-7,"teacher_disagreement_score":0.93426824,"about_ca_system_score_codex":0.000062177874,"about_ca_system_score_gemma":0.00009971428,"threshold_uncertainty_score":0.5188559},"labels":[],"label_agreement":null},{"id":"W4410385907","doi":"10.1111/coin.70060","title":"Determining Treatment Dosage for Hypothyroidism Using Machine Learning","year":2025,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Biomarkers in Disease Mechanisms","field":"Immunology and Microbiology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Sheridan College","funders":"","keywords":"Computer science; Artificial intelligence; Speech recognition; Medicine; Machine learning","score_opus":0.04724159185069027,"score_gpt":0.32491500764312914,"score_spread":0.27767341579243887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410385907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07074385,0.0031748065,0.92449003,0.0000919376,0.0007307438,0.00031787425,0.000045342174,0.000087657085,0.0003177502],"genre_scores_gemma":[0.9717507,0.000020083335,0.02631469,0.00014897385,0.000016092676,0.000044296223,0.00017843238,0.000011760841,0.0015149829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991829,0.000079339865,0.00023395818,0.00027311544,0.000024555498,0.00020617012],"domain_scores_gemma":[0.9991811,0.0005484081,0.00007493483,0.00010218559,0.00007752567,0.000015834217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011504731,0.00014391329,0.00015807911,0.00012402632,0.00030606234,0.00002104476,0.00014831565,0.000098191056,0.00010529498],"category_scores_gemma":[0.00010034747,0.00013774536,0.00009887023,0.00012807174,0.00009726219,0.000043689226,0.000057469133,0.0000872209,0.00005446761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073203683,0.00064328476,0.006289595,0.00013429097,0.0013339861,0.000024127721,0.0010894872,0.21800692,0.260085,0.07885515,0.00057754724,0.43222857],"study_design_scores_gemma":[0.0013840398,0.00052305614,0.0010985216,0.00016938857,0.00022703806,0.00006862719,0.0004190266,0.5002615,0.40050596,0.08023968,0.014578158,0.00052504963],"about_ca_topic_score_codex":0.000018137594,"about_ca_topic_score_gemma":0.0000042893366,"teacher_disagreement_score":0.9010068,"about_ca_system_score_codex":0.00011338717,"about_ca_system_score_gemma":0.00010510018,"threshold_uncertainty_score":0.5617093},"labels":[],"label_agreement":null},{"id":"W4411120930","doi":"10.1111/coin.70073","title":"An Innovative Sentiment Influenced Stock Market Prediction Based on Dual Scale Adaptive Residual Long Short Term Memory With Attention Mechanism","year":2025,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Residual; Dual (grammatical number); Term (time); Computer science; Stock market; Mechanism (biology); Artificial intelligence; Stock (firearms); Econometrics; Cognitive psychology; Economics; Algorithm; Psychology; Engineering; History; Linguistics","score_opus":0.07485950746457086,"score_gpt":0.39505586577203705,"score_spread":0.3201963583074662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411120930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31366798,0.000005838053,0.6807561,0.00013645994,0.00040434074,0.00057601026,0.0000479049,0.00009248724,0.004312918],"genre_scores_gemma":[0.8964657,4.7296078e-7,0.10210311,0.0003313352,0.0000751905,0.0000964324,0.000060074584,0.000018129704,0.00084956596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99436194,0.0009813305,0.0009802984,0.0010940456,0.0022498213,0.00033254796],"domain_scores_gemma":[0.99344724,0.0032842462,0.00032760517,0.00059523765,0.002217771,0.00012791285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0043393187,0.00032352252,0.00034396228,0.000977683,0.00040706023,0.00028620765,0.000640466,0.00012915919,0.00027421696],"category_scores_gemma":[0.0011696381,0.0002686952,0.00007863464,0.0026109754,0.00029217682,0.00052845344,0.00014140409,0.00035164633,0.00003289484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002099791,0.00048117645,0.046585318,0.00002124017,0.00010336608,0.000035344667,0.00067316764,0.7374271,0.00070620445,0.0032908148,0.001701924,0.20687455],"study_design_scores_gemma":[0.00019669022,0.0006451388,0.38029033,0.00018840212,0.00002348957,0.000010776325,0.0004161815,0.59689987,0.003950258,0.017166536,0.000007930636,0.00020441855],"about_ca_topic_score_codex":0.00001355986,"about_ca_topic_score_gemma":0.00002229167,"teacher_disagreement_score":0.5827977,"about_ca_system_score_codex":0.00029228002,"about_ca_system_score_gemma":0.00045962931,"threshold_uncertainty_score":0.9999765},"labels":[],"label_agreement":null},{"id":"W4412133173","doi":"10.1111/coin.70097","title":"SparseMult: A Sparse Tensor Decomposition Model for Knowledge Graph Link Prediction","year":2025,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Barrie Urology Group","funders":"","keywords":"Tensor decomposition; Link (geometry); Tensor (intrinsic definition); Computer science; Decomposition; Graph; Mathematics; Artificial intelligence; Pattern recognition (psychology); Theoretical computer science; Combinatorics; Pure mathematics; Chemistry","score_opus":0.0470954609821718,"score_gpt":0.33883412109769834,"score_spread":0.2917386601155265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412133173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000966277,0.00041766968,0.99542946,0.0009868705,0.0007960637,0.00057105784,0.0000259456,0.00033610544,0.00047053143],"genre_scores_gemma":[0.6086634,0.000033250963,0.39012638,0.0005186517,0.000090918504,0.00013101798,0.00005081036,0.0000109788125,0.0003745861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831444,0.00004709269,0.00046941204,0.00064113684,0.00020077455,0.00032713596],"domain_scores_gemma":[0.9981465,0.0007325688,0.00012481413,0.00034931832,0.00055190374,0.000094929004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019096604,0.0002208653,0.00019978601,0.0003368173,0.00031040554,0.00011697822,0.0007447747,0.000105994004,0.0000026086655],"category_scores_gemma":[0.000083344356,0.00023134287,0.00015807575,0.0009491158,0.000114448216,0.00054068066,0.0001834359,0.00019348344,0.00002917051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019573927,0.000059250073,0.000053614192,0.000019017254,0.000016667764,9.0241554e-7,0.00016082305,0.71081656,0.000051495543,0.2312322,0.0009660755,0.056603815],"study_design_scores_gemma":[0.00010587722,0.00004174598,0.0002581774,0.000059948066,0.000008662772,0.0000051290294,0.000007277936,0.6347851,0.00041646822,0.36394292,0.00024762526,0.000121049634],"about_ca_topic_score_codex":0.0000015222654,"about_ca_topic_score_gemma":0.000005332096,"teacher_disagreement_score":0.6076971,"about_ca_system_score_codex":0.00008416339,"about_ca_system_score_gemma":0.00013154675,"threshold_uncertainty_score":0.9433888},"labels":[],"label_agreement":null},{"id":"W4413024567","doi":"10.1111/coin.70113","title":"Taming the Triangle: On the Interplays Between Fairness, Interpretability, and Privacy in Machine Learning","year":2025,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal; Polytechnique Montréal","funders":"Canada Research Chairs; Centre International de Mathématiques et Informatique de Toulouse; Agence Nationale de la Recherche; Polytechnique Montréal","keywords":"Interpretability; Computer science; Artificial intelligence; Machine learning; Natural language processing","score_opus":0.02465387779662896,"score_gpt":0.303107553909016,"score_spread":0.278453676112387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413024567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031200955,0.00021589026,0.957856,0.008773925,0.00026055306,0.00029170004,0.0000013284415,0.00008280986,0.0013168398],"genre_scores_gemma":[0.9927841,0.000009843532,0.006361248,0.0006495329,0.000045252484,0.000024306293,0.0000046352247,0.000008299823,0.00011277499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793905,0.00058369106,0.0004505437,0.00047890533,0.00030592442,0.0002418724],"domain_scores_gemma":[0.9924598,0.006884961,0.00014477676,0.00038744134,0.00008768426,0.00003535426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016006231,0.00019580187,0.0002258723,0.0001926895,0.0003918117,0.00028263123,0.001569544,0.00005905627,0.000019913317],"category_scores_gemma":[0.0019084071,0.00012652283,0.00006400625,0.0008507838,0.00023374558,0.00027138242,0.0011915542,0.00091788545,0.000019814897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020197607,0.000029052317,0.03294231,0.00001976058,0.000028392764,0.0000040864047,0.003907806,0.42788184,0.0000030656533,0.36878452,0.000036948033,0.16634203],"study_design_scores_gemma":[0.00009875349,0.000041657586,0.01574743,0.00015132847,0.0000058873,0.000003358051,0.0002542834,0.8766776,0.00007360961,0.10616902,0.0006533854,0.00012371344],"about_ca_topic_score_codex":0.000077529454,"about_ca_topic_score_gemma":0.000011524972,"teacher_disagreement_score":0.96158314,"about_ca_system_score_codex":0.00010360618,"about_ca_system_score_gemma":0.00009247658,"threshold_uncertainty_score":0.51594514},"labels":[],"label_agreement":null},{"id":"W4414105744","doi":"10.1111/coin.70124","title":"Fairness Evaluation of Neural Networks Through Computational Profile Likelihood","year":2025,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Consortium de Recherche et d’innovation en Aérospatiale au Québec","keywords":"Outcome (game theory); Artificial neural network; Representation (politics); Pattern recognition (psychology); Conditional probability; Value (mathematics); Conditional probability distribution","score_opus":0.03684910314458238,"score_gpt":0.34775491727067254,"score_spread":0.31090581412609014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414105744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034536587,0.00036045435,0.9912498,0.0006490872,0.0009390215,0.00039932504,0.0000034426337,0.00013627128,0.002808968],"genre_scores_gemma":[0.802022,0.0000022396746,0.19753014,0.0002652369,0.000057206045,0.000033784974,0.000048206453,0.000008208281,0.00003296786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722314,0.00035616077,0.0006144572,0.00052736857,0.0009957646,0.000283118],"domain_scores_gemma":[0.9969833,0.00089226395,0.00028956478,0.00033374954,0.001452546,0.000048556656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010375617,0.00020501271,0.00025041742,0.00018674701,0.00021687451,0.00010535435,0.0010385609,0.00009371875,0.00008192457],"category_scores_gemma":[0.00037021187,0.00021557683,0.000103827675,0.0012096683,0.00015775368,0.00067599496,0.00040933987,0.0002949048,0.000020496738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007695156,0.000051389485,0.0004559937,0.000015636728,0.000026047119,0.0000010203446,0.00024044381,0.7020742,0.0000017927388,0.22603372,0.00014065887,0.07095138],"study_design_scores_gemma":[0.00015975587,0.000025924966,0.0036568546,0.00004412204,0.00001946073,0.000004720361,0.00004783853,0.7150676,0.0000663957,0.28075182,0.000027988866,0.00012746527],"about_ca_topic_score_codex":0.000029564277,"about_ca_topic_score_gemma":0.0000028666745,"teacher_disagreement_score":0.79856837,"about_ca_system_score_codex":0.00013612748,"about_ca_system_score_gemma":0.00042986783,"threshold_uncertainty_score":0.87909675},"labels":[],"label_agreement":null},{"id":"W4415779021","doi":"10.1111/coin.70149","title":"Survey on <scp>AI</scp> Ethics: A Socio‐Technical Perspective","year":2025,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Canadian Institute for International Peace and Security; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Transparency (behavior); Software deployment; Perspective (graphical); Ethical issues; Stakeholder; Point (geometry); Social responsibility","score_opus":0.055825932555241875,"score_gpt":0.38760302188025,"score_spread":0.3317770893250081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415779021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053117407,0.00013052627,0.9847154,0.004750039,0.0006808186,0.00018637857,0.000008327761,0.0003097669,0.008687587],"genre_scores_gemma":[0.91640496,0.0000100663365,0.07717583,0.005319024,0.00010220676,0.00001853169,0.000017962695,0.000014717156,0.0009367141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727243,0.0006256259,0.00037470894,0.0007471224,0.0006431771,0.00033695716],"domain_scores_gemma":[0.9877983,0.0106076775,0.00013611007,0.00045279475,0.0009150215,0.00009009968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015608013,0.00023474435,0.0002418598,0.0002775758,0.00043646197,0.00024042577,0.0015877798,0.00022615594,0.000012672022],"category_scores_gemma":[0.007634173,0.0002425151,0.00011391479,0.0010969898,0.00025517578,0.00029461013,0.00062160176,0.0015638005,0.00025766663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037968357,0.0000615361,0.00073781743,0.0000062362424,0.000021989976,0.0000073685674,0.00094541523,0.37119156,0.000003902614,0.6191867,0.0023317395,0.005501968],"study_design_scores_gemma":[0.00009330416,0.00009503616,0.03712102,0.00008555169,0.000006679659,0.0000056534554,0.00032438082,0.57923704,0.00024107094,0.38150278,0.0011583224,0.00012913425],"about_ca_topic_score_codex":0.00022958723,"about_ca_topic_score_gemma":0.000048507838,"teacher_disagreement_score":0.91587377,"about_ca_system_score_codex":0.00035934232,"about_ca_system_score_gemma":0.0006342595,"threshold_uncertainty_score":0.9889479},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"","keywords":"Automatic summarization; Computer science; Multi-document summarization; Information retrieval; Natural language processing","score_opus":0.06534615047374848,"score_gpt":0.35946882201812624,"score_spread":0.29412267154437777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45569842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005299142,0.00036723577,0.9933924,0.00012274655,0.00027718014,0.000087758795,9.8599e-7,0.000026994847,0.00042551904],"genre_scores_gemma":[0.7441867,0.000009592966,0.25556225,0.000074441676,0.000034864825,0.000004953693,0.000014764074,0.0000030070407,0.000109386325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884623,0.00007868531,0.00032857485,0.00017976675,0.00040322787,0.00016352771],"domain_scores_gemma":[0.99907863,0.00023184269,0.00017954776,0.00016695628,0.0002752803,0.00006772439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046993076,0.00008939971,0.00012073729,0.00013448055,0.00006752372,0.000042283576,0.00036364785,0.000025995052,0.00014033988],"category_scores_gemma":[0.00007344597,0.00008393175,0.00006753109,0.00046309162,0.0000440422,0.00054646906,0.00013407475,0.000049099628,0.00014649359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006767459,0.0003564988,0.023087688,0.000019090623,0.00011583362,5.8490895e-7,0.005591016,0.38954544,0.0005438941,0.4687931,0.0004252451,0.111514844],"study_design_scores_gemma":[0.000068998685,0.000029780414,0.01819632,0.00002216499,0.000010145419,0.0000017405766,0.00013117547,0.967091,0.006776234,0.0072924495,0.0002581224,0.0001218574],"about_ca_topic_score_codex":0.000008112697,"about_ca_topic_score_gemma":5.2158305e-7,"teacher_disagreement_score":0.7388876,"about_ca_system_score_codex":0.000035599613,"about_ca_system_score_gemma":0.000043878463,"threshold_uncertainty_score":0.34226376},"labels":[],"label_agreement":null},{"id":"W7116904748","doi":"10.1111/coin.70161","title":"Personalized Persuasive Recommender System: A Framework and a Machine Learning‐Based Implementation","year":2025,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University; Ontario Tech University; University of Ottawa","funders":"","keywords":"Recommender system; Persuasion; Focus (optics); Big Five personality traits; Architecture","score_opus":0.03794803464971125,"score_gpt":0.3397815548322428,"score_spread":0.30183352018253157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116904748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033738147,0.0008289126,0.9942585,0.0026786376,0.00027480678,0.0003263375,0.000005350651,0.00035175224,0.0009382772],"genre_scores_gemma":[0.82078886,0.00002465369,0.17809656,0.00085396064,0.000021894719,0.000079781654,0.000020987007,0.0000075255543,0.000105758525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998541,0.00020300374,0.00036732666,0.00044853459,0.00023623717,0.00020391043],"domain_scores_gemma":[0.9987749,0.00059507944,0.00014716432,0.00020217393,0.0002129432,0.00006773708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040219864,0.00017893405,0.00021018418,0.00024170773,0.00027995757,0.0002512444,0.00040532375,0.00007551118,0.000034929988],"category_scores_gemma":[0.00005059797,0.00017174376,0.00007223078,0.0004690025,0.000059008456,0.00022468374,0.0001669656,0.00022872127,0.000012501025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012485989,0.000039876963,0.0019705107,0.00014917008,0.000058154437,0.000007025219,0.001148186,0.0033635944,0.0000075835364,0.9145498,0.00082994066,0.077863656],"study_design_scores_gemma":[0.00022608922,0.00011862289,0.00068450987,0.00028177325,0.000014512395,0.000027404147,0.0011482051,0.9195628,0.0006416583,0.06970896,0.00732788,0.0002575857],"about_ca_topic_score_codex":0.00012970653,"about_ca_topic_score_gemma":0.000008314988,"teacher_disagreement_score":0.9161992,"about_ca_system_score_codex":0.00013079245,"about_ca_system_score_gemma":0.00012574742,"threshold_uncertainty_score":0.7003507},"labels":[],"label_agreement":null}]}