{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":8,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":8,"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":"69088c315c08","filters":{"venue":"Advances in Combinatorics"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Robert Šámal","is_ca":false},{"name":"Amanda Montejano","is_ca":false},{"name":"Sebastián González Hermosillo de la Maza","is_ca":true},{"name":"Matt DeVos","is_ca":true},{"name":"Ron Aharoni","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01532096605177074,"gpt":0.287461488534128,"spread":0.2721405224823573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003188009,0.0001225673,0.0002182594,0.0001280525,0.00004890622,0.00001811347,0.001324826,0.00004672632,0.00001129092],"category_scores_gemma":[0.0003150309,0.0001180809,0.00005628556,0.001595461,0.0001291913,0.0009359281,0.0004736558,0.0002429969,0.00002567267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000468788,"about_ca_system_score_gemma":0.0000405346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001148556,"about_ca_topic_score_gemma":6.298987e-7,"domain_scores_codex":[0.9985777,0.0001162687,0.0002454118,0.0003553127,0.0004141972,0.0002911752],"domain_scores_gemma":[0.9988809,0.0003758305,0.0001021577,0.0004317229,0.0001000072,0.0001094351],"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.00004394901,0.00006993426,0.002951405,0.00005450282,0.000003226041,0.00003150451,0.0005031988,0.0004176306,0.0003619041,0.9769771,0.00005677787,0.0185289],"study_design_scores_gemma":[0.0009984981,0.00034294,0.0002678572,0.00003994925,0.000001575758,0.000003432875,0.0001249357,0.01221632,0.009312589,0.956673,0.01982605,0.0001928939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05826776,0.01258826,0.8910355,0.0037338,0.001589208,0.0008324995,0.00001192053,0.0004281903,0.03151289],"genre_scores_gemma":[0.991088,0.0008755851,0.007794507,0.0001758675,0.00001393664,0.000008011831,0.0000010463,0.00001030575,0.00003275848],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9328202,"threshold_uncertainty_score":0.4815201,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02681826898518669,"gpt":0.312791778930141,"spread":0.2859735099449544,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002199349,0.0002578118,0.0004177151,0.00006417998,0.0001789799,0.00003252795,0.0003997602,0.0001214611,0.0001151848],"category_scores_gemma":[0.0006456734,0.0002326928,0.000110692,0.0004455551,0.0001695574,0.0003357082,0.0001109644,0.0003691626,0.00002346115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007092782,"about_ca_system_score_gemma":0.00002740978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004529292,"about_ca_topic_score_gemma":0.00001444529,"domain_scores_codex":[0.9983643,0.0001189237,0.0004285318,0.0003669288,0.0003626902,0.0003585852],"domain_scores_gemma":[0.9985231,0.0007468647,0.0001807256,0.0003431174,0.00006986378,0.0001363627],"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.00003377079,0.00008212397,0.01204868,0.0001903195,0.0000239568,0.00006422913,0.002405024,0.000004269362,0.000009083464,0.9842692,0.0004465464,0.0004227808],"study_design_scores_gemma":[0.0008272422,0.00009224771,0.0004232215,0.00006369188,0.00002218374,0.00001333416,0.0005346609,0.0001443416,0.0002791147,0.9901031,0.00720282,0.0002940103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7939495,0.003711483,0.007253339,0.001061923,0.003342263,0.001335322,0.00006286157,0.0005910684,0.1886922],"genre_scores_gemma":[0.994292,0.0004608553,0.004453845,0.0005461322,0.00006261813,0.00002865793,0.000005814154,0.00004156047,0.0001085526],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2003424,"threshold_uncertainty_score":0.9488936,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Maria Chudnovsky","is_ca":false},{"name":"Tara Abrishami","is_ca":false},{"name":"Sepehr Hajebi","is_ca":true},{"name":"Sophie Spirkl","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0139773583394366,"gpt":0.2812867664249737,"spread":0.2673094080855371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003384339,0.0001813615,0.0002277133,0.0004484096,0.0007094766,0.0000984607,0.0006960402,0.00004460637,0.00001037975],"category_scores_gemma":[0.00005036175,0.000201389,0.00003658338,0.00160029,0.0001586022,0.001144087,0.0006676862,0.0005181981,0.000001493427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001149782,"about_ca_system_score_gemma":0.00006641098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002470757,"about_ca_topic_score_gemma":0.000192766,"domain_scores_codex":[0.9982322,0.0001728893,0.0002758564,0.0005512589,0.0003799711,0.0003878389],"domain_scores_gemma":[0.9987229,0.0004773828,0.00009616696,0.0005056184,0.00006839048,0.0001295619],"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.0000166431,0.000160304,0.007496666,0.00001144517,0.000007693198,0.00004340932,0.0003983733,0.0001676767,0.0007827128,0.9471121,0.00001652801,0.04378641],"study_design_scores_gemma":[0.001417431,0.0004030809,0.007509543,0.00001253007,0.000005498681,0.00008059425,0.0002044771,0.01107932,0.0003587807,0.9758888,0.00273046,0.0003094533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6696182,0.01965445,0.2942267,0.002276857,0.001769182,0.001679634,0.00004663477,0.0004855107,0.01024278],"genre_scores_gemma":[0.9929847,0.0008204659,0.005800059,0.00009681151,0.00001003389,0.0002178736,0.00000732874,0.00001472344,0.00004801596],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3233665,"threshold_uncertainty_score":0.8212405,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Chromatic scale; Girth (graph theory); Chordal graph; Graph; Intersection graph","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.00441842215705467,"gpt":0.2385527560026914,"spread":0.2341343338456367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001171745,0.00007766802,0.00009281415,0.00005788667,0.00007755142,0.00007116861,0.00006668699,0.00002248316,0.000003640032],"category_scores_gemma":[0.00001547505,0.00007269577,0.000009254812,0.0005664094,0.00001923115,0.000617984,0.00009628301,0.00007294131,0.000001569029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000340353,"about_ca_system_score_gemma":0.00003061422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001978335,"about_ca_topic_score_gemma":0.0000383371,"domain_scores_codex":[0.999348,0.00003882004,0.0001133913,0.0002372541,0.0001463958,0.0001160648],"domain_scores_gemma":[0.999661,0.00007404251,0.00004310188,0.0001163723,0.00006532329,0.00004017217],"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.000009226201,0.0002398932,0.04991345,0.0001162109,0.00001496295,0.00006225491,0.0009949391,0.0008153404,0.0001212151,0.9052069,0.00005710177,0.04244845],"study_design_scores_gemma":[0.004207647,0.0005295666,0.05278018,0.0002650604,0.00002149816,0.0006020054,0.000594893,0.07234089,0.006191048,0.8375186,0.02420657,0.0007420701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5664082,0.003079265,0.4285982,0.0002070449,0.0004899575,0.00009868086,0.000001013433,0.00004166,0.001075988],"genre_scores_gemma":[0.9849325,0.0006857991,0.01416931,0.0001078761,0.00001042783,0.00001035226,0.000004296203,0.000003476193,0.00007594609],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4185244,"threshold_uncertainty_score":0.2964448,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Kevin Hendrey","is_ca":false},{"name":"Sergey Norin","is_ca":false},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02608268952622421,"gpt":0.3059711866708144,"spread":0.2798884971445902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005812834,0.0001290544,0.0001613787,0.0002873377,0.0004541208,0.00003726403,0.001215806,0.0000251267,0.00002866805],"category_scores_gemma":[0.0001472956,0.0001463893,0.00007299319,0.001597055,0.00006646017,0.0008704111,0.0006358974,0.0003147961,0.000009980297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002281467,"about_ca_system_score_gemma":0.0000754687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002695581,"about_ca_topic_score_gemma":0.000009062801,"domain_scores_codex":[0.9983084,0.0001216822,0.0002330011,0.0004596658,0.0004180663,0.0004591359],"domain_scores_gemma":[0.9985927,0.0005703435,0.0000793506,0.0005990901,0.00007950055,0.00007902428],"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.00003208622,0.0002273,0.002643805,0.00001639309,0.000003937485,0.00001976014,0.0001559481,0.006263199,0.00004321403,0.9572588,0.0004343898,0.03290112],"study_design_scores_gemma":[0.0007506837,0.0002954418,0.0001587544,0.000003464374,0.000001826955,0.00001377482,0.000182321,0.01104167,0.0001600573,0.7203178,0.2668814,0.0001928065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01200157,0.005436283,0.9707341,0.0005766368,0.004083325,0.0008051026,0.00002750517,0.0002415059,0.006093991],"genre_scores_gemma":[0.9798484,0.0001663244,0.01620978,0.0001493369,0.00003710442,0.0009436705,0.00001011123,0.0000244407,0.002610839],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9678468,"threshold_uncertainty_score":0.596958,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Peter S. Nelson","is_ca":true},{"name":"Luke Postle","is_ca":true},{"name":"Tom Kelly","is_ca":true},{"name":"František Kardoš","is_ca":false},{"name":"Marthe Bonamy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009253713542886184,"gpt":0.2763743689459909,"spread":0.2671206554031047,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002563367,0.0001727074,0.0002329741,0.0001773234,0.0001347003,0.00004940775,0.001285612,0.00008691594,0.000007716694],"category_scores_gemma":[0.0001086235,0.0001045688,0.00002950127,0.001757497,0.0001163489,0.001017364,0.0002629199,0.0004526764,0.00001563708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001010318,"about_ca_system_score_gemma":0.0001182715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008974241,"about_ca_topic_score_gemma":0.00003046295,"domain_scores_codex":[0.9982228,0.0001414314,0.0002919033,0.0003797881,0.0005753434,0.0003887558],"domain_scores_gemma":[0.9979123,0.0007365666,0.0001954442,0.0009009924,0.0001947189,0.00005998125],"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.0005778807,0.0001067646,0.01851862,0.00009942835,0.00001609839,0.00003816003,0.0001634653,0.001529785,0.01132634,0.9618569,0.00004915461,0.0057174],"study_design_scores_gemma":[0.004386422,0.00666295,0.01289381,0.0002784445,0.00001006182,0.00008001071,0.0003949419,0.006082061,0.02896107,0.9100198,0.02934194,0.0008885663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9871199,0.001380432,0.005936641,0.0001756289,0.001993204,0.000739117,0.000008429771,0.0001144165,0.002532224],"genre_scores_gemma":[0.9959875,0.0008810884,0.002762006,0.00002225609,0.00001819531,0.000008266073,0.000002735539,0.00001592875,0.0003019986],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05183718,"threshold_uncertainty_score":0.426419,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Remco van der Hofstad","is_ca":false},{"name":"Jorn van der Pol","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03542362994261492,"gpt":0.3671686544063555,"spread":0.3317450244637405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009362618,0.0003875713,0.0007949207,0.00008748802,0.0002806722,0.00007275876,0.0007438222,0.0002117612,0.0000242921],"category_scores_gemma":[0.001331772,0.0003277116,0.0001174365,0.0004030884,0.0002602182,0.0001968842,0.001566314,0.001092782,0.000003225873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002788723,"about_ca_system_score_gemma":0.0001266785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001661237,"about_ca_topic_score_gemma":0.000007886826,"domain_scores_codex":[0.9969245,0.0003090618,0.001143562,0.0004680387,0.0007309549,0.0004239249],"domain_scores_gemma":[0.9943849,0.00320266,0.0009579487,0.001171665,0.000199475,0.00008330647],"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.00001971858,0.0002644601,0.001774512,0.001001779,0.00003604386,0.00001050723,0.000300167,0.001305044,0.000002005035,0.9948181,0.0002214611,0.0002462281],"study_design_scores_gemma":[0.0005493111,0.00004798093,0.0000203162,0.0002443033,0.00006091416,0.00001116337,0.0005728193,0.0008801141,0.00004752517,0.9689527,0.02829101,0.000321841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7073222,0.0990501,0.02245482,0.0009916849,0.08011027,0.01046969,0.0006039403,0.001031334,0.07796593],"genre_scores_gemma":[0.9875775,0.007410625,0.002852393,0.000008304028,0.0001479328,0.001049639,0.00001509288,0.0001132688,0.0008252325],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2802553,"threshold_uncertainty_score":0.9999175,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Luke Postle","is_ca":true},{"name":"Evelyne Smith‐Roberge","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01228981873685308,"gpt":0.2865556997259913,"spread":0.2742658809891382,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009330219,0.0001388629,0.0002562491,0.0002943178,0.0001778577,0.00001276303,0.001829412,0.00003090671,0.00002307285],"category_scores_gemma":[0.0001176843,0.000150386,0.00007421652,0.002510787,0.0002564318,0.0007261179,0.0006982126,0.0004998161,0.000003256146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002091992,"about_ca_system_score_gemma":0.00009476746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001621514,"about_ca_topic_score_gemma":0.00001184905,"domain_scores_codex":[0.9977198,0.0003212451,0.000352683,0.0004671899,0.0007399715,0.0003991284],"domain_scores_gemma":[0.9983277,0.0005021581,0.0001308274,0.0008722051,0.00008309414,0.0000839835],"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.00002910764,0.0002985732,0.02089272,0.00003291008,0.000003734498,0.00002538132,0.00019348,0.003626792,0.00003093161,0.9579518,0.0000296443,0.01688494],"study_design_scores_gemma":[0.0005343678,0.0002920297,0.00179328,0.000005632055,0.000001010578,0.000009161459,0.0001788857,0.002768918,0.0007756792,0.9822969,0.01118168,0.0001624744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1192046,0.01191613,0.8546724,0.0005200917,0.002775863,0.0009760386,0.00004318759,0.0003100641,0.009581541],"genre_scores_gemma":[0.9952893,0.000230624,0.004273137,0.00005239662,0.000003581101,0.00008546525,0.000002866867,0.00001038238,0.00005222975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8760847,"threshold_uncertainty_score":0.6132565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}