{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49870962,0.000677151,0.4672196,0.001554891,0.00010339041,0.0000887202,0.000027023549,0.0002178762,0.03140172],"genre_scores_gemma":[0.98779243,0.000088125504,0.010495788,0.000028112476,0.000018678931,0.0000402804,0.0000058506084,0.0000075298885,0.0015231682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989612,0.0005009288,0.000028696857,0.00015261112,0.00023448344,0.0001220059],"domain_scores_gemma":[0.99731976,0.0016865035,0.00033132764,0.00018748043,0.00017985768,0.00029499008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016980077,0.0002443318,0.00031922004,0.00030714922,0.00065290206,0.0011052055,0.0007379428,0.0006144251,0.0013427038],"category_scores_gemma":[0.0062453416,0.00019997667,0.00027996372,0.000203368,0.0023869982,0.0014799294,0.0016047239,0.00064833893,0.0001339286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018129082,0.0002143562,0.00434945,0.00011896237,0.00008872129,0.00032335936,0.001774184,0.47988984,0.0035791104,0.4306077,0.0011948956,0.07767802],"study_design_scores_gemma":[0.00006396185,0.00010933555,0.0014232585,0.000015621368,0.00001896985,0.00005616958,0.0003065245,0.6232296,0.00092915224,0.3711036,0.0027234268,0.000020447062],"about_ca_topic_score_codex":0.0022807017,"about_ca_topic_score_gemma":0.0016744001,"teacher_disagreement_score":0.0022807017,"about_ca_system_score_codex":0.00086619385,"about_ca_system_score_gemma":0.0010406937,"threshold_uncertainty_score":0.008979976},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8168144,0.00091875746,0.1412355,0.00047964026,0.000558344,0.0008311642,0.024613092,0.003066441,0.0114826895],"genre_scores_gemma":[0.888793,0.00039050088,0.08808088,0.00019614656,0.0002523765,0.000588224,0.016502183,0.00021825582,0.0049783355],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99926895,0.0001706232,0.00011171274,0.00018501763,0.00019135553,0.000072357565],"domain_scores_gemma":[0.9950537,0.0023067205,0.0010485958,0.00051716424,0.00088774133,0.00018603116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075762137,0.0006389436,0.00027074208,0.0035947196,0.00042756443,0.00087800145,0.0002291846,0.0004849207,0.0017947614],"category_scores_gemma":[0.004611471,0.00021517949,0.00030355222,0.0025112366,0.0003621774,0.0018843828,0.0007454214,0.00058602344,0.0016981886],"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.0017141138,0.00041844996,0.24069348,0.001635342,0.00023377255,0.00081758836,0.0069791693,0.004307527,0.18306358,0.0053313305,0.021992091,0.53281343],"study_design_scores_gemma":[0.00011742135,0.0009422607,0.67853945,0.00023457194,0.00026490798,0.0013347993,0.0057272925,0.13045068,0.08696342,0.020864438,0.07429033,0.0002704749],"about_ca_topic_score_codex":0.0015193832,"about_ca_topic_score_gemma":0.004796027,"teacher_disagreement_score":0.0035947196,"about_ca_system_score_codex":0.0003258093,"about_ca_system_score_gemma":0.00020788092,"threshold_uncertainty_score":0.0060040355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016841253,0.00007451228,0.97883874,0.0005243947,0.000039801253,0.0000776705,0.00007765806,0.0002549867,0.0032709548],"genre_scores_gemma":[0.8430253,0.00022627921,0.1517322,0.00015210862,0.00007404097,0.00025722134,0.0001439405,0.00006632864,0.00432248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974045,0.0011494629,0.00017606147,0.0003479202,0.00067913265,0.00024288674],"domain_scores_gemma":[0.9966557,0.0014825007,0.00060315605,0.000507919,0.0005182866,0.00023235471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002996713,0.0005183966,0.00079419476,0.0006119121,0.0008298865,0.0024737702,0.0018167096,0.0014485187,0.0026409845],"category_scores_gemma":[0.008021258,0.00043784812,0.0009933785,0.00085862854,0.0017247538,0.004766483,0.0018848105,0.0019978173,0.00048969814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015206104,0.00007108609,0.0008470977,0.000070166585,0.000047938745,0.0002877469,0.0003516006,0.5913592,0.00196331,0.38092327,0.0019327526,0.021993773],"study_design_scores_gemma":[0.000020076965,0.000028020959,0.00006876141,0.000005396396,0.000008322801,0.0000378351,0.000025640187,0.95036566,0.0003015653,0.047918856,0.0012089376,0.000010911856],"about_ca_topic_score_codex":0.0046442086,"about_ca_topic_score_gemma":0.0036756317,"teacher_disagreement_score":0.0046442086,"about_ca_system_score_codex":0.0018888302,"about_ca_system_score_gemma":0.001596774,"threshold_uncertainty_score":0.015848339},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25768003,0.0011234906,0.73576057,0.000676734,0.00016184947,0.000084188185,0.00010798271,0.0009445743,0.0034605353],"genre_scores_gemma":[0.93723464,0.00025205882,0.060384475,0.00010171954,0.00006275233,0.00006070222,0.00017298291,0.000059381844,0.0016712968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993636,0.00030094327,0.000034725064,0.0001144533,0.00012499694,0.00006143116],"domain_scores_gemma":[0.99824595,0.001096772,0.00016943365,0.00024498868,0.00017604338,0.00006686673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023049419,0.00064525096,0.000911359,0.0005996516,0.00022012921,0.00077169575,0.0010030097,0.0009654077,0.0011095052],"category_scores_gemma":[0.005557868,0.0003060131,0.00049119064,0.0005658555,0.00070636114,0.0013570918,0.0015139953,0.0011225096,0.0004518358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035758814,0.00008584774,0.001977236,0.00006824734,0.00006234565,0.000038581195,0.000050174553,0.8573208,0.005049945,0.0057937982,0.0006650006,0.12853046],"study_design_scores_gemma":[0.000005843357,0.000028699045,0.0001947807,0.000002257318,0.000003518929,0.000010760982,0.0000056414847,0.99541783,0.0011327509,0.003068119,0.00012469698,0.000005111045],"about_ca_topic_score_codex":0.0010503572,"about_ca_topic_score_gemma":0.0006997302,"teacher_disagreement_score":0.0023049419,"about_ca_system_score_codex":0.00046112013,"about_ca_system_score_gemma":0.00040002738,"threshold_uncertainty_score":0.012189865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064576045,0.0026127747,0.9033359,0.0010758109,0.0001019194,0.0009951477,0.01142266,0.009765772,0.006113867],"genre_scores_gemma":[0.1875591,0.0013200461,0.77946305,0.00021432972,0.00007157872,0.0004230184,0.028542556,0.00036664223,0.0020397345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987006,0.0003214294,0.00017032039,0.0004348709,0.0002979417,0.00007466949],"domain_scores_gemma":[0.9974915,0.0015748166,0.00022889904,0.000285538,0.00034847643,0.00007074622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001296755,0.000977404,0.0006956208,0.014043634,0.0009963424,0.0010840766,0.0012452062,0.0011277609,0.003034912],"category_scores_gemma":[0.0059992266,0.0004797214,0.002141124,0.008658275,0.000625974,0.0024781865,0.0014936371,0.00067225064,0.001151313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039124335,0.0004884224,0.011707447,0.0028880902,0.00071707496,0.0021157707,0.001436997,0.046947695,0.04503703,0.04110897,0.025933672,0.82122755],"study_design_scores_gemma":[0.00019672635,0.00030986316,0.0141187,0.00040104438,0.0008878597,0.0021992316,0.0013993378,0.6019555,0.03834428,0.25033158,0.089722484,0.00013340871],"about_ca_topic_score_codex":0.008936291,"about_ca_topic_score_gemma":0.016669065,"teacher_disagreement_score":0.014043634,"about_ca_system_score_codex":0.001008406,"about_ca_system_score_gemma":0.0022675293,"threshold_uncertainty_score":0.017768562},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023208095,0.0002368133,0.97132224,0.00014137586,0.00004822919,0.00011644798,0.00020595545,0.0033852311,0.0013354984],"genre_scores_gemma":[0.3400945,0.000192639,0.6529134,0.00018349689,0.000118238815,0.00030096673,0.001748711,0.00047324222,0.0039748037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980367,0.00050802936,0.0001293478,0.00064094097,0.00055786694,0.00012715533],"domain_scores_gemma":[0.9966827,0.00078713463,0.0002784317,0.0010698534,0.0010423197,0.00013961359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019726409,0.0011293779,0.0013541075,0.0015685107,0.0008718021,0.001300877,0.0022235413,0.0011404586,0.0020489292],"category_scores_gemma":[0.0073414086,0.0004503411,0.0009166433,0.0019857027,0.0008963191,0.0022307744,0.0017951628,0.0017332442,0.0020339196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046751313,0.00032695438,0.0029240565,0.00023927267,0.00020189134,0.00011465133,0.00038437443,0.08059643,0.025274307,0.0074240165,0.012039909,0.8700067],"study_design_scores_gemma":[0.00003825895,0.00008238704,0.00086429407,0.000018065597,0.000045037348,0.00010427509,0.000055724762,0.973424,0.010672913,0.010977823,0.0036869252,0.000030372534],"about_ca_topic_score_codex":0.0033380617,"about_ca_topic_score_gemma":0.0065177362,"teacher_disagreement_score":0.0033380617,"about_ca_system_score_codex":0.0007022878,"about_ca_system_score_gemma":0.001399643,"threshold_uncertainty_score":0.010432482},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010364714,0.00018140588,0.9885733,0.00014842449,0.00003587463,0.00003219003,0.000068914014,0.0004112982,0.00018384065],"genre_scores_gemma":[0.3477226,0.00060614443,0.64851856,0.00024110507,0.00018820738,0.00025500936,0.0008447477,0.0001224007,0.0015012246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991691,0.00018900288,0.00007528885,0.00024944384,0.00025350953,0.000063748],"domain_scores_gemma":[0.996311,0.002275106,0.00044305887,0.00027436606,0.0005969832,0.00009954323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025059485,0.0010482421,0.0015367628,0.0018830567,0.00048291028,0.0013582613,0.0020112914,0.0014534387,0.000657675],"category_scores_gemma":[0.009779128,0.000920961,0.0012124405,0.001817727,0.0005807354,0.0020325622,0.0009983074,0.0019232534,0.00033925864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113639806,0.00009938968,0.005481013,0.00011746828,0.00015386188,0.00017988053,0.00014508938,0.8187918,0.002528223,0.006965954,0.002452438,0.16297121],"study_design_scores_gemma":[0.0000043547734,0.000006731689,0.00011893067,0.0000027513397,0.0000034210555,0.000010172004,0.0000047209573,0.9976495,0.00028449806,0.0016722362,0.0002394421,0.00000323329],"about_ca_topic_score_codex":0.0071818,"about_ca_topic_score_gemma":0.004572781,"teacher_disagreement_score":0.0071818,"about_ca_system_score_codex":0.0007772004,"about_ca_system_score_gemma":0.0010647714,"threshold_uncertainty_score":0.014279962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005371025,0.000214707,0.99036837,0.00028009192,0.0000445316,0.0000690877,0.000024580939,0.0002005531,0.00342714],"genre_scores_gemma":[0.510684,0.00042326347,0.48210523,0.00014263952,0.00019369138,0.00030312678,0.00010455475,0.0000779003,0.0059655826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975268,0.0012210588,0.000108916385,0.0003234496,0.00065488403,0.00016489308],"domain_scores_gemma":[0.99686784,0.0012217752,0.0003403292,0.00053705607,0.0006105285,0.00042246014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003295591,0.00042045774,0.0007802188,0.0012654425,0.0015206792,0.0020048365,0.0022659786,0.0011259103,0.0027013936],"category_scores_gemma":[0.0052020214,0.00041512225,0.00079182466,0.001091124,0.0017886746,0.002974423,0.0026883767,0.0015892559,0.0004813704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006597083,0.00007891744,0.00077903876,0.00014855672,0.0000743838,0.00032815026,0.00057753234,0.24982141,0.0036745653,0.6927069,0.00377959,0.04796498],"study_design_scores_gemma":[0.000016909698,0.000031184885,0.00014068771,0.000012228178,0.000015638394,0.00006534342,0.00006279678,0.91309565,0.00044042902,0.07827709,0.007824471,0.000017580789],"about_ca_topic_score_codex":0.003975065,"about_ca_topic_score_gemma":0.0044144955,"teacher_disagreement_score":0.003975065,"about_ca_system_score_codex":0.0015868313,"about_ca_system_score_gemma":0.0020066518,"threshold_uncertainty_score":0.017428935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016619481,0.00042705826,0.9719534,0.0006258968,0.00020682882,0.00026959745,0.00018323457,0.005637825,0.004076758],"genre_scores_gemma":[0.5895479,0.00044544158,0.4026531,0.0001645024,0.00033999395,0.00036252965,0.00051815156,0.00039292857,0.005575427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99549073,0.0014618124,0.0006159586,0.0007358942,0.0014344095,0.0002612807],"domain_scores_gemma":[0.9878863,0.0032366698,0.0016131428,0.0038495373,0.0023346785,0.001079683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006989662,0.0008425424,0.0014896784,0.0016386587,0.0023443096,0.005736966,0.0035117704,0.0021990184,0.0027257965],"category_scores_gemma":[0.020442355,0.00082265364,0.001204279,0.001826108,0.0014267205,0.0080951275,0.0033696636,0.0022413277,0.0016292878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011826153,0.00069489947,0.0121129975,0.0008252108,0.00077340245,0.001295445,0.0023675042,0.2636371,0.020318964,0.22511908,0.026541505,0.4451312],"study_design_scores_gemma":[0.00012452484,0.00023786766,0.0009842373,0.000053773143,0.00023090084,0.00055078557,0.00009817779,0.91184574,0.0071221977,0.050754394,0.027855394,0.00014199704],"about_ca_topic_score_codex":0.002778728,"about_ca_topic_score_gemma":0.0024445716,"teacher_disagreement_score":0.006989662,"about_ca_system_score_codex":0.0015239103,"about_ca_system_score_gemma":0.002153825,"threshold_uncertainty_score":0.03696531},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02788768,0.0000999384,0.9683556,0.00036256577,0.00003799106,0.00011136649,0.000018198798,0.00034830105,0.0027782584],"genre_scores_gemma":[0.8214505,0.00011400369,0.17494684,0.00015191876,0.000039043436,0.00023914609,0.000037545375,0.000034872803,0.0029861592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903536,0.00045723832,0.000050142124,0.00015822165,0.00019674748,0.00010236585],"domain_scores_gemma":[0.99785703,0.001120824,0.00029865003,0.00015969752,0.0003845318,0.00017918975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019966823,0.0006783883,0.0009198511,0.0004128231,0.00059467234,0.00079418905,0.0018720556,0.0014227674,0.0021792764],"category_scores_gemma":[0.005729437,0.0002910913,0.00032346084,0.0003144961,0.0010562555,0.0015538166,0.0009052516,0.0010416722,0.0004389196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018436098,0.00021901031,0.0018218332,0.0000993873,0.00008813208,0.00018750443,0.00020436698,0.85746384,0.003026517,0.044796836,0.0016420409,0.090266235],"study_design_scores_gemma":[0.000041427294,0.000049446408,0.000066195505,0.000004946515,0.0000073549654,0.000024227713,0.000010070721,0.99206686,0.0003681522,0.006872612,0.00048132113,0.000007344977],"about_ca_topic_score_codex":0.0024503947,"about_ca_topic_score_gemma":0.002331097,"teacher_disagreement_score":0.0024503947,"about_ca_system_score_codex":0.00086161785,"about_ca_system_score_gemma":0.0010569803,"threshold_uncertainty_score":0.010559559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024537507,0.0003216018,0.96557325,0.0020002055,0.00012735698,0.00024462232,0.00045957015,0.002174999,0.0045607965],"genre_scores_gemma":[0.18200514,0.00044207857,0.8126079,0.00045624675,0.000061384264,0.0002274993,0.0011386866,0.00024428676,0.002816722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958046,0.0015401648,0.0004715289,0.0008807463,0.0010384256,0.00026455772],"domain_scores_gemma":[0.98945427,0.0065170303,0.0007824819,0.0020190014,0.0010912083,0.00013602697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004876584,0.001158803,0.0005637788,0.0031840282,0.0011821948,0.0033963944,0.0021616009,0.0018945517,0.0057474445],"category_scores_gemma":[0.024980852,0.00073421665,0.0019824791,0.0017364557,0.0018855005,0.0055208993,0.0040381295,0.0017592225,0.0009030587],"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.00026135292,0.00020040285,0.011233995,0.0007556276,0.00035215297,0.002561884,0.0038687522,0.049317617,0.007628854,0.556958,0.009624325,0.35723695],"study_design_scores_gemma":[0.000081368824,0.00006525286,0.001357705,0.000277177,0.00025722204,0.00078542356,0.0010393509,0.21655732,0.015149556,0.72331196,0.04106041,0.00005721278],"about_ca_topic_score_codex":0.002764794,"about_ca_topic_score_gemma":0.004899411,"teacher_disagreement_score":0.0057474445,"about_ca_system_score_codex":0.0011042672,"about_ca_system_score_gemma":0.0022430196,"threshold_uncertainty_score":0.025790155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021270716,0.001322231,0.9440297,0.00094642193,0.00027311605,0.0011273578,0.0006991017,0.0121895345,0.037285548],"genre_scores_gemma":[0.029352086,0.002467038,0.9410926,0.00045223298,0.00014473448,0.0023429422,0.0025483137,0.0012651813,0.020334838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99784136,0.00060034794,0.00024754152,0.00023248565,0.00088506704,0.00019313296],"domain_scores_gemma":[0.9990722,0.0002428626,0.00007549955,0.00012472892,0.00026445484,0.00022022692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027597148,0.0010986954,0.0010703233,0.002355594,0.0013838541,0.0034957458,0.002924458,0.002303942,0.006504399],"category_scores_gemma":[0.0028386482,0.00092259195,0.0011733527,0.0024510592,0.0012004274,0.0027147506,0.0024944453,0.002610355,0.0071898215],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018473486,0.00033430243,0.0007398307,0.00094964984,0.00015565763,0.0014440962,0.0011260547,0.03845484,0.015094677,0.6501884,0.05941788,0.2319099],"study_design_scores_gemma":[0.00014378842,0.00012038196,0.00034917722,0.00025391218,0.00005499443,0.000976459,0.00015446915,0.076960504,0.0056774383,0.12288314,0.79230976,0.00011598945],"about_ca_topic_score_codex":0.0062386245,"about_ca_topic_score_gemma":0.004208564,"teacher_disagreement_score":0.006504399,"about_ca_system_score_codex":0.0014051402,"about_ca_system_score_gemma":0.0051673315,"threshold_uncertainty_score":0.021759331},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01195673,0.00023221648,0.97937256,0.0013662342,0.000015763337,0.00011861747,0.000154044,0.00020982273,0.006574051],"genre_scores_gemma":[0.332045,0.00046629223,0.6644256,0.00024020184,0.000034496905,0.00026741487,0.0002596183,0.000058431535,0.0022028773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961021,0.0026224388,0.00009720144,0.00025129245,0.0007598539,0.00016702994],"domain_scores_gemma":[0.9901689,0.008336745,0.00030421373,0.0005776543,0.00043393124,0.00017863724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034826812,0.0008199821,0.00071754307,0.0016981233,0.0010202456,0.0021763046,0.0020804943,0.0028397848,0.0034346583],"category_scores_gemma":[0.01048732,0.00055473734,0.0016999721,0.0017798218,0.0029162364,0.0028302558,0.0022312626,0.002554302,0.00037637228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008141146,0.00018321177,0.000813401,0.00015263456,0.000051890398,0.00093411765,0.0005617471,0.4419171,0.0011657455,0.5073325,0.002317089,0.044489164],"study_design_scores_gemma":[0.00004377222,0.000045928617,0.00019043201,0.00003267332,0.000030422778,0.00028083354,0.00015105844,0.8277282,0.0013406682,0.16223048,0.007899201,0.000026436961],"about_ca_topic_score_codex":0.005398114,"about_ca_topic_score_gemma":0.0065163006,"teacher_disagreement_score":0.005398114,"about_ca_system_score_codex":0.0017585092,"about_ca_system_score_gemma":0.0014938753,"threshold_uncertainty_score":0.018418431},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011606399,0.00013781474,0.9869082,0.00011993151,0.000024694285,0.000030390602,0.000025219093,0.00037707636,0.0007703395],"genre_scores_gemma":[0.57971203,0.00023806866,0.41734824,0.00014368574,0.00005696884,0.00012989136,0.00014007432,0.000059509046,0.002171503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990086,0.0002769144,0.000065576896,0.00017338282,0.00039766525,0.00007788065],"domain_scores_gemma":[0.9967604,0.0018426153,0.00032177163,0.00047488237,0.00051433675,0.00008591242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015054002,0.00058808335,0.0011264359,0.0006481178,0.0005906657,0.00094501965,0.0017681852,0.0010265391,0.0015948632],"category_scores_gemma":[0.007474215,0.0005215488,0.00050249306,0.0007078545,0.00071117375,0.0021439327,0.0013004693,0.0010578986,0.00029500775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015054415,0.000042645595,0.0009257494,0.00009351387,0.000065563654,0.000114045775,0.00014637358,0.8177557,0.0035835123,0.025011092,0.001305105,0.15080616],"study_design_scores_gemma":[0.000010790519,0.000014534707,0.000069697104,0.000003238017,0.0000075564158,0.000021746742,0.000008460412,0.98943067,0.0010280814,0.008817723,0.00058196776,0.000005434425],"about_ca_topic_score_codex":0.0037752253,"about_ca_topic_score_gemma":0.0040690303,"teacher_disagreement_score":0.0037752253,"about_ca_system_score_codex":0.00070951896,"about_ca_system_score_gemma":0.0011141155,"threshold_uncertainty_score":0.007961452},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07804275,0.0013109454,0.8782843,0.001668914,0.00023963724,0.00085060846,0.009735822,0.020989692,0.008877316],"genre_scores_gemma":[0.23463675,0.0009853978,0.7396924,0.00044592988,0.00016523451,0.00044141186,0.019288056,0.0011921191,0.0031527232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975101,0.0004505029,0.0004946021,0.00069051486,0.00073120004,0.00012315136],"domain_scores_gemma":[0.98998195,0.006595883,0.0011650722,0.0007027249,0.0013800337,0.00017429753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027240887,0.0015452823,0.0012698342,0.005684592,0.0011879604,0.0024321768,0.0014547195,0.0014910365,0.005068121],"category_scores_gemma":[0.011287622,0.00067235285,0.0015263719,0.0030079973,0.00076187775,0.0052468763,0.0021684852,0.0016251148,0.003235477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008958472,0.0004381663,0.017067757,0.002782919,0.0002348051,0.0030148898,0.0022807945,0.00895757,0.12743741,0.03917006,0.03785856,0.75986123],"study_design_scores_gemma":[0.00024538906,0.00028920788,0.019474972,0.00070856855,0.000667293,0.0048775543,0.002119848,0.41167212,0.29295537,0.13918442,0.12750275,0.00030251578],"about_ca_topic_score_codex":0.0013075311,"about_ca_topic_score_gemma":0.002366519,"teacher_disagreement_score":0.005684592,"about_ca_system_score_codex":0.0010889895,"about_ca_system_score_gemma":0.0024709206,"threshold_uncertainty_score":0.016954541},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008711969,0.000781745,0.98024243,0.0005482274,0.000026013473,0.00008617908,0.000120915465,0.000103152015,0.009379316],"genre_scores_gemma":[0.48611826,0.0025654717,0.50431126,0.00043050476,0.00023381965,0.00054799474,0.000376748,0.00007427138,0.0053416323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708587,0.0016679668,0.000098576056,0.00037435937,0.00062119524,0.0001521607],"domain_scores_gemma":[0.9979971,0.0012130324,0.00017909241,0.00023419704,0.0002996386,0.00007687712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003075158,0.0010985982,0.0010240205,0.0024317212,0.00056036375,0.0033046235,0.0019039134,0.0013074043,0.0030318333],"category_scores_gemma":[0.005893912,0.000528184,0.0010138076,0.00317813,0.0013373456,0.005581413,0.001102492,0.0014736383,0.00060931075],"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.00004986605,0.00010407637,0.0014185039,0.00017128456,0.0001111972,0.00020927805,0.00041668257,0.07598878,0.001184374,0.8289847,0.002271424,0.08908986],"study_design_scores_gemma":[0.00003001595,0.00010354944,0.0010975123,0.00005634263,0.000044510543,0.00024363576,0.00013105366,0.48782703,0.0005390506,0.5010578,0.008816224,0.00005317002],"about_ca_topic_score_codex":0.0025752322,"about_ca_topic_score_gemma":0.002021173,"teacher_disagreement_score":0.0033046235,"about_ca_system_score_codex":0.0013952286,"about_ca_system_score_gemma":0.001137384,"threshold_uncertainty_score":0.016263127},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084158283,0.05600054,0.008528336,0.11378393,0.4158003,0.00024996788,0.004799193,0.00089083624,0.39910525],"genre_scores_gemma":[0.010364855,0.07095749,0.0065829605,0.02601245,0.095990196,0.0001601763,0.00549493,0.0013735569,0.7830634],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980241,0.00016022344,0.000115148905,0.00022364238,0.0012050959,0.00027179834],"domain_scores_gemma":[0.99322104,0.00074274425,0.00013929611,0.00036704674,0.004397841,0.0011319764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024810007,0.0013314601,0.0012703914,0.00929425,0.005763828,0.008671755,0.0020109746,0.0032498767,0.1248297],"category_scores_gemma":[0.007464935,0.0005636984,0.00098836,0.01064611,0.0022256062,0.006853855,0.0028815742,0.0043245484,0.02782723],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067484834,0.0000057929583,0.00006148184,0.00006541469,0.0000027319747,0.00004065155,0.000038941314,0.00005628058,0.00006287726,0.010097614,0.9740258,0.0155357],"study_design_scores_gemma":[0.0000010803686,9.98128e-7,0.000102264814,0.000042691507,0.0000022844981,0.000030185085,0.000037540267,0.00004025789,0.000026980022,0.0016303988,0.9980798,0.0000054460015],"about_ca_topic_score_codex":0.42074057,"about_ca_topic_score_gemma":0.6289379,"teacher_disagreement_score":0.9856738,"about_ca_system_score_codex":0.014326232,"about_ca_system_score_gemma":0.024324628,"threshold_uncertainty_score":0.8365832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002362208,0.008259464,0.97829616,0.0009756722,0.00038333918,0.00004229843,0.000066652174,0.00024072746,0.009373419],"genre_scores_gemma":[0.24470387,0.023391075,0.71829283,0.0008114193,0.0021386796,0.0003225384,0.00033628943,0.00016286944,0.0098404465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985405,0.0004959232,0.00012112565,0.00021108358,0.00056167704,0.00006961143],"domain_scores_gemma":[0.99844307,0.0010018551,0.0000905601,0.0001931293,0.00023574961,0.000035637735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020291014,0.00081811403,0.0015428968,0.0016556927,0.00052175985,0.0032143875,0.0010864426,0.0015082684,0.0024922001],"category_scores_gemma":[0.0056953686,0.00039718868,0.0010324715,0.0021296283,0.0023631915,0.0025533403,0.0014203382,0.0024132356,0.001173962],"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.000046226764,0.000025080404,0.00040230568,0.0005114887,0.0001147083,0.00023179792,0.00026137757,0.14832139,0.0026332724,0.6837577,0.0055077733,0.15818685],"study_design_scores_gemma":[0.000013094486,0.000038429553,0.00025884112,0.00009949897,0.000026422646,0.00011822242,0.00005619446,0.3918622,0.0011240666,0.5824651,0.023900226,0.00003768151],"about_ca_topic_score_codex":0.001715173,"about_ca_topic_score_gemma":0.0010364698,"teacher_disagreement_score":0.0032143875,"about_ca_system_score_codex":0.00096698874,"about_ca_system_score_gemma":0.0006485386,"threshold_uncertainty_score":0.010731041},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056127626,0.00016759385,0.9882515,0.00045000762,0.00004167792,0.000057290694,0.00005817181,0.0001932538,0.005167724],"genre_scores_gemma":[0.67431873,0.00046927223,0.3185502,0.0001432808,0.00020654919,0.0002650638,0.00015449944,0.0001145215,0.0057779355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589336,0.0019333778,0.00018834767,0.0005802836,0.0011241387,0.00028053045],"domain_scores_gemma":[0.9951107,0.0019898226,0.0008493099,0.0007943695,0.0009397732,0.00031600308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043718615,0.0005750037,0.00083805644,0.0016013455,0.0011962514,0.0031634022,0.0020649561,0.0010751591,0.0020998889],"category_scores_gemma":[0.0106174005,0.0004090651,0.0013027702,0.00118919,0.0022991595,0.004115736,0.0024632378,0.0017255652,0.0003741286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003499786,0.000038322993,0.0010991403,0.00006110014,0.00008069388,0.00019682272,0.00030482057,0.17624283,0.0009168789,0.7971607,0.0019015373,0.0219622],"study_design_scores_gemma":[0.000020064268,0.000038114893,0.0004165809,0.000014623205,0.000034092052,0.00009852555,0.000080092075,0.78385305,0.00041508625,0.20874996,0.006253543,0.000026254931],"about_ca_topic_score_codex":0.005980778,"about_ca_topic_score_gemma":0.0028369452,"teacher_disagreement_score":0.005980778,"about_ca_system_score_codex":0.0032932628,"about_ca_system_score_gemma":0.002313601,"threshold_uncertainty_score":0.02389437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002921442,0.00017810123,0.99522334,0.00007426459,0.000118086304,0.00023709369,0.000093133836,0.00085117266,0.00030342911],"genre_scores_gemma":[0.033927545,0.00018079155,0.9633854,0.00008011689,0.00018130799,0.0005992955,0.00040377484,0.00014731873,0.0010944594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994822,0.002018905,0.00037953246,0.0009162609,0.0017013577,0.00016193152],"domain_scores_gemma":[0.99542904,0.0017424197,0.00038553725,0.0013033684,0.0010118827,0.00012777683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009075864,0.0013516581,0.0017271634,0.003678196,0.0011394954,0.0013001127,0.0018742408,0.0012855277,0.0022854828],"category_scores_gemma":[0.016805515,0.0005350061,0.0019788567,0.003216411,0.0009281844,0.0019398789,0.0017450899,0.002361783,0.0016516037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030297937,0.0002610782,0.0020924844,0.00027477072,0.00043728124,0.00012565579,0.00030060436,0.033785928,0.015083412,0.01123307,0.0090489695,0.92705375],"study_design_scores_gemma":[0.00016260539,0.00052514946,0.00468505,0.000101000296,0.00029072704,0.00072058575,0.0001722808,0.894112,0.031480167,0.033773523,0.033797722,0.000179129],"about_ca_topic_score_codex":0.0013407762,"about_ca_topic_score_gemma":0.002488831,"teacher_disagreement_score":0.009075864,"about_ca_system_score_codex":0.00055207673,"about_ca_system_score_gemma":0.0010190216,"threshold_uncertainty_score":0.04799831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079111695,0.00034592755,0.87301236,0.0022141612,0.000099983445,0.00087605213,0.00035088757,0.00053546816,0.04345347],"genre_scores_gemma":[0.7069485,0.00028249255,0.2800834,0.00025868666,0.00005794737,0.00066468935,0.00042727287,0.00015419055,0.011122846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9867617,0.007809869,0.0006165495,0.00076302775,0.0030775194,0.0009714914],"domain_scores_gemma":[0.9855747,0.00982428,0.0009882085,0.0022943895,0.00075264904,0.00056579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015194129,0.0008456817,0.00092020223,0.0011159504,0.0027534096,0.0043341415,0.0025352584,0.002494673,0.008107531],"category_scores_gemma":[0.025063703,0.0007489314,0.00094369345,0.0022586756,0.0025715418,0.007775414,0.0053978376,0.001832963,0.0015886077],"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.0009244395,0.0003809558,0.0018969515,0.00026035093,0.00019570709,0.0014172054,0.0017037372,0.10760993,0.0057451148,0.7758085,0.009092004,0.09496506],"study_design_scores_gemma":[0.00019004774,0.00017590226,0.00040364216,0.000055825625,0.000046659094,0.0003544828,0.0007653149,0.3336345,0.006602733,0.62878245,0.028914742,0.00007373242],"about_ca_topic_score_codex":0.001989347,"about_ca_topic_score_gemma":0.0027447517,"teacher_disagreement_score":0.015194129,"about_ca_system_score_codex":0.0018135485,"about_ca_system_score_gemma":0.002642252,"threshold_uncertainty_score":0.08035523},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019777725,0.00054326694,0.98911846,0.0013727598,0.00013521436,0.000075970216,0.00026976864,0.0007140469,0.0057926117],"genre_scores_gemma":[0.089453705,0.0014995254,0.8998596,0.0020097045,0.0003817936,0.00017111217,0.0011931239,0.00047662386,0.0049548633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937535,0.0017311502,0.00076637923,0.00114169,0.002420653,0.00018666704],"domain_scores_gemma":[0.98819333,0.006093216,0.0006776309,0.0033379076,0.0013869042,0.00031109664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007245917,0.00055214623,0.0007674697,0.001748841,0.0008950155,0.005331798,0.002702406,0.0012142672,0.0028459218],"category_scores_gemma":[0.010231861,0.0010841102,0.0018834003,0.0022340487,0.0043959455,0.008955112,0.00372353,0.0036205961,0.0014035733],"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.00006282839,0.00008087074,0.00096285046,0.00044255925,0.000076655575,0.00039100103,0.00037295048,0.0051700915,0.004485539,0.83117336,0.007721551,0.14905982],"study_design_scores_gemma":[0.000040546012,0.000072805204,0.00044250005,0.00020819461,0.00009384693,0.0011139769,0.0001616157,0.073767915,0.014864604,0.72420335,0.18496656,0.00006420871],"about_ca_topic_score_codex":0.002809023,"about_ca_topic_score_gemma":0.002894348,"teacher_disagreement_score":0.007245917,"about_ca_system_score_codex":0.0015224012,"about_ca_system_score_gemma":0.0023452009,"threshold_uncertainty_score":0.03832048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013625016,0.00006908922,0.98383266,0.00016032657,0.000010648255,0.000070275535,0.000007394805,0.00026636434,0.0019582626],"genre_scores_gemma":[0.61638665,0.00020845546,0.38095975,0.0001348984,0.000032915952,0.00023881855,0.000045472727,0.000064905136,0.0019281929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874854,0.00061960577,0.00007453476,0.00024103245,0.00022525156,0.000091010996],"domain_scores_gemma":[0.9968078,0.0016389847,0.00043176077,0.0006857577,0.00029344446,0.00014238658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017618379,0.0007690507,0.00081340806,0.00031244717,0.00047088455,0.0011260214,0.0015103316,0.0013411051,0.0013724446],"category_scores_gemma":[0.0067723133,0.00044997293,0.00070295786,0.00031948948,0.0010087187,0.0023277025,0.0009788264,0.0011156847,0.00067137886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011221887,0.00023949912,0.0028115062,0.00018694665,0.00015890608,0.00015878322,0.00039962493,0.78004885,0.013176612,0.086198375,0.00082453823,0.11568418],"study_design_scores_gemma":[0.000028547354,0.00008496939,0.00016779028,0.0000084346,0.00002504687,0.00006121656,0.000020089998,0.98461676,0.0017610518,0.011658106,0.0015516889,0.000016240976],"about_ca_topic_score_codex":0.0018847504,"about_ca_topic_score_gemma":0.0023056944,"teacher_disagreement_score":0.0018847504,"about_ca_system_score_codex":0.0005650828,"about_ca_system_score_gemma":0.001131745,"threshold_uncertainty_score":0.009317577},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005326127,0.0057465155,0.95234436,0.0008815071,0.00028361875,0.0001208892,0.00006339323,0.00032363815,0.034909923],"genre_scores_gemma":[0.30244574,0.012785481,0.6746517,0.0006243736,0.0005411579,0.00030665263,0.00021730985,0.00015627377,0.008271327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979505,0.0008601897,0.00009804231,0.00022878389,0.0007643648,0.000098224984],"domain_scores_gemma":[0.9979528,0.001390604,0.00013284839,0.00025845357,0.00021189572,0.000053357595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018844904,0.001220883,0.001312562,0.0023733433,0.00089446094,0.0022673113,0.0014442427,0.0017210739,0.0037716546],"category_scores_gemma":[0.00718061,0.00046779757,0.0014746225,0.0025495212,0.0018034934,0.0016595615,0.0022229415,0.0017556121,0.0011263834],"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.00003898575,0.000056781137,0.0009595905,0.00036028135,0.00017700189,0.0003088004,0.00041565686,0.28585088,0.0015592627,0.50372905,0.003006539,0.20353723],"study_design_scores_gemma":[0.000031811414,0.00007244564,0.00036761473,0.00015436391,0.000069393776,0.00034624996,0.00012768485,0.32014555,0.0012819542,0.63198954,0.045365844,0.000047549085],"about_ca_topic_score_codex":0.0018282562,"about_ca_topic_score_gemma":0.0013282102,"teacher_disagreement_score":0.0037716546,"about_ca_system_score_codex":0.0010357547,"about_ca_system_score_gemma":0.0009977492,"threshold_uncertainty_score":0.012617469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02504633,0.00022966703,0.9731117,0.000111545654,0.00001845246,0.00012647653,0.00019665455,0.0005020448,0.0006572441],"genre_scores_gemma":[0.19170047,0.00025065255,0.8059132,0.00008684471,0.00003403318,0.0002997153,0.0012104339,0.000050866118,0.00045377918],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971396,0.00072227576,0.00038860913,0.0005247039,0.0010693893,0.00015555657],"domain_scores_gemma":[0.99659234,0.0018931647,0.00029320424,0.0007447268,0.00041942994,0.00005721299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023276363,0.00084758387,0.0018003149,0.001922631,0.00063842005,0.0016426631,0.0012627058,0.0005592603,0.0011033813],"category_scores_gemma":[0.008222399,0.0006310879,0.002221304,0.0018674922,0.0008677536,0.0020453425,0.001649377,0.001222014,0.00039604775],"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.00016501313,0.00021204297,0.0047689904,0.000415412,0.0002965914,0.00045258316,0.0005039549,0.19687879,0.007964232,0.030908098,0.0027978905,0.75463635],"study_design_scores_gemma":[0.000050971004,0.00017543329,0.0011574541,0.00006949803,0.00011581796,0.00019170382,0.00014890393,0.8641619,0.008407483,0.12113564,0.0043322504,0.000052902786],"about_ca_topic_score_codex":0.0021111418,"about_ca_topic_score_gemma":0.002402229,"teacher_disagreement_score":0.0023276363,"about_ca_system_score_codex":0.00060349307,"about_ca_system_score_gemma":0.0013181291,"threshold_uncertainty_score":0.012309849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1321987,0.00086027035,0.7681553,0.0044390303,0.0014252653,0.0041715046,0.019991456,0.007718172,0.06104025],"genre_scores_gemma":[0.504193,0.000529061,0.43990242,0.0012892593,0.00051789865,0.0043379962,0.027917046,0.0013743885,0.019938936],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9925218,0.0032299317,0.0005862102,0.0012080267,0.0021858176,0.00026808155],"domain_scores_gemma":[0.9810643,0.0096487375,0.0011173314,0.002770295,0.0048491177,0.00055024103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006199582,0.0014068915,0.0009753044,0.005771454,0.0023362383,0.0028067492,0.0013023199,0.0011904524,0.006337135],"category_scores_gemma":[0.0290142,0.00057660684,0.0012599516,0.0040083225,0.001156701,0.00319832,0.004650285,0.0016898843,0.004142233],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016501955,0.0008002233,0.020157123,0.0025360603,0.00041115002,0.0018886314,0.011829038,0.02388756,0.10463715,0.050976604,0.14487909,0.6363473],"study_design_scores_gemma":[0.00047420192,0.0003897514,0.024684979,0.00057954394,0.00037291058,0.00094863673,0.010841203,0.35819522,0.051646136,0.19935684,0.35204664,0.000464031],"about_ca_topic_score_codex":0.0040632086,"about_ca_topic_score_gemma":0.0076778177,"teacher_disagreement_score":0.006337135,"about_ca_system_score_codex":0.0015808195,"about_ca_system_score_gemma":0.0025940507,"threshold_uncertainty_score":0.032786906},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015488891,0.0025373776,0.97110724,0.00036667797,0.00014441027,0.0013577726,0.0021442096,0.0038922995,0.0029611532],"genre_scores_gemma":[0.09835405,0.0012617576,0.8936547,0.00012577958,0.00012081186,0.0016456428,0.003320852,0.0006261705,0.000890224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9642103,0.0063395305,0.0064907284,0.0018270247,0.020375954,0.0007565354],"domain_scores_gemma":[0.9004384,0.059065674,0.007181399,0.009956014,0.022556666,0.0008018128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024743984,0.0020020476,0.0022109014,0.007686778,0.00076426537,0.004307127,0.0037313725,0.0019306733,0.0037602906],"category_scores_gemma":[0.11431239,0.0007645375,0.0015915139,0.006998561,0.0011105632,0.0055101886,0.0015897668,0.0020414384,0.0015178858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055907597,0.000642451,0.010262227,0.002559785,0.0003952564,0.000251148,0.0004363759,0.08027925,0.008387779,0.030170266,0.015030166,0.85102624],"study_design_scores_gemma":[0.00022559999,0.0012012479,0.0069053676,0.00061332743,0.0003233818,0.001267287,0.00028990742,0.8876242,0.03644769,0.04137087,0.023514481,0.00021663526],"about_ca_topic_score_codex":0.002355084,"about_ca_topic_score_gemma":0.002000919,"teacher_disagreement_score":0.024743984,"about_ca_system_score_codex":0.0022366215,"about_ca_system_score_gemma":0.0022197687,"threshold_uncertainty_score":0.13086027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4223762,0.0014278493,0.542561,0.0061844746,0.00009643944,0.0004929557,0.0007046176,0.0009082529,0.025248257],"genre_scores_gemma":[0.68452775,0.0006190786,0.31108707,0.00019136013,0.000024283185,0.00016747201,0.00043512988,0.000103600694,0.0028442056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969658,0.0017761482,0.00012690121,0.00020460972,0.00078937545,0.00013712345],"domain_scores_gemma":[0.98821473,0.009540795,0.00046022536,0.00094865024,0.00055173057,0.00028386022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040192185,0.00066637737,0.00043436544,0.0013141212,0.0021771227,0.0026443515,0.0022408713,0.0034597407,0.0024857149],"category_scores_gemma":[0.015051165,0.0004120482,0.0009716196,0.0017552276,0.0031867449,0.0036815682,0.0017922027,0.0020995932,0.00043955605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013423028,0.002432421,0.03961654,0.0010869215,0.0002476715,0.040146217,0.027812118,0.18655647,0.014984894,0.3363795,0.02042408,0.32897085],"study_design_scores_gemma":[0.00035893387,0.00052673137,0.006724486,0.00042857908,0.00013993004,0.015067932,0.008859299,0.7164521,0.025765603,0.16232108,0.0631941,0.00016135118],"about_ca_topic_score_codex":0.0090644,"about_ca_topic_score_gemma":0.010517964,"teacher_disagreement_score":0.0090644,"about_ca_system_score_codex":0.0015596027,"about_ca_system_score_gemma":0.0010410973,"threshold_uncertainty_score":0.02125591},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003341193,0.21651538,0.44457108,0.016456142,0.010549711,0.00041332186,0.001349605,0.0010864437,0.30571714],"genre_scores_gemma":[0.05907532,0.3038722,0.37534568,0.012094583,0.015032753,0.0007094332,0.0013894459,0.0006707909,0.23180982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999236,0.0001592522,0.00007780883,0.00012692504,0.00033294616,0.00006711232],"domain_scores_gemma":[0.99875593,0.00083804864,0.000048070404,0.000115950206,0.00018275047,0.00005919306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008048728,0.0010144182,0.00070552796,0.0021678128,0.0008190688,0.0019871425,0.0008337172,0.002371842,0.023950515],"category_scores_gemma":[0.0023086197,0.00071618357,0.0008952799,0.0032224183,0.0019888936,0.003533233,0.0013541075,0.0047381227,0.009075118],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045548535,0.00011665863,0.00043465098,0.0010013189,0.000050531664,0.00037202318,0.00032360796,0.0043271123,0.0042958637,0.5015149,0.113067195,0.3744506],"study_design_scores_gemma":[0.000010247291,0.000049519953,0.0004412891,0.00036313818,0.000012540179,0.00081358297,0.000038591785,0.0023851711,0.0010346373,0.273605,0.72120005,0.000046276586],"about_ca_topic_score_codex":0.00061326026,"about_ca_topic_score_gemma":0.00072991394,"teacher_disagreement_score":0.023950515,"about_ca_system_score_codex":0.0008389369,"about_ca_system_score_gemma":0.00076261576,"threshold_uncertainty_score":0.08012247},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025032703,0.000050312254,0.9965592,0.000041618536,0.000013877761,0.00004901403,0.000015796631,0.00031670002,0.00045021556],"genre_scores_gemma":[0.05128517,0.000070605136,0.94711083,0.000042323732,0.00001284908,0.00013556749,0.00012936114,0.000114749346,0.0010984999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980428,0.00053691765,0.00020176212,0.00039287185,0.00070511276,0.000120396566],"domain_scores_gemma":[0.9978586,0.00089374156,0.00018362318,0.00026964897,0.00069011614,0.000104189814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002276895,0.00064373255,0.0009868358,0.0021971285,0.0014105755,0.0019498356,0.0020237216,0.0019524335,0.0033397183],"category_scores_gemma":[0.008493575,0.0005953208,0.0009989695,0.0023602948,0.0008405649,0.004494913,0.0024819945,0.0014727217,0.0014328212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014959066,0.00016852631,0.001350409,0.00020251588,0.00009862138,0.0001597262,0.0004784601,0.26777828,0.00711806,0.12442804,0.004553651,0.5935141],"study_design_scores_gemma":[0.000020091751,0.00005257203,0.00017753658,0.000015017848,0.000016305314,0.00008057313,0.00006286944,0.93410265,0.0027418833,0.05836041,0.004353633,0.000016521588],"about_ca_topic_score_codex":0.0037798353,"about_ca_topic_score_gemma":0.003522528,"teacher_disagreement_score":0.0037798353,"about_ca_system_score_codex":0.0013993698,"about_ca_system_score_gemma":0.0017264304,"threshold_uncertainty_score":0.012041509},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07868833,0.0005873659,0.880187,0.00031808013,0.00008167427,0.00037663186,0.00041714162,0.034756046,0.0045876745],"genre_scores_gemma":[0.5297881,0.00047561273,0.45681822,0.00027233383,0.00012972574,0.00036019483,0.0012775885,0.00047780902,0.010400434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944955,0.00008156731,0.000041522748,0.00015132091,0.00022533207,0.000050632483],"domain_scores_gemma":[0.9985661,0.00053599296,0.00008837477,0.0002722462,0.00041039902,0.0001268852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009760118,0.0005290686,0.00083317637,0.0011057041,0.0004619036,0.0011778588,0.0017347927,0.00069803506,0.0033831466],"category_scores_gemma":[0.0034167625,0.00037297996,0.00039876183,0.0010630662,0.00028829294,0.0024207283,0.0008889536,0.0006479572,0.0018043383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020865847,0.0007780054,0.010129464,0.0004449657,0.00019770021,0.00040949788,0.0005829159,0.01661196,0.09145075,0.00824573,0.016389873,0.8526726],"study_design_scores_gemma":[0.00016190714,0.00075228146,0.004117155,0.000026143523,0.00015770683,0.0010149478,0.00012710405,0.921125,0.042385213,0.0052603926,0.024783641,0.000088441724],"about_ca_topic_score_codex":0.0028559582,"about_ca_topic_score_gemma":0.003906736,"teacher_disagreement_score":0.0033831466,"about_ca_system_score_codex":0.00038333872,"about_ca_system_score_gemma":0.00080814905,"threshold_uncertainty_score":0.01131779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03135028,0.0018189907,0.9413355,0.0038082819,0.00012830932,0.00015179817,0.00044123014,0.00015857464,0.020806994],"genre_scores_gemma":[0.7272418,0.005803699,0.24689023,0.0009962209,0.0013263723,0.0009147043,0.0014836924,0.0003315681,0.015011782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983608,0.0004091399,0.00008258219,0.0002637559,0.00062976294,0.00025381322],"domain_scores_gemma":[0.9891167,0.009387152,0.00050957984,0.00037510652,0.00041894332,0.00019243955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012544553,0.0012089981,0.0011640604,0.0012586106,0.0010201184,0.0024686614,0.001834741,0.0018291292,0.007493979],"category_scores_gemma":[0.012254848,0.0006481715,0.0016234764,0.0016179103,0.0026547874,0.006119111,0.0019274591,0.0027793956,0.0007042845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015873884,0.00013701367,0.00095052476,0.00068783946,0.000091213085,0.00023685108,0.0003012655,0.5364147,0.0034089563,0.4109903,0.008179678,0.038442913],"study_design_scores_gemma":[0.000024477904,0.00005753271,0.00060700654,0.000033103097,0.000031486445,0.00011584049,0.000060556882,0.7232742,0.0008642536,0.2717539,0.0031547945,0.000022840364],"about_ca_topic_score_codex":0.0038150796,"about_ca_topic_score_gemma":0.0028403506,"teacher_disagreement_score":0.007493979,"about_ca_system_score_codex":0.003083805,"about_ca_system_score_gemma":0.0017737258,"threshold_uncertainty_score":0.025069833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014037429,0.00032433262,0.97799,0.00078550796,0.000060822764,0.00012718052,0.00027249858,0.000662944,0.0057393787],"genre_scores_gemma":[0.21019113,0.00058586814,0.7834145,0.00086680794,0.00017996642,0.0003762105,0.0008607402,0.00011552413,0.0034092998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99211687,0.0026172518,0.0011078438,0.0012108146,0.0023064995,0.0006407389],"domain_scores_gemma":[0.9929583,0.0041451748,0.0006048471,0.0013874273,0.000601489,0.0003027983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009563467,0.0012143857,0.0012961833,0.0032851775,0.0019914326,0.005619117,0.0038929435,0.0030064103,0.0043756925],"category_scores_gemma":[0.010156648,0.0014818367,0.004106012,0.0025347508,0.0060149254,0.014019687,0.0060371663,0.0055897557,0.00073914946],"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.000116113566,0.00009737886,0.000914529,0.0002223549,0.0001259029,0.00044479605,0.0010239094,0.025179548,0.0025069495,0.9343417,0.0019784153,0.033048466],"study_design_scores_gemma":[0.000045043536,0.000029570489,0.00012256953,0.00004939319,0.00006485174,0.00012965915,0.00011676664,0.038289163,0.002656155,0.95326275,0.005199869,0.00003430734],"about_ca_topic_score_codex":0.003873052,"about_ca_topic_score_gemma":0.005212238,"teacher_disagreement_score":0.009563467,"about_ca_system_score_codex":0.003409895,"about_ca_system_score_gemma":0.0019316071,"threshold_uncertainty_score":0.050577044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011208439,0.00023088191,0.98562443,0.00026041566,0.00008077394,0.00016469965,0.00030032633,0.0013442804,0.00078582315],"genre_scores_gemma":[0.24624375,0.0005369655,0.7453707,0.0003366738,0.00020992536,0.0011297903,0.0018042072,0.00017222465,0.0041958415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993637,0.00015256317,0.000060678718,0.00015541159,0.000227983,0.000039618484],"domain_scores_gemma":[0.99898237,0.0004283587,0.00007120575,0.00008491247,0.00040220184,0.00003097868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013310012,0.0008535059,0.0009180296,0.0014950209,0.0004261447,0.0009968873,0.00155373,0.0010091364,0.0019032675],"category_scores_gemma":[0.003019782,0.0002955026,0.0010992059,0.0012355921,0.0004004305,0.0031179592,0.0006472496,0.00086483516,0.0014249452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044440618,0.00066734524,0.0029254907,0.0005928369,0.00021243237,0.00036296638,0.000532882,0.17198156,0.040539127,0.049711604,0.015675852,0.71635354],"study_design_scores_gemma":[0.000019619209,0.00007909678,0.00033341523,0.000014515924,0.0000367769,0.00009696013,0.00002740387,0.9810636,0.0032459463,0.012223769,0.0028425436,0.00001635795],"about_ca_topic_score_codex":0.0026261879,"about_ca_topic_score_gemma":0.003002922,"teacher_disagreement_score":0.0026261879,"about_ca_system_score_codex":0.0008615638,"about_ca_system_score_gemma":0.0013254661,"threshold_uncertainty_score":0.00703907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028146092,0.00063242146,0.9650881,0.00022884634,0.00009358824,0.0007972686,0.0009756659,0.0028843698,0.0011535421],"genre_scores_gemma":[0.15709251,0.00033176132,0.8361358,0.00020640905,0.000110476685,0.0012688038,0.0027596557,0.00019002566,0.0019046229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997898,0.0005709974,0.0003870305,0.00044564888,0.00056656415,0.0001318175],"domain_scores_gemma":[0.9973259,0.00091957767,0.00019197867,0.0002405558,0.0012307309,0.00009118573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016465919,0.0014441381,0.0017516796,0.0049436893,0.0006792031,0.0011466541,0.0013045309,0.0010281429,0.0033725486],"category_scores_gemma":[0.0048685144,0.00046065505,0.0011255377,0.004691612,0.00044951765,0.0023939824,0.0008494055,0.00077434105,0.0032637739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042625834,0.0002469761,0.0029040033,0.000748839,0.00019192301,0.00043398084,0.000601656,0.0028805165,0.08757214,0.003694803,0.0067995396,0.8934994],"study_design_scores_gemma":[0.000566257,0.002014619,0.023180556,0.00025905066,0.0010419507,0.004101768,0.002232263,0.61095023,0.24058695,0.04175271,0.07284662,0.00046709902],"about_ca_topic_score_codex":0.0013121639,"about_ca_topic_score_gemma":0.0014213767,"teacher_disagreement_score":0.0049436893,"about_ca_system_score_codex":0.00051211094,"about_ca_system_score_gemma":0.001059204,"threshold_uncertainty_score":0.011282325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048450008,0.00062195095,0.8814806,0.0029226972,0.00016976985,0.0005105299,0.000069143134,0.00080449786,0.064970836],"genre_scores_gemma":[0.46773773,0.0007654707,0.50807595,0.00034123956,0.00012104691,0.00057036016,0.0002001515,0.00011789404,0.022070173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965971,0.0014746112,0.00033372856,0.000420072,0.00087069796,0.00030379405],"domain_scores_gemma":[0.995952,0.00094651745,0.00046405458,0.001134419,0.0009044317,0.0005984956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00359832,0.0004954212,0.00048072595,0.0011854294,0.002630833,0.005150404,0.0018582217,0.0021000057,0.0043380465],"category_scores_gemma":[0.006105153,0.00076548004,0.000819198,0.0012405154,0.0043234313,0.005916939,0.004525245,0.0017929188,0.001303718],"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.00003638505,0.00006052235,0.0006566016,0.000118110824,0.000039008442,0.00018431844,0.0020369736,0.01482641,0.0020846645,0.95449156,0.0013979835,0.024067389],"study_design_scores_gemma":[0.00008388799,0.00018859182,0.0011827166,0.00013831464,0.00012858551,0.00060036243,0.0018246255,0.112613276,0.0046353606,0.6409463,0.23755781,0.00010015444],"about_ca_topic_score_codex":0.0026576826,"about_ca_topic_score_gemma":0.001609735,"teacher_disagreement_score":0.005150404,"about_ca_system_score_codex":0.0018394784,"about_ca_system_score_gemma":0.0028510157,"threshold_uncertainty_score":0.019029975},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8923436,0.0018530589,0.09623964,0.00023945981,0.0002887016,0.00030183012,0.0014130947,0.0014502291,0.0058703087],"genre_scores_gemma":[0.93748254,0.00027302813,0.05949343,0.000051795312,0.00020033734,0.00014540256,0.0012671187,0.000052210307,0.001034129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990803,0.0001800886,0.00009981182,0.00018643463,0.0003499235,0.00010344409],"domain_scores_gemma":[0.9978649,0.0006745898,0.0003684662,0.00013829295,0.000861726,0.00009196759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009841261,0.00057677197,0.00077617355,0.0030581262,0.0002924312,0.00081569236,0.0003181821,0.000391764,0.001297093],"category_scores_gemma":[0.0034751184,0.00016350212,0.00065946154,0.0014103135,0.00022907909,0.0005502528,0.0003688343,0.00048344547,0.0005932138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023298538,0.00043761465,0.08495704,0.00049078284,0.00054023875,0.0002888178,0.00045698724,0.014920684,0.07740962,0.0012184293,0.005026393,0.8119235],"study_design_scores_gemma":[0.0001657265,0.00089413824,0.16716802,0.000093873925,0.00035492206,0.0005197907,0.00041574845,0.7770928,0.044772208,0.0026470227,0.0057243127,0.00015142387],"about_ca_topic_score_codex":0.0013077148,"about_ca_topic_score_gemma":0.0019129971,"teacher_disagreement_score":0.0030581262,"about_ca_system_score_codex":0.00040582477,"about_ca_system_score_gemma":0.00028061148,"threshold_uncertainty_score":0.0052046776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042654146,0.0001668612,0.95072305,0.0005658548,0.00005346246,0.00013908042,0.000037276244,0.00021813398,0.005442131],"genre_scores_gemma":[0.72848415,0.00014435418,0.2667082,0.00010265173,0.00003724254,0.00020904574,0.00008627876,0.000027863596,0.0042002136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736303,0.0009369585,0.00024045032,0.00050033326,0.000671864,0.00028744177],"domain_scores_gemma":[0.99402267,0.0024834925,0.0012006374,0.0009513706,0.0008910441,0.00045074942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054021045,0.00055438717,0.0008637341,0.00088887906,0.0015075929,0.0026590533,0.003404416,0.001750031,0.003949556],"category_scores_gemma":[0.010648793,0.0003773452,0.0014622478,0.00077564566,0.0013860586,0.0050421907,0.0025637872,0.0016929085,0.0005207597],"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.00024316767,0.00032240743,0.0016219537,0.0002267722,0.00035850628,0.00066450925,0.0010233519,0.18170598,0.0075316974,0.74308085,0.0024855288,0.060735147],"study_design_scores_gemma":[0.000117478776,0.00010833401,0.00029475067,0.00002663822,0.0001116819,0.0002131876,0.00014809368,0.7829828,0.003943038,0.20658788,0.0054169977,0.000049093826],"about_ca_topic_score_codex":0.0018348092,"about_ca_topic_score_gemma":0.0013979191,"teacher_disagreement_score":0.0054021045,"about_ca_system_score_codex":0.0014618678,"about_ca_system_score_gemma":0.002041114,"threshold_uncertainty_score":0.0285694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40058586,0.00014000923,0.5757954,0.0007573412,0.000041295058,0.00008609003,0.00027021323,0.0029686093,0.019355075],"genre_scores_gemma":[0.8988248,0.0000735558,0.09776496,0.0001713211,0.000023965444,0.000033979548,0.00045619922,0.00018332123,0.0024678826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995326,0.00016660152,0.000018154778,0.00014645101,0.000079478144,0.000056761317],"domain_scores_gemma":[0.9993222,0.00039014206,0.000055052387,0.000108873144,0.000087981265,0.0000357426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006417772,0.00046179202,0.00036549574,0.00058969675,0.0010102316,0.0016785869,0.0009064599,0.00061174884,0.0026821499],"category_scores_gemma":[0.0021037923,0.00043683883,0.0009902404,0.0003662647,0.0021621357,0.0030122115,0.0012019118,0.0009421836,0.00046053852],"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.00063167687,0.00024116349,0.007697452,0.00020569336,0.00012813,0.002100304,0.009351718,0.041596003,0.081767105,0.71780866,0.004713186,0.13375898],"study_design_scores_gemma":[0.000083228006,0.00021513508,0.004111513,0.00004923677,0.00011234833,0.0005525366,0.0011354195,0.31811547,0.031795725,0.6311043,0.0126450425,0.00008000929],"about_ca_topic_score_codex":0.010186221,"about_ca_topic_score_gemma":0.012777261,"teacher_disagreement_score":0.010186221,"about_ca_system_score_codex":0.0010995362,"about_ca_system_score_gemma":0.0007861377,"threshold_uncertainty_score":0.020253897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23572688,0.00028518285,0.75799584,0.00058595353,0.000045242054,0.0001945897,0.00010526477,0.0015222471,0.0035387871],"genre_scores_gemma":[0.58845943,0.00031635244,0.40888578,0.00017949485,0.000022231605,0.00014211377,0.00022557541,0.000082378116,0.0016866372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904734,0.0002520134,0.00005438702,0.00021832832,0.00036755818,0.000060321632],"domain_scores_gemma":[0.9970457,0.0019246397,0.00035985804,0.00022853677,0.0003883499,0.000052961474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014371969,0.0006670248,0.0007497797,0.0013866759,0.00031034026,0.0012536949,0.0011018856,0.0011696856,0.0006291353],"category_scores_gemma":[0.0064955093,0.000288052,0.0006919071,0.00077520957,0.00079616834,0.0012338132,0.0004984311,0.0009365844,0.00013443745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017585336,0.00024523673,0.015933983,0.00012190954,0.00022283106,0.00047414255,0.00024238575,0.6606198,0.017693724,0.011582881,0.0011046013,0.29158273],"study_design_scores_gemma":[0.000013215353,0.000060208182,0.0010841732,0.0000118877915,0.000040743475,0.00012826051,0.000028435477,0.9862845,0.005695854,0.005913683,0.0007264561,0.00001273314],"about_ca_topic_score_codex":0.0029096594,"about_ca_topic_score_gemma":0.0023327721,"teacher_disagreement_score":0.0029096594,"about_ca_system_score_codex":0.00066629774,"about_ca_system_score_gemma":0.00060216384,"threshold_uncertainty_score":0.0076007247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029686045,0.00017094212,0.9674733,0.000285259,0.00002559972,0.000038674443,0.000010934229,0.00029355247,0.00201567],"genre_scores_gemma":[0.87980074,0.00017601004,0.11842398,0.00016628783,0.00009705682,0.00012112485,0.000037609498,0.00005625528,0.0011209319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981838,0.0006733561,0.000094898714,0.00038884842,0.00048517738,0.0001739056],"domain_scores_gemma":[0.99099183,0.0064235344,0.00091897114,0.0008022062,0.0007045644,0.000158851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030356264,0.000888443,0.0011025775,0.00073422573,0.00057984126,0.0017838294,0.0017763476,0.0008829807,0.0009743423],"category_scores_gemma":[0.015069641,0.00038701392,0.00039280887,0.00057060766,0.0024064744,0.0020292096,0.0012557021,0.0017226648,0.00017816613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009714843,0.00014759375,0.0009160997,0.00009951116,0.000060421193,0.00005562292,0.00008823956,0.89446247,0.0031480105,0.027595267,0.00033880485,0.07299085],"study_design_scores_gemma":[0.000008491729,0.000025678088,0.0000933753,0.000004541079,0.0000051385177,0.0000045318293,0.000004465273,0.9758866,0.0013351678,0.022445666,0.00018148377,0.0000048544557],"about_ca_topic_score_codex":0.0030045973,"about_ca_topic_score_gemma":0.0024324362,"teacher_disagreement_score":0.0030356264,"about_ca_system_score_codex":0.0016385058,"about_ca_system_score_gemma":0.0014444469,"threshold_uncertainty_score":0.016054094},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020704146,0.00040414455,0.97209364,0.00018873191,0.000066802655,0.00045524098,0.0010145243,0.0027141846,0.0023586103],"genre_scores_gemma":[0.08962989,0.0002949372,0.9037564,0.00009333163,0.00007578602,0.00061943324,0.0030401568,0.0002676156,0.0022224747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867636,0.00043883125,0.00015063131,0.00030619613,0.00037427203,0.000053745523],"domain_scores_gemma":[0.99538535,0.002249888,0.00036635553,0.00080964883,0.0011131578,0.00007562091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001357062,0.0009832882,0.0006244467,0.0028012826,0.00079869526,0.00086464814,0.0009333983,0.0007870289,0.0039950036],"category_scores_gemma":[0.009972679,0.0004374464,0.000730691,0.0025636007,0.00060744106,0.001934924,0.0009311705,0.0011730157,0.0028597359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021345647,0.00019505735,0.0014244328,0.0006057735,0.000118982854,0.0007449994,0.0014678927,0.0029736937,0.10134032,0.005917755,0.011524787,0.87347275],"study_design_scores_gemma":[0.00025659997,0.001052112,0.02069502,0.0004135845,0.00048317155,0.0077295504,0.002458423,0.55868274,0.2284453,0.06421298,0.11525365,0.00031687526],"about_ca_topic_score_codex":0.000703436,"about_ca_topic_score_gemma":0.0012954848,"teacher_disagreement_score":0.0039950036,"about_ca_system_score_codex":0.0002960339,"about_ca_system_score_gemma":0.00057199376,"threshold_uncertainty_score":0.013364613},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050775165,0.007678829,0.0031070563,0.053502377,0.8848911,0.00021381435,0.0014423855,0.00079189823,0.047864784],"genre_scores_gemma":[0.0020977529,0.010965606,0.0017620808,0.02022635,0.47141853,0.00035109563,0.0036317508,0.0017008781,0.48784596],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980015,0.00027391498,0.00021282086,0.0003158758,0.00095827726,0.0002375699],"domain_scores_gemma":[0.98658943,0.0026049383,0.00076200604,0.0010084654,0.005746542,0.0032885696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004155569,0.0024450622,0.0048289425,0.0064820424,0.003743128,0.011258708,0.002722523,0.004678031,0.27611476],"category_scores_gemma":[0.010006194,0.0009426191,0.0019228981,0.003742541,0.0011638969,0.009881618,0.0049785646,0.006341415,0.19553678],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019620502,0.000019330892,0.000054692013,0.000054109456,0.000004372727,0.000022261924,0.000009942447,0.000015387579,0.000074537566,0.0002652216,0.9901596,0.009300995],"study_design_scores_gemma":[0.000015103962,0.000024601217,0.00048702446,0.00007807297,0.000014203116,0.000035758083,0.000043192955,0.00015774665,0.00006809717,0.00078981376,0.9982736,0.0000127470075],"about_ca_topic_score_codex":0.002351646,"about_ca_topic_score_gemma":0.00814525,"teacher_disagreement_score":0.27611476,"about_ca_system_score_codex":0.0017150041,"about_ca_system_score_gemma":0.0034155338,"threshold_uncertainty_score":0.9236959},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01696798,0.00010557504,0.976854,0.00061666773,0.000050942403,0.00053371146,0.00006403695,0.0014196592,0.0033874123],"genre_scores_gemma":[0.265291,0.00010505005,0.7315557,0.000261664,0.000056034703,0.0004229135,0.00023133714,0.00018222479,0.0018940484],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99308676,0.0019380442,0.0006042701,0.0011186841,0.0028846925,0.0003675507],"domain_scores_gemma":[0.97290605,0.015081471,0.0019643372,0.006409445,0.0029566283,0.00068204984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00929909,0.0007167147,0.0008278894,0.002203737,0.0013530576,0.0024634488,0.002327068,0.0018834063,0.004701361],"category_scores_gemma":[0.045911327,0.00089016097,0.0006552225,0.0018373802,0.0015608066,0.004354922,0.0023906322,0.0028489842,0.001479561],"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.00089110516,0.0009291052,0.0057283817,0.00026007474,0.0000976505,0.0005096408,0.0010131715,0.18296027,0.029638354,0.14673959,0.009759366,0.6214733],"study_design_scores_gemma":[0.00011952146,0.00034565653,0.001792115,0.00010787108,0.000073131916,0.0008352609,0.00022335746,0.86591107,0.035091333,0.06856344,0.026862858,0.00007442618],"about_ca_topic_score_codex":0.0012468054,"about_ca_topic_score_gemma":0.0011752923,"teacher_disagreement_score":0.00929909,"about_ca_system_score_codex":0.0014116081,"about_ca_system_score_gemma":0.0021585329,"threshold_uncertainty_score":0.04917884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052134283,0.0016933022,0.98811346,0.0005160637,0.00007722209,0.000070646376,0.00036618818,0.00012808408,0.0038215388],"genre_scores_gemma":[0.33624023,0.003991297,0.6541706,0.00031370876,0.00035988246,0.00046810054,0.0009652737,0.0000499584,0.0034410497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941301,0.0023284738,0.00041542304,0.00064589,0.002259869,0.00022025174],"domain_scores_gemma":[0.99313354,0.0051369853,0.00057738315,0.0005042766,0.00055245974,0.0000954021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006582082,0.0007054731,0.0015619113,0.0020374893,0.0006055151,0.0042786147,0.001704613,0.0012011942,0.0023993624],"category_scores_gemma":[0.01722069,0.0007238404,0.0016354012,0.0034149918,0.0016372621,0.0042050383,0.0013315945,0.0019696755,0.00068416155],"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.000082252234,0.0000239012,0.00055237097,0.00021522141,0.000099672434,0.0001916261,0.00019970116,0.32316366,0.00040500102,0.6249382,0.0020754014,0.048052963],"study_design_scores_gemma":[0.000027678469,0.000030948555,0.0002273266,0.00006529036,0.000044551976,0.00009282234,0.000030120347,0.37939242,0.00032439455,0.61433506,0.0053947344,0.000034734163],"about_ca_topic_score_codex":0.002279157,"about_ca_topic_score_gemma":0.0016787851,"teacher_disagreement_score":0.006582082,"about_ca_system_score_codex":0.0015214882,"about_ca_system_score_gemma":0.0013595995,"threshold_uncertainty_score":0.03480977},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029541157,0.001607697,0.95854217,0.0023476353,0.00021131823,0.000074619296,0.00023404807,0.00052560266,0.0069157635],"genre_scores_gemma":[0.7055092,0.004360326,0.2749266,0.0032856846,0.0011057352,0.00055710255,0.00097036146,0.00068450585,0.0086006075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936109,0.0020291454,0.00048005668,0.0016703852,0.0016723904,0.00053712545],"domain_scores_gemma":[0.9772794,0.014131371,0.0016940043,0.0047587175,0.0016104076,0.0005260189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008943257,0.0012280828,0.0023090928,0.0017351527,0.0012170335,0.003267176,0.0030473785,0.0026672422,0.0027288585],"category_scores_gemma":[0.038582213,0.0009701567,0.0024417287,0.0014994101,0.0060935295,0.012883125,0.0036240434,0.007747021,0.0011377714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096832424,0.00004654994,0.0026585658,0.00028491142,0.00018982317,0.00028618617,0.0005608038,0.19939882,0.001367663,0.7010711,0.004474253,0.08956454],"study_design_scores_gemma":[0.000017148815,0.000034167293,0.0003870864,0.00005379238,0.000021717804,0.00012613086,0.000040101648,0.2047199,0.0002349557,0.79049873,0.0038441634,0.000022107573],"about_ca_topic_score_codex":0.0022900542,"about_ca_topic_score_gemma":0.0023300725,"teacher_disagreement_score":0.008943257,"about_ca_system_score_codex":0.0014703501,"about_ca_system_score_gemma":0.0010537278,"threshold_uncertainty_score":0.04729706},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019432753,0.00018169657,0.97899514,0.00019122509,0.00001912819,0.000026337384,0.00015746648,0.00043956842,0.0005567051],"genre_scores_gemma":[0.519005,0.0007374589,0.47522506,0.00024736713,0.00009389087,0.00032603374,0.0008265143,0.00032515702,0.003213425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919707,0.00043343363,0.000031957334,0.00016768927,0.000112285095,0.00005753818],"domain_scores_gemma":[0.99526155,0.004051643,0.00023390618,0.00024387104,0.00013697274,0.00007216477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020178237,0.00071489956,0.00094177393,0.0014017259,0.00059948786,0.0009404114,0.0015703413,0.0012824013,0.0013116272],"category_scores_gemma":[0.0067169163,0.0008339678,0.0015353119,0.0013026772,0.0008948654,0.002228394,0.0009718247,0.0015443844,0.00056673255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008818377,0.00006787772,0.0015572488,0.00008661887,0.00006837977,0.0002479438,0.00019203917,0.8746275,0.0026579502,0.06837356,0.0011497575,0.050883062],"study_design_scores_gemma":[0.000005034767,0.000007589457,0.000076723496,0.0000044182534,0.000006636038,0.000022135953,0.000004127406,0.9714516,0.00023531275,0.027894465,0.00028357375,0.000008286911],"about_ca_topic_score_codex":0.008739644,"about_ca_topic_score_gemma":0.013248854,"teacher_disagreement_score":0.008739644,"about_ca_system_score_codex":0.0009866303,"about_ca_system_score_gemma":0.0015331234,"threshold_uncertainty_score":0.017377555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019515296,0.00021798786,0.9751013,0.0009411882,0.000077091616,0.0001382458,0.000012778558,0.00010080171,0.0038952786],"genre_scores_gemma":[0.82710195,0.0003485292,0.16945589,0.00020988804,0.0001238729,0.00026568514,0.00001943263,0.000028827846,0.0024458936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914932,0.004984069,0.00061506603,0.00077239645,0.0016695758,0.00046560017],"domain_scores_gemma":[0.98048156,0.011207262,0.0031525206,0.0026740886,0.0017688372,0.000715774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01229891,0.00090995245,0.0009821899,0.0009994084,0.0013129452,0.0030795245,0.002669114,0.0028819619,0.0017920963],"category_scores_gemma":[0.025595522,0.0008384478,0.0012617152,0.0007682563,0.0028272565,0.008616318,0.0029639122,0.002392186,0.00031704357],"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.0002728911,0.00040028477,0.0028844231,0.00046033188,0.00019743606,0.0006015299,0.0010007538,0.18504481,0.0057711164,0.74099433,0.0015435421,0.060828462],"study_design_scores_gemma":[0.00014526994,0.00030949683,0.00034175033,0.00007512229,0.00009663184,0.0002672104,0.00015596591,0.7207004,0.0027504705,0.26999703,0.005093168,0.00006749207],"about_ca_topic_score_codex":0.00085024687,"about_ca_topic_score_gemma":0.00074155396,"teacher_disagreement_score":0.01229891,"about_ca_system_score_codex":0.0015664286,"about_ca_system_score_gemma":0.0018504321,"threshold_uncertainty_score":0.06504363},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22329369,0.00017887511,0.7681133,0.0007831202,0.00005114556,0.00014718946,0.000054945478,0.002659194,0.0047184164],"genre_scores_gemma":[0.91638124,0.000029490087,0.082544915,0.00009086169,0.000010417638,0.000066018736,0.000045607503,0.000066325374,0.00076517195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979613,0.0010209983,0.00006369408,0.00031885636,0.00038064623,0.0002544854],"domain_scores_gemma":[0.9881798,0.007309483,0.0012851293,0.001902387,0.00084807863,0.00047518258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002904312,0.0008913977,0.0009825765,0.0008510294,0.0008358601,0.0010207887,0.0019972373,0.0012993414,0.002183749],"category_scores_gemma":[0.014596597,0.0005895644,0.00063577417,0.00031121756,0.0024844394,0.0025626156,0.0019837192,0.0015100411,0.00036505575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012924179,0.00021214163,0.006291886,0.000052040024,0.000043942953,0.00010357808,0.00017901638,0.90821344,0.002379807,0.008621519,0.0009608149,0.0728125],"study_design_scores_gemma":[0.0000076629785,0.00002625776,0.00021390234,0.0000036704528,0.0000020418393,0.0000091362745,0.0000141797445,0.99520725,0.00068938604,0.0037076587,0.000115258146,0.0000035256207],"about_ca_topic_score_codex":0.0046464987,"about_ca_topic_score_gemma":0.0031517702,"teacher_disagreement_score":0.0046464987,"about_ca_system_score_codex":0.0013903342,"about_ca_system_score_gemma":0.0014829182,"threshold_uncertainty_score":0.01535964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08452346,0.0011779779,0.89389354,0.0017599051,0.00019410267,0.00038148926,0.00015254469,0.0021895275,0.015727445],"genre_scores_gemma":[0.895759,0.0003688798,0.09876828,0.00026794447,0.000089627574,0.00016047891,0.00014192026,0.000081132,0.0043628244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734735,0.0009931817,0.00016273973,0.00040562276,0.0008369828,0.00025403287],"domain_scores_gemma":[0.9966288,0.0015981607,0.0003639319,0.0005812361,0.0006303496,0.00019744485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024473032,0.00073668966,0.0010606908,0.0010379525,0.0012430589,0.0023578147,0.001520499,0.0015470367,0.0024900602],"category_scores_gemma":[0.010930949,0.000320557,0.0006947645,0.0009775618,0.0010384663,0.004066983,0.0019089844,0.0014753977,0.0008174766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016223852,0.0005962812,0.013745084,0.00053972803,0.00026316865,0.0019950788,0.0017200089,0.3268827,0.019310905,0.12337764,0.013202477,0.4967445],"study_design_scores_gemma":[0.00004307198,0.00010124798,0.0012564535,0.000030200164,0.000049206166,0.0003415624,0.00017437716,0.9653876,0.0035894858,0.024433225,0.004555219,0.000038402177],"about_ca_topic_score_codex":0.0055085737,"about_ca_topic_score_gemma":0.003689481,"teacher_disagreement_score":0.0055085737,"about_ca_system_score_codex":0.0012448558,"about_ca_system_score_gemma":0.001092802,"threshold_uncertainty_score":0.012942731},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044581206,0.0055905418,0.97340524,0.0042332434,0.00016749382,0.000054760247,0.00025690603,0.00018570932,0.0116479285],"genre_scores_gemma":[0.37300375,0.016033826,0.5986782,0.0016918165,0.0013971903,0.00043460279,0.0010907651,0.0001523428,0.007517525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99389064,0.0032949215,0.00039542094,0.001022639,0.0011620749,0.00023441638],"domain_scores_gemma":[0.9828408,0.013668392,0.001357987,0.00088484254,0.0009247909,0.0003232016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008072622,0.0014734104,0.0014225967,0.004170096,0.001641726,0.0063817683,0.0027788114,0.0031110973,0.0063269935],"category_scores_gemma":[0.028065018,0.0011572752,0.0022043649,0.004890896,0.005245306,0.013592484,0.0026070226,0.004204637,0.00095080334],"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.000025983265,0.000017877923,0.00036078718,0.0001672852,0.000086614025,0.00008678013,0.00021413536,0.03984827,0.00011014254,0.9306636,0.0016200879,0.026798405],"study_design_scores_gemma":[0.000009031015,0.0000042655424,0.00007916442,0.000040993422,0.000017565797,0.000038877286,0.000027185275,0.040081896,0.000062160805,0.95578,0.0038464793,0.000012426709],"about_ca_topic_score_codex":0.012232716,"about_ca_topic_score_gemma":0.0072117024,"teacher_disagreement_score":0.012232716,"about_ca_system_score_codex":0.004471308,"about_ca_system_score_gemma":0.0020766775,"threshold_uncertainty_score":0.04269266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008856199,0.00014574238,0.9872595,0.00044241967,0.00003270074,0.00014487255,0.00012915423,0.00040250283,0.0025868367],"genre_scores_gemma":[0.527946,0.00032223063,0.4680268,0.00014306905,0.00013225706,0.0004041732,0.00039902385,0.00010580675,0.0025206713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97921115,0.009346825,0.0017965356,0.0024950516,0.006616978,0.0005334339],"domain_scores_gemma":[0.973462,0.00723385,0.0025321862,0.01010055,0.0055450527,0.0011264362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014621693,0.0015495968,0.0020821742,0.0038841832,0.0021139765,0.0053549567,0.0033562721,0.002749605,0.0025440932],"category_scores_gemma":[0.048561193,0.0013267847,0.0018027108,0.0049046283,0.0019372201,0.012883956,0.0045941817,0.0032743004,0.0008058259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039280645,0.0003954564,0.011333512,0.0003354582,0.0009294861,0.00053048425,0.003480944,0.281218,0.0052207937,0.34141028,0.007884402,0.34686834],"study_design_scores_gemma":[0.000041642877,0.00010408162,0.0013199002,0.000048785147,0.00016972778,0.00021404181,0.00029465067,0.78466487,0.0014697677,0.20148942,0.010079201,0.00010389568],"about_ca_topic_score_codex":0.0076657073,"about_ca_topic_score_gemma":0.009702349,"teacher_disagreement_score":0.014621693,"about_ca_system_score_codex":0.00268975,"about_ca_system_score_gemma":0.003014548,"threshold_uncertainty_score":0.07732779},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0151883,0.0022439433,0.97127986,0.00042547614,0.00027959637,0.0005387391,0.0004890904,0.0023280552,0.007227033],"genre_scores_gemma":[0.22097382,0.003743188,0.7574415,0.00040933033,0.00050471124,0.0010118982,0.0021219025,0.00031797093,0.013475644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981535,0.00038216612,0.00022367395,0.00029446618,0.0008258056,0.00012034368],"domain_scores_gemma":[0.9978517,0.00081067876,0.00021062497,0.00031187455,0.0007615825,0.000053493775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017236137,0.0009585392,0.0009908661,0.0044031823,0.001054592,0.0016279,0.0013216145,0.00058295444,0.008137869],"category_scores_gemma":[0.0071096313,0.0003382202,0.0013088058,0.0054359436,0.00078530586,0.0038422388,0.00085727876,0.00056266435,0.004258061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021681009,0.00014539376,0.001796992,0.0010826536,0.00018546978,0.00024985883,0.00033168762,0.02328151,0.027449714,0.04037834,0.015223554,0.88965803],"study_design_scores_gemma":[0.00014399111,0.00059379626,0.01014298,0.0001334539,0.0005032263,0.0016298048,0.00027532823,0.7218625,0.12539871,0.049393114,0.08960221,0.0003209371],"about_ca_topic_score_codex":0.006251512,"about_ca_topic_score_gemma":0.0046314104,"teacher_disagreement_score":0.008137869,"about_ca_system_score_codex":0.001355403,"about_ca_system_score_gemma":0.0015639933,"threshold_uncertainty_score":0.027223945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007987797,0.00039000114,0.98125803,0.0014676221,0.00011521175,0.00009225319,0.00008827047,0.00027828178,0.008322456],"genre_scores_gemma":[0.6491563,0.0007309787,0.34319165,0.0003735657,0.00028583404,0.00048804138,0.00030442883,0.00007967034,0.005389575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942416,0.0022364024,0.00066831266,0.00082657766,0.0016214594,0.0004055497],"domain_scores_gemma":[0.99395293,0.0026140257,0.0011065362,0.00089780777,0.0011165435,0.0003121742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057610874,0.00081255974,0.00090692815,0.0012371707,0.0012531888,0.003975554,0.0019450289,0.0017106738,0.0026042021],"category_scores_gemma":[0.012288041,0.00041686866,0.0014439607,0.0010825488,0.0033013804,0.0070130937,0.0023356993,0.002425092,0.0005743062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024850755,0.00002537591,0.00026532635,0.000085310945,0.000027040505,0.0001428086,0.00031286024,0.05648186,0.00069751753,0.93285185,0.0010402302,0.008044933],"study_design_scores_gemma":[0.00003943234,0.00006785,0.00022726764,0.000055437533,0.000040005663,0.00015577584,0.0001234508,0.4865884,0.00077125774,0.5007634,0.01110933,0.000058319973],"about_ca_topic_score_codex":0.0044446643,"about_ca_topic_score_gemma":0.002751533,"teacher_disagreement_score":0.0057610874,"about_ca_system_score_codex":0.0029767305,"about_ca_system_score_gemma":0.0022601828,"threshold_uncertainty_score":0.030467927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002599024,0.000120420176,0.9937505,0.00012343538,0.000020660094,0.000058556336,0.000075463235,0.00007795038,0.0031739096],"genre_scores_gemma":[0.21735732,0.0006975897,0.77329165,0.00025528247,0.000081467995,0.0009847265,0.0005350682,0.0001421014,0.0066548996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829584,0.0009579586,0.00008393371,0.00020090035,0.0003462165,0.00011527992],"domain_scores_gemma":[0.9964618,0.0027844196,0.00022993192,0.00016394629,0.00027072377,0.00008919404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00320911,0.0015729916,0.0013575125,0.0010420672,0.0005682541,0.001823512,0.0016402542,0.0013551925,0.0049027996],"category_scores_gemma":[0.007762008,0.0009758473,0.0012911317,0.0022188416,0.0013803876,0.002574437,0.0018948907,0.0024729606,0.00057403586],"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.00004421805,0.000030974363,0.0001316588,0.000085517415,0.000033778808,0.00003903186,0.000022387705,0.8776661,0.00018889691,0.10542199,0.0008246029,0.015510758],"study_design_scores_gemma":[0.000021610289,0.000012113271,0.000018888704,0.000011490478,0.0000069638986,0.000007926376,0.0000060829125,0.91829866,0.00017577228,0.080288954,0.0011455537,0.0000060575167],"about_ca_topic_score_codex":0.007688899,"about_ca_topic_score_gemma":0.0087261675,"teacher_disagreement_score":0.007688899,"about_ca_system_score_codex":0.0017837597,"about_ca_system_score_gemma":0.0022863455,"threshold_uncertainty_score":0.016971648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17152087,0.0018149817,0.7944003,0.0070390697,0.00028956562,0.00017161971,0.0003900677,0.00035149293,0.024021985],"genre_scores_gemma":[0.9543107,0.0004491942,0.040198307,0.00050130737,0.000232926,0.00021442336,0.00021173395,0.00014525224,0.0037362054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935808,0.0024973326,0.00033211047,0.0012486085,0.0018918889,0.00044920703],"domain_scores_gemma":[0.9396713,0.040890932,0.0059627597,0.00796559,0.0045686555,0.0009407466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011179386,0.00067570666,0.0013504454,0.0022453673,0.0010992645,0.0033508807,0.0018967703,0.001918358,0.0053679785],"category_scores_gemma":[0.09432036,0.0003748753,0.0014244289,0.001541104,0.0054523973,0.008385107,0.0025393122,0.0033508374,0.0008979231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030488928,0.00010731304,0.010660937,0.00025576874,0.0001981739,0.0001207072,0.0009534339,0.12930575,0.003953116,0.787024,0.0032574523,0.063858405],"study_design_scores_gemma":[0.000032072552,0.00024298327,0.008050722,0.00012442438,0.00005001272,0.00015718685,0.00042880344,0.45676744,0.0037703137,0.52636,0.0039323703,0.00008378247],"about_ca_topic_score_codex":0.001415556,"about_ca_topic_score_gemma":0.00066815194,"teacher_disagreement_score":0.011179386,"about_ca_system_score_codex":0.0022886645,"about_ca_system_score_gemma":0.000946122,"threshold_uncertainty_score":0.05912298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019457633,0.00051548326,0.97750163,0.0002655941,0.000025516701,0.000065589746,0.00041917348,0.00068813143,0.0010613197],"genre_scores_gemma":[0.64373875,0.0016447357,0.34407666,0.00027165288,0.0001781951,0.00092328514,0.0025064363,0.0002985772,0.0063616754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987214,0.00048698328,0.00007896136,0.0003130616,0.00030512788,0.00009443969],"domain_scores_gemma":[0.9931553,0.005360044,0.00047451866,0.00047272458,0.00045412427,0.00008325056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020568322,0.0008941154,0.0012879113,0.0022591527,0.0005951401,0.0012184764,0.0024871412,0.0021423898,0.0022545604],"category_scores_gemma":[0.010779111,0.00097120507,0.0014097079,0.002195017,0.00087563455,0.003019386,0.0008960207,0.0015227434,0.00093959115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005230639,0.000056654186,0.0014533579,0.00009500521,0.00005947077,0.00010032961,0.00011568105,0.92782843,0.0007756218,0.043444697,0.0016160576,0.024402348],"study_design_scores_gemma":[0.0000055298565,0.0000070818182,0.00016983936,0.0000044945587,0.0000061861333,0.000017941442,0.000003980622,0.98380566,0.00008386149,0.015582514,0.00030629596,0.000006574249],"about_ca_topic_score_codex":0.0105761,"about_ca_topic_score_gemma":0.010388329,"teacher_disagreement_score":0.0105761,"about_ca_system_score_codex":0.0012335487,"about_ca_system_score_gemma":0.00093430316,"threshold_uncertainty_score":0.021029055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018644342,0.000562031,0.9486474,0.0020076178,0.0001343499,0.00026029235,0.0002937462,0.0006395359,0.028810635],"genre_scores_gemma":[0.44858462,0.00072596484,0.53672504,0.00040833303,0.00015350709,0.0009798305,0.0006626294,0.0002946888,0.011465328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960775,0.002183081,0.00028812228,0.0005185894,0.00059616286,0.0003365681],"domain_scores_gemma":[0.9934814,0.0040156106,0.00065194676,0.0007439468,0.00057397503,0.00053312664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051924684,0.0011270043,0.00065584853,0.001162926,0.002470533,0.005263433,0.0025369676,0.0032367215,0.0051298677],"category_scores_gemma":[0.014450854,0.00092138,0.0017658091,0.0010116695,0.00421569,0.0089472355,0.0032084861,0.0026929202,0.0014081415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014483529,0.000079878155,0.0013521503,0.00012586292,0.000035739195,0.0004209733,0.004409077,0.103973776,0.00086737983,0.8707138,0.0019036653,0.015972784],"study_design_scores_gemma":[0.000059330097,0.000057414123,0.0002469637,0.000098997996,0.000057059322,0.00018202252,0.00090037455,0.5746859,0.001007484,0.3932283,0.029430926,0.000045306308],"about_ca_topic_score_codex":0.011976791,"about_ca_topic_score_gemma":0.009856285,"teacher_disagreement_score":0.011976791,"about_ca_system_score_codex":0.0023477494,"about_ca_system_score_gemma":0.0040827575,"threshold_uncertainty_score":0.027460754},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006729482,0.004159432,0.93955415,0.004462666,0.0007575109,0.00013837377,0.00060380134,0.0011295661,0.042465087],"genre_scores_gemma":[0.20733653,0.0047471,0.7682793,0.0018870255,0.0008344342,0.0004759895,0.0014770273,0.00038959418,0.014573052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989556,0.00033678868,0.00009965528,0.00025530517,0.00026660133,0.00008595649],"domain_scores_gemma":[0.99837625,0.0007266881,0.00015180127,0.00038326177,0.0002743494,0.000087652305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00118601,0.0006759334,0.00053918455,0.0028293368,0.0011588598,0.0058984035,0.001653167,0.0014474901,0.005189243],"category_scores_gemma":[0.0046944693,0.0004881474,0.0012257968,0.001977827,0.005079584,0.011723655,0.0030777403,0.0024717834,0.0015080702],"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.000025080333,0.000020296615,0.00021985183,0.00019969764,0.000027573165,0.00020095317,0.0007900025,0.0022725,0.0023368727,0.93757224,0.0037642377,0.05257064],"study_design_scores_gemma":[0.000011839975,0.00002212551,0.00023427139,0.00017512045,0.000026459466,0.00017458735,0.0003577892,0.012762892,0.0023819166,0.90010124,0.083716124,0.00003573198],"about_ca_topic_score_codex":0.0035690113,"about_ca_topic_score_gemma":0.0029499077,"teacher_disagreement_score":0.0058984035,"about_ca_system_score_codex":0.0013432122,"about_ca_system_score_gemma":0.0010272,"threshold_uncertainty_score":0.017359734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1549352,0.00015957539,0.8215335,0.00091523107,0.00001881575,0.00034785696,0.00011901143,0.002754084,0.019216813],"genre_scores_gemma":[0.56371593,0.00012640521,0.42801932,0.00014915098,0.000015141186,0.00014406964,0.00023648709,0.00011612721,0.007477393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727577,0.0013446937,0.00025205064,0.0003929325,0.000568672,0.00016594991],"domain_scores_gemma":[0.99635315,0.0019755776,0.00034237374,0.0006738939,0.00038180963,0.00027310682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005885768,0.00044058004,0.00051924324,0.0016725225,0.0012757076,0.0034816486,0.0014050176,0.0013509567,0.002088189],"category_scores_gemma":[0.010182789,0.0007189579,0.0005021866,0.0011152502,0.00079755444,0.0052193333,0.0022098855,0.0009093271,0.0010010293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011189228,0.0012064545,0.042399857,0.00026127184,0.00018681306,0.0024530508,0.018582864,0.15083238,0.029826058,0.16254008,0.0094996225,0.58109254],"study_design_scores_gemma":[0.000065614266,0.00019018391,0.00353037,0.00007181077,0.00009370554,0.000775947,0.0019565974,0.87663466,0.017916521,0.06677033,0.031897258,0.00009711078],"about_ca_topic_score_codex":0.002677468,"about_ca_topic_score_gemma":0.0037375414,"teacher_disagreement_score":0.005885768,"about_ca_system_score_codex":0.001073155,"about_ca_system_score_gemma":0.0015671715,"threshold_uncertainty_score":0.031127274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07159132,0.00034262796,0.92529553,0.00025877447,0.000022608054,0.00009772843,0.000035419267,0.00025702282,0.0020990246],"genre_scores_gemma":[0.90623736,0.0001688443,0.09230384,0.00007420995,0.000020736448,0.00016885299,0.00005637568,0.000032752694,0.0009369577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985759,0.00071691565,0.000061986124,0.00022887837,0.00024654483,0.00016971547],"domain_scores_gemma":[0.9973598,0.0018719292,0.0002685065,0.00020533362,0.00015546544,0.0001389663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023697838,0.00092827826,0.0013990913,0.00045758823,0.00047609367,0.00077605486,0.0009923677,0.0010628044,0.0013642632],"category_scores_gemma":[0.0070790723,0.00051137386,0.00051678653,0.00040970315,0.0017613382,0.0016288854,0.0018033114,0.0013833717,0.00018093886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010584891,0.000053404467,0.00088153145,0.00006169309,0.000038892726,0.00007041125,0.000087085544,0.9473156,0.0010006747,0.026937572,0.0003175611,0.023129828],"study_design_scores_gemma":[0.000025024245,0.000036079717,0.000073677555,0.0000071082045,0.000008438722,0.000009686509,0.000009375013,0.9799296,0.00040519526,0.019253517,0.0002377506,0.000004608445],"about_ca_topic_score_codex":0.0021822306,"about_ca_topic_score_gemma":0.0017806075,"teacher_disagreement_score":0.0023697838,"about_ca_system_score_codex":0.001207291,"about_ca_system_score_gemma":0.0012542974,"threshold_uncertainty_score":0.012532711},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029689014,0.00033578297,0.9389911,0.006952269,0.00018066516,0.0002421342,0.000106890104,0.0005979172,0.022904137],"genre_scores_gemma":[0.80165803,0.00068207755,0.18933947,0.00040523292,0.00023516195,0.00030206237,0.00010681674,0.00012573815,0.00714543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551386,0.0017706199,0.0003823578,0.0006187672,0.0013555257,0.0003589221],"domain_scores_gemma":[0.98106635,0.008082462,0.0023603458,0.0054399534,0.0018927812,0.0011581108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067822793,0.0005773126,0.0008891048,0.0012690502,0.0029127626,0.006195623,0.0021328533,0.00393011,0.007486297],"category_scores_gemma":[0.024230868,0.00086473057,0.0009798859,0.0010826373,0.009196583,0.016266944,0.005794637,0.004388328,0.001444502],"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.000056778623,0.0000354136,0.0005428335,0.00008727823,0.000020130643,0.00022186778,0.0005003841,0.020759288,0.0011007574,0.9577901,0.0014931788,0.017391998],"study_design_scores_gemma":[0.00006597275,0.000095967465,0.0002284231,0.0001045509,0.000025046262,0.00022473742,0.00022366279,0.1479163,0.0014309505,0.8315486,0.018084815,0.000050989034],"about_ca_topic_score_codex":0.0025645993,"about_ca_topic_score_gemma":0.0017539422,"teacher_disagreement_score":0.007486297,"about_ca_system_score_codex":0.0022040568,"about_ca_system_score_gemma":0.0037647681,"threshold_uncertainty_score":0.035868526},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011186498,0.598737,0.33717367,0.007660891,0.000751646,0.000301338,0.00015679197,0.0003433268,0.043688864],"genre_scores_gemma":[0.08764725,0.59469247,0.3054665,0.0023165848,0.0031646648,0.00048117532,0.0005098025,0.00014863347,0.0055729477],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940236,0.0018878917,0.00072289194,0.00080910156,0.0021453714,0.00041103933],"domain_scores_gemma":[0.99094474,0.0060886503,0.0005239612,0.00078055996,0.0014052653,0.00025690574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009541159,0.0011474852,0.0018172477,0.0109015405,0.0019047201,0.0062725293,0.003499557,0.0025920086,0.003284272],"category_scores_gemma":[0.008072882,0.0011860337,0.0020835884,0.018466283,0.0034694048,0.009749989,0.002401533,0.0037951244,0.0010161903],"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.00013698805,0.00028226798,0.0022769088,0.004581614,0.0001369145,0.00024299129,0.0013879149,0.0034487236,0.0008887197,0.33475578,0.007776285,0.644085],"study_design_scores_gemma":[0.00010293035,0.0004186233,0.004860188,0.0056811166,0.00026553977,0.0022146017,0.0021267883,0.030179918,0.0026070792,0.59858614,0.35271174,0.0002452607],"about_ca_topic_score_codex":0.0021400412,"about_ca_topic_score_gemma":0.0021793137,"teacher_disagreement_score":0.0109015405,"about_ca_system_score_codex":0.0029881187,"about_ca_system_score_gemma":0.0024983992,"threshold_uncertainty_score":0.050459027},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004306607,0.44523978,0.20938511,0.1023398,0.017475193,0.00016923698,0.00037372886,0.0012252841,0.21948527],"genre_scores_gemma":[0.121455334,0.48561692,0.22130959,0.036752578,0.05148304,0.0013478477,0.0011649493,0.0014953723,0.07937438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99457043,0.002206705,0.00041554164,0.00090253557,0.0016452116,0.00025958443],"domain_scores_gemma":[0.9850081,0.010642084,0.0006514595,0.0010808307,0.0021586372,0.00045885931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058972463,0.0009781786,0.0012868054,0.0032694268,0.0014816484,0.009150666,0.003217085,0.005675629,0.010713955],"category_scores_gemma":[0.0148241455,0.0006531377,0.00091097347,0.0059976764,0.0068965685,0.019624036,0.0029243727,0.009698496,0.00499639],"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.000025121952,0.000028332806,0.00016331389,0.00045457974,0.000015397905,0.000070338894,0.0006145963,0.00052975095,0.00024264457,0.88747793,0.032053452,0.07832452],"study_design_scores_gemma":[0.0000148516565,0.00003378357,0.00019884016,0.0003652131,0.000015013546,0.00032203278,0.00023797894,0.0033420073,0.0002523512,0.29534346,0.6998458,0.000028544524],"about_ca_topic_score_codex":0.0015002649,"about_ca_topic_score_gemma":0.000879217,"teacher_disagreement_score":0.010713955,"about_ca_system_score_codex":0.0038302506,"about_ca_system_score_gemma":0.0026571606,"threshold_uncertainty_score":0.035841763},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006417581,0.00020480876,0.98012084,0.00039634533,0.00011366541,0.00017673713,0.00034529442,0.0058493232,0.0063754837],"genre_scores_gemma":[0.075994104,0.0003151576,0.91534793,0.00031013813,0.00007157742,0.00016646646,0.001468144,0.0013056555,0.005020736],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965322,0.0012646933,0.00028907196,0.00070016464,0.0010254631,0.00018843506],"domain_scores_gemma":[0.99555343,0.0015761844,0.00036052405,0.0015407884,0.0008743603,0.00009467023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030106269,0.0010966955,0.0010427769,0.0012928753,0.0008663404,0.0023951444,0.0017531468,0.001425165,0.008431555],"category_scores_gemma":[0.008250397,0.00054695667,0.0013589872,0.001269145,0.0010626282,0.002370494,0.0018780741,0.0012913124,0.0052444804],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003564552,0.00023308628,0.0021633746,0.0010654618,0.00023752838,0.0013563957,0.0012616048,0.067704536,0.03715029,0.15800619,0.03626815,0.6941969],"study_design_scores_gemma":[0.00015518138,0.0003082313,0.0010961572,0.00016972459,0.00018526643,0.0017366377,0.0004682163,0.5679156,0.07330708,0.14453806,0.20993444,0.00018527597],"about_ca_topic_score_codex":0.0012409148,"about_ca_topic_score_gemma":0.001545306,"teacher_disagreement_score":0.008431555,"about_ca_system_score_codex":0.0006292252,"about_ca_system_score_gemma":0.0016663625,"threshold_uncertainty_score":0.028206348},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061846944,0.0001331368,0.9843237,0.00031743033,0.000034251203,0.00010462053,0.000020770916,0.00044567074,0.008435757],"genre_scores_gemma":[0.13901007,0.00033417303,0.85424757,0.0001287379,0.00003439478,0.0004224355,0.00014499786,0.00016180123,0.005515715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806947,0.0007155278,0.00018822281,0.00035134616,0.00047879326,0.00019666864],"domain_scores_gemma":[0.99848783,0.00033958955,0.00012969229,0.00054673257,0.00032574427,0.00017031335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002290052,0.00073464005,0.00038979258,0.0010856971,0.0011557831,0.0030278394,0.0023073019,0.0011123138,0.002496445],"category_scores_gemma":[0.002775337,0.00059393793,0.0010657092,0.00069393375,0.0054459735,0.0037717333,0.0027417436,0.0018169266,0.0008518639],"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.000025210182,0.000047811238,0.0008061778,0.0001449414,0.000039114497,0.00019738874,0.0008617521,0.03125103,0.006135321,0.919365,0.0009010017,0.04022522],"study_design_scores_gemma":[0.00004061514,0.00013992013,0.00047505362,0.000110540146,0.00008509423,0.0004797681,0.00051464216,0.20084564,0.009471114,0.71439284,0.07338686,0.000057838715],"about_ca_topic_score_codex":0.001731421,"about_ca_topic_score_gemma":0.0023517197,"teacher_disagreement_score":0.0030278394,"about_ca_system_score_codex":0.0012410347,"about_ca_system_score_gemma":0.002408041,"threshold_uncertainty_score":0.012111127},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06303732,0.0011967436,0.89194745,0.0010910222,0.00011666316,0.0007820877,0.00024717877,0.021095676,0.02048577],"genre_scores_gemma":[0.18866391,0.00044583372,0.80088645,0.00027440416,0.000067800844,0.00043149848,0.0006677169,0.00068105885,0.007881261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974445,0.0010024203,0.0002122494,0.00029776,0.00082104316,0.00022207364],"domain_scores_gemma":[0.99444026,0.0027586045,0.00029672758,0.0015212074,0.00067781785,0.00030538125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005266942,0.0005598694,0.0010856723,0.0032931312,0.0012841846,0.0041573374,0.0018564155,0.0012073456,0.00555083],"category_scores_gemma":[0.009406989,0.00074663677,0.0006799997,0.0035018742,0.0014696607,0.007569733,0.0028503933,0.0013895048,0.0028632283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081152946,0.0012249949,0.0030083202,0.0009473618,0.00017320686,0.0006284134,0.0047904537,0.0070408867,0.023794077,0.06803857,0.015337846,0.87420434],"study_design_scores_gemma":[0.0015443112,0.0032171106,0.0089046275,0.0008418772,0.0013012895,0.0028581803,0.004290162,0.18399721,0.13419738,0.2642085,0.39380652,0.0008328431],"about_ca_topic_score_codex":0.004185399,"about_ca_topic_score_gemma":0.005470481,"teacher_disagreement_score":0.00555083,"about_ca_system_score_codex":0.001111611,"about_ca_system_score_gemma":0.002316186,"threshold_uncertainty_score":0.027854621},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12374523,0.00059129944,0.8451614,0.0018928802,0.00010410274,0.0012652507,0.00042560176,0.0030209895,0.023793358],"genre_scores_gemma":[0.33860746,0.00031816523,0.6570053,0.00022938185,0.000042068867,0.0005110834,0.00061646244,0.00044880903,0.0022212192],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965025,0.0022360317,0.0001917086,0.00043080442,0.00048062453,0.00015832539],"domain_scores_gemma":[0.9886645,0.008260388,0.00092369964,0.0007843256,0.0010233623,0.0003437906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004221052,0.00087820645,0.0005151829,0.0024435427,0.0012748435,0.0030553567,0.0012823269,0.0010986793,0.0047401534],"category_scores_gemma":[0.025596224,0.00068923447,0.0005808915,0.0010324371,0.0022714452,0.004698642,0.0015405297,0.0014880884,0.0013855841],"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.00065624295,0.0005009006,0.0071305935,0.0015644293,0.00009874668,0.0009405205,0.018119356,0.04453333,0.035642955,0.41013968,0.012095708,0.46857753],"study_design_scores_gemma":[0.0005932039,0.00066258485,0.004318464,0.00090676703,0.00023571154,0.0005824211,0.012250324,0.3057097,0.057646662,0.51746684,0.09937781,0.00024953412],"about_ca_topic_score_codex":0.0011360315,"about_ca_topic_score_gemma":0.0030013565,"teacher_disagreement_score":0.0047401534,"about_ca_system_score_codex":0.0014927875,"about_ca_system_score_gemma":0.002316942,"threshold_uncertainty_score":0.02232331},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029000387,0.00086668454,0.87226605,0.0037164188,0.00021870034,0.00034824465,0.00029902885,0.0005451527,0.09273929],"genre_scores_gemma":[0.7875039,0.00054216845,0.19504131,0.0010869475,0.00021553777,0.0006630574,0.0002962079,0.000121864694,0.014528966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926886,0.0024535405,0.00046957802,0.0016899547,0.0021522366,0.0005460893],"domain_scores_gemma":[0.9877023,0.00595791,0.0013442725,0.0029699018,0.0016057105,0.00041996557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007512202,0.00084845297,0.00070168474,0.0016145548,0.0016480797,0.0032923035,0.0032953734,0.0024754428,0.009977345],"category_scores_gemma":[0.02032734,0.0006074399,0.0022685803,0.0011802146,0.0076851672,0.011594356,0.0047068777,0.0045566433,0.00082269986],"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.000026257323,0.00002517138,0.00051415106,0.00006783801,0.00003254583,0.00011795109,0.001069492,0.0021304667,0.00025919647,0.98432827,0.00060288265,0.010825695],"study_design_scores_gemma":[0.00002998043,0.000047033598,0.00039179774,0.000060072212,0.000047900827,0.00020117595,0.00024153202,0.015103781,0.00064094295,0.97249514,0.010714113,0.000026475456],"about_ca_topic_score_codex":0.0028225137,"about_ca_topic_score_gemma":0.0024994975,"teacher_disagreement_score":0.009977345,"about_ca_system_score_codex":0.0035722824,"about_ca_system_score_gemma":0.0019389727,"threshold_uncertainty_score":0.03972876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051710773,0.00020038866,0.98699653,0.00016665009,0.000055404984,0.00030894965,0.00063450955,0.003516188,0.0029502737],"genre_scores_gemma":[0.040656917,0.00018561498,0.9546927,0.00016336376,0.000027869699,0.00036990116,0.002192333,0.00029429718,0.0014171022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975604,0.00075647695,0.00029644213,0.0004388269,0.00084178016,0.00010602054],"domain_scores_gemma":[0.99134606,0.0058898954,0.00035359245,0.0009695573,0.0012818752,0.00015905712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033223047,0.0010121969,0.0007075887,0.0019027167,0.0005520194,0.0015870928,0.0018237602,0.0009080859,0.006245567],"category_scores_gemma":[0.014489724,0.0006195419,0.0018671206,0.0013871383,0.00060774304,0.0018362865,0.0013730321,0.0023112218,0.0033809512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002803567,0.0003236783,0.0031286182,0.0009279143,0.0001667051,0.00027802645,0.00039214766,0.0933869,0.007585314,0.041868813,0.019594355,0.83206713],"study_design_scores_gemma":[0.00014193896,0.00018143418,0.0006598811,0.00020555167,0.00008422921,0.00042142646,0.000093592425,0.8553998,0.019714667,0.07347231,0.04956841,0.000056800352],"about_ca_topic_score_codex":0.0015117157,"about_ca_topic_score_gemma":0.0025063334,"teacher_disagreement_score":0.006245567,"about_ca_system_score_codex":0.0007677093,"about_ca_system_score_gemma":0.0015957252,"threshold_uncertainty_score":0.020893455},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8769612,0.010627514,0.094701864,0.0007287888,0.00016637765,0.00040092942,0.00083474047,0.00083729654,0.014741446],"genre_scores_gemma":[0.9457781,0.001714945,0.049754035,0.000060059196,0.000030319823,0.00025621773,0.0011860337,0.00011565886,0.0011046154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99401504,0.00259849,0.0004991932,0.00070232735,0.0019781576,0.00020672542],"domain_scores_gemma":[0.9521468,0.03903145,0.0021555484,0.0028124005,0.0033738555,0.0004799491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006665704,0.00050506863,0.0005100216,0.002967413,0.000634509,0.001169445,0.0012007379,0.0009971572,0.0016715627],"category_scores_gemma":[0.056628708,0.00019702828,0.0004563929,0.0027172186,0.00064541824,0.0024476105,0.0008658539,0.00071409164,0.0003653728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012118134,0.0010029878,0.07782466,0.0018842052,0.0007679057,0.00018000031,0.00092830946,0.37461233,0.003525484,0.014203243,0.0041274787,0.5197316],"study_design_scores_gemma":[0.00036284575,0.0035354716,0.06064655,0.0003776332,0.00044368373,0.001302621,0.0023522822,0.89302975,0.0073065986,0.013653928,0.016871847,0.0001168494],"about_ca_topic_score_codex":0.0019520415,"about_ca_topic_score_gemma":0.0029912486,"teacher_disagreement_score":0.006665704,"about_ca_system_score_codex":0.0010418186,"about_ca_system_score_gemma":0.00094619225,"threshold_uncertainty_score":0.035252035},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032228272,0.0007175133,0.9394493,0.00052720914,0.00014164603,0.00018128849,0.0011871911,0.020104863,0.0054626786],"genre_scores_gemma":[0.17987916,0.00054451375,0.79989403,0.00064584956,0.00012966829,0.00025342993,0.0073898206,0.004008116,0.007255393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863213,0.00029071618,0.00008551662,0.00043360272,0.00044242342,0.00011565126],"domain_scores_gemma":[0.99617934,0.0016483421,0.00018666516,0.0009766527,0.0009400031,0.00006895832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016250182,0.0018095537,0.0013357353,0.0022820225,0.0011793952,0.001643591,0.0017091841,0.0014744421,0.0059219],"category_scores_gemma":[0.0063598542,0.00097599276,0.0020127678,0.0026354627,0.0010050485,0.004469861,0.0025594912,0.0025524439,0.00552641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031351653,0.0003365258,0.004019264,0.00058094645,0.00017082613,0.0005506768,0.0009496248,0.04556454,0.059206925,0.022483872,0.05486299,0.8109604],"study_design_scores_gemma":[0.000103344944,0.0001918821,0.0038886266,0.00008391859,0.0003100406,0.0007112233,0.00038925983,0.8091412,0.08087538,0.061308194,0.042845078,0.00015192303],"about_ca_topic_score_codex":0.0055918335,"about_ca_topic_score_gemma":0.008839694,"teacher_disagreement_score":0.0059219,"about_ca_system_score_codex":0.0008084552,"about_ca_system_score_gemma":0.0028230948,"threshold_uncertainty_score":0.019810736},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062596337,0.00030103864,0.99212015,0.00007279912,0.000029787509,0.00003571458,0.00011394992,0.0007756791,0.00029139346],"genre_scores_gemma":[0.30503696,0.0006961656,0.68942654,0.00020125051,0.00023383752,0.0003246884,0.0019078729,0.0003017146,0.0018709445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681014,0.0011348816,0.00022946368,0.00065793947,0.0009046047,0.0002629302],"domain_scores_gemma":[0.99383575,0.0028975436,0.0007266991,0.0011787488,0.0011465118,0.00021468854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030361833,0.0013991998,0.0022690077,0.0034469983,0.001063716,0.0018284625,0.0021756608,0.0014224165,0.0013658453],"category_scores_gemma":[0.01064933,0.0006162047,0.0016681277,0.0035546417,0.0010929066,0.0022812074,0.0028518357,0.002260028,0.0010922478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002972281,0.00026240162,0.007435964,0.00026877483,0.00040585938,0.00020661078,0.0003358276,0.38671243,0.0068765488,0.02667286,0.0058154026,0.5647101],"study_design_scores_gemma":[0.0000077077975,0.00004485788,0.0007738988,0.000020580586,0.000017695258,0.00008171879,0.000050417704,0.9751561,0.0015440219,0.020622067,0.0016593934,0.000021517977],"about_ca_topic_score_codex":0.0039941138,"about_ca_topic_score_gemma":0.0042459457,"teacher_disagreement_score":0.0039941138,"about_ca_system_score_codex":0.0006964314,"about_ca_system_score_gemma":0.0012793483,"threshold_uncertainty_score":0.016057074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052770334,0.00096455176,0.9723521,0.0020540694,0.00012851127,0.000040834508,0.0002731698,0.00018486854,0.018724829],"genre_scores_gemma":[0.4066162,0.0058134133,0.55777913,0.0028178073,0.0011416381,0.00060932705,0.0013132683,0.0004703268,0.023438906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977769,0.0010610247,0.00010417611,0.0005468765,0.0003745013,0.00013644143],"domain_scores_gemma":[0.9924165,0.0053920993,0.00044415763,0.0008301764,0.0005929287,0.00032413154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034653544,0.00087320706,0.0007261837,0.0023071792,0.0014826505,0.00257231,0.0016722254,0.001771097,0.009328313],"category_scores_gemma":[0.014871353,0.00067836983,0.0013619486,0.0017100135,0.0040509603,0.0075659296,0.0031543255,0.0034217187,0.001173089],"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.000006408199,0.0000050928334,0.00020796384,0.000035452962,0.000012074797,0.000032873355,0.00006989553,0.022168154,0.00012633677,0.96695954,0.0011998736,0.009176368],"study_design_scores_gemma":[0.0000023914613,0.0000036755011,0.000063391664,0.000017360933,0.000003724196,0.000017317825,0.0000096441445,0.036450952,0.000065514294,0.9578441,0.0055164415,0.000005424573],"about_ca_topic_score_codex":0.004553952,"about_ca_topic_score_gemma":0.004055517,"teacher_disagreement_score":0.009328313,"about_ca_system_score_codex":0.0026058992,"about_ca_system_score_gemma":0.0010899703,"threshold_uncertainty_score":0.03120631},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5171467,0.001238547,0.47585762,0.00049981585,0.000051387822,0.00020179813,0.0008164395,0.00037168813,0.0038159138],"genre_scores_gemma":[0.93208736,0.00038373377,0.06506326,0.00006399296,0.00006314208,0.00007965815,0.00066207524,0.00003115468,0.0015656694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998909,0.00030462482,0.00005525112,0.00043224343,0.00017894364,0.00011994361],"domain_scores_gemma":[0.9957045,0.0021048037,0.0009377065,0.00046297043,0.00050998555,0.00027995586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012597302,0.00059456466,0.00076205854,0.0043948144,0.0011163482,0.0013264278,0.0010031187,0.0012222385,0.0010981681],"category_scores_gemma":[0.0074989884,0.00046795566,0.0007657128,0.0027559432,0.0007496707,0.0033547191,0.0014828001,0.0007251084,0.00046311232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012523665,0.00086904527,0.31986684,0.0009532488,0.0006432898,0.0017908358,0.007864791,0.07243776,0.043392282,0.07890186,0.008849476,0.46317825],"study_design_scores_gemma":[0.00003801196,0.00017737735,0.04889298,0.00008700991,0.00014344606,0.0014114048,0.0029404913,0.86949044,0.008205867,0.060408402,0.008094731,0.00010987457],"about_ca_topic_score_codex":0.0045716637,"about_ca_topic_score_gemma":0.0070526074,"teacher_disagreement_score":0.0045716637,"about_ca_system_score_codex":0.0006244637,"about_ca_system_score_gemma":0.000490371,"threshold_uncertainty_score":0.009090126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8236721,0.0038803532,0.093480766,0.0053081354,0.00084295264,0.0008970392,0.017040193,0.026403053,0.028475441],"genre_scores_gemma":[0.83717674,0.000645937,0.11929394,0.0013570361,0.000215967,0.00041458604,0.032635067,0.0015166851,0.006744047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99345917,0.002866832,0.0005824695,0.0011380535,0.0015250263,0.00042850192],"domain_scores_gemma":[0.97601753,0.015621276,0.0006903685,0.003413766,0.0037089947,0.0005480279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051793465,0.0010597359,0.0008039875,0.0046474542,0.0020269773,0.0026170996,0.0011304473,0.002621264,0.0031048479],"category_scores_gemma":[0.02441605,0.00030027493,0.0007738206,0.0029881487,0.0010991556,0.0038391652,0.0039290385,0.00131667,0.002498297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002208109,0.0022150239,0.06954047,0.0034925765,0.0006190834,0.02310375,0.013733193,0.018207962,0.03309835,0.0143196145,0.13090667,0.6885552],"study_design_scores_gemma":[0.0006717235,0.0013567985,0.06237429,0.0009468114,0.0004530386,0.016804075,0.012849322,0.21487266,0.15662874,0.02302644,0.50961024,0.00040581237],"about_ca_topic_score_codex":0.01360348,"about_ca_topic_score_gemma":0.013190681,"teacher_disagreement_score":0.01360348,"about_ca_system_score_codex":0.0010713781,"about_ca_system_score_gemma":0.0011997666,"threshold_uncertainty_score":0.027391315},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013543308,0.007891956,0.36070168,0.0022096827,0.0006036566,0.0022645057,0.19397138,0.38665152,0.032162342],"genre_scores_gemma":[0.053720646,0.0038935866,0.55617857,0.0015955424,0.00028257386,0.0016216277,0.3451876,0.014292798,0.023227062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982377,0.0003738505,0.00037834354,0.00032389536,0.0005721104,0.00011404254],"domain_scores_gemma":[0.99570835,0.0020785348,0.00036954743,0.00052542967,0.00086999364,0.00044819026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026968687,0.0013663456,0.0014615024,0.011652589,0.0010064173,0.0030377195,0.0016359478,0.001468584,0.03136673],"category_scores_gemma":[0.011815086,0.0006426981,0.0011551023,0.0072074817,0.00039635258,0.004148209,0.0040715085,0.0008249843,0.026829232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015518484,0.00030733852,0.0027720889,0.0095222,0.0006783843,0.0016069667,0.00063182914,0.0027297663,0.040058047,0.019900747,0.40422955,0.5160112],"study_design_scores_gemma":[0.00068351056,0.00028227124,0.008172067,0.0013465664,0.000475258,0.0027294622,0.00042611017,0.03586391,0.037452284,0.027667137,0.88451886,0.00038254724],"about_ca_topic_score_codex":0.0024263645,"about_ca_topic_score_gemma":0.004521331,"teacher_disagreement_score":0.03136673,"about_ca_system_score_codex":0.0008852556,"about_ca_system_score_gemma":0.002516822,"threshold_uncertainty_score":0.10493219},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02412198,0.00015347279,0.9728579,0.0002984947,0.00004244559,0.000036944955,0.0006955138,0.0006950165,0.0010982783],"genre_scores_gemma":[0.52655613,0.00044783135,0.466902,0.00027448643,0.000077937206,0.00019682164,0.0021829074,0.00034837882,0.00301354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990577,0.0003050272,0.0000821564,0.00017546516,0.00031805076,0.00006157327],"domain_scores_gemma":[0.99600095,0.0021402526,0.0003643084,0.0009182772,0.0004918564,0.0000843052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012576364,0.000503884,0.000675482,0.0011853589,0.00033559639,0.0011352542,0.0011909112,0.0006022881,0.0031309624],"category_scores_gemma":[0.009805746,0.00035804338,0.00072955305,0.0016161414,0.00070006703,0.0027065973,0.0016220115,0.0017498112,0.00049060455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027058352,0.00007239726,0.003188574,0.00019074976,0.00007773614,0.00032704393,0.0002485369,0.6161529,0.004961403,0.18363865,0.007060027,0.18381146],"study_design_scores_gemma":[0.0000060036255,0.000009898153,0.00016917137,0.000013700091,0.0000074546642,0.00004697011,0.000015742608,0.9493122,0.0017748885,0.047343723,0.0012930647,0.0000071678437],"about_ca_topic_score_codex":0.004203601,"about_ca_topic_score_gemma":0.005727305,"teacher_disagreement_score":0.004203601,"about_ca_system_score_codex":0.001032086,"about_ca_system_score_gemma":0.0015580032,"threshold_uncertainty_score":0.010474145},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014806283,0.00010560134,0.9818987,0.00024788204,0.000028184038,0.0001265027,0.000102442566,0.0016113373,0.0010730337],"genre_scores_gemma":[0.13198097,0.000057309015,0.86639744,0.00017610955,0.000034392902,0.00011656058,0.00031326458,0.00027522337,0.0006488462],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901335,0.005472517,0.00050891563,0.0015270644,0.0020667121,0.0002912246],"domain_scores_gemma":[0.9543649,0.036172796,0.0019973023,0.0040015746,0.0025913836,0.00087194156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00580009,0.0013974806,0.0012460289,0.0034257649,0.0012947095,0.0019921616,0.0024510056,0.0016958273,0.0054318793],"category_scores_gemma":[0.04219941,0.0008628018,0.0017267837,0.002467585,0.0022969893,0.0041988012,0.0032863517,0.003873972,0.0012836325],"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.0012012278,0.0005482285,0.0068810736,0.00034672927,0.0002425686,0.00028671767,0.00045378588,0.07984142,0.014260166,0.0772221,0.006699147,0.8120167],"study_design_scores_gemma":[0.00021295801,0.0001916391,0.0017558335,0.00007327787,0.000084507374,0.00030174258,0.00011839331,0.83808976,0.013404895,0.14012948,0.0055539305,0.0000836105],"about_ca_topic_score_codex":0.0037709342,"about_ca_topic_score_gemma":0.004568377,"teacher_disagreement_score":0.00580009,"about_ca_system_score_codex":0.0011224584,"about_ca_system_score_gemma":0.0022543385,"threshold_uncertainty_score":0.03067416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034658052,0.00042817654,0.96000266,0.0010359611,0.0000375961,0.0001547532,0.000053332755,0.00022604757,0.0034033908],"genre_scores_gemma":[0.4288119,0.00024064966,0.5674117,0.0005161631,0.00011450208,0.0004294117,0.00023419718,0.000089167086,0.0021523528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542725,0.0021588558,0.0002890115,0.0009892875,0.0009282087,0.00020736828],"domain_scores_gemma":[0.9802138,0.01341461,0.001263679,0.0026939376,0.0017868237,0.000627176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008755038,0.00073694525,0.0011307088,0.0026685784,0.0013026778,0.002382319,0.0029507393,0.0012664462,0.0026473124],"category_scores_gemma":[0.025353843,0.00040750435,0.0009386306,0.0019469468,0.0028691073,0.005888539,0.0040018666,0.0027588147,0.00057371065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025524892,0.0003686813,0.0069170287,0.00020928922,0.00010204524,0.00015478373,0.0018572392,0.06442801,0.0028274977,0.28575397,0.004413621,0.63271254],"study_design_scores_gemma":[0.000027056823,0.00005289962,0.0006516201,0.000065129294,0.00003229898,0.00008681359,0.00026050126,0.64253443,0.0024318572,0.34945464,0.0043759197,0.00002688021],"about_ca_topic_score_codex":0.0015980136,"about_ca_topic_score_gemma":0.0016941485,"teacher_disagreement_score":0.008755038,"about_ca_system_score_codex":0.001729183,"about_ca_system_score_gemma":0.0012559263,"threshold_uncertainty_score":0.046301663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44409132,0.0015573485,0.5464627,0.00046709873,0.0003056069,0.00015356412,0.0006091852,0.0036497696,0.0027033112],"genre_scores_gemma":[0.9509104,0.00013729511,0.04696574,0.000032129126,0.000033632907,0.000054369848,0.00044825533,0.000028327475,0.0013898783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951637,0.0001364294,0.000049459166,0.00011292977,0.00012086375,0.00006406744],"domain_scores_gemma":[0.99910164,0.00042246823,0.000067334535,0.000103114864,0.000254941,0.00005055856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008548374,0.0006224924,0.0008346913,0.00077292474,0.00030273286,0.00062035135,0.0005934439,0.0007204301,0.0021985467],"category_scores_gemma":[0.0018342651,0.00013965205,0.0005543322,0.0005443284,0.00014809385,0.00045093804,0.00040526982,0.00072794984,0.00069837575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007354044,0.00050615525,0.00998725,0.00018890187,0.00012151711,0.00011392789,0.00005276532,0.1920887,0.023761325,0.0012562678,0.0065556383,0.7646322],"study_design_scores_gemma":[0.000004424302,0.00003646195,0.0014709427,0.0000047093217,0.000006253831,0.0000146839175,0.000013827601,0.99618196,0.0018534017,0.00020537258,0.0002038004,0.000004225972],"about_ca_topic_score_codex":0.0030065547,"about_ca_topic_score_gemma":0.001785552,"teacher_disagreement_score":0.0030065547,"about_ca_system_score_codex":0.00037800873,"about_ca_system_score_gemma":0.00049022684,"threshold_uncertainty_score":0.0073548555},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03549661,0.000330929,0.96253973,0.00007030025,0.000055831915,0.000026946898,0.00004272172,0.0010700302,0.00036689555],"genre_scores_gemma":[0.6387516,0.00030790846,0.3589103,0.00006912969,0.000115071256,0.00010496028,0.00023950292,0.00012812835,0.0013734354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993512,0.00016010497,0.000054866658,0.0001709035,0.00020305438,0.000059922557],"domain_scores_gemma":[0.9977285,0.0011305328,0.0001834078,0.00032172404,0.00055359304,0.00008231561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015732356,0.00063546066,0.0009864912,0.0007106294,0.00029059523,0.0006752956,0.00097275805,0.00055146904,0.0009142198],"category_scores_gemma":[0.0042549,0.0004348106,0.00056417036,0.0006278848,0.00041665413,0.0012299564,0.0008058732,0.0013719865,0.00025333988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018575585,0.00010528339,0.0031312248,0.000060684102,0.0001391478,0.00006110211,0.000070336944,0.74734765,0.006483789,0.00533134,0.0012013781,0.23588239],"study_design_scores_gemma":[0.0000015406166,0.0000075785106,0.000075158954,0.0000010662445,0.0000025072152,0.0000037451714,0.0000014603428,0.99830365,0.00055433623,0.0009433332,0.00010440691,0.0000011749379],"about_ca_topic_score_codex":0.0038526815,"about_ca_topic_score_gemma":0.0034387086,"teacher_disagreement_score":0.0038526815,"about_ca_system_score_codex":0.000598009,"about_ca_system_score_gemma":0.0008300197,"threshold_uncertainty_score":0.008320153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11776275,0.00029042675,0.87521625,0.0006049265,0.000064059655,0.00008846094,0.00006887105,0.00021998942,0.0056842524],"genre_scores_gemma":[0.98388624,0.000063836975,0.014088384,0.000036450787,0.000013800738,0.000054977096,0.000024287505,0.0000068475942,0.0018250963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990803,0.00033992718,0.000054996355,0.00017332632,0.0002131946,0.00013816223],"domain_scores_gemma":[0.99829775,0.0008461722,0.000244836,0.00005880061,0.0004291148,0.0001233368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014461715,0.0006634026,0.0010057444,0.0006960924,0.0006561227,0.0012774762,0.0014406521,0.0012663485,0.0018337494],"category_scores_gemma":[0.0035029708,0.00035260816,0.0006358681,0.0004926383,0.00081385736,0.0013757948,0.000777069,0.00087906455,0.00019360227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006873135,0.00005214807,0.00092745357,0.00002039427,0.000031593918,0.00009778892,0.0000595402,0.982556,0.0004897424,0.007828002,0.0002581439,0.007610491],"study_design_scores_gemma":[0.0000039690403,0.000008234379,0.000032032884,0.0000012501771,0.0000033531953,0.0000036870838,0.000002831491,0.99907804,0.00003764604,0.0007928189,0.000034368793,0.0000017284838],"about_ca_topic_score_codex":0.02099748,"about_ca_topic_score_gemma":0.009053849,"teacher_disagreement_score":0.02099748,"about_ca_system_score_codex":0.002156135,"about_ca_system_score_gemma":0.0013164681,"threshold_uncertainty_score":0.04175049},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5617146,0.010032024,0.38469338,0.0011018408,0.0006481095,0.0006553603,0.0075907074,0.011651044,0.021913012],"genre_scores_gemma":[0.8446369,0.00097111234,0.13207862,0.0004046145,0.00040608965,0.00028840732,0.014990868,0.0006088186,0.0056145815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959223,0.001697334,0.00029521933,0.0009900136,0.00086405297,0.00023096334],"domain_scores_gemma":[0.9952003,0.002196483,0.00057983893,0.000673598,0.0011034034,0.00024639122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029597962,0.0018621136,0.0011263223,0.0064196656,0.0009366076,0.0015605289,0.0010183171,0.0015777707,0.0028773164],"category_scores_gemma":[0.014072119,0.0003207808,0.0013079105,0.0035109012,0.000638184,0.0050265295,0.0026660655,0.0013650546,0.0033525499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015917914,0.0013546204,0.06294082,0.0018623262,0.00095369737,0.00069950946,0.0013931163,0.059921004,0.052236844,0.008026171,0.05658326,0.7524368],"study_design_scores_gemma":[0.00021065524,0.0018620034,0.060289543,0.0003100938,0.0007697744,0.0011647842,0.0011052187,0.8261307,0.034162223,0.03694007,0.036791734,0.00026317846],"about_ca_topic_score_codex":0.0035911805,"about_ca_topic_score_gemma":0.005251914,"teacher_disagreement_score":0.0064196656,"about_ca_system_score_codex":0.0006013434,"about_ca_system_score_gemma":0.00084052567,"threshold_uncertainty_score":0.015653133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006872779,0.00019217386,0.9827262,0.00031723603,0.0002409998,0.00021321264,0.00008933651,0.0018924555,0.007455637],"genre_scores_gemma":[0.41621464,0.00060295465,0.5493734,0.0006335897,0.00039413743,0.00047569716,0.0006040073,0.0003211357,0.031380456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652714,0.0009034828,0.00042680354,0.00046864114,0.0013632338,0.00031070467],"domain_scores_gemma":[0.99688977,0.00046842577,0.00030207192,0.0016674241,0.0005670561,0.00010515745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020549127,0.0007431871,0.0006125952,0.0010390497,0.0011553558,0.0024939491,0.0018075265,0.0017162625,0.0076346407],"category_scores_gemma":[0.0040151416,0.00045171476,0.0007430249,0.0011191373,0.0013940219,0.005938943,0.0051307245,0.0020778766,0.0044098287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058681227,0.00028169242,0.001957713,0.00039314476,0.00009018414,0.0012598534,0.0007785544,0.03929797,0.048930738,0.47813064,0.01696832,0.4113244],"study_design_scores_gemma":[0.00007845488,0.00031025277,0.0007074866,0.00014562669,0.00006855544,0.0012645444,0.00033275617,0.61563635,0.04150507,0.18730335,0.15250446,0.00014308417],"about_ca_topic_score_codex":0.0006660215,"about_ca_topic_score_gemma":0.00065757654,"teacher_disagreement_score":0.0076346407,"about_ca_system_score_codex":0.0007998103,"about_ca_system_score_gemma":0.0014090791,"threshold_uncertainty_score":0.025540411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05103884,0.00019742412,0.9414642,0.00011528855,0.0000598351,0.00012011218,0.00009941603,0.004970831,0.0019340978],"genre_scores_gemma":[0.40261868,0.00012977648,0.59278256,0.00016353627,0.000087026914,0.00011939322,0.0004183886,0.00043082412,0.003249709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987967,0.00017345865,0.00006384024,0.0004173486,0.00043534162,0.00011338384],"domain_scores_gemma":[0.99880993,0.0003067486,0.0001682542,0.00038365612,0.00028106396,0.000050286664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008058575,0.0006554208,0.0011323208,0.001658137,0.0004581017,0.0014234179,0.0018270549,0.001351133,0.0030149694],"category_scores_gemma":[0.0022673188,0.00055984856,0.0009007067,0.0014553118,0.00084500946,0.0017955832,0.00121121,0.0009852861,0.0015813396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046215983,0.00022125454,0.0034118355,0.00013209732,0.00015286266,0.00018688267,0.0001491784,0.122194044,0.15175837,0.005099598,0.0045497064,0.711682],"study_design_scores_gemma":[0.000016556582,0.00008974087,0.0017048569,0.0000069293046,0.000025124406,0.00012190205,0.000030097632,0.9609482,0.031144017,0.0034222004,0.002470435,0.000019921836],"about_ca_topic_score_codex":0.0030813476,"about_ca_topic_score_gemma":0.0030362285,"teacher_disagreement_score":0.0030813476,"about_ca_system_score_codex":0.0006623451,"about_ca_system_score_gemma":0.00059688516,"threshold_uncertainty_score":0.010086119},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2750774,0.0014813547,0.713342,0.0017143651,0.00011606752,0.00005449867,0.00029725526,0.0008627631,0.0070542367],"genre_scores_gemma":[0.965407,0.00018914533,0.031247115,0.00015683465,0.000053525742,0.000021950334,0.00021198005,0.00003286041,0.0026795396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997501,0.000084986554,0.000009409563,0.00005933476,0.00004195536,0.000054226948],"domain_scores_gemma":[0.999218,0.00047267883,0.00011590543,0.00004003236,0.000108021835,0.000045310033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010385752,0.0007902992,0.00050763175,0.00075397803,0.000265458,0.0007983841,0.0009946802,0.0009405078,0.0014279153],"category_scores_gemma":[0.002092907,0.0003975548,0.00039448065,0.0005940195,0.0003867281,0.0011280649,0.0009675781,0.0015226434,0.00039187458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040074307,0.00035358756,0.010362964,0.00016964403,0.00022144307,0.0002882091,0.00021918798,0.6200373,0.021579668,0.017691279,0.0053302976,0.32334566],"study_design_scores_gemma":[0.0000019441543,0.000008127124,0.0002083545,0.000003922898,0.000004458455,0.00000463187,0.0000068143777,0.99559337,0.0005534619,0.0035076493,0.000105796746,0.0000014539619],"about_ca_topic_score_codex":0.00359984,"about_ca_topic_score_gemma":0.0043042814,"teacher_disagreement_score":0.00359984,"about_ca_system_score_codex":0.00079065404,"about_ca_system_score_gemma":0.0004284367,"threshold_uncertainty_score":0.0071578026},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22983335,0.010238139,0.73504466,0.0027963873,0.0006411823,0.00020995838,0.0027551844,0.008883164,0.009598008],"genre_scores_gemma":[0.8691782,0.0015682864,0.118247576,0.0002609438,0.00021729771,0.00009707623,0.0026205499,0.00009995746,0.00771011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996712,0.000070590046,0.000027791859,0.00009898145,0.00007107262,0.00006037519],"domain_scores_gemma":[0.99937445,0.00027159462,0.00010117449,0.000077028526,0.0001480282,0.000027734422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006563306,0.0008930746,0.00046538073,0.001490021,0.00022820599,0.000794448,0.0009096417,0.0008251667,0.002368678],"category_scores_gemma":[0.0018397394,0.00023149895,0.00059832423,0.001569522,0.00027190562,0.0015978013,0.0005607789,0.001041569,0.0011932896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027772484,0.00024115718,0.002979294,0.00026576768,0.00016605103,0.00015097577,0.000089901485,0.27986777,0.014918017,0.007018047,0.011580707,0.6824445],"study_design_scores_gemma":[0.0000027832164,0.00001090581,0.00037104002,0.0000076184574,0.000008256715,0.000008239033,0.0000068219874,0.99534106,0.0014533086,0.0021537286,0.00063271966,0.0000035884198],"about_ca_topic_score_codex":0.008523537,"about_ca_topic_score_gemma":0.008672189,"teacher_disagreement_score":0.008523537,"about_ca_system_score_codex":0.0010693392,"about_ca_system_score_gemma":0.00055230386,"threshold_uncertainty_score":0.016947806},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009692645,0.002469305,0.984626,0.0002950042,0.00012342485,0.000075600656,0.00028975608,0.0014445924,0.0009836319],"genre_scores_gemma":[0.3959742,0.0033897408,0.5890187,0.00049652066,0.0008523762,0.0005979001,0.002178091,0.00047899596,0.007013365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998185,0.000567945,0.00014621535,0.0004589811,0.00051087566,0.000130966],"domain_scores_gemma":[0.9981407,0.0007610609,0.00021062812,0.00027468597,0.0005555068,0.000057433677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031291246,0.0012012772,0.0015028807,0.0037507496,0.0005063219,0.0013950187,0.0019760204,0.0013689877,0.0021282942],"category_scores_gemma":[0.007734466,0.00044265247,0.0016276569,0.004365838,0.000689491,0.0037838216,0.0010963117,0.0015011121,0.0014948738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003064956,0.00025716927,0.0018952854,0.00043859,0.00024490082,0.0001509045,0.0002382496,0.17933176,0.023036078,0.024937108,0.013062911,0.75610054],"study_design_scores_gemma":[0.000025059207,0.000091897266,0.0011655182,0.000030375244,0.00007247851,0.00013738315,0.000028609618,0.9766987,0.004714698,0.011079753,0.0058986135,0.000056908197],"about_ca_topic_score_codex":0.008849991,"about_ca_topic_score_gemma":0.0072598835,"teacher_disagreement_score":0.008849991,"about_ca_system_score_codex":0.0012688785,"about_ca_system_score_gemma":0.0016299821,"threshold_uncertainty_score":0.01759696},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005407655,0.000091758884,0.9939241,0.00010879099,0.000023961355,0.000050011964,0.000029797164,0.00013249481,0.00023150518],"genre_scores_gemma":[0.29256874,0.0003971983,0.7020338,0.00030745103,0.00021489707,0.00072808366,0.00067429594,0.00020707703,0.0028683345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919268,0.00449056,0.0003559435,0.0017225466,0.0011871303,0.00031707974],"domain_scores_gemma":[0.98483664,0.011684604,0.0008253983,0.0012587635,0.0011077635,0.00028668973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009846555,0.0011495387,0.0027679577,0.0025842574,0.001261789,0.002949773,0.0046249037,0.0018608945,0.0029697826],"category_scores_gemma":[0.038749002,0.0013879237,0.0023711415,0.0024706481,0.0023953165,0.0046979194,0.0040569515,0.0034999808,0.0009324747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004463773,0.0002618059,0.0039807833,0.0003260796,0.0002718175,0.00028960622,0.0010030725,0.531732,0.0037499047,0.19616117,0.0037981963,0.25797907],"study_design_scores_gemma":[0.000013008809,0.000016523529,0.00016330923,0.000014823437,0.000011502579,0.00003570325,0.000029456009,0.9610313,0.00049492036,0.0375316,0.0006408365,0.000017016238],"about_ca_topic_score_codex":0.003836651,"about_ca_topic_score_gemma":0.0032987688,"teacher_disagreement_score":0.009846555,"about_ca_system_score_codex":0.0015432466,"about_ca_system_score_gemma":0.0014810882,"threshold_uncertainty_score":0.052074194},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021951199,0.00032034176,0.97571826,0.00012401392,0.00007924199,0.000041872445,0.00007609604,0.0006145964,0.0010744047],"genre_scores_gemma":[0.6740848,0.00043319789,0.3220614,0.00010042893,0.00022376233,0.00015474425,0.00049162545,0.00016840492,0.002281688],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989247,0.0002164637,0.00005807314,0.00026542155,0.00043284794,0.00010250289],"domain_scores_gemma":[0.9984524,0.00043738805,0.00016024559,0.00014882172,0.0006989204,0.00010220343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019268566,0.0011151572,0.0012897673,0.0034703806,0.0009860384,0.0013958194,0.001350677,0.0011136067,0.001918938],"category_scores_gemma":[0.0044571687,0.0003219914,0.0011427723,0.0020069296,0.00046695463,0.0019458967,0.0013444825,0.00092083775,0.0005904889],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026812847,0.00013302962,0.0043006935,0.000114520015,0.0002667873,0.00014279892,0.00020854878,0.3781649,0.0137654,0.0116076665,0.004659899,0.5863677],"study_design_scores_gemma":[0.0000048234883,0.000020995061,0.0005210689,0.000005429,0.000024462895,0.000025207728,0.000016162867,0.994555,0.0012589177,0.0029022857,0.000654471,0.000011197323],"about_ca_topic_score_codex":0.006478014,"about_ca_topic_score_gemma":0.0052547147,"teacher_disagreement_score":0.006478014,"about_ca_system_score_codex":0.0009969581,"about_ca_system_score_gemma":0.00090895855,"threshold_uncertainty_score":0.012880623},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11312174,0.00015609838,0.87583315,0.0004554401,0.000028810267,0.00010451045,0.0003409089,0.00013207906,0.009827372],"genre_scores_gemma":[0.90538585,0.00014057379,0.09100897,0.00008498687,0.000022944976,0.0001865048,0.00027727822,0.000024957373,0.0028679187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962754,0.0022974557,0.00013959128,0.00048344137,0.0004947633,0.0003093172],"domain_scores_gemma":[0.9919857,0.006028497,0.00060709135,0.00043372257,0.00062117755,0.00032376844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042045075,0.00083453144,0.0007719907,0.0013800221,0.0005664615,0.0016508137,0.0010549889,0.0010462138,0.0056318967],"category_scores_gemma":[0.0113138445,0.0004446537,0.00093600765,0.0014878453,0.0017409596,0.0034491103,0.0015161227,0.0015138476,0.00031573928],"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.00028282468,0.00009727682,0.0022344254,0.0001127382,0.00007573737,0.00017641099,0.00017919112,0.716426,0.0010138826,0.25187308,0.0009164013,0.026611978],"study_design_scores_gemma":[0.000013778607,0.00004623046,0.00035752624,0.000016658001,0.000014933517,0.00002960194,0.000030763134,0.87503403,0.00033000953,0.12351259,0.00059849396,0.000015399699],"about_ca_topic_score_codex":0.0041974597,"about_ca_topic_score_gemma":0.0044716857,"teacher_disagreement_score":0.0056318967,"about_ca_system_score_codex":0.001969209,"about_ca_system_score_gemma":0.0008830517,"threshold_uncertainty_score":0.02223587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13320237,0.00040747854,0.86223745,0.0006256841,0.00005130851,0.00014865,0.00020969147,0.00023803092,0.0028794603],"genre_scores_gemma":[0.88950497,0.00020547233,0.1080558,0.00014018707,0.0000847007,0.0001187903,0.00030448186,0.000031519252,0.0015540884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98592377,0.008422916,0.00065581873,0.0021957776,0.0022501468,0.00055156474],"domain_scores_gemma":[0.90854925,0.06935432,0.005580369,0.011798339,0.004064527,0.00065322645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024527656,0.00084302743,0.0021970607,0.0017104669,0.000873674,0.003102253,0.002755837,0.0022837578,0.0015267173],"category_scores_gemma":[0.093813464,0.00067629095,0.001174801,0.0017802047,0.001962785,0.004559138,0.0013867875,0.0024108961,0.00050092547],"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.0010833573,0.00022653939,0.026971744,0.00045950562,0.000782424,0.00024955077,0.0011920898,0.5898328,0.0023216286,0.18419456,0.0035664756,0.18911931],"study_design_scores_gemma":[0.000049118247,0.00007889757,0.0029863806,0.000043127788,0.00005696691,0.00007417624,0.0000921555,0.90959996,0.0008645385,0.08529534,0.0008184259,0.000040972838],"about_ca_topic_score_codex":0.0053704027,"about_ca_topic_score_gemma":0.0038201115,"teacher_disagreement_score":0.024527656,"about_ca_system_score_codex":0.0015270248,"about_ca_system_score_gemma":0.00097258424,"threshold_uncertainty_score":0.12971616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03300965,0.00021223123,0.96218157,0.0004998012,0.000040221996,0.00016114488,0.00007446614,0.00092257647,0.0028983392],"genre_scores_gemma":[0.41790238,0.00015141562,0.5794657,0.0002491629,0.000067020745,0.0002820974,0.00019591246,0.00013261025,0.0015537051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998103,0.0008413798,0.00012771676,0.0002877258,0.00042321926,0.00021698415],"domain_scores_gemma":[0.99458224,0.0041965335,0.00030788465,0.00029056592,0.0005165934,0.00010619943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027670998,0.00085371005,0.0010276859,0.0012303969,0.00070754584,0.0014948309,0.0016023528,0.00104547,0.0029376796],"category_scores_gemma":[0.009129338,0.0006268256,0.0010278382,0.0009941653,0.0011672926,0.0018520233,0.0011061644,0.0013992958,0.00036592528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012954784,0.00020817819,0.0008806404,0.00011198906,0.00006030656,0.00005806493,0.00006358499,0.86650276,0.0013159326,0.02049378,0.0012268015,0.10894838],"study_design_scores_gemma":[0.00001072602,0.000008540738,0.000037623286,0.0000036558483,0.0000059560994,0.000003384365,0.0000053169,0.9936458,0.0003484098,0.005744525,0.00018399773,0.0000021233095],"about_ca_topic_score_codex":0.0075301705,"about_ca_topic_score_gemma":0.008846406,"teacher_disagreement_score":0.0075301705,"about_ca_system_score_codex":0.002146317,"about_ca_system_score_gemma":0.0030770237,"threshold_uncertainty_score":0.015572727},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.723938,0.00046421142,0.26827255,0.00031253614,0.0000689787,0.000107329346,0.0004603005,0.0036753714,0.0027008108],"genre_scores_gemma":[0.9584144,0.00009406982,0.038494945,0.000083482206,0.000028394692,0.000029044859,0.00083747855,0.000039187664,0.0019789778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944264,0.0000885478,0.00004704335,0.00015270899,0.00013702238,0.0001319936],"domain_scores_gemma":[0.99916434,0.00020825739,0.00018979184,0.00011926971,0.00025679424,0.00006155736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005105946,0.00072569284,0.0005630884,0.0024787665,0.00037085917,0.0007666774,0.00074188295,0.00065354205,0.00058125146],"category_scores_gemma":[0.001362232,0.00023881273,0.0004543255,0.001086264,0.00039623698,0.0007551238,0.00066046574,0.0005586274,0.0005462895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058152137,0.0008418259,0.0548476,0.00014005593,0.00014117216,0.000554517,0.00036584467,0.15469694,0.037731495,0.0027187408,0.010371194,0.7370091],"study_design_scores_gemma":[0.0000027717201,0.000022735183,0.0025731043,0.0000046837254,0.0000094062,0.000036125733,0.000032269538,0.9928229,0.0038287095,0.00036958704,0.00029206794,0.000005571098],"about_ca_topic_score_codex":0.0065223663,"about_ca_topic_score_gemma":0.0051298114,"teacher_disagreement_score":0.0065223663,"about_ca_system_score_codex":0.000666159,"about_ca_system_score_gemma":0.00049759704,"threshold_uncertainty_score":0.012968779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036930726,0.00006946529,0.9958402,0.000044249762,0.0000066324365,0.000022369728,0.000020668602,0.00015579036,0.00014750722],"genre_scores_gemma":[0.16178426,0.00024391068,0.8351122,0.00009990561,0.00005482265,0.0002059339,0.00047573473,0.00022550649,0.0017976391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983084,0.00077793346,0.00010880046,0.00034157297,0.0003361664,0.00012709489],"domain_scores_gemma":[0.99686253,0.0017323366,0.0002954758,0.00038548937,0.00060697517,0.00011724287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003528874,0.0013927196,0.001740267,0.002714456,0.0009813337,0.0013006093,0.0029322626,0.0014651038,0.0019187973],"category_scores_gemma":[0.010240764,0.00079842855,0.001832259,0.0021682922,0.0012380541,0.00228022,0.0018919602,0.0016327702,0.001152009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020667382,0.00010616198,0.002053701,0.00016112452,0.00014939191,0.000096600015,0.0003436602,0.7157964,0.006128401,0.05007675,0.002773196,0.22210793],"study_design_scores_gemma":[0.0000027282476,0.0000059426447,0.00010799802,0.0000038904377,0.0000035710539,0.000011172445,0.0000076107467,0.9927059,0.00040195897,0.006512379,0.00022763037,0.0000092905475],"about_ca_topic_score_codex":0.010708533,"about_ca_topic_score_gemma":0.010509834,"teacher_disagreement_score":0.010708533,"about_ca_system_score_codex":0.0015767976,"about_ca_system_score_gemma":0.001415328,"threshold_uncertainty_score":0.021292448},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050778385,0.0003070325,0.9454567,0.0004076492,0.00006540947,0.000161852,0.000104861996,0.0015373608,0.0011808518],"genre_scores_gemma":[0.7895934,0.00014706903,0.20798609,0.00019201807,0.00008528856,0.00021266646,0.00022604638,0.00006482034,0.0014927089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983151,0.00059988134,0.000096388554,0.00037692848,0.00044183864,0.00016979413],"domain_scores_gemma":[0.9936727,0.0032017843,0.00048310796,0.00069434225,0.0016562726,0.00029184917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041570175,0.00074881216,0.0011662068,0.0015841277,0.0005882843,0.0012461251,0.003299887,0.0012144343,0.0015953402],"category_scores_gemma":[0.009502709,0.0004532831,0.0006268259,0.0010357567,0.0010753896,0.0026155382,0.0013838961,0.0018519255,0.00045703902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045352816,0.0008006526,0.00882213,0.00012437509,0.00012344745,0.00031014712,0.0002082386,0.74969846,0.0033209939,0.017237812,0.0034494197,0.21545076],"study_design_scores_gemma":[0.0000051537477,0.000023953204,0.00016389898,0.0000018260429,0.0000048584216,0.000013326003,0.000006916387,0.9959557,0.00037255202,0.003259037,0.00018884384,0.0000038399244],"about_ca_topic_score_codex":0.0066369213,"about_ca_topic_score_gemma":0.0057549346,"teacher_disagreement_score":0.0066369213,"about_ca_system_score_codex":0.001568734,"about_ca_system_score_gemma":0.001663598,"threshold_uncertainty_score":0.021984696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032049052,0.00023570223,0.9636758,0.00024106402,0.000069041766,0.00006414812,0.000119994285,0.0023442076,0.0012010214],"genre_scores_gemma":[0.76594317,0.000108698856,0.22999181,0.00039618957,0.00011123519,0.00014237784,0.00057520176,0.00017452236,0.0025568656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697864,0.0008871222,0.00020268073,0.0009375871,0.0007026226,0.00029145306],"domain_scores_gemma":[0.99450994,0.0018770274,0.00036281146,0.001879088,0.001201238,0.0001699783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003955287,0.0013696691,0.0019840996,0.0011314421,0.00096654985,0.0016400339,0.0024891319,0.0016780116,0.0016948453],"category_scores_gemma":[0.012542906,0.0004653874,0.0008798158,0.0013523586,0.001322705,0.0025588728,0.0021490506,0.0018602668,0.0007350277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037231218,0.0002494229,0.002626857,0.00007381285,0.00014176818,0.00010508355,0.00009318545,0.6930203,0.0030188307,0.008603396,0.0043130065,0.28738198],"study_design_scores_gemma":[0.000012411372,0.000035841505,0.00014958193,0.0000051077136,0.000009214821,0.000024174567,0.000009180243,0.99104965,0.0011776886,0.0072342274,0.00028691572,0.0000060165044],"about_ca_topic_score_codex":0.004701649,"about_ca_topic_score_gemma":0.0043696887,"teacher_disagreement_score":0.004701649,"about_ca_system_score_codex":0.0013032362,"about_ca_system_score_gemma":0.002042368,"threshold_uncertainty_score":0.020917833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12330357,0.00042503676,0.8634489,0.00027490058,0.00005848664,0.00015028012,0.00014542647,0.0030427459,0.009150612],"genre_scores_gemma":[0.70396334,0.00013220399,0.29238215,0.00022462934,0.000027392794,0.00020326693,0.0004865464,0.0003358486,0.00224468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914956,0.00039263855,0.000032838998,0.00015096867,0.00016561162,0.00010837495],"domain_scores_gemma":[0.9984902,0.0009064634,0.00013274602,0.00017756266,0.00020988603,0.00008319766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012395374,0.0006298741,0.00081757864,0.0007503483,0.0003440654,0.0006742021,0.0013817061,0.0005781174,0.0028403304],"category_scores_gemma":[0.0031569116,0.0003147481,0.0006394699,0.0010206496,0.0008071601,0.00064613,0.0012122269,0.0008438886,0.0006564632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016291352,0.00016901613,0.00078589754,0.00010970424,0.000043898373,0.00006006717,0.000051204577,0.9199789,0.003007436,0.013460152,0.0033886405,0.058782123],"study_design_scores_gemma":[0.000022196813,0.000032212258,0.00005759793,0.0000047738636,0.000005369513,0.0000071704444,0.0000066247253,0.99712604,0.00085234584,0.0015960579,0.00028677526,0.0000028327856],"about_ca_topic_score_codex":0.0042635617,"about_ca_topic_score_gemma":0.0049080644,"teacher_disagreement_score":0.0042635617,"about_ca_system_score_codex":0.000900168,"about_ca_system_score_gemma":0.0014509789,"threshold_uncertainty_score":0.009501874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20539181,0.001218914,0.78449976,0.0014717191,0.00010899771,0.00030598525,0.0011115933,0.0017027705,0.0041885152],"genre_scores_gemma":[0.85608715,0.0002219824,0.13877872,0.00029944186,0.00010252295,0.00019282964,0.0015568179,0.00006507836,0.0026953404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921644,0.00027834653,0.000046042715,0.00021069794,0.00011947903,0.00012893188],"domain_scores_gemma":[0.9958717,0.0027807094,0.0005105127,0.00023344503,0.00038390077,0.00021974808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022872875,0.00094242423,0.0007851068,0.003061987,0.0006488301,0.0012195627,0.0020000983,0.0017588321,0.00231469],"category_scores_gemma":[0.0067232884,0.0005384935,0.00057422277,0.0014958619,0.0009177348,0.0016458014,0.0012917073,0.0017234776,0.00046435956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019634987,0.00031931928,0.017182162,0.00014568318,0.00015035397,0.00019267447,0.00015046643,0.76940435,0.0009709128,0.0113723595,0.0053018993,0.19461338],"study_design_scores_gemma":[0.0000037285047,0.000013205429,0.00026491834,0.000008484091,0.0000046144273,0.000007134598,0.000011814184,0.9954261,0.000115630326,0.003973474,0.00016880604,0.0000021923138],"about_ca_topic_score_codex":0.007087604,"about_ca_topic_score_gemma":0.011972459,"teacher_disagreement_score":0.007087604,"about_ca_system_score_codex":0.0015198925,"about_ca_system_score_gemma":0.0012059474,"threshold_uncertainty_score":0.014092743},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005375808,0.09256239,0.028032186,0.057018533,0.7729594,0.0003002959,0.00083081296,0.0007009012,0.047057867],"genre_scores_gemma":[0.0029797726,0.07378959,0.0122629,0.02691481,0.795078,0.00025593198,0.0017094977,0.000715741,0.08629376],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99696034,0.0006934148,0.000506628,0.0005675915,0.0010949877,0.00017703987],"domain_scores_gemma":[0.9824823,0.010467249,0.00070985616,0.0009547482,0.0035631876,0.0018226494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037032412,0.001987707,0.0027065137,0.005889125,0.0013727753,0.007413923,0.0023283914,0.0039984887,0.06423379],"category_scores_gemma":[0.013105227,0.00080581824,0.0028446515,0.0046522142,0.0017758919,0.0056769582,0.0028799728,0.0068266666,0.028284317],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002531418,0.00005966472,0.00011116773,0.00041198859,0.000029386312,0.00009400562,0.00005788492,0.00026342133,0.00021936919,0.0030494225,0.9310034,0.06467496],"study_design_scores_gemma":[0.0000130116805,0.000040405197,0.00032677638,0.000344706,0.000017873239,0.0003387722,0.000048862556,0.00028557258,0.00007330117,0.00732691,0.9911675,0.000016195707],"about_ca_topic_score_codex":0.0007878359,"about_ca_topic_score_gemma":0.001456339,"teacher_disagreement_score":0.06423379,"about_ca_system_score_codex":0.001520111,"about_ca_system_score_gemma":0.0014696465,"threshold_uncertainty_score":0.21488339},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19019967,0.00034224152,0.8049204,0.0004309385,0.0000520802,0.00016546238,0.000102324804,0.000592147,0.003194861],"genre_scores_gemma":[0.9769291,0.000084280575,0.021967584,0.000014553747,0.000007666858,0.00006211758,0.00005284832,0.000032026506,0.00084975705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826944,0.0006436352,0.00011397712,0.0003488084,0.00039562446,0.00022851524],"domain_scores_gemma":[0.9856629,0.008616413,0.0015251829,0.0013022559,0.0024642462,0.00042907902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005800236,0.0008097782,0.00083950313,0.0011095755,0.00068462174,0.0012390439,0.0016962286,0.00066750945,0.0016105529],"category_scores_gemma":[0.024050644,0.00042649722,0.0007052422,0.00073693047,0.0010749788,0.0022004773,0.0015508633,0.001522942,0.00021170685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007830943,0.00001940177,0.0008741274,0.000014519688,0.00001535843,0.000010221724,0.00004705671,0.98824894,0.00027135754,0.004626518,0.00017489193,0.0056193224],"study_design_scores_gemma":[0.0000025069328,0.0000118008375,0.000089063426,0.0000016119491,0.000003492019,0.0000027563042,0.000006446831,0.9987835,0.00014423122,0.000906071,0.000045716122,0.0000028384848],"about_ca_topic_score_codex":0.020302888,"about_ca_topic_score_gemma":0.009783686,"teacher_disagreement_score":0.020302888,"about_ca_system_score_codex":0.003148337,"about_ca_system_score_gemma":0.0015916418,"threshold_uncertainty_score":0.04036945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064861635,0.0001442826,0.9924603,0.00017754275,0.000032483826,0.00005573237,0.00007766157,0.00015076483,0.00041510473],"genre_scores_gemma":[0.43288758,0.00063293317,0.5559287,0.0005221527,0.00029602356,0.0009025312,0.0010198306,0.00031485708,0.007495405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99539065,0.0026055824,0.00019851945,0.00094574306,0.00058927346,0.0002702783],"domain_scores_gemma":[0.9917468,0.0060938983,0.00043857217,0.0008049916,0.00067929266,0.00023641082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007945023,0.0013171892,0.0019245635,0.0021760715,0.001176181,0.0020968684,0.0035970942,0.0023387668,0.004387747],"category_scores_gemma":[0.025428595,0.0012739605,0.002834374,0.0019864503,0.0025024156,0.0038831206,0.0027486049,0.0039502913,0.0012211889],"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.00025357452,0.00016095628,0.0033287161,0.00024005928,0.00020665165,0.00023798314,0.00079788256,0.61178416,0.0024041429,0.27513754,0.0035205288,0.1019277],"study_design_scores_gemma":[0.000009244159,0.000011800839,0.00017559346,0.000011039274,0.000008134417,0.000025037067,0.000019407686,0.95849127,0.00024797764,0.04042997,0.0005560104,0.000014531749],"about_ca_topic_score_codex":0.008174241,"about_ca_topic_score_gemma":0.009090976,"teacher_disagreement_score":0.008174241,"about_ca_system_score_codex":0.0018357009,"about_ca_system_score_gemma":0.0015337982,"threshold_uncertainty_score":0.042017758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38428292,0.0015356871,0.60182935,0.000992444,0.0002490035,0.0000871623,0.0009312611,0.0023467673,0.0077453703],"genre_scores_gemma":[0.94079435,0.0002858915,0.050187964,0.00016188972,0.000037184705,0.000054879278,0.0013032971,0.000042870415,0.007131553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998586,0.00002191794,0.000007805748,0.000040882005,0.00003410923,0.000036681005],"domain_scores_gemma":[0.9997727,0.000069463094,0.000019561989,0.000019548805,0.00010331429,0.000015376727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030795057,0.00069226685,0.00038828352,0.00043778823,0.00020560142,0.00042455504,0.00085137895,0.00065457594,0.0020529325],"category_scores_gemma":[0.00069998263,0.00021668556,0.00045831618,0.00041195453,0.0002312274,0.00076217373,0.0005178973,0.0008317909,0.00044731158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038162174,0.00024797715,0.003346056,0.00008654704,0.00011303632,0.00016049898,0.000047596764,0.7089194,0.013214987,0.0028888483,0.004198886,0.26639453],"study_design_scores_gemma":[0.0000017028777,0.000014356684,0.00015685133,0.0000017944016,0.0000041171797,0.000004296429,0.0000036695092,0.9982152,0.000990079,0.00048821594,0.00011788664,0.0000018194307],"about_ca_topic_score_codex":0.0072507476,"about_ca_topic_score_gemma":0.009719724,"teacher_disagreement_score":0.0072507476,"about_ca_system_score_codex":0.00070485653,"about_ca_system_score_gemma":0.0004874102,"threshold_uncertainty_score":0.014417112},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0110404445,0.00031129364,0.98697346,0.00017223021,0.00004078738,0.00004447068,0.00012006109,0.00084827613,0.0004490685],"genre_scores_gemma":[0.38399008,0.0006911464,0.6054638,0.00031656268,0.00029831368,0.0003303455,0.00271257,0.00049250544,0.005704705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746275,0.0010300071,0.00013924492,0.00065096,0.0005614468,0.00015550255],"domain_scores_gemma":[0.99310666,0.0045403666,0.00050460227,0.000759361,0.0008282469,0.00026076162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030124364,0.0012547821,0.0019323482,0.0034615777,0.0009897683,0.0020262375,0.0033851506,0.0018303762,0.0026995544],"category_scores_gemma":[0.011643442,0.00088788493,0.0017154857,0.002877185,0.0011468967,0.003883722,0.0017808947,0.002374294,0.0017627506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048301034,0.00022057715,0.00301634,0.00018678162,0.00021232774,0.00018856712,0.00029967123,0.73185915,0.0045453473,0.041971404,0.004892451,0.21212442],"study_design_scores_gemma":[0.000004984995,0.000005898402,0.000093076334,0.000003537268,0.0000037356292,0.0000112052585,0.0000065642976,0.9922517,0.00032344443,0.00698302,0.0003048278,0.000007978598],"about_ca_topic_score_codex":0.009195105,"about_ca_topic_score_gemma":0.010623879,"teacher_disagreement_score":0.009195105,"about_ca_system_score_codex":0.0016840878,"about_ca_system_score_gemma":0.0011195078,"threshold_uncertainty_score":0.018283188},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014681571,0.00085494894,0.97644955,0.00034005655,0.00008233498,0.00012118293,0.00047641038,0.0047336696,0.0022601606],"genre_scores_gemma":[0.49041831,0.0009349749,0.491527,0.00037229128,0.00035982335,0.00028449917,0.004092832,0.0007015927,0.0113085965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925536,0.00028707457,0.00005619208,0.00014096191,0.00018456028,0.00007578674],"domain_scores_gemma":[0.9993623,0.00022904265,0.000079951096,0.00011089773,0.00018131989,0.00003653408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010460702,0.00088961073,0.00088764384,0.0020897593,0.0003928128,0.0012528265,0.0013229077,0.0008495528,0.003778058],"category_scores_gemma":[0.0024971766,0.00029751082,0.00092734786,0.0015868797,0.0004681732,0.00229054,0.001090232,0.0011155679,0.0022618198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044172522,0.00034420402,0.00076643925,0.00058432034,0.0001554721,0.0004355703,0.00050141243,0.18376642,0.04491758,0.06160751,0.020978007,0.68550134],"study_design_scores_gemma":[0.00004129252,0.00014620926,0.00019601716,0.000020029456,0.00006986116,0.000105241714,0.00007509245,0.9583941,0.009748288,0.024728958,0.006444154,0.0000306466],"about_ca_topic_score_codex":0.0028809619,"about_ca_topic_score_gemma":0.003750714,"teacher_disagreement_score":0.003778058,"about_ca_system_score_codex":0.0006817575,"about_ca_system_score_gemma":0.0009292898,"threshold_uncertainty_score":0.0126389265},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060147434,0.00072719215,0.9909745,0.00035428553,0.00008055718,0.00007041698,0.00016211969,0.00033479178,0.0012814142],"genre_scores_gemma":[0.44318646,0.0020199714,0.5310256,0.0006483169,0.000810086,0.001478536,0.0024959757,0.0006483887,0.017686684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951068,0.0026615823,0.00020834601,0.0010398893,0.00067220867,0.00031120237],"domain_scores_gemma":[0.99095273,0.0069407565,0.0004014594,0.00063065893,0.0008472862,0.00022726695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008335629,0.0013414545,0.0024004267,0.0030436143,0.0013289524,0.0035139853,0.003953056,0.0028990307,0.006266231],"category_scores_gemma":[0.01705857,0.0013097771,0.0030843168,0.0029819824,0.0018266357,0.004437193,0.0027832002,0.0037596836,0.0024911144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030717178,0.00022050901,0.002671561,0.00027102578,0.00027820942,0.00017648301,0.0007034317,0.4957242,0.0019370986,0.35881808,0.009627714,0.12926444],"study_design_scores_gemma":[0.000012024031,0.000009937756,0.0001464211,0.000014631633,0.000012159666,0.00002273647,0.000013105483,0.94823086,0.00013721081,0.049997374,0.0013914594,0.0000120842915],"about_ca_topic_score_codex":0.007725293,"about_ca_topic_score_gemma":0.0077123716,"teacher_disagreement_score":0.008335629,"about_ca_system_score_codex":0.002337498,"about_ca_system_score_gemma":0.0013226735,"threshold_uncertainty_score":0.044083595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09239567,0.00097371987,0.8996962,0.00018744354,0.00011001776,0.00009128111,0.00020154857,0.004516647,0.0018274678],"genre_scores_gemma":[0.84032446,0.00043130163,0.15154618,0.00013980511,0.00017282454,0.00007776956,0.0006679365,0.00026327002,0.006376359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993819,0.00017869403,0.000042567917,0.000110337096,0.00019236948,0.00009416711],"domain_scores_gemma":[0.9988907,0.00039034107,0.00013221947,0.00017079803,0.0003268739,0.00008917557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012878997,0.0008871872,0.0010151414,0.0014642007,0.00033871067,0.00087337225,0.0010460265,0.0006378654,0.0018199699],"category_scores_gemma":[0.0033177133,0.00025625917,0.0005420496,0.0011996152,0.0005043814,0.0021833668,0.0008571461,0.0007453447,0.0010362515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007007291,0.00039668594,0.0029222353,0.0002392061,0.00014155028,0.00028987642,0.00020880351,0.17242913,0.06855201,0.012672651,0.009170075,0.732277],"study_design_scores_gemma":[0.00002240837,0.00013162658,0.0006177371,0.000005230072,0.000033957014,0.00007322981,0.000020233274,0.97991014,0.014888303,0.003085983,0.0011889017,0.000022255244],"about_ca_topic_score_codex":0.0064291772,"about_ca_topic_score_gemma":0.008845988,"teacher_disagreement_score":0.0064291772,"about_ca_system_score_codex":0.00067478674,"about_ca_system_score_gemma":0.0010301645,"threshold_uncertainty_score":0.012783468},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86410576,0.00009857127,0.12814878,0.0012429078,0.000025855294,0.0015719897,0.0010249288,0.0015013126,0.002279871],"genre_scores_gemma":[0.906165,0.000031831136,0.09221148,0.00010736167,0.0000072630924,0.00064969173,0.00061622437,0.00004693595,0.00016429694],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9547887,0.03711946,0.0020943058,0.0019041724,0.0035395704,0.00055384985],"domain_scores_gemma":[0.48979995,0.45087212,0.012188017,0.032428727,0.013050431,0.0016606813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.042718906,0.0010153126,0.00090408267,0.0028880069,0.000877712,0.005551741,0.002054116,0.0025665835,0.0021675196],"category_scores_gemma":[0.23653857,0.0006004285,0.0011148619,0.0015067741,0.0013938607,0.006137583,0.0020142512,0.002174874,0.00039049218],"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.009689574,0.0066006,0.5126449,0.0032004311,0.0014128183,0.00076694257,0.05813121,0.0770528,0.028315458,0.021394338,0.0049000997,0.2758909],"study_design_scores_gemma":[0.00055310177,0.0048061972,0.08497156,0.0006449983,0.00038506743,0.0004939879,0.01058405,0.8542025,0.019640313,0.016189955,0.0071460395,0.00038219726],"about_ca_topic_score_codex":0.0025196173,"about_ca_topic_score_gemma":0.003103582,"teacher_disagreement_score":0.042718906,"about_ca_system_score_codex":0.002003015,"about_ca_system_score_gemma":0.0013720812,"threshold_uncertainty_score":0.22592187},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076689154,0.002684848,0.9107632,0.0005366591,0.0003101685,0.0002742626,0.0011153045,0.0042839865,0.0033423319],"genre_scores_gemma":[0.5489102,0.0012534547,0.43090123,0.00032767747,0.0005225984,0.0002821431,0.0033525445,0.00016880989,0.014281216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886394,0.00016568575,0.000085329535,0.00040551572,0.00038547564,0.00009408062],"domain_scores_gemma":[0.99871254,0.0003295941,0.00012739867,0.00016992915,0.00057824334,0.00008231998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078873103,0.0011545423,0.0016041908,0.0023430667,0.0004622018,0.00069968245,0.0013997209,0.001094262,0.002910625],"category_scores_gemma":[0.0030727424,0.00044537784,0.0012450253,0.0018379575,0.00020033756,0.0014548621,0.00046775787,0.0008268042,0.0021451642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054087647,0.0003103243,0.007779968,0.00043158265,0.0002857056,0.00038249616,0.00021564403,0.04253538,0.03053405,0.0027172945,0.018550416,0.8957163],"study_design_scores_gemma":[0.00004836689,0.00014185903,0.0026285967,0.000025551251,0.000118129086,0.00035958362,0.000043140175,0.9849135,0.007050575,0.0013703345,0.0032562579,0.000044025284],"about_ca_topic_score_codex":0.010127539,"about_ca_topic_score_gemma":0.01462019,"teacher_disagreement_score":0.010127539,"about_ca_system_score_codex":0.00043076318,"about_ca_system_score_gemma":0.00082264224,"threshold_uncertainty_score":0.02013719},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85332024,0.0041879094,0.12993833,0.0023579963,0.00020309624,0.00013868211,0.005014846,0.0010724443,0.003766388],"genre_scores_gemma":[0.98094684,0.0002792973,0.016598037,0.00013909751,0.00005025575,0.000025505806,0.0015165304,0.000017349448,0.00042715474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993051,0.00032975315,0.000061996965,0.00014006827,0.00012699146,0.00003616075],"domain_scores_gemma":[0.9972596,0.0017565808,0.0004347131,0.00013791675,0.00034569818,0.000065353735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013647355,0.0004747556,0.0005294487,0.0006851135,0.0001582745,0.0006959129,0.0004912115,0.00042050146,0.0009527249],"category_scores_gemma":[0.005466526,0.0001186983,0.00054503477,0.00047994984,0.00016353642,0.000263944,0.00022553543,0.0005625313,0.00030657233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014915816,0.00055737764,0.23358087,0.000365144,0.00037140638,0.00042593566,0.00006386376,0.51324743,0.005707784,0.0012171561,0.008027295,0.23494413],"study_design_scores_gemma":[0.000046832636,0.0002643813,0.01591363,0.00004645006,0.000059435977,0.00013611233,0.000030222891,0.97424966,0.0055489517,0.0020560026,0.0016263326,0.00002203269],"about_ca_topic_score_codex":0.004180207,"about_ca_topic_score_gemma":0.0035279081,"teacher_disagreement_score":0.004180207,"about_ca_system_score_codex":0.0007292722,"about_ca_system_score_gemma":0.00072478055,"threshold_uncertainty_score":0.0083117485},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2980058,0.0023904913,0.6851601,0.0009928785,0.00041402932,0.00014913963,0.00030105998,0.0030457713,0.009540697],"genre_scores_gemma":[0.970028,0.000301657,0.02475211,0.0002267029,0.00008271947,0.00005042709,0.00019472987,0.000019451612,0.0043443437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998091,0.000015296286,0.0000117888485,0.000056527624,0.00006047376,0.000046937384],"domain_scores_gemma":[0.9998043,0.000036820886,0.000025951933,0.000011954516,0.00009866042,0.000022261123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039473907,0.0006349827,0.0008122238,0.0006029981,0.00032960647,0.0006660739,0.0011813556,0.00062433456,0.0023340331],"category_scores_gemma":[0.00058956665,0.00029565365,0.00058529136,0.00040638712,0.00020311687,0.0007446457,0.0005477716,0.0006231415,0.0004497624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006984697,0.0007118522,0.013345087,0.0001653355,0.00028140438,0.0006035449,0.00009929154,0.36469647,0.037952494,0.0039019624,0.008194699,0.5693494],"study_design_scores_gemma":[0.000009046411,0.000039422237,0.00047167623,0.0000027468493,0.000016463202,0.000013566834,0.0000028243385,0.99797136,0.0011096763,0.00021772181,0.00014107095,0.00000439455],"about_ca_topic_score_codex":0.01316796,"about_ca_topic_score_gemma":0.011964514,"teacher_disagreement_score":0.01316796,"about_ca_system_score_codex":0.0005282787,"about_ca_system_score_gemma":0.00073875376,"threshold_uncertainty_score":0.026182592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03724846,0.0012439761,0.9541277,0.00092635525,0.0001397603,0.00008026878,0.0019728218,0.002468891,0.001791751],"genre_scores_gemma":[0.6789143,0.0015031962,0.30212355,0.00059653353,0.00026094355,0.0003335384,0.008630417,0.00043044606,0.0072070514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994498,0.00015976932,0.000031910044,0.00017283275,0.00011705394,0.00006869935],"domain_scores_gemma":[0.9986192,0.0005931565,0.00017252204,0.00019635836,0.00031462597,0.00010415533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089877564,0.0010942505,0.0009878112,0.0012283354,0.00050675374,0.0010779898,0.0017089824,0.001103723,0.0028499055],"category_scores_gemma":[0.0039640996,0.00052987505,0.0011129932,0.0016557903,0.00068248436,0.0021284332,0.0009877839,0.0021291047,0.00097237434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001951586,0.00013387969,0.0025368312,0.00015029489,0.00011235781,0.00014752995,0.00010343408,0.8430572,0.0027259476,0.018042631,0.01251531,0.12027947],"study_design_scores_gemma":[0.0000021566289,0.000006054809,0.00006797391,0.000002895954,0.0000033850447,0.0000050932226,0.0000030940753,0.9963051,0.000117241136,0.00322292,0.0002613758,0.0000026435819],"about_ca_topic_score_codex":0.025019795,"about_ca_topic_score_gemma":0.023225157,"teacher_disagreement_score":0.025019795,"about_ca_system_score_codex":0.0013214974,"about_ca_system_score_gemma":0.0013624979,"threshold_uncertainty_score":0.0497483},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048997976,0.009887285,0.8919513,0.023622435,0.00034074925,0.00010750543,0.00009292912,0.00020331937,0.024796413],"genre_scores_gemma":[0.9341117,0.0044792905,0.05617416,0.0023539944,0.0007390364,0.00016911236,0.00004663745,0.000115240604,0.0018107845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96100205,0.028145496,0.0011898614,0.002998069,0.005292454,0.0013720591],"domain_scores_gemma":[0.8214391,0.15313809,0.0059583914,0.014258435,0.0038394765,0.0013664522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027713846,0.0010439925,0.0015297943,0.0018305315,0.002008791,0.008329655,0.002762631,0.0039457385,0.0040710075],"category_scores_gemma":[0.09137078,0.00093373575,0.0011676931,0.0017596605,0.017181434,0.015056956,0.008361683,0.008586407,0.0006168622],"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.00009398151,0.00004027222,0.0009232688,0.00018744559,0.000063732834,0.00013517072,0.0005032732,0.011887481,0.00057754153,0.9630359,0.00125333,0.021298645],"study_design_scores_gemma":[0.000015477479,0.00006271986,0.0003512596,0.00021451837,0.00004085083,0.00013477875,0.00015633176,0.04379688,0.0009503471,0.9501873,0.0040538437,0.000035634566],"about_ca_topic_score_codex":0.00052801665,"about_ca_topic_score_gemma":0.0003474748,"teacher_disagreement_score":0.027713846,"about_ca_system_score_codex":0.0023370052,"about_ca_system_score_gemma":0.0017945641,"threshold_uncertainty_score":0.14656663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2228815,0.0005602448,0.7709971,0.0014204917,0.00009745199,0.00014131556,0.0002209018,0.00048735592,0.0031936748],"genre_scores_gemma":[0.9772151,0.000090146306,0.021552384,0.00016839379,0.000047949816,0.00006224768,0.00013077777,0.00004485046,0.0006879538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951702,0.0029171798,0.00018268297,0.00055946026,0.0008906973,0.00027977445],"domain_scores_gemma":[0.96667093,0.025803873,0.002539326,0.0022688208,0.0019634427,0.00075362157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01464267,0.0011481352,0.001352548,0.0012415467,0.0007460965,0.0020578904,0.0020783313,0.0016566545,0.0016981792],"category_scores_gemma":[0.048356272,0.00045322438,0.00066825125,0.0006115906,0.0021186338,0.0030548673,0.003203176,0.0023764034,0.00024580455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031923645,0.000058805974,0.0033499897,0.00005061074,0.000065396925,0.000060967737,0.000053733846,0.9653176,0.00065195444,0.009571625,0.000427221,0.020072922],"study_design_scores_gemma":[0.000005001767,0.000034126613,0.00017976628,0.000008433325,0.0000041521666,0.000007851762,0.000006243492,0.9935168,0.00046371194,0.005720432,0.000048619193,0.0000048102074],"about_ca_topic_score_codex":0.0025142315,"about_ca_topic_score_gemma":0.0014661128,"teacher_disagreement_score":0.01464267,"about_ca_system_score_codex":0.002511965,"about_ca_system_score_gemma":0.001355079,"threshold_uncertainty_score":0.07743877},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015365566,0.36947522,0.048728995,0.32222828,0.0022670955,0.00009145007,0.00031194586,0.00016927932,0.24136223],"genre_scores_gemma":[0.40741232,0.49534944,0.01691128,0.057697173,0.0057117655,0.00023584245,0.00040169872,0.00020488922,0.016075606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9883278,0.0065477714,0.00074461894,0.0005849856,0.0032209947,0.0005738023],"domain_scores_gemma":[0.9487856,0.040448625,0.0025587091,0.0015814117,0.0057669375,0.00085867225],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.013496765,0.0004650477,0.0005958882,0.004229601,0.0021227642,0.005984101,0.0010788727,0.004452269,0.0056057763],"category_scores_gemma":[0.02628086,0.00036095033,0.00044842932,0.0051493607,0.011423347,0.006921096,0.002805914,0.0042936415,0.0013423727],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021228605,0.00003770215,0.0020269048,0.0016641521,0.000024069435,0.00019586393,0.0035646318,0.0014997388,0.00032522602,0.7323441,0.056609455,0.20168689],"study_design_scores_gemma":[0.0000037299405,0.000036916485,0.0028856772,0.005423131,0.000010427689,0.0007221352,0.0040226965,0.0016235765,0.0004244746,0.22776082,0.7570403,0.000046025267],"about_ca_topic_score_codex":0.0028741714,"about_ca_topic_score_gemma":0.002394986,"teacher_disagreement_score":0.99787724,"about_ca_system_score_codex":0.0038340734,"about_ca_system_score_gemma":0.00386508,"threshold_uncertainty_score":0.07137859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1800574,0.0064386553,0.79364216,0.0012467079,0.00039722805,0.0010988904,0.0033222025,0.0053094774,0.008487305],"genre_scores_gemma":[0.3974231,0.0018788475,0.58810383,0.0002195079,0.00038766608,0.00057694135,0.0054415865,0.00037552355,0.0055930917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997834,0.0009254996,0.00020506972,0.00033352574,0.0006304194,0.000071402814],"domain_scores_gemma":[0.98932487,0.006204506,0.0011325693,0.00089597324,0.0022650703,0.00017698658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003716193,0.0010043858,0.0008305039,0.0030649607,0.0006395458,0.0018826168,0.00071369635,0.0004940515,0.0020517372],"category_scores_gemma":[0.012489135,0.0002154585,0.00051423605,0.0017760018,0.00031160234,0.0020104179,0.0008648583,0.0007171534,0.0008171114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007010719,0.00026974565,0.0031933272,0.0024942018,0.00025522278,0.00046576053,0.0038620916,0.020594835,0.053826284,0.0073610297,0.012661518,0.89431494],"study_design_scores_gemma":[0.00033432653,0.0029729125,0.02531066,0.0011483376,0.0013007246,0.0011342472,0.0075243167,0.48697308,0.21277888,0.0627846,0.19731142,0.00042646698],"about_ca_topic_score_codex":0.00085434556,"about_ca_topic_score_gemma":0.0020924779,"teacher_disagreement_score":0.003716193,"about_ca_system_score_codex":0.00046510418,"about_ca_system_score_gemma":0.0006926849,"threshold_uncertainty_score":0.01965332},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015626183,0.00031032276,0.97455764,0.00050961896,0.00006715259,0.00028170616,0.00004645415,0.004543924,0.0040569887],"genre_scores_gemma":[0.37231058,0.00029628113,0.61991715,0.00017715864,0.000064478445,0.00048043035,0.000106421816,0.00009678614,0.0065506985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896395,0.0003699769,0.00008299031,0.00021605188,0.00029671856,0.00007022605],"domain_scores_gemma":[0.999166,0.00025792886,0.000044876015,0.00018795562,0.00027596302,0.0000672757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015666403,0.00042395625,0.00066099217,0.0007575831,0.00062513934,0.001691324,0.0023318501,0.0020690272,0.0044826805],"category_scores_gemma":[0.003333211,0.00040920274,0.00065702404,0.0005327295,0.00078746106,0.0017030459,0.0011434638,0.0014273159,0.0013199294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054744707,0.0008535119,0.0041067735,0.0005109478,0.00030124685,0.00078369124,0.0012733941,0.2541151,0.029873673,0.17147349,0.008068995,0.5280917],"study_design_scores_gemma":[0.00006683413,0.0001612852,0.00038281787,0.000029598436,0.00004507764,0.00014413596,0.00004094834,0.97499204,0.0048475997,0.008651981,0.010604189,0.000033620574],"about_ca_topic_score_codex":0.008825788,"about_ca_topic_score_gemma":0.0057492163,"teacher_disagreement_score":0.008825788,"about_ca_system_score_codex":0.00072007865,"about_ca_system_score_gemma":0.00097611727,"threshold_uncertainty_score":0.0175488},"labels":[],"label_agreement":null}]}