{"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":"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.010776874,0.00077211787,0.95603657,0.007170588,0.0007310059,0.00045657184,0.0010732192,0.0014780321,0.021505011],"genre_scores_gemma":[0.3258776,0.002358636,0.6338556,0.00743828,0.0030266198,0.003102779,0.0016713402,0.0014751966,0.021193938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902367,0.0019829585,0.0005387061,0.0023235576,0.003963521,0.0009544746],"domain_scores_gemma":[0.9635558,0.023349186,0.0017260228,0.005991615,0.0034987514,0.0018784903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063589835,0.0029514718,0.00257545,0.0024500766,0.0035129488,0.0048993435,0.005386018,0.0027284212,0.02601148],"category_scores_gemma":[0.0367177,0.0017041336,0.0054132454,0.003614735,0.008681028,0.019695442,0.01456771,0.020200467,0.004073005],"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.00042911488,0.00044976454,0.0010210143,0.0008493697,0.00017260567,0.0006087534,0.00081026397,0.029813122,0.014878546,0.87318456,0.02116211,0.05662081],"study_design_scores_gemma":[0.00017086977,0.00020840243,0.00049483846,0.00012628932,0.00007354164,0.00043937447,0.00014628065,0.08207352,0.008346268,0.8863983,0.021417186,0.00010512895],"about_ca_topic_score_codex":0.0016789784,"about_ca_topic_score_gemma":0.0013139666,"teacher_disagreement_score":0.02601148,"about_ca_system_score_codex":0.0030711622,"about_ca_system_score_gemma":0.0046410244,"threshold_uncertainty_score":0.087017},"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":"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.09224707,0.00037671666,0.89788884,0.0014383231,0.000089054614,0.00021681783,0.0006561152,0.002332042,0.0047550634],"genre_scores_gemma":[0.7525291,0.0001744344,0.24146198,0.00044536294,0.00015669233,0.00032290994,0.0020821353,0.00035901935,0.0024683466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902159,0.003831798,0.00062176434,0.0019473861,0.0026013344,0.0007818641],"domain_scores_gemma":[0.91912514,0.05475325,0.004106475,0.015664684,0.004592613,0.0017577418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006832929,0.0017636879,0.002517416,0.0015125514,0.001429109,0.0037349907,0.005049545,0.0026369873,0.005000272],"category_scores_gemma":[0.054972183,0.0008613442,0.0021114121,0.0018448761,0.004106242,0.007186215,0.005944785,0.0043182806,0.0017650528],"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.0029153223,0.0007833216,0.03488061,0.000617904,0.00045226765,0.0011650312,0.00059646205,0.4599245,0.015936008,0.17451382,0.016598629,0.29161608],"study_design_scores_gemma":[0.000055209628,0.00014877302,0.0015726119,0.00001999135,0.000024208066,0.00033765982,0.00008803731,0.90387774,0.0058648516,0.08712952,0.0008506767,0.00003077084],"about_ca_topic_score_codex":0.0014982976,"about_ca_topic_score_gemma":0.0015264694,"teacher_disagreement_score":0.006832929,"about_ca_system_score_codex":0.0020304276,"about_ca_system_score_gemma":0.0020967207,"threshold_uncertainty_score":0.03613639},"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":"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.018578693,0.00014587402,0.9748615,0.00025213088,0.000030478543,0.000053851025,0.00031337494,0.003953492,0.0018105601],"genre_scores_gemma":[0.5368339,0.00021696012,0.45890132,0.00020275977,0.000065309454,0.0002611108,0.00076831365,0.00097415043,0.0017760445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934768,0.001958253,0.0003190816,0.00096727273,0.0027462954,0.0005323022],"domain_scores_gemma":[0.9844454,0.01099169,0.0008060925,0.0025430906,0.00103865,0.00017511615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034705836,0.001324372,0.0014114005,0.0019108506,0.000673077,0.0026043851,0.0018039165,0.0009555294,0.0051047243],"category_scores_gemma":[0.027863244,0.0008454822,0.0015371419,0.0014027654,0.0020233518,0.0059037376,0.00346411,0.0022630382,0.0006760081],"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.00041325067,0.00009846653,0.0028144787,0.00046260434,0.00011877059,0.0001718386,0.00024834703,0.58273554,0.014017022,0.20977485,0.0047924547,0.18435237],"study_design_scores_gemma":[0.000023297773,0.000027681619,0.00019155427,0.000020898153,0.00001607501,0.000023876615,0.000020485642,0.88227445,0.008461413,0.10764904,0.0012736394,0.000017628783],"about_ca_topic_score_codex":0.0029392764,"about_ca_topic_score_gemma":0.004498207,"teacher_disagreement_score":0.0051047243,"about_ca_system_score_codex":0.0021251573,"about_ca_system_score_gemma":0.003768411,"threshold_uncertainty_score":0.018354416},"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":"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.054845937,0.0007793094,0.9354529,0.0016790949,0.00011852644,0.00021918841,0.0010589039,0.0007088943,0.005137319],"genre_scores_gemma":[0.65074974,0.0015545157,0.33296725,0.000831526,0.00069484324,0.0007585709,0.0025268532,0.00030314995,0.009613609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99309856,0.0024829237,0.00038453523,0.0018023731,0.0014832536,0.0007483446],"domain_scores_gemma":[0.97281986,0.017799014,0.0017878361,0.0052444316,0.0013865795,0.00096240296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051324405,0.0012778491,0.0026228302,0.0010953884,0.0013152981,0.0028252082,0.0042260233,0.002042578,0.005173711],"category_scores_gemma":[0.0196814,0.0010584727,0.002070875,0.0025332794,0.0027003582,0.008880652,0.0031429017,0.0039746007,0.0012357445],"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.0008943733,0.0003681168,0.0018649639,0.0005279647,0.00018762983,0.00046110366,0.00038506193,0.45085484,0.0060223304,0.48842287,0.007986369,0.042024367],"study_design_scores_gemma":[0.000072851064,0.00007798699,0.00022244029,0.000017534485,0.00002380252,0.00016869111,0.00003986625,0.6945204,0.001357578,0.30144846,0.0020264026,0.000024054958],"about_ca_topic_score_codex":0.0018225637,"about_ca_topic_score_gemma":0.0016665022,"teacher_disagreement_score":0.005173711,"about_ca_system_score_codex":0.002198236,"about_ca_system_score_gemma":0.0018024988,"threshold_uncertainty_score":0.02714324},"labels":[],"label_agreement":null}]}