{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":230,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":230,"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":"52a92b309710","filters":{"venue":"Journal of Combinatorial Theory Series B"}},"results":[{"id":"W2068457180","doi":"10.1006/jctb.2000.1996","title":"Cycle Decompositions of K and K−I","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":261,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Graph; Mathematics; Combinatorics; Order (exchange); Complete graph; Economics","authors":[{"name":"Brian Alspach","is_ca":true},{"name":"Heather Gavlas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004295824774612166,"gpt":0.2010974239650139,"spread":0.1968015991904017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004742698,0.00008092896,0.0002258189,0.00009030112,0.00004419679,0.00001640935,0.0001066494,0.00005049675,0.00005322202],"category_scores_gemma":[0.00002889037,0.00007171052,0.0000746821,0.0001169309,0.00007924925,0.000258753,0.00001217698,0.0001172499,0.000001362504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001187963,"about_ca_system_score_gemma":0.000009388163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.017948e-7,"about_ca_topic_score_gemma":2.672277e-7,"domain_scores_codex":[0.999345,0.00008728271,0.0003293105,0.00003573526,0.0001074206,0.00009524781],"domain_scores_gemma":[0.9995456,0.0001099059,0.0001073843,0.00009070192,0.00008100847,0.00006541278],"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.0003936947,0.00005034072,0.000364762,0.00004434268,0.0001283735,0.0000263034,0.000551719,0.0007144907,0.01030752,0.9861447,0.0002703638,0.001003399],"study_design_scores_gemma":[0.0009079485,0.0003454719,0.000480426,0.00007473859,0.00004459083,0.000592104,0.0004987034,0.00004451033,0.009965682,0.9741711,0.01275594,0.0001187811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9880575,0.0008902439,0.000630157,0.00003179293,0.002722148,0.00004120209,0.000002643521,0.00002340307,0.007600932],"genre_scores_gemma":[0.9994337,0.0001932185,0.00008987056,0.000006426771,0.0002250079,8.276225e-7,3.060927e-7,0.00001164752,0.00003899152],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01248557,"threshold_uncertainty_score":0.292427,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115589427","doi":"10.1016/j.jctb.2011.07.004","title":"The disjoint paths problem in quadratic time","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":203,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Minor (academic); Combinatorics; Time complexity; Mathematics; Mathematical proof; Discrete mathematics; Computer science; Algorithm","authors":[{"name":"Ken‐ichi Kawarabayashi","is_ca":false},{"name":"Yusuke Kobayashi","is_ca":false},{"name":"Bruce Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01470044315439314,"gpt":0.2461503881490396,"spread":0.2314499449946465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004588527,0.000156564,0.0002957657,0.0001712384,0.0002129462,0.0001430023,0.001843815,0.00006248014,0.00004689876],"category_scores_gemma":[0.0005065114,0.00009840664,0.0001345395,0.000539051,0.0003014266,0.001350912,0.0003035661,0.0004994656,0.00003043933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007867871,"about_ca_system_score_gemma":0.000192281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001839601,"about_ca_topic_score_gemma":0.000001505776,"domain_scores_codex":[0.997382,0.0009029455,0.0006502079,0.0001602164,0.000515205,0.0003894156],"domain_scores_gemma":[0.9979442,0.000704257,0.0004088959,0.0005218076,0.0002872405,0.000133614],"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.0006246002,0.0001187953,0.00008569042,0.000006017131,0.00002578567,0.00008620477,0.002006743,0.000006264797,0.0004680037,0.9901106,0.0001007641,0.006360515],"study_design_scores_gemma":[0.0006763188,0.0008073314,0.0002641143,0.00004455778,0.00000420122,0.0001019173,0.0002397059,0.00006841685,0.002375111,0.9928981,0.002399557,0.0001206792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.506521,0.006730231,0.3023675,0.006385008,0.04040901,0.003920821,0.000009920644,0.0005407917,0.1331157],"genre_scores_gemma":[0.9852391,0.0001415446,0.01324956,0.00005524397,0.0002712675,0.00001633171,1.841457e-7,0.00002725031,0.0009994494],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4787182,"threshold_uncertainty_score":0.4012906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035278325","doi":"10.1016/j.jctb.2004.12.005","title":"A bound on the chromatic number of the square of a planar graph","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":195,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Alberta; University of New Brunswick","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Bounded function; Square (algebra); Chromatic scale; Planar; Graph; Upper and lower bounds; Quadratic equation; Discrete mathematics; Computer science; Mathematical analysis; Geometry","authors":[{"name":"Michael Molloy","is_ca":true},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01294776214586673,"gpt":0.2731152441474006,"spread":0.2601674820015338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002431265,0.0001564724,0.0003661526,0.0001180563,0.0001906019,0.00005594474,0.002212463,0.00006508037,0.00008445817],"category_scores_gemma":[0.0006131261,0.00008232146,0.0003085094,0.0007105243,0.0005902157,0.0005854354,0.0001852801,0.0004408929,0.000006242342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005029492,"about_ca_system_score_gemma":0.0001740558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001451036,"about_ca_topic_score_gemma":0.000001175438,"domain_scores_codex":[0.9972039,0.0008778453,0.0006351176,0.0001238229,0.0009170386,0.0002422755],"domain_scores_gemma":[0.9967207,0.001219585,0.0008237868,0.0007807089,0.0003821447,0.0000731063],"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.0004774019,0.0001631668,0.0001893461,0.00002464529,0.00008254019,0.000005015258,0.001230975,0.00005512483,0.001129614,0.9954383,0.0004368833,0.0007669497],"study_design_scores_gemma":[0.0007061124,0.0005023073,0.0004386087,0.0001436352,0.0000151399,0.0001097619,0.0003203942,0.00002157752,0.0207898,0.974409,0.00245737,0.00008629413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9835163,0.000270423,0.005050873,0.003414955,0.002622793,0.0003634734,0.00000735781,0.00001983046,0.004734037],"genre_scores_gemma":[0.9985304,0.00002714269,0.0009686737,0.0001057415,0.0002116718,0.000003647993,1.013095e-7,0.00001234151,0.000140274],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02102933,"threshold_uncertainty_score":0.4111343,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033177498","doi":"10.1016/j.jctb.2004.11.001","title":"Planar graphs without cycles of length from 4 to 7 are 3-colorable","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Planar graph; Combinatorics; Mathematics; Conjecture; Graph coloring; Graph; Plane (geometry); Discrete mathematics; Geometry","authors":[{"name":"O. V. Borodin","is_ca":false},{"name":"A. N. Glebov","is_ca":false},{"name":"André Raspaud","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01415230470762358,"gpt":0.2708427278237021,"spread":0.2566904231160785,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001432451,0.0002091972,0.0006003382,0.0003822314,0.0001492356,0.00009607755,0.001803341,0.00009966645,0.00002659627],"category_scores_gemma":[0.0005201441,0.0001767131,0.0001971219,0.0007176747,0.0002314307,0.001307377,0.0002133331,0.000405081,0.00001126725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009439845,"about_ca_system_score_gemma":0.0002263186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001441342,"about_ca_topic_score_gemma":0.000004706977,"domain_scores_codex":[0.9976197,0.0003566847,0.0006412152,0.0002444159,0.0007761444,0.0003618013],"domain_scores_gemma":[0.9975355,0.0004140406,0.0006467889,0.000588304,0.0005365988,0.0002787453],"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.001209463,0.0001850485,0.0008772646,0.00001151827,0.0001091787,0.00007540925,0.001040335,0.0006473445,0.005218719,0.989778,0.0001313207,0.0007163803],"study_design_scores_gemma":[0.001671496,0.001107213,0.001256198,0.0001435416,0.0000145158,0.00004080278,0.0004821297,0.000003253508,0.04340951,0.9504202,0.001274952,0.0001762154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9013063,0.0005247546,0.09067319,0.001107616,0.004841419,0.0002882565,0.0000216237,0.00006540117,0.001171442],"genre_scores_gemma":[0.9813344,0.00005278887,0.01821109,0.00009468329,0.0002169259,0.0000041279,6.152858e-7,0.00002080654,0.00006459902],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08002807,"threshold_uncertainty_score":0.7206151,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055120783","doi":"10.1016/j.jctb.2005.04.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">Δ</mml:mi><mml:mo>+</mml:mo><mml:mn>300</mml:mn></mml:math> is a bound on the adjacent vertex distinguishing edge chromatic number","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Vertex (graph theory); Graph; Edge coloring; Mathematics; Scroll; Combinatorics; Algorithm; Line graph","authors":[{"name":"Hamed Hatami","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01303425814486328,"gpt":0.2276126112042378,"spread":0.2145783530593746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003267499,0.000472975,0.0003633133,0.0001717591,0.001319211,0.001412263,0.001775999,0.000507179,0.0007461085],"category_scores_gemma":[0.00123622,0.0005097427,0.0007277389,0.0005565927,0.0005251939,0.001447507,0.0008383782,0.001089694,0.0006035693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004368086,"about_ca_system_score_gemma":0.000592258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008883815,"about_ca_topic_score_gemma":0.00001715442,"domain_scores_codex":[0.9952109,0.0004202127,0.00125286,0.0006043679,0.00157857,0.0009330475],"domain_scores_gemma":[0.9956917,0.001042065,0.001481848,0.001098096,0.0002521696,0.0004341912],"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.0006166212,0.0003010777,0.000005315101,0.0001379755,0.0003998851,0.000263666,0.002897115,0.0003133361,0.0007265059,0.9780723,0.01514173,0.001124469],"study_design_scores_gemma":[0.005548268,0.003643219,0.00008586237,0.002921598,0.0008767057,0.004029308,0.001962497,0.2502629,0.1596322,0.5325967,0.03650763,0.001933055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9785516,0.0004947809,0.0006978294,0.001414942,0.007053411,0.00006054145,0.00002594987,0.0001486694,0.0115523],"genre_scores_gemma":[0.9948043,0.0001902437,0.002103257,0.001644208,0.0009325395,0.00005668965,0.00001424661,0.0001274381,0.0001270321],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4454756,"threshold_uncertainty_score":0.9999809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986537785","doi":"10.1006/jctb.2000.1970","title":"Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations)","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Duality (order theory); Homomorphism; Mathematics; Pure mathematics; Order (exchange); Property (philosophy); Algebra over a field","authors":[{"name":"Jaroslav Nešetřil","is_ca":false},{"name":"Claude Tardif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009783662731557273,"gpt":0.2455368811306554,"spread":0.2357532183990981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009771413,0.0001597983,0.0003283426,0.00007795526,0.0002516337,0.0002325043,0.0004539204,0.00008050492,0.00007394526],"category_scores_gemma":[0.0002190788,0.0001296422,0.0001136507,0.0001387772,0.0001277786,0.001521496,0.0000586959,0.0002002462,0.000001810116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002559139,"about_ca_system_score_gemma":0.00006097835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.225379e-7,"about_ca_topic_score_gemma":1.197485e-7,"domain_scores_codex":[0.9986852,0.0002304525,0.000477849,0.0001752481,0.000213176,0.0002180421],"domain_scores_gemma":[0.9985201,0.0005407712,0.0004000482,0.0002493685,0.0001800293,0.0001097257],"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.0004730359,0.00003846184,0.00006478113,0.00001467622,0.00003252685,0.000007776893,0.0008451231,0.0000141704,0.0008898285,0.9499159,0.00001512158,0.04768856],"study_design_scores_gemma":[0.000909583,0.0004739944,0.003534597,0.00002586611,0.00001641209,0.0001381038,0.00007480578,0.00004485275,0.001749957,0.9753985,0.01747488,0.0001584126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8976755,0.000529296,0.09284859,0.0008661821,0.006670489,0.0002825234,0.00001830551,0.00007054066,0.001038551],"genre_scores_gemma":[0.9931034,0.0001631208,0.005454609,0.0002137849,0.0009012442,0.000003940236,0.000002395259,0.00001192836,0.0001455706],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09542789,"threshold_uncertainty_score":0.5286655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972423218","doi":"10.1016/j.jctb.2012.09.003","title":"Limits of permutation sequences","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":115,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Sequence (biology); Permutation (music); Limit (mathematics); Random permutation; Limit of a sequence; Discrete mathematics; Function (biology); Limit of a function; Class (philosophy); Mathematical analysis","authors":[{"name":"Carlos Hoppen","is_ca":false},{"name":"Yoshiharu Kohayakawa","is_ca":false},{"name":"Carlos Gustavo Moreira","is_ca":false},{"name":"Balázs Ráth","is_ca":true},{"name":"Rudini Sampaio","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03189245141778493,"gpt":0.3092918770620082,"spread":0.2773994256442233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002144958,0.0001296025,0.0003728509,0.0001202481,0.000114864,0.0000149964,0.000268101,0.0001016297,0.0001502664],"category_scores_gemma":[0.001043411,0.00009214531,0.0001854082,0.0001385512,0.0002157,0.0006680744,0.00003964363,0.000207502,8.928379e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002936649,"about_ca_system_score_gemma":0.00005186022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.357876e-7,"about_ca_topic_score_gemma":9.780518e-8,"domain_scores_codex":[0.9984193,0.0003475032,0.0006071023,0.00005402599,0.0003794536,0.0001926192],"domain_scores_gemma":[0.9978002,0.0007949279,0.0008026606,0.0001692461,0.0003353508,0.00009762172],"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.0005259825,0.00009855787,0.0007591755,0.00005326621,0.0001040354,0.000003015128,0.004124068,0.000001307537,0.001642896,0.9915516,0.0002638621,0.0008722176],"study_design_scores_gemma":[0.0005054213,0.000356251,0.0004490839,0.00005332158,0.00008681784,0.0001290164,0.001242946,3.434428e-7,0.02676671,0.9685603,0.001751371,0.00009840506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9844156,0.0006045314,0.0003542426,0.00005461184,0.008366535,0.00007965715,0.000003616391,0.00001296004,0.006108279],"genre_scores_gemma":[0.9966288,0.00005571738,0.002135562,0.00002007533,0.001018235,9.256663e-7,3.752001e-7,0.0000160178,0.000124321],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02512382,"threshold_uncertainty_score":0.3757577,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986224428","doi":"10.1016/j.jctb.2008.06.008","title":"Matchings in regular graphs from eigenvalues","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":112,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University; University of Toronto","funders":"American Institute of Mathematics","keywords":"Eigenvalues and eigenvectors; Combinatorics; Matching (statistics); Mathematics; Upper and lower bounds; Order (exchange); Graph; Discrete mathematics; Statistics; Mathematical analysis; Physics; Business","authors":[{"name":"Sebastian M. Cioabă","is_ca":true},{"name":"David A. Gregory","is_ca":true},{"name":"Willem H. Haemers","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02589419912243921,"gpt":0.2708285482288542,"spread":0.244934349106415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001290153,0.0001591595,0.0004193983,0.0001747275,0.0001666608,0.00002239416,0.0003924062,0.000108095,0.000152491],"category_scores_gemma":[0.0004104753,0.0001359025,0.000204942,0.000282636,0.0002241877,0.000397303,0.00004480543,0.0003481004,0.00000723017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003394068,"about_ca_system_score_gemma":0.00006586299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006402628,"about_ca_topic_score_gemma":0.000001436176,"domain_scores_codex":[0.9983812,0.0003525503,0.0006576127,0.0001196984,0.0003066302,0.0001823224],"domain_scores_gemma":[0.9982625,0.0007379593,0.0004706219,0.0002944873,0.0001438966,0.00009051929],"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.0005204166,0.000226609,0.0005892123,0.00000851296,0.00006036979,0.0000583432,0.002074482,0.000001993445,0.002195105,0.9933266,0.0008322029,0.0001061744],"study_design_scores_gemma":[0.0009852629,0.0001445525,0.0006666452,0.00006133792,0.00003591572,0.0001144301,0.0007064827,4.880001e-7,0.009965921,0.9838684,0.003312171,0.0001383979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9961672,0.0002416608,0.0002517735,0.0001994974,0.001291734,0.0001154643,0.00000687497,0.00002801969,0.001697718],"genre_scores_gemma":[0.9965851,0.0001428515,0.002685957,0.00004387433,0.0002936903,0.000005779499,0.000001563982,0.00002456519,0.0002166183],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009458183,"threshold_uncertainty_score":0.5541942,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037789845","doi":"10.1016/j.jctb.2003.09.001","title":"Excluding any graph as a minor allows a low tree-width 2-coloring","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Graph minor; Graph; Edge coloring; Graph coloring; Conjecture; Fractional coloring; Discrete mathematics; List coloring; Graph power; Graph factorization; Line graph","authors":[{"name":"Matt DeVos","is_ca":false},{"name":"Guoli Ding","is_ca":false},{"name":"Bogdan Oporowski","is_ca":false},{"name":"Daniel P. Sanders","is_ca":false},{"name":"Bruce Reed","is_ca":true},{"name":"Paul Seymour","is_ca":false},{"name":"Dirk Vertigan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0153158103495201,"gpt":0.2745306702123444,"spread":0.2592148598628243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002846621,0.0003164307,0.0005699027,0.0005751678,0.0003571536,0.0003058465,0.002136156,0.000135457,0.00004002215],"category_scores_gemma":[0.000857571,0.0002762667,0.0003861415,0.001107099,0.000319771,0.002828043,0.0004287985,0.0007132452,0.000027534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000240864,"about_ca_system_score_gemma":0.000438728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004599543,"about_ca_topic_score_gemma":0.000002415088,"domain_scores_codex":[0.9967529,0.000442618,0.0007617947,0.0003503808,0.001004834,0.0006875033],"domain_scores_gemma":[0.9973529,0.000507345,0.0005957599,0.0006372727,0.0005141051,0.0003925906],"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.001082009,0.0002159937,0.00009910688,0.00002372498,0.0001139982,0.0004581526,0.001267803,0.000350014,0.006723023,0.9852896,0.00003979165,0.004336827],"study_design_scores_gemma":[0.0028333,0.001584639,0.0001684425,0.0001637938,0.00001820183,0.0005314779,0.0002977734,0.00001127871,0.0277322,0.964175,0.002193917,0.0002899765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8421847,0.000993073,0.1351905,0.001379007,0.0126762,0.000471583,0.000002319386,0.0001973125,0.006905352],"genre_scores_gemma":[0.986439,0.0001242427,0.01231049,0.0001306235,0.0006705523,0.00001117564,3.392964e-7,0.00003531486,0.0002782607],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1442543,"threshold_uncertainty_score":0.9999689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063812540","doi":"10.1016/j.jctb.2005.01.001","title":"Vertex colouring edge partitions","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Multiset; Vertex (graph theory); Mathematics; Partition (number theory); Graph; Frequency partition of a graph; Neighbourhood (mathematics); Multiplicity (mathematics); Discrete mathematics; Graph power; Line graph; Geometry","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"R. E. L. Aldred","is_ca":false},{"name":"Ketan Dalal","is_ca":true},{"name":"Bruce A. Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009189915335832617,"gpt":0.2250058690006218,"spread":0.2158159536647892,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001139252,0.0001084737,0.0002141887,0.0001329693,0.0001931757,0.0001346676,0.0005883366,0.00006001185,0.00005006082],"category_scores_gemma":[0.0001790806,0.00009083906,0.0001293675,0.0002592521,0.00009078553,0.001070673,0.0001092733,0.0002281982,0.00003217922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003892286,"about_ca_system_score_gemma":0.000114288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.28161e-7,"about_ca_topic_score_gemma":4.268971e-7,"domain_scores_codex":[0.9987762,0.0001619755,0.000438325,0.0001141455,0.0003015607,0.0002078239],"domain_scores_gemma":[0.9988322,0.0001691832,0.0002826937,0.0002684343,0.0003005311,0.0001469516],"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.00006653398,0.0001131077,0.00002756781,0.000003352778,0.00002894372,0.00001474527,0.0003815399,0.0002019315,0.001058971,0.9920909,0.00348082,0.002531525],"study_design_scores_gemma":[0.0008518331,0.0003521595,0.00005429943,0.00004059676,0.00001415649,0.0001402983,0.00004831447,0.0001078356,0.008116319,0.9483622,0.04179934,0.0001126206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8836869,0.003047117,0.03435901,0.01436943,0.04368235,0.0003107999,0.00000408065,0.0003855992,0.02015472],"genre_scores_gemma":[0.9926975,0.00004756168,0.006550557,0.0002339422,0.0001804319,0.000001684333,2.137291e-7,0.000007761967,0.0002803497],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1090106,"threshold_uncertainty_score":0.3704309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036312115","doi":"10.1016/j.jctb.2004.09.005","title":"Counting connected graphs inside-out","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Enumeration; Vertex (graph theory); Connected component; Partition (number theory); Path graph; Degree (music); Discrete mathematics; Graph; Graph power; Line graph; Physics","authors":[{"name":"Boris Pittel","is_ca":false},{"name":"Nicholas Wormald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01152035719613075,"gpt":0.2496369002918883,"spread":0.2381165430957575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002215106,0.0001824383,0.0004029624,0.0001789779,0.0001674329,0.0002136652,0.000900637,0.0001162109,0.00001574541],"category_scores_gemma":[0.00048539,0.000148288,0.0001971452,0.0003489822,0.0001114686,0.001369154,0.0001352193,0.0003982143,0.000005665222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006843424,"about_ca_system_score_gemma":0.000291726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002594495,"about_ca_topic_score_gemma":9.532142e-7,"domain_scores_codex":[0.9982072,0.0003401607,0.0005778778,0.0001749071,0.0004227652,0.00027705],"domain_scores_gemma":[0.9981837,0.0002742025,0.000550685,0.0003500137,0.0004856842,0.0001557686],"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.0001321247,0.00006686818,0.00001236331,0.000007734729,0.00004977201,0.00008543013,0.00108926,0.00001331103,0.002477782,0.9909279,0.0001297254,0.005007717],"study_design_scores_gemma":[0.001580543,0.000447909,0.00004856954,0.0000668979,0.00001916931,0.0002799878,0.00005184511,0.000009492752,0.01648496,0.9769621,0.003876231,0.0001723304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03835228,0.0003762661,0.9451465,0.0007964541,0.0110472,0.00008620624,8.184971e-7,0.00006256452,0.004131724],"genre_scores_gemma":[0.8649027,0.0000585509,0.1340518,0.0003357335,0.0005568862,0.000001419561,2.677365e-7,0.00001657401,0.00007612728],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8265504,"threshold_uncertainty_score":0.6047011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162598482","doi":"10.1006/jctb.2000.1963","title":"The Excluded Minors for GF(4)-Representable Matroids","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; GF(2); Mathematics; Computer science; Finite field","authors":[{"name":"Jim Geelen","is_ca":true},{"name":"A.M.H. Gerards","is_ca":false},{"name":"Ajai Kapoor","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01250534148642135,"gpt":0.2825219572415087,"spread":0.2700166157550874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003382055,0.0001822572,0.000323794,0.0001101052,0.0006381573,0.0003697946,0.002374902,0.00007608746,0.0001285918],"category_scores_gemma":[0.0004969822,0.0001219212,0.0002828882,0.0004407145,0.0003327017,0.001459253,0.0001690003,0.0003418277,0.00001807498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006877921,"about_ca_system_score_gemma":0.000164421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001312022,"about_ca_topic_score_gemma":6.704346e-7,"domain_scores_codex":[0.9975761,0.0004949169,0.0005847394,0.000207489,0.0006166329,0.0005201513],"domain_scores_gemma":[0.9967272,0.001640943,0.000301136,0.0007005291,0.0004480714,0.0001821067],"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.002080095,0.00007173498,0.00002416524,0.000007673475,0.00007374103,0.00001556055,0.0002620285,0.0000810728,0.0005879077,0.9655935,0.00291904,0.02828351],"study_design_scores_gemma":[0.001189125,0.000667971,0.00003234606,0.00001440231,0.00001015013,0.0001139344,0.0001441625,0.00007274938,0.007050246,0.823486,0.167098,0.0001209158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4827848,0.009039613,0.3756302,0.01555612,0.05127778,0.00366641,0.00003574699,0.0005215938,0.06148776],"genre_scores_gemma":[0.946889,0.0008916305,0.01979956,0.000261062,0.002658059,0.00007538418,0.000001708694,0.00008317226,0.02934041],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4641043,"threshold_uncertainty_score":0.4971803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006587062","doi":"10.1006/jctb.2001.2082","title":"Branch-Width and Well-Quasi-Ordering in Matroids and Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Bounded function; Combinatorics; Mathematics; Class (philosophy); Graphic matroid; Discrete mathematics; Tree (set theory); Computer science; Mathematical analysis","authors":[{"name":"James F. Geelen","is_ca":true},{"name":"A.M.H. Gerards","is_ca":false},{"name":"Geoff Whittle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01045793543277344,"gpt":0.2442487909695447,"spread":0.2337908555367713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001524732,0.0001649019,0.0003439719,0.0003787833,0.0001281145,0.0001728576,0.0005553133,0.00007348746,0.00004024254],"category_scores_gemma":[0.0002152899,0.0001458169,0.00006415741,0.0004951573,0.0002785297,0.001539615,0.0002556636,0.0004297831,0.000002911156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002958696,"about_ca_system_score_gemma":0.00002090432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001283987,"about_ca_topic_score_gemma":0.000001101958,"domain_scores_codex":[0.9983516,0.0003524391,0.000422539,0.000203467,0.000353077,0.000316843],"domain_scores_gemma":[0.9988352,0.000407138,0.0002055991,0.0002654945,0.000117843,0.0001687206],"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.000226368,0.00008805263,0.001002034,0.00002371212,0.00002232026,0.00007975307,0.000993591,0.00001200663,0.001180415,0.981176,0.00004578575,0.01514997],"study_design_scores_gemma":[0.00152769,0.0007244055,0.0008081101,0.00005776785,0.00000474967,0.0003637275,0.0001310556,0.000177184,0.001449942,0.9927877,0.001810682,0.0001569428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9714146,0.004240455,0.01798589,0.0009208627,0.002479592,0.0001868367,8.315542e-7,0.00004521067,0.00272576],"genre_scores_gemma":[0.9958996,0.001035228,0.002764321,0.00005088571,0.0001097581,0.000002264726,6.137327e-8,0.00001407586,0.0001238281],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02448502,"threshold_uncertainty_score":0.5946242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076011470","doi":"10.1006/jctb.1999.1938","title":"The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Science Foundation; Hungarian Scientific Research Fund; National Security Agency; National Science Foundation","keywords":"Fano plane; Projective plane; Conjecture; Plane (geometry); Mathematics; Combinatorics; Constant (computer programming); Set (abstract data type); Order (exchange); Discrete mathematics; Geometry; Computer science","authors":[{"name":"D. de Caen","is_ca":true},{"name":"Zoltán Füredi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0122255240268587,"gpt":0.2518255740639708,"spread":0.2396000500371121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002624567,0.0002297935,0.0005939748,0.0000762627,0.0004673243,0.00005826933,0.000701185,0.0001465803,0.0005480182],"category_scores_gemma":[0.001096893,0.0001378754,0.0003464403,0.0001842551,0.0004888367,0.0002788865,0.00007197473,0.0004594722,0.000001644285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003170421,"about_ca_system_score_gemma":0.00008689216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002060079,"about_ca_topic_score_gemma":0.000001362381,"domain_scores_codex":[0.9976677,0.00037734,0.0009820182,0.0001111762,0.0005518879,0.0003099172],"domain_scores_gemma":[0.9947706,0.003669848,0.0007641268,0.0004070066,0.000279874,0.0001085691],"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.007286414,0.00006887874,0.0000598448,0.00002920482,0.0002629358,0.00002738498,0.00166612,0.000003872517,0.0004134008,0.9837077,0.0003410318,0.006133179],"study_design_scores_gemma":[0.001640287,0.001065404,0.0001210309,0.00007799426,0.000100824,0.0002497369,0.001452192,0.000001103935,0.00423508,0.9735577,0.01734041,0.0001582506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.973737,0.0003406373,0.00003322676,0.0002167483,0.004450598,0.0001667173,0.00001354389,0.00002515092,0.02101639],"genre_scores_gemma":[0.9975855,0.0003266048,0.000696117,0.00007714955,0.0005452199,0.000002292127,4.033601e-7,0.00003134754,0.0007353119],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02384857,"threshold_uncertainty_score":0.6000415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986323939","doi":"10.1016/j.jctb.2007.10.007","title":"Eigenvalue bounds for independent sets","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":78,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Independence (probability theory); Combinatorics; Maximal independent set; Independence number; Independent set; Set (abstract data type); Polarity (international relations); Discrete mathematics; Graph; Chordal graph; 1-planar graph; Computer science; Statistics; Physics","authors":[{"name":"Chris Godsil","is_ca":true},{"name":"Michael Newman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03658537179050098,"gpt":0.3004630221539611,"spread":0.2638776503634602,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001925209,0.0002125786,0.0005197219,0.0001451599,0.0005438301,0.00003600338,0.0004709459,0.0001754787,0.0001345377],"category_scores_gemma":[0.001041894,0.0001605762,0.0003853558,0.0001183801,0.0002735687,0.0003617544,0.00009341096,0.0003349628,0.000001273557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006996373,"about_ca_system_score_gemma":0.0001583309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.629613e-7,"about_ca_topic_score_gemma":3.654681e-7,"domain_scores_codex":[0.9981282,0.000254195,0.0007134214,0.0001304391,0.0004913034,0.0002824435],"domain_scores_gemma":[0.9975242,0.000955079,0.00062977,0.0003002054,0.0004517972,0.0001389593],"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.00186778,0.0001168577,0.0001368147,0.00004227133,0.0001985507,0.00005105841,0.002174361,0.000002881271,0.0001748026,0.9907024,0.004099888,0.0004323318],"study_design_scores_gemma":[0.001967641,0.0008189958,0.0001761703,0.00003224389,0.00008338932,0.0008433358,0.0003589356,0.00000154846,0.00337584,0.9745775,0.01757862,0.0001857875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9785196,0.0003722972,0.002188237,0.0001155628,0.01451469,0.0002933913,0.00001531752,0.00003704653,0.00394384],"genre_scores_gemma":[0.9938701,0.00009159118,0.003841674,0.00007749662,0.0013026,0.000006445835,0.000001057969,0.00004245326,0.0007665527],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01612491,"threshold_uncertainty_score":0.6548107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2911309437","doi":"10.1016/j.jctb.2005.04.007","title":"Cayley maps","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Cayley graph; Cayley's theorem; Cayley transform; Combinatorics; Mathematics; Vertex-transitive graph; Vertex (graph theory); Transitive relation; Discrete mathematics; Graph; Voltage graph; Line graph","authors":[{"name":"R. Bruce Richter","is_ca":true},{"name":"Jozef Širáň","is_ca":false},{"name":"Robert Jajcay","is_ca":false},{"name":"Thomas W. Tucker","is_ca":false},{"name":"Mark E. Watkins","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03559547643093926,"gpt":0.3204301378384334,"spread":0.2848346614074941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00458518,0.0001922656,0.0004731667,0.0002303971,0.0001293069,0.00008300295,0.0006555372,0.0001366943,0.0008297793],"category_scores_gemma":[0.00260451,0.000155899,0.0002318438,0.0002553904,0.000209265,0.0006960301,0.000123121,0.0006060106,0.00007986119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001928068,"about_ca_system_score_gemma":0.0001821319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.86556e-7,"about_ca_topic_score_gemma":0.000001206458,"domain_scores_codex":[0.9974286,0.0006346852,0.0007464645,0.0001234145,0.0007110211,0.0003558086],"domain_scores_gemma":[0.9970263,0.001415613,0.0004805501,0.0003822916,0.0004999061,0.0001953571],"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.001656857,0.0002332624,0.00005343885,0.00003084015,0.0001024364,0.00005203999,0.0006671837,0.000003898364,0.001026475,0.9880776,0.006632541,0.00146338],"study_design_scores_gemma":[0.001432248,0.0005676876,0.00001970167,0.00004882755,0.00003844254,0.0002792644,0.0005338429,0.000001574478,0.006156114,0.9297912,0.06097936,0.0001517517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.901361,0.0007580586,0.002171581,0.002490136,0.01001312,0.0004490433,0.00001992959,0.0001381149,0.08259901],"genre_scores_gemma":[0.9891567,0.00002840789,0.004023597,0.00006524634,0.00293101,0.000003383371,7.599197e-7,0.00005455597,0.00373638],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08779565,"threshold_uncertainty_score":0.9085501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132677029","doi":"10.1016/j.jctb.2008.03.006","title":"On the odd-minor variant of Hadwiger's conjecture","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Conjecture; Graph; Discrete mathematics","authors":[{"name":"Jim Geelen","is_ca":true},{"name":"Bert Gerards","is_ca":false},{"name":"Bruce Reed","is_ca":true},{"name":"Paul Seymour","is_ca":false},{"name":"Adrian Vetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01617864456851868,"gpt":0.2503187477139031,"spread":0.2341401031453844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002325977,0.0001873783,0.0004109716,0.0001990666,0.0002838429,0.00005176582,0.001954691,0.00009319355,0.0001099573],"category_scores_gemma":[0.001090404,0.0001129284,0.0002356546,0.0005406578,0.0005647247,0.0006474958,0.0002224678,0.0006180676,0.000009411304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004841359,"about_ca_system_score_gemma":0.0002794958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001152946,"about_ca_topic_score_gemma":1.754633e-7,"domain_scores_codex":[0.9973252,0.0008120286,0.0005510852,0.0001725146,0.0008368654,0.0003023494],"domain_scores_gemma":[0.9961569,0.001952316,0.0005928765,0.0006941513,0.0004735973,0.0001302059],"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.000857996,0.000132231,0.0000237119,0.000006785278,0.00008060862,0.0002429952,0.001047076,0.0000947105,0.0009774888,0.9950595,0.000938852,0.0005379932],"study_design_scores_gemma":[0.0008733033,0.001495914,0.0001144021,0.00004233544,0.000008592713,0.0008046101,0.0001178758,0.00002195153,0.01914455,0.9729998,0.00425532,0.0001213272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8069829,0.001215236,0.1497523,0.006547526,0.01880903,0.0007838398,0.00001435355,0.0001112357,0.01578351],"genre_scores_gemma":[0.9977749,0.00007677324,0.001284023,0.0001684955,0.0003130088,0.000003043991,1.789515e-7,0.00001524633,0.0003643055],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.190792,"threshold_uncertainty_score":0.4605085,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3102338202","doi":"10.1016/j.jctb.2015.12.009","title":"Quantum homomorphisms","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Homomorphism; Graph homomorphism; Mathematics; Discrete mathematics; Combinatorics; Quantum; Graph; Line graph; Graph power; Quantum mechanics","authors":[{"name":"Laura Mančinska","is_ca":true},{"name":"David E. Roberson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006803118382228696,"gpt":0.2154634902829134,"spread":0.2086603719006847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001319632,0.0001627836,0.0003151989,0.0001455497,0.0001374345,0.0001145636,0.001232111,0.00007060626,0.00003550979],"category_scores_gemma":[0.000289456,0.00009242236,0.0001849404,0.0002446619,0.0001380753,0.0007238897,0.0002142711,0.0002109847,0.00001743084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004019665,"about_ca_system_score_gemma":0.0001404999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.858694e-7,"about_ca_topic_score_gemma":4.474136e-8,"domain_scores_codex":[0.9983985,0.0002740402,0.0004667754,0.0001645006,0.000421217,0.0002749206],"domain_scores_gemma":[0.9982779,0.0004632411,0.0004436622,0.0003880718,0.0002706448,0.0001564672],"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.0001163222,0.00005771721,0.00001957339,0.000003447236,0.00003401148,0.00009020911,0.000193012,0.00001638644,0.001835945,0.9623932,0.0006199359,0.03462029],"study_design_scores_gemma":[0.001089426,0.0008919567,0.0001446273,0.00009264691,0.000008344765,0.0005838381,0.00001930161,0.00022916,0.005490836,0.9667209,0.02456313,0.0001657984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2688179,0.0005654331,0.6929932,0.006267466,0.02964658,0.0001179348,0.00000365993,0.0001657254,0.001422093],"genre_scores_gemma":[0.9916044,0.00004277437,0.006842621,0.0001077051,0.001156003,7.476011e-7,7.157333e-8,0.00001366853,0.0002320325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7227865,"threshold_uncertainty_score":0.3768874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984987350","doi":"10.1016/j.jctb.2006.04.002","title":"Symmetric squares of graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"Quantum graph; Mathematics; Combinatorics; Spectral line; Graph; Connection (principal bundle); Square (algebra); Discrete mathematics; Physics; Quantum mechanics; Geometry","authors":[{"name":"Koenraad M. R. Audenaert","is_ca":false},{"name":"Chris Godsil","is_ca":true},{"name":"Gordon Royle","is_ca":false},{"name":"Terry Rudolph","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01746905239012765,"gpt":0.3037454073800924,"spread":0.2862763549899647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001754097,0.0001618005,0.0005337223,0.0004587815,0.00008295391,0.00003488493,0.0004444328,0.000100687,0.000154607],"category_scores_gemma":[0.001896503,0.0001281275,0.0002345196,0.0007674838,0.0002272349,0.0004802329,0.00007578985,0.0003500277,0.000003168656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006806146,"about_ca_system_score_gemma":0.0001334513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004045835,"about_ca_topic_score_gemma":0.000001162615,"domain_scores_codex":[0.9976743,0.0003458838,0.0008571398,0.0001021799,0.000764396,0.0002561435],"domain_scores_gemma":[0.9968917,0.001269596,0.0006576914,0.000279978,0.0008133497,0.00008772435],"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.0007913823,0.0002875488,0.0003723204,0.00007107584,0.00006674566,0.00003476862,0.00009419146,0.00001109999,0.002502385,0.9940296,0.001145628,0.0005932005],"study_design_scores_gemma":[0.001266607,0.0007939558,0.0002094294,0.00005684201,0.000039186,0.00006576176,0.0002749327,0.000001280345,0.03816614,0.9570993,0.001905668,0.0001209158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9873425,0.001110573,0.00115796,0.000110014,0.002852901,0.0001995425,0.000007912616,0.00002795701,0.007190647],"genre_scores_gemma":[0.9959708,0.00005998901,0.003155519,0.000006694775,0.000441161,0.000002291832,5.752517e-7,0.00003304255,0.0003299096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03693037,"threshold_uncertainty_score":0.522489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014824669","doi":"10.1016/j.jctb.2012.10.002","title":"Cops and robbers in a random graph","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Hungarian Scientific Research Fund; Nemzeti Kutatási és Technológiai Hivatal; Pacific Institute for the Mathematical Sciences","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Random graph; Random regular graph; Discrete mathematics; Pathwidth; Line graph","authors":[{"name":"Béla Bollobás","is_ca":false},{"name":"Gábor Kun","is_ca":true},{"name":"Imre Leader","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01080177734224385,"gpt":0.2653487859544998,"spread":0.2545470086122559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004105924,0.0001354113,0.0003424852,0.0003518658,0.00008873951,0.00008570558,0.0006422955,0.00006828496,0.00001817634],"category_scores_gemma":[0.0004869647,0.0001103131,0.00009400569,0.0005442983,0.0002238117,0.00239868,0.000196354,0.0003962957,0.000002752694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004586287,"about_ca_system_score_gemma":0.00008381788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001222791,"about_ca_topic_score_gemma":6.045325e-7,"domain_scores_codex":[0.998054,0.0006443473,0.0004108775,0.0001157662,0.0003853995,0.0003896369],"domain_scores_gemma":[0.9984382,0.0006900598,0.0002396892,0.0002530619,0.0001500733,0.0002288921],"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.001248417,0.00009498568,0.001962729,0.000007526358,0.00002752838,0.00002698841,0.001288094,0.00001368145,0.0004891995,0.9922988,0.00007291816,0.002469115],"study_design_scores_gemma":[0.00359762,0.000339917,0.0009861059,0.00003572448,0.000006391486,0.0002423548,0.0002723699,0.000009488355,0.00188359,0.9886597,0.003833854,0.0001328533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8713535,0.006985547,0.1003346,0.001060095,0.01401504,0.0004728411,0.00000167472,0.0000722429,0.005704438],"genre_scores_gemma":[0.9962997,0.0001923706,0.003108562,0.00005086227,0.0002590536,0.000003288145,1.113785e-7,0.00001035168,0.00007562724],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1249463,"threshold_uncertainty_score":0.4498438,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022783208","doi":"10.1016/j.jctb.2007.12.006","title":"Bisimplicial vertices in even-hole-free graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Wheel graph; Induced subgraph; Vertex (graph theory); Graph; Neighbourhood (mathematics); Discrete mathematics; Graph power; Line graph","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"Maria Chudnovsky","is_ca":false},{"name":"Frédéric Havet","is_ca":false},{"name":"Bruce Reed","is_ca":true},{"name":"Paul Seymour","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0179379954215226,"gpt":0.2737250461514349,"spread":0.2557870507299123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002055122,0.0002061798,0.0004538158,0.0005924156,0.0002193392,0.00008184419,0.002782866,0.0001099532,0.00002835621],"category_scores_gemma":[0.001021696,0.0001786683,0.0002048642,0.001172531,0.0003770657,0.00225314,0.0004810394,0.000617568,0.000009222567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008764856,"about_ca_system_score_gemma":0.0002734518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003135151,"about_ca_topic_score_gemma":0.000003789019,"domain_scores_codex":[0.9971169,0.0006457716,0.0007044055,0.000235393,0.0008296281,0.0004678919],"domain_scores_gemma":[0.9976741,0.0006268017,0.0003861614,0.0007376909,0.0003725052,0.0002027373],"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.001115291,0.0001811226,0.001204409,0.000007861649,0.00003393076,0.0004048868,0.0008707316,0.00006697742,0.001142116,0.9928593,0.0002957203,0.001817663],"study_design_scores_gemma":[0.002233915,0.0008545583,0.00167144,0.00003804818,0.000005164917,0.000352829,0.000187603,0.00002366443,0.004511273,0.9866561,0.003273221,0.0001921399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9750513,0.0007328396,0.0132975,0.0008610651,0.006122375,0.0002253769,0.000003567687,0.000072271,0.003633708],"genre_scores_gemma":[0.996571,0.000181308,0.002691069,0.00008202601,0.0003366406,0.000004626619,2.70623e-7,0.00001852515,0.0001145396],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0215197,"threshold_uncertainty_score":0.7285882,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986861105","doi":"10.1016/s0095-8956(03)00031-5","title":"Bounded size components—partitions and transversals","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Bounded function; Degree (music); Vertex (graph theory); Graph; Constant (computer programming); Component (thermodynamics); Frequency partition of a graph; Induced subgraph; Vertex connectivity; Discrete mathematics; Graph power; Line graph; Computer science; Physics","authors":[{"name":"Penny Haxell","is_ca":true},{"name":"Tibor Szabó","is_ca":false},{"name":"Gábor Tardos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0161149843366617,"gpt":0.265491512526323,"spread":0.2493765281896613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001998106,0.0001471698,0.0003123026,0.000134456,0.0002597428,0.0001844122,0.0005947567,0.0000659263,0.00008336279],"category_scores_gemma":[0.0007947145,0.0001289012,0.0001211952,0.0003605197,0.0003290466,0.001470291,0.00006524113,0.0003288245,0.000005241656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004598536,"about_ca_system_score_gemma":0.0001217438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.99987e-7,"about_ca_topic_score_gemma":2.996635e-7,"domain_scores_codex":[0.997906,0.0007762549,0.0004188777,0.0001632022,0.0004433497,0.0002923246],"domain_scores_gemma":[0.9980024,0.0009478798,0.0002300589,0.0003114924,0.0002884164,0.0002198153],"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.0002330391,0.00009996897,0.0000509271,0.000007950046,0.00005226651,0.00004179592,0.0005309859,0.000009332456,0.004792153,0.9937775,0.00009834307,0.0003057555],"study_design_scores_gemma":[0.001470456,0.0004836229,0.0001468236,0.00002269744,0.00001275775,0.000310489,0.0001955157,0.000006135704,0.009668742,0.968447,0.01910304,0.000132676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7611409,0.001469311,0.2057715,0.002213395,0.01143336,0.0004930801,0.000009232869,0.0001432733,0.01732603],"genre_scores_gemma":[0.9908561,0.0001127173,0.008609691,0.00007245644,0.00009655865,0.000002923742,1.821176e-7,0.00001212927,0.0002373127],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2297152,"threshold_uncertainty_score":0.5256439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079618965","doi":"10.1016/s0095-8956(02)00046-1","title":"On the excluded minors for the matroids of branch-width k","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Class (philosophy); Mathematics; Computer science; Artificial intelligence","authors":[{"name":"Jim Geelen","is_ca":true},{"name":"A.M.H. Gerards","is_ca":false},{"name":"Neil Robertson","is_ca":false},{"name":"Geoff Whittle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01896804786171661,"gpt":0.2765649470147264,"spread":0.2575968991530098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005061767,0.000165209,0.0003141152,0.0001201945,0.0003142801,0.00009753631,0.001931108,0.00006200362,0.00006053511],"category_scores_gemma":[0.002346793,0.00008524781,0.0002965271,0.0004599555,0.0004094051,0.0004831013,0.0001042589,0.0003728573,0.00000326372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004054779,"about_ca_system_score_gemma":0.0001678351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.30927e-7,"about_ca_topic_score_gemma":3.136364e-7,"domain_scores_codex":[0.9975923,0.0008173878,0.0005097806,0.0001458991,0.0006247215,0.0003099349],"domain_scores_gemma":[0.9925857,0.005627857,0.0005169097,0.0007044426,0.0004833715,0.00008174829],"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.0008891834,0.00008365755,0.00001386442,0.00001092849,0.00008441251,0.000003170504,0.0004141556,0.00009158516,0.001192307,0.9942598,0.0009818277,0.001975056],"study_design_scores_gemma":[0.001003993,0.001074562,0.00004589004,0.00002860916,0.00001583076,0.00004767105,0.0002198899,0.0000240837,0.03492802,0.9508985,0.0116211,0.00009182242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2310347,0.002173875,0.7260415,0.006776196,0.0218546,0.001775678,0.00001505024,0.00006901582,0.01025932],"genre_scores_gemma":[0.9969416,0.00005388384,0.002145445,0.0001700128,0.000208467,0.00001514211,1.10347e-7,0.00001784365,0.000447474],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7659069,"threshold_uncertainty_score":0.3588512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2519651985","doi":"10.1016/j.jctb.2017.05.006","title":"Layered separators in minor-closed graph classes with applications","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Mathematics; Combinatorics; Graph; Minor (academic); Discrete mathematics; Humanities","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"Pat Morin","is_ca":true},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01537180515414999,"gpt":0.2977072970433268,"spread":0.2823354918891768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001550646,0.0001883676,0.0003849326,0.0003392368,0.0004436316,0.0003998016,0.002604816,0.00008676705,0.00001470725],"category_scores_gemma":[0.0002688692,0.0001467415,0.0001143123,0.0004127005,0.0004664055,0.002331081,0.0002565873,0.0004572954,0.000006970436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000066436,"about_ca_system_score_gemma":0.0002633198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003244328,"about_ca_topic_score_gemma":0.000008851009,"domain_scores_codex":[0.998093,0.0003287971,0.000453308,0.0002358547,0.0005427398,0.0003462841],"domain_scores_gemma":[0.9972307,0.0003550847,0.0007297004,0.00106851,0.00043651,0.0001794899],"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.0008212189,0.0001463821,0.002457414,0.00001141875,0.00004898101,0.00008712111,0.0002347463,0.00005328317,0.0007162206,0.9927591,0.00007306963,0.00259104],"study_design_scores_gemma":[0.001925946,0.0006394406,0.003263188,0.00004862518,0.000008457613,0.0001010264,0.0001668205,0.00001289765,0.005200004,0.9801695,0.00827277,0.000191366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6624686,0.0009448376,0.3069874,0.002384416,0.005722117,0.001397908,0.00001146657,0.0001515156,0.01993182],"genre_scores_gemma":[0.9933226,0.0000607751,0.006109409,0.00002977948,0.0002294621,0.00002510387,3.479836e-7,0.00001680221,0.0002057004],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3308541,"threshold_uncertainty_score":0.5983946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970138544","doi":"10.1016/j.jctb.2011.03.005","title":"Finitely forcible graphons","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Iterated function; Mathematics; Algebraic structure; Combinatorics; Graph; Discrete mathematics; Pure mathematics; Mathematical analysis","authors":[{"name":"László Lovász","is_ca":false},{"name":"Balázs Szegedy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05386988719056061,"gpt":0.2767839143148161,"spread":0.2229140271242555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001654577,0.0001982923,0.000443531,0.0002176108,0.0002469279,0.0000290005,0.0005392684,0.0001409283,0.0007397281],"category_scores_gemma":[0.0007391019,0.0001444754,0.0003408724,0.0002279771,0.0002595744,0.0004449217,0.000110428,0.0003779516,0.000003432975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002327855,"about_ca_system_score_gemma":0.00006491604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001190369,"about_ca_topic_score_gemma":5.049225e-7,"domain_scores_codex":[0.9983539,0.0002855233,0.0006529329,0.0001099746,0.0003385091,0.0002591393],"domain_scores_gemma":[0.9980184,0.0005830407,0.0005985019,0.0003429111,0.0003174714,0.000139678],"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.001390279,0.0001283617,0.0002292798,0.00002471906,0.0001665697,0.00004811978,0.003405162,1.758659e-7,0.0001094921,0.992183,0.001793138,0.0005216846],"study_design_scores_gemma":[0.0007355764,0.0007367241,0.0001741578,0.00004304889,0.0001004708,0.0002113125,0.0007227628,2.218711e-7,0.008762904,0.9823499,0.005992872,0.0001700421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8970528,0.0004073299,0.00140025,0.00005649007,0.01866594,0.0001992335,0.000009353998,0.00007379373,0.08213485],"genre_scores_gemma":[0.9935685,0.00006820561,0.005100422,0.00006073192,0.0006127656,0.000002224679,3.036095e-7,0.00003488466,0.0005519795],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09651573,"threshold_uncertainty_score":0.8099504,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094667324","doi":"10.1006/jctb.2001.2051","title":"A Characterization of Weakly Bipartite Graphs","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Discrete mathematics; Conjecture; Minor (academic); Strong perfect graph theorem; Robertson–Seymour theorem; Edge-transitive graph; Graph; Voltage graph; Line graph; 1-planar graph; Law","authors":[{"name":"Bertrand Guenin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005445700705337558,"gpt":0.1884680764193055,"spread":0.183022375713968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007820774,0.0001289437,0.0003331343,0.0001896626,0.00004147511,0.0000246576,0.0001793686,0.00008411442,0.000106498],"category_scores_gemma":[0.0000484428,0.0001136581,0.0001579418,0.0003297054,0.00007409035,0.0004997302,0.00001231117,0.0001577359,0.000004645457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001830006,"about_ca_system_score_gemma":0.00001846577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.129576e-7,"about_ca_topic_score_gemma":2.350508e-7,"domain_scores_codex":[0.9988635,0.0001515287,0.0005720145,0.00005436218,0.0002084119,0.000150212],"domain_scores_gemma":[0.9992656,0.00006265347,0.000275978,0.0001512875,0.0001684265,0.00007611908],"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.0006763797,0.00005649973,0.0005667278,0.00005532904,0.0001360526,0.00002107428,0.0005800604,0.0001089775,0.3453283,0.6517143,0.00006421436,0.0006920178],"study_design_scores_gemma":[0.001403031,0.0006970584,0.002388743,0.0002335998,0.00008647796,0.0003531274,0.0004438041,0.00003796097,0.1624971,0.7887211,0.04284387,0.0002941214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9891112,0.0002108035,0.0006589277,0.00002080727,0.007146918,0.00007350973,0.000004735727,0.00004144472,0.00273158],"genre_scores_gemma":[0.9992424,0.0002419909,0.00001895364,0.000007659924,0.0003433843,0.000002123552,0.00000208267,0.00002209789,0.0001193064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1828313,"threshold_uncertainty_score":0.4634841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024021998","doi":"10.1016/j.jctb.2005.03.005","title":"Covering arrays on graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"University of Alberta","keywords":"Combinatorics; Clique number; Mathematics; Clique; Homomorphism; Graph; Discrete mathematics; Row; Extension (predicate logic); Computer science","authors":[{"name":"Karen Meagher","is_ca":true},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005227173648065162,"gpt":0.1918191603417305,"spread":0.1865919866936653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000893791,0.0001779671,0.0003184603,0.0001678135,0.00008118482,0.00005233987,0.0002667447,0.00009312072,0.0001254929],"category_scores_gemma":[0.00006442182,0.0001544981,0.0001977734,0.0001712508,0.00005984277,0.0004710004,0.0000131876,0.000337965,0.00003073497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006166517,"about_ca_system_score_gemma":0.00001697745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.863747e-7,"about_ca_topic_score_gemma":2.77747e-7,"domain_scores_codex":[0.9988607,0.0001265698,0.0004593513,0.00007300874,0.0002656169,0.0002147951],"domain_scores_gemma":[0.9993256,0.0001467144,0.0001446098,0.00018783,0.00007995499,0.0001152922],"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.0005456658,0.00005141984,0.00003361748,0.00002696432,0.0001281365,0.00002113569,0.000491994,0.008096062,0.004504906,0.9828386,0.001275337,0.001986107],"study_design_scores_gemma":[0.00147402,0.0006544485,0.00007709469,0.0001535363,0.0000388557,0.0001962243,0.0004583385,0.00005607306,0.04298304,0.8117177,0.1418859,0.0003047214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9383671,0.0007337951,0.0009244647,0.00009440756,0.01768904,0.0001131661,0.000004618231,0.000152283,0.04192116],"genre_scores_gemma":[0.9983809,0.00008337586,0.00009773757,0.00003965773,0.001204416,0.000002150256,4.347652e-7,0.00003282258,0.00015851],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1711209,"threshold_uncertainty_score":0.6300251,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016808872","doi":"10.1016/j.jctb.2006.07.006","title":"Extreme eigenvalues of nonregular graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Eigenvalues and eigenvectors; Mathematics; Adjacency matrix; Upper and lower bounds; Graph; Discrete mathematics; Physics; Mathematical analysis","authors":[{"name":"Sebastian M. Cioabă","is_ca":false},{"name":"David A. Gregory","is_ca":true},{"name":"Vladimir Nikiforov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02581874398230166,"gpt":0.2677072303653798,"spread":0.2418884863830781,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001714573,0.0001523582,0.0004254574,0.0001593063,0.0001103092,0.00002246607,0.000358455,0.00009426469,0.0001640454],"category_scores_gemma":[0.0002617056,0.0001255981,0.0003066245,0.0002761096,0.0002720589,0.0002663982,0.00003647733,0.0001810612,0.000002586714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001820831,"about_ca_system_score_gemma":0.00005545769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002146075,"about_ca_topic_score_gemma":7.293088e-7,"domain_scores_codex":[0.9983391,0.0002859559,0.0007777906,0.00009258593,0.0003377942,0.0001668428],"domain_scores_gemma":[0.9978877,0.0005478814,0.0008216336,0.0003074019,0.0003749326,0.000060465],"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.0004063484,0.0003493569,0.0001261702,0.00003568661,0.0000771264,0.000006880567,0.0001740289,0.000004572728,0.01179958,0.9854619,0.001357159,0.0002012074],"study_design_scores_gemma":[0.0007237179,0.0002523673,0.000209984,0.00005095701,0.0001026563,0.00005548988,0.0002743331,6.022778e-7,0.04509342,0.9479572,0.005164393,0.0001149147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9881774,0.0004224435,0.00137879,0.0001291208,0.001533497,0.0001575031,0.000009626728,0.00002902486,0.00816262],"genre_scores_gemma":[0.9964369,0.00002894752,0.002644544,0.000009429322,0.0003775514,0.000003863167,0.000001323195,0.00002269916,0.0004747633],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03750472,"threshold_uncertainty_score":0.512174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008773627","doi":"10.1016/j.jctb.2005.11.001","title":"Obstructions to branch-decomposition of matroids","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Net (polyhedron); Characterization (materials science); Class (philosophy); Minor (academic); Set (abstract data type); Pairwise comparison; Discrete mathematics; Computer science; Physics; Geometry","authors":[{"name":"Jim Geelen","is_ca":true},{"name":"Bert Gerards","is_ca":false},{"name":"Neil Robertson","is_ca":false},{"name":"Geoff Whittle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009228262069560421,"gpt":0.2910029875574268,"spread":0.2817747254878664,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001182589,0.0001242397,0.0003136527,0.0003468807,0.0001224178,0.00006671371,0.001014311,0.0000578509,0.00005687799],"category_scores_gemma":[0.0002160527,0.0001122054,0.0001645283,0.0006021439,0.0001294615,0.001541056,0.0001783889,0.0002635333,0.00001539291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008789916,"about_ca_system_score_gemma":0.00009958025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.66136e-7,"about_ca_topic_score_gemma":4.808794e-7,"domain_scores_codex":[0.9982733,0.0002865769,0.0005610507,0.000138096,0.0005056676,0.0002353815],"domain_scores_gemma":[0.9982752,0.0002646764,0.0003428778,0.0003931247,0.0005435538,0.0001805551],"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.0005066501,0.00009769201,0.00003620742,0.000008024336,0.00003617158,0.000005501939,0.0004926875,0.0005617201,0.02117004,0.9633982,0.0002321484,0.01345502],"study_design_scores_gemma":[0.0007190959,0.0008225922,0.0002699344,0.00003685327,0.00000881602,0.000199741,0.00008291838,0.00002453231,0.06904114,0.9185705,0.01011096,0.0001129652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4980316,0.0003419416,0.4882566,0.002754266,0.007130872,0.000258474,0.000006576146,0.00006811092,0.003151499],"genre_scores_gemma":[0.9624008,0.0000227434,0.03674028,0.00006382287,0.0005847536,0.000002640881,3.013395e-7,0.00001196619,0.0001726912],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4643691,"threshold_uncertainty_score":0.4575604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082255109","doi":"10.1016/j.jctb.2005.02.001","title":"Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Invertible matrix; Mathematics; Combinatorics; Order (exchange); Matrix (chemical analysis); Generating function; Hankel matrix; Fraction (chemistry); Function (biology); Unit (ring theory); Sign (mathematics); Pure mathematics; Mathematical analysis","authors":[{"name":"Richard A. Brualdi","is_ca":false},{"name":"Stephen Kirkland","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01549377067586377,"gpt":0.2932958125453572,"spread":0.2778020418694935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001255773,0.0002716084,0.0008295787,0.0001453709,0.0001123612,0.0000511813,0.0002809035,0.0001645371,0.00003128633],"category_scores_gemma":[0.001626527,0.0002281109,0.000135655,0.0001862496,0.0004091223,0.0008057681,0.0001466677,0.0003173816,9.490325e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004333704,"about_ca_system_score_gemma":0.00007146473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001302941,"about_ca_topic_score_gemma":0.000003280251,"domain_scores_codex":[0.9979294,0.0001819293,0.001017303,0.0001575729,0.0004480733,0.0002657248],"domain_scores_gemma":[0.9969316,0.001111708,0.001129852,0.0003036058,0.0003397886,0.0001834036],"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.0006581455,0.0002640221,0.001299089,0.0002280705,0.0001115996,0.00002012268,0.001602674,0.000001148262,0.001055976,0.9907863,0.0002510905,0.003721744],"study_design_scores_gemma":[0.00226571,0.0006027228,0.0001456361,0.0002404456,0.0001368373,0.0002673736,0.0006370847,0.00001154623,0.01578931,0.9776447,0.002034469,0.0002241475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9954438,0.0008248008,0.0004327198,0.0001039798,0.002064446,0.0001876127,0.000005172182,0.00002569931,0.0009117366],"genre_scores_gemma":[0.9881713,0.0003722339,0.01074858,0.00001748272,0.0004503824,0.000003468982,1.81227e-7,0.00004638871,0.0001899319],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01473333,"threshold_uncertainty_score":0.9302092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977168065","doi":"10.1016/j.jctb.2004.07.001","title":"Dimers, tilings and trees","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Bijection; Markov chain; Planar graph; Regular polygon; Planar; Discrete mathematics; Graph; Computer science; Geometry","authors":[{"name":"Richard Kenyon","is_ca":true},{"name":"Scott Sheffield⋆","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01780630406495923,"gpt":0.2841692701646123,"spread":0.266362966099653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006295465,0.0001145252,0.0003044422,0.0000502209,0.00007757585,0.00004096401,0.000140262,0.00006857744,0.00004293808],"category_scores_gemma":[0.002367566,0.00008697789,0.00006071757,0.00008241514,0.0000937744,0.0001940984,0.0000405696,0.0001937974,0.000001780747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000031097,"about_ca_system_score_gemma":0.00008455812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.854127e-7,"about_ca_topic_score_gemma":5.475671e-7,"domain_scores_codex":[0.9991254,0.00004005357,0.0003689972,0.00007714266,0.0002448745,0.000143496],"domain_scores_gemma":[0.9987355,0.0006028708,0.0002632062,0.00009325177,0.000189634,0.0001155544],"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.0004778181,0.00007444624,0.000002105579,0.00003384065,0.00004381824,0.00003153353,0.0004628684,0.000001583947,0.0002766603,0.9972873,0.00009728692,0.001210765],"study_design_scores_gemma":[0.001334548,0.0008135042,0.000009321004,0.00008538722,0.00007466618,0.0001966688,0.0004268577,0.00000320852,0.001878866,0.9941295,0.0009510117,0.00009643063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4469895,0.001679225,0.534443,0.001479525,0.0109246,0.0003171542,0.00001962065,0.00008328682,0.004063995],"genre_scores_gemma":[0.98536,0.00007332941,0.01402015,0.00004605322,0.0003834198,0.000001129771,2.136286e-7,0.00001799166,0.00009775649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5383704,"threshold_uncertainty_score":0.3546855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055499237","doi":"10.1006/jctb.2001.2091","title":"On a Conjecture of Lovász Concerning Bricks","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Brick; Petersen graph; Cubic graph; Matching (statistics); Graph; Discrete mathematics; Line graph; Voltage graph; Engineering","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.01866125685222832,"gpt":0.2619885753374605,"spread":0.2433273184852322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001375725,0.0001720494,0.0004393168,0.0002584179,0.0001108763,0.00007351243,0.001302405,0.00009689821,0.000251935],"category_scores_gemma":[0.0008518323,0.0001388276,0.0002005298,0.0005165081,0.0002972578,0.0008194342,0.0001686065,0.000565904,0.00001426694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006066703,"about_ca_system_score_gemma":0.00006550248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.401008e-7,"about_ca_topic_score_gemma":9.108199e-8,"domain_scores_codex":[0.9977665,0.0005155832,0.0005416705,0.0001739973,0.0007105367,0.0002916945],"domain_scores_gemma":[0.9972763,0.001067843,0.000634021,0.0004545662,0.0004181617,0.000149092],"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.0004662811,0.0001203155,0.0000355219,0.00001320913,0.00006156557,0.00008693852,0.001026909,0.0001673934,0.001078428,0.9909174,0.0006151276,0.005410894],"study_design_scores_gemma":[0.00151316,0.00220115,0.00002730472,0.0000880994,0.000009416689,0.0001962848,0.000118429,0.0001226911,0.01176623,0.9769919,0.006819724,0.0001456164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5758325,0.005287592,0.3221868,0.002882571,0.02677849,0.0008406143,0.00001702783,0.0002326256,0.06594172],"genre_scores_gemma":[0.9974914,0.00007068564,0.001603653,0.0000862279,0.0002668072,0.000001284939,1.331063e-7,0.00001515519,0.000464717],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4216588,"threshold_uncertainty_score":0.5661226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057654888","doi":"10.1016/j.jctb.2008.08.006","title":"Growth rates of minor-closed classes of matroids","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Rank (graph theory); Minor (academic); Graphic matroid; Simple (philosophy); Class (philosophy); Matroid partitioning; Discrete mathematics","authors":[{"name":"Jim Geelen","is_ca":true},{"name":"Joseph P. S. Kung","is_ca":false},{"name":"Geoff Whittle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0200516027011985,"gpt":0.281127115789744,"spread":0.2610755130885455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001598411,0.0001813837,0.0006179991,0.000366536,0.0001126096,0.00002535125,0.001572449,0.00009164507,0.00003989751],"category_scores_gemma":[0.0008161764,0.0001491166,0.0002672122,0.0007180118,0.0007047723,0.001300569,0.0002464888,0.0003268829,0.000002737297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003933061,"about_ca_system_score_gemma":0.0003194979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002334683,"about_ca_topic_score_gemma":2.454183e-7,"domain_scores_codex":[0.9973224,0.0005826691,0.0008588352,0.0001620698,0.0007845138,0.0002895493],"domain_scores_gemma":[0.9963178,0.0009231209,0.0009234397,0.0004543229,0.001241433,0.0001398787],"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.001230063,0.0002183418,0.001574027,0.00005317111,0.0000956451,0.00006887758,0.0006760064,0.00001551815,0.01913236,0.9763001,0.0002848532,0.0003510178],"study_design_scores_gemma":[0.001197155,0.001183621,0.001119248,0.00005044529,0.00001103619,0.0002344171,0.0001608759,0.000009493932,0.2262264,0.7691046,0.0005862936,0.0001163879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9701073,0.0008846123,0.02282955,0.0002993514,0.003397712,0.0001729818,0.000005717189,0.00002979264,0.002272981],"genre_scores_gemma":[0.9919604,0.000259502,0.007306596,0.00001628809,0.0001975009,0.000001622224,3.35052e-7,0.00001566167,0.0002420591],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2071955,"threshold_uncertainty_score":0.6080798,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091166220","doi":"10.1016/j.jctb.2007.02.006","title":"Large independent sets in regular graphs of large girth","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics; Discrete mathematics; Independence (probability theory); Differential equation; Independent set; Strongly regular graph; Graph; Statistics; Pathwidth; Mathematical analysis; Line graph","authors":[{"name":"Joseph Lauer","is_ca":true},{"name":"Nicholas Wormald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01185456423673112,"gpt":0.2906598480540324,"spread":0.2788052838173013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008898954,0.0002336753,0.0007021037,0.0004647366,0.0001348262,0.00002036857,0.0005294762,0.0002482076,0.0001820127],"category_scores_gemma":[0.0006707676,0.000183947,0.0003240693,0.0003897064,0.000158929,0.0003515452,0.0001360386,0.0006042636,6.531975e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000638493,"about_ca_system_score_gemma":0.00007010975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.107331e-7,"about_ca_topic_score_gemma":0.0000113317,"domain_scores_codex":[0.9970094,0.0004197019,0.001253455,0.0001466508,0.0007095917,0.0004611903],"domain_scores_gemma":[0.9973812,0.0007560265,0.0009936376,0.0003890209,0.0003437054,0.0001364067],"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.002247262,0.0004178401,0.002596882,0.00008305936,0.0001366466,0.0001428934,0.004189818,0.000001060253,0.0004817481,0.9892388,0.0002838766,0.0001801143],"study_design_scores_gemma":[0.0034414,0.0004755576,0.002236378,0.00012555,0.00005408105,0.0001134333,0.002582171,6.601508e-7,0.009074561,0.9784443,0.003269552,0.0001823843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9907446,0.0003983565,0.000738029,0.00003570052,0.005136027,0.0001659277,0.00001691315,0.00001571026,0.002748771],"genre_scores_gemma":[0.998706,0.00007799448,0.0007529752,0.00004780958,0.0002610644,9.102031e-7,0.000001119669,0.00003314729,0.0001190054],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01079453,"threshold_uncertainty_score":0.750114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014924232","doi":"10.1016/j.jctb.2014.06.004","title":"Colouring graphs when the number of colours is almost the maximum degree","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Degree (music); Chromatic scale; Constant (computer programming); Discrete mathematics","authors":[{"name":"Michael Molloy","is_ca":false},{"name":"Bruce Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01864792012049796,"gpt":0.2765757305116616,"spread":0.2579278103911636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006186544,0.0002210616,0.0004360926,0.0001199188,0.0004659511,0.0001790655,0.003559301,0.0001000702,0.0001116846],"category_scores_gemma":[0.0008278637,0.0001227689,0.0003099254,0.0006054139,0.0008595876,0.0008867002,0.0005586373,0.0007018466,0.00001376185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004850168,"about_ca_system_score_gemma":0.0001622457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005077593,"about_ca_topic_score_gemma":0.000001817768,"domain_scores_codex":[0.9962865,0.001429114,0.0006774145,0.0002036952,0.0009737093,0.0004295524],"domain_scores_gemma":[0.9951236,0.00222369,0.0008275607,0.000963311,0.0007225845,0.0001393171],"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.0005743473,0.00007318408,0.0008369131,0.00001193362,0.0001128369,0.00001050883,0.002106849,0.00002096624,0.0003290818,0.9895631,0.001244803,0.005115464],"study_design_scores_gemma":[0.0008949708,0.0004780936,0.0005890559,0.00004457804,0.00002662502,0.000240279,0.0005933679,0.00004663517,0.006437824,0.9721114,0.01839842,0.0001387351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8387158,0.0009203324,0.09333359,0.01825756,0.01897313,0.001031876,0.00001264865,0.0001180101,0.02863706],"genre_scores_gemma":[0.9964766,0.0000696171,0.002390771,0.0003543663,0.0003263831,0.000007426631,1.689868e-7,0.00002355347,0.0003511015],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1577608,"threshold_uncertainty_score":0.6614126,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161005000","doi":"10.1016/j.jctb.2007.02.005","title":"Excluding a planar graph from<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">GF</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>q</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-representable matroids","year":2007,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Scroll; Graphic matroid; Combinatorics; Antichain; Matroid partitioning; Mathematics; Oriented matroid; Binary number; Graph; Planar graph; Discrete mathematics; Partially ordered set; Arithmetic","authors":[{"name":"Jim Geelen","is_ca":true},{"name":"Bert Gerards","is_ca":false},{"name":"Geoff Whittle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01835145302768177,"gpt":0.259835901032013,"spread":0.2414844480043312,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.008564274,0.001399575,0.001069164,0.001165898,0.002659503,0.002731399,0.005198784,0.002095514,0.001935081],"category_scores_gemma":[0.002353644,0.002013367,0.00231271,0.002269521,0.002330605,0.004869727,0.003045897,0.003709638,0.0008626647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001128194,"about_ca_system_score_gemma":0.001717946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007621284,"about_ca_topic_score_gemma":0.0001832982,"domain_scores_codex":[0.9851601,0.001415095,0.003366656,0.002035002,0.00451549,0.003507691],"domain_scores_gemma":[0.9873999,0.003728764,0.003739329,0.002631157,0.0006841904,0.001816679],"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.008477434,0.0007298431,0.00007220373,0.000534809,0.002282936,0.003378608,0.003386835,0.001666341,0.00452084,0.9650561,0.007214174,0.002679928],"study_design_scores_gemma":[0.005196676,0.004392007,0.00007264996,0.001743073,0.0010201,0.003017522,0.005147141,0.02019263,0.256311,0.6961721,0.004655645,0.002079453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9700468,0.002684476,0.008200562,0.0005931474,0.01122038,0.0001755777,0.0003295808,0.0003090888,0.006440442],"genre_scores_gemma":[0.9873767,0.001531907,0.005179927,0.0005889498,0.004259564,0.0001730956,0.000141158,0.0005830294,0.0001656757],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.268884,"threshold_uncertainty_score":0.9999153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161040448","doi":"10.1016/j.jctb.2010.09.001","title":"The edge-density for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math> minors","year":2010,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Combinatorics; Bipartite graph; Mathematics; Graph; Vertex (graph theory); Discrete mathematics","authors":[{"name":"Maria Chudnovsky","is_ca":false},{"name":"Bruce Reed","is_ca":true},{"name":"Paul Seymour","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01548249841739554,"gpt":0.2446875353190324,"spread":0.2292050369016368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.006199726,0.001042268,0.0005956627,0.0005001352,0.003640142,0.001914657,0.003265577,0.002592733,0.0751439],"category_scores_gemma":[0.004615697,0.001655442,0.00288273,0.001117541,0.00289184,0.001846379,0.001642088,0.002983061,0.001071827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002610008,"about_ca_system_score_gemma":0.001819057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002500137,"about_ca_topic_score_gemma":0.0005140413,"domain_scores_codex":[0.9901335,0.000911337,0.002739214,0.001342335,0.002529023,0.002344543],"domain_scores_gemma":[0.9863508,0.005089802,0.004056654,0.002663885,0.000569427,0.001269459],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.004526382,0.0005847458,0.000007002842,0.0007899318,0.001903343,0.0003989648,0.002470749,0.0001402705,0.004302559,0.790733,0.1928129,0.00133017],"study_design_scores_gemma":[0.003115276,0.002471025,0.00002772729,0.0008575764,0.00228083,0.001914109,0.003609165,0.002040497,0.8045479,0.1574577,0.02020273,0.001475455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.836641,0.0009714217,0.0008272163,0.001243283,0.01256266,0.0001137219,0.0003386351,0.000206412,0.1470956],"genre_scores_gemma":[0.9882417,0.001040577,0.002254796,0.0009044633,0.005228567,0.0007529298,0.0002559981,0.0007616553,0.0005592664],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8002453,"threshold_uncertainty_score":0.9998217,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985878353","doi":"10.1016/j.jctb.2013.09.002","title":"Generic global rigidity of body–bar frameworks","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; Hungarian Scientific Research Fund","keywords":"Rigidity (electromagnetism); Structural rigidity; Rigid body; Euclidean geometry; Mathematics; Combinatorics; Configuration space; Euclidean space; Pure mathematics; Geometry; Topology (electrical circuits); Physics; Classical mechanics","authors":[{"name":"Robert Connelly","is_ca":false},{"name":"Tibor Jordán","is_ca":false},{"name":"Walter Whiteley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003817975424285533,"gpt":0.1947244432375116,"spread":0.1909064678132261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000205489,0.0001211367,0.0003261659,0.00004646574,0.00003735607,0.00004212451,0.0001996663,0.0001619699,0.0006407893],"category_scores_gemma":[0.00009676422,0.00008317384,0.0001626336,0.0002259791,0.00005838044,0.0004448377,0.00002258725,0.0002411253,0.000006396912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006484203,"about_ca_system_score_gemma":0.00001988721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004957073,"about_ca_topic_score_gemma":2.476373e-7,"domain_scores_codex":[0.9990673,0.00006494566,0.0004585016,0.00005444176,0.0002244247,0.0001303975],"domain_scores_gemma":[0.9992189,0.00005002251,0.0002207993,0.0001291053,0.0003023591,0.00007880233],"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.0005206068,0.000131735,0.004272731,0.0001417667,0.001202729,0.00001940379,0.0004315326,0.1686859,0.007695423,0.7907296,0.01115014,0.01501846],"study_design_scores_gemma":[0.0008127346,0.0002904879,0.006253498,0.00005089463,0.0001375635,0.00005261304,0.0001803733,0.004001304,0.00820702,0.9765258,0.0032436,0.0002440464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9807467,0.0005173394,0.009481283,0.00007987886,0.006999302,0.00007630117,0.000004809378,0.00003459537,0.002059822],"genre_scores_gemma":[0.9976888,0.0001239059,0.001552207,0.00002182066,0.0005743387,0.000001044376,0.00000129606,0.00001032434,0.00002622362],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1857963,"threshold_uncertainty_score":0.7016194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2897904393","doi":"10.1016/j.jctb.2022.01.009","title":"Colouring graphs with sparse neighbourhoods: Bounds and applications","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Neighbourhood (mathematics); Conjecture; Clique number; Chromatic scale; Vertex (graph theory); Brooks' theorem; Graph; Edge coloring; Discrete mathematics; Chordal graph; Graph power; 1-planar graph; Line graph","authors":[{"name":"Marthe Bonamy","is_ca":false},{"name":"Thomas Perrett","is_ca":false},{"name":"Luke Postle","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009261596198324534,"gpt":0.2452386130601223,"spread":0.2359770168617978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001807448,0.0001408254,0.0002632579,0.0002828294,0.0007162683,0.0001759299,0.001071451,0.00002861206,0.00004816549],"category_scores_gemma":[0.00006123313,0.0001200366,0.00007327581,0.0007814466,0.0002763163,0.000969834,0.0005193332,0.0005466981,9.938899e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007957069,"about_ca_system_score_gemma":0.0001958609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.996852e-7,"about_ca_topic_score_gemma":5.169227e-7,"domain_scores_codex":[0.9981235,0.0004521972,0.0003261721,0.0002018556,0.0006186403,0.0002776842],"domain_scores_gemma":[0.9984866,0.0003544799,0.0003625883,0.0003933813,0.0002302681,0.0001727008],"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.0006734892,0.0001080627,0.0003850445,0.000008216773,0.00005766063,0.00005620481,0.0004052539,0.0001777337,0.0002908914,0.9945905,0.00005216205,0.003194834],"study_design_scores_gemma":[0.001112388,0.001503169,0.0002210093,0.000009519398,0.0000136746,0.0007464081,0.0005971969,0.00002217097,0.0006071121,0.9675163,0.027505,0.000146069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5250181,0.003655785,0.4500131,0.002508893,0.006188903,0.001463249,0.00002216359,0.000268221,0.01086159],"genre_scores_gemma":[0.9951265,0.00006262746,0.004299604,0.00007723353,0.0001689734,0.00005195132,4.892331e-7,0.0000180294,0.0001945251],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4701085,"threshold_uncertainty_score":0.5509029,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045237424","doi":"10.1016/j.jctb.2008.01.003","title":"Locally planar graphs are 5-choosable","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar graph; Planar; Enhanced Data Rates for GSM Evolution; Graph; Computer science; Mathematics; Combinatorics; Telecommunications; Computer graphics (images)","authors":[{"name":"Matt DeVos","is_ca":true},{"name":"Ken‐ichi Kawarabayashi","is_ca":false},{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01650812458121698,"gpt":0.2532083827894261,"spread":0.2367002582082092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001766504,0.0002192663,0.0004719346,0.0003569979,0.0003757669,0.00009861196,0.001949334,0.0001106818,0.00005066655],"category_scores_gemma":[0.0005382401,0.0001835905,0.0002452095,0.0007905113,0.000424313,0.002042561,0.0001898335,0.0006112303,0.00002824059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000742771,"about_ca_system_score_gemma":0.0002759468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001116492,"about_ca_topic_score_gemma":4.550446e-7,"domain_scores_codex":[0.99729,0.000513993,0.0006115494,0.0002343716,0.0008916132,0.0004584753],"domain_scores_gemma":[0.9973579,0.0004690096,0.0005934552,0.0006081078,0.0006738926,0.0002976025],"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.0008188038,0.0001358272,0.0005876988,0.00001029834,0.00007001388,0.0006964763,0.0003982018,0.00005459517,0.0005469877,0.9936922,0.002242056,0.0007468556],"study_design_scores_gemma":[0.001289241,0.0008319789,0.0004851484,0.00004796703,0.000007259189,0.001310422,0.0001616031,0.00001579213,0.004519972,0.9758645,0.01526109,0.0002050388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4654458,0.004596354,0.4693365,0.003645292,0.03279272,0.0008670804,0.00001722927,0.0005061327,0.02279293],"genre_scores_gemma":[0.9891859,0.0003948107,0.00880734,0.0001942474,0.0004842502,0.00000451587,5.374269e-7,0.00002932899,0.0008991092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5237401,"threshold_uncertainty_score":0.7486605,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152427009","doi":"10.1006/jctb.2002.2110","title":"Asymptotically the List Colouring Constants Are 1","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Conjecture; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","authors":[{"name":"Bruce Reed","is_ca":true},{"name":"Benny Sudakov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02972296561971398,"gpt":0.2613357763040033,"spread":0.2316128106842893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001929885,0.0002019802,0.0004542493,0.00008023482,0.0005102446,0.0001041166,0.0006466375,0.000132348,0.000865303],"category_scores_gemma":[0.002100109,0.0001191049,0.0002482326,0.0001735995,0.0005350004,0.0002732165,0.0001418373,0.0005749977,0.000004321275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005032394,"about_ca_system_score_gemma":0.00002812236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.458898e-7,"about_ca_topic_score_gemma":6.1706e-7,"domain_scores_codex":[0.9979084,0.0005228225,0.0006744304,0.000112401,0.0005054555,0.0002765352],"domain_scores_gemma":[0.9964993,0.001897316,0.0007577558,0.0003669754,0.0003577944,0.000120887],"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.0004100165,0.0001020546,0.0002603968,0.00002392024,0.0001616199,0.0000727628,0.001260994,0.000001754377,0.0000722701,0.9926915,0.004550979,0.0003917531],"study_design_scores_gemma":[0.0009537853,0.0003015246,0.0001380787,0.0000948638,0.00009745801,0.0003832648,0.001000889,0.000005184866,0.00073209,0.9839677,0.01217502,0.0001501856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9438649,0.0009892341,0.0003250826,0.001635222,0.01509396,0.000281716,0.0000118544,0.00006269937,0.03773528],"genre_scores_gemma":[0.9974197,0.0001064493,0.0004477728,0.0001814636,0.001049093,0.000001738242,8.729263e-8,0.00002841309,0.0007652761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05355476,"threshold_uncertainty_score":0.9474461,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010114044","doi":"10.1016/j.jctb.2010.04.002","title":"Confinement of matroid representations to subsets of partial fields","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Lift (data mining); Combinatorics; Finite field; Representation theorem; Algebraic number; Corollary; Field (mathematics); Characterization (materials science); Discrete mathematics; Matrix (chemical analysis); Homomorphism; Pure mathematics; Mathematical analysis","authors":[{"name":"Rudi Pendavingh","is_ca":false},{"name":"Stefan H. M. van Zwam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02097539794582488,"gpt":0.3308868804174328,"spread":0.3099114824716079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008703449,0.0001046677,0.0003886365,0.00009985017,0.00004010813,0.00001063281,0.0003123274,0.00008884893,0.0005267673],"category_scores_gemma":[0.002131286,0.00009152784,0.0001373209,0.0001278243,0.0001333874,0.0001564585,0.00007758967,0.0003033535,0.000001810487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001351542,"about_ca_system_score_gemma":0.00008802397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002048942,"about_ca_topic_score_gemma":0.000004221738,"domain_scores_codex":[0.9984719,0.0001039423,0.0008495286,0.00008030788,0.0003640072,0.0001302912],"domain_scores_gemma":[0.9976607,0.0006635711,0.000759989,0.0003450335,0.0004811958,0.00008948924],"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.0005492562,0.0001740326,0.0001454651,0.00004234583,0.00007094303,0.000006391818,0.0008802929,0.000008636584,0.01977292,0.9771829,0.000846314,0.000320481],"study_design_scores_gemma":[0.0007115783,0.0003901992,0.00009196289,0.00003136824,0.00004268309,0.00002244763,0.0003517804,8.419345e-7,0.1872059,0.8081805,0.002905284,0.00006554357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.981407,0.00001923668,0.008246806,0.0004580322,0.00652646,0.0001865545,0.000009359318,0.000009954344,0.00313663],"genre_scores_gemma":[0.981647,0.00000764452,0.01753507,0.00002222741,0.0005106929,0.000003500634,5.56262e-7,0.00001431127,0.0002589791],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1690025,"threshold_uncertainty_score":0.5767733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120958076","doi":"10.1016/j.jctb.2007.10.008","title":"Tangles, tree-decompositions and grids in matroids","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Tangle; Matroid; Graphic matroid; Combinatorics; Matroid partitioning; Mathematics; Tree decomposition; Grid; Graph; Tree (set theory); Order (exchange); Finite field; Discrete mathematics; Pure mathematics; Geometry","authors":[{"name":"Jim Geelen","is_ca":true},{"name":"Bert Gerards","is_ca":false},{"name":"Geoff Whittle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007818567983791677,"gpt":0.2651665826904393,"spread":0.2573480147066476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001471703,0.0001393878,0.0003052866,0.0003644944,0.0001169572,0.0001426293,0.0007573128,0.00006789971,0.00001241089],"category_scores_gemma":[0.0001647025,0.0001215183,0.00008891826,0.0005369087,0.0001470081,0.001501378,0.000111531,0.0004003412,0.000002530062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007012659,"about_ca_system_score_gemma":0.00008762771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.071e-7,"about_ca_topic_score_gemma":8.46421e-7,"domain_scores_codex":[0.998383,0.0003831733,0.0004391785,0.0001591721,0.0003561072,0.0002792992],"domain_scores_gemma":[0.9988891,0.0002942197,0.000198186,0.00028674,0.0001759148,0.0001557669],"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.0003949008,0.0001247821,0.0001317151,0.000003599242,0.00001212555,0.0001176417,0.0003139668,0.00001852513,0.003967017,0.9833907,0.0001130589,0.0114119],"study_design_scores_gemma":[0.001206525,0.001238424,0.001753189,0.00004240162,0.000004891884,0.0003589104,0.0001024079,0.00003507536,0.003052535,0.9901549,0.001924643,0.0001260847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7364257,0.005043049,0.2187403,0.01047969,0.009389095,0.0006744423,0.000008766331,0.0002139052,0.019025],"genre_scores_gemma":[0.9883742,0.0001134438,0.01103781,0.0001101241,0.0002429786,0.000001595506,3.517482e-7,0.000008196215,0.0001113149],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2519484,"threshold_uncertainty_score":0.4955372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975172784","doi":"10.1016/j.jctb.2006.01.001","title":"Representation characterizations of chordal bipartite graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Chordal graph; Interval graph; Bipartite graph; Mathematics; Complete bipartite graph; Split graph; Discrete mathematics; Cograph; Distance-hereditary graph; Indifference graph; Graph; Line graph; 1-planar graph; Graph power","authors":[{"name":"Jing Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01227114979324252,"gpt":0.2757147604491695,"spread":0.263443610655927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001183451,0.0001203862,0.0003115025,0.000370606,0.0001170882,0.00008406423,0.0008168663,0.00005888785,0.00003397287],"category_scores_gemma":[0.000298978,0.0001067549,0.0001769413,0.001055984,0.0002230918,0.00183147,0.0001291869,0.0002116489,0.000003199006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002893526,"about_ca_system_score_gemma":0.0001018626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003303721,"about_ca_topic_score_gemma":5.518506e-7,"domain_scores_codex":[0.9979951,0.000433106,0.0006679491,0.0001477674,0.0005409294,0.0002151288],"domain_scores_gemma":[0.9978443,0.0003228428,0.0006929959,0.0004012779,0.0006588334,0.00007977305],"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.0003398371,0.0001330733,0.001306068,0.000008570627,0.00003085711,0.00001500712,0.0001608849,0.0001177916,0.02109657,0.975436,0.0001359423,0.001219438],"study_design_scores_gemma":[0.0008771697,0.0004512446,0.004364638,0.00002454104,0.00001028527,0.0000552514,0.0000360574,0.00003732079,0.05605224,0.9366279,0.001367426,0.0000958818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8260499,0.0002728624,0.1644391,0.0005735321,0.004944343,0.0002597193,0.000007246966,0.00006659253,0.003386687],"genre_scores_gemma":[0.9964467,0.00004921814,0.002916095,0.00001529742,0.000287512,0.000003520617,0.00000257427,0.00001177905,0.0002672563],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1703968,"threshold_uncertainty_score":0.435334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096188165","doi":"10.1016/j.jctb.2008.08.005","title":"Cayley sum graphs and eigenvalues of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>6</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-fullerenes","year":2008,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Scroll; Eigenvalues and eigenvectors; Discrete mathematics; Combinatorics; Physics; Theology","authors":[{"name":"Matt DeVos","is_ca":true},{"name":"Luis Goddyn","is_ca":true},{"name":"Bojan Mohar","is_ca":true},{"name":"Robert Šámal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01973134371674429,"gpt":0.2477737569899882,"spread":0.228042413273244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity"],"category_scores_codex":[0.005425437,0.002016674,0.001766913,0.001022518,0.003293902,0.001368082,0.003315578,0.003011677,0.00141757],"category_scores_gemma":[0.00281358,0.002697406,0.003248926,0.001799478,0.004013768,0.002538898,0.001862943,0.003266511,0.0005889974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008911343,"about_ca_system_score_gemma":0.001794642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004648746,"about_ca_topic_score_gemma":0.000222287,"domain_scores_codex":[0.9853115,0.001562262,0.004583631,0.002101648,0.003598003,0.002842947],"domain_scores_gemma":[0.9849215,0.00399552,0.00576392,0.002571293,0.001035691,0.00171214],"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.005728264,0.001732945,0.00005367201,0.001560778,0.003780216,0.0008022798,0.006033965,0.0003821056,0.003972257,0.9611637,0.0131636,0.001626191],"study_design_scores_gemma":[0.005593658,0.004509694,0.0000824921,0.002275843,0.003615333,0.003286763,0.008128688,0.006754487,0.2600624,0.6921899,0.01079824,0.002702439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9829614,0.003974371,0.000333297,0.0006275332,0.006034086,0.0003307547,0.001292024,0.0003764808,0.004070117],"genre_scores_gemma":[0.9866866,0.005586232,0.002164748,0.0005278798,0.002966533,0.0005011967,0.0004065019,0.0008601944,0.0003000934],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2689738,"threshold_uncertainty_score":0.9996686,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998475227","doi":"10.1016/j.jctb.2005.06.002","title":"Multiplicative graphs and semi-lattice endomorphisms in the category of graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Multiplicative function; Endomorphism; Mathematics; Combinatorics; Lattice (music); Pathwidth; Discrete mathematics; Graph; Physics; Line graph","authors":[{"name":"Claude Tardif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01137584614222659,"gpt":0.2399839016745055,"spread":0.2286080555322789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002249135,0.000127606,0.0003724606,0.0003619105,0.00008291665,0.0000634643,0.001144955,0.00006772086,0.00002272602],"category_scores_gemma":[0.0004899664,0.00007515763,0.0001419595,0.001308628,0.0003158819,0.0007992075,0.00016221,0.0002952866,0.00000170354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001675296,"about_ca_system_score_gemma":0.00003649834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001535738,"about_ca_topic_score_gemma":0.000003673343,"domain_scores_codex":[0.9982725,0.0004810377,0.0005431038,0.0001535418,0.0003737931,0.0001760293],"domain_scores_gemma":[0.997702,0.001189095,0.0005080214,0.0003356719,0.0001916766,0.00007353294],"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.0001405022,0.0001846256,0.0005772419,0.000004591866,0.0000555356,0.00001758376,0.001206049,0.00001394949,0.0002253523,0.9908577,0.0001615463,0.006555281],"study_design_scores_gemma":[0.001062514,0.0004837227,0.004425431,0.00001210046,0.00004086734,0.0001117168,0.0006691006,0.00005519566,0.001494834,0.9866896,0.004850145,0.0001047391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9757854,0.003701397,0.01119562,0.004834506,0.001517269,0.0002647777,0.0000143978,0.00002931625,0.00265735],"genre_scores_gemma":[0.997688,0.0003479403,0.001682188,0.0001716244,0.00006658694,0.000002739207,6.538096e-7,0.000003146823,0.00003712455],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02190263,"threshold_uncertainty_score":0.3064839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093635261","doi":"10.1016/j.jctb.2014.06.005","title":"The inducibility of blow-up graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","authors":[{"name":"Hamed Hatami","is_ca":true},{"name":"James Hirst","is_ca":true},{"name":"Serguei Norine","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01646336035669225,"gpt":0.2747567065996173,"spread":0.258293346242925,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007015116,0.0001715773,0.0004854198,0.00008489394,0.0003672006,0.00003915505,0.0007013055,0.000131459,0.00008821542],"category_scores_gemma":[0.004139795,0.00009732579,0.0003418435,0.0001855218,0.0006286783,0.0002142001,0.0001317868,0.0004250525,5.13417e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002238342,"about_ca_system_score_gemma":0.0000622679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.495894e-7,"about_ca_topic_score_gemma":9.025756e-7,"domain_scores_codex":[0.99738,0.0009196979,0.0008840107,0.0001160999,0.0004844494,0.0002157338],"domain_scores_gemma":[0.9947345,0.003054505,0.00098619,0.0006227424,0.0005108845,0.00009122339],"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.001201366,0.00006420742,0.000226881,0.00003662858,0.0001369585,0.000001433026,0.00102478,6.121061e-7,0.000303974,0.9931528,0.0007087898,0.003141557],"study_design_scores_gemma":[0.0009443925,0.0005496603,0.0003197274,0.00004110096,0.00007783648,0.00004174327,0.0005030872,0.000001313424,0.007922568,0.9811414,0.008351223,0.0001059708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9818374,0.0002106766,0.0001954328,0.000147675,0.01293832,0.0001153191,0.000002866823,0.00001517636,0.004537131],"genre_scores_gemma":[0.9988108,0.00006183171,0.0003801072,0.00002828128,0.0005093608,0.000001332229,1.594637e-7,0.00001965994,0.0001884964],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01697337,"threshold_uncertainty_score":0.495602,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139284584","doi":"10.1016/j.jctb.2005.09.002","title":"On the extreme eigenvalues of regular graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Combinatorics; Integer (computer science); Strongly regular graph; Graph; Discrete mathematics; Constant (computer programming); Pure mathematics; Pathwidth; Physics; Quantum mechanics; Line graph; Computer science","authors":[{"name":"Sebastian M. Cioabă","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03740442633194699,"gpt":0.2765691128428439,"spread":0.2391646865108969,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002495638,0.0001388404,0.0003114761,0.0001048998,0.0001638924,0.00002245306,0.0004772031,0.00007316418,0.0003081283],"category_scores_gemma":[0.0007774378,0.00008616905,0.0002719192,0.0002235822,0.0002808289,0.0001936721,0.0000345165,0.0002597745,0.000006477115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002085523,"about_ca_system_score_gemma":0.00003780204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.355328e-7,"about_ca_topic_score_gemma":3.025868e-7,"domain_scores_codex":[0.9984156,0.0004096503,0.0005915408,0.00008148498,0.0003575643,0.0001441644],"domain_scores_gemma":[0.9970341,0.001570127,0.0006751277,0.0004070709,0.0002535181,0.0000600359],"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.0005255303,0.0002641341,0.000008757867,0.00001230078,0.00009951221,0.000001712247,0.000566095,0.000006990078,0.003138472,0.9918642,0.002986275,0.0005260243],"study_design_scores_gemma":[0.0004589449,0.0003217587,0.00002446528,0.00006073753,0.00006854215,0.00002574479,0.0004901686,0.000001222062,0.04193944,0.9468955,0.009629836,0.00008360855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9893749,0.0002095623,0.000342236,0.001364407,0.0009648587,0.0001861621,0.000005608045,0.00002066728,0.007531575],"genre_scores_gemma":[0.9981887,0.0000481996,0.0009403356,0.00007506749,0.0003263393,0.000005455937,3.105552e-7,0.00001882348,0.0003967179],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04496867,"threshold_uncertainty_score":0.3513872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036368491","doi":"10.1016/j.jctb.2004.10.001","title":"Average independence polynomials","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Independence (probability theory); Mathematics; Combinatorics; Polynomial; Discrete mathematics; Graph; Statistics; Mathematical analysis","authors":[{"name":"Jason I. Brown","is_ca":true},{"name":"Richard J. Nowakowski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02101477562931631,"gpt":0.2946448834877913,"spread":0.273630107858475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002468741,0.0003199858,0.000815996,0.0001906399,0.000168333,0.00009015806,0.0007852175,0.0002397954,0.0001446946],"category_scores_gemma":[0.004426789,0.0002733227,0.0002935106,0.000302866,0.0001915664,0.001018244,0.0001516387,0.0006864499,0.00002280448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003099929,"about_ca_system_score_gemma":0.0003875994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001780158,"about_ca_topic_score_gemma":7.340287e-7,"domain_scores_codex":[0.997021,0.0002574333,0.0012152,0.0001794484,0.0009423057,0.0003846682],"domain_scores_gemma":[0.9962951,0.001008121,0.001347257,0.0005005257,0.0006275589,0.0002214405],"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.0007144146,0.0003422901,0.00001103569,0.00005649217,0.0001053607,0.000130769,0.001072699,0.00009326643,0.001770125,0.9952412,0.0002236627,0.0002386486],"study_design_scores_gemma":[0.003267583,0.0007715382,0.00000615917,0.0001841516,0.00006501361,0.0004622147,0.000362031,5.201848e-7,0.03068915,0.9615724,0.002347256,0.0002719931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8512989,0.000541839,0.09003861,0.0008772453,0.04166082,0.0008487711,0.00001304421,0.000262056,0.01445876],"genre_scores_gemma":[0.9825041,0.00005021314,0.01552881,0.00005397529,0.001455823,0.000005067215,3.674011e-7,0.00006668104,0.0003349071],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1312053,"threshold_uncertainty_score":0.9999719,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066522339","doi":"10.1006/jctb.2000.2003","title":"Chromatic Number and the 2-Rank of a Graph","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Chromatic scale; Combinatorics; Graph; Rank (graph theory); Friendship graph; Adjacency matrix; Mathematics; Windmill graph; Discrete mathematics; Line graph; Graph power","authors":[{"name":"Chris Godsil","is_ca":true},{"name":"Gordon Royle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006015949863867088,"gpt":0.2158930395992454,"spread":0.2098770897353783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002245939,0.00009841083,0.0003127985,0.00007555349,0.0001091208,0.00007326641,0.0005131003,0.00004412036,0.0000229514],"category_scores_gemma":[0.0002207252,0.00005676023,0.000124321,0.0003410582,0.0004010946,0.0004463756,0.0001040389,0.0001599098,0.000002245197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005915741,"about_ca_system_score_gemma":0.00005057125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004293792,"about_ca_topic_score_gemma":2.130516e-7,"domain_scores_codex":[0.9986598,0.0003315441,0.0004738424,0.00008521704,0.0003199154,0.0001297161],"domain_scores_gemma":[0.9985287,0.0004261986,0.0004541674,0.0002755815,0.0002469716,0.0000683605],"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.0003910064,0.00005026155,0.0001744851,0.00001107223,0.00005446239,0.00001276153,0.001003201,0.000008491044,0.0003354827,0.9969829,0.0002304802,0.0007454404],"study_design_scores_gemma":[0.002595677,0.0002046645,0.0001238794,0.00005953948,0.00002698439,0.0005077641,0.0001195321,0.00005348201,0.0008668986,0.9942819,0.001093673,0.00006602892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9806479,0.001434926,0.006948226,0.002301503,0.005051951,0.0001449515,5.060138e-7,0.00003079852,0.00343919],"genre_scores_gemma":[0.9978619,0.0002651983,0.001644408,0.0001017822,0.00004183247,0.000001140682,5.62106e-8,0.000005215292,0.00007848535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01721393,"threshold_uncertainty_score":0.2314615,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}