{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002198427,0.0005054082,0.0003424797,0.002266746,0.001663146,0.002877288,0.0007662278,0.0007537564,0.01683303],"category_scores_gemma":[0.0009742396,0.0004817537,0.0005427894,0.001451658,0.001108438,0.001613762,0.000863926,0.001173557,0.002285474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001074087,"about_ca_system_score_gemma":0.0006347709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002482454,"about_ca_topic_score_gemma":0.002773815,"domain_scores_codex":[0.9996942,0.00003179487,0.00001667072,0.00006908584,0.00006495437,0.0001233236],"domain_scores_gemma":[0.9993285,0.000144467,0.0001207735,0.00007968859,0.0001690037,0.0001575089],"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.0001339008,0.00005933115,0.0006902842,0.00008734241,0.00001089575,0.0001560216,0.0006639924,0.001441282,0.005663114,0.9690892,0.005699303,0.01630537],"study_design_scores_gemma":[0.0000379285,0.00003674887,0.002057524,0.00007639221,0.00002600411,0.0002723634,0.0006244603,0.01114195,0.004266926,0.9614778,0.01995165,0.00003030489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6762258,0.00118231,0.0799453,0.00160598,0.0003839166,0.0003529534,0.002619439,0.0004757213,0.2372085],"genre_scores_gemma":[0.8878435,0.000687682,0.03198518,0.0004065844,0.0001176661,0.000252614,0.002552855,0.0003541457,0.07579964],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01683303,"threshold_uncertainty_score":0.05631214,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115589427","doi":"10.1016/j.jctb.2011.07.004","title":"The disjoint paths problem in quadratic time","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":203,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Minor (academic); Combinatorics; Time complexity; Mathematics; Mathematical proof; Discrete mathematics; Computer science; Algorithm","authors":[{"name":"Ken‐ichi Kawarabayashi","is_ca":false},{"name":"Yusuke Kobayashi","is_ca":false},{"name":"Bruce Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01470044315439314,"gpt":0.2461503881490396,"spread":0.2314499449946465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003323595,0.001678613,0.003715679,0.00157924,0.004073116,0.007370119,0.004779017,0.003424178,0.03061758],"category_scores_gemma":[0.02270089,0.001502729,0.002030603,0.004203006,0.004101832,0.01882637,0.003723567,0.007668439,0.002524596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004781063,"about_ca_system_score_gemma":0.0049293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007212472,"about_ca_topic_score_gemma":0.01111744,"domain_scores_codex":[0.9954011,0.00128993,0.0002005296,0.001130002,0.0008728429,0.001105539],"domain_scores_gemma":[0.97611,0.01907307,0.001081566,0.001504983,0.0008385185,0.001391952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002827845,0.001148708,0.003382283,0.001598105,0.0003688738,0.000617218,0.001343483,0.1117618,0.003767293,0.6888465,0.0776092,0.1067287],"study_design_scores_gemma":[0.0003970301,0.00008296227,0.0005591901,0.00004844013,0.00008046801,0.0001674368,0.0002741521,0.09090938,0.0007076017,0.9014407,0.005304686,0.00002799014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5237767,0.00593305,0.2776088,0.03557843,0.001505275,0.0005125385,0.005797083,0.002294045,0.1469941],"genre_scores_gemma":[0.7975568,0.002901251,0.1261048,0.002233285,0.001607097,0.0004304636,0.005594946,0.001508427,0.06206309],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03061758,"threshold_uncertainty_score":0.1024261,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035278325","doi":"10.1016/j.jctb.2004.12.005","title":"A bound on the chromatic number of the square of a planar graph","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":195,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Alberta; University of New Brunswick","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Bounded function; Square (algebra); Chromatic scale; Planar; Graph; Upper and lower bounds; Quadratic equation; Discrete mathematics; Computer science; Mathematical analysis; Geometry","authors":[{"name":"Michael Molloy","is_ca":true},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01294776214586673,"gpt":0.2731152441474006,"spread":0.2601674820015338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002090973,0.002421381,0.0018447,0.004098985,0.002702144,0.005390184,0.004441593,0.00275892,0.02283406],"category_scores_gemma":[0.01732274,0.001372015,0.001426363,0.00331001,0.004141273,0.008908731,0.004757629,0.005848491,0.003814181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004412813,"about_ca_system_score_gemma":0.002094559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005660864,"about_ca_topic_score_gemma":0.01015348,"domain_scores_codex":[0.9976051,0.0003833756,0.0000757665,0.0007417615,0.0006184421,0.0005756416],"domain_scores_gemma":[0.9745525,0.01901954,0.0006826486,0.00235465,0.001363234,0.002027433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003836078,0.0004925319,0.01005299,0.001619381,0.0004111196,0.0007454674,0.001141922,0.1180225,0.06760109,0.5813319,0.09475394,0.119991],"study_design_scores_gemma":[0.0002988275,0.0004992353,0.008850593,0.0003397159,0.0004664924,0.0009251498,0.0004895223,0.3293917,0.01757068,0.5976596,0.04322135,0.0002872162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3734955,0.01202721,0.2812958,0.01976221,0.0024619,0.0002665742,0.005239333,0.004382169,0.3010692],"genre_scores_gemma":[0.8824086,0.004376871,0.06972554,0.002329008,0.002256827,0.0003590795,0.003012513,0.001422987,0.03410854],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02283406,"threshold_uncertainty_score":0.07638752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033177498","doi":"10.1016/j.jctb.2004.11.001","title":"Planar graphs without cycles of length from 4 to 7 are 3-colorable","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Planar graph; Combinatorics; Mathematics; Conjecture; Graph coloring; Graph; Plane (geometry); Discrete mathematics; Geometry","authors":[{"name":"O. V. Borodin","is_ca":false},{"name":"A. N. Glebov","is_ca":false},{"name":"André Raspaud","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01415230470762358,"gpt":0.2708427278237021,"spread":0.2566904231160785,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009266,0.001487324,0.001335011,0.001538147,0.003303798,0.00554942,0.002260242,0.002163276,0.01687594],"category_scores_gemma":[0.00336873,0.00205515,0.001750267,0.002607953,0.00319445,0.003906892,0.001750125,0.003281735,0.00241165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002419076,"about_ca_system_score_gemma":0.001879049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004387541,"about_ca_topic_score_gemma":0.008460042,"domain_scores_codex":[0.9990512,0.0001170876,0.00004849911,0.000252535,0.0002139773,0.000316738],"domain_scores_gemma":[0.9925841,0.00341827,0.001684817,0.0009064298,0.000614716,0.0007916691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.005548683,0.001752986,0.0209865,0.001607274,0.000657262,0.002605591,0.003357837,0.03404739,0.1265148,0.623902,0.03648137,0.1425384],"study_design_scores_gemma":[0.0007158886,0.0005079602,0.02294677,0.0002078557,0.000635317,0.002218532,0.001926125,0.02653073,0.05720811,0.8590608,0.02773585,0.0003061438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9092131,0.0006446267,0.02354571,0.001156191,0.0001890951,0.0001870968,0.00207854,0.001375213,0.06161039],"genre_scores_gemma":[0.9531533,0.0006859889,0.02048508,0.0005459235,0.0000801855,0.0002189343,0.002667445,0.000523128,0.02163996],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01687594,"threshold_uncertainty_score":0.05645567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005208254,0.0008955137,0.0008133352,0.001571123,0.0008678226,0.004126047,0.002038993,0.001085758,0.51149],"category_scores_gemma":[0.003279058,0.0006711957,0.00053924,0.002874829,0.0006658629,0.00501944,0.00148984,0.002370452,0.3049635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001651219,"about_ca_system_score_gemma":0.0007123129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004846771,"about_ca_topic_score_gemma":0.006669705,"domain_scores_codex":[0.9996927,0.0000456915,0.00001949894,0.0000683833,0.0001328829,0.00004085511],"domain_scores_gemma":[0.9984078,0.0006072253,0.0001009648,0.0004014378,0.0003305602,0.000152115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000790296,0.00004760392,0.0002523014,0.0001564416,0.000007129017,0.00004555772,0.00008494226,0.0005780645,0.001710761,0.07062168,0.8688717,0.05754473],"study_design_scores_gemma":[0.00006834718,0.00003191536,0.001637291,0.00008575591,0.00001147452,0.0002525622,0.00014483,0.007518118,0.007337857,0.1487145,0.8341426,0.00005485589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.004750993,0.0004631611,0.1066846,0.008437116,0.001252031,0.0001687432,0.04398904,0.02980682,0.8044475],"genre_scores_gemma":[0.0853553,0.002307557,0.1088164,0.002447064,0.001168481,0.0004536952,0.0771561,0.03575648,0.6865389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.51149,"threshold_uncertainty_score":0.6968002,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004257816,0.001079262,0.001803058,0.00513446,0.003431065,0.00638298,0.001891228,0.002670347,0.006339919],"category_scores_gemma":[0.007319712,0.001308432,0.002979497,0.004365896,0.008390442,0.01875438,0.005913928,0.008943553,0.0009887828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002447782,"about_ca_system_score_gemma":0.0007783059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001027135,"about_ca_topic_score_gemma":0.0006868928,"domain_scores_codex":[0.9977871,0.0007149974,0.0001405616,0.0005159482,0.0004089845,0.0004323839],"domain_scores_gemma":[0.9948453,0.00328804,0.0004668145,0.0004695649,0.0004704421,0.00045992],"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.00001512589,0.00001089775,0.00009042297,0.00002416082,0.000004120519,0.0000263649,0.0001683802,0.0001903049,0.0001316937,0.9969178,0.0005700948,0.001850475],"study_design_scores_gemma":[0.000005462651,0.000005789066,0.00005602269,0.00001007372,0.000004959789,0.00004295937,0.0000549001,0.0006425812,0.0001159425,0.9979025,0.001153863,0.000004976011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2035499,0.006685051,0.573725,0.007507952,0.001170188,0.0001502624,0.0008722913,0.000546572,0.2057927],"genre_scores_gemma":[0.9047537,0.00243506,0.0721221,0.001380108,0.001084424,0.0002223476,0.0006111305,0.0001950899,0.01719606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00638298,"threshold_uncertainty_score":0.02251774,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001170787,0.0006480921,0.0009522108,0.003668153,0.002693105,0.004264754,0.001316659,0.001325181,0.01041305],"category_scores_gemma":[0.007774413,0.0007013722,0.0009546921,0.002326802,0.004080346,0.008200489,0.003055884,0.003139578,0.001193049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001512971,"about_ca_system_score_gemma":0.0008216869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000976228,"about_ca_topic_score_gemma":0.0008693898,"domain_scores_codex":[0.9987429,0.0003246473,0.00008372452,0.0002493671,0.0004387801,0.0001606419],"domain_scores_gemma":[0.9962882,0.001807518,0.0003762446,0.0003734482,0.0005725968,0.0005820731],"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.00001143358,0.00001414283,0.0001321105,0.00001184729,0.000003286577,0.00003900527,0.0001442036,0.0002567953,0.0002273527,0.995482,0.0005063333,0.003171466],"study_design_scores_gemma":[0.000003729353,0.000004936898,0.00007815912,0.000006656412,0.000002953497,0.00007734319,0.00003981005,0.001156793,0.0001434016,0.9968517,0.001629495,0.000004981159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4790657,0.003673334,0.1794036,0.004793809,0.001098859,0.00006856907,0.000417399,0.0005080951,0.3309706],"genre_scores_gemma":[0.9164649,0.001900784,0.02209108,0.0007016262,0.001193256,0.0001309839,0.0004033184,0.0002401702,0.05687383],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01041305,"threshold_uncertainty_score":0.0348351,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008347391,0.000661601,0.001219153,0.004254862,0.001855033,0.003903618,0.001601777,0.00224074,0.01038982],"category_scores_gemma":[0.007033708,0.000793984,0.001046726,0.002087149,0.002338327,0.005723523,0.002387865,0.00249248,0.001506827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001000147,"about_ca_system_score_gemma":0.0005041341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007046578,"about_ca_topic_score_gemma":0.0008851135,"domain_scores_codex":[0.9991674,0.0001774316,0.00005598185,0.0001960622,0.000273649,0.0001294577],"domain_scores_gemma":[0.9967693,0.001493086,0.0005298688,0.000403294,0.0003850439,0.000419552],"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.00005683411,0.00004670457,0.0003376839,0.00006006842,0.00000902548,0.0001386634,0.0003894808,0.001458741,0.001478634,0.9859206,0.002127588,0.007975969],"study_design_scores_gemma":[0.00001127048,0.000006893201,0.0001534537,0.00001253121,0.000006114311,0.000102443,0.00008854832,0.00569139,0.0003046583,0.9926709,0.0009426622,0.000009242861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6434293,0.001163272,0.2402766,0.003370127,0.0009925042,0.0002351922,0.0008776558,0.001356962,0.1082984],"genre_scores_gemma":[0.9396207,0.0005813811,0.03403204,0.0005438727,0.0006766571,0.0001192032,0.0004711905,0.0003996502,0.0235552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01038982,"threshold_uncertainty_score":0.03475744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037789845","doi":"10.1016/j.jctb.2003.09.001","title":"Excluding any graph as a minor allows a low tree-width 2-coloring","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Graph minor; Graph; Edge coloring; Graph coloring; Conjecture; Fractional coloring; Discrete mathematics; List coloring; Graph power; Graph factorization; Line graph","authors":[{"name":"Matt DeVos","is_ca":false},{"name":"Guoli Ding","is_ca":false},{"name":"Bogdan Oporowski","is_ca":false},{"name":"Daniel P. Sanders","is_ca":false},{"name":"Bruce Reed","is_ca":true},{"name":"Paul Seymour","is_ca":false},{"name":"Dirk Vertigan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0153158103495201,"gpt":0.2745306702123444,"spread":0.2592148598628243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001065132,0.00167732,0.001844152,0.0006302581,0.002153913,0.003191849,0.002160345,0.001626461,0.01017207],"category_scores_gemma":[0.004580529,0.001202994,0.00220032,0.001122745,0.001301893,0.003837581,0.002500453,0.003186296,0.002913677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006774247,"about_ca_system_score_gemma":0.001322931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007183956,"about_ca_topic_score_gemma":0.002311808,"domain_scores_codex":[0.9990104,0.0002066705,0.00005343213,0.0002899434,0.0001417908,0.0002976319],"domain_scores_gemma":[0.9926665,0.003070028,0.0003890358,0.002758413,0.0002782383,0.0008377832],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004670606,0.001565328,0.006233059,0.001363878,0.0002997266,0.001256786,0.001232232,0.06785268,0.241317,0.509554,0.03559519,0.1290596],"study_design_scores_gemma":[0.0005332749,0.0003651326,0.001739254,0.00009852812,0.0003765367,0.001301833,0.0003333838,0.1346204,0.04564898,0.7964122,0.01847865,0.00009196592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4770519,0.0004635372,0.4668362,0.002078727,0.0005249855,0.0002627291,0.001344757,0.006951325,0.04448576],"genre_scores_gemma":[0.7450749,0.0004432902,0.2320909,0.0008893966,0.0002654312,0.0003006557,0.001475328,0.003001828,0.01645823],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01017207,"threshold_uncertainty_score":0.03402895,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000982966,0.0007005936,0.001071384,0.001441843,0.002591831,0.004795802,0.002010729,0.001995699,0.01577031],"category_scores_gemma":[0.00657508,0.0009323281,0.0009201904,0.001978939,0.001960022,0.005101284,0.002456384,0.002663603,0.001460442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001628493,"about_ca_system_score_gemma":0.0009537284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00173752,"about_ca_topic_score_gemma":0.002879967,"domain_scores_codex":[0.9987155,0.0003893042,0.00005722803,0.0003666782,0.0002005565,0.0002705963],"domain_scores_gemma":[0.9930878,0.00361928,0.0003821713,0.001706013,0.0005776782,0.0006270446],"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.0005479681,0.0002421241,0.002525927,0.000179589,0.00003430138,0.0001297614,0.000481363,0.01859721,0.007597958,0.8971931,0.01675212,0.05571866],"study_design_scores_gemma":[0.00006895886,0.00005079725,0.00124373,0.00005708522,0.00005182423,0.0002054083,0.0003124936,0.05289263,0.003925344,0.9317064,0.009456125,0.00002929723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6059786,0.0007317793,0.2483657,0.002718729,0.0004606124,0.0002246972,0.002161874,0.001126209,0.1382318],"genre_scores_gemma":[0.8520082,0.0004371091,0.1166504,0.0006581475,0.000177562,0.0001525441,0.002059799,0.0005366539,0.02731967],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01577031,"threshold_uncertainty_score":0.05275697,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00459702,0.00217355,0.003808959,0.007009983,0.002789999,0.005814433,0.007653204,0.00473498,0.01187285],"category_scores_gemma":[0.05545462,0.002719275,0.002375659,0.004953483,0.003298963,0.01622581,0.004540388,0.004964016,0.001872902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001980343,"about_ca_system_score_gemma":0.0009788726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002230174,"about_ca_topic_score_gemma":0.002764653,"domain_scores_codex":[0.9943209,0.002109151,0.0002530655,0.001565445,0.001315597,0.0004359202],"domain_scores_gemma":[0.9438272,0.0387312,0.003863378,0.007661772,0.003749409,0.002167122],"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.0003110057,0.0001738604,0.004691999,0.000555419,0.0001745902,0.0002596726,0.0005891829,0.05460439,0.003279263,0.8573401,0.01117306,0.06684747],"study_design_scores_gemma":[0.00001960526,0.00002303096,0.000799963,0.00007935605,0.00007151304,0.0002005128,0.00007024122,0.2013015,0.00197063,0.7920878,0.003343974,0.00003180558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07128292,0.000866071,0.9129995,0.001339832,0.0002159113,0.0001033923,0.0007554308,0.0009739629,0.01146306],"genre_scores_gemma":[0.5256783,0.001770808,0.4399932,0.0009841715,0.001237071,0.0005281417,0.00408199,0.002532449,0.02319398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01187285,"threshold_uncertainty_score":0.03971869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162598482","doi":"10.1006/jctb.2000.1963","title":"The Excluded Minors for GF(4)-Representable Matroids","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; GF(2); Mathematics; Computer science; Finite field","authors":[{"name":"Jim Geelen","is_ca":true},{"name":"A.M.H. Gerards","is_ca":false},{"name":"Ajai Kapoor","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01250534148642135,"gpt":0.2825219572415087,"spread":0.2700166157550874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006375524,0.0007116375,0.0006453807,0.001028657,0.002002817,0.003493828,0.0009849342,0.0009672969,0.008137376],"category_scores_gemma":[0.003457752,0.0005767972,0.0008254475,0.00098887,0.001462615,0.002534849,0.001206519,0.00190852,0.001484259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008212896,"about_ca_system_score_gemma":0.0007318946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000733063,"about_ca_topic_score_gemma":0.001287748,"domain_scores_codex":[0.9991648,0.0002275918,0.00005973344,0.00013088,0.000233731,0.000183403],"domain_scores_gemma":[0.9971468,0.001306676,0.0005250088,0.0003558925,0.0003055957,0.0003599702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001028785,0.0003665131,0.001761724,0.0002236289,0.00005446188,0.001010452,0.001416455,0.006317957,0.01975863,0.9165276,0.01151421,0.04001958],"study_design_scores_gemma":[0.0001211868,0.0001422497,0.000883655,0.00003311894,0.00003042242,0.0007461442,0.0002802841,0.01896537,0.005034075,0.9630213,0.01070819,0.00003405103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8585911,0.0003879678,0.07593228,0.001687573,0.0002365226,0.0001662361,0.0008231385,0.0004146151,0.06176061],"genre_scores_gemma":[0.9546766,0.0002922558,0.02307619,0.0002955441,0.0002856181,0.0001524661,0.0009476266,0.000158741,0.0201149],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008137376,"threshold_uncertainty_score":0.02722222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006587062","doi":"10.1006/jctb.2001.2082","title":"Branch-Width and Well-Quasi-Ordering in Matroids and Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Bounded function; Combinatorics; Mathematics; Class (philosophy); Graphic matroid; Discrete mathematics; Tree (set theory); Computer science; Mathematical analysis","authors":[{"name":"James F. Geelen","is_ca":true},{"name":"A.M.H. Gerards","is_ca":false},{"name":"Geoff Whittle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01045793543277344,"gpt":0.2442487909695447,"spread":0.2337908555367713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002809436,0.001019259,0.001612254,0.003242799,0.002541782,0.008045029,0.002316464,0.002258735,0.006433443],"category_scores_gemma":[0.01141954,0.001596011,0.001028446,0.005212477,0.005426385,0.01959509,0.001937341,0.004855806,0.000591743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001758769,"about_ca_system_score_gemma":0.0009320297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001278194,"about_ca_topic_score_gemma":0.002283999,"domain_scores_codex":[0.9988065,0.0004204506,0.0001031035,0.0002535628,0.0002255619,0.0001909385],"domain_scores_gemma":[0.9812399,0.01266543,0.002367487,0.001032741,0.0008835479,0.001810873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001529174,0.00009830687,0.002238062,0.00009958204,0.00001885464,0.00009318272,0.0006619357,0.002922913,0.001203623,0.9815981,0.001347252,0.009565394],"study_design_scores_gemma":[0.0000185102,0.0000157437,0.000496823,0.00001428934,0.0000121944,0.00007713622,0.0001777977,0.005738589,0.0002229169,0.992585,0.0006315815,0.000009483037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7946011,0.004547735,0.160124,0.005379171,0.0002354747,0.00006848399,0.0009044652,0.0003057194,0.03383383],"genre_scores_gemma":[0.9527394,0.002409143,0.03436003,0.0003991278,0.000643298,0.00009444157,0.0006437785,0.0001329222,0.008577941],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008045029,"threshold_uncertainty_score":0.02152205,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001832592,0.0008621325,0.00152593,0.002405345,0.001891585,0.004808766,0.002689963,0.002306818,0.007530024],"category_scores_gemma":[0.01594699,0.001344291,0.0009119296,0.00227122,0.002206902,0.007633539,0.00164208,0.00135044,0.00049821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00170502,"about_ca_system_score_gemma":0.0007601242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001095957,"about_ca_topic_score_gemma":0.001352613,"domain_scores_codex":[0.9988667,0.0003544766,0.00008440178,0.0002611208,0.0002192534,0.0002141262],"domain_scores_gemma":[0.9697706,0.0230653,0.002734127,0.001227822,0.001088745,0.002113414],"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.004799266,0.0003754825,0.0275189,0.001475384,0.00049175,0.001501613,0.002172358,0.08631935,0.05973198,0.7630286,0.0161451,0.03644018],"study_design_scores_gemma":[0.0003042957,0.0002190583,0.01149085,0.0001967626,0.0002993921,0.001663086,0.001017088,0.1377573,0.01782587,0.8240849,0.005038382,0.0001029384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9625665,0.0007869409,0.0157095,0.001410122,0.00005204232,0.00004699475,0.002021665,0.0002170008,0.01718917],"genre_scores_gemma":[0.9842767,0.0005268183,0.00988875,0.0002524481,0.0001239159,0.0001135019,0.001399581,0.0001806178,0.003237709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007530024,"threshold_uncertainty_score":0.02519047,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003608832,0.002012277,0.002415742,0.006439905,0.003321697,0.005911862,0.003484608,0.002417747,0.0169584],"category_scores_gemma":[0.02264337,0.001263319,0.001578656,0.004233798,0.005080671,0.01073103,0.00548534,0.008184236,0.002917893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002809472,"about_ca_system_score_gemma":0.0009942988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009995527,"about_ca_topic_score_gemma":0.001155186,"domain_scores_codex":[0.9970094,0.0008071074,0.0001210331,0.0004882411,0.00115104,0.0004230867],"domain_scores_gemma":[0.9750606,0.01862181,0.001150949,0.001662993,0.001664871,0.001838787],"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.00004903131,0.00005564958,0.0002738006,0.00005920241,0.00001857224,0.00003984724,0.000218152,0.002878243,0.0006185753,0.9870878,0.004324193,0.004376808],"study_design_scores_gemma":[0.000008706191,0.000006264157,0.0001548309,0.00001711147,0.00001089867,0.00003283148,0.00003674371,0.01285211,0.0001927794,0.9856508,0.001024012,0.00001300666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2203521,0.005532362,0.4215416,0.01163709,0.00129499,0.0001437643,0.0008774755,0.00106846,0.3375522],"genre_scores_gemma":[0.9056262,0.002943875,0.03892176,0.001849418,0.002882871,0.000484709,0.0008112519,0.0006839405,0.04579605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0169584,"threshold_uncertainty_score":0.05673152,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003012458,0.0007492783,0.0006320902,0.002475592,0.002076009,0.003498854,0.0007773145,0.0009159344,0.02913587],"category_scores_gemma":[0.001401443,0.0004293185,0.0005562354,0.001604188,0.001513887,0.003891616,0.00167429,0.003389101,0.005533259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001261737,"about_ca_system_score_gemma":0.0006610214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001169587,"about_ca_topic_score_gemma":0.001235272,"domain_scores_codex":[0.9996498,0.00006057644,0.00001708826,0.00009868356,0.0001201826,0.00005364662],"domain_scores_gemma":[0.9993405,0.0001255723,0.00006577671,0.0001117687,0.0002003099,0.0001561713],"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.000005671609,0.000007945292,0.00004829082,0.000009711001,0.000003652582,0.00002323546,0.00006740501,0.00007001135,0.0002691807,0.9909778,0.004013575,0.004503458],"study_design_scores_gemma":[0.000007453784,0.000007433092,0.0001809326,0.000007781727,0.000007631222,0.0001266366,0.00007417608,0.0005938704,0.0004301353,0.9696537,0.0289034,0.000006867468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.08398502,0.001922434,0.03773621,0.004019676,0.002881939,0.00006618677,0.0005456755,0.0006077102,0.8682352],"genre_scores_gemma":[0.5601858,0.002443744,0.01706125,0.001488469,0.002424449,0.0001047145,0.0009343412,0.0005407697,0.4148164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02913587,"threshold_uncertainty_score":0.09746915,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002076511,0.0008011364,0.001647745,0.001143841,0.003284363,0.003501581,0.002185413,0.002457249,0.01006967],"category_scores_gemma":[0.007771431,0.0004897096,0.001191469,0.001391239,0.005944092,0.007000951,0.003550371,0.004955153,0.00140574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001684472,"about_ca_system_score_gemma":0.001116898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002893849,"about_ca_topic_score_gemma":0.002311507,"domain_scores_codex":[0.9986444,0.0003767726,0.00005288546,0.0003038224,0.0002483096,0.0003738559],"domain_scores_gemma":[0.9961061,0.001897569,0.0002961009,0.0008776887,0.0004015015,0.000420949],"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.0001344268,0.0000304032,0.0004986015,0.00003073941,0.000008438848,0.0001523316,0.0002009846,0.0008934843,0.0003858568,0.9894174,0.00501352,0.003233734],"study_design_scores_gemma":[0.0000243497,0.000007695785,0.0001261251,0.000005717904,0.000003924922,0.00004962084,0.00004672907,0.001868642,0.000108866,0.9963444,0.001406399,0.000007441163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5869464,0.001389436,0.08940339,0.02742907,0.00328116,0.000113474,0.0009049089,0.0006789293,0.2898532],"genre_scores_gemma":[0.9690634,0.0003834602,0.00851631,0.00184216,0.001016786,0.0000556895,0.0004682315,0.0001103273,0.01854356],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01006967,"threshold_uncertainty_score":0.0336864,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006939989,0.0004843188,0.0006778758,0.001750324,0.002891783,0.003071895,0.0008952594,0.001365984,0.0217627],"category_scores_gemma":[0.002168269,0.0004653337,0.0007683251,0.00109908,0.003366758,0.006146409,0.002772448,0.003060008,0.002908354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001383626,"about_ca_system_score_gemma":0.0007378433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005605339,"about_ca_topic_score_gemma":0.0003743707,"domain_scores_codex":[0.9992353,0.0001680787,0.00003468545,0.0001729265,0.0002413006,0.000147771],"domain_scores_gemma":[0.9991764,0.0002174795,0.00006378959,0.0001905635,0.0001804828,0.0001712144],"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.000004052555,0.000007848977,0.00001880607,0.000004917219,0.000001490167,0.000007514228,0.00004486294,0.00003800362,0.0001257965,0.997449,0.0007527609,0.001544925],"study_design_scores_gemma":[0.000005650132,0.000004857224,0.00006222852,0.000004189641,0.000002685803,0.00004819919,0.00003726851,0.000547416,0.0002540606,0.9930085,0.006019323,0.000005687434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1641388,0.001563311,0.1398781,0.008883689,0.002992767,0.0001550558,0.0004618494,0.0006600147,0.6812664],"genre_scores_gemma":[0.831929,0.001061245,0.02304045,0.001776628,0.001736201,0.0001534434,0.0003539083,0.0003686777,0.1395804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0217627,"threshold_uncertainty_score":0.0728035,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004208835,0.0006670255,0.0007588215,0.001438338,0.00134603,0.002466217,0.0009259767,0.0009164739,0.01653718],"category_scores_gemma":[0.00218985,0.0006157373,0.0005744798,0.0009403111,0.002054163,0.002637292,0.001425337,0.001953985,0.002136524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007578409,"about_ca_system_score_gemma":0.0004999904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001015504,"about_ca_topic_score_gemma":0.001501449,"domain_scores_codex":[0.9994916,0.0001482447,0.00002063893,0.0001380729,0.0001377299,0.00006379254],"domain_scores_gemma":[0.9989874,0.0003289421,0.0001346116,0.0001441878,0.0002026426,0.0002022146],"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.00002046546,0.00001139454,0.0001427532,0.00001836887,0.000006168312,0.00003757373,0.0001180926,0.0002716866,0.0007697731,0.9908732,0.002786838,0.00494363],"study_design_scores_gemma":[0.000009671777,0.000008086715,0.0002339655,0.000004264778,0.000005140773,0.00008621824,0.00006320158,0.001304596,0.0003912631,0.9939668,0.003920303,0.000006410413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4510534,0.001085115,0.1188447,0.004507506,0.001680038,0.000112708,0.0007564361,0.0006983109,0.4212618],"genre_scores_gemma":[0.8845121,0.0005473865,0.02217216,0.0009435748,0.0008720547,0.00007030275,0.0005144884,0.0004123765,0.08995555],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01653718,"threshold_uncertainty_score":0.05532241,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002167997,0.001101635,0.00308069,0.003834395,0.003379072,0.004467277,0.002840301,0.003774293,0.0140975],"category_scores_gemma":[0.01952962,0.0017406,0.001479895,0.003169431,0.004133927,0.007740312,0.003125045,0.003434815,0.001704815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001458944,"about_ca_system_score_gemma":0.0009412738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002403682,"about_ca_topic_score_gemma":0.002895334,"domain_scores_codex":[0.9974124,0.00111155,0.00009313178,0.0005129141,0.0004836761,0.0003864036],"domain_scores_gemma":[0.9787086,0.01494321,0.001718485,0.001847506,0.000799266,0.001982922],"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.0001803326,0.00009922913,0.0008545773,0.0001506721,0.00005617782,0.0003783224,0.0004757367,0.02518841,0.001202033,0.9555551,0.008449584,0.007409831],"study_design_scores_gemma":[0.00006965754,0.00003817173,0.0006328094,0.00004768906,0.00004940632,0.0003429739,0.0002105798,0.1144389,0.0006265712,0.8799093,0.003592591,0.00004127085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6336055,0.001821959,0.2932134,0.009036086,0.0003735989,0.0003007069,0.001262003,0.0009758963,0.059411],"genre_scores_gemma":[0.9113573,0.001068636,0.04363501,0.0009168173,0.0005005918,0.0003091055,0.0007224867,0.0005743926,0.04091556],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0140975,"threshold_uncertainty_score":0.04716086,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005277731,0.0006794229,0.0007882846,0.001733516,0.002741535,0.003583948,0.001398116,0.001213596,0.005537273],"category_scores_gemma":[0.002211998,0.0008044741,0.0005228898,0.001508623,0.002443664,0.004261459,0.001806543,0.001858874,0.000766589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007624149,"about_ca_system_score_gemma":0.0005094592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001097956,"about_ca_topic_score_gemma":0.002226622,"domain_scores_codex":[0.9995711,0.00007300042,0.00002486298,0.00009560239,0.00009880575,0.0001366151],"domain_scores_gemma":[0.9983347,0.0007152141,0.0002628932,0.0002203563,0.0001317216,0.000335119],"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.0003644282,0.0001050068,0.002826079,0.000110621,0.00001790739,0.0005492389,0.001288737,0.002025103,0.006342941,0.9725046,0.001704919,0.01216039],"study_design_scores_gemma":[0.00004150652,0.00002086088,0.0007563204,0.00002251165,0.00002960597,0.0001605653,0.0004435749,0.003370616,0.00196327,0.9911262,0.002049523,0.00001529838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9206589,0.0003156023,0.03765469,0.0006074462,0.0001417111,0.00005493495,0.0003425309,0.0003332341,0.0398909],"genre_scores_gemma":[0.9829113,0.0002204494,0.008194036,0.0001711873,0.00004991375,0.0000416456,0.000290171,0.000120558,0.008000749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005537273,"threshold_uncertainty_score":0.01852399,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008772479,0.0006720207,0.0009768608,0.002226989,0.002614894,0.005419135,0.001545685,0.001833187,0.01211202],"category_scores_gemma":[0.007719834,0.001416565,0.001001951,0.00226828,0.004061759,0.008276911,0.003229302,0.003308323,0.00137507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001120034,"about_ca_system_score_gemma":0.0005398407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008145859,"about_ca_topic_score_gemma":0.001174342,"domain_scores_codex":[0.9991488,0.0001727407,0.00005383047,0.0002379841,0.0001740092,0.000212532],"domain_scores_gemma":[0.9932016,0.003381644,0.0006874992,0.001103907,0.0005875442,0.001037914],"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.0001302953,0.00003204894,0.0009152377,0.00005440609,0.000009384294,0.0001121899,0.0004572476,0.0010986,0.002594481,0.984277,0.002290379,0.008028749],"study_design_scores_gemma":[0.00002226814,0.0000234372,0.0005798713,0.00002649529,0.00002162163,0.0003092258,0.0004778923,0.003750485,0.001187331,0.9895732,0.004013843,0.00001433101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6955185,0.001916605,0.2105941,0.002514148,0.0003743623,0.0001198724,0.0006356631,0.0005326292,0.08779422],"genre_scores_gemma":[0.9324872,0.001296839,0.03428107,0.0004652734,0.000342433,0.000140111,0.0007611278,0.0004118487,0.02981406],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01211202,"threshold_uncertainty_score":0.04051876,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001340921,0.001182542,0.001096347,0.002124699,0.002382113,0.005287708,0.001977287,0.001932843,0.01074536],"category_scores_gemma":[0.008572548,0.001150648,0.001279896,0.001624522,0.003183936,0.005286136,0.002055404,0.003249583,0.001464699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001334339,"about_ca_system_score_gemma":0.0006988492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001525568,"about_ca_topic_score_gemma":0.002081115,"domain_scores_codex":[0.9991404,0.0002722786,0.0000604814,0.0001620868,0.0002066075,0.0001581093],"domain_scores_gemma":[0.9930506,0.003992796,0.0009667387,0.000420318,0.0005461012,0.001023563],"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.0003616938,0.0001212021,0.001842514,0.0001200383,0.00003199408,0.0002664771,0.0009685393,0.003443518,0.003339756,0.9722853,0.005335834,0.01188312],"study_design_scores_gemma":[0.00004911911,0.00004472601,0.0007915946,0.00002912287,0.00001693036,0.0002905498,0.0002536411,0.01329045,0.0005941488,0.981437,0.003180462,0.00002238265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8024231,0.001269087,0.1272911,0.002890617,0.0003012043,0.000164897,0.001154452,0.0003574217,0.06414804],"genre_scores_gemma":[0.9420015,0.0009407147,0.0322346,0.0004831286,0.00065549,0.0001719621,0.001379189,0.0002681788,0.02186526],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01074536,"threshold_uncertainty_score":0.03594679,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000826571,0.0008126856,0.001140116,0.002940617,0.00206533,0.004075993,0.002172391,0.00178959,0.009426818],"category_scores_gemma":[0.008403301,0.0008320184,0.001307579,0.00251358,0.002710608,0.005623784,0.004906418,0.003995176,0.00118316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001421113,"about_ca_system_score_gemma":0.0006109093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001126614,"about_ca_topic_score_gemma":0.001292602,"domain_scores_codex":[0.9990915,0.0002320382,0.000053997,0.0002644557,0.0001917437,0.0001663187],"domain_scores_gemma":[0.9941418,0.003025695,0.0006331734,0.0005122918,0.0005378683,0.00114914],"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.00007531887,0.00005306597,0.00074044,0.00005887057,0.0000135142,0.00007365731,0.0004308675,0.002499567,0.001220122,0.9818602,0.002230285,0.01074412],"study_design_scores_gemma":[0.00002045492,0.00001785414,0.0003730433,0.00002142897,0.00001761954,0.0001152355,0.0001663685,0.02172653,0.0006235513,0.9736727,0.003232407,0.00001276057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5094778,0.001036715,0.4218551,0.002178603,0.0002717401,0.0001214159,0.0005529247,0.0008998855,0.06360589],"genre_scores_gemma":[0.9017326,0.0007115336,0.0675502,0.000365532,0.0004251777,0.0001653754,0.0006115871,0.0004011755,0.02803696],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009426818,"threshold_uncertainty_score":0.03153592,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009134871,0.0008758524,0.001072,0.003329206,0.004057784,0.005501552,0.00151242,0.002447613,0.01258572],"category_scores_gemma":[0.004092594,0.0007360952,0.0008570942,0.001599836,0.004517746,0.007542182,0.00297468,0.00444843,0.001345159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002078616,"about_ca_system_score_gemma":0.0007819575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009258373,"about_ca_topic_score_gemma":0.001589634,"domain_scores_codex":[0.9989663,0.0002801424,0.00005031805,0.0002436188,0.0002677321,0.0001918298],"domain_scores_gemma":[0.9971245,0.001304105,0.0002747949,0.0003104033,0.0004587139,0.0005274279],"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.000008938594,0.00001109205,0.00005673261,0.000007066918,0.000002104004,0.00002606085,0.0001065864,0.00007089609,0.0001924127,0.9979939,0.000621123,0.0009031135],"study_design_scores_gemma":[0.000007758979,0.000006146504,0.0000898814,0.000008835953,0.00000470329,0.00008085805,0.00007296757,0.0006612903,0.0002448474,0.9961252,0.002690533,0.000006945407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4393655,0.002149847,0.0925133,0.00790122,0.001744962,0.0001095663,0.0005526758,0.0008386032,0.4548244],"genre_scores_gemma":[0.8710683,0.0007995334,0.01810863,0.001261132,0.001055934,0.0001350075,0.0004676673,0.000275062,0.1068288],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01258572,"threshold_uncertainty_score":0.04210347,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001479391,0.0009987772,0.001195976,0.004382578,0.00266239,0.004728055,0.002237635,0.001710334,0.008439316],"category_scores_gemma":[0.01140368,0.0009925914,0.0009500938,0.004193914,0.002844912,0.007421622,0.003282958,0.002937023,0.001075296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001528959,"about_ca_system_score_gemma":0.000669913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007731267,"about_ca_topic_score_gemma":0.000697908,"domain_scores_codex":[0.9984487,0.0004678197,0.0001118393,0.0004189176,0.0003339267,0.0002186116],"domain_scores_gemma":[0.9866665,0.008121063,0.001528105,0.0009428759,0.001363066,0.001378361],"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.000168016,0.0001146853,0.003134468,0.0001390043,0.00002185066,0.0001547219,0.0005767756,0.002946573,0.005510039,0.9689078,0.004116909,0.01420914],"study_design_scores_gemma":[0.00002076533,0.00005650802,0.001415617,0.00005771482,0.00002878937,0.0004178664,0.0003824593,0.03315846,0.001770432,0.9567526,0.005913648,0.00002510783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5770623,0.0006941644,0.3455781,0.003338882,0.0001529622,0.0002356928,0.002217733,0.0005271831,0.07019293],"genre_scores_gemma":[0.9300704,0.0008648576,0.04653779,0.000855656,0.0004936797,0.0003415481,0.003115188,0.0003602017,0.01736069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008439316,"threshold_uncertainty_score":0.02823228,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002278429,0.0006324089,0.0007306294,0.0022896,0.001182546,0.002701106,0.0005554347,0.0009238163,0.01159442],"category_scores_gemma":[0.002267347,0.0005786424,0.0005494268,0.002340088,0.001033309,0.002668429,0.001610196,0.001578003,0.001756583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007692204,"about_ca_system_score_gemma":0.0002634909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005551504,"about_ca_topic_score_gemma":0.0005387135,"domain_scores_codex":[0.9995422,0.0001305875,0.00002056084,0.00009095016,0.0001331547,0.00008250285],"domain_scores_gemma":[0.9985332,0.0006915706,0.00017682,0.0002209247,0.0001934506,0.0001840823],"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.00002700417,0.00002072878,0.0002475976,0.00003905816,0.000009453735,0.00005829048,0.0001706093,0.002524757,0.001321767,0.9717106,0.006743165,0.01712696],"study_design_scores_gemma":[0.000007372906,0.00001502178,0.0003030305,0.00001776197,0.000009952222,0.0001668898,0.0000966356,0.0105859,0.0006990997,0.974861,0.01322718,0.00001009708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4025995,0.003626497,0.1970233,0.00498356,0.001624787,0.000110924,0.0009464927,0.001160923,0.3879241],"genre_scores_gemma":[0.898492,0.002321339,0.02776414,0.0009662249,0.001150158,0.0001245865,0.0008082579,0.0003142131,0.06805904],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01159442,"threshold_uncertainty_score":0.03878719,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006395497,0.0006402654,0.0007342565,0.00264114,0.001386148,0.002489324,0.0008602857,0.001286965,0.004884525],"category_scores_gemma":[0.003779105,0.0004964879,0.0003733627,0.0008935669,0.002076559,0.001870653,0.001308149,0.001420871,0.00057262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000600569,"about_ca_system_score_gemma":0.000266468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003279762,"about_ca_topic_score_gemma":0.0005727584,"domain_scores_codex":[0.999498,0.0001404085,0.0000220895,0.00007597139,0.0001661856,0.00009733527],"domain_scores_gemma":[0.9979353,0.0008639139,0.0003185788,0.0001791778,0.0002314759,0.0004714988],"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.000130493,0.0000882263,0.00118942,0.00004857639,0.00001969218,0.0003350424,0.0004823895,0.005175502,0.007658267,0.9758502,0.002327307,0.006695039],"study_design_scores_gemma":[0.00002550226,0.00001915872,0.0007756457,0.000009819983,0.000005713248,0.0001957803,0.0001798712,0.01880467,0.0006792186,0.978624,0.0006651403,0.00001541818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9012108,0.0003488839,0.06288882,0.0009268721,0.0002472379,0.00003397809,0.00009284553,0.0003086551,0.03394194],"genre_scores_gemma":[0.9885342,0.0001589527,0.00566518,0.0001154215,0.0001706243,0.00003698224,0.0000656412,0.00006926847,0.005183795],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004884525,"threshold_uncertainty_score":0.01634032,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009566165,0.0007750002,0.001372253,0.003163942,0.003360688,0.005710521,0.001489248,0.002296958,0.01374546],"category_scores_gemma":[0.004307193,0.001073386,0.001324853,0.002200775,0.003311343,0.004921597,0.004665513,0.005842752,0.001619328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001677285,"about_ca_system_score_gemma":0.0006991915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001256245,"about_ca_topic_score_gemma":0.001820782,"domain_scores_codex":[0.9989445,0.000254005,0.00005377831,0.0001250652,0.0003265398,0.0002960793],"domain_scores_gemma":[0.9967686,0.001197175,0.000433976,0.0002980416,0.0002376519,0.00106466],"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.00005340909,0.00005772631,0.0003765875,0.00002564868,0.000007545862,0.0001154646,0.0002795574,0.0009148052,0.0007088747,0.9932705,0.001810636,0.002379149],"study_design_scores_gemma":[0.00002585957,0.00001056228,0.0002689964,0.00001110678,0.000007144528,0.00009314912,0.0001251295,0.004452826,0.0002340648,0.9928638,0.001899618,0.000007731601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7858309,0.000618477,0.06288835,0.003730516,0.0003814233,0.0001047618,0.0004558916,0.0005222323,0.1454674],"genre_scores_gemma":[0.9518219,0.0005905347,0.01461919,0.0003692088,0.0004305651,0.00008473205,0.0006620288,0.0002526601,0.03116906],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01374546,"threshold_uncertainty_score":0.04598314,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000682551,0.0003591656,0.0005786193,0.001821758,0.001712814,0.002856394,0.0008438564,0.001069117,0.007426956],"category_scores_gemma":[0.003953052,0.000419479,0.0004480469,0.001088948,0.002482292,0.003064939,0.001142932,0.001579765,0.0004491703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001069471,"about_ca_system_score_gemma":0.0007347217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001992106,"about_ca_topic_score_gemma":0.003425804,"domain_scores_codex":[0.9996202,0.00009675998,0.00001871711,0.00007308606,0.0001037754,0.00008740653],"domain_scores_gemma":[0.9982271,0.0008773438,0.0002681716,0.0001550543,0.0002017466,0.000270573],"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.00001451575,0.00001106108,0.0001919309,0.0000089593,0.00000172704,0.00002465656,0.00009307802,0.0004541305,0.0003005572,0.9966198,0.0005784578,0.001701124],"study_design_scores_gemma":[0.00001120665,0.000007233475,0.0003600484,0.000006739473,0.000002616899,0.00005686921,0.00007620028,0.002863869,0.0001768212,0.9954661,0.0009614846,0.00001078461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7928504,0.001377312,0.04910783,0.002524306,0.0004762789,0.00005346653,0.0003273358,0.0002162233,0.1530668],"genre_scores_gemma":[0.9784673,0.0004087029,0.005535972,0.0002887043,0.0002357349,0.00003499609,0.0001205582,0.00004188715,0.01486612],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007426956,"threshold_uncertainty_score":0.0248456,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005352734,0.0003815173,0.001098732,0.001592075,0.001822997,0.003674741,0.0008016209,0.002035787,0.008931651],"category_scores_gemma":[0.002361208,0.0005461903,0.0004766983,0.001642288,0.003421002,0.004068068,0.001205342,0.002021619,0.0009270462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006663313,"about_ca_system_score_gemma":0.0004416302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007592472,"about_ca_topic_score_gemma":0.001127756,"domain_scores_codex":[0.9996768,0.00008861933,0.00002290956,0.00007374514,0.00008241895,0.00005551874],"domain_scores_gemma":[0.9991818,0.0003453168,0.000143342,0.0001287001,0.00007117115,0.0001295911],"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.00001315159,0.00001383464,0.0001087841,0.00003103981,0.000003448785,0.00002329341,0.0001139649,0.0012332,0.0002807559,0.9917699,0.002201109,0.004207481],"study_design_scores_gemma":[0.000003896372,0.000002881192,0.00005228982,0.00000456517,0.00000132115,0.00002013846,0.00003332503,0.001228388,0.00003740023,0.9967424,0.001870364,0.000003083207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5292302,0.03350824,0.167963,0.01374634,0.00464875,0.0001018089,0.0007368478,0.0004994118,0.2495655],"genre_scores_gemma":[0.9309012,0.007406789,0.01760262,0.00121529,0.00277844,0.000108403,0.0003736061,0.0001067281,0.03950686],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008931651,"threshold_uncertainty_score":0.02987927,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002913711,0.0008601029,0.00270635,0.002315503,0.00679569,0.005534068,0.002870978,0.006861204,0.02350541],"category_scores_gemma":[0.02110976,0.00115051,0.001931839,0.003336328,0.01091115,0.02184025,0.006125321,0.00903349,0.003226762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002717882,"about_ca_system_score_gemma":0.001232845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002632482,"about_ca_topic_score_gemma":0.001749187,"domain_scores_codex":[0.9979604,0.0005251041,0.0001015029,0.0005978752,0.0003637359,0.0004513696],"domain_scores_gemma":[0.9890727,0.007614699,0.0007172088,0.001248266,0.0007578772,0.0005891814],"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.00009374405,0.00002714058,0.000211472,0.00005847083,0.00000796017,0.00005714338,0.0003363036,0.0003704383,0.0001756866,0.9866396,0.009376123,0.002645903],"study_design_scores_gemma":[0.00003737436,0.000009329156,0.0001097153,0.00001987968,0.000009603014,0.00004078952,0.0001207976,0.0006754474,0.00008927307,0.9942269,0.004648197,0.00001263951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3670921,0.004293775,0.09565188,0.150806,0.006326559,0.000164322,0.001566972,0.0009442243,0.3731543],"genre_scores_gemma":[0.9215782,0.001929164,0.01674215,0.009422974,0.003751726,0.0001819119,0.001220905,0.0003987162,0.0447742],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02350541,"threshold_uncertainty_score":0.07863349,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002611961,0.0008773232,0.001385573,0.004297727,0.00281726,0.006644527,0.002691235,0.001806016,0.01030337],"category_scores_gemma":[0.03216686,0.001009431,0.001065619,0.00196981,0.002720558,0.005954421,0.002545876,0.002836179,0.0008537682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00297292,"about_ca_system_score_gemma":0.0008560095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001941405,"about_ca_topic_score_gemma":0.0018693,"domain_scores_codex":[0.9985668,0.0003481769,0.00006477299,0.0002467025,0.0003816841,0.0003919529],"domain_scores_gemma":[0.9686177,0.01945677,0.00270784,0.001774379,0.002738743,0.004704501],"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.0004917885,0.0001466639,0.01066658,0.0001913092,0.00004914884,0.0002406975,0.001300484,0.01772597,0.008106807,0.9306289,0.01075274,0.01969893],"study_design_scores_gemma":[0.00007978146,0.00007576918,0.005766363,0.00006703949,0.00004626331,0.0008812986,0.0005014589,0.1672636,0.003653303,0.816331,0.005278861,0.00005522033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9290145,0.0009085584,0.04208681,0.002536584,0.0001348772,0.00008344858,0.00126719,0.0004983387,0.02346972],"genre_scores_gemma":[0.978434,0.0008124652,0.009661959,0.0001621348,0.0002997736,0.0001272622,0.001159182,0.0002710668,0.009072104],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01030337,"threshold_uncertainty_score":0.03446823,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001542736,0.000656027,0.001941835,0.003964047,0.002672855,0.004741627,0.002727297,0.002105783,0.004153819],"category_scores_gemma":[0.01568372,0.002003514,0.001169534,0.002533596,0.005095052,0.006343188,0.003115038,0.003284363,0.0004572688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001206416,"about_ca_system_score_gemma":0.0006143932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005187275,"about_ca_topic_score_gemma":0.0007403443,"domain_scores_codex":[0.9989839,0.0002935314,0.00005137681,0.0002165663,0.0002985337,0.0001561368],"domain_scores_gemma":[0.9780152,0.01653861,0.001884987,0.001246698,0.0007491525,0.001565274],"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.000127669,0.00009641785,0.002228332,0.0001164936,0.00004442882,0.0003002407,0.0007347946,0.009115201,0.002232262,0.9776099,0.001967218,0.005427098],"study_design_scores_gemma":[0.00003320858,0.0000167627,0.0008967873,0.00002244251,0.00003114218,0.0003442179,0.0001865833,0.018987,0.0007366764,0.9781308,0.0005967051,0.00001772331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9043093,0.001088744,0.06606505,0.001635824,0.0001276788,0.00005174625,0.0002718041,0.0003652992,0.0260846],"genre_scores_gemma":[0.9834709,0.0004503733,0.01123145,0.0001961427,0.0001943154,0.0001059488,0.0002114714,0.0001057929,0.004033728],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004741627,"threshold_uncertainty_score":0.01389593,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001413557,0.0006897903,0.001052195,0.001434822,0.00167073,0.003829685,0.001911788,0.00287422,0.007628654],"category_scores_gemma":[0.01302893,0.001017415,0.000841559,0.001246203,0.002578736,0.005185407,0.001944835,0.002199729,0.0006877748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001351658,"about_ca_system_score_gemma":0.0007085183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001091789,"about_ca_topic_score_gemma":0.00177645,"domain_scores_codex":[0.9986264,0.0003849586,0.00007304663,0.0003020526,0.0002082936,0.0004052107],"domain_scores_gemma":[0.9799879,0.013732,0.001524555,0.002110306,0.0009113402,0.001733971],"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.001034924,0.0001927611,0.006382677,0.0002972276,0.00009263751,0.00115225,0.0007788286,0.0382226,0.02590752,0.8912535,0.01066379,0.02402133],"study_design_scores_gemma":[0.0001060591,0.00005856744,0.002025479,0.00004464295,0.000057172,0.001051069,0.0003125678,0.07899788,0.005601724,0.9085528,0.003146146,0.000045922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8437883,0.0006149602,0.103121,0.003097471,0.0002362624,0.00008979731,0.000610539,0.0008721912,0.04756959],"genre_scores_gemma":[0.9763004,0.0002429016,0.01634442,0.0003481688,0.0001431243,0.00005804679,0.0002633814,0.0001715244,0.006128037],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007628654,"threshold_uncertainty_score":0.02552038,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001816733,0.0007940332,0.0004749136,0.0007505986,0.001251878,0.002197979,0.0009613557,0.0009023924,0.07311764],"category_scores_gemma":[0.001825931,0.0003733791,0.0006888634,0.001259829,0.0007616237,0.002702668,0.001469074,0.001772303,0.0266673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007771494,"about_ca_system_score_gemma":0.0008752158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002930128,"about_ca_topic_score_gemma":0.004031664,"domain_scores_codex":[0.9997146,0.00004002629,0.0000179478,0.00007251703,0.00008790081,0.00006694588],"domain_scores_gemma":[0.9990785,0.0002855492,0.0001001815,0.0002402431,0.0002167123,0.00007871534],"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.0005558661,0.0001676357,0.001058341,0.0006325021,0.00005093396,0.001374813,0.0005913443,0.004538069,0.02469347,0.5099541,0.256054,0.200329],"study_design_scores_gemma":[0.00009368846,0.0001034714,0.001718748,0.0001420156,0.00006018691,0.001495234,0.0003232238,0.01231486,0.03542347,0.3735144,0.5747514,0.00005912318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.08553199,0.0004649453,0.289151,0.005882296,0.001429455,0.0003847037,0.0120652,0.007599636,0.5974907],"genre_scores_gemma":[0.4281929,0.001225529,0.1866126,0.001738309,0.0004899622,0.0002992949,0.03224096,0.004575363,0.3446251],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.07311764,"threshold_uncertainty_score":0.2446029,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000983505,0.0007235149,0.0006555477,0.002967899,0.00138426,0.00303223,0.001966079,0.001128185,0.06797997],"category_scores_gemma":[0.01128915,0.0004809304,0.0006792552,0.002174015,0.001380211,0.004922978,0.001500854,0.002130817,0.0142675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001525452,"about_ca_system_score_gemma":0.0007818137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002102694,"about_ca_topic_score_gemma":0.002435534,"domain_scores_codex":[0.9992405,0.0001593953,0.00003817764,0.0001938989,0.0002613371,0.0001065786],"domain_scores_gemma":[0.9959123,0.002125199,0.0002751758,0.000529299,0.0008544527,0.0003035946],"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.0001005938,0.00006581919,0.001618698,0.0002623067,0.00002225787,0.0001070867,0.0003064239,0.003867791,0.001581754,0.8362569,0.1069839,0.04882652],"study_design_scores_gemma":[0.00002270606,0.00003137979,0.003271015,0.0001460023,0.000029315,0.0006832201,0.0002172956,0.03087248,0.003046143,0.8782838,0.08335227,0.00004433906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08757368,0.002836458,0.5347022,0.004629516,0.001156908,0.000268406,0.0159497,0.003451274,0.3494319],"genre_scores_gemma":[0.6612852,0.003856289,0.1742412,0.001162667,0.001387123,0.0006659231,0.0148257,0.004215797,0.1383601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06797997,"threshold_uncertainty_score":0.2274156,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001012202,0.0009386623,0.001139174,0.002002666,0.002201195,0.003233806,0.001586731,0.00187772,0.01223603],"category_scores_gemma":[0.002514808,0.0006633644,0.001121361,0.001087917,0.003619024,0.00349171,0.003403984,0.002584577,0.001192318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001001157,"about_ca_system_score_gemma":0.0005973644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001187521,"about_ca_topic_score_gemma":0.001877349,"domain_scores_codex":[0.9990997,0.0002088842,0.00003238674,0.0001977781,0.0002583024,0.0002029593],"domain_scores_gemma":[0.998916,0.0003076781,0.0001939201,0.0001964741,0.0001269052,0.0002590146],"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.00001058881,0.000005613077,0.00004631743,0.000009828173,0.00000440773,0.00001784594,0.00003214703,0.002582804,0.0002723117,0.9952474,0.0004208921,0.001349876],"study_design_scores_gemma":[0.000007392701,0.000009487349,0.0001408232,0.000009608561,0.000004256472,0.0000298778,0.00004142023,0.008219955,0.000111227,0.9899198,0.001496597,0.000009657159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3752714,0.001327882,0.3491455,0.001986086,0.0003560202,0.00007965076,0.000578328,0.0005519744,0.2707031],"genre_scores_gemma":[0.9482337,0.0005197368,0.02636558,0.000401155,0.0002727821,0.00007337016,0.0004574081,0.000242937,0.02343342],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01223603,"threshold_uncertainty_score":0.04093361,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002753716,0.002439203,0.002823566,0.005014075,0.002305162,0.00603291,0.005737581,0.004060955,0.01235472],"category_scores_gemma":[0.03934291,0.0025261,0.001991755,0.008595123,0.007373021,0.01269989,0.008316251,0.008526108,0.001815378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002802427,"about_ca_system_score_gemma":0.000998312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002796073,"about_ca_topic_score_gemma":0.003617185,"domain_scores_codex":[0.9974697,0.0007051366,0.0001069371,0.000675641,0.0007092446,0.0003333922],"domain_scores_gemma":[0.9273142,0.05879063,0.004074736,0.003962941,0.002268233,0.003589288],"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.0005182158,0.0004091223,0.003646676,0.0007255241,0.0001075252,0.0002891458,0.001014756,0.09314457,0.004805205,0.8284593,0.01381936,0.05306054],"study_design_scores_gemma":[0.00005152334,0.0000603306,0.0007370696,0.00009581654,0.00007713104,0.0002177272,0.0001635356,0.1370357,0.001020044,0.8576549,0.002842569,0.00004368124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2731594,0.009315908,0.6100021,0.006725225,0.0005373813,0.0002392926,0.001448137,0.001295696,0.09727675],"genre_scores_gemma":[0.8009513,0.008878523,0.1653474,0.0009949098,0.001841452,0.0004012654,0.001611369,0.0008673889,0.01910643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01235472,"threshold_uncertainty_score":0.04133058,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003194685,0.0008646873,0.001455244,0.001105162,0.001621821,0.004168207,0.001908626,0.001407152,0.03352894],"category_scores_gemma":[0.001637537,0.001522696,0.001049943,0.002001188,0.001490937,0.003365664,0.001751163,0.00282109,0.00400964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001437714,"about_ca_system_score_gemma":0.0007069628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001484213,"about_ca_topic_score_gemma":0.003258473,"domain_scores_codex":[0.9994245,0.00005611702,0.00004335639,0.0001766406,0.0001547992,0.0001446825],"domain_scores_gemma":[0.9979759,0.001028061,0.0003780438,0.0002093223,0.0001299899,0.0002786117],"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.001747378,0.0005016563,0.008823639,0.001229845,0.0002343553,0.002836104,0.002101134,0.01221038,0.04289496,0.8450538,0.01644288,0.06592384],"study_design_scores_gemma":[0.0006595769,0.0003026605,0.0165888,0.0001668246,0.000530776,0.003544325,0.001915725,0.02392605,0.02660338,0.8965342,0.02903216,0.0001954967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8029773,0.0007390592,0.03621315,0.001337469,0.0001447781,0.0001776801,0.002710706,0.001605878,0.154094],"genre_scores_gemma":[0.9431272,0.0005377575,0.01256215,0.0003489329,0.00008899524,0.0001628103,0.003045034,0.0003788953,0.03974817],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03352894,"threshold_uncertainty_score":0.1121655,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002134718,0.001408734,0.002243496,0.003566235,0.00438987,0.009320661,0.004729738,0.00638387,0.04711699],"category_scores_gemma":[0.03084846,0.001684013,0.001019273,0.002472166,0.004560463,0.02345156,0.00313278,0.007969169,0.008019505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003600001,"about_ca_system_score_gemma":0.001945562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001745936,"about_ca_topic_score_gemma":0.00257971,"domain_scores_codex":[0.9969178,0.000738647,0.0001019523,0.0008636828,0.0008171976,0.0005606675],"domain_scores_gemma":[0.9798023,0.01176657,0.001334475,0.003877942,0.002111146,0.001107496],"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.00008088207,0.0000659633,0.0007809828,0.000210856,0.00001883243,0.00004397574,0.0002298916,0.001326112,0.001541925,0.9697672,0.01004052,0.01589298],"study_design_scores_gemma":[0.00002462888,0.00001498392,0.0007691552,0.00006361386,0.00002499136,0.0002323572,0.0001386515,0.006037301,0.001039854,0.9834949,0.008127223,0.00003220122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2537272,0.004914282,0.1816812,0.02552501,0.002658656,0.000207648,0.002337658,0.009310057,0.5196382],"genre_scores_gemma":[0.8601348,0.001832274,0.02558041,0.004379681,0.001875106,0.0004157555,0.001295546,0.001633919,0.1028526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04711699,"threshold_uncertainty_score":0.157622,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009843755,0.0003872736,0.001120969,0.00219124,0.003009503,0.005121435,0.001063671,0.00118987,0.005263398],"category_scores_gemma":[0.003313092,0.0005938018,0.0009282182,0.001924738,0.002891375,0.005996545,0.003489466,0.001990927,0.0003781963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001441724,"about_ca_system_score_gemma":0.0004909915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001073484,"about_ca_topic_score_gemma":0.001000274,"domain_scores_codex":[0.9989827,0.0002293619,0.00006578459,0.0001813992,0.0002475301,0.0002931453],"domain_scores_gemma":[0.9975086,0.0007612158,0.0003616813,0.0004261736,0.000255939,0.0006862598],"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.00005247628,0.00003261591,0.0003889774,0.00001880889,0.000007573752,0.0001254233,0.0007211049,0.0003374311,0.001351902,0.9942365,0.0005314384,0.002195747],"study_design_scores_gemma":[0.00002785254,0.0000319965,0.0007248005,0.00001507593,0.0000120016,0.0002329069,0.0006095512,0.003591929,0.0008046959,0.991399,0.002533064,0.00001699331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9139781,0.0003253729,0.05133682,0.001154137,0.0001608619,0.00004740516,0.0002706276,0.0002650718,0.03246167],"genre_scores_gemma":[0.9849609,0.0002014339,0.007124472,0.0001768066,0.0002068811,0.00005434927,0.0002985671,0.00008908023,0.006887586],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005263398,"threshold_uncertainty_score":0.01760781,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004129327,0.0004189785,0.0007450113,0.001555422,0.001347406,0.002956403,0.0007477426,0.0009648564,0.006244957],"category_scores_gemma":[0.002683938,0.0006280862,0.0005679779,0.001815211,0.001915838,0.00367657,0.001243656,0.001786564,0.0006337125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006892364,"about_ca_system_score_gemma":0.0003282449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001176395,"about_ca_topic_score_gemma":0.001939079,"domain_scores_codex":[0.9997322,0.00007844959,0.00002047606,0.00006174084,0.00006146853,0.00004564548],"domain_scores_gemma":[0.9978928,0.001025905,0.000404165,0.0001885015,0.0001442346,0.0003443999],"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.00008403602,0.00003941537,0.00109295,0.00008121524,0.00001379671,0.000150954,0.0004343018,0.005846934,0.001127408,0.9757447,0.002940194,0.01244406],"study_design_scores_gemma":[0.00001696432,0.0000145536,0.000362297,0.00001464573,0.000008924556,0.0001435286,0.0001491228,0.00981289,0.0001906853,0.9868063,0.002472751,0.000007276699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7337366,0.003426641,0.2005436,0.002301642,0.0003413426,0.00007715245,0.0005825575,0.0004261716,0.05856447],"genre_scores_gemma":[0.9352533,0.001796585,0.04094493,0.0002443891,0.0003177564,0.0000742472,0.0004851063,0.0001091539,0.02077458],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006244957,"threshold_uncertainty_score":0.02089149,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000665987,0.0005954862,0.0006692606,0.002466247,0.001249888,0.004358128,0.002129443,0.001276867,0.01436608],"category_scores_gemma":[0.005794923,0.0004193432,0.0007007439,0.003198435,0.00155575,0.004548445,0.002333217,0.002585162,0.001293184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00140877,"about_ca_system_score_gemma":0.0004902418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000817798,"about_ca_topic_score_gemma":0.0007404827,"domain_scores_codex":[0.9989771,0.0002025908,0.00006656042,0.0002502448,0.0002876824,0.0002158148],"domain_scores_gemma":[0.9959882,0.001837076,0.0005665168,0.0005410561,0.0006093421,0.0004578448],"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.0001082885,0.00007166125,0.0007851194,0.00007950126,0.0000102428,0.0001045025,0.0006563579,0.002171544,0.002504539,0.9704964,0.002816102,0.02019584],"study_design_scores_gemma":[0.0000252496,0.00004003715,0.00058081,0.00003388417,0.00001665113,0.0002345394,0.0004722602,0.01799412,0.000981389,0.9734167,0.006185199,0.00001921278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5933838,0.0006396067,0.290733,0.001811554,0.0002166756,0.0002483041,0.001840014,0.000718453,0.1104085],"genre_scores_gemma":[0.9490883,0.0004031003,0.03011055,0.0003034841,0.0002188367,0.0001561338,0.002473916,0.0002245708,0.01702118],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01436608,"threshold_uncertainty_score":0.04805934,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001913366,0.0004517296,0.0002993254,0.002101966,0.001225835,0.001807108,0.0005001347,0.0007521578,0.02471507],"category_scores_gemma":[0.001331279,0.0002672654,0.0002842709,0.0008203009,0.0009450346,0.001632448,0.0006832887,0.000967226,0.00230995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005823097,"about_ca_system_score_gemma":0.0003613635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001298827,"about_ca_topic_score_gemma":0.002060905,"domain_scores_codex":[0.9998067,0.00002999617,0.000006601914,0.00004035825,0.00006924023,0.00004712368],"domain_scores_gemma":[0.9994543,0.0001767564,0.00009211144,0.00004903632,0.000118878,0.0001088777],"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.00003031512,0.00002330485,0.0002316221,0.00003867311,0.000006653083,0.0001336412,0.0001153417,0.001730911,0.002308175,0.9810213,0.006089283,0.008270767],"study_design_scores_gemma":[0.00001448727,0.00001278915,0.0006074567,0.00002229198,0.000004899758,0.0001698709,0.0001862459,0.01037165,0.001674493,0.9814885,0.005426125,0.0000212895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5846018,0.001221522,0.08420171,0.002241688,0.0005809126,0.00008006019,0.001098895,0.0006599193,0.3253134],"genre_scores_gemma":[0.9364802,0.0007328653,0.01355077,0.0004196742,0.0001759559,0.00008468311,0.0005198042,0.0001906457,0.04784543],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02471507,"threshold_uncertainty_score":0.08268011,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001407397,0.0005084254,0.0006805219,0.002776195,0.001625697,0.004578541,0.001101132,0.001077272,0.002914783],"category_scores_gemma":[0.003706892,0.0005911911,0.0007764642,0.001880869,0.003862301,0.006797673,0.002865304,0.001871363,0.0003159085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001095509,"about_ca_system_score_gemma":0.0007089066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009412182,"about_ca_topic_score_gemma":0.0007905693,"domain_scores_codex":[0.9986185,0.0004705554,0.000086539,0.000273811,0.0003950203,0.000155618],"domain_scores_gemma":[0.9957145,0.001925673,0.0005183426,0.0005065813,0.0006794441,0.0006554928],"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.00002350332,0.00001775671,0.0006678042,0.00001569812,0.000006577512,0.00007509552,0.0003275308,0.0003582908,0.0007232611,0.9943041,0.000330426,0.003149788],"study_design_scores_gemma":[0.00001026544,0.00001952251,0.0006269646,0.00000794549,0.000009195849,0.0002418159,0.0002157855,0.002520633,0.000308067,0.9932268,0.00279986,0.00001315535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.753601,0.001955892,0.1967573,0.003911235,0.000355288,0.00005429096,0.0004063348,0.0003225606,0.04263617],"genre_scores_gemma":[0.9722664,0.0006514213,0.01788815,0.0003080332,0.0003287414,0.00004545627,0.0002241064,0.00006236512,0.008225247],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004578541,"threshold_uncertainty_score":0.009750903,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00148556,0.0008935026,0.001225833,0.002950417,0.002915589,0.003364981,0.001832133,0.001378806,0.00936081],"category_scores_gemma":[0.005988488,0.0009040112,0.001422031,0.001394544,0.005366543,0.01068435,0.004870515,0.005279138,0.0007478181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001538632,"about_ca_system_score_gemma":0.0005649449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008593762,"about_ca_topic_score_gemma":0.00084763,"domain_scores_codex":[0.9987767,0.00028597,0.00006412416,0.0002814194,0.0003673777,0.0002242907],"domain_scores_gemma":[0.9950632,0.003066248,0.0002635188,0.0005294489,0.0004162796,0.0006612825],"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.00002176043,0.00002321065,0.0001873752,0.00002408743,0.000004583879,0.00009744352,0.0003056841,0.0002121569,0.000403825,0.9956797,0.0005578139,0.002482375],"study_design_scores_gemma":[0.00001027497,0.000008119869,0.0001560395,0.00001188758,0.000007085843,0.0001064038,0.00007765791,0.0008957682,0.000381016,0.9965581,0.001781337,0.000006252847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5611337,0.003433614,0.1271844,0.005627738,0.0006522348,0.00006957536,0.0004521021,0.0009392082,0.3005074],"genre_scores_gemma":[0.9618014,0.001086032,0.01321168,0.0007378465,0.0004650785,0.00005214417,0.0003388169,0.0002469065,0.02206015],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00936081,"threshold_uncertainty_score":0.03131509,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007543011,0.0007262525,0.0009352561,0.002586043,0.001478629,0.002217995,0.001090123,0.001393878,0.006810375],"category_scores_gemma":[0.005105245,0.0004810994,0.000481059,0.001104996,0.002994247,0.003087146,0.001579302,0.001959918,0.0007710595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006636891,"about_ca_system_score_gemma":0.0002728355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000580851,"about_ca_topic_score_gemma":0.0006925519,"domain_scores_codex":[0.999499,0.0001670419,0.00001762742,0.00007296202,0.0001501576,0.00009324316],"domain_scores_gemma":[0.9977037,0.001202194,0.0002812463,0.0001756356,0.0002734968,0.0003635816],"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.00007927301,0.00004414127,0.0003985529,0.00005401033,0.00001264871,0.0001865187,0.0003597318,0.005431227,0.001983096,0.9805562,0.003295657,0.007598837],"study_design_scores_gemma":[0.00001173728,0.000009677926,0.000271245,0.0000160178,0.000003591284,0.00009982171,0.0001262447,0.01155691,0.0002115813,0.9868663,0.0008155374,0.00001132162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7439353,0.002089961,0.1346864,0.004253764,0.0008724254,0.00005451525,0.0002011516,0.000404303,0.1135022],"genre_scores_gemma":[0.9748368,0.0009843839,0.01003349,0.0003509825,0.0006980613,0.00003935759,0.000120876,0.0001375427,0.01279847],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006810375,"threshold_uncertainty_score":0.02278292,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001315445,0.0008483176,0.001382919,0.002828027,0.00239263,0.003395447,0.001887486,0.001136609,0.02813197],"category_scores_gemma":[0.01171936,0.0008138391,0.0009582434,0.002401251,0.002982422,0.007219566,0.002468429,0.005282843,0.003337115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001898559,"about_ca_system_score_gemma":0.001114988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001211975,"about_ca_topic_score_gemma":0.00153506,"domain_scores_codex":[0.9985278,0.0002837666,0.00004171762,0.0003977054,0.0004485156,0.0003005757],"domain_scores_gemma":[0.993763,0.002936911,0.0006169081,0.001024903,0.0008447016,0.0008136278],"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.00003971057,0.00002633423,0.0003270444,0.000025684,0.000009922937,0.00002782792,0.00005679711,0.001220726,0.000426649,0.9864615,0.005385963,0.005991812],"study_design_scores_gemma":[0.000009860506,0.000009695882,0.0006881593,0.00001026219,0.0000139075,0.0001406979,0.00002503759,0.01097728,0.0005273848,0.9834011,0.004180414,0.0000161765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2664292,0.001808163,0.2503981,0.006471654,0.001073963,0.0001004336,0.001846061,0.001156003,0.4707165],"genre_scores_gemma":[0.91344,0.001037074,0.0146464,0.000763966,0.00146336,0.00009577991,0.001046577,0.0004454619,0.06706148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02813197,"threshold_uncertainty_score":0.09411079,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001403753,0.0007877268,0.001060197,0.004149482,0.00226949,0.005738939,0.002044613,0.001968961,0.01214968],"category_scores_gemma":[0.007590409,0.0007841346,0.000585242,0.002877612,0.004406326,0.007286124,0.001799458,0.002446271,0.0009711703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001987442,"about_ca_system_score_gemma":0.0009969396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002321799,"about_ca_topic_score_gemma":0.003105115,"domain_scores_codex":[0.9988301,0.0003358895,0.00005589735,0.0002592765,0.0002457268,0.0002731242],"domain_scores_gemma":[0.98858,0.006609566,0.002112045,0.0007539775,0.0005937959,0.0013505],"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.0005743185,0.0001637011,0.006156643,0.0002023813,0.00005229567,0.0001695721,0.0007905863,0.01618445,0.005709951,0.9423093,0.009587476,0.01809932],"study_design_scores_gemma":[0.000104032,0.00008275726,0.003339645,0.00004663548,0.0000475206,0.0003697632,0.0003501392,0.04103542,0.001824884,0.9481837,0.004529535,0.00008605173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8986923,0.001256833,0.04123744,0.005767418,0.0002489976,0.00005876726,0.002026761,0.0003625729,0.05034905],"genre_scores_gemma":[0.9810626,0.0005238751,0.009576154,0.0002696012,0.0003872942,0.00005762475,0.000645317,0.00008917652,0.00738831],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01214968,"threshold_uncertainty_score":0.04064476,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}