{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2515,"total_is_capped":false,"direct_labels_cover":3,"predictions_cover":2515,"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":"19ae3fcddb76","filters":{"topic":"Advanced Graph Theory Research"}},"results":[{"id":"W1984228559","doi":"10.1016/j.disc.2003.06.004","title":"Roman domination in graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":556,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Vertex (graph theory); Graph; Dominating set; Minimum weight; Discrete mathematics","authors":[{"name":"E. J. Cockayne","is_ca":true},{"name":"Paul Dreyer","is_ca":false},{"name":"Sandra M. Hedetniemi","is_ca":false},{"name":"Stephen T. Hedetniemi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01958927517900732,"gpt":0.2969287906505696,"spread":0.2773395154715623,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001221658,0.0004287591,0.0008472133,0.002350076,0.003170543,0.004080094,0.000851904,0.000992173,0.0104602],"category_scores_gemma":[0.005141162,0.0004488569,0.000594073,0.002336824,0.004230782,0.003896258,0.002065174,0.002514288,0.001235658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001485913,"about_ca_system_score_gemma":0.0006785092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001380567,"about_ca_topic_score_gemma":0.001473062,"domain_scores_codex":[0.9986069,0.0005692818,0.00004721972,0.0002053327,0.000314354,0.000256887],"domain_scores_gemma":[0.9973176,0.001433636,0.0003248587,0.0002358718,0.000342514,0.0003456055],"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.00001965614,0.00000481451,0.0001106281,0.00001394806,0.000002440501,0.00002522072,0.0002106039,0.0003309166,0.0001450556,0.9956381,0.0009191699,0.002579509],"study_design_scores_gemma":[0.00001237262,0.000005119821,0.0001458718,0.000008429284,0.000004858253,0.0000740917,0.00009883563,0.001681578,0.0001986707,0.9931184,0.004646265,0.000005581234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3851298,0.001662143,0.06799932,0.004307144,0.0003808227,0.00007716176,0.0002833628,0.0002539176,0.5399063],"genre_scores_gemma":[0.9387631,0.0007463815,0.007805411,0.0004479771,0.0002905792,0.00006188911,0.0001981192,0.0001021144,0.0515844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0104602,"threshold_uncertainty_score":0.03499287,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109693504","doi":"10.1145/1667053.1667060","title":"A constructive proof of the general lovász local lemma","year":2010,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":468,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Stavros Niarchos Foundation; Hungarian Scientific Research Fund","keywords":"Lemma (botany); Constructive; Constructive proof; Computer science; Mathematics; Discrete mathematics; Calculus (dental); Programming language; Process (computing)","authors":[{"name":"Robin A. Moser","is_ca":false},{"name":"Gábor Tardos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01698177873404861,"gpt":0.296070846226851,"spread":0.2790890674928024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002886405,0.00133565,0.001179972,0.002048715,0.002484264,0.003575466,0.002593233,0.001286494,0.01697149],"category_scores_gemma":[0.008677586,0.0009939995,0.002068537,0.001914218,0.005496642,0.004611745,0.006580953,0.004730647,0.004715377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001901713,"about_ca_system_score_gemma":0.002116103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00115354,"about_ca_topic_score_gemma":0.002124625,"domain_scores_codex":[0.9974287,0.0007497127,0.0001043543,0.0004640697,0.0009269655,0.0003260971],"domain_scores_gemma":[0.9951394,0.002702493,0.000234187,0.0006999753,0.0009432478,0.0002807346],"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.00004108459,0.00006081685,0.0001928993,0.0002048728,0.0000266331,0.0002130295,0.0003889145,0.003175395,0.003205662,0.9642188,0.007269904,0.0210021],"study_design_scores_gemma":[0.00008719756,0.00006480028,0.0002686583,0.0001096793,0.00006998073,0.0004260482,0.0001847725,0.01309757,0.005567458,0.9245849,0.05547221,0.00006673629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01296455,0.001662472,0.8981369,0.003431359,0.0006600666,0.0001738871,0.000436933,0.001183773,0.0813501],"genre_scores_gemma":[0.4710459,0.002993689,0.4815532,0.003698279,0.001340128,0.0006280179,0.0009277047,0.0009562234,0.03685676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01697149,"threshold_uncertainty_score":0.05677533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W280278083","doi":"10.1090/stml/061","title":"The Game of Cops and Robbers on Graphs","year":2011,"lang":"en","type":"book","venue":"Student mathematical library","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":332,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Business","authors":[{"name":"Anthony Bonato","is_ca":true},{"name":"Richard J. Nowakowski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01995840713689621,"gpt":0.2728467777638407,"spread":0.2528883706269445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002274358,0.0009103154,0.0007765627,0.0005315302,0.001429415,0.002796622,0.001048895,0.001093034,0.01918386],"category_scores_gemma":[0.001574108,0.0005004625,0.000655706,0.0008880736,0.001656085,0.004085002,0.00146513,0.002104703,0.003186991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001304271,"about_ca_system_score_gemma":0.000838815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00199353,"about_ca_topic_score_gemma":0.002803455,"domain_scores_codex":[0.9996475,0.00008105882,0.0000111146,0.00006699497,0.0001367583,0.00005652469],"domain_scores_gemma":[0.9996589,0.0001906108,0.00002351783,0.00003523639,0.00003609292,0.00005559006],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002749025,0.00001634764,0.0000671403,0.0001276294,0.00001570829,0.00007774051,0.0002728073,0.006427268,0.0004622645,0.8974732,0.06371154,0.03132075],"study_design_scores_gemma":[0.00001256745,0.00003784406,0.0002883103,0.0001392113,0.000012444,0.0002023232,0.0002705706,0.01502625,0.0004195926,0.7844861,0.1990836,0.00002124808],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.02514434,0.00681838,0.1589259,0.004541093,0.002050699,0.0001580202,0.0006435826,0.0005497661,0.8011683],"genre_scores_gemma":[0.2793751,0.009291502,0.0677062,0.001527046,0.001029194,0.0003569099,0.001268381,0.0005910946,0.6388546],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01918386,"threshold_uncertainty_score":0.06417644,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W179577048","doi":"10.1007/0-387-22444-0_4","title":"Algorithmic Aspects of Tree Width","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":283,"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":"Divide and conquer algorithms; Computer science; Graph; Graph theory; Theoretical computer science; Tree (set theory); Politics; Algorithm; Political science; Mathematics; Combinatorics","authors":[{"name":"Bruce A. Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0249769581685761,"gpt":0.2703662459958378,"spread":0.2453892878272617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006921442,0.0006201509,0.0006943084,0.001760156,0.001250361,0.004308336,0.001930607,0.001054948,0.01184711],"category_scores_gemma":[0.004660389,0.0008867495,0.000733633,0.004504352,0.003177891,0.01021799,0.001587203,0.004429692,0.002097048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001611541,"about_ca_system_score_gemma":0.0007617518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001165443,"about_ca_topic_score_gemma":0.001584964,"domain_scores_codex":[0.9993683,0.0001076241,0.00003099688,0.0001522753,0.0002613733,0.00007951367],"domain_scores_gemma":[0.998159,0.001134616,0.0001066896,0.0002914179,0.0002173859,0.00009086458],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001273706,0.00001284361,0.0001272236,0.00004964381,0.000003794274,0.00001379344,0.0001235382,0.001428622,0.0003243833,0.9718834,0.004279805,0.02174027],"study_design_scores_gemma":[0.000003000919,0.000003338107,0.00009940361,0.0000153912,0.000005706323,0.00003894294,0.00003861211,0.003084539,0.0002304695,0.9872012,0.00927578,0.000003612281],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.05191043,0.01159526,0.4265943,0.005699622,0.0007939108,0.00008710539,0.0005415253,0.0006014532,0.5021764],"genre_scores_gemma":[0.5545329,0.01466826,0.2667103,0.001351831,0.00261413,0.000335142,0.001175198,0.001149151,0.1574631],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01184711,"threshold_uncertainty_score":0.0396325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997048861","doi":"10.1016/j.tcs.2010.12.005","title":"On the complexity of reconfiguration problems","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":258,"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":"Control reconfiguration; Mathematics; Time complexity; Transformation (genetics); PSPACE; NP-complete; Computer science; Computational complexity theory; Combinatorics; Theoretical computer science; Algorithm","authors":[{"name":"Takehiro Ito","is_ca":false},{"name":"Erik D. Demaine","is_ca":false},{"name":"Nicholas J. A. Harvey","is_ca":true},{"name":"Christos H. Papadimitriou","is_ca":false},{"name":"Martha Sideri","is_ca":false},{"name":"Ryuhei Uehara","is_ca":false},{"name":"Yushi Uno","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04184605298491346,"gpt":0.2974343397464628,"spread":0.2555882867615493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004062533,0.001642264,0.002962803,0.002851429,0.002764161,0.007450954,0.004152395,0.004008743,0.02262225],"category_scores_gemma":[0.04520302,0.001434578,0.002688102,0.004500631,0.005984047,0.0214689,0.005302838,0.009148328,0.001504845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004300901,"about_ca_system_score_gemma":0.002205377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002486323,"about_ca_topic_score_gemma":0.00216789,"domain_scores_codex":[0.9938813,0.002261596,0.0002983935,0.0009184551,0.001719614,0.0009205737],"domain_scores_gemma":[0.9151074,0.07522281,0.00265537,0.003563008,0.001654019,0.001797492],"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.000501069,0.0002471372,0.001857828,0.0005782003,0.0001197939,0.0002672756,0.0005620129,0.07956664,0.0009215256,0.8589684,0.01901561,0.03739452],"study_design_scores_gemma":[0.00006089878,0.00002290867,0.0003259715,0.00002908485,0.0000272859,0.00008306509,0.00009457588,0.05641767,0.0001665702,0.9409225,0.001833452,0.00001608961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3688124,0.009878537,0.3570459,0.0449677,0.001105902,0.0003928645,0.002913579,0.001227183,0.213656],"genre_scores_gemma":[0.9109624,0.004972836,0.05435118,0.00196491,0.001856541,0.0004638374,0.002643329,0.0005967304,0.02218812],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02262225,"threshold_uncertainty_score":0.075679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976120600","doi":"10.1142/s0129054100000260","title":"ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES","year":2000,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":231,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Clique graph; Treewidth; Split graph; Vertex (graph theory); Chordal graph; Block graph; Bounded function; Graph; Pathwidth; Line graph; Graph power; 1-planar graph","authors":[{"name":"Martin Charles Golumbic","is_ca":false},{"name":"Udi Rotics","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02382651196834527,"gpt":0.3362367416029343,"spread":0.312410229634589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054373,0.0003025955,0.0003901796,0.001149104,0.0008734639,0.001719584,0.0007539029,0.0004423125,0.002233714],"category_scores_gemma":[0.005601342,0.000364445,0.0003972832,0.00102498,0.001914187,0.003416607,0.0009721887,0.0009519958,0.0001659174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001116865,"about_ca_system_score_gemma":0.0004120325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001665839,"about_ca_topic_score_gemma":0.001488971,"domain_scores_codex":[0.9994237,0.0001160072,0.00002208215,0.0001877651,0.0001130298,0.0001373666],"domain_scores_gemma":[0.9944561,0.004009391,0.0005132034,0.0003940843,0.0002322555,0.0003950461],"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.0006772538,0.0001288361,0.01337403,0.0002293605,0.0000750141,0.0002823367,0.001550283,0.04251962,0.0139515,0.8888129,0.004676673,0.0337222],"study_design_scores_gemma":[0.00005984877,0.0000866476,0.006958581,0.00005306111,0.00004532424,0.0003992618,0.0004893121,0.1047257,0.00497028,0.8750736,0.007097122,0.00004123443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9390916,0.0007694262,0.04584203,0.0008202693,0.00002168014,0.0000229358,0.0005413171,0.0001227723,0.01276787],"genre_scores_gemma":[0.9876752,0.0002562794,0.01020359,0.0000970467,0.00005454397,0.00002885129,0.0003355907,0.00005943309,0.001289491],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002233714,"threshold_uncertainty_score":0.00810349,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068571612","doi":"10.1007/s00039-007-0599-6","title":"Szemerédi’s Lemma for the Analyst","year":2007,"lang":"hu","type":"article","venue":"Geometric and Functional Analysis","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":229,"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":"Lemma (botany); Mathematics; Combinatorics; Graph; Graph theory; Discrete mathematics; Extremal graph theory; Line graph; Voltage graph","authors":[{"name":"László Lovász","is_ca":false},{"name":"Balázs Szegedy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04175281659476747,"gpt":0.2951102300940967,"spread":0.2533574134993292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001764324,0.0007014882,0.0009356359,0.002740818,0.002208135,0.003516103,0.001039258,0.001873369,0.01561938],"category_scores_gemma":[0.007031564,0.0004976992,0.001427585,0.002206865,0.004237012,0.009435488,0.003263487,0.006082034,0.003054173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00154924,"about_ca_system_score_gemma":0.0008971026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001030437,"about_ca_topic_score_gemma":0.0005135752,"domain_scores_codex":[0.999002,0.0002685483,0.00006456983,0.0002956816,0.0002375939,0.000131671],"domain_scores_gemma":[0.9977645,0.001245568,0.0001249311,0.0002959855,0.000454757,0.0001143362],"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.00001059599,0.000005031773,0.0000597553,0.000015125,0.00000428325,0.0000260704,0.00007623739,0.00009288372,0.0002505135,0.9936019,0.003033156,0.002824458],"study_design_scores_gemma":[0.000007349114,0.000004719104,0.0000795696,0.000005282778,0.000005839049,0.00008919868,0.00003100772,0.0006835973,0.0002810453,0.9854816,0.01332412,0.000006717935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05082265,0.004766816,0.5496439,0.04174871,0.002573479,0.0001134522,0.001176986,0.0005909165,0.3485631],"genre_scores_gemma":[0.7454224,0.005786462,0.09621192,0.007195945,0.003554825,0.0003513417,0.0007683799,0.0007383741,0.1399703],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01561938,"threshold_uncertainty_score":0.05225199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998140754","doi":"10.1016/s0012-365x(99)00206-x","title":"Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":209,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Variable neighborhood search; Combinatorics; Variable (mathematics); Combinatorial optimization; Discrete mathematics; Metaheuristic; Mathematical optimization","authors":[{"name":"Gilles Caporossi","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02401972062012517,"gpt":0.282112615871467,"spread":0.2580928952513418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001005891,0.0004163746,0.001587394,0.001106609,0.001371154,0.001712112,0.001850332,0.002075837,0.005914214],"category_scores_gemma":[0.006694944,0.0004946066,0.0006620444,0.0009744796,0.001629399,0.002721288,0.002245588,0.00169058,0.0003677851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001156757,"about_ca_system_score_gemma":0.0008447616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002898533,"about_ca_topic_score_gemma":0.003383013,"domain_scores_codex":[0.9994251,0.0002677588,0.00001364039,0.0001180545,0.00008285855,0.00009273905],"domain_scores_gemma":[0.9970023,0.001979483,0.0003026629,0.0002319271,0.0002123652,0.0002711317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002083713,0.00009094322,0.001425386,0.0001541068,0.00007880671,0.0001487747,0.0001848211,0.2426357,0.001293805,0.7297418,0.006324615,0.01771299],"study_design_scores_gemma":[0.00004270233,0.00003751281,0.0003088996,0.00001391798,0.00001452243,0.00005644621,0.00004810966,0.7045013,0.0002331767,0.2936725,0.001052095,0.00001872132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4741597,0.002144611,0.4898641,0.00257537,0.0001695604,0.0000935097,0.0004796521,0.0004216674,0.03009181],"genre_scores_gemma":[0.9354504,0.0006907402,0.05086321,0.0002736231,0.0001526608,0.00008853346,0.0003218207,0.0001247353,0.01203437],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005914214,"threshold_uncertainty_score":0.01978499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109716789","doi":"10.1016/s0166-218x(00)00221-3","title":"On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":208,"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; Bounded function; Treewidth; Combinatorics; Monadic predicate calculus; Enumeration; Discrete mathematics; Clique-width; Time complexity; Graph; Second-order logic; Computational complexity theory; Upper and lower bounds; Clique; Pathwidth; Algorithm; Line graph; Computer science; Theoretical computer science","authors":[{"name":"Bruno Courcelle","is_ca":false},{"name":"Johann A. Makowsky","is_ca":false},{"name":"Udi Rotics","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06192859394975599,"gpt":0.2857134996855245,"spread":0.2237849057357685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005181745,0.001744427,0.004024874,0.003207927,0.003301405,0.0121569,0.006136582,0.004392683,0.01225103],"category_scores_gemma":[0.03726053,0.001766376,0.003678062,0.005962366,0.007936001,0.03417212,0.004836021,0.01296517,0.0007069231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008603261,"about_ca_system_score_gemma":0.003143973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005638357,"about_ca_topic_score_gemma":0.00567391,"domain_scores_codex":[0.9937614,0.0021694,0.0002958984,0.001117286,0.001481826,0.001174247],"domain_scores_gemma":[0.9155617,0.07548557,0.00274061,0.00325881,0.001335275,0.001618057],"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.0005015825,0.0002592842,0.001899886,0.0003751868,0.0001316218,0.0002100306,0.0009234013,0.04880703,0.0009885556,0.9281124,0.003830359,0.01396059],"study_design_scores_gemma":[0.00005300789,0.00002845559,0.0004766602,0.00002736506,0.00005226756,0.00005727695,0.0001721171,0.05129047,0.0003892951,0.9466656,0.0007561978,0.0000313564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5915334,0.004622567,0.3033459,0.01649197,0.0003426591,0.000292884,0.002070631,0.0009757336,0.0803242],"genre_scores_gemma":[0.954481,0.001681289,0.02902131,0.0006455954,0.0004625304,0.0002768451,0.001569791,0.0003520492,0.0115096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01225103,"threshold_uncertainty_score":0.06242132,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115589427","doi":"10.1016/j.jctb.2011.07.004","title":"The disjoint paths problem in quadratic time","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":203,"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":"Disjoint sets; Minor (academic); Combinatorics; Time complexity; Mathematics; Mathematical proof; Discrete mathematics; Computer science; Algorithm","authors":[{"name":"Ken‐ichi Kawarabayashi","is_ca":false},{"name":"Yusuke Kobayashi","is_ca":false},{"name":"Bruce Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01470044315439314,"gpt":0.2461503881490396,"spread":0.2314499449946465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003323595,0.001678613,0.003715679,0.00157924,0.004073116,0.007370119,0.004779017,0.003424178,0.03061758],"category_scores_gemma":[0.02270089,0.001502729,0.002030603,0.004203006,0.004101832,0.01882637,0.003723567,0.007668439,0.002524596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004781063,"about_ca_system_score_gemma":0.0049293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007212472,"about_ca_topic_score_gemma":0.01111744,"domain_scores_codex":[0.9954011,0.00128993,0.0002005296,0.001130002,0.0008728429,0.001105539],"domain_scores_gemma":[0.97611,0.01907307,0.001081566,0.001504983,0.0008385185,0.001391952],"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.002827845,0.001148708,0.003382283,0.001598105,0.0003688738,0.000617218,0.001343483,0.1117618,0.003767293,0.6888465,0.0776092,0.1067287],"study_design_scores_gemma":[0.0003970301,0.00008296227,0.0005591901,0.00004844013,0.00008046801,0.0001674368,0.0002741521,0.09090938,0.0007076017,0.9014407,0.005304686,0.00002799014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5237767,0.00593305,0.2776088,0.03557843,0.001505275,0.0005125385,0.005797083,0.002294045,0.1469941],"genre_scores_gemma":[0.7975568,0.002901251,0.1261048,0.002233285,0.001607097,0.0004304636,0.005594946,0.001508427,0.06206309],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03061758,"threshold_uncertainty_score":0.1024261,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035278325","doi":"10.1016/j.jctb.2004.12.005","title":"A bound on the chromatic number of the square of a planar graph","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":195,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Alberta; University of New Brunswick","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Bounded function; Square (algebra); Chromatic scale; Planar; Graph; Upper and lower bounds; Quadratic equation; Discrete mathematics; Computer science; Mathematical analysis; Geometry","authors":[{"name":"Michael Molloy","is_ca":true},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01294776214586673,"gpt":0.2731152441474006,"spread":0.2601674820015338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002090973,0.002421381,0.0018447,0.004098985,0.002702144,0.005390184,0.004441593,0.00275892,0.02283406],"category_scores_gemma":[0.01732274,0.001372015,0.001426363,0.00331001,0.004141273,0.008908731,0.004757629,0.005848491,0.003814181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004412813,"about_ca_system_score_gemma":0.002094559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005660864,"about_ca_topic_score_gemma":0.01015348,"domain_scores_codex":[0.9976051,0.0003833756,0.0000757665,0.0007417615,0.0006184421,0.0005756416],"domain_scores_gemma":[0.9745525,0.01901954,0.0006826486,0.00235465,0.001363234,0.002027433],"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.003836078,0.0004925319,0.01005299,0.001619381,0.0004111196,0.0007454674,0.001141922,0.1180225,0.06760109,0.5813319,0.09475394,0.119991],"study_design_scores_gemma":[0.0002988275,0.0004992353,0.008850593,0.0003397159,0.0004664924,0.0009251498,0.0004895223,0.3293917,0.01757068,0.5976596,0.04322135,0.0002872162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3734955,0.01202721,0.2812958,0.01976221,0.0024619,0.0002665742,0.005239333,0.004382169,0.3010692],"genre_scores_gemma":[0.8824086,0.004376871,0.06972554,0.002329008,0.002256827,0.0003590795,0.003012513,0.001422987,0.03410854],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02283406,"threshold_uncertainty_score":0.07638752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2552451242","doi":"10.1017/cbo9780511977152","title":"Iterative Methods in Combinatorial Optimization","year":2011,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":194,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Matroid; Variety (cybernetics); Combinatorial optimization; Computer science; Mathematical optimization; Optimization problem; Theoretical computer science; Simple (philosophy); Mathematics; Algorithm; Artificial intelligence; Discrete mathematics","authors":[{"name":"Lap Chi Lau","is_ca":false},{"name":"R. Ravi","is_ca":false},{"name":"Mohit Singh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03728163721373292,"gpt":0.2879195756049232,"spread":0.2506379383911903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001706933,0.001937211,0.001353056,0.00130149,0.000652494,0.002778043,0.001637996,0.001293825,0.01566871],"category_scores_gemma":[0.004663978,0.0008887876,0.001513827,0.00260468,0.002138106,0.002737537,0.002056818,0.004317068,0.007713616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001568703,"about_ca_system_score_gemma":0.001330992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001244117,"about_ca_topic_score_gemma":0.001622033,"domain_scores_codex":[0.9983347,0.000546946,0.00005930203,0.0001989265,0.0007777369,0.00008240891],"domain_scores_gemma":[0.9985475,0.000959741,0.00005060758,0.0002089851,0.0001909468,0.00004225559],"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.00002173815,0.0000426396,0.0001514365,0.0004772912,0.00007382091,0.00006521062,0.0001708433,0.03113768,0.0007806048,0.759744,0.0588338,0.1485009],"study_design_scores_gemma":[0.00002245329,0.0000400104,0.0001810468,0.0002433311,0.00002890311,0.0001805847,0.00005800438,0.08121164,0.0007914755,0.6331838,0.2840278,0.0000309671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001379422,0.03212718,0.7853783,0.001744184,0.001842644,0.0001044413,0.0001761632,0.0008562296,0.1763915],"genre_scores_gemma":[0.05888978,0.04681454,0.6958222,0.001652224,0.002533401,0.0006758487,0.0006052505,0.001448296,0.1915585],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01566871,"threshold_uncertainty_score":0.0524171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118223706","doi":"10.1016/j.tcs.2005.09.011","title":"The complexity of partition functions","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":188,"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; Constraint satisfaction problem; Adjacency matrix; Homomorphism; Partition (number theory); Counting problem; Discrete mathematics; Time complexity; Equivalence (formal languages); Graph","authors":[{"name":"Andreĭ A. Bulatov","is_ca":true},{"name":"Martin Grohe","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04045361536678201,"gpt":0.3106491400712147,"spread":0.2701955247044327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003201347,0.001094156,0.002753211,0.003418571,0.003023327,0.01047362,0.004139638,0.003963979,0.01411941],"category_scores_gemma":[0.03620664,0.001503896,0.001773402,0.004699309,0.007716201,0.02666851,0.004552566,0.008126996,0.001334546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004726346,"about_ca_system_score_gemma":0.001832561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001989656,"about_ca_topic_score_gemma":0.001542984,"domain_scores_codex":[0.9955283,0.00142172,0.000170598,0.0007235969,0.00148632,0.0006694092],"domain_scores_gemma":[0.9477097,0.04373525,0.002099811,0.003519109,0.001351517,0.001584642],"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.0001135512,0.00004329123,0.001024214,0.00007478799,0.0000221987,0.00004599384,0.0002720108,0.007485757,0.0003302486,0.9799163,0.003558496,0.007113116],"study_design_scores_gemma":[0.00001901553,0.000006089757,0.0003508464,0.00001009851,0.00001065899,0.00004728551,0.00004329874,0.01504957,0.0001343451,0.9835235,0.0007946072,0.0000107259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6649363,0.004320522,0.1788,0.02888606,0.0004504453,0.0001111809,0.002127273,0.0005551264,0.119813],"genre_scores_gemma":[0.9715989,0.001659351,0.01170771,0.0007998447,0.0009226816,0.0001757881,0.001035055,0.0002488716,0.01185181],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01411941,"threshold_uncertainty_score":0.04723418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2754517646","doi":"10.3390/a11040052","title":"Introduction to Reconfiguration","year":2018,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":181,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control reconfiguration; Sequence (biology); Computer science; Graph; Space (punctuation); Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics","authors":[{"name":"Naomi Nishimura","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01935662206999441,"gpt":0.3025947238044617,"spread":0.2832381017344673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001220821,0.002140565,0.001338055,0.002171637,0.001500675,0.004466836,0.002775975,0.00312692,0.03360787],"category_scores_gemma":[0.004894023,0.0009831851,0.002053383,0.005224087,0.004543376,0.007071408,0.002676902,0.00628924,0.01382457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002492744,"about_ca_system_score_gemma":0.001708539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002257375,"about_ca_topic_score_gemma":0.001656755,"domain_scores_codex":[0.9973052,0.0004890963,0.000226726,0.0009999311,0.0007213824,0.0002576192],"domain_scores_gemma":[0.9965424,0.002047137,0.0001901202,0.0006155826,0.0004286698,0.0001761893],"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.00005404068,0.00004251688,0.0002644585,0.0009678903,0.00003480205,0.0001694079,0.0002725501,0.006583157,0.0008826502,0.7555308,0.07560375,0.159594],"study_design_scores_gemma":[0.00001116426,0.00003732544,0.0001871776,0.0003431243,0.00001656262,0.0005053128,0.00006833531,0.003597784,0.0003329188,0.3734744,0.6213996,0.00002618984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002895288,0.0959489,0.5852987,0.01341741,0.009695749,0.000352119,0.00172939,0.002474853,0.2881876],"genre_scores_gemma":[0.1196971,0.1839249,0.4999936,0.01963958,0.02281956,0.001313596,0.003709642,0.002220221,0.1466819],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03360787,"threshold_uncertainty_score":0.1124295,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020154454","doi":"10.1145/2556646","title":"Constraint Satisfaction Problems Solvable by Local Consistency Methods","year":2014,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":175,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Narodowe Centrum Nauki; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Constraint satisfaction problem; Local consistency; Consistency (knowledge bases); Constraint (computer-aided design); Constraint satisfaction; Mathematics; Computer science; Weak consistency; Mathematical optimization; Discrete mathematics; Strong consistency; Statistics","authors":[{"name":"Libor Barto","is_ca":true},{"name":"Marcin Kozik","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02909574141401513,"gpt":0.3354879927491539,"spread":0.3063922513351388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005139999,0.001399969,0.001536759,0.001654157,0.001761537,0.003309875,0.005314791,0.001567008,0.0113546],"category_scores_gemma":[0.02791284,0.0009093415,0.0021037,0.002744591,0.003637148,0.008699419,0.00618017,0.005770674,0.001877381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001337714,"about_ca_system_score_gemma":0.001801642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001979824,"about_ca_topic_score_gemma":0.002983413,"domain_scores_codex":[0.9916672,0.003147523,0.0004053403,0.001851916,0.002121665,0.0008063253],"domain_scores_gemma":[0.961121,0.02662718,0.002331189,0.007327891,0.001856779,0.0007359929],"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.0005877318,0.0004997778,0.005716462,0.001461046,0.0003466892,0.0005457805,0.00114872,0.08757669,0.01181469,0.625686,0.01410128,0.2505151],"study_design_scores_gemma":[0.0001997701,0.0001444302,0.0005342817,0.0001221583,0.0001715827,0.0001933964,0.0002172681,0.4824812,0.01301857,0.4956824,0.007172257,0.0000626502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02545973,0.0003287245,0.9617592,0.0007856917,0.00005364494,0.0001070355,0.0002224565,0.002061023,0.00922256],"genre_scores_gemma":[0.532428,0.0004373391,0.4551973,0.0006478455,0.0002827524,0.0008267915,0.0007962642,0.0007809419,0.008602746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0113546,"threshold_uncertainty_score":0.03798491,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032487621","doi":"10.1145/1970398.1970400","title":"Complexity of conservative constraint satisfaction problems","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Unary operation; Constraint satisfaction problem; Mathematics; Constraint satisfaction; Constraint (computer-aided design); Constraint logic programming; Set (abstract data type); Constraint programming; Time complexity; Complexity of constraint satisfaction; Mathematical proof; Constraint graph; Local consistency; Constraint satisfaction dual problem; Variable (mathematics); Discrete mathematics; Computer science; Mathematical optimization; Programming language","authors":[{"name":"Andreĭ A. Bulatov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1657644237840136,"gpt":0.3205390979875744,"spread":0.1547746742035607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00253899,0.000899161,0.001533691,0.001109462,0.001591641,0.005028519,0.00242991,0.001705794,0.007927727],"category_scores_gemma":[0.02234151,0.000780105,0.001836803,0.00244142,0.002318868,0.00772914,0.003285822,0.003635836,0.0006387244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002549093,"about_ca_system_score_gemma":0.002412698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003618662,"about_ca_topic_score_gemma":0.00308851,"domain_scores_codex":[0.9946123,0.001387564,0.0003995134,0.001003439,0.001847503,0.0007495611],"domain_scores_gemma":[0.975848,0.02001623,0.001356917,0.001232278,0.0009512145,0.0005953596],"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.000494025,0.0003694865,0.004519505,0.001323546,0.0002322392,0.0008531238,0.001800302,0.188233,0.00490579,0.7187564,0.01357538,0.06493719],"study_design_scores_gemma":[0.0001012123,0.00003448502,0.0006093357,0.00004380386,0.00005270306,0.0002730617,0.0003338548,0.1674775,0.001233981,0.8235508,0.006262268,0.00002706809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3349656,0.002319482,0.6031125,0.01176129,0.0001729506,0.0007171681,0.004504636,0.001321858,0.04112459],"genre_scores_gemma":[0.8446661,0.002002414,0.1324489,0.001190617,0.0003760655,0.0007913965,0.005834777,0.0003841152,0.01230563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007927727,"threshold_uncertainty_score":0.02652085,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070790034","doi":"10.1016/s0166-218x(02)00198-1","title":"Edge dominating set and colorings on graphs with fixed clique-width","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Combinatorics; Mathematics; Treewidth; Chordal graph; Discrete mathematics; Clique-sum; 1-planar graph; Brooks' theorem; Graph coloring; Indifference graph; Edge coloring; Independent set; Maximal independent set; Vertex (graph theory); Pathwidth; Dominating set; Bounded function; Graph; Line graph; Graph power","authors":[{"name":"Daniel Kobler","is_ca":true},{"name":"Udi Rotics","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02828176812337445,"gpt":0.2673533262481674,"spread":0.239071558124793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004595887,0.002039554,0.002866206,0.003311982,0.003587276,0.006434476,0.005371348,0.003037978,0.005198728],"category_scores_gemma":[0.02573365,0.002979124,0.002193664,0.005223938,0.005356824,0.01139072,0.003465266,0.004943234,0.0004206534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004996044,"about_ca_system_score_gemma":0.002106166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003228555,"about_ca_topic_score_gemma":0.004201893,"domain_scores_codex":[0.9976004,0.0007232152,0.0001033209,0.0007742243,0.0003830459,0.0004157881],"domain_scores_gemma":[0.9696275,0.02271122,0.002377128,0.002070511,0.001099226,0.002114451],"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.0006780269,0.0001914712,0.002558285,0.0003227893,0.0001340345,0.0001365885,0.0008112934,0.05812633,0.002415761,0.9156207,0.005633475,0.01337139],"study_design_scores_gemma":[0.0001327111,0.0000407635,0.000853604,0.00005103223,0.00007363366,0.0001818824,0.000214083,0.1036721,0.0006973271,0.8925911,0.001459966,0.00003174828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6366432,0.003753552,0.3173687,0.006663655,0.0003865756,0.0001971802,0.00240756,0.0005964102,0.03198319],"genre_scores_gemma":[0.9093967,0.00201014,0.07463661,0.0006951303,0.0006724992,0.0002967533,0.001338461,0.0003524274,0.01060126],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006434476,"threshold_uncertainty_score":0.03624904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033177498","doi":"10.1016/j.jctb.2004.11.001","title":"Planar graphs without cycles of length from 4 to 7 are 3-colorable","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Planar graph; Combinatorics; Mathematics; Conjecture; Graph coloring; Graph; Plane (geometry); Discrete mathematics; Geometry","authors":[{"name":"O. V. Borodin","is_ca":false},{"name":"A. N. Glebov","is_ca":false},{"name":"André Raspaud","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01415230470762358,"gpt":0.2708427278237021,"spread":0.2566904231160785,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009266,0.001487324,0.001335011,0.001538147,0.003303798,0.00554942,0.002260242,0.002163276,0.01687594],"category_scores_gemma":[0.00336873,0.00205515,0.001750267,0.002607953,0.00319445,0.003906892,0.001750125,0.003281735,0.00241165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002419076,"about_ca_system_score_gemma":0.001879049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004387541,"about_ca_topic_score_gemma":0.008460042,"domain_scores_codex":[0.9990512,0.0001170876,0.00004849911,0.000252535,0.0002139773,0.000316738],"domain_scores_gemma":[0.9925841,0.00341827,0.001684817,0.0009064298,0.000614716,0.0007916691],"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.005548683,0.001752986,0.0209865,0.001607274,0.000657262,0.002605591,0.003357837,0.03404739,0.1265148,0.623902,0.03648137,0.1425384],"study_design_scores_gemma":[0.0007158886,0.0005079602,0.02294677,0.0002078557,0.000635317,0.002218532,0.001926125,0.02653073,0.05720811,0.8590608,0.02773585,0.0003061438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9092131,0.0006446267,0.02354571,0.001156191,0.0001890951,0.0001870968,0.00207854,0.001375213,0.06161039],"genre_scores_gemma":[0.9531533,0.0006859889,0.02048508,0.0005459235,0.0000801855,0.0002189343,0.002667445,0.000523128,0.02163996],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01687594,"threshold_uncertainty_score":0.05645567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131358503","doi":"10.1016/j.ic.2006.09.005","title":"Towards a dichotomy theorem for the counting constraint satisfaction problem","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":137,"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":"Constraint satisfaction problem; Mathematics; Discrete mathematics; Counting problem; Homomorphism; Complexity of constraint satisfaction; Combinatorics; Time complexity; Class (philosophy); Constraint (computer-aided design); Constraint graph; Set (abstract data type); Constraint satisfaction dual problem; Constraint satisfaction; Local consistency; Computer science","authors":[{"name":"Andreĭ A. Bulatov","is_ca":true},{"name":"Víctor Dalmau","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01361824642734606,"gpt":0.278929148448292,"spread":0.265310902020946,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006097498,0.00113006,0.002738138,0.003144052,0.003867462,0.008166187,0.005002664,0.005099284,0.01461891],"category_scores_gemma":[0.02702711,0.001208374,0.002584398,0.003950836,0.007238871,0.01845817,0.009088867,0.01744456,0.001821282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003972527,"about_ca_system_score_gemma":0.002622185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001950521,"about_ca_topic_score_gemma":0.001709836,"domain_scores_codex":[0.994609,0.001765263,0.00022207,0.001130785,0.001543417,0.0007294407],"domain_scores_gemma":[0.977019,0.01903363,0.0005684256,0.001344159,0.001297311,0.0007375108],"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.00005296092,0.00005362959,0.000170767,0.00007373542,0.00001614176,0.00003599775,0.0001206566,0.001784111,0.000329024,0.9842934,0.005748023,0.007321541],"study_design_scores_gemma":[0.00001901765,0.000007373025,0.00004689908,0.00001502721,0.000006419561,0.00001688623,0.00002202447,0.01179651,0.0001209131,0.9866506,0.001291951,0.000006293223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05266651,0.001635686,0.8016187,0.03392016,0.001028921,0.0001808109,0.0008846699,0.0008131407,0.1072513],"genre_scores_gemma":[0.650587,0.002384215,0.2918137,0.01578589,0.0041702,0.001009122,0.002585296,0.0008948838,0.03076962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01461891,"threshold_uncertainty_score":0.04890507,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990941137","doi":"10.1002/jgt.20565","title":"Vizing's conjecture: a survey and recent results","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":136,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"Furman University","keywords":"Conjecture; Counterexample; Cartesian product; Mathematics; Combinatorics; Domination analysis; Product (mathematics); Graph; Upper and lower bounds; Discrete mathematics; Graph theory","authors":[{"name":"Boštjan Brešar","is_ca":false},{"name":"Paul Dorbec","is_ca":false},{"name":"Wayne Goddard","is_ca":false},{"name":"Bert L. Hartnell","is_ca":true},{"name":"Michael A. Henning","is_ca":false},{"name":"Sandi Klavžar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06090426272339177,"gpt":0.294004860554233,"spread":0.2331005978308412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004226734,0.0008901974,0.001607158,0.00379398,0.001744026,0.004268723,0.002321242,0.001911836,0.003552327],"category_scores_gemma":[0.009887331,0.0007035999,0.0007853212,0.008204582,0.005136959,0.009532583,0.002192794,0.003571281,0.0009611795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002424462,"about_ca_system_score_gemma":0.00147973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001953589,"about_ca_topic_score_gemma":0.0009139429,"domain_scores_codex":[0.9977628,0.0003794753,0.0001641309,0.0007648292,0.0006691568,0.0002596236],"domain_scores_gemma":[0.9883687,0.008532593,0.0006035116,0.0007702081,0.00133439,0.0003905541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003026627,0.0002038991,0.005943859,0.003717203,0.0001373792,0.0004141777,0.0006396814,0.007192086,0.001713395,0.6476235,0.02692392,0.3051883],"study_design_scores_gemma":[0.00004067917,0.0001327957,0.002968733,0.0008722086,0.0001039296,0.001293906,0.0007637528,0.01136023,0.002287525,0.7699436,0.2101368,0.00009586891],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.06490338,0.7363688,0.08383117,0.01892742,0.002052518,0.00006714695,0.0004652982,0.0003650917,0.09301918],"genre_scores_gemma":[0.5163074,0.4265836,0.03416339,0.003425838,0.009512418,0.0001055323,0.001383576,0.0001486509,0.008369502],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.004268723,"threshold_uncertainty_score":0.02235335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978292808","doi":"10.1090/s0002-9947-09-04874-0","title":"Varieties with few subalgebras of powers","year":2009,"lang":"lv","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Conjecture; Algorithm; Mathematics; Artificial intelligence; Computer science; Combinatorics","authors":[{"name":"Joel Berman","is_ca":false},{"name":"Paweł Idziak","is_ca":false},{"name":"Petar Marković","is_ca":false},{"name":"Ralph McKenzie","is_ca":false},{"name":"Matthew Valeriote","is_ca":true},{"name":"Ross Willard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01388077732672764,"gpt":0.2756073184042633,"spread":0.2617265410775357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001278174,0.000554653,0.001002582,0.001508341,0.003271668,0.005408452,0.0009652564,0.0007277213,0.01881184],"category_scores_gemma":[0.003409247,0.000687284,0.001470855,0.00152585,0.005245476,0.009948585,0.003823962,0.003192521,0.00378464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001692754,"about_ca_system_score_gemma":0.0007674558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001691963,"about_ca_topic_score_gemma":0.001734678,"domain_scores_codex":[0.9982312,0.0004427256,0.0001241721,0.0005523262,0.000427522,0.0002220465],"domain_scores_gemma":[0.9976664,0.001013468,0.0001982354,0.0005011806,0.0003607146,0.0002601006],"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.00003055585,0.000007930511,0.000213481,0.0000238464,0.000006563861,0.00005785866,0.00017617,0.0002145904,0.0002165143,0.9945294,0.001541869,0.002981205],"study_design_scores_gemma":[0.00001331807,0.000006406689,0.0001370514,0.00001108766,0.000006353541,0.00009100798,0.0001159825,0.0008971024,0.000262618,0.9920157,0.00643653,0.000006726959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2594966,0.00287744,0.2494928,0.007927897,0.0008156755,0.00009958891,0.001865149,0.001489243,0.4759355],"genre_scores_gemma":[0.9129037,0.0008581118,0.03114186,0.001012529,0.0006611938,0.00009372023,0.001392113,0.0003971455,0.05153968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01881184,"threshold_uncertainty_score":0.0629319,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101880654","doi":"10.1002/jgt.21637","title":"Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics; National Science Foundation","keywords":"Mathematics; Monotone polygon; Combinatorics; Graph; Forcing (mathematics); Path (computing); Minor (academic); Tree (set theory); Discrete mathematics; Computer science; Mathematical analysis; Geometry","authors":[{"name":"Francesco Barioli","is_ca":false},{"name":"Wayne Barrett","is_ca":false},{"name":"Shaun Fallat","is_ca":true},{"name":"H. Tracy Hall","is_ca":false},{"name":"Leslie Hogben","is_ca":false},{"name":"Bryan L. Shader","is_ca":false},{"name":"P. van den Driessche","is_ca":true},{"name":"Hein van der Holst","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01925852887274516,"gpt":0.2874328338617217,"spread":0.2681743049889766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001751389,0.0004125882,0.0004379262,0.001922545,0.0009369878,0.002123691,0.0009941747,0.0008648266,0.00344692],"category_scores_gemma":[0.009235154,0.0003379695,0.0004584446,0.0006979303,0.003059829,0.003473414,0.001701455,0.001410809,0.0003174495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007165485,"about_ca_system_score_gemma":0.0003728397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004545598,"about_ca_topic_score_gemma":0.0006374145,"domain_scores_codex":[0.9991333,0.0002679325,0.00006621733,0.000206175,0.0001887292,0.0001376369],"domain_scores_gemma":[0.9893504,0.006856739,0.00107188,0.0009969219,0.0007633271,0.0009608495],"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.0001525289,0.00004398597,0.004945216,0.00007588397,0.0000161244,0.0001416247,0.0003941309,0.01198493,0.01751662,0.9520162,0.0009329246,0.01177978],"study_design_scores_gemma":[0.00002731615,0.0001047226,0.002879284,0.00004996852,0.00001684351,0.0004501063,0.0003107194,0.06794512,0.01067813,0.9148034,0.002673722,0.00006081902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6851714,0.0003291492,0.2927517,0.0004260092,0.00006478823,0.00004348021,0.0003297201,0.0002908779,0.02059286],"genre_scores_gemma":[0.9729614,0.0001205782,0.02460891,0.00006285182,0.00005626773,0.00006697168,0.0001267851,0.0001110805,0.001885172],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00344692,"threshold_uncertainty_score":0.01153105,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2290756947","doi":"10.1017/cbo9781316414958","title":"Erdős–Ko–Rado Theorems: Algebraic Approaches","year":2015,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; University of Waterloo","funders":"","keywords":"Mathematical proof; Association scheme; Algebraic number; Intersection (aeronautics); Mathematics; Scheme (mathematics); Generalization; Discrete mathematics; Algebraic properties; Focus (optics); Combinatorics; Computer science; Algebra over a field; Pure mathematics; Geography; Geometry","authors":[{"name":"Chris Godsil","is_ca":true},{"name":"Karen Meagher","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05932091638277751,"gpt":0.2304805378386378,"spread":0.1711596214558603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001294218,0.0008072967,0.0007564307,0.002425444,0.001938915,0.004520578,0.001111531,0.001157374,0.009712214],"category_scores_gemma":[0.002501193,0.0005435764,0.000658293,0.003180312,0.004110612,0.00947034,0.002142797,0.004438301,0.003477834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003159687,"about_ca_system_score_gemma":0.0009050524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007373003,"about_ca_topic_score_gemma":0.0007669404,"domain_scores_codex":[0.9992212,0.0001603382,0.00003679667,0.0001174177,0.0004026795,0.00006145675],"domain_scores_gemma":[0.9990898,0.0004991296,0.00008243948,0.00011379,0.0001632928,0.00005152352],"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.000002990798,0.000004326319,0.00002422661,0.00006064187,0.000002587175,0.00001469735,0.00008646436,0.0002901248,0.00008017355,0.9832622,0.006761032,0.009410633],"study_design_scores_gemma":[0.000003717956,0.000007743625,0.0001052576,0.00007356552,0.000005268977,0.0001090083,0.0001157948,0.0008707928,0.0001717703,0.8217135,0.1768146,0.000008899327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.007337367,0.07953859,0.1437351,0.01361279,0.003007567,0.0000739697,0.0004116667,0.0003272054,0.7519557],"genre_scores_gemma":[0.3058379,0.2098007,0.1326734,0.006575878,0.009052022,0.0004062228,0.0007308433,0.0005507543,0.3343723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009712214,"threshold_uncertainty_score":0.03249061,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119305988","doi":"10.1017/s0963548301004758","title":"A Note on Vertex List Colouring","year":2001,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Conjecture; Mathematics; Graph; Discrete mathematics","authors":[{"name":"Penny Haxell","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03238984281134506,"gpt":0.3031178416169424,"spread":0.2707279988055973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002546254,0.0007093928,0.0009299457,0.001113607,0.002540449,0.002887483,0.00190481,0.001758443,0.006220721],"category_scores_gemma":[0.01519387,0.0005523718,0.0009495314,0.002277085,0.005189228,0.008547033,0.003570697,0.005735177,0.00184102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00229533,"about_ca_system_score_gemma":0.001066683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003727537,"about_ca_topic_score_gemma":0.002575101,"domain_scores_codex":[0.997337,0.0008280021,0.0001305334,0.0005430761,0.0006425797,0.0005187181],"domain_scores_gemma":[0.9865317,0.009147561,0.0004049576,0.002460033,0.0009197989,0.0005360684],"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.0003711393,0.00008750379,0.002294705,0.0003934985,0.00002855655,0.0004814311,0.0007389631,0.009401885,0.004140368,0.8514119,0.03752376,0.09312635],"study_design_scores_gemma":[0.00004442598,0.0001228666,0.0007093574,0.0001155611,0.00005380817,0.0004598743,0.0002117766,0.02158396,0.004943327,0.8706885,0.1010173,0.000049156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08483986,0.01586965,0.5983899,0.03520724,0.01062971,0.0002595744,0.0006002998,0.002688325,0.2515154],"genre_scores_gemma":[0.6707684,0.01313729,0.261851,0.007937414,0.004839303,0.0002452685,0.000521197,0.0007866382,0.03991356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006220721,"threshold_uncertainty_score":0.02081043,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018547288","doi":"10.1002/jgt.10073","title":"Bi‐arc graphs and the complexity of list homomorphisms","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Homomorphism; Graph homomorphism; Discrete mathematics; Vertex (graph theory); Graph; Line graph; Graph power","authors":[{"name":"Tomás Feder","is_ca":false},{"name":"Pavol Hell","is_ca":true},{"name":"Jing Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0487071365618233,"gpt":0.2748106614581519,"spread":0.2261035248963286,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001542645,0.0006947857,0.00104694,0.001680756,0.001340005,0.004629345,0.002550878,0.001862754,0.008861952],"category_scores_gemma":[0.01255299,0.0007339704,0.001333409,0.002662767,0.002008346,0.01234127,0.002554475,0.002560691,0.000663012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003177403,"about_ca_system_score_gemma":0.001717641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00365841,"about_ca_topic_score_gemma":0.002609501,"domain_scores_codex":[0.9970698,0.0008473305,0.0002350927,0.0007956306,0.0005270856,0.0005249192],"domain_scores_gemma":[0.9724844,0.02084452,0.002109478,0.00202665,0.001229967,0.001305073],"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.002285407,0.001344341,0.01661338,0.002271108,0.0004294068,0.0009856003,0.003015141,0.3876023,0.01806883,0.4218168,0.02031914,0.1252486],"study_design_scores_gemma":[0.0002098976,0.0001340041,0.002360842,0.00006622291,0.0001126205,0.0004577214,0.0007234256,0.3887682,0.0053932,0.5965469,0.005147039,0.0000799785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8097314,0.0009172129,0.1647372,0.004622635,0.00009111419,0.0003119432,0.004551261,0.001788954,0.01324825],"genre_scores_gemma":[0.945365,0.0005611283,0.0470975,0.0003034891,0.0001168673,0.0001951895,0.003137041,0.0001809051,0.003042907],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008861952,"threshold_uncertainty_score":0.02964622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102459557","doi":"10.2168/lmcs-8(1:7)2012","title":"Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Fundacja na rzecz Nauki Polskiej; Grantová Agentura České Republiky","keywords":"Unanimity; Mathematics; Conjecture; Constraint satisfaction problem; Variety (cybernetics); Characterization (materials science); Constraint (computer-aided design); Pure mathematics; Universal algebra; Combinatorics; Discrete mathematics; Algebra over a field","authors":[{"name":"Libor Barto","is_ca":true},{"name":"Marcin Kozik","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05866841925032519,"gpt":0.3937555524694554,"spread":0.3350871332191303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001297537,0.0002438261,0.0004722567,0.0008619681,0.001862204,0.002173283,0.0009476263,0.0008182228,0.002481448],"category_scores_gemma":[0.004272551,0.0003253167,0.0008561972,0.00118466,0.004006889,0.006446777,0.002348409,0.002682263,0.000314506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001562445,"about_ca_system_score_gemma":0.001352669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002085814,"about_ca_topic_score_gemma":0.001437686,"domain_scores_codex":[0.9983212,0.000531459,0.0001171673,0.0003203799,0.000456563,0.0002531573],"domain_scores_gemma":[0.9959449,0.002658616,0.0004003011,0.0003951362,0.0003549817,0.0002459426],"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.00002368919,0.00002502808,0.0003060907,0.00002297717,0.000005350048,0.00006116818,0.0002469827,0.002250501,0.0009094941,0.9905691,0.0004466967,0.005132891],"study_design_scores_gemma":[0.000007847594,0.00001118207,0.0001220371,0.000006871098,0.000005532816,0.0000595625,0.0001039937,0.00976914,0.001037103,0.9872728,0.001593327,0.00001072249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5817603,0.001128717,0.3627631,0.004775602,0.00008718084,0.0000965666,0.0003510061,0.0003600595,0.04867727],"genre_scores_gemma":[0.9593247,0.0004496077,0.03388168,0.0003321557,0.0001362752,0.0000991691,0.0003328994,0.00004558254,0.005397853],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002481448,"threshold_uncertainty_score":0.01133639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170344325","doi":"10.1145/1273340.1273343","title":"Multicommodity demand flow in a tree and packing integer programs","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Linear programming relaxation; Mathematics; Cardinality (data modeling); Multi-commodity flow problem; Integer programming; Knapsack problem; Mathematical optimization; Steiner tree problem; Tree (set theory); Combinatorics; Approximation algorithm; Integer (computer science); Flow network; Discrete mathematics; Computer science","authors":[{"name":"Chandra Chekuri","is_ca":false},{"name":"Marcelo Mydlarz","is_ca":false},{"name":"F. Bruce Shepherd","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0341002519929163,"gpt":0.3108631411316437,"spread":0.2767628891387274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00206716,0.001470247,0.001332528,0.00127721,0.0009091361,0.002362593,0.001095304,0.001908835,0.004631894],"category_scores_gemma":[0.005707904,0.001091784,0.001544546,0.003082086,0.001408924,0.004302402,0.00151289,0.002947728,0.0004019325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002344752,"about_ca_system_score_gemma":0.001042649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002931808,"about_ca_topic_score_gemma":0.002253304,"domain_scores_codex":[0.9989148,0.0003904562,0.00004591457,0.0001933433,0.0002270586,0.0002283684],"domain_scores_gemma":[0.9974611,0.001925702,0.0002632138,0.00009679993,0.0001426324,0.000110399],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001565508,0.000206278,0.0006836905,0.0002711365,0.00005684788,0.0002175137,0.0003133622,0.7075287,0.001415463,0.2662064,0.003420002,0.01952408],"study_design_scores_gemma":[0.00002206458,0.00003667954,0.000165619,0.00002134383,0.00001376224,0.00006202758,0.00005200799,0.9121754,0.0004908899,0.08458865,0.00236119,0.00001039599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09932126,0.002407195,0.8663508,0.001858963,0.0001526905,0.0001517666,0.0004780824,0.0003299698,0.02894929],"genre_scores_gemma":[0.5960359,0.002377514,0.388135,0.0006890778,0.0003373245,0.0004462116,0.0006615418,0.0002517398,0.01106563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004631894,"threshold_uncertainty_score":0.01701248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037789845","doi":"10.1016/j.jctb.2003.09.001","title":"Excluding any graph as a minor allows a low tree-width 2-coloring","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"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; Graph minor; Graph; Edge coloring; Graph coloring; Conjecture; Fractional coloring; Discrete mathematics; List coloring; Graph power; Graph factorization; Line graph","authors":[{"name":"Matt DeVos","is_ca":false},{"name":"Guoli Ding","is_ca":false},{"name":"Bogdan Oporowski","is_ca":false},{"name":"Daniel P. Sanders","is_ca":false},{"name":"Bruce Reed","is_ca":true},{"name":"Paul Seymour","is_ca":false},{"name":"Dirk Vertigan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0153158103495201,"gpt":0.2745306702123444,"spread":0.2592148598628243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001065132,0.00167732,0.001844152,0.0006302581,0.002153913,0.003191849,0.002160345,0.001626461,0.01017207],"category_scores_gemma":[0.004580529,0.001202994,0.00220032,0.001122745,0.001301893,0.003837581,0.002500453,0.003186296,0.002913677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006774247,"about_ca_system_score_gemma":0.001322931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007183956,"about_ca_topic_score_gemma":0.002311808,"domain_scores_codex":[0.9990104,0.0002066705,0.00005343213,0.0002899434,0.0001417908,0.0002976319],"domain_scores_gemma":[0.9926665,0.003070028,0.0003890358,0.002758413,0.0002782383,0.0008377832],"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.004670606,0.001565328,0.006233059,0.001363878,0.0002997266,0.001256786,0.001232232,0.06785268,0.241317,0.509554,0.03559519,0.1290596],"study_design_scores_gemma":[0.0005332749,0.0003651326,0.001739254,0.00009852812,0.0003765367,0.001301833,0.0003333838,0.1346204,0.04564898,0.7964122,0.01847865,0.00009196592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4770519,0.0004635372,0.4668362,0.002078727,0.0005249855,0.0002627291,0.001344757,0.006951325,0.04448576],"genre_scores_gemma":[0.7450749,0.0004432902,0.2320909,0.0008893966,0.0002654312,0.0003006557,0.001475328,0.003001828,0.01645823],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01017207,"threshold_uncertainty_score":0.03402895,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976619117","doi":"10.1016/j.disc.2005.12.053","title":"The firefighter problem for graphs of maximum degree three","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Degree (music); Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","authors":[{"name":"Stephen Finbow","is_ca":true},{"name":"Andrew D. King","is_ca":true},{"name":"Gary MacGillivray","is_ca":true},{"name":"Roméo Rizzi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03299384743016334,"gpt":0.2853029599536012,"spread":0.2523091125234378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001783112,0.001215574,0.001878414,0.0009337323,0.003538867,0.002944254,0.004018404,0.005377738,0.0161448],"category_scores_gemma":[0.006832984,0.0009471957,0.001526178,0.00115823,0.002547635,0.006803293,0.002837547,0.003661619,0.001565564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001679833,"about_ca_system_score_gemma":0.001778612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00594076,"about_ca_topic_score_gemma":0.005599359,"domain_scores_codex":[0.998962,0.0002877525,0.00003216514,0.000237931,0.0001102075,0.0003700175],"domain_scores_gemma":[0.996089,0.002330677,0.0003675257,0.0003437563,0.0001941329,0.0006748979],"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.002969215,0.001026152,0.00521074,0.001673265,0.0002494433,0.001775873,0.002106922,0.1994385,0.008343796,0.5807166,0.08450775,0.1119817],"study_design_scores_gemma":[0.0004005561,0.0002585075,0.001450873,0.0001951983,0.0001076965,0.0008198426,0.002858218,0.2043599,0.00494644,0.7624148,0.02212138,0.00006661235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5500996,0.002219798,0.3629513,0.01558883,0.0006726093,0.0006414821,0.002289545,0.0006180073,0.06491888],"genre_scores_gemma":[0.8020613,0.002148939,0.1350031,0.001135249,0.0004411947,0.0003223991,0.002892919,0.0003780362,0.0556169],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0161448,"threshold_uncertainty_score":0.0540098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156623776","doi":"10.1006/jagm.2001.1195","title":"On Graph Powers for Leaf-Labeled Trees","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Gomory–Hu tree; Mathematics; Tree (set theory); Graph; K-ary tree; Spanning tree; Path (computing); Basis (linear algebra); Trémaux tree; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Tree structure; Computer science; Binary tree; Line graph; Artificial intelligence; Pathwidth","authors":[{"name":"Naomi Nishimura","is_ca":true},{"name":"Prabhakar Ragde","is_ca":true},{"name":"Dimitrios M. Thilikos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03359346603976615,"gpt":0.3027998815668668,"spread":0.2692064155271007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00378113,0.001362835,0.001826165,0.00298513,0.002416722,0.004615928,0.002895744,0.001940002,0.01902505],"category_scores_gemma":[0.02577149,0.001442906,0.002226385,0.003623326,0.005760364,0.01980979,0.007851724,0.006103778,0.004192377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001650097,"about_ca_system_score_gemma":0.0007938486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001597764,"about_ca_topic_score_gemma":0.002786919,"domain_scores_codex":[0.9961271,0.001492459,0.0002272565,0.0006752347,0.0009965573,0.0004814684],"domain_scores_gemma":[0.9782035,0.0147588,0.0009382038,0.003337046,0.001407835,0.001354519],"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.0002450627,0.0001164066,0.001059587,0.0001823459,0.00002985859,0.00019902,0.001055934,0.005331087,0.001311713,0.9434649,0.009740135,0.03726394],"study_design_scores_gemma":[0.0000225799,0.00001621757,0.0001244026,0.00003078928,0.00001864366,0.0001042346,0.0001123089,0.01079087,0.0005482291,0.9826973,0.005524204,0.00001021811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1124517,0.001914371,0.7488641,0.006389906,0.000836478,0.0003549371,0.0008050301,0.001380372,0.1270032],"genre_scores_gemma":[0.6431389,0.003183889,0.2658906,0.002149142,0.001708575,0.0005637613,0.002122162,0.002426018,0.07881697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01902505,"threshold_uncertainty_score":0.06364518,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162598482","doi":"10.1006/jctb.2000.1963","title":"The Excluded Minors for GF(4)-Representable Matroids","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":105,"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":"Matroid; Combinatorics; GF(2); Mathematics; Computer science; Finite field","authors":[{"name":"Jim Geelen","is_ca":true},{"name":"A.M.H. Gerards","is_ca":false},{"name":"Ajai Kapoor","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01250534148642135,"gpt":0.2825219572415087,"spread":0.2700166157550874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006375524,0.0007116375,0.0006453807,0.001028657,0.002002817,0.003493828,0.0009849342,0.0009672969,0.008137376],"category_scores_gemma":[0.003457752,0.0005767972,0.0008254475,0.00098887,0.001462615,0.002534849,0.001206519,0.00190852,0.001484259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008212896,"about_ca_system_score_gemma":0.0007318946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000733063,"about_ca_topic_score_gemma":0.001287748,"domain_scores_codex":[0.9991648,0.0002275918,0.00005973344,0.00013088,0.000233731,0.000183403],"domain_scores_gemma":[0.9971468,0.001306676,0.0005250088,0.0003558925,0.0003055957,0.0003599702],"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.001028785,0.0003665131,0.001761724,0.0002236289,0.00005446188,0.001010452,0.001416455,0.006317957,0.01975863,0.9165276,0.01151421,0.04001958],"study_design_scores_gemma":[0.0001211868,0.0001422497,0.000883655,0.00003311894,0.00003042242,0.0007461442,0.0002802841,0.01896537,0.005034075,0.9630213,0.01070819,0.00003405103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8585911,0.0003879678,0.07593228,0.001687573,0.0002365226,0.0001662361,0.0008231385,0.0004146151,0.06176061],"genre_scores_gemma":[0.9546766,0.0002922558,0.02307619,0.0002955441,0.0002856181,0.0001524661,0.0009476266,0.000158741,0.0201149],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008137376,"threshold_uncertainty_score":0.02722222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W369866893","doi":"10.1007/978-3-540-93952-8","title":"Graph Factors and Matching Extensions","year":2009,"lang":"en","type":"book","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matching (statistics); Computer science; Graph; Graph theory; Theoretical computer science; Mathematics; Combinatorics; Statistics","authors":[{"name":"Qinglin Yu","is_ca":false},{"name":"Guizhen Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02745059931612261,"gpt":0.2899493540374657,"spread":0.2624987547213432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002262074,0.0008182474,0.0006231478,0.001434031,0.0008131434,0.001450965,0.0007074873,0.0004293392,0.02699094],"category_scores_gemma":[0.0007653951,0.000427891,0.0005305998,0.002226983,0.001313636,0.004055921,0.001037457,0.00171341,0.01003947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009472638,"about_ca_system_score_gemma":0.0005962907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00121272,"about_ca_topic_score_gemma":0.001659162,"domain_scores_codex":[0.9997562,0.0000379305,0.00000716454,0.00006806413,0.00009950153,0.00003121438],"domain_scores_gemma":[0.9998086,0.00005288444,0.00001505328,0.00005633483,0.0000410096,0.00002615454],"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.0000224488,0.00002452192,0.0000568198,0.0001086219,0.000006675612,0.00004187293,0.0001439998,0.000617379,0.0007234701,0.8646489,0.04848319,0.08512214],"study_design_scores_gemma":[0.000006936876,0.00001003484,0.0001068865,0.00004269007,0.00001016786,0.0001500577,0.00005917627,0.0009388825,0.0004301615,0.7344562,0.263782,0.000006809325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0103936,0.01436065,0.05675952,0.001743483,0.001314786,0.00007581236,0.0003087908,0.000745065,0.9142983],"genre_scores_gemma":[0.1863197,0.02695084,0.05412261,0.00109037,0.002470319,0.0002030433,0.001297568,0.000854906,0.7266906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02699094,"threshold_uncertainty_score":0.09029371,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971393213","doi":"10.1007/s00224-007-1345-z","title":"An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Parameterized complexity; Feedback vertex set; Combinatorics; Undirected graph; Mathematics; Vertex (graph theory); Algorithm; Bounded function; Running time; Exponential function; Vertex cover; Function (biology); Time complexity; Binary logarithm; Graph; Exponential time hypothesis; Set (abstract data type); Discrete mathematics; Computer science","authors":[{"name":"Frank Dehne","is_ca":true},{"name":"Michael R. Fellows","is_ca":false},{"name":"Michael A. Langston","is_ca":false},{"name":"Frances Rosamond","is_ca":false},{"name":"Kim Stevens","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02914474183978229,"gpt":0.3172132712211289,"spread":0.2880685293813466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001249853,0.002086299,0.002226448,0.001338477,0.001681886,0.002987751,0.003660266,0.003370347,0.02428181],"category_scores_gemma":[0.008026271,0.0007462287,0.001803744,0.002232946,0.001101559,0.005462582,0.002799505,0.00333856,0.00546517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003031914,"about_ca_system_score_gemma":0.003377664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006444945,"about_ca_topic_score_gemma":0.009393606,"domain_scores_codex":[0.9977512,0.0003905673,0.000106005,0.0007564813,0.0006009813,0.0003947318],"domain_scores_gemma":[0.995402,0.002923643,0.0002318828,0.0008582156,0.0003340772,0.0002502535],"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.001785937,0.0009778644,0.001240583,0.001020441,0.0002323014,0.0003249203,0.000286747,0.1339455,0.01166467,0.04502906,0.07401678,0.7294751],"study_design_scores_gemma":[0.001191485,0.0002845545,0.001039607,0.0001230643,0.0002004806,0.000508047,0.0002415227,0.8070819,0.00563415,0.1687423,0.01487401,0.00007891982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04740681,0.001397523,0.8925188,0.004169851,0.0008341281,0.0008919765,0.002239704,0.01304086,0.03750029],"genre_scores_gemma":[0.2272948,0.0004057469,0.7500528,0.001091476,0.0003381636,0.00103231,0.003343868,0.001238046,0.01520267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02428181,"threshold_uncertainty_score":0.0812307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006587062","doi":"10.1006/jctb.2001.2082","title":"Branch-Width and Well-Quasi-Ordering in Matroids and Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":103,"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":"Matroid; Bounded function; Combinatorics; Mathematics; Class (philosophy); Graphic matroid; Discrete mathematics; Tree (set theory); Computer science; Mathematical analysis","authors":[{"name":"James F. Geelen","is_ca":true},{"name":"A.M.H. Gerards","is_ca":false},{"name":"Geoff Whittle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01045793543277344,"gpt":0.2442487909695447,"spread":0.2337908555367713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002809436,0.001019259,0.001612254,0.003242799,0.002541782,0.008045029,0.002316464,0.002258735,0.006433443],"category_scores_gemma":[0.01141954,0.001596011,0.001028446,0.005212477,0.005426385,0.01959509,0.001937341,0.004855806,0.000591743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001758769,"about_ca_system_score_gemma":0.0009320297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001278194,"about_ca_topic_score_gemma":0.002283999,"domain_scores_codex":[0.9988065,0.0004204506,0.0001031035,0.0002535628,0.0002255619,0.0001909385],"domain_scores_gemma":[0.9812399,0.01266543,0.002367487,0.001032741,0.0008835479,0.001810873],"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.0001529174,0.00009830687,0.002238062,0.00009958204,0.00001885464,0.00009318272,0.0006619357,0.002922913,0.001203623,0.9815981,0.001347252,0.009565394],"study_design_scores_gemma":[0.0000185102,0.0000157437,0.000496823,0.00001428934,0.0000121944,0.00007713622,0.0001777977,0.005738589,0.0002229169,0.992585,0.0006315815,0.000009483037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7946011,0.004547735,0.160124,0.005379171,0.0002354747,0.00006848399,0.0009044652,0.0003057194,0.03383383],"genre_scores_gemma":[0.9527394,0.002409143,0.03436003,0.0003991278,0.000643298,0.00009444157,0.0006437785,0.0001329222,0.008577941],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008045029,"threshold_uncertainty_score":0.02152205,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990242495","doi":"10.1016/j.dam.2003.07.001","title":"A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interval graph; Mathematics; Graph; Algorithm; Interval (graph theory); Simple (philosophy); Unit interval; SIMPLE algorithm; Combinatorics; Simple graph; Unit (ring theory); Line graph; Pathwidth","authors":[{"name":"Derek G. Corneil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04505282759936129,"gpt":0.3107119446623994,"spread":0.2656591170630381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003015749,0.0009794305,0.001074767,0.00170815,0.0006962522,0.001489582,0.001802908,0.0009842686,0.01763727],"category_scores_gemma":[0.001666793,0.0004412841,0.0007722965,0.001714002,0.000459577,0.002182706,0.001745549,0.001044735,0.004835544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005930255,"about_ca_system_score_gemma":0.0009605881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003545494,"about_ca_topic_score_gemma":0.005022977,"domain_scores_codex":[0.9995565,0.00004997322,0.00003753566,0.000132413,0.0001386023,0.00008496191],"domain_scores_gemma":[0.9993768,0.0001854218,0.00003922669,0.0002242637,0.0001118668,0.00006243891],"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.0003435613,0.0001347471,0.0007291074,0.0001406839,0.00002621376,0.00007490614,0.0001023779,0.01040356,0.02384428,0.007320208,0.008638451,0.9482418],"study_design_scores_gemma":[0.0004133493,0.0004047113,0.002673235,0.0000940976,0.0001022978,0.0006716209,0.0005285235,0.7926595,0.06197916,0.09043214,0.04990394,0.0001374449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03777791,0.0003312301,0.9423311,0.0001751373,0.00007734213,0.0001731667,0.0006244164,0.01158648,0.006923102],"genre_scores_gemma":[0.1378931,0.0001728178,0.8529311,0.0001098266,0.00004723647,0.0002065712,0.002131248,0.000633878,0.005874169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01763727,"threshold_uncertainty_score":0.05900258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119116325","doi":"10.1017/s0963548309990290","title":"Conflict-Free Colourings of Graphs and Hypergraphs","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; Neighbourhood (mathematics); Vertex (graph theory); Lemma (botany); Upper and lower bounds; Graph; Chromatic scale; Discrete mathematics","authors":[{"name":"János Pach","is_ca":false},{"name":"Gábor Tardos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02230752856673305,"gpt":0.2705696345529421,"spread":0.248262105986209,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001654405,0.001135299,0.0007848032,0.001764869,0.001427977,0.004319634,0.001944456,0.001721377,0.008098092],"category_scores_gemma":[0.01047924,0.001271962,0.001357694,0.003946762,0.005283845,0.00771868,0.004039353,0.004149661,0.001159656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0028952,"about_ca_system_score_gemma":0.0008035341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002097455,"about_ca_topic_score_gemma":0.002035283,"domain_scores_codex":[0.997095,0.0007935727,0.0001770249,0.000830725,0.0006901456,0.0004135808],"domain_scores_gemma":[0.9901937,0.005599165,0.001239872,0.001771788,0.0004390185,0.0007564523],"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.0001719751,0.00005740304,0.001139402,0.0002709246,0.00004402402,0.0002597949,0.0008171726,0.03023293,0.005505618,0.9180157,0.004888369,0.03859671],"study_design_scores_gemma":[0.00003137876,0.00002189231,0.0005335979,0.00002755089,0.00001382041,0.0002538914,0.0001222711,0.02208923,0.001445699,0.967602,0.007836103,0.00002258025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1694962,0.003935365,0.7810568,0.001838744,0.0002473094,0.0002745622,0.001008011,0.0009321127,0.041211],"genre_scores_gemma":[0.7340692,0.003832068,0.2422017,0.0009895214,0.0007032997,0.0004586619,0.001369861,0.0005012023,0.01587447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008098092,"threshold_uncertainty_score":0.02709085,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034079307","doi":"10.1007/s00012-007-2012-6","title":"Bounded width problems and algebras","year":2007,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Advanced Graph Theory Research","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":"Concordia University","funders":"","keywords":"Homomorphism; Bounded function; Mathematics; Partially ordered set; Combinatorics; Discrete mathematics; Type (biology); Variety (cybernetics)","authors":[{"name":"Benoît Larose","is_ca":true},{"name":"László Zádori","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01613953013336916,"gpt":0.2517842117618099,"spread":0.2356446816284408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002734037,0.001018091,0.001862234,0.002440474,0.004852441,0.006913512,0.002660532,0.003031428,0.01261288],"category_scores_gemma":[0.01024519,0.001252377,0.001644043,0.005186993,0.01001046,0.02745738,0.005314856,0.009756782,0.001238407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003721567,"about_ca_system_score_gemma":0.001165518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002339626,"about_ca_topic_score_gemma":0.001618199,"domain_scores_codex":[0.9978369,0.0007373985,0.0001110746,0.0005451093,0.0004887419,0.0002807179],"domain_scores_gemma":[0.9939815,0.004030962,0.0003303578,0.0007745562,0.0004141628,0.0004684468],"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.000009499839,0.000007877016,0.00004841396,0.00001753768,0.000003316555,0.000008163056,0.0001048247,0.0002006052,0.00004953111,0.9970717,0.0008488758,0.001629509],"study_design_scores_gemma":[0.000003100876,0.0000011029,0.00001730112,0.000003845595,0.00000221249,0.000006122679,0.00002325653,0.0003252326,0.00002531116,0.9987589,0.0008318609,0.000001850758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.202493,0.02569913,0.438548,0.03670714,0.001234816,0.0001034624,0.001021175,0.0009294004,0.2932638],"genre_scores_gemma":[0.8962865,0.006869851,0.05011246,0.002975148,0.002498412,0.0002414763,0.001000905,0.0003755994,0.03963963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01261288,"threshold_uncertainty_score":0.04219431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152026596","doi":"10.1109/sfcs.1997.646109","title":"The analysis of a list-coloring algorithm on a random graph","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Markov chain; Discrete mathematics; Random graph; Upper and lower bounds; Algorithm; Degree (music); Graph; Path (computing); Computer science; Physics; Statistics","authors":[{"name":"Dimitris Achlioptas","is_ca":true},{"name":"Michael Molloy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02757993635894723,"gpt":0.2840963481317202,"spread":0.256516411772773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003556953,0.0007975655,0.0008378054,0.001344263,0.0008997546,0.001430895,0.002230435,0.001339213,0.003191076],"category_scores_gemma":[0.02185281,0.0005130189,0.0006780124,0.001347256,0.002272899,0.003269063,0.001142125,0.001179258,0.0007616114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003456093,"about_ca_system_score_gemma":0.002118217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002762042,"about_ca_topic_score_gemma":0.001933223,"domain_scores_codex":[0.9976421,0.0009839013,0.0000756968,0.0004345755,0.0004727893,0.0003909802],"domain_scores_gemma":[0.9793291,0.01475517,0.001667482,0.001599273,0.001897174,0.000751714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006840885,0.0001612296,0.007161235,0.0002813087,0.0001543205,0.0001660196,0.0001826814,0.7473978,0.01033811,0.1886288,0.004532932,0.04031157],"study_design_scores_gemma":[0.00001366592,0.00003666895,0.0002568377,0.000006132854,0.000008054646,0.00003490044,0.000007119387,0.9829915,0.0009896052,0.01539104,0.0002570129,0.000007480411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2658274,0.0009912228,0.7231234,0.001359863,0.00008682322,0.000204388,0.0002944338,0.001597118,0.006515335],"genre_scores_gemma":[0.8869878,0.0005935367,0.1072308,0.0003355255,0.0001074396,0.0002630058,0.0004180129,0.0002645607,0.003799314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003556953,"threshold_uncertainty_score":0.02507579,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979733770","doi":"10.1016/s0012-365x(03)00311-x","title":"Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Variable neighborhood search; Heuristic; Variable (mathematics); Algebraic number; Series (stratigraphy); Combinatorics; Discrete mathematics; Algorithm; Mathematical optimization; Metaheuristic","authors":[{"name":"Gilles Caporossi","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05125561456381406,"gpt":0.3153195008242945,"spread":0.2640638862604804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003811808,0.0005527025,0.001403844,0.001589454,0.001969141,0.002914288,0.004877081,0.002706543,0.00915898],"category_scores_gemma":[0.02519314,0.0005674963,0.001574994,0.001626746,0.003796926,0.008140903,0.005469635,0.003199117,0.00126506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009215469,"about_ca_system_score_gemma":0.001109995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001230163,"about_ca_topic_score_gemma":0.002132226,"domain_scores_codex":[0.9968836,0.001330941,0.0001438099,0.000570148,0.0006605219,0.0004109833],"domain_scores_gemma":[0.9801276,0.01100324,0.000810468,0.006345293,0.001081151,0.0006323042],"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.0008093426,0.0002848284,0.006428243,0.0004006548,0.0001044934,0.0002031289,0.0006114779,0.03293359,0.003088039,0.8243534,0.01262203,0.1181607],"study_design_scores_gemma":[0.0001123432,0.00009580424,0.0006849482,0.00005245261,0.00004773323,0.0001430559,0.0002035473,0.169977,0.00295765,0.8207329,0.004954034,0.0000385657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1254208,0.0007255853,0.8350186,0.004638399,0.0002745801,0.000249247,0.0003832227,0.001525786,0.03176368],"genre_scores_gemma":[0.593957,0.0003183105,0.3948701,0.0006848307,0.0001946167,0.0002878814,0.000712922,0.0002899503,0.008684418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00915898,"threshold_uncertainty_score":0.03063983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134206798","doi":"10.1016/j.ejc.2011.01.016","title":"On the asymptotic proportion of connected matroids","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":94,"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":"Marsden Fund; Foundation for Research, Science and Technology","keywords":"Matroid; Mathematics; Combinatorics; Conjecture; Asymptotically optimal algorithm; Automorphism group; Discrete mathematics; Automorphism","authors":[{"name":"Dillon Mayhew","is_ca":false},{"name":"Mike Newman","is_ca":true},{"name":"Dominic Welsh","is_ca":false},{"name":"Geoff Whittle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03805669037780503,"gpt":0.2392331797498589,"spread":0.2011764893720538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005179642,0.0009922888,0.002581578,0.005018034,0.002580266,0.007299046,0.004780614,0.003084974,0.01949605],"category_scores_gemma":[0.07564776,0.001554914,0.001144296,0.003694048,0.005367964,0.01150344,0.005170019,0.004441923,0.002245454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003040664,"about_ca_system_score_gemma":0.0009575489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001127689,"about_ca_topic_score_gemma":0.001057019,"domain_scores_codex":[0.9954637,0.001764594,0.0001732499,0.000873571,0.001185551,0.0005394388],"domain_scores_gemma":[0.9232267,0.0616955,0.003764482,0.00446663,0.003446437,0.003400318],"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.0009418527,0.0002094437,0.01277673,0.0005507838,0.0001530904,0.0003309583,0.000960322,0.03687952,0.00687184,0.8921704,0.01352019,0.0346349],"study_design_scores_gemma":[0.0001076981,0.0001020103,0.004871988,0.0001620799,0.000122276,0.001237859,0.0004125225,0.1714218,0.002877423,0.8128333,0.005784106,0.0000668964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7161983,0.004987273,0.165467,0.009822017,0.000489337,0.0001147082,0.002136775,0.001365219,0.09941942],"genre_scores_gemma":[0.961355,0.00276248,0.01801404,0.0009377928,0.001104155,0.0002609769,0.001391316,0.0008284517,0.01334563],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01949605,"threshold_uncertainty_score":0.06522077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977889556","doi":"10.1016/s0012-365x(02)00803-8","title":"Finding a maximum induced matching in weakly chordal graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Bipartite graph; Matching (statistics); Split graph; 3-dimensional matching; Interval graph; Vertex (graph theory); Indifference graph; Discrete mathematics; Factor-critical graph; Cardinality (data modeling); Pathwidth; Graph; 1-planar graph; Line graph; Graph power; Computer science","authors":[{"name":"Kathie Cameron","is_ca":true},{"name":"R. Sritharan","is_ca":false},{"name":"Yingwen Tang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03729535450122503,"gpt":0.314509867878203,"spread":0.277214513376978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008730702,0.001064324,0.002356849,0.001569495,0.002297076,0.002932981,0.003959285,0.003006223,0.00879702],"category_scores_gemma":[0.009219709,0.001234398,0.001440697,0.002919259,0.00114555,0.006364988,0.003093076,0.002020021,0.001703369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001550666,"about_ca_system_score_gemma":0.001609619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001578675,"about_ca_topic_score_gemma":0.002923079,"domain_scores_codex":[0.9989287,0.0001895736,0.00008965224,0.0003859316,0.0001805332,0.0002255276],"domain_scores_gemma":[0.9946774,0.003152857,0.0005386531,0.0006436832,0.0003545374,0.0006328374],"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.005672481,0.003018073,0.02486523,0.005247461,0.0008288176,0.001587927,0.00277361,0.1327887,0.09942275,0.2546657,0.03287737,0.4362519],"study_design_scores_gemma":[0.0006211387,0.000903848,0.004641459,0.0002263694,0.0003744658,0.0009243553,0.002008105,0.352772,0.042199,0.584122,0.01111331,0.000093773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7124572,0.0006293666,0.259632,0.002111083,0.0001725557,0.0006343215,0.002483764,0.001450847,0.02042881],"genre_scores_gemma":[0.7364275,0.0004208157,0.2493555,0.0003960594,0.0001023141,0.0002523786,0.003258786,0.0003793536,0.0094073],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00879702,"threshold_uncertainty_score":0.02942896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048794017","doi":"10.1145/1367064.1367070","title":"Optimal branch-decomposition of planar graphs in <i>O</i> ( <i>n</i> <sup>3</sup> ) Time","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar; Decomposition; Planar graph; Mathematics; Graph; Discrete mathematics; Computer science","authors":[{"name":"Qian‐Ping Gu","is_ca":true},{"name":"Hisao Tamaki","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01770934675867425,"gpt":0.2716123867468868,"spread":0.2539030399882126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003042189,0.001136128,0.001126493,0.0007801069,0.0005761846,0.001193292,0.0009247511,0.0008166653,0.008687625],"category_scores_gemma":[0.001361853,0.0005698554,0.0009843821,0.001268467,0.0004666717,0.002157553,0.001625892,0.001191138,0.002858077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006380015,"about_ca_system_score_gemma":0.0007178057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001547959,"about_ca_topic_score_gemma":0.003320026,"domain_scores_codex":[0.9996754,0.00004830675,0.00001833017,0.00007147007,0.00008910106,0.00009732266],"domain_scores_gemma":[0.9994868,0.0002096506,0.00005681672,0.0001112128,0.00006282515,0.0000727031],"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.001258836,0.0003232629,0.002589683,0.001165727,0.0001199964,0.0003667648,0.0006210859,0.1457901,0.08544161,0.04970964,0.03341749,0.6791958],"study_design_scores_gemma":[0.0004637433,0.0004343305,0.002622217,0.0001716712,0.0001393802,0.0005897657,0.0007021396,0.706715,0.04577343,0.2220821,0.02024752,0.00005877715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2117887,0.0009976897,0.757351,0.0008073091,0.00007801437,0.0002837073,0.001416344,0.003803969,0.02347323],"genre_scores_gemma":[0.2555512,0.0006547854,0.7319876,0.0001857003,0.00003686003,0.0002611397,0.003968653,0.0006295289,0.006724501],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008687625,"threshold_uncertainty_score":0.02906299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091612923","doi":"10.1016/s0166-218x(00)00281-x","title":"Diameter determination on restricted graph families","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":85,"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":"Chordal graph; Interval graph; Mathematics; Combinatorics; Split graph; Pathwidth; Indifference graph; Cograph; Induced subgraph; Block graph; Distance-hereditary graph; Discrete mathematics; Vertex (graph theory); Maximal independent set; Graph; Line graph; 1-planar graph; Graph power","authors":[{"name":"Derek G. Corneil","is_ca":true},{"name":"Feodor F. Dragan","is_ca":false},{"name":"Michel Habib","is_ca":false},{"name":"Christophe Paul","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02416877056378365,"gpt":0.2894888853845869,"spread":0.2653201148208033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001332832,0.0005224743,0.001630907,0.001902727,0.001926986,0.002183264,0.002291011,0.001493511,0.004195523],"category_scores_gemma":[0.01200815,0.00134366,0.0009457952,0.002090236,0.001924739,0.005020726,0.003128554,0.002164589,0.0007941626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001152596,"about_ca_system_score_gemma":0.0003903708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007474344,"about_ca_topic_score_gemma":0.0006743788,"domain_scores_codex":[0.9982028,0.0005571457,0.00008706428,0.0005543899,0.0003899726,0.0002086129],"domain_scores_gemma":[0.9844751,0.01128416,0.001147605,0.001548833,0.0005918979,0.000952412],"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.0004522002,0.0001080873,0.003789422,0.0003528194,0.00005178949,0.0004490093,0.001324115,0.03306215,0.01480521,0.888597,0.007175597,0.0498326],"study_design_scores_gemma":[0.00006164243,0.00006152832,0.001792433,0.00006178957,0.00004719151,0.0007373934,0.0003904211,0.1162568,0.006402258,0.8669243,0.007223954,0.00004042999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5377725,0.0008067514,0.4265946,0.0009558475,0.0000733398,0.0001075652,0.0004708843,0.0007474898,0.03247101],"genre_scores_gemma":[0.8926206,0.000803101,0.09507114,0.0001956981,0.0001773852,0.0001717805,0.0006810371,0.0005528796,0.009726387],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004195523,"threshold_uncertainty_score":0.0140354,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1559927413","doi":"","title":"Detecting Backdoor Sets with Respect to Horn and Binary Clauses.","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Backdoor; Parameterized complexity; Satisfiability; Mathematics; Class (philosophy); Set (abstract data type); Binary number; Discrete mathematics; Combinatorics; Boolean satisfiability problem; French horn; Computer science; Artificial intelligence; Arithmetic; Physics","authors":[{"name":"Naomi Nishimura","is_ca":true},{"name":"Prabhakar Ragde","is_ca":true},{"name":"Stefan Szeider","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02499197815101134,"gpt":0.3024142130318423,"spread":0.277422234880831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006381895,0.001425544,0.002367037,0.001638536,0.001832783,0.006286812,0.004481759,0.003217599,0.005175014],"category_scores_gemma":[0.06035684,0.001788427,0.003369618,0.002317556,0.003672008,0.01628895,0.004338378,0.00444183,0.0004449666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004516489,"about_ca_system_score_gemma":0.003856977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006057562,"about_ca_topic_score_gemma":0.005403083,"domain_scores_codex":[0.9878974,0.003399432,0.0008257879,0.002512941,0.003165949,0.002198505],"domain_scores_gemma":[0.8878602,0.09039079,0.009999744,0.008330133,0.002021708,0.00139738],"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.007241444,0.001874749,0.03249217,0.001886966,0.001940734,0.002298853,0.001448285,0.5837322,0.0447171,0.1454245,0.01198503,0.1649579],"study_design_scores_gemma":[0.000406403,0.0003768829,0.002519731,0.00007198542,0.0003262303,0.0007520235,0.0003992266,0.7921004,0.02500717,0.1762365,0.001720677,0.00008281491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.664178,0.0008813881,0.3192814,0.003013453,0.000122139,0.0009038863,0.002315026,0.003562945,0.005741721],"genre_scores_gemma":[0.9038387,0.0002256242,0.09154609,0.0004197217,0.00007914704,0.0002198127,0.001918153,0.000272488,0.001480168],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006381895,"threshold_uncertainty_score":0.03375113,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2557672902","doi":"","title":"On proper-path colorings in graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Combinatorics; Discrete mathematics; Computer science; Computer network","authors":[{"name":"Eric Andrews","is_ca":false},{"name":"Chira Lumduanhom","is_ca":false},{"name":"Elliot Laforge","is_ca":false},{"name":"Ping Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01788312941742499,"gpt":0.274049836676602,"spread":0.2561667072591771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002021541,0.001781095,0.001741312,0.003159076,0.003232661,0.005124667,0.003007699,0.002640762,0.01602703],"category_scores_gemma":[0.01280593,0.001990776,0.00176877,0.005002814,0.005135197,0.01042209,0.004281655,0.004922982,0.001316978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003453048,"about_ca_system_score_gemma":0.001546417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004336735,"about_ca_topic_score_gemma":0.0062928,"domain_scores_codex":[0.9982185,0.0005864612,0.00009549149,0.000392052,0.0003460414,0.0003614733],"domain_scores_gemma":[0.9860234,0.009508905,0.001116326,0.001085703,0.0009646533,0.001301003],"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.0001448856,0.00009212818,0.001058952,0.000161457,0.00002252562,0.0001624893,0.0006834248,0.01057733,0.0008041922,0.9662985,0.007034456,0.01295966],"study_design_scores_gemma":[0.00002410034,0.0000165352,0.0002670975,0.00003095841,0.00001245172,0.00006766287,0.0001310135,0.01450859,0.0001251179,0.9829205,0.001884799,0.00001122716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4658503,0.003414079,0.3946832,0.007779019,0.001145304,0.0002832309,0.00171487,0.0008579695,0.124272],"genre_scores_gemma":[0.8648546,0.003781596,0.08419863,0.001828152,0.001299056,0.0003069211,0.002532822,0.0007484991,0.04044978],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01602703,"threshold_uncertainty_score":0.05361575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042269609","doi":"10.1016/j.disc.2004.05.003","title":"Tight bounds on maximal and maximum matchings","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":84,"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; Bounded function; Upper and lower bounds; Planar graph; Discrete mathematics; Graph; Class (philosophy); Degree (music); Computer science","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Erik D. Demaine","is_ca":false},{"name":"Christian A. Duncan","is_ca":false},{"name":"Rudolf Fleischer","is_ca":false},{"name":"Stephen Kobourov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01734329773186264,"gpt":0.2819589768785469,"spread":0.2646156791466843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01326416,0.006437758,0.009555369,0.01063121,0.006363899,0.01740915,0.01592717,0.007268539,0.03597095],"category_scores_gemma":[0.1058825,0.006822857,0.004671704,0.01629426,0.01000856,0.04950835,0.01822986,0.0174145,0.005821025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009890309,"about_ca_system_score_gemma":0.004043132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003188593,"about_ca_topic_score_gemma":0.00522146,"domain_scores_codex":[0.9852771,0.00317545,0.0006759708,0.002924809,0.00399409,0.003952522],"domain_scores_gemma":[0.8708556,0.1005779,0.005387488,0.01089637,0.004283229,0.007999386],"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.002543444,0.0004797941,0.00190397,0.00126369,0.00024701,0.0001775089,0.0009168976,0.04709711,0.003310052,0.8682785,0.02818522,0.04559685],"study_design_scores_gemma":[0.000104804,0.00006011149,0.000560595,0.0001394146,0.0001384449,0.0001178703,0.0001161406,0.04067389,0.00114701,0.9521908,0.004710164,0.0000408239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1612966,0.0218468,0.5675094,0.02786881,0.001600117,0.0004744592,0.007836405,0.004339767,0.2072277],"genre_scores_gemma":[0.7987635,0.01212357,0.1311104,0.005119591,0.004515278,0.0009646643,0.005775406,0.003256081,0.0383716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03597095,"threshold_uncertainty_score":0.1203349,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2175518075","doi":"10.1016/j.disc.2003.05.001","title":"Induced matchings in intersection graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Indifference graph; Split graph; Block graph; Discrete mathematics; Pathwidth; Induced subgraph; Intersection graph; Matching (statistics); Interval graph; 1-planar graph; Cograph; Line graph; Graph; Vertex (graph theory)","authors":[{"name":"Kathie Cameron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02698763385987632,"gpt":0.3014352730218232,"spread":0.2744476391619469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001445428,0.0006089981,0.001380794,0.003879402,0.003465623,0.005722569,0.002755654,0.002170136,0.0140622],"category_scores_gemma":[0.008498328,0.001383496,0.001358011,0.006120078,0.002309907,0.01275832,0.0035276,0.004050708,0.001775228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00203093,"about_ca_system_score_gemma":0.0009476664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001349552,"about_ca_topic_score_gemma":0.001464275,"domain_scores_codex":[0.9980429,0.0004316753,0.0001466782,0.0004950346,0.0005360774,0.0003474709],"domain_scores_gemma":[0.9935569,0.003136626,0.001064716,0.0007279522,0.000710888,0.0008029538],"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.0001323323,0.00009796055,0.0009921155,0.00007927007,0.00002286595,0.0001122929,0.0005099595,0.001496011,0.0008399452,0.9811952,0.001981449,0.01254051],"study_design_scores_gemma":[0.00002908031,0.00001979317,0.0003651145,0.00002480842,0.00004091501,0.0001422984,0.0002486936,0.007916015,0.0009348018,0.9864606,0.003805812,0.00001210666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6140175,0.001159191,0.2619074,0.002346947,0.0002701615,0.0002307829,0.001537465,0.001182436,0.1173482],"genre_scores_gemma":[0.9122486,0.0009200334,0.05430849,0.0004347505,0.0002334258,0.0002024529,0.00207294,0.0003556834,0.02922381],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0140622,"threshold_uncertainty_score":0.04704273,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070606919","doi":"10.1007/s00454-007-1318-7","title":"Graph Treewidth and Geometric Thickness Parameters","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Centre de Recherches Mathématiques","keywords":"Arboricity; Treewidth; Combinatorics; Mathematics; Regular polygon; Conjecture; Upper and lower bounds; Partial k-tree; 1-planar graph; Graph; Crossing number (knot theory); Planar graph; Discrete mathematics; Pathwidth; Geometry; Chordal graph; Mathematical analysis; Line graph","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01927022417299054,"gpt":0.2982417351459352,"spread":0.2789715109729447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001491004,0.0008817192,0.0009109561,0.002415881,0.001103803,0.003896941,0.002651692,0.002100869,0.01155046],"category_scores_gemma":[0.01806127,0.001289562,0.0004993408,0.003701218,0.002708276,0.01498717,0.002793647,0.003059412,0.001166977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001303028,"about_ca_system_score_gemma":0.0005680242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007967501,"about_ca_topic_score_gemma":0.001062204,"domain_scores_codex":[0.9990646,0.0002236338,0.00004385484,0.0002811802,0.0002078021,0.0001789229],"domain_scores_gemma":[0.9858293,0.008397751,0.002552571,0.001489858,0.0006137388,0.001116862],"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.0005645897,0.000112869,0.01051839,0.0002242095,0.00005757055,0.0002701755,0.0007402247,0.06902786,0.01123175,0.8582587,0.005887931,0.04310566],"study_design_scores_gemma":[0.00004992752,0.0000652826,0.003859151,0.00008592439,0.00008407424,0.0008667205,0.0005630611,0.1072386,0.00664705,0.8750305,0.005442931,0.00006681837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7035707,0.003632879,0.2417851,0.002972543,0.0001839173,0.00006950011,0.00129749,0.0007723281,0.04571556],"genre_scores_gemma":[0.966036,0.001193268,0.02569509,0.0001748408,0.0001878897,0.00007765041,0.0004410085,0.0004966522,0.00569756],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01155046,"threshold_uncertainty_score":0.03864014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984264511","doi":"10.1016/j.tcs.2005.09.028","title":"H-Coloring dichotomy revisited","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":82,"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":"Constraint satisfaction problem; Mathematics; Greedy coloring; Complete coloring; Combinatorics; Discrete mathematics; Complexity of constraint satisfaction; Computational complexity theory; Automaton; Constraint (computer-aided design); Fractional coloring; List coloring; Constraint satisfaction; Graph coloring; Time complexity; Computer science; Local consistency; Theoretical computer science; Algorithm; Graph","authors":[{"name":"Andreĭ A. Bulatov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01505732805158794,"gpt":0.2993394964102967,"spread":0.2842821683587087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001389995,0.0003333347,0.0008916006,0.001176266,0.003186648,0.003764231,0.001444487,0.002599878,0.0190301],"category_scores_gemma":[0.00391567,0.0004408901,0.0006167561,0.001556617,0.004351932,0.006795334,0.002245805,0.00553334,0.001391628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001471828,"about_ca_system_score_gemma":0.001028695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008113076,"about_ca_topic_score_gemma":0.0007937995,"domain_scores_codex":[0.999206,0.0002876858,0.0000194268,0.0001793177,0.0001290281,0.0001786203],"domain_scores_gemma":[0.9969285,0.001902016,0.0001416859,0.0004310772,0.0002372084,0.0003595216],"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.0000155884,0.0000122795,0.00008604467,0.00002044062,0.000002868711,0.00002229447,0.00006392608,0.0001643035,0.0001075084,0.9909804,0.005635703,0.002888463],"study_design_scores_gemma":[0.00001335416,0.000003803266,0.00008452366,0.000007949367,0.000002299755,0.00003692801,0.00007304137,0.0007978551,0.00005999276,0.9966241,0.002293525,0.000002502651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.220037,0.003839396,0.1239408,0.07611137,0.003432746,0.00009810358,0.0008611215,0.0007437592,0.5709359],"genre_scores_gemma":[0.9428965,0.00140375,0.01605689,0.009131542,0.00185877,0.0001057059,0.0002914864,0.0001461826,0.02810908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0190301,"threshold_uncertainty_score":0.06366199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1695953772","doi":"10.1016/j.ejc.2015.06.005","title":"Improved complexity results on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-coloring <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math>-free graphs","year":2015,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":79,"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 coloring; Vertex (graph theory); Complete coloring; Graph; Induced subgraph; Discrete mathematics; Line graph","authors":[{"name":"Shenwei Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03197586937708036,"gpt":0.2621459650223334,"spread":0.230170095645253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002026599,0.002447865,0.001615229,0.004028005,0.002402029,0.004852225,0.00455607,0.001969866,0.05757092],"category_scores_gemma":[0.01369256,0.0007714138,0.003084515,0.004540087,0.002357922,0.01086248,0.004766167,0.007560912,0.01412159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005582985,"about_ca_system_score_gemma":0.002795662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009384505,"about_ca_topic_score_gemma":0.02020611,"domain_scores_codex":[0.9964964,0.0006671802,0.0001736976,0.0006601111,0.001312131,0.000690447],"domain_scores_gemma":[0.9827544,0.01002923,0.0007648499,0.003498822,0.002040931,0.0009116966],"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.001225003,0.0007128338,0.004662303,0.002505297,0.0003402681,0.0007763068,0.001018732,0.07673921,0.01203457,0.5304832,0.2260728,0.1434295],"study_design_scores_gemma":[0.0001728287,0.0001174152,0.003096717,0.0001660064,0.0002753166,0.0005643134,0.0002444878,0.08571781,0.005593181,0.8559584,0.04797719,0.0001163101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.09669913,0.007378155,0.3725759,0.02007934,0.002575384,0.0005557279,0.01249998,0.005181498,0.4824548],"genre_scores_gemma":[0.6015212,0.0061411,0.2155117,0.004312366,0.003596875,0.0009127773,0.01875661,0.00539052,0.1438569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05757092,"threshold_uncertainty_score":0.1925939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}