{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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":"5e9b68bd5c16","filters":{"venue":"European Symposium on Algorithms"}},"results":[{"id":"W3101241038","doi":"","title":"Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs.","year":2018,"lang":"en","type":"article","venue":"European Symposium on Algorithms","topic":"Distributed systems and fault tolerance","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 Waterloo","funders":"","keywords":"Merge sort; Exploit; Computer science; Sorting; Overhead (engineering); Implementation; Sorting algorithm; Parallel computing; Sorting network; Algorithm; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.06278732108924912,"gpt":0.3571014157708277,"spread":0.2943140946815785,"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.003265097,0.0005006348,0.0004900008,0.0001826095,0.0005738501,0.0009485209,0.001526053,0.00009041795,0.00004793292],"category_scores_gemma":[0.0003086722,0.0004627549,0.0001864565,0.0007614041,0.0001337584,0.0008184049,0.0008590441,0.000494956,0.001311107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001039393,"about_ca_system_score_gemma":0.0001066026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003214493,"about_ca_topic_score_gemma":0.000001809051,"domain_scores_codex":[0.9949423,0.001028602,0.0008170123,0.001376461,0.0008099027,0.00102572],"domain_scores_gemma":[0.9970486,0.0002677461,0.0004203893,0.001336989,0.0003394637,0.0005868016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002363794,0.0009986813,0.0002152773,0.00008328574,0.0003430681,0.002086154,0.01415242,0.00678004,0.0456804,0.04238156,0.05765399,0.8293887],"study_design_scores_gemma":[0.001212645,0.002134018,0.001718376,0.0004326658,0.00004637743,0.0005064373,0.0004596751,0.4097053,0.01564169,0.00005306323,0.5662604,0.001829425],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001231872,0.00004840893,0.8655875,0.003063328,0.001736668,0.0003298886,0.0000141657,0.0005843408,0.1274038],"genre_scores_gemma":[0.1067205,0.000007125393,0.8875043,0.001578796,0.00159206,0.00002088778,0.000007592433,0.00009450338,0.002474225],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8275594,"threshold_uncertainty_score":0.9997824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3129941803","doi":"","title":"Building a Nest by an Automaton.","year":2019,"lang":"en","type":"article","venue":"European Symposium on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Robot; Grid; Brick; Computer science; Span (engineering); Cellular automaton; Automaton; Carry (investment); Regular grid; Algorithm; Time complexity; Task (project management); Theoretical computer science; Mathematics; Geometry; Engineering; Structural engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01133610569469794,"gpt":0.2506736587131816,"spread":0.2393375530184837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006322364,0.0001954761,0.0001553371,0.0001314967,0.0001331074,0.0004955383,0.001264002,0.00003396109,0.00008233385],"category_scores_gemma":[0.00001006922,0.0001800305,0.00005668969,0.0003684046,0.0000291927,0.0007126734,0.0002693356,0.0002047905,0.002740368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000406516,"about_ca_system_score_gemma":0.00003387358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006196714,"about_ca_topic_score_gemma":1.513016e-7,"domain_scores_codex":[0.9979185,0.0003819028,0.0002485579,0.0006266271,0.0004235565,0.0004008201],"domain_scores_gemma":[0.9986781,0.00004273415,0.00008326465,0.0008609218,0.00007340058,0.0002616059],"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.00004044953,0.002164273,0.00136529,0.0001230079,0.0001277933,0.0004220118,0.006119439,0.05914694,0.233976,0.2770091,0.05757177,0.361934],"study_design_scores_gemma":[0.0008853358,0.0006469923,0.0008338107,0.00004390456,0.000002626864,0.00003350142,0.00001845836,0.8380864,0.002645859,0.0001090274,0.1562138,0.0004803318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01315541,0.00004304729,0.8327355,0.00294753,0.001209475,0.0005418602,0.0000105916,0.001574603,0.147782],"genre_scores_gemma":[0.4251871,0.00009033978,0.5477601,0.007588353,0.0004636461,0.00002134815,0.00004489912,0.0002168696,0.01862743],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7789394,"threshold_uncertainty_score":0.9980361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W26620097","doi":"10.3732/ajb.1500386","title":"Model Based Software Development Process For Production Applications.","year":2006,"lang":"en","type":"article","venue":"European Symposium on Algorithms","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Computer science; Goal-Driven Software Development Process; Process (computing); Software development process; Production (economics); Software development; Software engineering; Software; Systems engineering; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01942310800914882,"gpt":0.2461249175515523,"spread":0.2267018095424035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004330684,0.0002491396,0.0001513807,0.0001764263,0.0002053775,0.0000981007,0.0008334536,0.0000429799,8.331402e-7],"category_scores_gemma":[0.000006121529,0.0002520501,0.000061914,0.0002930007,0.00003193921,0.0002402726,0.00008506999,0.0001247776,0.00004534189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001213061,"about_ca_system_score_gemma":0.0001092046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001039334,"about_ca_topic_score_gemma":3.483843e-7,"domain_scores_codex":[0.9982378,0.00004221433,0.0003377481,0.0007311884,0.0003356643,0.0003153877],"domain_scores_gemma":[0.9988312,0.00002513824,0.0001115376,0.0007292429,0.0002280429,0.0000748051],"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.00001385712,0.0004395123,0.00006111713,0.0001773932,0.00001487241,0.00000595441,0.0003537032,0.6875513,0.002267826,0.02075922,0.003206655,0.2851486],"study_design_scores_gemma":[0.0003236973,0.00008371408,0.0001736466,0.00006657739,0.000006915649,0.00000657974,9.193207e-7,0.8298935,0.04357748,0.0008211728,0.1245258,0.0005199334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002866033,0.00001827673,0.9950833,0.0003812386,0.000146536,0.00099081,0.000007414086,0.002472398,0.000613454],"genre_scores_gemma":[0.03000216,0.000001424794,0.9681132,0.0001707421,0.0002313306,0.0007115582,0.0000402606,0.00006827071,0.0006610868],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2846286,"threshold_uncertainty_score":0.9999931,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}