{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012343704,0.00059275667,0.9827732,0.0009519464,0.00010705047,0.00030606502,0.00003562492,0.00013755099,0.013861357],"genre_scores_gemma":[0.07292307,0.00096965756,0.9168439,0.00046538524,0.00008586508,0.0010280141,0.00010600395,0.000060262584,0.007517892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683654,0.0016735352,0.00020014767,0.00039736225,0.0007887772,0.00010364894],"domain_scores_gemma":[0.9979196,0.0009073262,0.00025609985,0.0003675304,0.00030914586,0.000240203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003192659,0.0009865899,0.00069266843,0.0013438398,0.0019596284,0.004270555,0.0025750592,0.002865677,0.004656803],"category_scores_gemma":[0.0058432063,0.00067218946,0.00185894,0.0013813173,0.0025555233,0.0033792243,0.00337934,0.0030367363,0.0017400617],"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.000030051007,0.00014411709,0.00089687464,0.0007646578,0.0002310429,0.00064372283,0.0017861702,0.072745815,0.0051232544,0.859226,0.005469889,0.05293834],"study_design_scores_gemma":[0.00007696812,0.00018414596,0.00042147812,0.0004187984,0.00019212464,0.0008909614,0.0007537293,0.32917365,0.004719012,0.44688115,0.21616323,0.0001247298],"about_ca_topic_score_codex":0.0017098059,"about_ca_topic_score_gemma":0.0031015098,"teacher_disagreement_score":0.004656803,"about_ca_system_score_codex":0.0019744055,"about_ca_system_score_gemma":0.002651242,"threshold_uncertainty_score":0.016884625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010816754,0.00021603664,0.98583907,0.0002532929,0.00008234572,0.00013510526,0.00005457773,0.00084075984,0.0017621377],"genre_scores_gemma":[0.5774713,0.00029952714,0.41751024,0.00020448964,0.00011459813,0.0005660371,0.00020206766,0.000075759766,0.0035558518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993994,0.00017145507,0.000051769486,0.0001604271,0.00016802053,0.00004888403],"domain_scores_gemma":[0.99837625,0.00075810787,0.00019723612,0.00024146156,0.00029526057,0.00013163089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001426046,0.0005836719,0.00066745473,0.0005269972,0.00052420294,0.00122232,0.0018125855,0.001096093,0.0019499469],"category_scores_gemma":[0.0047863163,0.0003307428,0.000452891,0.0005652948,0.0006966182,0.0012766747,0.0013325798,0.0013435225,0.00050229434],"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.00028134018,0.00024692313,0.002559363,0.00021462773,0.00022363306,0.00039878002,0.00026350122,0.7762258,0.012255168,0.036728304,0.00447552,0.16612695],"study_design_scores_gemma":[0.000015463642,0.000023741564,0.00010244434,0.0000036383876,0.000007904136,0.000025166744,0.0000093804865,0.9939196,0.0006540507,0.0038490195,0.0013846385,0.0000049826995],"about_ca_topic_score_codex":0.0024767758,"about_ca_topic_score_gemma":0.0026478248,"teacher_disagreement_score":0.0024767758,"about_ca_system_score_codex":0.00064501574,"about_ca_system_score_gemma":0.0010815329,"threshold_uncertainty_score":0.007541716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008194468,0.000067346635,0.9889259,0.000070595845,0.000023318922,0.000066442415,0.000011681448,0.00040487913,0.0022354315],"genre_scores_gemma":[0.33874664,0.00009756527,0.6531349,0.0001450309,0.000021953309,0.0003531835,0.00007597493,0.00009230523,0.007332433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996123,0.00010839217,0.000019871803,0.00008565021,0.00014132216,0.00003244671],"domain_scores_gemma":[0.99940896,0.0002355022,0.000051716146,0.00010637352,0.00014378536,0.000053634463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086035987,0.000502257,0.00044336275,0.00044662284,0.00039813676,0.000529004,0.0016143634,0.0008956391,0.0033747547],"category_scores_gemma":[0.0019583893,0.00036470912,0.00051085115,0.0003104009,0.000766414,0.0007897192,0.00092485914,0.0009649604,0.0006807736],"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.00010841131,0.00026136334,0.0016148618,0.00012441527,0.00015125728,0.00021094654,0.00032508772,0.5930228,0.015061313,0.03928898,0.0023411426,0.34748942],"study_design_scores_gemma":[0.000010544391,0.000035399633,0.00009437704,0.000006253389,0.000010007841,0.000030413448,0.000009305695,0.99257445,0.0012175571,0.004888588,0.0011166994,0.000006458511],"about_ca_topic_score_codex":0.0030721289,"about_ca_topic_score_gemma":0.003920039,"teacher_disagreement_score":0.0033747547,"about_ca_system_score_codex":0.0004911808,"about_ca_system_score_gemma":0.00082787365,"threshold_uncertainty_score":0.011289656},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0217359,0.00014850653,0.95380706,0.000647777,0.00008353134,0.00015691938,0.00021050908,0.00029500326,0.02291484],"genre_scores_gemma":[0.38593423,0.00043549534,0.59813476,0.00018862281,0.00005843173,0.00026608453,0.00064542785,0.00027055806,0.014066415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756014,0.0010896081,0.0001300649,0.0005187371,0.00037058897,0.00033085013],"domain_scores_gemma":[0.9966022,0.00144344,0.0005066861,0.0007741071,0.00031737314,0.0003561703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029348473,0.00044717133,0.00056335446,0.00047948206,0.0022115158,0.002314809,0.0021001087,0.0011873286,0.0123563865],"category_scores_gemma":[0.007863278,0.00052756415,0.0010214365,0.001265496,0.0023118914,0.005255435,0.0024597698,0.0019069931,0.0019095188],"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.00015837501,0.00006329743,0.0020280955,0.00012947991,0.000022185293,0.0002707567,0.0009235674,0.06405078,0.0025461654,0.8796197,0.004641449,0.04554617],"study_design_scores_gemma":[0.000064684384,0.00023108313,0.0015416315,0.00011594977,0.000051410898,0.0008615468,0.002752842,0.31861806,0.0056105456,0.51456726,0.15549365,0.00009139445],"about_ca_topic_score_codex":0.011827797,"about_ca_topic_score_gemma":0.018073525,"teacher_disagreement_score":0.0123563865,"about_ca_system_score_codex":0.0015301076,"about_ca_system_score_gemma":0.0036649394,"threshold_uncertainty_score":0.041336298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03802136,0.0003149186,0.957114,0.00017996991,0.000054397467,0.00012114766,0.000025807063,0.00025657087,0.0039118542],"genre_scores_gemma":[0.6313781,0.00026505534,0.36387357,0.00009464882,0.00005182441,0.00033899958,0.00010447077,0.000093344366,0.0037999065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994497,0.00019832762,0.000027181834,0.00008432517,0.00015508014,0.00008542167],"domain_scores_gemma":[0.9993068,0.0002265489,0.000103723134,0.000119436976,0.000095265874,0.00014809583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011098159,0.00053084694,0.0005202259,0.00050422444,0.000788858,0.0007309953,0.0011452608,0.0005986297,0.0021532348],"category_scores_gemma":[0.0033959975,0.00023780503,0.00028868127,0.00034837867,0.00067079056,0.0011183284,0.0016021323,0.00064679387,0.00046703126],"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.00016498398,0.00018849417,0.0015785509,0.00015924078,0.000058042107,0.00016416189,0.0005284555,0.77334857,0.013472587,0.041899756,0.0033300545,0.16510715],"study_design_scores_gemma":[0.00003176043,0.00008813898,0.00036311056,0.0000141814835,0.000012240276,0.00006285033,0.00015238699,0.97104937,0.0017125804,0.021505909,0.00499732,0.000010102394],"about_ca_topic_score_codex":0.0015319634,"about_ca_topic_score_gemma":0.0020804526,"teacher_disagreement_score":0.0021532348,"about_ca_system_score_codex":0.0006352669,"about_ca_system_score_gemma":0.0008321322,"threshold_uncertainty_score":0.0072033405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05050487,0.0005305288,0.9418519,0.0014756192,0.00009568772,0.000103440296,0.000036981783,0.000101196,0.0052997936],"genre_scores_gemma":[0.9424912,0.00033384838,0.05566303,0.00008888571,0.000060939772,0.00008408157,0.000026273285,0.000015428648,0.001236334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939003,0.003985896,0.00033742364,0.00055102626,0.00094374723,0.00028163308],"domain_scores_gemma":[0.9822939,0.010575484,0.0030504598,0.0022778423,0.0011634434,0.0006388876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005813686,0.00080971076,0.0008452772,0.00055295357,0.0012009437,0.0029275725,0.0016715149,0.0019944496,0.0007969274],"category_scores_gemma":[0.027097575,0.000607898,0.00076484465,0.00057781907,0.0027161336,0.0059912503,0.0028652358,0.001962615,0.00021537386],"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.00023127446,0.00012905938,0.00762523,0.0002221711,0.00020154368,0.0006424881,0.0020491297,0.57981324,0.0026671593,0.36287028,0.001321404,0.04222698],"study_design_scores_gemma":[0.000027459124,0.00015761494,0.0005513671,0.000037898466,0.000053981938,0.00013638928,0.00015790817,0.88893795,0.0006514114,0.10674347,0.0025036212,0.00004083153],"about_ca_topic_score_codex":0.0025839182,"about_ca_topic_score_gemma":0.0025044528,"teacher_disagreement_score":0.005813686,"about_ca_system_score_codex":0.0012785303,"about_ca_system_score_gemma":0.001431332,"threshold_uncertainty_score":0.030746102},"labels":[],"label_agreement":null}]}