{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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":"7dcbdbd02fca","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Computer science; Communication complexity; Business; Mathematics; Theoretical computer science","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.2704365388557047,"gpt":0.4576145449371414,"spread":0.1871780060814367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006358983,0.002951472,0.00257545,0.002450077,0.003512949,0.004899343,0.005386018,0.002728421,0.02601148],"category_scores_gemma":[0.0367177,0.001704134,0.005413245,0.003614735,0.008681028,0.01969544,0.01456771,0.02020047,0.004073005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003071162,"about_ca_system_score_gemma":0.004641024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001678978,"about_ca_topic_score_gemma":0.001313967,"domain_scores_codex":[0.9902367,0.001982959,0.0005387061,0.002323558,0.003963521,0.0009544746],"domain_scores_gemma":[0.9635558,0.02334919,0.001726023,0.005991615,0.003498751,0.00187849],"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.0004291149,0.0004497645,0.001021014,0.0008493697,0.0001726057,0.0006087534,0.000810264,0.02981312,0.01487855,0.8731846,0.02116211,0.05662081],"study_design_scores_gemma":[0.0001708698,0.0002084024,0.0004948385,0.0001262893,0.00007354164,0.0004393745,0.0001462807,0.08207352,0.008346268,0.8863983,0.02141719,0.000105129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01077687,0.0007721179,0.9560366,0.007170588,0.0007310059,0.0004565718,0.001073219,0.001478032,0.02150501],"genre_scores_gemma":[0.3258776,0.002358636,0.6338556,0.00743828,0.00302662,0.003102779,0.00167134,0.001475197,0.02119394],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02601148,"threshold_uncertainty_score":0.087017,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1509430155818791,"gpt":0.4323619243170549,"spread":0.2814189087351758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003470584,0.001324372,0.001411401,0.001910851,0.000673077,0.002604385,0.001803917,0.0009555294,0.005104724],"category_scores_gemma":[0.02786324,0.0008454822,0.001537142,0.001402765,0.002023352,0.005903738,0.00346411,0.002263038,0.0006760081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002125157,"about_ca_system_score_gemma":0.003768411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002939276,"about_ca_topic_score_gemma":0.004498207,"domain_scores_codex":[0.9934768,0.001958253,0.0003190816,0.0009672727,0.002746295,0.0005323022],"domain_scores_gemma":[0.9844454,0.01099169,0.0008060925,0.002543091,0.00103865,0.0001751161],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004132507,0.00009846653,0.002814479,0.0004626043,0.0001187706,0.0001718386,0.000248347,0.5827355,0.01401702,0.2097749,0.004792455,0.1843524],"study_design_scores_gemma":[0.00002329777,0.00002768162,0.0001915543,0.00002089815,0.00001607501,0.00002387662,0.00002048564,0.8822744,0.008461413,0.107649,0.001273639,0.00001762878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01857869,0.000145874,0.9748615,0.0002521309,0.00003047854,0.00005385102,0.0003133749,0.003953492,0.00181056],"genre_scores_gemma":[0.5368339,0.0002169601,0.4589013,0.0002027598,0.00006530945,0.0002611108,0.0007683137,0.0009741504,0.001776044],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005104724,"threshold_uncertainty_score":0.01835442,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.3264675902913521,"gpt":0.4352698718725549,"spread":0.1088022815812028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006832929,0.001763688,0.002517416,0.001512551,0.001429109,0.003734991,0.005049545,0.002636987,0.005000272],"category_scores_gemma":[0.05497218,0.0008613442,0.002111412,0.001844876,0.004106242,0.007186215,0.005944785,0.004318281,0.001765053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002030428,"about_ca_system_score_gemma":0.002096721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001498298,"about_ca_topic_score_gemma":0.001526469,"domain_scores_codex":[0.9902159,0.003831798,0.0006217643,0.001947386,0.002601334,0.0007818641],"domain_scores_gemma":[0.9191251,0.05475325,0.004106475,0.01566468,0.004592613,0.001757742],"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.002915322,0.0007833216,0.03488061,0.000617904,0.0004522676,0.001165031,0.0005964621,0.4599245,0.01593601,0.1745138,0.01659863,0.2916161],"study_design_scores_gemma":[0.00005520963,0.000148773,0.001572612,0.00001999135,0.00002420807,0.0003376598,0.00008803731,0.9038777,0.005864852,0.08712952,0.0008506767,0.00003077084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09224707,0.0003767167,0.8978888,0.001438323,0.00008905461,0.0002168178,0.0006561152,0.002332042,0.004755063],"genre_scores_gemma":[0.7525291,0.0001744344,0.241462,0.0004453629,0.0001566923,0.0003229099,0.002082135,0.0003590194,0.002468347],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006832929,"threshold_uncertainty_score":0.03613639,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1230185834967336,"gpt":0.4419573875544732,"spread":0.3189388040577396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00513244,0.001277849,0.00262283,0.001095388,0.001315298,0.002825208,0.004226023,0.002042578,0.005173711],"category_scores_gemma":[0.0196814,0.001058473,0.002070875,0.002533279,0.002700358,0.008880652,0.003142902,0.003974601,0.001235744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002198236,"about_ca_system_score_gemma":0.001802499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001822564,"about_ca_topic_score_gemma":0.001666502,"domain_scores_codex":[0.9930986,0.002482924,0.0003845352,0.001802373,0.001483254,0.0007483446],"domain_scores_gemma":[0.9728199,0.01779901,0.001787836,0.005244432,0.001386579,0.000962403],"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.0008943733,0.0003681168,0.001864964,0.0005279647,0.0001876298,0.0004611037,0.0003850619,0.4508548,0.00602233,0.4884229,0.007986369,0.04202437],"study_design_scores_gemma":[0.00007285106,0.00007798699,0.0002224403,0.00001753448,0.00002380252,0.0001686911,0.00003986625,0.6945204,0.001357578,0.3014485,0.002026403,0.00002405496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05484594,0.0007793094,0.9354529,0.001679095,0.0001185264,0.0002191884,0.001058904,0.0007088943,0.005137319],"genre_scores_gemma":[0.6507497,0.001554516,0.3329673,0.000831526,0.0006948432,0.0007585709,0.002526853,0.00030315,0.009613609],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005173711,"threshold_uncertainty_score":0.02714324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}