{"meta":{"query_hash":"69088c315c08","filters":{"venue":"Advances in Combinatorics"},"cohort_total":8,"direct_labels_cover":0,"predictions_cover":8,"exported":8,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/69088c315c08","api":"https://metacan.xera.ac/api/v1/cohort?venue=Advances+in+Combinatorics"},"results":[{"id":"W2939652507","doi":"10.19086/aic.12100","title":"Planar graphs have bounded nonrepetitive chromatic number","year":2020,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Australian Research Council; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Bounded function; Sequence (biology); Complete coloring; Integer (computer science); Brooks' theorem; Fractional coloring; Fibonacci number; Binary number; Integer sequence","score_opus":0.02681826898518669,"score_gpt":0.31279177893014104,"score_spread":0.28597350994495435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939652507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5329194,0.0020861381,0.27501076,0.005099014,0.0002758958,0.00014549326,0.0019785282,0.0026296317,0.17985511],"genre_scores_gemma":[0.90641576,0.0011320933,0.044295676,0.0010496555,0.00033760484,0.00022674257,0.0016190249,0.0009989411,0.04392448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982638,0.00026262042,0.000051257284,0.00057766575,0.0005002126,0.00034453708],"domain_scores_gemma":[0.9896291,0.0062220567,0.00090141676,0.0014454483,0.0010291068,0.0007728557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086505443,0.0010410537,0.0009492655,0.0014821106,0.0021383313,0.0037211766,0.0027616576,0.0019667316,0.017033482],"category_scores_gemma":[0.008548371,0.00096958794,0.0009961625,0.0017192332,0.0044077523,0.006170012,0.0023422174,0.004119373,0.0033235224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019647513,0.000057601133,0.0016535076,0.00020528631,0.000032360218,0.00023476945,0.0005381835,0.013870427,0.0066858833,0.9606368,0.005835122,0.010053536],"study_design_scores_gemma":[0.000055643493,0.000056038047,0.0012141278,0.00004088832,0.000032975036,0.0003057583,0.00014123264,0.034622915,0.0024294602,0.95102304,0.010031616,0.00004633249],"about_ca_topic_score_codex":0.004558407,"about_ca_topic_score_gemma":0.0067424765,"teacher_disagreement_score":0.017033482,"about_ca_system_score_codex":0.0030724795,"about_ca_system_score_gemma":0.0011434638,"threshold_uncertainty_score":0.056982696},"labels":[],"label_agreement":null},{"id":"W2981554314","doi":"10.19086/aic.10256","title":"The Structure of Binary Matroids with no Induced Claw or Fano Plane Restriction","year":2019,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Graphic matroid; Conjecture; Discrete mathematics; Binary tree; Vector space; Natural number; Integer (computer science); Computer science","score_opus":0.009253713542886184,"score_gpt":0.2763743689459909,"score_spread":0.2671206554031047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981554314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88570297,0.00091137754,0.059888873,0.0014003207,0.00007835884,0.00006858844,0.0011037487,0.000359163,0.050486624],"genre_scores_gemma":[0.974858,0.0003728895,0.011903231,0.00030883687,0.00015060582,0.00008222493,0.0013171241,0.00006452099,0.010942506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940085,0.00008777975,0.000031023475,0.000186083,0.00017203872,0.00012228749],"domain_scores_gemma":[0.99863464,0.00036476293,0.00035860797,0.00021865914,0.00016236512,0.00026096206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000325909,0.00031791406,0.0004732368,0.0011822128,0.0009425513,0.0023874808,0.00082640495,0.0006995428,0.0045525255],"category_scores_gemma":[0.0022069518,0.000506984,0.000433616,0.0011608453,0.0014353783,0.0030826675,0.0010750075,0.0010892007,0.00063282775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018352676,0.00008053102,0.0020461157,0.000106107305,0.000019696432,0.00025880634,0.00061824825,0.0046054577,0.005533217,0.96654207,0.0026221005,0.017384136],"study_design_scores_gemma":[0.00010526283,0.00010379666,0.0047196904,0.00005506567,0.00003433908,0.0008515738,0.0003275791,0.034141194,0.004323867,0.9385068,0.016784515,0.00004630595],"about_ca_topic_score_codex":0.0019285547,"about_ca_topic_score_gemma":0.0012972208,"teacher_disagreement_score":0.0045525255,"about_ca_system_score_codex":0.001016182,"about_ca_system_score_gemma":0.00033380854,"threshold_uncertainty_score":0.015229702},"labels":[],"label_agreement":null},{"id":"W3007681597","doi":"10.19086/aic.12043","title":"A rainbow version of Mantel's Theorem","year":2020,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Commission; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; United States-Israel Binational Science Foundation; Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Multiple edges; Simple graph; Rainbow; Discrete mathematics; Physics","score_opus":0.015320966051770737,"score_gpt":0.287461488534128,"score_spread":0.27214052248235726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007681597","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051871054,0.003939772,0.42585135,0.01005772,0.0031306392,0.00016197511,0.0020285342,0.0024116873,0.5005473],"genre_scores_gemma":[0.6827406,0.003972727,0.13616008,0.010314901,0.0030747403,0.00030337553,0.0014541862,0.0014740649,0.16050534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971968,0.00036047364,0.000109945286,0.001135839,0.00070715835,0.00048975047],"domain_scores_gemma":[0.99645185,0.0014272728,0.00024165642,0.00081595185,0.0007325702,0.00033079408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019603204,0.000890839,0.001265531,0.0017871802,0.0032193214,0.0029285762,0.0024952414,0.0017771823,0.02639695],"category_scores_gemma":[0.0073166112,0.0007946191,0.0024851297,0.0018144845,0.0042241197,0.010459715,0.004550486,0.004975629,0.005929279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035646386,0.000015037424,0.00019080838,0.00008072503,0.00001786205,0.00009365965,0.00017386297,0.0007865943,0.00060481887,0.97753644,0.010157782,0.010306778],"study_design_scores_gemma":[0.000023575678,0.000021794895,0.00021671997,0.000024304294,0.000017511004,0.00017793913,0.000040231753,0.0025984223,0.00045548615,0.97191983,0.024483029,0.000021103675],"about_ca_topic_score_codex":0.003726057,"about_ca_topic_score_gemma":0.003071009,"teacher_disagreement_score":0.02639695,"about_ca_system_score_codex":0.0025212443,"about_ca_system_score_gemma":0.0013333204,"threshold_uncertainty_score":0.088306606},"labels":[],"label_agreement":null},{"id":"W3108948946","doi":"10.19086/aic.25431","title":"Box and Segment Intersection Graphs with Large Girth and Chromatic Number","year":2021,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Chromatic scale; Girth (graph theory); Chordal graph; Graph; Intersection graph","score_opus":0.00441842215705467,"score_gpt":0.23855275600269135,"score_spread":0.23413433384563667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108948946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7677919,0.00038685204,0.18745609,0.0005255273,0.000039806044,0.000065782275,0.0007461168,0.0007169145,0.042271003],"genre_scores_gemma":[0.92489195,0.00046223996,0.06708302,0.0001545339,0.00004484879,0.00013096997,0.0011538452,0.0003376332,0.0057410644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927837,0.0001293706,0.000020280282,0.00019044886,0.00018928421,0.00019228371],"domain_scores_gemma":[0.99478465,0.0031459788,0.00066976075,0.0006311812,0.0003710914,0.0003973838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047540636,0.0007065793,0.00076850125,0.0011146362,0.0015284948,0.0018552142,0.0012964866,0.00095867034,0.008922517],"category_scores_gemma":[0.0031745746,0.0007542684,0.0009026385,0.0022076177,0.0021008572,0.003410728,0.0024384405,0.0024364486,0.0009294066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006132097,0.00015974973,0.009008134,0.00031645116,0.000098542456,0.0008841047,0.0011184224,0.05531337,0.032564715,0.8631837,0.0064812033,0.03025846],"study_design_scores_gemma":[0.00014457795,0.0001966828,0.010569865,0.00010457846,0.00016924714,0.0016218056,0.0012174968,0.18419546,0.033500414,0.75077057,0.017403293,0.00010600876],"about_ca_topic_score_codex":0.0017294318,"about_ca_topic_score_gemma":0.0019744365,"teacher_disagreement_score":0.008922517,"about_ca_system_score_codex":0.00098028,"about_ca_system_score_gemma":0.00062535563,"threshold_uncertainty_score":0.029848814},"labels":[],"label_agreement":null},{"id":"W3123468580","doi":"10.19086/aic.32563","title":"The number of partial Steiner systems and d-partitions","year":2022,"lang":"en","type":"preprint","venue":"Advances in Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Technische Universiteit Eindhoven","keywords":"Matroid; Combinatorics; Mathematics; Rank (graph theory); Probabilistic logic; Steiner system; Entropy (arrow of time); Discrete mathematics; Statistics","score_opus":0.03542362994261492,"score_gpt":0.3671686544063555,"score_spread":0.33174502446374055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123468580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42144173,0.0030910736,0.49446124,0.004074392,0.0002897478,0.00011028359,0.0030801473,0.0010233936,0.07242796],"genre_scores_gemma":[0.9182651,0.0020118484,0.06836934,0.00048984966,0.0003601484,0.00020163746,0.001709692,0.00031031604,0.0082821185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770194,0.0005740085,0.00009227426,0.0005268752,0.00072043703,0.00038454944],"domain_scores_gemma":[0.9778216,0.015786568,0.0017604185,0.0024713087,0.0008118335,0.0013482892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023202368,0.0012143707,0.001308751,0.0024755674,0.001391796,0.004358631,0.0029105672,0.0017220179,0.009161806],"category_scores_gemma":[0.022598615,0.0013522375,0.0013349329,0.0030032163,0.003016617,0.0068473276,0.003622138,0.0031586392,0.0011005648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067300705,0.00013131395,0.0057296776,0.0005557021,0.00013133511,0.00025032432,0.00026801895,0.14433742,0.0131075485,0.77978414,0.009263658,0.045767862],"study_design_scores_gemma":[0.000052728203,0.00007807281,0.0022568258,0.00007959474,0.00008046703,0.000753382,0.00011320399,0.40210813,0.0076367967,0.58106285,0.005716395,0.000061640516],"about_ca_topic_score_codex":0.0006982054,"about_ca_topic_score_gemma":0.0009441683,"teacher_disagreement_score":0.009161806,"about_ca_system_score_codex":0.0025707323,"about_ca_system_score_gemma":0.0008312917,"threshold_uncertainty_score":0.030649304},"labels":[],"label_agreement":null},{"id":"W3183510330","doi":"10.19086/aic.2022.5","title":"Extremal functions for sparse minors","year":2022,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Monash University; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; McGill University","keywords":"Combinatorics; Robertson–Seymour theorem; Mathematics; Graph minor; 1-planar graph; Discrete mathematics; Outerplanar graph; Planar graph; Pathwidth; Line graph; Block graph; Extremal graph theory; Voltage graph; Graph","score_opus":0.026082689526224213,"score_gpt":0.3059711866708144,"score_spread":0.2798884971445902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183510330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45737273,0.0040685697,0.43684375,0.0038072774,0.00045693736,0.00013333914,0.00093196053,0.0010409534,0.09534447],"genre_scores_gemma":[0.950172,0.0019502667,0.02697074,0.000607523,0.00065660564,0.00021418619,0.00079871336,0.00051674456,0.018113079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931717,0.00017507994,0.000028300372,0.00013758849,0.00015818994,0.0001836154],"domain_scores_gemma":[0.994819,0.0031060306,0.00055447366,0.00036415135,0.00048613377,0.0006702826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012705801,0.0012596623,0.001064883,0.0035349522,0.0011553614,0.002477727,0.001401503,0.0014109489,0.009220742],"category_scores_gemma":[0.012154175,0.0005253164,0.0012691487,0.001216476,0.0025552367,0.0038629123,0.0024806492,0.002612152,0.0011214783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081433645,0.000046041663,0.0015500713,0.0001416584,0.000029824329,0.00016273819,0.00027525093,0.008431112,0.002049274,0.9677213,0.0046492293,0.014862112],"study_design_scores_gemma":[0.000015738311,0.000039791674,0.0011948129,0.00006439379,0.000020332498,0.0002218995,0.00014059867,0.06504537,0.0009674275,0.9276679,0.0045874366,0.00003416137],"about_ca_topic_score_codex":0.0009990323,"about_ca_topic_score_gemma":0.0007847135,"teacher_disagreement_score":0.009220742,"about_ca_system_score_codex":0.0017131036,"about_ca_system_score_gemma":0.0004605196,"threshold_uncertainty_score":0.030846477},"labels":[],"label_agreement":null},{"id":"W3187953129","doi":"10.19086/aic.2022.8","title":"Local Girth Choosability of Planar Graphs","year":2022,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Planar graph; Conjecture; Vertex (graph theory); Graph; Girth (graph theory); Discrete mathematics; Planar; Computer science","score_opus":0.012289818736853081,"score_gpt":0.2865556997259913,"score_spread":0.27426588098913823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187953129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7682641,0.0008744796,0.19552544,0.0007142098,0.000047777852,0.000070406335,0.00040631706,0.0009832568,0.033113934],"genre_scores_gemma":[0.9802532,0.00054522237,0.013609563,0.00013714479,0.000057317633,0.000067427536,0.00037029764,0.000111891946,0.0048479163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995178,0.000061947634,0.000020184409,0.00014221382,0.0001350919,0.00012273715],"domain_scores_gemma":[0.9985415,0.00073698035,0.00023516317,0.00021410135,0.00009907856,0.00017325234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028785816,0.00034008257,0.0004347656,0.00075670786,0.0007485335,0.001232007,0.0009726556,0.0005410343,0.006631692],"category_scores_gemma":[0.0022740285,0.00047388574,0.00053146784,0.0011466122,0.0016734535,0.0019020332,0.0019094187,0.0013060438,0.00067572657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058112154,0.00012313263,0.008784972,0.0005655783,0.00006865276,0.0010042124,0.0014914611,0.06405596,0.054522116,0.7608313,0.0045888955,0.103382535],"study_design_scores_gemma":[0.00015202342,0.00031418083,0.00672175,0.00007601864,0.000102625396,0.0014437095,0.00065166334,0.07154255,0.03778427,0.85984635,0.021266557,0.00009824716],"about_ca_topic_score_codex":0.0010805957,"about_ca_topic_score_gemma":0.001052892,"teacher_disagreement_score":0.006631692,"about_ca_system_score_codex":0.0010058259,"about_ca_system_score_gemma":0.0003585062,"threshold_uncertainty_score":0.022185266},"labels":[],"label_agreement":null},{"id":"W3197941146","doi":"10.19086/aic.2022.6","title":"Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth","year":2022,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Treewidth; Mathematics; Discrete mathematics; Logarithm; Pathwidth; Tree-depth; Conjecture; Induced subgraph; Cograph; Clique-sum; Distance-hereditary graph; Induced path; Chordal graph; Partial k-tree; Graph; 1-planar graph; Vertex (graph theory); Line graph; Graph power","score_opus":0.013977358339436596,"score_gpt":0.2812867664249737,"score_spread":0.2673094080855371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197941146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6750628,0.005022566,0.2681451,0.0036839093,0.00009734298,0.000106327934,0.0016241183,0.0008416266,0.045416202],"genre_scores_gemma":[0.9433286,0.0016866768,0.046906456,0.00046764995,0.00012718106,0.000102093596,0.0014520045,0.00016786586,0.0057614436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945325,0.00009169188,0.000020974263,0.00017971722,0.00012801608,0.00012640152],"domain_scores_gemma":[0.99665415,0.001978094,0.0005192233,0.00046014192,0.00018552909,0.0002027988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005233163,0.00043365484,0.0004088881,0.00082771387,0.0007045853,0.0016495702,0.0009254616,0.000561782,0.0038769247],"category_scores_gemma":[0.0036487055,0.00047146974,0.00069188763,0.0018440385,0.0016193729,0.0031495763,0.0010920345,0.0015241106,0.00046762437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004965826,0.00019810688,0.008583459,0.00047384299,0.00008188363,0.00047225348,0.0010453183,0.062235728,0.02298362,0.8025317,0.012892022,0.08800548],"study_design_scores_gemma":[0.000054682307,0.000053002135,0.0032008414,0.00005417507,0.000045312652,0.0006186232,0.00022387374,0.06923931,0.006151315,0.91072255,0.00961577,0.00002060553],"about_ca_topic_score_codex":0.0022337397,"about_ca_topic_score_gemma":0.0023474512,"teacher_disagreement_score":0.0038769247,"about_ca_system_score_codex":0.0018183828,"about_ca_system_score_gemma":0.00046564854,"threshold_uncertainty_score":0.013193369},"labels":[],"label_agreement":null}]}