{"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":"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.026888624,0.00016300438,0.965528,0.0012711107,0.00008282685,0.00009490424,0.00027504147,0.00071927503,0.004977158],"genre_scores_gemma":[0.5538665,0.0005381182,0.43899256,0.00087544846,0.00017141846,0.00044493424,0.00097040273,0.00063752336,0.0035030548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98874646,0.0029587464,0.00095118367,0.002742547,0.0037671975,0.0008338797],"domain_scores_gemma":[0.91609186,0.06528445,0.003075179,0.009409643,0.0051287473,0.0010101231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009099292,0.0010798218,0.0012827318,0.0029627976,0.0016870293,0.004163268,0.0035891437,0.003122605,0.007387158],"category_scores_gemma":[0.07431809,0.0016812154,0.0028504247,0.0018142988,0.0059665474,0.013539368,0.010079438,0.009008871,0.001206403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00016173403,0.00008500712,0.0018361785,0.0003723384,0.00008244479,0.00036645398,0.00092471525,0.01757461,0.009280774,0.9337838,0.0013248239,0.03420702],"study_design_scores_gemma":[0.000043404085,0.00006644464,0.00033109658,0.000112673886,0.000058452886,0.00019226046,0.0001664428,0.0690224,0.013186753,0.9125291,0.004234883,0.000056081222],"about_ca_topic_score_codex":0.00079882704,"about_ca_topic_score_gemma":0.0010612933,"teacher_disagreement_score":0.009099292,"about_ca_system_score_codex":0.0023642438,"about_ca_system_score_gemma":0.0017710844,"threshold_uncertainty_score":0.048122227},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0124866115,0.006162759,0.082505964,0.045234777,0.07155102,0.005648173,0.2751377,0.053877283,0.4473957],"genre_scores_gemma":[0.02675853,0.0030039323,0.061382733,0.004709353,0.007813674,0.0041262023,0.4780396,0.027671013,0.38649496],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98816794,0.002037552,0.00034835227,0.0010866255,0.006820081,0.0015394976],"domain_scores_gemma":[0.97729504,0.002761273,0.0005429139,0.0027643582,0.01039653,0.0062398845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016790709,0.0022623162,0.0014297618,0.0042056395,0.0033045355,0.010878464,0.0040530944,0.002967632,0.17458686],"category_scores_gemma":[0.027583238,0.0009942302,0.0016972293,0.004805324,0.0008200493,0.005467615,0.0065155663,0.0046050195,0.12766768],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000055538105,0.00006284266,0.000060844803,0.000061176455,0.000004035321,0.000025753681,0.000031488536,0.00021102124,0.00017178908,0.001711018,0.98435545,0.01324905],"study_design_scores_gemma":[0.00007601395,0.000053258853,0.00047149824,0.0000643533,0.0000056134418,0.000048224378,0.00009121519,0.0010912776,0.0007200756,0.0023378045,0.99501604,0.000024650879],"about_ca_topic_score_codex":0.023168689,"about_ca_topic_score_gemma":0.025127102,"teacher_disagreement_score":0.17458686,"about_ca_system_score_codex":0.0032320453,"about_ca_system_score_gemma":0.006806742,"threshold_uncertainty_score":0.58405125},"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":"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.07143284,0.05464255,0.57959396,0.15758988,0.058591068,0.00061263156,0.0039366307,0.005921023,0.06767942],"genre_scores_gemma":[0.75365126,0.033939667,0.058404088,0.0131185055,0.075572655,0.0007193094,0.0048640007,0.0011344993,0.058596008],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974298,0.0008026478,0.0001400496,0.00057266804,0.00069501676,0.0003598623],"domain_scores_gemma":[0.98849106,0.00818844,0.00058971666,0.00070836896,0.0012381278,0.00078430463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025915424,0.0008973877,0.0016095012,0.0012212628,0.0018440393,0.0032795414,0.0021664423,0.004364431,0.014380923],"category_scores_gemma":[0.022764152,0.0009303156,0.0008092148,0.0020271617,0.0021135893,0.007998824,0.0020897186,0.005106418,0.0035303428],"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.0015210435,0.00019560222,0.0027430372,0.0025474445,0.00013751589,0.0011995728,0.00052894966,0.054451443,0.005053163,0.3756414,0.435036,0.12094484],"study_design_scores_gemma":[0.0004827774,0.0005516268,0.0024293452,0.00037642728,0.00022448876,0.0013678881,0.0004533851,0.29130077,0.004155648,0.35883117,0.3395619,0.00026452148],"about_ca_topic_score_codex":0.0026185152,"about_ca_topic_score_gemma":0.0018814874,"teacher_disagreement_score":0.014380923,"about_ca_system_score_codex":0.002951921,"about_ca_system_score_gemma":0.0014137641,"threshold_uncertainty_score":0.048108995},"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":"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.22561589,0.00023729309,0.76462275,0.00032381347,0.000039677783,0.000052519725,0.00020090422,0.0005918996,0.008315222],"genre_scores_gemma":[0.7970303,0.0003171312,0.19833504,0.00005769124,0.000022740218,0.00012262604,0.0005261471,0.00015733995,0.0034309702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867284,0.0002719561,0.0001059726,0.0002734108,0.0005077776,0.00016814226],"domain_scores_gemma":[0.9969453,0.0013145457,0.00030722222,0.0010155843,0.00020131376,0.00021598142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007465852,0.00097011094,0.00057683355,0.0005032166,0.00055038754,0.0018707357,0.0013536124,0.000859443,0.002427369],"category_scores_gemma":[0.0068457937,0.00059834105,0.0012933243,0.0006090057,0.0022782148,0.0042770244,0.00443237,0.002114384,0.00042777538],"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.0001719898,0.00004073534,0.00148439,0.0001595906,0.0000414378,0.00029397046,0.0004764986,0.5201155,0.009507586,0.4353962,0.000694273,0.031617828],"study_design_scores_gemma":[0.00003157753,0.0001755302,0.0005845881,0.000039182258,0.000030622894,0.00031256687,0.00020870507,0.62324387,0.01159356,0.35595942,0.007784246,0.000036072437],"about_ca_topic_score_codex":0.0024881149,"about_ca_topic_score_gemma":0.0018846383,"teacher_disagreement_score":0.0024881149,"about_ca_system_score_codex":0.0012081946,"about_ca_system_score_gemma":0.0007241543,"threshold_uncertainty_score":0.008766174},"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":"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.29163185,0.0013949395,0.6826249,0.0070012226,0.00009995721,0.00060702465,0.0009066629,0.00075684977,0.014976551],"genre_scores_gemma":[0.92735904,0.00051092514,0.06322567,0.00045239695,0.00014610331,0.00047615467,0.0003722347,0.00013134502,0.007326168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9904738,0.0043397835,0.000358377,0.0021252623,0.001651583,0.0010512131],"domain_scores_gemma":[0.9671153,0.022646446,0.002607268,0.00569015,0.0009403251,0.0010005643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00797153,0.0012121149,0.0033941953,0.0011305043,0.0032947594,0.0038930874,0.004255086,0.004343873,0.0048301066],"category_scores_gemma":[0.028214121,0.00083518773,0.0013882325,0.0017496378,0.0046472684,0.018224075,0.007976746,0.003999522,0.0009680539],"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.002851875,0.00054147653,0.0027095473,0.0006356637,0.00021213628,0.0013774665,0.0013853764,0.36379108,0.00964782,0.571901,0.0069603124,0.037986163],"study_design_scores_gemma":[0.00038980242,0.00019280615,0.00042791583,0.000034494442,0.000052261585,0.00043168024,0.00026990153,0.65990984,0.005609131,0.32801783,0.0046083382,0.000055991175],"about_ca_topic_score_codex":0.0016937628,"about_ca_topic_score_gemma":0.0012723488,"teacher_disagreement_score":0.00797153,"about_ca_system_score_codex":0.0036130648,"about_ca_system_score_gemma":0.0016631539,"threshold_uncertainty_score":0.042157948},"labels":[],"label_agreement":null}]}