{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010066757,0.00027506446,0.97833544,0.00027916252,0.000054546526,0.0002766661,0.0002935774,0.0043903477,0.006028413],"genre_scores_gemma":[0.18129659,0.00046321028,0.80909806,0.000112876995,0.000015565867,0.000559516,0.0014670137,0.0006231268,0.0063640843],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982352,0.0005925517,0.000108838554,0.00019009391,0.0007755708,0.00009774236],"domain_scores_gemma":[0.9974771,0.0011306608,0.00014055683,0.00057241315,0.00058380375,0.000095438234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021766506,0.00075778674,0.00053580967,0.0007573056,0.000642424,0.0019089264,0.0018914182,0.0013436152,0.0069613196],"category_scores_gemma":[0.006846854,0.0006938954,0.0010037348,0.00059432385,0.0004986238,0.0017471054,0.0013767089,0.0014667783,0.0023322904],"study_design_candidate":"theoretical_or_conceptual","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.00045035986,0.0006859798,0.0032843386,0.00072079845,0.00020624463,0.0007867602,0.0008317717,0.4072763,0.031895913,0.094740264,0.0185954,0.44052583],"study_design_scores_gemma":[0.000098300865,0.00021933438,0.00087084214,0.00014626364,0.00010843332,0.0002885525,0.00009835807,0.8838634,0.02025111,0.05393839,0.040074922,0.00004211224],"about_ca_topic_score_codex":0.0037395677,"about_ca_topic_score_gemma":0.0044552498,"teacher_disagreement_score":0.0069613196,"about_ca_system_score_codex":0.0011164215,"about_ca_system_score_gemma":0.002557515,"threshold_uncertainty_score":0.023287892},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046901338,0.001344218,0.92421097,0.00034863022,0.00021998466,0.00026623832,0.0005576785,0.016786093,0.009364857],"genre_scores_gemma":[0.22537218,0.00063411077,0.76335853,0.00023973898,0.00008695971,0.00036182767,0.0014966477,0.0023476605,0.0061023235],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99840975,0.00034743984,0.00013034066,0.0003213091,0.0005824446,0.00020868839],"domain_scores_gemma":[0.99616313,0.0013431686,0.00036494638,0.0015532773,0.00038651004,0.0001889329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002039383,0.0016013844,0.00090991386,0.0012829658,0.0009368307,0.0015805771,0.003270176,0.0016070128,0.007201441],"category_scores_gemma":[0.010679214,0.0010121014,0.00087007094,0.00220011,0.0011278329,0.004188862,0.002504853,0.0015267287,0.004499943],"study_design_candidate":"bench_or_experimental","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.0013805241,0.0003821287,0.0032173235,0.00071517855,0.00025338784,0.00025571953,0.0006126348,0.19387738,0.036181565,0.050208755,0.029024184,0.68389124],"study_design_scores_gemma":[0.00038878544,0.0004551609,0.00068695657,0.00009677616,0.00012430051,0.00056394393,0.00026424235,0.82213205,0.03424698,0.10730148,0.033638682,0.000100639256],"about_ca_topic_score_codex":0.0014166732,"about_ca_topic_score_gemma":0.003362155,"teacher_disagreement_score":0.007201441,"about_ca_system_score_codex":0.00077379885,"about_ca_system_score_gemma":0.002690922,"threshold_uncertainty_score":0.024091184},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024938233,0.00022973523,0.9655126,0.00023468453,0.000045083023,0.00010504833,0.00022519467,0.0013439264,0.0073654717],"genre_scores_gemma":[0.31257403,0.00038822132,0.67882586,0.00015968944,0.0000300818,0.00045730436,0.00084060145,0.00023131869,0.006492961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993253,0.0001701119,0.000058754464,0.0002115656,0.00014616866,0.00008818677],"domain_scores_gemma":[0.99890614,0.0005884043,0.00010251692,0.00025826856,0.00008502348,0.000059620783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004763624,0.00070590293,0.00055609713,0.00034311987,0.0007403652,0.0010470534,0.0012407629,0.0011234097,0.005188216],"category_scores_gemma":[0.002605695,0.0006134073,0.0018525012,0.00038692117,0.0013558775,0.0016148392,0.0018125509,0.000929656,0.0012369066],"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.00029594736,0.00015502253,0.002776807,0.00059841166,0.0001287972,0.00042206416,0.00049336517,0.702731,0.015180098,0.20053996,0.0037985016,0.07288011],"study_design_scores_gemma":[0.00006274139,0.0001461909,0.00023690301,0.00006192988,0.00006594426,0.00018969727,0.00008145048,0.8753477,0.004982502,0.10616121,0.012637949,0.000025820054],"about_ca_topic_score_codex":0.0028805332,"about_ca_topic_score_gemma":0.0042819967,"teacher_disagreement_score":0.005188216,"about_ca_system_score_codex":0.00074012927,"about_ca_system_score_gemma":0.0012127756,"threshold_uncertainty_score":0.017356336},"labels":[],"label_agreement":null}]}