{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"J. Ian Munro","is_ca":true},{"name":"Sebastian Wild","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002039383,0.001601384,0.0009099139,0.001282966,0.0009368307,0.001580577,0.003270176,0.001607013,0.007201441],"category_scores_gemma":[0.01067921,0.001012101,0.0008700709,0.00220011,0.001127833,0.004188862,0.002504853,0.001526729,0.004499943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007737988,"about_ca_system_score_gemma":0.002690922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001416673,"about_ca_topic_score_gemma":0.003362155,"domain_scores_codex":[0.9984097,0.0003474398,0.0001303407,0.0003213091,0.0005824446,0.0002086884],"domain_scores_gemma":[0.9961631,0.001343169,0.0003649464,0.001553277,0.00038651,0.0001889329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001380524,0.0003821287,0.003217323,0.0007151786,0.0002533878,0.0002557195,0.0006126348,0.1938774,0.03618157,0.05020875,0.02902418,0.6838912],"study_design_scores_gemma":[0.0003887854,0.0004551609,0.0006869566,0.00009677616,0.0001243005,0.0005639439,0.0002642423,0.8221321,0.03424698,0.1073015,0.03363868,0.0001006393],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04690134,0.001344218,0.924211,0.0003486302,0.0002199847,0.0002662383,0.0005576785,0.01678609,0.009364857],"genre_scores_gemma":[0.2253722,0.0006341108,0.7633585,0.000239739,0.00008695971,0.0003618277,0.001496648,0.00234766,0.006102324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007201441,"threshold_uncertainty_score":0.02409118,"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","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Dariusz Dereniowski","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004763624,0.0007059029,0.0005560971,0.0003431199,0.0007403652,0.001047053,0.001240763,0.00112341,0.005188216],"category_scores_gemma":[0.002605695,0.0006134073,0.001852501,0.0003869212,0.001355877,0.001614839,0.001812551,0.000929656,0.001236907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007401293,"about_ca_system_score_gemma":0.001212776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002880533,"about_ca_topic_score_gemma":0.004281997,"domain_scores_codex":[0.9993253,0.0001701119,0.00005875446,0.0002115656,0.0001461687,0.00008818677],"domain_scores_gemma":[0.9989061,0.0005884043,0.0001025169,0.0002582686,0.00008502348,0.00005962078],"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.0002959474,0.0001550225,0.002776807,0.0005984117,0.0001287972,0.0004220642,0.0004933652,0.702731,0.0151801,0.20054,0.003798502,0.07288011],"study_design_scores_gemma":[0.00006274139,0.0001461909,0.000236903,0.00006192988,0.00006594426,0.0001896973,0.00008145048,0.8753477,0.004982502,0.1061612,0.01263795,0.00002582005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02493823,0.0002297352,0.9655126,0.0002346845,0.00004508302,0.0001050483,0.0002251947,0.001343926,0.007365472],"genre_scores_gemma":[0.312574,0.0003882213,0.6788259,0.0001596894,0.0000300818,0.0004573044,0.0008406015,0.0002313187,0.006492961],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005188216,"threshold_uncertainty_score":0.01735634,"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","authors":[{"name":"M. S. Chandrashekar","is_ca":false},{"name":"Susan Dong","is_ca":false},{"name":"Naveen Alwandi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002176651,0.0007577867,0.0005358097,0.0007573056,0.000642424,0.001908926,0.001891418,0.001343615,0.00696132],"category_scores_gemma":[0.006846854,0.0006938954,0.001003735,0.0005943239,0.0004986238,0.001747105,0.001376709,0.001466778,0.00233229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001116422,"about_ca_system_score_gemma":0.002557515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003739568,"about_ca_topic_score_gemma":0.00445525,"domain_scores_codex":[0.9982352,0.0005925517,0.0001088386,0.0001900939,0.0007755708,0.00009774236],"domain_scores_gemma":[0.9974771,0.001130661,0.0001405568,0.0005724131,0.0005838037,0.00009543823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004503599,0.0006859798,0.003284339,0.0007207984,0.0002062446,0.0007867602,0.0008317717,0.4072763,0.03189591,0.09474026,0.0185954,0.4405258],"study_design_scores_gemma":[0.00009830086,0.0002193344,0.0008708421,0.0001462636,0.0001084333,0.0002885525,0.00009835807,0.8838634,0.02025111,0.05393839,0.04007492,0.00004211224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01006676,0.0002750645,0.9783354,0.0002791625,0.00005454653,0.0002766661,0.0002935774,0.004390348,0.006028413],"genre_scores_gemma":[0.1812966,0.0004632103,0.8090981,0.000112877,0.00001556587,0.000559516,0.001467014,0.0006231268,0.006364084],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00696132,"threshold_uncertainty_score":0.02328789,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}