{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01061783,0.00008710657,0.98212034,0.0055962014,0.0009963163,0.00008557189,0.000020180085,0.000007014391,0.00046944775],"genre_scores_gemma":[0.9606151,0.000089424015,0.038449474,0.00021538656,0.00060136436,0.0000011075763,0.0000068717245,0.0000033585368,0.000017926915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980687,0.00007789901,0.00074345473,0.00017046423,0.0008004713,0.00013902428],"domain_scores_gemma":[0.99849665,0.00034548214,0.00038512994,0.0005085092,0.00023577716,0.000028432467],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0014019184,0.000083697785,0.00012949701,0.00020841586,0.000026849311,0.00039679022,0.0065304413,0.000023532202,0.00003752416],"category_scores_gemma":[0.0004676766,0.00006118698,0.000052451993,0.00020854872,0.00006619039,0.0027523574,0.0007853704,0.0001747517,0.000021171736],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027273112,0.00016712457,0.00012858832,0.0000028413713,0.000026305648,0.00005136981,0.0008435466,0.0040388578,0.00033370985,0.016509514,0.00027568685,0.9775952],"study_design_scores_gemma":[0.00013147258,0.00014852127,0.0022262542,0.00016807117,0.000012702042,0.00010032906,0.0009566881,0.95807534,0.011619786,0.013195738,0.013165469,0.00019960324],"about_ca_topic_score_codex":0.00008195758,"about_ca_topic_score_gemma":0.00024703366,"teacher_disagreement_score":0.9773956,"about_ca_system_score_codex":0.00002995364,"about_ca_system_score_gemma":0.000054756863,"threshold_uncertainty_score":0.9988447},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15453497,0.00009882932,0.8430564,0.0013392402,0.00072817586,0.00006231595,0.000001418492,0.000014902209,0.00016377043],"genre_scores_gemma":[0.89733845,0.00006088935,0.10203788,0.0001156222,0.000418619,0.0000012156365,0.0000013061365,0.000005287213,0.000020756768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823236,0.00009479265,0.00065413344,0.00018800929,0.0006990248,0.00013164672],"domain_scores_gemma":[0.99864817,0.00022260965,0.00030380872,0.0001499631,0.0005873213,0.00008810077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006898988,0.000099747616,0.00014669703,0.00022883149,0.00013542511,0.00023876467,0.00058548927,0.000058872265,0.000033919907],"category_scores_gemma":[0.0004863575,0.00009125417,0.00007503566,0.00017410505,0.0001011186,0.0012026464,0.000144842,0.00017569141,0.000012565013],"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.00004708871,0.00016937479,0.0017803845,0.0000038724393,0.000077196884,0.00013487812,0.002005158,0.06762986,0.0062744324,0.21685772,0.000049588412,0.7049704],"study_design_scores_gemma":[0.000048451628,0.00006118079,0.0009673169,0.000043898126,0.000010334417,0.00084604195,0.00015742754,0.95776105,0.012631651,0.027150977,0.00019549705,0.00012617322],"about_ca_topic_score_codex":0.000015993406,"about_ca_topic_score_gemma":0.000004649262,"teacher_disagreement_score":0.8901312,"about_ca_system_score_codex":0.00008583407,"about_ca_system_score_gemma":0.00020479072,"threshold_uncertainty_score":0.37212372},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030894712,0.000085715634,0.9619158,0.0025887762,0.003840736,0.00031305334,0.000014780762,0.000027266638,0.0003191711],"genre_scores_gemma":[0.9741133,0.000028882527,0.02462917,0.000532428,0.0005138769,0.000018577211,0.0000028211716,0.000012712252,0.0001482734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997682,0.0001226855,0.0009970128,0.00020020799,0.00077502895,0.00022309856],"domain_scores_gemma":[0.99713176,0.0007555397,0.000772718,0.00031092978,0.0009400777,0.00008895034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015439617,0.00015128613,0.00020110137,0.00026824413,0.00014843456,0.00039622834,0.0020171436,0.00006463878,0.00023304022],"category_scores_gemma":[0.00062670244,0.00010638904,0.00026199355,0.00018669278,0.000059400187,0.0008370716,0.000091161375,0.00016836057,0.00012210669],"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.0009783279,0.0010662598,0.001085272,0.000058263493,0.0007106656,0.00017752252,0.007883687,0.008195634,0.019429674,0.2671668,0.0040558223,0.68919206],"study_design_scores_gemma":[0.0004257005,0.00040543932,0.0038286513,0.0003242276,0.00007304138,0.00013608509,0.0007272904,0.808554,0.12055633,0.05366074,0.010884683,0.00042381027],"about_ca_topic_score_codex":0.0000406057,"about_ca_topic_score_gemma":0.000025260795,"teacher_disagreement_score":0.9432185,"about_ca_system_score_codex":0.00009324035,"about_ca_system_score_gemma":0.00021448752,"threshold_uncertainty_score":0.4338419},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012908632,0.000051937874,0.9829578,0.0009063145,0.0028697972,0.00016872525,0.0000044283215,0.000026742244,0.000105654995],"genre_scores_gemma":[0.9377976,0.000024440416,0.060435355,0.0002978321,0.0014025716,0.000005262762,0.0000022721047,0.000009956246,0.000024682073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977513,0.00004481563,0.0011148481,0.00022864496,0.00048982166,0.00037059226],"domain_scores_gemma":[0.99753594,0.00087031315,0.00046824207,0.00014296744,0.00085725205,0.00012528454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018042652,0.00014847667,0.00024310334,0.0002907051,0.00006236636,0.00035941246,0.0012875821,0.000062648156,0.00001566576],"category_scores_gemma":[0.0002144157,0.00014136574,0.00017753859,0.00023584723,0.000059354825,0.00073189003,0.00009177542,0.00031481325,0.000011306865],"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.00008643998,0.000115208866,0.00007403898,7.460415e-7,0.000039763807,0.00017234834,0.00018149894,0.01268639,0.00012834131,0.041668423,0.000037927854,0.9448089],"study_design_scores_gemma":[0.00017530746,0.00011754312,0.00017052577,0.00008937954,0.000006318529,0.00015692688,0.00020070914,0.991841,0.0031956641,0.0036054486,0.00029023137,0.0001509333],"about_ca_topic_score_codex":0.000012403809,"about_ca_topic_score_gemma":0.00004281387,"teacher_disagreement_score":0.97915465,"about_ca_system_score_codex":0.00014044046,"about_ca_system_score_gemma":0.000104165745,"threshold_uncertainty_score":0.57647276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053023784,0.00035189002,0.9903498,0.0024785076,0.0012190434,0.00015623991,0.000002455462,0.00009661617,0.000043049306],"genre_scores_gemma":[0.34598345,0.000023650413,0.65320605,0.0003144205,0.00044724767,0.0000067609494,0.0000018979908,0.0000069732946,0.000009579807],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819547,0.00015773285,0.0006962194,0.00024433166,0.00044974886,0.00025647835],"domain_scores_gemma":[0.99702585,0.000643713,0.0005704364,0.00019179346,0.0014716554,0.00009657696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017020109,0.00013798926,0.00022923638,0.00032521118,0.00008698573,0.0006186687,0.002059198,0.000096288735,0.000023289225],"category_scores_gemma":[0.0012705849,0.0001166324,0.00015126777,0.0002298643,0.000082734034,0.0018255707,0.000098856595,0.00026071884,0.0000068500954],"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.00010928755,0.0000999397,0.00003933672,0.0000022544223,0.00003495531,0.00009800574,0.0005546983,0.0002079887,0.011522062,0.184591,0.000024616418,0.80271584],"study_design_scores_gemma":[0.00005315051,0.00066770794,0.000026937973,0.00008207297,0.000015131082,0.00070278277,0.00034940135,0.018237278,0.19926316,0.77804977,0.0023402835,0.0002123255],"about_ca_topic_score_codex":0.000012786477,"about_ca_topic_score_gemma":0.0000103909915,"teacher_disagreement_score":0.8025035,"about_ca_system_score_codex":0.00012341133,"about_ca_system_score_gemma":0.00011453162,"threshold_uncertainty_score":0.59658366},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0089774225,0.00057076896,0.9855617,0.003321502,0.0010720266,0.00008208203,0.0000019415104,0.00005825987,0.00035424714],"genre_scores_gemma":[0.8606183,0.000022375649,0.13851142,0.0001385051,0.000660961,0.000002047006,0.0000024109872,0.000004711942,0.0000392795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998804,0.000037059366,0.00046750798,0.00015845544,0.00041766008,0.00011534696],"domain_scores_gemma":[0.99817765,0.00014732,0.00039000242,0.00010730151,0.0011384011,0.00003932417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039539085,0.00009731032,0.00012925216,0.00020123678,0.00004847183,0.00042011592,0.0009144431,0.000060880095,0.000017598417],"category_scores_gemma":[0.00026956052,0.00008090388,0.000046545534,0.0002268172,0.00007638562,0.000921311,0.00012891719,0.00018570124,0.000015999229],"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.000041974694,0.000055453773,0.0000428805,0.000001798827,0.000015275642,0.000038004175,0.00012379092,0.00006928186,0.016661987,0.7291226,0.00037947847,0.2534475],"study_design_scores_gemma":[0.00003291186,0.0001227616,0.00007148308,0.000022709599,0.000005305621,0.00014343923,0.000039520124,0.004944128,0.1469674,0.8466156,0.0009256252,0.00010909119],"about_ca_topic_score_codex":0.00005682154,"about_ca_topic_score_gemma":0.000010871054,"teacher_disagreement_score":0.8516409,"about_ca_system_score_codex":0.00007955411,"about_ca_system_score_gemma":0.00007387134,"threshold_uncertainty_score":0.40511873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028588455,0.0013342727,0.9926097,0.0019872969,0.00093041925,0.00012362549,0.0000036453696,0.00007749558,0.00007469536],"genre_scores_gemma":[0.32045528,0.00016014966,0.67876005,0.00043923876,0.0001431661,0.000012986075,5.657827e-7,0.0000060506895,0.00002250883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872845,0.000050773575,0.0005231994,0.00018188692,0.0003590804,0.00015661819],"domain_scores_gemma":[0.9982017,0.00044778036,0.00032223185,0.00013589363,0.000817966,0.00007439141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080340554,0.0001070545,0.00015403768,0.00020327322,0.00005988707,0.00037481013,0.00083463104,0.000060718376,0.000022367289],"category_scores_gemma":[0.002022199,0.00008874584,0.00014072427,0.00014284175,0.0000664994,0.0008882964,0.00007648996,0.00015824325,0.0000042997704],"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.000020927193,0.00005544606,0.00016276847,0.000004986974,0.00003341932,0.000040611274,0.00014644733,0.000027318296,0.0005467947,0.746877,0.0003044201,0.25177982],"study_design_scores_gemma":[0.000033581182,0.00020117106,0.000012757227,0.00005799883,0.000008513651,0.0001962843,0.00006612152,0.0020556746,0.105835624,0.88731325,0.0040973,0.00012172732],"about_ca_topic_score_codex":0.0000050093463,"about_ca_topic_score_gemma":0.000004263081,"teacher_disagreement_score":0.31759644,"about_ca_system_score_codex":0.00006127883,"about_ca_system_score_gemma":0.00008065134,"threshold_uncertainty_score":0.36189502},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044815455,0.00002142452,0.94950044,0.0013903128,0.002502776,0.00006754977,0.000002272811,0.000031458443,0.0016683021],"genre_scores_gemma":[0.9142984,0.00001894003,0.085036285,0.0002794789,0.00034670095,4.969557e-7,0.0000013270424,0.000004350735,0.000014001942],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980223,0.000044353586,0.00089641823,0.00015750583,0.0006994966,0.00017988666],"domain_scores_gemma":[0.9981779,0.00031715955,0.00042887297,0.00015278267,0.000813212,0.000110109075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016118151,0.000101077894,0.00013206097,0.00030015648,0.00006893597,0.00035973924,0.0008858152,0.00005145758,0.0003233505],"category_scores_gemma":[0.00058540015,0.00009626986,0.00012622525,0.00022410438,0.00007611702,0.0014197387,0.000119135046,0.00020460316,0.00005042114],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047305253,0.00007439597,0.0017053494,0.0000011940057,0.000039284118,0.000058432954,0.00046298854,0.0013590774,0.005868081,0.084008634,0.00006400834,0.9063113],"study_design_scores_gemma":[0.0004893356,0.0007840145,0.06378627,0.0002617942,0.000043893237,0.0018234841,0.003366802,0.13056348,0.6065891,0.18453427,0.006597644,0.0011599159],"about_ca_topic_score_codex":0.00001827372,"about_ca_topic_score_gemma":0.000056565696,"teacher_disagreement_score":0.9051513,"about_ca_system_score_codex":0.00019586344,"about_ca_system_score_gemma":0.00012327044,"threshold_uncertainty_score":0.39257708},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70721835,0.00009220052,0.28752446,0.0038449187,0.0008227129,0.00016075646,0.000039239956,0.000018057604,0.00027928618],"genre_scores_gemma":[0.96297187,0.000017945298,0.03659316,0.00019601831,0.00019186916,0.0000052123837,0.000005647595,0.000010366408,0.000007903182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813956,0.00009524613,0.0007040223,0.0002356191,0.0006343268,0.00019121522],"domain_scores_gemma":[0.99820524,0.0004782098,0.0005272213,0.0002928914,0.00041885293,0.00007756843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010224234,0.0001637725,0.00020567638,0.00019024836,0.00015817473,0.00045468705,0.0013145076,0.00005622653,0.00002842041],"category_scores_gemma":[0.0004073474,0.00011644552,0.00010297427,0.00022212308,0.00022144703,0.0008113187,0.00017513247,0.0002351808,0.000007975276],"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.0014183179,0.0011366224,0.00032434138,0.000026624928,0.000479945,0.00015326946,0.008089473,0.26627192,0.07326298,0.2826014,0.00017263787,0.3660625],"study_design_scores_gemma":[0.00042852902,0.00045139602,0.00024383308,0.0005806229,0.000041140018,0.00007397459,0.0011778303,0.84790754,0.12463134,0.023839587,0.00029420323,0.00032997568],"about_ca_topic_score_codex":0.00007615377,"about_ca_topic_score_gemma":0.000015867958,"teacher_disagreement_score":0.58163565,"about_ca_system_score_codex":0.0000935197,"about_ca_system_score_gemma":0.0003118209,"threshold_uncertainty_score":0.47485104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13884866,0.000031468004,0.85989743,0.0001664864,0.00077561755,0.00005155592,0.000004456058,0.000008319136,0.0002159822],"genre_scores_gemma":[0.8770849,0.000021851863,0.12273856,0.00007910509,0.00006821478,4.984702e-7,0.0000012419229,0.0000032334458,0.0000023756559],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99849814,0.0000613174,0.000744789,0.000096822434,0.0004746429,0.00012428596],"domain_scores_gemma":[0.9981486,0.00015407665,0.0007216796,0.00009235519,0.0008130829,0.00007016674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037827055,0.000094661234,0.00015753787,0.0003054774,0.00008319726,0.00025645175,0.0004321774,0.000036781585,0.00003942488],"category_scores_gemma":[0.00081412407,0.000086230204,0.000075244956,0.00016887786,0.000066459084,0.0045686318,0.00007918732,0.00018202943,0.0000035018993],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000687407,0.000053335418,0.0005153193,0.0000038441062,0.000032281245,0.000012581204,0.0029858071,0.0065265913,0.016261319,0.040755454,0.000007698642,0.93277705],"study_design_scores_gemma":[0.00021737031,0.00018510371,0.0009982785,0.00043187625,0.000015936892,0.00033680364,0.0034012129,0.19677272,0.7393718,0.054250397,0.0037034443,0.00031508648],"about_ca_topic_score_codex":0.000011889699,"about_ca_topic_score_gemma":0.0000023751315,"teacher_disagreement_score":0.9324619,"about_ca_system_score_codex":0.000059810696,"about_ca_system_score_gemma":0.00013003673,"threshold_uncertainty_score":0.3516366},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03783125,0.000024149998,0.9587816,0.0020986372,0.0008319589,0.00011785395,0.000004448741,0.000024791962,0.0002853166],"genre_scores_gemma":[0.8593645,0.00006606372,0.13989806,0.00021239405,0.00038986935,0.0000033152455,0.0000025563807,0.0000071897975,0.000056056793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853694,0.000027435843,0.0005524883,0.00015339113,0.0005722516,0.00015748209],"domain_scores_gemma":[0.9975816,0.00023126518,0.00028429242,0.00012004476,0.0016981671,0.00008463612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035600955,0.00009994011,0.00014209781,0.00028383278,0.00010674034,0.00022405619,0.00071346026,0.000040544768,0.000091173344],"category_scores_gemma":[0.00019260478,0.00008220232,0.00010722714,0.00020780931,0.00008806563,0.0011574371,0.000043344626,0.00014233596,0.00001838672],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025967747,0.00014569955,0.001851596,0.000004623549,0.00013234014,0.00022889493,0.0011706359,0.050280046,0.0017142247,0.08989841,0.00026550316,0.8540484],"study_design_scores_gemma":[0.0009945764,0.0021582192,0.013520548,0.0004593708,0.00006293269,0.012089679,0.0018887995,0.6015646,0.31712285,0.038151078,0.0106750615,0.0013123074],"about_ca_topic_score_codex":0.000007203743,"about_ca_topic_score_gemma":0.00001263077,"teacher_disagreement_score":0.85273606,"about_ca_system_score_codex":0.00006376539,"about_ca_system_score_gemma":0.0002736404,"threshold_uncertainty_score":0.33521134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10601603,0.00006123984,0.8866608,0.00017299422,0.0057743792,0.00015715427,0.000005970725,0.000036918136,0.0011145069],"genre_scores_gemma":[0.99377555,0.00004930516,0.0048397044,0.00003690883,0.0012117986,0.000005816372,0.000011832543,0.000018570745,0.00005049955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846095,0.000047824204,0.00079089584,0.000099821526,0.00041609458,0.00018440124],"domain_scores_gemma":[0.9990797,0.00008687781,0.00028387696,0.0000909988,0.00038765886,0.000070859525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007303922,0.00013247205,0.00018656069,0.00013999641,0.00014530431,0.00016673745,0.0002849327,0.000073287876,0.00011928671],"category_scores_gemma":[0.00012272304,0.000101338694,0.00015362572,0.00019615708,0.0001038009,0.0005646342,0.000030899933,0.00020287238,0.00010901713],"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.00036978576,0.000074456715,0.000004587228,0.000011093412,0.00029890437,0.000018561572,0.00035470928,0.90897596,0.01595839,0.0099972095,0.00031279048,0.06362356],"study_design_scores_gemma":[0.0006969787,0.0008646903,0.00024810503,0.00044341787,0.00039610482,0.0012607758,0.0014916271,0.81331146,0.06020628,0.10735016,0.012981756,0.0007486171],"about_ca_topic_score_codex":0.000022024848,"about_ca_topic_score_gemma":0.000014806088,"teacher_disagreement_score":0.8877595,"about_ca_system_score_codex":0.00015417703,"about_ca_system_score_gemma":0.00008977628,"threshold_uncertainty_score":0.4132472},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16094568,0.0020715771,0.8289381,0.006470852,0.0010321034,0.00018893255,0.000007000887,0.00006807766,0.00027765424],"genre_scores_gemma":[0.8911219,0.00012832321,0.10840284,0.00011403454,0.00021486156,0.0000043208147,6.7033443e-7,0.000004298293,0.00000871619],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881727,0.000047078054,0.0005101708,0.00018530966,0.0003040786,0.00013608762],"domain_scores_gemma":[0.9989655,0.0001797696,0.00028298848,0.0001034237,0.00039475498,0.000073546995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046235288,0.000106913925,0.00016184848,0.00032211855,0.0000495649,0.00032229684,0.00067265355,0.00006510515,0.000011549109],"category_scores_gemma":[0.00021445191,0.00009689078,0.000036169997,0.0001866176,0.0001870019,0.0009840897,0.00016889267,0.0003156652,0.000004100072],"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.000016854066,0.000050082752,0.0002899214,0.0000021628196,0.000015804411,0.000024562334,0.00062299,0.000022219474,0.002100694,0.36374497,0.000037929403,0.63307184],"study_design_scores_gemma":[0.0001633993,0.0001546904,0.000777673,0.000092303584,0.000009151555,0.0006671163,0.00029744476,0.009006359,0.09861693,0.8881774,0.0017815199,0.0002559991],"about_ca_topic_score_codex":0.00006168618,"about_ca_topic_score_gemma":0.000054612727,"teacher_disagreement_score":0.73017627,"about_ca_system_score_codex":0.000093931856,"about_ca_system_score_gemma":0.00008206022,"threshold_uncertainty_score":0.39510912},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054620292,0.000018646573,0.94443005,0.00037475812,0.00026997057,0.00019462919,0.000002973031,0.000022580074,0.00006608905],"genre_scores_gemma":[0.92714655,0.000010658786,0.072545186,0.0000945936,0.000121354526,0.000008305212,0.000037381615,0.0000119449505,0.000024027278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770933,0.00016784712,0.0007573171,0.0002247794,0.0008439124,0.00029680578],"domain_scores_gemma":[0.9987251,0.000258652,0.00047466884,0.00023977182,0.00014493718,0.00015685978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012205832,0.00016718011,0.00018488576,0.0003198959,0.00007386302,0.00040462724,0.00082588615,0.00006923993,0.000015387397],"category_scores_gemma":[0.0005052697,0.0001580124,0.00006236262,0.00017900605,0.0000993965,0.0012149577,0.00010451143,0.00026880862,0.000021175538],"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.00009170237,0.00041247127,0.00018094333,0.000003488767,0.000028415961,0.000008793347,0.0009957398,0.8813365,0.0013052891,0.0030206938,0.0000048033526,0.11261116],"study_design_scores_gemma":[0.000106455984,0.00025061582,0.0024065396,0.00007362416,0.000009782869,0.000024442561,0.00035736422,0.99482,0.0010856488,0.0005928483,0.00011587523,0.00015680343],"about_ca_topic_score_codex":0.000012708785,"about_ca_topic_score_gemma":0.0000011787647,"teacher_disagreement_score":0.8725262,"about_ca_system_score_codex":0.00035706247,"about_ca_system_score_gemma":0.000056815355,"threshold_uncertainty_score":0.64435583},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013635508,0.00008961613,0.9837059,0.0010368731,0.0006533962,0.000083120656,0.000002740369,0.000021346203,0.00077150285],"genre_scores_gemma":[0.930924,0.00004378688,0.0683669,0.00003385989,0.00048074,0.000004604373,0.000008367887,0.0000052453233,0.0001324677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980469,0.000039440296,0.000948406,0.00014331574,0.0006836814,0.0001382981],"domain_scores_gemma":[0.99770665,0.00023001699,0.00073800544,0.00014649602,0.0011312667,0.00004754671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044117574,0.00009900195,0.0001504648,0.00023649378,0.00007737794,0.00013813261,0.00094678183,0.000045548957,0.00004966975],"category_scores_gemma":[0.00019839963,0.00009316202,0.00014147424,0.00026207414,0.00006921451,0.0009092891,0.0001053584,0.00018108726,0.000029471987],"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.000026840853,0.00021335656,0.00039564885,0.000003038711,0.000047308687,0.000017250215,0.00022208938,0.24839415,0.0072434032,0.2960344,0.00017265498,0.44722986],"study_design_scores_gemma":[0.00012237697,0.00024437002,0.0014584538,0.000088689674,0.000011245119,0.00010881361,0.00020626545,0.713887,0.17904927,0.09989379,0.004738632,0.0001910883],"about_ca_topic_score_codex":0.000088116634,"about_ca_topic_score_gemma":0.0000082842935,"teacher_disagreement_score":0.91728854,"about_ca_system_score_codex":0.000091059854,"about_ca_system_score_gemma":0.00010076495,"threshold_uncertainty_score":0.3799037},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033664485,0.000029632156,0.9886613,0.0050970567,0.0024986262,0.00015706859,0.000008190951,0.00003609956,0.00014557496],"genre_scores_gemma":[0.77167696,0.000011738631,0.22698165,0.0009489333,0.0003534357,0.0000030728377,0.000005104468,0.000006530054,0.000012562435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983915,0.000029403014,0.00072402833,0.000185287,0.00045745683,0.00021230613],"domain_scores_gemma":[0.9979462,0.00019431942,0.00042006542,0.00014580158,0.0011827664,0.00011085619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045938944,0.00013214072,0.00017696223,0.00018773817,0.000087370514,0.00037688215,0.000814214,0.00007440998,0.00008364872],"category_scores_gemma":[0.00036856244,0.00012552219,0.00018654585,0.00021755509,0.00010477572,0.0008680132,0.00004941977,0.00018878658,0.000013431167],"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.000089804635,0.0000494009,0.00005796908,0.000001444295,0.000027429252,0.000018041448,0.00013566078,0.70915514,0.00017766537,0.062128816,0.0001028662,0.22805579],"study_design_scores_gemma":[0.0001680237,0.00015578949,0.0000430843,0.000043798846,0.000008548026,0.00007940193,0.000046558755,0.9293423,0.0024512978,0.067357205,0.00017168267,0.00013227599],"about_ca_topic_score_codex":0.0000063006355,"about_ca_topic_score_gemma":0.000043565607,"teacher_disagreement_score":0.76831055,"about_ca_system_score_codex":0.00011128734,"about_ca_system_score_gemma":0.0005130438,"threshold_uncertainty_score":0.51186466},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7630327,0.00020146015,0.2264719,0.0015943645,0.005245082,0.00016262042,0.000082617255,0.000009909103,0.0031993464],"genre_scores_gemma":[0.99410725,0.000017568764,0.0020002401,0.0000227722,0.003768682,0.0000015135113,0.000006829753,0.000008320556,0.000066810804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821293,0.000060583337,0.0009116255,0.000098762626,0.000503287,0.00021278308],"domain_scores_gemma":[0.9979184,0.00015580369,0.00074103486,0.00007127382,0.0010760066,0.00003743863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044270852,0.00011320886,0.00018377218,0.00004819852,0.00026758137,0.00020006095,0.0006143672,0.000037879552,0.00019699078],"category_scores_gemma":[0.0000319278,0.00008472697,0.00025707876,0.00018017362,0.0002354239,0.00034585735,0.00006742354,0.00021647842,0.0000071233703],"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.00009879903,0.00014462638,0.0049328185,0.0000019997535,0.00021573836,0.0000065179693,0.00064927636,0.045848362,0.0031919985,0.785334,0.00095009827,0.15862578],"study_design_scores_gemma":[0.00018745528,0.00017856777,0.008126752,0.0001427646,0.00008091559,0.000022083566,0.007696362,0.07810552,0.015727945,0.8783983,0.010757565,0.0005757648],"about_ca_topic_score_codex":0.00029149803,"about_ca_topic_score_gemma":0.000013183521,"teacher_disagreement_score":0.23107457,"about_ca_system_score_codex":0.000034760633,"about_ca_system_score_gemma":0.00011251454,"threshold_uncertainty_score":0.34550655},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7423229,0.001866214,0.2538303,0.0010379759,0.0006574114,0.00016881282,0.000033203272,5.6875837e-7,0.00008258926],"genre_scores_gemma":[0.9673029,0.0003552405,0.03149721,0.00008883629,0.00069814676,0.000008754841,0.0000017700338,0.0000090827725,0.000038027505],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988938,0.000045327542,0.0006055407,0.00013036712,0.00019038405,0.0001345695],"domain_scores_gemma":[0.9987975,0.00029138883,0.00031633265,0.000101284146,0.0004663037,0.000027206477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065374316,0.00009899898,0.00016557676,0.00009785115,0.000037666927,0.000040009494,0.0004165745,0.00005348649,0.000014806053],"category_scores_gemma":[0.00044090787,0.000075175034,0.00017714039,0.00006796872,0.000077161676,0.0000024716626,0.00007280343,0.00006712024,0.0000012161738],"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.00038487872,0.00008523957,0.00013519647,0.000002077793,0.00012781147,0.0000012597094,0.00020470463,0.35056156,0.3789654,0.00026234228,0.000057980338,0.2692115],"study_design_scores_gemma":[0.00013956852,0.0004871732,0.0014121258,0.00003607533,0.000033274635,0.000042946664,0.0006882049,0.016979754,0.97414446,0.0007239798,0.005197139,0.00011527327],"about_ca_topic_score_codex":0.000010823235,"about_ca_topic_score_gemma":0.0000754021,"teacher_disagreement_score":0.5951791,"about_ca_system_score_codex":0.00003012369,"about_ca_system_score_gemma":0.00009755781,"threshold_uncertainty_score":0.30655488},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24289286,0.000023802413,0.7543805,0.00062991056,0.0017798223,0.00021668206,0.0000053244416,0.000041123032,0.000029961708],"genre_scores_gemma":[0.6319713,0.000022740185,0.36744538,0.00006380275,0.00047263392,0.0000054624597,0.0000024494182,0.000008483615,0.00000775969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978829,0.000044168504,0.0009774795,0.00025886303,0.00059154263,0.00024505472],"domain_scores_gemma":[0.99707836,0.00025225573,0.00070663996,0.00013098949,0.0017095212,0.00012221477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004757637,0.00017139202,0.00022249343,0.00040273395,0.00022888687,0.0003598559,0.00069825293,0.00009022366,0.000043272245],"category_scores_gemma":[0.00089256087,0.00017105552,0.0001922281,0.00029702016,0.00017621937,0.0015759275,0.00007064255,0.00023913282,0.000010335065],"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.0001239909,0.00011107401,0.00053250097,0.000009011669,0.00008953213,0.000047164045,0.001130033,0.40386698,0.0038631323,0.005401807,0.0000097435095,0.584815],"study_design_scores_gemma":[0.00031452946,0.00021322283,0.00016920816,0.00013751975,0.000021039754,0.0024609426,0.0009942205,0.9294207,0.06341325,0.001270628,0.0012900623,0.0002946834],"about_ca_topic_score_codex":0.000011756664,"about_ca_topic_score_gemma":0.00000803412,"teacher_disagreement_score":0.58452034,"about_ca_system_score_codex":0.00017912837,"about_ca_system_score_gemma":0.0004069254,"threshold_uncertainty_score":0.69754416},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015764983,0.00017310093,0.97767216,0.002868129,0.0021502427,0.00012329529,0.0000023118037,0.000027560389,0.0012181966],"genre_scores_gemma":[0.98874944,0.00026811106,0.009720129,0.00035726136,0.00030947712,0.000004569102,0.000003993997,0.0000074577297,0.000579577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778533,0.00011168019,0.00092613464,0.00018706279,0.0007928064,0.00019697056],"domain_scores_gemma":[0.99785006,0.00016392054,0.0007741324,0.00012081694,0.0010054449,0.00008560647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005421032,0.00013543146,0.00018683689,0.00021283825,0.000113446826,0.0004605471,0.0010421952,0.00006154484,0.00026110455],"category_scores_gemma":[0.00040269856,0.00012274577,0.000093676106,0.00028228623,0.000035101915,0.0012761793,0.000118873206,0.00022053761,0.00021698918],"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.000079575555,0.00028423217,0.0008395585,0.000013612264,0.00044645814,0.00020610593,0.009674687,0.066508435,0.009019029,0.1696709,0.017140366,0.7261171],"study_design_scores_gemma":[0.00033101035,0.00066839025,0.0004753944,0.00037657196,0.000022102433,0.00020360562,0.0016235142,0.7263343,0.14686704,0.0072420803,0.115141325,0.0007147019],"about_ca_topic_score_codex":0.00001456989,"about_ca_topic_score_gemma":0.0000041888466,"teacher_disagreement_score":0.97298443,"about_ca_system_score_codex":0.00024382987,"about_ca_system_score_gemma":0.00007209203,"threshold_uncertainty_score":0.5005427},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47210342,0.0001129315,0.5108805,0.010756564,0.0021779886,0.0007160643,0.000019366353,0.0000387279,0.003194454],"genre_scores_gemma":[0.9897644,0.00005629255,0.009340934,0.0003538402,0.0003337254,0.00002498193,0.0000059670533,0.000010780092,0.00010906127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974301,0.00019209691,0.0009411799,0.00017985918,0.0009668179,0.0002899406],"domain_scores_gemma":[0.9985415,0.00023396645,0.00050835486,0.00011180519,0.000454319,0.00015005468],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001027853,0.00014563517,0.00023629036,0.000272947,0.0001344109,0.00045291655,0.00079081865,0.00010926295,0.0026494362],"category_scores_gemma":[0.001010706,0.00013209348,0.0001614352,0.00014205066,0.00026055324,0.0011196267,0.000037931517,0.00028198666,0.0003841835],"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.00029438245,0.0008166995,0.006175599,0.0000051462075,0.00010314965,0.00009297882,0.003899795,0.2560734,0.00093163067,0.08747508,0.00012888628,0.6440033],"study_design_scores_gemma":[0.0007921397,0.0002692408,0.015889812,0.00021455399,0.00004843175,0.0000135538285,0.00922976,0.9070112,0.005127718,0.05431219,0.0065091085,0.00058229413],"about_ca_topic_score_codex":0.0021180469,"about_ca_topic_score_gemma":0.00049580977,"teacher_disagreement_score":0.6509378,"about_ca_system_score_codex":0.00045707924,"about_ca_system_score_gemma":0.00027324568,"threshold_uncertainty_score":0.9982623},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07306461,0.00068751903,0.91087824,0.00085284095,0.004700581,0.00010895057,0.0000017530859,0.000060947474,0.009644533],"genre_scores_gemma":[0.9897953,0.00010169324,0.008661092,0.00014383825,0.001082286,0.000002689384,9.785592e-7,0.0000087719945,0.00020330929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752766,0.000101449456,0.000890752,0.00025359873,0.0009100749,0.0003164783],"domain_scores_gemma":[0.99739283,0.00024304022,0.00058738515,0.0002657195,0.0013319376,0.00017905812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010450754,0.00017444386,0.0002635465,0.00034753754,0.00010862198,0.00093957485,0.0020734514,0.00008017077,0.00006235111],"category_scores_gemma":[0.0007150588,0.00014573552,0.00021659955,0.00039127935,0.00006116352,0.0005469344,0.00015737108,0.0002802944,0.00023614582],"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.00009791301,0.00032423058,0.00046055586,0.0000033693136,0.000093552226,0.00056481076,0.0010274956,0.062275466,0.0013484178,0.59918946,0.0003911726,0.33422354],"study_design_scores_gemma":[0.00024925778,0.00077476865,0.0016112054,0.00055103214,0.000040230225,0.0043650717,0.0011907176,0.90392405,0.015791157,0.050998326,0.019760842,0.00074332964],"about_ca_topic_score_codex":0.000026165373,"about_ca_topic_score_gemma":0.0000065904096,"teacher_disagreement_score":0.9167307,"about_ca_system_score_codex":0.00018883716,"about_ca_system_score_gemma":0.00018923279,"threshold_uncertainty_score":0.9060342},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017648811,0.000008653069,0.99570864,0.0013187933,0.00045695092,0.00021349337,0.0000050312433,0.000066903725,0.0004566658],"genre_scores_gemma":[0.75031424,0.0000033924798,0.24907616,0.00029095754,0.00023116682,0.000037147594,0.000003887775,0.000007642018,0.000035432455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986359,0.000041673902,0.0005755926,0.00020114737,0.00040957986,0.00013612163],"domain_scores_gemma":[0.99794984,0.00015580191,0.0004517847,0.0002010603,0.001171982,0.000069525966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068095356,0.000113494,0.00014698514,0.00027628583,0.00011042992,0.00031981635,0.0009925101,0.000088633074,0.000006793965],"category_scores_gemma":[0.00024538985,0.000104800616,0.00019302893,0.00020116904,0.000044340726,0.0006073545,0.00004492256,0.000172469,0.000006985729],"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.00006088118,0.00022970446,0.0000056292733,0.0000047143485,0.00002498654,5.304569e-7,0.00010364735,0.05616777,0.009717348,0.20022292,0.000118582226,0.73334324],"study_design_scores_gemma":[0.00005491007,0.00017684446,0.0000132012365,0.000008852054,0.0000068873364,0.000014307959,0.00001958459,0.76065934,0.15638551,0.081152126,0.0014193148,0.00008909983],"about_ca_topic_score_codex":0.0000031313346,"about_ca_topic_score_gemma":0.0000022184156,"teacher_disagreement_score":0.74854934,"about_ca_system_score_codex":0.00010006742,"about_ca_system_score_gemma":0.000071783,"threshold_uncertainty_score":0.42736453},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03454256,0.00003154494,0.9575817,0.004401871,0.00259186,0.00033699555,0.000019755606,0.00005133603,0.0004423677],"genre_scores_gemma":[0.89487344,0.00010524859,0.10442782,0.00013306084,0.00038519767,0.000014842593,0.0000061499577,0.00001020892,0.0000440099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769443,0.00006834202,0.0009900521,0.00026832303,0.00077039853,0.0002084722],"domain_scores_gemma":[0.9968543,0.00038071815,0.0007237822,0.00027700176,0.0016439665,0.00012020682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052477425,0.00015543112,0.00021382507,0.00039307761,0.00016031307,0.00029746979,0.0008270106,0.00008090343,0.00014769098],"category_scores_gemma":[0.0010095761,0.00015012051,0.00022851527,0.0002926282,0.00015650548,0.0010269181,0.00009044963,0.00019801827,0.0000321583],"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.00016266787,0.00020341159,0.0009988258,0.000008071848,0.00014109082,0.00006509981,0.0020533858,0.24280703,0.0062523023,0.17719492,0.00097457826,0.56913865],"study_design_scores_gemma":[0.0009202564,0.00074416044,0.012897189,0.00021947762,0.00004866336,0.0033190886,0.0013492926,0.8239981,0.07904508,0.07370215,0.002999374,0.0007571585],"about_ca_topic_score_codex":0.000028083394,"about_ca_topic_score_gemma":0.000032864406,"teacher_disagreement_score":0.8603309,"about_ca_system_score_codex":0.00018709907,"about_ca_system_score_gemma":0.00027816396,"threshold_uncertainty_score":0.6121737},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42166987,0.00013433036,0.57700574,0.0006385241,0.00032159325,0.0001356945,0.000007719918,0.000021378482,0.00006513854],"genre_scores_gemma":[0.8988336,0.000019938543,0.100715324,0.000053201587,0.00033840927,0.000011647084,0.000005247567,0.00000598178,0.000016666963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980414,0.00008842477,0.00093478814,0.00025412053,0.00051504606,0.00016622426],"domain_scores_gemma":[0.998424,0.0003473888,0.0003879959,0.00013860929,0.00064048293,0.00006154866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000513339,0.00013275162,0.00017764712,0.0003233637,0.00012509398,0.00034906622,0.0006045225,0.000051081086,0.000012352039],"category_scores_gemma":[0.00016505316,0.00012864672,0.000071350936,0.00035099196,0.00007942957,0.0014064664,0.00018740144,0.00020677982,0.000010789693],"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.000055711607,0.0022469338,0.020488864,0.0000069225,0.00008220722,0.003976652,0.0014275495,0.18601972,0.00056864735,0.10312545,0.00029195525,0.6817094],"study_design_scores_gemma":[0.0004075681,0.0006209554,0.14066568,0.0001069973,0.00002922599,0.013629373,0.0037860356,0.6795356,0.0014573924,0.15761472,0.0015059657,0.000640453],"about_ca_topic_score_codex":0.00040025025,"about_ca_topic_score_gemma":0.00021452176,"teacher_disagreement_score":0.68106896,"about_ca_system_score_codex":0.00016321747,"about_ca_system_score_gemma":0.00013260297,"threshold_uncertainty_score":0.5246061},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09012727,0.000031616593,0.9055964,0.00031759084,0.0034781718,0.00026692514,0.000024958026,0.000032148717,0.00012493036],"genre_scores_gemma":[0.8261215,0.0000018578896,0.17335588,0.00009358159,0.00038969776,0.000010944736,0.0000017095222,0.000015748163,0.000009053531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967187,0.00009220278,0.0013516046,0.0003036643,0.001230959,0.00030284098],"domain_scores_gemma":[0.99515957,0.0015481997,0.00082530227,0.0003873988,0.001933585,0.00014593314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019973402,0.00019864172,0.00032620385,0.00061201595,0.000092553404,0.00043917648,0.0022123936,0.00010833272,0.000009297561],"category_scores_gemma":[0.000941286,0.00017845865,0.00023199023,0.00019779554,0.00007756868,0.00068742596,0.000104920386,0.0004357439,0.000009162165],"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.00008965323,0.00017422493,0.00006498396,0.000024758428,0.000034234137,0.000026503174,0.00013131261,0.8960264,0.011914404,0.0068344884,0.000012211935,0.08466688],"study_design_scores_gemma":[0.000116874624,0.00017172392,0.000022782342,0.00027517998,0.000006447281,0.000029001745,0.00005491419,0.766527,0.23096798,0.0016364105,0.0000664641,0.00012523036],"about_ca_topic_score_codex":0.000055207995,"about_ca_topic_score_gemma":0.000008233709,"teacher_disagreement_score":0.7359943,"about_ca_system_score_codex":0.00015400206,"about_ca_system_score_gemma":0.00038745286,"threshold_uncertainty_score":0.72773325},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011157766,0.00002759031,0.9834958,0.0028795572,0.0015604154,0.00014453869,0.000011565044,0.000060635073,0.00066215027],"genre_scores_gemma":[0.7433574,0.00011400148,0.25525683,0.0005999953,0.0005533172,0.0000114454515,0.0000053957856,0.000011939906,0.000089651134],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978685,0.00004426966,0.0008278792,0.00024031512,0.00083197374,0.00018707397],"domain_scores_gemma":[0.9970958,0.0007898645,0.00051874766,0.00042322406,0.0010957435,0.00007658955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071160577,0.00013274656,0.00019513676,0.00039726522,0.000119140605,0.00025145404,0.0028151053,0.000071395385,0.00004023895],"category_scores_gemma":[0.001796203,0.000114570714,0.00018756546,0.00020861665,0.000082502534,0.0011877769,0.00015540149,0.00022166948,0.00008363072],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022864426,0.00018809318,0.000040929637,0.0000012385195,0.0000325585,0.000051442534,0.00027566182,0.0009125841,0.004452216,0.16893218,0.0035566532,0.8213278],"study_design_scores_gemma":[0.00031375446,0.00123339,0.001231746,0.00025819134,0.000012189458,0.00061730086,0.00012164925,0.052939907,0.54906964,0.3513573,0.04238233,0.00046261356],"about_ca_topic_score_codex":0.000003282988,"about_ca_topic_score_gemma":0.000003325982,"teacher_disagreement_score":0.82086515,"about_ca_system_score_codex":0.00013521695,"about_ca_system_score_gemma":0.00013502188,"threshold_uncertainty_score":0.5231213},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063156135,0.0000983069,0.9333087,0.0025206571,0.00072957244,0.00007609831,0.00001222281,0.000018858183,0.00007941448],"genre_scores_gemma":[0.52999604,0.000012147196,0.46965778,0.0001646233,0.0001261878,0.0000028568245,0.0000052951923,0.0000059482913,0.000029131439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828863,0.000118902964,0.0007213041,0.00027609486,0.00036939082,0.0002256853],"domain_scores_gemma":[0.9972199,0.0007297472,0.0008638148,0.00035341785,0.0006578281,0.0001752968],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019603886,0.00014757509,0.00031409398,0.00044355477,0.00029149916,0.0015976143,0.0018573698,0.00007262535,0.000028597879],"category_scores_gemma":[0.0009811614,0.00013095781,0.00019578631,0.00013108498,0.00010933425,0.0015986116,0.00016506804,0.00022820188,0.0000029845603],"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.00020227392,0.00012341469,0.003901884,0.0000068237905,0.00077569927,0.00012924083,0.0025331622,0.0629588,0.0008422555,0.008198528,0.0001493054,0.9201786],"study_design_scores_gemma":[0.0000702537,0.00037409415,0.004041809,0.00005101786,0.00012596934,0.00009734807,0.00023681714,0.96240175,0.002870729,0.028576057,0.00096268865,0.00019146479],"about_ca_topic_score_codex":0.000019363737,"about_ca_topic_score_gemma":0.000006204681,"teacher_disagreement_score":0.91998714,"about_ca_system_score_codex":0.0000560325,"about_ca_system_score_gemma":0.0001486122,"threshold_uncertainty_score":0.9994388},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011239507,0.00006213642,0.9865174,0.010456813,0.0013752126,0.00022801533,0.000014048471,0.000012626398,0.00020976711],"genre_scores_gemma":[0.9343732,0.00016483075,0.06495406,0.00014851888,0.00027055098,0.000014503374,0.0000010234558,0.000005173377,0.00006814918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889594,0.00003408168,0.00043154837,0.00015493916,0.0003265885,0.00015692666],"domain_scores_gemma":[0.9980524,0.00037006816,0.0005718604,0.00022366484,0.00071656966,0.00006543797],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00075527036,0.00009263371,0.000109834364,0.00010002425,0.0005717055,0.0011347351,0.0010003812,0.000027240045,0.000031244108],"category_scores_gemma":[0.00065771415,0.00006801778,0.00010304317,0.000032045748,0.00016081003,0.0011939178,0.00018041322,0.00013971163,0.000007432344],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047163456,0.00006654391,0.00016676533,0.0000016813236,0.00010099861,0.000009736465,0.0004303258,0.0047237244,0.0005930392,0.09647484,0.00016190908,0.8972233],"study_design_scores_gemma":[0.00041432012,0.0003464091,0.013837134,0.0001579325,0.000060965613,0.0005456413,0.00090846635,0.863197,0.022549063,0.091773726,0.0058366824,0.00037264623],"about_ca_topic_score_codex":0.00002950183,"about_ca_topic_score_gemma":0.00004680333,"teacher_disagreement_score":0.93324924,"about_ca_system_score_codex":0.00008691169,"about_ca_system_score_gemma":0.00012568147,"threshold_uncertainty_score":0.9999022},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73468333,0.00006839466,0.25653696,0.0062168017,0.0019063486,0.00009213155,0.000008933149,0.000026976619,0.0004601278],"genre_scores_gemma":[0.9932263,0.000171841,0.0060477247,0.00016471688,0.00036423816,0.000002260302,8.1764415e-7,0.00000669947,0.000015440177],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986996,0.000054407654,0.00062462944,0.0001661711,0.00029831246,0.00015689063],"domain_scores_gemma":[0.9986112,0.00017156344,0.0007055928,0.0002436871,0.00020887569,0.000059061655],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006567915,0.00012013895,0.00022523642,0.00026451595,0.00011171618,0.0014826187,0.0015101922,0.000060715694,0.000009086661],"category_scores_gemma":[0.00021338034,0.00009994776,0.00008409111,0.000044985438,0.000078048826,0.0027811208,0.00022428684,0.0002718181,0.0000015778983],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000367019,0.000095412026,0.0028462496,0.000004226982,0.000041123476,0.000088468645,0.0016273744,0.000012465154,0.016099248,0.022240752,0.000019417294,0.95688856],"study_design_scores_gemma":[0.00036926288,0.0006461471,0.13904035,0.001854228,0.000016044314,0.0010544612,0.0061262636,0.048056107,0.6839141,0.10943969,0.008512943,0.00097038114],"about_ca_topic_score_codex":0.00006509866,"about_ca_topic_score_gemma":0.00011425091,"teacher_disagreement_score":0.9559182,"about_ca_system_score_codex":0.00007325316,"about_ca_system_score_gemma":0.00006180123,"threshold_uncertainty_score":0.9995539},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07592902,0.00003296473,0.91739553,0.0025712578,0.0036665823,0.00023524619,0.000069149435,0.000013832862,0.000086419175],"genre_scores_gemma":[0.95747,0.0000894468,0.04153959,0.00008688796,0.00039615395,0.000012150174,0.000005096895,0.000011757749,0.00038890884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706674,0.0002177508,0.0013418596,0.00033471253,0.0008491412,0.0001897938],"domain_scores_gemma":[0.9951645,0.0007199794,0.0014457948,0.00039939382,0.0021250846,0.00014521583],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002631734,0.00016439144,0.00030382792,0.00055368396,0.0005142219,0.0010568029,0.0014532489,0.00012479775,0.0003418893],"category_scores_gemma":[0.010027073,0.00014451129,0.00015369493,0.00025642887,0.00042224673,0.0020028914,0.00021658842,0.00040960123,0.00011736532],"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.0013923801,0.004408658,0.04529946,0.000007465893,0.0004350019,0.00026020483,0.007844365,0.44421187,0.009952974,0.1220917,0.0007070775,0.36338887],"study_design_scores_gemma":[0.0033428275,0.00048770095,0.10962408,0.0003511421,0.00011763067,0.00054314226,0.022476794,0.67639583,0.036515735,0.14175975,0.007155774,0.0012295893],"about_ca_topic_score_codex":0.000093218856,"about_ca_topic_score_gemma":0.00017996528,"teacher_disagreement_score":0.88154095,"about_ca_system_score_codex":0.00011493641,"about_ca_system_score_gemma":0.00013607173,"threshold_uncertainty_score":0.9999802},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1666917,0.00016139366,0.83008945,0.0007799866,0.0012695375,0.00010333461,0.000017968327,0.00010069471,0.0007859464],"genre_scores_gemma":[0.98784083,0.00007497564,0.011487567,0.00006724753,0.00047852533,0.000002831372,0.000004071049,0.00002515051,0.000018783961],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981397,0.000036259058,0.00081791147,0.000110757945,0.00067042,0.00022494313],"domain_scores_gemma":[0.9980457,0.00040367918,0.00024572635,0.00014221769,0.001081677,0.000081043196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038952808,0.00013666027,0.00021941366,0.0004400241,0.000035902325,0.00007602723,0.00080521515,0.000083169616,0.0005664955],"category_scores_gemma":[0.0023247937,0.00012749908,0.00010629587,0.00023873725,0.00025343717,0.00034825745,0.000085439824,0.00048494083,0.000071451344],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026978587,0.000144948,0.0031264436,0.00003109051,0.00022231962,0.00010128669,0.00019613076,0.20013909,0.07078636,0.0013198777,0.00044135976,0.7232213],"study_design_scores_gemma":[0.00009708551,0.00057156273,0.00053084234,0.00021433254,0.000016667102,0.000040340645,0.00035908664,0.325117,0.66378826,0.0046084328,0.004424349,0.000232027],"about_ca_topic_score_codex":0.0000032491998,"about_ca_topic_score_gemma":0.000005782161,"teacher_disagreement_score":0.8211491,"about_ca_system_score_codex":0.000099005825,"about_ca_system_score_gemma":0.00007640949,"threshold_uncertainty_score":0.6202729},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4256303,0.00007602336,0.5540204,0.006045388,0.0093700085,0.00022465206,0.000029055716,0.00006154153,0.0045426083],"genre_scores_gemma":[0.9908497,0.00003956597,0.00798423,0.000611499,0.00033053767,0.0000018926353,0.00000716079,0.0000075765456,0.00016786193],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980108,0.000052530333,0.0007545917,0.00018445254,0.00081616634,0.00018146262],"domain_scores_gemma":[0.99857706,0.00014202812,0.00042223083,0.00018103654,0.0005759984,0.00010167439],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00053994113,0.00012141645,0.00017627039,0.00024451848,0.000036945137,0.00037493036,0.0013771127,0.00005684249,0.0015873981],"category_scores_gemma":[0.00013861059,0.000103430386,0.00016050141,0.0001547151,0.000032316402,0.0015128528,0.00018471591,0.00023516837,0.0013955791],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028887202,0.00041176542,0.0016389199,0.000008597907,0.000170695,0.00024389506,0.0008210557,0.0008425196,0.14085674,0.054830525,0.002654371,0.79723203],"study_design_scores_gemma":[0.00032562236,0.001090666,0.0018552768,0.00021835616,0.00001996288,0.0006482289,0.0005697336,0.036485635,0.9009858,0.035243575,0.022022905,0.00053427514],"about_ca_topic_score_codex":0.000017311879,"about_ca_topic_score_gemma":0.0000067233123,"teacher_disagreement_score":0.7966978,"about_ca_system_score_codex":0.00009425191,"about_ca_system_score_gemma":0.00011850008,"threshold_uncertainty_score":0.99938196},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044436574,0.000027442125,0.9412481,0.012909891,0.00081738195,0.00005671009,0.000004130392,0.000030498131,0.00046925776],"genre_scores_gemma":[0.9873937,0.000017779146,0.009806932,0.002545532,0.00022544814,9.626443e-7,0.0000013444132,0.000004603694,0.0000037113266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852043,0.000110272,0.00046125572,0.00017223207,0.00059689063,0.00013889842],"domain_scores_gemma":[0.99870807,0.0003516636,0.0002784957,0.00007225777,0.0004385717,0.00015096384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005354939,0.00009517926,0.0001356903,0.00011148461,0.00007365394,0.00041417807,0.0005817706,0.00004424045,0.000046138568],"category_scores_gemma":[0.00094819476,0.00008298918,0.00007922594,0.00015503935,0.000041134055,0.00062409265,0.00005898322,0.00026211038,0.000030245941],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033307276,0.00010939201,0.0004977259,0.000005854357,0.00005658942,0.000080427,0.001394574,0.008737781,0.014282235,0.017034577,0.0005761221,0.95689166],"study_design_scores_gemma":[0.00025556455,0.0008156424,0.0008545942,0.00033562368,0.000020361917,0.00006260709,0.001134698,0.6436374,0.3211901,0.028232565,0.0031028572,0.0003579978],"about_ca_topic_score_codex":0.0000037601058,"about_ca_topic_score_gemma":0.0000011392683,"teacher_disagreement_score":0.9565337,"about_ca_system_score_codex":0.000039731352,"about_ca_system_score_gemma":0.00008653026,"threshold_uncertainty_score":0.39939287},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009028829,0.00012739496,0.98458534,0.0003458667,0.004819437,0.00033127764,0.0001362413,0.0000711381,0.0005544785],"genre_scores_gemma":[0.9814908,0.00002927125,0.01804156,0.00003206132,0.0002616685,0.000041870946,0.0000371309,0.00003136817,0.0000342951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802727,0.00010774395,0.0010221718,0.00012086916,0.0005543071,0.00016761989],"domain_scores_gemma":[0.99756813,0.00042718134,0.0005224784,0.00010237459,0.0013208361,0.000058970047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008438969,0.0001364305,0.0002516178,0.00042538976,0.000095889474,0.00010058825,0.00045399106,0.000049223938,0.00013103642],"category_scores_gemma":[0.00041202735,0.00014221846,0.00019219283,0.0002806558,0.000047345744,0.00033856576,0.000055435037,0.00023690442,0.0000056109916],"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.00033358883,0.00006824809,0.000028853832,0.00003706978,0.000183406,0.000015151419,0.001038844,0.9189067,0.0010507004,0.013862883,0.0005220924,0.06395249],"study_design_scores_gemma":[0.00038731363,0.0010281194,0.000056205667,0.00044067483,0.00011395635,0.00030589075,0.01320958,0.7812316,0.18148395,0.003924498,0.017290477,0.0005277371],"about_ca_topic_score_codex":0.0000034457041,"about_ca_topic_score_gemma":0.0000045334687,"teacher_disagreement_score":0.97246194,"about_ca_system_score_codex":0.0002819168,"about_ca_system_score_gemma":0.00010459917,"threshold_uncertainty_score":0.57995003},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12892318,0.0001450827,0.123631574,0.6857771,0.0102296695,0.00045852122,0.000037302954,0.00010212958,0.050695423],"genre_scores_gemma":[0.99646235,0.0007333075,0.000121042816,0.0014522495,0.00102647,0.0000014404897,0.0000012587492,0.000008790936,0.0001931153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997244,0.0002739785,0.0006748865,0.00009578373,0.0014443302,0.00026700486],"domain_scores_gemma":[0.99569166,0.0019688297,0.00042678675,0.00009382302,0.0017055589,0.00011333183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005053315,0.00008425799,0.00018084295,0.00035444184,0.00040735092,0.0004303711,0.00096158916,0.00021904171,0.00022514803],"category_scores_gemma":[0.0075764945,0.000064535954,0.000197475,0.0007429525,0.0006611874,0.00062487664,0.0000626061,0.0008403447,0.000052931544],"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.00008150673,0.000046253677,0.00011152844,0.0000032760688,0.00009761883,0.00004580508,0.022537952,0.0013779266,0.0007885027,0.95438814,0.0041644257,0.016357088],"study_design_scores_gemma":[0.000042249496,0.00014977375,0.0001697506,0.00011923064,0.000020770687,0.0000069253997,0.06473413,0.00057502545,0.0049027367,0.917955,0.011206004,0.000118411874],"about_ca_topic_score_codex":0.00028545994,"about_ca_topic_score_gemma":0.00043465433,"teacher_disagreement_score":0.86753917,"about_ca_system_score_codex":0.00017872635,"about_ca_system_score_gemma":0.0004901672,"threshold_uncertainty_score":0.9070319},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016473915,0.00017754153,0.9670502,0.007940815,0.007747482,0.00016065301,0.0000139283065,0.000075046526,0.00036042865],"genre_scores_gemma":[0.8994869,0.000069496964,0.0978146,0.000999908,0.0013864188,0.000010651715,0.0000062751446,0.000015711152,0.00021006758],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971609,0.0001062825,0.0011774459,0.0003509752,0.0009874793,0.00021691571],"domain_scores_gemma":[0.99815196,0.00047953127,0.0002812001,0.00027364102,0.0006692625,0.00014441746],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011691857,0.0001585607,0.00019422124,0.00046106358,0.00005912212,0.0014083028,0.0014168756,0.00008695543,0.00010827441],"category_scores_gemma":[0.0007120224,0.00014791336,0.00017733646,0.00040399304,0.00003144278,0.0018343758,0.00023824404,0.00033615058,0.0001818993],"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.000057103647,0.00006433164,0.00005103311,0.000010834126,0.00008282102,0.000073868905,0.0014564866,0.0050381413,0.009829069,0.27863005,0.00032293017,0.7043833],"study_design_scores_gemma":[0.000112576905,0.00054646394,0.00040306334,0.0012266022,0.000041348627,0.00015326033,0.0009105039,0.3286007,0.1524534,0.5018863,0.0129872365,0.0006785381],"about_ca_topic_score_codex":0.000042705935,"about_ca_topic_score_gemma":0.000014860483,"teacher_disagreement_score":0.88301295,"about_ca_system_score_codex":0.00030843922,"about_ca_system_score_gemma":0.00021891437,"threshold_uncertainty_score":0.9996283},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9583019,0.000031499036,0.038531177,0.00034304507,0.00050992775,0.00020305638,0.00001630517,0.000009758808,0.0020533171],"genre_scores_gemma":[0.99442166,0.000009684933,0.005194051,0.00010668001,0.00019673885,0.0000012705532,0.000013209835,0.00000818541,0.000048518785],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99798113,0.000107310334,0.0011229311,0.00014568432,0.0005345774,0.000108389104],"domain_scores_gemma":[0.9966586,0.0008466623,0.0006510883,0.00013186196,0.0016338548,0.00007789157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039432338,0.00010393535,0.00038895805,0.00036513634,0.000026422404,0.000044365563,0.00019198796,0.00006685894,0.0005621926],"category_scores_gemma":[0.0013206545,0.000092695125,0.00018819222,0.0003181057,0.00017006585,0.00045067054,0.000022960778,0.0001694807,0.000002478746],"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.0068719476,0.0017258867,0.007147402,0.000042367003,0.0010123024,0.00010367477,0.0062113395,0.07119603,0.5928655,0.005888134,0.000067229485,0.3068682],"study_design_scores_gemma":[0.00056768954,0.000698779,0.0041370555,0.00092558685,0.00014372669,0.00015475381,0.003020441,0.05051336,0.9353001,0.0042032953,0.00021652976,0.00011869255],"about_ca_topic_score_codex":0.000081226004,"about_ca_topic_score_gemma":0.0000044133717,"teacher_disagreement_score":0.34243459,"about_ca_system_score_codex":0.00010615089,"about_ca_system_score_gemma":0.00023944776,"threshold_uncertainty_score":0.6155615},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17501612,0.0013789365,0.15719183,0.21222094,0.4436387,0.0011827396,0.0002810185,0.00020118974,0.008888516],"genre_scores_gemma":[0.9596137,0.00047885248,0.0016159106,0.00020351642,0.035319395,0.0000038582302,0.0000037179282,0.000009910115,0.0027511502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836284,0.00010960993,0.0004081053,0.00015991271,0.0007754472,0.00018405674],"domain_scores_gemma":[0.99785584,0.0003633966,0.00015399142,0.00005762167,0.0013793197,0.00018981173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010812386,0.00008507172,0.0001259788,0.00022665174,0.00024705176,0.00066451513,0.0003952595,0.00007713152,0.00026344054],"category_scores_gemma":[0.0012578939,0.00008480939,0.00007310299,0.00028735158,0.000116095915,0.00077351456,0.00005843971,0.00022139633,0.0001387634],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030198714,0.0001893192,0.000800455,0.000012391248,0.00028311086,0.00011584069,0.035416353,0.0001783307,0.0012568859,0.3862266,0.2754019,0.29981685],"study_design_scores_gemma":[0.000033453496,0.000047103014,0.00092081685,0.00022567202,0.000019753981,0.00000857614,0.0064765955,0.000033476877,0.0021088182,0.019311126,0.9706871,0.00012751496],"about_ca_topic_score_codex":0.00052372884,"about_ca_topic_score_gemma":0.0006246542,"teacher_disagreement_score":0.7845976,"about_ca_system_score_codex":0.0005625591,"about_ca_system_score_gemma":0.0013107448,"threshold_uncertainty_score":0.64079344},"labels":[],"label_agreement":null}]}