{"meta":{"query_hash":"7dcbdbd02fca","filters":{"venue":"Dagstuhl Research Online Publication Server"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"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/7dcbdbd02fca","api":"https://metacan.xera.ac/api/v1/cohort?venue=Dagstuhl+Research+Online+Publication+Server"},"results":[{"id":"W2949083013","doi":"10.4230/lipics.ccc.2021.37","title":"A Simple Proof of a New Set Disjointness with Applications to Data Streams","year":2021,"lang":"en","type":"preprint","venue":"Dagstuhl Research Online Publication Server","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Computer science; Communication complexity; Business; Mathematics; Theoretical computer science","score_opus":0.27043653885570473,"score_gpt":0.45761454493714143,"score_spread":0.1871780060814367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949083013","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.019955702,0.00029200147,0.9372671,0.03456855,0.00010806078,0.004977423,0.0021951785,0.0003095919,0.0003263865],"genre_scores_gemma":[0.32607475,0.000086480664,0.61703646,0.00066092866,0.001099834,0.0028597533,0.049902413,0.00015627521,0.002123076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99129564,0.0007276591,0.0010852497,0.003079252,0.002896801,0.0009154237],"domain_scores_gemma":[0.97849387,0.0005980637,0.00045897602,0.013126824,0.0064863698,0.0008359016],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0037422555,0.00047051875,0.00075676356,0.0008909199,0.00021960697,0.0015034658,0.01203764,0.0002969388,0.00016901057],"category_scores_gemma":[0.0016435771,0.00042297994,0.00012474612,0.005205768,0.0002180848,0.0013106914,0.029398682,0.0014602642,0.000033154723],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011955087,0.008301343,0.008998633,0.0023017805,0.0006732335,0.000026935168,0.004324437,0.0066093532,0.00020935763,0.022361113,0.11324546,0.8328288],"study_design_scores_gemma":[0.001775679,0.00076001714,0.06348181,0.0005318829,0.000083122104,0.000046714616,0.001101208,0.5863728,0.0015421979,0.027216345,0.3150425,0.0020457548],"about_ca_topic_score_codex":0.0025717707,"about_ca_topic_score_gemma":0.0033815259,"teacher_disagreement_score":0.83078307,"about_ca_system_score_codex":0.00036342925,"about_ca_system_score_gemma":0.0059520733,"threshold_uncertainty_score":0.9998222},"labels":[],"label_agreement":null},{"id":"W2950427777","doi":"10.4230/lipics.approx-random.2017.37","title":"Sample-Based High-Dimensional Convexity Testing","year":2017,"lang":"en","type":"preprint","venue":"Dagstuhl Research Online Publication Server","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"National Science Foundation","keywords":"Combinatorics; Monotonic function; Constant (computer programming); Characterization (materials science); Mathematics; Constant function; Partition (number theory); Property testing; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.3264675902913521,"score_gpt":0.4352698718725549,"score_spread":0.10880228158120281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950427777","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.08857265,0.00078265334,0.6721266,0.2193003,0.0041421517,0.0043785833,0.0049173124,0.0026046017,0.003175125],"genre_scores_gemma":[0.3337301,0.000034258384,0.65371937,0.0017415038,0.0014260223,0.0005225867,0.00754892,0.00008837736,0.0011888787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921575,0.0009129244,0.0007998015,0.0019383836,0.0030828288,0.0011085161],"domain_scores_gemma":[0.98268795,0.0029281632,0.0006467062,0.005855918,0.007333784,0.0005474512],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.006080206,0.0004732852,0.000566749,0.0011313776,0.0014954915,0.0030829867,0.008141756,0.00047544908,0.00022626221],"category_scores_gemma":[0.012325644,0.00047479678,0.0002399862,0.0012848654,0.00065663486,0.0010331133,0.009581332,0.0030689817,0.00018668895],"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.00009494103,0.0045319926,0.016695824,0.0011338297,0.0003794012,0.00008124734,0.00032780677,0.0035885205,0.00023846923,0.5699143,0.08993354,0.31308016],"study_design_scores_gemma":[0.0007853109,0.00012034289,0.08618635,0.00028212817,0.000010474448,0.000006459363,0.000006617046,0.6934743,0.00020792075,0.18091808,0.037306532,0.0006954664],"about_ca_topic_score_codex":0.0038252359,"about_ca_topic_score_gemma":0.0002376111,"teacher_disagreement_score":0.6898858,"about_ca_system_score_codex":0.00032535486,"about_ca_system_score_gemma":0.003153892,"threshold_uncertainty_score":0.99980444},"labels":[],"label_agreement":null},{"id":"W2952096052","doi":"10.4230/lipics.sat.2025.20","title":"Scalable Precise Computation of Shannon Entropy","year":2025,"lang":"en","type":"preprint","venue":"Dagstuhl Research Online Publication Server","topic":"Bayesian Modeling and Causal Inference","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 British Columbia","funders":"","keywords":"Markov decision process; Influence diagram; Dynamic programming; Computer science; Bellman equation; Mathematical optimization; Reduction (mathematics); Stochastic programming; Bayesian network; Value (mathematics); Dynamic Bayesian network; Bayesian probability; Algebraic number; Decision tree; Markov process; Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.15094301558187906,"score_gpt":0.4323619243170549,"score_spread":0.28141890873517583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952096052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01596292,0.00079486985,0.9568836,0.019759411,0.00052762387,0.0012179792,0.00040308703,0.00037104814,0.0040794527],"genre_scores_gemma":[0.83641523,0.0007488742,0.14899692,0.00043820264,0.000340819,0.00040994884,0.0032991797,0.000040252173,0.009310568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99484175,0.000752624,0.0009008251,0.0011730533,0.0017269322,0.0006048138],"domain_scores_gemma":[0.99066764,0.00035654797,0.0003862723,0.0019361629,0.006418904,0.00023449886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003236503,0.00028650975,0.0004596835,0.0011490278,0.00017858093,0.00072138075,0.0034021398,0.00040794254,0.000049777904],"category_scores_gemma":[0.0010094526,0.0002883775,0.00015659418,0.0020134447,0.00014992009,0.00070450275,0.004144304,0.0014317894,0.00006974836],"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.000121790334,0.004121895,0.0022950682,0.0030199345,0.00036642715,0.0000071832364,0.0018774725,0.018827366,0.0014396752,0.52840906,0.12398183,0.3155323],"study_design_scores_gemma":[0.00043684826,0.00010816363,0.0040358477,0.0006411827,0.000014251531,0.0000016061325,0.000033505865,0.9123205,0.0015525249,0.07055213,0.009931261,0.0003721511],"about_ca_topic_score_codex":0.00046389457,"about_ca_topic_score_gemma":0.000041957697,"teacher_disagreement_score":0.8934932,"about_ca_system_score_codex":0.00023554223,"about_ca_system_score_gemma":0.001956325,"threshold_uncertainty_score":0.99995685},"labels":[],"label_agreement":null},{"id":"W4295845595","doi":"10.4230/lipics.icalp.2025.135","title":"Deterministic Independent Sets in the Semi-Streaming Model","year":2025,"lang":"en","type":"preprint","venue":"Dagstuhl Research Online Publication Server","topic":"Machine Learning and Algorithms","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 Waterloo","funders":"","keywords":"Combinatorics; Logarithm; Upper and lower bounds; Mathematics; Reciprocal; Omega; BETA (programming language); Graph; Independent set; Set (abstract data type); Discrete mathematics; Constant (computer programming); Computer science; Physics; Mathematical analysis","score_opus":0.12301858349673361,"score_gpt":0.44195738755447317,"score_spread":0.31893880405773956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295845595","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.17225294,0.0014672409,0.4975692,0.2798316,0.0016998685,0.006786907,0.0014846671,0.0014411432,0.037466444],"genre_scores_gemma":[0.9649148,0.00020956477,0.020001639,0.0018420466,0.00031202508,0.0007598908,0.0018439359,0.00003390116,0.010082172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935878,0.0014942534,0.0006923072,0.0012880968,0.0021432773,0.0007942999],"domain_scores_gemma":[0.9946267,0.0008950291,0.00023036916,0.0029396897,0.0011453886,0.00016281106],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006619284,0.00033046157,0.00034806918,0.0011994354,0.0003274416,0.0015873468,0.0064199767,0.0003513655,0.000022679013],"category_scores_gemma":[0.0020011538,0.00026008429,0.00013742491,0.0018234313,0.00009600066,0.00043640658,0.0052996655,0.0039718584,0.000051571416],"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.00005772847,0.0049583134,0.0148725,0.0016599714,0.00024577373,0.00019259861,0.016320145,0.20209953,0.000060616698,0.15567595,0.056456212,0.54740065],"study_design_scores_gemma":[0.00025357795,0.000028370801,0.014080974,0.00015919487,0.0000051482775,0.000006730131,0.00009778502,0.9651543,0.0000060954944,0.011242911,0.008726643,0.00023830678],"about_ca_topic_score_codex":0.00066787447,"about_ca_topic_score_gemma":0.00036184498,"teacher_disagreement_score":0.7926619,"about_ca_system_score_codex":0.00027730974,"about_ca_system_score_gemma":0.0016626419,"threshold_uncertainty_score":0.99998516},"labels":[],"label_agreement":null}]}