{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":834,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":834,"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":"25aae82f91eb","filters":{"topic":"Limits and Structures in Graph Theory"}},"results":[{"id":"W2013425391","doi":"10.1016/j.jcta.2012.12.008","title":"On the number of pentagons in triangle-free graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":164,"is_retracted":false,"has_abstract":false,"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; Computer science; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01731228798124497,"gpt":0.2730303166830055,"spread":0.2557180287017605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002137027,0.0001741081,0.0005124487,0.0001412044,0.0001165633,0.00003663742,0.0007946949,0.0001085148,0.0014575],"category_scores_gemma":[0.002637613,0.00009798126,0.0003170439,0.0002540577,0.0002797376,0.0002612532,0.0001376321,0.0004484229,0.000004338151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003146771,"about_ca_system_score_gemma":0.00004881717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006116842,"about_ca_topic_score_gemma":0.000001257992,"domain_scores_codex":[0.9978462,0.0006339457,0.0007968114,0.0000905199,0.0004272555,0.0002052082],"domain_scores_gemma":[0.9953698,0.003112981,0.0006996258,0.0005144413,0.0002364945,0.00006667056],"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.0008904198,0.0001699308,0.0003652819,0.00002192101,0.0001010062,0.000009011042,0.001229056,8.93255e-7,0.0001326172,0.9914896,0.005360663,0.0002295957],"study_design_scores_gemma":[0.001872255,0.0003210397,0.0004947211,0.00009870758,0.00003792403,0.00006263785,0.001235073,6.860734e-7,0.001413866,0.9938669,0.000490102,0.0001060793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9826174,0.00006141847,0.00001900404,0.0006080053,0.003508363,0.0002539224,0.000005377177,0.000008492715,0.01291798],"genre_scores_gemma":[0.9990364,0.00003310735,0.0003670098,0.00009943185,0.0001987933,0.000007730092,1.849873e-7,0.00002245777,0.0002349322],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01641892,"threshold_uncertainty_score":0.9994553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029408549","doi":"10.1016/j.aim.2009.04.006","title":"Bounding multiplicative energy by the sumset","year":2009,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":148,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Bounding overwatch; Mathematics; Multiplicative function; Upper and lower bounds; Set (abstract data type); Discrete mathematics; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01552868812815231,"gpt":0.3177975687069196,"spread":0.3022688805787673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004658641,0.0002217124,0.0003046448,0.0000649285,0.0002678589,0.00003796507,0.0005486399,0.00008258745,0.00004030248],"category_scores_gemma":[0.0004954444,0.0001383725,0.00008401254,0.0002702598,0.0001781352,0.0002296226,0.00007454043,0.0002126887,0.000003611714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000491824,"about_ca_system_score_gemma":0.000009425067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002769946,"about_ca_topic_score_gemma":0.00001457303,"domain_scores_codex":[0.9986402,0.00007749677,0.0004433812,0.000230665,0.0002740097,0.0003341869],"domain_scores_gemma":[0.997766,0.001321153,0.000231525,0.0005962405,0.00003907184,0.00004604912],"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.000007240919,0.0001140218,0.00007544784,0.00003600103,0.00001015757,0.000002512278,0.002919493,0.00001169484,0.0001542607,0.9798623,0.001164152,0.01564273],"study_design_scores_gemma":[0.0002419075,0.00003441448,0.0000614054,0.00006836555,0.00001474358,0.00001549222,0.0007869696,0.000688718,0.001118269,0.9804931,0.0162898,0.0001868458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4360965,0.02698181,0.2181482,0.003280038,0.001767805,0.002300242,0.0001473879,0.0008967411,0.3103813],"genre_scores_gemma":[0.961961,0.0008017461,0.0359046,0.0004717153,0.00008220749,0.00003698906,0.000004996301,0.00002887974,0.0007078392],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5258645,"threshold_uncertainty_score":0.5642666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084490360","doi":"10.1016/j.ejc.2003.10.006","title":"Stable sets of maximal size in Kneser-type graphs","year":2003,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":123,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Automorphism; Transitive relation; Vertex (graph theory); Indifference graph; Chordal graph; Maximal independent set; Discrete mathematics; 1-planar graph; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02711403822394142,"gpt":0.2683398913297358,"spread":0.2412258531057944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002437659,0.0001570367,0.0003948483,0.0001975252,0.00006471826,0.00001774885,0.0003812815,0.000037307,0.00009790951],"category_scores_gemma":[0.001777413,0.0001261513,0.0001428253,0.0005298095,0.00007520247,0.0001279351,0.00006258879,0.0004030924,0.000002593722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003236121,"about_ca_system_score_gemma":0.00005905779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.880527e-7,"about_ca_topic_score_gemma":2.339618e-7,"domain_scores_codex":[0.9977195,0.0007817352,0.0007864443,0.0001022203,0.0003809416,0.0002291931],"domain_scores_gemma":[0.9982037,0.000479925,0.0005949459,0.0002823224,0.0003377455,0.000101386],"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.00009686145,0.0002659778,0.01290081,0.00008540968,0.00005753293,0.0003123891,0.0009327473,0.0000153322,0.0002973953,0.9831287,0.001615114,0.00029168],"study_design_scores_gemma":[0.001552566,0.0004963659,0.01014752,0.00009860331,0.00003718924,0.0001281827,0.0002205819,0.000003432917,0.001195747,0.9818355,0.004124432,0.0001598544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9593793,0.0004825843,0.0001291772,0.00002022938,0.001186396,0.00006679782,0.000001731838,0.000009013558,0.03872476],"genre_scores_gemma":[0.9967731,0.0001144147,0.00278018,0.00003010829,0.00001908113,1.110106e-7,1.480127e-7,0.00003862172,0.0002442996],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03848046,"threshold_uncertainty_score":0.51443,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972423218","doi":"10.1016/j.jctb.2012.09.003","title":"Limits of permutation sequences","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":115,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Sequence (biology); Permutation (music); Limit (mathematics); Random permutation; Limit of a sequence; Discrete mathematics; Function (biology); Limit of a function; Class (philosophy); Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03189245141778493,"gpt":0.3092918770620082,"spread":0.2773994256442233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002144958,0.0001296025,0.0003728509,0.0001202481,0.000114864,0.0000149964,0.000268101,0.0001016297,0.0001502664],"category_scores_gemma":[0.001043411,0.00009214531,0.0001854082,0.0001385512,0.0002157,0.0006680744,0.00003964363,0.000207502,8.928379e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002936649,"about_ca_system_score_gemma":0.00005186022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.357876e-7,"about_ca_topic_score_gemma":9.780518e-8,"domain_scores_codex":[0.9984193,0.0003475032,0.0006071023,0.00005402599,0.0003794536,0.0001926192],"domain_scores_gemma":[0.9978002,0.0007949279,0.0008026606,0.0001692461,0.0003353508,0.00009762172],"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.0005259825,0.00009855787,0.0007591755,0.00005326621,0.0001040354,0.000003015128,0.004124068,0.000001307537,0.001642896,0.9915516,0.0002638621,0.0008722176],"study_design_scores_gemma":[0.0005054213,0.000356251,0.0004490839,0.00005332158,0.00008681784,0.0001290164,0.001242946,3.434428e-7,0.02676671,0.9685603,0.001751371,0.00009840506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9844156,0.0006045314,0.0003542426,0.00005461184,0.008366535,0.00007965715,0.000003616391,0.00001296004,0.006108279],"genre_scores_gemma":[0.9966288,0.00005571738,0.002135562,0.00002007533,0.001018235,9.256663e-7,3.752001e-7,0.0000160178,0.000124321],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02512382,"threshold_uncertainty_score":0.3757577,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1575622900","doi":"10.37236/1819","title":"Short Cycles in Random Regular Graphs","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":112,"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":"Australian Research Council","keywords":"Mathematics; Combinatorics; Bipartite graph; Random regular graph; Random graph; Discrete mathematics; Degree (music); Poisson distribution; Random variable; Chordal graph; Graph; Statistics; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01336264396624669,"gpt":0.2724877291639331,"spread":0.2591250851976864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002186886,0.0001637448,0.0003825908,0.0001882022,0.0001611458,0.00002262624,0.0006306351,0.00009001625,0.000005620826],"category_scores_gemma":[0.0002419065,0.00009922156,0.0002273836,0.0004172421,0.0001116364,0.0001134457,0.00005769828,0.0008997131,6.596838e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002634398,"about_ca_system_score_gemma":0.0002264393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003333822,"about_ca_topic_score_gemma":0.000009130836,"domain_scores_codex":[0.9982505,0.0001708189,0.0005586653,0.00009482702,0.0004364605,0.0004887057],"domain_scores_gemma":[0.9988929,0.0003647702,0.0002451051,0.0003215417,0.0001200683,0.00005560363],"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.0001516753,0.0001081028,0.0003515421,0.00001140821,0.00008777643,0.00002164297,0.0006837862,0.00008989061,0.00009370601,0.9980158,0.0000633615,0.0003213336],"study_design_scores_gemma":[0.002542655,0.0002138528,0.0006011384,0.00004966406,0.00006846878,0.0002717308,0.0001800451,0.000002821946,0.001573903,0.9940475,0.0003305306,0.0001176551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9914814,0.003484399,0.00306027,0.0004478948,0.0004366225,0.0001511936,3.541001e-7,0.000014893,0.0009229578],"genre_scores_gemma":[0.9987859,0.0009726958,0.00005817465,0.000048676,0.00006402356,0.000002139803,1.762914e-7,0.0000241182,0.00004412642],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007304453,"threshold_uncertainty_score":0.4046138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001779588","doi":"10.1006/jcta.1999.3036","title":"Some New Bounds for Cover-Free Families","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":102,"is_retracted":false,"has_abstract":false,"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; National Natural Science Foundation of China","keywords":"Cover (algebra); Combinatorics; Mathematics; Upper and lower bounds; Discrete mathematics; Engineering; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01549486149829043,"gpt":0.2697564060704429,"spread":0.2542615445721525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001296377,0.0002370842,0.0005701944,0.0001192947,0.0003234537,0.00009880197,0.0007554172,0.0001607987,0.0007536961],"category_scores_gemma":[0.001052753,0.0001790919,0.0004139534,0.0001262963,0.000213914,0.0006504549,0.00008066437,0.0002818178,0.000003550768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005314279,"about_ca_system_score_gemma":0.0001704566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001541236,"about_ca_topic_score_gemma":4.34248e-7,"domain_scores_codex":[0.9982854,0.0001743473,0.000699767,0.0001360359,0.0003985918,0.0003058236],"domain_scores_gemma":[0.9976503,0.00108836,0.0004118173,0.0004768895,0.000203641,0.0001689541],"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.003728563,0.00007606419,0.000009853496,0.00004529503,0.0001899359,0.00001044974,0.001311902,0.000006201722,0.0000809352,0.9579729,0.03283034,0.003737554],"study_design_scores_gemma":[0.002849707,0.0008762216,0.00001509186,0.00004844411,0.0001071254,0.00009420176,0.0002783466,0.000001301634,0.001036954,0.8273224,0.1671937,0.0001765631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9547408,0.00240437,0.001255926,0.001162139,0.02279499,0.0006481626,0.00006492645,0.0001135736,0.0168151],"genre_scores_gemma":[0.9341671,0.001562763,0.0167161,0.0007675112,0.01727333,0.00001541743,0.000004047666,0.0001861535,0.02930758],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1343633,"threshold_uncertainty_score":0.8252444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058108962","doi":"10.1007/s004930170003","title":"Integer and Fractional Packings in Dense Graphs","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":92,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Graph; Disjoint sets; Integer (computer science); Pairwise comparison; Discrete mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02475962650583865,"gpt":0.2869424592811526,"spread":0.262182832775314,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001971812,0.0001026471,0.0001491307,0.0001266523,0.0001079557,0.0000187501,0.00009761569,0.00007846775,0.00009989089],"category_scores_gemma":[0.000212042,0.00008627402,0.00003987169,0.0002303645,0.00006970917,0.00007847054,0.0000747913,0.000204333,0.00000370285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003090693,"about_ca_system_score_gemma":0.000008696253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009852841,"about_ca_topic_score_gemma":0.000003585817,"domain_scores_codex":[0.999337,0.00004730073,0.0001589692,0.0001591795,0.0001335406,0.0001639782],"domain_scores_gemma":[0.9993671,0.0003150633,0.00005031257,0.0001755264,0.00003722322,0.00005473072],"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.00002017033,0.00006449544,0.03084671,0.00001193099,0.00001095744,0.0000306201,0.0004348062,1.410235e-7,0.00002194171,0.9658552,0.00175651,0.0009464782],"study_design_scores_gemma":[0.0003977663,0.00002816445,0.01679463,0.0000166591,0.00000746595,0.00005299396,0.00007951596,0.00002748749,0.00005047086,0.9750748,0.007361968,0.0001081269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9878965,0.0002428903,0.0001746958,0.0001640203,0.000361224,0.0000843302,8.438802e-7,0.00004520753,0.01103027],"genre_scores_gemma":[0.999106,0.000111019,0.0003082935,0.0001312666,0.00002013145,0.000007963655,6.908156e-7,0.00001325981,0.000301296],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01405208,"threshold_uncertainty_score":0.3518152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123221405","doi":"10.37236/1659","title":"The Number of Labeled 2-Connected Planar Graphs","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Chordal graph; 1-planar graph; Clique-sum; Discrete mathematics; Indifference graph; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01642320628677946,"gpt":0.2645024867667231,"spread":0.2480792804799437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001543184,0.0001636581,0.0003387837,0.00005795598,0.0004226316,0.00002469025,0.0009052312,0.00008454255,0.00007407898],"category_scores_gemma":[0.0005296816,0.0000802781,0.0002382988,0.0004385689,0.0001939807,0.00007105669,0.00004725749,0.0008212228,0.000003179431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008203099,"about_ca_system_score_gemma":0.00006385277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002024703,"about_ca_topic_score_gemma":0.00000308952,"domain_scores_codex":[0.998008,0.0002963791,0.0006218314,0.00007855947,0.0005045128,0.0004907093],"domain_scores_gemma":[0.996682,0.001746512,0.0007634301,0.0004373831,0.0003168898,0.00005380871],"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.0000604631,0.00008915253,0.0003106309,0.00001255952,0.0002725389,0.000003792557,0.0006469653,9.391431e-7,0.00009711909,0.9955233,0.002662603,0.0003199095],"study_design_scores_gemma":[0.000821361,0.0002096946,0.0001071619,0.00002156456,0.0001261266,0.0002932528,0.0001859453,0.00003194068,0.0008861713,0.9940214,0.003197648,0.0000977325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.988877,0.004904623,0.0003304895,0.0007622265,0.0007013995,0.0001402817,0.00000159607,0.00001864661,0.004263746],"genre_scores_gemma":[0.997157,0.002082739,0.00002833218,0.00004684695,0.00006416313,0.000001578325,1.415396e-7,0.00002428934,0.0005948835],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008280034,"threshold_uncertainty_score":0.356785,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118601530","doi":"10.48550/arxiv.math/0401069","title":"Random subgraphs of finite graphs: I. The scaling window under the triangle condition","year":2004,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":89,"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":"Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Delft; Microsoft Research","keywords":"Window (computing); Scaling; Combinatorics; Mathematics; Computer science; Discrete mathematics; Geometry; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.06438459522841702,"gpt":0.3105345657047039,"spread":0.2461499704762869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001696327,0.0004412175,0.0007286978,0.000183814,0.0005709889,0.0000624208,0.00101783,0.0004356606,0.0001589642],"category_scores_gemma":[0.0006047774,0.0002329709,0.0008908623,0.0003034306,0.0007714389,0.00006483735,0.0005307787,0.001132387,0.000008176638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004411663,"about_ca_system_score_gemma":0.0001233311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007114864,"about_ca_topic_score_gemma":0.00003166404,"domain_scores_codex":[0.9973165,0.0005531753,0.0008382504,0.000452659,0.0004727801,0.0003665937],"domain_scores_gemma":[0.9944954,0.002933177,0.0008118918,0.001518593,0.0001792565,0.00006170826],"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.0006813757,0.0002760803,0.02218988,0.000909029,0.002010148,0.00001746124,0.009851565,0.006521854,0.0004639495,0.9552615,0.001141815,0.0006752901],"study_design_scores_gemma":[0.002249408,0.00003163815,0.02063841,0.0003535704,0.0004638329,0.000008320289,0.000867412,0.00004690078,0.001719682,0.9731672,0.0001570094,0.0002966368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9896597,0.001332876,0.003737437,0.0006726909,0.001436878,0.001174478,0.00009579058,0.00009971438,0.001790427],"genre_scores_gemma":[0.9983368,0.0003220746,0.0002701986,0.0004746305,0.0002543749,0.00009606134,0.00004502811,0.00006428926,0.0001365535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01790562,"threshold_uncertainty_score":0.9500276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1532975866","doi":"10.1214/16-aop1094","title":"Local algorithms for independent sets are half-optimal","year":2017,"lang":"en","type":"article","venue":"The Annals of Probability","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Asymptotically optimal algorithm; Infinity; Discrete mathematics; Upper and lower bounds; Random graph; Poisson distribution; Tree (set theory); Algorithm; Statistics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.2213734033283845,"gpt":0.4079639967249845,"spread":0.1865905933966001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002277472,0.0001599474,0.0003283813,0.00002046772,0.000687243,0.00004705911,0.0009378699,0.0001150399,0.00004163524],"category_scores_gemma":[0.001427714,0.00009613564,0.0002535998,0.00002397985,0.0007386091,0.0001174057,0.0003603352,0.0001703949,0.000001764532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001196699,"about_ca_system_score_gemma":0.00003165406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003540232,"about_ca_topic_score_gemma":0.00004279398,"domain_scores_codex":[0.9987264,0.0001136823,0.0003484137,0.0002556559,0.0002709581,0.0002849326],"domain_scores_gemma":[0.9971421,0.0004261584,0.0004751569,0.001582517,0.0003102459,0.00006379781],"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.0006155348,0.0004803464,0.003149893,0.0008606079,0.0002939009,0.000003422228,0.002597363,0.0001161438,0.00006459555,0.948722,0.006858041,0.03623817],"study_design_scores_gemma":[0.0002989944,0.00009989676,0.01400758,0.00003451601,0.00003169059,0.000003720413,0.0001399037,0.0005199336,0.005128509,0.9788679,0.0007442593,0.0001230751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9786025,0.0001087712,0.014648,0.003558472,0.0004119777,0.001069336,0.0001153829,0.00004537292,0.001440153],"genre_scores_gemma":[0.9898924,0.000008149967,0.009682615,0.000118845,0.0001089204,0.00004634203,0.00000158978,0.00001610355,0.0001250044],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0361151,"threshold_uncertainty_score":0.5285787,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995234636","doi":"10.1016/j.ejc.2008.05.006","title":"A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Coset; Symmetric group; Point (geometry); Upper and lower bounds; Discrete mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0373681242687923,"gpt":0.2692964400335086,"spread":0.2319283157647163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009355524,0.0001195909,0.0003014571,0.0001159341,0.0001869038,0.000007589962,0.0005176499,0.00002349874,0.00001027355],"category_scores_gemma":[0.001310566,0.00007435909,0.0003174016,0.0002306929,0.000154855,0.00008013382,0.0001062322,0.0002371341,1.512095e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002301545,"about_ca_system_score_gemma":0.00009482013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.668259e-7,"about_ca_topic_score_gemma":3.118993e-7,"domain_scores_codex":[0.9984855,0.0003062102,0.0007145906,0.00007296618,0.000294357,0.0001263879],"domain_scores_gemma":[0.9976234,0.0005985583,0.001027359,0.0002562813,0.0004391753,0.00005523412],"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.000102216,0.0001275773,0.001547878,0.0001635731,0.0001584257,0.00001414633,0.02082299,0.00005880578,0.0005253465,0.9713637,0.003013318,0.002101996],"study_design_scores_gemma":[0.001566953,0.0006084783,0.003009942,0.0002750631,0.0001357604,0.0002770039,0.002493485,0.00004686859,0.01050897,0.97971,0.001233371,0.0001341235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9556209,0.0002573742,0.03337507,0.0001035354,0.001114925,0.0002114893,0.000006794245,0.000008953096,0.009300976],"genre_scores_gemma":[0.9954191,0.00002396925,0.004098366,0.00002034147,0.00009680966,3.557574e-7,1.85465e-7,0.00003195923,0.0003088889],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03979824,"threshold_uncertainty_score":0.3032276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132073309","doi":"10.1016/s0012-365x(03)00197-3","title":"Coloring the hypergraph of maximal cliques of a graph with no long path","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; Graph; Discrete mathematics; Fractional coloring; Graph coloring; Graph power; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01983438949883126,"gpt":0.2645574246920283,"spread":0.244723035193197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007666767,0.0002609233,0.0005426381,0.0001028518,0.0001576239,0.00001886945,0.0003865827,0.00009507313,0.00006837171],"category_scores_gemma":[0.0004724131,0.0001403065,0.0002265972,0.0003239814,0.000477101,0.00007811894,0.00008088152,0.0001931016,0.000001417365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001013423,"about_ca_system_score_gemma":0.00003460034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005016496,"about_ca_topic_score_gemma":0.000006680158,"domain_scores_codex":[0.998319,0.0001257998,0.0006320896,0.0001915164,0.0004454374,0.0002861281],"domain_scores_gemma":[0.9977267,0.0007096579,0.0005254144,0.0007640027,0.0002175485,0.00005672225],"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.00004516792,0.0001159772,0.002446462,0.0008516118,0.0001942669,0.000005380145,0.003988091,0.000006557986,0.0004153152,0.9917805,0.00009015909,0.00006056923],"study_design_scores_gemma":[0.0004617232,0.0003309452,0.0004880893,0.0004352451,0.0002537267,0.00005326015,0.002272984,0.0001265939,0.01456656,0.9805797,0.0001419806,0.0002891724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9603713,0.0001807808,0.009593562,0.00002072723,0.0001145953,0.0004901582,0.00002685425,0.00005147425,0.02915056],"genre_scores_gemma":[0.938718,0.00004817788,0.06096557,0.00002128814,0.00002175875,0.00002353405,0.000001569577,0.00004774001,0.0001523098],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05137201,"threshold_uncertainty_score":0.5721532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061886541","doi":"10.1016/j.aim.2012.06.022","title":"A measure-theoretic approach to the theory of dense hypergraphs","year":2012,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Hypergraph; Lemma (botany); Measure (data warehouse); Lebesgue measure; Discrete mathematics; Mathematical proof; Ultraproduct; Pure mathematics; Lebesgue integration","retraction":null,"screen_n_in":null,"score":{"opus":0.02788214745885991,"gpt":0.2875338061719537,"spread":0.2596516587130938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003051801,0.0002598571,0.0004789985,0.0001747537,0.0001363333,0.00001267559,0.0006664599,0.00009911416,0.00004133785],"category_scores_gemma":[0.001735117,0.0001537601,0.0001602163,0.000531697,0.0003207079,0.0002125798,0.0001862418,0.0002461896,0.000009486428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002792638,"about_ca_system_score_gemma":0.00001420913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.885202e-7,"about_ca_topic_score_gemma":0.000002207521,"domain_scores_codex":[0.9979464,0.0002772468,0.0006319414,0.0001967259,0.0004664725,0.0004812566],"domain_scores_gemma":[0.9968777,0.001791169,0.0002526868,0.0008954676,0.00008041588,0.0001026169],"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.00003179899,0.0003349317,0.000704619,0.0003947597,0.00003086287,4.529229e-7,0.01298354,0.00004997479,0.00004356693,0.9813825,0.00008432586,0.003958597],"study_design_scores_gemma":[0.0002188634,0.00002843754,0.0002176003,0.0001514057,0.00006657945,0.00003251572,0.003451618,0.0001058263,0.0005667977,0.9939331,0.00101638,0.0002108591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4800009,0.02249939,0.2257798,0.0001308649,0.001379285,0.0025435,0.00003118086,0.0002035081,0.2674315],"genre_scores_gemma":[0.8951003,0.0002450629,0.1041906,0.0001065926,0.00009852252,0.00007785139,6.281966e-7,0.00004426771,0.0001362136],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4150994,"threshold_uncertainty_score":0.6270154,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076011470","doi":"10.1006/jctb.1999.1938","title":"The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Science Foundation; Hungarian Scientific Research Fund; National Security Agency; National Science Foundation","keywords":"Fano plane; Projective plane; Conjecture; Plane (geometry); Mathematics; Combinatorics; Constant (computer programming); Set (abstract data type); Order (exchange); Discrete mathematics; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0122255240268587,"gpt":0.2518255740639708,"spread":0.2396000500371121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002624567,0.0002297935,0.0005939748,0.0000762627,0.0004673243,0.00005826933,0.000701185,0.0001465803,0.0005480182],"category_scores_gemma":[0.001096893,0.0001378754,0.0003464403,0.0001842551,0.0004888367,0.0002788865,0.00007197473,0.0004594722,0.000001644285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003170421,"about_ca_system_score_gemma":0.00008689216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002060079,"about_ca_topic_score_gemma":0.000001362381,"domain_scores_codex":[0.9976677,0.00037734,0.0009820182,0.0001111762,0.0005518879,0.0003099172],"domain_scores_gemma":[0.9947706,0.003669848,0.0007641268,0.0004070066,0.000279874,0.0001085691],"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.007286414,0.00006887874,0.0000598448,0.00002920482,0.0002629358,0.00002738498,0.00166612,0.000003872517,0.0004134008,0.9837077,0.0003410318,0.006133179],"study_design_scores_gemma":[0.001640287,0.001065404,0.0001210309,0.00007799426,0.000100824,0.0002497369,0.001452192,0.000001103935,0.00423508,0.9735577,0.01734041,0.0001582506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.973737,0.0003406373,0.00003322676,0.0002167483,0.004450598,0.0001667173,0.00001354389,0.00002515092,0.02101639],"genre_scores_gemma":[0.9975855,0.0003266048,0.000696117,0.00007714955,0.0005452199,0.000002292127,4.033601e-7,0.00003134754,0.0007353119],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02384857,"threshold_uncertainty_score":0.6000415,"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":"W1986323939","doi":"10.1016/j.jctb.2007.10.007","title":"Eigenvalue bounds for independent sets","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":78,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Independence (probability theory); Combinatorics; Maximal independent set; Independence number; Independent set; Set (abstract data type); Polarity (international relations); Discrete mathematics; Graph; Chordal graph; 1-planar graph; Computer science; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03658537179050098,"gpt":0.3004630221539611,"spread":0.2638776503634602,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001925209,0.0002125786,0.0005197219,0.0001451599,0.0005438301,0.00003600338,0.0004709459,0.0001754787,0.0001345377],"category_scores_gemma":[0.001041894,0.0001605762,0.0003853558,0.0001183801,0.0002735687,0.0003617544,0.00009341096,0.0003349628,0.000001273557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006996373,"about_ca_system_score_gemma":0.0001583309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.629613e-7,"about_ca_topic_score_gemma":3.654681e-7,"domain_scores_codex":[0.9981282,0.000254195,0.0007134214,0.0001304391,0.0004913034,0.0002824435],"domain_scores_gemma":[0.9975242,0.000955079,0.00062977,0.0003002054,0.0004517972,0.0001389593],"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.00186778,0.0001168577,0.0001368147,0.00004227133,0.0001985507,0.00005105841,0.002174361,0.000002881271,0.0001748026,0.9907024,0.004099888,0.0004323318],"study_design_scores_gemma":[0.001967641,0.0008189958,0.0001761703,0.00003224389,0.00008338932,0.0008433358,0.0003589356,0.00000154846,0.00337584,0.9745775,0.01757862,0.0001857875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9785196,0.0003722972,0.002188237,0.0001155628,0.01451469,0.0002933913,0.00001531752,0.00003704653,0.00394384],"genre_scores_gemma":[0.9938701,0.00009159118,0.003841674,0.00007749662,0.0013026,0.000006445835,0.000001057969,0.00004245326,0.0007665527],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01612491,"threshold_uncertainty_score":0.6548107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055241129","doi":"10.3934/amc.2009.3.13","title":"Combinatorial batch codes","year":2009,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Code (set theory); Mathematics; Discrete mathematics; Combinatorics; Probabilistic logic; Theoretical computer science; Computer science; Operating system; Statistics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.03114483656957134,"gpt":0.3625640533067013,"spread":0.3314192167371299,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005360453,0.0001361955,0.0003625376,0.0001226666,0.0001561377,0.00001079164,0.001250329,0.00007427182,0.00002200597],"category_scores_gemma":[0.0006959185,0.0001205332,0.00008353555,0.0002838393,0.000267113,0.0002275701,0.0001987562,0.0002209344,0.000002030621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002328471,"about_ca_system_score_gemma":0.00001872432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001569873,"about_ca_topic_score_gemma":0.00001638504,"domain_scores_codex":[0.9988029,0.00009856663,0.0006063935,0.0001107296,0.000212732,0.0001686785],"domain_scores_gemma":[0.9961045,0.001656029,0.0002913305,0.001807245,0.0001060999,0.00003477823],"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.000006020809,0.000394661,0.0001431481,0.00006488595,0.000008709065,3.017017e-7,0.001816324,0.000009544981,0.0001079051,0.995028,0.00005039099,0.002370139],"study_design_scores_gemma":[0.0003410454,0.00005434698,0.0001591717,0.0001323027,0.00001908778,0.000003331524,0.0004131655,0.0004180931,0.0005061643,0.9958242,0.002004678,0.0001243799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2559713,0.01432222,0.01657238,0.002186832,0.0009098747,0.001613038,0.00005909923,0.0003611478,0.7080041],"genre_scores_gemma":[0.834378,0.001651326,0.163858,0.00003056786,0.00001725117,0.00001312921,0.00000382097,0.00001113967,0.00003675069],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7079673,"threshold_uncertainty_score":0.4915202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145092624","doi":"10.1112/s0024609304003650","title":"THE CAMERON–ERDOS CONJECTURE","year":2004,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":76,"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; Conjecture; Combinatorics; Mathematics Subject Classification; Subject (documents); Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0134768641559329,"gpt":0.2540492604993614,"spread":0.2405723963434285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009274239,0.0002518962,0.000375313,0.000007776625,0.0008613719,0.00004340832,0.0009853735,0.0001948663,0.0004337257],"category_scores_gemma":[0.0009479726,0.0001139124,0.0007920829,0.0001380781,0.0009370446,0.00001226405,0.0004507218,0.0004612624,0.00003839749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006153234,"about_ca_system_score_gemma":0.00003936595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001185875,"about_ca_topic_score_gemma":0.000002187211,"domain_scores_codex":[0.9981593,0.0001263171,0.0005282804,0.0002240676,0.0005646824,0.0003973413],"domain_scores_gemma":[0.9970136,0.001576665,0.0002961314,0.0009612989,0.00007540668,0.00007689343],"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.00001495012,0.00008747007,0.00002485448,0.0001816252,0.0001251477,7.048494e-7,0.001681099,0.00001872017,0.0001105589,0.9644991,0.03293331,0.0003224722],"study_design_scores_gemma":[0.0006201992,0.00003492685,0.00009058266,0.0001095145,0.00008364711,0.00002870155,0.0004254343,0.00001730661,0.002584125,0.9596879,0.03616391,0.000153682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8589497,0.001756518,0.01455042,0.08032665,0.001508487,0.003037406,0.00005645454,0.0004173183,0.03939702],"genre_scores_gemma":[0.9555059,0.0001178123,0.03688469,0.001735601,0.0002448408,0.00005488215,8.815725e-7,0.00008279362,0.005372602],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09655616,"threshold_uncertainty_score":0.6625063,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167472711","doi":"10.1112/s0024609305004261","title":"ON THE NUMBER OF SUMS AND PRODUCTS","year":2005,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":76,"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":"Mathematics; Mathematics Subject Classification; Subject (documents); Set (abstract data type); Finite set; Combinatorics; Discrete mathematics; Mathematical analysis; Computer science; Library science","retraction":null,"screen_n_in":null,"score":{"opus":0.01865851947645158,"gpt":0.2644217652044575,"spread":0.245763245728006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009536892,0.0001593737,0.0003093095,0.000005918744,0.0001810063,0.00001115511,0.0004153206,0.0000986095,0.001140568],"category_scores_gemma":[0.001344841,0.00007208241,0.0002710094,0.00009501523,0.000600064,0.000009580858,0.0002776558,0.0002346751,0.00002091061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001354047,"about_ca_system_score_gemma":0.00001068724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000023159,"about_ca_topic_score_gemma":1.816808e-7,"domain_scores_codex":[0.9987395,0.0001232337,0.0003915461,0.0001702062,0.0003882813,0.0001872459],"domain_scores_gemma":[0.9970556,0.001946796,0.000235216,0.0006524357,0.00007596306,0.00003397625],"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.0000149939,0.0001343007,0.00008960743,0.0003286673,0.00006546072,7.23664e-8,0.001462616,0.000001526391,0.0001745281,0.9407186,0.05674889,0.0002607728],"study_design_scores_gemma":[0.0002778746,0.00002079112,0.0002260519,0.0001467203,0.00006449938,0.00001391806,0.0002016451,0.00007796752,0.008417531,0.9807966,0.009650533,0.0001058675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9649127,0.00008371811,0.000146849,0.01730715,0.00007001372,0.000480303,0.000009229896,0.00002709922,0.0169629],"genre_scores_gemma":[0.970776,0.00002820212,0.02512965,0.0008566145,0.0000922597,0.00001411323,2.144738e-7,0.00002693319,0.003076078],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04709836,"threshold_uncertainty_score":0.9997725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148534827","doi":"10.1016/j.disc.2005.11.002","title":"Contributions to zero-sum problems","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Subsequence; Modulo; Mathematics; Generalization; Zero (linguistics); Sequence (biology); Integer (computer science); Combinatorics; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02322831090994227,"gpt":0.3180201888731566,"spread":0.2947918779632144,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005222086,0.0002736009,0.0004002511,0.0001190902,0.0003531983,0.00007229541,0.0004180042,0.0001275423,0.0002564249],"category_scores_gemma":[0.0008875214,0.0002087665,0.000179332,0.000252493,0.00008970249,0.0001225207,0.0002255209,0.0002081792,0.0001886951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008187464,"about_ca_system_score_gemma":0.00002573141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002085312,"about_ca_topic_score_gemma":0.00001084192,"domain_scores_codex":[0.9982825,0.00004716839,0.0005589822,0.0002674079,0.0003670066,0.0004769686],"domain_scores_gemma":[0.9983507,0.0003715132,0.0001564317,0.0007364145,0.0001624353,0.000222503],"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.000005215744,0.00009952343,0.00002392786,0.0001257146,0.00005808517,0.000001771312,0.004597112,0.00005748362,0.0004308244,0.9829172,0.01095539,0.0007277586],"study_design_scores_gemma":[0.0003481743,0.00005382266,0.00002588122,0.0001117866,0.00007619552,0.00002358412,0.0002408047,0.001075075,0.001859942,0.9660268,0.02982169,0.0003362168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3370623,0.0003066827,0.5347832,0.006441941,0.0007475275,0.003035693,0.0006237915,0.001101734,0.1158971],"genre_scores_gemma":[0.8508707,0.00001077614,0.1450116,0.0004888786,0.0002886293,0.00009565426,0.00001263435,0.00006992583,0.003151224],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5138083,"threshold_uncertainty_score":0.851325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139746216","doi":"10.1016/j.jcta.2005.02.005","title":"The Ramsey number for hypergraph cycles I","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypergraph; Combinatorics; Mathematics; Monochromatic color; Ramsey's theorem; Discrete mathematics; Graph; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01623024312695025,"gpt":0.2984830645079066,"spread":0.2822528213809563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002551462,0.0001853086,0.0003629862,0.00005032714,0.0007065684,0.0001019161,0.0005643207,0.000119175,0.00008315106],"category_scores_gemma":[0.001202929,0.0001062112,0.0004115272,0.0001126378,0.0002913286,0.0003166086,0.00007929042,0.0002880373,0.000002126755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000381531,"about_ca_system_score_gemma":0.00005688603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.513207e-7,"about_ca_topic_score_gemma":0.000001146919,"domain_scores_codex":[0.9983738,0.0002537643,0.0006515559,0.0001008637,0.0003337864,0.0002861954],"domain_scores_gemma":[0.9960814,0.0025816,0.0005608351,0.0003134352,0.0003663253,0.00009644907],"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.001731553,0.00006430627,0.00006413922,0.00001672203,0.0001879509,0.000002736144,0.0006973117,0.000002591167,0.00008013212,0.9841582,0.006976817,0.006017535],"study_design_scores_gemma":[0.001095348,0.0001974117,0.0000321041,0.00002403588,0.00007479973,0.0001287311,0.0005183005,0.000002063833,0.001331857,0.8122138,0.1842655,0.0001160405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9635143,0.001245611,0.001653565,0.002548127,0.01833026,0.0005676415,0.00001685464,0.00007019696,0.01205345],"genre_scores_gemma":[0.9904236,0.0002135426,0.005070063,0.0001262358,0.003136473,0.00001038205,3.781438e-7,0.00004166862,0.0009776993],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1772887,"threshold_uncertainty_score":0.5434424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125752997","doi":"10.1007/s00493-009-2362-0","title":"Hamilton cycles in highly connected and expanding graphs","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Cograph; Indifference graph; Random graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Pathwidth; Graph; Variety (cybernetics); Chordal graph; 1-planar graph; Line graph; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02254772965857041,"gpt":0.2961572810110416,"spread":0.2736095513524712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001904214,0.0001399616,0.0002373618,0.0001724098,0.0001474657,0.00002711963,0.0001437425,0.00009323024,0.00001058149],"category_scores_gemma":[0.0001498025,0.0001189708,0.00004212005,0.0002860044,0.00005493391,0.00007620491,0.00003777726,0.0001619057,9.827257e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000303815,"about_ca_system_score_gemma":0.000006141777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000490299,"about_ca_topic_score_gemma":0.000001680158,"domain_scores_codex":[0.9991612,0.00006900541,0.0002143664,0.000203505,0.0001266241,0.0002252618],"domain_scores_gemma":[0.9993289,0.0002756672,0.00006379882,0.0002393739,0.00002598507,0.00006627045],"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.00001614358,0.00006790925,0.002817538,0.00001721292,0.000007913251,0.00001594743,0.001145847,1.769475e-7,0.0004284659,0.9932929,0.000461384,0.001728582],"study_design_scores_gemma":[0.0007003539,0.00009126512,0.0288198,0.00003762804,0.00001023315,0.000008152142,0.00009199074,0.00002702979,0.0008473497,0.9688726,0.0003369795,0.000156594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9925133,0.000500165,0.00002870553,0.000105597,0.0002440462,0.0001334401,0.000001300592,0.0001010611,0.006372385],"genre_scores_gemma":[0.9992325,0.000108825,0.0004505211,0.0001106283,0.00001478774,0.00000458808,0.000001212442,0.0000118899,0.00006508412],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02600227,"threshold_uncertainty_score":0.485149,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037774402","doi":"10.1093/imrn/rnm007","title":"Sum-product Estimates in Finite Fields via Kloosterman Sums","year":2007,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":58,"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":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; National Science Foundation","keywords":"Kloosterman sum; Mathematics; Finite field; Product (mathematics); Pure mathematics; Discrete mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.1318274109231465,"gpt":0.45161490386467,"spread":0.3197874929415234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005024167,0.0002218515,0.0003037326,0.000809053,0.000216684,0.0001565802,0.001081009,0.0001368689,0.0004700597],"category_scores_gemma":[0.004514622,0.000182301,0.0001021213,0.0003778306,0.0002796051,0.0002910421,0.00049554,0.0006914683,0.00007271057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001133918,"about_ca_system_score_gemma":0.00003546569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007773533,"about_ca_topic_score_gemma":0.0004722662,"domain_scores_codex":[0.9968156,0.000101709,0.00071654,0.0003781961,0.001344888,0.0006430755],"domain_scores_gemma":[0.9917452,0.006977327,0.0001713519,0.0005570706,0.0004244572,0.0001245493],"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.0001746383,0.0009201241,0.01032052,0.0007900071,0.000239259,0.000313664,0.01096882,0.0002300964,0.001091625,0.9634922,0.00177106,0.009687964],"study_design_scores_gemma":[0.0004233429,0.00006201012,0.002839556,0.0002413673,0.00001214697,0.00002456249,0.0007181572,0.009214735,0.00510477,0.9801134,0.0009960569,0.000249904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9103794,0.0001720355,0.0138522,0.001019286,0.001011205,0.0005834776,0.00001718149,0.0001132895,0.072852],"genre_scores_gemma":[0.9697413,0.00002514238,0.02863556,0.00006206019,0.0003155528,0.00002156097,0.000009936639,0.00004033186,0.001148496],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0717035,"threshold_uncertainty_score":0.743402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1550173909","doi":"10.37236/1107","title":"Encores on Cores","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":55,"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":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Random graph; Combinatorics; Sequence (biology); Discrete mathematics; Simple (philosophy); Poisson distribution; Random regular graph; Degree (music); Graph; Line graph; Pathwidth; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01095922579002131,"gpt":0.2607164635614196,"spread":0.2497572377713983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009513105,0.0001382714,0.0002328007,0.00009600081,0.0002743723,0.00002480906,0.0005404907,0.00006029872,0.00002219113],"category_scores_gemma":[0.0001937841,0.00007572819,0.000165616,0.0001918274,0.00009133861,0.00005579334,0.00004196811,0.0006314529,0.000002480973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001445991,"about_ca_system_score_gemma":0.0001003179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004924813,"about_ca_topic_score_gemma":0.000007938655,"domain_scores_codex":[0.9986246,0.000107634,0.0003821418,0.00007190932,0.0004289978,0.0003846858],"domain_scores_gemma":[0.9983433,0.0008060902,0.0004030424,0.0002738806,0.0001412322,0.00003240115],"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.00007137537,0.00009898274,0.000303359,0.000007987132,0.00004852944,0.00000731335,0.0001314435,0.00003367485,0.00002868865,0.9926161,0.006530751,0.000121823],"study_design_scores_gemma":[0.0004973956,0.0005216477,0.0006067535,0.0000223636,0.00005414247,0.0001317194,0.00004578862,0.00001207727,0.00123136,0.9897944,0.006991687,0.00009069333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9840909,0.00196429,0.001923458,0.0006371464,0.0008447539,0.0001067141,7.853801e-7,0.00002438303,0.0104076],"genre_scores_gemma":[0.9988676,0.0001982506,0.00002296965,0.00007271029,0.000276677,0.000001076038,1.880407e-7,0.00002040647,0.0005400973],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01477676,"threshold_uncertainty_score":0.3088106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994460676","doi":"10.1002/rsa.20496","title":"The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers","year":2013,"lang":"en","type":"article","venue":"Random Structures and Algorithms","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":"Trinity College","funders":"","keywords":"Mathematics; Cardinality (data modeling); Combinatorics; Constant (computer programming); Function (biology); Discrete mathematics; Set (abstract data type); Piecewise; Piecewise linear function; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01226066911795185,"gpt":0.2748042403165601,"spread":0.2625435711986083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001177393,0.000304143,0.001040366,0.00006083882,0.0001774511,0.00004238209,0.0003021627,0.00016306,0.0001020843],"category_scores_gemma":[0.0009463868,0.0001448979,0.0002116286,0.0001640275,0.00118012,0.00009033178,0.0001764256,0.0002834751,1.944973e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001032257,"about_ca_system_score_gemma":0.0000265807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005447079,"about_ca_topic_score_gemma":0.00005470641,"domain_scores_codex":[0.9977601,0.0004589059,0.0008813171,0.0002557246,0.0003399061,0.0003040472],"domain_scores_gemma":[0.9932969,0.005493194,0.000544997,0.0004417411,0.0001517482,0.00007147632],"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.04959156,0.0002209686,0.01809194,0.002978434,0.00306911,0.00003674543,0.05469959,0.0002142696,0.004274207,0.6649465,0.002397436,0.1994792],"study_design_scores_gemma":[0.03778512,0.00007732349,0.005933139,0.0001280155,0.0001474834,0.00005886628,0.002582378,0.002494427,0.001706783,0.9487817,0.00009265837,0.0002121029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9962668,0.001132475,0.0002118,0.0002804224,0.0002371822,0.00118383,0.00007916629,0.0000124331,0.0005958237],"genre_scores_gemma":[0.9974622,0.0006041673,0.001718113,0.00005970335,0.00004773245,0.00003455305,0.000003655645,0.00002513294,0.00004478676],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2838352,"threshold_uncertainty_score":0.5908763,"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":"W1970138544","doi":"10.1016/j.jctb.2011.03.005","title":"Finitely forcible graphons","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Iterated function; Mathematics; Algebraic structure; Combinatorics; Graph; Discrete mathematics; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05386988719056061,"gpt":0.2767839143148161,"spread":0.2229140271242555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001654577,0.0001982923,0.000443531,0.0002176108,0.0002469279,0.0000290005,0.0005392684,0.0001409283,0.0007397281],"category_scores_gemma":[0.0007391019,0.0001444754,0.0003408724,0.0002279771,0.0002595744,0.0004449217,0.000110428,0.0003779516,0.000003432975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002327855,"about_ca_system_score_gemma":0.00006491604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001190369,"about_ca_topic_score_gemma":5.049225e-7,"domain_scores_codex":[0.9983539,0.0002855233,0.0006529329,0.0001099746,0.0003385091,0.0002591393],"domain_scores_gemma":[0.9980184,0.0005830407,0.0005985019,0.0003429111,0.0003174714,0.000139678],"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.001390279,0.0001283617,0.0002292798,0.00002471906,0.0001665697,0.00004811978,0.003405162,1.758659e-7,0.0001094921,0.992183,0.001793138,0.0005216846],"study_design_scores_gemma":[0.0007355764,0.0007367241,0.0001741578,0.00004304889,0.0001004708,0.0002113125,0.0007227628,2.218711e-7,0.008762904,0.9823499,0.005992872,0.0001700421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8970528,0.0004073299,0.00140025,0.00005649007,0.01866594,0.0001992335,0.000009353998,0.00007379373,0.08213485],"genre_scores_gemma":[0.9935685,0.00006820561,0.005100422,0.00006073192,0.0006127656,0.000002224679,3.036095e-7,0.00003488466,0.0005519795],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09651573,"threshold_uncertainty_score":0.8099504,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1822544575","doi":"10.1090/crmp/043/12","title":"Lattice points on circles, squares in arithmetic progressions and sumsets of squares","year":2007,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":51,"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":"Arithmetic; Mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04836523270387424,"gpt":0.3139277180477621,"spread":0.2655624853438879,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005796834,0.0006725594,0.000938355,0.0007714163,0.0002000996,0.00006629893,0.0003660193,0.000966888,0.0001033262],"category_scores_gemma":[0.00149401,0.0005366212,0.0001946044,0.0001383929,0.0004195197,0.00008885741,0.0002032677,0.001150929,0.000003037712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006615502,"about_ca_system_score_gemma":0.00004920518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007654755,"about_ca_topic_score_gemma":0.00003618509,"domain_scores_codex":[0.9975315,0.00001408604,0.000671469,0.0006998412,0.0006039361,0.0004791335],"domain_scores_gemma":[0.9974077,0.001241933,0.000603353,0.0002997433,0.0003009076,0.0001463666],"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.0001442969,0.00006226485,0.0008071403,0.001305236,0.00009357975,0.00002109958,0.002507967,6.204056e-7,0.0001478726,0.9788653,0.00009515842,0.01594951],"study_design_scores_gemma":[0.0004596132,0.0003109238,0.0008565093,0.002843899,0.0001824207,0.00004528909,0.00005942801,0.00001281671,0.002740365,0.9892715,0.002665725,0.0005514862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3014914,0.007941685,0.0003150738,0.0009884352,0.0007184283,0.002865222,0.0001787134,0.0004183359,0.6850827],"genre_scores_gemma":[0.9969625,0.0001611327,0.001851439,0.0002425883,0.0002818118,0.00001922986,0.00001279208,0.0001614573,0.0003070247],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6954711,"threshold_uncertainty_score":0.9997085,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052325621","doi":"10.1016/j.aim.2005.04.011","title":"On the Turán number for the hexagon","year":2005,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Counterexample; Upper and lower bounds; Bipartite graph; Graph; Vertex (graph theory); Quadrilateral; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02735860851489594,"gpt":0.3386668760703834,"spread":0.3113082675554874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008940641,0.0001974791,0.0002262861,0.00002962849,0.0003412231,0.0000347826,0.0005762931,0.00007054795,0.0002809314],"category_scores_gemma":[0.001345403,0.0000905434,0.000129448,0.0001466888,0.0001692111,0.0001336979,0.00008008836,0.0002462733,0.00003250757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003733316,"about_ca_system_score_gemma":0.00001016698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.727699e-7,"about_ca_topic_score_gemma":0.0000217502,"domain_scores_codex":[0.9988388,0.00005006744,0.0003827336,0.0001746248,0.0002606369,0.0002931813],"domain_scores_gemma":[0.9895342,0.009539588,0.000168616,0.0006889586,0.00004312989,0.00002549548],"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.00001502047,0.00008326603,0.00002650538,0.00008148036,0.00001781835,4.475322e-7,0.002096892,0.0002087629,0.000003943798,0.986506,0.002186094,0.00877379],"study_design_scores_gemma":[0.0002364055,0.00002010361,0.00002088858,0.00007255877,0.00002493324,0.000008783016,0.0006848389,0.002804352,0.0002684406,0.9459547,0.04977238,0.0001316341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4981565,0.006922334,0.1340235,0.01670972,0.003561044,0.008307151,0.0001077946,0.0005545589,0.3316574],"genre_scores_gemma":[0.9111369,0.0005675411,0.08354784,0.001451135,0.0004666036,0.0003474784,0.00000138684,0.00007327631,0.002407857],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4129804,"threshold_uncertainty_score":0.3692253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111430057","doi":"10.1007/s00493-005-0036-0","title":"Proof Of A Conjecture Of Erdős On Triangles In Set-Systems","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Microsoft Research","keywords":"Conjecture; Combinatorics; Mathematics; Element (criminal law); Set (abstract data type); Discrete mathematics; Law; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03945362164017345,"gpt":0.3051523326153394,"spread":0.2656987109751659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002865261,0.0001259232,0.000485831,0.0001569323,0.00002827269,0.000004276228,0.0002186789,0.0001138181,0.00001727587],"category_scores_gemma":[0.0002136719,0.00009210276,0.00009825185,0.0002677969,0.00006134832,0.00003047363,0.00004818413,0.0001392713,7.948347e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004255139,"about_ca_system_score_gemma":0.00002524046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004356489,"about_ca_topic_score_gemma":0.000001679473,"domain_scores_codex":[0.9989783,0.0001250185,0.0004328266,0.0001358149,0.000184223,0.0001438325],"domain_scores_gemma":[0.9988878,0.000452221,0.0002319562,0.0003519605,0.00004296748,0.00003306588],"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.00004359746,0.0002354653,0.000168748,0.000398929,0.00003125742,0.000002846917,0.001321359,0.00002885373,0.00002297909,0.9898502,0.0004113106,0.007484427],"study_design_scores_gemma":[0.002508785,0.0005272529,0.0001839113,0.0005161794,0.00005636577,0.00001182831,0.0002664685,0.000212361,0.006716207,0.9670172,0.02171649,0.0002669529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9637302,0.02162059,0.00008511951,0.00008885076,0.0005821958,0.000989951,0.00002486099,0.00005281928,0.01282537],"genre_scores_gemma":[0.9994661,0.0001560585,0.0001997546,0.000008282302,0.00002682827,0.00001519423,7.83924e-7,0.00001581271,0.0001112426],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0357358,"threshold_uncertainty_score":0.3755842,"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":"W2030901166","doi":"","title":"The Acyclic Edge Chromatic Number of a Random d-Regular Graph is d + 1","year":2001,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","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":"Combinatorics; Mathematics; Edge coloring; Discrete mathematics; Chromatic scale; Conjecture; Brooks' theorem; Windmill graph; Graph coloring; Foster graph; Wheel graph; Friendship graph; Graph; List coloring; Critical graph; Random graph; Graph power; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01998900517465182,"gpt":0.2994730386400654,"spread":0.2794840334654136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004747797,0.0001519666,0.0002851123,0.00003770385,0.0002909441,0.00002600025,0.0003630246,0.00007848105,0.001198556],"category_scores_gemma":[0.0002028697,0.00007922365,0.0002373911,0.0002249636,0.0002447758,0.00005650522,0.00009273034,0.0001020013,0.00001897286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008115393,"about_ca_system_score_gemma":0.00001175431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001201901,"about_ca_topic_score_gemma":0.000009898073,"domain_scores_codex":[0.9988694,0.00009766538,0.0003861121,0.0001442077,0.0002581865,0.0002444268],"domain_scores_gemma":[0.9982055,0.0008795947,0.0001412183,0.0006628173,0.00005891597,0.00005191561],"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.0001033484,0.00006922607,0.002094655,0.00007985601,0.000219342,0.000004650579,0.001958405,3.421029e-7,0.0002281592,0.970134,0.02198633,0.003121676],"study_design_scores_gemma":[0.001125032,0.00001548513,0.0005378571,0.00002709865,0.00006218493,0.00005286499,0.0002612141,0.00006306996,0.001752186,0.9886326,0.007350382,0.000120048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9219659,0.00019835,0.001601781,0.0003453305,0.0002457637,0.0003048236,0.000004187509,0.00007077665,0.07526309],"genre_scores_gemma":[0.9914652,0.0001759287,0.002584835,0.0002357971,0.00007427483,0.00001723708,7.36196e-7,0.0000239146,0.005422155],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06984094,"threshold_uncertainty_score":0.9997145,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103626912","doi":"10.37236/278","title":"Large Bounded Degree Trees in Expanding Graphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"University of Waterloo","funders":"University of Illinois at Urbana-Champaign; Hungarian Scientific Research Fund; National Science Foundation","keywords":"Mathematics; Bounded function; Combinatorics; Degree (music); Embedding; Dense graph; Random graph; Discrete mathematics; Graph; Spanning tree; Spectral gap; 1-planar graph; Chordal graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01994977074148044,"gpt":0.2944839138187778,"spread":0.2745341430772973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002697169,0.0001675557,0.0003295135,0.0002299572,0.0002659714,0.00004149857,0.0007215695,0.0001191583,0.00003698967],"category_scores_gemma":[0.0004678644,0.0001029308,0.0001899884,0.0004219332,0.00009280108,0.0001422839,0.00008341784,0.001796051,9.505081e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001073092,"about_ca_system_score_gemma":0.0001765101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002578086,"about_ca_topic_score_gemma":0.0001534778,"domain_scores_codex":[0.9982143,0.0001520696,0.0005079175,0.00009788157,0.0003935763,0.0006342765],"domain_scores_gemma":[0.9984417,0.0006096122,0.0004134085,0.0003492229,0.0001213065,0.00006474091],"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.00005460346,0.0001198834,0.001612208,0.000007139456,0.00005874528,0.0000108023,0.001269707,6.61981e-7,0.0007272427,0.9957668,0.000164638,0.000207546],"study_design_scores_gemma":[0.00125639,0.0001903555,0.001249818,0.00002105971,0.00004701947,0.0002090237,0.0003624842,0.00001477222,0.001137078,0.9940065,0.00138177,0.0001237024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9948581,0.0008170702,0.001056887,0.0002059947,0.001097099,0.0001039508,7.285439e-7,0.00001552205,0.001844617],"genre_scores_gemma":[0.9993958,0.0002386421,0.00005501141,0.00004671391,0.0001039972,0.000002029495,2.090396e-7,0.00002550012,0.000132086],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00453768,"threshold_uncertainty_score":0.7803047,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983805560","doi":"10.1002/rsa.20053","title":"Maxima in hypercubes","year":2005,"lang":"en","type":"article","venue":"Random Structures and Algorithms","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":"McGill University","funders":"","keywords":"Maxima; Hypercube; Mathematics; Upper and lower bounds; Combinatorics; Maxima and minima; Poisson distribution; Simplex; Square (algebra); Generality; Discrete mathematics; Mathematical analysis; Geometry; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02069956144316212,"gpt":0.2864416798429761,"spread":0.265742118399814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003485534,0.0002102155,0.0003747524,0.0001238618,0.0001654339,0.00004554022,0.0001538684,0.0001177646,0.0001434825],"category_scores_gemma":[0.0001535706,0.0001480623,0.00008379815,0.0001137198,0.0001179703,0.0001118328,0.00008842537,0.0002158367,0.000001774709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002355912,"about_ca_system_score_gemma":0.00001286894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001838094,"about_ca_topic_score_gemma":0.00002755789,"domain_scores_codex":[0.9988205,0.0000713581,0.0003046013,0.0002746386,0.0002332271,0.000295636],"domain_scores_gemma":[0.9993454,0.0002927641,0.00005901144,0.0001884741,0.00003320889,0.00008119983],"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.0004017111,0.00006449624,0.001967128,0.0001187563,0.00009638844,0.0000349212,0.003276212,0.00006887277,0.0004706652,0.6733215,0.002085888,0.3180935],"study_design_scores_gemma":[0.004703169,0.00003220112,0.004494178,0.00002311751,0.0000207085,0.0001138478,0.0001562938,0.001283537,0.0006439319,0.9790692,0.009181268,0.0002785895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.988969,0.001559553,0.000521425,0.0003181537,0.0002770677,0.000306409,0.00002065977,0.00008299357,0.007944767],"genre_scores_gemma":[0.9757369,0.0002221549,0.02306568,0.000286508,0.0004452704,0.0000104605,0.000002133252,0.00002455009,0.0002063535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3178149,"threshold_uncertainty_score":0.6037804,"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":"W2091166220","doi":"10.1016/j.jctb.2007.02.006","title":"Large independent sets in regular graphs of large girth","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics; Discrete mathematics; Independence (probability theory); Differential equation; Independent set; Strongly regular graph; Graph; Statistics; Pathwidth; Mathematical analysis; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01185456423673112,"gpt":0.2906598480540324,"spread":0.2788052838173013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008898954,0.0002336753,0.0007021037,0.0004647366,0.0001348262,0.00002036857,0.0005294762,0.0002482076,0.0001820127],"category_scores_gemma":[0.0006707676,0.000183947,0.0003240693,0.0003897064,0.000158929,0.0003515452,0.0001360386,0.0006042636,6.531975e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000638493,"about_ca_system_score_gemma":0.00007010975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.107331e-7,"about_ca_topic_score_gemma":0.0000113317,"domain_scores_codex":[0.9970094,0.0004197019,0.001253455,0.0001466508,0.0007095917,0.0004611903],"domain_scores_gemma":[0.9973812,0.0007560265,0.0009936376,0.0003890209,0.0003437054,0.0001364067],"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.002247262,0.0004178401,0.002596882,0.00008305936,0.0001366466,0.0001428934,0.004189818,0.000001060253,0.0004817481,0.9892388,0.0002838766,0.0001801143],"study_design_scores_gemma":[0.0034414,0.0004755576,0.002236378,0.00012555,0.00005408105,0.0001134333,0.002582171,6.601508e-7,0.009074561,0.9784443,0.003269552,0.0001823843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9907446,0.0003983565,0.000738029,0.00003570052,0.005136027,0.0001659277,0.00001691315,0.00001571026,0.002748771],"genre_scores_gemma":[0.998706,0.00007799448,0.0007529752,0.00004780958,0.0002610644,9.102031e-7,0.000001119669,0.00003314729,0.0001190054],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01079453,"threshold_uncertainty_score":0.750114,"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":"W2591779083","doi":"10.1002/jgt.21733","title":"The Inducibility of Graphs on Four Vertices","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Multipartite; Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.03695414308635255,"gpt":0.2891885994670018,"spread":0.2522344563806492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003725596,0.0001682222,0.0003610183,0.0002096085,0.0002984197,0.00003932028,0.000668961,0.0001019371,0.0001406441],"category_scores_gemma":[0.001748539,0.00008461224,0.000460554,0.0002429023,0.000490988,0.000185457,0.00007202878,0.0004559679,0.000003204189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001587024,"about_ca_system_score_gemma":0.00003427065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003730553,"about_ca_topic_score_gemma":0.000002351593,"domain_scores_codex":[0.9977788,0.0005871104,0.0007933463,0.000127513,0.0004795272,0.0002337016],"domain_scores_gemma":[0.9944842,0.003555194,0.0008642792,0.0006141685,0.0003819645,0.0001001501],"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.0002784306,0.0001015226,0.001305061,0.00003805631,0.0002394756,0.000003834657,0.0008485988,0.000002733334,0.0008179429,0.9852557,0.001691703,0.009416942],"study_design_scores_gemma":[0.000363927,0.0003314913,0.0117036,0.00007362196,0.00007393814,0.00003470844,0.000738429,0.000002976358,0.002876566,0.9834331,0.0002729298,0.00009468408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9932665,0.0005201106,0.0001544265,0.0002547532,0.0007486463,0.0001743085,0.000002508303,0.00001124887,0.004867521],"genre_scores_gemma":[0.9988002,0.0001482302,0.0006881992,0.0001393715,0.00009142698,0.000003587655,7.415048e-8,0.00001831969,0.0001105543],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01039854,"threshold_uncertainty_score":0.3450387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067467106","doi":"10.1007/pl00001685","title":"An improved bound for the Minkowski dimension of Besicovitch sets in medium dimension","year":2001,"lang":"en","type":"article","venue":"Geometric and Functional Analysis","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Dimension (graph theory); Minkowski space; Combinatorics; Minkowski–Bouligand dimension; Constant (computer programming); Packing dimension; Arithmetic progression; Hausdorff dimension; Discrete mathematics; Mathematical analysis; Geometry; Fractal dimension; Fractal","retraction":null,"screen_n_in":null,"score":{"opus":0.02531179768187286,"gpt":0.2783063204869674,"spread":0.2529945228050945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008083951,0.0001338618,0.0003121777,0.001147222,0.0002190904,0.00002487218,0.00008956886,0.00009393325,0.0001150323],"category_scores_gemma":[0.000250614,0.00007897513,0.0002081055,0.003152804,0.00009340319,0.00008229926,0.000056192,0.0001046047,6.970426e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002170508,"about_ca_system_score_gemma":0.00001873199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009409995,"about_ca_topic_score_gemma":0.0001119325,"domain_scores_codex":[0.9989206,0.00004202531,0.0003279948,0.0002684574,0.0002629986,0.0001779501],"domain_scores_gemma":[0.9980763,0.001355323,0.0001159739,0.0002654092,0.0001307607,0.00005619621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004666079,0.00284685,0.4643671,0.001049711,0.02130365,0.00004226285,0.005298242,0.007486719,0.01623298,0.2989646,0.01421781,0.163524],"study_design_scores_gemma":[0.001611601,0.0005092841,0.3401233,0.00002783019,0.006452182,0.00002499694,0.0009463039,0.1038924,0.0005350403,0.5432848,0.002122581,0.0004697334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9742818,0.001757716,0.02314042,0.0002380638,0.0002457223,0.0002054024,0.00002597832,0.00001761911,0.00008724601],"genre_scores_gemma":[0.998288,0.0001709774,0.001033998,0.00008229895,0.00008244936,0.00001900231,0.00003702203,0.00001072928,0.0002755457],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2443202,"threshold_uncertainty_score":0.3220512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152427009","doi":"10.1006/jctb.2002.2110","title":"Asymptotically the List Colouring Constants Are 1","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Conjecture; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02972296561971398,"gpt":0.2613357763040033,"spread":0.2316128106842893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001929885,0.0002019802,0.0004542493,0.00008023482,0.0005102446,0.0001041166,0.0006466375,0.000132348,0.000865303],"category_scores_gemma":[0.002100109,0.0001191049,0.0002482326,0.0001735995,0.0005350004,0.0002732165,0.0001418373,0.0005749977,0.000004321275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005032394,"about_ca_system_score_gemma":0.00002812236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.458898e-7,"about_ca_topic_score_gemma":6.1706e-7,"domain_scores_codex":[0.9979084,0.0005228225,0.0006744304,0.000112401,0.0005054555,0.0002765352],"domain_scores_gemma":[0.9964993,0.001897316,0.0007577558,0.0003669754,0.0003577944,0.000120887],"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.0004100165,0.0001020546,0.0002603968,0.00002392024,0.0001616199,0.0000727628,0.001260994,0.000001754377,0.0000722701,0.9926915,0.004550979,0.0003917531],"study_design_scores_gemma":[0.0009537853,0.0003015246,0.0001380787,0.0000948638,0.00009745801,0.0003832648,0.001000889,0.000005184866,0.00073209,0.9839677,0.01217502,0.0001501856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9438649,0.0009892341,0.0003250826,0.001635222,0.01509396,0.000281716,0.0000118544,0.00006269937,0.03773528],"genre_scores_gemma":[0.9974197,0.0001064493,0.0004477728,0.0001814636,0.001049093,0.000001738242,8.729263e-8,0.00002841309,0.0007652761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05355476,"threshold_uncertainty_score":0.9474461,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4235275672","doi":"10.1002/jgt.20064","title":"The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":39,"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; Chromatic scale; Conjecture; Foster graph; Discrete mathematics; Critical graph; Edge coloring; Friendship graph; Random graph; Graph; Windmill graph; Brooks' theorem; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Graph power; Line graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01308008132324962,"gpt":0.2844518910577733,"spread":0.2713718097345237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004691302,0.0003430479,0.0008314446,0.0002415551,0.0005189238,0.00005848302,0.001072048,0.0001714378,0.0003203951],"category_scores_gemma":[0.00077072,0.0001960281,0.001159942,0.0004915632,0.0008020496,0.0002883288,0.0001326704,0.000568344,0.000009295339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003416066,"about_ca_system_score_gemma":0.00007109458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000012455,"about_ca_topic_score_gemma":0.00000269367,"domain_scores_codex":[0.9963241,0.0007227093,0.001531939,0.0001873946,0.0007842373,0.0004496128],"domain_scores_gemma":[0.9939641,0.003141138,0.001588146,0.0007834266,0.0003471879,0.0001759359],"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.001239142,0.0002834375,0.0007373982,0.0001729795,0.001170347,0.00001836843,0.005469256,0.000009479048,0.001575524,0.9580431,0.020001,0.01127998],"study_design_scores_gemma":[0.002588643,0.0001023395,0.0002918519,0.0001914894,0.0003832972,0.0004646032,0.000524467,0.00001150646,0.00625571,0.9797257,0.009234703,0.0002257502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.982495,0.004774224,0.002859941,0.0008127498,0.0009871656,0.0003537492,0.00001638031,0.00003953119,0.007661249],"genre_scores_gemma":[0.9925694,0.001071842,0.004624737,0.0005912663,0.0005083141,0.000007452737,4.396259e-7,0.0000618457,0.000564635],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02168255,"threshold_uncertainty_score":0.7993793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094948820","doi":"10.1002/rsa.20394","title":"The scaling window for a random graph with a given degree sequence","year":2012,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":39,"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":"Random graph; Combinatorics; Giant component; Scaling; Mathematics; Degree (music); Graph; Sequence (biology); Random sequence; Component (thermodynamics); Window (computing); Discrete mathematics; Physics; Geometry; Computer science; Mathematical analysis; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.04942200943055145,"gpt":0.3026302775420053,"spread":0.2532082681114538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009763174,0.0003383885,0.0005000936,0.0000665819,0.001422144,0.0001406611,0.0002881054,0.0001273481,0.00001395461],"category_scores_gemma":[0.0003155954,0.0001657147,0.0001990291,0.0001459347,0.0004331006,0.0001736622,0.00008459116,0.0002395826,2.679236e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001590171,"about_ca_system_score_gemma":0.00002336635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001596553,"about_ca_topic_score_gemma":0.00001152276,"domain_scores_codex":[0.9982502,0.0001424627,0.0003478095,0.0002931215,0.0003099882,0.0006563528],"domain_scores_gemma":[0.9968,0.002323768,0.0002009461,0.0003862171,0.0001014153,0.0001876742],"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.01010395,0.00006902581,0.002789978,0.0004409537,0.001254331,0.00001415834,0.008705371,0.00005102134,0.0007333069,0.6976423,0.00139167,0.2768039],"study_design_scores_gemma":[0.02071336,0.0001562677,0.001954434,0.00008166797,0.000328146,0.0002853901,0.0007736724,0.000693521,0.001151408,0.9667298,0.006590704,0.0005416773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8425766,0.01111755,0.1379132,0.0006631045,0.001863144,0.003991673,0.0002166745,0.0002667817,0.001391304],"genre_scores_gemma":[0.9644755,0.000248766,0.03413736,0.0001259562,0.0006957818,0.0001308671,0.000007031369,0.00005239216,0.000126347],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2762623,"threshold_uncertainty_score":0.9998779,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024469085","doi":"10.1016/j.disc.2009.04.020","title":"Some bounds on the injective chromatic number of graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Injective function; Chromatic scale; Mathematics; Combinatorics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02374741937947625,"gpt":0.3068294960428739,"spread":0.2830820766633976,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000615571,0.0003033117,0.0004966639,0.00008880463,0.0002901056,0.00004494345,0.0005325808,0.0001210347,0.0001911224],"category_scores_gemma":[0.0006742217,0.0001719915,0.0002923818,0.0002847222,0.0002715613,0.0001104969,0.00008109825,0.0002704551,0.00002584477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003016002,"about_ca_system_score_gemma":0.00002213766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001787492,"about_ca_topic_score_gemma":6.780421e-7,"domain_scores_codex":[0.9982327,0.000112596,0.0005929638,0.0002168417,0.0005239787,0.0003209291],"domain_scores_gemma":[0.9972793,0.001237236,0.000391464,0.0009456856,0.00008068608,0.00006555898],"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.00001433539,0.0001522302,0.00004131561,0.0001424953,0.00009198934,0.00000270244,0.006712969,0.00000164244,0.0001686018,0.9912805,0.00121469,0.0001765592],"study_design_scores_gemma":[0.0002315998,0.0001417605,0.0003629717,0.0002077309,0.00009043393,0.00002227484,0.001160814,0.0002937098,0.002238457,0.9949841,0.000049073,0.0002170925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9538206,0.00005898709,0.0005774189,0.0004370905,0.000181878,0.0005270546,0.00002575942,0.0001040219,0.04426719],"genre_scores_gemma":[0.9907367,0.00002029541,0.008329096,0.0004102839,0.00009134861,0.00001753601,0.000002661223,0.00003753254,0.0003545592],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04391263,"threshold_uncertainty_score":0.7013611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114702003","doi":"10.1016/j.disc.2013.01.011","title":"Oriented trees in digraphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Digraph; Combinatorics; Conjecture; Mathematics; Order (exchange); Tree (set theory); Integer (computer science); Chromatic scale; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.018996780892726,"gpt":0.2782483479951179,"spread":0.2592515671023919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002753123,0.000250844,0.0003864426,0.0001931072,0.0001197595,0.00005383596,0.0003204561,0.0001176745,0.0006263483],"category_scores_gemma":[0.0004234367,0.0001805603,0.0001470233,0.0003488332,0.0001317664,0.0001835201,0.0001451453,0.0002065613,0.00006293467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002539797,"about_ca_system_score_gemma":0.00001111331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002537468,"about_ca_topic_score_gemma":0.00003856818,"domain_scores_codex":[0.9984781,0.00005633978,0.000539345,0.0002372137,0.0002996722,0.0003892888],"domain_scores_gemma":[0.9986246,0.0004501202,0.0001548231,0.0006121927,0.00006157151,0.00009669129],"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.000004147491,0.0001144796,0.001801752,0.0001147539,0.00003453156,0.000006083423,0.005682107,0.000002711876,0.0002807859,0.9898431,0.001520534,0.0005949948],"study_design_scores_gemma":[0.0003916488,0.00003202844,0.002343686,0.0001007066,0.00002258682,0.000009904398,0.001810952,0.001349101,0.0004235225,0.992862,0.0003930224,0.0002607966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9592873,0.00006592972,0.003427919,0.0001433965,0.0001819338,0.0006040042,0.000009783992,0.0001529613,0.03612673],"genre_scores_gemma":[0.9656454,0.000015155,0.03311587,0.00008099414,0.0000473797,0.00008787178,0.000005499654,0.0000487446,0.0009530463],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03517368,"threshold_uncertainty_score":0.7363036,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046546000","doi":"10.1016/j.disc.2012.01.028","title":"Two results on the digraph chromatic number","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Digraph; Girth (graph theory); Chromatic scale; Integer (computer science); Discrete mathematics; Graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04322033519359515,"gpt":0.3227692923635336,"spread":0.2795489571699385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001455791,0.0003630611,0.0003972971,0.00006370316,0.0004986005,0.00007608496,0.0005631874,0.0001048599,0.0004080353],"category_scores_gemma":[0.001412222,0.0001951541,0.0002704705,0.0002707393,0.0002293636,0.000149457,0.0001928493,0.0003363626,0.0002869268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004769855,"about_ca_system_score_gemma":0.00001167155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000446222,"about_ca_topic_score_gemma":0.00000267609,"domain_scores_codex":[0.9977487,0.0001686494,0.0006552181,0.0002219207,0.0005837962,0.0006217413],"domain_scores_gemma":[0.9955409,0.00259593,0.0003398784,0.001314255,0.00005063713,0.0001584237],"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.00001875981,0.0001425584,0.0001800854,0.0001209426,0.00009330907,0.000001882156,0.007745728,8.05358e-7,0.00004370851,0.9837901,0.007759365,0.0001027685],"study_design_scores_gemma":[0.0005266566,0.00003506179,0.0002520521,0.0001854886,0.0001205363,0.00004436766,0.002499008,0.0002582461,0.001149065,0.9926099,0.001962574,0.0003570527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6701391,0.00005747808,0.001058707,0.0005962798,0.0005451947,0.0006303856,0.00006086661,0.000222291,0.3266897],"genre_scores_gemma":[0.9824758,0.00001125243,0.01536407,0.0003874895,0.0003600363,0.00005214619,0.00000772124,0.00007545112,0.001265998],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3254237,"threshold_uncertainty_score":0.7958153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W168516241","doi":"","title":"Anti-Ramsey numbers for small complete bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Bipartite graph; Combinatorics; Robertson–Seymour theorem; Discrete mathematics; Graph; 1-planar graph; Chordal graph","retraction":null,"screen_n_in":null,"score":{"opus":0.04241386506238429,"gpt":0.284002078138853,"spread":0.2415882130764687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000355857,0.0002520578,0.0003921256,0.0001040113,0.0003911707,0.00005166158,0.0003984459,0.0001457749,0.00002994429],"category_scores_gemma":[0.0002248084,0.0002248491,0.0002495958,0.0002455577,0.0001637527,0.00008915414,0.0001080044,0.0001867161,0.00001539942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004869999,"about_ca_system_score_gemma":0.00003576851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003025871,"about_ca_topic_score_gemma":0.00001705651,"domain_scores_codex":[0.9985971,0.00004741681,0.0003599321,0.0003310138,0.0002041015,0.000460376],"domain_scores_gemma":[0.9986963,0.0003394037,0.0001547333,0.0005560799,0.0001187837,0.0001346671],"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.00002605021,0.0001063193,0.001232685,0.00008082595,0.00009030645,0.000006331392,0.0006573724,0.000009462975,0.000300787,0.9958582,0.001467884,0.0001637742],"study_design_scores_gemma":[0.002124573,0.000115465,0.00103829,0.00004713353,0.00006331265,0.00001123469,0.00006872271,0.000014873,0.001365931,0.9904342,0.004415981,0.0003003068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9927811,0.00009200851,0.0003901582,0.0002088091,0.002761116,0.0005439046,0.00003661603,0.0001987865,0.002987526],"genre_scores_gemma":[0.9910051,0.00001708207,0.008451103,0.0002690395,0.00002152955,0.00004849979,0.00001412977,0.00005793442,0.0001156255],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008060945,"threshold_uncertainty_score":0.9169081,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093635261","doi":"10.1016/j.jctb.2014.06.005","title":"The inducibility of blow-up graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01646336035669225,"gpt":0.2747567065996173,"spread":0.258293346242925,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007015116,0.0001715773,0.0004854198,0.00008489394,0.0003672006,0.00003915505,0.0007013055,0.000131459,0.00008821542],"category_scores_gemma":[0.004139795,0.00009732579,0.0003418435,0.0001855218,0.0006286783,0.0002142001,0.0001317868,0.0004250525,5.13417e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002238342,"about_ca_system_score_gemma":0.0000622679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.495894e-7,"about_ca_topic_score_gemma":9.025756e-7,"domain_scores_codex":[0.99738,0.0009196979,0.0008840107,0.0001160999,0.0004844494,0.0002157338],"domain_scores_gemma":[0.9947345,0.003054505,0.00098619,0.0006227424,0.0005108845,0.00009122339],"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.001201366,0.00006420742,0.000226881,0.00003662858,0.0001369585,0.000001433026,0.00102478,6.121061e-7,0.000303974,0.9931528,0.0007087898,0.003141557],"study_design_scores_gemma":[0.0009443925,0.0005496603,0.0003197274,0.00004110096,0.00007783648,0.00004174327,0.0005030872,0.000001313424,0.007922568,0.9811414,0.008351223,0.0001059708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9818374,0.0002106766,0.0001954328,0.000147675,0.01293832,0.0001153191,0.000002866823,0.00001517636,0.004537131],"genre_scores_gemma":[0.9988108,0.00006183171,0.0003801072,0.00002828128,0.0005093608,0.000001332229,1.594637e-7,0.00001965994,0.0001884964],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01697337,"threshold_uncertainty_score":0.495602,"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":"W1576464478","doi":"10.37236/1937","title":"Erdős-Ko-Rado theorems for uniform set-partition systems","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"University of Ottawa","funders":"","keywords":"Partition (number theory); Mathematics; Combinatorics; Cardinality (data modeling); Generalization; Discrete mathematics; Class (philosophy); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02366036630594945,"gpt":0.2953013095934258,"spread":0.2716409432874763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002715718,0.0001946643,0.0003662891,0.0001092571,0.0003757604,0.0000583466,0.000611888,0.0001133409,0.00001471865],"category_scores_gemma":[0.0002613248,0.0001165241,0.0002504852,0.0002120375,0.00009062696,0.0001956737,0.00004715464,0.0006060976,0.000002668829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003778686,"about_ca_system_score_gemma":0.0001926785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001421491,"about_ca_topic_score_gemma":0.000002784021,"domain_scores_codex":[0.9980763,0.0001610756,0.0006367257,0.0001057389,0.0004276989,0.0005924154],"domain_scores_gemma":[0.9979117,0.0006405982,0.0006731573,0.0003531492,0.0003437653,0.0000776154],"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.0001152478,0.0000719017,0.00001785414,0.00004347182,0.0001541904,0.000001076672,0.0007681506,0.0001226587,0.0000562177,0.9952343,0.002780231,0.0006346668],"study_design_scores_gemma":[0.00103446,0.0004811487,0.00001089085,0.00004214522,0.0001546805,0.0002567462,0.0003581546,0.0008971107,0.0006037352,0.9631128,0.03290366,0.0001444949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8998276,0.009891405,0.07810289,0.002300357,0.003356624,0.001105213,0.00001446382,0.00009314545,0.005308331],"genre_scores_gemma":[0.9981463,0.0004287077,0.00009193597,0.00007698836,0.0006115247,0.000009677979,0.000001385347,0.0000386393,0.0005948383],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09831873,"threshold_uncertainty_score":0.4751714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2219887110","doi":"10.1016/j.ejc.2016.02.005","title":"An Erdős–Ko–Rado theorem for finite 2-transitive groups","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Mathematics; Combinatorics; Transitive relation; Cardinality (data modeling); Finite set; Discrete mathematics; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.0265312122647821,"gpt":0.2779128343328651,"spread":0.251381622068083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002459749,0.00021439,0.0003541513,0.0001523011,0.0002168102,0.00004464397,0.0005670342,0.00004529606,0.00004355436],"category_scores_gemma":[0.0007999344,0.0001261593,0.000276923,0.0001358376,0.0001379711,0.0002885749,0.00004946563,0.0002266288,0.000005606129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004596905,"about_ca_system_score_gemma":0.0000337161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.984332e-8,"about_ca_topic_score_gemma":1.067835e-7,"domain_scores_codex":[0.9978985,0.0006895449,0.0006300639,0.0001635736,0.0003321812,0.0002861338],"domain_scores_gemma":[0.9970021,0.00140134,0.0005433958,0.0003762089,0.0004758583,0.0002011568],"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.0002352163,0.0001484672,0.0001804758,0.00003228313,0.00009584158,0.0001061552,0.001654762,0.000002147782,0.0008413489,0.9886978,0.001374637,0.006630843],"study_design_scores_gemma":[0.002427059,0.00124806,0.0009670301,0.0001418236,0.00009517585,0.00009824269,0.0002091612,0.00001772967,0.001146432,0.986043,0.007379191,0.0002271062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5734902,0.000258379,0.4090162,0.0005216453,0.002920744,0.0003004401,0.00004886696,0.00007644917,0.01336713],"genre_scores_gemma":[0.9959295,0.00007114068,0.003122332,0.0001349125,0.0004223916,8.498538e-7,7.570137e-7,0.00008000491,0.000238059],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4224394,"threshold_uncertainty_score":0.5144628,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}