{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":240,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":240,"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":"383180bb94b5","filters":{"venue":"Journal of Graph Theory"}},"results":[{"id":"W1673729927","doi":"10.1002/jgt.22057","title":"Hermitian Adjacency Matrix of Digraphs and Mixed Graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":175,"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; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Digraph; Hermitian matrix; Combinatorics; Mathematics; Adjacency matrix; Eigenvalues and eigenvectors; Spectral radius; Matrix (chemical analysis); Interlacing; Arc (geometry); Spectrum (functional analysis); Discrete mathematics; Pure mathematics; Computer science; Graph; Physics","authors":[{"name":"Krystal Guo","is_ca":true},{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01983445087669783,"gpt":0.291133383142799,"spread":0.2712989322661011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002785778,0.0003414,0.0002788055,0.002064675,0.0006150198,0.001144001,0.0004179085,0.000413079,0.005052464],"category_scores_gemma":[0.001487702,0.0002056142,0.0002080808,0.0009656837,0.001007225,0.001230201,0.0007005578,0.0005360811,0.0005376317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005815246,"about_ca_system_score_gemma":0.0002345545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006752634,"about_ca_topic_score_gemma":0.0006043294,"domain_scores_codex":[0.9996167,0.0001056259,0.00002570741,0.000101364,0.00009546889,0.00005499399],"domain_scores_gemma":[0.999008,0.0003814491,0.0001806468,0.00009988687,0.0001690665,0.0001609681],"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.00002571165,0.0000147539,0.0004049255,0.00004216757,0.000008316307,0.0001183214,0.0001648003,0.002651533,0.00357216,0.981698,0.0009502069,0.01034911],"study_design_scores_gemma":[0.00000920107,0.00002993954,0.0008778266,0.00002009198,0.000007068558,0.0003199236,0.0001384547,0.03420577,0.001676543,0.9565681,0.006126587,0.00002038436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4789514,0.001679856,0.4653997,0.000792808,0.0002807642,0.00007919076,0.0007364525,0.0004068761,0.05167314],"genre_scores_gemma":[0.9585103,0.0003608906,0.03430191,0.000150325,0.0001029625,0.00005833896,0.0002143919,0.00004314077,0.00625773],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005052464,"threshold_uncertainty_score":0.01690221,"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":"W1540614089","doi":"10.1002/jgt.1025","title":"Fractional chromatic numbers of cones over graphs","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Chromatic scale; Mathematics; Combinatorics; Graph; Graph theory; Discrete mathematics","authors":[{"name":"Claude Tardif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01082726201572983,"gpt":0.250184958751659,"spread":0.2393576967359291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006042753,0.0003390299,0.000317336,0.001775861,0.001235632,0.002386398,0.0006614348,0.0005185147,0.004633847],"category_scores_gemma":[0.002233901,0.0002355334,0.0002948034,0.0009953926,0.001754872,0.002880497,0.0008351742,0.001034666,0.0002371143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001845659,"about_ca_system_score_gemma":0.000482022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002868566,"about_ca_topic_score_gemma":0.002400627,"domain_scores_codex":[0.9995589,0.00006080568,0.00001761787,0.00008927966,0.0001569587,0.0001164673],"domain_scores_gemma":[0.9989375,0.0003430906,0.0001289478,0.00009182654,0.00025072,0.000247878],"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.0000508248,0.00001502986,0.0006276411,0.00002638066,0.000003461594,0.00005256307,0.0001358546,0.003010328,0.003192545,0.9857693,0.001167057,0.00594908],"study_design_scores_gemma":[0.00002168982,0.00003563254,0.001759866,0.00003614689,0.00001063133,0.0002256842,0.0001987996,0.0361824,0.003535457,0.9450319,0.01292945,0.0000324523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7540674,0.001096381,0.1613546,0.0008875103,0.0002504171,0.00007562868,0.0005834631,0.0004576003,0.08122705],"genre_scores_gemma":[0.9759143,0.0003242745,0.01686249,0.00009169796,0.00008121301,0.00005388687,0.0002283069,0.00007360393,0.006370296],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004633847,"threshold_uncertainty_score":0.01550174,"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":"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":"W2799803339","doi":"10.1002/jgt.21630","title":"Minimal Obstructions for 1‐Immersions and Hardness of 1‐Planarity Testing","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Research Canada; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","funders":"","keywords":"Planarity testing; Combinatorics; Mathematics; Planar graph; Planar; Outerplanar graph; Book embedding; Graph; Planar straight-line graph; Discrete mathematics; Enhanced Data Rates for GSM Evolution; 1-planar graph; Pathwidth; Line graph; Computer science","authors":[{"name":"Vladimir P. Korzhik","is_ca":true},{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03773873636701931,"gpt":0.2706385605727584,"spread":0.2328998242057391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001308969,0.0007896044,0.001350741,0.001127278,0.002254012,0.003208624,0.002492501,0.002389577,0.006757508],"category_scores_gemma":[0.01419161,0.001175516,0.002149832,0.0009451651,0.004905962,0.006260898,0.004867295,0.004006623,0.0004342561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002007233,"about_ca_system_score_gemma":0.001051969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001922353,"about_ca_topic_score_gemma":0.00141444,"domain_scores_codex":[0.9971219,0.0005444559,0.0002022753,0.0007036704,0.0008207099,0.0006069884],"domain_scores_gemma":[0.9749713,0.0190591,0.001861464,0.001789724,0.0008552187,0.001463247],"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.001870086,0.0008889185,0.01994791,0.001351305,0.0002558716,0.002437531,0.003216367,0.1074616,0.02398427,0.7805066,0.01273615,0.04534345],"study_design_scores_gemma":[0.0001886974,0.0001690564,0.003560879,0.00006591566,0.00008414886,0.0009130437,0.0006339103,0.07745346,0.007153325,0.9050658,0.00462339,0.00008824513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8818331,0.0003613826,0.09224804,0.004290613,0.00008649854,0.0001238323,0.001109982,0.0009374435,0.01900918],"genre_scores_gemma":[0.9838777,0.0001666716,0.01193084,0.000262776,0.00008190187,0.00009440639,0.001108237,0.0001088548,0.002368637],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006757508,"threshold_uncertainty_score":0.02260607,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4255798272","doi":"10.1002/jgt.20006","title":"Interval bigraphs and circular arc graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Interval graph; Chordal graph; Indifference graph; Bipartite graph; Cograph; Conjecture; Discrete mathematics; Split graph; Permutation graph; Vertex (graph theory); Interval (graph theory); Graph; 1-planar graph","authors":[{"name":"Pavol Hell","is_ca":true},{"name":"Jing Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01594946052942001,"gpt":0.2725096860002505,"spread":0.2565602254708305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002609339,0.0001712719,0.0002372436,0.0008531734,0.0008645151,0.001370213,0.0004446251,0.0004217635,0.005599922],"category_scores_gemma":[0.001785793,0.0002115309,0.0003130256,0.0008150358,0.001515864,0.002267653,0.000837368,0.0005162322,0.0003470846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004621547,"about_ca_system_score_gemma":0.0003445957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001690061,"about_ca_topic_score_gemma":0.001545926,"domain_scores_codex":[0.9996278,0.00007137602,0.00001736158,0.0001169606,0.00009300153,0.00007349945],"domain_scores_gemma":[0.9983291,0.000702011,0.0003278693,0.0002217722,0.0002152411,0.0002039547],"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.0002770588,0.0000568661,0.00441983,0.0001419176,0.00002299095,0.0004952692,0.00112353,0.00438908,0.01047622,0.9409621,0.001461415,0.03617361],"study_design_scores_gemma":[0.00004868227,0.0001559267,0.0094419,0.00009410701,0.00007714486,0.001837072,0.001708709,0.04459526,0.01497529,0.8945993,0.03241066,0.00005601644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.799122,0.0004638848,0.1500355,0.0003186816,0.00008866417,0.00007025415,0.0003911924,0.000377315,0.04913251],"genre_scores_gemma":[0.9774908,0.0001039565,0.01940133,0.00005452366,0.00002269404,0.00002653128,0.0002882066,0.00002428493,0.002587693],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005599922,"threshold_uncertainty_score":0.01873356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2754199588","doi":"10.1002/jgt.20000","title":"Some remarks on domination","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Mathematics; Combinatorics","authors":[{"name":"Dan Archdeacon","is_ca":false},{"name":"Joanna A. Ellis-Monaghan","is_ca":false},{"name":"David Fisher","is_ca":false},{"name":"Dalibor Fronček","is_ca":false},{"name":"Phat Lam","is_ca":false},{"name":"Suzanne M. Seager","is_ca":true},{"name":"Bing Wei","is_ca":false},{"name":"Raphael Yuster","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01240967132841389,"gpt":0.2852600797355756,"spread":0.2728504084071617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00473197,0.0008590303,0.001038417,0.001828556,0.002920328,0.002854245,0.002782674,0.002667628,0.02257545],"category_scores_gemma":[0.01745355,0.0003715161,0.001593288,0.002162497,0.006433044,0.01002213,0.003528101,0.00580829,0.002453222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001985255,"about_ca_system_score_gemma":0.0005798902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004595864,"about_ca_topic_score_gemma":0.002399509,"domain_scores_codex":[0.9966443,0.0009147652,0.0001446283,0.0008462543,0.0008802431,0.0005699229],"domain_scores_gemma":[0.9828187,0.01117494,0.0008189502,0.001702878,0.002352284,0.001132298],"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.0001190005,0.00004861098,0.001718689,0.0002111204,0.00003638295,0.000325231,0.0008162739,0.002629568,0.001012082,0.9273851,0.04937676,0.01632116],"study_design_scores_gemma":[0.00003540935,0.0000417252,0.001036423,0.0001215929,0.00002083346,0.0002921926,0.0005087609,0.003199147,0.0005757366,0.9105586,0.08358393,0.00002566996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.08023674,0.02464798,0.1452079,0.3457172,0.008957719,0.0001436209,0.001265696,0.001043062,0.3927801],"genre_scores_gemma":[0.8125574,0.01355237,0.02338397,0.07205741,0.01622296,0.0002264028,0.0007067201,0.0004843589,0.06080843],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02257545,"threshold_uncertainty_score":0.07552248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1566173313","doi":"10.1002/jgt.20249","title":"The crossing number of <i>K</i><sub>11</sub> is 100","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":56,"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":"Crossing number (knot theory); Combinatorics; Mathematics; Simple (philosophy); Graph; Exploit; Graph theory; Discrete mathematics; Computer science","authors":[{"name":"Shengjun Pan","is_ca":true},{"name":"R. Bruce Richter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01016406726067491,"gpt":0.2722684164393138,"spread":0.2621043491786389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004127995,0.0003269881,0.0002753702,0.00106754,0.0008353442,0.002131901,0.0005504403,0.0005170994,0.00948527],"category_scores_gemma":[0.002572181,0.0003377369,0.0002959086,0.001046898,0.0009720668,0.001200535,0.0004720683,0.0007910855,0.001213577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001181911,"about_ca_system_score_gemma":0.0004195051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007762294,"about_ca_topic_score_gemma":0.001027199,"domain_scores_codex":[0.999312,0.00008005367,0.00004185096,0.000172252,0.0002147154,0.0001792058],"domain_scores_gemma":[0.9977697,0.0006219426,0.0005721329,0.0003811053,0.0002782547,0.0003769783],"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.001648392,0.000364187,0.05159509,0.0005045471,0.0002049321,0.00191565,0.0008153121,0.04855363,0.2857627,0.4351105,0.02776196,0.1457632],"study_design_scores_gemma":[0.00007798819,0.0003877948,0.1114348,0.0001576367,0.000243013,0.00672115,0.001850508,0.1386405,0.310111,0.3465332,0.0836139,0.0002284281],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9374087,0.0002721416,0.01326171,0.0002459889,0.00008244436,0.00001692246,0.000447409,0.0002246486,0.04804001],"genre_scores_gemma":[0.9875888,0.0001762044,0.007549925,0.00005627657,0.00001457988,0.00001819655,0.0005644654,0.0001074729,0.003924088],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00948527,"threshold_uncertainty_score":0.03173143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2528053456","doi":"10.1002/jgt.10006","title":"Even‐hole‐free graphs part I: Decomposition theorem","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Joins; Mathematics; Combinatorics; Star (game theory); Decomposition theorem; Robertson–Seymour theorem; Discrete mathematics; Graph; Decomposition; 1-planar graph; Chordal graph; Computer science; Chemistry","authors":[{"name":"Michele Conforti","is_ca":false},{"name":"Gérard Cornuéjols","is_ca":false},{"name":"Ajai Kapoor","is_ca":false},{"name":"Kristina Vušković","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01846631093283506,"gpt":0.2994444635044387,"spread":0.2809781525716036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005062985,0.0007490031,0.0004510177,0.0008090613,0.0006395975,0.002034328,0.0008783609,0.000595573,0.01076586],"category_scores_gemma":[0.001474328,0.0004790076,0.0008449254,0.0006631062,0.001113536,0.003094241,0.001566876,0.001481505,0.002378525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008002986,"about_ca_system_score_gemma":0.0005889068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001042858,"about_ca_topic_score_gemma":0.00106159,"domain_scores_codex":[0.9994044,0.00006273586,0.00003325993,0.0001661342,0.0001534228,0.0001800374],"domain_scores_gemma":[0.9989082,0.0003832525,0.000114839,0.0002185124,0.0001950127,0.0001801694],"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.0003973675,0.0002409892,0.004039103,0.0006008321,0.00009521034,0.0006596503,0.0009773454,0.02453118,0.05742465,0.7034392,0.02967113,0.1779232],"study_design_scores_gemma":[0.00007323586,0.0001287582,0.00255785,0.000131379,0.00008000834,0.001511809,0.0004968937,0.07233701,0.0518989,0.8226266,0.04809806,0.00005947881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.121802,0.0006207887,0.8476753,0.0005937605,0.0001819261,0.0001438376,0.001071279,0.001361294,0.02654974],"genre_scores_gemma":[0.7512684,0.0006750764,0.2289247,0.0007466748,0.0001166775,0.000217167,0.002969136,0.0005722773,0.01450984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01076586,"threshold_uncertainty_score":0.03601533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154102540","doi":"10.1002/jgt.21644","title":"Star Chromatic Index","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Mathematics; Combinatorics; Mathematical proof; Chromatic scale; Upper and lower bounds; Star (game theory); Edge coloring; Graph; Discrete mathematics; Graph power; Line graph; Geometry","authors":[{"name":"Zdenĕk Dvořák","is_ca":false},{"name":"Bojan Mohar","is_ca":true},{"name":"Robert Šámal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0181218222648927,"gpt":0.2882157888555911,"spread":0.2700939665906983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006961242,0.0004987978,0.0005895262,0.002522821,0.001016032,0.002218322,0.0009527461,0.0005252095,0.01327781],"category_scores_gemma":[0.002253563,0.0002764703,0.0003816838,0.002505804,0.00157125,0.002589037,0.000980763,0.001254532,0.00187814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001777355,"about_ca_system_score_gemma":0.001224581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00177438,"about_ca_topic_score_gemma":0.00232503,"domain_scores_codex":[0.9989865,0.00009885915,0.00005941607,0.0002952785,0.0003143913,0.0002455057],"domain_scores_gemma":[0.9970085,0.001065306,0.0003201325,0.0004672144,0.0006399297,0.0004988949],"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.0006346046,0.0001929522,0.009340783,0.0004383244,0.00007031789,0.0001165478,0.0004693927,0.05089958,0.05824128,0.7858546,0.02401852,0.06972306],"study_design_scores_gemma":[0.00005623464,0.0002713013,0.009240938,0.00008507835,0.00006402012,0.000507756,0.0003431559,0.1185313,0.04819098,0.7574326,0.06516843,0.0001083051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4901118,0.002175214,0.2627625,0.001528925,0.000508884,0.0002076849,0.005790653,0.001604912,0.2353093],"genre_scores_gemma":[0.9313422,0.0009399757,0.05019743,0.0002437675,0.0001963508,0.00007873487,0.002225395,0.0002547922,0.01452124],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01327781,"threshold_uncertainty_score":0.04441863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4231986041","doi":"10.1002/1097-0118(200103)36:3<121::aid-jgt1000>3.0.co;2-u","title":"Tree embeddings","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Embedding; Graph; Discrete mathematics; Degree (music); Tree (set theory); Computer science","authors":[{"name":"Penny Haxell","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01767424194786473,"gpt":0.2940075536422283,"spread":0.2763333116943636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004609454,0.0006925872,0.0006185781,0.001227071,0.001226883,0.00273074,0.001062627,0.001062731,0.0210293],"category_scores_gemma":[0.003685968,0.0004661652,0.0009480842,0.001920837,0.0008762443,0.007559395,0.003404883,0.002190196,0.006136818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005562269,"about_ca_system_score_gemma":0.0002957659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00036499,"about_ca_topic_score_gemma":0.0004946683,"domain_scores_codex":[0.9992092,0.0001103937,0.00006402956,0.0002790923,0.0002036585,0.0001335611],"domain_scores_gemma":[0.998194,0.0005461096,0.0002259277,0.0004319299,0.0003947415,0.0002072909],"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.00006724832,0.0000446024,0.0005213462,0.0002472494,0.00002362122,0.0002926133,0.0005354011,0.002869073,0.003688566,0.8750918,0.01598329,0.1006351],"study_design_scores_gemma":[0.00001807758,0.0000577136,0.0004595543,0.0000674083,0.00003750038,0.001027504,0.0002771402,0.01189549,0.004194271,0.8385085,0.1434315,0.00002545888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05031092,0.002750194,0.8297011,0.001937682,0.001192613,0.000174321,0.002167137,0.001833941,0.1099319],"genre_scores_gemma":[0.4705122,0.007061341,0.4232341,0.001497546,0.001143387,0.0004757457,0.006168755,0.001654131,0.08825278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0210293,"threshold_uncertainty_score":0.07034999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2591779083","doi":"10.1002/jgt.21733","title":"The Inducibility of Graphs on Four Vertices","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Multipartite; Discrete mathematics; Graph","authors":[{"name":"James Hirst","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03695414308635255,"gpt":0.2891885994670018,"spread":0.2522344563806492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001427373,0.0003927314,0.0007563845,0.001267805,0.001144419,0.001580786,0.001205463,0.0004832487,0.003433459],"category_scores_gemma":[0.005216415,0.0004208536,0.000666702,0.0004872458,0.003115577,0.002936671,0.001921324,0.001935252,0.0002670379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000962654,"about_ca_system_score_gemma":0.0003479102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005160265,"about_ca_topic_score_gemma":0.0003974434,"domain_scores_codex":[0.9990789,0.000270325,0.00003283633,0.000234005,0.0002447004,0.0001391222],"domain_scores_gemma":[0.9938785,0.004272138,0.0004180742,0.0004374241,0.0003579973,0.0006357871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001803169,0.00007534308,0.002159118,0.0001254016,0.00002142172,0.0003343208,0.0006232817,0.007618211,0.007119024,0.9733918,0.000808311,0.007543464],"study_design_scores_gemma":[0.00002102625,0.00004905796,0.001114889,0.00002570771,0.00001486943,0.0002202982,0.0001647301,0.04334708,0.004885562,0.9486213,0.001518131,0.00001732639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8787428,0.0005263137,0.09047834,0.000787289,0.00005116142,0.00002669023,0.0002131575,0.00040723,0.02876715],"genre_scores_gemma":[0.9890301,0.0001198268,0.009066562,0.00008453959,0.00003926495,0.00001818213,0.000113983,0.00004717189,0.001480418],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003433459,"threshold_uncertainty_score":0.01148611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4235275672","doi":"10.1002/jgt.20064","title":"The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Conjecture; Foster graph; Discrete mathematics; Critical graph; Edge coloring; Friendship graph; Random graph; Graph; Windmill graph; Brooks' theorem; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Graph power; Line graph; Computer science","authors":[{"name":"Jaroslav Nešetřil","is_ca":false},{"name":"Nicholas Wormald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01308008132324962,"gpt":0.2844518910577733,"spread":0.2713718097345237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333758,0.0003487379,0.0004578402,0.001944593,0.001254308,0.001865883,0.001421582,0.0006775018,0.003760644],"category_scores_gemma":[0.01098552,0.0004213499,0.0003320055,0.001082928,0.003145051,0.002217486,0.001063766,0.001139949,0.0003498433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002524239,"about_ca_system_score_gemma":0.0007935506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002221312,"about_ca_topic_score_gemma":0.002021704,"domain_scores_codex":[0.9992267,0.0001697436,0.00003066845,0.0003075839,0.000133564,0.0001318472],"domain_scores_gemma":[0.9890668,0.006141992,0.001509302,0.001611961,0.0008177773,0.0008520703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005434901,0.0001218688,0.03389077,0.0003244015,0.0001115992,0.0002625932,0.0005497518,0.06162089,0.02901952,0.8279403,0.005851568,0.03976317],"study_design_scores_gemma":[0.0001030456,0.0001745003,0.02056344,0.0001047634,0.0001050577,0.001272977,0.0003570135,0.2137208,0.0229341,0.7295286,0.0109795,0.0001561103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8772391,0.0006375115,0.09782911,0.001434433,0.00007515647,0.00006133279,0.0005426692,0.0004085234,0.02177215],"genre_scores_gemma":[0.9897038,0.0003222941,0.007102263,0.0001740005,0.00004464706,0.00007754506,0.0002213213,0.00006325627,0.002290825],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003760644,"threshold_uncertainty_score":0.01831472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2526410593","doi":"10.1002/jgt.20448","title":"Coloring plane graphs with independent crossings","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"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; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Disjoint sets; Vertex (graph theory); Plane (geometry); Graph; Discrete mathematics; Geometry","authors":[{"name":"Daniel Král͏̌","is_ca":false},{"name":"Ladislav Stacho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0131842502653088,"gpt":0.271164064961363,"spread":0.2579798146960542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002649285,0.0006164443,0.0004880594,0.0007226883,0.0009751823,0.001676021,0.0008730757,0.0006133371,0.008488084],"category_scores_gemma":[0.001539918,0.0004736071,0.0006728256,0.0009147871,0.0009906283,0.001431348,0.001102865,0.0009498196,0.0007702818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000883508,"about_ca_system_score_gemma":0.0005648529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003627234,"about_ca_topic_score_gemma":0.003289723,"domain_scores_codex":[0.9994859,0.000102579,0.00002048019,0.0001297236,0.0001021804,0.0001591281],"domain_scores_gemma":[0.9984021,0.0005757484,0.0003482638,0.0002971907,0.000193731,0.000182965],"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.002592439,0.0005681699,0.0182128,0.0006254893,0.0003696819,0.001795726,0.001638703,0.1554036,0.1761155,0.4517911,0.02040952,0.1704774],"study_design_scores_gemma":[0.000484236,0.0005639901,0.01252203,0.0001535333,0.0003473242,0.00196064,0.001541516,0.1977783,0.1091725,0.6174245,0.05789853,0.0001529451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8945251,0.0004104372,0.07417001,0.0004504998,0.00009895654,0.00006844589,0.0004558786,0.0003991282,0.02942169],"genre_scores_gemma":[0.9570792,0.0003306349,0.03733216,0.0001780738,0.00003549418,0.00005308012,0.0005557247,0.00008919767,0.004346341],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008488084,"threshold_uncertainty_score":0.02839547,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4242606596","doi":"10.1002/jgt.1000","title":"Realizing finite edge‐transitive orientable maps","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Mathematics; Combinatorics; Automorphism; Transitive relation; Abelian group; Automorphism group; Discrete mathematics","authors":[{"name":"Jozef Širáň","is_ca":true},{"name":"Thomas W. Tucker","is_ca":false},{"name":"Mark E. Watkins","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007512334986247907,"gpt":0.2082934276642684,"spread":0.2007810926780205,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001295873,0.0003375098,0.0002060019,0.00055107,0.0004761055,0.0009948722,0.0002242818,0.000276983,0.001946988],"category_scores_gemma":[0.0004410847,0.0001912104,0.0003453385,0.0002070542,0.0007360763,0.0008520567,0.0007644377,0.0003511899,0.0002854779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006117302,"about_ca_system_score_gemma":0.0002542742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007447653,"about_ca_topic_score_gemma":0.001020869,"domain_scores_codex":[0.999833,0.00002380094,0.00001022145,0.00002606258,0.00004836619,0.00005851684],"domain_scores_gemma":[0.9998481,0.00003599181,0.00003817628,0.00002574467,0.00001849311,0.00003350582],"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.0001766067,0.00006497941,0.00164837,0.00009143462,0.00002693624,0.001193875,0.001590762,0.006737968,0.07565463,0.8886244,0.001129278,0.02306086],"study_design_scores_gemma":[0.00008077515,0.0002715842,0.002611718,0.0000401467,0.00006326465,0.0008564797,0.00103943,0.03165793,0.07953904,0.8555725,0.02821049,0.00005658203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9384446,0.0002371403,0.01954097,0.00009506264,0.00008570872,0.00003054183,0.00004470406,0.0001379036,0.04138347],"genre_scores_gemma":[0.9899569,0.0001375847,0.004812773,0.00002750306,0.00002119865,0.00001859297,0.00005224393,0.00001896822,0.004954116],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001946988,"threshold_uncertainty_score":0.006513298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103183688","doi":"10.1002/jgt.21819","title":"A Proof of a Conjecture of Ohba","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"Conjecture; Mathematics; Combinatorics","authors":[{"name":"Jonathan A. Noel","is_ca":false},{"name":"Bruce A. Reed","is_ca":false},{"name":"Hehui Wu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01095251187521541,"gpt":0.2700981083827483,"spread":0.2591455965075329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004960157,0.001361167,0.002082,0.001759005,0.004075027,0.003343462,0.003695858,0.003761513,0.02142763],"category_scores_gemma":[0.03801439,0.001066455,0.003038536,0.002802634,0.008511939,0.01240147,0.007578062,0.009903209,0.001881014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002500674,"about_ca_system_score_gemma":0.001683183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004261022,"about_ca_topic_score_gemma":0.002139617,"domain_scores_codex":[0.9947307,0.001223926,0.0002404537,0.001565835,0.001108223,0.001130733],"domain_scores_gemma":[0.9458393,0.03641411,0.002047609,0.006798267,0.005571174,0.003329524],"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.0007544413,0.0006145303,0.006209044,0.001035618,0.0001868072,0.0009593446,0.001845475,0.01041661,0.004842554,0.8845728,0.06937779,0.01918488],"study_design_scores_gemma":[0.0002261944,0.0001647029,0.001660254,0.0001140184,0.000092509,0.0003995114,0.0005242244,0.01975297,0.001792737,0.9563718,0.01885456,0.00004647543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3758816,0.003792286,0.3127062,0.12062,0.007966127,0.0004413794,0.002646058,0.002901935,0.1730444],"genre_scores_gemma":[0.9453357,0.0009232246,0.0348279,0.008007078,0.002310682,0.0002136556,0.001291833,0.0002589018,0.006831091],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02142763,"threshold_uncertainty_score":0.07168257,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4240838206","doi":"10.1002/jgt.20291","title":"A better bound for the cop number of general graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":32,"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":"Wilfrid Laurier University","keywords":"Combinatorics; Mathematics; Sublinear function; Upper and lower bounds; Vertex (graph theory); Graph; Discrete mathematics","authors":[{"name":"Ehsan Chiniforooshan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03242892619103172,"gpt":0.3078512286830073,"spread":0.2754223024919756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002422036,0.001133665,0.001944383,0.003383211,0.002147189,0.003040304,0.003370543,0.001445247,0.0129455],"category_scores_gemma":[0.01292973,0.0007442803,0.001188923,0.002282766,0.003726367,0.008536998,0.00315755,0.005470074,0.001812334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003549919,"about_ca_system_score_gemma":0.0009954339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001342632,"about_ca_topic_score_gemma":0.001034584,"domain_scores_codex":[0.99773,0.0005889664,0.00005939614,0.0005916229,0.0006010623,0.0004290382],"domain_scores_gemma":[0.9879178,0.00722468,0.0006910468,0.001931872,0.0009636618,0.001270873],"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.0002571914,0.0001506164,0.001626885,0.0002286068,0.00005297013,0.000314021,0.0002496693,0.01384942,0.004073988,0.9396361,0.02207381,0.01748662],"study_design_scores_gemma":[0.00003965141,0.00006576256,0.001346971,0.00008405418,0.00004163945,0.0004204843,0.00007831993,0.1188239,0.003857215,0.8602042,0.01498628,0.00005149717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4218178,0.008005936,0.2995629,0.01158876,0.001221778,0.0002089646,0.001341033,0.001563717,0.2546891],"genre_scores_gemma":[0.945011,0.001750299,0.03831734,0.001384077,0.0008968608,0.000185735,0.0006717868,0.0007024951,0.01108046],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0129455,"threshold_uncertainty_score":0.04330701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4241335985","doi":"10.1002/jgt.20363","title":"Circle graph obstructions under pivoting","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"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":"Combinatorics; Corollary; Circle graph; Mathematics; Outerplanar graph; Discrete mathematics; Graph; Pathwidth; Line graph","authors":[{"name":"Jim Geelen","is_ca":true},{"name":"Sang‐il Oum","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01817147925094919,"gpt":0.2891290677880259,"spread":0.2709575885370767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004262205,0.0003022302,0.0006652466,0.001045862,0.002065475,0.001728177,0.0006154323,0.0007826605,0.006177317],"category_scores_gemma":[0.003725129,0.0002933513,0.0005340243,0.000815216,0.002962346,0.001962456,0.002915523,0.001043307,0.0007273227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007296813,"about_ca_system_score_gemma":0.0007482587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00161821,"about_ca_topic_score_gemma":0.001293843,"domain_scores_codex":[0.9990471,0.0001376831,0.0000359847,0.0001809049,0.0002427215,0.0003555954],"domain_scores_gemma":[0.9967878,0.001292498,0.0004613701,0.0005218377,0.0003735751,0.0005628867],"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.0008234367,0.0001559481,0.009352752,0.0001982164,0.00003388337,0.001844296,0.001873319,0.01048711,0.01809401,0.9263568,0.00545585,0.02532448],"study_design_scores_gemma":[0.0001253872,0.0002316491,0.007492004,0.00005331753,0.00007366469,0.00189937,0.001910968,0.02917159,0.02114702,0.9177728,0.02003925,0.00008295514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9435661,0.0001324961,0.02937497,0.00027427,0.00004947533,0.00005643453,0.0001683415,0.0004197882,0.02595808],"genre_scores_gemma":[0.9935775,0.00006567646,0.003341504,0.00005513671,0.00002099326,0.00003018432,0.0002309251,0.00005315194,0.002624904],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006177317,"threshold_uncertainty_score":0.02066517,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1930792227","doi":"10.1002/jgt.21711","title":"Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"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":"Arboricity; Multigraph; Mathematics; Combinatorics; Degree (music); Conjecture; Dense graph; Planar graph; Bounded function; Graph; Discrete mathematics; Tree decomposition; Pathwidth; 1-planar graph; Chordal graph; Line graph","authors":[{"name":"Seog‐Jin Kim","is_ca":false},{"name":"Alexandr Kostochka","is_ca":false},{"name":"Douglas B. West","is_ca":false},{"name":"Hehui Wu","is_ca":true},{"name":"Xuding Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01759353469542376,"gpt":0.2805384940187399,"spread":0.2629449593233162,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002402724,0.0002320598,0.0002812269,0.0009301929,0.0003602942,0.0006474241,0.0002306855,0.0002859653,0.001658901],"category_scores_gemma":[0.001110082,0.0002073261,0.0002883122,0.0005410353,0.0005540306,0.001065154,0.0006636534,0.0004107656,0.0001279895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004094722,"about_ca_system_score_gemma":0.0002010559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009814337,"about_ca_topic_score_gemma":0.001729795,"domain_scores_codex":[0.9997998,0.00004002733,0.00001086578,0.00004850311,0.00004944512,0.0000513436],"domain_scores_gemma":[0.999121,0.0003752317,0.0001957038,0.00009209574,0.00009341792,0.0001226006],"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.0007512859,0.0001977617,0.01559715,0.0003888416,0.0001066755,0.002031339,0.001054276,0.1620028,0.1081572,0.6284223,0.004891506,0.07639893],"study_design_scores_gemma":[0.00005205451,0.0001016724,0.006173496,0.00007081,0.00005461372,0.001340676,0.0005549855,0.4050336,0.01270829,0.5674939,0.006393671,0.0000222984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8027256,0.0006399363,0.1881451,0.0003877584,0.00002433275,0.00002926386,0.0001805071,0.000142741,0.007724864],"genre_scores_gemma":[0.9754847,0.0001549159,0.02286927,0.00007007435,0.0000195431,0.00001347305,0.0001702449,0.00001481156,0.001202848],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001658901,"threshold_uncertainty_score":0.00554955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963622109","doi":"10.1002/jgt.22230","title":"Star chromatic index of subcubic multigraphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Science Foundation of Tianjin City; Simon Fraser University; National Natural Science Foundation of China","keywords":"Multigraph; Mathematics; Edge coloring; Combinatorics; Star (game theory); Graph; Conjecture; Discrete mathematics; Graph power; Line graph","authors":[{"name":"Hui Lei","is_ca":false},{"name":"Yongtang Shi","is_ca":false},{"name":"Zi‐Xia Song","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02104048839895501,"gpt":0.3052251601930699,"spread":0.2841846717941149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003728685,0.0003584519,0.0005196066,0.001382358,0.001310916,0.001639027,0.0008312858,0.0003559154,0.004918735],"category_scores_gemma":[0.001754295,0.0003949013,0.0004920226,0.001774624,0.0008250095,0.002260192,0.001305989,0.001052515,0.000315084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001529373,"about_ca_system_score_gemma":0.0008851321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002549503,"about_ca_topic_score_gemma":0.00365229,"domain_scores_codex":[0.9994434,0.00006966865,0.00003457566,0.0001628929,0.0001602433,0.0001293149],"domain_scores_gemma":[0.9972241,0.0008895126,0.0003700447,0.000525956,0.0004641998,0.000526221],"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.001009615,0.0003229435,0.02359321,0.0005018482,0.0001204842,0.0006633936,0.001751576,0.07482697,0.06154895,0.7416632,0.007810696,0.08618712],"study_design_scores_gemma":[0.0000658739,0.0001921892,0.01052845,0.00006626638,0.00008702506,0.0007988416,0.0009074067,0.2429638,0.02363089,0.7051587,0.0155446,0.00005609599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8883927,0.0003449721,0.08902398,0.0004157773,0.00004318422,0.00009544977,0.000824815,0.0001970241,0.02066209],"genre_scores_gemma":[0.9607993,0.0002470695,0.03377568,0.0001257605,0.00003706345,0.0000644681,0.0007398438,0.00007189947,0.004138875],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004918735,"threshold_uncertainty_score":0.01645476,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4253689634","doi":"10.1002/jgt.20334","title":"Bounding χ in terms of ω and Δ for quasi‐line graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Combinatorics; Mathematics; Line graph; Conjecture; Cubic graph; Graph; Discrete mathematics; Omega; Vertex (graph theory); Vertex-transitive graph; Graph power; Voltage graph; Physics","authors":[{"name":"Andrew D. King","is_ca":true},{"name":"Bruce A. Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04185691599901831,"gpt":0.3278837972455143,"spread":0.286026881246496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003797085,0.0009985127,0.0008518277,0.001961658,0.001247557,0.002450877,0.003262127,0.001317701,0.005284674],"category_scores_gemma":[0.02968066,0.0008985727,0.0006160467,0.001328565,0.002872268,0.008448199,0.002715953,0.002315405,0.0007145641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003243679,"about_ca_system_score_gemma":0.0008057139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003754379,"about_ca_topic_score_gemma":0.004100844,"domain_scores_codex":[0.9972723,0.001206908,0.00006438947,0.0005990384,0.000414533,0.0004427186],"domain_scores_gemma":[0.9366978,0.05294297,0.003438845,0.003819682,0.001391953,0.001708616],"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.001064191,0.0002656112,0.01347653,0.0003676133,0.0001196528,0.0003797527,0.0005412652,0.2942842,0.01021305,0.6242972,0.01419645,0.04079451],"study_design_scores_gemma":[0.00001878056,0.0000410987,0.0009780817,0.00003794063,0.00001615939,0.00007748994,0.00009844561,0.7271854,0.001636495,0.2679054,0.001978696,0.00002601488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3286468,0.001862732,0.642128,0.003712862,0.0001699753,0.00006164722,0.0005091234,0.001359138,0.02154967],"genre_scores_gemma":[0.9261735,0.0004024768,0.06912845,0.0004907462,0.0001351337,0.00008267273,0.0002340196,0.0002912435,0.003061755],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005284674,"threshold_uncertainty_score":0.02353472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4251499002","doi":"10.1002/jgt.20036","title":"Graphs with independent perfect matchings","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Perfect graph theorem; Strong perfect graph theorem; Perfect graph; Trivially perfect graph; Matching (statistics); Discrete mathematics; Line graph; Graph; Pathwidth","authors":[{"name":"Marcelo H. de Carvalho","is_ca":false},{"name":"Cl�udio L. Lucchesi","is_ca":false},{"name":"U. S. R. Murty","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009461830976999132,"gpt":0.2545278158753462,"spread":0.2450659848983471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000339235,0.0003745328,0.0006556398,0.001223254,0.001120166,0.001481789,0.0007755011,0.0006236631,0.004395453],"category_scores_gemma":[0.002979256,0.0005167755,0.0005273998,0.001804203,0.001032367,0.002162519,0.001614591,0.0006569211,0.0004438281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006108324,"about_ca_system_score_gemma":0.0003548211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000782998,"about_ca_topic_score_gemma":0.0008113304,"domain_scores_codex":[0.9991177,0.0001316278,0.00004929546,0.0002507028,0.0002218536,0.0002288133],"domain_scores_gemma":[0.9982123,0.0005960449,0.0004654914,0.0003538703,0.0001671322,0.0002050547],"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.0006500469,0.0001156974,0.009677125,0.0003538024,0.0001758034,0.001080628,0.000841131,0.03357557,0.0166198,0.8548868,0.008395622,0.07362807],"study_design_scores_gemma":[0.0000729778,0.00009404797,0.006783069,0.00005353354,0.0001025514,0.001766623,0.0005285204,0.07099489,0.007134808,0.8938351,0.01859114,0.00004276997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8704271,0.0007835833,0.09474597,0.0005952275,0.00005085786,0.0000734242,0.001311428,0.000427635,0.03158486],"genre_scores_gemma":[0.9787301,0.0002650223,0.01706992,0.0000736092,0.00004831199,0.00005519808,0.0008000485,0.00003811936,0.002919687],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004395453,"threshold_uncertainty_score":0.01470429,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1913504200","doi":"10.1002/jgt.21791","title":"Chasing a Fast Robber on Planar Graphs and Random Graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"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":"Israeli Centers for Research Excellence; Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Mathematics; Combinatorics; Treewidth; Planar graph; Vertex (graph theory); Discrete mathematics; Graph; Constant (computer programming); Pathwidth; Line graph; Computer science","authors":[{"name":"Noga Alon","is_ca":false},{"name":"Abbas Mehrabian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01250663770375848,"gpt":0.2608837992795954,"spread":0.2483771615758369,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001615307,0.001845847,0.002150207,0.001110491,0.001365644,0.001842523,0.002827357,0.002263343,0.004755453],"category_scores_gemma":[0.01256523,0.0007918653,0.001200888,0.001366115,0.003053347,0.005953778,0.002643042,0.002006766,0.0005292401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001965387,"about_ca_system_score_gemma":0.001013373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004431917,"about_ca_topic_score_gemma":0.004108405,"domain_scores_codex":[0.9979791,0.0007241484,0.00006460086,0.0005061619,0.0002191597,0.0005068696],"domain_scores_gemma":[0.9899766,0.006830267,0.00121975,0.0008542993,0.0002769053,0.0008422418],"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.000597661,0.0001568766,0.001201283,0.0002189403,0.0001255655,0.0006112133,0.0002337028,0.7196965,0.005436018,0.2581837,0.002651845,0.01088666],"study_design_scores_gemma":[0.00008935373,0.0001350843,0.0004453262,0.00001953761,0.00003385277,0.0002486931,0.0001335423,0.8671801,0.00151577,0.1287316,0.00142881,0.0000381997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5028288,0.0007346613,0.4788396,0.001867561,0.00007129116,0.0002127356,0.0005154336,0.0006065088,0.01432337],"genre_scores_gemma":[0.9255086,0.0005592234,0.06646727,0.0002713064,0.00007262944,0.0001831493,0.0003769797,0.0001499257,0.006410889],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004755453,"threshold_uncertainty_score":0.0159086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4233572056","doi":"10.1002/jgt.20440","title":"Cycles and paths in edge‐colored graphs with given degrees","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College Saint-Jean","funders":"","keywords":"Colored; Multigraph; Combinatorics; Mathematics; Hamiltonian path; Edge coloring; Graph; Hamiltonian (control theory); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Line graph; Graph power; Computer science","authors":[{"name":"A. Abouelaoualim","is_ca":false},{"name":"Kinkar Chandra Das","is_ca":false},{"name":"W. Fernandez de la Véga","is_ca":false},{"name":"Marek Karpiński","is_ca":false},{"name":"Yannis Manoussakis","is_ca":false},{"name":"Carlos A. Martinhon","is_ca":false},{"name":"Rachid Saad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01615817366489835,"gpt":0.2670299673838781,"spread":0.2508717937189797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009049191,0.0004457998,0.0006262968,0.001975776,0.0009641195,0.001525782,0.0007590823,0.00070868,0.002708857],"category_scores_gemma":[0.008175049,0.000685094,0.0004765936,0.001371802,0.002114686,0.003069679,0.001534047,0.0007508683,0.0001872453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001032429,"about_ca_system_score_gemma":0.0006842633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001163639,"about_ca_topic_score_gemma":0.001356453,"domain_scores_codex":[0.9989383,0.000310304,0.00008570657,0.0002544221,0.0002349271,0.0001762754],"domain_scores_gemma":[0.992015,0.00485885,0.00123282,0.0005406794,0.0007166989,0.0006359778],"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.0003338159,0.00005726209,0.004240411,0.0002007603,0.00005525553,0.0006211895,0.0007874134,0.02862998,0.01024187,0.9402736,0.001097651,0.01346065],"study_design_scores_gemma":[0.00006496473,0.00005687362,0.001240813,0.0000585474,0.00003039517,0.0004934628,0.0002996645,0.06244375,0.005033141,0.9267138,0.003531819,0.00003267797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8362709,0.000774265,0.1509889,0.00048565,0.00004040973,0.00007043503,0.0004395985,0.0001636736,0.01076608],"genre_scores_gemma":[0.9657391,0.0003698481,0.03193467,0.00007924891,0.00003459412,0.0000955958,0.0002299904,0.00003443993,0.001482586],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002708857,"threshold_uncertainty_score":0.009061992,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022630997","doi":"10.1002/jgt.20560","title":"Disjoint Hamilton cycles in the random geometric graph","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Disjoint sets; Hamiltonian path; Pairwise comparison; Discrete mathematics; Line graph; Random graph; Graph","authors":[{"name":"Tobias Müller","is_ca":false},{"name":"Xavier Pérez‐Giménez","is_ca":true},{"name":"Nicholas Wormald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02557476282706089,"gpt":0.2294983793032437,"spread":0.2039236164761828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001214984,0.0005593158,0.0006487884,0.001573363,0.001009916,0.00125082,0.00122996,0.0009004257,0.002258635],"category_scores_gemma":[0.007014877,0.0004760541,0.000593227,0.0008811778,0.002754622,0.002624487,0.001582551,0.0009885645,0.0002864075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001552587,"about_ca_system_score_gemma":0.0007373977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002253287,"about_ca_topic_score_gemma":0.002236341,"domain_scores_codex":[0.9990057,0.0004153645,0.00003132689,0.0002246468,0.0001738771,0.0001490949],"domain_scores_gemma":[0.9962928,0.001672267,0.0008647066,0.000396487,0.0003218171,0.0004518292],"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.00014035,0.00003611757,0.001275876,0.00006589707,0.00003575474,0.0003062236,0.0002590105,0.05576259,0.002559706,0.9293511,0.001422483,0.00878494],"study_design_scores_gemma":[0.0000796712,0.00007012102,0.0006376912,0.00002008441,0.00002359725,0.0001688413,0.0001082955,0.2519647,0.001338759,0.7428639,0.002683087,0.00004122324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6545975,0.0009981381,0.3270844,0.001764524,0.0001013686,0.0001623618,0.0003263387,0.0002687981,0.01469655],"genre_scores_gemma":[0.9488953,0.0005851085,0.04393276,0.0003181902,0.00009942039,0.0002187256,0.0002431723,0.00006472642,0.005642571],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002258635,"threshold_uncertainty_score":0.0112648,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4243779214","doi":"10.1002/jgt.10097","title":"Crossing numbers of sequences of graphs II: Planar tiles","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Tile; Book embedding; Rational number; 1-planar graph; Planar; Graph; Pathwidth; Discrete mathematics; Sequence (biology); Crossing number (knot theory); Indifference graph; Chordal graph; Line graph; Computer science","authors":[{"name":"Benny Pinontoan","is_ca":true},{"name":"R. Bruce Richter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01333210502062638,"gpt":0.2511320324903791,"spread":0.2377999274697528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005187757,0.0003270507,0.0002981284,0.00193996,0.0009054806,0.001313829,0.0005150324,0.0004390677,0.002948699],"category_scores_gemma":[0.00359804,0.0002801779,0.0003076985,0.0006279818,0.001233343,0.000962352,0.0007924768,0.0007667529,0.0002643717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008663433,"about_ca_system_score_gemma":0.0002790191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004518317,"about_ca_topic_score_gemma":0.0004093327,"domain_scores_codex":[0.9995883,0.00006663571,0.00002556871,0.00009389795,0.0001312637,0.00009426465],"domain_scores_gemma":[0.9982466,0.0006118821,0.0003254914,0.0001657741,0.0002637021,0.0003866447],"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.0004739969,0.00009864326,0.006745359,0.0001937449,0.00003726408,0.000971238,0.001237744,0.04944775,0.06181704,0.8446134,0.002512748,0.03185098],"study_design_scores_gemma":[0.00006664536,0.0004526157,0.01022585,0.0001570847,0.00008183076,0.002058409,0.001080173,0.204036,0.04886203,0.7143509,0.01853199,0.00009642442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9107438,0.000329522,0.06718491,0.0001134291,0.0000680965,0.00003573203,0.0001060598,0.000257547,0.02116096],"genre_scores_gemma":[0.9861979,0.0001419865,0.01123409,0.00002872094,0.00002066073,0.00004414525,0.0001597565,0.00005484423,0.002117914],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002948699,"threshold_uncertainty_score":0.00986439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1904355337","doi":"10.1002/jgt.20635","title":"A Characterization of b‐Perfect Graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph coloring; Complete coloring; Fractional coloring; Discrete mathematics; Chromatic polynomial; List coloring; Edge coloring; Graph factorization; Graph power; Wheel graph; Graph; Vertex (graph theory); Line graph","authors":[{"name":"Chı́nh T. Hoàng","is_ca":true},{"name":"Frédéric Maffray","is_ca":false},{"name":"Meriem Mechebbek","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01800886521061376,"gpt":0.2067521056339043,"spread":0.1887432404232905,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005066014,0.0004602192,0.0004541425,0.001450734,0.001285796,0.002340037,0.0007876783,0.000757752,0.006290838],"category_scores_gemma":[0.003115904,0.000616774,0.0003574472,0.001597588,0.001805947,0.003470125,0.001611056,0.0009353814,0.0006478056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001065254,"about_ca_system_score_gemma":0.0006926925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001774255,"about_ca_topic_score_gemma":0.001119183,"domain_scores_codex":[0.999134,0.0001480922,0.00006111696,0.0003012416,0.0001853061,0.000170279],"domain_scores_gemma":[0.9968143,0.001117656,0.0006960607,0.0005040705,0.0004227962,0.000445086],"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.0003844526,0.00008739035,0.00607332,0.0002453884,0.00003628298,0.0003728687,0.0005228653,0.01610488,0.01395645,0.9143072,0.009247292,0.03866155],"study_design_scores_gemma":[0.00005613764,0.0001404737,0.004048376,0.00008128364,0.00004021653,0.001062958,0.0006662583,0.07142125,0.008733663,0.8858889,0.02781265,0.00004782381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5908579,0.001072029,0.333645,0.002176265,0.0001683277,0.0001979132,0.00241936,0.0009921771,0.06847098],"genre_scores_gemma":[0.9540023,0.0003110938,0.04083639,0.0003137906,0.0000898708,0.00006410856,0.0009599832,0.00007954189,0.003343023],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006290838,"threshold_uncertainty_score":0.02104491,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4253190912","doi":"10.1002/jgt.10041","title":"Projectivity and independent sets in powers of graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; Champlain Regional College; Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","authors":[{"name":"Benoît Larose","is_ca":true},{"name":"Claude Tardif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02923283402548195,"gpt":0.2822847666308228,"spread":0.2530519326053409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002425328,0.00052684,0.0009306193,0.003100886,0.001740985,0.00390701,0.001071988,0.0007561233,0.005329374],"category_scores_gemma":[0.01260261,0.0007762882,0.000907047,0.00204186,0.006784728,0.008790955,0.0036611,0.001614575,0.0004792968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008103186,"about_ca_system_score_gemma":0.0003707651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005012891,"about_ca_topic_score_gemma":0.0003764657,"domain_scores_codex":[0.9976507,0.0007448838,0.0001581828,0.0004370174,0.0007375805,0.0002716231],"domain_scores_gemma":[0.986272,0.008285183,0.001786746,0.001119374,0.001329898,0.001206916],"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.0000582872,0.00001738942,0.0009431186,0.0000465758,0.00002236561,0.0001430349,0.000578762,0.001954951,0.001097662,0.9917532,0.0002091328,0.003175472],"study_design_scores_gemma":[0.000009644057,0.00001931314,0.0003538909,0.00001784973,0.00001081893,0.0002054862,0.0002071698,0.004675583,0.0007102881,0.9928947,0.0008843333,0.00001098924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8245873,0.0006631259,0.1373639,0.0007001542,0.00006004431,0.0000561467,0.0002478611,0.0001108587,0.03621053],"genre_scores_gemma":[0.9858783,0.0003333507,0.01026783,0.00004433998,0.00008072274,0.00005988602,0.0001414198,0.00004358725,0.00315056],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005329374,"threshold_uncertainty_score":0.01782852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111678564","doi":"10.1002/jgt.20613","title":"Kempe Equivalence of Edge‐Colorings in Subcubic and Subquartic Graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"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":"Mathematics; Combinatorics; Conjecture; Equivalence (formal languages); Edge coloring; Graph; Enhanced Data Rates for GSM Evolution; Cubic graph; Discrete mathematics; Line graph; Voltage graph; Graph power; Computer science","authors":[{"name":"Jessica McDonald","is_ca":true},{"name":"Bojan Mohar","is_ca":true},{"name":"Diego Scheide","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03657459361179385,"gpt":0.2746048405043239,"spread":0.23803024689253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000764308,0.0002783126,0.0004781908,0.001389977,0.001477169,0.001563292,0.0007686086,0.0006434329,0.007060384],"category_scores_gemma":[0.004356194,0.0003349597,0.0006442296,0.00073404,0.002003775,0.002161338,0.001653663,0.001644398,0.0005316435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008138271,"about_ca_system_score_gemma":0.0005047945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001456513,"about_ca_topic_score_gemma":0.001389776,"domain_scores_codex":[0.9988602,0.0002363613,0.00006540446,0.0002700811,0.0003129129,0.0002550306],"domain_scores_gemma":[0.9965416,0.001932182,0.0003346086,0.0004969651,0.0003584982,0.0003360483],"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.0006834705,0.0001441346,0.003143984,0.0001977039,0.00005052791,0.0007322736,0.001660667,0.01372311,0.01580931,0.9275639,0.002718998,0.03357198],"study_design_scores_gemma":[0.00003496957,0.00007266692,0.001924832,0.00001940461,0.00001953582,0.0003126043,0.0003853713,0.01130229,0.005888949,0.9761187,0.003890127,0.00003062671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8791441,0.0002799907,0.05889173,0.0004069329,0.0001354302,0.0001009899,0.0002665188,0.0002239539,0.06055041],"genre_scores_gemma":[0.9847124,0.0001656598,0.009812494,0.000186497,0.00005536508,0.00003893748,0.0002297394,0.0000507796,0.004748235],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007060384,"threshold_uncertainty_score":0.02361929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062017656","doi":"10.1002/jgt.20102","title":"On graphs whose Laplacian matrices have distinct integer eigenvalues","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Laplacian matrix; Mathematics; Combinatorics; Eigenvalues and eigenvectors; Conjecture; Laplace operator; Resistance distance; Algebraic connectivity; Graph; Discrete mathematics; Integer (computer science); Spectral graph theory; Matrix (chemical analysis); Line graph; Graph power; Mathematical analysis; Computer science; Physics","authors":[{"name":"Shaun Fallat","is_ca":true},{"name":"Stephen Kirkland","is_ca":true},{"name":"Jason J. Molitierno","is_ca":false},{"name":"Michael Neumann","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02432364321713661,"gpt":0.3075562901536715,"spread":0.2832326469365349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000503558,0.0004835853,0.0004616408,0.001187694,0.001325431,0.001588082,0.0005221131,0.0007241212,0.002599539],"category_scores_gemma":[0.003007089,0.0003461031,0.0005170704,0.0007149261,0.002131867,0.002536153,0.001098973,0.0007068035,0.0001502927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008695116,"about_ca_system_score_gemma":0.0003121054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000819886,"about_ca_topic_score_gemma":0.001158462,"domain_scores_codex":[0.9995221,0.0001267995,0.00002125452,0.00009227005,0.0001138928,0.0001237873],"domain_scores_gemma":[0.9972856,0.001514561,0.0005869269,0.0002384,0.000140689,0.0002338456],"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.0003255358,0.0001324569,0.004102271,0.0001177032,0.00003804318,0.00122479,0.001195222,0.0282046,0.02378554,0.9283019,0.001410526,0.01116142],"study_design_scores_gemma":[0.00005297026,0.00006725014,0.001408945,0.00002941033,0.00002067928,0.0003645396,0.0007365086,0.06247149,0.004986952,0.9279743,0.001853709,0.00003322475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9490206,0.000154286,0.03958987,0.0003186823,0.00002101208,0.00002170833,0.00008714815,0.00008024055,0.01070645],"genre_scores_gemma":[0.9928252,0.00009696245,0.005584981,0.00004174637,0.00002136148,0.00002529774,0.00008263834,0.00002131149,0.001300533],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002599539,"threshold_uncertainty_score":0.008696318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2598883699","doi":"10.1002/jgt.22111","title":"Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Chordal graph; Combinatorics; Mathematics; Treewidth; Split graph; Clique-sum; Interval graph; Indifference graph; Discrete mathematics; Bounded function; Independence number; Induced subgraph; Pathwidth; Vertex (graph theory); Graph; 1-planar graph; Line graph","authors":[{"name":"Andreas Brandstädt","is_ca":false},{"name":"Konrad K. Dabrowski","is_ca":false},{"name":"Shenwei Huang","is_ca":true},{"name":"Daniël Paulusma","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02511845915547385,"gpt":0.3149270744807101,"spread":0.2898086153252363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006494499,0.0003979396,0.000434709,0.001180518,0.0008586429,0.001563967,0.00148123,0.0005449119,0.003251582],"category_scores_gemma":[0.004579265,0.0003898942,0.0005116067,0.0008833131,0.001171585,0.002468463,0.001155296,0.001034809,0.0002329223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001088905,"about_ca_system_score_gemma":0.0004709094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002101632,"about_ca_topic_score_gemma":0.002342091,"domain_scores_codex":[0.9993746,0.0001014746,0.00002739989,0.0002070177,0.0001242683,0.0001653452],"domain_scores_gemma":[0.9929388,0.004831687,0.0005803091,0.0007131235,0.0003621189,0.0005739701],"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.001275392,0.0003567211,0.04626254,0.0008382333,0.0002723931,0.0008067167,0.001955339,0.1030342,0.09598836,0.6731089,0.01158673,0.06451444],"study_design_scores_gemma":[0.00007984451,0.0001129055,0.01985716,0.00007599049,0.00009583406,0.000707844,0.0005386984,0.2368746,0.02783944,0.7064529,0.007289718,0.00007505434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8969601,0.0004816462,0.08392877,0.000673933,0.00003090065,0.00005600574,0.001169826,0.0003377874,0.01636098],"genre_scores_gemma":[0.986674,0.0001269431,0.01144561,0.00008337026,0.00004069688,0.00003180052,0.0004963006,0.00005975143,0.001041628],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003251582,"threshold_uncertainty_score":0.01087761,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036786740","doi":"10.1002/jgt.20445","title":"On the minimum degree of minimal Ramsey graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Degree (music); Discrete mathematics; Cograph; Graph; Pathwidth; Chordal graph; 1-planar graph; Line graph","authors":[{"name":"Tibor Szabó","is_ca":true},{"name":"Philipp Zumstein","is_ca":false},{"name":"Stefanie Zürcher","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04026935918545071,"gpt":0.2881943755700647,"spread":0.247925016384614,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001380137,0.0004456307,0.0008953332,0.001308059,0.0007669327,0.001245557,0.001223795,0.0009205433,0.003151487],"category_scores_gemma":[0.007466457,0.0005218648,0.0003398915,0.0007268258,0.001248182,0.002518411,0.0009545566,0.0008627746,0.0002500832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008712532,"about_ca_system_score_gemma":0.0003584877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008053493,"about_ca_topic_score_gemma":0.0009136142,"domain_scores_codex":[0.9993148,0.0002901017,0.00002580259,0.0001628408,0.000117023,0.00008941811],"domain_scores_gemma":[0.9958781,0.002721989,0.0004672585,0.0002423484,0.0003201113,0.0003701964],"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.0007805919,0.0001865213,0.007323499,0.0006364444,0.0001254918,0.0002834496,0.0008613497,0.1138792,0.02838202,0.8127124,0.006404849,0.02842413],"study_design_scores_gemma":[0.00009752325,0.0001158393,0.003265044,0.00008104801,0.00004290681,0.0005010833,0.000410748,0.2845211,0.007834562,0.6997913,0.003285216,0.00005353387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.87945,0.0008260111,0.1064577,0.001163644,0.00004918816,0.00004692389,0.0003494747,0.0001430642,0.01151408],"genre_scores_gemma":[0.9773842,0.0002784948,0.02028898,0.00009052835,0.00005771743,0.0000504043,0.0001878675,0.00005988108,0.001601946],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003151487,"threshold_uncertainty_score":0.01054275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1595412293","doi":"10.1002/jgt.20626","title":"Large cliques or stable sets in graphs with no four‐edge path and no five‐edge path in the complement","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Induced path; Block graph; Conjecture; Induced subgraph; Path graph; Split graph; Independent set; Discrete mathematics; Complement (music); Graph factorization; Graph; Path (computing); Longest path problem; Chordal graph; Pathwidth; Line graph; Graph power; Computer science; Vertex (graph theory)","authors":[{"name":"Maria Chudnovsky","is_ca":false},{"name":"Yori Zwólš","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04279535364240605,"gpt":0.2992597116122812,"spread":0.2564643579698752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008920052,0.0003830468,0.0005127623,0.001160432,0.00188816,0.001815534,0.000979514,0.0006561961,0.004784734],"category_scores_gemma":[0.004398244,0.0005826459,0.0009019515,0.001095347,0.003247663,0.003384243,0.00218643,0.00109485,0.0002296709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001014952,"about_ca_system_score_gemma":0.0007248952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002260514,"about_ca_topic_score_gemma":0.002918907,"domain_scores_codex":[0.9993277,0.000165075,0.00002960851,0.0002107093,0.0001359022,0.0001309605],"domain_scores_gemma":[0.9929546,0.004606405,0.0009924578,0.0004911349,0.0003479757,0.0006075446],"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.001000358,0.000240409,0.01250744,0.0004209478,0.0001803151,0.001260568,0.002387114,0.02050866,0.02548688,0.9058258,0.007753063,0.02242853],"study_design_scores_gemma":[0.0001972148,0.0001617368,0.006058252,0.000052223,0.0001093746,0.0007620584,0.0008384457,0.06105071,0.009367688,0.9153929,0.005936776,0.00007270408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9466556,0.000346987,0.03862272,0.001027787,0.00004279136,0.00007485398,0.0003210948,0.00008772365,0.01282047],"genre_scores_gemma":[0.9863491,0.0001697486,0.01048145,0.00009359784,0.00004955636,0.0000550417,0.0003625788,0.00001855608,0.00242042],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004784734,"threshold_uncertainty_score":0.01600653,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2616177501","doi":"10.1002/1097-0118(200008)34:4<277::aid-jgt4>3.0.co;2-#","title":"A characterization of (γ, <i>i</i> )‐trees","year":2000,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Characterization (materials science); Mathematics; Combinatorics; Discrete mathematics; Physics","authors":[{"name":"E. J. Cockayne","is_ca":true},{"name":"Odile Favaron","is_ca":false},{"name":"Christina M. Mynhardt","is_ca":false},{"name":"Joël Puech","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01670190763608695,"gpt":0.2648895667963944,"spread":0.2481876591603075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005661937,0.0003746297,0.000387429,0.001760688,0.000994161,0.003722823,0.0008617164,0.0006805472,0.002778408],"category_scores_gemma":[0.004189849,0.0003043323,0.0003138094,0.002234705,0.001357094,0.003055999,0.0009926955,0.0007670362,0.0005288023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009809784,"about_ca_system_score_gemma":0.0004051018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008695123,"about_ca_topic_score_gemma":0.0008553051,"domain_scores_codex":[0.9993159,0.00008769815,0.00004850132,0.000245193,0.0001483956,0.0001543082],"domain_scores_gemma":[0.9966787,0.001404709,0.0007715707,0.0002563871,0.0004369584,0.0004516716],"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.0004594481,0.0001383408,0.01801765,0.0002953061,0.000072412,0.0006588232,0.002138341,0.01882465,0.05017917,0.8198098,0.01033531,0.07907078],"study_design_scores_gemma":[0.000055009,0.0001639262,0.0130128,0.0001139954,0.00008181697,0.003572533,0.001395363,0.0704379,0.01604649,0.8515251,0.04353308,0.00006196299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.727538,0.001111675,0.2161419,0.0008818106,0.00006252449,0.00009985926,0.002080652,0.0002854016,0.05179828],"genre_scores_gemma":[0.9607301,0.0004766981,0.03185115,0.0002177929,0.0001032369,0.00009714171,0.001643258,0.00009563821,0.004785143],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003722823,"threshold_uncertainty_score":0.009294689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W100995880","doi":"10.1002/jgt.20611","title":"Random graphons and a weak Positivstellensatz for graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":19,"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":"Mathematics; Discrete mathematics; Combinatorics; Multiplicative function; Random graph; Countable set; Graph; Ergodic theory; Pure mathematics","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.04184398416111462,"gpt":0.2771186155277397,"spread":0.2352746313666251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004426808,0.0004712579,0.0007541436,0.001737199,0.001191054,0.002341778,0.001607938,0.001451562,0.003670287],"category_scores_gemma":[0.01602382,0.000480794,0.001130763,0.0008286436,0.006779647,0.005985809,0.002946595,0.002550747,0.0003879694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0015173,"about_ca_system_score_gemma":0.000633881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008867934,"about_ca_topic_score_gemma":0.0005884432,"domain_scores_codex":[0.9971535,0.001310945,0.0001399487,0.0005605234,0.0006039637,0.0002310926],"domain_scores_gemma":[0.9842883,0.01085823,0.001457836,0.001240732,0.001222614,0.0009322906],"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.00001929817,0.00001740695,0.0004448958,0.00001338364,0.000006848967,0.00006522077,0.0001377804,0.003118792,0.0006600103,0.9945675,0.0001280855,0.0008207583],"study_design_scores_gemma":[0.00001648811,0.0000333076,0.0002791025,0.000009912126,0.000003514762,0.0001200191,0.00008290652,0.04679274,0.0007843999,0.9512935,0.0005700443,0.00001407587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6353102,0.000476977,0.343952,0.002237389,0.00006294602,0.00006756936,0.000179019,0.0002272516,0.01748664],"genre_scores_gemma":[0.9828971,0.0001119902,0.0143022,0.0002206561,0.00007235659,0.00008147429,0.0001101081,0.00003464682,0.002169359],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004426808,"threshold_uncertainty_score":0.02341145,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4241301040","doi":"10.1002/jgt.20205","title":"Independent dominating sets and hamiltonian cycles","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"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":"Mathematics; Hamiltonian path; Combinatorics; Hamiltonian (control theory); Graph; Hamiltonian path problem; Discrete mathematics; Mathematical optimization","authors":[{"name":"Penny Haxell","is_ca":true},{"name":"Ben Seamone","is_ca":true},{"name":"Jacques Verstraëte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0100893062538668,"gpt":0.2722599458959123,"spread":0.2621706396420456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007001564,0.0003584674,0.0006984423,0.001396129,0.001290086,0.001588869,0.0008456007,0.0006329076,0.003487021],"category_scores_gemma":[0.004355646,0.0004804392,0.000342497,0.001066152,0.001811004,0.001724004,0.001520688,0.00081514,0.0002874219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008480771,"about_ca_system_score_gemma":0.0004214837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006822539,"about_ca_topic_score_gemma":0.0007911794,"domain_scores_codex":[0.9991146,0.0002320517,0.00004783628,0.0002561575,0.0002095487,0.0001398708],"domain_scores_gemma":[0.9961269,0.002271639,0.0005760127,0.0003197186,0.0003322608,0.0003734533],"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.0001180997,0.00005300414,0.003340984,0.0003079963,0.00007733718,0.0005543461,0.0007565042,0.0163145,0.005119347,0.9320225,0.007049236,0.03428615],"study_design_scores_gemma":[0.00002789105,0.00004859681,0.001657757,0.00005337896,0.00005031183,0.0009279288,0.0003452073,0.02800566,0.003031493,0.9546098,0.01121503,0.00002700147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7562782,0.004359505,0.143112,0.002335506,0.000283559,0.0001123062,0.0008255331,0.000171763,0.09252162],"genre_scores_gemma":[0.9807586,0.0005795993,0.01243253,0.0002498864,0.000108571,0.00004626338,0.0002814628,0.00002120586,0.005521796],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003487021,"threshold_uncertainty_score":0.01166523,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4256731050","doi":"10.1002/jgt.20161","title":"The <i>k</i>‐piece packing problem","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":18,"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":"Mathematics; Combinatorics; Disjoint sets; Graph; Degree (music); Discrete mathematics; Matching (statistics); Time complexity","authors":[{"name":"David Hartvigsen","is_ca":false},{"name":"Pavol Hell","is_ca":true},{"name":"Jácint Szabó","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003255866224064684,"gpt":0.1759290234281393,"spread":0.1726731572040746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009324223,0.0009999713,0.001581785,0.0007447802,0.001248202,0.002862433,0.001825905,0.002417197,0.009318509],"category_scores_gemma":[0.004586987,0.0009770868,0.0009610028,0.00201202,0.001195376,0.005318473,0.002101336,0.00117566,0.001074571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009047161,"about_ca_system_score_gemma":0.00055054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001395084,"about_ca_topic_score_gemma":0.0007577055,"domain_scores_codex":[0.9991397,0.000225868,0.00006677918,0.0002009036,0.0001068589,0.0002599105],"domain_scores_gemma":[0.9981483,0.0009276829,0.0002921213,0.0003071386,0.00008443927,0.0002402867],"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.002863165,0.0006985126,0.005731617,0.001722369,0.0003776134,0.001235354,0.001442089,0.4481699,0.02524519,0.2367956,0.03611621,0.2396023],"study_design_scores_gemma":[0.0002262532,0.0009091193,0.004227098,0.0001949433,0.0002464864,0.002601495,0.001504238,0.6275904,0.01990015,0.3123445,0.03014369,0.0001117504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5369627,0.001772475,0.4221703,0.002417667,0.0001955372,0.0003399946,0.001572831,0.0007606438,0.03380779],"genre_scores_gemma":[0.8205214,0.001050436,0.1643798,0.0002444284,0.0001992197,0.0002277713,0.001833935,0.0002624831,0.0112806],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009318509,"threshold_uncertainty_score":0.03117347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898645613","doi":"10.1002/jgt.22668","title":"An optimal χ‐bound for (P6, diamond)‐free graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Perfect graph; Discrete mathematics; Chromatic scale; Graph; Clique number; Cograph; Vertex (graph theory); Line graph; Pathwidth","authors":[{"name":"Kathie Cameron","is_ca":true},{"name":"Shenwei Huang","is_ca":false},{"name":"Owen Merkel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02135598576617967,"gpt":0.3100758100082969,"spread":0.2887198242421172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001713598,0.0007776405,0.0008239787,0.0009127429,0.001705653,0.0027053,0.002219493,0.001333735,0.01407645],"category_scores_gemma":[0.009783197,0.0005196265,0.0005783957,0.001045393,0.001898401,0.005068948,0.002556334,0.003029586,0.001355557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00230962,"about_ca_system_score_gemma":0.002642478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00322042,"about_ca_topic_score_gemma":0.004431049,"domain_scores_codex":[0.9985735,0.0002768511,0.00004726856,0.0003722421,0.0003312817,0.0003988671],"domain_scores_gemma":[0.9909779,0.006336103,0.0002987409,0.001007311,0.0005377419,0.0008422467],"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.0013125,0.0004535078,0.004172893,0.0006682826,0.00009021686,0.0004233794,0.0004705972,0.1003348,0.02231046,0.7529202,0.03723004,0.07961309],"study_design_scores_gemma":[0.0001388329,0.0002545612,0.002094425,0.0001145803,0.0000737391,0.0004339508,0.0003276467,0.307855,0.01504028,0.6540454,0.01954287,0.0000786622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4369244,0.001245498,0.4537088,0.006851228,0.0004193001,0.0001716929,0.001672115,0.001994437,0.09701254],"genre_scores_gemma":[0.8901623,0.0004018561,0.09792643,0.00102746,0.0001180106,0.00009799154,0.0008449893,0.0003230606,0.009097973],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01407645,"threshold_uncertainty_score":0.04709041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949221968","doi":"10.1002/jgt.20343","title":"Contractors and connectors of graph algebras","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"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":"Hungarian Scientific Research Fund","keywords":"Mathematics; Homomorphism; Graph homomorphism; Combinatorics; Line graph; Discrete mathematics; Algebra homomorphism; Voltage graph; 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.01915466422965092,"gpt":0.2651641335600965,"spread":0.2460094693304456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002682954,0.0004639489,0.0006077776,0.001686556,0.001736843,0.003367278,0.001152418,0.001036146,0.004634022],"category_scores_gemma":[0.006995447,0.0004323584,0.0009331413,0.001305318,0.005177035,0.01018642,0.002694584,0.002049955,0.000526464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001260935,"about_ca_system_score_gemma":0.001010335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009610408,"about_ca_topic_score_gemma":0.0006237621,"domain_scores_codex":[0.9978864,0.0006334744,0.0001206802,0.000454049,0.000581545,0.000323899],"domain_scores_gemma":[0.9957678,0.001500557,0.0006128299,0.0006695301,0.0006016833,0.0008474557],"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.00002068316,0.00001477153,0.0002197953,0.000009275862,0.000003425983,0.00004839806,0.000189543,0.0006560957,0.0009171083,0.9958902,0.0001121558,0.001918538],"study_design_scores_gemma":[0.00002298863,0.00005460198,0.0003343109,0.0000120922,0.0000122209,0.0002720644,0.0003120263,0.01275312,0.002587581,0.9799953,0.003614425,0.00002934187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7287352,0.0004588496,0.2403331,0.000616771,0.0001440614,0.0001128277,0.0001400201,0.0003415594,0.02911768],"genre_scores_gemma":[0.9805188,0.000189052,0.01396728,0.0001007031,0.0001231853,0.00006661517,0.00009330814,0.00008072543,0.004860372],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004634022,"threshold_uncertainty_score":0.01550233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949911960","doi":"10.1002/jgt.20214","title":"Simultaneous diagonal flips in plane triangulations","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université du Québec en Outaouais; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Universitat Politècnica de Catalunya; Ministerio de Economía y Competitividad","keywords":"Combinatorics; Diagonal; Mathematics; Triangulation; Vertex (graph theory); Plane (geometry); Graph; Geometry","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Zhicheng Gao","is_ca":true},{"name":"Pat Morin","is_ca":true},{"name":"David R. Wood","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006922689708773792,"gpt":0.2265858955011992,"spread":0.2196632057924254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005927845,0.0004629075,0.0005538558,0.00126015,0.001279482,0.0009509316,0.0007595866,0.00091055,0.009950915],"category_scores_gemma":[0.004029384,0.0005931575,0.0008223448,0.00143051,0.001415737,0.002133778,0.002563577,0.001005686,0.001041982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006450432,"about_ca_system_score_gemma":0.0004193166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002583789,"about_ca_topic_score_gemma":0.002716746,"domain_scores_codex":[0.9990383,0.0001921109,0.00005846475,0.0001414233,0.0003402577,0.0002294309],"domain_scores_gemma":[0.9976498,0.0008297315,0.0004718749,0.0005145557,0.0003689384,0.0001650355],"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.001434712,0.000191971,0.008390157,0.0005160598,0.0001535595,0.001893097,0.001432406,0.3089246,0.06987001,0.3294422,0.007393166,0.2703581],"study_design_scores_gemma":[0.0001852966,0.0003829816,0.003339852,0.0001623925,0.00009866431,0.001430036,0.001637374,0.5440335,0.0413698,0.3808262,0.0264476,0.00008628598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4507158,0.0007367008,0.5253701,0.0003480768,0.0001008673,0.0002058871,0.0005280722,0.0005239943,0.02147051],"genre_scores_gemma":[0.846405,0.0004505989,0.1465801,0.0000738925,0.00003747487,0.0001365892,0.0005160386,0.0001296404,0.005670648],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009950915,"threshold_uncertainty_score":0.03328907,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3184514170","doi":"10.1002/jgt.22880","title":"Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":17,"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; National Science Foundation; Joint Information Systems Committee; Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; University of Oxford","keywords":"Degeneracy (biology); Combinatorics; Mathematics; Bipartite graph; Complete bipartite graph; Chromatic polynomial; Bounded function; Chromatic scale; Tree (set theory); Discrete mathematics; Induced subgraph; Graph","authors":[{"name":"Alex Scott","is_ca":false},{"name":"Paul Seymour","is_ca":false},{"name":"Sophie Spirkl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04967696835749449,"gpt":0.3495251988836877,"spread":0.2998482305261932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00221684,0.0008173566,0.001100374,0.002018093,0.002628959,0.003506026,0.003074601,0.001366592,0.01085737],"category_scores_gemma":[0.01122301,0.0005524823,0.001292617,0.002283733,0.004382948,0.008777922,0.00332846,0.005521892,0.001292688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005650877,"about_ca_system_score_gemma":0.001700552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005767351,"about_ca_topic_score_gemma":0.009689831,"domain_scores_codex":[0.9984159,0.0002131158,0.00005137973,0.0004054697,0.0004237846,0.0004902321],"domain_scores_gemma":[0.9860249,0.009834797,0.0007730802,0.001351314,0.0008039281,0.001211964],"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.001158201,0.0003104685,0.00774617,0.0007087751,0.00007826081,0.0004006275,0.0009580777,0.04462103,0.01441448,0.8673538,0.01896619,0.04328383],"study_design_scores_gemma":[0.00009379375,0.0001039391,0.002493646,0.0001314956,0.00008796516,0.0003700767,0.000184326,0.1141348,0.005957336,0.8658967,0.01049774,0.00004830354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4747097,0.0071841,0.263836,0.01799605,0.000444113,0.0001777097,0.002517218,0.001251471,0.2318836],"genre_scores_gemma":[0.9467706,0.001866845,0.0350768,0.0008835511,0.0003741344,0.0001323241,0.0009356283,0.0003866551,0.01357361],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01085737,"threshold_uncertainty_score":0.04100019,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4245789633","doi":"10.1002/jgt.20328","title":"Cycle spaces in topological spaces","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"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":"Mathematics; Cycle basis; Combinatorics; Hausdorff space; Complement (music); Discrete mathematics; Generalization; Space (punctuation); Zero-dimensional space; Topological space; Topology (electrical circuits); Graph; Line graph; Topological vector space; Computer science; Mathematical analysis","authors":[{"name":"Antoine Vella","is_ca":true},{"name":"R. Bruce Richter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02663227634858786,"gpt":0.2972262758258897,"spread":0.2705939994773018,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005954088,0.0004297059,0.0003301559,0.001471995,0.000870474,0.002257611,0.0007389942,0.000799669,0.00479816],"category_scores_gemma":[0.001475996,0.0001598535,0.0004460598,0.0009635864,0.003114832,0.003707292,0.002049258,0.001067361,0.0003702925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008956062,"about_ca_system_score_gemma":0.0004215281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007951387,"about_ca_topic_score_gemma":0.0005949008,"domain_scores_codex":[0.9995253,0.0001586395,0.00002137737,0.00008840248,0.0001260203,0.00008025576],"domain_scores_gemma":[0.9993169,0.0002109956,0.00008369774,0.0001111534,0.0001252401,0.0001519999],"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.000003597977,0.000003490376,0.00006698117,0.000005554796,0.000001212796,0.00001791607,0.00006877923,0.0007728614,0.0002448595,0.9977474,0.0001180253,0.0009492714],"study_design_scores_gemma":[0.000004524888,0.00001758642,0.00009196524,0.000008493023,0.000002863304,0.00006381825,0.00007025874,0.01143114,0.000322463,0.9815716,0.006409541,0.000005820154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4507861,0.001868179,0.4459221,0.001897991,0.0002859813,0.0001407127,0.0003394347,0.0002804122,0.09847911],"genre_scores_gemma":[0.9616272,0.0003991992,0.0269036,0.0001479453,0.0001378253,0.00008982055,0.0001207498,0.00004545949,0.01052819],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00479816,"threshold_uncertainty_score":0.01605147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964030595","doi":"10.1002/jgt.22167","title":"Levi's Lemma, pseudolinear drawings of , and empty triangles","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"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; Consejo Nacional de Ciencia y Tecnología, Guatemala","keywords":"Lemma (botany); Mathematics; Mathematical proof; Combinatorics; Regular polygon; Graph; Geometry","authors":[{"name":"Alan Arroyo","is_ca":true},{"name":"Dan McQuillan","is_ca":false},{"name":"R. Bruce Richter","is_ca":true},{"name":"Gelasio Salazar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01236962508142394,"gpt":0.2310089302629098,"spread":0.2186393051814858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003277061,0.0002749845,0.0002410764,0.0006099328,0.0005409695,0.001411961,0.000664208,0.0003582615,0.01400148],"category_scores_gemma":[0.002660823,0.0002677364,0.0002981747,0.0006812458,0.001316716,0.00327771,0.001230332,0.00134213,0.001110046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004555901,"about_ca_system_score_gemma":0.0002003836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005985281,"about_ca_topic_score_gemma":0.0005602433,"domain_scores_codex":[0.999409,0.0001683556,0.00003143412,0.00009797887,0.0001904912,0.0001027983],"domain_scores_gemma":[0.9979118,0.001050922,0.000259003,0.0002956892,0.0003391924,0.0001435159],"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.00006225476,0.00001311303,0.0003762802,0.00004670348,0.000003956095,0.0002243174,0.000195101,0.003165053,0.003988618,0.9679154,0.00276109,0.02124812],"study_design_scores_gemma":[0.00004285663,0.00008965098,0.001364957,0.00003771297,0.00001136837,0.001102084,0.0005512528,0.03412656,0.0130809,0.914588,0.03496484,0.00003993214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2500757,0.0007836478,0.5810061,0.001447451,0.0001940356,0.00006752358,0.0003686545,0.0006891741,0.1653678],"genre_scores_gemma":[0.9218858,0.0005316836,0.05980751,0.0002893585,0.0001181615,0.00008332308,0.0002629401,0.0001486761,0.01687255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01400148,"threshold_uncertainty_score":0.04683965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3088594123","doi":"10.1002/jgt.22621","title":"On the mean subtree order of graphs under edge addition","year":2020,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg; University of Guelph","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Counterexample; Order (exchange); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","authors":[{"name":"Ben Cameron","is_ca":true},{"name":"Lucas Mol","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05114219761848536,"gpt":0.2804795377212718,"spread":0.2293373401027864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001102994,0.0002565232,0.0010441,0.001770336,0.001054234,0.001969397,0.0009459479,0.0008192569,0.00283706],"category_scores_gemma":[0.01010878,0.0003386193,0.0005512665,0.001380536,0.002019024,0.002932912,0.001009087,0.001196311,0.0002620419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009874937,"about_ca_system_score_gemma":0.0005577437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007601978,"about_ca_topic_score_gemma":0.001066919,"domain_scores_codex":[0.9992133,0.0001923754,0.00003288732,0.000176629,0.0002152754,0.000169459],"domain_scores_gemma":[0.9880987,0.007110596,0.001335314,0.001463358,0.0008905193,0.001101574],"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.001135515,0.0002205582,0.01559062,0.0003590914,0.0001070907,0.0007998208,0.001015627,0.08860174,0.05431972,0.7838855,0.005054126,0.04891061],"study_design_scores_gemma":[0.00006520644,0.0001738057,0.009632211,0.00004032622,0.0000730621,0.0007396405,0.0002907188,0.1410052,0.009516108,0.835108,0.003304013,0.00005166032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9350215,0.0003300012,0.05305067,0.0005050235,0.00005142615,0.00002023634,0.0003015829,0.000276539,0.01044315],"genre_scores_gemma":[0.9892325,0.000170455,0.009257596,0.0001154923,0.00008387471,0.00002677205,0.0001862356,0.00006540123,0.0008616557],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00283706,"threshold_uncertainty_score":0.009490907,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1601784190","doi":"10.1002/jgt.21806","title":"Bipartite 2‐Factorizations of Complete Multipartite Graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Multipartite; Mathematics; Combinatorics; Bipartite graph; Factorization; Complete bipartite graph; Discrete mathematics; Disjoint sets; Graph; Edge-transitive graph; Line graph; Graph power; Algorithm","authors":[{"name":"Darryn Bryant","is_ca":false},{"name":"Peter Danziger","is_ca":true},{"name":"William Pettersson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009481002985737785,"gpt":0.1954505032521271,"spread":0.1859695002663893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007000177,0.0006449484,0.0005848765,0.001259449,0.001037033,0.001404287,0.0003791645,0.000540925,0.008608459],"category_scores_gemma":[0.002127165,0.0005219023,0.000777599,0.0006985082,0.0009526722,0.001802001,0.0009563644,0.0007875706,0.001076646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006217986,"about_ca_system_score_gemma":0.0004009618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001576396,"about_ca_topic_score_gemma":0.001861293,"domain_scores_codex":[0.9991197,0.0002189275,0.00004289683,0.0001977278,0.0001781782,0.0002425545],"domain_scores_gemma":[0.9981632,0.0006219682,0.0003355167,0.0002944803,0.0002668328,0.0003181314],"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.0006832396,0.0001819361,0.002336343,0.0002467622,0.00007051848,0.0007974062,0.001155186,0.05275553,0.02204309,0.88124,0.008472587,0.03001735],"study_design_scores_gemma":[0.00007183648,0.000139802,0.001744454,0.00007552129,0.00002731207,0.0005214727,0.0003558769,0.1075472,0.004338941,0.8709825,0.0141316,0.00006366229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6254746,0.0008093484,0.3322826,0.0005413707,0.0001281933,0.0002184168,0.001414384,0.0005319601,0.03859905],"genre_scores_gemma":[0.9412321,0.0002879876,0.04785178,0.0001672645,0.00008401354,0.0001388686,0.0009071421,0.0001200225,0.009210642],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008608459,"threshold_uncertainty_score":0.02879816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1866996682","doi":"10.1002/jgt.21735","title":"Gallai's Conjecture For Graphs of Girth at Least Four","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Girth (graph theory); Simple graph; Graph; Discrete mathematics","authors":[{"name":"Peter Harding","is_ca":true},{"name":"Sean McGuinness","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02800441050562604,"gpt":0.2720074911521995,"spread":0.2440030806465734,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001603426,0.0007834574,0.001351439,0.002257566,0.002387977,0.003236294,0.001332143,0.002260952,0.00637219],"category_scores_gemma":[0.0104083,0.0008802371,0.001718494,0.002096515,0.005371304,0.006078121,0.004775304,0.0033914,0.001209748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001642709,"about_ca_system_score_gemma":0.0006491047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001568716,"about_ca_topic_score_gemma":0.001133332,"domain_scores_codex":[0.9986046,0.0002912465,0.00006458034,0.0003869664,0.000289437,0.0003633499],"domain_scores_gemma":[0.9905277,0.005251309,0.0007665399,0.001739539,0.0007006922,0.00101416],"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.0006427972,0.00006883391,0.004710332,0.0002827737,0.00008842141,0.0005678627,0.002050025,0.01032033,0.005363291,0.9422975,0.01760746,0.0160004],"study_design_scores_gemma":[0.00003944886,0.00002565709,0.0008546354,0.00003802903,0.00002290066,0.0002506564,0.0002279193,0.007214247,0.001202089,0.9825338,0.007571484,0.0000191843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8006296,0.00288589,0.06954774,0.0140646,0.0005600721,0.00009263448,0.0008427138,0.000952713,0.110424],"genre_scores_gemma":[0.9790825,0.0007993891,0.01078533,0.001357231,0.0002214968,0.00009537168,0.0006025885,0.00008121213,0.006974907],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00637219,"threshold_uncertainty_score":0.02131706,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963127852","doi":"10.1002/jgt.22157","title":"Completing orientations of partially oriented graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Danmarks Frie Forskningsfond; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Discrete mathematics","authors":[{"name":"Jørgen Bang‐Jensen","is_ca":false},{"name":"Jing Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03318065121206559,"gpt":0.3333721953777207,"spread":0.3001915441656551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008593071,0.0005437225,0.0005956968,0.0005566062,0.00048663,0.001339081,0.0008461673,0.0005680204,0.004715267],"category_scores_gemma":[0.004159932,0.0003870423,0.0009320688,0.0008214363,0.001234408,0.003236151,0.001312073,0.001730486,0.0005766472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009225251,"about_ca_system_score_gemma":0.000994948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002811722,"about_ca_topic_score_gemma":0.002224876,"domain_scores_codex":[0.9989593,0.0002352463,0.00006635288,0.0003163473,0.0002350212,0.000187714],"domain_scores_gemma":[0.9959766,0.001763873,0.0005918626,0.000728111,0.0004354887,0.000503992],"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.0007696101,0.0007801571,0.005884177,0.0006047364,0.00007906058,0.000932247,0.001685921,0.266061,0.01961245,0.5541281,0.01209885,0.1373638],"study_design_scores_gemma":[0.0001283197,0.0001887255,0.001839727,0.00007203632,0.00003590891,0.0003252301,0.0009156186,0.2431332,0.01246098,0.724323,0.01652314,0.00005408299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6159974,0.0003311101,0.3624685,0.0008193777,0.00009266353,0.0003220122,0.001553049,0.0009028847,0.0175131],"genre_scores_gemma":[0.8877041,0.0003749898,0.1008253,0.000125422,0.000110724,0.000155212,0.003481511,0.0002179594,0.007004672],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004715267,"threshold_uncertainty_score":0.01577413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1558652429","doi":"10.1002/jgt.21846","title":"Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Homomorphism; Combinatorics; Corollary; Mixing (physics); Homotopy; Vertex (graph theory); Extension (predicate logic); Discrete mathematics; Graph; Pure mathematics","authors":[{"name":"Richard C. Brewster","is_ca":true},{"name":"Jonathan A. Noel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02247292266172958,"gpt":0.2810760398639245,"spread":0.258603117202195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008891124,0.0002105738,0.0001896069,0.0007103356,0.0007908714,0.0009538447,0.0006261712,0.0003641663,0.003712627],"category_scores_gemma":[0.002295379,0.0002538902,0.0003979015,0.0004401132,0.001789241,0.002542093,0.001878445,0.001115771,0.0002859718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005275586,"about_ca_system_score_gemma":0.0002580344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000572909,"about_ca_topic_score_gemma":0.0005194328,"domain_scores_codex":[0.9993875,0.0001313627,0.00002763124,0.0002117235,0.0001180619,0.0001236447],"domain_scores_gemma":[0.9974782,0.0009744359,0.0002893721,0.0006594062,0.000273289,0.0003252747],"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.0001492241,0.0000704081,0.002369261,0.00007703258,0.00001410907,0.0002041196,0.0008746063,0.003685734,0.01729086,0.9458685,0.0006260939,0.02877016],"study_design_scores_gemma":[0.00003324472,0.0002144322,0.003509688,0.0000358666,0.00003697271,0.0008235149,0.0007294539,0.03075006,0.03320533,0.9090756,0.02154054,0.00004515765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7173813,0.0004397026,0.2438297,0.0004596939,0.0000712017,0.00005318109,0.0001003952,0.0004488227,0.03721595],"genre_scores_gemma":[0.9724185,0.0001304262,0.02333197,0.00008314703,0.00003600258,0.0000259398,0.0000570512,0.00003165814,0.003885284],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003712627,"threshold_uncertainty_score":0.01241994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2466652589","doi":"10.1002/jgt.22511","title":"A variant of the Erdős‐Sós conjecture","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Australian Research Council; Agence Nationale de la Recherche","keywords":"Conjecture; Degree (music); Graph; Tree (set theory); Collatz conjecture; Lonely runner conjecture","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01066090488613492,"gpt":0.2508092513133372,"spread":0.2401483464272023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004405008,0.0005936533,0.001165511,0.001673813,0.001713316,0.002893535,0.001993997,0.001638333,0.01026814],"category_scores_gemma":[0.01606991,0.0004516033,0.001082357,0.001737003,0.004602399,0.00849576,0.003814235,0.003641261,0.001111264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001505524,"about_ca_system_score_gemma":0.0007522466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001910977,"about_ca_topic_score_gemma":0.001541542,"domain_scores_codex":[0.9965701,0.000897981,0.0002376537,0.001024445,0.0008668185,0.0004030531],"domain_scores_gemma":[0.9855615,0.00569255,0.001492036,0.003656178,0.002358236,0.001239579],"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.000192729,0.0000549024,0.001684766,0.0000917167,0.00002314342,0.0002216337,0.0002571905,0.007491084,0.002452726,0.9733853,0.006025509,0.008119426],"study_design_scores_gemma":[0.00004863163,0.00005077552,0.000569394,0.00002930898,0.00001594321,0.0001961173,0.0001764915,0.03058074,0.001195596,0.9571869,0.009929683,0.00002029969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4589819,0.001361288,0.3306352,0.01985049,0.001871242,0.0001724653,0.001664308,0.001311625,0.1841515],"genre_scores_gemma":[0.9672225,0.0004975395,0.02045189,0.001470566,0.0007807564,0.00008086656,0.0005770629,0.00008061861,0.008838249],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01026814,"threshold_uncertainty_score":0.0343504,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}