{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":7,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":7,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"d181755a8d15","filters":{"venue":"European Conference on Artificial Intelligence"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jordan Kidney","is_ca":true},{"name":"Jörg Denzinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2503280750124302,"gpt":0.3455471282710017,"spread":0.09521905325857155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01005692,0.0004391916,0.0004640524,0.0006239087,0.0005756228,0.001464687,0.0009581033,0.0009918441,0.001383492],"category_scores_gemma":[0.06540854,0.0003426593,0.0003771671,0.0002787455,0.002620141,0.003070864,0.00197226,0.001205363,0.0001081065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001115607,"about_ca_system_score_gemma":0.0007954722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001226938,"about_ca_topic_score_gemma":0.0007004227,"domain_scores_codex":[0.9946431,0.003552912,0.000234004,0.0004952456,0.0006729131,0.0004017423],"domain_scores_gemma":[0.8933727,0.09070778,0.005767865,0.005408156,0.002068104,0.002675483],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004731845,0.003380819,0.1857084,0.0006300174,0.000662516,0.0009144036,0.00414044,0.5857313,0.0336119,0.0952293,0.0005744424,0.08468469],"study_design_scores_gemma":[0.0001236893,0.001375281,0.01028197,0.00002795347,0.0000430845,0.0001142052,0.000647801,0.9370456,0.00655865,0.04340613,0.0003421016,0.00003354503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9818246,0.00001892172,0.01588237,0.000164131,0.000003428548,0.000029919,0.00001521813,0.00004076173,0.002020728],"genre_scores_gemma":[0.9959123,0.00001197618,0.003905869,0.0000127521,0.000002459644,0.00003368695,0.00001387841,0.000005181099,0.0001019084],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01005692,"threshold_uncertainty_score":0.05318677,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Necati Aras","is_ca":false},{"name":"İ. Kuban Altınel","is_ca":false},{"name":"B. John Oommen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1107698732265577,"gpt":0.3762386932067224,"spread":0.2654688199801648,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004579849,0.0006343627,0.000555634,0.0005262275,0.0005030161,0.000709094,0.0009161007,0.0007893227,0.002606213],"category_scores_gemma":[0.0007915565,0.0003435627,0.0008642771,0.0007225371,0.0003647446,0.001185375,0.0008861945,0.0008668479,0.0005892661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004261061,"about_ca_system_score_gemma":0.0008741816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005349743,"about_ca_topic_score_gemma":0.006811308,"domain_scores_codex":[0.9997615,0.0000556503,0.00001432463,0.00003749877,0.0001009211,0.00003012249],"domain_scores_gemma":[0.9998438,0.00005471199,0.00001341317,0.00001625061,0.00005703939,0.00001456518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001064291,0.0001046447,0.0005274676,0.0002770992,0.0001220662,0.00009947735,0.0001546152,0.5951224,0.008311996,0.0430481,0.005699412,0.3464263],"study_design_scores_gemma":[0.00001286239,0.0000281958,0.0001050133,0.00001222968,0.00001308756,0.00003987808,0.00003350707,0.9837896,0.001399389,0.009125496,0.00542805,0.0000126667],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004235869,0.0002598801,0.9916825,0.00009520912,0.00007351019,0.00004999792,0.00004280731,0.0001955761,0.003364589],"genre_scores_gemma":[0.1156824,0.0004592243,0.8778563,0.0001253274,0.00005255368,0.000163564,0.0001885323,0.0001074548,0.005364454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005349743,"threshold_uncertainty_score":0.01063722,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Pinata Winoto","is_ca":true},{"name":"Tiffany Y. Tang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3515268814406154,"gpt":0.4090583399620887,"spread":0.05753145852147329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008155693,0.0009495676,0.001913131,0.001123014,0.002809305,0.00443973,0.003439678,0.002364123,0.01761027],"category_scores_gemma":[0.022517,0.001048793,0.0009356854,0.001115692,0.0008902831,0.004416216,0.002553643,0.002208504,0.002200278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00178427,"about_ca_system_score_gemma":0.00309077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005092599,"about_ca_topic_score_gemma":0.007706255,"domain_scores_codex":[0.9973368,0.0009353166,0.0002033748,0.0004301078,0.0004713693,0.0006229437],"domain_scores_gemma":[0.9795389,0.01165711,0.001939312,0.001310579,0.001990991,0.003563112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.005750257,0.001382114,0.03072583,0.0008039701,0.0008111958,0.002157322,0.00403036,0.4635932,0.02181066,0.3455773,0.01464321,0.1087146],"study_design_scores_gemma":[0.0003405696,0.0005613783,0.001923007,0.00002736749,0.0001167301,0.0002340144,0.0005974231,0.9241704,0.00109749,0.06633206,0.004496177,0.0001033668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4794309,0.0006404967,0.499752,0.002867581,0.0003049162,0.0006852107,0.0003785235,0.0005812369,0.01535907],"genre_scores_gemma":[0.9382885,0.0002310924,0.04735452,0.0002095257,0.0001436793,0.0002772143,0.0002187878,0.0000756005,0.01320099],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01761027,"threshold_uncertainty_score":0.05891228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Eugenia Ternovskaia","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07881972697231922,"gpt":0.2912606658914988,"spread":0.2124409389191796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00806309,0.001026058,0.001302211,0.003514571,0.004263339,0.008262356,0.003031039,0.002929243,0.009217083],"category_scores_gemma":[0.01109717,0.00105048,0.003209166,0.004105544,0.008337888,0.01869275,0.0067042,0.007797945,0.001339661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005139765,"about_ca_system_score_gemma":0.002283853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005225651,"about_ca_topic_score_gemma":0.003568362,"domain_scores_codex":[0.9955239,0.001488573,0.0005405123,0.0006358765,0.001204761,0.0006062273],"domain_scores_gemma":[0.9927655,0.005339926,0.0003608686,0.0005726088,0.000607259,0.0003538287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001381431,0.00001103209,0.0001010093,0.00005103696,0.00001060108,0.0001276679,0.0001921357,0.0008669839,0.00006813366,0.9929628,0.0008954156,0.004699385],"study_design_scores_gemma":[0.00001082989,0.000004432255,0.00003161561,0.00001679888,0.000007861983,0.00008613411,0.0000686871,0.004136902,0.00008396911,0.9920872,0.003456889,0.000008757144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03936784,0.005274005,0.8488614,0.01654188,0.0006436507,0.0002736937,0.001013615,0.0007861716,0.08723782],"genre_scores_gemma":[0.5540468,0.003983474,0.4148394,0.002379306,0.0009271845,0.0005092315,0.00144928,0.0001787306,0.02168662],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009217083,"threshold_uncertainty_score":0.04264224,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mikhail Soutchanski","is_ca":true},{"name":"Huy Pham","is_ca":true},{"name":"John Mylopoulos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07349378794973954,"gpt":0.3297981698350874,"spread":0.2563043818853478,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003897396,0.0006066114,0.0007599519,0.001100943,0.002357208,0.00174069,0.001059597,0.00203918,0.004282061],"category_scores_gemma":[0.0190542,0.0004544534,0.0008735084,0.001738036,0.001456258,0.0009864658,0.001283729,0.001816244,0.0004742278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001324538,"about_ca_system_score_gemma":0.001199359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009011409,"about_ca_topic_score_gemma":0.01025709,"domain_scores_codex":[0.9972549,0.001842692,0.0001694824,0.0002047841,0.0002304654,0.0002975691],"domain_scores_gemma":[0.9794806,0.01592768,0.00154487,0.0011608,0.0006824277,0.001203571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.005807345,0.03638899,0.7160549,0.0007750912,0.0009140427,0.1231865,0.01926233,0.01018831,0.00111696,0.0107807,0.007651,0.06787377],"study_design_scores_gemma":[0.004405911,0.01349562,0.5118054,0.001174894,0.0009377502,0.2112752,0.06861846,0.1302206,0.002858478,0.03625164,0.01841018,0.0005458959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9972979,0.0003472918,0.0007842698,0.0002809556,0.000006133164,0.0000852969,0.0001126948,0.000004784966,0.001080576],"genre_scores_gemma":[0.9977039,0.0002722171,0.001437044,0.00006426226,0.000008648551,0.0000671836,0.000103893,0.000003692093,0.0003392436],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009011409,"threshold_uncertainty_score":0.02061164,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Default; Computer science; Artificial intelligence; Business","authors":[{"name":"Hector J. Levesque","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.090144276540674,"gpt":0.2733590691706647,"spread":0.1832147926299907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01103432,0.000460499,0.001328253,0.002015344,0.004067715,0.009525297,0.00145707,0.009007301,0.01226711],"category_scores_gemma":[0.05018531,0.0007265419,0.0007827171,0.001738002,0.01686592,0.02311851,0.002393447,0.01122472,0.001535748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0033198,"about_ca_system_score_gemma":0.001440822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002037363,"about_ca_topic_score_gemma":0.001327728,"domain_scores_codex":[0.9914864,0.004047758,0.0005501862,0.001802418,0.001584786,0.0005284014],"domain_scores_gemma":[0.9633384,0.02735885,0.001379811,0.004110443,0.003147864,0.0006646441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007946374,0.00001498354,0.0004355855,0.0000620335,0.00002010051,0.00009675335,0.000689722,0.0002460899,0.00006477376,0.9751305,0.01548447,0.007675526],"study_design_scores_gemma":[0.00001420336,0.000003349525,0.000119203,0.00003294483,0.000007890637,0.00003859799,0.000136022,0.0003194412,0.00003976843,0.9892526,0.01003058,0.000005353507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.05019233,0.02782059,0.06507821,0.5160576,0.005287294,0.00004945414,0.001530073,0.0002534673,0.3337311],"genre_scores_gemma":[0.9507607,0.005190902,0.006207174,0.01728698,0.006152394,0.00006828832,0.000553579,0.0001013222,0.0136787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01226711,"threshold_uncertainty_score":0.05835581,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mihai Barbuceanu","is_ca":true},{"name":"Wai-Kau Lo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1271709555850251,"gpt":0.3027859015165305,"spread":0.1756149459315053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008219308,0.0007899849,0.001263169,0.001885902,0.001784634,0.006811805,0.004058767,0.002515774,0.004490375],"category_scores_gemma":[0.01143672,0.0009816665,0.002628904,0.002114353,0.005021107,0.01234314,0.004309216,0.003758789,0.0007674844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003201155,"about_ca_system_score_gemma":0.004519739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00952146,"about_ca_topic_score_gemma":0.01042951,"domain_scores_codex":[0.9935249,0.002703667,0.0005524866,0.0008590183,0.001845765,0.0005141789],"domain_scores_gemma":[0.993562,0.003095241,0.000813935,0.001531905,0.0006444045,0.0003525433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002784894,0.00005943401,0.00060332,0.0001219094,0.00009653231,0.000160654,0.0004705511,0.155319,0.000613074,0.8153845,0.0009632608,0.02617993],"study_design_scores_gemma":[0.00001860057,0.00002150594,0.0001531993,0.00003335982,0.00004674971,0.00004916477,0.0001572487,0.4510357,0.0007190267,0.5425183,0.00521937,0.00002778268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003607887,0.0001183163,0.9903427,0.0007997335,0.00002197444,0.00006565827,0.00003603054,0.0001930897,0.004814637],"genre_scores_gemma":[0.2561464,0.0003293645,0.7404695,0.0002803354,0.0000761908,0.0002422699,0.0001573097,0.00009651262,0.002202122],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00952146,"threshold_uncertainty_score":0.04346836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}