{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":106,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":106,"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"},"query_hash":"252b0e7a09be","filters":{"venue":"Combinatorics Probability Computing"}},"results":[{"id":"W2119305988","doi":"10.1017/s0963548301004758","title":"A Note on Vertex List Colouring","year":2001,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":115,"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; Vertex (graph theory); Conjecture; Mathematics; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03238984281134506,"gpt":0.3031178416169424,"spread":0.2707279988055973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001737763,0.0002813741,0.0003253175,0.0002143691,0.000602591,0.0002465737,0.002000626,0.0001139127,0.00000882559],"category_scores_gemma":[0.0009702017,0.0002905845,0.0001351007,0.001758281,0.0001542572,0.0003973533,0.001222087,0.0006659862,0.00009538655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004887923,"about_ca_system_score_gemma":0.000125036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000126626,"about_ca_topic_score_gemma":0.000003543398,"domain_scores_codex":[0.996748,0.0003296956,0.0004361167,0.0009497185,0.0006975406,0.0008389789],"domain_scores_gemma":[0.9966853,0.0011082,0.0001472154,0.001486571,0.0003128645,0.0002598359],"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.0000288578,0.0004397623,0.008465779,0.00004401775,0.00001061259,0.00006642018,0.0004534144,0.001679704,0.0001861744,0.956898,0.00009104685,0.03163615],"study_design_scores_gemma":[0.0006749953,0.000307497,0.003311282,0.00006761069,0.000002686307,0.00003325564,0.000009905015,0.1506204,0.0008526476,0.8414813,0.002277022,0.0003613796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5487,0.00008632569,0.4376927,0.001011535,0.001299568,0.0006311546,7.804934e-7,0.0008039616,0.009773996],"genre_scores_gemma":[0.9872321,0.000007316563,0.01232653,0.0002077644,0.00005293774,0.00001139302,0.000001279704,0.00002279607,0.0001378893],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4385321,"threshold_uncertainty_score":0.9999546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119116325","doi":"10.1017/s0963548309990290","title":"Conflict-Free Colourings of Graphs and Hypergraphs","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; Neighbourhood (mathematics); Vertex (graph theory); Lemma (botany); Upper and lower bounds; Graph; Chromatic scale; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02230752856673305,"gpt":0.2705696345529421,"spread":0.248262105986209,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001511399,0.0002315977,0.000408683,0.0002689169,0.0002619063,0.00009207043,0.001908245,0.0001045005,0.00000137154],"category_scores_gemma":[0.0006881881,0.0002372758,0.0001127618,0.001464656,0.000327838,0.0003660878,0.001055914,0.0003660635,0.000001550197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005922692,"about_ca_system_score_gemma":0.00006987763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007560571,"about_ca_topic_score_gemma":6.372611e-7,"domain_scores_codex":[0.9975758,0.0002016395,0.0005065916,0.0006855439,0.0005027234,0.0005276997],"domain_scores_gemma":[0.9971592,0.0005250247,0.000219194,0.001474088,0.0004164281,0.0002060113],"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.00001162725,0.0002095178,0.009404681,0.00006040159,0.00001123083,0.00000511148,0.0005109728,0.00005738907,0.000876599,0.9778544,0.00004467958,0.01095337],"study_design_scores_gemma":[0.0007578725,0.0004109896,0.02155998,0.00003734579,0.000004575665,0.00001744019,0.00001650216,0.008213989,0.002539543,0.9660839,0.0001316667,0.0002262344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9432079,0.000697325,0.05242458,0.0007159051,0.000229525,0.0005339244,0.000001801399,0.0003420642,0.001846957],"genre_scores_gemma":[0.9740596,0.00002699733,0.02577903,0.00009528721,0.000007047705,0.000003100573,6.843646e-7,0.000009068669,0.00001912587],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03085174,"threshold_uncertainty_score":0.9675827,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127274797","doi":"10.1017/s0963548306007760","title":"Rainbow Turán Problems","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":78,"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; Bipartite graph; Rainbow; Mathematics; Graph; Complete bipartite graph; Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03322687722485506,"gpt":0.2691535873263459,"spread":0.2359267101014909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001490529,0.0002957523,0.0004012849,0.00009211451,0.0006431299,0.0000784458,0.0004992655,0.0001732677,0.00002466479],"category_scores_gemma":[0.0006070075,0.0002616698,0.0001853244,0.0004739585,0.0001897367,0.00009878985,0.0004511103,0.0004077055,0.000006351567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001667735,"about_ca_system_score_gemma":0.00004335541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003039697,"about_ca_topic_score_gemma":0.000004744877,"domain_scores_codex":[0.9976746,0.0002079892,0.0006609167,0.0005201322,0.0004007982,0.0005355731],"domain_scores_gemma":[0.9978673,0.000795099,0.0002575793,0.0007515493,0.0002417613,0.00008663705],"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.000004852942,0.0002565474,0.01161407,0.0002687361,0.00001602967,0.000003538893,0.0004305629,0.0001697221,0.00005320627,0.9851656,0.0009932732,0.001023842],"study_design_scores_gemma":[0.0004978465,0.00005119957,0.003471069,0.00004837302,0.00002024656,0.00001420805,0.00002005975,0.001724454,0.000311272,0.9920498,0.00147621,0.0003152391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9718006,0.0002286392,0.00599219,0.0001435563,0.001215224,0.0007405848,0.000003133059,0.0005612157,0.01931482],"genre_scores_gemma":[0.9898849,0.00000134173,0.009523256,0.00004404484,0.0002043183,0.000009378255,0.000005409179,0.00004041722,0.0002869151],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0190279,"threshold_uncertainty_score":0.9999835,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018074536","doi":"10.1017/s0963548301004965","title":"The Chromatic Number of Graph Powers","year":2002,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Simon Fraser University","keywords":"Mathematics; Graph; Combinatorics; Chromatic scale; Friendship graph; Windmill graph; Discrete mathematics; Graph power; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02818838614938516,"gpt":0.2838933543736482,"spread":0.255704968224263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001861451,0.0001869478,0.0002655566,0.00007432451,0.0005842313,0.0001292738,0.002224397,0.00006593098,0.00001376001],"category_scores_gemma":[0.0007600894,0.000146254,0.000154106,0.001707072,0.0004279413,0.0002878745,0.0008992896,0.0003568348,0.00005141832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001160024,"about_ca_system_score_gemma":0.00003428831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004915273,"about_ca_topic_score_gemma":6.954239e-7,"domain_scores_codex":[0.9973875,0.0003772213,0.0005437505,0.0004720356,0.0006426628,0.0005768278],"domain_scores_gemma":[0.9962804,0.001506481,0.0002437132,0.001485303,0.0003563167,0.0001277847],"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.000002410985,0.0002039045,0.00867572,0.0000712141,0.00002094336,0.000003174162,0.0006975774,0.0001635131,0.00005345363,0.9758581,0.0001614748,0.01408853],"study_design_scores_gemma":[0.0002939012,0.00006507032,0.001509243,0.00003016625,0.000003012664,0.00001653018,0.00003075236,0.07472271,0.0004061783,0.9224324,0.0003233826,0.0001666908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6868468,0.0008556366,0.2964505,0.001117547,0.001274269,0.0009092809,0.000001136854,0.0004526078,0.01209228],"genre_scores_gemma":[0.9890395,0.00002225125,0.01078403,0.00002607029,0.00001415419,0.000007484587,2.69407e-7,0.0000127588,0.00009350313],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3021927,"threshold_uncertainty_score":0.5964066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968569626","doi":"10.1017/s0963548302005321","title":"The Wiener Index of Random Trees","year":2002,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Wiener index; Bivariate analysis; Limit (mathematics); Limit of a function; Probabilistic logic; Index (typography); Binary number; Random variable; Applied mathematics; Statistical physics; Statistics; Mathematical analysis; Combinatorics; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0516463126219221,"gpt":0.2780597385568273,"spread":0.2264134259349052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001362179,0.0001253034,0.0002309879,0.00003249701,0.0004556183,0.00003075975,0.0004182349,0.00006324291,0.00001572766],"category_scores_gemma":[0.0009695332,0.00009018093,0.0001251533,0.0004423279,0.0002361089,0.00004571442,0.0001388923,0.0001890935,0.000006090098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003462457,"about_ca_system_score_gemma":0.00001079884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000334152,"about_ca_topic_score_gemma":0.000003744645,"domain_scores_codex":[0.998688,0.0001924774,0.0004663981,0.0002098438,0.0002140919,0.0002291274],"domain_scores_gemma":[0.9964745,0.002415067,0.000234616,0.0006488053,0.0001769313,0.00005007795],"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.000008085162,0.0003073509,0.003806466,0.00004442246,0.0000184315,1.811841e-7,0.0004533374,0.00004861811,0.00004485809,0.9906207,0.0003404963,0.00430704],"study_design_scores_gemma":[0.0006532516,0.00002630579,0.000856251,0.00002008959,0.00001574932,0.000001880378,0.0000580081,0.01119891,0.0004188618,0.9858222,0.0008305536,0.00009793676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9846083,0.0002595784,0.007616933,0.0003898984,0.0002177249,0.0005497437,0.000001684289,0.0001246005,0.006231516],"genre_scores_gemma":[0.9990141,0.0000091389,0.0007556573,0.00001187548,0.00002381155,0.00001543136,4.790236e-7,0.00001239838,0.0001570965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01440579,"threshold_uncertainty_score":0.3677471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031110152","doi":"10.1017/s0963548399004162","title":"Zeros of Reliability Polynomials and <i>f</i>-vectors of Matroids","year":2000,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":56,"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":"Matroid; Multigraph; Mathematics; Combinatorics; Interlacing; Order (exchange); Conjecture; Series (stratigraphy); Discrete mathematics; Function (biology); Hermite polynomials; Polynomial; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02961836125564239,"gpt":0.2931619989030069,"spread":0.2635436376473645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001952033,0.0003433766,0.001087099,0.00009004469,0.0001280311,0.00001910662,0.0004698285,0.0001944918,0.00004716949],"category_scores_gemma":[0.002700193,0.0003418317,0.0001865566,0.0005785194,0.0004357468,0.0001570665,0.0002905344,0.0003135857,0.000002821605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001569522,"about_ca_system_score_gemma":0.00009819981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002527979,"about_ca_topic_score_gemma":5.37786e-7,"domain_scores_codex":[0.9966798,0.0002810832,0.001573828,0.000533267,0.000510908,0.0004210547],"domain_scores_gemma":[0.9953527,0.002272685,0.0006893774,0.001118323,0.0004219306,0.0001449876],"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.0001066757,0.001851405,0.01600521,0.003790664,0.00006996446,0.000001898793,0.002024468,0.0002230755,0.003242823,0.9652929,0.0001011507,0.007289818],"study_design_scores_gemma":[0.0009186458,0.0002539701,0.001024902,0.000178582,0.00005589096,0.000007146797,0.00005590071,0.0008557397,0.01807666,0.9782277,0.00006855444,0.0002763165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.994755,0.0001333272,0.002362557,0.00005049213,0.0003640141,0.0008598871,0.00001033456,0.0001552874,0.001309158],"genre_scores_gemma":[0.9680338,0.00001620745,0.0317937,0.000007282973,0.00003684088,0.000007574088,0.00000152453,0.00004493424,0.0000581473],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02943114,"threshold_uncertainty_score":0.9999034,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112317227","doi":"10.1017/s0963548312000107","title":"Non-Three-Colourable Common Graphs Exist","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Conjecture; Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.04941527205811196,"gpt":0.3042241545118432,"spread":0.2548088824537312,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00254386,0.000363432,0.0005691124,0.0001184224,0.0009725147,0.00006666311,0.0006471419,0.000226163,0.00003054715],"category_scores_gemma":[0.0005512604,0.0003294017,0.0002413242,0.0006014059,0.000241912,0.0002324693,0.0006781023,0.0005995775,0.00001452428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002032316,"about_ca_system_score_gemma":0.0000367249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002999683,"about_ca_topic_score_gemma":0.000007972046,"domain_scores_codex":[0.9973768,0.0001807625,0.0006813574,0.0004154069,0.0004356848,0.0009099808],"domain_scores_gemma":[0.9972179,0.0009751764,0.0003095649,0.001024438,0.0001947954,0.0002781166],"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.00001131429,0.000389992,0.1842996,0.0002307496,0.00003575948,0.000001585404,0.001129267,0.000009655701,0.00002073003,0.8120182,0.0005832817,0.001269813],"study_design_scores_gemma":[0.0004889476,0.00007284405,0.02116787,0.00005218774,0.0000433811,0.00001773121,0.00005822929,0.000749959,0.0003769726,0.9762046,0.0003813337,0.0003859102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9760177,0.0002570966,0.001382538,0.00006019045,0.002379173,0.0006817594,0.000002977398,0.0003173231,0.01890123],"genre_scores_gemma":[0.9934244,0.000002809986,0.006247925,0.00007828524,0.0001084999,0.00001287124,0.000004200912,0.00005056982,0.00007047091],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1641864,"threshold_uncertainty_score":0.9999158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130524435","doi":"10.1017/s0963548306008133","title":"Searching for a Black Hole in Synchronous Tree Networks","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Tree traversal; Node (physics); Tree (set theory); Black box; Black hole (networking); Computer science; Class (philosophy); TRACE (psycholinguistics); Mathematics; Algorithm; Combinatorics; Computer network; Physics; Artificial intelligence; Routing (electronic design automation)","retraction":null,"screen_n_in":null,"score":{"opus":0.0150184468477144,"gpt":0.2385637551410454,"spread":0.223545308293331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002557869,0.0003135304,0.000404971,0.0002082838,0.0002835533,0.0003277408,0.001503601,0.0001136123,0.00000167628],"category_scores_gemma":[0.00011887,0.0003496108,0.0001613091,0.001294319,0.0001014869,0.0002990781,0.001087149,0.0003951386,0.000009270102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009206422,"about_ca_system_score_gemma":0.0001297879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001761713,"about_ca_topic_score_gemma":0.00008312742,"domain_scores_codex":[0.9965101,0.0002822582,0.0007464017,0.001043208,0.0003997266,0.001018271],"domain_scores_gemma":[0.9975967,0.0007725446,0.0002302682,0.0011283,0.0001548337,0.0001173454],"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.000006465321,0.0003172641,0.003531021,0.000127583,0.000008118789,0.00001195579,0.0001233957,0.6338146,0.000007149757,0.325654,0.0004204847,0.03597794],"study_design_scores_gemma":[0.0009199529,0.0001220663,0.005365801,0.00006743651,0.000005507524,0.000001033638,0.000008714585,0.832991,0.00003707351,0.1595692,0.0006144464,0.0002978316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2008115,0.0002005638,0.7942917,0.000297387,0.0006114536,0.001618368,5.245775e-7,0.0003335185,0.00183491],"genre_scores_gemma":[0.9688289,0.00000361936,0.03070234,0.0001175106,0.0001743012,0.00007302011,0.00001087264,0.00002806805,0.00006139778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7680174,"threshold_uncertainty_score":0.9998956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092923474","doi":"10.1017/s0963548314000145","title":"Singularity Analysis Via the Iterated Kernel Method","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Iterated function; Mathematics; Singularity; Random walk; Lattice (music); Diagonal; Kernel (algebra); Resummation; Path (computing); Combinatorics; Mathematical analysis; Geometry; Computer science; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03995653147379943,"gpt":0.3344978425721223,"spread":0.2945413110983229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006377353,0.0004795876,0.00101514,0.0001878698,0.0007431628,0.0002004282,0.001103913,0.0002310936,0.00002036612],"category_scores_gemma":[0.007158377,0.0003763289,0.0004581648,0.002994817,0.0001745849,0.0001611958,0.0006706035,0.0007675537,0.00001856572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003668534,"about_ca_system_score_gemma":0.00006248656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002675512,"about_ca_topic_score_gemma":0.000008382139,"domain_scores_codex":[0.9952233,0.001360097,0.001148844,0.0008035153,0.0007675863,0.0006966015],"domain_scores_gemma":[0.9902218,0.006087811,0.0007116139,0.002022372,0.0007713751,0.0001850515],"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.000009769696,0.0005354757,0.00242094,0.0002125699,0.0003407263,0.000001818743,0.001000794,0.001099364,0.0000766056,0.9906433,0.00006904635,0.003589623],"study_design_scores_gemma":[0.0004327881,0.00006087229,0.0004668114,0.00002506238,0.0004655331,0.000006778133,0.00003030843,0.2283617,0.0004306493,0.7691142,0.0002766975,0.0003286347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1505853,0.00003266247,0.8454197,0.000274709,0.0008531564,0.0006931351,0.000001823761,0.000499003,0.001640534],"genre_scores_gemma":[0.8216344,6.064795e-7,0.1780122,0.00008518237,0.0001243106,0.00001626639,0.000006298803,0.00005202844,0.00006867093],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6710491,"threshold_uncertainty_score":0.9998689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992296250","doi":"10.1017/s096354830300587x","title":"Rainbow Arithmetic Progressions and Anti-Ramsey Results","year":2003,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Univerzita Karlova v Praze","keywords":"Rainbow; Van der Waerden's theorem; Arithmetic progression; Mathematics; Monochromatic color; Arithmetic; Class (philosophy); Combinatorics; Term (time); Ramsey theory; Discrete mathematics; Computer science; Physics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04527451832759227,"gpt":0.3025124357384132,"spread":0.257237917410821,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002514718,0.0002817309,0.000425459,0.00009665554,0.0008332693,0.00009032161,0.0002765994,0.000178463,0.000006180015],"category_scores_gemma":[0.005821587,0.0002374284,0.0001005623,0.0004614614,0.0003030193,0.00008417136,0.0003381931,0.0004569934,0.000001496756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007536739,"about_ca_system_score_gemma":0.0000623027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002631654,"about_ca_topic_score_gemma":6.508977e-7,"domain_scores_codex":[0.9974937,0.0004700513,0.0006307141,0.0005981025,0.0003260075,0.0004813639],"domain_scores_gemma":[0.9972156,0.001404215,0.0002573573,0.0007306257,0.0002118759,0.0001803675],"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.000009886804,0.0002395622,0.01041162,0.0002040987,0.00002645944,0.000006785462,0.001397534,0.00000939757,0.00001900028,0.9850776,0.0002166427,0.002381478],"study_design_scores_gemma":[0.000980348,0.00007261147,0.003748818,0.00009723973,0.00003026412,0.00003940044,0.00009961865,0.0005788525,0.0003218105,0.9929103,0.0008275728,0.0002931608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9909779,0.000306482,0.001267729,0.0001515338,0.0008461097,0.000695027,0.000005503598,0.0002597384,0.005489983],"genre_scores_gemma":[0.9752156,0.000008830008,0.02458804,0.00004060349,0.0000358637,0.000006680249,0.000002411976,0.00002983965,0.0000720848],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02332032,"threshold_uncertainty_score":0.9682047,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158059367","doi":"10.1017/s0963548310000325","title":"The Diameter of Sparse Random Graphs","year":2010,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":47,"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":"Random graph; Graph; Scaling; Range (aeronautics); Limiting; Branching process; Simple (philosophy); Random variable; Term (time)","retraction":null,"screen_n_in":null,"score":{"opus":0.03636316430497043,"gpt":0.2971895916745583,"spread":0.2608264273695879,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001884319,0.0001703877,0.0003477206,0.00003358413,0.0003117499,0.00004933307,0.0004774981,0.0001031217,0.00001109614],"category_scores_gemma":[0.01157632,0.0001177964,0.000126516,0.0003419092,0.0002173543,0.00003815095,0.0001651814,0.0004723791,0.000004052954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002201076,"about_ca_system_score_gemma":0.00006854067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005985973,"about_ca_topic_score_gemma":0.00001055127,"domain_scores_codex":[0.998347,0.0000865272,0.0006013182,0.0002764026,0.0003469503,0.0003417776],"domain_scores_gemma":[0.9920302,0.006573244,0.0002714156,0.0006240996,0.000400704,0.0001003634],"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.00002615631,0.0001738479,0.0003191406,0.0001571297,0.00001878587,9.5597e-7,0.0001648708,0.000002387994,0.0003221291,0.9916022,0.0001029035,0.007109431],"study_design_scores_gemma":[0.0007133037,0.00007893985,0.0001552454,0.00002597589,0.00003059611,0.000005277052,0.00002773514,0.01232656,0.001162544,0.9852054,0.0001357425,0.0001326701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3088658,0.0000707196,0.6872529,0.0001587821,0.001772546,0.0005956539,0.000006273572,0.0001049755,0.001172345],"genre_scores_gemma":[0.9561926,0.000003211886,0.04370555,0.00001486398,0.00003281419,0.00001007908,8.026121e-7,0.00001865076,0.00002138616],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6473269,"threshold_uncertainty_score":0.9967496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062486876","doi":"10.1017/s096354831400056x","title":"An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Ramsey's theorem; Mathematics; Monochromatic color; Graph; Linearity; Integer (computer science); Discrete mathematics; Upper and lower bounds; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02437239546565568,"gpt":0.296762292521978,"spread":0.2723898970563223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002279648,0.0001815235,0.0004657629,0.00001754804,0.0002202598,0.000009895136,0.001151207,0.00012296,0.000008657107],"category_scores_gemma":[0.004142177,0.0001051743,0.0002527634,0.0004025024,0.0005711693,0.00005371336,0.0007446563,0.0003710541,1.017875e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004836243,"about_ca_system_score_gemma":0.00006733276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003871381,"about_ca_topic_score_gemma":0.0000040562,"domain_scores_codex":[0.9974286,0.0008341742,0.0007557051,0.0002709005,0.0005022931,0.0002083289],"domain_scores_gemma":[0.9952974,0.001747438,0.0009348403,0.001379138,0.0005978529,0.00004335686],"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.00001395555,0.0005061454,0.09961752,0.0005843995,0.00003789696,6.94603e-8,0.003402797,0.0001996033,0.0001971534,0.8940825,0.00001134919,0.001346581],"study_design_scores_gemma":[0.0003595606,0.00007626237,0.01667482,0.0001261337,0.00003648491,0.000002480714,0.00006506275,0.007414504,0.02876616,0.9463587,0.0000148023,0.0001050368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.994812,0.00001233396,0.001866738,0.00004366006,0.0008974982,0.0006058029,0.000009266389,0.00002159336,0.001731139],"genre_scores_gemma":[0.9966392,3.991761e-7,0.003260014,0.0000205119,0.00004464575,0.000002556098,3.409207e-7,0.00001748254,0.00001487405],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0829427,"threshold_uncertainty_score":0.4958872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167009466","doi":"10.1017/s0963548314000601","title":"Extremal Numbers for Odd Cycles","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Bipartite graph; Graph; Upper and lower bounds; Extremal graph theory; Value (mathematics); Graph theory","retraction":null,"screen_n_in":null,"score":{"opus":0.05537113575030009,"gpt":0.3171983033842709,"spread":0.2618271676339708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002033339,0.000247069,0.0004002882,0.00006052131,0.0006441402,0.00005741881,0.0004602617,0.0001510895,0.00001086199],"category_scores_gemma":[0.00275009,0.0002242564,0.0002199118,0.0002075488,0.0001533991,0.0000766697,0.0003109095,0.0002328607,0.00000251639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001018456,"about_ca_system_score_gemma":0.00002818127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000451179,"about_ca_topic_score_gemma":0.000002364453,"domain_scores_codex":[0.9981086,0.0001984071,0.0004998193,0.000471914,0.0002577092,0.000463526],"domain_scores_gemma":[0.9963506,0.002414653,0.0002183152,0.0006715556,0.0002285812,0.0001162235],"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.00001566947,0.0001246808,0.005449578,0.0003381966,0.00002356205,3.165866e-7,0.0006825507,0.00003182885,0.00002186823,0.9861332,0.0004759245,0.00670266],"study_design_scores_gemma":[0.0006540859,0.00008865806,0.001075939,0.00003982879,0.00002948346,0.000005249989,0.0000447778,0.009121793,0.000288516,0.9867526,0.001625859,0.0002731599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8902166,0.00004548758,0.09974447,0.0001218432,0.001452601,0.0007242071,0.000003791434,0.0003320495,0.007358883],"genre_scores_gemma":[0.9639103,8.434356e-7,0.03569276,0.00007538443,0.0001901565,0.00001370383,0.000003466934,0.00003896562,0.00007435853],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07369369,"threshold_uncertainty_score":0.9144911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913888525","doi":"10.1017/s0963548306007541","title":"Rayleigh Matroids","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":44,"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":"Matroid; Graphic matroid; Combinatorics; Binary number; Matroid partitioning; Mathematics; Class (philosophy); Property (philosophy); Discrete mathematics; Computer science; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.05178645719083579,"gpt":0.3178471076443546,"spread":0.2660606504535188,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002286486,0.0002721234,0.0004399732,0.00008252117,0.0002654343,0.00007712124,0.0003688894,0.0001476331,0.00001341289],"category_scores_gemma":[0.0008148932,0.0002633301,0.0001968953,0.0004344527,0.00009232426,0.00007933746,0.000293719,0.0003201345,6.74126e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002476793,"about_ca_system_score_gemma":0.00005938292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004997266,"about_ca_topic_score_gemma":0.000008522973,"domain_scores_codex":[0.9976681,0.0003097416,0.0006489556,0.0004979342,0.0003639922,0.0005112864],"domain_scores_gemma":[0.9977181,0.0009601904,0.0002239119,0.0007314576,0.0002649571,0.0001013829],"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.000007630762,0.0003902621,0.008946351,0.0002516265,0.00001218783,0.00000773325,0.0001146331,0.00003905822,0.0003010131,0.9845838,0.002748668,0.002597024],"study_design_scores_gemma":[0.0006021671,0.00006056575,0.0007875935,0.00004053115,0.00002423298,0.00001288898,0.00003116061,0.003931907,0.001421111,0.9892208,0.003536867,0.0003301636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8720347,0.0001736085,0.08219534,0.0001934767,0.0009823213,0.0005627826,0.000002811812,0.0005335126,0.04332144],"genre_scores_gemma":[0.907667,0.000001420495,0.09135647,0.0000363452,0.0002192999,0.000009312711,0.000005256998,0.00003989824,0.0006649599],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04265648,"threshold_uncertainty_score":0.9999819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171265914","doi":"10.1017/s0963548306007498","title":"Expansion in ${\\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\\boldsymbol{{\\mathbb Z}^n}}$: the First Three Terms","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Isaac Newton Institute for Mathematical Sciences; Newton Fund","keywords":"Omega; Combinatorics; Cube (algebra); Physics; Mathematics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.05307736462868874,"gpt":0.3098784002299411,"spread":0.2568010356012523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002041709,0.0003148588,0.0004078379,0.00006182982,0.0008433282,0.0001785358,0.0004093198,0.0001697763,0.000005936088],"category_scores_gemma":[0.007115046,0.0001990732,0.0001006726,0.0003465407,0.0002275995,0.00009492674,0.0002311148,0.0004134587,0.000003277506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001724569,"about_ca_system_score_gemma":0.00005200125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003353812,"about_ca_topic_score_gemma":0.00007504878,"domain_scores_codex":[0.9976375,0.0001212798,0.0007026944,0.0005694195,0.00044323,0.0005259115],"domain_scores_gemma":[0.9860396,0.01292452,0.0001542501,0.0005561782,0.0002579018,0.00006752],"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.00003356186,0.0003851216,0.001366764,0.0004095294,0.000006812733,0.000001821008,0.000467557,0.00007249365,0.00002819043,0.9950819,0.0004009576,0.001745288],"study_design_scores_gemma":[0.0004492138,0.0001684265,0.005073877,0.0001831095,0.00003162787,0.000007062169,0.0001166253,0.1889005,0.0000792972,0.8047375,0.00005085626,0.000201892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5344771,0.0001578251,0.4571635,0.004807508,0.0005802303,0.002148862,0.0000170842,0.0001402623,0.0005076189],"genre_scores_gemma":[0.9917694,0.000002501385,0.007780419,0.0001724767,0.0001339221,0.00008826482,0.000004106869,0.00003778676,0.00001111941],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4572923,"threshold_uncertainty_score":0.8517889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042502099","doi":"10.1017/s0963548308009097","title":"On the Maximum Degree of a Random Planar Graph","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Random regular graph; Degree (music); Random graph; Vertex (graph theory); Graph; Discrete mathematics; Planar; 1-planar graph; Outerplanar graph; Independent set; Chordal graph; Pathwidth; Line graph; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.07886002661000079,"gpt":0.270923936666516,"spread":0.1920639100565152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001594393,0.0002305426,0.0004400971,0.00008736229,0.0007307311,0.00001231625,0.0006148842,0.0001147451,0.00001889326],"category_scores_gemma":[0.002166248,0.0001493699,0.0002425925,0.000446386,0.0004207324,0.000036515,0.000200955,0.0004076293,0.000002273458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000545113,"about_ca_system_score_gemma":0.00004591021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009501488,"about_ca_topic_score_gemma":0.000001241349,"domain_scores_codex":[0.9979888,0.0003610124,0.0005637979,0.0003209474,0.0004453437,0.0003201654],"domain_scores_gemma":[0.9943497,0.00420139,0.0003012376,0.0008880423,0.0001927138,0.00006687265],"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.00007669261,0.0002247635,0.003251365,0.0001177251,0.00004810827,0.000006051359,0.001765018,0.00002873223,0.00001654061,0.9932721,0.0006909649,0.0005019391],"study_design_scores_gemma":[0.001006245,0.0001240223,0.001843596,0.00005529795,0.00002069108,0.00002295879,0.00005869566,0.0003711779,0.0004948102,0.9957899,0.00004851571,0.0001640681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9865431,0.00008749656,0.004851475,0.0001426525,0.000564273,0.000605008,0.000004291136,0.0001098157,0.007091869],"genre_scores_gemma":[0.9977632,0.000006876902,0.002057121,0.00008549263,0.00003499691,0.000006370517,0.000001140685,0.00002236541,0.00002250468],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01122001,"threshold_uncertainty_score":0.609113,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080099401","doi":"10.1017/s096354830500708x","title":"The Small Giant Component in Scale-Free Random Graphs","year":2005,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trinity College","funders":"","keywords":"Giant component; Component (thermodynamics); Random graph; Upper and lower bounds; Mathematics; Combinatorics; Scale (ratio); Graph; Connected component; Discrete mathematics; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01325639483048388,"gpt":0.2363868157909862,"spread":0.2231304209605023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002034659,0.0002867825,0.0004568839,0.0001050851,0.000534691,0.0001600218,0.001090206,0.0000550428,0.00001878832],"category_scores_gemma":[0.00005742721,0.0002352968,0.0002835743,0.0007944438,0.0001725184,0.00007993406,0.0007543769,0.0005280255,0.00001016122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002137067,"about_ca_system_score_gemma":0.00005779073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002530699,"about_ca_topic_score_gemma":0.0002055422,"domain_scores_codex":[0.9974288,0.0003434134,0.0008064561,0.000513708,0.000296405,0.0006112296],"domain_scores_gemma":[0.9975312,0.0007740843,0.0002530041,0.001158666,0.0001705797,0.0001124112],"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.00006058949,0.001123654,0.2608071,0.00002983362,0.00009540455,0.00000166048,0.0005723234,0.004285985,0.0001098885,0.5770012,0.001008114,0.1549042],"study_design_scores_gemma":[0.002140001,0.00003844285,0.02018547,0.00006137283,0.00003085277,0.000001094769,0.00007805868,0.123598,0.0004629549,0.8493441,0.003676758,0.0003829561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9635772,0.000378525,0.02790049,0.001260417,0.0002483393,0.0009121413,0.000003406496,0.0002266375,0.00549286],"genre_scores_gemma":[0.9950354,0.000005920366,0.004664519,0.00003352522,0.0001539782,0.00003380451,0.00001098827,0.00002294517,0.00003895324],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2723429,"threshold_uncertainty_score":0.9595125,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139757566","doi":"10.1017/s0963548302005254","title":"Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number","year":2002,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trinity College","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Vertex (graph theory); Constant (computer programming); Independence number; Random graph; Degree (music); Discrete mathematics; Graph; Random regular graph; Chordal graph; 1-planar graph; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.04185882661710374,"gpt":0.2727915680550093,"spread":0.2309327414379056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001603678,0.0002706532,0.0006332633,0.00008455788,0.0003523146,0.00003646839,0.0003796426,0.0001890965,0.00005537669],"category_scores_gemma":[0.001024411,0.0002357312,0.0001491093,0.0004544376,0.0004541712,0.0001100733,0.0004128381,0.0003724901,0.000002239839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005897894,"about_ca_system_score_gemma":0.00002168341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008548182,"about_ca_topic_score_gemma":0.000001378207,"domain_scores_codex":[0.9977479,0.0002320652,0.0007562296,0.0004319802,0.0004731087,0.0003587218],"domain_scores_gemma":[0.9973062,0.001215905,0.0003864436,0.000722592,0.0002512345,0.0001176811],"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.00002398183,0.0003075111,0.03401946,0.001169796,0.00008195661,0.000009488201,0.003218095,0.00001055178,0.0001497233,0.9560513,0.0001541962,0.004803944],"study_design_scores_gemma":[0.001623713,0.00006377481,0.00261605,0.0001834569,0.00005369113,0.00005035125,0.000086687,0.009089033,0.0006326654,0.9853328,0.00001228032,0.0002554294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9882004,0.000306347,0.003976853,0.00003349477,0.0003829123,0.0006271898,0.000003008465,0.00009204121,0.006377735],"genre_scores_gemma":[0.9885236,0.00002368831,0.01135118,0.00001840328,0.00001889482,0.000005446714,6.287436e-7,0.00002465212,0.00003352935],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03140341,"threshold_uncertainty_score":0.961284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095784445","doi":"10.1017/s096354830800967x","title":"The Ramsey Number for 3-Uniform Tight Hypergraph Cycles","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo; National Science Foundation","keywords":"Hypergraph; Combinatorics; Mathematics; Ramsey's theorem; Lemma (botany); Monochromatic color; Integer (computer science); Discrete mathematics; Physics; Graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03560432321952448,"gpt":0.3152638023033849,"spread":0.2796594790838604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001914203,0.0002771654,0.0003466055,0.00003815227,0.001887594,0.0001329919,0.00070983,0.0001587857,0.000006375609],"category_scores_gemma":[0.001321776,0.0001883015,0.0002828677,0.0003415138,0.0001975668,0.0000927912,0.0001940851,0.0003312991,0.000003055003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001087758,"about_ca_system_score_gemma":0.00004401421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002018757,"about_ca_topic_score_gemma":0.000001895678,"domain_scores_codex":[0.9979823,0.0001355506,0.0005824168,0.0004062664,0.0003179555,0.0005755763],"domain_scores_gemma":[0.9961788,0.002325149,0.0002446074,0.0008326486,0.0003092587,0.0001095459],"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.00002753108,0.0001398817,0.002078496,0.00006834811,0.00002924498,7.178289e-7,0.0005570923,0.00001066948,0.00001357953,0.9808204,0.001067784,0.01518623],"study_design_scores_gemma":[0.0005357941,0.00009562647,0.002576509,0.00002935737,0.00003034755,0.00001065617,0.00006306764,0.001876562,0.0002304435,0.9898412,0.004454089,0.0002563454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9745559,0.0002066185,0.01065778,0.0009290566,0.001626099,0.001323598,0.000006069541,0.0003772536,0.01031763],"genre_scores_gemma":[0.9869584,0.00001200892,0.01256516,0.0001436534,0.0001487743,0.00001270101,0.000003451479,0.00002602265,0.0001298002],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01492989,"threshold_uncertainty_score":0.9994118,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004887104","doi":"10.1017/s0963548305006772","title":"Self-Avoiding Walks on Hyperbolic Graphs","year":2005,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Euclidean geometry; Hyperbolic geometry; Mathematics; Hyperbolic triangle; Reversing; Plane (geometry); Combinatorics; Discrete mathematics; Pure mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.04799376499972036,"gpt":0.3051219160581148,"spread":0.2571281510583945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00130506,0.0003202312,0.0004540798,0.0001028406,0.0004831183,0.00008144565,0.0004349257,0.0001572028,0.0000188779],"category_scores_gemma":[0.003841515,0.0003056748,0.0001309005,0.0005362014,0.00004513367,0.00008872905,0.0002336154,0.0006358647,0.00006741419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000331257,"about_ca_system_score_gemma":0.00007915696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002267343,"about_ca_topic_score_gemma":0.000001603695,"domain_scores_codex":[0.9975368,0.0001433227,0.0006219443,0.0005898998,0.0005032436,0.0006047526],"domain_scores_gemma":[0.9961383,0.002607155,0.0002018055,0.000579323,0.0002617113,0.0002116699],"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.00001048531,0.0006760759,0.00008975209,0.000317738,0.00002425501,0.000003476969,0.000548389,0.00005150457,0.00002202051,0.9872484,0.0001886274,0.01081926],"study_design_scores_gemma":[0.0005219536,0.0001933983,0.00005806494,0.00008342091,0.00003718538,0.00001180762,0.00004330225,0.07796514,0.0004051994,0.9196683,0.0006932011,0.0003190349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5926327,0.0001924278,0.3926591,0.0006934272,0.001185396,0.001088165,0.000009038527,0.001364092,0.01017566],"genre_scores_gemma":[0.9235878,0.000005565616,0.07603537,0.000157207,0.0001285844,0.00001275862,0.000002002918,0.00004339507,0.00002734015],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3309551,"threshold_uncertainty_score":0.9999396,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128660769","doi":"10.1017/s0963548308009140","title":"Graph Colouring with No Large Monochromatic Components","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Bounded function; Degree (music); Discrete mathematics; Planar graph; Monochromatic color; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03306435827015908,"gpt":0.2590236197809189,"spread":0.2259592615107598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001358469,0.0003528266,0.0004750331,0.0002419151,0.001138426,0.0001136853,0.001927564,0.00009871941,0.000006217297],"category_scores_gemma":[0.0002972097,0.0003261098,0.0001230812,0.001756711,0.0002991689,0.0006249393,0.001311171,0.0005890232,0.00009383551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002695011,"about_ca_system_score_gemma":0.0001548176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001227114,"about_ca_topic_score_gemma":0.000001690285,"domain_scores_codex":[0.9962265,0.0003832036,0.000527821,0.0009443215,0.0008822267,0.001035908],"domain_scores_gemma":[0.9968343,0.0005672509,0.000237232,0.001461045,0.0005988065,0.0003013116],"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.0000785582,0.002130959,0.1761364,0.000466019,0.0001182023,0.000332323,0.002609309,0.002693209,0.0007859118,0.8132501,0.0001781858,0.001220841],"study_design_scores_gemma":[0.003471899,0.0008427723,0.0668993,0.000229957,0.0000123953,0.0003334538,0.00003866493,0.2558766,0.001382295,0.6693729,0.0004216462,0.001118216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6476296,0.00008005257,0.3497501,0.00007748826,0.0003034172,0.0005572977,0.000001169944,0.0004972126,0.001103683],"genre_scores_gemma":[0.9464346,0.000007052292,0.0533467,0.00006330053,0.00003080398,0.00001992958,0.000003816173,0.00002953136,0.0000642346],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.298805,"threshold_uncertainty_score":0.9999191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071386577","doi":"10.1017/s0963548313000540","title":"Conflict-Free Colouring of Graphs","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Freie Universität Berlin; Hungarian Scientific Research Fund; Deutsche Forschungsgemeinschaft","keywords":"Chromatic scale; Critical graph; Combinatorics; Mathematics; Vertex (graph theory); Random graph; Graph; Probabilistic logic; Discrete mathematics; Line graph; Voltage graph; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04105905275934962,"gpt":0.2772389971211725,"spread":0.2361799443618229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008307,0.0002292585,0.0004699629,0.0001133424,0.0003115493,0.00003778333,0.000850321,0.0001465,0.00006178704],"category_scores_gemma":[0.001860793,0.0002054401,0.0001847543,0.000420768,0.0002653649,0.0001164262,0.0009160672,0.0003175561,0.000003895625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006856329,"about_ca_system_score_gemma":0.00003478611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003657052,"about_ca_topic_score_gemma":0.000001150585,"domain_scores_codex":[0.9980205,0.0001780416,0.0007001856,0.0003548099,0.0003556282,0.0003907866],"domain_scores_gemma":[0.9967521,0.001167237,0.0003539726,0.00116129,0.0004508381,0.0001144949],"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.000004909613,0.0001663604,0.01541859,0.0003619761,0.00003986778,8.49607e-7,0.001231088,0.00001374927,0.0001674766,0.9808998,0.0006674598,0.001027869],"study_design_scores_gemma":[0.000580542,0.00008372244,0.007122727,0.00005833235,0.00002156226,0.000005455424,0.0000897651,0.001013382,0.001644923,0.9890675,0.00009986203,0.0002122275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.989962,0.0001230483,0.001179914,0.00008299526,0.0006642141,0.000721945,0.000002828134,0.0001792499,0.00708384],"genre_scores_gemma":[0.9889431,0.000003716295,0.01089828,0.00003505383,0.00003005171,0.00001098341,0.000001057579,0.00002679158,0.00005094334],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009718367,"threshold_uncertainty_score":0.8377605,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020233469","doi":"10.1017/s0963548311000642","title":"Corrádi and Hajnal's Theorem for Sparse Random Graphs","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trinity College","funders":"","keywords":"Combinatorics; Mathematics; Embedding; Independent set; Graph; Random graph; Binary logarithm; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04987376170402692,"gpt":0.296083561940946,"spread":0.2462098002369191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003239932,0.0002815383,0.0004966347,0.00008510079,0.0006881269,0.00005738264,0.0002870973,0.0001555115,0.000009263147],"category_scores_gemma":[0.001930407,0.0002348792,0.0001885967,0.0002401565,0.0002641127,0.0001500113,0.0003551216,0.0002623726,0.000001021224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000070711,"about_ca_system_score_gemma":0.00002506132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002797859,"about_ca_topic_score_gemma":6.176536e-7,"domain_scores_codex":[0.9980524,0.0002285935,0.0005093401,0.000364586,0.0002322225,0.0006129146],"domain_scores_gemma":[0.9958955,0.002940424,0.0002292064,0.0005357166,0.0001971575,0.000201992],"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.000096818,0.0001959705,0.01709822,0.000306646,0.00004442875,3.586895e-7,0.002609271,0.000003309289,0.00001651396,0.9766542,0.0002481021,0.002726102],"study_design_scores_gemma":[0.001805929,0.00009196335,0.001511572,0.00003960004,0.00007005379,0.00001703771,0.0001273266,0.001353773,0.0002119335,0.9938734,0.0006084336,0.0002890475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9718497,0.0006847343,0.02228433,0.00005833974,0.001714257,0.001161005,0.00000744174,0.0001986564,0.002041483],"genre_scores_gemma":[0.9854974,0.000008998755,0.01418641,0.00007085648,0.0001371037,0.00002135028,0.00000365562,0.00003800827,0.00003622737],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01721907,"threshold_uncertainty_score":0.9578097,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030362910","doi":"10.1017/s0963548309990216","title":"The <i>t</i>-Improper Chromatic Number of Random Graphs","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Chromatic scale; Combinatorics; Mathematics; Random graph; Graph; Constant (computer programming); Discrete mathematics; Degree (music); Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02305560789031328,"gpt":0.2937450395494833,"spread":0.27068943165917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002319082,0.0002384615,0.0004596566,0.00003726874,0.0007980138,0.00005344085,0.000655072,0.0001134706,0.00001147563],"category_scores_gemma":[0.001518414,0.0001504295,0.0002492831,0.0004674512,0.0002907215,0.00007357549,0.0002135107,0.0003320842,0.000002667752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005899493,"about_ca_system_score_gemma":0.00004302962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003635343,"about_ca_topic_score_gemma":6.224062e-7,"domain_scores_codex":[0.9977491,0.0003304353,0.0007880466,0.0003070022,0.0004240456,0.0004013855],"domain_scores_gemma":[0.9965057,0.001849589,0.0003681295,0.0009034031,0.0002934243,0.00007972932],"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.00003722409,0.0001864555,0.003029616,0.0001448988,0.00002926361,0.000001102221,0.0009413445,0.000008452987,0.00007348615,0.9904514,0.0002343929,0.004862339],"study_design_scores_gemma":[0.001009987,0.0000789395,0.002456296,0.00005080086,0.0000372401,0.00001447833,0.00004812031,0.0009214389,0.0005653103,0.9944749,0.0001609251,0.0001815173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9881447,0.0002258987,0.001553959,0.0001774562,0.0007167091,0.0006468951,0.00000127774,0.0001425759,0.008390548],"genre_scores_gemma":[0.9962257,0.00001003454,0.003585951,0.00006264638,0.00003884615,0.000003881745,7.866145e-7,0.00001786885,0.00005424396],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008336304,"threshold_uncertainty_score":0.6137757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963578227","doi":"10.1017/s0963548313000060","title":"Arithmetic Progressions in Sumsets and <i>L<sup>p</sup></i>-Almost-Periodicity","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; University of British Columbia; National Science Foundation","keywords":"Mathematics; Lemma (botany); Arithmetic progression; Combinatorics; Arithmetic; Simple (philosophy); BETA (programming language); Binary logarithm; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.028311161675105,"gpt":0.2788819562535247,"spread":0.2505707945784197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001258621,0.0003291525,0.000522373,0.0001506621,0.0005523146,0.0001554518,0.0003966471,0.0002109214,0.00003425693],"category_scores_gemma":[0.001669857,0.0002807845,0.00009441759,0.0005453881,0.0003112219,0.0001946283,0.0007727239,0.0006303408,0.000005678252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001323771,"about_ca_system_score_gemma":0.00005337947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004561196,"about_ca_topic_score_gemma":0.000005748077,"domain_scores_codex":[0.9973986,0.0003581677,0.0006929261,0.0006112542,0.0003473616,0.0005916638],"domain_scores_gemma":[0.9976502,0.001066825,0.0001861432,0.0006669639,0.0002300081,0.0001998458],"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.00001499275,0.000795677,0.2374147,0.000758278,0.00003951702,0.00001502227,0.01188739,0.0001225136,0.00002711906,0.727803,0.0003849794,0.0207368],"study_design_scores_gemma":[0.0006634963,0.00008132065,0.02809205,0.0001455404,0.00001595878,0.00002305757,0.0004604914,0.02082035,0.0000557429,0.9492535,0.0000685358,0.0003199707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9965945,0.0002665703,0.0003518422,0.0002064797,0.0002397019,0.001255544,0.000003154862,0.0001889978,0.0008932266],"genre_scores_gemma":[0.9902951,0.000006789137,0.00946299,0.0000913136,0.00004065861,0.00004119275,0.000003042573,0.00003261273,0.00002632509],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2214505,"threshold_uncertainty_score":0.9999644,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022956475","doi":"10.1017/s0963548306007693","title":"Colouring Random 4-Regular Graphs","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":24,"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":"Random graph; Mathematics; Random regular graph; Combinatorics; Discrete mathematics; Exponential random graph models; Chromatic scale; Graph; Line graph; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.02171806529547255,"gpt":0.2602170401959569,"spread":0.2384989749004844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001757109,0.0003034034,0.0004953392,0.0001249891,0.0008131075,0.00007769831,0.000489662,0.0001702199,0.00001733752],"category_scores_gemma":[0.0006004188,0.0002767237,0.0002597877,0.0005194794,0.000213851,0.00009658196,0.0004253635,0.0003734802,0.000003392667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001418404,"about_ca_system_score_gemma":0.00003717134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002634965,"about_ca_topic_score_gemma":0.000004214104,"domain_scores_codex":[0.9975779,0.0002769263,0.0006856809,0.000508054,0.0004150724,0.0005363625],"domain_scores_gemma":[0.9975633,0.00111887,0.0002634954,0.0007381252,0.0002253609,0.00009083549],"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.00002497463,0.0002146422,0.01335767,0.0001831453,0.00002648259,0.000007183711,0.0002508199,0.000143074,0.00009103602,0.9846112,0.0004622557,0.0006274832],"study_design_scores_gemma":[0.001528168,0.00004440196,0.003030753,0.00004629506,0.00003664965,0.00001346425,0.00002644598,0.001579401,0.001127937,0.9918368,0.0004094252,0.0003201855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9820573,0.0002320325,0.007505356,0.00007137923,0.001085921,0.0006157042,0.000002261867,0.0004443908,0.007985617],"genre_scores_gemma":[0.9914402,0.000001836549,0.008230019,0.00003080594,0.0001251176,0.000008597023,0.000003967621,0.00003954018,0.0001199403],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01032691,"threshold_uncertainty_score":0.9999685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038424818","doi":"10.1017/s0963548303005765","title":"Canonical Vertex Partitions","year":2003,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Arity; Countable set; Mathematics; Vertex (graph theory); Partition (number theory); Signature (topology); Binary number; Discrete mathematics; Finite set; Combinatorics; Graph; Arithmetic; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02439963554927065,"gpt":0.248925663942766,"spread":0.2245260283934953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006880916,0.0001824738,0.0002295122,0.00005247443,0.0004151883,0.0001166655,0.0007416909,0.00008376783,0.00001358444],"category_scores_gemma":[0.0006955836,0.0001802649,0.0001005582,0.0007854282,0.00009028997,0.0003044379,0.0002918284,0.0003026451,0.00006290432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001889292,"about_ca_system_score_gemma":0.0002071169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004067031,"about_ca_topic_score_gemma":0.000002140096,"domain_scores_codex":[0.9980252,0.0002369607,0.0003622069,0.0005954234,0.0002726606,0.0005075476],"domain_scores_gemma":[0.9983349,0.0003585834,0.00009984901,0.0008518306,0.0001663223,0.0001885361],"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":[5.094182e-7,0.0001937034,0.003101192,0.00001396479,0.000005104559,0.000006484927,0.000142631,0.0004540422,0.00002897139,0.9934159,0.0001245959,0.002512909],"study_design_scores_gemma":[0.0003166535,0.00007081941,0.001924307,0.00001212183,0.000003641524,0.00002248078,0.000009196969,0.01094547,0.000482451,0.9820704,0.003906776,0.0002356102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1793166,0.0002295216,0.8040189,0.0004359621,0.001525171,0.0003150163,6.33796e-7,0.0005784532,0.01357978],"genre_scores_gemma":[0.9678646,0.000002871717,0.03184771,0.0001961802,0.00001649452,0.000008273503,0.000001241255,0.000008812219,0.00005386667],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7885479,"threshold_uncertainty_score":0.7350989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2885507564","doi":"10.1017/s0963548313000576","title":"Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Permutation (music); Neighbourhood (mathematics); Diagonal; Random permutation; Limit (mathematics); Discrete mathematics; Geometry; Physics; Mathematical analysis; Symmetric group","retraction":null,"screen_n_in":null,"score":{"opus":0.05303729583454216,"gpt":0.3152075288856322,"spread":0.2621702330510901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001431548,0.0003199238,0.0004879972,0.0001025149,0.0009856699,0.0002140222,0.0003146688,0.0001487887,0.00002017419],"category_scores_gemma":[0.006408795,0.0003212658,0.0001259197,0.0003623842,0.0000929426,0.0003618256,0.0003065418,0.0003506806,0.0000153237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002374192,"about_ca_system_score_gemma":0.00007205836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005992275,"about_ca_topic_score_gemma":0.000004226628,"domain_scores_codex":[0.997625,0.0002100415,0.0007837056,0.0005175745,0.0002967762,0.0005669282],"domain_scores_gemma":[0.9932006,0.004923047,0.0003863987,0.0005929149,0.0007325462,0.0001645064],"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.000001816065,0.000359848,0.001720375,0.0004465577,0.0000323918,3.375587e-7,0.002765178,0.00002910397,0.0001257942,0.9932978,0.0002940467,0.000926809],"study_design_scores_gemma":[0.0009102854,0.00008966278,0.0004316824,0.00008135719,0.00004980399,0.000005757324,0.0006786302,0.0525161,0.0003185265,0.9444477,0.0001422491,0.0003282657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4125933,0.00006482612,0.5841063,0.0003255012,0.0004753615,0.00184787,0.000009785705,0.0002519194,0.0003251057],"genre_scores_gemma":[0.9814019,0.000006297955,0.01802522,0.00006441501,0.0001116471,0.0002469631,0.00001564369,0.00006500587,0.00006293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5688086,"threshold_uncertainty_score":0.9999239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3007271564","doi":"10.1017/s0963548321000213","title":"Clustered 3-colouring graphs of bounded degree","year":2021,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Wilfrid Laurier University; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Bounded function; Planar graph; Degree (music); Vertex (graph theory); 1-planar graph; Discrete mathematics; Cluster analysis; Graph; Chordal graph; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0581101267166381,"gpt":0.2964187187545243,"spread":0.2383085920378862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001743179,0.0002367412,0.0004519256,0.0001879527,0.000344405,0.0001485502,0.001627745,0.0001172088,0.000006844771],"category_scores_gemma":[0.00109199,0.0002611956,0.0002098346,0.002352426,0.0002309631,0.0004016124,0.002194456,0.0004645901,0.00000774131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001996061,"about_ca_system_score_gemma":0.0003509543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007700619,"about_ca_topic_score_gemma":0.000007068993,"domain_scores_codex":[0.9966402,0.00051977,0.0006663555,0.000849268,0.0006697716,0.0006546428],"domain_scores_gemma":[0.9961007,0.0008125465,0.0002641677,0.001649511,0.0009857339,0.0001873178],"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.000009402508,0.0003679863,0.01493975,0.0002095403,0.00003201483,0.00003598083,0.0005273484,0.0003932022,0.001347363,0.9695171,0.00001641227,0.0126039],"study_design_scores_gemma":[0.0006799645,0.00009557339,0.007409776,0.00006689956,0.000005560305,0.00003234787,0.00003894883,0.02248704,0.01722831,0.9516026,0.00009793579,0.0002550299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6560835,0.0003864692,0.3397226,0.0002531668,0.0006601726,0.0003299217,0.000001293794,0.0002520523,0.002310788],"genre_scores_gemma":[0.9302079,0.000007303989,0.06964932,0.00004178203,0.00001543001,0.000006134804,0.000002336186,0.00001693679,0.00005286883],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2741244,"threshold_uncertainty_score":0.999984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139245322","doi":"10.1017/s0963548314000807","title":"Lazy Cops and Robbers on Hypercubes","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Hypercube; Computer science; Function (biology); Argument (complex analysis); Asymptotically optimal algorithm; Mathematics; Discrete mathematics; Parallel computing; Algorithm; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.07483190199436138,"gpt":0.2877698644004989,"spread":0.2129379624061375,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001417663,0.0002225186,0.0002684901,0.00009631821,0.0002263767,0.0002630042,0.0009111346,0.0001010421,0.000001577397],"category_scores_gemma":[0.001001456,0.000217134,0.00005297105,0.0005608042,0.0001845406,0.0003402196,0.0007859505,0.0003057844,0.00007006912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002429771,"about_ca_system_score_gemma":0.0001389838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005033876,"about_ca_topic_score_gemma":0.000004240937,"domain_scores_codex":[0.9978532,0.000190736,0.0003930616,0.0006857858,0.0004523208,0.0004249493],"domain_scores_gemma":[0.9979926,0.000488522,0.0001152644,0.000784237,0.0003261223,0.0002932407],"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.000008447405,0.0002670132,0.01563807,0.00003261778,0.00001194696,0.00001274633,0.003192689,0.002480765,0.00003921998,0.9264106,0.0006410928,0.05126477],"study_design_scores_gemma":[0.0002284967,0.0003744932,0.001506378,0.00004789407,0.00000536421,0.00002139982,0.0001956073,0.2105325,0.002208013,0.7827958,0.001698265,0.0003857538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.86968,0.0002522624,0.1188606,0.001502786,0.00182346,0.0004187621,6.774989e-7,0.000585819,0.006875602],"genre_scores_gemma":[0.9847776,0.000003795702,0.01483582,0.0002595161,0.00005731203,0.000004386821,7.35716e-7,0.00001295657,0.00004783189],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2080518,"threshold_uncertainty_score":0.8854469,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061450212","doi":"10.1017/s0963548312000272","title":"Connectivity for Bridge-Addable Monotone Graph Classes","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Conjecture; Monotone polygon; Mathematics; Vertex (graph theory); Graph; Monotonic function; Discrete mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.05812707044240926,"gpt":0.3213482555105076,"spread":0.2632211850680983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003909139,0.0003194602,0.0004521012,0.0002051474,0.0007070773,0.0001972087,0.001521876,0.0001399906,0.000003279153],"category_scores_gemma":[0.001518491,0.0003322678,0.0002259372,0.001457594,0.000207139,0.001277512,0.00108086,0.0004327885,0.00001996535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003103749,"about_ca_system_score_gemma":0.0001325962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001737788,"about_ca_topic_score_gemma":0.000001997587,"domain_scores_codex":[0.9964731,0.000379393,0.0004850671,0.0008174462,0.0004943235,0.001350681],"domain_scores_gemma":[0.99529,0.002194306,0.0002218808,0.001348683,0.0005659778,0.0003791919],"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.00001822068,0.0006484087,0.04406611,0.0001452002,0.00002653761,9.497818e-7,0.0004246452,0.0002950823,0.0002846124,0.9446772,0.0002018052,0.009211255],"study_design_scores_gemma":[0.0007726334,0.0001856044,0.02389112,0.00002483919,0.00000829767,0.00001313446,0.00001727498,0.03102895,0.004034084,0.9381378,0.001450234,0.0004360288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3312218,0.0003525229,0.6652697,0.0002138087,0.0009733081,0.000976162,0.000003662314,0.0004275989,0.0005613614],"genre_scores_gemma":[0.9566357,0.000005693261,0.04300946,0.00008001418,0.0001150854,0.00007804667,0.000004293427,0.00002934511,0.00004235572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6254139,"threshold_uncertainty_score":0.9999129,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171769876","doi":"10.1017/s0963548309990204","title":"The Longest Minimum-Weight Path in a Complete Graph","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Minimum weight; Path (computing); Path length; Random graph; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02440755301033561,"gpt":0.2437544791994999,"spread":0.2193469261891643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002246063,0.0003491457,0.0004106681,0.0001870335,0.0009504557,0.0004695179,0.00280199,0.0001173481,0.00000172469],"category_scores_gemma":[0.0003059627,0.0002901315,0.000202605,0.002303716,0.0002428312,0.0003494132,0.0007246254,0.0006932379,0.0000151814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002075263,"about_ca_system_score_gemma":0.0001204874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002770102,"about_ca_topic_score_gemma":0.00002173028,"domain_scores_codex":[0.9964102,0.0003975267,0.0007918956,0.0008973997,0.0006011944,0.0009017753],"domain_scores_gemma":[0.9967558,0.001030186,0.0002395164,0.001558799,0.0002364964,0.0001792086],"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.000007692336,0.0004630509,0.004983129,0.00002219167,0.000009096324,0.00002790634,0.0007356117,0.0001766856,0.00003017929,0.921967,0.0002129816,0.07136448],"study_design_scores_gemma":[0.0006007744,0.0002111236,0.04206638,0.00005822043,0.000003323604,0.00002055013,0.00002198922,0.1251302,0.0000421412,0.829596,0.001900916,0.0003484185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5785875,0.002753932,0.3899153,0.01281734,0.004959644,0.002165731,0.000006639351,0.001375096,0.007418769],"genre_scores_gemma":[0.9853785,0.00003303635,0.01414649,0.0003219849,0.00007809728,0.000008511158,0.000002798863,0.00001062612,0.00001996764],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.406791,"threshold_uncertainty_score":0.9999551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057596055","doi":"10.1017/s0963548310000489","title":"The Evolution of the Cover Time","year":2011,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":17,"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":"Combinatorics; Mathematics; Cover (algebra); Upper and lower bounds; Time complexity; Discrete mathematics; Order (exchange); Vertex cover; Random graph; Conjecture; Binary logarithm; Hypercube; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.04537290750389973,"gpt":0.2617930503216758,"spread":0.2164201428177761,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001074381,0.000119533,0.0001885103,0.00001304855,0.0003696639,0.00001685758,0.0005447792,0.00006661836,0.00001757952],"category_scores_gemma":[0.004775483,0.00006905534,0.00008950234,0.0003409315,0.000162506,0.0000327923,0.0003468521,0.0002015189,0.00001630379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000192696,"about_ca_system_score_gemma":0.0001223526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001590239,"about_ca_topic_score_gemma":0.000001416702,"domain_scores_codex":[0.9987124,0.0001172855,0.0004204455,0.0001931575,0.0003096605,0.000247089],"domain_scores_gemma":[0.9972634,0.001549964,0.0002601331,0.0005577342,0.0003243102,0.00004442718],"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.00001013504,0.0001375668,0.0003361632,0.00009081223,0.00001256395,1.932968e-7,0.0003468405,0.000003877801,0.00002725171,0.9979416,0.0001816458,0.0009113799],"study_design_scores_gemma":[0.0001598415,0.00006309168,0.0008801401,0.00004217535,0.00002655096,0.000002871919,0.00004479395,0.02576866,0.0003400227,0.9725431,0.00004659182,0.00008211853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1857677,0.0002075746,0.798566,0.0001376639,0.001318686,0.0009306775,0.000008688481,0.0001281004,0.01293488],"genre_scores_gemma":[0.9946378,7.288917e-7,0.005169606,0.000009544941,0.00001864868,0.000004538807,1.85911e-7,0.00001207751,0.0001468654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8088701,"threshold_uncertainty_score":0.5717044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155865206","doi":"10.1017/s0963548307008905","title":"Induced Forests in Regular Graphs with Large Girth","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"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; Mathematics; Girth (graph theory); Upper and lower bounds; Random regular graph; Random graph; Graph; Discrete mathematics; Line graph; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.03350324420973928,"gpt":0.271821734146239,"spread":0.2383184899364997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001868201,0.000307478,0.0004192483,0.0004007543,0.0005028598,0.00007724794,0.001720428,0.0001301914,0.000002077291],"category_scores_gemma":[0.0003468798,0.0002855872,0.00009314506,0.003407986,0.0002064643,0.0006333402,0.001020139,0.0007389497,0.00001133188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000267389,"about_ca_system_score_gemma":0.0002595781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002026223,"about_ca_topic_score_gemma":0.00005355501,"domain_scores_codex":[0.9962868,0.0004132626,0.0004982341,0.001003716,0.0007743304,0.001023666],"domain_scores_gemma":[0.9973347,0.0004109188,0.0001709175,0.001497638,0.0003606026,0.0002252709],"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.00002124839,0.0004470347,0.3148375,0.00004898432,0.00001003129,0.0001283577,0.0009297525,0.0004606285,0.0000720165,0.681603,0.00001277573,0.001428681],"study_design_scores_gemma":[0.001687718,0.0003559034,0.1376394,0.00006804663,0.000001859194,0.00008050857,0.00002761927,0.03184645,0.0009132,0.8268795,0.00007898298,0.0004207897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8422531,0.0000928011,0.1558525,0.0001531808,0.0001921426,0.0006327897,7.115689e-7,0.0003070617,0.0005157246],"genre_scores_gemma":[0.9846421,0.000004856844,0.01521498,0.00005087719,0.00001448284,0.00002107814,0.000002340905,0.00002536807,0.00002393503],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1771981,"threshold_uncertainty_score":0.9999596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122000012","doi":"10.1017/s0963548306007644","title":"Randomized Algorithms for Determining the Majority on Graphs","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","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":"Université du Québec en Outaouais","funders":"","keywords":"Randomized algorithm; Node (physics); Undirected graph; Combinatorics; Graph; Algorithm; Computer science; Task (project management); Upper and lower bounds; Simple (philosophy); Mathematics; Discrete mathematics; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.040548659523732,"gpt":0.3082475723341714,"spread":0.2676989128104394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006349237,0.0003108399,0.0005735146,0.000163231,0.001015959,0.0003064905,0.002030749,0.0001050093,0.000001077166],"category_scores_gemma":[0.001621154,0.0002269699,0.0003926814,0.001062911,0.0004250215,0.0002732434,0.0006651003,0.0004735909,0.000007357844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001807146,"about_ca_system_score_gemma":0.00008572265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000173124,"about_ca_topic_score_gemma":0.000002116825,"domain_scores_codex":[0.9962751,0.0008154317,0.0006629691,0.0008607901,0.0006200691,0.0007656626],"domain_scores_gemma":[0.9912729,0.006502388,0.0002783901,0.001277294,0.0005691567,0.00009987186],"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.0005292399,0.0002563278,0.001380967,0.00004075202,0.00001554614,0.000001479304,0.0001208656,0.000789302,0.000007374426,0.9855909,0.00008005038,0.01118719],"study_design_scores_gemma":[0.02662788,0.0001099226,0.0009335502,0.0000196785,0.000008130735,0.000002297054,0.000005231722,0.1638029,0.0003129804,0.8077597,0.0001951668,0.0002225672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1846041,0.0001062848,0.808852,0.0007067341,0.001081715,0.00268608,0.000003283608,0.000427296,0.00153251],"genre_scores_gemma":[0.9580962,0.000001946162,0.04147286,0.0001219952,0.00008949088,0.0001279382,0.000005473414,0.00002359229,0.00006051228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7734921,"threshold_uncertainty_score":0.9255565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139855799","doi":"10.1017/s0963548315000073","title":"Forcing a sparse minor","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"","keywords":"Graph; Focus (optics); Forcing (mathematics); Minor (academic); Degree (music); Variation (astronomy)","retraction":null,"screen_n_in":null,"score":{"opus":0.135359305568294,"gpt":0.3241944948805693,"spread":0.1888351893122753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002084345,0.000240693,0.0003737615,0.0000827787,0.0003483683,0.00005842521,0.000457458,0.0001330916,0.000008788966],"category_scores_gemma":[0.002575635,0.0002153723,0.000133495,0.0003822431,0.000128796,0.0001128181,0.0005942186,0.0003269948,0.000007998065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002249269,"about_ca_system_score_gemma":0.00009262979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001206813,"about_ca_topic_score_gemma":0.000002384322,"domain_scores_codex":[0.9980093,0.0002061598,0.0005017244,0.0004219414,0.0004072092,0.0004536662],"domain_scores_gemma":[0.9978553,0.000638964,0.0002049377,0.0007237116,0.0003372558,0.0002398202],"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.00001561345,0.0001515857,0.01306522,0.0001371754,0.00002221949,0.000006777049,0.002738713,0.00005435577,0.000009459444,0.9808294,0.0009920789,0.001977458],"study_design_scores_gemma":[0.0006771969,0.00008605918,0.0005047823,0.00003991181,0.00002432267,0.0000197653,0.0001869331,0.003643341,0.0002299622,0.9935851,0.0007426341,0.0002600277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9773579,0.0001407568,0.008050636,0.00009198101,0.001593161,0.0004470588,0.000001523427,0.0003319333,0.01198511],"genre_scores_gemma":[0.9828599,6.839853e-7,0.0167738,0.00006484857,0.0001327449,0.000005126963,0.000001720258,0.0000314729,0.0001296786],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01275572,"threshold_uncertainty_score":0.8782627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069653438","doi":"10.1017/s0963548309009833","title":"Decision Trees and Influences of Variables Over Product Probability Spaces","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Bounded function; Conjecture; Mathematics; Monotonic function; Product (mathematics); Combinatorics; Domain (mathematical analysis); Function (biology); Constant (computer programming); Statement (logic); Random variable; Tree (set theory); Variable (mathematics); Discrete mathematics; Mathematical analysis; Statistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02129531390923371,"gpt":0.2567866917483657,"spread":0.235491377839132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001967825,0.0002832714,0.0004975138,0.0001144237,0.0002706049,0.0002574299,0.001023496,0.000104664,0.000002401129],"category_scores_gemma":[0.0009382912,0.0002333022,0.00008891332,0.0009817632,0.0002114073,0.0005885987,0.0005967593,0.0002395068,0.000001336133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008889147,"about_ca_system_score_gemma":0.0001259769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004593213,"about_ca_topic_score_gemma":0.000004831144,"domain_scores_codex":[0.9971934,0.0001967674,0.0006960753,0.0009571224,0.0005222957,0.0004343516],"domain_scores_gemma":[0.9975862,0.0005560999,0.0003353803,0.001065651,0.0003184978,0.0001381643],"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.00002839358,0.001006377,0.1382414,0.0002048618,0.00002203942,0.00000479757,0.00143132,0.001964607,0.000428202,0.577573,0.0001086147,0.2789864],"study_design_scores_gemma":[0.0003313888,0.0002653173,0.2577515,0.00007217277,0.000007519649,0.00000688595,0.000008529035,0.02278236,0.0003590057,0.7180564,0.0001361063,0.0002227892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9612717,0.0008215691,0.03527679,0.0005123595,0.0004473629,0.0006125926,0.000001417665,0.000209233,0.0008469581],"genre_scores_gemma":[0.8985009,0.00001997499,0.1013692,0.00006225898,0.00003484098,0.000002777325,9.204828e-7,0.000005416859,0.000003676143],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2787636,"threshold_uncertainty_score":0.9513788,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984081854","doi":"10.1017/s0963548311000101","title":"Lower Bounds for the Cop Number when the Robber is Fast","year":2011,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"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":"Mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04472043208422285,"gpt":0.2486108397810878,"spread":0.2038904076968649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002636986,0.0002650278,0.0002346344,0.00003682162,0.00133676,0.0003561977,0.002752172,0.00009917802,0.00005947741],"category_scores_gemma":[0.0001896047,0.0001663736,0.0003129456,0.000682805,0.0003160221,0.000274916,0.001013649,0.0003738198,0.00004029237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007593037,"about_ca_system_score_gemma":0.00008776564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003196757,"about_ca_topic_score_gemma":0.000004012918,"domain_scores_codex":[0.9978338,0.0002210088,0.0004156813,0.000628572,0.0003376016,0.0005633251],"domain_scores_gemma":[0.9963735,0.001271377,0.0001996699,0.001708093,0.0003533909,0.00009395582],"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.00002000008,0.0002563542,0.005572054,0.00003286288,0.00005476777,0.000001101365,0.00811838,0.000019432,0.000003700309,0.9668977,0.003027924,0.01599571],"study_design_scores_gemma":[0.0003675503,0.0001154898,0.002511939,0.0000220191,0.00002735543,0.00001125835,0.00008134911,0.0221458,0.0002273407,0.9583558,0.01586876,0.0002653346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07642003,0.0002409173,0.9057793,0.002736563,0.003763088,0.001259822,0.00000377639,0.0004352944,0.009361191],"genre_scores_gemma":[0.9874383,0.000003515435,0.01127731,0.0009646094,0.0000999141,0.00004604653,7.389135e-7,0.00001907265,0.0001504778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9110183,"threshold_uncertainty_score":0.9999633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2294714952","doi":"10.1017/s0963548312000533","title":"Expanders Are Universal for the Class of All Spanning Trees","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trinity College","funders":"Deutscher Akademischer Austauschdienst","keywords":"Combinatorics; Mathematics; Random regular graph; Discrete mathematics; Vertex (graph theory); Random graph; Graph; Line graph; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.06047673438883049,"gpt":0.2922448994312497,"spread":0.2317681650424192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008853989,0.0001862892,0.0003322648,0.00005232069,0.0004052606,0.00005408367,0.0005286051,0.0001083333,0.00001039789],"category_scores_gemma":[0.001013962,0.0001310788,0.0001932151,0.0001993308,0.0002395475,0.0001358176,0.000307833,0.000221149,5.976351e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000903059,"about_ca_system_score_gemma":0.00003221793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002669101,"about_ca_topic_score_gemma":0.000004680226,"domain_scores_codex":[0.9986249,0.0001210891,0.0004204483,0.0002782658,0.0002283183,0.0003270099],"domain_scores_gemma":[0.9954753,0.003175672,0.0003684969,0.0005727515,0.0003468691,0.00006092365],"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.000013579,0.0001094869,0.007758133,0.0002685788,0.00009626487,3.722473e-7,0.002608152,0.0002827628,0.0000572859,0.9852792,0.0007850108,0.002741171],"study_design_scores_gemma":[0.0005511424,0.00007165856,0.004645447,0.0000533625,0.00005350673,0.000001815658,0.001553654,0.01652546,0.0002945701,0.9757612,0.000328005,0.000160149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9626635,0.0001544159,0.03396532,0.0004180828,0.0007246482,0.001181634,0.000003564615,0.0001072315,0.0007816138],"genre_scores_gemma":[0.9942501,0.000003182054,0.00553405,0.00005605702,0.00005283176,0.00001418522,0.000001313355,0.00002305524,0.00006527469],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03158657,"threshold_uncertainty_score":0.5345238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032160258","doi":"10.1017/s096354831200034x","title":"(<i>k</i>+1)-Cores Have <i>k</i>-Factors","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Core (optical fiber); Discrete mathematics; Computer science; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.07341463199734996,"gpt":0.3134788066533757,"spread":0.2400641746560258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001763514,0.0003652056,0.0004692555,0.00009985572,0.0007286094,0.00005422688,0.0005291227,0.0001953516,0.00004340613],"category_scores_gemma":[0.001629712,0.0003041783,0.0002339284,0.0003196858,0.0002068246,0.0002496072,0.0006418033,0.0004849856,0.000007437027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001773625,"about_ca_system_score_gemma":0.00003164248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001035214,"about_ca_topic_score_gemma":0.00000123441,"domain_scores_codex":[0.9974148,0.0002817058,0.0005949259,0.0003954436,0.0004504376,0.0008627035],"domain_scores_gemma":[0.9969245,0.001493052,0.0002629227,0.0008509074,0.000182465,0.0002861948],"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.000005642351,0.00026003,0.2825788,0.0001248901,0.0000285576,6.877356e-7,0.002992469,0.000004245609,0.00002400572,0.7129567,0.0004472363,0.0005767394],"study_design_scores_gemma":[0.00032633,0.00004459967,0.024368,0.00003120599,0.00003839767,0.000008824364,0.0002232356,0.0001964527,0.001411103,0.9717069,0.001262615,0.0003823175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9840869,0.0003135343,0.002562808,0.00003894068,0.002356872,0.0004395464,0.000004056209,0.0003906824,0.009806634],"genre_scores_gemma":[0.9947382,0.000003059135,0.004767594,0.00007502078,0.0002549279,0.000005226577,0.000004352356,0.0000502886,0.0001013455],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2587502,"threshold_uncertainty_score":0.9999411,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164689216","doi":"10.1017/s0963548313000102","title":"Expansion in High Dimension for the Growth Constants of Lattice Trees and Lattice Animals","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":10,"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":"Lattice (music); Integer lattice; Lattice constant; Mathematics; Combinatorics; Statistical physics; Condensed matter physics; Physics; Quantum mechanics; Half-integer","retraction":null,"screen_n_in":null,"score":{"opus":0.0450147713721705,"gpt":0.2955446069150627,"spread":0.2505298355428922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105907,0.0001702676,0.0003923046,0.00004497441,0.0001575075,0.00003846991,0.0001986373,0.00009318936,0.000006207574],"category_scores_gemma":[0.006580333,0.0001247018,0.00003989072,0.0002820631,0.0001175044,0.00007471216,0.0002144672,0.0001689281,0.00000125254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005480731,"about_ca_system_score_gemma":0.00004645247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008300717,"about_ca_topic_score_gemma":0.000009674838,"domain_scores_codex":[0.9985029,0.00008661288,0.0005693297,0.0003181414,0.0002313937,0.0002916586],"domain_scores_gemma":[0.9893578,0.009578609,0.0002267352,0.000270433,0.0004986599,0.00006773297],"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.00002436154,0.0001896635,0.001612342,0.0006693497,0.00001308106,4.901136e-7,0.0004276179,0.00001028285,0.0002342512,0.9937188,0.00003308052,0.003066696],"study_design_scores_gemma":[0.0007566701,0.0001950639,0.004874416,0.0001518068,0.00003972873,0.00000296272,0.000195328,0.1018268,0.0004910683,0.8913378,0.000002031612,0.0001263259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7859579,0.0002360577,0.2121196,0.0002803102,0.0001816577,0.001136823,0.000007986147,0.00003662717,0.00004307132],"genre_scores_gemma":[0.9599912,0.00001060654,0.03990591,0.00002557842,0.00001432202,0.00003038088,0.000001003994,0.00001675805,0.000004285966],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1740333,"threshold_uncertainty_score":0.7877749,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141986577","doi":"10.1017/s0963548309990599","title":"Tight Bounds for Blind Search on the Integers and the Reals","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Security token; Combinatorics; Position (finance); Mathematics; Interval (graph theory); Function (biology); Distribution (mathematics); Mathematical proof; Discrete mathematics; Point (geometry); Computer science; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03047207592302767,"gpt":0.2844527148049872,"spread":0.2539806388819595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005251766,0.0001830646,0.0002385854,0.00005388686,0.000922499,0.0004903905,0.001154711,0.00005699115,0.000001284797],"category_scores_gemma":[0.0008503678,0.0001007259,0.0001047902,0.0004997746,0.0002262439,0.0000986051,0.0003113033,0.0005744866,0.000004921535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007336446,"about_ca_system_score_gemma":0.00007264136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001915518,"about_ca_topic_score_gemma":5.123186e-7,"domain_scores_codex":[0.997959,0.000475838,0.0003031307,0.0005148979,0.0003533031,0.0003938083],"domain_scores_gemma":[0.9961709,0.002659428,0.0001152411,0.0008147688,0.0001586695,0.00008092973],"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.00002911393,0.00008244041,0.0001971111,0.00001416703,0.000009109655,6.515517e-7,0.001228849,0.0003917212,0.000003791349,0.9546102,0.0005437182,0.04288909],"study_design_scores_gemma":[0.001127914,0.0002449438,0.000921357,0.00002840163,0.000004326776,0.000005648549,0.00002420563,0.4773303,0.00008758631,0.5181355,0.0019631,0.0001267257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3425673,0.0003668827,0.4780816,0.1688219,0.001218654,0.002310132,0.000001643902,0.0004312716,0.006200597],"genre_scores_gemma":[0.9928561,0.000005974992,0.005020635,0.001902547,0.0000748558,0.000008685235,0.000001148596,0.00000747545,0.0001226104],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6502888,"threshold_uncertainty_score":0.709521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4235676350","doi":"10.1017/s0963548306007954","title":"Colouring Random Regular Graphs","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"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":"Mathematics; Random graph; Chromatic scale; Combinatorics; Discrete mathematics; Random regular graph; Graph; Foster graph; Upper and lower bounds; Line graph; Voltage graph; 1-planar graph; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02219989384872011,"gpt":0.2602597606684917,"spread":0.2380598668197716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001840369,0.0002913091,0.0004831209,0.0001213245,0.0008009745,0.0000744493,0.0004776651,0.000169276,0.00001554381],"category_scores_gemma":[0.0006597689,0.0002666925,0.0002487476,0.0005175887,0.0002070898,0.00009414373,0.0004162871,0.000373992,0.000002986947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001425468,"about_ca_system_score_gemma":0.0000361834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002415593,"about_ca_topic_score_gemma":0.000003797728,"domain_scores_codex":[0.9976051,0.0002833339,0.0006815053,0.0005048217,0.0004068378,0.0005183992],"domain_scores_gemma":[0.9975558,0.001101541,0.0002683095,0.0007614398,0.0002257188,0.00008718827],"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.00002631453,0.0001971161,0.01166635,0.0001834054,0.00002441385,0.000007519742,0.0002507799,0.0001209618,0.00008244307,0.9863235,0.0005415315,0.0005756428],"study_design_scores_gemma":[0.001466559,0.00004459243,0.002870673,0.00004877065,0.00003469714,0.00001412293,0.00002665776,0.001413558,0.001057005,0.9922777,0.0004365641,0.0003091126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9818358,0.0002288143,0.006718085,0.00007578854,0.001049494,0.0006038947,0.000002034599,0.0004402976,0.009045725],"genre_scores_gemma":[0.9907948,0.000002055927,0.008862659,0.00002994005,0.0001222092,0.000008116047,0.000003792192,0.00003855305,0.0001378794],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008958928,"threshold_uncertainty_score":0.9999785,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1788889037","doi":"10.1017/s0963548316000201","title":"Median Eigenvalues of Bipartite Subcubic Graphs","year":2016,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Eigenvalues and eigenvectors; Bipartite graph; Interval (graph theory); Graph; Degree (music); Complete bipartite graph","retraction":null,"screen_n_in":null,"score":{"opus":0.06222979210801924,"gpt":0.3082428999989921,"spread":0.2460131078909729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001449265,0.0001724317,0.0003243721,0.0001086836,0.0001747129,0.0000130161,0.0004048135,0.00009299978,0.00003008679],"category_scores_gemma":[0.001040948,0.0001274543,0.0001606396,0.0006057927,0.0002821038,0.00008623731,0.0001631774,0.0001143989,0.00001690943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005675553,"about_ca_system_score_gemma":0.00004794085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004742156,"about_ca_topic_score_gemma":0.000003030479,"domain_scores_codex":[0.9983155,0.0001902149,0.0005809973,0.0003440037,0.000255834,0.0003134898],"domain_scores_gemma":[0.9970859,0.001520896,0.0002884956,0.0007379941,0.0002538351,0.0001128899],"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.000005909425,0.0002978316,0.0183318,0.0001294786,0.00002161193,4.396016e-7,0.0003179581,0.000001298662,0.002188697,0.9750503,0.0001141453,0.003540484],"study_design_scores_gemma":[0.0003546908,0.00005776472,0.002189561,0.00009275559,0.00002428541,0.000002175016,0.00002739403,0.00009177059,0.01252337,0.9843035,0.0001719985,0.0001607662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9896411,0.00006377934,0.007826421,0.0004017078,0.0002479712,0.0004236572,0.000007944019,0.0001910416,0.00119637],"genre_scores_gemma":[0.9955347,0.000007779518,0.004334636,0.00001281726,0.00002319739,0.00001545292,0.000001441524,0.00002044872,0.00004949425],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01614224,"threshold_uncertainty_score":0.5197436,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151182440","doi":"10.1017/s0963548313000515","title":"Semi-Strong Colouring of Intersecting Hypergraphs","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Hypergraph; Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03626950082489224,"gpt":0.2789058286776164,"spread":0.2426363278527242,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079767,0.0002450573,0.0004686207,0.0001293098,0.0003654845,0.00004391588,0.0004901921,0.0001368807,0.0000451233],"category_scores_gemma":[0.00131077,0.0002246182,0.0002035903,0.0004282292,0.0001929312,0.0001516255,0.0006316177,0.0004162906,0.000003122055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001167498,"about_ca_system_score_gemma":0.00003211536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000433024,"about_ca_topic_score_gemma":0.000001863076,"domain_scores_codex":[0.9979252,0.0001975052,0.0007476947,0.0003895765,0.000304269,0.0004357546],"domain_scores_gemma":[0.9973101,0.001202645,0.0003994835,0.0006144045,0.0003687565,0.0001046378],"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.000006892999,0.0001921797,0.05439518,0.0005442256,0.00006720711,0.000001312648,0.002669335,0.00008410259,0.000589136,0.938328,0.0001283827,0.002994028],"study_design_scores_gemma":[0.0003689459,0.00008528464,0.003868007,0.0001301607,0.00002390518,0.000009521064,0.0005207091,0.004317387,0.00253801,0.9878859,0.00001968866,0.0002325045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9888033,0.00007253431,0.003714014,0.00003668762,0.0008467571,0.0005754358,0.000001202319,0.0001840744,0.005766028],"genre_scores_gemma":[0.9919786,0.000001503557,0.007873922,0.00001860382,0.00005393293,0.00000949604,9.772411e-7,0.00003129187,0.0000316378],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05052718,"threshold_uncertainty_score":0.9159665,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094138124","doi":"10.1017/s0963548315000061","title":"On the Chromatic Thresholds of Hypergraphs","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"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":"University of Illinois at Urbana-Champaign; Hungarian Scientific Research Fund; European Commission; National Science Foundation","keywords":"Combinatorics; Chromatic scale; Mathematics; Infimum and supremum; Hypergraph; Dimension (graph theory); Bounded function; Upper and lower bounds; Bipartite graph; Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.1124812024018226,"gpt":0.3067277013778394,"spread":0.1942464989760168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00247299,0.0001988522,0.0003518376,0.00006843982,0.000269914,0.0000244343,0.0006112594,0.00009913415,0.00001066674],"category_scores_gemma":[0.003279926,0.0001253298,0.0001497013,0.0004582634,0.000271635,0.00004390886,0.000352524,0.0002975552,0.000003127481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008611435,"about_ca_system_score_gemma":0.00006315739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005047144,"about_ca_topic_score_gemma":7.403538e-7,"domain_scores_codex":[0.9981697,0.0002894743,0.0005065775,0.0002655958,0.0004987328,0.0002698957],"domain_scores_gemma":[0.9961854,0.002230682,0.0002684218,0.0009390555,0.0002803105,0.00009618387],"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.00001259644,0.0001982592,0.003545994,0.0001288516,0.00003010779,0.000001039252,0.001675177,0.00008201577,0.00001532238,0.9932271,0.000820228,0.000263314],"study_design_scores_gemma":[0.0003588218,0.0001698346,0.0005538577,0.00007089737,0.00002122331,0.00000616228,0.0001572279,0.002234584,0.0004802336,0.9957637,0.00004434695,0.0001391437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9861866,0.00008770342,0.000791927,0.0001905142,0.0007252663,0.0004547689,0.000001720463,0.0001049404,0.01145654],"genre_scores_gemma":[0.998109,9.704617e-7,0.001724006,0.00008039687,0.00003438632,0.000005258414,6.903057e-7,0.00002101293,0.00002427174],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01192239,"threshold_uncertainty_score":0.51108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1521395182","doi":"10.1017/s0963548316000158","title":"Forward Clusters for Degenerate Random Environments","year":2016,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Complement (music); Degenerate energy levels; Combinatorics; Mathematics; Lattice (music); Percolation (cognitive psychology); Random graph; Component (thermodynamics); Connected component; Hexagonal lattice; Set (abstract data type); Statistical physics; Discrete mathematics; Physics; Computer science; Graph; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.04983120555318541,"gpt":0.2969762892707818,"spread":0.2471450837175964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001056404,0.0002334528,0.0004028741,0.0000380798,0.0002387243,0.0000352486,0.0003012362,0.0001109912,0.00001304025],"category_scores_gemma":[0.004738842,0.0001670695,0.0001313548,0.0001267139,0.00007253818,0.00007380208,0.0002002767,0.00009374355,0.00001431554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002336656,"about_ca_system_score_gemma":0.00005054673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.18958e-7,"about_ca_topic_score_gemma":8.511126e-7,"domain_scores_codex":[0.9981243,0.00007403456,0.000539672,0.0004859171,0.0002830162,0.0004930585],"domain_scores_gemma":[0.9956552,0.003461963,0.0002026496,0.0004060457,0.0001149047,0.0001592451],"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.0001208815,0.0002650841,0.0001148433,0.0003273778,0.00004403061,0.000001528764,0.0001328716,0.00002963122,0.0004886606,0.9670618,0.0003891191,0.03102419],"study_design_scores_gemma":[0.003327476,0.0001800039,0.00001435415,0.00008271241,0.00004691949,0.000003265417,0.000009721983,0.02776992,0.001869668,0.9660185,0.000430525,0.0002469075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04627829,0.00004014363,0.9514854,0.0003049993,0.0006687124,0.0009693986,0.00002477069,0.0001024293,0.0001258608],"genre_scores_gemma":[0.9212967,0.000004309254,0.07828835,0.0000605439,0.0000773717,0.00005958343,0.000003115606,0.00003838143,0.000171694],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8750184,"threshold_uncertainty_score":0.6812897,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988754041","doi":"10.1017/s0963548308009127","title":"On a Question of Bourgain about Geometric Incidences","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of British Columbia","funders":"","keywords":"Omega; Euclidean space; Euclidean geometry; Combinatorics; Line (geometry); Set (abstract data type); Space (punctuation); Mathematics; Computer science; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02763155120852391,"gpt":0.2659481453081043,"spread":0.2383165940995804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001469047,0.0001749636,0.0002728458,0.0004629006,0.000353629,0.00005012514,0.000683126,0.00008480033,0.00000416387],"category_scores_gemma":[0.001276034,0.0001785482,0.0001009496,0.00282394,0.00009501703,0.0003271981,0.000294092,0.0002121671,0.00001551118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001690085,"about_ca_system_score_gemma":0.0002272652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002715761,"about_ca_topic_score_gemma":9.18577e-7,"domain_scores_codex":[0.9977514,0.0002545692,0.0005487086,0.0005093908,0.0006600485,0.0002759153],"domain_scores_gemma":[0.9976884,0.0008534128,0.0003140731,0.0005127049,0.000527621,0.0001037643],"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.000009321262,0.0006936077,0.009088297,0.00007594789,0.00001517963,0.00001027199,0.000573118,0.03697751,0.0001194415,0.928404,0.0002585615,0.02377479],"study_design_scores_gemma":[0.0006732534,0.0006194421,0.09538814,0.0001049515,0.000006612982,0.00005739024,0.000007984644,0.2619931,0.00517051,0.6353985,0.0001936139,0.0003864959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5557876,0.000190802,0.4425567,0.0001051806,0.0005183803,0.000178419,5.767503e-7,0.0001133301,0.0005490002],"genre_scores_gemma":[0.9785463,0.00001490539,0.02125167,0.00008085438,0.00004984508,0.000005057726,0.000005059145,0.00000658545,0.00003978137],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4227586,"threshold_uncertainty_score":0.7280983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100718844","doi":"10.1017/s0963548315000231","title":"Distinct Distances from Three Points","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Israeli Centers for Research Excellence; Natural Sciences and Engineering Research Council of Canada; Tel Aviv University; Hungarian Scientific Research Fund","keywords":"Set (abstract data type); Point (geometry); Upper and lower bounds; Intersection (aeronautics)","retraction":null,"screen_n_in":null,"score":{"opus":0.1409898485536636,"gpt":0.326499426148521,"spread":0.1855095775948574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309777,0.0002154186,0.0003638143,0.00003623556,0.0001400656,0.0001106189,0.0003373933,0.00009849271,0.00006428505],"category_scores_gemma":[0.005162755,0.0001785412,0.00009288319,0.0002930887,0.00009667246,0.0002234411,0.0001779967,0.0002406576,0.00007512299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000265733,"about_ca_system_score_gemma":0.00007428434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002329503,"about_ca_topic_score_gemma":0.00004012285,"domain_scores_codex":[0.998064,0.0001428237,0.0006297763,0.000384112,0.0005131933,0.0002660721],"domain_scores_gemma":[0.9976956,0.0009297172,0.0002533624,0.0005279177,0.0003911199,0.0002023455],"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.000008628931,0.0003593845,0.007038113,0.00009734026,0.00001324354,0.000001171668,0.0008028467,0.000001078374,0.00000444723,0.9890151,0.0008125665,0.00184608],"study_design_scores_gemma":[0.000483904,0.00005183557,0.00115788,0.00006989056,0.0000164572,0.000001160045,0.0001153578,0.03851012,0.0001559441,0.9588675,0.000368853,0.000201062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6756349,0.00004214112,0.3093795,0.0004198679,0.0005317011,0.0004344222,0.000006924225,0.0003177575,0.01323283],"genre_scores_gemma":[0.9238534,2.350904e-7,0.07591918,0.00003787317,0.00007569695,0.00001137989,0.00001912184,0.00002042013,0.00006270021],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2482185,"threshold_uncertainty_score":0.7280701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071579776","doi":"10.1017/s0963548306007875","title":"Reconstructing Odd Necklaces","year":2007,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trinity College","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02098889112792466,"gpt":0.2596845590390479,"spread":0.2386956679111233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003116401,0.0001896526,0.000212137,0.0001969289,0.0004738639,0.0002188576,0.0007461499,0.00009251937,0.000005464766],"category_scores_gemma":[0.0005033821,0.0002058285,0.00009268991,0.00140207,0.00005811129,0.0004873762,0.0004787336,0.0002724199,0.00002491097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001985889,"about_ca_system_score_gemma":0.0001265969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008771384,"about_ca_topic_score_gemma":0.000002751716,"domain_scores_codex":[0.9978244,0.0001046237,0.0005723419,0.0006085974,0.0004079292,0.0004820505],"domain_scores_gemma":[0.9980054,0.0006970205,0.0002259747,0.0005310346,0.0003789222,0.0001616163],"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.000004802514,0.0001456415,0.01719346,0.00004772512,0.00001401915,0.000009324609,0.0005800524,0.002532649,0.000369837,0.7881095,0.0001032704,0.1908897],"study_design_scores_gemma":[0.0006191913,0.0001271591,0.01217349,0.0000418874,0.000006880512,0.00009410696,0.00006839931,0.3205384,0.007119203,0.6563015,0.002391387,0.0005184309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3977396,0.0001123309,0.596444,0.0001925921,0.001453568,0.0001675778,2.068348e-7,0.0002989666,0.003591273],"genre_scores_gemma":[0.8755085,0.000001579471,0.1241676,0.0001130027,0.0001474779,0.000001432233,0.000003224534,0.000008007224,0.00004913644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.477769,"threshold_uncertainty_score":0.8393442,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}