{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Hamed Hatami","is_ca":true},{"name":"Jan Hladký","is_ca":false},{"name":"Daniel Král͏̌","is_ca":false},{"name":"Serguei Norine","is_ca":true},{"name":"Alexander Razborov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002368761,0.0007013849,0.001561899,0.004023594,0.002903282,0.005714124,0.004194154,0.002414802,0.01261432],"category_scores_gemma":[0.01732864,0.001147418,0.0008980985,0.002825791,0.005938004,0.009762311,0.00291538,0.003138651,0.0008151376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001797423,"about_ca_system_score_gemma":0.0007655643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001289447,"about_ca_topic_score_gemma":0.001697016,"domain_scores_codex":[0.9982665,0.0004997781,0.000112605,0.0003381594,0.000505409,0.0002776447],"domain_scores_gemma":[0.976942,0.01604624,0.002218667,0.001063894,0.001111611,0.002617592],"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.000381979,0.00009935806,0.002738505,0.0001869207,0.00003353036,0.0001808328,0.0005772258,0.008688902,0.002141389,0.9689646,0.00334809,0.01265867],"study_design_scores_gemma":[0.00003472792,0.00003256552,0.000795874,0.00005959414,0.00002170494,0.0002765617,0.0002946335,0.01860777,0.0007467495,0.9775039,0.001600872,0.00002521369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.826439,0.002141166,0.06201335,0.004693399,0.0006334684,0.00006670086,0.000649228,0.0003280937,0.1030357],"genre_scores_gemma":[0.9732522,0.0009641152,0.01375234,0.000396316,0.0003796753,0.00009929352,0.0004492791,0.0001436525,0.01056316],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01261432,"threshold_uncertainty_score":0.04219908,"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","authors":[{"name":"József Solymosi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002734646,0.001966198,0.002321735,0.003885942,0.001829623,0.004010659,0.00378993,0.002789678,0.008072599],"category_scores_gemma":[0.01468862,0.001234813,0.001687427,0.001831148,0.006267455,0.01438703,0.007618174,0.007136519,0.001319672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00137342,"about_ca_system_score_gemma":0.0007214947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006837024,"about_ca_topic_score_gemma":0.0008022785,"domain_scores_codex":[0.9977819,0.0007392167,0.00009189874,0.0004296027,0.0007187208,0.0002386625],"domain_scores_gemma":[0.9924906,0.005195011,0.0004195479,0.0007759609,0.0004196487,0.0006991815],"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.00003217279,0.00001963849,0.0001690921,0.0000499268,0.00001435944,0.00003234806,0.00007041216,0.004246177,0.0005420224,0.9892393,0.001104257,0.004480263],"study_design_scores_gemma":[0.000003686092,0.000007395227,0.00006622678,0.00001349735,0.000007620887,0.0000337041,0.00001366474,0.02725643,0.0002785337,0.971201,0.00110847,0.000009684089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1224959,0.004479212,0.7674596,0.00612622,0.001358011,0.00004996364,0.0003431972,0.0007829877,0.09690478],"genre_scores_gemma":[0.8606874,0.002889436,0.09038137,0.00185254,0.002439867,0.0002188238,0.0003600889,0.001145387,0.04002509],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008072599,"threshold_uncertainty_score":0.02700549,"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","authors":[{"name":"Benoît Larose","is_ca":true},{"name":"Claudia Malvenuto","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001748914,0.0005203632,0.001679624,0.004415252,0.004828636,0.007291062,0.002499172,0.002214347,0.006254718],"category_scores_gemma":[0.01060338,0.001723737,0.001276551,0.00351749,0.005275998,0.01041565,0.003510095,0.002440464,0.0005776429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001974129,"about_ca_system_score_gemma":0.0008739966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009871023,"about_ca_topic_score_gemma":0.001783648,"domain_scores_codex":[0.998295,0.0003557124,0.0001312339,0.000358825,0.0005680678,0.0002911618],"domain_scores_gemma":[0.9863067,0.009587063,0.001283518,0.00087341,0.0006922819,0.001257078],"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.0001998518,0.00004745276,0.00122716,0.00008047168,0.00002247351,0.0001588563,0.0009767463,0.002337587,0.002187239,0.9882465,0.0007362673,0.003779308],"study_design_scores_gemma":[0.00003901227,0.00001735162,0.0004895892,0.00001725301,0.00002788134,0.0001968516,0.0003456025,0.005120364,0.001322369,0.9915141,0.000888753,0.00002087452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8766068,0.0006924435,0.07381462,0.001330547,0.00008397745,0.00006466805,0.0006343386,0.0005364941,0.04623611],"genre_scores_gemma":[0.9778022,0.0002962926,0.01408721,0.0001339474,0.0001054478,0.0001359508,0.0003365029,0.0001036118,0.006998781],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007291062,"threshold_uncertainty_score":0.02092415,"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","authors":[{"name":"Carlos Hoppen","is_ca":false},{"name":"Yoshiharu Kohayakawa","is_ca":false},{"name":"Carlos Gustavo Moreira","is_ca":false},{"name":"Balázs Ráth","is_ca":true},{"name":"Rudini Sampaio","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001170787,0.0006480921,0.0009522108,0.003668153,0.002693105,0.004264754,0.001316659,0.001325181,0.01041305],"category_scores_gemma":[0.007774413,0.0007013722,0.0009546921,0.002326802,0.004080346,0.008200489,0.003055884,0.003139578,0.001193049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001512971,"about_ca_system_score_gemma":0.0008216869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000976228,"about_ca_topic_score_gemma":0.0008693898,"domain_scores_codex":[0.9987429,0.0003246473,0.00008372452,0.0002493671,0.0004387801,0.0001606419],"domain_scores_gemma":[0.9962882,0.001807518,0.0003762446,0.0003734482,0.0005725968,0.0005820731],"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.00001143358,0.00001414283,0.0001321105,0.00001184729,0.000003286577,0.00003900527,0.0001442036,0.0002567953,0.0002273527,0.995482,0.0005063333,0.003171466],"study_design_scores_gemma":[0.000003729353,0.000004936898,0.00007815912,0.000006656412,0.000002953497,0.00007734319,0.00003981005,0.001156793,0.0001434016,0.9968517,0.001629495,0.000004981159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4790657,0.003673334,0.1794036,0.004793809,0.001098859,0.00006856907,0.000417399,0.0005080951,0.3309706],"genre_scores_gemma":[0.9164649,0.001900784,0.02209108,0.0007016262,0.001193256,0.0001309839,0.0004033184,0.0002401702,0.05687383],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01041305,"threshold_uncertainty_score":0.0348351,"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","authors":[{"name":"Brendan D. McKay","is_ca":false},{"name":"Nicholas Wormald","is_ca":true},{"name":"Beata Wysocka","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624446,0.000528106,0.000911802,0.002836004,0.001150422,0.002187401,0.001327506,0.001515461,0.002940649],"category_scores_gemma":[0.01588491,0.0008465596,0.0005882661,0.001500756,0.002771802,0.003682537,0.00145767,0.001136938,0.0004585858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001927478,"about_ca_system_score_gemma":0.0005323082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002014961,"about_ca_topic_score_gemma":0.001908483,"domain_scores_codex":[0.9990188,0.0003562836,0.00003519858,0.0002295346,0.0001882038,0.0001720058],"domain_scores_gemma":[0.9914228,0.00489878,0.001522089,0.0007058156,0.0005834543,0.0008669352],"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.0002301684,0.00005975944,0.005056015,0.0001796988,0.00006891025,0.0004216898,0.0006191691,0.05423522,0.003602169,0.9174119,0.003656074,0.0144593],"study_design_scores_gemma":[0.00005367226,0.00004951806,0.001616507,0.00005853871,0.0000335295,0.0003432898,0.0001616635,0.188336,0.001227917,0.8049098,0.003168047,0.00004153015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8422731,0.003691018,0.1343127,0.002161737,0.0001325273,0.000121619,0.0003832771,0.0006195476,0.01630445],"genre_scores_gemma":[0.9889436,0.001133032,0.006051707,0.0002352683,0.0001124285,0.0001412306,0.0002011919,0.00009425716,0.003087213],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002940649,"threshold_uncertainty_score":0.01398492,"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","authors":[{"name":"Douglas R. Stinson","is_ca":true},{"name":"Ruizhong Wei","is_ca":true},{"name":"Linlin Zhu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009619595,0.003273104,0.004046259,0.01369343,0.005410263,0.009967399,0.006953601,0.00451221,0.02351089],"category_scores_gemma":[0.04068348,0.002454647,0.003919853,0.01135753,0.007494284,0.03566505,0.01078083,0.0158968,0.002621583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006625045,"about_ca_system_score_gemma":0.001145132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001836769,"about_ca_topic_score_gemma":0.002389794,"domain_scores_codex":[0.994601,0.001296164,0.0003093819,0.001032283,0.001870501,0.0008907067],"domain_scores_gemma":[0.9557791,0.03536806,0.001434091,0.002154172,0.002186036,0.003078566],"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.0001226379,0.0001316716,0.0007945025,0.0002533524,0.00005088044,0.000146319,0.0008471211,0.003363383,0.0007502225,0.9673755,0.008318814,0.0178456],"study_design_scores_gemma":[0.00001807995,0.0000286268,0.0005381005,0.0001017478,0.00007451046,0.0001532886,0.0001548078,0.0133625,0.0003911336,0.978115,0.007019133,0.00004291776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.15816,0.02144791,0.4793305,0.0196805,0.002225186,0.0002735014,0.00223124,0.00150154,0.3151497],"genre_scores_gemma":[0.7699705,0.01791639,0.1358184,0.005734641,0.008688059,0.001246057,0.002677523,0.001718477,0.05622983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02351089,"threshold_uncertainty_score":0.07865179,"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","authors":[{"name":"Penny Haxell","is_ca":true},{"name":"V. Rödl","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00109842,0.000630732,0.001172531,0.0034309,0.003034553,0.005260074,0.001362391,0.001709506,0.005910738],"category_scores_gemma":[0.008467753,0.001064704,0.0006654641,0.003529652,0.005164072,0.008898443,0.002494329,0.002757056,0.0004243746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001834194,"about_ca_system_score_gemma":0.0005178489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002004687,"about_ca_topic_score_gemma":0.002361048,"domain_scores_codex":[0.9991797,0.0002325986,0.00005056747,0.0001490808,0.0002170217,0.0001709581],"domain_scores_gemma":[0.9955428,0.002796496,0.0006590048,0.0003539402,0.0002222605,0.0004254335],"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.00003165579,0.00002277418,0.0002159018,0.00002973587,0.000003243494,0.00005066073,0.0002960262,0.001629708,0.0002717191,0.9931243,0.0007589281,0.003565432],"study_design_scores_gemma":[0.000008364729,0.000004874006,0.0001359752,0.00001349064,0.000004276802,0.0000745447,0.0001233698,0.00456557,0.0001694315,0.9937841,0.001110928,0.000005184766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.750827,0.003379058,0.1306539,0.003293737,0.0003060176,0.00004273907,0.0003794359,0.0003388649,0.1107792],"genre_scores_gemma":[0.9633228,0.001361785,0.02134778,0.0003600207,0.0003584739,0.00006751223,0.0002994962,0.00008327502,0.0127988],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005910738,"threshold_uncertainty_score":0.01977336,"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","authors":[{"name":"Edward A. Bender","is_ca":true},{"name":"Zhicheng Gao","is_ca":true},{"name":"Nicholas Wormald","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004217055,0.0003461817,0.000407746,0.001650705,0.0007642188,0.001321682,0.001149993,0.001066181,0.004741665],"category_scores_gemma":[0.00663385,0.000382997,0.0003528158,0.0009132191,0.001373804,0.002572044,0.001049545,0.0006150643,0.000431256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000869582,"about_ca_system_score_gemma":0.000356898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004837271,"about_ca_topic_score_gemma":0.0005349258,"domain_scores_codex":[0.9995635,0.0001010875,0.00001639057,0.0001259256,0.0001211536,0.0000718007],"domain_scores_gemma":[0.9967927,0.001654468,0.000510541,0.000366194,0.0003715725,0.0003043972],"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.0004020278,0.00006951491,0.0110975,0.0003646823,0.00007198599,0.0006188279,0.0004451564,0.08074177,0.04755993,0.802363,0.006509287,0.04975629],"study_design_scores_gemma":[0.00005660473,0.00008728362,0.009230292,0.00007184131,0.00007700248,0.001812421,0.0003326783,0.2912778,0.02468701,0.6632449,0.009044204,0.00007798993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8953654,0.0004249846,0.07385068,0.0008826755,0.00007283912,0.00003606806,0.0006842645,0.0006025337,0.02808068],"genre_scores_gemma":[0.9735649,0.0005535534,0.01868958,0.0001296629,0.00008970464,0.000108295,0.0008581222,0.0001115212,0.005894723],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004741665,"threshold_uncertainty_score":0.01586246,"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","authors":[{"name":"Christian Borgs","is_ca":false},{"name":"Jennifer Chayes","is_ca":false},{"name":"Remco van der Hofstad","is_ca":false},{"name":"Gordon Slade","is_ca":true},{"name":"Joel Spencer","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007825565,0.0004289459,0.0006269666,0.000833216,0.0006050625,0.001119703,0.001094609,0.0009237503,0.002828479],"category_scores_gemma":[0.006157361,0.0003657397,0.0007357667,0.0005409917,0.001473465,0.002621677,0.000868421,0.001192419,0.0002036738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001104167,"about_ca_system_score_gemma":0.0003470413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002462185,"about_ca_topic_score_gemma":0.0014262,"domain_scores_codex":[0.9996511,0.0001002267,0.00001083499,0.00008838562,0.00006078972,0.00008873248],"domain_scores_gemma":[0.9971072,0.00163609,0.0005282161,0.0002542523,0.000115787,0.0003584239],"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.0004209685,0.0001852851,0.007422313,0.0002693628,0.00007609074,0.0008036949,0.0007005153,0.1052927,0.02490986,0.8421692,0.003939581,0.01381052],"study_design_scores_gemma":[0.0001056555,0.0001548464,0.00383862,0.00004644669,0.00004892685,0.000421347,0.0001806917,0.6638156,0.00506149,0.3247009,0.001588024,0.00003751366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8889275,0.00151331,0.0961487,0.001272394,0.00007170448,0.00008294015,0.0002092915,0.0005015157,0.01127262],"genre_scores_gemma":[0.9935718,0.0002973763,0.00482387,0.00009332316,0.00007229166,0.00005207827,0.0001082895,0.00006387546,0.0009171538],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002828479,"threshold_uncertainty_score":0.009462178,"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","authors":[{"name":"Mustazee Rahman","is_ca":true},{"name":"Bálint Virág","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003991961,0.001152207,0.002630126,0.001699981,0.001571894,0.003413984,0.004077737,0.002339198,0.01349183],"category_scores_gemma":[0.03511929,0.0009210882,0.001651338,0.002220309,0.002894571,0.01027629,0.004618049,0.003389928,0.003391506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002942835,"about_ca_system_score_gemma":0.001896161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007937438,"about_ca_topic_score_gemma":0.001320122,"domain_scores_codex":[0.9963657,0.0009910297,0.0001942896,0.001189207,0.0008211014,0.0004386162],"domain_scores_gemma":[0.9749415,0.01623919,0.001562258,0.005154641,0.001128329,0.0009741643],"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.0008877598,0.0005383707,0.003467032,0.001227273,0.0002987486,0.0001175396,0.000625335,0.1568268,0.006798384,0.6758713,0.01518095,0.1381604],"study_design_scores_gemma":[0.0001542227,0.0002053343,0.0009110874,0.0001277813,0.00011011,0.0002212021,0.0001542886,0.3977693,0.005359905,0.5895891,0.005350666,0.000046977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2293375,0.003319386,0.7135841,0.002737573,0.0001564059,0.0003390836,0.0008910953,0.003112335,0.04652247],"genre_scores_gemma":[0.8342757,0.001655431,0.1474501,0.0009742639,0.0003005307,0.0009172889,0.001216995,0.000873382,0.0123362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01349183,"threshold_uncertainty_score":0.04513472,"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","authors":[{"name":"Chris Godsil","is_ca":true},{"name":"Karen Meagher","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002643144,0.001764533,0.002041228,0.005022913,0.002450729,0.003409215,0.002307002,0.002178104,0.01424417],"category_scores_gemma":[0.008704247,0.000990381,0.002737364,0.003373653,0.004417854,0.01133045,0.007050157,0.007619198,0.002599529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001905462,"about_ca_system_score_gemma":0.0009498292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008951805,"about_ca_topic_score_gemma":0.0009259785,"domain_scores_codex":[0.9983954,0.0003611907,0.0001409934,0.0003936626,0.0005378585,0.000170924],"domain_scores_gemma":[0.9945281,0.002871088,0.0004103482,0.0008233137,0.0009351675,0.0004319781],"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.00003927751,0.00004939653,0.0003790487,0.0002093761,0.00003584245,0.0002195668,0.0003035622,0.001073049,0.001573362,0.9730045,0.00597128,0.01714177],"study_design_scores_gemma":[0.00002506433,0.00002656319,0.000398656,0.00006276942,0.00005763106,0.0004319113,0.00009816144,0.005285912,0.0008508506,0.9654656,0.02725135,0.00004544411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05788928,0.006495838,0.7300163,0.01081277,0.003822852,0.000161862,0.00114156,0.00111229,0.1885472],"genre_scores_gemma":[0.638605,0.01017553,0.2808945,0.005828471,0.004974871,0.0005432424,0.001289623,0.001044177,0.05664467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01424417,"threshold_uncertainty_score":0.04765147,"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","authors":[{"name":"Sylvain Gravier","is_ca":false},{"name":"Chı́nh T. Hoàng","is_ca":true},{"name":"Frédéric Maffray","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007200694,0.0005592758,0.0006754597,0.001213925,0.002086371,0.002661354,0.001518005,0.001079825,0.006347728],"category_scores_gemma":[0.003410106,0.0007425362,0.0005972745,0.001448339,0.001745783,0.003677233,0.001383657,0.001541573,0.0008211652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001325351,"about_ca_system_score_gemma":0.0009575224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002151375,"about_ca_topic_score_gemma":0.003635648,"domain_scores_codex":[0.9992873,0.0002141222,0.00002529723,0.000214451,0.0001077058,0.0001511807],"domain_scores_gemma":[0.9960908,0.001933519,0.0004139152,0.0005684098,0.0003659099,0.0006272923],"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.0005045419,0.0001948487,0.003088763,0.0002886215,0.00008578768,0.0003277483,0.0007879321,0.01372191,0.01777059,0.9203133,0.009903252,0.03301276],"study_design_scores_gemma":[0.00004908514,0.00004182354,0.001033322,0.00003311986,0.00003339351,0.0001904528,0.0002993045,0.02948318,0.003738611,0.9592916,0.00578462,0.00002153717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6431047,0.0007439355,0.2856398,0.002252323,0.0002496619,0.0001847527,0.001666413,0.0007543761,0.06540396],"genre_scores_gemma":[0.8575771,0.0005800971,0.1182996,0.0004254013,0.000203994,0.0002425364,0.001295124,0.0003598248,0.02101624],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006347728,"threshold_uncertainty_score":0.02123523,"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","authors":[{"name":"Gábor Elek","is_ca":false},{"name":"Balázs Szegedy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002691273,0.0008595528,0.001428067,0.004772259,0.002541898,0.005265144,0.002893898,0.001868494,0.005319406],"category_scores_gemma":[0.006250446,0.0008458453,0.00164835,0.0041727,0.00907631,0.01408349,0.00452046,0.005192776,0.0005771041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003541342,"about_ca_system_score_gemma":0.001279543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001717377,"about_ca_topic_score_gemma":0.001533165,"domain_scores_codex":[0.9981635,0.0007257864,0.0001047706,0.000292913,0.0005702927,0.0001427824],"domain_scores_gemma":[0.995304,0.002868803,0.0003134182,0.0004641325,0.0005944639,0.0004551716],"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.000001085071,0.000002497264,0.00001669849,0.000006478851,0.000001895696,0.000005541654,0.00003784333,0.0002142871,0.00004073517,0.9989274,0.0001487607,0.0005967641],"study_design_scores_gemma":[0.000001587573,0.000001944697,0.00001834055,0.000004189819,0.000001382594,0.000009748414,0.00001594039,0.001151395,0.00002075263,0.9978695,0.0009033045,0.000002013081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05036024,0.008374037,0.8385422,0.008820491,0.0005189509,0.00005302794,0.0004123487,0.0002279672,0.09269064],"genre_scores_gemma":[0.7972079,0.007492596,0.1606197,0.002145177,0.003245594,0.0002925697,0.0005337774,0.0002151332,0.02824753],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005319406,"threshold_uncertainty_score":0.02569431,"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","authors":[{"name":"D. de Caen","is_ca":true},{"name":"Zoltán Füredi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001832592,0.0008621325,0.00152593,0.002405345,0.001891585,0.004808766,0.002689963,0.002306818,0.007530024],"category_scores_gemma":[0.01594699,0.001344291,0.0009119296,0.00227122,0.002206902,0.007633539,0.00164208,0.00135044,0.00049821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00170502,"about_ca_system_score_gemma":0.0007601242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001095957,"about_ca_topic_score_gemma":0.001352613,"domain_scores_codex":[0.9988667,0.0003544766,0.00008440178,0.0002611208,0.0002192534,0.0002141262],"domain_scores_gemma":[0.9697706,0.0230653,0.002734127,0.001227822,0.001088745,0.002113414],"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.004799266,0.0003754825,0.0275189,0.001475384,0.00049175,0.001501613,0.002172358,0.08631935,0.05973198,0.7630286,0.0161451,0.03644018],"study_design_scores_gemma":[0.0003042957,0.0002190583,0.01149085,0.0001967626,0.0002993921,0.001663086,0.001017088,0.1377573,0.01782587,0.8240849,0.005038382,0.0001029384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9625665,0.0007869409,0.0157095,0.001410122,0.00005204232,0.00004699475,0.002021665,0.0002170008,0.01718917],"genre_scores_gemma":[0.9842767,0.0005268183,0.00988875,0.0002524481,0.0001239159,0.0001135019,0.001399581,0.0001806178,0.003237709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007530024,"threshold_uncertainty_score":0.02519047,"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","authors":[{"name":"Peter Keevash","is_ca":false},{"name":"Dhruv Mubayi","is_ca":false},{"name":"Benny Sudakov","is_ca":false},{"name":"Jacques Verstraëte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001712335,0.001396445,0.001532534,0.001240883,0.003161233,0.002843473,0.003374139,0.002071388,0.02633819],"category_scores_gemma":[0.008973916,0.0007544128,0.002040148,0.001715331,0.002785696,0.009492574,0.004568771,0.004387091,0.003346089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002981319,"about_ca_system_score_gemma":0.001672113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001861439,"about_ca_topic_score_gemma":0.002670025,"domain_scores_codex":[0.9973897,0.0007219907,0.0001121059,0.0007525278,0.0003813003,0.0006423888],"domain_scores_gemma":[0.9939753,0.003494151,0.0004736623,0.001069098,0.0003630384,0.0006247676],"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.0002383716,0.0001180517,0.0005489612,0.0004062505,0.00006492703,0.000130382,0.0002775089,0.01801666,0.001375506,0.9210076,0.02901858,0.02879718],"study_design_scores_gemma":[0.00004561082,0.00004532097,0.0003669458,0.00003826865,0.00003244069,0.0001381009,0.0001040074,0.03712098,0.001008469,0.9477167,0.01335512,0.00002814996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2160529,0.003331547,0.5645575,0.009670258,0.001172662,0.0006038289,0.004095501,0.002903771,0.1976121],"genre_scores_gemma":[0.7265295,0.002160688,0.1740678,0.003011517,0.001004268,0.0008481544,0.004806795,0.001409889,0.08616141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02633819,"threshold_uncertainty_score":0.08811003,"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","authors":[{"name":"Chris Godsil","is_ca":true},{"name":"Michael Newman","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003608832,0.002012277,0.002415742,0.006439905,0.003321697,0.005911862,0.003484608,0.002417747,0.0169584],"category_scores_gemma":[0.02264337,0.001263319,0.001578656,0.004233798,0.005080671,0.01073103,0.00548534,0.008184236,0.002917893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002809472,"about_ca_system_score_gemma":0.0009942988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009995527,"about_ca_topic_score_gemma":0.001155186,"domain_scores_codex":[0.9970094,0.0008071074,0.0001210331,0.0004882411,0.00115104,0.0004230867],"domain_scores_gemma":[0.9750606,0.01862181,0.001150949,0.001662993,0.001664871,0.001838787],"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.00004903131,0.00005564958,0.0002738006,0.00005920241,0.00001857224,0.00003984724,0.000218152,0.002878243,0.0006185753,0.9870878,0.004324193,0.004376808],"study_design_scores_gemma":[0.000008706191,0.000006264157,0.0001548309,0.00001711147,0.00001089867,0.00003283148,0.00003674371,0.01285211,0.0001927794,0.9856508,0.001024012,0.00001300666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2203521,0.005532362,0.4215416,0.01163709,0.00129499,0.0001437643,0.0008774755,0.00106846,0.3375522],"genre_scores_gemma":[0.9056262,0.002943875,0.03892176,0.001849418,0.002882871,0.000484709,0.0008112519,0.0006839405,0.04579605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0169584,"threshold_uncertainty_score":0.05673152,"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","authors":[{"name":"Maura B. Paterson","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true},{"name":"Ruizhong Wei","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108429,0.00111495,0.001138325,0.001133839,0.001252935,0.001935735,0.001988531,0.001437603,0.009579293],"category_scores_gemma":[0.005803894,0.0005155411,0.0008004706,0.001952511,0.001955671,0.002973384,0.001726228,0.00243268,0.001764466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002262918,"about_ca_system_score_gemma":0.001613664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002148219,"about_ca_topic_score_gemma":0.002048725,"domain_scores_codex":[0.9984065,0.0004305913,0.00007003261,0.0003052485,0.000482594,0.0003050488],"domain_scores_gemma":[0.9957783,0.002076624,0.0004525224,0.0007579817,0.0006341617,0.0003003871],"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.0001391106,0.00007106286,0.0004786509,0.000171177,0.00002500393,0.0001293903,0.00008398395,0.06031705,0.001741641,0.9011746,0.01067262,0.02499588],"study_design_scores_gemma":[0.00008343432,0.0001311888,0.0003612968,0.00006049663,0.00002848842,0.0004295785,0.00006987425,0.3522367,0.002958511,0.6180383,0.0255401,0.00006191083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0703712,0.003326082,0.8522447,0.001379574,0.0007323171,0.0002841701,0.001494951,0.0007007291,0.0694662],"genre_scores_gemma":[0.6606089,0.003319394,0.2737741,0.001266564,0.001016752,0.0008826432,0.002431843,0.0004771431,0.05622255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009579293,"threshold_uncertainty_score":0.03204596,"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","authors":[{"name":"Ben Green","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002424005,0.0004878383,0.0008992968,0.00136877,0.002224153,0.003758548,0.0008870832,0.001477214,0.006493374],"category_scores_gemma":[0.01314244,0.0004178552,0.0006552931,0.001452352,0.004614412,0.00861576,0.00284151,0.002693918,0.0009400854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001909242,"about_ca_system_score_gemma":0.0009291703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001403541,"about_ca_topic_score_gemma":0.0007643467,"domain_scores_codex":[0.9982236,0.0003703809,0.00007753041,0.000547562,0.0004829453,0.0002979909],"domain_scores_gemma":[0.9946927,0.002675846,0.0005116421,0.001015044,0.0005216108,0.0005830649],"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.0002477312,0.00002060997,0.00109886,0.00006422347,0.00001138863,0.0001081167,0.0003091845,0.002409433,0.0008635811,0.9718695,0.008719249,0.01427821],"study_design_scores_gemma":[0.00003169506,0.00001773478,0.0004903044,0.00002375494,0.000008901131,0.0001431404,0.0001073413,0.004896118,0.0007394659,0.9822236,0.01130462,0.00001342618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6027105,0.006384635,0.1155091,0.02659264,0.002124628,0.00009455083,0.0009367864,0.0005427178,0.2451044],"genre_scores_gemma":[0.972017,0.001393601,0.009296028,0.001175205,0.0007883363,0.0001070058,0.0003029916,0.00003631095,0.01488344],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006493374,"threshold_uncertainty_score":0.02172244,"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","authors":[{"name":"József Solymosi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004397362,0.001781531,0.002188955,0.004328301,0.00304107,0.008786685,0.004006512,0.002483531,0.02136191],"category_scores_gemma":[0.03099716,0.001053684,0.001515628,0.002837027,0.004935914,0.02066562,0.005813383,0.006260625,0.004909082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002320035,"about_ca_system_score_gemma":0.001077007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002172646,"about_ca_topic_score_gemma":0.0003786404,"domain_scores_codex":[0.9944569,0.00115466,0.0004549793,0.001540626,0.001788314,0.0006045128],"domain_scores_gemma":[0.9730822,0.01824274,0.001565518,0.003283377,0.001926207,0.001899945],"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.0002107315,0.00004467791,0.0006935717,0.0002043374,0.00003157389,0.0001024597,0.0001626858,0.003178452,0.002740303,0.9548112,0.006921593,0.03089847],"study_design_scores_gemma":[0.0000120923,0.00002711184,0.0003068416,0.0000542831,0.00002864389,0.0004120457,0.00004173867,0.0108472,0.002101446,0.9761079,0.01003004,0.00003065858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1208676,0.01211999,0.5983023,0.009140812,0.003689031,0.0001369034,0.001469164,0.001737318,0.2525368],"genre_scores_gemma":[0.7168609,0.006043722,0.1868034,0.002137941,0.004498724,0.0007006819,0.001719968,0.001812931,0.07942171],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02136191,"threshold_uncertainty_score":0.07146275,"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","authors":[{"name":"Sukumar Das Adhikari","is_ca":false},{"name":"Yanhan Chen","is_ca":false},{"name":"John Friedlander","is_ca":true},{"name":"Sergeĭ Konyagin","is_ca":false},{"name":"Francesco Pappalardi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002126858,0.001609998,0.002204105,0.003990786,0.004036129,0.005021848,0.00321023,0.00272913,0.01038067],"category_scores_gemma":[0.009143458,0.0007440807,0.001329593,0.004707713,0.006943697,0.01067995,0.005762287,0.007544006,0.001849555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002374701,"about_ca_system_score_gemma":0.001314278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008422365,"about_ca_topic_score_gemma":0.0007763895,"domain_scores_codex":[0.997978,0.0007693649,0.00007858343,0.0002940996,0.0006833443,0.0001965222],"domain_scores_gemma":[0.9952559,0.002966721,0.0002272469,0.0004846547,0.0005333251,0.0005321754],"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.000009556722,0.00001599095,0.00004735021,0.0000540809,0.000004691795,0.0000182782,0.00008288645,0.0004055279,0.00006801337,0.9939056,0.002503206,0.002884787],"study_design_scores_gemma":[0.000003855708,0.000001860058,0.00002215688,0.00001001753,0.000003950495,0.00002078084,0.00001487928,0.0009389914,0.00004809334,0.9958144,0.003117337,0.000003587953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1298925,0.02886993,0.1922382,0.03756116,0.01081393,0.0000669268,0.0005570432,0.000654956,0.5993453],"genre_scores_gemma":[0.7838297,0.01517506,0.0416902,0.005076056,0.01715943,0.0001615765,0.0005605355,0.0006106576,0.1357367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01038067,"threshold_uncertainty_score":0.03472674,"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","authors":[{"name":"Penny Haxell","is_ca":true},{"name":"Tomasz Łuczak","is_ca":false},{"name":"Yuejian Peng","is_ca":false},{"name":"V. Rödl","is_ca":false},{"name":"Andrzej Ruciński","is_ca":false},{"name":"Miklós Simonovits","is_ca":false},{"name":"Jozef Skokan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001945779,0.000704269,0.001374768,0.004551953,0.002639571,0.005297441,0.001979156,0.001892508,0.00927216],"category_scores_gemma":[0.01113146,0.0008667483,0.0007941524,0.002944093,0.004395257,0.01218902,0.002397598,0.003166117,0.000776758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002567945,"about_ca_system_score_gemma":0.0010643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001060829,"about_ca_topic_score_gemma":0.0008036611,"domain_scores_codex":[0.999123,0.0002620461,0.00005599272,0.0002307195,0.0001923105,0.0001358817],"domain_scores_gemma":[0.9940892,0.003478858,0.0006815238,0.0004639778,0.000442089,0.0008442773],"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.00004956363,0.00001801383,0.0003744138,0.00005814926,0.000008990402,0.00002747148,0.0002176267,0.0008888568,0.0004192664,0.9914303,0.002538985,0.003968479],"study_design_scores_gemma":[0.000009608918,0.0000100662,0.00023956,0.00002816466,0.00001181437,0.00007900844,0.00008909815,0.004598029,0.0002768952,0.9925638,0.002079596,0.00001437072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6473043,0.00757454,0.1010221,0.010191,0.0009631848,0.0001291728,0.001038528,0.0006770337,0.2311001],"genre_scores_gemma":[0.9713265,0.002189501,0.01153359,0.0005931526,0.0007694398,0.0001965482,0.0002635166,0.0001253138,0.01300236],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00927216,"threshold_uncertainty_score":0.03101844,"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","authors":[{"name":"Dan Hefetz","is_ca":false},{"name":"Michael Krivelevich","is_ca":false},{"name":"Tibor Szabó","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820872,0.0004324325,0.0005917154,0.002618523,0.001941741,0.002549259,0.0009595403,0.001045587,0.003868035],"category_scores_gemma":[0.004365021,0.0006410454,0.000373154,0.002395234,0.003452199,0.003429102,0.001570374,0.001446831,0.0002603261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001238589,"about_ca_system_score_gemma":0.0005392462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002864624,"about_ca_topic_score_gemma":0.004866639,"domain_scores_codex":[0.9995678,0.0001437524,0.00001960061,0.0000701344,0.0001274619,0.00007121922],"domain_scores_gemma":[0.9967505,0.002097081,0.0003965568,0.0001736922,0.0002294918,0.0003527914],"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.00001630538,0.00001226293,0.000264543,0.0000228924,0.000004172922,0.0001067341,0.0004604275,0.001380722,0.0004970623,0.9933487,0.0006482766,0.003237928],"study_design_scores_gemma":[0.000007743432,0.000003377053,0.000163889,0.000005502942,0.000004360231,0.00005605313,0.00009623701,0.003289025,0.0001527667,0.9951764,0.001040166,0.000004555021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8440845,0.002221328,0.07090554,0.001712876,0.0001003215,0.00006999307,0.0002318377,0.0002290144,0.08044462],"genre_scores_gemma":[0.9678312,0.001087712,0.0120161,0.0002402314,0.0001762922,0.00009704688,0.0001593386,0.00005502248,0.01833709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003868035,"threshold_uncertainty_score":0.01293987,"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","authors":[{"name":"Derrick Hart","is_ca":false},{"name":"Alex Iosevich","is_ca":false},{"name":"József Solymosi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007049869,0.002549482,0.00186845,0.007879439,0.002361702,0.005541862,0.003759142,0.001406368,0.01079437],"category_scores_gemma":[0.0247944,0.0009230896,0.002073043,0.004542706,0.005985718,0.02088079,0.007527996,0.007802496,0.003181026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002721653,"about_ca_system_score_gemma":0.0009529151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000927956,"about_ca_topic_score_gemma":0.001037741,"domain_scores_codex":[0.9960644,0.0009030925,0.0002365759,0.0005555989,0.001707349,0.0005330694],"domain_scores_gemma":[0.9842988,0.009885791,0.0008778792,0.001654468,0.002217619,0.001065399],"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.00005347947,0.00004502788,0.0005949802,0.0001300348,0.00002464993,0.00008822876,0.0002376767,0.00416858,0.001186254,0.9829612,0.001324679,0.009185227],"study_design_scores_gemma":[0.000005850161,0.00002618951,0.0002973533,0.00006273905,0.00004689026,0.0001351457,0.0000825476,0.02881281,0.003009731,0.9644998,0.002986476,0.00003443246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1176499,0.004784258,0.7683326,0.002297349,0.0008805098,0.00007096594,0.0003461655,0.0007102942,0.1049281],"genre_scores_gemma":[0.8612759,0.005688976,0.1004497,0.000793017,0.001868566,0.0002757073,0.0005635291,0.00086368,0.02822098],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01079437,"threshold_uncertainty_score":0.03728372,"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","authors":[{"name":"J Cain","is_ca":false},{"name":"Nicholas Wormald","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00116146,0.0004130487,0.0009079644,0.002062288,0.00148595,0.002620834,0.001212857,0.001050349,0.008470749],"category_scores_gemma":[0.008934707,0.0004732086,0.0006340644,0.0007195844,0.002352849,0.00513362,0.003562646,0.001971438,0.001020881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001334335,"about_ca_system_score_gemma":0.0005480379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001091466,"about_ca_topic_score_gemma":0.001125277,"domain_scores_codex":[0.9988852,0.0002262178,0.00004917891,0.0002860147,0.0002991599,0.0002542536],"domain_scores_gemma":[0.9950153,0.001765239,0.0006063108,0.000700327,0.0009600361,0.0009526649],"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.0000293239,0.0000163745,0.0009416451,0.00004225704,0.000005155915,0.0001120768,0.0001767082,0.001394863,0.001762633,0.9895641,0.0008570289,0.005097824],"study_design_scores_gemma":[0.00001858144,0.00006817265,0.001991335,0.00005526195,0.00001271882,0.0005316193,0.0002404896,0.04527197,0.003489475,0.9406375,0.007658961,0.00002398955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5883706,0.001430885,0.2314762,0.001383516,0.000336371,0.0001269573,0.0004224378,0.0007238616,0.1757293],"genre_scores_gemma":[0.9576555,0.0004116654,0.02160062,0.0003559529,0.0001678043,0.0001330988,0.0001691,0.000241233,0.01926511],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008470749,"threshold_uncertainty_score":0.02833748,"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","authors":[{"name":"Yoshiharu Kohayakawa","is_ca":false},{"name":"Sang June Lee","is_ca":false},{"name":"Vojtěch Rödl","is_ca":false},{"name":"Wojciech Samotij","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004260585,0.0003605971,0.0009270091,0.002066691,0.001097629,0.002344349,0.001496035,0.0009982835,0.002799579],"category_scores_gemma":[0.03915912,0.0006459191,0.0005645205,0.0009948664,0.002765011,0.003701235,0.002143013,0.001240571,0.0001818861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001365186,"about_ca_system_score_gemma":0.0005015786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005647326,"about_ca_topic_score_gemma":0.000452221,"domain_scores_codex":[0.998229,0.00066234,0.000120216,0.0003590473,0.0004284827,0.000200935],"domain_scores_gemma":[0.9437293,0.04662009,0.003543632,0.002699686,0.001606766,0.001800431],"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.001745373,0.0001996753,0.07646369,0.0004735512,0.0002448218,0.0006876774,0.0009579057,0.1354975,0.01950555,0.7258212,0.006044227,0.03235888],"study_design_scores_gemma":[0.0001314,0.0002522719,0.02496433,0.0002239473,0.00007656164,0.001159509,0.0007209114,0.5551614,0.01748219,0.394806,0.004880062,0.0001414565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.865222,0.0005958802,0.1220673,0.001777336,0.00005714983,0.00005885351,0.0007798386,0.0001213941,0.009320298],"genre_scores_gemma":[0.9860891,0.0002050964,0.01225105,0.00009892481,0.00007232326,0.00009491087,0.0003319609,0.00002724646,0.0008294501],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004260585,"threshold_uncertainty_score":0.0225324,"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","authors":[{"name":"Hamed Hatami","is_ca":true},{"name":"Jan Hladký","is_ca":false},{"name":"Daniel Král͏̌","is_ca":false},{"name":"Serguei Norine","is_ca":false},{"name":"Alexander Razborov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009843914,0.0005971805,0.001016753,0.001645581,0.003204638,0.003236351,0.002090947,0.001715515,0.005122747],"category_scores_gemma":[0.006652794,0.000789571,0.0008763398,0.002275403,0.004063106,0.006389035,0.003622727,0.001390244,0.0006011256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001653095,"about_ca_system_score_gemma":0.001007132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002231184,"about_ca_topic_score_gemma":0.00377703,"domain_scores_codex":[0.9983228,0.0001842383,0.0001039655,0.0006468141,0.0002831988,0.0004588887],"domain_scores_gemma":[0.9885621,0.004937453,0.00159467,0.001929293,0.001134635,0.001841787],"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.0003369203,0.0001028416,0.01147025,0.0002488296,0.0000862377,0.001346237,0.001529311,0.004021042,0.007189121,0.9519518,0.002325472,0.01939194],"study_design_scores_gemma":[0.00004392089,0.00007353968,0.003765197,0.00006026539,0.00008358176,0.001672853,0.001319992,0.01164117,0.006814459,0.9576833,0.01678429,0.00005736821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9145416,0.0007059029,0.05228641,0.0007035916,0.00008095313,0.00006646986,0.0006449603,0.0003045202,0.0306656],"genre_scores_gemma":[0.9827208,0.000206804,0.01177673,0.0001156295,0.00002103856,0.00005874823,0.0005554386,0.0000437591,0.004501034],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005122747,"threshold_uncertainty_score":0.01713729,"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","authors":[{"name":"László Lovász","is_ca":false},{"name":"Balázs Szegedy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009134871,0.0008758524,0.001072,0.003329206,0.004057784,0.005501552,0.00151242,0.002447613,0.01258572],"category_scores_gemma":[0.004092594,0.0007360952,0.0008570942,0.001599836,0.004517746,0.007542182,0.00297468,0.00444843,0.001345159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002078616,"about_ca_system_score_gemma":0.0007819575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009258373,"about_ca_topic_score_gemma":0.001589634,"domain_scores_codex":[0.9989663,0.0002801424,0.00005031805,0.0002436188,0.0002677321,0.0001918298],"domain_scores_gemma":[0.9971245,0.001304105,0.0002747949,0.0003104033,0.0004587139,0.0005274279],"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.000008938594,0.00001109205,0.00005673261,0.000007066918,0.000002104004,0.00002606085,0.0001065864,0.00007089609,0.0001924127,0.9979939,0.000621123,0.0009031135],"study_design_scores_gemma":[0.000007758979,0.000006146504,0.0000898814,0.000008835953,0.00000470329,0.00008085805,0.00007296757,0.0006612903,0.0002448474,0.9961252,0.002690533,0.000006945407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4393655,0.002149847,0.0925133,0.00790122,0.001744962,0.0001095663,0.0005526758,0.0008386032,0.4548244],"genre_scores_gemma":[0.8710683,0.0007995334,0.01810863,0.001261132,0.001055934,0.0001350075,0.0004676673,0.000275062,0.1068288],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01258572,"threshold_uncertainty_score":0.04210347,"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","authors":[{"name":"Javier Cilleruelo","is_ca":false},{"name":"Andrew Granville","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002160751,0.0005773319,0.0004578062,0.001168541,0.001290859,0.003361113,0.0004573161,0.0005533451,0.01874367],"category_scores_gemma":[0.0008168404,0.000294895,0.0003749402,0.002074592,0.00316402,0.003798005,0.001209526,0.001734429,0.005628808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009145788,"about_ca_system_score_gemma":0.0004892132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007315808,"about_ca_topic_score_gemma":0.001321886,"domain_scores_codex":[0.9998114,0.00005704102,0.00001211858,0.00003694736,0.00006018691,0.00002229681],"domain_scores_gemma":[0.9998115,0.00008227267,0.00001678989,0.000027034,0.00003983872,0.00002260814],"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.00001228948,0.00000449568,0.00004843735,0.00005458026,0.000001870113,0.00003229878,0.000363984,0.0003131892,0.0001894261,0.9650565,0.01180222,0.02212065],"study_design_scores_gemma":[0.000007467728,0.00001563154,0.0002088436,0.00006893731,0.000003641011,0.0002020617,0.0002615089,0.0004804167,0.0002204934,0.8463932,0.1521307,0.000006957794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01990026,0.0253071,0.03502706,0.002411999,0.002292344,0.00004462251,0.0002981854,0.0002800912,0.9144384],"genre_scores_gemma":[0.4480666,0.0311986,0.04631784,0.0007399698,0.002874,0.0001687452,0.0007163664,0.0004048814,0.469513],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01874367,"threshold_uncertainty_score":0.06270379,"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","authors":[{"name":"Zoltán Füredi","is_ca":false},{"name":"Assaf Naor","is_ca":false},{"name":"Jacques Verstraëte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273315,0.0008759738,0.001235252,0.003120019,0.00265612,0.003792805,0.001712095,0.001789448,0.01091152],"category_scores_gemma":[0.006030312,0.0004893025,0.0007426522,0.001851519,0.004860004,0.007006675,0.002558616,0.004509397,0.001982519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001942237,"about_ca_system_score_gemma":0.000874107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002002704,"about_ca_topic_score_gemma":0.001504421,"domain_scores_codex":[0.9992755,0.000285836,0.00003082595,0.0001191345,0.0001712096,0.0001175343],"domain_scores_gemma":[0.997929,0.001145761,0.0001908469,0.0001488235,0.0002595223,0.0003260395],"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.00002234397,0.000006285148,0.0000754927,0.00002393133,0.00000241455,0.0000157218,0.00006563437,0.001073025,0.00009199731,0.9928906,0.002119299,0.003613302],"study_design_scores_gemma":[0.000003468598,0.000005482546,0.00007246979,0.00001355541,0.000002050691,0.00002167122,0.00002888979,0.002680899,0.00005053271,0.9945943,0.00252006,0.000006674164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2818184,0.008124995,0.1678853,0.01214072,0.003454083,0.00008038508,0.0005527533,0.0005185764,0.5254246],"genre_scores_gemma":[0.9141915,0.003506327,0.03024817,0.002097138,0.002008605,0.0001617706,0.0004185491,0.0003152446,0.04705283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01091152,"threshold_uncertainty_score":0.03650266,"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","authors":[{"name":"Dhruv Mubayi","is_ca":false},{"name":"Jacques Verstraëte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003329375,0.001531273,0.001900136,0.002435835,0.002660302,0.003309425,0.002747214,0.002550409,0.0230542],"category_scores_gemma":[0.02059796,0.001097867,0.00245074,0.002902657,0.007717445,0.01308814,0.009108966,0.009691969,0.002113797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0026294,"about_ca_system_score_gemma":0.001168024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002807269,"about_ca_topic_score_gemma":0.00202063,"domain_scores_codex":[0.9978698,0.0006262427,0.0001139674,0.0004690431,0.0006603959,0.0002604947],"domain_scores_gemma":[0.9811227,0.01378474,0.0006755914,0.001775031,0.001587799,0.001054165],"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.00009737437,0.00007260955,0.000479549,0.0002191325,0.00003218989,0.0001931946,0.0005609462,0.001648079,0.0007474397,0.9751769,0.01353962,0.007232985],"study_design_scores_gemma":[0.00005073967,0.0000243016,0.0002622909,0.00004092493,0.00002390253,0.0001138478,0.0001132366,0.003862711,0.0003141522,0.9859096,0.009267585,0.00001670667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.187564,0.005468882,0.3854342,0.1121085,0.006840286,0.0003042507,0.002471302,0.001971391,0.2978372],"genre_scores_gemma":[0.8567197,0.003516896,0.0924035,0.00831488,0.003903299,0.0003963872,0.001514339,0.0005958978,0.03263514],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0230542,"threshold_uncertainty_score":0.07712394,"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","authors":[{"name":"Veselin Jungić","is_ca":true},{"name":"Jonathan D. Licht","is_ca":false},{"name":"Mohammad Mahdian","is_ca":false},{"name":"Jaroslav Nešetřil","is_ca":false},{"name":"Radoš Radoičić","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001886302,0.0003431781,0.0005268232,0.001187902,0.001880079,0.001850639,0.00141706,0.0007910727,0.005711383],"category_scores_gemma":[0.004817798,0.0003855742,0.0006164347,0.000982495,0.002753339,0.008075789,0.003005742,0.002147905,0.0005425835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001116907,"about_ca_system_score_gemma":0.0006197557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007349384,"about_ca_topic_score_gemma":0.0009041525,"domain_scores_codex":[0.9989432,0.0003036456,0.00006834414,0.0002237177,0.0003017286,0.000159346],"domain_scores_gemma":[0.9961302,0.002167364,0.0003609883,0.0005298248,0.0004184831,0.0003930861],"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.000038231,0.00003319177,0.0003788351,0.00005516459,0.000006544478,0.00009187913,0.0002610724,0.001263501,0.0008437152,0.9918782,0.001032345,0.004117291],"study_design_scores_gemma":[0.0000120891,0.00002441292,0.0002590639,0.00001649169,0.00000888846,0.00017195,0.0001512446,0.008615931,0.0009689005,0.9857457,0.004013818,0.00001150772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6347346,0.003280756,0.1933246,0.005133998,0.0003453218,0.00007548492,0.0003671024,0.0006017757,0.1621365],"genre_scores_gemma":[0.9655241,0.001057102,0.0206503,0.0004046878,0.0002362381,0.00006882274,0.0001986289,0.00005957697,0.01180052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005711383,"threshold_uncertainty_score":0.01910645,"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","authors":[{"name":"Jaroslav Nešetřil","is_ca":false},{"name":"Nicholas Wormald","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002179059,0.0008005034,0.001110261,0.002944193,0.001991281,0.003232054,0.00220699,0.001621768,0.004994255],"category_scores_gemma":[0.0161219,0.0006703234,0.0007983285,0.00182453,0.004825761,0.005103008,0.002688731,0.002824119,0.000572923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002834486,"about_ca_system_score_gemma":0.001248662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002320432,"about_ca_topic_score_gemma":0.002024528,"domain_scores_codex":[0.9988046,0.0003395185,0.00004592531,0.000421975,0.0002059146,0.0001821662],"domain_scores_gemma":[0.978874,0.0154151,0.001503887,0.001748847,0.001129003,0.001329097],"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.0001468175,0.00004982534,0.003884771,0.0001841017,0.00003949859,0.0000923859,0.0002586602,0.01691839,0.005978448,0.9606488,0.002985331,0.008812999],"study_design_scores_gemma":[0.00006796024,0.00008455659,0.002835093,0.00005893079,0.0000481147,0.0004161414,0.0001408498,0.1329911,0.004834238,0.8544016,0.004038163,0.00008322152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7114835,0.001728788,0.2313204,0.005903881,0.000263879,0.0001454268,0.0009876146,0.0008467082,0.04731984],"genre_scores_gemma":[0.975843,0.000999017,0.01482951,0.0008837475,0.0002167803,0.0002595744,0.0004297065,0.0001613438,0.006377265],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004994255,"threshold_uncertainty_score":0.02056569,"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","authors":[{"name":"József Balogh","is_ca":false},{"name":"Béla Csaba","is_ca":false},{"name":"Martin Pei","is_ca":true},{"name":"Wojciech Samotij","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006044872,0.0002573068,0.0003974809,0.000715333,0.0006219207,0.0006616016,0.0004900019,0.0004811569,0.001799692],"category_scores_gemma":[0.004886642,0.0003262183,0.0003088517,0.0005921826,0.001220164,0.001948261,0.001100926,0.001010775,0.0002517286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003155698,"about_ca_system_score_gemma":0.0001788171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004441633,"about_ca_topic_score_gemma":0.000496601,"domain_scores_codex":[0.9996374,0.0001164134,0.00001035409,0.00008453226,0.00008453451,0.00006683061],"domain_scores_gemma":[0.9957839,0.003087892,0.0003051303,0.0002492675,0.0002660277,0.0003079029],"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.0001506225,0.00004413705,0.002643717,0.0001668961,0.00001963797,0.0005412304,0.0007093686,0.02771614,0.02137933,0.9223047,0.003393587,0.02093061],"study_design_scores_gemma":[0.00003650257,0.000070804,0.002711043,0.00003215914,0.00002197015,0.0007835896,0.0001916701,0.08987882,0.00595111,0.8937843,0.006518054,0.00002006349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7900825,0.001325231,0.1820295,0.0009175361,0.000039786,0.00003324866,0.0002903622,0.0003074611,0.0249744],"genre_scores_gemma":[0.975738,0.0006150395,0.01988616,0.0002445859,0.00007596546,0.0000502283,0.0003086261,0.00007393631,0.003007472],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001799692,"threshold_uncertainty_score":0.006020606,"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","authors":[{"name":"Zhidong Bai","is_ca":false},{"name":"Luc Devroye","is_ca":true},{"name":"Hsien‐Kuei Hwang","is_ca":false},{"name":"Tsung‐Hsi Tsai","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003686853,0.000609327,0.001562051,0.003280805,0.00149373,0.003369234,0.001307899,0.001343128,0.008471735],"category_scores_gemma":[0.02429057,0.001109989,0.001025778,0.001930875,0.002546826,0.004728362,0.003852502,0.001558325,0.001683597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001356924,"about_ca_system_score_gemma":0.0006255339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004666897,"about_ca_topic_score_gemma":0.0005354643,"domain_scores_codex":[0.997108,0.00120691,0.0001586006,0.0005651013,0.0006564001,0.0003049989],"domain_scores_gemma":[0.9898396,0.006801114,0.001175974,0.0006823094,0.0008824512,0.0006185688],"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.000194585,0.00004665005,0.00127691,0.0002279391,0.00005530038,0.0001645694,0.0003103093,0.03980033,0.001807354,0.9274163,0.003857998,0.02484175],"study_design_scores_gemma":[0.0000607816,0.00005495362,0.0006233671,0.00008438255,0.00001661132,0.0002267087,0.0001134411,0.1372073,0.001612839,0.854077,0.005893235,0.00002929809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2235961,0.003676197,0.7256559,0.001474715,0.0002203304,0.0002846229,0.0007635668,0.0006478929,0.04368067],"genre_scores_gemma":[0.7497112,0.001784463,0.226921,0.0006921844,0.0003548831,0.00104823,0.00096317,0.0004637641,0.01806112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008471735,"threshold_uncertainty_score":0.02834076,"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","authors":[{"name":"Andrzej Dudek","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002222098,0.0008566884,0.0008182789,0.00144324,0.001171936,0.00188481,0.001917616,0.001140545,0.01926525],"category_scores_gemma":[0.007876341,0.0004683754,0.001026526,0.001453169,0.004067715,0.01166397,0.004802803,0.005020993,0.001756475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001794794,"about_ca_system_score_gemma":0.000985112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001314259,"about_ca_topic_score_gemma":0.001042097,"domain_scores_codex":[0.9986147,0.000347112,0.00006021775,0.0004029545,0.0003897489,0.0001852737],"domain_scores_gemma":[0.9934872,0.004140724,0.0003597206,0.0008443963,0.000747981,0.0004199316],"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.00003051034,0.00002743289,0.0002321066,0.00008161123,0.000009689247,0.00006006929,0.0001719525,0.0008184482,0.001559114,0.9868117,0.003378067,0.006819277],"study_design_scores_gemma":[0.00002997671,0.00008685744,0.000623011,0.00003428099,0.00002323873,0.0002786663,0.00009154372,0.01101046,0.002872531,0.9586256,0.02628687,0.00003676966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0737733,0.004205092,0.6530944,0.01972811,0.0009682066,0.0001010237,0.001088664,0.0009854082,0.2460558],"genre_scores_gemma":[0.8226587,0.003046231,0.1215167,0.006272044,0.001893432,0.0003922701,0.0004770857,0.0003733499,0.04337011],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01926525,"threshold_uncertainty_score":0.06444871,"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","authors":[{"name":"Joseph Lauer","is_ca":true},{"name":"Nicholas Wormald","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001542736,0.000656027,0.001941835,0.003964047,0.002672855,0.004741627,0.002727297,0.002105783,0.004153819],"category_scores_gemma":[0.01568372,0.002003514,0.001169534,0.002533596,0.005095052,0.006343188,0.003115038,0.003284363,0.0004572688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001206416,"about_ca_system_score_gemma":0.0006143932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005187275,"about_ca_topic_score_gemma":0.0007403443,"domain_scores_codex":[0.9989839,0.0002935314,0.00005137681,0.0002165663,0.0002985337,0.0001561368],"domain_scores_gemma":[0.9780152,0.01653861,0.001884987,0.001246698,0.0007491525,0.001565274],"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.000127669,0.00009641785,0.002228332,0.0001164936,0.00004442882,0.0003002407,0.0007347946,0.009115201,0.002232262,0.9776099,0.001967218,0.005427098],"study_design_scores_gemma":[0.00003320858,0.0000167627,0.0008967873,0.00002244251,0.00003114218,0.0003442179,0.0001865833,0.018987,0.0007366764,0.9781308,0.0005967051,0.00001772331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9043093,0.001088744,0.06606505,0.001635824,0.0001276788,0.00005174625,0.0002718041,0.0003652992,0.0260846],"genre_scores_gemma":[0.9834709,0.0004503733,0.01123145,0.0001961427,0.0001943154,0.0001059488,0.0002114714,0.0001057929,0.004033728],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004741627,"threshold_uncertainty_score":0.01389593,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002764205,0.0004003992,0.0002973946,0.001806976,0.001140004,0.001481617,0.0006569768,0.0006191207,0.003728177],"category_scores_gemma":[0.001914044,0.000185946,0.0002083037,0.0008679641,0.001539516,0.001615167,0.001029844,0.0007794159,0.0003386301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00104285,"about_ca_system_score_gemma":0.0002808566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000726733,"about_ca_topic_score_gemma":0.0009569178,"domain_scores_codex":[0.9997128,0.00005771156,0.00001160979,0.00005593591,0.00006785728,0.00009416344],"domain_scores_gemma":[0.9995279,0.0001712841,0.00007712711,0.00005074155,0.00007267968,0.0001002725],"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.00006172935,0.00001539675,0.0006615286,0.00006136367,0.000005540667,0.0001527398,0.0001724157,0.00444354,0.001691948,0.9789987,0.002624974,0.01111011],"study_design_scores_gemma":[0.000006689603,0.00001482843,0.0004777581,0.00002565135,0.000007870688,0.0001470331,0.00008000838,0.01667876,0.0009915812,0.9753392,0.006216615,0.00001387349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7313871,0.0044495,0.08059835,0.001923566,0.0004559918,0.00005033935,0.0003458607,0.0003450795,0.1804442],"genre_scores_gemma":[0.9883503,0.0004251236,0.005888328,0.0001411136,0.00009886828,0.00002691388,0.00007007328,0.00004142395,0.004957933],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003728177,"threshold_uncertainty_score":0.01247203,"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","authors":[{"name":"James Hirst","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001427373,0.0003927314,0.0007563845,0.001267805,0.001144419,0.001580786,0.001205463,0.0004832487,0.003433459],"category_scores_gemma":[0.005216415,0.0004208536,0.000666702,0.0004872458,0.003115577,0.002936671,0.001921324,0.001935252,0.0002670379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000962654,"about_ca_system_score_gemma":0.0003479102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005160265,"about_ca_topic_score_gemma":0.0003974434,"domain_scores_codex":[0.9990789,0.000270325,0.00003283633,0.000234005,0.0002447004,0.0001391222],"domain_scores_gemma":[0.9938785,0.004272138,0.0004180742,0.0004374241,0.0003579973,0.0006357871],"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.0001803169,0.00007534308,0.002159118,0.0001254016,0.00002142172,0.0003343208,0.0006232817,0.007618211,0.007119024,0.9733918,0.000808311,0.007543464],"study_design_scores_gemma":[0.00002102625,0.00004905796,0.001114889,0.00002570771,0.00001486943,0.0002202982,0.0001647301,0.04334708,0.004885562,0.9486213,0.001518131,0.00001732639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8787428,0.0005263137,0.09047834,0.000787289,0.00005116142,0.00002669023,0.0002131575,0.00040723,0.02876715],"genre_scores_gemma":[0.9890301,0.0001198268,0.009066562,0.00008453959,0.00003926495,0.00001818213,0.000113983,0.00004717189,0.001480418],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003433459,"threshold_uncertainty_score":0.01148611,"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","authors":[{"name":"Izabella Łaba","is_ca":true},{"name":"Terence Tao","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003800002,0.002064128,0.002724721,0.006293193,0.003070237,0.004952425,0.004804261,0.002947191,0.007476075],"category_scores_gemma":[0.01162704,0.001121438,0.001897764,0.002409725,0.006022303,0.0103006,0.006842462,0.006983678,0.001134109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002822265,"about_ca_system_score_gemma":0.0008404356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0013788,"about_ca_topic_score_gemma":0.00152591,"domain_scores_codex":[0.9982489,0.000525336,0.00007762693,0.0003855818,0.0004758229,0.0002868645],"domain_scores_gemma":[0.9929817,0.004200649,0.00031039,0.001047369,0.0005792056,0.0008806675],"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.0001535808,0.00003837265,0.0005539499,0.0001694505,0.0000327772,0.0000893705,0.000193871,0.005255933,0.002917397,0.9836309,0.002084069,0.00488043],"study_design_scores_gemma":[0.00001536362,0.00002835463,0.0006536192,0.00007562353,0.00004443402,0.000104086,0.00006652676,0.05166646,0.001941115,0.9422235,0.003112657,0.00006829945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3049116,0.009976549,0.5373214,0.006258981,0.001721221,0.0001149308,0.001108208,0.001608457,0.1369786],"genre_scores_gemma":[0.9275287,0.00194425,0.05708158,0.001145775,0.001254257,0.0001816179,0.0003852287,0.0005509049,0.009927664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007476075,"threshold_uncertainty_score":0.02500993,"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","authors":[{"name":"Bruce Reed","is_ca":true},{"name":"Benny Sudakov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002134718,0.001408734,0.002243496,0.003566235,0.00438987,0.009320661,0.004729738,0.00638387,0.04711699],"category_scores_gemma":[0.03084846,0.001684013,0.001019273,0.002472166,0.004560463,0.02345156,0.00313278,0.007969169,0.008019505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003600001,"about_ca_system_score_gemma":0.001945562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001745936,"about_ca_topic_score_gemma":0.00257971,"domain_scores_codex":[0.9969178,0.000738647,0.0001019523,0.0008636828,0.0008171976,0.0005606675],"domain_scores_gemma":[0.9798023,0.01176657,0.001334475,0.003877942,0.002111146,0.001107496],"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.00008088207,0.0000659633,0.0007809828,0.000210856,0.00001883243,0.00004397574,0.0002298916,0.001326112,0.001541925,0.9697672,0.01004052,0.01589298],"study_design_scores_gemma":[0.00002462888,0.00001498392,0.0007691552,0.00006361386,0.00002499136,0.0002323572,0.0001386515,0.006037301,0.001039854,0.9834949,0.008127223,0.00003220122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2537272,0.004914282,0.1816812,0.02552501,0.002658656,0.000207648,0.002337658,0.009310057,0.5196382],"genre_scores_gemma":[0.8601348,0.001832274,0.02558041,0.004379681,0.001875106,0.0004157555,0.001295546,0.001633919,0.1028526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04711699,"threshold_uncertainty_score":0.157622,"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","authors":[{"name":"Jaroslav Nešetřil","is_ca":false},{"name":"Nicholas Wormald","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333758,0.0003487379,0.0004578402,0.001944593,0.001254308,0.001865883,0.001421582,0.0006775018,0.003760644],"category_scores_gemma":[0.01098552,0.0004213499,0.0003320055,0.001082928,0.003145051,0.002217486,0.001063766,0.001139949,0.0003498433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002524239,"about_ca_system_score_gemma":0.0007935506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002221312,"about_ca_topic_score_gemma":0.002021704,"domain_scores_codex":[0.9992267,0.0001697436,0.00003066845,0.0003075839,0.000133564,0.0001318472],"domain_scores_gemma":[0.9890668,0.006141992,0.001509302,0.001611961,0.0008177773,0.0008520703],"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.0005434901,0.0001218688,0.03389077,0.0003244015,0.0001115992,0.0002625932,0.0005497518,0.06162089,0.02901952,0.8279403,0.005851568,0.03976317],"study_design_scores_gemma":[0.0001030456,0.0001745003,0.02056344,0.0001047634,0.0001050577,0.001272977,0.0003570135,0.2137208,0.0229341,0.7295286,0.0109795,0.0001561103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8772391,0.0006375115,0.09782911,0.001434433,0.00007515647,0.00006133279,0.0005426692,0.0004085234,0.02177215],"genre_scores_gemma":[0.9897038,0.0003222941,0.007102263,0.0001740005,0.00004464706,0.00007754506,0.0002213213,0.00006325627,0.002290825],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003760644,"threshold_uncertainty_score":0.01831472,"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","authors":[{"name":"Hamed Hatami","is_ca":true},{"name":"Michael Molloy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001629275,0.0003746557,0.0008781479,0.001692089,0.0006838897,0.001403525,0.0009595539,0.000783385,0.002678943],"category_scores_gemma":[0.01085445,0.0003739973,0.000465304,0.0006939552,0.001634124,0.00397035,0.001063392,0.000790428,0.0002791404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001144102,"about_ca_system_score_gemma":0.0004729292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001029481,"about_ca_topic_score_gemma":0.0005471678,"domain_scores_codex":[0.9995868,0.0001088583,0.0000188486,0.0001327578,0.00008192084,0.00007095704],"domain_scores_gemma":[0.9947518,0.003433582,0.0005339395,0.0004572864,0.0002708934,0.0005526263],"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.000439758,0.00007997933,0.003559788,0.0002069542,0.00005636971,0.000573049,0.0004996351,0.09249588,0.02465391,0.8558155,0.003051888,0.01856724],"study_design_scores_gemma":[0.00005265895,0.00009184016,0.001681284,0.00003492987,0.00003050635,0.0002837224,0.00009998089,0.6524995,0.00384857,0.3393146,0.0020226,0.00003977177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7755103,0.0008085926,0.2153083,0.001175465,0.00008823883,0.0000711323,0.0002686359,0.0005591215,0.006210264],"genre_scores_gemma":[0.9791266,0.000403126,0.01846156,0.0001000961,0.00007686512,0.00008608977,0.0001485618,0.00008548436,0.001511615],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002678943,"threshold_uncertainty_score":0.008961916,"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","authors":[{"name":"Alain Doyon","is_ca":true},{"name":"Geňa Hahn","is_ca":true},{"name":"André Raspaud","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003580345,0.001877101,0.001271436,0.006320246,0.002294037,0.005641138,0.004310499,0.001848021,0.01242818],"category_scores_gemma":[0.01895943,0.001126085,0.001368742,0.004307231,0.006841075,0.01103736,0.004721416,0.006928034,0.001181001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004881953,"about_ca_system_score_gemma":0.001070593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002248382,"about_ca_topic_score_gemma":0.003308092,"domain_scores_codex":[0.9984559,0.0003700028,0.00006792448,0.0003765212,0.0004263715,0.0003032924],"domain_scores_gemma":[0.9765512,0.01825231,0.0009330084,0.001566154,0.001023261,0.001673968],"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.0001796727,0.00007479999,0.001717728,0.0002036842,0.00003990307,0.00007830132,0.0004396294,0.01116145,0.002228443,0.9625849,0.004776075,0.01651547],"study_design_scores_gemma":[0.00002173775,0.00002876073,0.001354643,0.00007621173,0.00004750791,0.0000777423,0.0001123586,0.02263621,0.001274824,0.9706665,0.003666206,0.00003727076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4187694,0.01372396,0.2241569,0.0110581,0.0008481138,0.0001238369,0.001471495,0.001139417,0.3287089],"genre_scores_gemma":[0.938502,0.005457752,0.02849972,0.001013682,0.001195461,0.0002628085,0.0009196217,0.0004806731,0.02366842],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01242818,"threshold_uncertainty_score":0.04157645,"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","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"Frédéric Havet","is_ca":false},{"name":"Cláudia Linhares Sales","is_ca":false},{"name":"Bruce Reed","is_ca":true},{"name":"Stéphan Thomassé","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006709031,0.0004507118,0.0007733901,0.003427799,0.002184329,0.003862598,0.0009469404,0.001065786,0.005588655],"category_scores_gemma":[0.00346268,0.0007188531,0.0005404745,0.003443308,0.002640952,0.005844545,0.001913225,0.002050013,0.0008248232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001539708,"about_ca_system_score_gemma":0.0005861748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001430634,"about_ca_topic_score_gemma":0.002429684,"domain_scores_codex":[0.9993591,0.0001734802,0.00004782363,0.0001362849,0.0001894863,0.00009384428],"domain_scores_gemma":[0.9973749,0.001449225,0.0003123135,0.000173654,0.0002969613,0.0003928359],"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.000006053736,0.000008358101,0.0001197168,0.00002063761,0.00000221539,0.00004037374,0.0001753892,0.0003583874,0.0001665745,0.9960772,0.000416735,0.002608367],"study_design_scores_gemma":[0.000005432868,0.00000360505,0.00008680014,0.00001419819,0.000005489904,0.0000706049,0.00009049885,0.001489197,0.0001214278,0.9944704,0.003638479,0.000003997477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4342366,0.005279382,0.3643105,0.003406929,0.0005587434,0.000136402,0.001030883,0.0005422701,0.1904982],"genre_scores_gemma":[0.9071556,0.003246324,0.05035798,0.000703969,0.0003660696,0.0001810666,0.0006114911,0.0001499076,0.03722749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005588655,"threshold_uncertainty_score":0.01869589,"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","authors":[{"name":"Ararat Harutyunyan","is_ca":true},{"name":"Bojan Mohar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001662306,0.001074908,0.0009621241,0.005277037,0.002604434,0.003693783,0.002739463,0.002085799,0.01519122],"category_scores_gemma":[0.01081852,0.0006751241,0.001079205,0.004704238,0.006367009,0.009315745,0.003762887,0.005632874,0.001115579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004003888,"about_ca_system_score_gemma":0.001512706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002971307,"about_ca_topic_score_gemma":0.003495836,"domain_scores_codex":[0.9989003,0.0002108751,0.00004040404,0.0003816517,0.0002706982,0.0001961113],"domain_scores_gemma":[0.988197,0.007600615,0.0006764905,0.001093861,0.0008950436,0.001536921],"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.00003655634,0.00002414964,0.0003715353,0.00007263934,0.000005962105,0.00003176457,0.000193282,0.001299722,0.0005208679,0.9883456,0.003126251,0.005971635],"study_design_scores_gemma":[0.00002163592,0.00002058317,0.0006846741,0.00004604302,0.00002069466,0.0001215619,0.0001365415,0.006150166,0.0007263941,0.9806172,0.01142893,0.00002555176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1571879,0.006643198,0.4120282,0.01830134,0.002083009,0.0001396552,0.001291664,0.0006537159,0.4016714],"genre_scores_gemma":[0.8378549,0.00495945,0.07987289,0.003646422,0.00243966,0.0002915984,0.0009947784,0.0005153965,0.06942487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01519122,"threshold_uncertainty_score":0.05081969,"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","authors":[{"name":"Maria Axenovich","is_ca":false},{"name":"Tao Jiang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001627307,0.0003849157,0.0004731155,0.002419641,0.001513459,0.002890991,0.0009640837,0.0008937211,0.009532367],"category_scores_gemma":[0.00906889,0.0004006388,0.000363042,0.0009391467,0.002732296,0.006200969,0.001631638,0.001755816,0.0009157329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001237208,"about_ca_system_score_gemma":0.0005987855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004476663,"about_ca_topic_score_gemma":0.0008250952,"domain_scores_codex":[0.9990282,0.00036459,0.00004922303,0.0001706013,0.0002650805,0.0001222707],"domain_scores_gemma":[0.9933338,0.004282412,0.0006871358,0.0004782734,0.0005306044,0.0006877717],"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.00002160165,0.00001002879,0.0001456949,0.00003091636,0.00000333509,0.00001473137,0.00005442066,0.0004061514,0.0002701359,0.9947978,0.001625866,0.00261925],"study_design_scores_gemma":[0.000009653985,0.000008356031,0.0001799781,0.00001673242,0.000005464509,0.00009645285,0.00005177348,0.004458227,0.0003338665,0.9917969,0.003036312,0.000006275639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4472799,0.003693944,0.1671284,0.005930352,0.0006430699,0.0001186552,0.001000011,0.0006659101,0.3735397],"genre_scores_gemma":[0.9664374,0.0008183502,0.01677999,0.0004162186,0.0002387256,0.0001826338,0.0002000968,0.00006660729,0.01486002],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009532367,"threshold_uncertainty_score":0.0318889,"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","authors":[{"name":"Hamed Hatami","is_ca":true},{"name":"James Hirst","is_ca":true},{"name":"Serguei Norine","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00148556,0.0008935026,0.001225833,0.002950417,0.002915589,0.003364981,0.001832133,0.001378806,0.00936081],"category_scores_gemma":[0.005988488,0.0009040112,0.001422031,0.001394544,0.005366543,0.01068435,0.004870515,0.005279138,0.0007478181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001538632,"about_ca_system_score_gemma":0.0005649449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008593762,"about_ca_topic_score_gemma":0.00084763,"domain_scores_codex":[0.9987767,0.00028597,0.00006412416,0.0002814194,0.0003673777,0.0002242907],"domain_scores_gemma":[0.9950632,0.003066248,0.0002635188,0.0005294489,0.0004162796,0.0006612825],"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.00002176043,0.00002321065,0.0001873752,0.00002408743,0.000004583879,0.00009744352,0.0003056841,0.0002121569,0.000403825,0.9956797,0.0005578139,0.002482375],"study_design_scores_gemma":[0.00001027497,0.000008119869,0.0001560395,0.00001188758,0.000007085843,0.0001064038,0.00007765791,0.0008957682,0.000381016,0.9965581,0.001781337,0.000006252847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5611337,0.003433614,0.1271844,0.005627738,0.0006522348,0.00006957536,0.0004521021,0.0009392082,0.3005074],"genre_scores_gemma":[0.9618014,0.001086032,0.01321168,0.0007378465,0.0004650785,0.00005214417,0.0003388169,0.0002469065,0.02206015],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00936081,"threshold_uncertainty_score":0.03131509,"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","authors":[{"name":"Colin McDiarmid","is_ca":false},{"name":"Bruce Reed","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008302242,0.0008522941,0.002019182,0.003479309,0.001288781,0.002736654,0.00257556,0.002185313,0.003450923],"category_scores_gemma":[0.06484288,0.001036472,0.0008041752,0.002105835,0.007677185,0.006918883,0.002707534,0.002115957,0.0006231875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002279043,"about_ca_system_score_gemma":0.0006415662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001631123,"about_ca_topic_score_gemma":0.001123558,"domain_scores_codex":[0.9958813,0.002296038,0.00009468804,0.0007800597,0.0005689177,0.0003789288],"domain_scores_gemma":[0.9279466,0.06059746,0.003520939,0.004930258,0.00149643,0.001508383],"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.000773975,0.00007535025,0.00822165,0.0003023446,0.0001451709,0.0004361591,0.0005859892,0.2203577,0.005176772,0.7411538,0.004375116,0.01839595],"study_design_scores_gemma":[0.0001993123,0.0001721573,0.003523505,0.0001357638,0.00008194413,0.000571825,0.0001938045,0.5255501,0.002494974,0.4646042,0.002360116,0.0001124243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6529448,0.001746184,0.3234487,0.006125655,0.0001364828,0.0002029229,0.001086022,0.0005556734,0.01375357],"genre_scores_gemma":[0.9801768,0.001227451,0.01396952,0.0003858394,0.0002490625,0.0003235649,0.0004140392,0.0001242038,0.003129515],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008302242,"threshold_uncertainty_score":0.04390699,"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","authors":[{"name":"Karen Meagher","is_ca":true},{"name":"Lucia Moura","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00490891,0.0008989761,0.002016864,0.002638964,0.003227851,0.004029648,0.002438466,0.001428939,0.007908099],"category_scores_gemma":[0.01619821,0.0009021887,0.002200225,0.002626562,0.004642163,0.01093411,0.005064177,0.004260267,0.001183328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003028491,"about_ca_system_score_gemma":0.00096506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001263769,"about_ca_topic_score_gemma":0.001157115,"domain_scores_codex":[0.9965501,0.0007357385,0.0002817854,0.0009108226,0.0008750687,0.0006464769],"domain_scores_gemma":[0.988152,0.006361593,0.001373689,0.002204888,0.001069044,0.0008387239],"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.00005583275,0.00001816963,0.0007127731,0.00007307111,0.00002204442,0.00007559863,0.0003031317,0.004365453,0.0007774505,0.9873407,0.001589577,0.00466616],"study_design_scores_gemma":[0.00004460988,0.00004261319,0.0008205971,0.00003763445,0.0000426427,0.0003090002,0.0002078902,0.03061994,0.001691326,0.9587914,0.007353039,0.00003940467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3500411,0.002559972,0.561242,0.003485079,0.0003392814,0.0002462282,0.001173742,0.0005405686,0.08037213],"genre_scores_gemma":[0.8824854,0.002507058,0.09812113,0.001049215,0.0005697152,0.0005181344,0.001165346,0.0002073363,0.01337657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007908099,"threshold_uncertainty_score":0.02645522,"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)","authors":[{"name":"Karen Meagher","is_ca":true},{"name":"Pablo Spiga","is_ca":false},{"name":"Pham Huu Tiep","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001908746,0.0009219417,0.001749017,0.002863275,0.002761964,0.003478046,0.001659898,0.001835283,0.008436639],"category_scores_gemma":[0.004585311,0.0006743257,0.001701424,0.001993916,0.004914487,0.01109818,0.005040667,0.004549021,0.001326863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001517446,"about_ca_system_score_gemma":0.000700852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007794165,"about_ca_topic_score_gemma":0.0005449867,"domain_scores_codex":[0.9986909,0.0002867133,0.0001006942,0.0004045188,0.0003096924,0.0002075595],"domain_scores_gemma":[0.9969376,0.001715568,0.0002972417,0.0004214905,0.0003062706,0.0003218249],"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.00002805218,0.00001462513,0.0001521744,0.00004477407,0.000009747473,0.00004299245,0.0002055498,0.0003843732,0.0004411008,0.9940547,0.001194616,0.003427317],"study_design_scores_gemma":[0.0000145437,0.000009490828,0.0001425419,0.00001102764,0.00001264801,0.00007108203,0.0000466138,0.001197363,0.0002134721,0.9937605,0.004510164,0.00001052605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3561996,0.005512893,0.3300355,0.01140717,0.001201528,0.0001499738,0.00123691,0.0007893462,0.2934671],"genre_scores_gemma":[0.9154422,0.003196283,0.03759642,0.002165115,0.001215967,0.0002577592,0.000637788,0.0002711297,0.03921745],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008436639,"threshold_uncertainty_score":0.0282234,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}