{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.003742256,0.0004705187,0.0007567636,0.0008909199,0.000219607,0.001503466,0.01203764,0.0002969388,0.0001690106],"category_scores_gemma":[0.001643577,0.0004229799,0.0001247461,0.005205768,0.0002180848,0.001310691,0.02939868,0.001460264,0.00003315472],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003634293,"about_ca_system_score_gemma":0.005952073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002571771,"about_ca_topic_score_gemma":0.003381526,"domain_scores_codex":[0.9912956,0.0007276591,0.00108525,0.003079252,0.002896801,0.0009154237],"domain_scores_gemma":[0.9784939,0.0005980637,0.000458976,0.01312682,0.00648637,0.0008359016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001195509,0.008301343,0.008998633,0.002301781,0.0006732335,0.00002693517,0.004324437,0.006609353,0.0002093576,0.02236111,0.1132455,0.8328288],"study_design_scores_gemma":[0.001775679,0.0007600171,0.06348181,0.0005318829,0.0000831221,0.00004671462,0.001101208,0.5863728,0.001542198,0.02721635,0.3150425,0.002045755],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0199557,0.0002920015,0.9372671,0.03456855,0.0001080608,0.004977423,0.002195179,0.0003095919,0.0003263865],"genre_scores_gemma":[0.3260747,0.00008648066,0.6170365,0.0006609287,0.001099834,0.002859753,0.04990241,0.0001562752,0.002123076],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8307831,"threshold_uncertainty_score":0.9998222,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003236503,0.0002865097,0.0004596835,0.001149028,0.0001785809,0.0007213808,0.00340214,0.0004079425,0.0000497779],"category_scores_gemma":[0.001009453,0.0002883775,0.0001565942,0.002013445,0.0001499201,0.0007045027,0.004144304,0.001431789,0.00006974836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002355422,"about_ca_system_score_gemma":0.001956325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004638946,"about_ca_topic_score_gemma":0.0000419577,"domain_scores_codex":[0.9948418,0.000752624,0.0009008251,0.001173053,0.001726932,0.0006048138],"domain_scores_gemma":[0.9906676,0.000356548,0.0003862723,0.001936163,0.006418904,0.0002344989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001217903,0.004121895,0.002295068,0.003019935,0.0003664271,0.000007183236,0.001877473,0.01882737,0.001439675,0.5284091,0.1239818,0.3155323],"study_design_scores_gemma":[0.0004368483,0.0001081636,0.004035848,0.0006411827,0.00001425153,0.000001606133,0.00003350586,0.9123205,0.001552525,0.07055213,0.009931261,0.0003721511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01596292,0.0007948698,0.9568836,0.01975941,0.0005276239,0.001217979,0.000403087,0.0003710481,0.004079453],"genre_scores_gemma":[0.8364152,0.0007488742,0.1489969,0.0004382026,0.000340819,0.0004099488,0.00329918,0.00004025217,0.009310568],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8934932,"threshold_uncertainty_score":0.9999568,"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":"codex-gemma-dda1882f352a","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.001131378,0.001495491,0.003082987,0.008141756,0.0004754491,0.0002262622],"category_scores_gemma":[0.01232564,0.0004747968,0.0002399862,0.001284865,0.0006566349,0.001033113,0.009581332,0.003068982,0.000186689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003253549,"about_ca_system_score_gemma":0.003153892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003825236,"about_ca_topic_score_gemma":0.0002376111,"domain_scores_codex":[0.9921575,0.0009129244,0.0007998015,0.001938384,0.003082829,0.001108516],"domain_scores_gemma":[0.982688,0.002928163,0.0006467062,0.005855918,0.007333784,0.0005474512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009494103,0.004531993,0.01669582,0.00113383,0.0003794012,0.00008124734,0.0003278068,0.00358852,0.0002384692,0.5699143,0.08993354,0.3130802],"study_design_scores_gemma":[0.0007853109,0.0001203429,0.08618635,0.0002821282,0.00001047445,0.000006459363,0.000006617046,0.6934743,0.0002079207,0.1809181,0.03730653,0.0006954664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08857265,0.0007826533,0.6721266,0.2193003,0.004142152,0.004378583,0.004917312,0.002604602,0.003175125],"genre_scores_gemma":[0.3337301,0.00003425838,0.6537194,0.001741504,0.001426022,0.0005225867,0.00754892,0.00008837736,0.001188879],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6898858,"threshold_uncertainty_score":0.9998044,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006619284,0.0003304616,0.0003480692,0.001199435,0.0003274416,0.001587347,0.006419977,0.0003513655,0.00002267901],"category_scores_gemma":[0.002001154,0.0002600843,0.0001374249,0.001823431,0.00009600066,0.0004364066,0.005299665,0.003971858,0.00005157142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002773097,"about_ca_system_score_gemma":0.001662642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006678745,"about_ca_topic_score_gemma":0.000361845,"domain_scores_codex":[0.9935878,0.001494253,0.0006923072,0.001288097,0.002143277,0.0007942999],"domain_scores_gemma":[0.9946267,0.0008950291,0.0002303692,0.00293969,0.001145389,0.0001628111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005772847,0.004958313,0.0148725,0.001659971,0.0002457737,0.0001925986,0.01632014,0.2020995,0.0000606167,0.1556759,0.05645621,0.5474007],"study_design_scores_gemma":[0.0002535779,0.0000283708,0.01408097,0.0001591949,0.000005148278,0.000006730131,0.00009778502,0.9651543,0.000006095494,0.01124291,0.008726643,0.0002383068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1722529,0.001467241,0.4975692,0.2798316,0.001699868,0.006786907,0.001484667,0.001441143,0.03746644],"genre_scores_gemma":[0.9649148,0.0002095648,0.02000164,0.001842047,0.0003120251,0.0007598908,0.001843936,0.00003390116,0.01008217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7926619,"threshold_uncertainty_score":0.9999852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}