{"meta":{"query_hash":"72c770a2ebb2","filters":{"venue":"IAT"},"cohort_total":6,"direct_labels_cover":0,"predictions_cover":6,"exported":6,"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/72c770a2ebb2","api":"https://metacan.xera.ac/api/v1/cohort?venue=IAT"},"results":[{"id":"W2293715531","doi":"","title":"An Organisational Multi-agent Systems Approach for Designing Collaborative Tagging Systems.","year":2008,"lang":"en","type":"article","venue":"IAT","topic":"Multi-Agent Systems and Negotiation","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":"Thompson Rivers University","funders":"","keywords":"Computer science; Multi-agent system; Social system; Complex system; Knowledge management; Artificial intelligence","score_opus":0.0667279515190003,"score_gpt":0.27734886052135554,"score_spread":0.21062090900235525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293715531","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.009639064,0.00053104333,0.9866969,0.00003516205,0.0013583491,0.0013362555,0.000022708567,0.0002301491,0.0001503819],"genre_scores_gemma":[0.87146014,0.000009993933,0.12739381,0.00005109588,0.00039148508,0.00028535124,0.00004854166,0.000021826323,0.00033777778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813205,0.00023146746,0.0004115202,0.0005156596,0.0004019921,0.0003072813],"domain_scores_gemma":[0.9987192,0.00010859994,0.00027696294,0.0004120446,0.00034589396,0.0001372772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005723891,0.00019303456,0.00026736196,0.00012711158,0.000541961,0.0002714632,0.00045796175,0.00009719106,0.0000017828166],"category_scores_gemma":[0.000036074372,0.0001767195,0.00005158856,0.0003438105,0.000025332514,0.0007635409,0.000044691824,0.00007107895,0.000024770843],"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.00009525638,0.0022269317,0.031050418,0.0018312095,0.00060248544,0.000099156605,0.08145545,0.59367293,0.12426228,0.13625756,0.02679336,0.0016529975],"study_design_scores_gemma":[0.00081885053,0.00007939075,0.001437864,0.000038479884,0.000008343312,0.00005170649,0.00085819105,0.9925302,0.0012175054,0.0000043756145,0.0026877928,0.0002672987],"about_ca_topic_score_codex":0.000120676494,"about_ca_topic_score_gemma":0.0000020177954,"teacher_disagreement_score":0.86182106,"about_ca_system_score_codex":0.00018639569,"about_ca_system_score_gemma":0.00018077003,"threshold_uncertainty_score":0.72064126},"labels":[],"label_agreement":null},{"id":"W2293921668","doi":"","title":"An Adaptive Multi-agent System for Continuous Learning of Streaming Data.","year":2008,"lang":"en","type":"article","venue":"IAT","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cluster analysis; Machine learning; Artificial intelligence; Data mining; Set (abstract data type); Function (biology)","score_opus":0.08312619875003495,"score_gpt":0.30760311781626515,"score_spread":0.22447691906623018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293921668","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.05065663,0.000059542992,0.9481842,0.0000100805955,0.00014042079,0.00023008091,0.00010331314,0.00048915163,0.00012656042],"genre_scores_gemma":[0.6172639,0.0000040537348,0.3825853,0.000004994186,0.000030140807,0.00001283246,0.000045546498,0.0000078804105,0.000045346515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989875,0.00006410484,0.00019111538,0.00040356873,0.00015919104,0.00019450122],"domain_scores_gemma":[0.99848837,0.00010921733,0.00017338851,0.0010821772,0.00009022683,0.00005662159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028701092,0.000106478576,0.00020071835,0.000069030386,0.000113124275,0.00003359129,0.0014672839,0.00004452272,5.984441e-7],"category_scores_gemma":[0.0000646831,0.00010229036,0.00003063345,0.00011024551,0.000042743937,0.00060920505,0.00042738704,0.00007688242,0.000004905536],"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.00015973151,0.0014981754,0.034292087,0.0004907444,0.0003080943,0.00040340156,0.015407871,0.00062471733,0.032686934,0.033637032,0.012084308,0.8684069],"study_design_scores_gemma":[0.0010095274,0.0013130559,0.004932904,0.00030411436,0.00003060329,0.00015996529,0.0013399785,0.95100135,0.03215492,0.000035196088,0.007238219,0.00048018328],"about_ca_topic_score_codex":0.00014885601,"about_ca_topic_score_gemma":0.000008037836,"teacher_disagreement_score":0.95037663,"about_ca_system_score_codex":0.000039298342,"about_ca_system_score_gemma":0.00004825354,"threshold_uncertainty_score":0.417128},"labels":[],"label_agreement":null},{"id":"W2397401021","doi":"","title":"A Hybrid Cooperative Behavior Learning Method for a Rule-Based Shout-Ahead Architecture.","year":2012,"lang":"en","type":"article","venue":"IAT","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Reinforcement learning; Architecture; Task (project management); Computer science; Set (abstract data type); Artificial intelligence; Quality (philosophy); Hybrid learning; Machine learning; Engineering","score_opus":0.025482849714282003,"score_gpt":0.3156425854667007,"score_spread":0.2901597357524187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397401021","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.0069237105,0.0001765314,0.9909823,0.0010001725,0.00014604465,0.0003874647,0.000016476562,0.00014531465,0.00022199452],"genre_scores_gemma":[0.2783258,0.0000011589568,0.7199024,0.00034376993,0.00025947075,0.00067579024,0.000025270776,0.000011526609,0.0004548006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991325,0.00007658659,0.0001291432,0.00023533625,0.00012731824,0.00029908668],"domain_scores_gemma":[0.99928033,0.00023396016,0.000050786217,0.0002468533,0.00007618195,0.00011190438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029283084,0.000108688226,0.000114655515,0.000055605964,0.0002869758,0.000055484365,0.00029992659,0.000029147708,0.000014559798],"category_scores_gemma":[0.00003154201,0.00009581942,0.00007997751,0.00014935796,0.000025600872,0.00019005244,0.00006634399,0.0001437083,0.000040417977],"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.00004555002,0.0018882196,0.0071197534,0.000057525747,0.000081999104,0.000009484779,0.0037088073,0.022078063,0.022561949,0.20556912,0.0064780964,0.73040146],"study_design_scores_gemma":[0.0016190656,0.00036669307,0.01187692,0.000033671775,0.000077364304,0.000100390105,0.00006920925,0.6530304,0.017234283,0.005442195,0.30934766,0.0008021135],"about_ca_topic_score_codex":0.000017320932,"about_ca_topic_score_gemma":0.0000022102317,"teacher_disagreement_score":0.7295993,"about_ca_system_score_codex":0.00003673049,"about_ca_system_score_gemma":0.000056854133,"threshold_uncertainty_score":0.39074025},"labels":[],"label_agreement":null},{"id":"W2402441262","doi":"","title":"Meeting Scheduling Assembles Children in the Rectangular Forest.","year":2009,"lang":"en","type":"article","venue":"IAT","topic":"Mobile Agent-Based Network Management","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 Windsor","funders":"","keywords":"Negotiation; Scheduling (production processes); Computer science; Dynamic priority scheduling; Operations research; Distributed computing; Mathematical optimization; Mathematics; Computer network; Sociology","score_opus":0.009820983041604012,"score_gpt":0.23208009327153376,"score_spread":0.22225911022992975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402441262","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.8545291,0.0012733856,0.12919539,0.005764172,0.00027433515,0.0006222107,2.508368e-7,0.00021148479,0.008129682],"genre_scores_gemma":[0.9813526,0.000029830933,0.015887696,0.0025178075,0.0001662763,0.000015027495,0.0000016073701,0.0000047035255,0.00002444116],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99887556,0.000118902404,0.00016885302,0.00027709256,0.00027287667,0.0002867241],"domain_scores_gemma":[0.9992659,0.00007777664,0.00005988142,0.0005554273,0.000012539522,0.000028445014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007895491,0.00010070506,0.000090795256,0.000075951706,0.000092310154,0.00016047186,0.0010338953,0.000029126839,0.0000025778543],"category_scores_gemma":[0.000028262013,0.00007522435,0.00004677367,0.00045593776,0.000008346102,0.00019321684,0.00011371514,0.00011999225,0.000027228503],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015378226,0.0004831395,0.104424536,0.000028049024,0.00005588124,0.00033225855,0.0032416063,0.22139774,0.00067362457,0.16635124,0.014825828,0.4881707],"study_design_scores_gemma":[0.0012760314,0.0003585191,0.6052425,0.00030812365,0.000033313725,0.00004204998,0.00018307372,0.34404626,0.0012490507,0.03943257,0.006964726,0.0008637883],"about_ca_topic_score_codex":0.000059006503,"about_ca_topic_score_gemma":0.000050415565,"teacher_disagreement_score":0.50081795,"about_ca_system_score_codex":0.000046570418,"about_ca_system_score_gemma":0.000015791013,"threshold_uncertainty_score":0.306756},"labels":[],"label_agreement":null},{"id":"W2406920941","doi":"","title":"Effective Task Allocation for Evolving Multi-robot Teams in Dangerous Environments.","year":2013,"lang":"en","type":"article","venue":"IAT","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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 Manitoba","funders":"","keywords":"Robot; Task (project management); Computer science; Human–computer interaction; Unexpected events; Artificial intelligence; Engineering; Systems engineering","score_opus":0.008622387236154555,"score_gpt":0.21813800207851536,"score_spread":0.2095156148423608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406920941","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.1469031,0.0006977744,0.8506724,0.00003093202,0.0003435332,0.0010398887,0.0000029850567,0.000074982396,0.00023438684],"genre_scores_gemma":[0.992751,0.000042284497,0.0064728344,0.000028590863,0.00005621214,0.00040658025,0.000010179659,0.000024789952,0.00020750966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948525,0.000012017089,0.00012268055,0.00013681,0.000061723134,0.00018154208],"domain_scores_gemma":[0.99976015,0.000046588666,0.000014498405,0.00013601533,0.000008426635,0.000034341872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000071414885,0.00009704483,0.00009747216,0.000042110605,0.000024713327,0.00002295011,0.00008185817,0.00005595129,0.000042413492],"category_scores_gemma":[0.000023281347,0.000094027,0.00002946582,0.00004413661,0.00001152096,0.00013977382,0.000014428297,0.00007376136,0.0001830395],"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.000005153635,0.0001217143,0.0054860725,0.00012788187,0.000055524364,0.000003015008,0.002259357,0.30905053,0.28021336,0.00006977802,0.0013100074,0.40129763],"study_design_scores_gemma":[0.0006117367,0.00007620386,0.068783686,0.00007151422,0.000013802487,0.0000026985963,0.00015493287,0.86364645,0.061133806,0.00023577813,0.0048604407,0.00040893705],"about_ca_topic_score_codex":0.00017593523,"about_ca_topic_score_gemma":0.000051802843,"teacher_disagreement_score":0.8458479,"about_ca_system_score_codex":0.00012427663,"about_ca_system_score_gemma":0.000002249268,"threshold_uncertainty_score":0.38343096},"labels":[],"label_agreement":null},{"id":"W2479977663","doi":"","title":"Intelligent Agents in Mobile Vehicular Ad-Hoc Networks: Leveraging Trust Modeling Based on Direct Experience with Incentives for Honesty.","year":2010,"lang":"en","type":"article","venue":"IAT","topic":"Privacy-Preserving Technologies in Data","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 Ottawa; University of Waterloo","funders":"","keywords":"Honesty; Vehicular ad hoc network; Computer science; Wireless ad hoc network; Incentive; Computer security; Information exchange; Internet privacy; Wireless; Telecommunications; Microeconomics","score_opus":0.03818719188693399,"score_gpt":0.288973031096781,"score_spread":0.25078583920984704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479977663","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.4461074,0.00030095695,0.5518625,0.00048269195,0.00046562022,0.0004142046,0.0000031804711,0.00031677468,0.000046688987],"genre_scores_gemma":[0.88036084,0.00009513546,0.11896989,0.000182317,0.000034343815,0.00032283305,0.0000075465196,0.000019807474,0.0000072888524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981963,0.000042119696,0.00024646302,0.0007343883,0.00029793245,0.0004828154],"domain_scores_gemma":[0.99578196,0.00017502182,0.00008841108,0.0038299658,0.000058641494,0.00006598512],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00039575194,0.00021741021,0.00021387794,0.00017960263,0.00013703454,0.00016859072,0.008628114,0.00011626555,0.000006094362],"category_scores_gemma":[0.00114332,0.00018686014,0.00005230579,0.00048781847,0.00008554862,0.000513881,0.0065523176,0.00037074205,0.000005224756],"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.00024884316,0.000627603,0.024417434,0.00007468332,0.000039889823,0.00013073282,0.0024358197,0.7301117,0.0011049709,0.0002979873,0.0027031524,0.23780715],"study_design_scores_gemma":[0.00036606393,0.00011343581,0.0002902923,0.00012483042,0.0000027183537,0.0000019578042,0.000104119346,0.99218524,0.0029249324,0.001329337,0.002310926,0.0002461354],"about_ca_topic_score_codex":0.000018008655,"about_ca_topic_score_gemma":0.000038558283,"teacher_disagreement_score":0.43425345,"about_ca_system_score_codex":0.00010143028,"about_ca_system_score_gemma":0.000052142987,"threshold_uncertainty_score":0.9967357},"labels":[],"label_agreement":null}]}