{"meta":{"query_hash":"d181755a8d15","filters":{"venue":"European Conference on Artificial Intelligence"},"cohort_total":7,"direct_labels_cover":0,"predictions_cover":7,"exported":7,"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/d181755a8d15","api":"https://metacan.xera.ac/api/v1/cohort?venue=European+Conference+on+Artificial+Intelligence"},"results":[{"id":"W12780597","doi":"10.1046/j.1463-1318.2002.00351.x","title":"ID-logic and the ramification problem for the situation calculus","year":2000,"lang":"en","type":"article","venue":"European Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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 Toronto","funders":"","keywords":"Successor cardinal; Axiom; Negation; Mathematics; Inductive logic programming; Autoepistemic logic; Calculus (dental); Computer science; Algebra over a field; Multimodal logic; Theoretical computer science; Artificial intelligence; Description logic; Programming language; Pure mathematics","score_opus":0.07881972697231922,"score_gpt":0.2912606658914988,"score_spread":0.2124409389191796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12780597","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039367836,0.0052740052,0.8488614,0.016541876,0.00064365065,0.00027369373,0.0010136152,0.0007861716,0.08723782],"genre_scores_gemma":[0.5540468,0.003983474,0.4148394,0.0023793057,0.0009271845,0.00050923147,0.0014492798,0.00017873064,0.021686615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955239,0.0014885729,0.0005405123,0.0006358765,0.0012047613,0.00060622726],"domain_scores_gemma":[0.99276555,0.005339926,0.00036086858,0.00057260884,0.000607259,0.00035382865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00806309,0.0010260576,0.0013022113,0.0035145713,0.004263339,0.008262356,0.0030310391,0.0029292433,0.009217083],"category_scores_gemma":[0.011097167,0.0010504804,0.0032091665,0.004105544,0.008337888,0.01869275,0.0067041996,0.0077979453,0.0013396606],"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.000013814313,0.000011032086,0.00010100934,0.00005103696,0.000010601079,0.00012766792,0.00019213575,0.0008669839,0.00006813366,0.9929628,0.0008954156,0.004699385],"study_design_scores_gemma":[0.0000108298855,0.0000044322546,0.00003161561,0.000016798884,0.000007861983,0.00008613411,0.0000686871,0.0041369023,0.00008396911,0.9920872,0.0034568887,0.000008757144],"about_ca_topic_score_codex":0.0052256505,"about_ca_topic_score_gemma":0.0035683622,"teacher_disagreement_score":0.009217083,"about_ca_system_score_codex":0.005139765,"about_ca_system_score_gemma":0.0022838525,"threshold_uncertainty_score":0.042642236},"labels":[],"label_agreement":null},{"id":"W136384337","doi":"","title":"A Kohonen-like decomposition method for the traveling salesman problem—KNIES_DECOMPOSE","year":2000,"lang":"en","type":"article","venue":"European Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Travelling salesman problem; Euclidean geometry; Partition (number theory); 2-opt; Heuristic; Self-organizing map; Computer science; Mathematical optimization; Bottleneck traveling salesman problem; Decomposition; Artificial neural network; Traveling purchaser problem; Euclidean distance; Mathematics; Algorithm; Artificial intelligence; Combinatorics","score_opus":0.11076987322655765,"score_gpt":0.37623869320672243,"score_spread":0.2654688199801648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136384337","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.0042358693,0.00025988012,0.9916825,0.00009520912,0.000073510186,0.000049997918,0.000042807307,0.00019557605,0.0033645888],"genre_scores_gemma":[0.11568244,0.00045922433,0.8778563,0.00012532735,0.000052553678,0.00016356402,0.00018853233,0.00010745476,0.0053644544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997615,0.000055650296,0.000014324628,0.000037498772,0.00010092114,0.000030122492],"domain_scores_gemma":[0.99984384,0.000054711985,0.0000134131715,0.000016250615,0.00005703939,0.000014565178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045798492,0.0006343627,0.00055563403,0.00052622746,0.0005030161,0.00070909405,0.00091610075,0.0007893227,0.0026062129],"category_scores_gemma":[0.0007915565,0.00034356274,0.0008642771,0.0007225371,0.0003647446,0.0011853747,0.0008861945,0.00086684787,0.00058926607],"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.00010642907,0.00010464472,0.00052746764,0.00027709917,0.000122066216,0.00009947735,0.0001546152,0.5951224,0.008311996,0.043048102,0.0056994115,0.3464263],"study_design_scores_gemma":[0.000012862391,0.000028195798,0.00010501326,0.000012229681,0.000013087564,0.00003987808,0.000033507073,0.9837896,0.0013993894,0.009125496,0.00542805,0.000012666698],"about_ca_topic_score_codex":0.0053497427,"about_ca_topic_score_gemma":0.0068113077,"teacher_disagreement_score":0.0053497427,"about_ca_system_score_codex":0.00042610613,"about_ca_system_score_gemma":0.00087418157,"threshold_uncertainty_score":0.010637224},"labels":[],"label_agreement":null},{"id":"W2180860563","doi":"","title":"The Truth about Defaults","year":2006,"lang":"en","type":"article","venue":"European Conference on Artificial Intelligence","topic":"Law, logistics, and international trade","field":"Business, Management and Accounting","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":"University of Toronto","funders":"","keywords":"Default; Computer science; Artificial intelligence; Business","score_opus":0.090144276540674,"score_gpt":0.2733590691706647,"score_spread":0.1832147926299907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180860563","genre_codex":"commentary","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.050192326,0.027820595,0.065078214,0.51605755,0.0052872943,0.00004945414,0.0015300729,0.0002534673,0.33373106],"genre_scores_gemma":[0.95076066,0.005190902,0.0062071737,0.017286982,0.006152394,0.00006828832,0.00055357895,0.00010132218,0.0136787025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99148643,0.0040477584,0.0005501862,0.0018024185,0.0015847865,0.0005284014],"domain_scores_gemma":[0.9633384,0.027358849,0.0013798111,0.004110443,0.003147864,0.0006646441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011034319,0.000460499,0.0013282533,0.002015344,0.004067715,0.009525297,0.00145707,0.009007301,0.012267109],"category_scores_gemma":[0.05018531,0.00072654185,0.00078271714,0.0017380022,0.016865924,0.023118505,0.0023934473,0.011224719,0.0015357485],"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.00007946374,0.000014983543,0.00043558548,0.0000620335,0.00002010051,0.00009675335,0.000689722,0.00024608985,0.00006477376,0.9751305,0.015484469,0.0076755257],"study_design_scores_gemma":[0.000014203364,0.0000033495253,0.00011920298,0.000032944827,0.000007890637,0.000038597995,0.00013602196,0.0003194412,0.000039768427,0.9892526,0.010030583,0.000005353507],"about_ca_topic_score_codex":0.0020373634,"about_ca_topic_score_gemma":0.0013277277,"teacher_disagreement_score":0.012267109,"about_ca_system_score_codex":0.0033197997,"about_ca_system_score_gemma":0.001440822,"threshold_uncertainty_score":0.05835581},"labels":[],"label_agreement":null},{"id":"W31377030","doi":"10.1016/j.aller.2019.03.004","title":"Decision making in large-scale domains: a case study","year":2006,"lang":"en","type":"article","venue":"European Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","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 Toronto; Toronto Metropolitan University","funders":"","keywords":"Computer science; Markov decision process; Domain (mathematical analysis); Set (abstract data type); Situation calculus; Answer set programming; Representation (politics); Theoretical computer science; Mathematical optimization; Artificial intelligence; Markov process; Programming language; Mathematics","score_opus":0.07349378794973954,"score_gpt":0.32979816983508736,"score_spread":0.2563043818853478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31377030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99729794,0.00034729182,0.00078426977,0.00028095557,0.000006133164,0.000085296895,0.000112694805,0.0000047849658,0.0010805764],"genre_scores_gemma":[0.99770385,0.00027221715,0.0014370441,0.00006426226,0.000008648551,0.000067183595,0.00010389298,0.0000036920933,0.00033924365],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972549,0.0018426917,0.00016948237,0.00020478405,0.00023046545,0.00029756915],"domain_scores_gemma":[0.9794806,0.015927676,0.00154487,0.0011607998,0.00068242766,0.0012035705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038973964,0.0006066114,0.0007599519,0.0011009428,0.0023572082,0.0017406895,0.0010595971,0.0020391801,0.0042820615],"category_scores_gemma":[0.019054204,0.0004544534,0.0008735084,0.001738036,0.0014562578,0.0009864658,0.001283729,0.0018162444,0.00047422777],"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.005807345,0.03638899,0.7160549,0.00077509123,0.0009140427,0.123186484,0.01926233,0.0101883095,0.0011169598,0.010780701,0.007651,0.06787377],"study_design_scores_gemma":[0.004405911,0.01349562,0.51180536,0.0011748944,0.00093775016,0.21127523,0.06861846,0.1302206,0.002858478,0.03625164,0.018410183,0.00054589595],"about_ca_topic_score_codex":0.009011409,"about_ca_topic_score_gemma":0.010257094,"teacher_disagreement_score":0.009011409,"about_ca_system_score_codex":0.0013245379,"about_ca_system_score_gemma":0.0011993587,"threshold_uncertainty_score":0.020611644},"labels":[],"label_agreement":null},{"id":"W38575530","doi":"10.1111/acer.15309","title":"Competing in a queue for resource allocations among non-cooperative agents","year":2002,"lang":"en","type":"article","venue":"European Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":3,"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 Saskatchewan","funders":"Canadian Institutes of Health Research","keywords":"Computer science; Queue; Queueing theory; Nash equilibrium; Scheduling (production processes); Service (business); Resource allocation; Operations research; Mathematical optimization; Computer network; Economics; Mathematics","score_opus":0.3515268814406154,"score_gpt":0.4090583399620887,"score_spread":0.05753145852147329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38575530","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.47943094,0.0006404967,0.49975199,0.0028675809,0.0003049162,0.00068521075,0.00037852355,0.0005812369,0.015359071],"genre_scores_gemma":[0.9382885,0.00023109236,0.04735452,0.00020952572,0.00014367925,0.0002772143,0.0002187878,0.0000756005,0.013200993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973368,0.0009353166,0.00020337479,0.0004301078,0.0004713693,0.00062294374],"domain_scores_gemma":[0.97953886,0.011657109,0.001939312,0.0013105795,0.0019909914,0.003563112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008155693,0.00094956765,0.001913131,0.001123014,0.0028093047,0.00443973,0.0034396776,0.0023641225,0.01761027],"category_scores_gemma":[0.022517003,0.0010487925,0.00093568536,0.0011156922,0.00089028315,0.004416216,0.0025536427,0.0022085044,0.0022002785],"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.0057502566,0.0013821136,0.03072583,0.0008039701,0.00081119576,0.0021573224,0.0040303604,0.4635932,0.021810664,0.34557733,0.014643206,0.108714566],"study_design_scores_gemma":[0.00034056965,0.0005613783,0.001923007,0.000027367494,0.00011673007,0.00023401438,0.0005974231,0.92417043,0.0010974898,0.06633206,0.004496177,0.000103366816],"about_ca_topic_score_codex":0.005092599,"about_ca_topic_score_gemma":0.0077062547,"teacher_disagreement_score":0.01761027,"about_ca_system_score_codex":0.0017842699,"about_ca_system_score_gemma":0.0030907702,"threshold_uncertainty_score":0.058912277},"labels":[],"label_agreement":null},{"id":"W5186172","doi":"","title":"Integrating individual, organizational and market level reasoning for agent coordination","year":2000,"lang":"en","type":"article","venue":"European Conference on Artificial Intelligence","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":"University of Toronto","funders":"","keywords":"Computer science; Multi-agent system; Knowledge management; Constraint (computer-aided design); Control (management); Management science; Artificial intelligence; Engineering","score_opus":0.12717095558502514,"score_gpt":0.30278590151653045,"score_spread":0.1756149459315053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5186172","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.0036078868,0.000118316275,0.99034274,0.0007997335,0.000021974442,0.00006565827,0.00003603054,0.00019308974,0.0048146374],"genre_scores_gemma":[0.2561464,0.00032936453,0.7404695,0.00028033537,0.0000761908,0.00024226989,0.00015730967,0.00009651262,0.002202122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935249,0.002703667,0.0005524866,0.0008590183,0.0018457647,0.0005141789],"domain_scores_gemma":[0.993562,0.0030952415,0.000813935,0.0015319049,0.0006444045,0.00035254328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008219308,0.00078998494,0.0012631695,0.0018859018,0.0017846343,0.006811805,0.004058767,0.0025157735,0.004490375],"category_scores_gemma":[0.011436724,0.0009816665,0.0026289043,0.002114353,0.005021107,0.012343143,0.0043092156,0.0037587888,0.00076748437],"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.000027848935,0.00005943401,0.00060332,0.00012190938,0.000096532305,0.00016065405,0.00047055108,0.15531896,0.000613074,0.8153845,0.0009632608,0.026179926],"study_design_scores_gemma":[0.000018600575,0.000021505943,0.00015319929,0.000033359822,0.00004674971,0.000049164766,0.00015724865,0.4510357,0.00071902666,0.5425183,0.0052193697,0.000027782678],"about_ca_topic_score_codex":0.00952146,"about_ca_topic_score_gemma":0.010429514,"teacher_disagreement_score":0.00952146,"about_ca_system_score_codex":0.0032011548,"about_ca_system_score_gemma":0.0045197387,"threshold_uncertainty_score":0.043468356},"labels":[],"label_agreement":null},{"id":"W6301683","doi":"10.1016/0092-8674(83)90302-1","title":"Testing the limits of emergent behavior in MAS using learning of cooperative behavior","year":2006,"lang":"en","type":"article","venue":"European Conference on Artificial Intelligence","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Test (biology); Class (philosophy); Artificial intelligence; Multi-agent system; Intelligent agent; Human–computer interaction","score_opus":0.25032807501243015,"score_gpt":0.3455471282710017,"score_spread":0.09521905325857155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6301683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818246,0.00001892172,0.015882373,0.00016413104,0.0000034285479,0.000029919003,0.000015218131,0.000040761734,0.0020207283],"genre_scores_gemma":[0.99591225,0.000011976175,0.003905869,0.000012752099,0.0000024596436,0.000033686945,0.000013878412,0.0000051810994,0.00010190842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946431,0.0035529118,0.00023400395,0.0004952456,0.0006729131,0.00040174235],"domain_scores_gemma":[0.8933727,0.09070778,0.005767865,0.0054081557,0.0020681042,0.0026754825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01005692,0.00043919164,0.00046405243,0.00062390865,0.0005756228,0.0014646867,0.00095810334,0.0009918441,0.0013834923],"category_scores_gemma":[0.065408535,0.00034265927,0.00037716713,0.0002787455,0.0026201408,0.0030708644,0.0019722597,0.0012053634,0.000108106455],"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.004731845,0.0033808185,0.18570837,0.00063001737,0.000662516,0.00091440364,0.0041404404,0.58573127,0.033611905,0.0952293,0.00057444244,0.08468469],"study_design_scores_gemma":[0.00012368929,0.0013752806,0.010281974,0.000027953472,0.000043084503,0.0001142052,0.000647801,0.9370456,0.00655865,0.043406133,0.00034210156,0.000033545028],"about_ca_topic_score_codex":0.0012269375,"about_ca_topic_score_gemma":0.00070042274,"teacher_disagreement_score":0.01005692,"about_ca_system_score_codex":0.0011156066,"about_ca_system_score_gemma":0.0007954722,"threshold_uncertainty_score":0.053186774},"labels":[],"label_agreement":null}]}