{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":55,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":55,"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"},"query_hash":"a5cad2b17e9c","filters":{"venue":"Annals of Combinatorics"}},"results":[{"id":"W2025031873","doi":"10.1007/pl00001274","title":"The Number of Ramified Coverings of the Sphere by the Torus and Surfaces of Higher Genera","year":2000,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":137,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Ramification; Mathematics; Torus; Conjecture; Combinatorics; Pure mathematics; Action (physics); Discrete mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03859772107404698,"gpt":0.3310167604778971,"spread":0.2924190394038501,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005911617,0.0002013048,0.0005169723,0.00001123134,0.0001156171,0.0000140361,0.0007133493,0.0001166488,0.00007020958],"category_scores_gemma":[0.0003628344,0.0001098995,0.0001547736,0.0003475781,0.0004590176,0.0000887312,0.0001590362,0.0001740684,0.000001357286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001166261,"about_ca_system_score_gemma":0.00004737938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000422515,"about_ca_topic_score_gemma":0.000002137556,"domain_scores_codex":[0.9981102,0.0001466597,0.0007677712,0.0001438812,0.000599609,0.0002319153],"domain_scores_gemma":[0.9962734,0.001600299,0.0008261018,0.0008546024,0.0004042666,0.00004131847],"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.00007637816,0.0004173576,0.0009246205,0.0004075805,0.0001661978,3.461026e-7,0.0007206307,0.00003221413,0.002208662,0.9793611,0.01444333,0.001241616],"study_design_scores_gemma":[0.0005348929,0.00009121704,0.0005451374,0.0001081503,0.00005883565,0.000002437989,0.0001536151,0.0000541312,0.09207614,0.8924199,0.01382858,0.000126985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9906874,0.001394837,0.00002539664,0.0005069433,0.0004025828,0.0003354877,0.00002805966,0.00001395447,0.006605283],"genre_scores_gemma":[0.9955889,0.0008267917,0.0002584546,0.00004275448,0.00001709678,0.000008021736,5.742695e-7,0.00003305249,0.003224368],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08986747,"threshold_uncertainty_score":0.4481572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973793988","doi":"10.1007/s00026-015-0251-3","title":"The Highly Connected Matroids in Minor-Closed Classes","year":2015,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Minor (academic); Combinatorics; Characterization (materials science); Class (philosophy); Graphic matroid; State (computer science); Discrete mathematics; Computer science; Algorithm; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0879982621014941,"gpt":0.3500508875650962,"spread":0.2620526254636021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001320386,0.0001272403,0.0002090872,0.000181769,0.00008589208,0.00008491374,0.001596263,0.0000660369,0.000001105634],"category_scores_gemma":[0.0007752604,0.00009751569,0.00006141514,0.001416702,0.0001640021,0.0003871275,0.0003424219,0.000218227,0.00002344938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000029443,"about_ca_system_score_gemma":0.0001813102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000239782,"about_ca_topic_score_gemma":0.0000118904,"domain_scores_codex":[0.998125,0.0002784797,0.0003203868,0.0002394817,0.0005917798,0.0004449293],"domain_scores_gemma":[0.9974425,0.0008103545,0.0001294027,0.0007824064,0.0006743418,0.0001610045],"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.0000356005,0.0001132426,0.002207629,0.00000805714,0.0000107847,0.00001583524,0.0002144699,0.00003192304,0.0001643585,0.9909205,0.003887141,0.002390424],"study_design_scores_gemma":[0.000672376,0.0003151602,0.004082463,0.00001531169,0.000001156293,0.000003771166,0.0001116117,0.001630996,0.01123113,0.9671897,0.01460355,0.0001427188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9537286,0.004119939,0.01615287,0.01190901,0.001268509,0.0005424529,0.000005166018,0.0002234287,0.01205005],"genre_scores_gemma":[0.9987143,0.0001769321,0.0004968353,0.0001411422,0.00001343543,0.00001436853,0.000001044873,0.00001034015,0.0004316445],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04498568,"threshold_uncertainty_score":0.3976575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009700041","doi":"10.1007/s00026-011-0094-5","title":"Cores of Geometric Graphs","year":2011,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Indifference graph; Chordal graph; Clique-sum; Metric dimension; Cograph; 1-planar graph; Pathwidth; Block graph; Discrete mathematics; Graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.06872167980822945,"gpt":0.2385901516870525,"spread":0.169868471878823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002268102,0.00008866805,0.0002148212,0.0003294582,0.00001369437,0.000002211649,0.0001904173,0.00006325978,0.00003683874],"category_scores_gemma":[0.00003058385,0.00008715184,0.0001009212,0.0009170694,0.00004594432,0.00006757365,0.00001550843,0.00006410275,0.000007549191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001990778,"about_ca_system_score_gemma":0.000004771601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001707056,"about_ca_topic_score_gemma":3.84606e-7,"domain_scores_codex":[0.9993671,0.00002154541,0.0002620896,0.00006315668,0.0001413473,0.0001447705],"domain_scores_gemma":[0.9994782,0.0000492619,0.00007048381,0.000224337,0.0001286733,0.00004907976],"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.00001662471,0.0001661115,0.01792907,0.0003436025,0.0001261547,0.000003867121,0.0005541125,0.00005857227,0.0007602703,0.9755416,0.003301011,0.00119904],"study_design_scores_gemma":[0.0003431432,0.0003332745,0.0429075,0.0000721797,0.00002367698,0.000003740064,0.0001739969,0.000120776,0.3198238,0.6339347,0.002009375,0.0002538453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9638162,0.002158126,0.000239242,0.000002595069,0.0005630653,0.000065466,0.000007480659,0.00006812361,0.03307974],"genre_scores_gemma":[0.9995857,0.0003235415,0.00001629972,0.000006582466,0.000004850203,0.000003455715,0.000001199302,0.0000141627,0.00004415328],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3416069,"threshold_uncertainty_score":0.3553949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085879054","doi":"10.1007/s00026-012-0139-4","title":"Euler’s Pentagonal Number Theorem and the Rogers-Fine Identity","year":2012,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Identity (music); Combinatorics; Euler's formula; Pure mathematics; Discrete mathematics; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.115915998757068,"gpt":0.4068576232975202,"spread":0.2909416245404521,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004137513,0.0001633211,0.0003766654,0.00004998702,0.0001364995,0.00004446125,0.0004183819,0.0000813664,0.0005048537],"category_scores_gemma":[0.001350113,0.0001103058,0.0001539829,0.0003139042,0.0005416883,0.0004109341,0.0003112212,0.0002601192,0.0001007798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001654847,"about_ca_system_score_gemma":0.00003413182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000261592,"about_ca_topic_score_gemma":0.000003369979,"domain_scores_codex":[0.9979892,0.0003459681,0.0003680246,0.0001435689,0.0007044522,0.0004487802],"domain_scores_gemma":[0.9969575,0.001897966,0.0001998236,0.0004721941,0.0003029883,0.0001695616],"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.00008567834,0.0002601243,0.01980949,0.00006745466,0.0001167491,0.000001577498,0.0006018608,6.680754e-8,0.0000100528,0.9709033,0.007959485,0.0001841175],"study_design_scores_gemma":[0.001017439,0.00002112381,0.00185258,0.00002027283,0.00005226253,0.00002231734,0.0002628707,0.00004096557,0.001125798,0.994114,0.001346771,0.0001235364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.939162,0.001044421,0.001118103,0.002625664,0.0004123794,0.0003529234,0.00001131677,0.00004927601,0.05522395],"genre_scores_gemma":[0.9977313,0.0001646948,0.0000942219,0.000133059,0.00009254667,0.00001121925,0.000002139259,0.00002684974,0.001743941],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05856936,"threshold_uncertainty_score":0.5527793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014451575","doi":"10.1007/s00026-011-0102-9","title":"The Moduli Space of Curves, Double Hurwitz Numbers, and Faber’s Intersection Number Conjecture","year":2011,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Moduli space; Conjecture; Combinatorics; Intersection (aeronautics); Genus; Ramification; Locus (genetics); Dimension (graph theory); Pure mathematics; Hyperelliptic curve","retraction":null,"screen_n_in":null,"score":{"opus":0.1011452616277328,"gpt":0.3270918944405093,"spread":0.2259466328127766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008663661,0.0001726469,0.0003340601,0.00004335924,0.0001091089,0.00001055593,0.0002478505,0.0001278924,0.000123757],"category_scores_gemma":[0.0002401908,0.0001301556,0.0001097642,0.0003191958,0.0002344258,0.0001423084,0.0001108679,0.0002154334,0.000008882149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009582359,"about_ca_system_score_gemma":0.00002951587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001528769,"about_ca_topic_score_gemma":0.00001493642,"domain_scores_codex":[0.9988357,0.0001047683,0.0003858557,0.000172955,0.0002677489,0.0002330038],"domain_scores_gemma":[0.998407,0.0004199214,0.000379059,0.0004298941,0.0002860443,0.00007808004],"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.0001563197,0.0002262006,0.00320928,0.0004003808,0.000141179,0.000002168696,0.001550196,1.010398e-7,0.00004122766,0.9769406,0.0170882,0.0002441381],"study_design_scores_gemma":[0.000575371,0.000155319,0.0009002911,0.0001767111,0.00005309636,0.00002321155,0.0006900616,0.000004564547,0.03756967,0.9569511,0.002745791,0.0001547757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9376476,0.001918065,0.0007067203,0.0007197548,0.0006771924,0.0003427653,0.000009113091,0.00005543402,0.0579234],"genre_scores_gemma":[0.9969575,0.001056421,0.0001516995,0.00007874124,0.00002051829,0.00000793768,0.000002146656,0.00002248974,0.001702517],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05930997,"threshold_uncertainty_score":0.5307593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990285456","doi":"10.1007/pl00001293","title":"Cellular Structures Determined by Polygons and Trees","year":2001,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Polytope; Combinatorics; Moduli space; Polyhedron; Integer (computer science); Space (punctuation); Enumeration; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03134408109571775,"gpt":0.2736930031292617,"spread":0.242348922033544,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000145764,0.0001083081,0.000217386,0.0001660459,0.00007104065,0.00006031241,0.0005981033,0.00006182608,0.00002291495],"category_scores_gemma":[0.0001046248,0.00008514064,0.00005468777,0.001072781,0.00007088904,0.0002319374,0.0002207885,0.00006828157,0.000003642866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002801263,"about_ca_system_score_gemma":0.000009984263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000773735,"about_ca_topic_score_gemma":0.000002302779,"domain_scores_codex":[0.9990876,0.00003924313,0.0001973833,0.000233744,0.000227357,0.0002146533],"domain_scores_gemma":[0.9991972,0.0001194032,0.00009864001,0.0003782768,0.00008734706,0.0001190807],"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.00001542081,0.0003995462,0.01509824,0.00001790152,0.0001221277,0.00007210285,0.000152526,0.00001018715,0.004210637,0.8439094,0.02920439,0.1067876],"study_design_scores_gemma":[0.0007009763,0.0008716768,0.02889074,0.000009802115,0.00004278544,0.00002494636,0.00004261494,0.002955118,0.05024935,0.7966191,0.1190332,0.0005596947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9392198,0.005291149,0.04995652,0.003382534,0.0001930974,0.00007129478,0.00002491864,0.00008394787,0.001776709],"genre_scores_gemma":[0.9981349,0.0007717537,0.000316548,0.000245138,0.00001051005,0.000001344749,0.000006871864,0.000002978868,0.0005099585],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1062279,"threshold_uncertainty_score":0.3471934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108209903","doi":"10.1007/s00026-008-0333-6","title":"Non-Holonomicity of Sequences Defined via Elementary Functions","year":2008,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Sequence (biology); Logarithm; Riemann hypothesis; Elementary function; Riemann zeta function; Bounded function; Integer (computer science); Holonomic; Elementary proof; Function (biology); Combinatorics; Digamma function; Pure mathematics; Discrete mathematics; Arithmetic zeta function; Prime zeta function; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1311582204646849,"gpt":0.3472170242457934,"spread":0.2160588037811085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002243881,0.0001031343,0.0002769831,0.00007280669,0.00009697321,0.000003061978,0.0002030896,0.00005103787,0.00009170441],"category_scores_gemma":[0.00008246043,0.00009849983,0.0001093558,0.0002418189,0.0001008917,0.0000586757,0.000051439,0.00007297653,0.0000224046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008832394,"about_ca_system_score_gemma":0.00005891114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007985904,"about_ca_topic_score_gemma":0.000003113987,"domain_scores_codex":[0.9990724,0.0000146866,0.0004591199,0.0001172944,0.0001963926,0.0001401052],"domain_scores_gemma":[0.9987927,0.0002178515,0.0003326137,0.0003597422,0.0002416636,0.00005543217],"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.0000260567,0.002433673,0.007377654,0.0004776598,0.0002047365,0.000004755681,0.001290139,0.00001646241,0.004613619,0.8444599,0.1387368,0.0003585366],"study_design_scores_gemma":[0.0002724117,0.0002017307,0.0009834713,0.00003161353,0.00003422405,0.00001205082,0.0001327415,0.0002537401,0.04967022,0.945752,0.002513895,0.0001419379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9868516,0.00005361385,0.003891446,0.0004513889,0.00007147845,0.0002094695,0.00002349797,0.00002459503,0.008422876],"genre_scores_gemma":[0.996753,0.0001288963,0.002518303,0.00006897074,0.00001362554,0.00002341732,0.000008150286,0.00001261296,0.0004730325],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1362229,"threshold_uncertainty_score":0.4016707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078935483","doi":"10.1007/s000260200006","title":"Enumeration of Rooted Cubic Planar Maps","year":2002,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Enumeration; Combinatorics; Mathematics; Planar; Planar graph; Discrete mathematics; Computer science; Graph; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.05856235887585335,"gpt":0.268270643138712,"spread":0.2097082842628586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001173323,0.00006567979,0.0001295976,0.0000791793,0.00004306697,0.00001803394,0.0004404023,0.00004280633,0.00001525519],"category_scores_gemma":[0.00002175991,0.00006804832,0.00005443069,0.0004863619,0.00002428395,0.0001816224,0.00004526395,0.00005182514,0.00003256934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004150811,"about_ca_system_score_gemma":0.00001168955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001659197,"about_ca_topic_score_gemma":7.91475e-7,"domain_scores_codex":[0.9992882,0.00002531696,0.0002313673,0.0001303007,0.0002104241,0.0001143774],"domain_scores_gemma":[0.9991603,0.00004859197,0.0001459231,0.0004422123,0.0001604947,0.00004251018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[7.644409e-7,0.0002741149,0.0002817171,0.00002308984,0.000012825,0.000001557144,0.0002844565,0.00002095578,0.004029445,0.9721068,0.01651937,0.006444879],"study_design_scores_gemma":[0.000732995,0.0003560266,0.005151231,0.00005215529,0.00001702398,0.00001141111,0.00002390167,0.1093825,0.408716,0.3984522,0.0767006,0.0004039892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4306333,0.00502476,0.5162236,0.01258645,0.0008891002,0.0007068157,0.00005281167,0.0004447823,0.03343834],"genre_scores_gemma":[0.998757,0.0001315722,0.0007325241,0.00008019078,0.000008165517,0.000004967129,0.000007938747,0.000004183286,0.0002734348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5736547,"threshold_uncertainty_score":0.277493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2416971272","doi":"10.1007/s00026-016-0320-2","title":"Increasing Tableaux, Narayana Numbers and an Instance of the Cyclic Sieving Phenomenon","year":2016,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg; University of British Columbia","funders":"","keywords":"Bijection; Young tableau; Mathematics; Combinatorics; Set (abstract data type); Hook; Phenomenon; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.08599639696818732,"gpt":0.3640545911969639,"spread":0.2780581942287765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000895352,0.0002313491,0.0005273872,0.00007956899,0.0001150052,0.00001606909,0.0005034172,0.0001127547,0.000008722546],"category_scores_gemma":[0.002191202,0.0001528046,0.00009275813,0.000449962,0.000242509,0.0004136793,0.0002227169,0.0001357919,0.000001295968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004450315,"about_ca_system_score_gemma":0.00006289924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002070027,"about_ca_topic_score_gemma":0.000006574721,"domain_scores_codex":[0.9980754,0.0002027827,0.000652483,0.0002462128,0.0004885619,0.000334559],"domain_scores_gemma":[0.9966015,0.001312082,0.0007676518,0.0008347303,0.0003696245,0.0001144216],"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.00004119569,0.0003229303,0.003198534,0.0003041967,0.00004455043,0.000001180603,0.0008810973,0.00000183055,0.007432134,0.986091,0.0001612426,0.001520098],"study_design_scores_gemma":[0.000645438,0.000151422,0.0004793663,0.0005003904,0.00003140484,0.000007167491,0.0002327936,0.00002254459,0.02505178,0.9721625,0.0005146302,0.0002005652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9933596,0.0003249743,0.001432095,0.0003447196,0.0003934241,0.000290013,0.0000099663,0.00005110154,0.003794074],"genre_scores_gemma":[0.997627,0.0002378748,0.001841396,0.00004747048,0.00003731208,0.000007701287,3.313016e-7,0.00004892021,0.0001519585],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01761964,"threshold_uncertainty_score":0.6231189,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1849270272","doi":"10.1007/s00026-015-0285-6","title":"The Erdős-Ko-Rado Property for Some 2-Transitive Groups","year":2015,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Transitive relation; Coset; Sigma; Group (periodic table); Algebraic number; Degree (music); Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.1544748798037622,"gpt":0.3615675778751398,"spread":0.2070926980713775,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001237148,0.0001698164,0.0002931455,0.0000464225,0.0002936567,0.0000315527,0.0004213208,0.00009199687,0.000002275174],"category_scores_gemma":[0.0009498117,0.00008810661,0.0001837329,0.0001581195,0.0001963673,0.000151028,0.00008564661,0.0001491731,0.000001821703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001510579,"about_ca_system_score_gemma":0.00006798267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005612811,"about_ca_topic_score_gemma":0.00000176472,"domain_scores_codex":[0.9986897,0.0001089038,0.0003492368,0.0001694239,0.0003564155,0.0003263722],"domain_scores_gemma":[0.9977822,0.0008422882,0.0001881525,0.0004472273,0.0006184549,0.0001216629],"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.0001215793,0.0001005263,0.00005469735,0.00006829746,0.00007960023,0.000001754713,0.00144811,0.000001135681,0.0000171125,0.9658839,0.03088358,0.001339701],"study_design_scores_gemma":[0.0005834555,0.0003211077,0.00007017737,0.00002380755,0.00002985486,0.00000375034,0.0004372681,0.00008460325,0.003881973,0.9622222,0.03219463,0.0001471854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9299228,0.006787196,0.006263051,0.01355641,0.006980468,0.003601539,0.000181193,0.0003493623,0.03235802],"genre_scores_gemma":[0.9978258,0.0001831512,0.000256419,0.000343395,0.0001113614,0.00003855993,0.000003242543,0.00003341466,0.001204631],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06790306,"threshold_uncertainty_score":0.3592883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052053714","doi":"10.1007/s00026-014-0223-z","title":"Modular Decomposition of the Orlik-Terao Algebra","year":2014,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor; Western University","funders":"","keywords":"Subvariety; Mathematics; Algebraically closed field; Hyperplane; Combinatorics; Subalgebra; Complete intersection; Algebra over a field; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05902803664066356,"gpt":0.3601776052366566,"spread":0.301149568595993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006550769,0.0002061756,0.0005052495,0.00008328458,0.00008768438,0.00001261505,0.0006292618,0.0001256155,0.00001523172],"category_scores_gemma":[0.001253858,0.000160436,0.0002318569,0.0004535132,0.000117451,0.0001427276,0.0001936371,0.000183193,0.000006414793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002119097,"about_ca_system_score_gemma":0.00003517538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004118493,"about_ca_topic_score_gemma":6.305098e-7,"domain_scores_codex":[0.9980979,0.0001775832,0.0006851453,0.0001850174,0.0005898984,0.0002644327],"domain_scores_gemma":[0.9969043,0.0007744599,0.0007095853,0.0009698434,0.0005703011,0.00007152812],"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.00001253415,0.0004076399,0.0002146161,0.0002729429,0.00003962403,4.017281e-7,0.0002236235,0.00002806929,0.002276366,0.9951819,0.0009392819,0.0004030052],"study_design_scores_gemma":[0.000404983,0.0001594762,0.0003612471,0.0001427362,0.00003369422,0.00000303813,0.00002134068,0.0005769019,0.119981,0.877078,0.001095252,0.0001423506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9707124,0.000114043,0.02131382,0.0006216901,0.001206986,0.0004172207,0.000007228681,0.00007645153,0.005530139],"genre_scores_gemma":[0.997125,0.00002707952,0.002501147,0.00009540796,0.00004726941,0.00001124042,0.000001563005,0.0000411863,0.000150127],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1181039,"threshold_uncertainty_score":0.6542389,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964363507","doi":"10.1007/s00026-009-0027-8","title":"Weighing Matrices and String Sorting","year":2009,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Sorting; String (physics); Mathematics; Algorithm; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01942700980783489,"gpt":0.247352471667844,"spread":0.2279254618600091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000251949,0.00008837076,0.0001560354,0.00008453304,0.00004576227,0.00002321848,0.00008783073,0.00004814777,0.000002315722],"category_scores_gemma":[0.00002049328,0.00009123017,0.00003729746,0.0002017909,0.0000110692,0.0001454868,0.00001058762,0.00008571421,0.000001838392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000328159,"about_ca_system_score_gemma":0.000002790781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002221507,"about_ca_topic_score_gemma":1.321894e-7,"domain_scores_codex":[0.9994273,0.00001561021,0.0002137911,0.00007482125,0.0001037454,0.0001648025],"domain_scores_gemma":[0.9997028,0.00004726321,0.00005287727,0.0001080511,0.00003875504,0.00005022994],"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.000006308672,0.00003824103,0.003558468,0.0002194962,0.00004175587,0.000007964113,0.0006383646,0.0007889014,0.002724972,0.9752077,0.000594675,0.0161731],"study_design_scores_gemma":[0.0005488194,0.0002584613,0.01527652,0.0003316387,0.00002854592,0.00001412667,0.0005290365,0.005733505,0.06448268,0.9078358,0.004406564,0.0005543217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9886003,0.004037622,0.0002843498,0.00005366547,0.0002568633,0.00004831158,9.562953e-7,0.0001253984,0.00659254],"genre_scores_gemma":[0.9994563,0.0004351869,0.00002503791,0.00002611603,0.00002618386,9.074217e-7,5.789482e-7,0.000008769874,0.0000208554],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06737197,"threshold_uncertainty_score":0.3720258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3122484752","doi":"10.1007/s00026-015-0279-4","title":"New Steps in Walks with Small Steps in the Quarter Plane: Series Expressions for the Generating Functions","year":2015,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Mathematics; Transcendental function; Series (stratigraphy); Transcendental number; Quarter (Canadian coin); Transcendental equation; Algebraic number; Plane (geometry); Combinatorics; Pure mathematics; Mathematical analysis; Geometry; Differential equation","retraction":null,"screen_n_in":null,"score":{"opus":0.2183754172125708,"gpt":0.3503153043084342,"spread":0.1319398870958634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007358153,0.000127841,0.0002021078,0.00005816393,0.0001217216,0.0000510332,0.0003234477,0.00006010629,0.0000085969],"category_scores_gemma":[0.0002620801,0.00007046138,0.0000464081,0.0003068356,0.0000329979,0.00007638646,0.00003703273,0.0001571845,0.000003703971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001001996,"about_ca_system_score_gemma":0.0001208809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008015197,"about_ca_topic_score_gemma":0.0003049374,"domain_scores_codex":[0.9990308,0.00006104256,0.0003568284,0.0001293265,0.0002309126,0.0001911271],"domain_scores_gemma":[0.9980731,0.001040394,0.0001783388,0.0004799645,0.0001687481,0.00005944531],"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.00004713865,0.0004866103,0.0004278753,0.0001033363,0.00003533531,0.000002133538,0.01018419,0.0001918372,0.00007357224,0.83148,0.1564685,0.0004994203],"study_design_scores_gemma":[0.001338583,0.0004674034,0.0002645667,0.0001851453,0.00004901399,0.00001797641,0.02142506,0.00164524,0.0007103283,0.9295872,0.04405543,0.0002540171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7918894,0.001246618,0.1493415,0.03362918,0.0004909236,0.00531122,0.0001074383,0.0001250032,0.01785871],"genre_scores_gemma":[0.9872311,0.00003745664,0.009926618,0.0002760649,0.00007131391,0.0004785059,0.00001254503,0.00002959186,0.001936763],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1953417,"threshold_uncertainty_score":0.2873332,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069058448","doi":"10.1007/s00026-011-0092-7","title":"Cyclic (v; r, s; λ) Difference Families with Two Base Blocks and v ≤ 50","year":2011,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary Golay code; Base (topology); Block (permutation group theory); Binary number; Autocorrelation; Difference set; Complementary sequences; Zero (linguistics); Block design","retraction":null,"screen_n_in":null,"score":{"opus":0.03562129341861205,"gpt":0.2236691514886084,"spread":0.1880478580699963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001233499,0.0001333555,0.0001994913,0.00008716445,0.00003526429,0.000009308764,0.0001217189,0.00004519837,0.00001177118],"category_scores_gemma":[0.000009118809,0.0001113847,0.00003039152,0.0001771585,0.0000739578,0.00006974122,0.00002011829,0.00009333958,0.000003032932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002479053,"about_ca_system_score_gemma":0.000005424446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004037085,"about_ca_topic_score_gemma":0.00000494482,"domain_scores_codex":[0.9994182,0.00002499066,0.0001577729,0.0001067029,0.000116643,0.0001756806],"domain_scores_gemma":[0.9995575,0.00004361771,0.00003791508,0.0002222575,0.00005927642,0.00007944438],"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.0001614827,0.0004499905,0.1265109,0.0007919947,0.0003855478,0.00005271087,0.007482126,0.0001420123,0.007291402,0.8469612,0.001235295,0.008535315],"study_design_scores_gemma":[0.003070719,0.001518173,0.1580614,0.0005930188,0.0001271437,0.00007543385,0.002060474,0.002093501,0.2954301,0.5309013,0.004495181,0.001573559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9848805,0.001094164,0.0003536257,0.000009757333,0.0001615672,0.00007613331,0.000004043798,0.00009497376,0.01332522],"genre_scores_gemma":[0.9994742,0.0003235133,0.00003935353,0.00002430868,0.000008365741,0.000009070764,0.0000010616,0.00001738032,0.0001028024],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3160599,"threshold_uncertainty_score":0.4542137,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963227754","doi":"10.1007/s00026-017-0341-5","title":"On the Convergence of Monotone Hurwitz Generating Functions","year":2017,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; University of Waterloo","funders":"","keywords":"Monotone polygon; Mathematics; Hurwitz polynomial; Hurwitz matrix; Routh–Hurwitz stability criterion; Combinatorics; Algebraic number; Discrete mathematics; Genus; Pure mathematics; Polynomial; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.06432653068586572,"gpt":0.3003179496197319,"spread":0.2359914189338662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002839203,0.0000712947,0.0001181614,0.00003717214,0.00032465,0.00006089342,0.0008760762,0.00002753584,0.000009793162],"category_scores_gemma":[0.0002776538,0.00005321099,0.00006370379,0.0001099695,0.00007636371,0.0002167404,0.0001901611,0.00007346312,0.00001908281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003997553,"about_ca_system_score_gemma":0.0000563095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006871199,"about_ca_topic_score_gemma":9.975895e-7,"domain_scores_codex":[0.9992997,0.00003582005,0.0001948722,0.0001358178,0.0002162645,0.0001175157],"domain_scores_gemma":[0.9985965,0.0001808826,0.00031946,0.0006605893,0.0002040595,0.00003847156],"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.000003621136,0.00006874242,0.0001692292,0.000005161205,0.00001252632,8.698771e-7,0.0001476253,0.0003396377,0.0006098852,0.9897181,0.00298713,0.005937509],"study_design_scores_gemma":[0.0002566907,0.0003953972,0.006056583,0.00004609899,0.000005373292,0.000002111437,0.00002266743,0.1150487,0.07504255,0.8016393,0.001330075,0.0001544931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8864531,0.00009083305,0.1033626,0.004827586,0.001561099,0.0001041053,0.000002213387,0.00002526802,0.003573212],"genre_scores_gemma":[0.9990858,0.00002137895,0.0002481427,0.0002826479,0.00003568981,0.000004691801,4.513164e-7,0.000003099099,0.0003180321],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1880788,"threshold_uncertainty_score":0.2496978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1927422331","doi":"10.1007/s00026-016-0321-1","title":"A Generating Tree Approach to k-Nonnesting Partitions and Permutations","year":2016,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Capilano University; Simon Fraser University","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Permutation (music); Partition (number theory); Bounded function; Discrete mathematics; Tree (set theory); Generating function; Young tableau; Lattice (music)","retraction":null,"screen_n_in":null,"score":{"opus":0.153119084515007,"gpt":0.3703183694863432,"spread":0.2171992849713362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004183462,0.000182543,0.0003400968,0.000130363,0.0001656499,0.00002650098,0.0001870777,0.00007515577,0.000005234297],"category_scores_gemma":[0.003301843,0.0001429957,0.00006771497,0.0004015151,0.00006930724,0.0001982284,0.0001208172,0.00008986121,0.000007404112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002230846,"about_ca_system_score_gemma":0.00004453468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002355833,"about_ca_topic_score_gemma":0.00000138152,"domain_scores_codex":[0.9985809,0.00006852005,0.0004965898,0.000248338,0.0003014915,0.0003041571],"domain_scores_gemma":[0.9976667,0.001111388,0.0002368241,0.0003870834,0.0004240167,0.0001740594],"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.00000442411,0.0002892572,0.0001579414,0.0001035593,0.00002313652,0.000001182637,0.0007467192,0.00002431542,0.001977556,0.9938333,0.001245021,0.001593599],"study_design_scores_gemma":[0.000407347,0.0001237854,0.00009750105,0.0001344653,0.00002503962,0.00001009208,0.0001999388,0.0004269222,0.004963837,0.9930396,0.0003664361,0.0002050275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7204297,0.000113423,0.2650001,0.001755661,0.0003109171,0.0005606934,0.00002170238,0.000189699,0.01161807],"genre_scores_gemma":[0.955568,0.00002465238,0.04380128,0.00008559509,0.00006088888,0.00007717097,0.000001351786,0.00003934799,0.0003417248],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2351383,"threshold_uncertainty_score":0.5831197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083140175","doi":"10.1007/s00026-005-0248-4","title":"Collinear Points in Permutations","year":2005,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Transversal (combinatorics); Prime (order theory); Upper and lower bounds; Intersection (aeronautics); Discrete geometry; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03988005282922381,"gpt":0.3060809598074195,"spread":0.2662009069781957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003737885,0.00006395338,0.000108872,0.0001874677,0.00004109373,0.00002527751,0.0004463776,0.00003444271,0.00001030844],"category_scores_gemma":[0.00005632179,0.00006765362,0.0000605839,0.0008693828,0.00002963618,0.0002811403,0.00007255696,0.00008873252,0.00002201989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006321331,"about_ca_system_score_gemma":0.00003507138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005157368,"about_ca_topic_score_gemma":0.000004208348,"domain_scores_codex":[0.9993182,0.00005355109,0.0001896708,0.0001301916,0.0001558989,0.0001524738],"domain_scores_gemma":[0.9993878,0.0001072406,0.00006090874,0.0002757414,0.0001214677,0.00004681143],"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.00000321821,0.0001770769,0.001454175,0.000004543153,0.000004308793,0.000002233867,0.0005167832,0.00009839878,0.000031847,0.9929337,0.0007451606,0.004028573],"study_design_scores_gemma":[0.0003816481,0.000135105,0.006822098,0.00002333973,0.000001943618,0.000002932486,0.0000298758,0.00906107,0.006639078,0.9568563,0.01989794,0.0001487412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.901154,0.0006153995,0.07049071,0.01285158,0.0003790148,0.0001737536,0.000004144579,0.0001389778,0.01419236],"genre_scores_gemma":[0.9976654,0.00005727579,0.00172831,0.0004518188,0.00001354241,0.000004068643,7.168175e-7,0.000003488738,0.00007539421],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09651133,"threshold_uncertainty_score":0.2758835,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2270530270","doi":"10.1007/s00026-016-0303-3","title":"The Pieri Rule for Dual Immaculate Quasi-Symmetric Functions","year":2016,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Toronto; York University","funders":"","keywords":"Multiplicity (mathematics); Symmetric function; Basis (linear algebra); Dual (grammatical number); Lift (data mining)","retraction":null,"screen_n_in":null,"score":{"opus":0.09971775421731881,"gpt":0.3650536561550194,"spread":0.2653359019377006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008264792,0.0002615915,0.0004441755,0.0001499812,0.0003759568,0.00003918464,0.0004421603,0.0001411373,0.00001756688],"category_scores_gemma":[0.006274951,0.0001575728,0.000290178,0.0006753252,0.0001575993,0.0002034973,0.0001367146,0.0001215349,0.00006035611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005064999,"about_ca_system_score_gemma":0.0001021608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003160116,"about_ca_topic_score_gemma":9.870103e-7,"domain_scores_codex":[0.9978797,0.00007985454,0.0007211412,0.0002641787,0.0005226168,0.0005324475],"domain_scores_gemma":[0.9919783,0.005557772,0.0005442732,0.0008295731,0.0009501686,0.0001399344],"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.00006586068,0.0005257182,0.00003005104,0.00007750457,0.00009644695,0.000001920453,0.00007275219,4.28522e-7,0.0002838772,0.9833871,0.009825566,0.005632836],"study_design_scores_gemma":[0.0009852923,0.0006237961,0.00002674215,0.00006312832,0.00005011581,0.000009268048,0.00009232373,0.00003343988,0.00909601,0.9499709,0.03882876,0.0002202015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6778182,0.002853566,0.2486451,0.0213799,0.01426423,0.004879059,0.0002854188,0.0009799425,0.02889453],"genre_scores_gemma":[0.9898201,0.0003848478,0.001368242,0.0000615138,0.000151028,0.0001719889,0.000002609318,0.00008918384,0.00795049],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3120019,"threshold_uncertainty_score":0.7512156,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079613279","doi":"10.1007/s00026-007-0306-1","title":"Multiplicity Free Expansions of Schur P-Functions","year":2007,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Multiplicity (mathematics); Mathematics; Symmetric group; Character (mathematics); Pure mathematics; Schur polynomial; Young tableau; Schur product theorem; Irreducible representation; Combinatorics; Symmetric function; Schur complement; Mathematical analysis; Macdonald polynomials; Schur decomposition; Physics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.1229101046788618,"gpt":0.3901782875329132,"spread":0.2672681828540515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001058394,0.0002411376,0.000601226,0.000245135,0.0001101078,0.000007531886,0.0006063852,0.000195368,0.0000447134],"category_scores_gemma":[0.005787778,0.0002410747,0.0002361649,0.0008055582,0.0001555171,0.0001829613,0.0002587482,0.0002656187,0.00001898385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003019223,"about_ca_system_score_gemma":0.00008452567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002881185,"about_ca_topic_score_gemma":0.000007457591,"domain_scores_codex":[0.9976255,0.00005086798,0.0009980919,0.0002316606,0.0006801379,0.0004137981],"domain_scores_gemma":[0.9949102,0.001910787,0.0006907744,0.001235361,0.001076517,0.0001763667],"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.00004553582,0.001175973,0.0003717857,0.0002023377,0.00006335218,0.000005295888,0.000441089,0.000006099158,0.002239285,0.9904959,0.00457777,0.0003755496],"study_design_scores_gemma":[0.0007700589,0.0002713064,0.000315992,0.0001003279,0.00003809699,0.000005140074,0.0004059459,0.00002789036,0.1005671,0.8960593,0.001245981,0.0001929064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9312248,0.0001938056,0.04640193,0.0002867069,0.001211891,0.0004871369,0.00003393349,0.0001711773,0.01998858],"genre_scores_gemma":[0.9927247,0.0000523582,0.006407291,0.0000480761,0.00005039604,0.00001004113,0.000002876617,0.00004930022,0.0006549197],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0983278,"threshold_uncertainty_score":0.9830741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123948060","doi":"10.1007/s00026-013-0177-6","title":"Multiplicity Free Schur, Skew Schur, and Quasisymmetric Schur Functions","year":2013,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Multiplicity (mathematics); Schur's theorem; Schur's lemma; Schur polynomial; Combinatorics; Skew; Schur algebra; Schur product theorem; Schur complement; Schur decomposition; Discrete mathematics; Pure mathematics; Macdonald polynomials; Orthogonal polynomials; Mathematical analysis; Computer science; Discrete orthogonal polynomials; Gegenbauer polynomials; Classical orthogonal polynomials","retraction":null,"screen_n_in":null,"score":{"opus":0.09868087161366132,"gpt":0.3444571678942561,"spread":0.2457762962805948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064152,0.0004669613,0.0008584652,0.0005033675,0.0002842891,0.0001070969,0.0007537797,0.0003159726,0.0001851722],"category_scores_gemma":[0.007781231,0.0004566024,0.0002168581,0.001488676,0.0002120673,0.0006888844,0.0005364157,0.0005031573,0.0002873814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005322753,"about_ca_system_score_gemma":0.00008579093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001130162,"about_ca_topic_score_gemma":0.000003520241,"domain_scores_codex":[0.9969003,0.0001375018,0.0009773205,0.0004931391,0.0008372241,0.0006545565],"domain_scores_gemma":[0.9943462,0.001834322,0.0006517753,0.001487715,0.001300163,0.0003798529],"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.00001707971,0.001008937,0.0008260188,0.0003787838,0.0001203811,0.000003876066,0.0002049155,0.000001955249,0.0003311007,0.9695029,0.02541832,0.00218572],"study_design_scores_gemma":[0.001359658,0.0004042922,0.0009467223,0.0001227177,0.00007000387,0.00001425445,0.0002516377,0.0002496422,0.005098887,0.9879611,0.003064306,0.0004567385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9654479,0.001540091,0.01049927,0.001807049,0.00148416,0.001491259,0.00003452044,0.0004160041,0.01727976],"genre_scores_gemma":[0.9881421,0.000463886,0.008699775,0.0001924311,0.00009642662,0.0001312084,0.000005111841,0.00009674641,0.002172252],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02269427,"threshold_uncertainty_score":0.9997886,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037416325","doi":"10.1007/s00026-013-0202-9","title":"Solving Non-Homogeneous Nested Recursions Using Trees","year":2013,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Recursion (computer science); Tree (set theory); Binary tree; Double recursion; Homogeneous; Interpretation (philosophy); Mathematics; Term (time); Combinatorics; Generalization; Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.05390717657397869,"gpt":0.3014080344625421,"spread":0.2475008578885634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001768231,0.0001439552,0.0002231109,0.0001264973,0.0001780744,0.0001220612,0.0009015128,0.00008129809,0.00001978893],"category_scores_gemma":[0.00006465039,0.0001286533,0.00008278473,0.00052727,0.00003782048,0.0008279769,0.0004845446,0.0001134208,0.00003264843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001211641,"about_ca_system_score_gemma":0.0000697985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002318973,"about_ca_topic_score_gemma":0.000001248979,"domain_scores_codex":[0.9987519,0.00004729964,0.0002944277,0.0002679234,0.0003248864,0.000313512],"domain_scores_gemma":[0.9984302,0.0001176688,0.0001846868,0.0007063678,0.000416508,0.0001445683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002636249,0.002909859,0.01033389,0.0002226583,0.00023838,0.000172723,0.003466761,0.003330357,0.05248814,0.4726822,0.1389445,0.3151841],"study_design_scores_gemma":[0.0006512203,0.0004461179,0.01630679,0.0002860642,0.00001659598,0.00005192243,0.00009408804,0.7788288,0.0381397,0.1574694,0.006997081,0.0007122586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6474295,0.0009997489,0.3469496,0.001080708,0.001415791,0.0003413557,0.000007241327,0.000164769,0.001611258],"genre_scores_gemma":[0.9884163,0.0001231211,0.01109871,0.0001957831,0.00003755519,0.000006169368,0.000004282524,0.00001207927,0.0001060173],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7754984,"threshold_uncertainty_score":0.524633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969959148","doi":"10.1007/s00026-011-0095-4","title":"Enumerative Properties of NC (B) (p,q)","year":2011,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Partially ordered set; Generating function; Type (biology); Rank (graph theory); Möbius function; Lattice (music); Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.4083369210621418,"gpt":0.3648739633036224,"spread":0.04346295775851938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004273112,0.0002140555,0.0005954369,0.0001203874,0.0000470725,0.000004669295,0.0004112786,0.0001174225,0.00003684901],"category_scores_gemma":[0.001246588,0.0001854808,0.0001516752,0.000368468,0.0001840564,0.00021068,0.0001308397,0.0001558243,0.000009169266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000136243,"about_ca_system_score_gemma":0.00006929376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001530418,"about_ca_topic_score_gemma":9.356173e-7,"domain_scores_codex":[0.998312,0.00008855531,0.0007281321,0.0001761654,0.0004299025,0.0002652524],"domain_scores_gemma":[0.9975445,0.0002164156,0.0006451664,0.0005793596,0.0009345494,0.00007997527],"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.00005470355,0.0008480672,0.0002164061,0.000447279,0.00008454623,0.000002644199,0.004402807,4.400748e-7,0.001612915,0.9915596,0.0005994652,0.0001711505],"study_design_scores_gemma":[0.0002317799,0.0002353686,0.00004205102,0.0001238357,0.0000210544,0.000001582698,0.0002140384,0.00001269064,0.3746819,0.6241881,0.0001276059,0.0001199866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9687753,0.000641462,0.003361718,0.00008832722,0.000788859,0.0005516223,0.000009918725,0.0001145631,0.02566823],"genre_scores_gemma":[0.9956079,0.000077745,0.003922346,0.00002419829,0.00002024922,0.0000201087,5.226694e-7,0.000039517,0.0002874404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.373069,"threshold_uncertainty_score":0.7563687,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129157321","doi":"10.1007/s00026-008-0354-1","title":"Equality of Schur’s Q-functions and Their Skew Analogues","year":2008,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Skew; Schur polynomial; Schur's theorem; Combinatorics; Schur product theorem; Schur complement; Pure mathematics; Schur decomposition; Algebra over a field; Macdonald polynomials; Orthogonal polynomials; Eigenvalues and eigenvectors; Physics; Classical orthogonal polynomials","retraction":null,"screen_n_in":null,"score":{"opus":0.2046844264126622,"gpt":0.3693505572050558,"spread":0.1646661307923935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000546665,0.000228525,0.0006764089,0.0001442407,0.0001267643,0.000006357599,0.0002581935,0.0001346203,0.00001348485],"category_scores_gemma":[0.001320162,0.0001989623,0.0001515284,0.0004763249,0.0002951921,0.0001837664,0.0001476474,0.0001848472,0.000003883198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001498522,"about_ca_system_score_gemma":0.00007229292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001316993,"about_ca_topic_score_gemma":0.000002319561,"domain_scores_codex":[0.9984021,0.0001096515,0.0007208529,0.0002112389,0.0002948705,0.0002612753],"domain_scores_gemma":[0.9970056,0.001047776,0.0005525592,0.0006128234,0.0006650029,0.000116207],"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.00001863158,0.000590926,0.0008059892,0.000328467,0.00008266774,0.000002051232,0.0008759429,0.000001221617,0.0003937201,0.99453,0.002093018,0.0002773424],"study_design_scores_gemma":[0.00042293,0.0002597261,0.0004531633,0.0000764862,0.000022806,0.00001406315,0.000264463,0.0000381794,0.02284686,0.9742307,0.001190045,0.0001805491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.982933,0.0007717204,0.009898765,0.0002482807,0.0004494775,0.0002722749,0.00004216208,0.00009789508,0.005286443],"genre_scores_gemma":[0.9975775,0.0004982094,0.001399808,0.00002798325,0.00003041711,0.00001004361,0.000004600107,0.00003145047,0.0004199228],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02245313,"threshold_uncertainty_score":0.8113447,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967512075","doi":"10.1007/s00026-012-0163-4","title":"Cops and Robber Game with a Fast Robber on Expander Graphs and Random Graphs","year":2012,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Cartesian product; Vertex (graph theory); Graph; Discrete mathematics; Random graph; Upper and lower bounds","retraction":null,"screen_n_in":null,"score":{"opus":0.05001114505301214,"gpt":0.3106557785154308,"spread":0.2606446334624187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005521647,0.0002773398,0.0004850644,0.0001824667,0.0001503996,0.00003076818,0.0001332756,0.0001410175,0.00002513772],"category_scores_gemma":[0.0001195165,0.0001928927,0.00009333462,0.0002610586,0.0002857028,0.0002006203,0.00009332409,0.0002212167,8.732073e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004577204,"about_ca_system_score_gemma":0.00001207041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006279384,"about_ca_topic_score_gemma":0.000001838216,"domain_scores_codex":[0.9986252,0.00009737916,0.0003030728,0.0002234503,0.0003461695,0.0004046944],"domain_scores_gemma":[0.9984649,0.0005825369,0.0002006285,0.0003758025,0.0001682931,0.0002077731],"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.0003074967,0.0002273925,0.02015107,0.0001142938,0.000157802,0.000003066629,0.001886578,0.000001003123,0.00002918952,0.9743769,0.002108746,0.0006365191],"study_design_scores_gemma":[0.002534989,0.0003621998,0.01009004,0.0000943631,0.00008100367,0.000031062,0.0002654918,0.000007340676,0.001546268,0.9835808,0.001111979,0.0002944149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9927917,0.001667028,0.0001271016,0.0001499772,0.0002490361,0.0002747002,0.000008090084,0.00004733356,0.004685022],"genre_scores_gemma":[0.9985079,0.0006517688,0.000191702,0.000314586,0.00002141984,0.00001482259,0.000002239714,0.00003938731,0.0002561836],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01006103,"threshold_uncertainty_score":0.7865937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053104190","doi":"10.1007/s000260300005","title":"Posets of Matrices and Permutations with Forbidden Subsequences","year":2003,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Partially ordered set; Enumeration; Permutation (music); Subsequence; Longest common subsequence problem; Rank (graph theory); Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1026189913562735,"gpt":0.3681253956720894,"spread":0.2655064043158158,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003740545,0.0001691239,0.0004214412,0.0001291999,0.00006352805,0.00001417388,0.0001801332,0.00007559538,0.00001179296],"category_scores_gemma":[0.001067056,0.0001408538,0.00005460694,0.0004669299,0.0001608332,0.0002049932,0.00003158592,0.00009826387,0.000001176197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000940682,"about_ca_system_score_gemma":0.0000782127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006210519,"about_ca_topic_score_gemma":0.000002502628,"domain_scores_codex":[0.9987162,0.00006989955,0.0004480767,0.0001622784,0.0003926861,0.0002108537],"domain_scores_gemma":[0.9976423,0.0007859331,0.0006364491,0.0003203751,0.0005345668,0.00008033864],"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.00001237689,0.0002290779,0.001195706,0.0003506111,0.00004973788,0.000003735997,0.0005973027,0.000004261519,0.0001819227,0.9971103,0.0001674664,0.00009751035],"study_design_scores_gemma":[0.0004331493,0.0003656509,0.0001930515,0.000108572,0.00004904733,0.00001761735,0.0004914841,0.00001322486,0.02965446,0.9682773,0.0002429965,0.000153385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.988199,0.0008323768,0.003477196,0.0001320642,0.0001469426,0.0003043592,0.00001174075,0.0000423818,0.006853928],"genre_scores_gemma":[0.9919868,0.0002306715,0.007597671,0.00001356097,0.000006607066,0.00001197717,0.000001174566,0.00002658136,0.0001250093],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02947254,"threshold_uncertainty_score":0.5743852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2890957687","doi":"10.1007/s00026-020-00500-9","title":"Combinatorial Interpretations of Lucas Analogues of Binomial Coefficients and Catalan Numbers","year":2020,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Catalan number; Binomial coefficient; Fibonacci number; Unimodality; Natural number; Quotient; Sequence (biology); Lucas number; Integer sequence; Integer (computer science)","retraction":null,"screen_n_in":null,"score":{"opus":0.03722687948889762,"gpt":0.3140588587923512,"spread":0.2768319793034536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006630066,0.00008613148,0.0002814156,0.00002651446,0.00003316453,0.000005055608,0.0001325037,0.00002476412,0.00002244873],"category_scores_gemma":[0.00004517364,0.0000836848,0.00007421741,0.0002452516,0.0001677817,0.00005848541,0.00006933296,0.0000633947,0.000001595441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001887758,"about_ca_system_score_gemma":0.00002994843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002957154,"about_ca_topic_score_gemma":1.231958e-7,"domain_scores_codex":[0.9993175,0.00001820806,0.0003336167,0.000110329,0.0001206899,0.00009964551],"domain_scores_gemma":[0.9991854,0.0001552613,0.0002464568,0.0001359951,0.0001953189,0.00008159593],"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.00002019361,0.0002289463,0.002065154,0.00006244655,0.00004405115,6.615973e-8,0.0007354094,0.00002905856,0.0004839328,0.9956345,0.0001815691,0.0005146815],"study_design_scores_gemma":[0.0006236034,0.0002263883,0.0003258058,0.00003923349,0.0000378656,1.191897e-7,0.0006850723,0.0005443096,0.04352461,0.9528538,0.001020742,0.000118438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9528937,0.00007491928,0.03759126,0.0005252876,0.0001477959,0.0002486748,0.0002659289,0.00001456497,0.008237919],"genre_scores_gemma":[0.9996986,0.000008010058,0.0001937511,0.00002071046,0.00002595706,0.000006080782,0.00002964253,0.000008103637,0.000009180744],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04680491,"threshold_uncertainty_score":0.3412567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048713524","doi":"10.1007/s00026-014-0249-2","title":"Structure and Enumeration of (3+1)-Free Posets","year":2014,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Partially ordered set; Enumeration; Bipartite graph; Star product; Conjecture; Disjoint sets; Automorphism group","retraction":null,"screen_n_in":null,"score":{"opus":0.04944323101980587,"gpt":0.3336929998910024,"spread":0.2842497688711965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003707281,0.0001660248,0.0004503316,0.0000949094,0.0000445863,0.00001074611,0.0002954371,0.0001283288,0.00001121171],"category_scores_gemma":[0.002594087,0.0001577228,0.00006183053,0.0002184482,0.00008562958,0.0001397431,0.0001409685,0.0001273533,6.45689e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007820204,"about_ca_system_score_gemma":0.00002263941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003387128,"about_ca_topic_score_gemma":0.000001265324,"domain_scores_codex":[0.9987035,0.00008063154,0.0005010927,0.0001584293,0.0003768927,0.0001794568],"domain_scores_gemma":[0.9976663,0.0006778917,0.0004821217,0.000649297,0.0004517906,0.00007259841],"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.00001370943,0.000127907,0.000314319,0.0003711784,0.00002700325,3.670909e-7,0.0003247795,0.000002532815,0.001785774,0.9948223,0.001462294,0.0007478466],"study_design_scores_gemma":[0.000547155,0.0002436214,0.0002254512,0.00006241848,0.00002402048,0.00000307179,0.0000248606,0.0002252686,0.09476668,0.9032792,0.0004719236,0.000126317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9893041,0.0002414949,0.007220144,0.0003600472,0.0005160853,0.0002561025,0.00002398874,0.00005265408,0.002025336],"genre_scores_gemma":[0.9947903,0.00004427112,0.004986974,0.00004891717,0.00003635513,0.00000285872,0.000002987894,0.00002792222,0.00005947051],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09298091,"threshold_uncertainty_score":0.6431751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993054401","doi":"10.1007/s00026-009-0008-y","title":"Enumeration of Decomposable Combinatorial Structures with Restricted Patterns","year":2009,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Combinatorial analysis; Class (philosophy); Enumerative combinatorics; Focus (optics); Gravitational singularity; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01984716435851521,"gpt":0.2702081807384746,"spread":0.2503610163799594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001932882,0.0001497437,0.0002929339,0.0001422788,0.00006207514,0.0000496207,0.0006918331,0.00007993625,0.000006473217],"category_scores_gemma":[0.00004314146,0.0001265132,0.00006288687,0.0005828922,0.00003559043,0.0004105658,0.00006330846,0.000111296,0.000001186017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009362951,"about_ca_system_score_gemma":0.00007222716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003097885,"about_ca_topic_score_gemma":6.661933e-7,"domain_scores_codex":[0.9986869,0.00007925461,0.0003505973,0.0002248717,0.0004314149,0.0002269942],"domain_scores_gemma":[0.9985759,0.0001109753,0.0003165428,0.000547013,0.0003753972,0.00007414031],"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.00003630988,0.0002399013,0.001572305,0.00002163485,0.00002130093,0.000006369536,0.000194122,0.00007086064,0.001285854,0.9916705,0.0007007823,0.00417999],"study_design_scores_gemma":[0.001016102,0.001451676,0.04416514,0.00005992097,0.000009904683,0.000008170855,0.00002262754,0.002137759,0.1515212,0.7989935,0.0003860578,0.0002278867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9573767,0.0002283809,0.03977632,0.0006789339,0.0005902839,0.0001691541,0.000008192569,0.0001071216,0.001064932],"genre_scores_gemma":[0.9986843,0.00005885315,0.001027555,0.0001682589,0.0000291887,0.000001783566,0.000008477907,0.000006941105,0.0000146664],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.192677,"threshold_uncertainty_score":0.5159059,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004668118","doi":"10.1007/pl00012581","title":"On PBIBD Designs Based on Triangular Schemes","year":2002,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Greo","funders":"","keywords":"Mathematics; Combinatorics; Block (permutation group theory); Discrete mathematics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.5328576690974302,"gpt":0.4930455767340003,"spread":0.03981209236342986,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003537636,0.0002369685,0.0004857265,0.0005516844,0.0001177139,0.0001122337,0.0009440348,0.0001419732,0.001468021],"category_scores_gemma":[0.006495645,0.0001894893,0.0002787495,0.001537357,0.0001236683,0.000199303,0.00006260345,0.000202377,0.0006699756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002788555,"about_ca_system_score_gemma":0.00003169611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003312492,"about_ca_topic_score_gemma":5.921248e-8,"domain_scores_codex":[0.9955289,0.0007263792,0.0006904277,0.0004945603,0.002204563,0.0003552205],"domain_scores_gemma":[0.9940051,0.003946395,0.0003401295,0.001041964,0.0004626767,0.0002037284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005956019,0.003968942,0.0009860999,0.00001760987,0.00005458496,0.00007413603,0.0003825362,0.001895162,0.008210969,0.7039123,0.2356391,0.04426306],"study_design_scores_gemma":[0.001928067,0.004017746,0.0006680474,0.00006825521,0.00001168284,0.00000171534,0.0001135071,0.03883121,0.5033148,0.4168101,0.03373682,0.000498066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.52276,0.003821494,0.09709764,0.009866768,0.004069135,0.001828039,0.00006617796,0.0003771188,0.3601137],"genre_scores_gemma":[0.9906202,0.00003477297,0.005213769,0.001989102,0.00002584959,0.00001322068,0.000001128027,0.00002556763,0.002076378],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4951038,"threshold_uncertainty_score":0.9994448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003363424","doi":"10.1007/s00026-006-0298-2","title":"A Simple Recurrence for Covers of the Sphere With Branch Points of Arbitrary Ramification","year":2006,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Permutation (music); Combinatorial proof; Riemann–Hurwitz formula; Simple (philosophy); Eulerian path; Generating function; Bijection; Riemann surface; Series (stratigraphy); Algebraic number; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometric function theory; Lagrangian","retraction":null,"screen_n_in":null,"score":{"opus":0.04163829066549527,"gpt":0.3034241345379852,"spread":0.2617858438724899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004544306,0.00009814103,0.000260378,0.00003495649,0.00003921345,0.000003340389,0.0002495768,0.00006531543,0.00001713263],"category_scores_gemma":[0.0002976707,0.00007171627,0.0001094015,0.0004163309,0.0001307883,0.0000792211,0.00002779504,0.00007527113,5.655284e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006041135,"about_ca_system_score_gemma":0.00006676473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002161988,"about_ca_topic_score_gemma":0.000003101963,"domain_scores_codex":[0.999078,0.00005950672,0.0003636833,0.0001112224,0.0002540856,0.0001334401],"domain_scores_gemma":[0.9980771,0.0006131445,0.0005319421,0.0003778528,0.0003793049,0.00002067335],"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.0001444516,0.000483982,0.005767887,0.0005043643,0.00004342946,1.384559e-7,0.0001621695,0.00001110398,0.0004481958,0.9875356,0.004577975,0.0003207026],"study_design_scores_gemma":[0.0004418745,0.0001596713,0.004447226,0.00008989768,0.00002766041,0.000001005556,0.00008650398,0.00002016311,0.1348236,0.8592506,0.0005815572,0.00007028196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.992278,0.0001753123,0.003766598,0.0001960489,0.00008698161,0.0003455647,0.00004615049,0.00001079877,0.003094511],"genre_scores_gemma":[0.9993711,0.00001601894,0.0003611131,0.00003575043,0.00001127922,0.000008900331,0.000007241235,0.00001266519,0.0001760005],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1343754,"threshold_uncertainty_score":0.2924505,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313532189","doi":"10.1007/s00026-022-00632-0","title":"On Antipodes of Immaculate Functions","year":2022,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Mathematics; Combinatorics; Basis (linear algebra); Noncommutative geometry; Algebraic number; Symmetric function; Integer (computer science); Pure mathematics; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1193662415266335,"gpt":0.3746937208309744,"spread":0.2553274793043409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005234985,0.0001755917,0.0004649924,0.0001976988,0.0001705556,0.00000577909,0.000389734,0.00004998317,0.000187399],"category_scores_gemma":[0.0009293115,0.0001835499,0.0001926815,0.000646819,0.00007113097,0.00007833142,0.0002365354,0.0002558176,0.00001208726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000330069,"about_ca_system_score_gemma":0.00007029917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006380345,"about_ca_topic_score_gemma":1.496564e-7,"domain_scores_codex":[0.998135,0.0001169039,0.0005861575,0.0001883257,0.000732204,0.0002414002],"domain_scores_gemma":[0.9974506,0.0009547574,0.0005656141,0.0006279357,0.0003339862,0.00006703051],"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.00007624441,0.001150936,0.00006037379,0.0001339302,0.0000682201,0.000005314585,0.000308521,0.0002265835,0.00046009,0.9925896,0.004748646,0.0001715322],"study_design_scores_gemma":[0.0005173066,0.0009423327,0.00002982297,0.00003411107,0.00003091469,0.000006576898,0.0003170719,0.00009036529,0.01718732,0.9789655,0.001720868,0.0001578574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.983137,0.0001438711,0.001209099,0.0002889902,0.001117258,0.0003164619,0.00004649793,0.00008630435,0.0136545],"genre_scores_gemma":[0.9984139,0.00002925357,0.0003214296,0.00007013616,0.00001566354,0.00003264206,0.000005033875,0.00004226195,0.00106968],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01672723,"threshold_uncertainty_score":0.7484946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2301470204","doi":"10.1007/s00026-016-0316-y","title":"Pairwise Balanced Designs Covered by Bounded Flats","year":2016,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Bounded function; Pairwise comparison; Combinatorics; Divisibility rule; Dimension (graph theory); Upper and lower bounds; Constant (computer programming); Point (geometry); Discrete mathematics; Geometry; Mathematical analysis; Statistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0342408080177925,"gpt":0.2426867550399777,"spread":0.2084459470221852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002658095,0.0001495288,0.0002469097,0.00005846854,0.00003830556,0.00001448093,0.0002064477,0.0001036655,0.00004134621],"category_scores_gemma":[0.00004677267,0.0001184419,0.00009386826,0.0002078192,0.00004738946,0.0001507256,0.00001626965,0.00006017761,0.00005032857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000165848,"about_ca_system_score_gemma":0.00001264991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003004755,"about_ca_topic_score_gemma":3.846627e-7,"domain_scores_codex":[0.9990903,0.00005625578,0.0002659022,0.0001242963,0.0001883094,0.0002749031],"domain_scores_gemma":[0.9993219,0.0001177845,0.0000614933,0.0003011496,0.00009618895,0.0001015032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001122195,0.0002809108,0.00469646,0.0003516302,0.0003446202,0.00001497678,0.0003965877,0.00008991039,0.1959856,0.4279106,0.3645778,0.005238754],"study_design_scores_gemma":[0.001538766,0.0002625707,0.001101658,0.0002080879,0.00001787945,0.000004488154,0.00004162767,0.0002242474,0.530408,0.3934398,0.07222617,0.000526713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9787466,0.001990101,0.006655267,0.0002300042,0.001436099,0.0002201827,0.00007204706,0.0003603548,0.01028937],"genre_scores_gemma":[0.9987951,0.0003247116,0.000009217707,0.00004734871,0.00001910491,0.00001249444,0.00000409824,0.0000285669,0.0007593529],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3344224,"threshold_uncertainty_score":0.4829919,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023752037","doi":"10.1007/s00026-013-0191-8","title":"On the Orthogonal Tableaux of Koike and Terada","year":2013,"lang":"fi","type":"article","venue":"Annals of Combinatorics","topic":"Molecular spectroscopy and chirality","field":"Chemistry","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Bijection, injection and surjection; Combinatorics; Young tableau; Mathematics; Symmetric group; Bijection","retraction":null,"screen_n_in":null,"score":{"opus":0.02834318987948135,"gpt":0.2736030243183654,"spread":0.245259834438884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002941817,0.0002515764,0.0004064427,0.00003514821,0.0001029934,0.0000425418,0.0003688935,0.0001938694,0.001273111],"category_scores_gemma":[0.0001956397,0.0001885493,0.0001667623,0.0002082855,0.0002366358,0.0000847694,0.0001392948,0.0003810499,0.00002304386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001097615,"about_ca_system_score_gemma":0.00008093856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001817653,"about_ca_topic_score_gemma":0.000002407501,"domain_scores_codex":[0.9983712,0.000087545,0.000487894,0.0002572909,0.0004652882,0.0003307823],"domain_scores_gemma":[0.9982289,0.0002958821,0.0003887816,0.0006462347,0.0003232627,0.0001169301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006312409,0.0007907043,0.003850103,0.0006239618,0.0002188499,0.000006367156,0.0003225219,0.000002866869,0.03012319,0.9513324,0.01176474,0.0009011776],"study_design_scores_gemma":[0.0005115447,0.0004024406,0.006231475,0.0002559225,0.00005538392,0.000004469494,0.000134969,0.000138243,0.7204073,0.2635193,0.008052506,0.0002864003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9489731,0.00195549,0.00001603336,0.003459324,0.0001682447,0.0001523681,0.000049096,0.00001002217,0.04521631],"genre_scores_gemma":[0.9962991,0.0007715694,0.00001451296,0.000623135,0.00003276524,0.00001081203,0.000008735946,0.00002131981,0.002218037],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6902841,"threshold_uncertainty_score":0.9996399,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162642412","doi":"10.1007/s00026-018-0386-0","title":"Structure Constants for Immaculate Functions","year":2018,"lang":"en","type":"preprint","venue":"Annals of Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Counterexample; Conjecture; Mathematics; Structure constants; Combinatorics; Constant (computer programming); Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.144990422240466,"gpt":0.3904841412765162,"spread":0.2454937190360502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003319757,0.0005410431,0.001015643,0.0001874063,0.0001948728,0.00007238871,0.0007356677,0.0008469702,0.0001813946],"category_scores_gemma":[0.0007801302,0.0005116753,0.0005527818,0.0002262403,0.0002127828,0.00007519878,0.0005975537,0.0005510587,0.000006615631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004429485,"about_ca_system_score_gemma":0.0004099093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002762137,"about_ca_topic_score_gemma":0.000002762117,"domain_scores_codex":[0.9973748,0.00007714238,0.0008523205,0.0006074795,0.0005798108,0.0005084205],"domain_scores_gemma":[0.9955183,0.0004895112,0.0009405165,0.001148715,0.001724674,0.0001783363],"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.0001304502,0.0001265693,0.00008621051,0.000650489,0.0004245029,0.000002034472,0.0002385392,0.00001706637,0.00003087464,0.9644505,0.03360758,0.0002352242],"study_design_scores_gemma":[0.0007115266,0.0003308268,0.00004987903,0.0002032329,0.0001952652,0.000005380976,0.0000624187,0.0001134638,0.00520452,0.9888895,0.003750015,0.0004840367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9784968,0.0007683685,0.002983867,0.0005051232,0.01150311,0.00157892,0.0008072471,0.0001752349,0.003181326],"genre_scores_gemma":[0.9976676,0.000109129,0.0004953236,0.0001551569,0.0004695054,0.00006431234,0.00009931719,0.0001022808,0.0008374418],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02985757,"threshold_uncertainty_score":0.9997335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1774627331","doi":"10.1007/s00026-016-0313-1","title":"On Linear Configurations in Subsets of Compact Abelian Groups, and Invariant Measurable Hypergraphs","year":2016,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Abelian group; Combinatorics; Finitary; Coprime integers; Lemma (botany); Hypergraph; Invariant (physics); Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.08315348678708288,"gpt":0.3303523111892179,"spread":0.247198824402135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005720934,0.0001376946,0.0003632361,0.0002157581,0.00006319644,0.000006014066,0.0001717509,0.00009877376,0.0000276703],"category_scores_gemma":[0.0006574379,0.00009155537,0.00007324253,0.0002761454,0.0001565873,0.00009683434,0.00002911149,0.00009982408,0.000001144703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007730087,"about_ca_system_score_gemma":0.00002799431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000281693,"about_ca_topic_score_gemma":0.000009919199,"domain_scores_codex":[0.9988769,0.0001128794,0.0004177224,0.0001484732,0.0002568195,0.0001872431],"domain_scores_gemma":[0.9982493,0.0009121104,0.0002163255,0.0003342383,0.0002160826,0.00007193639],"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.00005369857,0.0002009569,0.003753223,0.00006993373,0.00003840787,0.00000292771,0.0003404644,0.000001729367,0.001834891,0.9922782,0.001189015,0.0002365352],"study_design_scores_gemma":[0.0007477337,0.0002209205,0.01008948,0.0001895152,0.00001191661,0.000002820758,0.00004223099,0.0000214394,0.02221124,0.9661392,0.000203997,0.0001194915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9939933,0.0002378308,0.00009172947,0.0007150644,0.0001545069,0.0001603265,0.00003793037,0.00001600663,0.004593314],"genre_scores_gemma":[0.9994135,0.0003467644,0.00007320286,0.00007688091,0.000008028212,0.000002365638,0.000001435563,0.00001495054,0.00006279337],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.026139,"threshold_uncertainty_score":0.373352,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987306902","doi":"10.1007/s00026-005-0255-5","title":"Bounding the Roots of Ideal and Open Set Polynomials","year":2005,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; Fields Institute for Research in Mathematical Sciences; University of Waterloo; University of Toronto; Dalhousie University","funders":"","keywords":"Mathematics; Ideal (ethics); Combinatorics; Cardinality (data modeling); Transitive relation; Moduli; Preorder; Discrete mathematics; Polynomial; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.06116245509014671,"gpt":0.3312704087362235,"spread":0.2701079536460768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006856913,0.00008510364,0.0002052659,0.00006165746,0.0001023839,0.0001215564,0.001038531,0.00003439677,0.000003025619],"category_scores_gemma":[0.00006556401,0.00006485608,0.00004193749,0.0002919843,0.00006323514,0.0004973857,0.0006374195,0.00006699846,0.000003092764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000078512,"about_ca_system_score_gemma":0.00007590165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001072098,"about_ca_topic_score_gemma":0.000007311212,"domain_scores_codex":[0.9991224,0.00006859084,0.000294927,0.000156665,0.00019388,0.0001635168],"domain_scores_gemma":[0.9990972,0.0002200529,0.0002259539,0.0002871915,0.0001111325,0.00005843777],"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.00001248498,0.00008816901,0.0009007978,0.00001982099,0.00002823346,0.000001047397,0.0009627305,0.00008427053,0.0007206272,0.9161661,0.007469098,0.07354657],"study_design_scores_gemma":[0.001434455,0.0005359158,0.06713089,0.0001090658,0.00001920671,0.00002331024,0.0001088492,0.02057345,0.07445455,0.7871866,0.04798352,0.0004402019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9730148,0.001186284,0.009172791,0.01294511,0.0004072008,0.0002507564,0.000005285766,0.00002968329,0.002988093],"genre_scores_gemma":[0.9987776,0.00007459197,0.0005666498,0.0004284212,0.00004058009,0.000003048994,8.350722e-7,0.000004128948,0.000104099],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1289796,"threshold_uncertainty_score":0.2644754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404872160","doi":"10.1007/s00026-024-00731-0","title":"Elementary Symmetric Partitions","year":2024,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Symmetric group","retraction":null,"screen_n_in":null,"score":{"opus":0.1624617524429855,"gpt":0.4211803246057107,"spread":0.2587185721627252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003138352,0.000117027,0.0002274291,0.0002351997,0.00004649908,0.00003913359,0.0001653892,0.00004758063,0.0001702407],"category_scores_gemma":[0.0005453456,0.0001088878,0.0001301718,0.0007431351,0.00006493081,0.000243696,0.00007439837,0.0001279439,0.0000898287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001914143,"about_ca_system_score_gemma":0.00003207177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000431437,"about_ca_topic_score_gemma":0.000001556952,"domain_scores_codex":[0.9988881,0.00002908322,0.0003828176,0.0001460581,0.0003314295,0.0002225262],"domain_scores_gemma":[0.9985685,0.0008701422,0.00006670865,0.0002729234,0.0001519138,0.00006978495],"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.000001383155,0.0001668532,0.00002578505,0.0005444999,0.00005543657,0.00001219735,0.0001039498,0.000001126179,0.00003321535,0.9506581,0.0480003,0.0003971535],"study_design_scores_gemma":[0.00006710191,0.00007002827,0.00003304732,0.0001477556,0.00003833775,0.000004120931,0.0001016891,0.0001171737,0.00685465,0.9821391,0.01031757,0.0001093886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4322245,0.020884,0.06094196,0.009579096,0.004650554,0.001553672,0.0002057233,0.002184691,0.4677758],"genre_scores_gemma":[0.9934769,0.0004454831,0.001848333,0.0000756419,0.00004547071,0.00002615337,0.000005622123,0.00003299339,0.004043364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5612524,"threshold_uncertainty_score":0.4440316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4380486389","doi":"10.1007/s00026-023-00654-2","title":"Asymptotics of Multivariate Sequences IV: Generating Functions with Poles on a Hyperplane Arrangement","year":2023,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hyperplane; Quotient; Multivariate statistics; Saddle point; Combinatorics; Function (biology); Analytic function; Saddle; Generating function; Discrete mathematics; Pure mathematics; Geometry; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.04950070409048338,"gpt":0.287967013732991,"spread":0.2384663096425076,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002335797,0.0001037312,0.0001708411,0.0001560676,0.00008804232,0.00002838915,0.000287022,0.00003100432,0.000001663532],"category_scores_gemma":[0.00003494471,0.0000844694,0.0000440971,0.0007493341,0.00003870317,0.000141435,0.00008190193,0.00006615509,0.00001180793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008544268,"about_ca_system_score_gemma":0.00006865538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005337046,"about_ca_topic_score_gemma":0.000003867414,"domain_scores_codex":[0.9990296,0.00004614401,0.0002366972,0.0001830636,0.0003221846,0.0001822763],"domain_scores_gemma":[0.9991977,0.0001613835,0.0001815914,0.0002271375,0.000179797,0.00005245725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005177212,0.0004804698,0.001657867,0.00008439986,0.0001572653,0.00002191107,0.001513377,0.05505477,0.006212079,0.8853099,0.002759686,0.04669655],"study_design_scores_gemma":[0.002228352,0.005106613,0.03183757,0.0004826255,0.00004800066,0.00001505874,0.000383858,0.7227911,0.08948329,0.143445,0.003306442,0.0008720871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9293774,0.00008621042,0.06706725,0.001653563,0.000555035,0.000146859,0.00001086376,0.0001418644,0.00096098],"genre_scores_gemma":[0.9980625,0.00002738683,0.001587594,0.0001208341,0.00003065022,0.000005629709,0.000007067995,0.000005940236,0.0001523898],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7418649,"threshold_uncertainty_score":0.3444562,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037073401","doi":"10.1007/s00026-021-00528-5","title":"On Conjectures Concerning the Smallest Part and Missing Parts of Integer Partitions","year":2021,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Integer (computer science); Interval (graph theory); Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1874769373593785,"gpt":0.3792750838047882,"spread":0.1917981464454097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002888249,0.0001143345,0.0003067387,0.00003099366,0.00009966906,0.00002668273,0.0001065485,0.00005315499,0.00008985622],"category_scores_gemma":[0.002758689,0.00008547203,0.0000765734,0.0001374327,0.0002455614,0.00005801489,0.00008230349,0.0001419765,0.000002077986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006111236,"about_ca_system_score_gemma":0.00004461974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002762635,"about_ca_topic_score_gemma":0.00000480521,"domain_scores_codex":[0.9990103,0.000086253,0.0003738176,0.0001269745,0.0002425648,0.0001600679],"domain_scores_gemma":[0.9967271,0.002321515,0.0002385664,0.0003059243,0.0003550918,0.00005179008],"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.000006194096,0.0001303864,0.0001081357,0.0001931136,0.00004385827,0.000006420084,0.0006487547,0.00002635173,0.0001176827,0.9937828,0.004839633,0.00009663444],"study_design_scores_gemma":[0.0001544365,0.00006214383,0.00007137184,0.0003180871,0.00003185485,0.000006883918,0.0005674474,0.00004565439,0.03876743,0.9586537,0.001238662,0.00008233578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9460434,0.003769591,0.008960118,0.005348968,0.0005211777,0.0003659724,0.0000400694,0.00007875914,0.03487198],"genre_scores_gemma":[0.9985017,0.0002139999,0.0003543748,0.0001840259,0.00001795636,0.000008600125,0.0000022886,0.0000152474,0.0007018254],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05245832,"threshold_uncertainty_score":0.3485448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4307818955","doi":"10.1007/s00026-022-00612-4","title":"Asymptotics, Turán Inequalities, and the Distribution of the BG-Rank and 2-Quotient Rank of Partitions","year":2022,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Quotient; Combinatorics; Equidistributed sequence; Rank (graph theory); Modulo; Order (exchange); Congruence (geometry); Distribution (mathematics); Congruence relation; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.06769995959202396,"gpt":0.3220852899905827,"spread":0.2543853303985587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008506962,0.0001052498,0.0003608927,0.00003166229,0.0001818545,0.000009682365,0.0002077641,0.00003216575,0.00002056375],"category_scores_gemma":[0.001365857,0.00007005638,0.00009963066,0.0002291771,0.0005906611,0.00007620105,0.0003522216,0.0001523815,1.595062e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001586731,"about_ca_system_score_gemma":0.00003299059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002364489,"about_ca_topic_score_gemma":0.000002523087,"domain_scores_codex":[0.9985431,0.0002237485,0.0005444813,0.0001010892,0.000445836,0.0001417445],"domain_scores_gemma":[0.9975384,0.001377793,0.0004445052,0.0003555513,0.0002513735,0.00003241546],"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.00003138677,0.0002128924,0.0002986653,0.00042942,0.00004485222,2.313064e-7,0.001360583,0.00003185923,0.00002016202,0.9958965,0.001648248,0.00002525543],"study_design_scores_gemma":[0.0007214207,0.0000946203,0.0006179349,0.00006205904,0.00008444121,0.000003584374,0.001459539,0.0001551899,0.003073277,0.993082,0.0005754401,0.00007045642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9924055,0.00153978,0.00174073,0.00214191,0.0002530755,0.0005283564,0.0003573973,0.00001959751,0.001013643],"genre_scores_gemma":[0.9991712,0.0002990538,0.00007359649,0.00003905923,0.000007202694,0.00002890958,0.000008128939,0.00001093614,0.0003618998],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006765704,"threshold_uncertainty_score":0.2856816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2548453003","doi":"10.1007/s00026-018-0399-8","title":"Jacobi-Trudi Determinants over Finite Fields","year":2018,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Homomorphism; Zero (linguistics); Finite field; Probability density function; Symmetric function; Probability measure; Field (mathematics); Ring (chemistry); Free probability","retraction":null,"screen_n_in":null,"score":{"opus":0.1070622930726985,"gpt":0.4013147023097788,"spread":0.2942524092370803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002468766,0.0001118118,0.0002386821,0.0000647401,0.00009373101,0.00001876075,0.0002491902,0.0001001284,0.0001268418],"category_scores_gemma":[0.0002640077,0.00009997016,0.0001017156,0.0002978763,0.00007050889,0.00008634214,0.00006789126,0.00008565463,0.00005241659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004762723,"about_ca_system_score_gemma":0.00002418086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001814509,"about_ca_topic_score_gemma":0.00000873416,"domain_scores_codex":[0.9990998,0.00002487781,0.0003193053,0.0001431231,0.0002067649,0.0002061327],"domain_scores_gemma":[0.9985689,0.0004722104,0.0002071076,0.0004147194,0.0002711274,0.00006596486],"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.00006660951,0.000653683,0.005266236,0.0002143142,0.00006809052,0.000005744031,0.0007378766,0.000001416182,0.0001275806,0.8294567,0.1581177,0.005283966],"study_design_scores_gemma":[0.000673256,0.0002205386,0.002052017,0.00004056739,0.00002830341,0.0000021176,0.00002725826,0.000460105,0.01342476,0.9437309,0.03916486,0.0001753281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9780579,0.0001529037,0.002444318,0.0005796403,0.0003137747,0.0002175572,0.0000137142,0.00005851217,0.01816165],"genre_scores_gemma":[0.9977213,0.0001601481,0.0003270449,0.0002198178,0.0001005621,0.00001474539,0.000001153477,0.00001657661,0.0014387],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1189529,"threshold_uncertainty_score":0.4076665,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1527725279","doi":"10.1007/s00026-016-0307-z","title":"Symmetries on the Lattice of k-Bounded Partitions","year":2016,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University; Université du Québec à Montréal; Google (Canada)","funders":"","keywords":"Bijection; Mathematics; Dihedral group; Homogeneous space; Combinatorics; Bounded function; Lattice (music); Affine transformation; Partition (number theory); Order (exchange); Discrete mathematics; Pure mathematics; Group (periodic table); Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.2223028995994233,"gpt":0.3878673954534723,"spread":0.165564495854049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000715666,0.0001774637,0.0004034386,0.0001115282,0.00009758362,0.00001123625,0.0004470866,0.00009070875,0.00005630276],"category_scores_gemma":[0.007765153,0.0001008211,0.0001558716,0.0005439598,0.0002515118,0.0001309244,0.00009628337,0.0001144101,0.00002765395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002254991,"about_ca_system_score_gemma":0.00005522517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002097688,"about_ca_topic_score_gemma":7.360532e-7,"domain_scores_codex":[0.998323,0.0001222508,0.0005882034,0.0001551657,0.0005481105,0.0002632311],"domain_scores_gemma":[0.9914274,0.006303609,0.0005378733,0.0008167886,0.0008488212,0.00006549275],"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.00002235521,0.0004619044,0.00006634508,0.00009510705,0.00005965908,9.822622e-7,0.0001586746,3.953485e-7,0.000309184,0.9915303,0.007065979,0.0002290882],"study_design_scores_gemma":[0.0003404491,0.0002676105,0.00005540132,0.0002129177,0.00002850462,0.000001056072,0.00008988191,0.00000336428,0.1075303,0.8886998,0.002656669,0.0001139733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9420578,0.0002360085,0.008195334,0.01549239,0.001327658,0.0008302663,0.00007183879,0.0001760203,0.03161271],"genre_scores_gemma":[0.9983929,0.000127997,0.0006363074,0.0001477678,0.00003131761,0.00002515027,4.715076e-7,0.00003162441,0.0006064559],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1072212,"threshold_uncertainty_score":0.9296175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966330756","doi":"10.1007/s00026-009-0014-0","title":"Jagged Partitions and Lattice Paths","year":2009,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Bijection, injection and surjection; Bijection; Combinatorics; Mathematics; Lattice (music); Partition (number theory); Equivalence (formal languages); Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.1174969379946281,"gpt":0.3855731085516065,"spread":0.2680761705569784,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004072507,0.000189825,0.0004027624,0.00009281992,0.0001037296,0.00002524705,0.0002065781,0.0001107767,0.00001457734],"category_scores_gemma":[0.001690107,0.0001883068,0.00007321002,0.0004384392,0.0000719205,0.0002110309,0.00005583569,0.0001768185,0.00000893589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001283264,"about_ca_system_score_gemma":0.00003656509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000128398,"about_ca_topic_score_gemma":3.903512e-7,"domain_scores_codex":[0.998626,0.00006363369,0.0004750831,0.0001956554,0.0003419687,0.0002976374],"domain_scores_gemma":[0.9979757,0.0006459831,0.0002833705,0.0004708411,0.0004838123,0.0001403002],"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.00001014991,0.0004673033,0.00006313069,0.00007731511,0.00001947156,0.000005378646,0.0003041381,0.000001087069,0.0001538414,0.9942767,0.003666136,0.0009553303],"study_design_scores_gemma":[0.0004482027,0.0003216554,0.0003817758,0.00007300724,0.0000342575,0.000007206969,0.00007623334,0.00005522492,0.005713458,0.9904314,0.00226615,0.000191465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9616513,0.0009240889,0.005965915,0.004111577,0.0007550967,0.000632233,0.00002020833,0.0003427837,0.02559678],"genre_scores_gemma":[0.9950467,0.0002148051,0.004166123,0.0002445903,0.00003985793,0.000008490976,0.000002211462,0.00002272737,0.0002545005],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03339538,"threshold_uncertainty_score":0.767893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987443014","doi":"10.1007/s00026-011-0075-8","title":"2-Cell Embeddings with Prescribed Face Lengths and Genus","year":2010,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Integer (computer science); Graph; Embedding; Euler characteristic; Sequence (biology); Genus; Degree (music); Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01407924886144778,"gpt":0.2432337552056802,"spread":0.2291545063442324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003328438,0.0001256678,0.0001588663,0.0000998678,0.00009146603,0.00007944561,0.0005761062,0.00006661007,0.000005176618],"category_scores_gemma":[0.00003226325,0.0001086377,0.0000469198,0.0004038021,0.000103024,0.0003259945,0.0001700638,0.0002138502,0.000003664137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001248473,"about_ca_system_score_gemma":0.0000287505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007036503,"about_ca_topic_score_gemma":0.000001131214,"domain_scores_codex":[0.9991439,0.00003266024,0.0001421709,0.0002432817,0.000218318,0.0002196581],"domain_scores_gemma":[0.9990088,0.0001240839,0.0001079084,0.0004751658,0.0001721641,0.0001119],"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.00002072979,0.0001740983,0.001701839,0.00003626386,0.00001767604,0.000007113048,0.001087262,0.000003524237,0.002176023,0.9881462,0.001537287,0.005091968],"study_design_scores_gemma":[0.001754086,0.00174395,0.007458812,0.00006771256,0.00003254546,0.00004661938,0.0001540871,0.002994848,0.203988,0.6975076,0.08336125,0.000890523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.974057,0.0004274946,0.01855697,0.0006601373,0.0003071859,0.0001106672,0.000001999376,0.00009982481,0.005778733],"genre_scores_gemma":[0.9978738,0.00006506615,0.001714019,0.0001673681,0.00001219643,0.000004276427,4.536314e-7,0.000008251212,0.0001545292],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2906386,"threshold_uncertainty_score":0.4430116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4405621965","doi":"10.1007/s00026-024-00739-6","title":"Completing the Asymptotic Classification of Mostly Symmetric Short Step Walks in an Orthant","year":2024,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthant; Mathematics; Saddle point; Combinatorics; Symmetric function; Saddle; Symmetric group; Lattice (music); Symmetric closure; Symmetric matrix; Ring of symmetric functions; Eigenvalues and eigenvectors; Geometry; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.2127262151560123,"gpt":0.4171514829706632,"spread":0.2044252678146509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001727608,0.0002496568,0.0005776319,0.00042028,0.00006390009,0.00004757859,0.0006202995,0.0001453345,0.000009285885],"category_scores_gemma":[0.001200457,0.0001976618,0.0001503647,0.001995435,0.0001172171,0.0002655986,0.0001314109,0.0003787621,0.000004599889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006767996,"about_ca_system_score_gemma":0.0001091699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008521145,"about_ca_topic_score_gemma":0.000008388231,"domain_scores_codex":[0.9972581,0.0002196516,0.001112396,0.0003092512,0.0007438088,0.0003567495],"domain_scores_gemma":[0.9959608,0.002310772,0.0003149493,0.0008142554,0.0005167369,0.00008247063],"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.00001329612,0.0005157331,0.001168063,0.0007070706,0.00004478709,0.000007452241,0.0006140742,0.00002409338,0.0005999523,0.99363,0.0002584236,0.002417045],"study_design_scores_gemma":[0.0002162409,0.0002999392,0.003069816,0.0003210604,0.00005607417,0.000006068129,0.0005305661,0.01778409,0.003629294,0.9734192,0.0004473533,0.0002202964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9878711,0.0008270188,0.00607484,0.0006763024,0.0009649938,0.0006915313,0.00001395537,0.0001346649,0.00274557],"genre_scores_gemma":[0.9985492,0.00008847665,0.001149578,0.00002283305,0.00003956721,0.00003071582,0.000006805699,0.00006152857,0.00005124297],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0202108,"threshold_uncertainty_score":0.8060415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4378652164","doi":"10.1007/s00026-023-00648-0","title":"Folding Rotationally Symmetric Tableaux via Webs","year":2023,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Folding (DSP implementation); Young tableau; Symmetric group; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05881549500033758,"gpt":0.3145964591806703,"spread":0.2557809641803327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005033991,0.0001146832,0.0001830897,0.0004191698,0.0001316625,0.00007817971,0.0009032334,0.00005939582,0.00001008057],"category_scores_gemma":[0.0001835568,0.000109836,0.00007427811,0.003020913,0.00001995705,0.0006480077,0.0004875373,0.0001018368,0.0001275164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001091932,"about_ca_system_score_gemma":0.00006930569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001934384,"about_ca_topic_score_gemma":2.772356e-7,"domain_scores_codex":[0.9985661,0.00004221689,0.0002778569,0.000264324,0.0005547722,0.0002947441],"domain_scores_gemma":[0.998588,0.0003168278,0.0001550884,0.0004946588,0.0003463961,0.00009900536],"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.000003525848,0.0001229055,0.000984834,0.00003726705,0.00002494322,0.00002147913,0.0001077928,0.0003228014,0.0002929161,0.9170917,0.03934693,0.0416429],"study_design_scores_gemma":[0.0004312153,0.0002134863,0.01765035,0.00005990696,0.000005593093,0.000006552722,0.00001794688,0.2486071,0.008053684,0.6962901,0.02834575,0.0003183068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08124344,0.001594457,0.896248,0.004812995,0.003465012,0.0003995479,0.00003195852,0.0009230853,0.01128153],"genre_scores_gemma":[0.9939981,0.0003878836,0.004768988,0.0002738525,0.00004662356,0.00001138966,0.00001969323,0.00001326941,0.0004802524],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9127546,"threshold_uncertainty_score":0.4478984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3217522557","doi":"10.1007/s00026-021-00565-0","title":"Orthosymplectic Cauchy Identities","year":2022,"lang":"en","type":"preprint","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Symplectic geometry; Bijection; Identity (music); Cauchy distribution; Pure mathematics; Mathematical proof; Algebra over a field; Discrete mathematics; Mathematical analysis; Physics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.2283965450068304,"gpt":0.4356146683816325,"spread":0.2072181233748022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00130216,0.0006457806,0.001485358,0.0004479078,0.0002294137,0.00008268553,0.001510398,0.0004112113,0.0004574842],"category_scores_gemma":[0.00305502,0.0007385547,0.0006186684,0.0006421372,0.0001491953,0.0001702388,0.003011179,0.001471594,0.00001450718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001710226,"about_ca_system_score_gemma":0.0003537789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003835603,"about_ca_topic_score_gemma":0.000004711459,"domain_scores_codex":[0.9954193,0.0003144665,0.001442227,0.0006816459,0.001511098,0.0006312808],"domain_scores_gemma":[0.9935065,0.001459913,0.001763698,0.002200092,0.0008976267,0.0001722088],"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.00002168297,0.0007516449,0.0002944945,0.002354251,0.0002622071,0.00003740962,0.0007475066,0.0000924487,0.00000846602,0.9748482,0.02048393,0.00009772123],"study_design_scores_gemma":[0.0003681476,0.0002336891,0.00004253332,0.0002162755,0.0001557041,0.00001017352,0.000231599,0.00007369514,0.001547728,0.9912566,0.005224712,0.0006391202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8763019,0.00617129,0.01119664,0.001475855,0.02823457,0.003985568,0.0004901528,0.001541976,0.07060207],"genre_scores_gemma":[0.9899283,0.0009945771,0.00291194,0.0001320909,0.0002101054,0.0003519517,0.00006173033,0.000277812,0.005131457],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1136265,"threshold_uncertainty_score":0.9995065,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409640511","doi":"10.1007/s00026-025-00757-y","title":"Moments of Colored Permutation Statistics on Conjugacy Classes","year":2025,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Combinatorics Foundation; National Science Foundation","keywords":"Mathematics; Conjugacy class; Colored; Combinatorics; Permutation (music); Permutation group; Symmetric group; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.09899481768272177,"gpt":0.4287406175346076,"spread":0.3297457998518858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003837337,0.0002268929,0.0006267718,0.0002606722,0.00006440069,0.00001495226,0.0003430333,0.0001345891,0.00002725349],"category_scores_gemma":[0.003029278,0.000230309,0.0001004433,0.0006130253,0.0001274325,0.0001157506,0.00009444554,0.0001697926,0.00000635086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005274213,"about_ca_system_score_gemma":0.0001481301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003947189,"about_ca_topic_score_gemma":6.561208e-7,"domain_scores_codex":[0.9980073,0.0001006606,0.0008665936,0.0002108822,0.000554805,0.0002597589],"domain_scores_gemma":[0.9954758,0.002140597,0.0006949621,0.0005300403,0.001094953,0.00006364185],"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.0000898238,0.00102444,0.0002279486,0.0007217432,0.0001135843,0.000002972763,0.0002584021,0.00002613991,0.0003489848,0.9847537,0.01192515,0.0005070711],"study_design_scores_gemma":[0.0009599466,0.000491084,0.0003194817,0.0002582002,0.0000593458,4.472741e-7,0.0001829122,0.0002500523,0.04867718,0.9477369,0.0009099015,0.0001545607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8829811,0.0002965764,0.0701665,0.0008997762,0.003087731,0.001579897,0.000262013,0.0002074689,0.04051891],"genre_scores_gemma":[0.9941553,0.0001192679,0.004669444,0.000104457,0.00001375668,0.00002466017,0.0000133161,0.00003100172,0.000868823],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1111741,"threshold_uncertainty_score":0.9391728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409178989","doi":"10.1007/s00026-025-00754-1","title":"Genus Polynomials of Cubic Graphs with Non-real Roots","year":2025,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Mathematics; Combinatorics; Genus; Cubic graph; Cubic function; Discrete mathematics; Graph; Line graph; Botany; Geometry; Biology; Voltage graph","retraction":null,"screen_n_in":null,"score":{"opus":0.04862736863879968,"gpt":0.3596625340559986,"spread":0.3110351654171989,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005383762,0.0003232371,0.0009800444,0.0003534906,0.00007603513,0.00001577248,0.0005911257,0.0001862482,0.00001225246],"category_scores_gemma":[0.0005778415,0.0002880131,0.0002053699,0.001157342,0.0001868086,0.0001595352,0.0001640903,0.0002128622,0.000003942213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003345911,"about_ca_system_score_gemma":0.0002191267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003656216,"about_ca_topic_score_gemma":0.000005759543,"domain_scores_codex":[0.9977477,0.00007612925,0.0009279428,0.0002851103,0.0005542415,0.0004088273],"domain_scores_gemma":[0.996361,0.0009726583,0.0007697816,0.0009346182,0.000856739,0.000105233],"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.000105652,0.0007822789,0.001167133,0.0008285835,0.0002120723,0.000006616195,0.0002454938,0.00001267415,0.001005342,0.9916791,0.003462684,0.0004924212],"study_design_scores_gemma":[0.001146943,0.000402186,0.0006940625,0.0003678895,0.0001061995,0.000002370151,0.0001099172,0.00004172265,0.0913222,0.9051304,0.0004427159,0.0002334139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9650707,0.0003263886,0.004572407,0.0002609794,0.0008192632,0.0006466481,0.0000183805,0.00009949182,0.0281858],"genre_scores_gemma":[0.9961814,0.000210094,0.002787569,0.00004565108,0.0000205783,0.00002926169,0.000002709524,0.00004897738,0.0006737715],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09031685,"threshold_uncertainty_score":0.9999572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4410732952","doi":"10.1007/s00026-025-00762-1","title":"Chromatic Quasisymmetric Functions of the Path Graph","year":2025,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Santa Clara University","keywords":"Mathematics; Combinatorics; Chromatic scale; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05973793336828847,"gpt":0.3486723837833799,"spread":0.2889344504150914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005897174,0.0002169867,0.0005849983,0.0003594812,0.0001319919,0.00001213142,0.0006808521,0.0001344192,0.0000169155],"category_scores_gemma":[0.003399376,0.0001659933,0.0003408648,0.003304951,0.0001617537,0.0001063605,0.0002268751,0.0002259566,0.000006074032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003256309,"about_ca_system_score_gemma":0.0001182344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008065037,"about_ca_topic_score_gemma":0.000001311349,"domain_scores_codex":[0.9979844,0.0001366247,0.0008651295,0.000190599,0.0005489794,0.0002742293],"domain_scores_gemma":[0.9959595,0.001516253,0.000688112,0.001101781,0.0006814142,0.00005297596],"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.000008779691,0.0007512816,0.0006838334,0.0007299806,0.0001147064,4.711076e-7,0.0001447656,0.000008219768,0.0001400186,0.9859526,0.01101522,0.0004501634],"study_design_scores_gemma":[0.0004597227,0.0001106441,0.0009015018,0.0003240335,0.0001062743,0.000001210578,0.0001751713,0.00007074952,0.01377554,0.9830843,0.000859393,0.0001314554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.874755,0.00261518,0.05490685,0.002148046,0.006730967,0.001819257,0.00005106453,0.0002465313,0.05672713],"genre_scores_gemma":[0.9973353,0.0001407184,0.0009806781,0.00007584417,0.00001629003,0.00002840748,0.000001025209,0.00002441314,0.001397381],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1225803,"threshold_uncertainty_score":0.6769012,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}