{"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":"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.0014416011,0.0001759918,0.9224208,0.0075724316,0.00023956926,0.0008284853,0.0000024374149,0.00013576627,0.06718291],"genre_scores_gemma":[0.99535,0.00026218212,0.0019547732,0.00073879486,0.00017619338,0.000056546018,0.0000037449197,0.000010812951,0.0014469512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835247,0.0003876188,0.00033610314,0.00045339225,0.0002026737,0.0002677622],"domain_scores_gemma":[0.9985082,0.0005774107,0.00012037815,0.0005613485,0.00016982527,0.000062820705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015718134,0.00016786366,0.00013506477,0.00003542661,0.00069053296,0.00060137175,0.0010599456,0.00003305072,0.00011458418],"category_scores_gemma":[0.00022162698,0.00009049514,0.00006302452,0.00024226075,0.0003784217,0.00018903984,0.00009209384,0.00017258851,0.0007768585],"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.00003497969,0.000023054701,0.0000010693506,0.0000023289208,0.000003993708,7.6279736e-7,0.0016561461,0.00017375803,0.00010535871,0.5704752,0.000101789694,0.42742154],"study_design_scores_gemma":[0.00017111907,0.00024439662,0.00043278217,0.000035486777,0.000023291133,0.000010902901,0.0004025113,0.74573827,0.0027496098,0.23588835,0.014001296,0.00030199636],"about_ca_topic_score_codex":0.000029795941,"about_ca_topic_score_gemma":0.000042887797,"teacher_disagreement_score":0.9939084,"about_ca_system_score_codex":0.000019018513,"about_ca_system_score_gemma":0.000051268547,"threshold_uncertainty_score":0.9985203},"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":"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.0001364752,0.000058759597,0.9754575,0.003392072,0.00038188562,0.0008990545,0.000012828743,0.00023180156,0.019429611],"genre_scores_gemma":[0.17546797,0.00035896577,0.81849295,0.0014017173,0.0003477509,0.0001212099,0.000022714226,0.00006832259,0.0037183878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964073,0.0008543801,0.0007430866,0.0008402077,0.0005727174,0.0005823247],"domain_scores_gemma":[0.99725163,0.001043839,0.00015730182,0.0009925598,0.00035319218,0.00020149887],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0023666585,0.0002995902,0.00025532788,0.00013270347,0.00066994416,0.0009900723,0.0021963145,0.000051658284,0.0012210517],"category_scores_gemma":[0.00015796858,0.00023566654,0.00014629925,0.00062750647,0.00016039719,0.00030521053,0.00017294516,0.00038167683,0.0023157028],"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.000060458995,0.000118074066,5.131996e-7,0.000009397104,0.000021867903,0.000014087846,0.0007009565,0.0233527,0.0005791508,0.120523624,0.00026786546,0.8543513],"study_design_scores_gemma":[0.00007221663,0.0002555154,0.00003819004,0.00005479262,0.000012811468,0.000020281217,0.0000851205,0.9699511,0.0036279545,0.014045563,0.011538015,0.0002984543],"about_ca_topic_score_codex":0.000024271685,"about_ca_topic_score_gemma":0.000015661188,"teacher_disagreement_score":0.9465984,"about_ca_system_score_codex":0.00005031876,"about_ca_system_score_gemma":0.000115599876,"threshold_uncertainty_score":0.99969196},"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":"other","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.016614497,0.000048659796,0.021570573,0.0027173427,0.0026328866,0.00016790208,0.0000066865364,0.00021804936,0.9560234],"genre_scores_gemma":[0.99423206,0.000030331308,0.00006153298,0.0008659403,0.0029861594,0.0000049040436,0.000019186677,0.000027766886,0.0017721017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851954,0.00003818469,0.00044993308,0.00033227267,0.0003338148,0.00032626782],"domain_scores_gemma":[0.9990241,0.00021192858,0.0001980469,0.00029584466,0.0002549056,0.000015201608],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004890627,0.0001857587,0.00011584298,0.00008005387,0.0004553205,0.0010571433,0.0006723808,0.000027898257,0.0003545414],"category_scores_gemma":[0.00051271415,0.00013663898,0.00007970314,0.0001814999,0.0003772844,0.00028458872,0.00010639588,0.0001850758,0.00728847],"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.000036432062,0.00006313317,0.00009583543,0.0000055544506,0.000005300572,0.000016866537,0.000014626804,0.00021748609,0.00014624138,0.95225596,0.0025677928,0.044574752],"study_design_scores_gemma":[0.00009400297,0.00006317423,0.010065675,0.00014133091,0.000031974367,0.0000035761475,0.0005159011,0.03945829,0.0031143394,0.5632518,0.38253587,0.0007240989],"about_ca_topic_score_codex":0.00022781812,"about_ca_topic_score_gemma":0.00022634341,"teacher_disagreement_score":0.97761756,"about_ca_system_score_codex":0.000022156695,"about_ca_system_score_gemma":0.000019008998,"threshold_uncertainty_score":0.99997985},"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":"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.27485713,0.000037733094,0.7100264,0.000100292564,0.00031303463,0.00026640418,0.000002838125,0.0001926535,0.014203554],"genre_scores_gemma":[0.9833424,0.0000104368855,0.016187573,0.00021445323,0.0001268257,0.000014549853,0.000001223924,0.000026473559,0.000076037126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644476,0.0005457307,0.0008763937,0.0010128198,0.00048561543,0.0006346558],"domain_scores_gemma":[0.99836713,0.00020778873,0.00016691472,0.00097335613,0.0001721463,0.00011264706],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015923833,0.00033156967,0.00029227728,0.00033969176,0.00028968713,0.00065429386,0.0012523255,0.000060537215,0.00007200539],"category_scores_gemma":[0.000093437906,0.0003171662,0.00008019502,0.0008431098,0.00007821073,0.00046311095,0.00040512256,0.0004776138,0.0009080545],"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.000063110616,0.0018733676,0.0011852944,0.000008872889,0.00000608846,0.012954247,0.0052013556,0.0055050123,0.0002855752,0.3126453,0.000079357196,0.66019243],"study_design_scores_gemma":[0.00026105862,0.00092699064,0.0023786866,0.00046230294,0.000012555342,0.000696817,0.006408706,0.81509215,0.0011089166,0.17118703,0.0003174979,0.0011472785],"about_ca_topic_score_codex":0.00019030056,"about_ca_topic_score_gemma":0.0028085082,"teacher_disagreement_score":0.8095871,"about_ca_system_score_codex":0.000070545204,"about_ca_system_score_gemma":0.00008204017,"threshold_uncertainty_score":0.99992806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15773112,0.000014649699,0.56888103,0.0038653498,0.00027687353,0.0010798923,0.00004079757,0.00010912201,0.26800117],"genre_scores_gemma":[0.99436486,0.000008374413,0.00062824297,0.00047196657,0.00013137906,0.000071167015,0.0000075303583,0.000020219708,0.0042962627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708,0.00058948837,0.000911877,0.00068477675,0.00042606084,0.00030779574],"domain_scores_gemma":[0.9975355,0.0010880567,0.00026761403,0.0006027632,0.0003726831,0.00013335983],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0024176713,0.00018680115,0.00022386463,0.00026200592,0.0004682355,0.00037371935,0.0009276736,0.000043678487,0.0020012897],"category_scores_gemma":[0.0022743444,0.00016500671,0.00008934162,0.00089033,0.00031800504,0.00022145755,0.0000963566,0.00025608932,0.0047053657],"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.00007717659,0.00058192696,0.0004674352,0.000004498941,0.000013056102,0.000013617962,0.014637857,0.018305384,0.001940257,0.5920037,0.0039796988,0.3679754],"study_design_scores_gemma":[0.00018174348,0.00038045965,0.0043797977,0.00021268407,0.00001475565,0.00000574175,0.032417633,0.80463254,0.018316394,0.09816907,0.04042574,0.0008634394],"about_ca_topic_score_codex":0.000018478071,"about_ca_topic_score_gemma":0.00018063557,"teacher_disagreement_score":0.83663374,"about_ca_system_score_codex":0.000038653066,"about_ca_system_score_gemma":0.000025117895,"threshold_uncertainty_score":0.998911},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022867277,0.000022198783,0.9566873,0.0009082706,0.00029254184,0.00038349527,0.000023186449,0.00013201055,0.01868377],"genre_scores_gemma":[0.9747854,0.000024763662,0.022971028,0.00026074573,0.00014946368,0.000012987963,0.000025594913,0.000019065661,0.0017509673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831563,0.00024013699,0.0004322577,0.0004975105,0.00028212497,0.00023232818],"domain_scores_gemma":[0.99910676,0.0001562467,0.00015268325,0.0002623994,0.00022496273,0.00009697266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093682716,0.00017822505,0.000141346,0.00010592052,0.00033709497,0.0005550307,0.0004865472,0.000039286828,0.00052424264],"category_scores_gemma":[0.00029511203,0.00016933047,0.000036352332,0.00026663658,0.000049845115,0.00035265376,0.000078190205,0.00012207394,0.00022555175],"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.000017115006,0.000060190116,0.00015775964,0.000012363482,0.000011196207,0.0000038478115,0.001705269,0.00011337019,0.0011692734,0.45639533,0.00085751904,0.5394968],"study_design_scores_gemma":[0.0001685911,0.00038716412,0.009521957,0.00036218588,0.000017871871,0.000020769632,0.00062591134,0.95244426,0.013994975,0.015513186,0.0062394035,0.0007037159],"about_ca_topic_score_codex":0.00002170077,"about_ca_topic_score_gemma":0.000023164146,"teacher_disagreement_score":0.9523309,"about_ca_system_score_codex":0.000037187332,"about_ca_system_score_gemma":0.00005871778,"threshold_uncertainty_score":0.69050956},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7645168,0.00002702031,0.23212214,0.00004103284,0.00022943266,0.00037225697,0.0000026697871,0.000033303815,0.0026553608],"genre_scores_gemma":[0.99730605,0.000004907755,0.0025318025,0.0000114525965,0.000055204637,0.000010822665,0.0000019834697,0.0000129314985,0.000064841886],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977811,0.00051583967,0.00081405655,0.000345481,0.00031708184,0.00022644155],"domain_scores_gemma":[0.9987073,0.00015243348,0.00043325708,0.00034003268,0.00033069414,0.000036303536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007653299,0.0001624292,0.0002088091,0.00014325553,0.00013505903,0.0000770253,0.00060776935,0.000031869582,0.000038218976],"category_scores_gemma":[0.00019275522,0.00013023363,0.000056128956,0.0005704694,0.00010559887,0.00017400159,0.000114174865,0.00021959035,0.00004157802],"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.00001824412,0.0005603856,0.017993333,0.000023022983,0.000005696395,0.000044597306,0.0023860603,0.034668725,0.68669754,0.16494852,0.0000066169932,0.09264726],"study_design_scores_gemma":[0.00008610122,0.00052748265,0.119819626,0.00042068854,0.000028645252,0.000012645793,0.000918644,0.4814421,0.395918,0.00035238217,0.000049495582,0.00042418833],"about_ca_topic_score_codex":0.00061763485,"about_ca_topic_score_gemma":0.00011350917,"teacher_disagreement_score":0.44677335,"about_ca_system_score_codex":0.000032927663,"about_ca_system_score_gemma":0.000069881055,"threshold_uncertainty_score":0.5310773},"labels":[],"label_agreement":null}]}