{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002150265,0.0008391612,0.001242197,0.002026446,0.0015616,0.002953416,0.002622696,0.001499009,0.0115543],"category_scores_gemma":[0.01211896,0.0006623416,0.000857993,0.004140111,0.001911483,0.006409242,0.002551286,0.002882798,0.001422284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001660385,"about_ca_system_score_gemma":0.0008421487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001395376,"about_ca_topic_score_gemma":0.002260739,"domain_scores_codex":[0.9984624,0.0005511274,0.00008258902,0.0003720874,0.0003206031,0.0002110803],"domain_scores_gemma":[0.991411,0.004398331,0.0004003388,0.002441591,0.0007334859,0.0006153072],"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.0001165158,0.0001081402,0.0007794355,0.0001457108,0.00002359079,0.0000357192,0.0001592013,0.0158349,0.002854022,0.8675222,0.008971318,0.1034492],"study_design_scores_gemma":[0.000021193,0.00001474462,0.0002150582,0.0000251615,0.00002559677,0.00006779057,0.00004969834,0.05672139,0.001801378,0.9334487,0.007592285,0.0000168855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1019376,0.0006229888,0.8577277,0.001307791,0.0002231839,0.0001013224,0.0006096043,0.0007764801,0.03669327],"genre_scores_gemma":[0.5269099,0.0008543518,0.4407851,0.0006328381,0.0002376193,0.0002530195,0.001006539,0.0008739372,0.02844665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0115543,"threshold_uncertainty_score":0.03865302,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002397774,0.000614289,0.001466481,0.002478742,0.00221551,0.003087604,0.002086697,0.002018654,0.006930941],"category_scores_gemma":[0.01902362,0.0005303599,0.001314103,0.001250872,0.005031805,0.004032773,0.003690578,0.002902708,0.0005265438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002772228,"about_ca_system_score_gemma":0.001300237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003108021,"about_ca_topic_score_gemma":0.002280239,"domain_scores_codex":[0.999002,0.0002814906,0.00004545586,0.000227887,0.0002102952,0.0002327545],"domain_scores_gemma":[0.9861814,0.008577429,0.001352046,0.001146097,0.0009960438,0.001747041],"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.00003240542,0.00001063247,0.0002982711,0.00003669047,0.00001464918,0.00007971464,0.0001667714,0.005097304,0.0006086268,0.9881727,0.001734146,0.003748029],"study_design_scores_gemma":[0.00002004281,0.00001071213,0.0001523638,0.00001106519,0.00001189553,0.00007242757,0.00005149518,0.04207562,0.0003023626,0.9563077,0.0009714483,0.00001285549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4365799,0.002305638,0.5021122,0.007390515,0.0004730365,0.0001095741,0.0004695657,0.001296809,0.04926284],"genre_scores_gemma":[0.9604277,0.0008821219,0.01530503,0.0004935015,0.0003281539,0.0001251903,0.0002479884,0.000255924,0.02193434],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006930941,"threshold_uncertainty_score":0.02318633,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00122479,0.0004849583,0.0007415172,0.002281333,0.002578746,0.003226989,0.001284646,0.0007246773,0.006736306],"category_scores_gemma":[0.004294893,0.0004294313,0.0005945057,0.002670072,0.003977968,0.006172828,0.001978232,0.001601435,0.0005143143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002560076,"about_ca_system_score_gemma":0.0009442605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004625856,"about_ca_topic_score_gemma":0.004744248,"domain_scores_codex":[0.9993477,0.0001102096,0.00003222863,0.0002376461,0.0001310409,0.0001411189],"domain_scores_gemma":[0.9953856,0.002303055,0.0005558709,0.0007903905,0.0004407493,0.0005243559],"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.0001123415,0.00003535559,0.00350762,0.00005261687,0.00001035799,0.00006846707,0.0003770535,0.006231276,0.001166951,0.9733037,0.002498492,0.01263573],"study_design_scores_gemma":[0.00002346129,0.00001958933,0.001548894,0.00001939326,0.00002749743,0.0001570481,0.0002545697,0.02611768,0.001233519,0.9648445,0.005724899,0.00002903865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6378888,0.001140802,0.2945144,0.002407891,0.000131342,0.00005717174,0.0006546873,0.000642313,0.06256267],"genre_scores_gemma":[0.9630621,0.0005908976,0.0218752,0.0002026815,0.0001304963,0.00007037073,0.0004855534,0.0001434061,0.01343925],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006736306,"threshold_uncertainty_score":0.0225352,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058108962","doi":"10.1007/s004930170003","title":"Integer and Fractional Packings in Dense Graphs","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":92,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Graph; Disjoint sets; Integer (computer science); Pairwise comparison; Discrete mathematics; Statistics","authors":[{"name":"Penny Haxell","is_ca":true},{"name":"V. Rödl","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02475962650583865,"gpt":0.2869424592811526,"spread":0.262182832775314,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00109842,0.000630732,0.001172531,0.0034309,0.003034553,0.005260074,0.001362391,0.001709506,0.005910738],"category_scores_gemma":[0.008467753,0.001064704,0.0006654641,0.003529652,0.005164072,0.008898443,0.002494329,0.002757056,0.0004243746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001834194,"about_ca_system_score_gemma":0.0005178489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002004687,"about_ca_topic_score_gemma":0.002361048,"domain_scores_codex":[0.9991797,0.0002325986,0.00005056747,0.0001490808,0.0002170217,0.0001709581],"domain_scores_gemma":[0.9955428,0.002796496,0.0006590048,0.0003539402,0.0002222605,0.0004254335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003165579,0.00002277418,0.0002159018,0.00002973587,0.000003243494,0.00005066073,0.0002960262,0.001629708,0.0002717191,0.9931243,0.0007589281,0.003565432],"study_design_scores_gemma":[0.000008364729,0.000004874006,0.0001359752,0.00001349064,0.000004276802,0.0000745447,0.0001233698,0.00456557,0.0001694315,0.9937841,0.001110928,0.000005184766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.750827,0.003379058,0.1306539,0.003293737,0.0003060176,0.00004273907,0.0003794359,0.0003388649,0.1107792],"genre_scores_gemma":[0.9633228,0.001361785,0.02134778,0.0003600207,0.0003584739,0.00006751223,0.0002994962,0.00008327502,0.0127988],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005910738,"threshold_uncertainty_score":0.01977336,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000697694,0.0006937237,0.0008223163,0.002402034,0.003098741,0.003933441,0.001306405,0.00246702,0.007692185],"category_scores_gemma":[0.004922796,0.0009756641,0.0006505226,0.002805996,0.003116974,0.004368859,0.00255395,0.002022212,0.0009267573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00122761,"about_ca_system_score_gemma":0.0008303251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001360787,"about_ca_topic_score_gemma":0.002283832,"domain_scores_codex":[0.9989663,0.000336363,0.00006522441,0.0001851923,0.0001885217,0.0002582817],"domain_scores_gemma":[0.9932088,0.004034301,0.0009590647,0.0006967231,0.0002921071,0.0008089917],"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.0004157122,0.0002006044,0.001899968,0.0001813967,0.00003488467,0.0007204167,0.001223236,0.01405941,0.009572553,0.946584,0.002876952,0.02223083],"study_design_scores_gemma":[0.00004241749,0.00005343517,0.0005258863,0.00004329413,0.0000173907,0.0002485806,0.0004004698,0.02783982,0.002738886,0.9663191,0.001750948,0.00001983551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8255804,0.0003440205,0.1378294,0.0008439441,0.0001825624,0.0000829679,0.0003122831,0.0005418167,0.03428267],"genre_scores_gemma":[0.9490333,0.0002767176,0.04052024,0.0002011151,0.00006580334,0.00008419185,0.0003046019,0.0001358595,0.009378044],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007692185,"threshold_uncertainty_score":0.02573293,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009651736,0.0006934918,0.0009933482,0.001434362,0.001163916,0.001685933,0.002055906,0.00145497,0.01064235],"category_scores_gemma":[0.006928919,0.0005980389,0.0007973064,0.001841833,0.002282142,0.003987113,0.003347465,0.002400435,0.001845735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001000413,"about_ca_system_score_gemma":0.000877457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006806367,"about_ca_topic_score_gemma":0.001318767,"domain_scores_codex":[0.9984776,0.0004337244,0.0000694101,0.000316437,0.0004920409,0.0002106972],"domain_scores_gemma":[0.9931666,0.003525792,0.0002496649,0.002464123,0.0003866817,0.0002071204],"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.0003145926,0.000173073,0.0005078246,0.0001862653,0.00004345114,0.0002719569,0.0003555109,0.05579437,0.0122411,0.7523254,0.008401752,0.1693849],"study_design_scores_gemma":[0.000029315,0.00003425251,0.000163303,0.00002811217,0.00002172214,0.0001293414,0.00003248296,0.1681041,0.006486464,0.8213948,0.003552237,0.00002390937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09637106,0.0004972828,0.8545401,0.00111792,0.0002984968,0.000159274,0.0004490995,0.00218652,0.0443802],"genre_scores_gemma":[0.724861,0.0004334309,0.2455568,0.0006540627,0.00036013,0.000218627,0.0006753229,0.0009987518,0.02624173],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01064235,"threshold_uncertainty_score":0.03560221,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001056743,0.0008652572,0.001961055,0.001462418,0.002852737,0.003323123,0.00176237,0.002834312,0.01982797],"category_scores_gemma":[0.005983338,0.001004815,0.00194569,0.001203883,0.003136448,0.0087978,0.006812153,0.007025394,0.00205206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00200392,"about_ca_system_score_gemma":0.0009751362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001074401,"about_ca_topic_score_gemma":0.001200852,"domain_scores_codex":[0.9984272,0.0001896795,0.00007718763,0.0005247993,0.0004198434,0.0003613333],"domain_scores_gemma":[0.9951448,0.002545974,0.0002521223,0.0005765663,0.0006611805,0.0008194221],"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.00009624645,0.00003718425,0.0001839091,0.00009130933,0.00001034832,0.0001012834,0.0002618691,0.00164248,0.002296034,0.9883663,0.002789904,0.004123098],"study_design_scores_gemma":[0.00003065959,0.00002717141,0.0001268846,0.0000190943,0.00001121123,0.0001047684,0.0001057451,0.005948518,0.001029444,0.9889048,0.00367661,0.00001514882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3349182,0.0007871222,0.3687167,0.009550147,0.001111236,0.0002866149,0.002238703,0.001836846,0.2805544],"genre_scores_gemma":[0.8977214,0.0005132464,0.05124686,0.001427982,0.0005662906,0.0002239543,0.001469593,0.0006971169,0.04613364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01982797,"threshold_uncertainty_score":0.06633115,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125752997","doi":"10.1007/s00493-009-2362-0","title":"Hamilton cycles in highly connected and expanding graphs","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Cograph; Indifference graph; Random graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Pathwidth; Graph; Variety (cybernetics); Chordal graph; 1-planar graph; Line graph; Computer science; Artificial intelligence","authors":[{"name":"Dan Hefetz","is_ca":false},{"name":"Michael Krivelevich","is_ca":false},{"name":"Tibor Szabó","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02254772965857041,"gpt":0.2961572810110416,"spread":0.2736095513524712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820872,0.0004324325,0.0005917154,0.002618523,0.001941741,0.002549259,0.0009595403,0.001045587,0.003868035],"category_scores_gemma":[0.004365021,0.0006410454,0.000373154,0.002395234,0.003452199,0.003429102,0.001570374,0.001446831,0.0002603261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001238589,"about_ca_system_score_gemma":0.0005392462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002864624,"about_ca_topic_score_gemma":0.004866639,"domain_scores_codex":[0.9995678,0.0001437524,0.00001960061,0.0000701344,0.0001274619,0.00007121922],"domain_scores_gemma":[0.9967505,0.002097081,0.0003965568,0.0001736922,0.0002294918,0.0003527914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001630538,0.00001226293,0.000264543,0.0000228924,0.000004172922,0.0001067341,0.0004604275,0.001380722,0.0004970623,0.9933487,0.0006482766,0.003237928],"study_design_scores_gemma":[0.000007743432,0.000003377053,0.000163889,0.000005502942,0.000004360231,0.00005605313,0.00009623701,0.003289025,0.0001527667,0.9951764,0.001040166,0.000004555021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8440845,0.002221328,0.07090554,0.001712876,0.0001003215,0.00006999307,0.0002318377,0.0002290144,0.08044462],"genre_scores_gemma":[0.9678312,0.001087712,0.0120161,0.0002402314,0.0001762922,0.00009704688,0.0001593386,0.00005502248,0.01833709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003868035,"threshold_uncertainty_score":0.01293987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002232999,0.001661625,0.001486414,0.0012381,0.0007842761,0.002106786,0.002451098,0.001558279,0.01151084],"category_scores_gemma":[0.008071011,0.0009554601,0.001338929,0.001396092,0.0009705945,0.002672438,0.002552279,0.003108945,0.001541175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001293196,"about_ca_system_score_gemma":0.001047192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001236913,"about_ca_topic_score_gemma":0.00187334,"domain_scores_codex":[0.9984617,0.0007135163,0.00006099731,0.000230239,0.000331615,0.0002020222],"domain_scores_gemma":[0.9967011,0.002214716,0.0002006475,0.0004459297,0.0003154224,0.0001221246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002047172,0.0001434427,0.0002757476,0.000274266,0.00006096581,0.00008704007,0.0002116029,0.7628262,0.003304318,0.1129804,0.006897138,0.1127341],"study_design_scores_gemma":[0.00003950041,0.00009771458,0.00005356937,0.00004321824,0.00002184018,0.00004744807,0.00007724708,0.9229692,0.001675604,0.07238744,0.002571577,0.00001552334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01417356,0.0001959481,0.9720081,0.0002310815,0.00009619781,0.0001070008,0.00009831337,0.00030684,0.01278292],"genre_scores_gemma":[0.3112531,0.0003955441,0.6797051,0.0002342927,0.0001114753,0.0004683877,0.0003458321,0.000335013,0.007151236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01151084,"threshold_uncertainty_score":0.03850764,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00813034,0.003770742,0.004110609,0.004130126,0.00302756,0.008990509,0.007648179,0.004239417,0.02102987],"category_scores_gemma":[0.0447242,0.001858485,0.002023118,0.005713457,0.005757664,0.01873249,0.01095235,0.01136662,0.003418271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005813127,"about_ca_system_score_gemma":0.003156802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002307486,"about_ca_topic_score_gemma":0.004266403,"domain_scores_codex":[0.9935061,0.002263943,0.0002788544,0.0009708389,0.001940731,0.001039704],"domain_scores_gemma":[0.9517999,0.03882375,0.001464222,0.004211459,0.001666087,0.002034585],"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.001053228,0.0003842197,0.001128061,0.0009573931,0.0001573663,0.0001355559,0.00054755,0.1459871,0.002755353,0.7509508,0.03116742,0.06477609],"study_design_scores_gemma":[0.0001204336,0.00007823914,0.0002764122,0.0001331419,0.00007131402,0.0001060093,0.0001852358,0.186744,0.001060926,0.8040627,0.007114858,0.00004677807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09322341,0.014745,0.7486243,0.01660224,0.001463848,0.0003089431,0.002060841,0.001637754,0.1213337],"genre_scores_gemma":[0.5867971,0.01087897,0.3547045,0.004110439,0.002197227,0.0009766027,0.003034336,0.002213646,0.03508715],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02102987,"threshold_uncertainty_score":0.0703519,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111430057","doi":"10.1007/s00493-005-0036-0","title":"Proof Of A Conjecture Of Erdős On Triangles In Set-Systems","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Microsoft Research","keywords":"Conjecture; Combinatorics; Mathematics; Element (criminal law); Set (abstract data type); Discrete mathematics; Law; Computer science","authors":[{"name":"Dhruv Mubayi","is_ca":false},{"name":"Jacques Verstraëte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03945362164017345,"gpt":0.3051523326153394,"spread":0.2656987109751659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003329375,0.001531273,0.001900136,0.002435835,0.002660302,0.003309425,0.002747214,0.002550409,0.0230542],"category_scores_gemma":[0.02059796,0.001097867,0.00245074,0.002902657,0.007717445,0.01308814,0.009108966,0.009691969,0.002113797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0026294,"about_ca_system_score_gemma":0.001168024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002807269,"about_ca_topic_score_gemma":0.00202063,"domain_scores_codex":[0.9978698,0.0006262427,0.0001139674,0.0004690431,0.0006603959,0.0002604947],"domain_scores_gemma":[0.9811227,0.01378474,0.0006755914,0.001775031,0.001587799,0.001054165],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009737437,0.00007260955,0.000479549,0.0002191325,0.00003218989,0.0001931946,0.0005609462,0.001648079,0.0007474397,0.9751769,0.01353962,0.007232985],"study_design_scores_gemma":[0.00005073967,0.0000243016,0.0002622909,0.00004092493,0.00002390253,0.0001138478,0.0001132366,0.003862711,0.0003141522,0.9859096,0.009267585,0.00001670667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.187564,0.005468882,0.3854342,0.1121085,0.006840286,0.0003042507,0.002471302,0.001971391,0.2978372],"genre_scores_gemma":[0.8567197,0.003516896,0.0924035,0.00831488,0.003903299,0.0003963872,0.001514339,0.0005958978,0.03263514],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0230542,"threshold_uncertainty_score":0.07712394,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001235138,0.0007218083,0.0009981703,0.002032899,0.003557448,0.005885361,0.001346039,0.002351796,0.01163481],"category_scores_gemma":[0.002380527,0.0006134079,0.001239107,0.001461254,0.003971451,0.005478547,0.002475124,0.002806019,0.001061269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001323009,"about_ca_system_score_gemma":0.0006564095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005278219,"about_ca_topic_score_gemma":0.0008499333,"domain_scores_codex":[0.9982882,0.0005569862,0.0001272993,0.0002480826,0.0004574217,0.0003219638],"domain_scores_gemma":[0.9984254,0.0006553326,0.0001475443,0.0002943324,0.0002008304,0.0002766071],"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.00001750896,0.00001666532,0.00007427635,0.00001144605,0.000005031623,0.00006969524,0.00006413362,0.0003950546,0.0002333531,0.9975914,0.0003591813,0.001162351],"study_design_scores_gemma":[0.00001381187,0.000008122539,0.00009725826,0.000007847891,0.000005181952,0.00008347255,0.00006909481,0.003244764,0.000195222,0.994992,0.001270306,0.00001302397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6129776,0.001408205,0.1173984,0.003106851,0.0007359203,0.00006223639,0.0004626999,0.0003588243,0.2634893],"genre_scores_gemma":[0.963147,0.0004501752,0.01650764,0.000524828,0.0004153256,0.00008806562,0.0003854586,0.00009361448,0.01838793],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01163481,"threshold_uncertainty_score":0.03892225,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002367357,0.0003017515,0.000387302,0.0006957899,0.001046342,0.001361033,0.0007035774,0.0005140219,0.006486143],"category_scores_gemma":[0.00110923,0.0003625235,0.0005279223,0.0007507778,0.0008789264,0.001227286,0.0006842751,0.0006200384,0.0009216114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007013435,"about_ca_system_score_gemma":0.000467066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002394779,"about_ca_topic_score_gemma":0.004109287,"domain_scores_codex":[0.9996929,0.00009955911,0.00001334795,0.0000836534,0.00004568715,0.00006493955],"domain_scores_gemma":[0.998651,0.0006354598,0.0001651917,0.0002735193,0.000113806,0.0001610601],"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.0001950902,0.00006470371,0.002143312,0.000115569,0.00002193781,0.0003534556,0.0007100507,0.00663881,0.01280287,0.9513744,0.005588892,0.01999087],"study_design_scores_gemma":[0.00005346842,0.00003214118,0.00199118,0.00002548291,0.00004049448,0.0003325413,0.0003920268,0.02692184,0.00488212,0.9526998,0.01260494,0.00002386499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7285327,0.0005366245,0.1683458,0.00136824,0.0001491199,0.0001250738,0.001227637,0.0009230328,0.09879175],"genre_scores_gemma":[0.924616,0.0003265168,0.05019822,0.0003222064,0.00006397667,0.000125098,0.001281383,0.0002079241,0.02285883],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006486143,"threshold_uncertainty_score":0.0216983,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009756976,0.0004490714,0.0006399012,0.001471184,0.0009899508,0.002757573,0.0009917043,0.001014091,0.006025235],"category_scores_gemma":[0.005078909,0.0005244249,0.00050858,0.001773365,0.0009869786,0.004639392,0.001868463,0.001180384,0.0008245265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009795644,"about_ca_system_score_gemma":0.0007027581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000790193,"about_ca_topic_score_gemma":0.001109296,"domain_scores_codex":[0.9988286,0.0004106416,0.0000645644,0.0002213548,0.0003312591,0.0001435673],"domain_scores_gemma":[0.9969886,0.001382794,0.0004761267,0.0005133395,0.0003934882,0.0002456912],"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.0001468461,0.00007343889,0.0003815659,0.00005423138,0.00001957682,0.0001034528,0.0001387192,0.01311029,0.006037138,0.9532021,0.001582737,0.02514997],"study_design_scores_gemma":[0.000038878,0.00004976144,0.0002052659,0.00001457949,0.00001578296,0.0001877515,0.00006878765,0.1556668,0.004517975,0.8360604,0.003151885,0.00002211086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2128936,0.0003096926,0.7537858,0.0006599188,0.0001064001,0.00009875441,0.0002058835,0.0004426473,0.03149732],"genre_scores_gemma":[0.8494146,0.0003812035,0.1338588,0.0003097678,0.0001589214,0.0001291364,0.0002355022,0.000117448,0.01539473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006025235,"threshold_uncertainty_score":0.02015638,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005396437,0.0004598791,0.0006586039,0.001296321,0.001905011,0.003141545,0.001081983,0.001846461,0.01699571],"category_scores_gemma":[0.006552971,0.0003658246,0.0004194953,0.001277817,0.001427633,0.003775742,0.001443352,0.001424296,0.001620818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00151552,"about_ca_system_score_gemma":0.001037688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002699453,"about_ca_topic_score_gemma":0.004303871,"domain_scores_codex":[0.9992709,0.0001071222,0.00003485003,0.0001395101,0.0001148198,0.000332726],"domain_scores_gemma":[0.9933074,0.00366751,0.0004174797,0.001161326,0.0006526431,0.0007936109],"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.004351185,0.0005992053,0.0121186,0.0009002019,0.00008886758,0.003249177,0.001631025,0.05199105,0.1146416,0.594109,0.047631,0.1686891],"study_design_scores_gemma":[0.0003002033,0.0002933779,0.00373222,0.0001025407,0.00009091831,0.001784199,0.0009211157,0.1972363,0.06038371,0.7131594,0.02186123,0.0001347845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6807687,0.0005696194,0.2185686,0.003671799,0.0007101122,0.0002423173,0.0009152542,0.003820585,0.09073301],"genre_scores_gemma":[0.9370044,0.0003465589,0.0383498,0.0004804098,0.0001378791,0.00009436798,0.0006311469,0.0004190616,0.02253642],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01699571,"threshold_uncertainty_score":0.05685627,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000265734,0.001107646,0.001230975,0.000822627,0.001404453,0.00309052,0.001236106,0.001804005,0.01958376],"category_scores_gemma":[0.002763948,0.0009808103,0.0008080802,0.001889693,0.001194658,0.004314225,0.00239011,0.002474183,0.00353612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009957269,"about_ca_system_score_gemma":0.0005781022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007960834,"about_ca_topic_score_gemma":0.001550908,"domain_scores_codex":[0.9989908,0.0001674677,0.00004045467,0.0002312924,0.0002977482,0.000272147],"domain_scores_gemma":[0.9987387,0.0004640634,0.00008880728,0.0004915656,0.0001082025,0.0001085834],"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.0002399216,0.0002505789,0.0007177956,0.0003480387,0.00007296463,0.0003165198,0.0005064586,0.01268832,0.01449165,0.8524706,0.02532211,0.09257498],"study_design_scores_gemma":[0.00007957097,0.00007177801,0.0005933608,0.00006971268,0.00006323239,0.0003791091,0.0002866863,0.0328212,0.00974415,0.9318027,0.02406385,0.0000246212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3764549,0.001141839,0.2360365,0.001713747,0.0009271316,0.0002661956,0.001183297,0.002783512,0.3794928],"genre_scores_gemma":[0.84101,0.000994605,0.0771222,0.001397814,0.0002926041,0.0002225813,0.001901292,0.001116571,0.07594236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01958376,"threshold_uncertainty_score":0.06551421,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005171016,0.00120724,0.0008757064,0.002727411,0.002074849,0.003176562,0.00139731,0.00156054,0.01416965],"category_scores_gemma":[0.002044198,0.0006439044,0.0008553132,0.002528591,0.002654298,0.004914587,0.001848323,0.002273554,0.002007093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001336234,"about_ca_system_score_gemma":0.0006473606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002258435,"about_ca_topic_score_gemma":0.003164106,"domain_scores_codex":[0.9993973,0.0001851311,0.00002408207,0.0001125025,0.0001355041,0.0001455019],"domain_scores_gemma":[0.9979492,0.0008267991,0.000451405,0.0002216392,0.000234092,0.0003169307],"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.00004139709,0.0000255298,0.0002045061,0.00003975056,0.000008306126,0.0001902718,0.0002692033,0.001710604,0.001255831,0.988616,0.00187302,0.005765605],"study_design_scores_gemma":[0.00001403295,0.00001602342,0.0001865343,0.00001348952,0.000006478943,0.0001067012,0.0001178028,0.00364182,0.0004595054,0.993226,0.00220009,0.00001160992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.7150359,0.001827394,0.09506506,0.003383204,0.001043678,0.000112379,0.0006897238,0.0005151408,0.1823275],"genre_scores_gemma":[0.9247367,0.002196329,0.01420212,0.000896308,0.0008272254,0.0001017838,0.0007884589,0.0002670705,0.05598397],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01416965,"threshold_uncertainty_score":0.04740226,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008463931,0.00161692,0.001657266,0.002070448,0.002356894,0.003603279,0.00384069,0.003020441,0.01483044],"category_scores_gemma":[0.003981428,0.001196247,0.001577056,0.004507965,0.001614061,0.005613757,0.004790154,0.002481724,0.003907851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001848211,"about_ca_system_score_gemma":0.002523592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003493609,"about_ca_topic_score_gemma":0.005039864,"domain_scores_codex":[0.9988851,0.0001767585,0.0001015012,0.0003368193,0.0002766445,0.0002232999],"domain_scores_gemma":[0.9969258,0.001286348,0.0002502507,0.0008752259,0.0003090761,0.0003532447],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001011574,0.0009744744,0.002879915,0.000985136,0.0001881464,0.0003915268,0.001195057,0.0560699,0.02603804,0.1121498,0.03032837,0.7677881],"study_design_scores_gemma":[0.0005989967,0.0004484293,0.00145813,0.0001449553,0.0002373475,0.0006796551,0.0007686819,0.5042238,0.02451642,0.4467417,0.02004163,0.0001403003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07215099,0.000206785,0.9088176,0.0007985898,0.00014813,0.000489031,0.0008628506,0.005817136,0.01070884],"genre_scores_gemma":[0.09664979,0.0001129212,0.8966387,0.0001287763,0.00003250207,0.0002797848,0.001458363,0.0004053921,0.004293872],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01483044,"threshold_uncertainty_score":0.04961276,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001346953,0.0009787476,0.00135885,0.003330242,0.005163276,0.008144491,0.001339076,0.001416225,0.01816946],"category_scores_gemma":[0.003303374,0.001253624,0.001586943,0.002728866,0.006303038,0.01246707,0.005545245,0.003600133,0.002629673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002475513,"about_ca_system_score_gemma":0.001084139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001690179,"about_ca_topic_score_gemma":0.002375574,"domain_scores_codex":[0.9977838,0.0004796858,0.0001224237,0.0005783296,0.0004105432,0.0006252274],"domain_scores_gemma":[0.9978743,0.0007008909,0.0001515495,0.0004249756,0.0003788509,0.0004694783],"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.00001464701,0.000005105603,0.0000640332,0.000007560005,0.000001982849,0.00001408612,0.0001763968,0.0000647252,0.0001130983,0.9979318,0.0003762037,0.001230336],"study_design_scores_gemma":[0.000008086183,0.000005094102,0.00009878796,0.000009020866,0.000007367301,0.00004905418,0.0001852128,0.0005566363,0.0003170055,0.9951846,0.003570074,0.000009144155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4183356,0.001609564,0.2845475,0.002139801,0.0009828267,0.0001862373,0.001273949,0.001330687,0.2895937],"genre_scores_gemma":[0.9193448,0.0005459962,0.0246896,0.0003945428,0.0003563107,0.0001505334,0.0008246019,0.0005485599,0.053145],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01816946,"threshold_uncertainty_score":0.06078291,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003671823,0.00261108,0.002015519,0.003420473,0.004428559,0.007144355,0.005510385,0.00248017,0.02914331],"category_scores_gemma":[0.01556162,0.001037355,0.003449402,0.003862477,0.005883447,0.0124782,0.005716839,0.01256174,0.005968539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008639129,"about_ca_system_score_gemma":0.003946113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00977154,"about_ca_topic_score_gemma":0.01251741,"domain_scores_codex":[0.9944494,0.0006948233,0.0001168184,0.001419747,0.001417177,0.0019022],"domain_scores_gemma":[0.9801379,0.01280335,0.0009160678,0.002606836,0.001384894,0.002151016],"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.003370873,0.001131775,0.0072355,0.00146896,0.0002430415,0.0007672411,0.001038544,0.1054602,0.02484962,0.6582018,0.09597529,0.1002573],"study_design_scores_gemma":[0.0002830576,0.000394636,0.003415982,0.000345466,0.0003197237,0.0005694829,0.0003267237,0.2264225,0.0117763,0.7185719,0.03741571,0.0001585083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.189726,0.008124018,0.4460232,0.02875236,0.001791389,0.0005450206,0.004529057,0.003664672,0.3168443],"genre_scores_gemma":[0.840994,0.0042951,0.09046254,0.004123172,0.002777383,0.0006221842,0.003679516,0.001983417,0.05106273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02914331,"threshold_uncertainty_score":0.09749407,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002340275,0.0005305454,0.001136796,0.003854741,0.002547058,0.004813596,0.001479483,0.001529922,0.006509124],"category_scores_gemma":[0.0131321,0.0008430323,0.000612936,0.002503698,0.004027597,0.01220062,0.002309205,0.003563518,0.0006464793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002131519,"about_ca_system_score_gemma":0.0007668673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007211163,"about_ca_topic_score_gemma":0.001299126,"domain_scores_codex":[0.9992293,0.0002468163,0.00004559177,0.000177501,0.0001797177,0.0001210189],"domain_scores_gemma":[0.9891394,0.008273629,0.000878954,0.0004688367,0.0004147142,0.000824526],"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.00003937782,0.00001664959,0.0002587579,0.00005059839,0.000004328432,0.0000240676,0.0002968406,0.0009505855,0.0003850716,0.993543,0.001185005,0.003245691],"study_design_scores_gemma":[0.000009003977,0.000006518793,0.0001952474,0.00001657829,0.000007870758,0.00006311561,0.00007651132,0.003343272,0.0001972302,0.9945461,0.001528955,0.000009759093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6687508,0.006584154,0.1800903,0.008512049,0.0004660596,0.0001038359,0.0006899511,0.0006440713,0.1341587],"genre_scores_gemma":[0.9577808,0.002399005,0.02578915,0.0006557163,0.000476739,0.0002417989,0.0002799284,0.0001240028,0.01225295],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006509124,"threshold_uncertainty_score":0.02177519,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005502124,0.0004940802,0.0005776021,0.001745127,0.002233545,0.002865534,0.001160124,0.00173606,0.01961223],"category_scores_gemma":[0.005442576,0.0005777436,0.0004699001,0.001359483,0.001570836,0.004541841,0.00276864,0.002961894,0.002416591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006686393,"about_ca_system_score_gemma":0.0005161192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003680957,"about_ca_topic_score_gemma":0.0006169389,"domain_scores_codex":[0.9992803,0.0001943611,0.00002468617,0.0001722736,0.0002063235,0.0001221585],"domain_scores_gemma":[0.9963908,0.001494869,0.0003982754,0.0008133784,0.0004687361,0.0004339816],"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.00009357666,0.00006768771,0.000792987,0.00006387724,0.0000140251,0.0002377389,0.0002220968,0.001327524,0.003347579,0.9731289,0.006950314,0.01375387],"study_design_scores_gemma":[0.00001950651,0.00001489696,0.0003183798,0.00001551402,0.00001439337,0.0002303439,0.00009575279,0.005881099,0.001695861,0.9862524,0.005452779,0.000009049093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5467595,0.0007052126,0.1827239,0.005062561,0.0008356409,0.000181616,0.00145136,0.001370337,0.2609099],"genre_scores_gemma":[0.9168064,0.0003206496,0.02715766,0.001300272,0.0003589359,0.0001432485,0.001203453,0.0004636863,0.05224574],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01961223,"threshold_uncertainty_score":0.0656094,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002240444,0.0009988234,0.001862622,0.004848312,0.005918861,0.009210949,0.002472235,0.002472029,0.01334688],"category_scores_gemma":[0.007517509,0.002030896,0.001679832,0.009120577,0.006877128,0.01552677,0.006454732,0.008111654,0.002259664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002566397,"about_ca_system_score_gemma":0.001137698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001210908,"about_ca_topic_score_gemma":0.001034112,"domain_scores_codex":[0.9970832,0.0008904711,0.0001873111,0.0006901724,0.0007914427,0.0003572381],"domain_scores_gemma":[0.9917973,0.004885613,0.0006990607,0.001299207,0.0005924065,0.0007262682],"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.000009835328,0.000009081812,0.00009056786,0.00001300447,0.000003115933,0.00001764527,0.0001984467,0.0002073002,0.00006950465,0.9966269,0.0003987139,0.002355879],"study_design_scores_gemma":[0.000006087976,0.000003273329,0.00008005444,0.000008805951,0.00001002752,0.00005349973,0.0000644604,0.0008268994,0.0001043879,0.9959366,0.002899761,0.000006003699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2870855,0.002838817,0.4859536,0.005198809,0.0006628816,0.0002164591,0.001066806,0.0005993778,0.2163777],"genre_scores_gemma":[0.8651465,0.002146714,0.0661015,0.0007704213,0.0008786225,0.0003650247,0.000943189,0.0002446751,0.06340341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01334688,"threshold_uncertainty_score":0.04464978,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005213515,0.0007981068,0.0004745733,0.001533959,0.001439183,0.004465354,0.000700796,0.001135922,0.01044384],"category_scores_gemma":[0.002211164,0.0003140766,0.0004154225,0.001568731,0.003139032,0.003501598,0.0008662125,0.002643162,0.001472473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001114229,"about_ca_system_score_gemma":0.0006003825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006998325,"about_ca_topic_score_gemma":0.0008330012,"domain_scores_codex":[0.9995695,0.0001666414,0.00001928414,0.00006258695,0.0001299627,0.00005198353],"domain_scores_gemma":[0.9987215,0.0006683759,0.0002112008,0.0001326196,0.0001564633,0.0001098372],"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.000005883727,0.000006939828,0.00008328005,0.0000166748,0.000001583659,0.00001972619,0.00007678611,0.0002197125,0.0001400392,0.9951267,0.001763679,0.002538881],"study_design_scores_gemma":[0.000003061645,0.000002829138,0.00005707186,0.000005877515,0.000001690205,0.00004962515,0.00003478822,0.0007131416,0.00007041133,0.9954708,0.003587869,0.000002904363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2027028,0.01609628,0.2074919,0.01789077,0.002186405,0.00008965522,0.0008558173,0.0004207692,0.5522657],"genre_scores_gemma":[0.8963204,0.006779231,0.02376224,0.001626441,0.002567496,0.0001683809,0.0004723832,0.00008049088,0.06822302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01044384,"threshold_uncertainty_score":0.0349381,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001146687,0.0005370626,0.0006062987,0.001701463,0.002297075,0.003401049,0.001679091,0.001709091,0.0161766],"category_scores_gemma":[0.003530328,0.000232277,0.0006637214,0.001748566,0.004498822,0.004162321,0.00212849,0.00271897,0.001253693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002471508,"about_ca_system_score_gemma":0.0008917518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001686564,"about_ca_topic_score_gemma":0.002366906,"domain_scores_codex":[0.9993026,0.0001751599,0.00002698946,0.0001498428,0.0001689669,0.000176453],"domain_scores_gemma":[0.9988678,0.0005050672,0.0001220087,0.0002389329,0.0001072519,0.0001589933],"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.00007121392,0.000009860157,0.0001483454,0.00002005878,0.000003051873,0.00002199636,0.00008110485,0.0009373378,0.0002954264,0.9933537,0.001423903,0.003633985],"study_design_scores_gemma":[0.00004441268,0.00003577474,0.0007108378,0.00003801014,0.00002395496,0.000112895,0.0001940993,0.01086154,0.0008257367,0.9727313,0.01437961,0.00004171083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4347958,0.004582221,0.1082453,0.00848192,0.001998109,0.0001315177,0.0008131805,0.0004811069,0.4404708],"genre_scores_gemma":[0.9563037,0.0008198828,0.01642691,0.0005248816,0.0003164504,0.00008329692,0.0002460638,0.0001362407,0.02514255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0161766,"threshold_uncertainty_score":0.05411613,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001553493,0.0006458625,0.0009880963,0.005026816,0.002718792,0.004820593,0.002268797,0.001781065,0.007147362],"category_scores_gemma":[0.01108769,0.0008814638,0.0007246976,0.004263709,0.003398304,0.009024662,0.002760819,0.002095166,0.0005917166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002293888,"about_ca_system_score_gemma":0.0007720683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003970587,"about_ca_topic_score_gemma":0.005813116,"domain_scores_codex":[0.9988813,0.0002876688,0.00009343319,0.000202126,0.0003001057,0.0002354088],"domain_scores_gemma":[0.9918609,0.004950278,0.0007765321,0.0005452852,0.0007842153,0.0010829],"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.00003289239,0.00002735687,0.0007827451,0.00006043788,0.000004754555,0.00009216309,0.0005111007,0.00119232,0.0005567828,0.9890431,0.0009327505,0.006763576],"study_design_scores_gemma":[0.00001058441,0.000008967441,0.0002422589,0.00002505876,0.000009168488,0.0001030948,0.0001752707,0.009215084,0.00040973,0.9883336,0.001456699,0.00001055122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6621633,0.0009775666,0.2705676,0.001352784,0.000200366,0.00007011287,0.0004560954,0.0005864144,0.06362589],"genre_scores_gemma":[0.9519148,0.000601248,0.03198515,0.0002299736,0.000116834,0.00008358694,0.0004336688,0.0001330767,0.0145017],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007147362,"threshold_uncertainty_score":0.02391034,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000913093,0.0005470859,0.0006989157,0.003681602,0.001945087,0.003093687,0.001674441,0.001369267,0.01235503],"category_scores_gemma":[0.008123886,0.000711335,0.0004573458,0.001233091,0.002457814,0.002598327,0.001740848,0.001417484,0.0007619046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001496118,"about_ca_system_score_gemma":0.0007349559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001846077,"about_ca_topic_score_gemma":0.001802666,"domain_scores_codex":[0.9992854,0.0001979381,0.00002430867,0.0001154052,0.0002143022,0.0001626705],"domain_scores_gemma":[0.9949048,0.00281455,0.0005291263,0.0002964195,0.0005196483,0.0009356582],"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.00008998809,0.00003815404,0.001563226,0.00007729153,0.0000124527,0.000142931,0.0003691729,0.003449715,0.001916875,0.9855185,0.003233492,0.003588121],"study_design_scores_gemma":[0.00004582715,0.00002497443,0.002534417,0.00006196275,0.00002108102,0.0004070641,0.0003551666,0.04229671,0.001754752,0.9495164,0.00295604,0.0000256617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8623409,0.0006650729,0.04883714,0.001864088,0.000137102,0.00007082552,0.0004921322,0.0004300697,0.08516267],"genre_scores_gemma":[0.9864376,0.0002876225,0.005744364,0.0001970501,0.0001323294,0.00008798172,0.0004026463,0.00009536492,0.0066151],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01235503,"threshold_uncertainty_score":0.04133171,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004329275,0.0004975055,0.001046376,0.001888324,0.002097095,0.005650888,0.001009453,0.0009127172,0.01423857],"category_scores_gemma":[0.002562215,0.0006403786,0.0007999201,0.001727565,0.002901568,0.003883877,0.00176256,0.002522169,0.001097127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001802379,"about_ca_system_score_gemma":0.0008061928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003247789,"about_ca_topic_score_gemma":0.002675083,"domain_scores_codex":[0.9994893,0.00008027322,0.00002164005,0.00008767925,0.0002122805,0.0001086538],"domain_scores_gemma":[0.9984212,0.0008629191,0.0001472922,0.0001371318,0.0001724459,0.0002589966],"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.00006205367,0.00002056386,0.0004458346,0.00004879342,0.00001219332,0.00006482919,0.0001691271,0.004486993,0.0007920029,0.9864668,0.002508775,0.004921953],"study_design_scores_gemma":[0.00002504522,0.00001023749,0.0003941657,0.00001753998,0.000008906928,0.00007802117,0.0001549721,0.01447877,0.0006552458,0.9806415,0.003525888,0.000009635251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5700718,0.001417542,0.2137827,0.002404601,0.0001506052,0.0001629142,0.001700885,0.0002949256,0.2100141],"genre_scores_gemma":[0.9524209,0.0009324778,0.02102552,0.0001637276,0.0001787257,0.0001605184,0.001466014,0.0001322436,0.02351982],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01423857,"threshold_uncertainty_score":0.04763275,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006339825,0.0006185613,0.000781747,0.001469575,0.002495833,0.004798837,0.00167714,0.002203175,0.01451178],"category_scores_gemma":[0.00249143,0.0005857786,0.0007881511,0.001122464,0.004231364,0.003356638,0.002248328,0.002747079,0.001388397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007936346,"about_ca_system_score_gemma":0.0006994152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001374076,"about_ca_topic_score_gemma":0.001748358,"domain_scores_codex":[0.9991813,0.0002216324,0.00003473052,0.0001315438,0.0001805603,0.0002501721],"domain_scores_gemma":[0.9984276,0.0006011024,0.0002049312,0.0002816179,0.0001271811,0.0003574381],"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.00005317247,0.00002786132,0.0002679217,0.00002952609,0.000009235205,0.0004130998,0.0001882544,0.001282379,0.001244774,0.991982,0.001513711,0.002988085],"study_design_scores_gemma":[0.0000202467,0.00001061545,0.000151053,0.00001430725,0.000007006219,0.0003063907,0.0001795015,0.005284027,0.0007768236,0.9917441,0.001492125,0.0000137122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5739468,0.0009959337,0.08224744,0.002696702,0.0003792371,0.00007354932,0.0003135944,0.0006247679,0.338722],"genre_scores_gemma":[0.968626,0.0002229434,0.01402125,0.0003413343,0.00009261556,0.0000784091,0.0001260202,0.0001052272,0.0163862],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01451178,"threshold_uncertainty_score":0.04854679,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005695671,0.00153496,0.002919663,0.004183414,0.001997199,0.005795777,0.004802566,0.004219207,0.007517704],"category_scores_gemma":[0.06307461,0.002598234,0.001743053,0.002300175,0.007039803,0.007325448,0.00583477,0.004470935,0.0008639243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0032424,"about_ca_system_score_gemma":0.001007698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001609695,"about_ca_topic_score_gemma":0.001565672,"domain_scores_codex":[0.9968991,0.001284216,0.0001554624,0.0005071163,0.0007400948,0.0004139723],"domain_scores_gemma":[0.9280531,0.05732517,0.005520471,0.003477097,0.002327097,0.003297136],"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.0005104977,0.00008154645,0.003417255,0.0004312248,0.0001529769,0.0003367844,0.0004665957,0.1948106,0.003949797,0.7778866,0.007249897,0.01070629],"study_design_scores_gemma":[0.0001024582,0.0000747675,0.001006135,0.0001113815,0.0000527364,0.0002825999,0.0001452245,0.3963003,0.001848128,0.5981366,0.001881301,0.00005839047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3729547,0.003762224,0.5832007,0.006785437,0.0002965383,0.0001763155,0.001077194,0.0009466212,0.03080023],"genre_scores_gemma":[0.9054028,0.001955205,0.07540322,0.001150437,0.0004659758,0.0005739211,0.001057093,0.0006607458,0.01333067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007517704,"threshold_uncertainty_score":0.03012192,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009165394,0.0004785677,0.0006648828,0.002193613,0.001933181,0.003086904,0.0007622888,0.0007181917,0.009699902],"category_scores_gemma":[0.002326247,0.0005362846,0.0004442965,0.001408767,0.002320082,0.005438883,0.001856519,0.002082738,0.0009259966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001355236,"about_ca_system_score_gemma":0.0004523577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001709318,"about_ca_topic_score_gemma":0.002685182,"domain_scores_codex":[0.9995642,0.0001054599,0.00002119869,0.00007763734,0.0001166396,0.0001147508],"domain_scores_gemma":[0.9989552,0.0004710789,0.0001201708,0.00008759965,0.0001302289,0.0002355585],"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.00005111333,0.00001173839,0.0002305759,0.00002688571,0.000004006362,0.00002033784,0.0002788625,0.0005788004,0.0004797721,0.9946963,0.0007064246,0.002915129],"study_design_scores_gemma":[0.00001652939,0.00000884015,0.0003773841,0.00001968463,0.00001240597,0.00005105721,0.0002194161,0.001730743,0.0004607799,0.9938127,0.003277621,0.00001277087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6908087,0.001682753,0.08465749,0.002788036,0.0001945734,0.00004807005,0.0009173271,0.0003097832,0.2185932],"genre_scores_gemma":[0.9781045,0.0006725526,0.006234146,0.0002975042,0.000109879,0.00004273996,0.0003576379,0.00006794283,0.01411305],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009699902,"threshold_uncertainty_score":0.03244942,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002164277,0.0008054763,0.001589467,0.001465615,0.003563071,0.004372922,0.002703788,0.002732605,0.0119477],"category_scores_gemma":[0.009440373,0.001234057,0.001397322,0.001928032,0.006547141,0.01491475,0.005223422,0.006616929,0.001249412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001750412,"about_ca_system_score_gemma":0.0007824908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002171147,"about_ca_topic_score_gemma":0.001932379,"domain_scores_codex":[0.9981092,0.0005565381,0.00009941134,0.0005784131,0.0003129001,0.000343459],"domain_scores_gemma":[0.9902159,0.006029144,0.0005466515,0.001843734,0.0005021539,0.000862384],"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.00009207327,0.00003149128,0.0005783296,0.00004704751,0.000007719132,0.00007780865,0.000463786,0.001521298,0.0003458708,0.9897599,0.00302147,0.004053226],"study_design_scores_gemma":[0.00002134228,0.000009788453,0.0001826628,0.00001120297,0.000006457038,0.00006773016,0.0001667251,0.003666736,0.0003224908,0.9913879,0.004147656,0.000009230545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6763126,0.001940519,0.1437948,0.01872089,0.0007054005,0.0000761872,0.0009160072,0.0005793682,0.1569542],"genre_scores_gemma":[0.9366347,0.000930423,0.03083914,0.001483853,0.0004591392,0.00009102455,0.0007489665,0.0001686923,0.02864403],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0119477,"threshold_uncertainty_score":0.03996903,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00177593,0.0007137888,0.001392283,0.000963483,0.003430864,0.003037721,0.002279762,0.002904707,0.009425394],"category_scores_gemma":[0.007161419,0.0005846644,0.0009371481,0.002084576,0.004286366,0.01290046,0.003785024,0.004322036,0.0007381007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001465224,"about_ca_system_score_gemma":0.001016609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001348185,"about_ca_topic_score_gemma":0.001365942,"domain_scores_codex":[0.998991,0.0004738854,0.00003633308,0.0002056545,0.000165747,0.0001274214],"domain_scores_gemma":[0.9960186,0.002785045,0.0002151707,0.000400072,0.0002424177,0.0003387414],"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.00004756843,0.00002871991,0.0001148861,0.00005956537,0.000007172265,0.00006104501,0.0001648006,0.001909781,0.000199254,0.9882972,0.00491344,0.004196568],"study_design_scores_gemma":[0.0000158449,0.000004921487,0.00004397565,0.000009773462,0.000006109145,0.0000564715,0.00008093383,0.005135355,0.00009763507,0.9921917,0.002351662,0.00000552504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4701738,0.003404779,0.2103295,0.04333146,0.001186007,0.0001375258,0.0006763708,0.0006060076,0.2701546],"genre_scores_gemma":[0.9241851,0.002046862,0.0364973,0.002243122,0.0009622979,0.0001611415,0.0005048215,0.0001872297,0.0332122],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009425394,"threshold_uncertainty_score":0.0315311,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006806773,0.0006120973,0.0006755431,0.001309089,0.001089132,0.002008096,0.0007757664,0.0008358597,0.007631109],"category_scores_gemma":[0.003256999,0.0003101725,0.0005950726,0.001270607,0.001912538,0.006229048,0.002114923,0.002448108,0.0008058851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008982508,"about_ca_system_score_gemma":0.0002718719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005831145,"about_ca_topic_score_gemma":0.0002701385,"domain_scores_codex":[0.9995512,0.0001280709,0.00001948035,0.0001133627,0.0001302808,0.00005768226],"domain_scores_gemma":[0.9988745,0.0005994051,0.0001103598,0.0001642763,0.0001387128,0.0001127559],"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.00002638352,0.0000126004,0.0001632781,0.00003162331,0.000008274198,0.00002174848,0.0001769002,0.0009971141,0.0007074008,0.9907516,0.0009268324,0.006176167],"study_design_scores_gemma":[0.000005890775,0.00001362499,0.0001266657,0.000004592993,0.000007047995,0.00006002514,0.00005093194,0.006588179,0.000749584,0.9903054,0.002082963,0.000005166627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2970552,0.002534003,0.5851194,0.003313471,0.0005336641,0.0000855411,0.000366733,0.0004103147,0.1105818],"genre_scores_gemma":[0.9459571,0.001103192,0.02453077,0.0004259096,0.000556292,0.0001115631,0.0002305792,0.0001117038,0.02697281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007631109,"threshold_uncertainty_score":0.02552867,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009579795,0.0004886206,0.0007026196,0.004116267,0.002349687,0.00357569,0.001548194,0.0009858669,0.008156187],"category_scores_gemma":[0.008178436,0.0005651865,0.000693172,0.004026115,0.003299409,0.006065132,0.001618377,0.00193303,0.000583027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002271988,"about_ca_system_score_gemma":0.0009024707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002169947,"about_ca_topic_score_gemma":0.003578485,"domain_scores_codex":[0.99909,0.0001226705,0.00005672644,0.0003617734,0.0002290894,0.000139919],"domain_scores_gemma":[0.9908354,0.005140197,0.001196298,0.001347492,0.0005877025,0.0008927869],"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.0003020132,0.0001198101,0.01199196,0.0001370755,0.00002864161,0.0001836637,0.001266519,0.01590773,0.006056076,0.9344698,0.002400444,0.02713615],"study_design_scores_gemma":[0.00003173495,0.00004708424,0.00517915,0.00004485429,0.00004977965,0.0003598876,0.000465858,0.04797019,0.004197695,0.9372219,0.004393826,0.00003816337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8804739,0.0004162304,0.09550742,0.0007440448,0.00004368682,0.00006551792,0.001184706,0.0002657193,0.02129882],"genre_scores_gemma":[0.9693099,0.0003564873,0.02186606,0.00009916832,0.00008601172,0.00007676388,0.001144006,0.0001105438,0.006951235],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008156187,"threshold_uncertainty_score":0.02728516,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01261192,0.00300202,0.005699113,0.007079649,0.007250247,0.01019247,0.009413221,0.005648538,0.01937019],"category_scores_gemma":[0.07304186,0.004313932,0.004230701,0.007424436,0.01095758,0.03090852,0.01108678,0.0166661,0.002753902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005904443,"about_ca_system_score_gemma":0.001944622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002862764,"about_ca_topic_score_gemma":0.002669461,"domain_scores_codex":[0.9888675,0.00250582,0.0005415332,0.003410114,0.002596736,0.002078421],"domain_scores_gemma":[0.894988,0.08643423,0.003992104,0.006523333,0.002901765,0.005160552],"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.001117362,0.0002656188,0.003493339,0.0004476749,0.0001365965,0.0002703039,0.0013621,0.01252109,0.002045412,0.9475747,0.01557121,0.01519454],"study_design_scores_gemma":[0.00009266545,0.00004404424,0.0006481909,0.00007634508,0.0000775571,0.0001578262,0.0001645947,0.0198373,0.0009764265,0.9736473,0.004226546,0.0000513117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4482416,0.009254902,0.2836788,0.05409498,0.002129733,0.000382633,0.004442503,0.002256678,0.1955182],"genre_scores_gemma":[0.918117,0.003767418,0.04360279,0.00443352,0.004978992,0.0006374283,0.002111364,0.0007902748,0.02156118],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01937019,"threshold_uncertainty_score":0.06669903,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006586494,0.0005145047,0.001299194,0.001787537,0.00294278,0.00416262,0.002271275,0.001559439,0.01293687],"category_scores_gemma":[0.00470093,0.0008416008,0.001253559,0.002308997,0.003089783,0.00419627,0.002529863,0.002632484,0.001283262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002276024,"about_ca_system_score_gemma":0.000703322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002942807,"about_ca_topic_score_gemma":0.003493909,"domain_scores_codex":[0.9986608,0.0002191636,0.00005609987,0.0005294909,0.0002616003,0.0002729407],"domain_scores_gemma":[0.9944864,0.002321995,0.0005478419,0.0009423228,0.0006873059,0.001014138],"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.0001243469,0.00006459396,0.001178499,0.00007239708,0.00001683955,0.0001278493,0.0007632966,0.002294403,0.003231436,0.9774396,0.002998981,0.01168779],"study_design_scores_gemma":[0.00003658155,0.00002166982,0.0008894389,0.00001774544,0.00002023497,0.0002070631,0.0002065925,0.009882607,0.001223921,0.9821988,0.005280621,0.0000148598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6684651,0.0004189053,0.2655563,0.001432039,0.0002402428,0.0001559414,0.0006853154,0.0008648488,0.06218125],"genre_scores_gemma":[0.9243774,0.0002455298,0.04855545,0.0003301916,0.0002073235,0.0001085826,0.0007487235,0.0004178864,0.02500896],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01293687,"threshold_uncertainty_score":0.0432781,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003756135,0.0008079173,0.002845639,0.004180584,0.002558373,0.006266014,0.003404665,0.002779925,0.005715476],"category_scores_gemma":[0.03062379,0.001251525,0.001377937,0.002803289,0.007476996,0.01513636,0.004171155,0.004341021,0.0005738551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004022194,"about_ca_system_score_gemma":0.001323861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002940553,"about_ca_topic_score_gemma":0.002174329,"domain_scores_codex":[0.997735,0.0008218696,0.0001350658,0.0004555983,0.000456271,0.000396069],"domain_scores_gemma":[0.9636933,0.02745029,0.002253603,0.002166134,0.001364683,0.003072037],"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.00008567025,0.0000423523,0.0009138561,0.0000992208,0.00001661581,0.00009169233,0.000471914,0.005058143,0.0009464849,0.9876361,0.001360406,0.003277409],"study_design_scores_gemma":[0.00001765148,0.00001056335,0.0003074988,0.00002389814,0.00001315978,0.00007771688,0.00008358249,0.02602946,0.000239068,0.9727212,0.0004616608,0.00001463168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6858063,0.004844206,0.2402709,0.009897631,0.000281217,0.0001108596,0.00074936,0.0009776769,0.05706189],"genre_scores_gemma":[0.9805955,0.001408123,0.01032477,0.000592067,0.0003957464,0.0001162273,0.0002975877,0.0001998675,0.006070142],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006266014,"threshold_uncertainty_score":0.02918321,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008214921,0.002068116,0.004948751,0.004967889,0.002531863,0.009545278,0.007217721,0.006462222,0.006691589],"category_scores_gemma":[0.091038,0.003217438,0.002873475,0.003970787,0.007587801,0.02210185,0.007487856,0.01093858,0.001050294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00589032,"about_ca_system_score_gemma":0.001899195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001613633,"about_ca_topic_score_gemma":0.001424365,"domain_scores_codex":[0.9941755,0.001549352,0.0003711362,0.001469608,0.001319263,0.001115095],"domain_scores_gemma":[0.9001576,0.07969949,0.005468741,0.005027874,0.003301961,0.006344434],"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.001059166,0.0001727292,0.003366111,0.0008520248,0.0001326791,0.0003224998,0.001021577,0.03587304,0.007852519,0.9183963,0.009652257,0.02129906],"study_design_scores_gemma":[0.0001172288,0.0001382681,0.001504795,0.0001717017,0.0001264913,0.0004886337,0.0002424744,0.1525643,0.002718027,0.8386232,0.00320384,0.0001010206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2623022,0.01308988,0.6712405,0.01417315,0.0006332561,0.000273409,0.001724429,0.002150126,0.03441308],"genre_scores_gemma":[0.9177482,0.003831917,0.06702667,0.002371128,0.001253804,0.000400473,0.000806177,0.0004894237,0.006072418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009545278,"threshold_uncertainty_score":0.04344517,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001313773,0.0007693824,0.0008591286,0.001890535,0.001652373,0.002708047,0.0008658152,0.0006223767,0.01019837],"category_scores_gemma":[0.004547567,0.0006961928,0.001191723,0.00186622,0.002137533,0.005861625,0.002387198,0.001745834,0.001169742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001297079,"about_ca_system_score_gemma":0.0005758941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002502192,"about_ca_topic_score_gemma":0.003004122,"domain_scores_codex":[0.9987723,0.0003702899,0.00006600573,0.0003481474,0.0002033987,0.0002398564],"domain_scores_gemma":[0.9967293,0.001459274,0.0002964065,0.0007590141,0.0004378262,0.0003181701],"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.00006530918,0.00003271798,0.0002638343,0.00006222308,0.00001326036,0.0001031421,0.0004559431,0.004330726,0.001586866,0.9735339,0.001623907,0.01792806],"study_design_scores_gemma":[0.00001216323,0.00001628066,0.0001594325,0.00002873946,0.00001376184,0.00007744131,0.0001091632,0.009909109,0.0006780486,0.9814834,0.007500589,0.00001189054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1555467,0.001166633,0.7726406,0.0005528054,0.0002253923,0.0001125258,0.0006102261,0.0005634338,0.0685817],"genre_scores_gemma":[0.7880647,0.00130257,0.1773912,0.0003640135,0.0003481427,0.0001277728,0.0009315032,0.0003324029,0.03113777],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01019837,"threshold_uncertainty_score":0.03411698,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005757948,0.0006171751,0.0006403383,0.003290264,0.001254135,0.003669898,0.0009622675,0.001187966,0.01081263],"category_scores_gemma":[0.004413232,0.0005113658,0.0005056956,0.002333074,0.001902665,0.002456427,0.002258741,0.002130422,0.002200049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001135679,"about_ca_system_score_gemma":0.000499297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001369223,"about_ca_topic_score_gemma":0.001134541,"domain_scores_codex":[0.9992512,0.0001081347,0.00003771916,0.000100093,0.0003897538,0.0001130146],"domain_scores_gemma":[0.9985257,0.0006021733,0.0001946434,0.000175554,0.000336005,0.0001660187],"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.00009442509,0.00006726218,0.002087762,0.00005478503,0.000009456887,0.000303388,0.0003941046,0.02408098,0.003191531,0.9245104,0.002644149,0.04256183],"study_design_scores_gemma":[0.00003407938,0.00004520153,0.001103603,0.00004835544,0.00001256882,0.0005613736,0.0005031484,0.1437573,0.005229542,0.83487,0.01380312,0.00003179528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4213493,0.0004009642,0.4730519,0.0007227815,0.0001806456,0.0001295655,0.0004822536,0.0005790154,0.1031035],"genre_scores_gemma":[0.912408,0.0006296521,0.06219517,0.00008443706,0.00009282303,0.00005741953,0.0004316913,0.0003666663,0.02373412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01081263,"threshold_uncertainty_score":0.03617191,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009339895,0.0005284086,0.0007544808,0.00328758,0.003108276,0.006329975,0.001081758,0.001676352,0.01252004],"category_scores_gemma":[0.004554853,0.0007925798,0.0005935081,0.003989604,0.006210968,0.01339366,0.002264933,0.004328425,0.001814254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002167664,"about_ca_system_score_gemma":0.0005891572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002321302,"about_ca_topic_score_gemma":0.002179994,"domain_scores_codex":[0.9990237,0.0004468589,0.00004700547,0.0002070299,0.0001927345,0.00008274712],"domain_scores_gemma":[0.997463,0.001474438,0.0002837789,0.0002498031,0.0003219389,0.0002070968],"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.000004675459,0.000004724612,0.00007807495,0.00001398264,0.000001613709,0.00001730228,0.0002324386,0.0001530642,0.00007109822,0.9965202,0.0008735141,0.002029394],"study_design_scores_gemma":[0.000003396834,0.000001659829,0.00004837426,0.000008612208,0.000003047499,0.00002973033,0.00008047424,0.0004811355,0.00006179891,0.9937652,0.005513604,0.00000300154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2123836,0.01177456,0.300742,0.01222532,0.0007928847,0.0001008084,0.0008495856,0.0008861877,0.460245],"genre_scores_gemma":[0.8562795,0.005521602,0.0414992,0.001511473,0.001254246,0.0002283747,0.0005855023,0.0003577592,0.09276242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01252004,"threshold_uncertainty_score":0.04188371,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001046333,0.001113944,0.0006385357,0.003732708,0.002437941,0.00455776,0.001039308,0.001165795,0.004659867],"category_scores_gemma":[0.001831096,0.0007279731,0.0006719621,0.002167133,0.003492699,0.005260618,0.001886497,0.002555658,0.001004084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00119702,"about_ca_system_score_gemma":0.0006168534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001899578,"about_ca_topic_score_gemma":0.001868417,"domain_scores_codex":[0.9990822,0.0003161051,0.00005126997,0.0001885553,0.000214979,0.0001468974],"domain_scores_gemma":[0.9986749,0.0004721733,0.0002721598,0.00009878355,0.0002417702,0.0002401408],"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.00004359546,0.00001666994,0.0002107923,0.0000169327,0.000004376135,0.00007777708,0.0003004549,0.0004871498,0.0005614361,0.995123,0.0004642276,0.00269355],"study_design_scores_gemma":[0.0000272043,0.00002625309,0.0003412309,0.00002216618,0.000008749676,0.0001572935,0.0002877154,0.002030534,0.0005663296,0.9924082,0.004109462,0.00001476133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7673143,0.001589077,0.1001845,0.00159802,0.0002941684,0.00008526634,0.0006729087,0.0001994639,0.1280622],"genre_scores_gemma":[0.9463948,0.001445023,0.02680865,0.0002399939,0.0002886741,0.0001264674,0.000600922,0.0001435108,0.02395185],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004659867,"threshold_uncertainty_score":0.01558876,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004904825,0.0005988012,0.0006352136,0.001037119,0.002034131,0.001882786,0.001032203,0.001569317,0.01143818],"category_scores_gemma":[0.002213088,0.0003854326,0.0005042453,0.0008698418,0.001493788,0.003750436,0.001051396,0.001153194,0.001674459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008322004,"about_ca_system_score_gemma":0.000952288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000684053,"about_ca_topic_score_gemma":0.000748845,"domain_scores_codex":[0.9994481,0.00006271755,0.00003664494,0.0001525993,0.00009472948,0.0002051655],"domain_scores_gemma":[0.9972647,0.001274806,0.0003889568,0.0003189655,0.0002304725,0.0005220481],"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.004893563,0.000851583,0.01837432,0.00119667,0.0001521066,0.001559081,0.000971627,0.01986709,0.1410433,0.5691926,0.02483763,0.2170604],"study_design_scores_gemma":[0.0005313956,0.001025417,0.02086009,0.0002289487,0.0002796657,0.003387263,0.001138986,0.05361933,0.1435971,0.674448,0.1005621,0.0003218798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.872725,0.0006156513,0.04827448,0.00172656,0.0003931946,0.0001003477,0.0008158413,0.0008885186,0.07446046],"genre_scores_gemma":[0.9561167,0.000400536,0.02763511,0.0003658834,0.0001252109,0.000145655,0.001364903,0.0001151495,0.01373084],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01143818,"threshold_uncertainty_score":0.03826457,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005139719,0.0004605177,0.0004553912,0.002814121,0.001407229,0.003824343,0.001241022,0.0006419136,0.01328758],"category_scores_gemma":[0.002606208,0.0003367205,0.0003195044,0.001995338,0.002482048,0.002714993,0.001359855,0.0009908467,0.0007081899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001848382,"about_ca_system_score_gemma":0.0004585156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002717723,"about_ca_topic_score_gemma":0.004029735,"domain_scores_codex":[0.9995339,0.00007785965,0.00001938352,0.0001306099,0.0001218029,0.0001164299],"domain_scores_gemma":[0.9976909,0.001025161,0.0003883911,0.0002735909,0.000204128,0.0004178663],"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.0005959601,0.0001142519,0.0158498,0.0001600907,0.0000436151,0.0002886784,0.00128593,0.02115231,0.0134417,0.9165222,0.003784355,0.02676115],"study_design_scores_gemma":[0.00006884505,0.0001061234,0.01416876,0.00005125506,0.00007586733,0.0004559643,0.001199693,0.08700652,0.008570133,0.880661,0.007565127,0.00007065876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9617808,0.0001856843,0.01811279,0.0002594958,0.00002239287,0.0000169496,0.0003178415,0.0001344175,0.01916962],"genre_scores_gemma":[0.9926813,0.0001188138,0.002659536,0.00002820988,0.00003232296,0.00001514541,0.0003073633,0.00005715147,0.004100163],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01328758,"threshold_uncertainty_score":0.04445136,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001320951,0.0004850446,0.0009880131,0.005182042,0.001891561,0.003560754,0.001643481,0.001368459,0.004638573],"category_scores_gemma":[0.01546416,0.0009124759,0.0003810835,0.002476017,0.004080378,0.006068021,0.001963972,0.001667601,0.0002596509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001806304,"about_ca_system_score_gemma":0.0005508746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00191552,"about_ca_topic_score_gemma":0.001703151,"domain_scores_codex":[0.9993798,0.000231224,0.00002680043,0.00009710625,0.0001695908,0.00009540677],"domain_scores_gemma":[0.987519,0.009246206,0.0008045966,0.0005108662,0.0007612495,0.001158041],"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.00002431026,0.00001779337,0.00085761,0.00004204865,0.000006590562,0.00005059725,0.0002263616,0.002837586,0.000322601,0.9923682,0.0007905629,0.002455779],"study_design_scores_gemma":[0.000009949446,0.000005872139,0.0005221661,0.00002403358,0.000008886822,0.0001070232,0.0001118922,0.01702379,0.0002222426,0.9810647,0.0008897618,0.000009799979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8387796,0.002260522,0.1018723,0.002491376,0.00009618378,0.00004458596,0.0004319489,0.0002452789,0.05377823],"genre_scores_gemma":[0.9883477,0.000942929,0.005887813,0.0001649839,0.0001373902,0.000056622,0.0001763736,0.00004817501,0.004238009],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005182042,"threshold_uncertainty_score":0.01551759,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001865733,0.0008279408,0.00146322,0.002734329,0.002179306,0.003974059,0.001687407,0.002112892,0.01118471],"category_scores_gemma":[0.006205375,0.0005625289,0.001437211,0.002622496,0.006224432,0.01479784,0.004642331,0.004459933,0.001333122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001588311,"about_ca_system_score_gemma":0.0005781298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001158283,"about_ca_topic_score_gemma":0.0008146344,"domain_scores_codex":[0.9984772,0.0004373576,0.00009539207,0.0003978409,0.0004295401,0.0001627478],"domain_scores_gemma":[0.996913,0.00158929,0.0002732303,0.000535188,0.0004452415,0.0002440079],"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.000003798044,0.000003149217,0.00003415672,0.00001539079,0.000002295986,0.00001662276,0.00006066852,0.0001377995,0.00008864353,0.9980825,0.0004769028,0.001078119],"study_design_scores_gemma":[0.000004455716,0.00000313263,0.00004884841,0.000005657818,0.000002480969,0.00004171827,0.00002608906,0.0004321844,0.0000729548,0.9965315,0.002826906,0.000004052042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.111948,0.005021744,0.4144986,0.01191256,0.001388954,0.00008797618,0.0008997054,0.0004555052,0.453787],"genre_scores_gemma":[0.860998,0.004996226,0.06815922,0.003134383,0.00233643,0.0001889949,0.0006554072,0.0003279048,0.05920336],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01118471,"threshold_uncertainty_score":0.03741652,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004874858,0.002150425,0.002105775,0.003159657,0.002926561,0.00488833,0.005414177,0.003075155,0.0505234],"category_scores_gemma":[0.03247219,0.001279593,0.002964169,0.003288572,0.004292252,0.01649295,0.006537747,0.01127851,0.01023577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00423933,"about_ca_system_score_gemma":0.001932356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004171835,"about_ca_topic_score_gemma":0.004424318,"domain_scores_codex":[0.9921479,0.001591053,0.0002306276,0.002103157,0.002174242,0.001753093],"domain_scores_gemma":[0.9608895,0.02605749,0.001382876,0.006020074,0.003632145,0.002017892],"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.00217235,0.0007680749,0.008067281,0.001373135,0.000279316,0.001196112,0.0007883699,0.04946346,0.01161894,0.6262246,0.1952474,0.1028009],"study_design_scores_gemma":[0.0001935588,0.0002207603,0.001728951,0.000239282,0.0001494134,0.0006105324,0.0002048557,0.1462915,0.004224541,0.8092621,0.03678365,0.00009086584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1694728,0.01334497,0.4044329,0.04145906,0.004374544,0.0003980958,0.006483313,0.007400067,0.3526343],"genre_scores_gemma":[0.8472654,0.00508053,0.08265131,0.00797943,0.005110316,0.0004793181,0.007216856,0.00209466,0.0421222],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0505234,"threshold_uncertainty_score":0.1690176,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008853876,0.003980373,0.00553705,0.007124046,0.005755723,0.01158496,0.008505442,0.005776641,0.04708437],"category_scores_gemma":[0.04629451,0.00186697,0.003647562,0.007862682,0.009396739,0.02581637,0.01294238,0.01978611,0.01222705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006723432,"about_ca_system_score_gemma":0.00299104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0034978,"about_ca_topic_score_gemma":0.003728616,"domain_scores_codex":[0.9899713,0.002847234,0.0003355115,0.001828652,0.003181283,0.00183605],"domain_scores_gemma":[0.9436323,0.04302379,0.001305251,0.006795049,0.003044088,0.002199591],"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.0006916489,0.0002888148,0.001083513,0.0004912005,0.0000883134,0.0001892463,0.0005063315,0.009802677,0.001669772,0.9200491,0.03885343,0.02628604],"study_design_scores_gemma":[0.00005840305,0.00003168821,0.0002320406,0.0000836089,0.00005606324,0.0000723094,0.00007642757,0.02008775,0.0005852823,0.9730907,0.005589054,0.00003684155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1079473,0.01108429,0.3251802,0.04356127,0.004218134,0.0002927129,0.003880483,0.003594111,0.5002416],"genre_scores_gemma":[0.8149323,0.006529024,0.1018011,0.008985009,0.007291662,0.001172946,0.004093592,0.002491533,0.05270294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04708437,"threshold_uncertainty_score":0.1575129,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00182342,0.0006989767,0.001159641,0.004938236,0.002343361,0.002951083,0.002224739,0.001861915,0.005380956],"category_scores_gemma":[0.01353748,0.0008458731,0.0005029713,0.002149786,0.005590243,0.006451684,0.002489341,0.002265199,0.0003850996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00188558,"about_ca_system_score_gemma":0.0006572733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002085216,"about_ca_topic_score_gemma":0.001637505,"domain_scores_codex":[0.9992406,0.0003458858,0.00002736804,0.00008928162,0.0001854498,0.0001113745],"domain_scores_gemma":[0.9905837,0.006811948,0.00075622,0.0003502136,0.0005713983,0.000926548],"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.00002997559,0.00001836148,0.0004869211,0.00004051395,0.000005520081,0.0000493572,0.0002476735,0.002535619,0.0003702925,0.9935519,0.000703344,0.001960551],"study_design_scores_gemma":[0.000009475466,0.000006087772,0.0002980974,0.00002093835,0.000005419251,0.00006366665,0.00008764791,0.01124934,0.0001390824,0.9875671,0.000544328,0.000008846579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8389276,0.003900884,0.07946689,0.004218339,0.0001738638,0.00004820317,0.0002417172,0.0002455834,0.07277701],"genre_scores_gemma":[0.9846629,0.001357254,0.007559711,0.0002921413,0.000315004,0.00007057834,0.0001452418,0.00006671342,0.005530415],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005380956,"threshold_uncertainty_score":0.01800108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}