{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00196032,0.000890839,0.001265531,0.00178718,0.003219321,0.002928576,0.002495241,0.001777182,0.02639695],"category_scores_gemma":[0.007316611,0.0007946191,0.00248513,0.001814484,0.00422412,0.01045971,0.004550486,0.004975629,0.005929279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002521244,"about_ca_system_score_gemma":0.00133332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003726057,"about_ca_topic_score_gemma":0.003071009,"domain_scores_codex":[0.9971968,0.0003604736,0.0001099453,0.001135839,0.0007071584,0.0004897505],"domain_scores_gemma":[0.9964519,0.001427273,0.0002416564,0.0008159518,0.0007325702,0.0003307941],"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.00003564639,0.00001503742,0.0001908084,0.00008072503,0.00001786205,0.00009365965,0.000173863,0.0007865943,0.0006048189,0.9775364,0.01015778,0.01030678],"study_design_scores_gemma":[0.00002357568,0.00002179489,0.00021672,0.00002430429,0.000017511,0.0001779391,0.00004023175,0.002598422,0.0004554862,0.9719198,0.02448303,0.00002110367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.05187105,0.003939772,0.4258513,0.01005772,0.003130639,0.0001619751,0.002028534,0.002411687,0.5005473],"genre_scores_gemma":[0.6827406,0.003972727,0.1361601,0.0103149,0.00307474,0.0003033755,0.001454186,0.001474065,0.1605053],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02639695,"threshold_uncertainty_score":0.08830661,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008650544,0.001041054,0.0009492655,0.001482111,0.002138331,0.003721177,0.002761658,0.001966732,0.01703348],"category_scores_gemma":[0.008548371,0.0009695879,0.0009961625,0.001719233,0.004407752,0.006170012,0.002342217,0.004119373,0.003323522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00307248,"about_ca_system_score_gemma":0.001143464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004558407,"about_ca_topic_score_gemma":0.006742476,"domain_scores_codex":[0.9982638,0.0002626204,0.00005125728,0.0005776657,0.0005002126,0.0003445371],"domain_scores_gemma":[0.9896291,0.006222057,0.0009014168,0.001445448,0.001029107,0.0007728557],"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.0001964751,0.00005760113,0.001653508,0.0002052863,0.00003236022,0.0002347695,0.0005381835,0.01387043,0.006685883,0.9606368,0.005835122,0.01005354],"study_design_scores_gemma":[0.00005564349,0.00005603805,0.001214128,0.00004088832,0.00003297504,0.0003057583,0.0001412326,0.03462292,0.00242946,0.951023,0.01003162,0.00004633249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5329194,0.002086138,0.2750108,0.005099014,0.0002758958,0.0001454933,0.001978528,0.002629632,0.1798551],"genre_scores_gemma":[0.9064158,0.001132093,0.04429568,0.001049655,0.0003376048,0.0002267426,0.001619025,0.0009989411,0.04392448],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01703348,"threshold_uncertainty_score":0.0569827,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005233163,0.0004336548,0.0004088881,0.0008277139,0.0007045853,0.00164957,0.0009254616,0.000561782,0.003876925],"category_scores_gemma":[0.003648706,0.0004714697,0.0006918876,0.001844038,0.001619373,0.003149576,0.001092035,0.001524111,0.0004676244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001818383,"about_ca_system_score_gemma":0.0004656485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00223374,"about_ca_topic_score_gemma":0.002347451,"domain_scores_codex":[0.9994532,0.00009169188,0.00002097426,0.0001797172,0.0001280161,0.0001264015],"domain_scores_gemma":[0.9966542,0.001978094,0.0005192233,0.0004601419,0.0001855291,0.0002027988],"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.0004965826,0.0001981069,0.008583459,0.000473843,0.00008188363,0.0004722535,0.001045318,0.06223573,0.02298362,0.8025317,0.01289202,0.08800548],"study_design_scores_gemma":[0.00005468231,0.00005300214,0.003200841,0.00005417507,0.00004531265,0.0006186232,0.0002238737,0.06923931,0.006151315,0.9107226,0.00961577,0.00002060553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6750628,0.005022566,0.2681451,0.003683909,0.00009734298,0.0001063279,0.001624118,0.0008416266,0.0454162],"genre_scores_gemma":[0.9433286,0.001686677,0.04690646,0.00046765,0.0001271811,0.0001020936,0.001452005,0.0001678659,0.005761444],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003876925,"threshold_uncertainty_score":0.01319337,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004754064,0.0007065793,0.0007685013,0.001114636,0.001528495,0.001855214,0.001296487,0.0009586703,0.008922517],"category_scores_gemma":[0.003174575,0.0007542684,0.0009026385,0.002207618,0.002100857,0.003410728,0.00243844,0.002436449,0.0009294066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00098028,"about_ca_system_score_gemma":0.0006253556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001729432,"about_ca_topic_score_gemma":0.001974436,"domain_scores_codex":[0.9992784,0.0001293706,0.00002028028,0.0001904489,0.0001892842,0.0001922837],"domain_scores_gemma":[0.9947847,0.003145979,0.0006697607,0.0006311812,0.0003710914,0.0003973838],"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.0006132097,0.0001597497,0.009008134,0.0003164512,0.00009854246,0.0008841047,0.001118422,0.05531337,0.03256471,0.8631837,0.006481203,0.03025846],"study_design_scores_gemma":[0.0001445779,0.0001966828,0.01056986,0.0001045785,0.0001692471,0.001621806,0.001217497,0.1841955,0.03350041,0.7507706,0.01740329,0.0001060088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7677919,0.000386852,0.1874561,0.0005255273,0.00003980604,0.00006578227,0.0007461168,0.0007169145,0.042271],"genre_scores_gemma":[0.9248919,0.00046224,0.06708302,0.0001545339,0.00004484879,0.00013097,0.001153845,0.0003376332,0.005741064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008922517,"threshold_uncertainty_score":0.02984881,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00127058,0.001259662,0.001064883,0.003534952,0.001155361,0.002477727,0.001401503,0.001410949,0.009220742],"category_scores_gemma":[0.01215417,0.0005253164,0.001269149,0.001216476,0.002555237,0.003862912,0.002480649,0.002612152,0.001121478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001713104,"about_ca_system_score_gemma":0.0004605196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009990323,"about_ca_topic_score_gemma":0.0007847135,"domain_scores_codex":[0.9993172,0.0001750799,0.00002830037,0.0001375885,0.0001581899,0.0001836154],"domain_scores_gemma":[0.994819,0.003106031,0.0005544737,0.0003641513,0.0004861338,0.0006702826],"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.00008143365,0.00004604166,0.001550071,0.0001416584,0.00002982433,0.0001627382,0.0002752509,0.008431112,0.002049274,0.9677213,0.004649229,0.01486211],"study_design_scores_gemma":[0.00001573831,0.00003979167,0.001194813,0.00006439379,0.0000203325,0.0002218995,0.0001405987,0.06504537,0.0009674275,0.9276679,0.004587437,0.00003416137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4573727,0.00406857,0.4368438,0.003807277,0.0004569374,0.0001333391,0.0009319605,0.001040953,0.09534447],"genre_scores_gemma":[0.950172,0.001950267,0.02697074,0.000607523,0.0006566056,0.0002141862,0.0007987134,0.0005167446,0.01811308],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009220742,"threshold_uncertainty_score":0.03084648,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000325909,0.0003179141,0.0004732368,0.001182213,0.0009425513,0.002387481,0.000826405,0.0006995428,0.004552525],"category_scores_gemma":[0.002206952,0.000506984,0.000433616,0.001160845,0.001435378,0.003082667,0.001075007,0.001089201,0.0006328278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001016182,"about_ca_system_score_gemma":0.0003338085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001928555,"about_ca_topic_score_gemma":0.001297221,"domain_scores_codex":[0.9994009,0.00008777975,0.00003102348,0.000186083,0.0001720387,0.0001222875],"domain_scores_gemma":[0.9986346,0.0003647629,0.000358608,0.0002186591,0.0001623651,0.0002609621],"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.0001835268,0.00008053102,0.002046116,0.0001061073,0.00001969643,0.0002588063,0.0006182482,0.004605458,0.005533217,0.9665421,0.002622101,0.01738414],"study_design_scores_gemma":[0.0001052628,0.0001037967,0.00471969,0.00005506567,0.00003433908,0.0008515738,0.0003275791,0.03414119,0.004323867,0.9385068,0.01678452,0.00004630595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.885703,0.0009113775,0.05988887,0.001400321,0.00007835884,0.00006858844,0.001103749,0.000359163,0.05048662],"genre_scores_gemma":[0.974858,0.0003728895,0.01190323,0.0003088369,0.0001506058,0.00008222493,0.001317124,0.00006452099,0.01094251],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004552525,"threshold_uncertainty_score":0.0152297,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002320237,0.001214371,0.001308751,0.002475567,0.001391796,0.004358631,0.002910567,0.001722018,0.009161806],"category_scores_gemma":[0.02259861,0.001352238,0.001334933,0.003003216,0.003016617,0.006847328,0.003622138,0.003158639,0.001100565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002570732,"about_ca_system_score_gemma":0.0008312917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006982054,"about_ca_topic_score_gemma":0.0009441683,"domain_scores_codex":[0.9977019,0.0005740085,0.00009227426,0.0005268752,0.000720437,0.0003845494],"domain_scores_gemma":[0.9778216,0.01578657,0.001760419,0.002471309,0.0008118335,0.001348289],"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.000673007,0.000131314,0.005729678,0.0005557021,0.0001313351,0.0002503243,0.000268019,0.1443374,0.01310755,0.7797841,0.009263658,0.04576786],"study_design_scores_gemma":[0.0000527282,0.00007807281,0.002256826,0.00007959474,0.00008046703,0.000753382,0.000113204,0.4021081,0.007636797,0.5810629,0.005716395,0.00006164052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4214417,0.003091074,0.4944612,0.004074392,0.0002897478,0.0001102836,0.003080147,0.001023394,0.07242796],"genre_scores_gemma":[0.9182651,0.002011848,0.06836934,0.0004898497,0.0003601484,0.0002016375,0.001709692,0.000310316,0.008282118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009161806,"threshold_uncertainty_score":0.0306493,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002878582,0.0003400826,0.0004347656,0.0007567079,0.0007485335,0.001232007,0.0009726556,0.0005410343,0.006631692],"category_scores_gemma":[0.002274028,0.0004738857,0.0005314678,0.001146612,0.001673453,0.001902033,0.001909419,0.001306044,0.0006757266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001005826,"about_ca_system_score_gemma":0.0003585062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001080596,"about_ca_topic_score_gemma":0.001052892,"domain_scores_codex":[0.9995178,0.00006194763,0.00002018441,0.0001422138,0.0001350919,0.0001227372],"domain_scores_gemma":[0.9985415,0.0007369803,0.0002351632,0.0002141014,0.00009907856,0.0001732523],"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.0005811215,0.0001231326,0.008784972,0.0005655783,0.00006865276,0.001004212,0.001491461,0.06405596,0.05452212,0.7608313,0.004588895,0.1033825],"study_design_scores_gemma":[0.0001520234,0.0003141808,0.00672175,0.00007601864,0.0001026254,0.001443709,0.0006516633,0.07154255,0.03778427,0.8598464,0.02126656,0.00009824716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7682641,0.0008744796,0.1955254,0.0007142098,0.00004777785,0.00007040633,0.0004063171,0.0009832568,0.03311393],"genre_scores_gemma":[0.9802532,0.0005452224,0.01360956,0.0001371448,0.00005731763,0.00006742754,0.0003702976,0.0001118919,0.004847916],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006631692,"threshold_uncertainty_score":0.02218527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}