{"meta":{"query_hash":"40da2e1ae72f","filters":{"venue":"International Journal of Computational Intelligence and Applications"},"cohort_total":28,"direct_labels_cover":0,"predictions_cover":28,"exported":28,"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/40da2e1ae72f","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Computational+Intelligence+and+Applications"},"results":[{"id":"W1963955771","doi":"10.1142/s146902680300080x","title":"MAPPING REFERENCE CODE TO IRREGULAR DSPS WITHIN THE RETARGETABLE, OPTIMIZING COMPILER COGEN(T)","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Unreachable code; Dead code; Compiler; Parallel computing; Code generation; Programming language; Code (set theory); Object code; Redundant code; Set (abstract data type); Schedule; Abstraction; Dead code elimination; Operating system","score_opus":0.041280316975775395,"score_gpt":0.30289987243902566,"score_spread":0.2616195554632503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963955771","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.20244147,0.00016348482,0.7782496,0.00014651386,0.00005322858,0.00012359301,0.00012251256,0.008360561,0.010338921],"genre_scores_gemma":[0.3855797,0.000120826684,0.6085111,0.000101518504,0.000010182262,0.00008530326,0.00030741422,0.0010628664,0.0042210463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998318,0.000024351652,0.000008988989,0.000045343397,0.00006449257,0.000025069388],"domain_scores_gemma":[0.9996563,0.00009262428,0.000037928014,0.00011294751,0.000088630186,0.000011598972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028631254,0.00026496692,0.00022129694,0.00029152344,0.00022573335,0.0004944352,0.0006421501,0.00033840133,0.0013440095],"category_scores_gemma":[0.0010773275,0.00019283182,0.00023686099,0.00031948127,0.00052744674,0.00045209195,0.00036500025,0.0005193009,0.00036523223],"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.00039403944,0.00013290317,0.0023309165,0.00023260457,0.000035508998,0.0004891489,0.0005168315,0.38635403,0.13797536,0.074267745,0.0060906783,0.39118022],"study_design_scores_gemma":[0.00008244586,0.00027961863,0.00089744385,0.000029239645,0.000029318218,0.0003632891,0.000066731234,0.82351035,0.12691556,0.016121307,0.031674102,0.00003066791],"about_ca_topic_score_codex":0.0012613499,"about_ca_topic_score_gemma":0.0016799027,"teacher_disagreement_score":0.0013440095,"about_ca_system_score_codex":0.00036515898,"about_ca_system_score_gemma":0.0006873378,"threshold_uncertainty_score":0.0044960976},"labels":[],"label_agreement":null},{"id":"W1972768104","doi":"10.1142/s1469026811003148","title":"VIRTUAL INSTRUMENTATION BASED SYSTEMS FOR REAL-TIME PATH PLANNING OF MOBILE ROBOTS USING BIO-INSPIRED NEURAL NETWORKS","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Artificial neural network; Instrumentation (computer programming); Motion planning; Robot; Path (computing); Software; Mobile robot; Artificial intelligence; Trajectory; Controller (irrigation); Real-time computing; Computer network","score_opus":0.05692463903864865,"score_gpt":0.32222581622429425,"score_spread":0.2653011771856456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972768104","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.010591037,0.0001641079,0.98662114,0.00006266806,0.000058779133,0.0000342976,0.000014002818,0.00062537316,0.0018286387],"genre_scores_gemma":[0.6809056,0.0004090419,0.3143051,0.00012295904,0.000027131753,0.0002973897,0.00007570145,0.000048497368,0.0038086958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998222,0.000038342358,0.000012027311,0.00003352806,0.00007867385,0.0000152316225],"domain_scores_gemma":[0.9997893,0.000072920746,0.00003532575,0.0000291692,0.00005656339,0.00001672084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029346126,0.00041431453,0.0003084251,0.00028205372,0.0003239642,0.0005508465,0.0007994088,0.0005688046,0.0016033143],"category_scores_gemma":[0.00068441883,0.00019873788,0.00027515055,0.00023147003,0.00047681804,0.0006262947,0.0006874917,0.00043023276,0.00029091735],"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.00021966458,0.00008996208,0.0008422151,0.0002398815,0.00007267933,0.0002671395,0.00026501055,0.6629519,0.066074,0.022375844,0.0020985254,0.2445032],"study_design_scores_gemma":[0.000016503278,0.00012624796,0.00027388617,0.000016137592,0.00002080091,0.00009138707,0.000020486177,0.9793666,0.0114819,0.0032224087,0.005344712,0.000018872228],"about_ca_topic_score_codex":0.0011171306,"about_ca_topic_score_gemma":0.0013471588,"teacher_disagreement_score":0.0016033143,"about_ca_system_score_codex":0.00043795689,"about_ca_system_score_gemma":0.00045103024,"threshold_uncertainty_score":0.0053635836},"labels":[],"label_agreement":null},{"id":"W1977565676","doi":"10.1142/s1469026813500065","title":"COMPARISON OF PARALLEL PARTICLE SWARM OPTIMIZERS FOR GRAPHICAL PROCESSING UNITS AND MULTICORE PROCESSORS","year":2013,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Microgrid Control and Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"CUDA; Computer science; Parallel computing; Speedup; Multi-core processor; Particle swarm optimization; Central processing unit; General-purpose computing on graphics processing units; Algorithm; Graphics; Computer hardware; Operating system","score_opus":0.029010985900588315,"score_gpt":0.3121473107673336,"score_spread":0.2831363248667453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977565676","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.2906992,0.002314672,0.6740807,0.0007451249,0.00061051303,0.00032015194,0.00036805077,0.009132813,0.021728696],"genre_scores_gemma":[0.5543808,0.00076393894,0.43887582,0.00013986339,0.00005072352,0.00033430403,0.0006630516,0.00082307245,0.003968388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935573,0.000191226,0.000055728702,0.00007184823,0.0002525845,0.00007293738],"domain_scores_gemma":[0.9989249,0.0003978895,0.0000780866,0.00019051408,0.00034025667,0.00006834146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087228906,0.0008441979,0.00082372554,0.00061901304,0.00039816982,0.0007874029,0.0012027381,0.0007246859,0.002506735],"category_scores_gemma":[0.0027212026,0.0003542796,0.0007936172,0.0009739273,0.00028429806,0.0007835836,0.00049124,0.0007075291,0.0004819691],"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.0012517241,0.0004459037,0.0052497676,0.0005539915,0.0004722948,0.00030390755,0.00017937335,0.74552226,0.018295337,0.009604278,0.006430653,0.21169056],"study_design_scores_gemma":[0.00010974224,0.00016627906,0.0013327678,0.000013067914,0.000042283427,0.000034873203,0.000030303996,0.9876046,0.006296489,0.00094879034,0.0034037083,0.000017129158],"about_ca_topic_score_codex":0.0077961152,"about_ca_topic_score_gemma":0.0063713333,"teacher_disagreement_score":0.0077961152,"about_ca_system_score_codex":0.00056889,"about_ca_system_score_gemma":0.0009364702,"threshold_uncertainty_score":0.01550144},"labels":[],"label_agreement":null},{"id":"W1980383049","doi":"10.1142/s1469026804001410","title":"ROTATIONAL MATCHING PROBLEMS","year":2004,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Geomagnetism and Paleomagnetism Studies","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":"McMaster University; University of Guelph","funders":"","keywords":"Rotation (mathematics); Computer science; Algorithm; Fourier transform; Orientation (vector space); Function (biology); Matching (statistics); Fourier series; Mathematics; Mathematical analysis; Artificial intelligence; Geometry; Statistics","score_opus":0.014184139110601311,"score_gpt":0.28348237055719466,"score_spread":0.2692982314465934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980383049","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.008954163,0.0024072698,0.9611255,0.0018023747,0.00043935972,0.00016715884,0.00058156345,0.00033917476,0.024183396],"genre_scores_gemma":[0.38747337,0.0072006714,0.54106784,0.0021670973,0.0020908138,0.0009745672,0.004161063,0.0009539517,0.05391069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625444,0.0011082188,0.00029253238,0.0011830919,0.00081096694,0.00035086248],"domain_scores_gemma":[0.99464285,0.0032566537,0.00059159106,0.0006638341,0.00060081325,0.00024431307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038038709,0.0017546772,0.0025918877,0.0020879067,0.001692155,0.004096418,0.0030214118,0.0050107357,0.020308403],"category_scores_gemma":[0.017912019,0.0010413269,0.0021028395,0.0027255309,0.0025190758,0.0060136714,0.0047365916,0.0034796807,0.005014072],"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.00018586883,0.00017823085,0.0011679154,0.00057392893,0.00014196527,0.00029817465,0.00020751468,0.13233352,0.0010191064,0.6672589,0.0250293,0.17160556],"study_design_scores_gemma":[0.0000693793,0.000105626474,0.00050176925,0.000101024576,0.00003899591,0.00036039928,0.00013117725,0.38897356,0.000908478,0.5776153,0.03114094,0.000053406668],"about_ca_topic_score_codex":0.0019300267,"about_ca_topic_score_gemma":0.000920176,"teacher_disagreement_score":0.020308403,"about_ca_system_score_codex":0.0017179446,"about_ca_system_score_gemma":0.0015319895,"threshold_uncertainty_score":0.06793839},"labels":[],"label_agreement":null},{"id":"W1980452543","doi":"10.1142/s1469026804001409","title":"FINDING CONSERVED WELL-ORDERED RNA STRUCTURES IN GENOMIC SEQUENCES","year":2004,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; U.S. Department of Health and Human Services","keywords":"Computational biology; RNA; Genome; Nucleic acid structure; Base pair; Gene; Ribozyme; Biology; Genetics; Nucleic acid secondary structure; Conserved sequence; Caenorhabditis elegans; Computer science; Base sequence","score_opus":0.022605372933047513,"score_gpt":0.30504287729074364,"score_spread":0.2824375043576961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980452543","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.77394795,0.0009700502,0.22192961,0.00023843818,0.000018534578,0.00007094474,0.0003900354,0.0008869518,0.0015475318],"genre_scores_gemma":[0.8529112,0.00037480015,0.14552377,0.00005154866,0.000017271233,0.0000459746,0.0007617915,0.00006854411,0.0002450928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948514,0.00013281962,0.000050112147,0.00015207747,0.00013884985,0.0000409585],"domain_scores_gemma":[0.99870086,0.00058948214,0.0003035317,0.00019754238,0.00012817995,0.00008031385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061671645,0.00037965228,0.0006152314,0.0019226556,0.0005453754,0.0009007947,0.0005523865,0.0006175952,0.0006903612],"category_scores_gemma":[0.0034894017,0.00028538378,0.00049320405,0.001063901,0.0009076625,0.0010253965,0.00060561724,0.0004288553,0.00021276926],"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.0010324531,0.00036073753,0.07616516,0.0014531782,0.0004001114,0.0018538291,0.0007840815,0.34242463,0.23929724,0.05252258,0.002119125,0.28158677],"study_design_scores_gemma":[0.00011620198,0.00036285308,0.023621162,0.000086556814,0.00020961046,0.0010394527,0.0004910947,0.80677223,0.05640104,0.10622664,0.0045883567,0.00008473723],"about_ca_topic_score_codex":0.0009807266,"about_ca_topic_score_gemma":0.0018326726,"teacher_disagreement_score":0.0019226556,"about_ca_system_score_codex":0.00039880362,"about_ca_system_score_gemma":0.0007757154,"threshold_uncertainty_score":0.0032615066},"labels":[],"label_agreement":null},{"id":"W1991109541","doi":"10.1142/s1469026802000476","title":"STABILITY OF INFORMATION GRANULATION AND INFORMATION GRANULES","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Neural Networks and Applications","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":"Canadian Space Agency; University of Alberta","funders":"","keywords":"Computer science; Stability (learning theory); Granulation; Inference; Artificial intelligence; Machine learning","score_opus":0.022794193225933925,"score_gpt":0.26571925445287364,"score_spread":0.24292506122693971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991109541","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.08273781,0.0047235996,0.88885075,0.0022559275,0.00026878028,0.000307128,0.0006256139,0.0005653044,0.01966508],"genre_scores_gemma":[0.7835366,0.0018671592,0.20693493,0.00051984977,0.0005403721,0.00074301416,0.0006645955,0.00023991859,0.0049535837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993292,0.0018180367,0.000784932,0.0014928058,0.0021513067,0.00046098797],"domain_scores_gemma":[0.95836955,0.026578793,0.005180599,0.0048768655,0.0041170553,0.00087698764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062658363,0.0008018712,0.0015241106,0.0041291537,0.0015928615,0.006809889,0.0015553478,0.0018187116,0.003973155],"category_scores_gemma":[0.047884006,0.000616881,0.0016290722,0.0031897193,0.0068390667,0.011298253,0.003925112,0.001970088,0.00063725776],"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.00018664378,0.000031240637,0.0016463192,0.00028722326,0.00008923237,0.0002769305,0.0009076405,0.017471965,0.0029824981,0.94630426,0.0011862608,0.028629744],"study_design_scores_gemma":[0.000030285853,0.00007418651,0.0012889882,0.000055699587,0.000034474604,0.00022037284,0.00020072256,0.046628855,0.0021346938,0.9428076,0.0064723943,0.00005176372],"about_ca_topic_score_codex":0.0008038071,"about_ca_topic_score_gemma":0.0003222266,"teacher_disagreement_score":0.006809889,"about_ca_system_score_codex":0.0023985761,"about_ca_system_score_gemma":0.001023211,"threshold_uncertainty_score":0.03313732},"labels":[],"label_agreement":null},{"id":"W2000038675","doi":"10.1142/s1469026808002193","title":"SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT","year":2008,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Formal Methods in Verification","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 Regina","funders":"","keywords":"Satisfiability; Computer science; Completeness (order theory); Propositional calculus; Boolean satisfiability problem; Mathematical optimization; Range (aeronautics); Approximation algorithm; Conjunctive normal form; Local search (optimization); Set (abstract data type); Mathematics; Theoretical computer science; Algorithm","score_opus":0.07812007125231435,"score_gpt":0.3857766504357405,"score_spread":0.30765657918342615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000038675","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.033597056,0.0010630608,0.960244,0.00020409792,0.000033298187,0.00017864101,0.000046715115,0.00066405797,0.0039690547],"genre_scores_gemma":[0.3320151,0.0007738937,0.6644948,0.00020340247,0.000030530202,0.00057759864,0.00017566088,0.000135231,0.0015937852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987105,0.00069336075,0.00004482164,0.00016402756,0.00029837686,0.00008896702],"domain_scores_gemma":[0.9983077,0.0010536223,0.00015562314,0.00034430213,0.00010302084,0.000035667515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012401922,0.00064276025,0.0007582237,0.00089096837,0.0003833806,0.00071716093,0.0013260387,0.0008110517,0.0015936657],"category_scores_gemma":[0.003630965,0.00045981666,0.0012133197,0.0011417489,0.0011401995,0.0010121656,0.0008727849,0.0012561752,0.00039333067],"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.00020029841,0.0002862466,0.0033031474,0.00057040184,0.00022675494,0.0002118337,0.0002978478,0.5677402,0.01870912,0.12534255,0.0025924016,0.2805192],"study_design_scores_gemma":[0.000065134926,0.0002666465,0.0006613286,0.000059056503,0.00009128437,0.00017936695,0.00004677634,0.9676972,0.004470766,0.022361644,0.004081719,0.000019020677],"about_ca_topic_score_codex":0.0020266706,"about_ca_topic_score_gemma":0.0044845785,"teacher_disagreement_score":0.0020266706,"about_ca_system_score_codex":0.00076352584,"about_ca_system_score_gemma":0.0015491328,"threshold_uncertainty_score":0.0065588355},"labels":[],"label_agreement":null},{"id":"W2005599223","doi":"10.1142/s1469026814500138","title":"SOFTWARE DEVELOPMENT EFFORT ESTIMATION USING CLASSICAL AND FUZZY ANALOGY: A CROSS-VALIDATION COMPARATIVE STUDY","year":2014,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Software Engineering Research","field":"Computer Science","cited_by":33,"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; Université du Québec à Montréal","funders":"","keywords":"Analogy; Computer science; Software; Benchmarking; Software development; Estimation; Fuzzy logic; Software sizing; Data mining; Artificial intelligence; Software engineering; Machine learning; Software construction; Systems engineering; Programming language; Linguistics","score_opus":0.0587535365511344,"score_gpt":0.39425473157658364,"score_spread":0.33550119502544923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005599223","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.9890295,0.0003516708,0.00900588,0.000028897854,0.000022511298,0.00010199516,0.00013855344,0.000036722813,0.0012842696],"genre_scores_gemma":[0.9925632,0.00010528933,0.006362895,0.000019651894,0.0000129023665,0.00010312778,0.00047967373,0.000015426922,0.00033781774],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.98343533,0.011053306,0.00104788,0.0014282973,0.002695985,0.00033931356],"domain_scores_gemma":[0.8705302,0.09740353,0.0037420236,0.008828553,0.018342732,0.0011529939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029784942,0.0006496672,0.0007870522,0.004055944,0.0007424063,0.00097616616,0.0014646553,0.0015656755,0.000872804],"category_scores_gemma":[0.071365155,0.0002886279,0.0009830793,0.0025349644,0.001285595,0.0016270083,0.00146642,0.00079374464,0.0003662181],"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.0073816716,0.014399245,0.50151086,0.0018221517,0.003211065,0.0006868807,0.012438824,0.12525566,0.014711751,0.007779991,0.004913892,0.305888],"study_design_scores_gemma":[0.00061557937,0.00969316,0.60880446,0.00044654318,0.0010711421,0.00070463435,0.005984382,0.3438543,0.014510006,0.0056015076,0.008489508,0.0002247841],"about_ca_topic_score_codex":0.0024378747,"about_ca_topic_score_gemma":0.0025677762,"teacher_disagreement_score":0.029784942,"about_ca_system_score_codex":0.0010450936,"about_ca_system_score_gemma":0.0007085658,"threshold_uncertainty_score":0.15751976},"labels":[],"label_agreement":null},{"id":"W2016189525","doi":"10.1142/s1469026801000068","title":"LEARNING OF FUZZY AUTOMATA","year":2001,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":36,"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":"Computer science; Fuzzy logic; Generalization; Artificial intelligence; Fuzzy electronics; State (computer science); Theoretical computer science; Finite-state machine; Automaton; Neuro-fuzzy; Fuzzy control system; Algorithm; Mathematics","score_opus":0.024432313043924996,"score_gpt":0.3143575538523547,"score_spread":0.2899252408084297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016189525","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.02440937,0.0008245203,0.9598542,0.00054687465,0.00014168092,0.00005943936,0.00009053753,0.00031421147,0.013759198],"genre_scores_gemma":[0.76795506,0.0013603158,0.2196628,0.00033898174,0.0001930237,0.00020910527,0.00024668762,0.00005656456,0.009977471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992762,0.00022069558,0.000052366184,0.00020382061,0.00018570472,0.00006113884],"domain_scores_gemma":[0.9980318,0.0013197444,0.00012822216,0.00026071796,0.00020480329,0.000054718083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009045541,0.0004028132,0.00058194826,0.00046577462,0.00050390826,0.0014108616,0.0008123186,0.0009878041,0.0037759282],"category_scores_gemma":[0.006956618,0.0002597985,0.0007707319,0.0003889107,0.0016387718,0.0019289762,0.0011252664,0.0012433408,0.0005795656],"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.00007418155,0.000048638125,0.0010449156,0.00019649549,0.000047675003,0.00013552803,0.00036135968,0.20552468,0.003200213,0.6906205,0.0014754374,0.09727035],"study_design_scores_gemma":[0.000017900338,0.000046927453,0.0001459214,0.00003360234,0.0000133691465,0.00007322052,0.00005192702,0.5440308,0.0016994379,0.44792956,0.005940163,0.000017125116],"about_ca_topic_score_codex":0.00125454,"about_ca_topic_score_gemma":0.001128924,"teacher_disagreement_score":0.0037759282,"about_ca_system_score_codex":0.0009456051,"about_ca_system_score_gemma":0.0005981093,"threshold_uncertainty_score":0.012631714},"labels":[],"label_agreement":null},{"id":"W2017351056","doi":"10.1142/s1469026815500029","title":"Collaborative Parallel Hybrid Metaheuristics on Graphics Processing Unit","year":2015,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Parallel computing; Metaheuristic; Speedup; Graphics processing unit; CUDA; Parallel metaheuristic; Asynchronous communication; Simulated annealing; Instruction set; Multi-core processor; Algorithm","score_opus":0.06856806425648525,"score_gpt":0.3758262417399429,"score_spread":0.30725817748345763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017351056","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.025893642,0.0006232931,0.9554196,0.00030429894,0.00019208301,0.00011621726,0.00006808295,0.0025303205,0.014852428],"genre_scores_gemma":[0.33808976,0.0004358146,0.6521069,0.00028776223,0.00007857834,0.0005136579,0.00025903134,0.00030234572,0.007926113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995136,0.00015648842,0.000022834522,0.00008520786,0.00016407165,0.000057728135],"domain_scores_gemma":[0.9994671,0.00016754081,0.000041796502,0.0001492137,0.00013508103,0.000039268525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004943336,0.00080782484,0.0008035961,0.0005182645,0.00063842034,0.0012219201,0.0019597814,0.0012013974,0.0040704585],"category_scores_gemma":[0.0012482093,0.00032535952,0.0009928817,0.0011469114,0.0006111734,0.0007982642,0.0012170689,0.0012099238,0.0011448659],"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.00027769513,0.00014730636,0.0009671875,0.00017433208,0.00016521604,0.000357684,0.0001401852,0.78157544,0.01818748,0.03598759,0.009552601,0.15246722],"study_design_scores_gemma":[0.000042490825,0.00005094995,0.00014338303,0.000007144075,0.000016248781,0.00003705278,0.000012665465,0.98392093,0.0022360045,0.007178103,0.006344569,0.0000103184975],"about_ca_topic_score_codex":0.004907983,"about_ca_topic_score_gemma":0.004227816,"teacher_disagreement_score":0.004907983,"about_ca_system_score_codex":0.00089044817,"about_ca_system_score_gemma":0.0009189393,"threshold_uncertainty_score":0.013617039},"labels":[],"label_agreement":null},{"id":"W2025187426","doi":"10.1142/s1469026801000044","title":"AN ENHANCED GENETIC ALGORITHM FOR SOLVING THE HIGH-LEVEL SYNTHESIS PROBLEMS OF SCHEDULING, ALLOCATION, AND BINDING","year":2001,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Embedded Systems Design Techniques","field":"Computer Science","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 Guelph","funders":"","keywords":"Computer science; Crossover; Scheduling (production processes); High-level synthesis; Job shop scheduling; Mathematical optimization; Parallel computing; Theoretical computer science; Algorithm; Field-programmable gate array; Routing (electronic design automation); Mathematics","score_opus":0.039363285547367025,"score_gpt":0.32164975456987827,"score_spread":0.28228646902251125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025187426","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.0068799276,0.00011863987,0.9911572,0.00006328727,0.000026920286,0.000050102703,0.000013233145,0.00024279307,0.001447944],"genre_scores_gemma":[0.068915844,0.00017553568,0.92905915,0.0000826568,0.000026203763,0.00017852662,0.00006894745,0.000059583002,0.0014335505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994517,0.00016448135,0.000022501848,0.000094817675,0.00021048421,0.000056004617],"domain_scores_gemma":[0.9994993,0.00029832075,0.000042901916,0.000052613676,0.00008727003,0.000019592984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010632145,0.0009369535,0.00072691933,0.0007159847,0.00048673255,0.0005793643,0.0012404958,0.0011727269,0.0016582917],"category_scores_gemma":[0.0018365285,0.000385234,0.000971952,0.00066077174,0.0006735669,0.0007173824,0.00065443746,0.0013368656,0.00036166725],"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.00006771742,0.000115519375,0.0007291638,0.0001278072,0.000088044995,0.00012528249,0.00011198165,0.77589417,0.011135929,0.029789247,0.0014036159,0.18041149],"study_design_scores_gemma":[0.000042038777,0.000060500748,0.0001419633,0.000014885169,0.000035184254,0.000074618096,0.000011661485,0.9870645,0.0021913897,0.0069520944,0.0034021225,0.000009035186],"about_ca_topic_score_codex":0.0031926543,"about_ca_topic_score_gemma":0.0042019645,"teacher_disagreement_score":0.0031926543,"about_ca_system_score_codex":0.0007257319,"about_ca_system_score_gemma":0.001468284,"threshold_uncertainty_score":0.006348133},"labels":[],"label_agreement":null},{"id":"W2025201938","doi":"10.1142/s1469026805001441","title":"USING COMPETITIVE CO-EVOLUTION TO EVOLVE BETTER PATTERN RECOGNISERS","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Evolutionary Algorithms and Applications","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":"Computer science; Task (project management); Software; Binary number; Artificial intelligence; Reliability (semiconductor); Base (topology); Pattern recognition (psychology); Arithmetic","score_opus":0.03700165440096965,"score_gpt":0.3397540574526187,"score_spread":0.3027524030516491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025201938","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.2661085,0.0002777712,0.72124934,0.00037116423,0.0001608828,0.00020280242,0.000077733326,0.0022236556,0.0093281595],"genre_scores_gemma":[0.59701985,0.00012280942,0.39490557,0.00032317208,0.000046581248,0.00030028756,0.00028828377,0.00048264128,0.006510772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990004,0.0002425114,0.00006758142,0.00025340728,0.00032499773,0.00011115038],"domain_scores_gemma":[0.9962704,0.0016667546,0.00025314148,0.0006938945,0.00092614384,0.00018966709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002330384,0.00091962115,0.00090020435,0.0010332892,0.00055517745,0.0013807412,0.0016792933,0.0015795535,0.0030527464],"category_scores_gemma":[0.009489499,0.0005675734,0.0007106169,0.0007076572,0.00087789266,0.0012911544,0.0016277907,0.0010195373,0.0010022345],"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.00026046543,0.00031742323,0.005939314,0.00021057871,0.00024347329,0.0004648334,0.00064040645,0.5568108,0.09186797,0.019972349,0.0028193921,0.32045302],"study_design_scores_gemma":[0.000018073017,0.00008117162,0.00026762005,0.0000053680924,0.000023353025,0.00008591734,0.000020273657,0.9856205,0.009535384,0.0024618055,0.0018655928,0.000015105753],"about_ca_topic_score_codex":0.0016924057,"about_ca_topic_score_gemma":0.001705975,"teacher_disagreement_score":0.0030527464,"about_ca_system_score_codex":0.0008220992,"about_ca_system_score_gemma":0.00061194773,"threshold_uncertainty_score":0.012324333},"labels":[],"label_agreement":null},{"id":"W2062972627","doi":"10.1142/s1469026806002039","title":"A MEMETIC ALGORITHM FOR PERFORMING MEMORY ASSIGNMENT IN DUAL-BANK DSPS","year":2006,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Parallel Computing and Optimization 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":"University of Waterloo; University of Guelph","funders":"","keywords":"Computer science; Parallel computing; Memetic algorithm; Digital signal processing; Compiler; Memory bandwidth; Digital signal processor; Interleaved memory; Computer memory; Semiconductor memory; Algorithm; Computer hardware; Local search (optimization); Programming language","score_opus":0.01913398475210874,"score_gpt":0.30741256709045095,"score_spread":0.2882785823383422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062972627","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.04773754,0.00032792683,0.9476494,0.0002941354,0.00007089109,0.00008229913,0.000027289123,0.00036324683,0.0034472775],"genre_scores_gemma":[0.4208087,0.00021056876,0.5744648,0.0001800422,0.000057674824,0.00038886003,0.000060469683,0.000058348887,0.0037705658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967813,0.00012945445,0.000018639885,0.000054412536,0.00007603133,0.000043411917],"domain_scores_gemma":[0.9994554,0.00032341116,0.00005920582,0.000046686888,0.000084928215,0.000030305284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011013934,0.00063787843,0.0008181171,0.0008913497,0.00068983895,0.0007063564,0.0015262477,0.0012997561,0.0013687224],"category_scores_gemma":[0.001947694,0.00046108098,0.0007247974,0.00072550547,0.00077405473,0.00073785946,0.0007510931,0.0006831742,0.00020516255],"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.00008098306,0.000056930083,0.00042963657,0.000051404684,0.0000662167,0.0000761954,0.00006658773,0.93121654,0.0025034314,0.008000341,0.00094210205,0.05650971],"study_design_scores_gemma":[0.000021106298,0.000027971062,0.000047684407,0.000003767202,0.000007813838,0.000021229096,0.000010154484,0.9964641,0.00062188366,0.0022865094,0.00048341972,0.0000044393655],"about_ca_topic_score_codex":0.0021196736,"about_ca_topic_score_gemma":0.0017988775,"teacher_disagreement_score":0.0021196736,"about_ca_system_score_codex":0.0007145937,"about_ca_system_score_gemma":0.0011071939,"threshold_uncertainty_score":0.0058247447},"labels":[],"label_agreement":null},{"id":"W2072651133","doi":"10.1142/s1469026802000567","title":"AN INTELLIGENT HYBRID APPROACH FOR CONTENT-BASED IMAGE RETRIEVAL","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Image Retrieval and Classification 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":"Nipissing University","funders":"","keywords":"Computer science; Artificial intelligence; Artificial neural network; Pattern recognition (psychology); Feature extraction; Multilayer perceptron; Image retrieval; Benchmark (surveying); Feature (linguistics); Content-based image retrieval; Image (mathematics); Perceptron; Data mining","score_opus":0.07467256335619954,"score_gpt":0.32671286339339284,"score_spread":0.2520403000371933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072651133","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.015325428,0.0010713411,0.9781461,0.00019435972,0.00008231238,0.0001318767,0.00007004888,0.0013118149,0.003666692],"genre_scores_gemma":[0.23024207,0.0008966505,0.7591795,0.00033865753,0.00020777632,0.00020157683,0.00028625302,0.000114094095,0.0085334405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993175,0.00009995585,0.000046912875,0.000112942405,0.0003714221,0.00005120253],"domain_scores_gemma":[0.9996642,0.000090509995,0.000030335648,0.000070084316,0.00012993303,0.000014991107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050723465,0.0005469141,0.0007818204,0.0022214605,0.00036029366,0.0010097423,0.00096803124,0.0009635703,0.0019960278],"category_scores_gemma":[0.0009896202,0.00024633008,0.00063118513,0.0016203839,0.00042115233,0.0018156137,0.00061148073,0.0004224519,0.0014430184],"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.00017568683,0.0002144489,0.0006916227,0.00028912458,0.00014759775,0.0002180856,0.00016690487,0.016679943,0.14313757,0.008792132,0.0044775666,0.8250093],"study_design_scores_gemma":[0.00007570765,0.00045290837,0.002762019,0.000037089194,0.00023436017,0.0014979303,0.00016042875,0.8715544,0.07696576,0.018111201,0.028027922,0.00012035433],"about_ca_topic_score_codex":0.0011107678,"about_ca_topic_score_gemma":0.0017185801,"teacher_disagreement_score":0.0022214605,"about_ca_system_score_codex":0.00039688963,"about_ca_system_score_gemma":0.00031597688,"threshold_uncertainty_score":0.0066774487},"labels":[],"label_agreement":null},{"id":"W2073912270","doi":"10.1142/s1469026814500084","title":"PARALLEL HYBRID METAHEURISTIC ON SHARED MEMORY SYSTEM FOR REAL-TIME UAV PATH PLANNING","year":2014,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Robotic Path Planning Algorithms","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":"Royal Military College of Canada","funders":"","keywords":"Computer science; Parallel computing; Particle swarm optimization; Metaheuristic; Multi-core processor; Parallel algorithm; Genetic algorithm; Speedup; Path (computing); Shared memory; Mathematical optimization; Algorithm","score_opus":0.031873828696133574,"score_gpt":0.3112131873067623,"score_spread":0.2793393586106287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073912270","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.07883116,0.000550312,0.9094532,0.00022079454,0.00012957281,0.00010441538,0.00009116969,0.0023954043,0.008223973],"genre_scores_gemma":[0.55835605,0.00023306157,0.43669575,0.000098877885,0.000032071053,0.00029139503,0.00018689343,0.00017708252,0.003928763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997583,0.00007226966,0.000013482351,0.000044625387,0.00007447604,0.000036835278],"domain_scores_gemma":[0.99962234,0.00014030674,0.0000424065,0.00007273633,0.00009734719,0.000024844529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046856474,0.00050358486,0.00042973514,0.00047210566,0.00044105318,0.0006164487,0.0009758896,0.00054038386,0.0024224736],"category_scores_gemma":[0.00088269595,0.00025345004,0.000497635,0.00057924335,0.0003710192,0.0007021326,0.0005482788,0.0005315555,0.00047819948],"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.00021038919,0.00007665623,0.0006503264,0.00007376268,0.00008106462,0.000106271655,0.000045437715,0.9104074,0.0060851197,0.0060816626,0.0017797595,0.07440216],"study_design_scores_gemma":[0.000023744056,0.000028715927,0.00008910804,0.00000275955,0.000009451753,0.0000141736,0.000008324913,0.9958514,0.0014035432,0.0016323978,0.00093311607,0.0000033240276],"about_ca_topic_score_codex":0.006374126,"about_ca_topic_score_gemma":0.0072004898,"teacher_disagreement_score":0.006374126,"about_ca_system_score_codex":0.0007262633,"about_ca_system_score_gemma":0.001060948,"threshold_uncertainty_score":0.012674034},"labels":[],"label_agreement":null},{"id":"W2076906193","doi":"10.1142/s1469026805001611","title":"A GENETIC ALGORITHM FOR THE DESIGN OF MINIMUM-COST TWO-CONNECTED NETWORKS WITH BOUNDED RINGS","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Computer science; Bounded function; Genetic algorithm; Algorithm; Mathematical optimization; Network planning and design; Constraint (computer-aided design); Ring (chemistry); Enhanced Data Rates for GSM Evolution; Mathematics; Artificial intelligence; Machine learning; Computer network","score_opus":0.01981469221337038,"score_gpt":0.28029369089475836,"score_spread":0.26047899868138796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076906193","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.015187971,0.00017723572,0.98207444,0.000099808305,0.000023219129,0.0000682279,0.000019770385,0.00020639306,0.0021429455],"genre_scores_gemma":[0.20108882,0.0002558181,0.79624444,0.00008202156,0.000016154052,0.00029828664,0.000075916156,0.00005456659,0.0018839573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997745,0.000073919655,0.000009082094,0.000043219712,0.00007432626,0.00002486711],"domain_scores_gemma":[0.9996784,0.00019634442,0.000037253565,0.000018087709,0.000054897235,0.000014923306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069263874,0.0006908189,0.0005210802,0.00072875223,0.00048362455,0.0005011972,0.00085831975,0.00086907047,0.0015044428],"category_scores_gemma":[0.0015521019,0.00037826758,0.00048822025,0.00062452594,0.000686176,0.0004888239,0.00041712544,0.00065937423,0.00021221228],"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.000028912922,0.00003104461,0.00022773417,0.00004552282,0.000025136083,0.00005263428,0.000052963995,0.9326783,0.0029181405,0.01431282,0.00062465254,0.04900216],"study_design_scores_gemma":[0.000026643122,0.00003520234,0.000050263996,0.000009165738,0.000009979134,0.00002506162,0.0000101673995,0.99347395,0.00081615156,0.0043498725,0.0011882439,0.0000053312065],"about_ca_topic_score_codex":0.0029757624,"about_ca_topic_score_gemma":0.0026330824,"teacher_disagreement_score":0.0029757624,"about_ca_system_score_codex":0.0007879171,"about_ca_system_score_gemma":0.0013210803,"threshold_uncertainty_score":0.0059168935},"labels":[],"label_agreement":null},{"id":"W2131490916","doi":"10.1142/s1469026801000251","title":"BOOK REVIEW: \"PATTERN CLASSIFICATION\", R. O. DUDA, P. E. HART and D. G. STORK, Second Edition","year":2001,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Remote Sensing and LiDAR Applications","field":"Environmental Science","cited_by":147,"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 Guelph","funders":"","keywords":"Stork; Computer science; Library science; Artificial intelligence; Ecology","score_opus":0.020080835731399176,"score_gpt":0.2923169523086721,"score_spread":0.2722361165772729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131490916","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.00038143975,0.8769564,0.013058469,0.021289,0.045390476,0.000075492375,0.0010966329,0.0008378352,0.040914353],"genre_scores_gemma":[0.002720451,0.7423266,0.012006839,0.009399856,0.03187718,0.0001132471,0.0021637655,0.00062210864,0.19876991],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912363,0.00007333875,0.00006842132,0.0001842864,0.00050943607,0.000040966966],"domain_scores_gemma":[0.99708825,0.0007727936,0.00014550652,0.00014564395,0.001581631,0.0002662596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001142171,0.0017893874,0.0022041448,0.004865648,0.00070489215,0.0031451883,0.0018570997,0.0016575877,0.047661535],"category_scores_gemma":[0.0042721736,0.00071716093,0.0009066154,0.006932835,0.0009997063,0.0046906276,0.0010007356,0.003254944,0.06557608],"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.000017246628,0.000013257037,0.000062725834,0.00058467325,0.00001637756,0.000023762765,0.000018303068,0.0001674047,0.0003526078,0.0016081044,0.77601147,0.22112411],"study_design_scores_gemma":[0.000003623842,0.000018058316,0.0002397323,0.0003142647,0.000010695158,0.00033114146,0.000012141982,0.00014464746,0.00019218387,0.0020119043,0.9967109,0.000010625538],"about_ca_topic_score_codex":0.0031788687,"about_ca_topic_score_gemma":0.004821938,"teacher_disagreement_score":0.047661535,"about_ca_system_score_codex":0.0014624003,"about_ca_system_score_gemma":0.0019663665,"threshold_uncertainty_score":0.15944374},"labels":[],"label_agreement":null},{"id":"W2146234362","doi":"10.1142/s146902680400129x","title":"EVALUATION OF SELECTING INTERVAL VALUES OF INPUT VARIABLES IN CONNECTIONIST NETWORKS","year":2004,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Neural Networks and Applications","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 Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Connectionism; Variable (mathematics); Selection (genetic algorithm); Interval (graph theory); Artificial neural network; Feature selection; Entropy (arrow of time); Value (mathematics); Artificial intelligence; Principle of maximum entropy; Backpropagation; Data mining; Machine learning; Mathematics","score_opus":0.03888642290138364,"score_gpt":0.3370188435194664,"score_spread":0.29813242061808276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146234362","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.7656278,0.0007968564,0.2292542,0.00023128354,0.00005076339,0.000224834,0.00010847912,0.00073391234,0.002971894],"genre_scores_gemma":[0.94584835,0.00012502306,0.05346706,0.000032589713,0.000010885674,0.00009208008,0.00010880086,0.00003377656,0.0002813872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825126,0.0007760472,0.00015682394,0.00019897171,0.0005077486,0.00010912821],"domain_scores_gemma":[0.98312426,0.013787737,0.00077264744,0.00062340155,0.0014932507,0.0001987373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052408846,0.0009769208,0.00058709265,0.0010294243,0.00033910648,0.0008028712,0.0008551792,0.0008856787,0.0006819454],"category_scores_gemma":[0.032029297,0.00025519784,0.0002609113,0.0006465566,0.00045702243,0.0013433531,0.00064851384,0.0005919075,0.000089632485],"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.0016471266,0.00033583742,0.027863564,0.00046384518,0.0002765688,0.00037358672,0.0004076434,0.60316026,0.02371833,0.0037967206,0.0008366063,0.33711994],"study_design_scores_gemma":[0.000054499997,0.00043860127,0.0049228645,0.0000389123,0.000085505206,0.0001102277,0.00008186905,0.9652074,0.026891496,0.0017882093,0.0003629221,0.000017513908],"about_ca_topic_score_codex":0.0012241948,"about_ca_topic_score_gemma":0.0012222887,"teacher_disagreement_score":0.0052408846,"about_ca_system_score_codex":0.000625538,"about_ca_system_score_gemma":0.00037929125,"threshold_uncertainty_score":0.027716815},"labels":[],"label_agreement":null},{"id":"W2182089961","doi":"10.1142/s1469026816500231","title":"A Multi-Phase Hybrid Metaheuristics Approach for the Exam Timetabling","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Metaheuristic; Tabu search; Simulated annealing; Hill climbing; Benchmarking; Benchmark (surveying); Heuristic; Mathematical optimization; Phase (matter); Algorithm; Artificial intelligence; Mathematics","score_opus":0.22335092826562866,"score_gpt":0.46226281228403093,"score_spread":0.23891188401840227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182089961","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.020277983,0.00042055498,0.9748138,0.0002633026,0.00008390374,0.00018348156,0.00012795378,0.00041939708,0.0034096173],"genre_scores_gemma":[0.21125025,0.00028292256,0.78433985,0.00026325774,0.000058404134,0.000495321,0.00031129378,0.00014916039,0.0028495763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933976,0.00027992655,0.000030049629,0.000090804264,0.00017522521,0.00008428294],"domain_scores_gemma":[0.99920815,0.0004526331,0.00009118357,0.000074058786,0.00011202835,0.00006181556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011581022,0.0008910499,0.0009811785,0.0012773813,0.00041759017,0.00092779374,0.0022947416,0.0012673053,0.0030585073],"category_scores_gemma":[0.0018493333,0.00054971257,0.0013287948,0.0013854324,0.00047754057,0.00097307726,0.00094124145,0.0011242336,0.0003873849],"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.000093053444,0.00018581771,0.0006199813,0.0001334902,0.00009869674,0.00006996812,0.000058599424,0.9068462,0.0029087968,0.011370516,0.0020193998,0.07559545],"study_design_scores_gemma":[0.00003004059,0.000065577646,0.00010782806,0.000009174952,0.000013671955,0.000023374716,0.000013166346,0.99485105,0.0006036328,0.0028166978,0.0014588684,0.0000068808167],"about_ca_topic_score_codex":0.0027010555,"about_ca_topic_score_gemma":0.0034356017,"teacher_disagreement_score":0.0030585073,"about_ca_system_score_codex":0.00075990375,"about_ca_system_score_gemma":0.0015928806,"threshold_uncertainty_score":0.010231674},"labels":[],"label_agreement":null},{"id":"W2198849238","doi":"10.1142/s1469026815500248","title":"A Soft Sensor Based on the Integration of Tikhonov Extreme Learning Machine and Accelerated Kernels for Real-Time Estimation of Automotive Catalyst Temperatures","year":2015,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Machine Learning and ELM","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 Waterloo","funders":"","keywords":"Automotive industry; Computer science; Automotive engine; Tikhonov regularization; Mechatronics; Soft sensor; Artificial neural network; Transient (computer programming); Generalization; Artificial intelligence; Automotive engineering; Inverse problem; Process (computing)","score_opus":0.05362392772180808,"score_gpt":0.33251914412235045,"score_spread":0.2788952164005424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198849238","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.014491884,0.00013876377,0.9846079,0.000044788947,0.000036983864,0.00001634191,0.000008742716,0.00019979946,0.0004549069],"genre_scores_gemma":[0.74626094,0.00018904403,0.25116324,0.00008752666,0.000046847235,0.00007199273,0.000049229897,0.000038516046,0.0020926588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995765,0.00012180903,0.000028445163,0.00008942934,0.00015136482,0.00003246127],"domain_scores_gemma":[0.9996419,0.00015016965,0.000056558074,0.000051623134,0.000077619836,0.000022100143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051440444,0.00046302774,0.0007144194,0.00035510652,0.00020104212,0.00055215834,0.0009305781,0.00085494044,0.00056945125],"category_scores_gemma":[0.0012362836,0.00026421342,0.0005222681,0.00033291677,0.00045118804,0.001111124,0.0007118783,0.0010030459,0.0001961013],"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.0004702053,0.00026592505,0.0023501634,0.0003099888,0.00018867495,0.0002491138,0.00018622572,0.51201415,0.10173249,0.025866412,0.0013704017,0.3549963],"study_design_scores_gemma":[0.000002960607,0.00004227062,0.00012278288,0.0000022213585,0.0000045470256,0.000025077257,0.0000027202018,0.99453485,0.004182588,0.0008311943,0.00024138665,0.0000073553815],"about_ca_topic_score_codex":0.00072879175,"about_ca_topic_score_gemma":0.0009091487,"teacher_disagreement_score":0.0009305781,"about_ca_system_score_codex":0.00034309554,"about_ca_system_score_gemma":0.00035763776,"threshold_uncertainty_score":0.0027204752},"labels":[],"label_agreement":null},{"id":"W2322038820","doi":"10.1142/s1469026816500012","title":"A PSO-Based Approach with Fuzzy Obstacle Avoidance for Cooperative Multi-Robots in Unknown Environments","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Obstacle avoidance; Computer science; Robot; Smoothness; Fuzzy logic; Trajectory; Task (project management); Artificial intelligence; Obstacle; Field (mathematics); Motion planning; Robotics; Key (lock); Collision avoidance; Mobile robot; Engineering; Mathematics","score_opus":0.030939680617800957,"score_gpt":0.2919958861651228,"score_spread":0.26105620554732184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322038820","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.0131728975,0.00025554904,0.9836738,0.00008339099,0.00005642592,0.000039032795,0.0000061904616,0.00011342959,0.0025992126],"genre_scores_gemma":[0.67698944,0.000331021,0.31926772,0.00011828711,0.000062399544,0.00022569842,0.00004673777,0.00003141589,0.0029273846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998454,0.000031463926,0.000009897825,0.00003115857,0.00006337258,0.000018635254],"domain_scores_gemma":[0.99988806,0.000034116612,0.000013029628,0.000012877976,0.000036857316,0.000015126052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028319538,0.0005425096,0.0005796327,0.00036746642,0.00045169992,0.00040076807,0.0008536506,0.0007402527,0.0007193691],"category_scores_gemma":[0.00051371084,0.00025955786,0.0006937803,0.00029045367,0.00038731674,0.00047643456,0.0006961182,0.0005713446,0.00016671572],"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.00005533961,0.00008529734,0.0007791795,0.00012480325,0.00011203851,0.00020836409,0.00017440195,0.8739561,0.016697133,0.015117406,0.0010576204,0.09163239],"study_design_scores_gemma":[0.000009646545,0.000037404356,0.00011425981,0.0000033368196,0.000008124375,0.00003099035,0.000008808771,0.9976533,0.00058417453,0.00096919184,0.00057447085,0.000006344285],"about_ca_topic_score_codex":0.0030970736,"about_ca_topic_score_gemma":0.0021887107,"teacher_disagreement_score":0.0030970736,"about_ca_system_score_codex":0.00024393959,"about_ca_system_score_gemma":0.0005305399,"threshold_uncertainty_score":0.0061581135},"labels":[],"label_agreement":null},{"id":"W2512972094","doi":"10.1142/s1469026816500176","title":"A New Parallel GA-Based Method for Constraint Satisfaction Problems","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Constraint Satisfaction and Optimization","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":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Crossover; Computer science; Heuristic; Mathematical optimization; Solver; Constraint satisfaction; Computation; Constraint (computer-aided design); Constraint programming; Local consistency; Genetic algorithm; Algorithm; Artificial intelligence; Mathematics; Machine learning","score_opus":0.030263103537537,"score_gpt":0.3294731553865745,"score_spread":0.2992100518490375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512972094","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.005192474,0.00012583316,0.98863995,0.00012049629,0.00009375172,0.00010625184,0.00006211876,0.0007840641,0.00487507],"genre_scores_gemma":[0.050912615,0.00014185415,0.94320494,0.00013489182,0.00003883106,0.00030259357,0.00020055873,0.00020924315,0.004854494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995265,0.000112515736,0.00001938855,0.00010315123,0.00019146471,0.000046957917],"domain_scores_gemma":[0.9996886,0.00011548722,0.000024634255,0.000051226234,0.00009845502,0.000021551023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058916275,0.00093087956,0.00072755764,0.0009188123,0.0006031176,0.0007385827,0.0013915309,0.0008454319,0.004464678],"category_scores_gemma":[0.0012087385,0.00041521425,0.0009838049,0.0011075806,0.0005116187,0.000563743,0.00081517256,0.0012666858,0.0008590107],"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.00012802413,0.0001613967,0.00087018474,0.00021051524,0.00011444434,0.00024376149,0.000102401915,0.61994046,0.01954143,0.029787717,0.0077754348,0.32112426],"study_design_scores_gemma":[0.000041951338,0.00003429664,0.000128241,0.000010491365,0.000016893953,0.00007715208,0.000010365835,0.98641765,0.002164835,0.0042603663,0.0068287016,0.000009204593],"about_ca_topic_score_codex":0.0062466525,"about_ca_topic_score_gemma":0.007813127,"teacher_disagreement_score":0.0062466525,"about_ca_system_score_codex":0.0007364745,"about_ca_system_score_gemma":0.0018341893,"threshold_uncertainty_score":0.014935851},"labels":[],"label_agreement":null},{"id":"W2791361378","doi":"10.1142/s1469026818500025","title":"Focus Group: An Optimization Algorithm Inspired by Human Behavior","year":2018,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Metaheuristic Optimization Algorithms Research","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":"University of Regina","funders":"Shahid Rajaee Teacher Training University","keywords":"Computer science; Benchmark (surveying); Evolutionary algorithm; Genetic algorithm; Focus (optics); Mathematical optimization; Algorithm; Optimization problem; Optimization algorithm; Meta-optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.03366772749157315,"score_gpt":0.3608316276317359,"score_spread":0.3271639001401627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791361378","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.008270934,0.00027846257,0.98828083,0.0001374478,0.000052587293,0.00007294786,0.000011723991,0.00021240047,0.002682667],"genre_scores_gemma":[0.22406378,0.00063534896,0.7695914,0.00035791792,0.0001173435,0.0006297352,0.00010100999,0.00015661705,0.0043467814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996835,0.000107868276,0.000011845888,0.000053975178,0.000113347145,0.000029514362],"domain_scores_gemma":[0.9996822,0.00018999672,0.00003925342,0.000022125665,0.00004925196,0.000017236613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009532306,0.000945075,0.0008461483,0.0009015197,0.0007137437,0.0004849161,0.0011972665,0.0012497909,0.002406733],"category_scores_gemma":[0.0012604971,0.0003148303,0.00066922547,0.0006379408,0.00066428556,0.0012750761,0.0010210298,0.000619296,0.00039867134],"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.0001890062,0.00022682475,0.0020634232,0.0003203933,0.0002231853,0.00019479688,0.0006162232,0.53603804,0.013926221,0.05089702,0.0069948942,0.38830996],"study_design_scores_gemma":[0.00008469409,0.00021542009,0.00033737838,0.00003133846,0.000043208158,0.00014556466,0.00006656623,0.9729759,0.0026912277,0.0145066185,0.00888037,0.00002180252],"about_ca_topic_score_codex":0.0015892582,"about_ca_topic_score_gemma":0.0011780749,"teacher_disagreement_score":0.002406733,"about_ca_system_score_codex":0.00038027696,"about_ca_system_score_gemma":0.0006467282,"threshold_uncertainty_score":0.008051395},"labels":[],"label_agreement":null},{"id":"W2808950187","doi":"10.1142/s1469026818500104","title":"A Strength Pareto Evolutionary Algorithm for Optimizing System-On-Chip Test Schedules","year":2018,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"VLSI and Analog Circuit Testing","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Pareto principle; Evolutionary algorithm; System on a chip; Chip; Pareto optimal; Scheduling (production processes); Embedded system; Parallel computing; Multi-objective optimization; Mathematical optimization; Artificial intelligence; Machine learning","score_opus":0.03092966379209095,"score_gpt":0.3078852919468777,"score_spread":0.27695562815478675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808950187","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.046550497,0.00027522942,0.9458425,0.00020729433,0.000045519675,0.00013387426,0.000053039337,0.00026582263,0.0066262707],"genre_scores_gemma":[0.49520043,0.00028452827,0.49688658,0.0002551429,0.000043240747,0.000553881,0.0002285597,0.00014206248,0.0064055263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995384,0.00019404254,0.00001698621,0.000044963777,0.00014716618,0.000058376823],"domain_scores_gemma":[0.99876094,0.00082609535,0.000075567055,0.000050674716,0.00022488368,0.00006180039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017047923,0.00096331467,0.0007870507,0.001237496,0.00044122178,0.00049838243,0.0009904183,0.0010035369,0.0022182895],"category_scores_gemma":[0.0038247346,0.00044882123,0.0007006684,0.0008322206,0.0006440915,0.0004973232,0.00075327564,0.0007866327,0.00031893532],"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.00002846896,0.000038489125,0.00044810542,0.000022675842,0.000029775354,0.000031059415,0.000026854525,0.95422095,0.0009464672,0.005982559,0.00058543123,0.037639268],"study_design_scores_gemma":[0.000011228882,0.00002785931,0.000074983,0.000003784072,0.000005571761,0.0000066783,0.00000496399,0.9974607,0.00016388996,0.0019275474,0.00031066345,0.0000020590878],"about_ca_topic_score_codex":0.0026119556,"about_ca_topic_score_gemma":0.0021002744,"teacher_disagreement_score":0.0026119556,"about_ca_system_score_codex":0.0009802833,"about_ca_system_score_gemma":0.0014167582,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2904101610","doi":"10.1142/s1469026818500220","title":"Multidirectional Grey Wolf Optimizer Algorithm for Solving Global Optimization Problems","year":2018,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Metaheuristic Optimization Algorithms Research","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":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Minimax; Heuristics; Algorithm; Integer programming; Integer (computer science); Local search (optimization); Convergence (economics); Search algorithm; Mathematics","score_opus":0.035359440985362985,"score_gpt":0.348958549445557,"score_spread":0.313599108460194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904101610","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.009170547,0.00076835544,0.9870073,0.000115369825,0.000041027775,0.000046179775,0.00001902663,0.00021701146,0.002615109],"genre_scores_gemma":[0.3282992,0.0011827799,0.66408694,0.00030483052,0.000058129644,0.00044134224,0.00017106807,0.0001532491,0.0053024576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995166,0.00015154683,0.000028392808,0.00007597106,0.00017967717,0.000047882284],"domain_scores_gemma":[0.9997739,0.00010779473,0.000030127863,0.000023946835,0.000050716488,0.000013439237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085424667,0.00092629873,0.0011439746,0.0009056605,0.00042022756,0.0008646968,0.0013346391,0.001261747,0.0015973084],"category_scores_gemma":[0.0011450672,0.00045200164,0.0010681648,0.00089191674,0.00052607304,0.0010171623,0.00083035044,0.0010569914,0.00040131132],"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.00005446984,0.000057186175,0.0007832359,0.00018177109,0.0001972356,0.0001354801,0.0001224144,0.8558791,0.005484269,0.023793578,0.0018008834,0.11151044],"study_design_scores_gemma":[0.000023488077,0.000043338354,0.00014134154,0.00001338701,0.000022610442,0.00004161803,0.00001238331,0.9920439,0.0009846592,0.0046705543,0.0019939558,0.000008739577],"about_ca_topic_score_codex":0.0025316593,"about_ca_topic_score_gemma":0.0020374185,"teacher_disagreement_score":0.0025316593,"about_ca_system_score_codex":0.0005758132,"about_ca_system_score_gemma":0.00091588474,"threshold_uncertainty_score":0.0053435564},"labels":[],"label_agreement":null},{"id":"W3043139694","doi":"10.1142/s1469026820500108","title":"A Novel Nature-Inspired Technique Based on Mushroom Reproduction for Constraint Solving and Optimization","year":2020,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Constraint Satisfaction and Optimization","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":"University of Regina","funders":"","keywords":"Computer science; Constraint (computer-aided design); Mathematical optimization; Reproduction; Optimization problem; Set (abstract data type); Computation; Process (computing); Mushroom; Algorithm; Mathematics; Ecology; Biology","score_opus":0.02621352050204756,"score_gpt":0.2998587408069799,"score_spread":0.2736452203049323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043139694","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.017699411,0.00044737506,0.9772424,0.00016617998,0.00004594872,0.00006640245,0.000048659804,0.00047260444,0.0038108872],"genre_scores_gemma":[0.24539427,0.00043044882,0.7500067,0.00023579992,0.0000400092,0.00021161191,0.0002108993,0.00018378973,0.0032864737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997861,0.00004394657,0.0000150538535,0.000048862294,0.00008014658,0.000026054198],"domain_scores_gemma":[0.99966216,0.0001661997,0.00004083318,0.000059811355,0.000043726548,0.000027174443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003268375,0.0007095896,0.000763648,0.0006219127,0.00044759206,0.0006439077,0.0014390629,0.00097622664,0.0023156218],"category_scores_gemma":[0.0008914392,0.00035537424,0.0009295762,0.0006649157,0.0006273513,0.0009208982,0.001230524,0.00084761746,0.00044102417],"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.0001354863,0.0001543329,0.0018525204,0.00036425504,0.00015217352,0.00034537938,0.00017322734,0.64271027,0.05458138,0.03943533,0.0049229637,0.25517264],"study_design_scores_gemma":[0.00002191836,0.000058919795,0.00018087166,0.000014641198,0.000016468968,0.000106464126,0.000018872008,0.98731506,0.0052888226,0.0037396385,0.0032244432,0.00001384931],"about_ca_topic_score_codex":0.0015887341,"about_ca_topic_score_gemma":0.0017261336,"teacher_disagreement_score":0.0023156218,"about_ca_system_score_codex":0.0003189286,"about_ca_system_score_gemma":0.000587625,"threshold_uncertainty_score":0.0077465177},"labels":[],"label_agreement":null},{"id":"W3208450211","doi":"10.1142/s1469026821500218","title":"FUSIONET: A Hybrid Model Towards Image Classification","year":2021,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","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":"University of Windsor","funders":"","keywords":"Computer science; Artificial intelligence; Classifier (UML); Contextual image classification; Pattern recognition (psychology); Image (mathematics); Pixel; Feature (linguistics); Representation (politics); Object (grammar); Computer vision","score_opus":0.043508501505956886,"score_gpt":0.35739888948820725,"score_spread":0.3138903879822504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208450211","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.011860479,0.0004639442,0.9842755,0.00037953982,0.00009536194,0.00004813931,0.00013087194,0.00078717957,0.0019590384],"genre_scores_gemma":[0.5984217,0.0011363793,0.38585868,0.0005289106,0.00030101737,0.00033289666,0.00078515743,0.00018295588,0.012452267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940443,0.00013566746,0.000031829575,0.0001799554,0.00017842253,0.000069707676],"domain_scores_gemma":[0.9993556,0.0002818055,0.000047054826,0.00009299253,0.00018657389,0.000035980534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010980609,0.0006509127,0.0009769785,0.0010472803,0.000442138,0.0017158337,0.0021877424,0.0015588491,0.0026312084],"category_scores_gemma":[0.0020144419,0.00032912666,0.0012156472,0.0011628219,0.00079359906,0.002998232,0.0013810042,0.0015997941,0.0010774692],"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.0005888158,0.0003192711,0.0034613423,0.00024204321,0.00025583128,0.00027203013,0.00031659077,0.41669968,0.013640744,0.10183695,0.007913048,0.45445374],"study_design_scores_gemma":[0.00000413607,0.000034562596,0.00011965223,0.0000062236372,0.0000121816765,0.000034929577,0.000008834957,0.986343,0.00089097174,0.011199088,0.0013401781,0.000006167294],"about_ca_topic_score_codex":0.004101793,"about_ca_topic_score_gemma":0.0027417345,"teacher_disagreement_score":0.004101793,"about_ca_system_score_codex":0.0008554522,"about_ca_system_score_gemma":0.0008090028,"threshold_uncertainty_score":0.008802295},"labels":[],"label_agreement":null},{"id":"W4395455684","doi":"10.1142/s1469026824500081","title":"A Hybrid Method for Multiple Sclerosis Lesion Segmentation Using Wavelet and Dense U-Net","year":2024,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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 Manitoba","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Pattern recognition (psychology); Wavelet; Deep learning; Lesion; Image segmentation; Computer vision; Medicine; Pathology","score_opus":0.15564298600911705,"score_gpt":0.3883873247729894,"score_spread":0.23274433876387232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395455684","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.028171955,0.00050408184,0.9676781,0.00022697933,0.000089720495,0.000094439034,0.00011684251,0.0015263369,0.0015914824],"genre_scores_gemma":[0.2849497,0.00061155844,0.706254,0.00037215208,0.00013557145,0.00015385232,0.0006274029,0.00040284966,0.0064929645],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956113,0.00004846337,0.00003675177,0.00011295055,0.0001776826,0.0000631137],"domain_scores_gemma":[0.9995425,0.00011702874,0.00005346558,0.000052266114,0.00019466017,0.00004000753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008263029,0.0007773793,0.0009072912,0.0021551074,0.00052187475,0.0012268411,0.0011478099,0.0015323843,0.0022440795],"category_scores_gemma":[0.0013562229,0.00051622675,0.0009899352,0.0012213204,0.00046596891,0.0014604867,0.00093017466,0.0007669532,0.00077964197],"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.00047920275,0.00015479088,0.0024688412,0.00023606641,0.00016877938,0.00032902302,0.00015728068,0.10625344,0.039245732,0.0054227384,0.005531789,0.8395523],"study_design_scores_gemma":[0.000019531151,0.00006538546,0.0008347442,0.000017159948,0.000040403545,0.00032767738,0.00003170763,0.9801911,0.014095271,0.002275063,0.002079963,0.000022031896],"about_ca_topic_score_codex":0.0042796065,"about_ca_topic_score_gemma":0.005448593,"teacher_disagreement_score":0.0042796065,"about_ca_system_score_codex":0.00072736834,"about_ca_system_score_gemma":0.0010240288,"threshold_uncertainty_score":0.0085093975},"labels":[],"label_agreement":null}]}