{"meta":{"query_hash":"5e9b68bd5c16","filters":{"venue":"European Symposium on Algorithms"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/5e9b68bd5c16","api":"https://metacan.xera.ac/api/v1/cohort?venue=European+Symposium+on+Algorithms"},"results":[{"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.019423108009148815,"score_gpt":0.2461249175515523,"score_spread":0.2267018095424035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26620097","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.00028660335,0.000018276727,0.9950833,0.00038123858,0.00014653595,0.00099081,0.000007414086,0.002472398,0.000613454],"genre_scores_gemma":[0.030002164,0.0000014247936,0.9681132,0.00017074212,0.0002313306,0.0007115582,0.0000402606,0.00006827071,0.00066108676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982378,0.00004221433,0.00033774815,0.0007311884,0.0003356643,0.00031538768],"domain_scores_gemma":[0.9988312,0.000025138235,0.00011153759,0.00072924286,0.00022804289,0.0000748051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043306837,0.0002491396,0.00015138074,0.0001764263,0.00020537748,0.000098100696,0.0008334536,0.000042979897,8.3314023e-7],"category_scores_gemma":[0.000006121529,0.00025205014,0.000061914005,0.00029300072,0.000031939206,0.00024027261,0.000085069994,0.00012477761,0.000045341887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0000138571195,0.0004395123,0.00006111713,0.0001773932,0.000014872406,0.0000059544095,0.00035370325,0.6875513,0.0022678257,0.020759225,0.0032066552,0.28514856],"study_design_scores_gemma":[0.00032369728,0.000083714076,0.00017364664,0.00006657739,0.0000069156486,0.00000657974,9.193207e-7,0.8298935,0.043577485,0.0008211728,0.12452581,0.0005199334],"about_ca_topic_score_codex":0.0000010393338,"about_ca_topic_score_gemma":3.483843e-7,"teacher_disagreement_score":0.28462863,"about_ca_system_score_codex":0.00012130608,"about_ca_system_score_gemma":0.00010920464,"threshold_uncertainty_score":0.99999315},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06278732108924912,"score_gpt":0.35710141577082766,"score_spread":0.29431409468157854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101241038","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.0012318724,0.00004840893,0.86558753,0.0030633279,0.0017366679,0.00032988857,0.0000141657,0.00058434077,0.12740381],"genre_scores_gemma":[0.106720544,0.0000071253935,0.8875043,0.0015787958,0.0015920601,0.000020887781,0.0000075924327,0.00009450338,0.0024742247],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949423,0.0010286025,0.0008170123,0.001376461,0.0008099027,0.0010257205],"domain_scores_gemma":[0.9970486,0.00026774613,0.00042038932,0.0013369886,0.00033946373,0.00058680156],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032650968,0.00050063484,0.00049000076,0.00018260952,0.0005738501,0.0009485209,0.0015260531,0.00009041795,0.00004793292],"category_scores_gemma":[0.00030867223,0.00046275495,0.00018645648,0.0007614041,0.00013375843,0.0008184049,0.0008590441,0.000494956,0.0013111066],"study_design_candidate":"design_other","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.0002363794,0.0009986813,0.00021527731,0.00008328574,0.00034306812,0.0020861544,0.014152416,0.0067800405,0.0456804,0.042381562,0.057653986,0.82938874],"study_design_scores_gemma":[0.001212645,0.002134018,0.0017183756,0.00043266578,0.000046377427,0.00050643727,0.00045967512,0.40970525,0.015641695,0.00005306323,0.5662604,0.0018294248],"about_ca_topic_score_codex":0.000032144933,"about_ca_topic_score_gemma":0.0000018090514,"teacher_disagreement_score":0.82755935,"about_ca_system_score_codex":0.00010393933,"about_ca_system_score_gemma":0.000106602594,"threshold_uncertainty_score":0.99978244},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011336105694697935,"score_gpt":0.2506736587131816,"score_spread":0.23933755301848367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129941803","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.013155412,0.000043047286,0.8327355,0.0029475302,0.0012094748,0.00054186024,0.000010591599,0.0015746029,0.14778201],"genre_scores_gemma":[0.42518705,0.00009033978,0.54776007,0.0075883535,0.0004636461,0.000021348154,0.000044899123,0.00021686958,0.018627428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791855,0.00038190282,0.0002485579,0.00062662706,0.00042355648,0.00040082014],"domain_scores_gemma":[0.9986781,0.000042734155,0.000083264655,0.0008609218,0.00007340058,0.0002616059],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00063223636,0.0001954761,0.00015533711,0.00013149665,0.00013310745,0.00049553835,0.0012640019,0.00003396109,0.00008233385],"category_scores_gemma":[0.00001006922,0.00018003055,0.000056689685,0.00036840455,0.000029192699,0.0007126734,0.00026933564,0.00020479053,0.0027403675],"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.000040449526,0.0021642733,0.0013652896,0.00012300794,0.00012779332,0.00042201177,0.006119439,0.059146937,0.23397596,0.27700907,0.05757177,0.361934],"study_design_scores_gemma":[0.0008853358,0.0006469923,0.0008338107,0.000043904558,0.0000026268638,0.000033501423,0.000018458357,0.83808637,0.0026458593,0.00010902739,0.15621378,0.00048033177],"about_ca_topic_score_codex":0.000006196714,"about_ca_topic_score_gemma":1.513016e-7,"teacher_disagreement_score":0.7789394,"about_ca_system_score_codex":0.000040651597,"about_ca_system_score_gemma":0.000033873577,"threshold_uncertainty_score":0.9980361},"labels":[],"label_agreement":null}]}