{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":5,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":5,"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":"41f8dbe44694","filters":{"venue":"Leibniz-Zentrum für Informatik (Schloss Dagstuhl)"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"CONTEST; Graph; Graph drawing; Visualization; Conjunction (astronomy); Information visualization","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01465190933736341,"gpt":0.3019157339351433,"spread":0.2872638245977798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01679071,0.002262316,0.001429762,0.004205639,0.003304536,0.01087846,0.004053094,0.002967632,0.1745869],"category_scores_gemma":[0.02758324,0.0009942302,0.001697229,0.004805324,0.0008200493,0.005467615,0.006515566,0.004605019,0.1276677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003232045,"about_ca_system_score_gemma":0.006806742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02316869,"about_ca_topic_score_gemma":0.0251271,"domain_scores_codex":[0.9881679,0.002037552,0.0003483523,0.001086626,0.006820081,0.001539498],"domain_scores_gemma":[0.977295,0.002761273,0.0005429139,0.002764358,0.01039653,0.006239885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000555381,0.00006284266,0.0000608448,0.00006117646,0.000004035321,0.00002575368,0.00003148854,0.0002110212,0.0001717891,0.001711018,0.9843554,0.01324905],"study_design_scores_gemma":[0.00007601395,0.00005325885,0.0004714982,0.0000643533,0.000005613442,0.00004822438,0.00009121519,0.001091278,0.0007200756,0.002337805,0.995016,0.00002465088],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01248661,0.006162759,0.08250596,0.04523478,0.07155102,0.005648173,0.2751377,0.05387728,0.4473957],"genre_scores_gemma":[0.02675853,0.003003932,0.06138273,0.004709353,0.007813674,0.004126202,0.4780396,0.02767101,0.386495],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1745869,"threshold_uncertainty_score":0.5840513,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.007228901466821838,"gpt":0.2571630820249401,"spread":0.2499341805581183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007465852,0.0009701109,0.0005768336,0.0005032166,0.0005503875,0.001870736,0.001353612,0.000859443,0.002427369],"category_scores_gemma":[0.006845794,0.0005983411,0.001293324,0.0006090057,0.002278215,0.004277024,0.00443237,0.002114384,0.0004277754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001208195,"about_ca_system_score_gemma":0.0007241543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002488115,"about_ca_topic_score_gemma":0.001884638,"domain_scores_codex":[0.9986728,0.0002719561,0.0001059726,0.0002734108,0.0005077776,0.0001681423],"domain_scores_gemma":[0.9969453,0.001314546,0.0003072222,0.001015584,0.0002013138,0.0002159814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001719898,0.00004073534,0.00148439,0.0001595906,0.0000414378,0.0002939705,0.0004764986,0.5201155,0.009507586,0.4353962,0.000694273,0.03161783],"study_design_scores_gemma":[0.00003157753,0.0001755302,0.0005845881,0.00003918226,0.00003062289,0.0003125669,0.0002087051,0.6232439,0.01159356,0.3559594,0.007784246,0.00003607244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2256159,0.0002372931,0.7646227,0.0003238135,0.00003967778,0.00005251972,0.0002009042,0.0005918996,0.008315222],"genre_scores_gemma":[0.7970303,0.0003171312,0.198335,0.00005769124,0.00002274022,0.000122626,0.0005261471,0.0001573399,0.00343097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002488115,"threshold_uncertainty_score":0.008766174,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01101213244644093,"gpt":0.285109707211222,"spread":0.2740975747647811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00797153,0.001212115,0.003394195,0.001130504,0.003294759,0.003893087,0.004255086,0.004343873,0.004830107],"category_scores_gemma":[0.02821412,0.0008351877,0.001388232,0.001749638,0.004647268,0.01822408,0.007976746,0.003999522,0.0009680539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003613065,"about_ca_system_score_gemma":0.001663154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001693763,"about_ca_topic_score_gemma":0.001272349,"domain_scores_codex":[0.9904738,0.004339783,0.000358377,0.002125262,0.001651583,0.001051213],"domain_scores_gemma":[0.9671153,0.02264645,0.002607268,0.00569015,0.0009403251,0.001000564],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002851875,0.0005414765,0.002709547,0.0006356637,0.0002121363,0.001377466,0.001385376,0.3637911,0.00964782,0.571901,0.006960312,0.03798616],"study_design_scores_gemma":[0.0003898024,0.0001928062,0.0004279158,0.00003449444,0.00005226158,0.0004316802,0.0002699015,0.6599098,0.005609131,0.3280178,0.004608338,0.00005599118],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2916318,0.001394939,0.6826249,0.007001223,0.00009995721,0.0006070246,0.0009066629,0.0007568498,0.01497655],"genre_scores_gemma":[0.927359,0.0005109251,0.06322567,0.000452397,0.0001461033,0.0004761547,0.0003722347,0.000131345,0.007326168],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00797153,"threshold_uncertainty_score":0.04215795,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01205077816093837,"gpt":0.2832598731415937,"spread":0.2712090949806554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002591542,0.0008973877,0.001609501,0.001221263,0.001844039,0.003279541,0.002166442,0.004364431,0.01438092],"category_scores_gemma":[0.02276415,0.0009303156,0.0008092148,0.002027162,0.002113589,0.007998824,0.002089719,0.005106418,0.003530343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002951921,"about_ca_system_score_gemma":0.001413764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002618515,"about_ca_topic_score_gemma":0.001881487,"domain_scores_codex":[0.9974298,0.0008026478,0.0001400496,0.000572668,0.0006950168,0.0003598623],"domain_scores_gemma":[0.9884911,0.00818844,0.0005897167,0.000708369,0.001238128,0.0007843046],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001521043,0.0001956022,0.002743037,0.002547445,0.0001375159,0.001199573,0.0005289497,0.05445144,0.005053163,0.3756414,0.435036,0.1209448],"study_design_scores_gemma":[0.0004827774,0.0005516268,0.002429345,0.0003764273,0.0002244888,0.001367888,0.0004533851,0.2913008,0.004155648,0.3588312,0.3395619,0.0002645215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07143284,0.05464255,0.579594,0.1575899,0.05859107,0.0006126316,0.003936631,0.005921023,0.06767942],"genre_scores_gemma":[0.7536513,0.03393967,0.05840409,0.01311851,0.07557265,0.0007193094,0.004864001,0.001134499,0.05859601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01438092,"threshold_uncertainty_score":0.04810899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ruben Turkenburg","is_ca":false},{"name":"Harsh Beohar","is_ca":false},{"name":"Franck van Breugel","is_ca":false},{"name":"Clemens Kupke","is_ca":false},{"name":"Jurriaan Rot","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01361237046816071,"gpt":0.3008382864708418,"spread":0.2872259160026811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009099292,0.001079822,0.001282732,0.002962798,0.001687029,0.004163268,0.003589144,0.003122605,0.007387158],"category_scores_gemma":[0.07431809,0.001681215,0.002850425,0.001814299,0.005966547,0.01353937,0.01007944,0.009008871,0.001206403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002364244,"about_ca_system_score_gemma":0.001771084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000798827,"about_ca_topic_score_gemma":0.001061293,"domain_scores_codex":[0.9887465,0.002958746,0.0009511837,0.002742547,0.003767197,0.0008338797],"domain_scores_gemma":[0.9160919,0.06528445,0.003075179,0.009409643,0.005128747,0.001010123],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000161734,0.00008500712,0.001836178,0.0003723384,0.00008244479,0.000366454,0.0009247152,0.01757461,0.009280774,0.9337838,0.001324824,0.03420702],"study_design_scores_gemma":[0.00004340408,0.00006644464,0.0003310966,0.0001126739,0.00005845289,0.0001922605,0.0001664428,0.0690224,0.01318675,0.9125291,0.004234883,0.00005608122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02688862,0.0001630044,0.965528,0.001271111,0.00008282685,0.00009490424,0.0002750415,0.000719275,0.004977158],"genre_scores_gemma":[0.5538665,0.0005381182,0.4389926,0.0008754485,0.0001714185,0.0004449342,0.0009704027,0.0006375234,0.003503055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009099292,"threshold_uncertainty_score":0.04812223,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}