{"meta":{"query_hash":"eaefe8f63bc2","filters":{"venue":"International Journal of Artificial Intelligence Tools"},"cohort_total":39,"direct_labels_cover":0,"predictions_cover":39,"exported":39,"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/eaefe8f63bc2","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Artificial+Intelligence+Tools"},"results":[{"id":"W125162825","doi":"10.1142/s0218213005002053","title":"CLUSTERING SPATIAL DATA IN THE PRESENCE OF OBSTACLES","year":2005,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Cluster analysis; Computer science; Preprocessor; Constraint (computer-aided design); Data mining; Clustering high-dimensional data; Computation; Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.1338871831955201,"score_gpt":0.3589904498955765,"score_spread":0.2251032667000564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125162825","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.057179566,0.0003344456,0.93956834,0.00026373618,0.000051254472,0.00014569174,0.0005554653,0.0007565452,0.001145006],"genre_scores_gemma":[0.33187512,0.00041415886,0.66262776,0.0001203213,0.000054490512,0.00024280688,0.0029003064,0.00022518521,0.0015398923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670225,0.00067279185,0.00027486382,0.0006979738,0.001421131,0.00023095605],"domain_scores_gemma":[0.993814,0.0026938212,0.00069677207,0.0010987897,0.0014753548,0.00022131577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018385348,0.0010131728,0.0016405634,0.0032063855,0.0015909555,0.002196279,0.0023605735,0.0013926028,0.0009067566],"category_scores_gemma":[0.010194283,0.0008333852,0.0012526965,0.004941827,0.0011795121,0.0023781417,0.003107497,0.0011073695,0.00048782828],"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.0005433247,0.00013260792,0.013667616,0.0006767865,0.00038507985,0.0009363413,0.00089500746,0.7069403,0.01895468,0.01854572,0.0061512496,0.23217128],"study_design_scores_gemma":[0.000022619508,0.000045843066,0.0021853338,0.000036065776,0.00004000247,0.00021738544,0.00039567694,0.96752787,0.010095532,0.012200163,0.007181476,0.00005202365],"about_ca_topic_score_codex":0.011160925,"about_ca_topic_score_gemma":0.014438655,"teacher_disagreement_score":0.011160925,"about_ca_system_score_codex":0.0009459452,"about_ca_system_score_gemma":0.002370837,"threshold_uncertainty_score":0.022191882},"labels":[],"label_agreement":null},{"id":"W1976320987","doi":"10.1142/s0218213008003881","title":"TEXT SUMMARIZATION USING LEXICAL COHESION: APPROACHES AND EVALUATIONS","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Topic Modeling","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 Lethbridge","funders":"","keywords":"Computer science; Automatic summarization; Cohesion (chemistry); Popularity; Multi-document summarization; Information retrieval; Context (archaeology); Identification (biology); The Internet; World Wide Web; Natural language processing","score_opus":0.3494098354123179,"score_gpt":0.3781528857572114,"score_spread":0.028743050344893495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976320987","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.832915,0.017926835,0.11474091,0.0007424783,0.00026390603,0.0035457453,0.0027383657,0.010476136,0.016650578],"genre_scores_gemma":[0.791146,0.005095046,0.18906718,0.00013199534,0.00023432808,0.0011878584,0.00861583,0.00047179317,0.0040499824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99079376,0.005179578,0.0009154787,0.00070783775,0.0021484995,0.00025481734],"domain_scores_gemma":[0.97590977,0.018717399,0.0008845854,0.001073281,0.002896041,0.00051896693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007890316,0.0013272447,0.0015799257,0.004940256,0.0010772337,0.0021264309,0.0014976755,0.0013515276,0.0017534222],"category_scores_gemma":[0.02345077,0.00035035057,0.0007332217,0.0044062063,0.0007008998,0.0035029692,0.0014013267,0.00079183216,0.00063205406],"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.0031328776,0.0028137236,0.009672636,0.00534467,0.00081679906,0.00039766286,0.003790224,0.025685303,0.032624777,0.0019635537,0.010740754,0.903017],"study_design_scores_gemma":[0.0027240936,0.016497875,0.0784461,0.0006395018,0.0037314175,0.0013520925,0.010703406,0.71281034,0.123046406,0.006382276,0.043187335,0.0004791644],"about_ca_topic_score_codex":0.008003002,"about_ca_topic_score_gemma":0.008066168,"teacher_disagreement_score":0.008003002,"about_ca_system_score_codex":0.0012509205,"about_ca_system_score_gemma":0.000953374,"threshold_uncertainty_score":0.041728497},"labels":[],"label_agreement":null},{"id":"W1978229367","doi":"10.1142/s0218213011000528","title":"RULE RESPONDER: RULE-BASED AGENTS FOR THE SEMANTIC-PRAGMATIC WEB","year":2011,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Semantic Web; Semantic Web Rule Language; Social Semantic Web; Context (archaeology); Complex event processing; Rule-based system; Multi-agent system; Event (particle physics); Semantic analytics; Knowledge management; Artificial intelligence; Programming language","score_opus":0.14902596976628243,"score_gpt":0.34528760920414164,"score_spread":0.1962616394378592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978229367","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.0030912342,0.0002499723,0.94329274,0.0012230785,0.00035564197,0.00060888036,0.0004840237,0.023539063,0.027155364],"genre_scores_gemma":[0.09152811,0.0006025654,0.86286813,0.001611557,0.00021147534,0.00089729676,0.0019152483,0.0030132523,0.03735234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969137,0.0010504546,0.0003451272,0.00036593308,0.0011684642,0.00015641855],"domain_scores_gemma":[0.9969187,0.0011160417,0.00018767099,0.0008704077,0.0005847342,0.00032251404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004993485,0.000917838,0.0010632222,0.0013037204,0.0012702323,0.0050832867,0.003240408,0.0034097184,0.018456744],"category_scores_gemma":[0.011051947,0.000787908,0.0010614268,0.0009209057,0.0020613442,0.006391672,0.0032529985,0.003486892,0.012629889],"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.0007061261,0.0006088775,0.0011067002,0.0008291679,0.00016098682,0.0021412643,0.0020082032,0.018929899,0.030182114,0.5925811,0.10139497,0.24935058],"study_design_scores_gemma":[0.00026974318,0.00011484712,0.00036597915,0.00019323119,0.000101799174,0.0008336334,0.00028367736,0.24065179,0.02261852,0.28924748,0.44515207,0.00016717568],"about_ca_topic_score_codex":0.0016188401,"about_ca_topic_score_gemma":0.001748767,"teacher_disagreement_score":0.018456744,"about_ca_system_score_codex":0.00070097396,"about_ca_system_score_gemma":0.0018060775,"threshold_uncertainty_score":0.061743975},"labels":[],"label_agreement":null},{"id":"W1991826621","doi":"10.1142/s0218213007003199","title":"A FAST HYBRID ALGORITHM FOR MULTICAST ROUTING IN WIRELESS NETWORKS","year":2007,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Network Traffic and Congestion Control","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 Ottawa","funders":"","keywords":"Computer science; Multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Computer network; Xcast; Pragmatic General Multicast; Source-specific multicast; Algorithm","score_opus":0.03618702182338484,"score_gpt":0.3124522119035435,"score_spread":0.27626519008015865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991826621","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.010277117,0.00028271895,0.98704183,0.00011513973,0.00006425406,0.00004664349,0.000014311446,0.00029282836,0.0018651785],"genre_scores_gemma":[0.3455763,0.00034513537,0.64897597,0.00022211838,0.00009345751,0.00042055742,0.00012777392,0.000099658486,0.004139054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995264,0.00014690569,0.000018559775,0.000059291393,0.00018704566,0.000061785904],"domain_scores_gemma":[0.9993249,0.00044415976,0.000042938635,0.000044893255,0.000112873255,0.000030329053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010537549,0.0006158647,0.00078945403,0.00092150294,0.00061973266,0.00073731993,0.0017754787,0.0013306127,0.0018558432],"category_scores_gemma":[0.0019187771,0.0002954057,0.00052632,0.00088474416,0.0006513477,0.001158414,0.0010993021,0.0008729006,0.00035602532],"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.00015020517,0.000107596665,0.0005720193,0.000099969984,0.000084647756,0.00009207024,0.0001155368,0.67695427,0.00460975,0.03349701,0.0024628395,0.28125405],"study_design_scores_gemma":[0.000022637703,0.000056573022,0.00005177421,0.000005308184,0.000008560274,0.000035366553,0.000010009234,0.99315953,0.00052091555,0.004964085,0.0011592793,0.0000059135587],"about_ca_topic_score_codex":0.0016379497,"about_ca_topic_score_gemma":0.0015971238,"teacher_disagreement_score":0.0018558432,"about_ca_system_score_codex":0.00066739524,"about_ca_system_score_gemma":0.00061604555,"threshold_uncertainty_score":0.00620842},"labels":[],"label_agreement":null},{"id":"W1994173598","doi":"10.1142/s0218213001000660","title":"AN ASSUMPTIVE LOGIC PROGRAMMING METHODOLOGY FOR PARSING","year":2001,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Natural Language Processing Techniques","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":"Simon Fraser University","funders":"","keywords":"Computer science; Datalog; Parsing; Parsing expression grammar; Programming language; L-attributed grammar; Rule-based machine translation; Phrase structure grammar; Logic programming; Artificial intelligence; Natural language processing; S-attributed grammar; Parser combinator; Continuation; Context-free grammar","score_opus":0.2408640637981287,"score_gpt":0.45734304363168704,"score_spread":0.21647897983355835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994173598","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.00036433144,0.000020033356,0.9973653,0.0001561665,0.000015891945,0.00003457488,0.000043498996,0.000659854,0.001340259],"genre_scores_gemma":[0.033690784,0.00016411697,0.9623782,0.00027888844,0.000059263362,0.00019110974,0.00017075655,0.00032439534,0.0027425247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728596,0.00090950454,0.00019774432,0.00060833606,0.0008493404,0.00014918952],"domain_scores_gemma":[0.99561006,0.0024814545,0.00025146554,0.0011132392,0.0004401324,0.000103681174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041547203,0.0010288542,0.0005294802,0.001238451,0.0013920082,0.0035521465,0.00358017,0.0015440799,0.008812308],"category_scores_gemma":[0.00911253,0.0008365449,0.001924438,0.0012310304,0.0038189269,0.005951735,0.003022399,0.0044027083,0.0023688595],"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.000025899712,0.000036313522,0.00018241354,0.00015846339,0.000018868803,0.00018560006,0.0005085963,0.008957563,0.0025661304,0.9286578,0.0029940251,0.05570824],"study_design_scores_gemma":[0.000026229302,0.000050538154,0.00009584732,0.00008704589,0.0000617073,0.00039286155,0.00013173593,0.12133605,0.014510935,0.8117332,0.0515244,0.000049443715],"about_ca_topic_score_codex":0.001214088,"about_ca_topic_score_gemma":0.0016778584,"teacher_disagreement_score":0.008812308,"about_ca_system_score_codex":0.0014877539,"about_ca_system_score_gemma":0.0023730034,"threshold_uncertainty_score":0.0294801},"labels":[],"label_agreement":null},{"id":"W1996845866","doi":"10.1142/s0218213006003089","title":"COORDINATION AND APPLICATIVE CATEGORIAL TYPE LOGIC","year":2006,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Categorial grammar; Combinatory categorial grammar; Conjunction (astronomy); Programming language; Type (biology); Process (computing); Artificial intelligence; Generative grammar; Theoretical computer science; Natural language processing; Link grammar; Mildly context-sensitive grammar formalism; Head-driven phrase structure grammar; Emergent grammar","score_opus":0.041097519509761586,"score_gpt":0.3361296487219334,"score_spread":0.2950321292121718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996845866","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.12168495,0.007292578,0.65974945,0.007278872,0.0008927489,0.0001142488,0.0004859623,0.0019905204,0.20051073],"genre_scores_gemma":[0.9136348,0.0018072344,0.0641093,0.00080760644,0.0004698467,0.00008427519,0.00024115779,0.00019319044,0.018652571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981179,0.0007124846,0.00013414602,0.0003640376,0.00039097367,0.00028047548],"domain_scores_gemma":[0.9982161,0.0008988482,0.0002087717,0.0002942578,0.00027048594,0.000111530775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024123152,0.00048130457,0.00058245653,0.0019078571,0.0015821446,0.0041971807,0.0010584994,0.0013237263,0.0045006997],"category_scores_gemma":[0.002718453,0.00040741154,0.001228439,0.0017953524,0.0057314364,0.004644973,0.0022229638,0.0015507592,0.00071163545],"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.0000068510535,0.0000026436348,0.00016055466,0.000016385025,0.0000044005383,0.00008246742,0.00019082491,0.0007392413,0.00021340541,0.99564123,0.00038570253,0.0025562998],"study_design_scores_gemma":[0.00000873805,0.000007482809,0.00017494512,0.000014000034,0.0000089637815,0.00013219322,0.00009711742,0.0034588317,0.0002850343,0.98650396,0.00929955,0.000009198502],"about_ca_topic_score_codex":0.0050267037,"about_ca_topic_score_gemma":0.002376051,"teacher_disagreement_score":0.0050267037,"about_ca_system_score_codex":0.0030277586,"about_ca_system_score_gemma":0.0015686511,"threshold_uncertainty_score":0.021968007},"labels":[],"label_agreement":null},{"id":"W1998787753","doi":"10.1142/s0218213003001216","title":"Logic Grammars for Diagnosis and Repair","year":2003,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parsing; Rule-based machine translation; String (physics); Transformation (genetics); Natural language processing; Constraint (computer-aided design); Artificial intelligence; Grammar; Programming language; Parsing expression grammar; Feature (linguistics); Context-free grammar; L-attributed grammar; Definite clause grammar; Grammar induction; Theoretical computer science; Mathematics; Linguistics","score_opus":0.07888665829628552,"score_gpt":0.3605100441032646,"score_spread":0.2816233858069791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998787753","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.0010409808,0.00014719673,0.9948297,0.0004989479,0.00003896124,0.00009082471,0.00010549987,0.0010893686,0.0021584716],"genre_scores_gemma":[0.046515565,0.00034950968,0.9489635,0.00040369996,0.00007035289,0.00028117362,0.00037017747,0.00025024466,0.0027957186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643904,0.001034095,0.00038193288,0.00072118145,0.0012120868,0.0002116736],"domain_scores_gemma":[0.9952147,0.002638554,0.00034497597,0.0011297354,0.00055019883,0.00012181059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030038643,0.0010932012,0.0008303077,0.0019779878,0.00094577944,0.0027791045,0.0036825933,0.002489036,0.006138124],"category_scores_gemma":[0.010325321,0.00077980733,0.0021438869,0.0012293865,0.004037044,0.004254829,0.0031174761,0.003352956,0.002124764],"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.00006343215,0.00007578625,0.0005936661,0.0003244192,0.000058384685,0.0005701138,0.0005465422,0.08553819,0.004455068,0.79792297,0.004524351,0.10532705],"study_design_scores_gemma":[0.00004284826,0.000042249223,0.00011363436,0.00009574924,0.000056636894,0.000358241,0.0001136684,0.20741485,0.0061487774,0.7579405,0.02763334,0.00003942348],"about_ca_topic_score_codex":0.003143695,"about_ca_topic_score_gemma":0.0027533208,"teacher_disagreement_score":0.006138124,"about_ca_system_score_codex":0.0014731284,"about_ca_system_score_gemma":0.0028759323,"threshold_uncertainty_score":0.020534039},"labels":[],"label_agreement":null},{"id":"W2005254071","doi":"10.1142/s0218213007003254","title":"SOLVING INCREMENTAL SATISFIABILITY","year":2007,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","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":"Satisfiability; Computer science; Completeness (order theory); Boolean satisfiability problem; Propositional calculus; Conjunctive normal form; Approximation algorithm; True quantified Boolean formula; Propositional formula; Mathematical optimization; Upper and lower bounds; Mathematics; Theoretical computer science; Algorithm; Propositional variable","score_opus":0.05154072613426004,"score_gpt":0.3305258114139577,"score_spread":0.2789850852796977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005254071","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.06003673,0.0003536908,0.9335511,0.00036334485,0.00004540808,0.00025384288,0.00014630507,0.0010060316,0.004243468],"genre_scores_gemma":[0.3162474,0.000539333,0.6799832,0.00015030507,0.00005206729,0.00032308605,0.00066563557,0.0001146071,0.001924427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986749,0.00052279525,0.00007787766,0.00016652017,0.00040578016,0.00015212904],"domain_scores_gemma":[0.9945471,0.0040250756,0.00031081357,0.0005959422,0.00045121138,0.00006980402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015925886,0.0006130134,0.00075908116,0.00077952765,0.00061739126,0.000956257,0.001805352,0.0009167158,0.002802696],"category_scores_gemma":[0.008824099,0.000528356,0.0014415104,0.0010951665,0.00083008735,0.001715877,0.0014722674,0.001159787,0.00031502516],"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.00022708297,0.00034067887,0.0048858644,0.0010550992,0.0002754741,0.0006207703,0.0005794709,0.4259429,0.017820794,0.1274205,0.0073895464,0.4134419],"study_design_scores_gemma":[0.00007835742,0.00014215702,0.0006468323,0.000049863465,0.000115016155,0.0002957361,0.00014498059,0.90159184,0.012032004,0.078708865,0.006171055,0.000023171577],"about_ca_topic_score_codex":0.0023613865,"about_ca_topic_score_gemma":0.004542158,"teacher_disagreement_score":0.002802696,"about_ca_system_score_codex":0.000739753,"about_ca_system_score_gemma":0.0019801727,"threshold_uncertainty_score":0.009375989},"labels":[],"label_agreement":null},{"id":"W2014517001","doi":"10.1142/s0218213004001697","title":"TEMPORAL VERSUS LATEST SNAPSHOT WEB USAGE MINING USING KOHONEN SOM AND MODIFIED KOHONEN SOM BASED ON THE PROPERTIES OF ROUGH SETS THEORY","year":2004,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","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":"Saint Mary's University","funders":"","keywords":"Self-organizing map; Computer science; Cluster analysis; Web mining; Data mining; Snapshot (computer storage); The Internet; Hierarchical clustering; Rough set; Artificial intelligence; Web page; Database; World Wide Web","score_opus":0.16912268507542091,"score_gpt":0.33207829162278074,"score_spread":0.16295560654735983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014517001","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.23199086,0.00075593183,0.7610939,0.00017735393,0.00011181818,0.00008774927,0.00024008118,0.0005286934,0.0050135683],"genre_scores_gemma":[0.7774797,0.0003522057,0.22061186,0.000033707736,0.000029388748,0.000056277717,0.00019798633,0.000040039005,0.0011988373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995906,0.00007940032,0.00004644388,0.000059208072,0.00018459387,0.000039795857],"domain_scores_gemma":[0.99911314,0.00035986645,0.00007129648,0.00010485723,0.00030831603,0.000042428015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089831237,0.0002549284,0.0004952566,0.0013056826,0.00028889248,0.001173673,0.00066144427,0.00043743008,0.0006483371],"category_scores_gemma":[0.003012637,0.00021252109,0.0008185008,0.0012520512,0.000312812,0.0015784708,0.00044720204,0.00038055924,0.00013369968],"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.0008465285,0.00019969093,0.02342216,0.0004948732,0.0004433507,0.00050490425,0.00070308906,0.16805634,0.037625164,0.020215109,0.0016267856,0.74586195],"study_design_scores_gemma":[0.000023142014,0.00014742816,0.015735578,0.000048268914,0.00010763294,0.00042680872,0.00037863405,0.95108306,0.014319971,0.015393277,0.0022667672,0.000069444955],"about_ca_topic_score_codex":0.0021044721,"about_ca_topic_score_gemma":0.00304998,"teacher_disagreement_score":0.0021044721,"about_ca_system_score_codex":0.00035143993,"about_ca_system_score_gemma":0.0003278927,"threshold_uncertainty_score":0.004750788},"labels":[],"label_agreement":null},{"id":"W2015512848","doi":"10.1142/s0218213003001241","title":"Active Tracking and Cloning of Facial Expressions Using Spatio-Temporal Information","year":2003,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Facial expression; Computer vision; Artificial intelligence; Optical flow; Motion estimation; Animation; Facial motion capture; Computer facial animation; Coding (social sciences); Feature (linguistics); Face (sociological concept); Pattern recognition (psychology); Computer animation; Facial recognition system; Face detection; Computer graphics (images); Image (mathematics); Mathematics","score_opus":0.08602277891225298,"score_gpt":0.3664848112884902,"score_spread":0.28046203237623724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015512848","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.036868364,0.00020346523,0.9614649,0.00005971088,0.000038650684,0.00003136871,0.000022969172,0.00022398663,0.0010866448],"genre_scores_gemma":[0.39409453,0.0005761602,0.5998546,0.00008237945,0.000059845337,0.00011966951,0.00011048849,0.00011285349,0.0049894666],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970764,0.000057857524,0.000012196747,0.00008282556,0.00011862471,0.000020917349],"domain_scores_gemma":[0.99951434,0.00018671014,0.00008831052,0.00009106314,0.00009433331,0.000025231242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048456606,0.00042542035,0.00035500448,0.00043147273,0.0001943056,0.0004146421,0.0005840367,0.00033601918,0.0007288793],"category_scores_gemma":[0.0013680924,0.00025993178,0.000417671,0.00026451435,0.00043742155,0.0007936592,0.00039161745,0.00042065102,0.00027623348],"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.0002524649,0.000078852376,0.0010592018,0.00010758053,0.00003768287,0.00015683626,0.00040331334,0.022251576,0.5610225,0.0093339365,0.00071400957,0.40458205],"study_design_scores_gemma":[0.000032382333,0.00030004006,0.004383248,0.000034315734,0.0001032754,0.0005147466,0.00012628418,0.65925664,0.31997073,0.0046503684,0.01056981,0.00005820799],"about_ca_topic_score_codex":0.0009872514,"about_ca_topic_score_gemma":0.0012446891,"teacher_disagreement_score":0.0009872514,"about_ca_system_score_codex":0.0003204134,"about_ca_system_score_gemma":0.00031979696,"threshold_uncertainty_score":0.0025627017},"labels":[],"label_agreement":null},{"id":"W2020066471","doi":"10.1142/s0218213008004187","title":"PORTFOLIOS WITH DEADLINES FOR BACKTRACKING SEARCH","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Backtracking; Computer science; Constraint learning; Constraint satisfaction problem; Scheduling (production processes); Constraint satisfaction; Schedule; Mathematical optimization; Portfolio; Look-ahead; Limit (mathematics); Theoretical computer science; Algorithm; Local consistency; Artificial intelligence; Mathematics","score_opus":0.11473468997736803,"score_gpt":0.33893927159231463,"score_spread":0.2242045816149466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020066471","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.022603396,0.00096630707,0.96888685,0.00060498243,0.0001652378,0.00034302383,0.00011374728,0.0012819375,0.0050345347],"genre_scores_gemma":[0.3756763,0.00069534744,0.61687064,0.0004738806,0.00019939466,0.0007687683,0.00036079928,0.00036240937,0.0045924936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99496436,0.0023373112,0.00042876805,0.0008430911,0.0010671491,0.00035933993],"domain_scores_gemma":[0.9828415,0.010900117,0.0014314303,0.0028582898,0.0011501312,0.00081868103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009013747,0.0014053126,0.0023568391,0.0016460316,0.0010735671,0.0021685667,0.0031920734,0.002126285,0.0058400636],"category_scores_gemma":[0.04487096,0.0010395374,0.0010070226,0.0018579005,0.0015962298,0.004988798,0.003238568,0.003266482,0.0014537326],"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.0006776383,0.0005098285,0.0028403846,0.00037975394,0.00011302116,0.00013882485,0.0002600687,0.5824155,0.002192076,0.100034125,0.0068251644,0.3036136],"study_design_scores_gemma":[0.00015816266,0.00026155045,0.00022405136,0.00005790221,0.00003259712,0.00006428976,0.000047911966,0.91486144,0.0011634779,0.07869475,0.004413302,0.000020479376],"about_ca_topic_score_codex":0.001159898,"about_ca_topic_score_gemma":0.0016960503,"teacher_disagreement_score":0.009013747,"about_ca_system_score_codex":0.0016282053,"about_ca_system_score_gemma":0.0027589404,"threshold_uncertainty_score":0.04766977},"labels":[],"label_agreement":null},{"id":"W2042255956","doi":"10.1142/s0218213004001727","title":"THE COMPUTATION OF INVERSE TIME VARIANT FUNCTIONS VIA PROPER PSEUDOINVERSE BOUNDING: A RADIAL BASIS FUNCTION NETWORK APPROACH","year":2004,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Metallurgy and Material Forming","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Moore–Penrose pseudoinverse; Computer science; Radial basis function network; Radial basis function; Bounding overwatch; Computation; Inverse; Inverse function; Algorithm; Gravitational singularity; Generalized inverse; Applied mathematics; Mathematical optimization; Artificial neural network; Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.03440814532528789,"score_gpt":0.24774833539975516,"score_spread":0.21334019007446728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042255956","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.0012212563,0.00004602615,0.9982893,0.000020123603,0.0000075500006,0.00000345569,0.0000034533768,0.00006607764,0.00034276958],"genre_scores_gemma":[0.18258187,0.0004973619,0.8129462,0.00006550721,0.000056739576,0.000057809906,0.00007650786,0.00018335384,0.0035346546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997172,0.00007027331,0.000015701491,0.000046825506,0.0001302891,0.000019726996],"domain_scores_gemma":[0.99958223,0.0001867123,0.00003610564,0.000059414764,0.000122476,0.000013063385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069774874,0.00057448796,0.00056743843,0.000341922,0.00020153669,0.0007630286,0.0006506612,0.0007481107,0.0013715319],"category_scores_gemma":[0.001964783,0.0002585642,0.00039346135,0.00029627106,0.0005245516,0.0013432903,0.0005178417,0.00093493453,0.0007245758],"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.00014393617,0.00004041456,0.0004375922,0.0001952751,0.000038524293,0.00014378813,0.00013460412,0.57558477,0.04300482,0.07272833,0.0016980793,0.30584988],"study_design_scores_gemma":[0.0000031357424,0.000015157742,0.00006537957,0.0000059565723,0.0000037778668,0.000047218946,0.000004986152,0.98803025,0.0047066673,0.005409499,0.0017013856,0.0000065128625],"about_ca_topic_score_codex":0.0012538215,"about_ca_topic_score_gemma":0.0010475647,"teacher_disagreement_score":0.0013715319,"about_ca_system_score_codex":0.00026799363,"about_ca_system_score_gemma":0.00042799953,"threshold_uncertainty_score":0.0045882463},"labels":[],"label_agreement":null},{"id":"W2056258147","doi":"10.1142/s0218213005002028","title":"APPLICATIVE AND COMBINATORY CATEGORIAL GRAMMAR AND SUBORDINATE CONSTRUCTIONS IN FRENCH","year":2005,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Natural Language Processing 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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Combinatory categorial grammar; Categorial grammar; Combinatory logic; Computer science; Cognitive grammar; Interrogative; Linguistics; Link grammar; Generalization; Grammar; Mildly context-sensitive grammar formalism; Emergent grammar; Head-driven phrase structure grammar; Generative grammar; Natural language processing; Artificial intelligence; Cognition; Programming language; Mathematics; Psychology","score_opus":0.024829668831408476,"score_gpt":0.3139610256161994,"score_spread":0.2891313567847909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056258147","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.6199811,0.0042478684,0.28291014,0.0016496405,0.000086802575,0.00009650946,0.00036611842,0.00076170586,0.08990016],"genre_scores_gemma":[0.9787208,0.00040248458,0.017133137,0.000090600275,0.000028442111,0.0000282067,0.00010922833,0.00004313878,0.003443891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885607,0.0005403673,0.000052499945,0.00019241135,0.00019171879,0.00016693457],"domain_scores_gemma":[0.9991671,0.0003774362,0.00012570484,0.00010681574,0.00017137779,0.000051634892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011981387,0.00051023846,0.0003551057,0.0021366521,0.0010071449,0.0030505296,0.0003629892,0.0006068829,0.001585565],"category_scores_gemma":[0.0012358269,0.00023580034,0.0009443491,0.00147168,0.0051956913,0.0018391974,0.0008164599,0.0005834208,0.00020181862],"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.000023499755,0.0000094631105,0.0044211852,0.00003929824,0.000014793616,0.0004174799,0.0032721967,0.0026345397,0.0019744018,0.97095054,0.00038266965,0.015859773],"study_design_scores_gemma":[0.00001737584,0.00005949861,0.024876755,0.000059143786,0.00007403104,0.0017232946,0.0030693857,0.022030158,0.0027648099,0.89156145,0.05367824,0.0000858536],"about_ca_topic_score_codex":0.023464924,"about_ca_topic_score_gemma":0.014299532,"teacher_disagreement_score":0.023464924,"about_ca_system_score_codex":0.002997367,"about_ca_system_score_gemma":0.0012128957,"threshold_uncertainty_score":0.04665667},"labels":[],"label_agreement":null},{"id":"W2067564749","doi":"10.1142/s0218213012500030","title":"STOCHASTIC RESOURCE ALLOCATION IN MULTIAGENT ENVIRONMENTS: AN APPROACH BASED ON DISTRIBUTED Q-VALUES AND BOUNDED REAL-TIME DYNAMIC PROGRAMMING","year":2012,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Bounded function; A priori and a posteriori; Mathematical optimization; Heuristic; Convergence (economics); Set (abstract data type); Multi-agent system; Distributed computing; Resource allocation; Dynamic programming; Distributed algorithm; Resource (disambiguation); Reduction (mathematics); Algorithm; Artificial intelligence; Mathematics","score_opus":0.03907911182316321,"score_gpt":0.3112756167984046,"score_spread":0.2721965049752414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067564749","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.0017194379,0.00009291098,0.99733436,0.000093230155,0.000018094099,0.000021587839,0.0000048975235,0.00003476541,0.0006807503],"genre_scores_gemma":[0.46519917,0.000545579,0.53073776,0.00024154341,0.00014280516,0.00043989607,0.000049523056,0.00013031435,0.0025134382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787414,0.0011140166,0.000080932296,0.00029515178,0.0004605541,0.00017521618],"domain_scores_gemma":[0.9971265,0.0020197327,0.00026422943,0.00016523675,0.0002498079,0.00017438736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003010325,0.0011808224,0.00184924,0.00077279226,0.00063672836,0.0016358419,0.0024673855,0.0013759158,0.0019347547],"category_scores_gemma":[0.005009709,0.00078711257,0.0011899638,0.0009228187,0.0017901942,0.001979548,0.0023409508,0.0020283533,0.0002823187],"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.000034953737,0.0000504555,0.00017401099,0.00007048296,0.000040533665,0.00007299742,0.000078084806,0.91807616,0.00065681484,0.06084831,0.00044295596,0.019454168],"study_design_scores_gemma":[0.00001061516,0.000021432112,0.00002433336,0.0000058589007,0.0000058010114,0.000012965618,0.000007855568,0.97444916,0.00014415548,0.024823852,0.00048795316,0.0000059400513],"about_ca_topic_score_codex":0.0022721663,"about_ca_topic_score_gemma":0.0019737442,"teacher_disagreement_score":0.003010325,"about_ca_system_score_codex":0.001368394,"about_ca_system_score_gemma":0.0020100244,"threshold_uncertainty_score":0.015920281},"labels":[],"label_agreement":null},{"id":"W2072164538","doi":"10.1142/s0218213006002990","title":"AGGREGATION OF MULTIPLE REINFORCEMENT LEARNING ALGORITHMS","year":2006,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Evolutionary 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 Waterloo","funders":"","keywords":"Computer science; Reinforcement learning; Learning classifier system; Robustness (evolution); Artificial intelligence; Instance-based learning; Machine learning; Algorithm; Unsupervised learning; Robot learning; Fault tolerance; Architecture; Distributed computing; Robot","score_opus":0.041193865031591316,"score_gpt":0.30338059112739435,"score_spread":0.262186726095803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072164538","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.07982716,0.0004664074,0.9134955,0.00022335978,0.0001426256,0.00014817866,0.000025461031,0.0014278328,0.0042434447],"genre_scores_gemma":[0.9054611,0.00012956763,0.0919989,0.00007319022,0.000055162953,0.00012114835,0.00004003687,0.000037448917,0.002083424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868566,0.00037972163,0.00009749055,0.0002804828,0.00039726915,0.00015936987],"domain_scores_gemma":[0.9980432,0.00070992723,0.00024427127,0.0003521309,0.00050092273,0.00014956416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002031568,0.0008557938,0.0013101926,0.00056277344,0.000426317,0.00082340726,0.0012339407,0.00067448744,0.0018614499],"category_scores_gemma":[0.003942616,0.0003648858,0.0005583841,0.00042527483,0.0005728651,0.0010701622,0.0016001955,0.0010019118,0.0003674874],"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.00024498964,0.0001756443,0.0020007128,0.00011508811,0.00016472315,0.00018623206,0.00013762111,0.7530064,0.007997213,0.0075038644,0.0011905094,0.227277],"study_design_scores_gemma":[0.000022426504,0.00010828373,0.00024025585,0.0000068292034,0.000019952082,0.00003576862,0.000010530746,0.9937056,0.0015674988,0.0034084823,0.00086539134,0.000008908991],"about_ca_topic_score_codex":0.0018932078,"about_ca_topic_score_gemma":0.001609518,"teacher_disagreement_score":0.002031568,"about_ca_system_score_codex":0.0006442693,"about_ca_system_score_gemma":0.00070533063,"threshold_uncertainty_score":0.010744095},"labels":[],"label_agreement":null},{"id":"W2075882455","doi":"10.1142/s0218213004001673","title":"A HOPFIELD-TYPE NEURAL NETWORK BASED MODEL FOR TEMPORAL CONSTRAINTS","year":2004,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","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 Regina","funders":"","keywords":"Computer science; Mathematical optimization; Artificial neural network; Constraint (computer-aided design); Hopfield network; Scheduling (production processes); Type (biology); Constraint satisfaction problem; Process (computing); Property (philosophy); Artificial intelligence; Mathematics","score_opus":0.08868863193232461,"score_gpt":0.3315453067197102,"score_spread":0.2428566747873856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075882455","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.010538207,0.00036895135,0.9845734,0.00014064756,0.000045448356,0.000031602078,0.000077478246,0.00019293946,0.004031341],"genre_scores_gemma":[0.68117815,0.0010465704,0.30499685,0.00016174668,0.00008655075,0.0002811402,0.0002670577,0.000053435586,0.011928501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998318,0.00003849797,0.000009739114,0.000039985614,0.000057609825,0.000022394972],"domain_scores_gemma":[0.9998049,0.000099544915,0.000020563011,0.000016675573,0.000046246398,0.000012019386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000371737,0.00045665205,0.00046256807,0.000293086,0.00034467503,0.00071525254,0.0014450944,0.00109941,0.002535044],"category_scores_gemma":[0.00092597766,0.00023404567,0.00043092357,0.0005377229,0.00057347503,0.0010395255,0.00041495112,0.0008530534,0.0003514046],"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.00004195727,0.000023753406,0.00026494457,0.000068375986,0.000022649625,0.000077104145,0.000041085437,0.94670576,0.0034760658,0.017281739,0.00057979504,0.031416938],"study_design_scores_gemma":[0.0000029506994,0.0000070495194,0.000025417086,0.0000026971009,0.0000034352586,0.000009892531,0.000002244031,0.99719703,0.0002889031,0.0021165358,0.00034111383,0.0000027314816],"about_ca_topic_score_codex":0.01298441,"about_ca_topic_score_gemma":0.0118684005,"teacher_disagreement_score":0.01298441,"about_ca_system_score_codex":0.0008534994,"about_ca_system_score_gemma":0.0009516829,"threshold_uncertainty_score":0.025817633},"labels":[],"label_agreement":null},{"id":"W2089189083","doi":"10.1142/s0218213006003065","title":"THE EMERGENCE OF SOCIAL NETWORK HIERARCHY USING CULTURAL ALGORITHMS","year":2006,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","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 Windsor","funders":"","keywords":"Computer science; Hierarchy; Reciprocal; Social network (sociolinguistics); Kinship; Population; Swarm behaviour; Social network analysis; Resilience (materials science); Artificial intelligence; Sociology; World Wide Web; Economics","score_opus":0.05071852007949442,"score_gpt":0.3598987767395383,"score_spread":0.3091802566600439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089189083","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.15311694,0.0005807723,0.83018035,0.0013271475,0.000055184068,0.0001583568,0.000088088076,0.0002597964,0.014233401],"genre_scores_gemma":[0.8305599,0.0004920179,0.16526774,0.00014171074,0.000059025842,0.00023005606,0.00012322332,0.000064288986,0.00306206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903345,0.0005452797,0.000034991655,0.00013101897,0.00017807554,0.00007723642],"domain_scores_gemma":[0.9956809,0.0028797765,0.00047754266,0.00037198688,0.000307874,0.0002819144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017703351,0.0005081008,0.00075835595,0.0015030131,0.001198041,0.0021747593,0.0011577735,0.0010142946,0.0017589419],"category_scores_gemma":[0.012507844,0.00043198673,0.0008274462,0.0008047164,0.0024428824,0.0030607937,0.0023268734,0.0010837564,0.00019030787],"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.00003991051,0.000043579446,0.0036519105,0.0001301886,0.00010031186,0.00019331764,0.0008343651,0.6055823,0.0012937649,0.35455424,0.0012797301,0.032296438],"study_design_scores_gemma":[0.000016322021,0.00001270884,0.0002687844,0.000013412525,0.000009961308,0.000029331346,0.000104655825,0.8785332,0.00017449567,0.119707845,0.0011201455,0.000009128761],"about_ca_topic_score_codex":0.004371859,"about_ca_topic_score_gemma":0.0037454918,"teacher_disagreement_score":0.004371859,"about_ca_system_score_codex":0.001819524,"about_ca_system_score_gemma":0.0010673892,"threshold_uncertainty_score":0.013201594},"labels":[],"label_agreement":null},{"id":"W2092368578","doi":"10.1142/s0218213005002351","title":"A COLLAPSING METHOD FOR THE EFFICIENT RECOVERY OF OPTIMAL EDGES IN PHYLOGENETIC TREES","year":2005,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Genomics and Phylogenetic Studies","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":"Caprion (Canada)","funders":"","keywords":"Phylogenetic tree; Computer science; Context (archaeology); Inference; Set (abstract data type); Tree (set theory); Mathematical proof; Binary number; Algorithm; Enhanced Data Rates for GSM Evolution; Binary tree; Theoretical computer science; Combinatorics; Mathematics; Artificial intelligence; Biology; Paleontology","score_opus":0.048816181952698566,"score_gpt":0.34056092737094207,"score_spread":0.2917447454182435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092368578","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.004286319,0.00006777182,0.995006,0.000036944824,0.000013954184,0.000024946821,0.000042367228,0.00032499465,0.00019670984],"genre_scores_gemma":[0.032932926,0.000083859646,0.96597946,0.000049861155,0.00002770112,0.00007043396,0.0002460338,0.00015968372,0.0004499662],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868006,0.00041285908,0.000101173246,0.0003133127,0.00039382704,0.00009870956],"domain_scores_gemma":[0.9951751,0.0023662085,0.00035890174,0.0013590467,0.00053972704,0.00020088711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002375645,0.00070889207,0.00093844725,0.0015697678,0.0012394388,0.0011204318,0.0018888365,0.0010515858,0.003131117],"category_scores_gemma":[0.011179433,0.0007407403,0.0010214843,0.0019559779,0.001223355,0.0016783656,0.0024504787,0.0025280807,0.0012157109],"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.00027245592,0.00011182273,0.0026895117,0.00030592317,0.000110130226,0.0002953538,0.0006417689,0.10466135,0.037053857,0.07245714,0.005098783,0.7763018],"study_design_scores_gemma":[0.00005627502,0.00011234248,0.0012566544,0.000036873444,0.0000405854,0.0003273535,0.00009713367,0.9057319,0.015035493,0.06786695,0.009378876,0.000059529204],"about_ca_topic_score_codex":0.0014953442,"about_ca_topic_score_gemma":0.0018286173,"teacher_disagreement_score":0.003131117,"about_ca_system_score_codex":0.0004891008,"about_ca_system_score_gemma":0.0011524162,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2100720213","doi":"10.1142/s0218213008003765","title":"OPTIMAL BASIC BLOCK INSTRUCTION SCHEDULING FOR MULTIPLE-ISSUE PROCESSORS USING CONSTRAINT PROGRAMMING","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Waterloo","funders":"International Business Machines Corporation; Intel Corporation","keywords":"Computer science; Instruction scheduling; Compiler; Scheduling (production processes); Suite; Parallel computing; Optimizing compiler; Constraint programming; Schedule; Algorithm; Mathematical optimization; Dynamic priority scheduling; Programming language; Two-level scheduling; Mathematics","score_opus":0.09098479028904376,"score_gpt":0.3335965103387119,"score_spread":0.24261172004966813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100720213","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.056561206,0.0006796023,0.9303511,0.00049852073,0.000059803264,0.00021319596,0.00046660213,0.0015736864,0.009596385],"genre_scores_gemma":[0.25693247,0.0006253073,0.7388151,0.000117689306,0.00004008265,0.00031549705,0.00074409664,0.00041058686,0.001999132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991259,0.00026318937,0.000041375046,0.00010640325,0.00034457856,0.00011860477],"domain_scores_gemma":[0.9982703,0.0011373546,0.0001280757,0.00013878998,0.0002773507,0.000048110855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010795138,0.00068620936,0.0007693538,0.0006670404,0.00071493123,0.0010198341,0.0010168367,0.0004939554,0.003562458],"category_scores_gemma":[0.0037958943,0.000531124,0.00069434155,0.0016055751,0.0006243069,0.0014332059,0.0005756598,0.00096689473,0.00040438722],"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.00008876125,0.000067465044,0.000530763,0.0001658193,0.000023671933,0.00005734143,0.00005524641,0.9016946,0.0033563555,0.02308514,0.0040101227,0.06686472],"study_design_scores_gemma":[0.000028424545,0.000028858705,0.00009688103,0.0000073198185,0.0000068215586,0.00001031691,0.00001527194,0.9866954,0.0016419595,0.009378706,0.0020828203,0.0000072787197],"about_ca_topic_score_codex":0.014716918,"about_ca_topic_score_gemma":0.02487906,"teacher_disagreement_score":0.014716918,"about_ca_system_score_codex":0.0013021935,"about_ca_system_score_gemma":0.0046246885,"threshold_uncertainty_score":0.029262543},"labels":[],"label_agreement":null},{"id":"W2109875442","doi":"10.1142/s0218213002000873","title":"DEVELOPING COLLABORATIVE GOLOG AGENTS BY REINFORCEMENT LEARNING","year":2002,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Multi-Agent Systems and Negotiation","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":"McGill University","funders":"","keywords":"Computer science; Reinforcement learning; Scalability; Human–computer interaction; Artificial intelligence; Database","score_opus":0.1117068500660333,"score_gpt":0.3394125118227033,"score_spread":0.22770566175667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109875442","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.048749927,0.00014294927,0.94580173,0.00021040434,0.000029809766,0.0001983216,0.000019504656,0.0008193642,0.0040280255],"genre_scores_gemma":[0.4708869,0.00020661477,0.52453125,0.000116525574,0.000027267444,0.0003753547,0.00008049736,0.000111638816,0.0036639275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993216,0.00026778088,0.00003566957,0.00012511153,0.00015012668,0.00009980489],"domain_scores_gemma":[0.99829537,0.0008347442,0.00025513227,0.00024122886,0.00020344216,0.00016997776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015293253,0.000808693,0.00069112185,0.00044406214,0.0006392045,0.0010654036,0.0016678753,0.0011972665,0.0025894297],"category_scores_gemma":[0.0057840757,0.00051489356,0.00041827123,0.00031199236,0.001264077,0.0015987449,0.0020865807,0.0009886492,0.0006417769],"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.00016849677,0.00036583218,0.0033309653,0.00017023942,0.00011077078,0.00040526342,0.0008386573,0.8200328,0.008946673,0.04576047,0.001960587,0.117909305],"study_design_scores_gemma":[0.000041668733,0.00008295238,0.00013225133,0.000015769805,0.000013482662,0.000050877406,0.00006608269,0.97835255,0.0022733137,0.015445136,0.0035135557,0.000012472374],"about_ca_topic_score_codex":0.0022967511,"about_ca_topic_score_gemma":0.0024266602,"teacher_disagreement_score":0.0025894297,"about_ca_system_score_codex":0.00063546735,"about_ca_system_score_gemma":0.0011421377,"threshold_uncertainty_score":0.008662522},"labels":[],"label_agreement":null},{"id":"W2117338530","doi":"10.1142/s0218213013600038","title":"UNCERTAINTY-BASED TRUST ESTIMATION IN A MULTI-VALUED TRUST ENVIRONMENT","year":2013,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Access Control and Trust","field":"Social Sciences","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Computer science; Metric (unit); Reliability (semiconductor); Trustworthiness; Set (abstract data type); Service provider; Service (business); Measure (data warehouse); Domain (mathematical analysis); Order (exchange); Certainty; Trust management (information system); Data mining; Knowledge management; Computer security","score_opus":0.07972065461694751,"score_gpt":0.36209010544632175,"score_spread":0.28236945082937426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117338530","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.045845043,0.00032380893,0.95260066,0.0002165,0.000017677285,0.00004024734,0.000053992244,0.00008977865,0.00081233],"genre_scores_gemma":[0.90331787,0.00022088722,0.09584264,0.00003347383,0.00002629075,0.000061080864,0.000091224145,0.000017971257,0.000388609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931526,0.003536176,0.00051199074,0.0010137218,0.0014183146,0.00036712736],"domain_scores_gemma":[0.9799687,0.014984534,0.0022840332,0.0006771017,0.0016160979,0.0004693538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059140623,0.00089628884,0.0014049982,0.0015332841,0.00062428816,0.003011364,0.0014894876,0.0013712967,0.0007654724],"category_scores_gemma":[0.027875742,0.00054175593,0.0009807191,0.0013295056,0.0016251373,0.0037863553,0.002198326,0.00169721,0.00012780365],"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.00018358935,0.000038404654,0.0033069965,0.00014779884,0.000103284874,0.00028328557,0.00040007065,0.9394408,0.0013861177,0.028270444,0.00029566124,0.026143387],"study_design_scores_gemma":[0.0000034453249,0.000024510276,0.00031765134,0.0000113364895,0.000008621551,0.000031308336,0.000032016214,0.9919018,0.00026616553,0.0072949114,0.00009848492,0.000009701516],"about_ca_topic_score_codex":0.0054167453,"about_ca_topic_score_gemma":0.0023602534,"teacher_disagreement_score":0.0059140623,"about_ca_system_score_codex":0.002435086,"about_ca_system_score_gemma":0.00094669,"threshold_uncertainty_score":0.03127694},"labels":[],"label_agreement":null},{"id":"W2118078906","doi":"10.1142/s0218213001000623","title":"EFFICIENT DEFEASIBLE REASONING SYSTEMS","year":2001,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Logic, Reasoning, and Knowledge","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":"University of Toronto","funders":"Australian Research Council; Griffith University","keywords":"Defeasible estate; Forward chaining; Computer science; Non-monotonic logic; Defeasible reasoning; Backward chaining; Chaining; Logic programming; Simplicity; Description logic; Monotonic function; Theoretical computer science; Artificial intelligence; Programming language; Inference engine; Expert system; Mathematics","score_opus":0.06739144958469796,"score_gpt":0.32078427180292085,"score_spread":0.2533928222182229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118078906","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.021653738,0.0012448488,0.94986284,0.0010521649,0.00013186355,0.0004952455,0.00069052493,0.003318986,0.021549782],"genre_scores_gemma":[0.24689272,0.0014495946,0.7337188,0.00044652246,0.00011570282,0.000525384,0.0023412197,0.00034215668,0.014167829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967996,0.00084527786,0.00031716278,0.000483449,0.0013560201,0.00019847217],"domain_scores_gemma":[0.9961216,0.0019531448,0.00021792385,0.0010004985,0.0006141736,0.00009269169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029101896,0.00087811274,0.0011352694,0.0013764303,0.0014698851,0.004006876,0.002140418,0.0020789108,0.013385291],"category_scores_gemma":[0.010762162,0.00081762305,0.00085908355,0.0015871003,0.0011362323,0.0044785007,0.0030471946,0.0015118027,0.0040198965],"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.00052799465,0.00038132875,0.0012683375,0.00094260724,0.00020285127,0.0005734186,0.0007266694,0.1358282,0.013961396,0.48420453,0.021117972,0.3402648],"study_design_scores_gemma":[0.00027195038,0.00008285108,0.00033003328,0.00010012532,0.00009737519,0.00034250453,0.00018591898,0.54917973,0.010993351,0.35908872,0.0792885,0.00003895032],"about_ca_topic_score_codex":0.0014009171,"about_ca_topic_score_gemma":0.0016546336,"teacher_disagreement_score":0.013385291,"about_ca_system_score_codex":0.0011472469,"about_ca_system_score_gemma":0.0014528054,"threshold_uncertainty_score":0.044778287},"labels":[],"label_agreement":null},{"id":"W2128602454","doi":"10.1142/s0218213014600215","title":"A Mixture Model-Based Combination Approach for Outlier Detection","year":2014,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Anomaly Detection Techniques and Applications","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":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Outlier; Computer science; Anomaly detection; Pattern recognition (psychology); Artificial intelligence; Data mining; Identification (biology); Local outlier factor","score_opus":0.04797987691904263,"score_gpt":0.31312310688875405,"score_spread":0.2651432299697114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128602454","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.003368808,0.00040866656,0.99451244,0.00006697419,0.000050479714,0.000050637667,0.0000409968,0.0009596373,0.0005413222],"genre_scores_gemma":[0.2262581,0.001028121,0.7669253,0.00023034748,0.0003208668,0.0002573675,0.00080740213,0.0005765501,0.0035960677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924609,0.0015856808,0.00045275348,0.0016194718,0.003428152,0.00045299146],"domain_scores_gemma":[0.9949587,0.0015205048,0.0005680324,0.0009131293,0.0018257492,0.00021398724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046219807,0.002883478,0.0041977405,0.0073161786,0.0011301673,0.0027883758,0.0040016137,0.0022402988,0.0019754374],"category_scores_gemma":[0.008756068,0.0013862633,0.00402045,0.006881385,0.00095455704,0.0040232576,0.0034722101,0.003196923,0.0022328536],"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.0006479314,0.00041227703,0.01236495,0.00044854218,0.0017801089,0.00057672855,0.00034175513,0.15256071,0.023259448,0.010463882,0.005440988,0.7917026],"study_design_scores_gemma":[0.000022015824,0.00020420415,0.002315211,0.000028869898,0.00028813662,0.0006635424,0.00006816019,0.976267,0.0069898916,0.007981416,0.005066764,0.00010488167],"about_ca_topic_score_codex":0.0029152844,"about_ca_topic_score_gemma":0.00328835,"teacher_disagreement_score":0.0073161786,"about_ca_system_score_codex":0.0008715355,"about_ca_system_score_gemma":0.0011278522,"threshold_uncertainty_score":0.024443686},"labels":[],"label_agreement":null},{"id":"W2151273784","doi":"10.1142/s0218213008004114","title":"A SPACE-EFFICIENT BACKTRACK-FREE REPRESENTATION FOR CONSTRAINT SATISFACTION PROBLEMS","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","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 Toronto","funders":"","keywords":"Computer science; Pruning; Heuristics; Constraint satisfaction problem; Backtracking; Constraint satisfaction; Representation (politics); Local consistency; Constraint (computer-aided design); Space (punctuation); Search tree; Tuple; Mathematical optimization; Consistency (knowledge bases); Algorithm; Variety (cybernetics); Search algorithm; Artificial intelligence; Mathematics","score_opus":0.09226414483271571,"score_gpt":0.32722756922078367,"score_spread":0.23496342438806794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151273784","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.0058062593,0.00012814329,0.9908222,0.00023929293,0.00003320389,0.00012546586,0.00018259477,0.0012860902,0.0013768014],"genre_scores_gemma":[0.08441039,0.0002027298,0.9115469,0.00019268112,0.00003541487,0.00040337135,0.0008372241,0.00040155055,0.0019697475],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686253,0.0010357057,0.00025452056,0.00040841155,0.00117699,0.00026192536],"domain_scores_gemma":[0.9953825,0.0022719628,0.00038659,0.0011725993,0.0006625767,0.00012371027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023742896,0.0012057654,0.0011839343,0.0017360614,0.0011953185,0.0033592354,0.0037070063,0.0023572408,0.004662628],"category_scores_gemma":[0.01086854,0.0007562826,0.0017223048,0.0027948336,0.0014884915,0.004786589,0.0031123767,0.0033842528,0.0014417623],"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.00045317048,0.0003631821,0.0006603099,0.0005930456,0.000089135305,0.00025906984,0.00096779177,0.3521853,0.0103487,0.14542502,0.009881447,0.47877383],"study_design_scores_gemma":[0.00015128784,0.00020520219,0.0001353746,0.000091010945,0.00005497806,0.00013569828,0.00015135827,0.85853374,0.0097760325,0.11978908,0.010919055,0.000057113266],"about_ca_topic_score_codex":0.0029778825,"about_ca_topic_score_gemma":0.004345463,"teacher_disagreement_score":0.004662628,"about_ca_system_score_codex":0.0013447796,"about_ca_system_score_gemma":0.0028926092,"threshold_uncertainty_score":0.015598059},"labels":[],"label_agreement":null},{"id":"W2161122238","doi":"10.1142/s021821300600262x","title":"GENERICITY IN EVOLUTIONARY COMPUTATION SOFTWARE TOOLS: PRINCIPLES AND CASE-STUDY","year":2006,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Evolutionary computation; Software engineering; Software; Genetic programming; Evolutionary algorithm; Software development; Evolutionary programming; Computation; Genetic representation; Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.08307800819345276,"score_gpt":0.32984414211450447,"score_spread":0.2467661339210517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161122238","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.04901284,0.002923209,0.9243235,0.0014610316,0.00006700468,0.00025038785,0.000043608718,0.0005937444,0.021324674],"genre_scores_gemma":[0.34609205,0.0027500994,0.64670783,0.00029450873,0.00006455825,0.00038103812,0.0001182128,0.0004014753,0.0031901663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930801,0.0038115524,0.00056802336,0.0004925786,0.001629614,0.00041820234],"domain_scores_gemma":[0.98920876,0.0076138363,0.00049391016,0.0017575886,0.0006945805,0.00023137353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009502843,0.0007539888,0.00090215437,0.002381221,0.0020329568,0.0049601384,0.0021954463,0.0036287422,0.0012798413],"category_scores_gemma":[0.019126466,0.00078470784,0.0013583209,0.0038876534,0.0068158642,0.0074712513,0.004553701,0.0034720402,0.00032999067],"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.00006756382,0.00014278703,0.0034165245,0.00043104423,0.000045135603,0.001128987,0.0031871004,0.029032687,0.0023958152,0.8546883,0.0016084696,0.10385561],"study_design_scores_gemma":[0.00011208958,0.0005138136,0.002237473,0.00097336975,0.000126805,0.0059151454,0.0020861092,0.20480397,0.012735115,0.59824693,0.17210492,0.00014421536],"about_ca_topic_score_codex":0.0011161907,"about_ca_topic_score_gemma":0.0013739106,"teacher_disagreement_score":0.009502843,"about_ca_system_score_codex":0.0010004906,"about_ca_system_score_gemma":0.0010803775,"threshold_uncertainty_score":0.05025643},"labels":[],"label_agreement":null},{"id":"W2163572991","doi":"10.1142/s0218213010000261","title":"SEARCH-BASED TESTING OF MULTI-AGENT MANUFACTURING SYSTEMS FOR DEADLOCKS BASED ON MODELS","year":2010,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Deadlock; Deadlock prevention algorithms; Distributed computing; Automation; Embedded system","score_opus":0.20244736618161713,"score_gpt":0.3599902386338751,"score_spread":0.15754287245225795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163572991","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.20702277,0.00018611773,0.78839624,0.00023432744,0.000020583375,0.00013283943,0.000067073604,0.0016836689,0.0022563739],"genre_scores_gemma":[0.85131997,0.000079740516,0.14749372,0.00005294208,0.0000051497823,0.00013704815,0.00013309155,0.00007994489,0.0006982862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975452,0.0011810263,0.000143604,0.00024152161,0.0007218767,0.00016679562],"domain_scores_gemma":[0.9911724,0.007022199,0.0005700705,0.00062417396,0.00048605946,0.0001250066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002122651,0.0006383896,0.0006841466,0.00093866006,0.0005106241,0.00085841666,0.001134791,0.00094951154,0.0010401699],"category_scores_gemma":[0.010062448,0.00041055866,0.0012812201,0.00044783013,0.0010988441,0.0013220501,0.0009490946,0.0005242355,0.00012826649],"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.00054334186,0.0002897063,0.007928198,0.0002879108,0.00015486983,0.00082577666,0.0005949691,0.84354484,0.045533545,0.03843965,0.000764948,0.06109221],"study_design_scores_gemma":[0.000026927075,0.00009386165,0.00033500534,0.00001405516,0.000022352047,0.00008902735,0.000034806802,0.9804776,0.012343019,0.0061855777,0.0003675754,0.0000102020185],"about_ca_topic_score_codex":0.0028613217,"about_ca_topic_score_gemma":0.0030400644,"teacher_disagreement_score":0.0028613217,"about_ca_system_score_codex":0.0008666174,"about_ca_system_score_gemma":0.0014822974,"threshold_uncertainty_score":0.01122582},"labels":[],"label_agreement":null},{"id":"W2171171642","doi":"10.1142/s0218213008003819","title":"LAZY LEARNER ON DECISION TREE FOR RANKING","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Imbalanced Data Classification Techniques","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 New Brunswick","funders":"","keywords":"Computer science; Ranking (information retrieval); Tree (set theory); sort; Machine learning; Decision tree; Class (philosophy); Metric (unit); Artificial intelligence; Sample (material); Set (abstract data type); Path (computing); Data mining; Information retrieval; Mathematics","score_opus":0.14075467666543623,"score_gpt":0.3696724673995253,"score_spread":0.22891779073408908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171171642","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.010775873,0.0008779604,0.9854006,0.00027071274,0.00007626764,0.00006856261,0.00015932164,0.0014070576,0.00096370804],"genre_scores_gemma":[0.32107982,0.00088303094,0.67192936,0.0004512335,0.0002954451,0.0003400666,0.00095042435,0.00033440566,0.0037362117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961146,0.0018250277,0.00021493388,0.0005281009,0.0011061417,0.00021120346],"domain_scores_gemma":[0.99031645,0.0064617796,0.00040695147,0.0009753753,0.0015651023,0.00027443093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068079927,0.0011887385,0.0021665164,0.0027719447,0.0007240653,0.0015999974,0.0024181376,0.00165461,0.0022877173],"category_scores_gemma":[0.015917748,0.00040182524,0.0010260097,0.0031725122,0.0007994305,0.004164379,0.0012239208,0.0027887407,0.0016576848],"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.00036363353,0.00027876179,0.0039151227,0.00024840308,0.00016130957,0.00011468796,0.0001519457,0.4716972,0.0019197436,0.035444908,0.010892844,0.4748114],"study_design_scores_gemma":[0.000020135232,0.00006188363,0.00013841572,0.000013876248,0.000015224533,0.000033874396,0.000009073963,0.97562045,0.0006922487,0.02207516,0.0013096549,0.0000099752415],"about_ca_topic_score_codex":0.0034043852,"about_ca_topic_score_gemma":0.003927326,"teacher_disagreement_score":0.0068079927,"about_ca_system_score_codex":0.0013271682,"about_ca_system_score_gemma":0.0018477339,"threshold_uncertainty_score":0.036004543},"labels":[],"label_agreement":null},{"id":"W2575973620","doi":"10.1142/s0218213017600065","title":"Static and Dynamic Portfolio Methods for Optimal Planning: An Empirical Analysis","year":2017,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Planner; Satisficing; Portfolio; Schedule; Range (aeronautics); Mathematical optimization; Operations research; Artificial intelligence","score_opus":0.15898489664651966,"score_gpt":0.501950625082249,"score_spread":0.3429657284357293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575973620","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.4806025,0.012717136,0.47094646,0.0021566895,0.00012227028,0.0007748057,0.0011964961,0.0009472029,0.030536447],"genre_scores_gemma":[0.87764496,0.0022800353,0.116324395,0.0001520531,0.00008955097,0.00048658336,0.0011685593,0.00020344004,0.001650479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98785734,0.007056511,0.00052567443,0.0011010809,0.0031567519,0.00030261307],"domain_scores_gemma":[0.8095861,0.16982776,0.0037693437,0.011221406,0.0047438988,0.00085154385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028607557,0.0009040052,0.0009550842,0.0032099462,0.0007791507,0.0020211528,0.0019277995,0.0012326555,0.004869885],"category_scores_gemma":[0.13991141,0.0006382722,0.0010120788,0.0051611164,0.0016449922,0.005703008,0.0021480364,0.002765007,0.00059735874],"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.0010135319,0.0012095751,0.059355505,0.0006968116,0.00050585234,0.0001267087,0.0005349555,0.35962167,0.00049925986,0.062146798,0.0076889964,0.5066003],"study_design_scores_gemma":[0.000166531,0.0008479432,0.018720267,0.00019822929,0.00016651177,0.00026055757,0.00035636383,0.9318197,0.00074715377,0.039772592,0.006889168,0.000054888555],"about_ca_topic_score_codex":0.003056568,"about_ca_topic_score_gemma":0.002792399,"teacher_disagreement_score":0.028607557,"about_ca_system_score_codex":0.0020393294,"about_ca_system_score_gemma":0.001772298,"threshold_uncertainty_score":0.15129304},"labels":[],"label_agreement":null},{"id":"W2593220893","doi":"10.1142/s0218213017600041","title":"Exact and Hybrid Solutions for the Multi-Objective VM Reassignment Problem","year":2017,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","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":"IBM (Canada)","funders":"Science Foundation Ireland","keywords":"Computer science; Mathematical optimization; Metaheuristic; Solver; Integer programming; Context (archaeology); Linear programming; Heuristic; Constraint programming; Algorithm; Mathematics; Artificial intelligence; Stochastic programming","score_opus":0.1038246961650876,"score_gpt":0.34661481742437705,"score_spread":0.24279012125928945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593220893","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.031466987,0.00081639,0.9537266,0.00035188257,0.00009478751,0.0000952314,0.00012152991,0.00048018727,0.01284638],"genre_scores_gemma":[0.45037746,0.0005082337,0.5417327,0.00019489462,0.00005851524,0.0003206834,0.00024283495,0.00019998428,0.006364624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920696,0.00026393513,0.000032244225,0.00013772861,0.0002445759,0.000114542796],"domain_scores_gemma":[0.99901307,0.0006277601,0.00012419205,0.000090603506,0.00009383211,0.000050514365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015357367,0.0010550789,0.00073190115,0.0009506127,0.00045038923,0.0014843004,0.0012697267,0.0017543413,0.006137426],"category_scores_gemma":[0.0027941016,0.000531362,0.00089255266,0.0010014824,0.0007819817,0.0014373235,0.0013195348,0.0013145505,0.0006116151],"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.00005365885,0.000047527777,0.00023024976,0.00009989672,0.00002563941,0.000047598038,0.000034837587,0.9531451,0.00085217727,0.01357048,0.0008551146,0.03103762],"study_design_scores_gemma":[0.000014834262,0.00004020298,0.00008454247,0.000015797783,0.000006992917,0.000026011141,0.00002197702,0.9918172,0.00043932482,0.0062085385,0.0013185396,0.000006026857],"about_ca_topic_score_codex":0.0025484434,"about_ca_topic_score_gemma":0.0034751098,"teacher_disagreement_score":0.006137426,"about_ca_system_score_codex":0.0009329408,"about_ca_system_score_gemma":0.0009889242,"threshold_uncertainty_score":0.020531774},"labels":[],"label_agreement":null},{"id":"W2606751029","doi":"10.1142/s0218213017600107","title":"Characterizing Users and Tracking Their Activities in Online Classified Ads","year":2017,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Recommender Systems and Techniques","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 Alberta","funders":"","keywords":"Computer science; Profiling (computer programming); Probabilistic logic; User modeling; Set (abstract data type); Class (philosophy); Generative model; Generative grammar; Data mining; Machine learning; User interface; Human–computer interaction; Information retrieval; Artificial intelligence","score_opus":0.1620729212358601,"score_gpt":0.3655221996245478,"score_spread":0.2034492783886877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606751029","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.93779665,0.000310865,0.056660116,0.00026208558,0.000022996774,0.000100586316,0.0018440578,0.00032880218,0.0026738185],"genre_scores_gemma":[0.9784645,0.00014197333,0.019553402,0.000036874648,0.000023958273,0.000029019555,0.0009562112,0.000016859405,0.0007772111],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988752,0.00039205336,0.000071900446,0.00032001178,0.00023505093,0.00010577806],"domain_scores_gemma":[0.9930808,0.0036928558,0.0012999726,0.00082525995,0.00080413336,0.00029698393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013715357,0.00053746515,0.0006497682,0.0020718814,0.00049046637,0.0012977323,0.0007411636,0.000806152,0.0007996781],"category_scores_gemma":[0.0069832085,0.00038899598,0.00045564285,0.001960353,0.0003757519,0.0019684818,0.00051181915,0.0009632279,0.00063764624],"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.00050272944,0.0006257106,0.8154641,0.00019310159,0.00023803988,0.0002567512,0.0014416008,0.049738538,0.011665074,0.0034935933,0.0024537777,0.11392698],"study_design_scores_gemma":[0.000016170956,0.00023971577,0.3571438,0.00003537391,0.00010433653,0.0006224692,0.0010000691,0.6252254,0.0071361307,0.00530113,0.0030980518,0.00007735381],"about_ca_topic_score_codex":0.010983798,"about_ca_topic_score_gemma":0.021154284,"teacher_disagreement_score":0.010983798,"about_ca_system_score_codex":0.0005760685,"about_ca_system_score_gemma":0.00035795209,"threshold_uncertainty_score":0.021839738},"labels":[],"label_agreement":null},{"id":"W2765288170","doi":"10.1142/s0218213017600168","title":"Multi-Objective Optimization in Multi-Attribute and Multi-Unit Combinatorial Reverse Auctions","year":2017,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Regina","funders":"","keywords":"Computer science; Mathematical optimization; Elitism; Heuristic; Combinatorial auction; Quality (philosophy); Scalability; Convergence (economics); Genetic algorithm; Common value auction; Diversity (politics); Machine learning; Artificial intelligence; Mathematics","score_opus":0.3136507355222871,"score_gpt":0.4696876422128266,"score_spread":0.1560369066905395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765288170","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.028773146,0.0007176064,0.9674407,0.00016493672,0.000052096813,0.00011847497,0.000049660277,0.00008019315,0.002603121],"genre_scores_gemma":[0.55758137,0.00059029803,0.43757132,0.00018959388,0.00007504528,0.0003383161,0.00010821588,0.000088691246,0.0034570976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954632,0.0030410474,0.00015828792,0.00040660307,0.000671184,0.0002596507],"domain_scores_gemma":[0.9958832,0.003047902,0.0004243138,0.00021718691,0.00027913347,0.00014827523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058724745,0.0013951064,0.002645866,0.0015267695,0.0005656368,0.0022926857,0.0025322866,0.0019412764,0.001858448],"category_scores_gemma":[0.007437977,0.0009747499,0.0017314127,0.0023409051,0.0013813028,0.001965419,0.0014103,0.0020712682,0.0003065428],"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.0000412312,0.00007902846,0.0003082756,0.00012195449,0.00008948917,0.00012096631,0.00003660184,0.97140247,0.00044015405,0.014246344,0.00025726628,0.01285622],"study_design_scores_gemma":[0.000018980823,0.000049463823,0.00008183057,0.00001248732,0.000017132119,0.00005441981,0.000017810373,0.9892564,0.00021559691,0.009910637,0.0003562297,0.000009062489],"about_ca_topic_score_codex":0.0021178578,"about_ca_topic_score_gemma":0.0015727879,"teacher_disagreement_score":0.0058724745,"about_ca_system_score_codex":0.0013758483,"about_ca_system_score_gemma":0.001219859,"threshold_uncertainty_score":0.031057},"labels":[],"label_agreement":null},{"id":"W2899855224","doi":"10.1142/s0218213018500367","title":"Extreme Learning Machine Based Prognostics of Battery Life","year":2018,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Advanced Battery Technologies Research","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Prognostics; Computer science; Scheme (mathematics); Battery (electricity); Battery capacity; Reliability engineering; Machine learning; Artificial intelligence; Data mining; Power (physics); Engineering","score_opus":0.09764378198985696,"score_gpt":0.3357326117525108,"score_spread":0.23808882976265383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899855224","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.049413495,0.00047466392,0.94757503,0.00012371274,0.000059128193,0.000026473084,0.00008852033,0.0007904357,0.0014484476],"genre_scores_gemma":[0.9596858,0.0002532571,0.038878307,0.000045737408,0.00004203758,0.00004067558,0.00015340062,0.000020195317,0.0008805407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970657,0.000066632536,0.000023552997,0.000055647768,0.00011553645,0.000032003645],"domain_scores_gemma":[0.9993293,0.00033514012,0.00009120976,0.0000627898,0.00015886479,0.000022588554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005986728,0.00054147973,0.00062431226,0.0005088533,0.0002769307,0.00044947307,0.000660168,0.00051572925,0.0007849094],"category_scores_gemma":[0.0028021606,0.00015032683,0.00031323844,0.00039881465,0.0003114654,0.00093751465,0.00061455305,0.0007530829,0.00023028551],"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.00015336728,0.00003687476,0.002460764,0.00008492733,0.000028762468,0.000101996804,0.00005538229,0.8605851,0.0049146474,0.0035469588,0.0007044628,0.12732682],"study_design_scores_gemma":[0.0000027462993,0.000028507187,0.00036445988,0.0000042827282,0.0000038686726,0.000019589208,0.0000031988661,0.9962968,0.0011733155,0.001903051,0.00019501016,0.0000051926586],"about_ca_topic_score_codex":0.0009408211,"about_ca_topic_score_gemma":0.0007455156,"teacher_disagreement_score":0.0009408211,"about_ca_system_score_codex":0.00031495938,"about_ca_system_score_gemma":0.00027384775,"threshold_uncertainty_score":0.0031660795},"labels":[],"label_agreement":null},{"id":"W2983445208","doi":"10.1142/s0218213019500209","title":"Incremental Subclass Support Vector Machine","year":2019,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Face and Expression Recognition","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":"Support vector machine; Computer science; Decision boundary; Classifier (UML); Discriminative model; Artificial intelligence; Convex optimization; Linear classifier; Machine learning; Synthetic data; Regular polygon; Pattern recognition (psychology); Kernel method; Kernel (algebra); Data mining; Mathematics","score_opus":0.04618922746386503,"score_gpt":0.31364248664770045,"score_spread":0.26745325918383545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983445208","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.059727684,0.00087247224,0.9318672,0.00017612417,0.00015090394,0.00014182889,0.0003745872,0.0032180822,0.0034710788],"genre_scores_gemma":[0.68336886,0.0007414609,0.30704343,0.00021605694,0.00021039887,0.00021564789,0.0024821812,0.0003582439,0.0053635747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909806,0.00014378176,0.000072848095,0.00020073033,0.00038379463,0.000100865036],"domain_scores_gemma":[0.99773043,0.0005821749,0.00017740791,0.00050012575,0.000903484,0.00010636048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008616,0.0007162191,0.0014180331,0.0012316534,0.00037855344,0.0011531371,0.0021913063,0.0006608227,0.002049484],"category_scores_gemma":[0.0046183974,0.00031789648,0.00085748633,0.0011187972,0.00044071823,0.0020531593,0.0012226863,0.0011919853,0.0010466824],"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.00030247538,0.00018975761,0.005059911,0.00020353905,0.00010455243,0.00016708531,0.00015529954,0.120631315,0.009750923,0.0096330615,0.0077925185,0.84600955],"study_design_scores_gemma":[0.000010734127,0.00006896502,0.00104089,0.000012656036,0.000024994775,0.000107772335,0.0000335488,0.9864456,0.003942329,0.005267594,0.0030298631,0.000015083662],"about_ca_topic_score_codex":0.002587199,"about_ca_topic_score_gemma":0.0019612936,"teacher_disagreement_score":0.002587199,"about_ca_system_score_codex":0.0006359936,"about_ca_system_score_gemma":0.0010281996,"threshold_uncertainty_score":0.006856203},"labels":[],"label_agreement":null},{"id":"W3036447434","doi":"10.1142/s0218213020600040","title":"Selecting and Combining Classifiers Based on Centrality Measures","year":2020,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Face and Expression Recognition","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":"École de Technologie Supérieure","funders":"","keywords":"Centrality; Computer science; Classifier (UML); Artificial intelligence; Machine learning; Random subspace method; Cascading classifiers; Feature selection; Pattern recognition (psychology); Data mining; Mathematics; Statistics","score_opus":0.14243321558855435,"score_gpt":0.32723385059914123,"score_spread":0.18480063501058688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036447434","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.20877978,0.0025327646,0.77569824,0.00058224314,0.00042714778,0.0005489924,0.00038951487,0.001202302,0.009839053],"genre_scores_gemma":[0.7764579,0.0008939664,0.21751288,0.00013156838,0.00040289262,0.00026451328,0.00073270046,0.00015020206,0.0034533546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616444,0.00067112036,0.00028307422,0.00059502834,0.0018986961,0.00038756838],"domain_scores_gemma":[0.9948171,0.0019607686,0.00033798444,0.00030368645,0.0023674727,0.00021300172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003137795,0.0016190785,0.0018801553,0.0065772478,0.0012753329,0.0020793274,0.0010146633,0.0009567172,0.0017998532],"category_scores_gemma":[0.011705018,0.0003434005,0.0011333384,0.0026455894,0.00048158428,0.0021302304,0.0011624824,0.0008642677,0.0011140953],"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.00060062105,0.0003079294,0.029357314,0.00032607402,0.00050911086,0.00043705283,0.00043380514,0.06110443,0.040189758,0.0053432295,0.006538694,0.854852],"study_design_scores_gemma":[0.00006437351,0.0006429672,0.020008793,0.00016248944,0.0010540716,0.0008227528,0.00070166093,0.9047033,0.04042045,0.017213142,0.014085585,0.00012047229],"about_ca_topic_score_codex":0.003573143,"about_ca_topic_score_gemma":0.0042093354,"teacher_disagreement_score":0.0065772478,"about_ca_system_score_codex":0.0008933605,"about_ca_system_score_gemma":0.0012966878,"threshold_uncertainty_score":0.01659447},"labels":[],"label_agreement":null},{"id":"W4214769751","doi":"10.1142/s0218213022500233","title":"Responsive Mixed-initiative System for Reoptimization of Mixed-integer Programming","year":2022,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Integer programming; Mathematical optimization; Constraint (computer-aided design); Operations research; Linear programming; Kernel (algebra); Integer (computer science); Software; Decision support system; Order (exchange); Optimization problem; Industrial engineering; Artificial intelligence; Algorithm; Operating system","score_opus":0.06057148518930872,"score_gpt":0.29722372583596246,"score_spread":0.23665224064665374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214769751","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.0035738202,0.00005078865,0.96079576,0.000037266396,0.000025869229,0.00017356015,0.00012557516,0.031672243,0.0035451765],"genre_scores_gemma":[0.14513303,0.000115239294,0.83708084,0.00023144299,0.000042165226,0.0016749814,0.001057039,0.0053618653,0.009303389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987136,0.00048059592,0.00010434037,0.00021636926,0.00037079642,0.00011435497],"domain_scores_gemma":[0.9981306,0.0010127305,0.00012327923,0.00031714982,0.00029582143,0.00012044804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020706328,0.0013137576,0.0005807802,0.00065894384,0.00050463167,0.0013719068,0.0023722372,0.0008845672,0.023492154],"category_scores_gemma":[0.0052603437,0.0006455988,0.0007481146,0.00039971215,0.00047400568,0.0012148641,0.0025312137,0.0014827839,0.0046431525],"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.0028757176,0.0011148421,0.0022658273,0.0012063638,0.00027716244,0.00090983603,0.0018395062,0.123058274,0.088078775,0.07357731,0.052579906,0.65221643],"study_design_scores_gemma":[0.00020352568,0.00023472693,0.00030080607,0.000056184814,0.00003631247,0.00020848234,0.000064914,0.91490024,0.033420656,0.0094236,0.04107938,0.00007105949],"about_ca_topic_score_codex":0.00089433993,"about_ca_topic_score_gemma":0.0012586573,"teacher_disagreement_score":0.023492154,"about_ca_system_score_codex":0.00047973718,"about_ca_system_score_gemma":0.00093495543,"threshold_uncertainty_score":0.07858908},"labels":[],"label_agreement":null},{"id":"W4389210220","doi":"10.1142/s0218213024600017","title":"Understanding the Limits of Explainable Ethical AI","year":2023,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Social Sciences and Humanities Research Council; Fonds de recherche du Québec","keywords":"Consequentialism; Utilitarianism; Normative; Perspective (graphical); Computer science; Deontological ethics; Value (mathematics); Artificial intelligence; Management science; Engineering ethics; Risk analysis (engineering); Epistemology; Business; Economics; Engineering; Machine learning; Philosophy","score_opus":0.48144535693219814,"score_gpt":0.4893671905881783,"score_spread":0.007921833655980148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389210220","genre_codex":"other","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.084646575,0.011495566,0.23930517,0.13225377,0.00060111575,0.00011783274,0.00016447919,0.00029751103,0.5311179],"genre_scores_gemma":[0.9615472,0.0030120818,0.026242949,0.0036530178,0.00046265,0.0004050048,0.00007988902,0.00014986336,0.004447325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9808015,0.013485421,0.00052820705,0.0015960102,0.0025935688,0.000995278],"domain_scores_gemma":[0.8939335,0.08940178,0.0031747457,0.0084878635,0.003493519,0.0015086334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018584201,0.0007076676,0.0010060028,0.001961104,0.004015574,0.010543149,0.003161352,0.0071826563,0.007433996],"category_scores_gemma":[0.06758598,0.00079538306,0.0010220503,0.0008628223,0.040572774,0.022275643,0.009282898,0.009698364,0.00087559654],"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.0000042601428,0.000007309019,0.00012338816,0.000026414635,0.000004046653,0.000022357044,0.00066651,0.0013957099,0.00004399373,0.9960969,0.00028945843,0.0013196648],"study_design_scores_gemma":[0.0000044423705,0.0000031110171,0.000074029485,0.000043104985,0.0000023284672,0.000018694858,0.00020455175,0.0029761833,0.000042772925,0.992773,0.0038528726,0.0000049456485],"about_ca_topic_score_codex":0.0020151897,"about_ca_topic_score_gemma":0.0011047033,"teacher_disagreement_score":0.018584201,"about_ca_system_score_codex":0.0048108962,"about_ca_system_score_gemma":0.0033807405,"threshold_uncertainty_score":0.09828383},"labels":[],"label_agreement":null},{"id":"W4391968356","doi":"10.1142/s0218213024500052","title":"Summary Augmenter: A Text Augmentation Framework to Improve Summarization Quality","year":2024,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Topic Modeling","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 Windsor","funders":"","keywords":"Automatic summarization; Computer science; Quality (philosophy); Information retrieval; Philosophy; Epistemology","score_opus":0.07811631283339375,"score_gpt":0.38591626279305946,"score_spread":0.3077999499596657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391968356","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.084835015,0.003550905,0.85906816,0.0011104038,0.00055073603,0.00042766603,0.0052679856,0.040210675,0.00497839],"genre_scores_gemma":[0.42662787,0.0013025678,0.53998905,0.00049306103,0.00069564854,0.00049845537,0.015367459,0.0013049376,0.0137209175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994986,0.00014289764,0.000053447995,0.00015670559,0.0001116384,0.00003666934],"domain_scores_gemma":[0.99834895,0.0006075653,0.00019817005,0.00031197435,0.00046373607,0.000069546586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012532108,0.0015323573,0.00080348237,0.0017869769,0.0004400803,0.0009899338,0.0010163345,0.00090864854,0.005077329],"category_scores_gemma":[0.004993861,0.0002993357,0.0008853143,0.0009870436,0.0003315232,0.0026825236,0.00096812204,0.001107579,0.002924669],"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.00070976635,0.0002805787,0.0023783345,0.00063511555,0.00016288437,0.0003255877,0.0005298569,0.040475793,0.06892286,0.0037079048,0.026559075,0.8553122],"study_design_scores_gemma":[0.00018278127,0.0012215769,0.003803499,0.000110624926,0.0003989602,0.0004726179,0.0003605223,0.84801215,0.091882356,0.01170832,0.04174747,0.00009912714],"about_ca_topic_score_codex":0.0019550025,"about_ca_topic_score_gemma":0.0041426676,"teacher_disagreement_score":0.005077329,"about_ca_system_score_codex":0.00039493275,"about_ca_system_score_gemma":0.000821636,"threshold_uncertainty_score":0.016985357},"labels":[],"label_agreement":null},{"id":"W4406808063","doi":"10.1142/s0218213025500046","title":"An Interactive Real-Time 3D Representation of a Heart Using a 2D Ultrasound Vest: Proof of Concept","year":2025,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Surgical Simulation and Training","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"VEST; Proof of concept; Representation (politics); Computer science; Computer graphics (images); Computer vision; Computer security","score_opus":0.09905747431214974,"score_gpt":0.43508429142148564,"score_spread":0.3360268171093359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406808063","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.06579815,0.0018970644,0.91140777,0.0013691657,0.0012078237,0.0005903272,0.0008435314,0.0024794906,0.014406639],"genre_scores_gemma":[0.47428373,0.002232903,0.51031643,0.0006410144,0.00015330961,0.0009325184,0.00060650223,0.00023432131,0.010599206],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996525,0.000047333488,0.00001536324,0.000049399147,0.00020418943,0.000031230345],"domain_scores_gemma":[0.99979,0.000074257405,0.000030742125,0.00002192896,0.000042005122,0.00004116023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004944651,0.000627163,0.00041104853,0.0002528247,0.00017171132,0.0007366672,0.0013993838,0.0010838174,0.004617795],"category_scores_gemma":[0.00078939943,0.00033214228,0.0008021696,0.00012708787,0.00038755868,0.00074892916,0.0010319145,0.0005251497,0.00071938866],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034581477,0.00042580874,0.0014860096,0.0018167058,0.00014243035,0.0050673406,0.0006633175,0.11653894,0.68530136,0.020163136,0.013755818,0.1542934],"study_design_scores_gemma":[0.00032363684,0.003061652,0.0019965393,0.0002310058,0.00012323335,0.0073239226,0.00029555787,0.60699224,0.26446956,0.006032394,0.10878508,0.0003651266],"about_ca_topic_score_codex":0.0005030315,"about_ca_topic_score_gemma":0.00042420064,"teacher_disagreement_score":0.004617795,"about_ca_system_score_codex":0.00018796565,"about_ca_system_score_gemma":0.00035049606,"threshold_uncertainty_score":0.015448034},"labels":[],"label_agreement":null},{"id":"W4407150651","doi":"10.1142/s0218213025010018","title":"Editorial: Recognizing Professor and Asia University President Jeffrey P. Tsai’s Contributions to IJAIT","year":2024,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Higher Education Governance and Development","field":"Social Sciences","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Library science; Political science; Classics; Art; Computer science","score_opus":0.04699501268581594,"score_gpt":0.3913760331776523,"score_spread":0.34438102049183633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407150651","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.000038230854,0.0014144817,0.0000778683,0.07198212,0.92536026,0.000016028076,0.0000437331,0.00003221332,0.0010350993],"genre_scores_gemma":[0.000610661,0.0018964956,0.000099656914,0.04205597,0.945318,0.000026696658,0.000028956489,0.0000336053,0.009930011],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99549675,0.0005346661,0.00060330564,0.0007036584,0.0022702322,0.00039145036],"domain_scores_gemma":[0.9713212,0.009217188,0.00192915,0.0006701904,0.0127137955,0.0041484237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060438914,0.002807318,0.0029136145,0.0031116859,0.0036571505,0.009547942,0.0030321577,0.01781973,0.015766304],"category_scores_gemma":[0.041409053,0.0011309879,0.003182293,0.0015537159,0.0026072308,0.004181668,0.0017344697,0.028158702,0.014471153],"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.000020852716,0.000008767377,0.00002963466,0.00006081919,0.000010440611,0.000089932444,0.000008527769,0.000017215893,0.000035137633,0.0001567977,0.99795485,0.0016070071],"study_design_scores_gemma":[0.000040294857,0.000023870818,0.0004053817,0.0002850022,0.000044089265,0.00028051328,0.000061270286,0.00017225945,0.00015524589,0.00087557355,0.99763095,0.000025506837],"about_ca_topic_score_codex":0.0022939295,"about_ca_topic_score_gemma":0.0057599708,"teacher_disagreement_score":0.01781973,"about_ca_system_score_codex":0.0032447772,"about_ca_system_score_gemma":0.0042686965,"threshold_uncertainty_score":0.052743495},"labels":[],"label_agreement":null}]}