{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007653299,0.0001624292,0.0002088091,0.0001432555,0.000135059,0.0000770253,0.0006077694,0.00003186958,0.00003821898],"category_scores_gemma":[0.0001927552,0.0001302336,0.00005612896,0.0005704694,0.0001055989,0.0001740016,0.0001141749,0.0002195904,0.00004157802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003292766,"about_ca_system_score_gemma":0.00006988105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006176349,"about_ca_topic_score_gemma":0.0001135092,"domain_scores_codex":[0.9977811,0.0005158397,0.0008140565,0.000345481,0.0003170818,0.0002264416],"domain_scores_gemma":[0.9987073,0.0001524335,0.0004332571,0.0003400327,0.0003306941,0.00003630354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001824412,0.0005603856,0.01799333,0.00002302298,0.000005696395,0.00004459731,0.00238606,0.03466872,0.6866975,0.1649485,0.000006616993,0.09264726],"study_design_scores_gemma":[0.00008610122,0.0005274827,0.1198196,0.0004206885,0.00002864525,0.00001264579,0.000918644,0.4814421,0.395918,0.0003523822,0.00004949558,0.0004241883],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7645168,0.00002702031,0.2321221,0.00004103284,0.0002294327,0.000372257,0.000002669787,0.00003330382,0.002655361],"genre_scores_gemma":[0.997306,0.000004907755,0.002531803,0.0000114526,0.00005520464,0.00001082266,0.00000198347,0.0000129315,0.00006484189],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4467734,"threshold_uncertainty_score":0.5310773,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002366659,0.0002995902,0.0002553279,0.0001327035,0.0006699442,0.0009900723,0.002196315,0.00005165828,0.001221052],"category_scores_gemma":[0.0001579686,0.0002356665,0.0001462993,0.0006275065,0.0001603972,0.0003052105,0.0001729452,0.0003816768,0.002315703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005031876,"about_ca_system_score_gemma":0.0001155999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002427169,"about_ca_topic_score_gemma":0.00001566119,"domain_scores_codex":[0.9964073,0.0008543801,0.0007430866,0.0008402077,0.0005727174,0.0005823247],"domain_scores_gemma":[0.9972516,0.001043839,0.0001573018,0.0009925598,0.0003531922,0.0002014989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006045899,0.0001180741,5.131996e-7,0.000009397104,0.0000218679,0.00001408785,0.0007009565,0.0233527,0.0005791508,0.1205236,0.0002678655,0.8543513],"study_design_scores_gemma":[0.00007221663,0.0002555154,0.00003819004,0.00005479262,0.00001281147,0.00002028122,0.0000851205,0.9699511,0.003627955,0.01404556,0.01153801,0.0002984543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001364752,0.0000587596,0.9754575,0.003392072,0.0003818856,0.0008990545,0.00001282874,0.0002318016,0.01942961],"genre_scores_gemma":[0.175468,0.0003589658,0.8184929,0.001401717,0.0003477509,0.0001212099,0.00002271423,0.00006832259,0.003718388],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9465984,"threshold_uncertainty_score":0.999692,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002417671,0.0001868011,0.0002238646,0.0002620059,0.0004682355,0.0003737193,0.0009276736,0.00004367849,0.00200129],"category_scores_gemma":[0.002274344,0.0001650067,0.00008934162,0.00089033,0.000318005,0.0002214576,0.0000963566,0.0002560893,0.004705366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003865307,"about_ca_system_score_gemma":0.0000251179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001847807,"about_ca_topic_score_gemma":0.0001806356,"domain_scores_codex":[0.99708,0.0005894884,0.000911877,0.0006847768,0.0004260608,0.0003077957],"domain_scores_gemma":[0.9975355,0.001088057,0.000267614,0.0006027632,0.0003726831,0.0001333598],"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.00007717659,0.000581927,0.0004674352,0.000004498941,0.0000130561,0.00001361796,0.01463786,0.01830538,0.001940257,0.5920037,0.003979699,0.3679754],"study_design_scores_gemma":[0.0001817435,0.0003804596,0.004379798,0.0002126841,0.00001475565,0.00000574175,0.03241763,0.8046325,0.01831639,0.09816907,0.04042574,0.0008634394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1577311,0.0000146497,0.568881,0.00386535,0.0002768735,0.001079892,0.00004079757,0.000109122,0.2680012],"genre_scores_gemma":[0.9943649,0.000008374413,0.000628243,0.0004719666,0.0001313791,0.00007116701,0.000007530358,0.00002021971,0.004296263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8366337,"threshold_uncertainty_score":0.998911,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001571813,0.0001678637,0.0001350648,0.00003542661,0.000690533,0.0006013718,0.001059946,0.00003305072,0.0001145842],"category_scores_gemma":[0.000221627,0.00009049514,0.00006302452,0.0002422608,0.0003784217,0.0001890398,0.00009209384,0.0001725885,0.0007768585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001901851,"about_ca_system_score_gemma":0.00005126855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002979594,"about_ca_topic_score_gemma":0.0000428878,"domain_scores_codex":[0.9983525,0.0003876188,0.0003361031,0.0004533922,0.0002026737,0.0002677622],"domain_scores_gemma":[0.9985082,0.0005774107,0.0001203782,0.0005613485,0.0001698253,0.00006282071],"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.00003497969,0.0000230547,0.000001069351,0.000002328921,0.000003993708,7.627974e-7,0.001656146,0.000173758,0.0001053587,0.5704752,0.0001017897,0.4274215],"study_design_scores_gemma":[0.0001711191,0.0002443966,0.0004327822,0.00003548678,0.00002329113,0.0000109029,0.0004025113,0.7457383,0.00274961,0.2358883,0.0140013,0.0003019964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001441601,0.0001759918,0.9224208,0.007572432,0.0002395693,0.0008284853,0.000002437415,0.0001357663,0.06718291],"genre_scores_gemma":[0.99535,0.0002621821,0.001954773,0.0007387949,0.0001761934,0.00005654602,0.00000374492,0.00001081295,0.001446951],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9939084,"threshold_uncertainty_score":0.9985203,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001592383,0.0003315697,0.0002922773,0.0003396918,0.0002896871,0.0006542939,0.001252325,0.00006053722,0.00007200539],"category_scores_gemma":[0.00009343791,0.0003171662,0.00008019502,0.0008431098,0.00007821073,0.0004631109,0.0004051226,0.0004776138,0.0009080545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000705452,"about_ca_system_score_gemma":0.00008204017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001903006,"about_ca_topic_score_gemma":0.002808508,"domain_scores_codex":[0.9964448,0.0005457307,0.0008763937,0.00101282,0.0004856154,0.0006346558],"domain_scores_gemma":[0.9983671,0.0002077887,0.0001669147,0.0009733561,0.0001721463,0.0001126471],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006311062,0.001873368,0.001185294,0.000008872889,0.00000608846,0.01295425,0.005201356,0.005505012,0.0002855752,0.3126453,0.0000793572,0.6601924],"study_design_scores_gemma":[0.0002610586,0.0009269906,0.002378687,0.0004623029,0.00001255534,0.000696817,0.006408706,0.8150921,0.001108917,0.171187,0.0003174979,0.001147278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2748571,0.00003773309,0.7100264,0.0001002926,0.0003130346,0.0002664042,0.000002838125,0.0001926535,0.01420355],"genre_scores_gemma":[0.9833424,0.00001043689,0.01618757,0.0002144532,0.0001268257,0.00001454985,0.000001223924,0.00002647356,0.00007603713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8095871,"threshold_uncertainty_score":0.9999281,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004890627,0.0001857587,0.000115843,0.00008005387,0.0004553205,0.001057143,0.0006723808,0.00002789826,0.0003545414],"category_scores_gemma":[0.0005127141,0.000136639,0.00007970314,0.0001814999,0.0003772844,0.0002845887,0.0001063959,0.0001850758,0.00728847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000221567,"about_ca_system_score_gemma":0.000019009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002278181,"about_ca_topic_score_gemma":0.0002263434,"domain_scores_codex":[0.9985195,0.00003818469,0.0004499331,0.0003322727,0.0003338148,0.0003262678],"domain_scores_gemma":[0.9990241,0.0002119286,0.0001980469,0.0002958447,0.0002549056,0.00001520161],"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.00003643206,0.00006313317,0.00009583543,0.000005554451,0.000005300572,0.00001686654,0.0000146268,0.0002174861,0.0001462414,0.952256,0.002567793,0.04457475],"study_design_scores_gemma":[0.00009400297,0.00006317423,0.01006567,0.0001413309,0.00003197437,0.000003576147,0.0005159011,0.03945829,0.003114339,0.5632518,0.3825359,0.0007240989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0166145,0.0000486598,0.02157057,0.002717343,0.002632887,0.0001679021,0.000006686536,0.0002180494,0.9560234],"genre_scores_gemma":[0.9942321,0.00003033131,0.00006153298,0.0008659403,0.002986159,0.000004904044,0.00001918668,0.00002776689,0.001772102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9776176,"threshold_uncertainty_score":0.9999799,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009368272,0.000178225,0.000141346,0.0001059205,0.000337095,0.0005550307,0.0004865472,0.00003928683,0.0005242426],"category_scores_gemma":[0.000295112,0.0001693305,0.00003635233,0.0002666366,0.00004984512,0.0003526538,0.00007819021,0.0001220739,0.0002255517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003718733,"about_ca_system_score_gemma":0.00005871778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002170077,"about_ca_topic_score_gemma":0.00002316415,"domain_scores_codex":[0.9983156,0.000240137,0.0004322577,0.0004975105,0.000282125,0.0002323282],"domain_scores_gemma":[0.9991068,0.0001562467,0.0001526832,0.0002623994,0.0002249627,0.00009697266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001711501,0.00006019012,0.0001577596,0.00001236348,0.00001119621,0.000003847812,0.001705269,0.0001133702,0.001169273,0.4563953,0.000857519,0.5394968],"study_design_scores_gemma":[0.0001685911,0.0003871641,0.009521957,0.0003621859,0.00001787187,0.00002076963,0.0006259113,0.9524443,0.01399498,0.01551319,0.006239404,0.0007037159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02286728,0.00002219878,0.9566873,0.0009082706,0.0002925418,0.0003834953,0.00002318645,0.0001320106,0.01868377],"genre_scores_gemma":[0.9747854,0.00002476366,0.02297103,0.0002607457,0.0001494637,0.00001298796,0.00002559491,0.00001906566,0.001750967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9523309,"threshold_uncertainty_score":0.6905096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}