{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79394954,0.0037114832,0.007253339,0.0010619228,0.0033422632,0.0013353216,0.00006286157,0.0005910684,0.18869218],"genre_scores_gemma":[0.99429196,0.00046085534,0.004453845,0.00054613216,0.00006261813,0.00002865793,0.000005814154,0.00004156047,0.00010855263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983643,0.00011892367,0.00042853184,0.00036692878,0.00036269016,0.00035858515],"domain_scores_gemma":[0.99852306,0.00074686465,0.00018072565,0.0003431174,0.00006986378,0.00013636265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021993488,0.00025781177,0.00041771505,0.00006417998,0.00017897988,0.00003252795,0.0003997602,0.00012146105,0.00011518476],"category_scores_gemma":[0.00064567337,0.00023269276,0.00011069201,0.00044555505,0.00016955742,0.0003357082,0.000110964356,0.00036916256,0.00002346115],"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.000033770786,0.00008212397,0.012048677,0.00019031946,0.000023956802,0.000064229134,0.0024050237,0.000004269362,0.000009083464,0.9842692,0.00044654642,0.00042278075],"study_design_scores_gemma":[0.0008272422,0.00009224771,0.0004232215,0.00006369188,0.000022183736,0.000013334161,0.0005346609,0.0001443416,0.00027911467,0.9901031,0.00720282,0.00029401033],"about_ca_topic_score_codex":0.000004529292,"about_ca_topic_score_gemma":0.000014445286,"teacher_disagreement_score":0.2003424,"about_ca_system_score_codex":0.000070927825,"about_ca_system_score_gemma":0.000027409784,"threshold_uncertainty_score":0.9488936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9871199,0.0013804317,0.005936641,0.00017562885,0.0019932045,0.00073911704,0.000008429771,0.000114416456,0.0025322244],"genre_scores_gemma":[0.99598753,0.0008810884,0.002762006,0.00002225609,0.000018195306,0.000008266073,0.0000027355386,0.000015928748,0.00030199863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822277,0.00014143143,0.0002919033,0.0003797881,0.00057534344,0.00038875575],"domain_scores_gemma":[0.9979123,0.0007365666,0.0001954442,0.0009009924,0.00019471886,0.000059981252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025633667,0.00017270743,0.00023297411,0.00017732337,0.00013470027,0.00004940775,0.0012856124,0.00008691594,0.000007716694],"category_scores_gemma":[0.00010862349,0.00010456876,0.000029501267,0.0017574969,0.00011634894,0.0010173644,0.0002629199,0.00045267644,0.000015637084],"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.0005778807,0.00010676458,0.018518616,0.000099428355,0.000016098393,0.00003816003,0.00016346532,0.0015297848,0.011326336,0.9618569,0.000049154605,0.0057174],"study_design_scores_gemma":[0.0043864218,0.00666295,0.012893805,0.00027844447,0.000010061816,0.00008001071,0.00039494195,0.0060820607,0.02896107,0.91001976,0.029341936,0.0008885663],"about_ca_topic_score_codex":0.000008974241,"about_ca_topic_score_gemma":0.000030462954,"teacher_disagreement_score":0.05183718,"about_ca_system_score_codex":0.0001010318,"about_ca_system_score_gemma":0.00011827151,"threshold_uncertainty_score":0.42641902},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058267757,0.01258826,0.8910355,0.0037338,0.0015892085,0.0008324995,0.0000119205315,0.00042819034,0.03151289],"genre_scores_gemma":[0.991088,0.00087558513,0.007794507,0.00017586746,0.000013936645,0.000008011831,0.0000010463,0.000010305748,0.00003275848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857765,0.0001162687,0.00024541182,0.00035531272,0.00041419716,0.00029117515],"domain_scores_gemma":[0.99888086,0.00037583054,0.00010215773,0.00043172293,0.00010000723,0.00010943508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031880086,0.00012256727,0.00021825943,0.00012805252,0.000048906222,0.000018113471,0.0013248258,0.000046726316,0.000011290921],"category_scores_gemma":[0.00031503092,0.00011808095,0.000056285564,0.0015954609,0.00012919134,0.00093592814,0.00047365585,0.00024299693,0.000025672669],"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.00004394901,0.000069934256,0.0029514055,0.000054502816,0.000003226041,0.000031504514,0.00050319877,0.00041763062,0.0003619041,0.97697705,0.000056777866,0.018528901],"study_design_scores_gemma":[0.000998498,0.00034294,0.00026785722,0.00003994925,0.0000015757577,0.0000034328752,0.00012493566,0.012216317,0.009312589,0.95667297,0.019826053,0.00019289387],"about_ca_topic_score_codex":0.000001148556,"about_ca_topic_score_gemma":6.298987e-7,"teacher_disagreement_score":0.9328202,"about_ca_system_score_codex":0.000046878802,"about_ca_system_score_gemma":0.000040534596,"threshold_uncertainty_score":0.48152012},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56640816,0.0030792651,0.42859823,0.00020704485,0.00048995746,0.00009868086,0.0000010134327,0.000041659998,0.0010759882],"genre_scores_gemma":[0.98493254,0.0006857991,0.014169311,0.000107876076,0.000010427831,0.000010352258,0.000004296203,0.0000034761933,0.00007594609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934804,0.000038820042,0.000113391325,0.00023725415,0.00014639576,0.00011606475],"domain_scores_gemma":[0.99966097,0.00007404251,0.00004310188,0.00011637234,0.00006532329,0.000040172166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011717449,0.00007766802,0.000092814145,0.00005788667,0.00007755142,0.00007116861,0.00006668699,0.000022483164,0.0000036400318],"category_scores_gemma":[0.000015475049,0.00007269577,0.000009254812,0.0005664094,0.000019231153,0.00061798404,0.00009628301,0.00007294131,0.0000015690287],"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.000009226201,0.0002398932,0.049913455,0.00011621095,0.000014962952,0.00006225491,0.0009949391,0.00081534043,0.00012121512,0.9052069,0.00005710177,0.042448454],"study_design_scores_gemma":[0.0042076474,0.0005295666,0.052780185,0.00026506037,0.000021498157,0.0006020054,0.000594893,0.07234089,0.0061910483,0.8375186,0.024206566,0.0007420701],"about_ca_topic_score_codex":0.000001978335,"about_ca_topic_score_gemma":0.000038337104,"teacher_disagreement_score":0.41852435,"about_ca_system_score_codex":0.0000340353,"about_ca_system_score_gemma":0.00003061422,"threshold_uncertainty_score":0.29644477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70732224,0.099050105,0.022454817,0.0009916849,0.08011027,0.010469687,0.00060394034,0.0010313343,0.07796593],"genre_scores_gemma":[0.9875775,0.0074106245,0.0028523926,0.000008304028,0.00014793283,0.0010496388,0.000015092878,0.000113268834,0.00082523254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692446,0.00030906178,0.0011435616,0.00046803866,0.00073095487,0.0004239249],"domain_scores_gemma":[0.99438494,0.0032026605,0.0009579487,0.0011716654,0.00019947498,0.00008330647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093626184,0.00038757132,0.0007949207,0.00008748802,0.00028067216,0.00007275876,0.0007438222,0.00021176122,0.000024292103],"category_scores_gemma":[0.0013317718,0.0003277116,0.00011743646,0.00040308837,0.0002602182,0.00019688421,0.0015663138,0.0010927824,0.000003225873],"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.000019718582,0.00026446008,0.0017745116,0.0010017795,0.000036043864,0.000010507229,0.00030016695,0.0013050443,0.0000020050345,0.9948181,0.00022146107,0.0002462281],"study_design_scores_gemma":[0.00054931105,0.000047980928,0.000020316196,0.00024430326,0.000060914157,0.000011163365,0.0005728193,0.0008801141,0.000047525165,0.9689527,0.028291015,0.00032184095],"about_ca_topic_score_codex":0.000016612372,"about_ca_topic_score_gemma":0.000007886826,"teacher_disagreement_score":0.2802553,"about_ca_system_score_codex":0.00027887226,"about_ca_system_score_gemma":0.00012667845,"threshold_uncertainty_score":0.9999175},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012001572,0.0054362826,0.97073406,0.0005766368,0.004083325,0.0008051026,0.000027505173,0.00024150587,0.0060939915],"genre_scores_gemma":[0.9798484,0.00016632443,0.016209783,0.00014933692,0.000037104415,0.00094367046,0.000010111235,0.000024440698,0.002610839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983084,0.000121682184,0.00023300115,0.00045966575,0.00041806625,0.00045913592],"domain_scores_gemma":[0.9985927,0.0005703435,0.000079350604,0.0005990901,0.00007950055,0.00007902428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005812834,0.00012905443,0.00016137872,0.00028733772,0.0004541208,0.00003726403,0.0012158056,0.000025126705,0.000028668052],"category_scores_gemma":[0.00014729564,0.00014638925,0.00007299319,0.0015970548,0.00006646017,0.0008704111,0.00063589745,0.00031479605,0.000009980297],"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.00003208622,0.00022729998,0.0026438052,0.000016393089,0.0000039374845,0.000019760138,0.00015594815,0.006263199,0.00004321403,0.9572588,0.00043438977,0.032901123],"study_design_scores_gemma":[0.00075068366,0.00029544183,0.00015875438,0.000003464374,0.0000018269551,0.000013774818,0.00018232103,0.011041672,0.00016005732,0.7203178,0.2668814,0.00019280655],"about_ca_topic_score_codex":0.0000026955809,"about_ca_topic_score_gemma":0.000009062801,"teacher_disagreement_score":0.9678468,"about_ca_system_score_codex":0.00022814667,"about_ca_system_score_gemma":0.0000754687,"threshold_uncertainty_score":0.59695804},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119204625,0.011916128,0.85467243,0.00052009174,0.002775863,0.00097603863,0.00004318759,0.00031006415,0.009581541],"genre_scores_gemma":[0.9952893,0.00023062399,0.0042731366,0.00005239662,0.0000035811008,0.00008546525,0.0000028668667,0.00001038238,0.00005222975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771976,0.00032124505,0.00035268304,0.00046718988,0.00073997147,0.00039912842],"domain_scores_gemma":[0.99832773,0.00050215813,0.00013082738,0.00087220507,0.000083094135,0.0000839835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009330219,0.00013886289,0.0002562491,0.00029431784,0.00017785766,0.000012763028,0.0018294117,0.000030906707,0.000023072846],"category_scores_gemma":[0.00011768426,0.00015038603,0.00007421652,0.0025107865,0.00025643175,0.0007261179,0.0006982126,0.0004998161,0.000003256146],"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.000029107638,0.00029857317,0.020892723,0.00003291008,0.0000037344978,0.00002538132,0.00019347998,0.003626792,0.000030931613,0.9579518,0.000029644296,0.016884936],"study_design_scores_gemma":[0.0005343678,0.00029202973,0.0017932801,0.000005632055,0.0000010105778,0.000009161459,0.00017888573,0.0027689184,0.00077567925,0.9822969,0.011181677,0.00016247437],"about_ca_topic_score_codex":0.000016215145,"about_ca_topic_score_gemma":0.0000118490525,"teacher_disagreement_score":0.8760847,"about_ca_system_score_codex":0.00020919919,"about_ca_system_score_gemma":0.00009476746,"threshold_uncertainty_score":0.61325645},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66961825,0.019654451,0.2942267,0.0022768572,0.0017691819,0.0016796342,0.000046634766,0.00048551068,0.010242783],"genre_scores_gemma":[0.9929847,0.00082046585,0.0058000586,0.000096811506,0.000010033888,0.00021787363,0.00000732874,0.000014723435,0.000048015958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982322,0.00017288928,0.0002758564,0.0005512589,0.00037997114,0.00038783893],"domain_scores_gemma":[0.99872285,0.00047738277,0.000096166965,0.0005056184,0.00006839048,0.00012956193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003384339,0.00018136151,0.00022771326,0.0004484096,0.00070947665,0.000098460696,0.00069604017,0.00004460637,0.0000103797465],"category_scores_gemma":[0.000050361752,0.00020138902,0.000036583377,0.0016002897,0.00015860221,0.0011440866,0.00066768617,0.00051819807,0.0000014934271],"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.000016643102,0.00016030403,0.007496666,0.000011445168,0.000007693198,0.000043409324,0.0003983733,0.00016767666,0.0007827128,0.94711214,0.000016528007,0.043786407],"study_design_scores_gemma":[0.001417431,0.00040308086,0.007509543,0.000012530068,0.000005498681,0.00008059425,0.00020447712,0.011079323,0.00035878073,0.97588885,0.0027304601,0.00030945332],"about_ca_topic_score_codex":0.000024707568,"about_ca_topic_score_gemma":0.00019276598,"teacher_disagreement_score":0.32336646,"about_ca_system_score_codex":0.00011497825,"about_ca_system_score_gemma":0.00006641098,"threshold_uncertainty_score":0.82124054},"labels":[],"label_agreement":null}]}