{"meta":{"query_hash":"41f8dbe44694","filters":{"venue":"Leibniz-Zentrum für Informatik (Schloss Dagstuhl)"},"cohort_total":5,"direct_labels_cover":0,"predictions_cover":5,"exported":5,"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/41f8dbe44694","api":"https://metacan.xera.ac/api/v1/cohort?venue=Leibniz-Zentrum+f%C3%BCr+Informatik+%28Schloss+Dagstuhl%29"},"results":[{"id":"W4414829247","doi":"10.4230/lipics.csl.2026.25","title":"Constructing Witnesses for Lower Bounds on Behavioural Distances","year":2025,"lang":"en","type":"article","venue":"Leibniz-Zentrum für Informatik (Schloss Dagstuhl)","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Leverhulme Trust","keywords":"Soundness; Mathematical proof; Bounding overwatch; Completeness (order theory); Probabilistic logic; Equivalence (formal languages); Constructive; Context (archaeology); Modal logic","score_opus":0.013612370468160712,"score_gpt":0.3008382864708418,"score_spread":0.2872259160026811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414829247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12298384,0.00014603457,0.82580715,0.0031162985,0.005775291,0.0011340496,0.000060552382,0.00091274414,0.04006404],"genre_scores_gemma":[0.96895665,0.000010493347,0.028200721,0.0012381531,0.00017662604,0.00014108811,0.00006380346,0.000030708048,0.0011817785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966655,0.00008036793,0.0010103497,0.00054684206,0.00067029655,0.001026659],"domain_scores_gemma":[0.9972539,0.00066261983,0.0005634242,0.0010889189,0.00026282863,0.0001682884],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00066730205,0.0005429607,0.00059100677,0.00040226,0.0010592112,0.0010875943,0.0021251,0.00021947842,0.00004233732],"category_scores_gemma":[0.0006343332,0.00049938686,0.00025462252,0.0009616135,0.0003329526,0.0027995226,0.0007650969,0.000660686,0.000059493854],"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.00023772167,0.00015700239,0.033810936,0.00033360394,0.00016073127,0.000019277002,0.002597424,0.0034719966,0.000020369525,0.87533414,0.0035726503,0.08028417],"study_design_scores_gemma":[0.02174044,0.0026151799,0.027478548,0.003775734,0.00055696705,0.00030540564,0.017718328,0.5620476,0.011348848,0.08552437,0.25924918,0.0076393993],"about_ca_topic_score_codex":0.000051995292,"about_ca_topic_score_gemma":0.000054248223,"teacher_disagreement_score":0.8459728,"about_ca_system_score_codex":0.0003431843,"about_ca_system_score_gemma":0.00032086243,"threshold_uncertainty_score":0.9999494},"labels":[],"label_agreement":null},{"id":"W7106824282","doi":"10.4230/lipics.gd.2025.41","title":"Graph Drawing Contest Report (Graph Drawing Contest Report)","year":2025,"lang":"en","type":"article","venue":"Leibniz-Zentrum für Informatik (Schloss Dagstuhl)","topic":"Data Visualization and Analytics","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":"University of Saskatchewan","funders":"","keywords":"CONTEST; Graph; Graph drawing; Visualization; Conjunction (astronomy); Information visualization","score_opus":0.01465190933736341,"score_gpt":0.30191573393514326,"score_spread":0.2872638245977798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106824282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02473553,0.000593837,0.85102516,0.0052072816,0.004338534,0.0014077167,0.00010781235,0.0022191724,0.11036497],"genre_scores_gemma":[0.97281396,0.00018004022,0.008766915,0.0083452165,0.00027089432,0.00010352025,0.001067926,0.00007310306,0.008378417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933289,0.00012338156,0.0029953106,0.0009306861,0.0013132566,0.0013084218],"domain_scores_gemma":[0.9940114,0.0003435166,0.001491369,0.0029586728,0.0007258307,0.00046921527],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018364597,0.0007700213,0.00097426184,0.0011121773,0.0011050258,0.002339804,0.0026894344,0.00030859633,0.00007722148],"category_scores_gemma":[0.0014882764,0.00074371963,0.00048076973,0.0032066342,0.00034902667,0.005041274,0.0014961573,0.0007149592,0.00023196475],"study_design_candidate":"not_applicable","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.00008353227,0.0009232001,0.14147024,0.0010492227,0.0012103838,0.0056388895,0.008585535,0.0010748429,0.0006469311,0.6770127,0.13368705,0.02861747],"study_design_scores_gemma":[0.0064740153,0.00036421776,0.023475835,0.0022587266,0.00037332444,0.005479166,0.004005979,0.08918876,0.00706608,0.017558051,0.8397634,0.0039924323],"about_ca_topic_score_codex":0.00022063447,"about_ca_topic_score_gemma":0.00008764881,"teacher_disagreement_score":0.94807845,"about_ca_system_score_codex":0.00019895419,"about_ca_system_score_gemma":0.0007005163,"threshold_uncertainty_score":0.9995014},"labels":[],"label_agreement":null},{"id":"W7110002706","doi":"10.4230/lipics.disc.2025.48","title":"Brief Announcement: Distributed Download from an External Data Source in Asynchronous Faulty Settings","year":2025,"lang":"en","type":"article","venue":"Leibniz-Zentrum für Informatik (Schloss Dagstuhl)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"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 Victoria","funders":"Indian Institute of Technology Madras","keywords":"Asynchronous communication; Protocol (science); Upper and lower bounds; Asynchronous system; Download; Peer-to-peer; Resilience (materials science); Fraction (chemistry); Crash","score_opus":0.012050778160938367,"score_gpt":0.28325987314159373,"score_spread":0.2712090949806554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110002706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14808768,0.0009095456,0.8330859,0.0023234836,0.0014773777,0.0011322049,0.008117651,0.00073265476,0.0041334843],"genre_scores_gemma":[0.9825162,0.00007037297,0.0046332036,0.0030990911,0.00020375877,0.00009921608,0.009136604,0.000023927782,0.00021756689],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943422,0.00018680145,0.0018771528,0.0011366123,0.0010700327,0.0013871676],"domain_scores_gemma":[0.9945368,0.00016896552,0.0006867592,0.0040035984,0.00023320036,0.00037067576],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011548086,0.00069703104,0.00085363694,0.00032525675,0.00051605765,0.0017857521,0.0064273085,0.00032998397,0.000068109555],"category_scores_gemma":[0.00019396869,0.00067486335,0.00013439626,0.0015992735,0.0001767022,0.006681411,0.0027195776,0.0008021419,0.00028482996],"study_design_candidate":"not_applicable","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.0006417881,0.0030474048,0.12202354,0.0012007885,0.00089634873,0.00045691672,0.02368183,0.011082736,0.0013772153,0.045449514,0.16139752,0.6287444],"study_design_scores_gemma":[0.005800858,0.00023609122,0.051285304,0.0011487089,0.000055583852,0.000062853986,0.0014000991,0.41073337,0.0006649987,0.0015562908,0.5254438,0.0016120202],"about_ca_topic_score_codex":0.0023014748,"about_ca_topic_score_gemma":0.0003791562,"teacher_disagreement_score":0.8344286,"about_ca_system_score_codex":0.00039816427,"about_ca_system_score_gemma":0.00044609862,"threshold_uncertainty_score":0.99957025},"labels":[],"label_agreement":null},{"id":"W7110055507","doi":"10.4230/lipics.isaac.2025.46","title":"Realizing Metric Spaces with Convex Obstacles","year":2025,"lang":"en","type":"article","venue":"Leibniz-Zentrum für Informatik (Schloss Dagstuhl)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"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 Ottawa","funders":"","keywords":"Disjoint sets; Geodesic; Metric space; Multiplicative function; Metric (unit); Regular polygon; Finite set; Distortion (music); Boundary (topology); Euclidean space","score_opus":0.007228901466821838,"score_gpt":0.2571630820249401,"score_spread":0.24993418055811825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110055507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09386055,0.0010332528,0.83780134,0.003486213,0.0010048134,0.0007438279,0.000021659042,0.00069334934,0.06135498],"genre_scores_gemma":[0.97028685,0.000101172525,0.02561824,0.0019834526,0.00010535096,0.00005615664,0.00008361448,0.000014269133,0.0017508938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975491,0.00007282307,0.00066486135,0.00038193434,0.00073288754,0.0005983524],"domain_scores_gemma":[0.99815845,0.00029191867,0.0003167441,0.0007464693,0.00031699325,0.00016941514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005063118,0.00035224904,0.00038459274,0.00096295314,0.000524969,0.0009748522,0.0011101377,0.00012506364,0.00003438234],"category_scores_gemma":[0.00014685337,0.0002959067,0.000104505314,0.0034051246,0.00009737436,0.002617735,0.00046514082,0.00028902802,0.00014595526],"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.0001125707,0.00020748202,0.005875666,0.00038165762,0.00035267623,0.000031415886,0.0033807529,0.017578159,0.00024203271,0.8249117,0.01695397,0.12997194],"study_design_scores_gemma":[0.00613863,0.0008107977,0.055012472,0.0006944698,0.00017494259,0.00021922436,0.0030783887,0.31018594,0.020287722,0.019311216,0.5816735,0.0024127222],"about_ca_topic_score_codex":0.0000732104,"about_ca_topic_score_gemma":0.00003579344,"teacher_disagreement_score":0.8764263,"about_ca_system_score_codex":0.00013982836,"about_ca_system_score_gemma":0.00038267777,"threshold_uncertainty_score":0.9999493},"labels":[],"label_agreement":null},{"id":"W7110324624","doi":"10.4230/lipics.disc.2025.9","title":"Distributed Download from an External Data Source in Byzantine Majority Settings","year":2025,"lang":"en","type":"article","venue":"Leibniz-Zentrum für Informatik (Schloss Dagstuhl)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"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 Victoria","funders":"Indian Institute of Technology Madras","keywords":"Protocol (science); Set (abstract data type); Byzantine fault tolerance; Range query (database); Communication complexity; Dissemination; Discrete logarithm; Fraction (chemistry); Server","score_opus":0.011012132446440928,"score_gpt":0.28510970721122203,"score_spread":0.2740975747647811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110324624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35019484,0.00056424167,0.6351192,0.0033553245,0.00095979235,0.0007212331,0.0065318556,0.0007636502,0.0017898823],"genre_scores_gemma":[0.95791316,0.00015157844,0.025235048,0.0046204766,0.00020654194,0.000047982492,0.011778845,0.000020419795,0.000025942914],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99563974,0.00017459033,0.001341496,0.00095591723,0.00079342234,0.0010948144],"domain_scores_gemma":[0.9945401,0.00026175744,0.0004446387,0.004290182,0.00013185585,0.00033146757],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011878547,0.00055492145,0.0006376275,0.00050031097,0.0004482198,0.0012661535,0.0067772698,0.00028376983,0.00009473687],"category_scores_gemma":[0.0002691995,0.00054025784,0.00013858995,0.002030263,0.00020112115,0.007994348,0.0046675727,0.00093346817,0.00017030054],"study_design_candidate":"observational","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.00075592595,0.0029815661,0.34891057,0.0008039146,0.0005478844,0.00024701108,0.016407352,0.00048405162,0.00091814814,0.2354459,0.11087681,0.28162086],"study_design_scores_gemma":[0.0072269966,0.00022272892,0.26499805,0.0007958309,0.00011044739,0.00006209428,0.0013048009,0.20623206,0.002602587,0.021987341,0.49225557,0.0022014808],"about_ca_topic_score_codex":0.002351514,"about_ca_topic_score_gemma":0.0006108375,"teacher_disagreement_score":0.60988414,"about_ca_system_score_codex":0.0000724042,"about_ca_system_score_gemma":0.0002279036,"threshold_uncertainty_score":0.99977064},"labels":[],"label_agreement":null}]}