{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":98,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":98,"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":"8b3ede01295f","filters":{"venue":"COMBINATORICA"}},"results":[{"id":"W2005117665","doi":"10.1007/s00493-007-0041-6","title":"Vertex-Colouring Edge-Weightings","year":2007,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":114,"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; Mathematics; Vertex (graph theory); Graph; Neighbourhood (mathematics); Discrete mathematics","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"Colin McDiarmid","is_ca":false},{"name":"Bruce A. Reed","is_ca":true},{"name":"Andrew Thomason","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008634628087088286,"gpt":0.2209593519140212,"spread":0.212324723826933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006455652,0.0001271087,0.0001408406,0.0001547117,0.0002261679,0.00009031363,0.0007240601,0.00007194352,0.000008732624],"category_scores_gemma":[0.00007169175,0.0001179317,0.0000648182,0.0007090719,0.00003539945,0.0002138531,0.0002686653,0.0001717643,0.0002052926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004928097,"about_ca_system_score_gemma":0.00003357191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001504274,"about_ca_topic_score_gemma":6.30595e-7,"domain_scores_codex":[0.9986801,0.00002181594,0.0002394398,0.0003480694,0.0002812766,0.0004293713],"domain_scores_gemma":[0.9989561,0.0001351911,0.00007741354,0.0005378476,0.0001123273,0.000181072],"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.00000257324,0.0001060412,0.001029968,0.000007622697,0.000007824154,0.00004204517,0.0002533266,0.000002624418,0.001348594,0.9784638,0.005196632,0.01353901],"study_design_scores_gemma":[0.001134917,0.000212972,0.004943012,0.00005181597,0.000009461482,0.00004318994,0.00002361358,0.003186622,0.0269895,0.9203276,0.04257058,0.000506721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7437551,0.002243392,0.145215,0.002860804,0.008947708,0.0004003305,5.249224e-7,0.0024001,0.09417707],"genre_scores_gemma":[0.9911656,0.000009221741,0.007836455,0.000416423,0.00000685636,0.000003379687,4.570421e-7,0.00001004108,0.0005515236],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2474105,"threshold_uncertainty_score":0.4809116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975999171","doi":"10.1007/s00493-007-2163-2","title":"Birth control for giants","year":2007,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":107,"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; Random graph; Giant component; Logarithm; Vertex (graph theory); Connected component; Branching process; Graph; Discrete mathematics; Mathematical analysis","authors":[{"name":"Joel Spencer","is_ca":false},{"name":"Nicholas Wormald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.041606537222897,"gpt":0.3384212520650978,"spread":0.2968147148422008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003864802,0.000108895,0.0002128307,0.00004092618,0.00009367276,0.00001639034,0.0001541498,0.00006877547,0.00004221466],"category_scores_gemma":[0.002294094,0.0000948236,0.00005522158,0.0001353256,0.00001841032,0.00002852516,0.000019733,0.00007852342,0.00002566887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004314476,"about_ca_system_score_gemma":0.00002777685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.72237e-7,"about_ca_topic_score_gemma":9.764835e-7,"domain_scores_codex":[0.9990977,0.000007117063,0.0002348106,0.0001657805,0.0001622272,0.0003323426],"domain_scores_gemma":[0.9976772,0.001789882,0.00007387493,0.000180351,0.0001522332,0.0001264573],"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.00005856635,0.0001173115,0.00001349108,0.00009064858,0.0000161432,0.000006054913,0.00003667686,6.735139e-8,0.00007847876,0.9896824,0.003815317,0.006084794],"study_design_scores_gemma":[0.001462332,0.0002296576,0.00006035184,0.00001483957,0.00002975232,0.00000440175,0.00003174213,0.001479614,0.0004400506,0.9875947,0.008520814,0.0001316924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001285014,0.00008624581,0.9946955,0.0001204473,0.000535252,0.0003401575,0.00003032654,0.00009494031,0.002812132],"genre_scores_gemma":[0.9767494,0.000002518581,0.02236158,0.0001601356,0.00006714524,0.00003154437,0.000001441311,0.00002530797,0.0006009372],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9754644,"threshold_uncertainty_score":0.3866794,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963931974","doi":"10.1007/s00493-006-0034-x","title":"Local Chromatic Number, KY Fan's Theorem, And Circular Colorings","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Brooks' theorem; Chromatic scale; Upper and lower bounds; Chordal graph; Discrete mathematics; Conjecture; Indifference graph; Bipartite graph; Vertex (graph theory); Graph; 1-planar graph","authors":[{"name":"Gábor Simonyi","is_ca":false},{"name":"Gábor Tardos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006010356126772413,"gpt":0.205593870588508,"spread":0.1995835144617356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002011421,0.0001403162,0.0002458815,0.0001467086,0.0001595055,0.0001464824,0.0006728078,0.00007195384,0.00006470035],"category_scores_gemma":[0.00005636137,0.000111546,0.00007079636,0.001845196,0.0001462767,0.0002505226,0.000396017,0.0001122332,0.0001698707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005200079,"about_ca_system_score_gemma":0.00001715369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001885629,"about_ca_topic_score_gemma":0.000001130704,"domain_scores_codex":[0.9987769,0.00005445472,0.0002081271,0.0003928027,0.0002745398,0.0002932319],"domain_scores_gemma":[0.9991415,0.0001525601,0.00007344606,0.0004746101,0.00004850825,0.0001093962],"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.000001027684,0.0001448172,0.003234786,0.000013694,0.00001823357,0.00004840393,0.00002058414,0.000005904228,0.00003585307,0.9848076,0.001853125,0.00981602],"study_design_scores_gemma":[0.0006938111,0.0001454019,0.03412862,0.0000118901,0.00004348614,0.0000651083,0.00002714166,0.006240409,0.0008275301,0.9056605,0.05173771,0.0004184458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2629461,0.001742856,0.6884452,0.002171813,0.0004542445,0.0002239991,0.000006274484,0.0005191928,0.04349037],"genre_scores_gemma":[0.9979063,0.00003234212,0.001327219,0.0001337836,0.00001853912,0.00001067845,0.00000515647,0.0000049615,0.0005610485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7349601,"threshold_uncertainty_score":0.4548716,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001971812,0.0001026471,0.0001491307,0.0001266523,0.0001079557,0.0000187501,0.00009761569,0.00007846775,0.00009989089],"category_scores_gemma":[0.000212042,0.00008627402,0.00003987169,0.0002303645,0.00006970917,0.00007847054,0.0000747913,0.000204333,0.00000370285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003090693,"about_ca_system_score_gemma":0.000008696253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009852841,"about_ca_topic_score_gemma":0.000003585817,"domain_scores_codex":[0.999337,0.00004730073,0.0001589692,0.0001591795,0.0001335406,0.0001639782],"domain_scores_gemma":[0.9993671,0.0003150633,0.00005031257,0.0001755264,0.00003722322,0.00005473072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002017033,0.00006449544,0.03084671,0.00001193099,0.00001095744,0.0000306201,0.0004348062,1.410235e-7,0.00002194171,0.9658552,0.00175651,0.0009464782],"study_design_scores_gemma":[0.0003977663,0.00002816445,0.01679463,0.0000166591,0.00000746595,0.00005299396,0.00007951596,0.00002748749,0.00005047086,0.9750748,0.007361968,0.0001081269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9878965,0.0002428903,0.0001746958,0.0001640203,0.000361224,0.0000843302,8.438802e-7,0.00004520753,0.01103027],"genre_scores_gemma":[0.999106,0.000111019,0.0003082935,0.0001312666,0.00002013145,0.000007963655,6.908156e-7,0.00001325981,0.000301296],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01405208,"threshold_uncertainty_score":0.3518152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159330890","doi":"10.1007/s00493-006-0030-1","title":"Packing Non-Zero A-Paths In Group-Labelled Graphs","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Vertex (graph theory); Abelian group; Zero (linguistics); Induced path; Integer (computer science); Path (computing); Graph; Matching (statistics); Discrete mathematics; Group (periodic table); Longest path problem; Shortest path problem","authors":[{"name":"Maria Chudnovsky","is_ca":false},{"name":"Jim Geelen","is_ca":true},{"name":"Bert Gerards","is_ca":false},{"name":"Luis Goddyn","is_ca":true},{"name":"Michael Lohman","is_ca":false},{"name":"Paul Seymour","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003633343370027868,"gpt":0.1708830790441692,"spread":0.1672497356741413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002102691,0.0001832869,0.0002471377,0.0002022202,0.00006623653,0.00003201321,0.0001976407,0.0001092951,0.00001898603],"category_scores_gemma":[0.000007363179,0.0001920604,0.0000791352,0.000664852,0.00002434452,0.0001050274,0.00002548488,0.0001989733,0.00007160333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007034172,"about_ca_system_score_gemma":0.000004534652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006494675,"about_ca_topic_score_gemma":0.00001437611,"domain_scores_codex":[0.9989975,0.00004242603,0.0002873831,0.0001840067,0.0001393706,0.0003493052],"domain_scores_gemma":[0.9995589,0.00005749248,0.00003083625,0.0002798893,0.00001791922,0.0000549099],"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.00001741995,0.0003423212,0.04561594,0.0001975468,0.00004491395,0.0001405432,0.0005003359,0.001622032,0.01272444,0.9283365,0.008419693,0.002038303],"study_design_scores_gemma":[0.004342583,0.0001648841,0.05553648,0.000277285,0.00003437678,0.00002722715,0.0001726332,0.007582218,0.006563864,0.889198,0.03478643,0.001314032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9554579,0.001268339,0.0007906072,0.00001194664,0.001418483,0.0002190794,0.000002184145,0.0003660486,0.04046543],"genre_scores_gemma":[0.9996481,0.00002468643,0.00003474448,0.00001072991,0.00003058675,0.00004659251,0.000007873276,0.00003970034,0.0001569691],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04419024,"threshold_uncertainty_score":0.7831995,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136175864","doi":"10.1007/s00493-015-3070-6","title":"Nonrepetitive colouring via entropy compression","year":2015,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Mathematical proof; Discrete mathematics; Geometry","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"Gwenaël Joret","is_ca":false},{"name":"Jakub Kozik","is_ca":false},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03185615255852178,"gpt":0.2947517760005615,"spread":0.2628956234420397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003918369,0.0001303259,0.0001682028,0.0001245395,0.0001453913,0.0000834391,0.001130446,0.0000521914,0.00001198467],"category_scores_gemma":[0.0001569272,0.0001202627,0.00005130407,0.0005925919,0.00007772763,0.0004481626,0.0007642724,0.0002315242,0.0002539132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001679709,"about_ca_system_score_gemma":0.00007804202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007085982,"about_ca_topic_score_gemma":2.702246e-7,"domain_scores_codex":[0.9983867,0.0001899076,0.0001559984,0.0003759335,0.0005002089,0.0003911997],"domain_scores_gemma":[0.9985034,0.0001811477,0.00006902974,0.0006586281,0.0002580204,0.0003297688],"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.00003601214,0.0002164864,0.001404825,0.000007907192,0.00001420168,0.0001056098,0.0005869604,0.00006646179,0.002606569,0.9849625,0.002440158,0.007552343],"study_design_scores_gemma":[0.00158501,0.0004298131,0.001187121,0.0000335713,0.000003611475,0.00003551082,0.00006300936,0.01824957,0.02375843,0.9260399,0.0282704,0.0003440375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0289695,0.0004590804,0.9533306,0.0007671298,0.001260886,0.0003239682,0.000001119246,0.000458812,0.01442894],"genre_scores_gemma":[0.988547,0.00001025786,0.01067921,0.00008496622,0.00003385147,0.00002590247,0.000001347485,0.00001246711,0.000604954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9595776,"threshold_uncertainty_score":0.490417,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122404357","doi":"10.1007/s00493-014-2806-z","title":"A minimum degree condition forcing complete graph immersion","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Disjoint sets; Simple graph; Immersion (mathematics); Complement graph; Graph power; Line graph; Geometry","authors":[{"name":"Matt DeVos","is_ca":true},{"name":"Zdenĕk Dvořák","is_ca":false},{"name":"Jacob Fox","is_ca":false},{"name":"Jessica McDonald","is_ca":false},{"name":"Bojan Mohar","is_ca":true},{"name":"Diego Scheide","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03635824512445577,"gpt":0.2841506765625666,"spread":0.2477924314381108,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004967774,0.0001614164,0.0002045138,0.000257436,0.0003429629,0.00009507691,0.001122373,0.00006430403,0.00002039161],"category_scores_gemma":[0.00009842054,0.0001575372,0.0001022282,0.0008628321,0.0001038525,0.0004851743,0.0003951031,0.0002230501,0.0002148319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007179369,"about_ca_system_score_gemma":0.00002453457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006287492,"about_ca_topic_score_gemma":5.420615e-7,"domain_scores_codex":[0.9982375,0.0002066209,0.0002090906,0.000455298,0.0004198662,0.0004716516],"domain_scores_gemma":[0.9983999,0.0003686129,0.00009854219,0.0008087997,0.0001410853,0.0001831332],"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.00001166554,0.00006977523,0.0004239978,0.00001639047,0.0000126336,0.000008085027,0.000122271,0.00001384956,0.005375244,0.9737375,0.001897491,0.01831112],"study_design_scores_gemma":[0.001268769,0.0004164445,0.00275922,0.00003394314,0.000006840331,0.00002032242,0.00003703835,0.02447244,0.004031598,0.9537268,0.01286459,0.0003619883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04055606,0.0001572188,0.9466892,0.000666415,0.0007168015,0.0002580715,0.000002185038,0.0002856072,0.01066843],"genre_scores_gemma":[0.9940495,0.00001257977,0.00547874,0.0002007245,0.00002843136,0.00002507883,0.000006959541,0.00001537495,0.0001825896],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9534935,"threshold_uncertainty_score":0.6424179,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001904214,0.0001399616,0.0002373618,0.0001724098,0.0001474657,0.00002711963,0.0001437425,0.00009323024,0.00001058149],"category_scores_gemma":[0.0001498025,0.0001189708,0.00004212005,0.0002860044,0.00005493391,0.00007620491,0.00003777726,0.0001619057,9.827257e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000303815,"about_ca_system_score_gemma":0.000006141777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000490299,"about_ca_topic_score_gemma":0.000001680158,"domain_scores_codex":[0.9991612,0.00006900541,0.0002143664,0.000203505,0.0001266241,0.0002252618],"domain_scores_gemma":[0.9993289,0.0002756672,0.00006379882,0.0002393739,0.00002598507,0.00006627045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001614358,0.00006790925,0.002817538,0.00001721292,0.000007913251,0.00001594743,0.001145847,1.769475e-7,0.0004284659,0.9932929,0.000461384,0.001728582],"study_design_scores_gemma":[0.0007003539,0.00009126512,0.0288198,0.00003762804,0.00001023315,0.000008152142,0.00009199074,0.00002702979,0.0008473497,0.9688726,0.0003369795,0.000156594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9925133,0.000500165,0.00002870553,0.000105597,0.0002440462,0.0001334401,0.000001300592,0.0001010611,0.006372385],"genre_scores_gemma":[0.9992325,0.000108825,0.0004505211,0.0001106283,0.00001478774,0.00000458808,0.000001212442,0.0000118899,0.00006508412],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02600227,"threshold_uncertainty_score":0.485149,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976459503","doi":"10.1007/s00493-006-0016-z","title":"Network Design Via Iterative Rounding Of Setpair Relaxations","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Rounding; Mathematics; Combinatorics; Linear programming relaxation; Vertex (graph theory); Omega; Approximation algorithm; Discrete mathematics; Relaxation (psychology); Linear programming; Integer (computer science); Network planning and design; Vertex connectivity; Undirected graph; Graph; Mathematical optimization; Computer science","authors":[{"name":"Joseph Cheriyan","is_ca":true},{"name":"Santosh Vempala","is_ca":false},{"name":"Adrian Vetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02367530720691067,"gpt":0.2316478668460641,"spread":0.2079725596391535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002897901,0.0001172474,0.0001749007,0.0000930883,0.0002741073,0.00007838882,0.0006060371,0.00004907018,0.000009325518],"category_scores_gemma":[0.00002888054,0.0001181419,0.00007021687,0.00107727,0.00006006178,0.0003257194,0.0001737944,0.0001296919,0.00001416229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006817431,"about_ca_system_score_gemma":0.0000453693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003763041,"about_ca_topic_score_gemma":0.000001395704,"domain_scores_codex":[0.9988832,0.0001320351,0.000265245,0.000248146,0.0002189627,0.0002524278],"domain_scores_gemma":[0.9988989,0.0003572599,0.0001589307,0.0004212453,0.0001189532,0.00004472723],"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.000002211102,0.0001277732,0.0006677266,0.000005700066,0.00001072249,0.000006174886,0.0001857278,0.002847337,0.00008642695,0.9864533,0.007499187,0.002107737],"study_design_scores_gemma":[0.0002604678,0.0001582088,0.002639405,0.00002601967,0.000006304192,0.000008220586,0.000005599462,0.07740851,0.0006690451,0.9153274,0.003321305,0.0001695408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009395464,0.0003247337,0.9940106,0.0002690574,0.0007191065,0.0001416428,9.517996e-7,0.0001491694,0.003445172],"genre_scores_gemma":[0.8399587,0.000003987783,0.1596082,0.00005401278,0.00007833574,0.00001598445,0.000002852886,0.000006914194,0.0002710375],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8390192,"threshold_uncertainty_score":0.4817685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031397195","doi":"10.1007/s00493-008-2099-1","title":"Near optimal bounds for the Erdős distinct distances problem in high dimensions","year":2008,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":53,"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 Hospital","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Set (abstract data type)","authors":[{"name":"József Solymosi","is_ca":true},{"name":"Van H. Vu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01800579098325257,"gpt":0.2402405108747772,"spread":0.2222347198915246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001879985,0.00009941212,0.0001152776,0.00004826676,0.0006501177,0.0001029488,0.0004530228,0.00003115759,0.000003896805],"category_scores_gemma":[0.00005809893,0.00007386631,0.00004889917,0.0006576594,0.00007011553,0.0002287068,0.0001227111,0.00009054718,0.00001011206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006249382,"about_ca_system_score_gemma":0.0001288692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002483993,"about_ca_topic_score_gemma":0.000006585833,"domain_scores_codex":[0.999096,0.00003717827,0.000187322,0.0002620733,0.0002077868,0.0002096089],"domain_scores_gemma":[0.9991151,0.000401928,0.00006126355,0.0002742334,0.00009638207,0.0000511117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002829372,0.0003936172,0.003213874,0.00001916707,0.00002358743,0.00002081135,0.001236732,0.02345925,0.00007203709,0.9482782,0.01254129,0.01071308],"study_design_scores_gemma":[0.002098328,0.0004754686,0.08597033,0.00002945563,0.00001671518,0.00005075854,0.00003272578,0.5711783,0.0004877927,0.1437103,0.1954235,0.0005263565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2939822,0.000969353,0.699911,0.002926603,0.001072878,0.0005274583,0.000005545634,0.0001121686,0.0004928476],"genre_scores_gemma":[0.9711699,0.00002609378,0.02814004,0.00008837301,0.00004552262,0.0001037159,0.000009651606,0.000005655022,0.0004110066],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.804568,"threshold_uncertainty_score":0.5000246,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002865261,0.0001259232,0.000485831,0.0001569323,0.00002827269,0.000004276228,0.0002186789,0.0001138181,0.00001727587],"category_scores_gemma":[0.0002136719,0.00009210276,0.00009825185,0.0002677969,0.00006134832,0.00003047363,0.00004818413,0.0001392713,7.948347e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004255139,"about_ca_system_score_gemma":0.00002524046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004356489,"about_ca_topic_score_gemma":0.000001679473,"domain_scores_codex":[0.9989783,0.0001250185,0.0004328266,0.0001358149,0.000184223,0.0001438325],"domain_scores_gemma":[0.9988878,0.000452221,0.0002319562,0.0003519605,0.00004296748,0.00003306588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004359746,0.0002354653,0.000168748,0.000398929,0.00003125742,0.000002846917,0.001321359,0.00002885373,0.00002297909,0.9898502,0.0004113106,0.007484427],"study_design_scores_gemma":[0.002508785,0.0005272529,0.0001839113,0.0005161794,0.00005636577,0.00001182831,0.0002664685,0.000212361,0.006716207,0.9670172,0.02171649,0.0002669529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9637302,0.02162059,0.00008511951,0.00008885076,0.0005821958,0.000989951,0.00002486099,0.00005281928,0.01282537],"genre_scores_gemma":[0.9994661,0.0001560585,0.0001997546,0.000008282302,0.00002682827,0.00001519423,7.83924e-7,0.00001581271,0.0001112426],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0357358,"threshold_uncertainty_score":0.3755842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042875854","doi":"10.1007/s00493-014-2959-9","title":"Many non-equivalent realizations of the associahedron","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Liquid Crystal Research Advancements","field":"Materials Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Modulo; Polytope; Equivalence (formal languages); Isometry (Riemannian geometry); Type (biology); Cluster algebra; Realization (probability); Polyhedron","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01425849365513881,"gpt":0.2803604050093274,"spread":0.2661019113541885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000444988,0.00007340405,0.0001241719,0.0000282148,0.0001493731,0.00002349411,0.0005543829,0.00003300877,0.0001833465],"category_scores_gemma":[0.0005768658,0.00005232108,0.0000479941,0.0002550482,0.00009331181,0.0001014577,0.0003277264,0.00007106547,0.00008555883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000137564,"about_ca_system_score_gemma":0.00005273867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000298481,"about_ca_topic_score_gemma":0.000001885138,"domain_scores_codex":[0.9987504,0.0001254573,0.0001879403,0.0001609774,0.0005201608,0.0002550345],"domain_scores_gemma":[0.9990832,0.00009438563,0.0001254842,0.0004830161,0.0001405891,0.00007327909],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001904016,0.0003802089,0.006648861,0.00008969432,0.00001200488,0.00000101006,0.0002432343,0.00008582143,0.766708,0.2129169,0.01208722,0.0008080759],"study_design_scores_gemma":[0.001665313,0.0005271731,0.03734478,0.0001337334,0.0000295085,0.00000196975,0.00007329584,0.001467016,0.7416995,0.1087824,0.1079263,0.0003490711],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9571866,0.00005933643,0.007011437,0.000852529,0.001332877,0.000441388,0.00001985375,0.00005878548,0.03303714],"genre_scores_gemma":[0.9976377,0.00001249052,0.000137082,0.00005431796,0.000022202,0.00002167971,0.000001798037,0.00001057933,0.002102164],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1041345,"threshold_uncertainty_score":0.2133592,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051714857","doi":"10.1007/s00493-006-0015-0","title":"COLORING SUBGRAPHS OF THE RADO GRAPH","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"semigroups and automata theory","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Countable set; Homogeneous; Element (criminal law); Graph; Binary number; Discrete mathematics; Class (philosophy); Arithmetic; Computer science","authors":[{"name":"N. Sauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003797364287851082,"gpt":0.1708380735128877,"spread":0.1670407092250367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001693118,0.00008175478,0.000115943,0.00005897282,0.0001142114,0.00003532634,0.00109439,0.00003397547,0.000005267156],"category_scores_gemma":[0.00001420389,0.00005741133,0.0001030623,0.0007997203,0.00006626483,0.0001289791,0.0002557133,0.00008123028,0.000006759581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001876118,"about_ca_system_score_gemma":0.00002234872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004947462,"about_ca_topic_score_gemma":0.000001186757,"domain_scores_codex":[0.9992375,0.00004995389,0.0001626515,0.0001723144,0.000203692,0.0001738879],"domain_scores_gemma":[0.9991354,0.00008508583,0.00009500766,0.0006173902,0.00004160027,0.00002548388],"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":[7.82803e-7,0.00006801966,0.004744194,0.0000061079,0.000003974205,0.000001850232,0.00004487119,0.000008122217,0.001240249,0.9911889,0.001802071,0.0008908297],"study_design_scores_gemma":[0.0004408786,0.00005240297,0.07431404,0.00002716838,0.000007400064,0.000008832189,0.00001470356,0.001330608,0.03370021,0.8786252,0.01130206,0.0001764659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9316599,0.001650384,0.0278443,0.001088111,0.003079719,0.0002983906,0.000002430318,0.0004151634,0.03396158],"genre_scores_gemma":[0.9991861,0.000007391084,0.0005396258,0.00005514658,0.00001711389,0.000006148068,2.6974e-7,0.000005220638,0.0001829847],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1125637,"threshold_uncertainty_score":0.2341166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039034730","doi":"10.1007/s00493-005-0013-7","title":"Matroid Matching Via Mixed Skew-Symmetric Matrices","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":38,"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; Matroid; Rank (graph theory); Matching (statistics); Discrete mathematics; Matrix (chemical analysis); Bipartite graph; Cardinality (data modeling); Skew; Graph","authors":[{"name":"James F. Geelen","is_ca":true},{"name":"Satoru Iwata","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00494074972957487,"gpt":0.1859508627076843,"spread":0.1810101129781094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002131853,0.000208321,0.0002475997,0.0002929188,0.0001202554,0.00006114016,0.0003168392,0.0001058445,0.00008448395],"category_scores_gemma":[0.00001054419,0.0002093945,0.0001095073,0.0008491607,0.00001664433,0.0002058682,0.00004038327,0.0002128224,0.0008330196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001071166,"about_ca_system_score_gemma":0.000005856561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001257667,"about_ca_topic_score_gemma":0.000001619541,"domain_scores_codex":[0.9989064,0.000048767,0.0002899648,0.0001869975,0.0002048944,0.000362977],"domain_scores_gemma":[0.9993815,0.00008990258,0.00004621813,0.0003288138,0.0000278963,0.0001256479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000375185,0.0005353516,0.001832109,0.0008656611,0.0004402379,0.0000865549,0.003307567,0.007254814,0.01706886,0.8348004,0.03797628,0.09579469],"study_design_scores_gemma":[0.0037751,0.0003044627,0.008044896,0.0002558129,0.0002198498,0.0002956182,0.0009843075,0.02679341,0.03674702,0.3816445,0.5377843,0.003150648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9392108,0.008839377,0.007682289,0.00009807719,0.002772691,0.0002462628,0.000005666582,0.001419626,0.03972524],"genre_scores_gemma":[0.9988807,0.00009145372,0.000442396,0.0000275177,0.0001686187,0.00001701587,0.000004137094,0.0000520175,0.0003161741],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.499808,"threshold_uncertainty_score":0.9999449,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115859130","doi":"10.1007/s00493-005-0010-x","title":"List Colouring When The Chromatic Number Is Close To the Order Of The Graph","year":2004,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":37,"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; Mathematics; Chromatic scale; Conjecture; Graph; Order (exchange); Discrete mathematics","authors":[{"name":"Bruce Reed","is_ca":true},{"name":"Benny Sudakov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005272078131285529,"gpt":0.1907843727440453,"spread":0.1855122946127598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002534737,0.0001352646,0.0001546662,0.00002286919,0.0002282902,0.00003545664,0.0006496873,0.0000515572,0.00006802844],"category_scores_gemma":[0.00003808648,0.00006752262,0.0001098454,0.0005934356,0.00006681924,0.00004181604,0.00008541276,0.0001815259,0.00009678119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004983519,"about_ca_system_score_gemma":0.00001654453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000555858,"about_ca_topic_score_gemma":0.00001632614,"domain_scores_codex":[0.9991902,0.00006864823,0.0002153503,0.0001098977,0.000207514,0.0002083945],"domain_scores_gemma":[0.9990993,0.00008387593,0.00004616095,0.0006797372,0.0000472329,0.00004372058],"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.00001524045,0.0001921173,0.004097581,0.0002731935,0.0003226961,0.00000597521,0.02674711,0.004470918,0.002055773,0.9198275,0.04157763,0.0004142295],"study_design_scores_gemma":[0.001717034,0.0001210442,0.01641962,0.0004952466,0.0001728605,0.00006453208,0.00199078,0.0003805451,0.02355467,0.7285222,0.2258533,0.0007081089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.981311,0.0004466349,0.0001790567,0.00216447,0.001462286,0.000519596,0.000005565006,0.0001092881,0.01380208],"genre_scores_gemma":[0.9992985,0.00001068254,0.00002020548,0.0002324364,0.00003920019,0.00005795716,3.046331e-7,0.00002474817,0.0003159968],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1913053,"threshold_uncertainty_score":0.2753493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964031838","doi":"10.1007/s00493-011-1687-5","title":"Packing directed circuits exactly","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"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":"Disjoint sets; Cardinality (data modeling); Combinatorics; Mathematics; Set (abstract data type); Electronic circuit; Characterization (materials science); Property (philosophy); Discrete mathematics; Minor (academic); Computer science; Law","authors":[{"name":"Bertrand Guenin","is_ca":true},{"name":"Robin Thomas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05387108488223161,"gpt":0.2716083792830004,"spread":0.2177372944007687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002799415,0.0001338765,0.0001554493,0.0001695968,0.0001708009,0.00005928344,0.001445303,0.00005573043,0.00006198495],"category_scores_gemma":[0.0001474537,0.0001293332,0.00005966934,0.001101499,0.00006712953,0.000503168,0.0003953928,0.0002198878,0.0002266225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006578334,"about_ca_system_score_gemma":0.00004855208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009467503,"about_ca_topic_score_gemma":4.600065e-7,"domain_scores_codex":[0.998538,0.0001257133,0.0001600837,0.0004004733,0.0003217117,0.0004540519],"domain_scores_gemma":[0.9986076,0.0001296382,0.00006294737,0.0008734551,0.0001483641,0.0001779786],"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.000003423038,0.0001511098,0.00239891,0.000007732951,0.00001490429,0.00006894783,0.0009741467,2.99589e-7,0.0008604564,0.9518486,0.0005081789,0.04316328],"study_design_scores_gemma":[0.0005542566,0.0001971175,0.02143553,0.00002234295,0.000004077141,0.0000236637,0.00002567935,0.00107131,0.01707023,0.952495,0.006709779,0.0003910565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07820483,0.001207813,0.5640001,0.0002869735,0.002690321,0.0006933578,0.000002454275,0.003890947,0.3490232],"genre_scores_gemma":[0.9951135,0.00001745396,0.004262673,0.00006843783,0.00001554972,0.00002201878,5.526029e-7,0.00001580461,0.0004840041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9169087,"threshold_uncertainty_score":0.5274056,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969083090","doi":"10.1007/s004930070004","title":"On Cayley Graphs on the Symmetric Group Generated by Tranpositions","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph theory and applications","field":"Mathematics","cited_by":32,"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":"Combinatorics; Cayley graph; Mathematics; Bipartite graph; Symmetric group; Conjecture; Graph; Eigenvalues and eigenvectors; Discrete mathematics","authors":[{"name":"Joel Friedman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02224890202459132,"gpt":0.2555700609254552,"spread":0.2333211589008639,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001644534,0.0001553106,0.0001406278,0.000102939,0.0005022352,0.00003658719,0.0003050746,0.00006515635,0.0006093845],"category_scores_gemma":[0.0000569841,0.0001100126,0.0001054432,0.001365515,0.00006205685,0.0000305676,0.000008246109,0.0002372304,0.0003267905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000340372,"about_ca_system_score_gemma":0.000006945721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005397775,"about_ca_topic_score_gemma":9.359989e-7,"domain_scores_codex":[0.9990485,0.0001433463,0.0001841202,0.000224918,0.0001888129,0.0002102759],"domain_scores_gemma":[0.9986199,0.0006876956,0.00004704912,0.0005342555,0.00003184879,0.00007926924],"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.000009590682,0.0007407152,0.000005633309,0.000003672043,0.0000227991,0.000001033335,0.00006375713,0.000002070281,0.0002459147,0.9251016,0.07269318,0.001109986],"study_design_scores_gemma":[0.000315602,0.000167691,0.0001981646,0.00001147966,0.00003418586,0.000002066681,0.00001366585,0.0000484397,0.00140348,0.9859139,0.01174554,0.0001457505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9447415,0.0000854393,0.00008942509,0.001256944,0.0000822115,0.0004160916,0.00004956777,0.0001798112,0.05309894],"genre_scores_gemma":[0.9974272,0.00005050082,0.00005128169,0.000591414,0.00001178344,0.000198366,0.00002911978,0.00002439044,0.001615911],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06094764,"threshold_uncertainty_score":0.6672333,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032198109","doi":"10.1007/s00493-008-2157-8","title":"An algorithm for packing non-zero A-paths in group-labelled graphs","year":2008,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":32,"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; Vertex (graph theory); Disjoint sets; Path (computing); Abelian group; Graph; Group (periodic table); Matching (statistics); Induced path; Zero (linguistics); Discrete mathematics; Algorithm; Longest path problem; Shortest path problem; Computer science","authors":[{"name":"Maria Chudnovsky","is_ca":false},{"name":"William H. Cunningham","is_ca":true},{"name":"Jim Geelen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02376304741433146,"gpt":0.2586423356285821,"spread":0.2348792882142506,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004197679,0.000272428,0.0003837286,0.0003901434,0.0005008682,0.0001072937,0.001576306,0.0001254588,0.000006146809],"category_scores_gemma":[0.00003317845,0.0002864658,0.000164247,0.001483777,0.0001152663,0.0006951499,0.0002541119,0.000275771,0.00001457457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008794863,"about_ca_system_score_gemma":0.00007097103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006646295,"about_ca_topic_score_gemma":0.000006561118,"domain_scores_codex":[0.9978061,0.00008838769,0.0003979508,0.0007145689,0.0003600366,0.0006329534],"domain_scores_gemma":[0.9983854,0.0002187443,0.0001192749,0.000939846,0.0001283493,0.0002083595],"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.00001744908,0.00232438,0.005148842,0.0000418114,0.00004679074,0.0002823388,0.002971631,0.00002741076,0.0004877612,0.5042565,0.002805366,0.4815896],"study_design_scores_gemma":[0.003751209,0.001173977,0.009552467,0.00005041936,0.000009090466,0.00008048987,0.00004269608,0.3836365,0.0008060572,0.5923803,0.007693621,0.000823151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03981626,0.0003318084,0.9564139,0.0001624394,0.001625167,0.0005861061,0.000007741158,0.000324529,0.0007321074],"genre_scores_gemma":[0.8261514,0.0000931208,0.1732409,0.00021337,0.00005264,0.0001378694,0.00001293261,0.0000265817,0.00007116362],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7863352,"threshold_uncertainty_score":0.9999588,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046052042","doi":"10.1007/s00493-006-0013-2","title":"Canonical Partitions Of Universal Structures","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Countable set; Combinatorics; Equivalence relation; Homogeneous; Equivalence (formal languages); Omega; Characterization (materials science); Discrete mathematics; Binary number; Equivalence class (music); Arithmetic","authors":[{"name":"C. Laflamme","is_ca":true},{"name":"N. Sauer","is_ca":true},{"name":"Vojkan Vuksanovic","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007565791298253982,"gpt":0.2151086045218966,"spread":0.2075428132236426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002501726,0.00005834628,0.00009349357,0.00003795384,0.00006320143,0.00001297079,0.000368757,0.0000308436,0.00001762102],"category_scores_gemma":[0.00001020499,0.00005220924,0.00003817253,0.0002762553,0.00005127569,0.0001331977,0.00009502238,0.0000626287,0.000007989491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003159548,"about_ca_system_score_gemma":0.00005031387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003664828,"about_ca_topic_score_gemma":0.000003767088,"domain_scores_codex":[0.9994786,0.00002132238,0.000109346,0.0001408629,0.0001143508,0.0001354626],"domain_scores_gemma":[0.9995626,0.00004662611,0.00004810125,0.0002617406,0.00004416723,0.0000368142],"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":[7.556956e-7,0.00004293162,0.0004801155,0.000002043449,0.000001996882,0.000006859243,0.00001821999,0.0001022425,0.0002510518,0.9971648,0.001382037,0.0005469783],"study_design_scores_gemma":[0.0002320527,0.00005874484,0.0127142,0.000002379069,0.000003015696,0.000004610594,0.000005597235,0.0004059628,0.002724015,0.9749373,0.00882996,0.00008223011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3371052,0.0008415082,0.5933576,0.001549044,0.001409003,0.0002271012,0.000008230849,0.000475682,0.06502657],"genre_scores_gemma":[0.9954699,0.000003237363,0.004297834,0.00002954221,0.00001837115,0.000001742867,0.000001605614,0.000002620332,0.0001751368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6583647,"threshold_uncertainty_score":0.2129031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3204767113","doi":"10.1007/s00493-023-00015-w","title":"Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"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":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Algorithm; Mathematics","authors":[{"name":"Alex Scott","is_ca":false},{"name":"Paul Seymour","is_ca":false},{"name":"Sophie Spirkl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03349660689747145,"gpt":0.3214901300657033,"spread":0.2879935231682318,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001185728,0.000286096,0.0003779455,0.0001271104,0.001761783,0.0007334794,0.002271393,0.0001195033,0.00001620876],"category_scores_gemma":[0.000683509,0.0002341125,0.0002981328,0.001460745,0.0002876467,0.0005220143,0.0007235616,0.0002620373,0.0001838044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000253645,"about_ca_system_score_gemma":0.0003318761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001965778,"about_ca_topic_score_gemma":0.000002854884,"domain_scores_codex":[0.997233,0.0001441796,0.0003909772,0.0006808442,0.0004761358,0.001074807],"domain_scores_gemma":[0.9960526,0.002304495,0.0001599364,0.001095359,0.0001869996,0.0002005788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003313452,0.0003256091,0.0004661152,0.0003146431,0.0002100128,0.00003375159,0.004517195,0.0001042887,0.00211514,0.2806177,0.6720652,0.03889899],"study_design_scores_gemma":[0.005662457,0.0009441336,0.001644306,0.0000928353,0.00004541484,0.00004039289,0.0003149998,0.3441873,0.001276691,0.3975782,0.2472627,0.0009504493],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6106458,0.0008704584,0.3415038,0.01391675,0.01425707,0.00958766,0.0001748438,0.002975832,0.006067806],"genre_scores_gemma":[0.9903269,0.00002310463,0.004910885,0.000226461,0.0002287202,0.001077933,0.00001746569,0.00006709283,0.003121459],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4248025,"threshold_uncertainty_score":0.9995378,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016667694","doi":"10.1007/s004930200014","title":"Ramsey Numbers for Trees of Small Maximum Degree","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"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; Bipartite graph; Degree (music); Ramsey's theorem; Vertex (graph theory); Graph; Upper and lower bounds; Complete bipartite graph; Tree (set theory); Discrete mathematics","authors":[{"name":"Penny Haxell","is_ca":true},{"name":"Tomasz Łuczak","is_ca":false},{"name":"Peter Tingley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1102685928597671,"gpt":0.2864809694619955,"spread":0.1762123766022284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001720393,0.0001430916,0.000287122,0.00006435813,0.0001292152,0.00001048667,0.0003207616,0.0001069897,0.0001662117],"category_scores_gemma":[0.0003157654,0.0001190922,0.000173886,0.0001509264,0.0000864227,0.0000345441,0.00007524635,0.00009698957,0.000004804017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002671798,"about_ca_system_score_gemma":0.000005838073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004778609,"about_ca_topic_score_gemma":0.000003301466,"domain_scores_codex":[0.9991455,0.00003938279,0.0002721792,0.000173825,0.0001373864,0.0002317478],"domain_scores_gemma":[0.9987569,0.000518799,0.0001419638,0.0004242772,0.00009128861,0.00006675832],"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.00002047843,0.0001793341,0.0006299871,0.0001223134,0.00006093771,0.000002234514,0.0008000024,4.922574e-7,0.00006160714,0.9716125,0.01687888,0.009631295],"study_design_scores_gemma":[0.0008500489,0.0001387666,0.0003094639,0.00002011666,0.00004829198,0.000004495923,0.00006861295,0.0001524448,0.0007192428,0.9865959,0.01094077,0.0001518562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8094656,0.001678931,0.007803276,0.0004758153,0.002907446,0.001367612,0.00005684987,0.0003411024,0.1759034],"genre_scores_gemma":[0.9899778,0.00003211726,0.008161109,0.00004676082,0.00004242707,0.00002685447,0.000001479474,0.00003108486,0.00168037],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1805122,"threshold_uncertainty_score":0.4856439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1481873605","doi":"10.1007/s00493-009-2178-y","title":"Highly parity linked graphs","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"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; Mathematics; Parity (physics); Disjoint sets; Graph; Joins; Discrete mathematics; Physics; Computer science","authors":[{"name":"Ken‐ichi Kawarabayashi","is_ca":false},{"name":"Bruce Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0204968892541353,"gpt":0.2860415032979834,"spread":0.2655446140438482,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003212698,0.0001451914,0.0001823304,0.0001806075,0.0002114115,0.000111548,0.001604799,0.00007487876,0.000009348958],"category_scores_gemma":[0.0001016097,0.0001372979,0.00009191812,0.001309801,0.00006468908,0.0004535014,0.0002105599,0.000311402,0.0001449847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000594239,"about_ca_system_score_gemma":0.0000468391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002841091,"about_ca_topic_score_gemma":2.102292e-7,"domain_scores_codex":[0.9984078,0.0001149779,0.0001811559,0.0004277028,0.000401984,0.0004664133],"domain_scores_gemma":[0.9984706,0.0001288104,0.0000554031,0.001004173,0.0001319472,0.0002090842],"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.000005571459,0.0001473323,0.0003118779,0.000002396365,0.000004599559,0.00002741567,0.00006790883,0.000002656295,0.0004814631,0.9725773,0.001555369,0.02481615],"study_design_scores_gemma":[0.000385059,0.0002474199,0.01010654,0.000005766817,0.000001698989,0.000006701594,0.000002781152,0.0008071781,0.001265715,0.9751202,0.01187208,0.0001788194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2021498,0.003528511,0.6424367,0.02255301,0.003886969,0.001506165,0.000005494543,0.004412477,0.1195209],"genre_scores_gemma":[0.9929069,0.00004610397,0.006156664,0.0004265665,0.0000179313,0.000009464659,0.00000113332,0.000006825034,0.0004284669],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.790757,"threshold_uncertainty_score":0.5598845,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099528956","doi":"10.1007/s00493-006-0024-z","title":"Independent Sets In Association Schemes","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph theory and applications","field":"Mathematics","cited_by":23,"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; Eigenvalues and eigenvectors; Adjacency matrix; Corollary; Graph; Upper and lower bounds; Discrete mathematics; Mathematical analysis","authors":[{"name":"Chris Godsil","is_ca":true},{"name":"Michael Newman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01745931502540025,"gpt":0.2832556082574548,"spread":0.2657962932320545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002862773,0.00006678951,0.0001052292,0.00006443509,0.00005807026,0.00001672943,0.0001088043,0.0000759755,0.00003971826],"category_scores_gemma":[0.0001138354,0.00006854822,0.00003617104,0.0002813344,0.000008137821,0.00004995404,0.00002668457,0.0001197311,0.0000577888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001552611,"about_ca_system_score_gemma":0.00001282859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001672303,"about_ca_topic_score_gemma":0.00001006445,"domain_scores_codex":[0.9993675,0.00004348802,0.0001723812,0.0001172635,0.0001522409,0.0001470835],"domain_scores_gemma":[0.9994714,0.0002076569,0.0000918425,0.0001706179,0.0000376829,0.00002074772],"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.000001359183,0.0002519947,0.03861007,0.00000727388,0.000003921457,0.0000012294,0.00003389783,5.531552e-7,0.0001800952,0.9550529,0.005731105,0.0001256499],"study_design_scores_gemma":[0.0003219096,0.000007335057,0.0221991,0.000006793849,0.000006490658,5.727555e-7,0.00001758897,0.00002008724,0.001620633,0.9666896,0.009033109,0.00007678661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.976881,0.00005118243,0.0001179025,0.0003829951,0.00009147212,0.0001507683,0.000002484404,0.00008243895,0.02223978],"genre_scores_gemma":[0.9982013,0.000002987718,0.0003753249,0.00002112401,0.0000150671,0.00004924836,0.000005098216,0.00000905362,0.001320805],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02132031,"threshold_uncertainty_score":0.2795315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965966420","doi":"10.1007/s00493-010-2329-1","title":"Type-II matrices and combinatorial structures","year":2010,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; York University","funders":"","keywords":"Mathematics; Combinatorics; Type (biology); Connection (principal bundle); Class (philosophy); Combinatorial analysis; Combinatorial proof; Discrete mathematics; Geometry; Computer science","authors":[{"name":"Ada Chan","is_ca":true},{"name":"Chris Godsil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01861496639239272,"gpt":0.282572723573241,"spread":0.2639577571808482,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002153689,0.0003267357,0.0004249656,0.0001156971,0.0005018167,0.0001082245,0.0004508866,0.0003161229,0.0003060112],"category_scores_gemma":[0.0005049754,0.0002799547,0.00008440766,0.0003775123,0.0001513868,0.000165932,0.0003688538,0.0006357385,0.00001061001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003098888,"about_ca_system_score_gemma":0.00007395186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002769229,"about_ca_topic_score_gemma":0.000002780362,"domain_scores_codex":[0.9983184,0.00005025027,0.0003522188,0.0004433214,0.0004177519,0.0004180633],"domain_scores_gemma":[0.9984757,0.0003114702,0.0001779482,0.0006050179,0.0001914236,0.0002383855],"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.00003675561,0.00008627736,0.0005627914,0.00003473377,0.00003557343,0.000006109331,0.0002337127,8.371006e-8,0.0006061599,0.9925879,0.004862812,0.0009471243],"study_design_scores_gemma":[0.001189872,0.0002270322,0.0009306525,0.000007971814,0.00005378778,0.00003215783,0.00003437053,0.00002152738,0.00110785,0.9799829,0.01606734,0.0003445202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9795408,0.0002808977,0.00001845299,0.0002052439,0.01386685,0.0002800317,0.00000287655,0.0002471865,0.005557707],"genre_scores_gemma":[0.9980436,0.00003802623,0.0009974808,0.00005919273,0.0005342896,0.00001429338,0.000003350718,0.00005430201,0.0002554773],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01850284,"threshold_uncertainty_score":0.9999653,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044987315","doi":"10.1007/s00493-014-3132-1","title":"Sabidussi versus Hedetniemi for three variations of the chromatic number","year":2015,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":23,"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":"Cartesian product; Mathematics; Combinatorics; Conjecture; Chromatic scale; Homomorphism; Product (mathematics); Graph; Discrete mathematics; Geometry","authors":[{"name":"Chris Godsil","is_ca":true},{"name":"David E. Roberson","is_ca":true},{"name":"Robert Šámal","is_ca":false},{"name":"Simone Severini","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1227036518353448,"gpt":0.3417196628509759,"spread":0.2190160110156312,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002299797,0.0001563441,0.0002908887,0.00002196301,0.0001346527,0.00002276915,0.0004834298,0.0001174158,0.00004380571],"category_scores_gemma":[0.001164969,0.0001090333,0.0001681203,0.000292103,0.0000645752,0.00007034749,0.0001444596,0.0001132994,0.00001071893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000137039,"about_ca_system_score_gemma":0.0001719948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002463577,"about_ca_topic_score_gemma":0.000008276092,"domain_scores_codex":[0.9988527,0.0000476563,0.0003350953,0.0001775358,0.0003639752,0.0002229806],"domain_scores_gemma":[0.9981532,0.000618724,0.0002372569,0.0006476893,0.0002451233,0.00009799485],"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.00004476652,0.0001051985,0.0004337258,0.00004376347,0.00005903416,1.626759e-7,0.0003130691,0.000004720079,0.000009776171,0.9905019,0.008291793,0.0001921277],"study_design_scores_gemma":[0.002517897,0.0001092564,0.0005188751,0.00002313831,0.0001032458,0.000001934731,0.00005742797,0.0005812656,0.0002708986,0.9936384,0.002043133,0.0001345102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9185837,0.0002405723,0.01981984,0.001784828,0.0206229,0.002758529,0.00003289406,0.0002905097,0.03586626],"genre_scores_gemma":[0.9981567,9.124586e-7,0.001340832,0.00002062087,0.0001232676,0.00008566058,0.000001866788,0.0000304509,0.0002397262],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07957299,"threshold_uncertainty_score":0.4446249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139177710","doi":"10.1007/s00493-015-2662-5","title":"Counting flags in triangle-free digraphs","year":2016,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":23,"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; Univerzita Karlova v Praze; National Science Foundation","keywords":"Digraph; Flag (linear algebra); FLAGS register; Upper and lower bounds; Backslash","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02876470606477036,"gpt":0.2769097246493653,"spread":0.248145018584595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005394027,0.0001542359,0.0002875146,0.0001666147,0.0001232342,0.00001929216,0.0005161779,0.0001068876,0.0001068879],"category_scores_gemma":[0.001451336,0.00009682389,0.0001107651,0.0003319644,0.00008224456,0.0001128897,0.0002181303,0.0001255423,0.00001262856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006984391,"about_ca_system_score_gemma":0.00001933462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006238297,"about_ca_topic_score_gemma":0.000005227669,"domain_scores_codex":[0.998798,0.00009561287,0.0003206386,0.0002324424,0.0002333616,0.0003199694],"domain_scores_gemma":[0.9981804,0.0009162734,0.0001129063,0.0006734491,0.00005172215,0.00006524744],"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.00002118542,0.00006784812,0.008060409,0.00002480954,0.00001544252,0.00001528017,0.0002823558,1.723991e-8,0.0002106089,0.9792902,0.006922529,0.00508931],"study_design_scores_gemma":[0.001846789,0.00003994101,0.002802905,0.00007363006,0.00001094527,0.000004649233,0.00003422212,0.000002937981,0.0006470815,0.9852376,0.00912793,0.0001713963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9553766,0.0003834351,0.0004056412,0.0006710778,0.001276453,0.0002859152,0.00000954926,0.0001963402,0.04139496],"genre_scores_gemma":[0.9983598,0.00003909614,0.0004980836,0.0000665241,0.00005471369,0.00001776299,3.500978e-7,0.00002708841,0.0009365713],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04298318,"threshold_uncertainty_score":0.3948364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1609788678","doi":"10.1007/s00493-016-3356-3","title":"Density of 5/2-critical graphs","year":2016,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"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; Planar graph; Graph homomorphism; Discrete mathematics; Graph; Homomorphism; Triangle-free graph; Graph power; Line graph","authors":[{"name":"Zdenĕk Dvořák","is_ca":false},{"name":"Luke Postle","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01892572433480676,"gpt":0.2944850513808936,"spread":0.2755593270460868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002689268,0.00008060868,0.0001453581,0.0001216417,0.00006841628,0.00001367828,0.0009231786,0.00004124874,0.00001873348],"category_scores_gemma":[0.0005100616,0.00005510566,0.00006766829,0.0005553107,0.0002823712,0.0003081553,0.0003769498,0.00007732527,0.00006639901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003191545,"about_ca_system_score_gemma":0.0000377748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001676382,"about_ca_topic_score_gemma":1.751123e-7,"domain_scores_codex":[0.9988853,0.0001003338,0.0001495908,0.0002645827,0.0003159621,0.000284269],"domain_scores_gemma":[0.9982943,0.0006191115,0.00003354227,0.0007129891,0.0002102554,0.0001297967],"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.000004978885,0.00009483448,0.002301122,0.00000830526,0.000003803059,0.00001122591,0.00002945847,4.098172e-8,0.005891826,0.9790379,0.000241547,0.01237492],"study_design_scores_gemma":[0.0002670574,0.0001117055,0.003532973,0.00001413155,0.000001481405,0.000007184576,0.000002680644,0.00004038733,0.037462,0.9577553,0.0007172506,0.00008787479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1159201,0.0002370203,0.874214,0.003339131,0.0007448774,0.000152229,0.000002523902,0.0002438563,0.005146329],"genre_scores_gemma":[0.9951965,0.00001457182,0.004570628,0.00003250682,0.000005771671,0.000005723339,6.339018e-8,0.000005747773,0.0001684387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8792765,"threshold_uncertainty_score":0.2247144,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059154872","doi":"10.1007/s004930170005","title":"Critical Facets of the Stable Set Polytope","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"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; Polytope; Critical graph; Birkhoff polytope; Graph; Facet (psychology); Discrete mathematics; Line graph; Voltage graph; Geometry; Convex set","authors":[{"name":"László Lipták","is_ca":true},{"name":"László Lovász","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02898190593581132,"gpt":0.2730686557350075,"spread":0.2440867497991962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001601499,0.00009439784,0.000142968,0.00004657505,0.0001944307,0.0000673268,0.001399187,0.00004243352,0.00004793068],"category_scores_gemma":[0.0001355533,0.00007046971,0.00008880543,0.0008140505,0.0001363628,0.0002281582,0.0005736026,0.0001572505,0.00002270978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000264881,"about_ca_system_score_gemma":0.00005178694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002785134,"about_ca_topic_score_gemma":0.000001299766,"domain_scores_codex":[0.9989654,0.0000724815,0.0001731612,0.0002171568,0.0003065973,0.0002652144],"domain_scores_gemma":[0.9988325,0.000165559,0.00004470673,0.0007742913,0.0001084909,0.00007441766],"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.000001829328,0.0001401929,0.002135485,0.000008340643,0.000006976211,0.000006635326,0.0001723454,0.000003811843,0.0001561566,0.9865533,0.006173613,0.004641368],"study_design_scores_gemma":[0.0005852944,0.000216044,0.01909775,0.00004846274,0.00001163432,0.00007199932,0.00004997999,0.01028687,0.006622742,0.7702417,0.1924324,0.0003351441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2325639,0.003956919,0.5169464,0.06498549,0.01610103,0.001173606,0.00004602939,0.001086296,0.1631403],"genre_scores_gemma":[0.9972142,0.00002000745,0.001895854,0.0003403931,0.00001997043,0.000004996313,3.009741e-7,0.000004858408,0.0004994146],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7646503,"threshold_uncertainty_score":0.2873671,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062920840","doi":"10.1007/s00493-005-0031-5","title":"Small Forbidden Configurations IV: The 3 Rowed Case","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"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","authors":[{"name":"R.P. Anstee","is_ca":true},{"name":"Attila Sali","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06555081426316522,"gpt":0.2961509496191087,"spread":0.2306001353559435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000292025,0.0001343425,0.0001503544,0.00004099231,0.0006439707,0.00004729415,0.0002995751,0.00007783489,0.0002314102],"category_scores_gemma":[0.0002562754,0.00008533448,0.00009943806,0.0001621985,0.00009089879,0.00006063704,0.00009502028,0.0002058447,0.00003104847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004232978,"about_ca_system_score_gemma":0.00002334749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009985623,"about_ca_topic_score_gemma":0.00002088365,"domain_scores_codex":[0.9991664,0.0001041944,0.0002249087,0.0001561013,0.0001298658,0.0002185707],"domain_scores_gemma":[0.9986696,0.0005286119,0.00008542729,0.0005646094,0.00008220803,0.00006951935],"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.000004650135,0.00005518692,0.00003099341,0.000008879597,0.00002998565,0.00005911992,0.001257604,0.000001655652,0.00002589907,0.9839996,0.01158376,0.002942666],"study_design_scores_gemma":[0.0004219533,0.00003728407,0.0000893031,0.000006420485,0.00005237301,0.0005089093,0.0002496433,0.000270549,0.0004349132,0.9131001,0.0846751,0.0001534684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.835652,0.0005805815,0.001852574,0.003998009,0.001317773,0.0007690662,0.00001773898,0.0003304868,0.1554818],"genre_scores_gemma":[0.9954605,0.00001127836,0.001203576,0.0003178785,0.000152344,0.00003128204,0.000001723477,0.0000217429,0.002799658],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1598085,"threshold_uncertainty_score":0.4952967,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064317094","doi":"10.1007/s00493-003-0028-x","title":"Sharp Concentration of the Number of Submaps in Random Planar Triangulations","year":2003,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Planar; Vertex (graph theory); Degree (music); Convex polygon; Polygon (computer graphics); Regular polygon; Limiting; Triangulation; Planar graph; Point set triangulation; Geometry; Graph; Delaunay triangulation; Physics","authors":[{"name":"Zhicheng Gao","is_ca":true},{"name":"Nicholas Wormald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01219577398742376,"gpt":0.2453682555803703,"spread":0.2331724815929465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002511191,0.00004920297,0.0001099303,0.00003794649,0.00004384727,0.00001165747,0.0002124217,0.00002923409,0.00001669388],"category_scores_gemma":[0.0001560832,0.0000402002,0.00004544798,0.0008076588,0.00002050057,0.0001348097,0.00001874977,0.00004888004,0.000002935114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002832886,"about_ca_system_score_gemma":0.0001169111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009581353,"about_ca_topic_score_gemma":0.000001894037,"domain_scores_codex":[0.9992489,0.0001379492,0.0002458405,0.0001083095,0.0001808956,0.00007813549],"domain_scores_gemma":[0.999407,0.0001576602,0.0001220655,0.0002005529,0.00009311623,0.00001963081],"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.000007019436,0.0001034773,0.01367797,0.000007744358,0.000005314391,3.672445e-7,0.0003027577,0.001293199,0.001016858,0.9825836,0.0002448822,0.0007567724],"study_design_scores_gemma":[0.0133851,0.000114494,0.2913267,0.0001107553,0.00003061141,0.00002753754,0.00008286911,0.05633835,0.1210001,0.5060217,0.01110525,0.0004564702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7383404,0.0003499779,0.2426599,0.0006630874,0.001427166,0.0005225796,0.000005149203,0.00002954998,0.01600218],"genre_scores_gemma":[0.9981182,0.000004941902,0.001737028,0.00002555423,0.000006612023,0.000006383561,0.000002751679,0.000001890042,0.0000966783],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.476562,"threshold_uncertainty_score":0.1639317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040142481","doi":"10.1007/s00493-013-2723-6","title":"Ramsey degrees of boron tree structures","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Automorphism group; Automorphism; Embedding; Tree (set theory); Discrete mathematics; Group (periodic table); Limit (mathematics); Ramsey's theorem; Binary tree; Class (philosophy); Graph","authors":[{"name":"J. Jasiński","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03028159500317529,"gpt":0.2992687109905036,"spread":0.2689871159873283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007460468,0.0001069838,0.0002230246,0.00004255618,0.00005788828,0.000004950544,0.0002076615,0.0001031198,0.0005166854],"category_scores_gemma":[0.0002645647,0.00008681272,0.00005569624,0.0000880893,0.0001255722,0.0000850974,0.00005606742,0.000126055,0.00004248634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002162081,"about_ca_system_score_gemma":0.00001443506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001888755,"about_ca_topic_score_gemma":0.000003297483,"domain_scores_codex":[0.999349,0.00005968368,0.000194894,0.0001247056,0.0001012158,0.0001704741],"domain_scores_gemma":[0.9991075,0.0003434178,0.0001098794,0.0003174355,0.000071941,0.00004984105],"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.000008894187,0.00007601989,0.0005661955,0.00003220222,0.00002253865,0.000001752292,0.0002426641,0.000001858553,0.0004825357,0.9882506,0.005988904,0.004325823],"study_design_scores_gemma":[0.000335309,0.00007820073,0.005064184,0.000007486351,0.0000145994,0.000003904765,0.0001205692,0.0000308218,0.003242117,0.9901014,0.0009068143,0.00009458664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9659015,0.0005867944,0.002654361,0.0002310127,0.0005275212,0.0003150832,0.000004106946,0.0001370715,0.02964254],"genre_scores_gemma":[0.9935008,0.00001377583,0.005384408,0.00002667713,0.00002106459,0.00001532767,0.00000194565,0.0000149345,0.001021037],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0286215,"threshold_uncertainty_score":0.5657342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026211607","doi":"10.1007/s004930070006","title":"Hedetniemi's Conjecture and the Retracts of a Product of Graphs","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; Champlain Regional College","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Product (mathematics); Discrete mathematics; Geometry","authors":[{"name":"Benoît Larose","is_ca":true},{"name":"Claude Tardif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004598761815875983,"gpt":0.187675232429242,"spread":0.183076470613366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003930236,0.00008385534,0.0002079571,0.00005493434,0.00006538843,0.00001820481,0.0003951249,0.00003630607,0.00001208113],"category_scores_gemma":[0.00006172039,0.00005165663,0.00005354331,0.0005490298,0.0002337402,0.00007828415,0.0000663869,0.0001085168,0.000002436133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003185015,"about_ca_system_score_gemma":0.00002858696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004740564,"about_ca_topic_score_gemma":3.799091e-7,"domain_scores_codex":[0.9991706,0.000076884,0.0002200082,0.0002080971,0.0001999893,0.0001243933],"domain_scores_gemma":[0.9990974,0.0001258624,0.0001054065,0.0005388077,0.00008901801,0.00004347731],"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.00002333306,0.00009172031,0.0003860641,0.00003169576,0.00001840336,0.000001701935,0.0007363395,0.000009364827,0.0006759158,0.9859166,0.001959803,0.01014906],"study_design_scores_gemma":[0.001741598,0.0001654306,0.001923261,0.00004696794,0.00001636425,0.00002291873,0.000009470129,0.0007012234,0.01235567,0.9801934,0.002705829,0.000117857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.985181,0.005854955,0.000116894,0.002557496,0.0002308756,0.0002843385,0.000001503046,0.00008659357,0.00568639],"genre_scores_gemma":[0.9986413,0.0001880398,0.0008590043,0.00009248727,0.000001530897,0.000004187292,3.178873e-7,0.000003818097,0.000209368],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01346029,"threshold_uncertainty_score":0.2106496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984911038","doi":"10.1007/s004930100000","title":"On a Generalized Anti-Ramsey Problem","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"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; Combinatorics; Ramsey's theorem; Order (exchange); Ramsey theory; Greedy coloring; Fractional coloring; List coloring; Complete coloring; Discrete mathematics","authors":[{"name":"Maria Axenovich","is_ca":false},{"name":"André Kündgen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03030719509583264,"gpt":0.292309317185155,"spread":0.2620021220893223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002119923,0.0001769604,0.0002618406,0.00008712472,0.0002510423,0.00003044813,0.0002943113,0.0001047028,0.0002373716],"category_scores_gemma":[0.0001529807,0.0001365503,0.0001088484,0.0002737977,0.00005183131,0.00004668277,0.00009595537,0.0001896422,0.00003766547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004533044,"about_ca_system_score_gemma":0.00001480604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004585289,"about_ca_topic_score_gemma":3.740572e-7,"domain_scores_codex":[0.9989009,0.00009169358,0.000223794,0.0002416637,0.0002485802,0.0002933359],"domain_scores_gemma":[0.9990318,0.0002308556,0.00008981497,0.0004962679,0.00005752904,0.00009377374],"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.00002459102,0.0001616424,0.0005649126,0.00002032274,0.00002907961,0.00002911924,0.0002245433,0.000001876122,0.00006844734,0.9814069,0.01648096,0.0009876197],"study_design_scores_gemma":[0.000805289,0.0001112994,0.0003956567,0.00002207494,0.00001891114,0.00002028069,0.00001128241,0.00003660863,0.000286926,0.9740899,0.02401599,0.0001858341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9059803,0.000122777,0.0003117324,0.0002567078,0.0006838242,0.0002756791,0.000002245274,0.0002354681,0.09213123],"genre_scores_gemma":[0.9952908,0.00005882806,0.002063629,0.0003085964,0.00006346566,0.00002231228,0.000002063933,0.00003464553,0.002155696],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08997554,"threshold_uncertainty_score":0.556836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979865967","doi":"10.1007/s004930070030","title":"Approximate Homomorphisms II: Group Homomorphisms","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Functional Equations Stability Results","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Homomorphism; Mathematics; Group (periodic table); Combinatorics; Discrete mathematics; Chemistry","authors":[{"name":"Ilijas Farah","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03743375855110635,"gpt":0.2708912713630195,"spread":0.2334575128119132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000448048,0.0002947935,0.0003900148,0.0001153541,0.0005454173,0.00005679844,0.0004301769,0.0001580776,0.003787848],"category_scores_gemma":[0.0004090266,0.0002860575,0.0001706543,0.0006677072,0.000169069,0.0002287305,0.0001116696,0.0003007772,0.0007693724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002483757,"about_ca_system_score_gemma":0.00005886318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001916428,"about_ca_topic_score_gemma":0.00000224201,"domain_scores_codex":[0.9977852,0.0001126089,0.0005382242,0.0005066977,0.000591145,0.0004661636],"domain_scores_gemma":[0.9981117,0.0004881308,0.0001223118,0.0009331843,0.0001549673,0.0001897356],"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.00008741787,0.001617174,0.00009109988,0.00006560382,0.00005088855,0.00001835156,0.0002738484,0.00001220939,0.0001595024,0.9757494,0.01542342,0.00645111],"study_design_scores_gemma":[0.001468792,0.0003380913,0.0004386866,0.00002933631,0.00005143472,0.00004135932,0.00003494919,0.0009188721,0.0003325507,0.9491032,0.0468486,0.0003941492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.801879,0.0003686362,0.002975205,0.001722493,0.001302868,0.001375398,0.00009981928,0.001315754,0.1889608],"genre_scores_gemma":[0.983646,0.00003573465,0.005196786,0.0001323393,0.00009669224,0.000163665,0.00005832789,0.00006508528,0.01060531],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.181767,"threshold_uncertainty_score":0.9999592,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166183308","doi":"10.1007/s00493-013-2649-z","title":"Chromatic number and complete graph substructures for degree sequences","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Conjecture; Disjoint sets; Upper and lower bounds; Clique number; Subdivision; Clique; Chromatic scale; Discrete mathematics","authors":[{"name":"Zdenĕk Dvořák","is_ca":true},{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03317689625942936,"gpt":0.2485224778428964,"spread":0.2153455815834671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009855091,0.0001231486,0.0002229976,0.0001034316,0.0001843001,0.000219378,0.0007096083,0.00005037418,0.0001281129],"category_scores_gemma":[0.0001029945,0.00008623571,0.00007048273,0.0008739615,0.0001024524,0.0003519141,0.0002077972,0.00006338933,0.000085454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001463417,"about_ca_system_score_gemma":0.00001044687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001541539,"about_ca_topic_score_gemma":0.000002630063,"domain_scores_codex":[0.9990447,0.00003355496,0.0001777927,0.0003220164,0.0001676676,0.0002542973],"domain_scores_gemma":[0.9990745,0.0002745721,0.00007528061,0.0003645677,0.00008643147,0.0001247004],"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.000002027225,0.0000960806,0.01335481,0.00005954471,0.0001036337,0.000007545589,0.0001727031,0.00000338195,0.0003811863,0.9057191,0.01757243,0.06252757],"study_design_scores_gemma":[0.0003235513,0.00009536807,0.0969557,0.000005104061,0.00001932828,0.00001791918,0.00001955307,0.003305616,0.0001265167,0.892952,0.005966982,0.0002123531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7121038,0.001613479,0.2730638,0.006272621,0.0009257817,0.0009325536,0.00003666569,0.000464859,0.004586341],"genre_scores_gemma":[0.9842573,0.00003168823,0.01524074,0.0002313886,0.00001666785,0.00005415735,0.000005959758,0.000003573388,0.0001585231],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2721534,"threshold_uncertainty_score":0.351659,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982114488","doi":"10.1007/s004930200024","title":"On Erdős's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Upper and lower bounds; Discrete mathematics","authors":[{"name":"František Franěk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04431388227827605,"gpt":0.2869376112823541,"spread":0.242623729004078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001817122,0.0002358,0.0005315614,0.0001172596,0.0001533703,0.00001248846,0.0003031057,0.0001600949,0.0001751172],"category_scores_gemma":[0.0006718505,0.0001809349,0.0003014837,0.000151047,0.0002513028,0.00003489446,0.00005612404,0.0001798334,0.000002099288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003119828,"about_ca_system_score_gemma":0.000007937857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004709569,"about_ca_topic_score_gemma":0.000001228814,"domain_scores_codex":[0.9987343,0.0000821908,0.0004159617,0.0002386992,0.0002754843,0.0002533859],"domain_scores_gemma":[0.9957713,0.003182871,0.0002679056,0.0005602765,0.0001598462,0.00005777517],"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.0001727941,0.00039312,0.0002620785,0.0002265762,0.00009208643,0.000001659783,0.0009829719,0.00000244052,0.0003674373,0.9877357,0.009543357,0.0002197836],"study_design_scores_gemma":[0.00132042,0.001247442,0.0004787252,0.0001089689,0.00004722211,0.000001811207,0.00007950702,0.00009636599,0.006966243,0.9856631,0.003781124,0.0002091043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9870182,0.0002814694,0.0001030669,0.0001344981,0.0007782941,0.0005351672,0.0001210424,0.00006630971,0.01096197],"genre_scores_gemma":[0.9982232,0.00003887749,0.0008634431,0.0002016625,0.00003497068,0.00002480655,0.000002578447,0.00003994787,0.0005705111],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01120502,"threshold_uncertainty_score":0.737831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2743168372","doi":"10.1007/s00493-019-3848-z","title":"Clustered Colouring in Minor-Closed Classes","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"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":"Monochromatic color; Conjecture; Chromatic scale; Graph; Windmill graph; Friendship graph; Integer (computer science); Graph coloring","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01435710256138898,"gpt":0.268063887531273,"spread":0.253706784969884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000312753,0.0001253321,0.0002011834,0.0002529929,0.00005573895,0.00008059426,0.001268697,0.0000655406,0.00003260631],"category_scores_gemma":[0.0000775068,0.000125882,0.00004922188,0.001003627,0.00003598096,0.0004312942,0.0005421504,0.0002577642,0.0003918418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001495851,"about_ca_system_score_gemma":0.00006762167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000875459,"about_ca_topic_score_gemma":0.000003320143,"domain_scores_codex":[0.9984946,0.0001339984,0.0001954228,0.000416418,0.0003127741,0.0004468157],"domain_scores_gemma":[0.9987078,0.0002933531,0.00005597694,0.0007768585,0.00006571149,0.0001002543],"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.00004152008,0.000319205,0.05921134,0.00006230077,0.00001443026,0.00009850899,0.0005260342,0.0001172958,0.004091919,0.9246919,0.0006407303,0.01018482],"study_design_scores_gemma":[0.006221242,0.0008174569,0.1082132,0.0001409167,0.000004266436,0.00003239241,0.0001782119,0.03230117,0.0155714,0.8083243,0.02713233,0.001063129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9689684,0.0002880667,0.008222707,0.0006102617,0.0008505235,0.0005105454,6.190942e-7,0.000214224,0.02033466],"genre_scores_gemma":[0.9960073,0.00001236762,0.002234127,0.00008850641,0.00000973957,0.00002191031,6.189533e-7,0.00001190848,0.001613475],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1163676,"threshold_uncertainty_score":0.5133318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966530078","doi":"10.1007/s00493-011-2545-3","title":"On the threshold for k-regular subgraphs of random graphs","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Induced subgraph; Factor-critical graph; Random regular graph; Random graph; Discrete mathematics; Line graph; Graph power; Pathwidth; Vertex (graph theory)","authors":[{"name":"Paweł Prałat","is_ca":true},{"name":"Jacques Verstraëte","is_ca":false},{"name":"Nicholas Wormald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0697965727121189,"gpt":0.2722161232545404,"spread":0.2024195505424214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005923474,0.0001621255,0.000295582,0.00009517038,0.0002401224,0.000007634235,0.0004898208,0.00009141781,0.00009968255],"category_scores_gemma":[0.0003529499,0.00009368257,0.0003019178,0.0002289967,0.0001930956,0.00003115204,0.00006743547,0.0001314375,0.000001578155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001068117,"about_ca_system_score_gemma":0.00001149464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003037962,"about_ca_topic_score_gemma":4.587174e-7,"domain_scores_codex":[0.9990417,0.00007058044,0.0002778309,0.0001814208,0.0002093346,0.0002191653],"domain_scores_gemma":[0.9978274,0.001158529,0.0001607238,0.0006965437,0.0001086182,0.00004818032],"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.0002249967,0.0001514745,0.000285903,0.00004553322,0.00008471284,9.616763e-7,0.000909941,8.732374e-8,0.00005780858,0.991059,0.007033697,0.0001459034],"study_design_scores_gemma":[0.001349749,0.0002361821,0.0002316036,0.00002494899,0.00006097119,0.000001414649,0.00008031487,0.00001495446,0.007924106,0.9894232,0.0005314196,0.0001211304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9453368,0.0003692005,0.001027962,0.0001111895,0.001119005,0.001138781,0.00001795595,0.0000982879,0.05078084],"genre_scores_gemma":[0.9990052,0.00001940486,0.0005911689,0.0001045341,0.00001373781,0.00007458477,9.983086e-7,0.00002767927,0.0001626955],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05366842,"threshold_uncertainty_score":0.3820264,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994006656","doi":"10.1007/s00493-012-2552-z","title":"A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks","year":2012,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"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":"Spanning tree; Minimum spanning tree; Steiner tree problem; Minimum weight; Minimum degree spanning tree; k-minimum spanning tree; Connected dominating set; Bounded function; Asymptotically optimal algorithm","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.0283076622867845,"gpt":0.2601603663748668,"spread":0.2318527040880823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005982217,0.0002703958,0.0004219545,0.0002170785,0.0002813909,0.0004007383,0.0004913765,0.0001256579,0.000004555527],"category_scores_gemma":[0.0000598359,0.0002475415,0.00009570779,0.0004667142,0.000168629,0.0007677687,0.0004278164,0.000235037,0.00000162885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005035635,"about_ca_system_score_gemma":0.00003188682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003951864,"about_ca_topic_score_gemma":0.00007458061,"domain_scores_codex":[0.998224,0.00006928715,0.000327078,0.0004871905,0.0002097981,0.0006826224],"domain_scores_gemma":[0.9986548,0.000524962,0.0001022887,0.0004468939,0.00004686447,0.0002241778],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002262798,0.0008192409,0.150368,0.00008092248,0.0001368273,0.00002480487,0.004222448,0.00005536097,0.0001100576,0.7376967,0.004098632,0.1021607],"study_design_scores_gemma":[0.01688473,0.001065971,0.1686963,0.000251689,0.00006935057,0.00009143699,0.0002673723,0.4009978,0.0002287853,0.3632592,0.04653793,0.00164943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6037306,0.02933463,0.3569645,0.001504272,0.002996949,0.001503316,0.000009710492,0.0003936444,0.003562385],"genre_scores_gemma":[0.985692,0.0001777475,0.01346876,0.00022193,0.0001485824,0.00009347906,0.000003608047,0.00002176308,0.0001721554],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4009424,"threshold_uncertainty_score":0.9999977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2774144053","doi":"10.1007/s00493-017-3396-3","title":"Extending Factorizations of Complete Uniform Hypergraphs","year":2017,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Hypergraph; Discrete mathematics","authors":[{"name":"Amin Bahmanian","is_ca":true},{"name":"Mike Newman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01976080922806613,"gpt":0.2231222047863816,"spread":0.2033613955583155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007866945,0.00009573535,0.0001678087,0.00007591847,0.0002673075,0.000037791,0.0003528535,0.00004786837,0.00002696983],"category_scores_gemma":[0.00002923526,0.00009527597,0.00006667384,0.00009311205,0.00005719624,0.0001402033,0.00003543591,0.00007802871,0.00001921079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002047296,"about_ca_system_score_gemma":0.000004924409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009839713,"about_ca_topic_score_gemma":0.000001053884,"domain_scores_codex":[0.9994932,0.00001203196,0.0001648905,0.00008372731,0.00009725452,0.0001488448],"domain_scores_gemma":[0.9992957,0.00003113283,0.00006727946,0.0005112473,0.00003846251,0.00005620192],"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.000002216079,0.00003113634,0.009965583,0.00007321744,0.00005296634,0.000003120875,0.0001839935,0.0001617583,0.009257763,0.9789398,0.0004482353,0.0008801806],"study_design_scores_gemma":[0.003604029,0.0003287187,0.2318535,0.0004810879,0.0001656117,0.00003736786,0.000675312,0.01426631,0.04140634,0.4636429,0.2416588,0.00188009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8222628,0.0006897714,0.005139445,0.00004153469,0.00455086,0.0002676125,0.00005083409,0.0004543508,0.1665428],"genre_scores_gemma":[0.9997435,0.00004139939,0.0000433436,0.000001882074,0.00002085862,0.000007654474,0.000004520161,0.00001802427,0.0001188446],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.515297,"threshold_uncertainty_score":0.3885241,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102229938","doi":"10.1007/s00493-016-3441-7","title":"Point-Curve Incidences in the Complex Plane","year":2017,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"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; Hypersurface; Lemma (botany); Algebraic curve; Combinatorics; Plane curve; Algebraic geometry; Algebraic number; Differential geometry; Plane (geometry); Incidence (geometry); Complex plane; Geometry; Discrete mathematics; Mathematical analysis","authors":[{"name":"Adam Sheffer","is_ca":false},{"name":"Endre Szabó","is_ca":false},{"name":"Joshua Zahl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04744083505053642,"gpt":0.2976345836036157,"spread":0.2501937485530793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004981795,0.00007358844,0.00008852658,0.00006597563,0.0004646912,0.0004269959,0.001693128,0.00002699592,0.00001146534],"category_scores_gemma":[0.0001553003,0.00005441684,0.00002761376,0.0001862536,0.00004199153,0.0004725837,0.0002116987,0.0001021898,0.00005722938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002484707,"about_ca_system_score_gemma":0.00004271896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006313079,"about_ca_topic_score_gemma":0.00002023289,"domain_scores_codex":[0.9991732,0.00008845764,0.0001341983,0.0001951633,0.0002648264,0.0001441051],"domain_scores_gemma":[0.9990063,0.0001798742,0.0001026369,0.0006281296,0.0000510499,0.00003195052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000003393353,0.0001181318,0.005949286,0.000005601669,0.000004816933,0.00004022248,0.0007020151,0.0001016593,0.0001207006,0.9704937,0.009929848,0.01253066],"study_design_scores_gemma":[0.0006350322,0.0001455225,0.7065012,0.00001543437,0.000003074964,0.00003591046,0.00004973002,0.02774577,0.0003153273,0.2268462,0.03748121,0.0002255847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6392432,0.0008892468,0.2333844,0.05136411,0.004769341,0.0009493043,0.000006545912,0.0002726371,0.06912127],"genre_scores_gemma":[0.9977719,0.00001048773,0.001608272,0.0004281736,0.00005363568,0.00001214654,0.000003640483,0.000002033038,0.0001097736],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7436475,"threshold_uncertainty_score":0.4117531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969104367","doi":"10.1007/s00493-013-2910-5","title":"Lines in hypergraphs","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Concordia University; Google (Canada)","funders":"Concordia University; Canada Research Chairs","keywords":"Hypergraph; Combinatorics; Mathematics; Vertex (graph theory); De Bruijn sequence; Finite set; Statement (logic); Discrete mathematics; Graph","authors":[{"name":"Laurent Beaudou","is_ca":false},{"name":"Adrian Bondy","is_ca":false},{"name":"Ehsan Chiniforooshan","is_ca":true},{"name":"Maria Chudnovsky","is_ca":false},{"name":"Vašek Chvátal","is_ca":true},{"name":"Nicolás Fraiman","is_ca":true},{"name":"Yori Zwólš","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02347173636206479,"gpt":0.2756630780826877,"spread":0.2521913417206229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001177151,0.0001050525,0.0001685588,0.0001104735,0.00007705193,0.00001959127,0.0002174102,0.00007318531,0.0002280487],"category_scores_gemma":[0.0001928664,0.00008144423,0.00005752917,0.0002729158,0.0000447633,0.00008123709,0.00008742244,0.0001384572,0.00004123861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001979474,"about_ca_system_score_gemma":0.000007610507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002512526,"about_ca_topic_score_gemma":0.000001747809,"domain_scores_codex":[0.9993054,0.00004774078,0.0001894242,0.0001421574,0.0001174744,0.0001977666],"domain_scores_gemma":[0.9993367,0.0002150717,0.0000423548,0.0003027936,0.00004974054,0.00005332466],"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.000001979021,0.0000748606,0.008469169,0.00001983315,0.000007484678,0.000003612309,0.0002613393,1.67828e-7,0.00009533504,0.9811838,0.008065236,0.001817193],"study_design_scores_gemma":[0.0002860893,0.00002492802,0.009609498,0.00001168309,0.000004020228,0.000003110617,0.00005002852,0.00003473586,0.0002453389,0.9867787,0.002840155,0.0001117487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9696072,0.0002263932,0.00002769001,0.0002215872,0.000552122,0.0001922539,5.281531e-7,0.00008305487,0.02908915],"genre_scores_gemma":[0.9981679,0.00002427443,0.0009626417,0.0001052165,0.00003203207,0.00003668881,5.213996e-7,0.00001607891,0.0006546775],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02856065,"threshold_uncertainty_score":0.3321199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3001610491","doi":"10.1007/s00493-020-4516-z","title":"On the Directions Determined by a Cartesian Product in an Affine Galois Plane","year":2021,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"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; Cartesian product; Combinatorics; Affine transformation; Upper and lower bounds; Clique; Graph; Product (mathematics); Discrete mathematics; Pure mathematics; Geometry","authors":[{"name":"Daniel Di Benedetto","is_ca":true},{"name":"József Solymosi","is_ca":true},{"name":"Ethan Patrick White","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02954398501120894,"gpt":0.2859120197507108,"spread":0.2563680347395019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004351198,0.0003674329,0.0005095074,0.0001394549,0.0002671369,0.0001223002,0.0006655072,0.0002358764,0.0001691326],"category_scores_gemma":[0.0007740442,0.0002619366,0.0001471804,0.0003022986,0.00008403882,0.00004372075,0.000473887,0.001061321,0.000002628223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001593359,"about_ca_system_score_gemma":0.00008137889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000695219,"about_ca_topic_score_gemma":0.00009058201,"domain_scores_codex":[0.9979151,0.0004367977,0.0003849149,0.000638912,0.0003060713,0.0003181847],"domain_scores_gemma":[0.9973233,0.0007045999,0.0001897446,0.001595885,0.00009527438,0.00009122741],"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.0001192587,0.002370216,0.001869421,0.0005916307,0.0002786024,0.0001887958,0.008787095,0.00001778345,0.0007416824,0.9207309,0.05795198,0.006352559],"study_design_scores_gemma":[0.0004304954,0.0001453204,0.001265423,0.0002254871,0.00007737227,0.00001726908,0.0001940147,0.0001022256,0.002024003,0.9918126,0.003197579,0.0005082319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9881628,0.0007436907,0.00002218511,0.000799638,0.002066715,0.0007810757,0.00005371491,0.0001613533,0.007208814],"genre_scores_gemma":[0.9983984,0.0000733714,0.000209967,0.0001137059,0.0001094111,0.0001947996,0.00007037733,0.00005761821,0.0007723662],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0710816,"threshold_uncertainty_score":0.9999833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094094736","doi":"10.1007/s004930200025","title":"The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Burnaby Hospital; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Graph","authors":[{"name":"Anna Galluccio","is_ca":false},{"name":"Luis Goddyn","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03892352185473524,"gpt":0.2747212387687856,"spread":0.2357977169140503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003915717,0.0001712375,0.0002340526,0.000097171,0.0003776397,0.00009819802,0.002055644,0.00007590276,0.00006101791],"category_scores_gemma":[0.0001731758,0.0001314794,0.0001629729,0.001645423,0.000238033,0.0002540476,0.0004148245,0.0002756016,0.0001502777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004693442,"about_ca_system_score_gemma":0.0000271843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000896694,"about_ca_topic_score_gemma":9.72806e-7,"domain_scores_codex":[0.9980285,0.0002366949,0.0002644125,0.0004024679,0.0005662579,0.0005017155],"domain_scores_gemma":[0.9975382,0.0005192243,0.0001181679,0.00137284,0.0003046328,0.0001469026],"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.00001170295,0.0002613115,0.004448949,0.00003286239,0.00008694366,0.00005089158,0.001111147,0.000009719768,0.0004417255,0.9600031,0.006299535,0.02724208],"study_design_scores_gemma":[0.001199745,0.000141884,0.002506071,0.00003298432,0.00001128503,0.00006404409,0.00009471666,0.0307686,0.004551407,0.9416475,0.01859102,0.0003907838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5071412,0.008279808,0.4158835,0.009741448,0.003937108,0.001997883,0.00002952442,0.001159677,0.05182987],"genre_scores_gemma":[0.997515,0.0001856646,0.001348559,0.00008796649,0.00001669928,0.00003525037,5.050745e-7,0.00001844479,0.000791974],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4903737,"threshold_uncertainty_score":0.5361575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981300700","doi":"10.1007/s00493-013-2771-y","title":"Local chromatic number of quadrangulations of surfaces","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Chromatic scale; Vertex (graph theory); Graph; Betti number; Generalization; Discrete mathematics; Mathematical analysis","authors":[{"name":"Bojan Mohar","is_ca":true},{"name":"Gábor Simonyi","is_ca":false},{"name":"Gábor Tardos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0107037916169401,"gpt":0.2437316914439877,"spread":0.2330278998270476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009076451,0.00006380908,0.0002162773,0.00009041276,0.00003299481,0.00001760073,0.0005957347,0.00003759237,0.0004859279],"category_scores_gemma":[0.00007881819,0.0000478959,0.00007264796,0.001519872,0.00009537696,0.0002343798,0.0001740701,0.00004164238,0.0001840882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001225109,"about_ca_system_score_gemma":0.00001654213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004243239,"about_ca_topic_score_gemma":9.899885e-7,"domain_scores_codex":[0.9992287,0.00003970942,0.0002578861,0.0001409089,0.0002139228,0.0001188662],"domain_scores_gemma":[0.9990864,0.0001845545,0.0001254402,0.0004153498,0.0001332046,0.00005500712],"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.000001178249,0.000750192,0.02883044,0.0000686093,0.000104061,0.0000025112,0.0002999824,0.000231631,0.0004906414,0.9237528,0.005236329,0.04023159],"study_design_scores_gemma":[0.0007189255,0.0002398583,0.3960151,0.0000326133,0.00005925147,0.000008435763,0.0001494382,0.06420153,0.005539114,0.529526,0.003131561,0.0003782057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5982479,0.0002504517,0.3944274,0.0006343882,0.0001622008,0.0001207905,0.000004984581,0.00006413473,0.006087827],"genre_scores_gemma":[0.9932116,0.000008089105,0.00654931,0.00001577808,0.000002445026,0.000005003985,0.000002337388,0.000001797019,0.0002036551],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3949637,"threshold_uncertainty_score":0.532057,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077882202","doi":"10.1007/s00493-014-2862-4","title":"The edge density of critical digraphs","year":2014,"lang":"ceb","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Quest University Canada","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Critical graph; Graph; Corollary; Discrete mathematics; Graph power; Line graph","authors":[{"name":"Richard Hoshino","is_ca":true},{"name":"Ken‐ichi Kawarabayashi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01392579734803384,"gpt":0.2806488513578588,"spread":0.2667230540098249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001303169,0.0002998086,0.0005387713,0.00007271362,0.001102087,0.00006977189,0.0008412211,0.0002559902,0.00006165656],"category_scores_gemma":[0.004509164,0.0002009416,0.0003450233,0.0003458722,0.001277955,0.00006281111,0.0004723804,0.0004917571,0.00002502794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003988321,"about_ca_system_score_gemma":0.00004383587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008362223,"about_ca_topic_score_gemma":0.000002200609,"domain_scores_codex":[0.9974541,0.0005774031,0.0006150543,0.0003262706,0.0004899632,0.000537218],"domain_scores_gemma":[0.9920705,0.005841566,0.0002304796,0.001310612,0.0003598327,0.0001870005],"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.00003474372,0.0002680216,0.001510306,0.0003087681,0.0000743694,0.000003051135,0.0008539459,9.836391e-8,0.00004519651,0.9871724,0.006350733,0.003378416],"study_design_scores_gemma":[0.0004272375,0.0002332562,0.003157936,0.00006735881,0.0001783886,0.00000957824,0.0001674013,0.0001776591,0.001528589,0.9744638,0.0193455,0.0002432745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8085126,0.007624532,0.004716403,0.003626686,0.02063126,0.001071241,0.00004158948,0.0002618882,0.1535138],"genre_scores_gemma":[0.9986406,0.0001809982,0.000271081,0.0001012167,0.0001590402,0.000006567842,9.278875e-7,0.00003926413,0.0006002982],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.190128,"threshold_uncertainty_score":0.8476476,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103315245","doi":"10.1007/s00493-014-2952-3","title":"An analogue of the Erdős-Stone theorem for finite geometries","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"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; Disjoint sets; Integer (computer science); Rank (graph theory); Equivalence (formal languages); Discrete mathematics","authors":[{"name":"Jim Geelen","is_ca":true},{"name":"Peter Nelson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02408680668586328,"gpt":0.2899653813466785,"spread":0.2658785746608153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064527,0.0001283921,0.0002606502,0.00008526379,0.0002735677,0.00001573317,0.0005747885,0.00008902277,0.00002332498],"category_scores_gemma":[0.001395977,0.00007822068,0.0001527755,0.000321386,0.000208978,0.00005303485,0.0001072418,0.00008633415,8.798681e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001682868,"about_ca_system_score_gemma":0.00001569955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000304105,"about_ca_topic_score_gemma":0.000001356294,"domain_scores_codex":[0.9990855,0.0001225498,0.0002439613,0.0001656321,0.0001874112,0.0001948926],"domain_scores_gemma":[0.9973209,0.001539216,0.0001777323,0.0007843358,0.0001263155,0.00005148652],"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.00002134508,0.00008245713,0.000800661,0.00006121433,0.00002750972,9.391232e-8,0.0004247197,0.000004390023,0.0001579564,0.9956926,0.001321407,0.001405608],"study_design_scores_gemma":[0.0004340099,0.0001842612,0.001581899,0.00001520388,0.00004258106,0.00000110889,0.00006139171,0.000250533,0.005535424,0.9832253,0.008558553,0.0001097222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.959761,0.0002141398,0.02387392,0.0003741749,0.002023073,0.0007270696,0.00006866232,0.0001313698,0.01282659],"genre_scores_gemma":[0.9984841,0.000006059545,0.001075165,0.0001281958,0.00005798497,0.00001630524,0.000003544166,0.00002322682,0.0002054498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03872306,"threshold_uncertainty_score":0.3189747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4380629273","doi":"10.1007/s00493-023-00024-9","title":"An Improved Bound for the Linear Arboricity Conjecture","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Conjecture; Mathematics; Combinatorics","authors":[{"name":"Richard Lang","is_ca":true},{"name":"Luke Postle","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0285011873157183,"gpt":0.3302096999786039,"spread":0.3017085126628856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006937602,0.0001313843,0.0001411726,0.0001035604,0.0005314302,0.0001478847,0.001890425,0.00006673247,0.000004375251],"category_scores_gemma":[0.0002286969,0.00009128798,0.00008283336,0.001448285,0.0001016313,0.0002919698,0.0002781736,0.0002394144,0.00004881157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005110918,"about_ca_system_score_gemma":0.00008405125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008093538,"about_ca_topic_score_gemma":0.000001686589,"domain_scores_codex":[0.9986487,0.00009058371,0.0001388826,0.0003999512,0.0002480846,0.0004737652],"domain_scores_gemma":[0.9976517,0.0008980173,0.00005291156,0.001118386,0.000153306,0.0001256749],"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.00002878985,0.0001073414,0.0001542232,0.00002177834,0.00003231963,0.00001050168,0.0004356198,0.0002012319,0.003176876,0.9720955,0.003838858,0.0198969],"study_design_scores_gemma":[0.0006540589,0.0004340695,0.0009005463,0.000003510238,0.000005913136,0.000003410752,0.00004132702,0.3378202,0.00347966,0.6157857,0.04066979,0.000201917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03064331,0.0004584038,0.9595547,0.004395237,0.002005668,0.001293863,0.00001398265,0.001228629,0.0004061949],"genre_scores_gemma":[0.9958953,0.0000437156,0.002932208,0.0002213389,0.0001094284,0.0001941779,0.00000534968,0.00002329483,0.0005751561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.965252,"threshold_uncertainty_score":0.4087385,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962755011","doi":"10.1007/s00493-018-3859-1","title":"Improved Bounds for Rota's Basis Conjecture","year":2018,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"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; Matroid; Combinatorics; Disjoint sets; Conjecture; Rank (graph theory); Basis (linear algebra); Discrete mathematics; Geometry","authors":[{"name":"Sally Dong","is_ca":true},{"name":"Jim Geelen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00628664731631921,"gpt":0.2029663673454901,"spread":0.1966797200291709,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001219173,0.0001328873,0.0001639062,0.00005094003,0.0001281544,0.00003901236,0.000171925,0.0001024797,0.00005665069],"category_scores_gemma":[0.0000245798,0.0001254423,0.00008373619,0.00018282,0.00004708274,0.00005688271,0.00001520841,0.00008054731,0.0000425641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004337511,"about_ca_system_score_gemma":0.000009662911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003432343,"about_ca_topic_score_gemma":0.000002085252,"domain_scores_codex":[0.9993922,0.00001592376,0.0001392675,0.0001412184,0.0000604096,0.0002510364],"domain_scores_gemma":[0.9995264,0.00005314606,0.00002125969,0.0002664085,0.00005855181,0.00007417218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001113221,0.0001648959,0.0008502027,0.0004799103,0.0004153049,0.000006530828,0.002220996,0.00003078817,0.04217834,0.8146121,0.1217709,0.01715874],"study_design_scores_gemma":[0.002054883,0.0006960833,0.0004284656,0.00004278717,0.00005760295,0.00001552753,0.0001256045,0.01214655,0.07198358,0.1434068,0.7683808,0.0006613082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8779779,0.002499342,0.03673149,0.0002980533,0.01692689,0.001815842,0.00007011511,0.00248158,0.06119877],"genre_scores_gemma":[0.9989586,0.000004879018,0.0001147662,0.00004043472,0.0002190242,0.000100015,0.000004847601,0.00003595235,0.0005214528],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6712053,"threshold_uncertainty_score":0.5115388,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065653857","doi":"10.1007/s00493-009-2267-y","title":"On the edge-density of 4-critical graphs","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Brock University","funders":"Kempe Foundation","keywords":"Mathematics; Combinatorics; Conjecture; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","authors":[{"name":"Babak Farzad","is_ca":true},{"name":"Michael Molloy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02780676085578103,"gpt":0.2977040057446282,"spread":0.2698972448888472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002936496,0.0001108101,0.0001925,0.00004745738,0.00021392,0.00001018421,0.0002983428,0.00007008816,0.00006922567],"category_scores_gemma":[0.001233379,0.00006632514,0.0001192018,0.0001916093,0.0001830658,0.00002347912,0.0000495028,0.0002039066,0.000005536713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001409888,"about_ca_system_score_gemma":0.000009703784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.406071e-7,"about_ca_topic_score_gemma":9.015247e-8,"domain_scores_codex":[0.999172,0.000107106,0.0001834518,0.0001349762,0.0002322387,0.0001702728],"domain_scores_gemma":[0.997905,0.001392738,0.00005435033,0.0005134969,0.00008418866,0.00005025962],"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.00001557299,0.0001954453,0.00007148026,0.00001350248,0.00000919677,0.000003502264,0.0002280574,5.206399e-8,0.00007451585,0.9896837,0.009136464,0.0005685167],"study_design_scores_gemma":[0.0001456677,0.0001906589,0.001958024,0.00001679968,0.00002080039,0.000003676385,0.000029068,0.000007766638,0.002744391,0.994571,0.0002304881,0.00008171167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9503095,0.00009939226,0.0002010617,0.001863261,0.0007228981,0.0001659041,0.00000293058,0.0000804658,0.04655463],"genre_scores_gemma":[0.9992703,0.000005542304,0.0002068024,0.0003956485,0.00002000812,0.000002052458,2.652789e-7,0.000007970212,0.00009142477],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04896083,"threshold_uncertainty_score":0.2704661,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}