{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":210,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":210,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"94f91cfdcf51","filters":{"venue":"Journal of Combinatorial Theory Series A"}},"results":[{"id":"W2013425391","doi":"10.1016/j.jcta.2012.12.008","title":"On the number of pentagons in triangle-free graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":164,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Computer science; Discrete mathematics","authors":[{"name":"Hamed Hatami","is_ca":true},{"name":"Jan Hladký","is_ca":false},{"name":"Daniel Král͏̌","is_ca":false},{"name":"Serguei Norine","is_ca":true},{"name":"Alexander Razborov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01731228798124497,"gpt":0.2730303166830055,"spread":0.2557180287017605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002137027,0.0001741081,0.0005124487,0.0001412044,0.0001165633,0.00003663742,0.0007946949,0.0001085148,0.0014575],"category_scores_gemma":[0.002637613,0.00009798126,0.0003170439,0.0002540577,0.0002797376,0.0002612532,0.0001376321,0.0004484229,0.000004338151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003146771,"about_ca_system_score_gemma":0.00004881717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006116842,"about_ca_topic_score_gemma":0.000001257992,"domain_scores_codex":[0.9978462,0.0006339457,0.0007968114,0.0000905199,0.0004272555,0.0002052082],"domain_scores_gemma":[0.9953698,0.003112981,0.0006996258,0.0005144413,0.0002364945,0.00006667056],"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.0008904198,0.0001699308,0.0003652819,0.00002192101,0.0001010062,0.000009011042,0.001229056,8.93255e-7,0.0001326172,0.9914896,0.005360663,0.0002295957],"study_design_scores_gemma":[0.001872255,0.0003210397,0.0004947211,0.00009870758,0.00003792403,0.00006263785,0.001235073,6.860734e-7,0.001413866,0.9938669,0.000490102,0.0001060793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9826174,0.00006141847,0.00001900404,0.0006080053,0.003508363,0.0002539224,0.000005377177,0.000008492715,0.01291798],"genre_scores_gemma":[0.9990364,0.00003310735,0.0003670098,0.00009943185,0.0001987933,0.000007730092,1.849873e-7,0.00002245777,0.0002349322],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01641892,"threshold_uncertainty_score":0.9994553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158442467","doi":"10.1016/j.jcta.2007.11.001","title":"Shellable graphs and sequentially Cohen–Macaulay bipartite graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":117,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Bipartite graph; Chordal graph; Mathematics; Complete bipartite graph; Simplicial complex; Discrete mathematics; Graph","authors":[{"name":"Adam Van Tuyl","is_ca":true},{"name":"Rafael H. Villarreal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02093647635948099,"gpt":0.3009365561280307,"spread":0.2800000797685497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002616297,0.0001865727,0.0004001594,0.0002200605,0.0002293084,0.00008923858,0.0002758318,0.00009738859,0.0001803271],"category_scores_gemma":[0.0004246397,0.0001547398,0.0001638193,0.0003779081,0.000265598,0.0004024513,0.00008311711,0.0003200186,0.000004415323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003592931,"about_ca_system_score_gemma":0.00007788604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003180412,"about_ca_topic_score_gemma":0.000006831711,"domain_scores_codex":[0.9983668,0.0001745452,0.0007124973,0.0001304187,0.0003413398,0.0002744539],"domain_scores_gemma":[0.9975618,0.0009983723,0.0005635385,0.0002617065,0.000428105,0.0001864488],"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.0005631577,0.0001397188,0.0003315647,0.00002924362,0.0001537297,0.00002366055,0.0008156915,5.839038e-7,0.004939865,0.9905883,0.001586831,0.0008276529],"study_design_scores_gemma":[0.001097045,0.0004319055,0.0003798088,0.00004618746,0.0001182744,0.0001613006,0.000588736,0.000001175228,0.009591726,0.9701217,0.01729777,0.0001643303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.987188,0.0006814018,0.00306316,0.0003667347,0.001627943,0.0002408277,0.000006643235,0.00004616769,0.006779104],"genre_scores_gemma":[0.996402,0.0001938352,0.00266456,0.00007917797,0.0001876037,0.000003654336,0.000001121892,0.00003124274,0.0004368469],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02046656,"threshold_uncertainty_score":0.6310108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001779588","doi":"10.1006/jcta.1999.3036","title":"Some New Bounds for Cover-Free Families","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":102,"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 Natural Science Foundation of China","keywords":"Cover (algebra); Combinatorics; Mathematics; Upper and lower bounds; Discrete mathematics; Engineering; Mathematical analysis","authors":[{"name":"Douglas R. Stinson","is_ca":true},{"name":"Ruizhong Wei","is_ca":true},{"name":"Linlin Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01549486149829043,"gpt":0.2697564060704429,"spread":0.2542615445721525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001296377,0.0002370842,0.0005701944,0.0001192947,0.0003234537,0.00009880197,0.0007554172,0.0001607987,0.0007536961],"category_scores_gemma":[0.001052753,0.0001790919,0.0004139534,0.0001262963,0.000213914,0.0006504549,0.00008066437,0.0002818178,0.000003550768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005314279,"about_ca_system_score_gemma":0.0001704566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001541236,"about_ca_topic_score_gemma":4.34248e-7,"domain_scores_codex":[0.9982854,0.0001743473,0.000699767,0.0001360359,0.0003985918,0.0003058236],"domain_scores_gemma":[0.9976503,0.00108836,0.0004118173,0.0004768895,0.000203641,0.0001689541],"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.003728563,0.00007606419,0.000009853496,0.00004529503,0.0001899359,0.00001044974,0.001311902,0.000006201722,0.0000809352,0.9579729,0.03283034,0.003737554],"study_design_scores_gemma":[0.002849707,0.0008762216,0.00001509186,0.00004844411,0.0001071254,0.00009420176,0.0002783466,0.000001301634,0.001036954,0.8273224,0.1671937,0.0001765631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9547408,0.00240437,0.001255926,0.001162139,0.02279499,0.0006481626,0.00006492645,0.0001135736,0.0168151],"genre_scores_gemma":[0.9341671,0.001562763,0.0167161,0.0007675112,0.01727333,0.00001541743,0.000004047666,0.0001861535,0.02930758],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1343633,"threshold_uncertainty_score":0.8252444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044138171","doi":"10.1016/j.jcta.2005.08.004","title":"Möbius functions and semigroup representation theory","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":102,"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":"Semilattice; Mathematics; Semigroup; Inverse semigroup; Krohn–Rhodes theory; Pure mathematics; Algebra over a field; Representation (politics); Bicyclic semigroup; Inverse; Product (mathematics); Representation theory; Eigenvalues and eigenvectors; Matrix (chemical analysis); Special classes of semigroups","authors":[{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008332151884208635,"gpt":0.2361555253071758,"spread":0.2278233734229672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002190989,0.0001626485,0.0002904573,0.0001673965,0.0002092889,0.0002336754,0.0005653215,0.00008599357,0.00008271622],"category_scores_gemma":[0.0003174026,0.000133585,0.0001309321,0.0002930962,0.0001442716,0.002139018,0.0001846646,0.0002678514,0.00001378385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005358042,"about_ca_system_score_gemma":0.00007433712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001475261,"about_ca_topic_score_gemma":5.311766e-7,"domain_scores_codex":[0.9982697,0.0004769414,0.0004985692,0.0001974248,0.0003387531,0.0002185862],"domain_scores_gemma":[0.9982387,0.0006087192,0.0004242888,0.0003815796,0.0002023468,0.0001443517],"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.0002930451,0.00008434226,0.00006322345,0.000005507288,0.00005949918,0.00001843848,0.0009753935,0.0000295499,0.001275752,0.9527577,0.001186383,0.0432512],"study_design_scores_gemma":[0.001115993,0.0004262825,0.0003760233,0.00003756999,0.00003633617,0.0006016986,0.0008988946,0.00020967,0.003410579,0.9617262,0.0309825,0.0001781814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6102312,0.004847224,0.3411076,0.005448659,0.01762177,0.0004016895,0.000008812221,0.0003591561,0.01997395],"genre_scores_gemma":[0.9926629,0.0001545954,0.004186951,0.0002734553,0.001324937,0.000003920542,9.702038e-7,0.0000159732,0.001376265],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3824318,"threshold_uncertainty_score":0.5447439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974746744","doi":"10.1016/j.jcta.2009.11.002","title":"Quasisymmetric Schur functions","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":97,"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; Pure mathematics","authors":[{"name":"J. Haglund","is_ca":false},{"name":"K. Luoto","is_ca":true},{"name":"Sarah Mason","is_ca":false},{"name":"Stephanie van Willigenburg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02374640907156703,"gpt":0.3013702583136253,"spread":0.2776238492420583,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001872516,0.0002887425,0.0007421772,0.0004060386,0.0002035165,0.00008843742,0.0005459298,0.0001698362,0.0001794072],"category_scores_gemma":[0.005760971,0.0002420025,0.000348636,0.00086629,0.00009682496,0.0008109913,0.00005430484,0.0005569587,0.00003095813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001690304,"about_ca_system_score_gemma":0.0001296258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.514044e-7,"about_ca_topic_score_gemma":1.289187e-7,"domain_scores_codex":[0.9973654,0.0002922662,0.001107788,0.0001597627,0.0007197497,0.0003551058],"domain_scores_gemma":[0.996119,0.00132616,0.001130338,0.0004768055,0.0007360113,0.0002116651],"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.0006485874,0.0005783665,0.00001080421,0.00002547268,0.00009138355,0.0000367525,0.0002825806,0.00000510261,0.0004671366,0.9909103,0.004111931,0.002831573],"study_design_scores_gemma":[0.001823006,0.001873089,0.00002614057,0.00009089051,0.0001469404,0.0002678199,0.0005791337,0.000003187161,0.001809689,0.9794499,0.01368877,0.0002414503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6453934,0.002421721,0.1666745,0.004205427,0.08445837,0.001729678,0.00002441521,0.0007193515,0.09437314],"genre_scores_gemma":[0.9799578,0.00006133554,0.01612278,0.00008997762,0.001956423,0.000004009704,6.999877e-7,0.00004599681,0.001760959],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3345644,"threshold_uncertainty_score":0.9868574,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967421215","doi":"10.1016/j.jcta.2006.08.002","title":"On the maximum number of edges in quasi-planar graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":90,"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; Combinatorics; Planar graph; Planar; Simple (philosophy); Upper and lower bounds; Pairwise comparison; Book embedding; Multiple edges; Matching (statistics); Graph; Discrete mathematics; 1-planar graph; Line graph; Computer science","authors":[{"name":"Eyal Ackerman","is_ca":false},{"name":"Gábor Tardos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007860445494885649,"gpt":0.2300400927524089,"spread":0.2221796472575232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001251451,0.000091095,0.0001883042,0.0001435547,0.0000665702,0.00005562294,0.0004579721,0.00004368752,0.00003251622],"category_scores_gemma":[0.0001467781,0.00006201771,0.00009775014,0.0004797738,0.0000608427,0.0003605999,0.00003338783,0.0001651396,0.000004235519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002591724,"about_ca_system_score_gemma":0.00008702296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000761163,"about_ca_topic_score_gemma":0.000002376321,"domain_scores_codex":[0.99874,0.0002802979,0.0004224417,0.00008781514,0.0003547025,0.000114699],"domain_scores_gemma":[0.9986471,0.0006197542,0.0003381178,0.0001706107,0.0001966214,0.00002779768],"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.0001956679,0.000186172,0.00020529,0.000004432591,0.00001284082,0.00001148691,0.0001473028,0.0004427074,0.0003453191,0.9958749,0.001066701,0.001507162],"study_design_scores_gemma":[0.0005207344,0.0003256677,0.0011655,0.00003022548,0.000004434642,0.00005706823,0.00005766544,0.00007645039,0.004515385,0.9910859,0.002094828,0.00006614425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9473681,0.0001915346,0.03794742,0.002069772,0.005914647,0.0001340462,0.000002383251,0.00001515934,0.006356908],"genre_scores_gemma":[0.9985843,0.00001274762,0.0009724721,0.00008179379,0.0002422905,0.000001563672,6.92696e-7,0.000004174241,0.00009995959],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05121618,"threshold_uncertainty_score":0.2529009,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012585113","doi":"10.1016/j.jcta.2007.10.001","title":"A multi-dimensional approach to the construction and enumeration of Golay complementary sequences","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":85,"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":"Binary Golay code; Mathematics; Complementary sequences; Enumeration; Sequence (biology); Ternary Golay code; Construct (python library); Combinatorics; Algorithm; Computer science; Decoding methods; Biology; Genetics","authors":[{"name":"F. Fiedler","is_ca":false},{"name":"Jonathan Jedwab","is_ca":true},{"name":"Matthew G. Parker","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01669925043663352,"gpt":0.2263077430816273,"spread":0.2096084926449938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004387919,0.000090462,0.000183684,0.00007974567,0.0001184924,0.00001241986,0.0001073353,0.00003531059,0.00002254208],"category_scores_gemma":[0.00005380073,0.0000665039,0.00004701882,0.0001242031,0.0001872137,0.0002690796,0.00002268597,0.0001480667,8.536086e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004013025,"about_ca_system_score_gemma":0.00003701423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004427579,"about_ca_topic_score_gemma":4.144854e-7,"domain_scores_codex":[0.9991683,0.0001087123,0.0003564802,0.0000586587,0.0002196368,0.0000881467],"domain_scores_gemma":[0.9995096,0.00007356345,0.0001376279,0.00008432395,0.0001399832,0.00005489035],"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.003219281,0.0006127406,0.003134147,0.0002740904,0.001476418,0.00003779686,0.02420808,0.152894,0.2703867,0.5184125,0.01825526,0.007088946],"study_design_scores_gemma":[0.01958447,0.00501371,0.01577336,0.0005759097,0.0006171131,0.03082504,0.02842148,0.01124783,0.3530984,0.3475702,0.1850108,0.00226174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9898438,0.0004655926,0.004056932,0.0001666762,0.0048783,0.0001558802,0.000009586834,0.00002078832,0.0004024222],"genre_scores_gemma":[0.9861688,0.00005318788,0.01333539,0.00002434196,0.0003814539,0.000003715558,0.000001798381,0.000009701345,0.00002162929],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1708423,"threshold_uncertainty_score":0.2711951,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120707415","doi":"10.1016/j.jcta.2007.05.008","title":"On distinguishing trees by their chromatic symmetric functions","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":83,"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":"University of Minnesota","keywords":"Symmetric function; Combinatorics; Mathematics; Chromatic scale; Monomial; Elementary symmetric polynomial; Invariant (physics); Power sum symmetric polynomial; Function (biology); Complete homogeneous symmetric polynomial; Ring of symmetric functions; Isomorphism (crystallography); Stanley symmetric function; Symmetric polynomial; Chromatic polynomial; Corollary; Discrete mathematics; Polynomial; Orthogonal polynomials; Mathematical analysis; Matrix polynomial","authors":[{"name":"Jeremy L. Martin","is_ca":false},{"name":"Matthew Morin","is_ca":true},{"name":"Jennifer D. Wagner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01814852272102464,"gpt":0.2825410242038569,"spread":0.2643925014828323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003427783,0.0003851462,0.0008321281,0.0003868183,0.000307477,0.0001201083,0.000605903,0.0001855237,0.00009577321],"category_scores_gemma":[0.01394838,0.0002975633,0.0003257535,0.0007935312,0.0001579849,0.0005195769,0.00009708039,0.0006826302,0.0000102286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003125904,"about_ca_system_score_gemma":0.00008972705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001166449,"about_ca_topic_score_gemma":0.000001413678,"domain_scores_codex":[0.9968755,0.0002724616,0.001370265,0.0001988381,0.0007977433,0.0004851872],"domain_scores_gemma":[0.9895408,0.007692608,0.001529637,0.000493105,0.0004985647,0.0002452849],"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.0007668062,0.0006505649,0.00001647702,0.0000750703,0.0001639686,0.00004951904,0.0007398865,0.000004576848,0.0008174476,0.9906028,0.00467224,0.001440622],"study_design_scores_gemma":[0.001721102,0.00145348,0.00001362356,0.0002744295,0.0001138758,0.000193423,0.001535635,0.000007505651,0.005323955,0.9839805,0.005088895,0.0002935606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8652408,0.0005567778,0.07722558,0.0003198565,0.02851008,0.000684902,0.00003743504,0.0002793953,0.02714519],"genre_scores_gemma":[0.9949312,0.00001819843,0.002943798,0.00003772975,0.001283912,0.000004868516,0.000002302788,0.00008731355,0.0006906752],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1296904,"threshold_uncertainty_score":0.9999477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101535655","doi":"10.1016/j.jcta.2004.09.005","title":"Cohen–Macaulay properties of square-free monomial ideals","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Monomial; Mathematics; Quotient; Square-free integer; Monomial ideal; Simplicial complex; Square (algebra); Class (philosophy); Combinatorics; h-vector; Pure mathematics; Graph; Computer science; Mathematical analysis; Geometry; Artificial intelligence; Polynomial ring; Polynomial","authors":[{"name":"Sara Faridi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03214177214561393,"gpt":0.2838619238585814,"spread":0.2517201517129675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001046434,0.0001704374,0.0005322437,0.0001175354,0.0001201284,0.0000386871,0.0005980097,0.00008646729,0.00007822222],"category_scores_gemma":[0.001230927,0.0001291135,0.0002212176,0.0001832064,0.0002504417,0.0003822981,0.0001328809,0.0002598748,0.00000398971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009218381,"about_ca_system_score_gemma":0.0002413568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007662005,"about_ca_topic_score_gemma":0.000003023753,"domain_scores_codex":[0.9983148,0.0001877877,0.0008750266,0.00009684798,0.0003492324,0.0001763048],"domain_scores_gemma":[0.9977206,0.0003319493,0.000866695,0.0004371719,0.000550417,0.00009314281],"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.000994134,0.0002989146,0.00002628929,0.00006725247,0.0001836297,0.000004956472,0.00221437,0.00001983692,0.01077031,0.9845819,0.0005861977,0.0002522274],"study_design_scores_gemma":[0.002363399,0.0006713264,0.00006098142,0.0001519301,0.00009298775,0.00005301897,0.001034732,5.907315e-7,0.08103049,0.9124293,0.001984525,0.0001267017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9936562,0.0004576089,0.00158547,0.0009814994,0.001167145,0.0002838904,0.00001081273,0.00002438788,0.001833026],"genre_scores_gemma":[0.9974654,0.00004549635,0.001906087,0.00002794353,0.0004264992,0.00001028002,4.291556e-7,0.0000269522,0.00009095133],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07215257,"threshold_uncertainty_score":0.5265098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028350743","doi":"10.1016/j.jcta.2008.06.011","title":"Classifying lattice walks restricted to the quarter plane","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":74,"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","keywords":"Conjecture; Random walk; Mathematics; Quadrant (abdomen); Lattice (music); Transcendental number; Combinatorics; Algebraic number; Discrete mathematics; Mathematical analysis; Physics; Statistics","authors":[{"name":"Marni Mishna","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03782881353052887,"gpt":0.291864275330781,"spread":0.2540354618002521,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001180114,0.0003122089,0.0006925582,0.0001768306,0.0004201451,0.00006975912,0.0008790088,0.0001647126,0.00008222492],"category_scores_gemma":[0.004538268,0.0002091455,0.0002294783,0.0005497681,0.0001619852,0.000489325,0.0001515438,0.0007218898,0.00003508832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001557566,"about_ca_system_score_gemma":0.0001866744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001620066,"about_ca_topic_score_gemma":0.000001285548,"domain_scores_codex":[0.9968895,0.000508939,0.001116795,0.0001803627,0.0008805341,0.0004238444],"domain_scores_gemma":[0.9947978,0.002778856,0.0009415751,0.0006395113,0.0006058545,0.0002363754],"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.001233515,0.0002396985,0.00003042212,0.00004258167,0.0001324988,0.0001715592,0.00396415,0.00001311916,0.0006019644,0.9785473,0.01486069,0.0001624918],"study_design_scores_gemma":[0.001550084,0.0009887619,0.00007904208,0.0001234668,0.00008918311,0.0009592597,0.001265191,0.00000609661,0.001254489,0.9544098,0.03902467,0.0002499009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.941884,0.0003270342,0.01521764,0.004866471,0.02770341,0.001137465,0.00001435265,0.0002241115,0.008625472],"genre_scores_gemma":[0.9833337,0.00006727779,0.01277549,0.0002130543,0.002636211,0.00001732806,9.053254e-7,0.00008638707,0.0008696077],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04144969,"threshold_uncertainty_score":0.8528704,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084593271","doi":"10.1016/j.jcta.2003.12.004","title":"Polynomial versus exponential growth in repetition-free binary words","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":73,"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":"Exponential growth; Binary number; Mathematics; Exponential function; Polynomial; Repetition (rhetorical device); Combinatorics; Discrete mathematics; Exponential polynomial; Arithmetic; Mathematical analysis","authors":[{"name":"Juhani Karhumäki","is_ca":false},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007989040553793911,"gpt":0.2220420646739751,"spread":0.2140530241201812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001618246,0.0002084061,0.0003889628,0.0003276009,0.0001251347,0.0001835844,0.001674565,0.0001253137,0.00005073114],"category_scores_gemma":[0.0005291582,0.0001882862,0.0002110737,0.0005122453,0.0001504883,0.00183928,0.0003998055,0.0004018925,0.000009745196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002099495,"about_ca_system_score_gemma":0.0003078594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000189792,"about_ca_topic_score_gemma":0.000003763467,"domain_scores_codex":[0.9979616,0.0002810582,0.000678625,0.0002281652,0.0005116247,0.0003388616],"domain_scores_gemma":[0.9984447,0.0002890478,0.0004431726,0.0005137648,0.0001634132,0.0001459294],"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.003150994,0.0002758528,0.00003373059,0.00001003547,0.00004501676,0.0003991211,0.001011113,0.00005738287,0.001239714,0.9922506,0.0008150358,0.0007113837],"study_design_scores_gemma":[0.0109524,0.001718689,0.000495674,0.0001366364,0.00001807447,0.0002385934,0.0004136752,0.00001759546,0.007108821,0.976518,0.002104817,0.0002769678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9482509,0.0005239435,0.01072142,0.002995119,0.03455149,0.0001729964,0.000005427883,0.0001150295,0.002663703],"genre_scores_gemma":[0.9950374,0.00007679139,0.003438627,0.00008669975,0.001296768,0.000003858262,0.000001018907,0.0000176073,0.0000412483],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04678651,"threshold_uncertainty_score":0.7678089,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096474673","doi":"10.1016/j.jcta.2004.12.003","title":"A direct bijection for the Harer–Zagier formula","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":69,"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":"Bijection; Mathematics; Combinatorics; Enumeration; Pairing; Cardinality (data modeling); Disjoint sets; Partition (number theory); Tree (set theory); Discrete mathematics; Computer science","authors":[{"name":"I. P. Goulden","is_ca":true},{"name":"Alexandru Nica","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02742315502893356,"gpt":0.312658380593504,"spread":0.2852352255645704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00262276,0.0002657452,0.0005834616,0.0001193554,0.0003405703,0.0001055048,0.0005678742,0.0001413335,0.00007871933],"category_scores_gemma":[0.004669313,0.000172518,0.0004111135,0.0002479255,0.0001230185,0.0007924611,0.00008279013,0.0003422759,0.000005910886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002012455,"about_ca_system_score_gemma":0.0001251126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.745314e-7,"about_ca_topic_score_gemma":0.000002017238,"domain_scores_codex":[0.9979011,0.0001797679,0.0009225839,0.0001436702,0.0005126769,0.0003401688],"domain_scores_gemma":[0.9935724,0.004134056,0.00104443,0.0004432063,0.0007006759,0.0001052463],"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.001338422,0.0002383641,0.000003319999,0.00006157042,0.0002069469,0.000003105299,0.000892113,0.00004828556,0.000512466,0.9888395,0.004483258,0.003372653],"study_design_scores_gemma":[0.001981652,0.000622739,0.000002748576,0.0000756468,0.0001982207,0.0001046094,0.0004842531,0.00006767954,0.01001077,0.8428769,0.1433988,0.0001759781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2538987,0.005382963,0.5522621,0.01264431,0.1326176,0.008396807,0.0001035146,0.0009122,0.03378186],"genre_scores_gemma":[0.9636872,0.0001411905,0.02723301,0.0001231743,0.006497163,0.00007620879,9.758073e-7,0.0001252572,0.002115819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7097884,"threshold_uncertainty_score":0.7035081,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066934281","doi":"10.1016/j.jcta.2013.09.005","title":"Non-D-finite excursions in the quarter plane","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Mathematics; Invertible matrix; Combinatorics; Plane (geometry); Finite set; Sequence (biology); Polynomial; Generating function; Point (geometry); Quarter (Canadian coin); Discrete mathematics; Pure mathematics; Geometry; Mathematical analysis","authors":[{"name":"Alin Bostan","is_ca":false},{"name":"Kilian Raschel","is_ca":false},{"name":"Bruno Salvy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01739643027986382,"gpt":0.2771685388764882,"spread":0.2597721085966244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002096605,0.0002614548,0.0005954631,0.0001802716,0.0001306716,0.0001249698,0.0008655806,0.0001459369,0.000267644],"category_scores_gemma":[0.001881113,0.0001664935,0.0001982239,0.0003673767,0.0001477618,0.0007809013,0.00007676399,0.000682572,0.00004854536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007911836,"about_ca_system_score_gemma":0.00008946378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004022859,"about_ca_topic_score_gemma":0.00000151667,"domain_scores_codex":[0.9974352,0.0004032622,0.001031245,0.0001306598,0.0006372844,0.0003623309],"domain_scores_gemma":[0.9948927,0.003341589,0.000792763,0.0005185278,0.0003434144,0.0001110495],"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.0002232887,0.000425156,0.00006474306,0.00004738017,0.00004655201,0.00004856995,0.004207681,0.000006343048,0.0002682336,0.9876453,0.006863158,0.000153603],"study_design_scores_gemma":[0.001746647,0.0007147564,0.00009929355,0.0001510251,0.00004307102,0.0001638437,0.004847879,0.00001362217,0.0003830318,0.9885083,0.003138617,0.0001899089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.960481,0.0001789254,0.00482705,0.002931551,0.01521713,0.001433668,0.000005011988,0.00006454095,0.01486113],"genre_scores_gemma":[0.995776,0.00002689687,0.00290435,0.000119396,0.0009003624,0.00003452347,7.587467e-7,0.00003956123,0.0001981789],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03529498,"threshold_uncertainty_score":0.6789408,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001092675","doi":"10.1016/j.jcta.2007.04.005","title":"On generalized separating hash families","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Hash function; Double hashing; Mathematics; Hash chain; SHA-2; Collision resistance; Computer science; Theoretical computer science; Hash table; Computer security","authors":[{"name":"Douglas R. Stinson","is_ca":true},{"name":"Ruizhong Wei","is_ca":true},{"name":"K. Chen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005995814983847147,"gpt":0.2191459336961046,"spread":0.2131501187122574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002296665,0.0001838877,0.0003639938,0.000185687,0.0001072306,0.00005588772,0.0002296266,0.0001084408,0.00007346395],"category_scores_gemma":[0.0001448733,0.0001542356,0.0001825985,0.000203339,0.00006885463,0.0002797882,0.00001540042,0.0003070331,0.00001176966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000554596,"about_ca_system_score_gemma":0.00001962841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.686364e-7,"about_ca_topic_score_gemma":9.713945e-7,"domain_scores_codex":[0.9986185,0.0001499037,0.0006079254,0.0000748622,0.0002862654,0.0002625244],"domain_scores_gemma":[0.9990602,0.0003522726,0.0001890503,0.0001676373,0.000115851,0.0001149649],"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.001081999,0.00003758888,0.0000418266,0.00003077936,0.0001296764,0.00006297645,0.0007791968,0.001622597,0.008820896,0.9853133,0.001035695,0.001043454],"study_design_scores_gemma":[0.002043549,0.0007682043,0.0001152551,0.0001479636,0.00004019351,0.0001949766,0.00162849,0.00004495558,0.04208721,0.925055,0.02757208,0.0003021511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9629962,0.0004403931,0.001706426,0.00001416991,0.01270185,0.00008566729,0.000002168045,0.00008764507,0.0219655],"genre_scores_gemma":[0.9985705,0.00004429601,0.0001701215,0.00003468001,0.0009526511,0.000001437042,6.635054e-7,0.0000315348,0.0001941245],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06025834,"threshold_uncertainty_score":0.6289548,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139746216","doi":"10.1016/j.jcta.2005.02.005","title":"The Ramsey number for hypergraph cycles I","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":62,"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":"Hypergraph; Combinatorics; Mathematics; Monochromatic color; Ramsey's theorem; Discrete mathematics; Graph; Physics","authors":[{"name":"Penny Haxell","is_ca":true},{"name":"Tomasz Łuczak","is_ca":false},{"name":"Yuejian Peng","is_ca":false},{"name":"V. Rödl","is_ca":false},{"name":"Andrzej Ruciński","is_ca":false},{"name":"Miklós Simonovits","is_ca":false},{"name":"Jozef Skokan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01623024312695025,"gpt":0.2984830645079066,"spread":0.2822528213809563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002551462,0.0001853086,0.0003629862,0.00005032714,0.0007065684,0.0001019161,0.0005643207,0.000119175,0.00008315106],"category_scores_gemma":[0.001202929,0.0001062112,0.0004115272,0.0001126378,0.0002913286,0.0003166086,0.00007929042,0.0002880373,0.000002126755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000381531,"about_ca_system_score_gemma":0.00005688603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.513207e-7,"about_ca_topic_score_gemma":0.000001146919,"domain_scores_codex":[0.9983738,0.0002537643,0.0006515559,0.0001008637,0.0003337864,0.0002861954],"domain_scores_gemma":[0.9960814,0.0025816,0.0005608351,0.0003134352,0.0003663253,0.00009644907],"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.001731553,0.00006430627,0.00006413922,0.00001672203,0.0001879509,0.000002736144,0.0006973117,0.000002591167,0.00008013212,0.9841582,0.006976817,0.006017535],"study_design_scores_gemma":[0.001095348,0.0001974117,0.0000321041,0.00002403588,0.00007479973,0.0001287311,0.0005183005,0.000002063833,0.001331857,0.8122138,0.1842655,0.0001160405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9635143,0.001245611,0.001653565,0.002548127,0.01833026,0.0005676415,0.00001685464,0.00007019696,0.01205345],"genre_scores_gemma":[0.9904236,0.0002135426,0.005070063,0.0001262358,0.003136473,0.00001038205,3.781438e-7,0.00004166862,0.0009776993],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1772887,"threshold_uncertainty_score":0.5434424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099082421","doi":"10.1016/j.jcta.2013.05.002","title":"Rank of divisors on tropical curves","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Rank (graph theory); Mathematics; Divisor (algebraic geometry); Conjecture; Graph; Combinatorics; Equivalence (formal languages); Metric (unit); Discrete mathematics","authors":[{"name":"Jan Hladký","is_ca":false},{"name":"Daniel Král͏̌","is_ca":false},{"name":"Serguei Norine","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007274060713505347,"gpt":0.2169289368542224,"spread":0.209654876140717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003789368,0.0001039584,0.0002948816,0.00009694826,0.00004932306,0.00005712336,0.0006169303,0.00004146041,0.00007409728],"category_scores_gemma":[0.0002475242,0.00007632645,0.0001471489,0.0001877495,0.00007819152,0.0007451248,0.00009582139,0.0001690496,0.00001491525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002458011,"about_ca_system_score_gemma":0.00007847053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004288454,"about_ca_topic_score_gemma":1.231474e-7,"domain_scores_codex":[0.9987337,0.0002198832,0.0004580626,0.00009443926,0.0003531144,0.0001407834],"domain_scores_gemma":[0.9987455,0.0003372616,0.0004053317,0.0001869592,0.0002311862,0.00009374136],"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.0001736779,0.0001439364,0.0000862141,0.00002471047,0.00003683952,0.000005846634,0.0002729875,0.00002319596,0.0005707046,0.9826571,0.003116342,0.01288849],"study_design_scores_gemma":[0.001067919,0.001541998,0.00656651,0.0001838091,0.00001098427,0.00003553171,0.00003226789,0.000120203,0.005616288,0.9827743,0.001938058,0.0001121668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9514301,0.0005773082,0.03214227,0.004432162,0.008920292,0.0002101137,0.000001100333,0.00003924893,0.002247412],"genre_scores_gemma":[0.9984764,0.00006068588,0.0008135312,0.0002018436,0.0003437455,0.000001910158,1.597894e-7,0.000005114285,0.0000966404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04704628,"threshold_uncertainty_score":0.3112502,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009560547","doi":"10.1016/j.jcta.2005.05.004","title":"The stationary measure of a 2-type totally asymmetric exclusion process","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":61,"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 Hospital","funders":"","keywords":"Asymmetric simple exclusion process; Measure (data warehouse); Mathematics; Class (philosophy); Process (computing); Type (biology); Statistical physics; Space (punctuation); Simple (philosophy); Pure mathematics; Combinatorics; Computer science; Physics; Statistics; Artificial intelligence; Data mining","authors":[{"name":"Omer Angel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01994280896152402,"gpt":0.3038591216700842,"spread":0.2839163127085602,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001865922,0.0001359833,0.000340026,0.00009177774,0.00018708,0.00003753426,0.0003653021,0.00008043154,0.00004711818],"category_scores_gemma":[0.009599374,0.00008497675,0.00009651452,0.0004458042,0.00009251988,0.0002525357,0.0000573926,0.0002534325,0.000002221375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005288373,"about_ca_system_score_gemma":0.0003068082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.15763e-7,"about_ca_topic_score_gemma":6.739341e-7,"domain_scores_codex":[0.9981065,0.0001455841,0.000731092,0.00008593332,0.0007475275,0.0001834036],"domain_scores_gemma":[0.9950691,0.002382957,0.00075445,0.0001623285,0.001540584,0.00009059723],"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.002160844,0.000179497,0.000001798202,0.00007933887,0.00007343792,0.000006801733,0.0005496037,0.00002015709,0.0001509748,0.9827448,0.0005251836,0.01350757],"study_design_scores_gemma":[0.0008545953,0.001147079,0.00001017824,0.0001062418,0.00007979128,0.0000912802,0.0007609657,0.0001611337,0.001265535,0.9932281,0.002198817,0.00009623486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3056022,0.01101725,0.6229266,0.005373181,0.02575013,0.001941851,0.00008511591,0.0001580366,0.02714564],"genre_scores_gemma":[0.9935483,0.0001066243,0.005596831,0.00002810041,0.0005112465,0.00000288634,5.230247e-7,0.00002164374,0.0001838225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6879461,"threshold_uncertainty_score":0.9987432,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050823015","doi":"10.1006/jcta.2001.3230","title":"Tree-like Properties of Cycle Factorizations","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":61,"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":"Bijection; Combinatorics; Mathematics; Vertex (graph theory); Factorization; Generalization; Tree (set theory); Tuple; Product (mathematics); Degree (music); Class (philosophy); Set (abstract data type); Discrete mathematics; Computer science; Graph; Algorithm; Physics","authors":[{"name":"I. P. Goulden","is_ca":true},{"name":"Alexander Yong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01084859978924495,"gpt":0.1736988289356489,"spread":0.1628502291464039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003641556,0.0001303805,0.0003213934,0.0001221138,0.00006111735,0.00002737031,0.0002222075,0.00007753018,0.0002059153],"category_scores_gemma":[0.00007389892,0.0001039938,0.000149357,0.0002061317,0.0000944733,0.0004101361,0.00001511892,0.0001665021,0.000006481473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002159362,"about_ca_system_score_gemma":0.00001075377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.35069e-7,"about_ca_topic_score_gemma":4.301303e-7,"domain_scores_codex":[0.9989469,0.000130528,0.0005087511,0.00005228431,0.0002162211,0.0001453195],"domain_scores_gemma":[0.9993765,0.0000555507,0.0001834071,0.0001563382,0.0001559653,0.0000722624],"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.0004069404,0.0002431668,0.00024362,0.0002466466,0.0004425482,0.0000187524,0.005899955,0.002033825,0.06967581,0.9167781,0.001863172,0.002147415],"study_design_scores_gemma":[0.004195848,0.001699743,0.0002564834,0.0007551204,0.0002494638,0.0003652405,0.006342308,0.001041536,0.2251187,0.6960431,0.06307817,0.0008543169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9726735,0.002776579,0.0005822701,0.00003948666,0.01190909,0.0001311303,0.000006878445,0.0000799534,0.01180105],"genre_scores_gemma":[0.9991889,0.0001303108,0.00003190631,0.000005006693,0.0003403971,0.00000247756,2.840233e-7,0.00002359917,0.0002771185],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.220735,"threshold_uncertainty_score":0.4240744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087428017","doi":"10.1006/jcta.1999.3006","title":"The Distribution of the Maximum Vertex Degree in Random Planar Maps","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":59,"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":"Mathematics; Independent and identically distributed random variables; Vertex (graph theory); Combinatorics; Degree (music); Random variable; Limiting; Triangulation; Distribution (mathematics); Discrete mathematics; Asymptotic distribution; Planar; Statistics; Geometry; Mathematical analysis; Computer science; Physics","authors":[{"name":"Zhicheng Gao","is_ca":true},{"name":"Nicholas Wormald","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01727243179445884,"gpt":0.2589933192367653,"spread":0.2417208874423064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002646902,0.0002220534,0.000603286,0.00004348359,0.000228713,0.00004839016,0.000900736,0.0001356053,0.00006303714],"category_scores_gemma":[0.002992304,0.0001243045,0.0002923288,0.0003774599,0.0003125478,0.0003013219,0.00006710804,0.0005214075,0.000003818277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001304368,"about_ca_system_score_gemma":0.0001744996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003367075,"about_ca_topic_score_gemma":0.000006531721,"domain_scores_codex":[0.9970708,0.0006575286,0.001192541,0.0001103905,0.0006637944,0.0003048683],"domain_scores_gemma":[0.9954253,0.002768612,0.0009192653,0.000547633,0.0002687724,0.00007043732],"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.003603166,0.0002214232,0.00005087806,0.00004463438,0.00007493091,0.00001209146,0.0004979186,0.00001469485,0.00009750476,0.9912419,0.001092494,0.003048318],"study_design_scores_gemma":[0.004346327,0.000287796,0.0001272102,0.000219384,0.00007076277,0.00008869246,0.0004788684,0.000005755801,0.001787818,0.9781377,0.01432056,0.0001290702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9696921,0.0008116093,0.001342976,0.001404345,0.01582776,0.001112744,0.00004987346,0.00004539745,0.009713217],"genre_scores_gemma":[0.9986253,0.000209316,0.0003444094,0.00001639216,0.0003237718,0.000009480994,0.000001387974,0.00003488781,0.000435077],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0289332,"threshold_uncertainty_score":0.506899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023034313","doi":"10.1016/j.jcta.2005.01.006","title":"A simple proof that a word of length n has at most <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:math> distinct squares","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Word (group theory); Simple (philosophy); Scroll; Mathematics; Computer science; Theology; Philosophy; Geometry","authors":[{"name":"Lucian Ilie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01523654024083817,"gpt":0.2316709412900469,"spread":0.2164344010492087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002191106,0.000419064,0.0004422425,0.0001932663,0.0006899423,0.0006217165,0.001744716,0.0004023496,0.0005696763],"category_scores_gemma":[0.0006672453,0.0004679765,0.0006551644,0.0004711596,0.0006108708,0.001750685,0.001059598,0.0006339637,0.00009566436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004480095,"about_ca_system_score_gemma":0.0005714325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005476865,"about_ca_topic_score_gemma":0.00004891428,"domain_scores_codex":[0.9960573,0.000347744,0.001079282,0.0005099871,0.001240545,0.0007651788],"domain_scores_gemma":[0.9958411,0.000978724,0.001585571,0.001059624,0.000185692,0.0003492604],"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.001598602,0.000313839,0.00001785856,0.0001542679,0.0003222938,0.0002510005,0.002086229,0.0002317893,0.001032943,0.9823927,0.006491491,0.005106993],"study_design_scores_gemma":[0.007125124,0.005421069,0.0003168705,0.001494634,0.0006426884,0.002784101,0.002674825,0.1302695,0.4665495,0.2800707,0.1007909,0.001860117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9902675,0.0008065588,0.001756086,0.0005571657,0.003306941,0.00006829729,0.00005667115,0.0001147101,0.003066075],"genre_scores_gemma":[0.9962326,0.0001347515,0.001727544,0.0003297525,0.001283811,0.00004690642,0.00002487893,0.0001026802,0.0001170965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.702322,"threshold_uncertainty_score":0.9997772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011862520","doi":"10.1006/jcta.2000.3090","title":"Noncommutative Pieri Operators on Posets","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":54,"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":"Hopf algebra; Mathematics; Representation theory of Hopf algebras; Noncommutative geometry; Symmetric function; Morphism; Algebra over a field; Eulerian path; Partially ordered set; Pure mathematics; Cellular algebra; Symmetric algebra; Quasitriangular Hopf algebra; Filtered algebra; Division algebra; Combinatorics; Algebra representation; Lagrangian","authors":[{"name":"Nantel Bergeron","is_ca":true},{"name":"Stefan Mykytiuk","is_ca":true},{"name":"Frank Sottile","is_ca":false},{"name":"Stephanie van Willigenburg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01910019330812778,"gpt":0.3076467139488878,"spread":0.28854652064076,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001638696,0.0003899307,0.0008913485,0.000166789,0.0002281218,0.00009673427,0.0007266236,0.0001809217,0.001231068],"category_scores_gemma":[0.00183046,0.0003131661,0.0003042159,0.0003628357,0.000211951,0.0006966061,0.00006659109,0.0007016408,0.00006663385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002084958,"about_ca_system_score_gemma":0.0001629795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.646506e-7,"about_ca_topic_score_gemma":3.161423e-7,"domain_scores_codex":[0.9969334,0.0005713553,0.00112457,0.0001948194,0.0007848396,0.0003910234],"domain_scores_gemma":[0.9961631,0.001828793,0.0007586487,0.0005414791,0.0004722376,0.0002356957],"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.00246129,0.0006223549,0.000006273855,0.00004062168,0.0001709118,0.0001123728,0.002121602,0.0000343349,0.000208698,0.9893756,0.001592024,0.003253942],"study_design_scores_gemma":[0.002602593,0.002508666,0.000006593085,0.0002301126,0.00008712099,0.000205842,0.000765461,0.000005118671,0.006243145,0.9697301,0.01729916,0.0003160275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9437088,0.0001701535,0.0007395413,0.0004833221,0.01004584,0.0005267317,0.00001613066,0.0001319071,0.04417757],"genre_scores_gemma":[0.9877785,0.0001102874,0.008479963,0.0001672869,0.001375884,0.0000121664,0.000001276585,0.0001175288,0.001957061],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04406974,"threshold_uncertainty_score":0.9999321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061558558","doi":"10.1016/j.jcta.2011.03.001","title":"A new perspective on k-triangulations","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":50,"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":"Combinatorics; Vertex (graph theory); Regular polygon; Connection (principal bundle); Mathematics; Perspective (graphical); Simplicial complex; Geometry; Graph","authors":[{"name":"Christian Stump","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04799602244463853,"gpt":0.3177025371835228,"spread":0.2697065147388842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009662055,0.0002520074,0.0005670772,0.0002155632,0.0001269094,0.00003657841,0.0004790518,0.0001344527,0.0005445138],"category_scores_gemma":[0.00396826,0.0002068645,0.0002810732,0.0003170286,0.00009026929,0.0005083391,0.00006827186,0.0004284239,0.00002154269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002713693,"about_ca_system_score_gemma":0.0002624788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005201736,"about_ca_topic_score_gemma":9.73867e-7,"domain_scores_codex":[0.9980673,0.0002440738,0.0007542293,0.0001508503,0.0005256251,0.0002579073],"domain_scores_gemma":[0.9967346,0.001000579,0.0009439255,0.0004221426,0.0006758893,0.0002228595],"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.001701833,0.0003529733,0.000007727499,0.000013323,0.0001507677,0.00004112156,0.005961204,0.000001613788,0.00009897696,0.9894208,0.001933365,0.0003162437],"study_design_scores_gemma":[0.002113068,0.001572984,0.00002025217,0.0001082299,0.0001210713,0.0001096338,0.002882848,9.889479e-7,0.00409234,0.9867527,0.002019014,0.0002068679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2353741,0.0008492908,0.1891454,0.001950118,0.08169308,0.002597821,0.00002459633,0.0006890605,0.4876765],"genre_scores_gemma":[0.9076812,0.00002464221,0.08697889,0.00006265788,0.002639265,0.000007126189,3.249927e-7,0.0001090864,0.002496866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.672307,"threshold_uncertainty_score":0.843569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2594692962","doi":"10.1016/j.jcta.2013.05.008","title":"There is no upper bound for the diameter of the commuting graph of a finite group","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Australian Research Council; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Mathematics; Combinatorics; Graph; Upper and lower bounds; Construct (python library); Finite group; Group (periodic table); Discrete mathematics; Mathematical analysis; Computer science","authors":[{"name":"Michael Giudici","is_ca":false},{"name":"Christopher Parker","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03221502957088206,"gpt":0.2928860373630313,"spread":0.2606710077921492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004636513,0.0002165629,0.0005997299,0.0001149662,0.0002765266,0.00008875345,0.001297348,0.0001350949,0.0006265545],"category_scores_gemma":[0.004364543,0.00011101,0.0006683231,0.0003205707,0.0007648302,0.0003664905,0.0002276855,0.0005429724,0.000005475429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003689633,"about_ca_system_score_gemma":0.00009589845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001445883,"about_ca_topic_score_gemma":0.000001666129,"domain_scores_codex":[0.9970364,0.0008508119,0.001000646,0.000114333,0.0006630066,0.0003347795],"domain_scores_gemma":[0.9851,0.0116954,0.001262965,0.0007478438,0.001125613,0.00006816872],"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.001635542,0.0003028323,0.0006318419,0.0002793593,0.0005328615,0.000001049671,0.003498613,0.000002601528,0.005348369,0.9838638,0.00308081,0.0008222837],"study_design_scores_gemma":[0.001531713,0.000925072,0.0002935744,0.0002403331,0.0001279161,0.00001819804,0.002204606,0.00003709363,0.008843388,0.9824258,0.003231693,0.0001205897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9822136,0.0009446777,0.00414484,0.001751467,0.005471825,0.001874268,0.00006602775,0.00001969771,0.003513569],"genre_scores_gemma":[0.9971184,0.00006617898,0.001657509,0.0001188492,0.0003847987,0.00003367648,4.309867e-7,0.00005499999,0.0005651301],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0149048,"threshold_uncertainty_score":0.6860332,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035044354","doi":"10.1016/j.jcta.2010.11.003","title":"An Erdős–Ko–Rado theorem for the derangement graph of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">PGL</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>q</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math> acting on the projective line","year":2010,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":49,"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":"Combinatorics; Derangement; Pencil (optics); Mathematics; Coset; Point (geometry); Projective test; Graph; Discrete mathematics; Pure mathematics; Physics; Geometry","authors":[{"name":"Karen Meagher","is_ca":true},{"name":"Pablo Spiga","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02436183775028209,"gpt":0.272036096667892,"spread":0.2476742589176099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity"],"category_scores_codex":[0.01395754,0.001729693,0.00117972,0.0009544742,0.003592132,0.002539888,0.004911004,0.002876272,0.0053121],"category_scores_gemma":[0.007917093,0.002089111,0.003225133,0.00176824,0.003367129,0.002548095,0.002423973,0.00521397,0.0004436298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009347145,"about_ca_system_score_gemma":0.002353268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005365453,"about_ca_topic_score_gemma":0.0004305695,"domain_scores_codex":[0.9837251,0.00228922,0.003969118,0.001963754,0.004713883,0.003338973],"domain_scores_gemma":[0.9782051,0.01038556,0.005799461,0.003146502,0.001163697,0.001299641],"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.01562126,0.001696566,0.0000125394,0.001686951,0.004802295,0.0007073035,0.009655775,0.0007959595,0.006020474,0.9438998,0.01122675,0.003874389],"study_design_scores_gemma":[0.005733593,0.008950014,0.00002120371,0.002255369,0.002989926,0.001831303,0.01776177,0.0216979,0.4701706,0.4629845,0.00357371,0.002030164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9771113,0.001024926,0.001291365,0.001334788,0.007803095,0.0004870913,0.0008704286,0.0002687337,0.009808303],"genre_scores_gemma":[0.9877079,0.001182892,0.002504713,0.0008186959,0.005217427,0.001074244,0.0002495159,0.001118174,0.0001264844],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4809152,"threshold_uncertainty_score":0.9995449,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997415583","doi":"10.1016/j.jcta.2011.07.005","title":"Binary bubble languages and cool-lex order","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Guelph; University of Victoria","funders":"","keywords":"Substring; Mathematics; Combinatorics; Lexicographical order; Binary number; String (physics); Discrete mathematics; Order (exchange); De Bruijn sequence; Set (abstract data type); Computer science; Arithmetic","authors":[{"name":"Frank Ruskey","is_ca":true},{"name":"Joe Sawada","is_ca":true},{"name":"Aaron Williams","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01032223206314684,"gpt":0.2343718908907133,"spread":0.2240496588275665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001190727,0.000148849,0.0002859762,0.0001214334,0.0001130514,0.0001098963,0.0007063313,0.00007605016,0.0001349113],"category_scores_gemma":[0.0001612721,0.0001143219,0.00007458906,0.0002507126,0.000143554,0.001158456,0.00024855,0.0002061984,0.000007935443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001834437,"about_ca_system_score_gemma":0.00008173148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006614,"about_ca_topic_score_gemma":3.160304e-7,"domain_scores_codex":[0.9988475,0.0002145378,0.0003419867,0.0001453422,0.0002388978,0.0002117626],"domain_scores_gemma":[0.9988852,0.0001710937,0.000302682,0.000302601,0.0002090415,0.0001293423],"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.0003570206,0.0001054057,0.0001086017,0.00001215904,0.00005039977,0.0001619455,0.002305277,8.381462e-7,0.001081019,0.9903746,0.0007114349,0.00473129],"study_design_scores_gemma":[0.001198962,0.001192069,0.001367516,0.00006321981,0.00002636079,0.0006136743,0.00132618,0.00005603356,0.006591406,0.9785225,0.008809183,0.000232828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9457595,0.00402947,0.02076839,0.0005611595,0.009658907,0.0002006283,0.000004262553,0.0001949246,0.0188227],"genre_scores_gemma":[0.9897966,0.0001434516,0.009079728,0.0001883161,0.000356766,0.000001719128,3.116127e-7,0.00001508654,0.0004180169],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04403705,"threshold_uncertainty_score":0.466191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967329424","doi":"10.1016/j.jcta.2009.07.010","title":"Extensions and restrictions of Wythoff's game preserving its <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"script\">P</mml:mi></mml:math> positions","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"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":"Fibonacci number; Morphism; Set (abstract data type); Computer science; Word (group theory); Discrete mathematics; Mathematics; Combinatorics; Programming language; Geometry","authors":[{"name":"Éric Duchêne","is_ca":false},{"name":"Aviezri S. Fraenkel","is_ca":false},{"name":"Richard J. Nowakowski","is_ca":true},{"name":"Michel Rigo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01330065365849757,"gpt":0.233852888487054,"spread":0.2205522348285564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001323791,0.000251205,0.000314847,0.0002116386,0.0005230972,0.0003898059,0.0009092735,0.0002627809,0.00004616735],"category_scores_gemma":[0.0005990387,0.0002661617,0.0003304795,0.0004562637,0.000203957,0.0017272,0.0004540354,0.0005071444,0.00002507985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001950385,"about_ca_system_score_gemma":0.0003032369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002381255,"about_ca_topic_score_gemma":0.000002747254,"domain_scores_codex":[0.9975789,0.0002515444,0.0007888525,0.0003224238,0.0006319577,0.0004262945],"domain_scores_gemma":[0.9973971,0.0005539735,0.0008447862,0.0007062113,0.0002460219,0.0002518625],"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.0003340062,0.0002284721,0.000002363738,0.0000436749,0.0001284482,0.0002037568,0.001044237,0.0001549989,0.008113847,0.9881948,0.0008808548,0.0006705457],"study_design_scores_gemma":[0.002760131,0.003784367,0.001125786,0.001174412,0.0004331363,0.003992425,0.001552562,0.2626659,0.0206473,0.6943496,0.006772112,0.00074226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.988135,0.0008530007,0.004181015,0.001025122,0.003292083,0.00006018766,0.0000246267,0.00009616742,0.002332738],"genre_scores_gemma":[0.9950398,0.0004101268,0.003470865,0.0003475654,0.0005880843,0.0000123039,0.000005333302,0.00003636962,0.00008951629],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2938452,"threshold_uncertainty_score":0.9999791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038004087","doi":"10.1016/s0097-3165(03)00098-0","title":"Cycle decompositions IV: complete directed graphs and fixed length directed cycles","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Directed graph; Discrete mathematics","authors":[{"name":"Brian Alspach","is_ca":true},{"name":"Heather Gavlas","is_ca":false},{"name":"Mateja Šajna","is_ca":true},{"name":"H. Verrall","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006390053528123849,"gpt":0.2002197457387437,"spread":0.1938296922106199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008098922,0.0002497335,0.0005011627,0.0002158067,0.0002348083,0.00009564752,0.0001902465,0.0001185835,0.00009032003],"category_scores_gemma":[0.0001595064,0.0002274424,0.0001770021,0.000352215,0.0001578997,0.0004136024,0.00001913448,0.0003256777,0.000004156984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003787097,"about_ca_system_score_gemma":0.00002586159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002160511,"about_ca_topic_score_gemma":0.000002266162,"domain_scores_codex":[0.9982396,0.0005462199,0.0005815802,0.000126719,0.0002223751,0.0002835522],"domain_scores_gemma":[0.9988649,0.0003791835,0.0001934758,0.0002028649,0.0001699705,0.0001896172],"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.0003573181,0.00009743719,0.0003231505,0.00005633951,0.0003670179,0.00003821299,0.0006769419,0.0002899523,0.01412737,0.9826253,0.0007418048,0.0002991563],"study_design_scores_gemma":[0.002210951,0.0003265401,0.00169377,0.0001362378,0.0001280982,0.0005549737,0.0006027382,0.0001474685,0.007118147,0.9670801,0.01958628,0.000414717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9847071,0.001794531,0.0002188841,0.00003533434,0.005797379,0.0001642263,0.00002339353,0.0003748664,0.006884336],"genre_scores_gemma":[0.9990946,0.0002168557,0.00044949,0.00001757812,0.0001274335,0.000006838744,0.000003284493,0.00004255666,0.00004137074],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01884447,"threshold_uncertainty_score":0.9274833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132589312","doi":"10.1016/j.jcta.2010.10.003","title":"Divisible design graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Adjacency matrix; Combinatorics; Mathematics; Indifference graph; Discrete mathematics; Chordal graph; Adjacency list; Strongly regular graph; Incidence matrix; Generalization; Cograph; Pathwidth; Line graph; Graph","authors":[{"name":"Willem H. Haemers","is_ca":false},{"name":"Hadi Kharaghani","is_ca":true},{"name":"Maaike A. Meulenberg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006352779784245656,"gpt":0.1935049568511631,"spread":0.1871521770669175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001814632,0.000164329,0.0003132731,0.0001631622,0.00008968486,0.00007229172,0.0003502047,0.0001287142,0.0002476787],"category_scores_gemma":[0.0001383331,0.0001368614,0.000181109,0.0002269303,0.0001001317,0.0004615372,0.00001881528,0.0005340885,0.00001543632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001288443,"about_ca_system_score_gemma":0.00003165399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.831957e-7,"about_ca_topic_score_gemma":3.804944e-7,"domain_scores_codex":[0.9988689,0.0001774735,0.0004371623,0.00006842594,0.0002307008,0.0002173809],"domain_scores_gemma":[0.9991184,0.000245207,0.0001459766,0.0002178643,0.0001362084,0.0001363214],"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.0003338733,0.00003828392,0.00007193255,0.00002434613,0.0001156873,0.00003046424,0.0003394063,0.0003353069,0.03529382,0.9610706,0.001505856,0.0008404044],"study_design_scores_gemma":[0.0007222516,0.0003085652,0.00008101892,0.00003133663,0.00003224231,0.0002385507,0.0001977994,0.00002560598,0.03061543,0.9443271,0.02324924,0.0001709179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9320276,0.0005298496,0.006973273,0.00004623861,0.04770232,0.0001924492,0.000003676891,0.0001529502,0.01237164],"genre_scores_gemma":[0.9986471,0.00003959327,0.0004832226,0.00001127129,0.0006445622,0.0000035224,2.973004e-7,0.00003145814,0.0001390039],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06661947,"threshold_uncertainty_score":0.5581045,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092375161","doi":"10.1006/jcta.2001.3218","title":"New Maximal Arcs in Desarguesian Planes","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":45,"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":"Conic section; Combinatorics; Arc (geometry); Mathematics; Projective plane; Order (exchange); Enumeration; Construct (python library); Discrete mathematics; Geometry; Computer science","authors":[{"name":"Rudolf Mathon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01182471589915402,"gpt":0.2068238645874503,"spread":0.1949991486882962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070246,0.0001536267,0.0003012656,0.0002999133,0.00008330233,0.0001615882,0.001035763,0.00007943259,0.0002152646],"category_scores_gemma":[0.0001212695,0.0001331632,0.0001600881,0.0005279921,0.00006636297,0.001012214,0.0001110354,0.0003185526,0.00001405029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000327831,"about_ca_system_score_gemma":0.00005290651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000275542,"about_ca_topic_score_gemma":0.00000148313,"domain_scores_codex":[0.9985253,0.0002965842,0.0004518703,0.0001447287,0.0003154534,0.0002660804],"domain_scores_gemma":[0.998966,0.0002368164,0.0002669508,0.0002908272,0.00007576458,0.0001636211],"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.0003335417,0.00009813013,0.0003171687,0.000005692247,0.0000248541,0.000162575,0.001281003,0.00001077546,0.0001602597,0.9791731,0.001187492,0.01724538],"study_design_scores_gemma":[0.001217336,0.0007449141,0.0003849751,0.00005509354,0.000008635869,0.0003590325,0.0001162965,0.00004402752,0.0008639219,0.9714207,0.02462185,0.0001632414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6081155,0.00705732,0.2765197,0.00817665,0.04711641,0.0006391648,0.000005585362,0.000414599,0.05195513],"genre_scores_gemma":[0.9914199,0.00009385213,0.007412302,0.0001107533,0.0006848607,9.914216e-7,1.513121e-7,0.00001073251,0.0002664388],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3833044,"threshold_uncertainty_score":0.5430239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051748292","doi":"10.1006/jcta.2001.3225","title":"The Largest Small Octagon","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Quadratic growth; Conjecture; Combinatorics; Unit (ring theory); Mathematics; Quadratic equation; Computer science; Geometry; Algorithm; Mathematics education","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Pierre Hansen","is_ca":false},{"name":"Frédéric Messine","is_ca":false},{"name":"Junjie Xiong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01966664275459042,"gpt":0.2502709973929753,"spread":0.2306043546383849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002941243,0.0001549968,0.0002476687,0.0001204911,0.000491989,0.0003280744,0.002242014,0.00006904528,0.00005649367],"category_scores_gemma":[0.0008250789,0.00009893837,0.0001880873,0.0004946723,0.0002805602,0.0009445967,0.0003013567,0.0005328196,0.00003139944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005658772,"about_ca_system_score_gemma":0.0000532679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.994575e-7,"about_ca_topic_score_gemma":7.561666e-7,"domain_scores_codex":[0.9977753,0.0006426805,0.0004713012,0.0001532772,0.0005439757,0.0004135022],"domain_scores_gemma":[0.9972436,0.001148784,0.00038715,0.000604686,0.0004428719,0.0001728683],"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.000222531,0.00007622682,0.00003530147,0.000003523203,0.00004153902,0.00006353894,0.0003343468,0.00001060121,0.0003299528,0.9871966,0.0008543645,0.01083148],"study_design_scores_gemma":[0.0007348077,0.0006423914,0.00004345347,0.00001772354,0.000006281412,0.0002360043,0.0001191412,0.00009599065,0.003257983,0.869141,0.1255872,0.0001180507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3176695,0.03448763,0.4013052,0.03599076,0.1115597,0.002029281,0.00001471766,0.0007675052,0.09617577],"genre_scores_gemma":[0.9895349,0.001144885,0.004368327,0.0001760366,0.001150236,0.000007601229,1.556385e-7,0.00003130158,0.003586526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6718655,"threshold_uncertainty_score":0.4166257,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069955765","doi":"10.1006/jcta.2001.3246","title":"Group-Divisible Designs with Block Size Four and Group-Type gum1 with m as Large or as Small as Possible","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Suzhou University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Group (periodic table); Type (biology); Mathematics; Block (permutation group theory); Combinatorics; Block size; Spectrum (functional analysis); Physics; Computer science; Biology","authors":[{"name":"G. Ge","is_ca":false},{"name":"Rolf S. Rees","is_ca":true},{"name":"Lin Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01417728954953936,"gpt":0.1983650972140626,"spread":0.1841878076645232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001119403,0.0004031032,0.0006369794,0.0001425973,0.0003584244,0.0003281122,0.0004347534,0.0001837439,0.0005151785],"category_scores_gemma":[0.0002396454,0.0002725831,0.0001058436,0.0003813577,0.0001704779,0.0007571179,0.00006218356,0.0005014825,0.00003243477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005240571,"about_ca_system_score_gemma":0.00004898007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001141695,"about_ca_topic_score_gemma":0.00001709201,"domain_scores_codex":[0.9980408,0.0002658682,0.0005456082,0.000216502,0.0004317125,0.0004995076],"domain_scores_gemma":[0.9983181,0.0004029001,0.0003534856,0.0003900147,0.0002213066,0.0003141561],"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.01542119,0.0004907082,0.001696546,0.0003611231,0.001191212,0.001773973,0.002611459,0.0002863577,0.00444897,0.970531,0.000823279,0.000364208],"study_design_scores_gemma":[0.02372588,0.03915985,0.001574284,0.002024259,0.0007644054,0.01784804,0.006498299,0.0001869068,0.01468658,0.8659281,0.02535546,0.002247917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9879359,0.0007542522,0.0001958795,0.00007734774,0.002486508,0.0003000413,0.00000437071,0.0001123356,0.008133381],"genre_scores_gemma":[0.9972426,0.0002485253,0.0003767067,0.00007470739,0.0005311825,0.000009160654,6.293571e-7,0.00009371107,0.001422821],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1046028,"threshold_uncertainty_score":0.9999726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071136805","doi":"10.1016/j.jcta.2008.06.006","title":"Computing a pyramid partition generating function with dimer shuffling","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Shuffling; Conjecture; Partition function (quantum field theory); Pyramid (geometry); Conifold; Domino; Mathematics; Partition (number theory); Combinatorics; Generating function; Singularity; Discrete mathematics; Pure mathematics; Geometry; Mathematical physics; Physics","authors":[{"name":"Ben Young","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0289663444363026,"gpt":0.2702389285313033,"spread":0.2412725840950007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001369697,0.0002859711,0.0006346017,0.0001358005,0.0004563905,0.00006126022,0.0002472734,0.0001270231,0.00004447738],"category_scores_gemma":[0.001197882,0.0002255449,0.0001665856,0.0003163079,0.0001926322,0.0007675056,0.00007138991,0.0005066814,0.000003673747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001352549,"about_ca_system_score_gemma":0.000161839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.972909e-7,"about_ca_topic_score_gemma":6.139134e-7,"domain_scores_codex":[0.997548,0.0002859476,0.0009720323,0.0001773584,0.000682839,0.0003338099],"domain_scores_gemma":[0.9966534,0.0008860111,0.001335848,0.000293153,0.0006935794,0.0001379597],"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.001303312,0.0002625476,0.0001264025,0.00007448889,0.0001716969,0.00008326529,0.001631811,0.0004994716,0.002518983,0.9927932,0.0002310214,0.0003037911],"study_design_scores_gemma":[0.0022434,0.00153229,0.00001967394,0.0002286492,0.0001541953,0.000879007,0.0007984585,0.0002682678,0.005117368,0.9873789,0.001094415,0.0002853955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8647186,0.0001254908,0.1284992,0.00008777727,0.005448808,0.0002365236,0.000001064847,0.0001042083,0.0007782669],"genre_scores_gemma":[0.9656828,0.00001863744,0.03236828,0.00003793078,0.001703148,0.000004317345,0.000001112283,0.00006716933,0.0001165683],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1009642,"threshold_uncertainty_score":0.9197454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1989541938","doi":"10.1016/j.jcta.2009.09.001","title":"Map operations and k-orbit maps","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":41,"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":"Orbit (dynamics); Automorphism group; Mathematics; Automorphism; Heteroclinic orbit; Truncation (statistics); Genus; Physics; Combinatorics; Homoclinic orbit; Bifurcation; Biology","authors":[{"name":"Alen Orbanić","is_ca":false},{"name":"Daniel Pellicer","is_ca":true},{"name":"Asia Ivić Weiss","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02877329543576233,"gpt":0.3150080799824266,"spread":0.2862347845466643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002485848,0.000150679,0.0003654273,0.0001618437,0.0001789548,0.0001416841,0.0002989492,0.00009950395,0.000254169],"category_scores_gemma":[0.001224226,0.0001210873,0.0001045937,0.0001341188,0.0001519021,0.0005427839,0.00004485751,0.0004130511,0.00001356027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000497304,"about_ca_system_score_gemma":0.00009837088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.824018e-7,"about_ca_topic_score_gemma":7.192357e-7,"domain_scores_codex":[0.99832,0.0004178117,0.0005143434,0.0001069609,0.0004049864,0.0002358956],"domain_scores_gemma":[0.9984362,0.0006429548,0.0001708992,0.0002401932,0.0003525052,0.0001572656],"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.0008658087,0.000159505,0.00001510661,0.00002278507,0.00004838316,0.00005146829,0.0007917848,0.000002286298,0.001429366,0.9929927,0.002789728,0.0008310864],"study_design_scores_gemma":[0.001180737,0.001282512,0.00005748219,0.00005486122,0.00003661534,0.000253201,0.0006545937,0.000004664909,0.001532242,0.984907,0.009911116,0.0001249932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9646415,0.001155968,0.001777768,0.006309232,0.005641893,0.0005639643,0.00002109724,0.00009264659,0.01979595],"genre_scores_gemma":[0.9924572,0.00006582679,0.004457844,0.0001317031,0.0009540315,0.00000241725,0.000001282408,0.00002576924,0.001903928],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02781571,"threshold_uncertainty_score":0.4937797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154493507","doi":"10.1016/s0097-3165(03)00006-2","title":"Width and dual width of subsets in polynomial association schemes","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":40,"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":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Mitacs; National Science Foundation","keywords":"Association scheme; Mathematics; Combinatorics; Eigenvalues and eigenvectors; Dual (grammatical number); Graph; Discrete mathematics; Polynomial; Physics; Mathematical analysis","authors":[{"name":"A.E. Brouwer","is_ca":false},{"name":"Chris Godsil","is_ca":true},{"name":"Jack H. Koolen","is_ca":false},{"name":"William J. Martin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.022878052541248,"gpt":0.2962240398218491,"spread":0.2733459872806011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006708063,0.0001576951,0.0005610873,0.0002577024,0.00005937581,0.00004602097,0.0001770047,0.0001741014,0.0001348597],"category_scores_gemma":[0.008266704,0.0001395939,0.0001115884,0.0002914049,0.0001443875,0.0004382568,0.00005701232,0.0004535263,0.000001865214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001846554,"about_ca_system_score_gemma":0.0002065825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002633411,"about_ca_topic_score_gemma":0.000003430211,"domain_scores_codex":[0.9971434,0.001056806,0.0007942742,0.0001138093,0.0006032819,0.0002884057],"domain_scores_gemma":[0.9964868,0.002065402,0.000822839,0.0001753917,0.0003492903,0.0001002262],"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.001934699,0.0002857933,0.006751703,0.00007508735,0.0001198469,0.00003169652,0.001093531,9.94519e-7,0.002946541,0.9857689,0.0006037288,0.0003874724],"study_design_scores_gemma":[0.003121031,0.0006298274,0.0006401616,0.00008960455,0.00003792568,0.00007306665,0.0005984831,0.000001758607,0.0147428,0.9760811,0.003853348,0.0001308698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9954141,0.0002800667,0.00004008312,0.0001258362,0.001397809,0.0001510116,0.000006183289,0.000008464608,0.002576452],"genre_scores_gemma":[0.9979656,0.00006313374,0.001375956,0.00001144023,0.0002196525,0.000002294607,5.065548e-7,0.00002576558,0.0003356655],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01179626,"threshold_uncertainty_score":0.9896614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069076235","doi":"10.1016/j.jcta.2013.05.006","title":"Average mixing of continuous quantum walks","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"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":"Kempe Foundation","keywords":"Combinatorics; Adjacency matrix; Mathematics; Valency; Mixing (physics); Matrix (chemical analysis); Discrete mathematics; Quantum walk; Graph; Quantum; Quantum algorithm; Physics; Quantum mechanics","authors":[{"name":"Chris Godsil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004749944518514823,"gpt":0.2049384801558578,"spread":0.200188535637343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001122621,0.0001767301,0.0004938563,0.0001584833,0.0001172155,0.0001648262,0.001083615,0.00008196269,0.00005018003],"category_scores_gemma":[0.0002519837,0.0001349016,0.0002251046,0.0002771723,0.0001157729,0.0006921128,0.0002411338,0.0003813813,0.000007344259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002418026,"about_ca_system_score_gemma":0.000111803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001115773,"about_ca_topic_score_gemma":1.057522e-7,"domain_scores_codex":[0.9981441,0.000294296,0.0006926789,0.0001556287,0.0004325417,0.0002807429],"domain_scores_gemma":[0.9978633,0.0003974612,0.000767451,0.0003541721,0.0004822089,0.0001354131],"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.000106634,0.0001498904,0.00007758811,0.00002995641,0.00009039226,0.00005798829,0.001831723,0.0006380101,0.004845376,0.9677377,0.0007007974,0.02373389],"study_design_scores_gemma":[0.001141149,0.001267466,0.0004680791,0.0001438154,0.00001215406,0.00036406,0.0001696341,0.008099015,0.006333802,0.9777477,0.004036728,0.0002163328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8564432,0.0004997953,0.130059,0.0009307958,0.01082824,0.0001777367,0.000001455777,0.00006138489,0.0009983788],"genre_scores_gemma":[0.9909182,0.00001883926,0.008340282,0.0000702409,0.0005485971,0.000001300302,1.820611e-7,0.00001311331,0.00008924826],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.134475,"threshold_uncertainty_score":0.5501129,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999694424","doi":"10.1016/j.jcta.2010.11.014","title":"Asymptotic enumeration and limit laws for graphs of fixed genus","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":40,"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; Combinatorics; Enumeration; Genus; Planar graph; Planar; Exponential function; Graph; Limit (mathematics); Exponential growth; Discrete mathematics; Surface (topology); Random graph; Limit of a function; Mathematical analysis; Geometry; Computer science","authors":[{"name":"Guillaume Chapuy","is_ca":true},{"name":"Éric Fusy","is_ca":false},{"name":"Omer Giménez","is_ca":false},{"name":"Bojan Mohar","is_ca":true},{"name":"Marc Noy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01784735439931655,"gpt":0.2861719986867395,"spread":0.268324644287423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008743606,0.0001059405,0.000343331,0.00006061177,0.00007329849,0.00003142449,0.0001283311,0.00009794075,0.00003687578],"category_scores_gemma":[0.004482644,0.00008452833,0.00008830419,0.00007402896,0.0000816954,0.0001499282,0.00002559574,0.0001935995,2.726974e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007352958,"about_ca_system_score_gemma":0.00006868986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.628393e-7,"about_ca_topic_score_gemma":0.000001513386,"domain_scores_codex":[0.9990817,0.00004467996,0.0004753823,0.00007607543,0.0001974181,0.0001247399],"domain_scores_gemma":[0.9973041,0.001584224,0.0004590042,0.0001117892,0.0004583104,0.00008257582],"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.0008052751,0.00008900261,0.000005609008,0.000132819,0.00005692634,0.000002567251,0.0002694509,3.097606e-7,0.005895498,0.9904756,0.0001415565,0.002125405],"study_design_scores_gemma":[0.001187302,0.001168838,0.00001488957,0.0000438816,0.0001231379,0.00006806001,0.0001383035,0.00009659971,0.006687218,0.9895555,0.000830554,0.00008566251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5970039,0.0001912437,0.3927801,0.0003245806,0.008742786,0.0004556131,0.00004806576,0.00002046135,0.0004332484],"genre_scores_gemma":[0.9743519,0.00002054571,0.02525122,0.00001489602,0.0002933888,0.000005593354,7.751983e-7,0.00001674657,0.00004490287],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3773481,"threshold_uncertainty_score":0.5366468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3011285915","doi":"10.1016/j.jcta.2019.105190","title":"The partition rank of a tensor and k-right corners in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:msubsup><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math>","year":2020,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Partition (number theory); Combinatorics; Rank (graph theory); Discrete mathematics","authors":[{"name":"Eric Naslund","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01948802082768114,"gpt":0.2484689187412446,"spread":0.2289808979135635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003374156,0.0008997054,0.0005251543,0.000558919,0.001806727,0.00169843,0.00235251,0.002175475,0.5013272],"category_scores_gemma":[0.002296462,0.001569875,0.001944522,0.001430387,0.002358856,0.001865099,0.001430312,0.002259514,0.0008082286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002425652,"about_ca_system_score_gemma":0.001812618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004538122,"about_ca_topic_score_gemma":0.0004540988,"domain_scores_codex":[0.9900302,0.0009101015,0.002977961,0.001351126,0.002670474,0.002060102],"domain_scores_gemma":[0.9896075,0.002795731,0.003842731,0.002057589,0.0003824288,0.00131401],"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.005313696,0.0004268688,0.00001143335,0.001027469,0.001601829,0.001047047,0.003553734,0.0005401928,0.002645276,0.7290144,0.2540484,0.0007696908],"study_design_scores_gemma":[0.005621871,0.002754631,0.0001148605,0.001694706,0.002214117,0.002754265,0.006359453,0.008379348,0.9541298,0.006472547,0.007899631,0.001604752],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5414868,0.001113528,0.0007625414,0.00253976,0.004308172,0.0000729739,0.0002994132,0.0001649281,0.4492519],"genre_scores_gemma":[0.9898454,0.001959719,0.001903568,0.001371999,0.002802448,0.0007671266,0.0003823551,0.0006980643,0.0002693268],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9514846,"threshold_uncertainty_score":0.9999698,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2343027471","doi":"10.1016/j.jcta.2017.02.006","title":"Cutting algebraic curves into pseudo-segments and applications","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"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; Bounded function; Constant (computer programming); Upper and lower bounds; Degree (music); Plane (geometry); Algebraic number; Plane curve; Combinatorics; Algebraic curve; Family of curves; Space (punctuation); Current (fluid); Discrete mathematics; Geometry; Mathematical analysis; Computer science","authors":[{"name":"Micha Sharir","is_ca":false},{"name":"Joshua Zahl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008612297358442805,"gpt":0.2626257957242412,"spread":0.2540134983657983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001025812,0.00009074197,0.0001681044,0.000084285,0.0006085233,0.0003566533,0.0006850665,0.00003572425,0.000008196794],"category_scores_gemma":[0.0002931568,0.00008099884,0.000055922,0.00009353109,0.00008741328,0.001498656,0.0002299922,0.0001258521,0.000002881148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002314102,"about_ca_system_score_gemma":0.00009402777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001632359,"about_ca_topic_score_gemma":3.044035e-7,"domain_scores_codex":[0.9991021,0.00009816598,0.0003036753,0.0001255274,0.0002647187,0.0001057747],"domain_scores_gemma":[0.9986205,0.0001413521,0.0005629126,0.0003064383,0.0002770709,0.00009173794],"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.00003487064,0.00004530894,0.000153869,0.00003495445,0.00003276206,0.000004922643,0.0002030768,0.00001862129,0.0006786815,0.9601972,0.0003206671,0.03827507],"study_design_scores_gemma":[0.0005908087,0.0002053632,0.001236852,0.0001019166,0.00001697565,0.0001112548,0.00003638598,0.000172045,0.002352731,0.9800392,0.01502729,0.0001091267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1280867,0.004696222,0.8475009,0.006083579,0.009099877,0.0004891638,0.000002555567,0.00006717822,0.003973786],"genre_scores_gemma":[0.9819571,0.000541092,0.01593232,0.0002367931,0.001064629,0.00001031291,0.000001224446,0.000007658795,0.0002488791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8538703,"threshold_uncertainty_score":0.468033,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066106400","doi":"10.1016/j.jcta.2013.01.010","title":"Advances in the merit factor problem for binary sequences","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Binary number; Skew; Conjecture; Figure of merit; Aperiodic graph; Combinatorics; Complementary sequences; Binary Golay code; Pseudorandom binary sequence; Autocorrelation; Discrete mathematics; Algorithm; Statistics; Computer science; Arithmetic","authors":[{"name":"Jonathan Jedwab","is_ca":true},{"name":"Daniel J. Katz","is_ca":true},{"name":"Kai‐Uwe Schmidt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01020144908275027,"gpt":0.2443090263247128,"spread":0.2341075772419626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001612792,0.0001438015,0.000255904,0.0001533187,0.0001639764,0.0002617388,0.001479437,0.00005479983,0.00003903128],"category_scores_gemma":[0.000144524,0.00008742487,0.0001865872,0.0004399737,0.0001465424,0.002718986,0.00007461978,0.0002213048,0.000003001705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002059012,"about_ca_system_score_gemma":0.00007909576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001955372,"about_ca_topic_score_gemma":8.384256e-7,"domain_scores_codex":[0.998462,0.0004240772,0.0004334332,0.0001388195,0.0002973452,0.0002442858],"domain_scores_gemma":[0.9982764,0.0008260545,0.0003597178,0.000257452,0.0002219455,0.00005841966],"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.0001923467,0.00008726317,0.00008892525,0.00002032676,0.00001469688,0.000007690484,0.001802321,0.00001356818,0.0005852437,0.9793199,0.0002171728,0.01765051],"study_design_scores_gemma":[0.0005634274,0.001283771,0.0001751261,0.00005193009,0.000006440549,0.00005762248,0.0007857318,0.00002286252,0.0005893442,0.9635845,0.03276033,0.000118925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7723161,0.01267738,0.1482309,0.01761438,0.02922138,0.003667131,0.00001731176,0.0002417283,0.01601371],"genre_scores_gemma":[0.9934936,0.0002495612,0.005629207,0.0001761495,0.0003706173,0.00004707444,2.633574e-7,0.000007542524,0.0000260141],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2211775,"threshold_uncertainty_score":0.3565083,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2967936998","doi":"10.1016/j.jcta.2017.11.018","title":"Extremal bounds for bootstrap percolation in the hypercube","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Oxford","keywords":"Hypercube; Combinatorics; Vertex (graph theory); Mathematics; Cardinality (data modeling); Conjecture; Upper and lower bounds; Mathematical proof; Discrete mathematics; Graph; Computer science; Geometry","authors":[{"name":"Natasha Morrison","is_ca":false},{"name":"Jonathan A. Noel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08848085778958001,"gpt":0.3732643041425507,"spread":0.2847834463529707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002231078,0.0001135274,0.0002905157,0.00004454044,0.0003259699,0.0002004817,0.0005502517,0.00008282578,0.00003163946],"category_scores_gemma":[0.006975394,0.00007344672,0.0001156128,0.00003901288,0.00009284711,0.0003794597,0.00003386003,0.0002166067,7.408613e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003534398,"about_ca_system_score_gemma":0.00009569497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001428691,"about_ca_topic_score_gemma":0.000004004007,"domain_scores_codex":[0.9989105,0.00009451221,0.0004416745,0.00008204445,0.0002939311,0.0001773747],"domain_scores_gemma":[0.9973446,0.001587512,0.0004972354,0.0002697619,0.0002546979,0.00004619442],"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.0009345835,0.000107865,0.00001199215,0.0000495437,0.00002138057,0.00001618982,0.0007677843,6.657239e-7,0.0001382025,0.9955276,0.0003501841,0.002074041],"study_design_scores_gemma":[0.001304585,0.0007329644,0.0002166878,0.00006792521,0.00006232403,0.0001074217,0.001006845,0.0001144153,0.0001085241,0.9942234,0.001966211,0.0000887163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4052187,0.0004603281,0.5686651,0.003388599,0.01441202,0.001268421,0.00005010917,0.00002997872,0.006506707],"genre_scores_gemma":[0.9943211,0.00001647732,0.004777282,0.00004290276,0.0007284119,0.0000123744,4.720348e-7,0.00001466422,0.00008627777],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5891024,"threshold_uncertainty_score":0.8350703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140893304","doi":"10.1016/j.jcta.2007.08.003","title":"Partially directed paths in a wedge","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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 British Columbia; York University","funders":"","keywords":"Mathematics; Combinatorics; Iterated function; Lattice (music); Wedge (geometry); Square lattice; Generating function; Enumeration; Mathematical analysis; Geometry; Statistical physics; Physics","authors":[{"name":"E J Janse van Rensburg","is_ca":true},{"name":"Thomas Prellberg","is_ca":false},{"name":"Andrew Rechnitzer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02044829590549283,"gpt":0.3019784262057577,"spread":0.2815301303002648,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005342048,0.0002961782,0.0008300592,0.0003186189,0.00008529447,0.00005112206,0.0005296092,0.0002084453,0.00009740314],"category_scores_gemma":[0.006021276,0.0002570878,0.0002291666,0.0006027302,0.0001416031,0.0005733805,0.0001112174,0.0006171394,0.000008689552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002419116,"about_ca_system_score_gemma":0.0001812836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001677624,"about_ca_topic_score_gemma":0.0000118444,"domain_scores_codex":[0.9967219,0.0003339115,0.001600087,0.0001692282,0.0006646329,0.0005102669],"domain_scores_gemma":[0.995317,0.002446109,0.001122227,0.0003873911,0.0005188906,0.0002083854],"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.002064171,0.0005888288,0.0001686377,0.00006611068,0.00006636448,0.000318688,0.001520038,0.000003749077,0.001269008,0.9925429,0.0004332545,0.0009582402],"study_design_scores_gemma":[0.003003775,0.0005789457,0.0001094262,0.0002073751,0.00005379787,0.0001664286,0.0007275689,0.000005581205,0.007816271,0.9815607,0.005509732,0.0002603841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9508675,0.00040558,0.01496372,0.0002295129,0.02109754,0.0006765407,0.000004398598,0.000217155,0.01153802],"genre_scores_gemma":[0.9853459,0.00003883128,0.01297169,0.00003272186,0.001179673,0.000005733091,5.212901e-7,0.00007280527,0.0003521045],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03447839,"threshold_uncertainty_score":0.9999881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070651047","doi":"10.1016/j.jcta.2003.09.004","title":"Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":36,"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":"Bijection; Ballot; Reflection (computer programming); Mathematics; Integer (computer science); Rotation (mathematics); Mathematical proof; Combinatorics; Boundary (topology); Geometry; Mathematical analysis; Law; Computer science; Political science","authors":[{"name":"I. P. Goulden","is_ca":true},{"name":"Luís Serrano","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03903225595970209,"gpt":0.3060320941221698,"spread":0.2669998381624677,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005705232,0.0003140779,0.0006079701,0.00008006201,0.000808853,0.0001780068,0.001220623,0.0001588272,0.0001730461],"category_scores_gemma":[0.007190384,0.000151336,0.0004400368,0.0004289651,0.0008365742,0.0004973696,0.0002336284,0.001186403,0.000003191351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002049617,"about_ca_system_score_gemma":0.0005715251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002019287,"about_ca_topic_score_gemma":0.000004285582,"domain_scores_codex":[0.99582,0.001465015,0.001299013,0.0001637168,0.000891139,0.0003610593],"domain_scores_gemma":[0.9938592,0.002587154,0.001920711,0.0009503828,0.0006022599,0.0000802557],"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.0004895062,0.0001861416,0.00004856405,0.00005260053,0.0001837454,0.000007209546,0.003450915,0.00001794084,0.0004986975,0.993586,0.001321862,0.0001568033],"study_design_scores_gemma":[0.0009313656,0.0003998797,0.00001599613,0.0002031425,0.000151909,0.0002980051,0.002526762,0.00000613111,0.008357116,0.8670737,0.119885,0.0001509251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8143707,0.00241192,0.02665753,0.01606734,0.07270226,0.00352371,0.00001718941,0.0002014036,0.06404795],"genre_scores_gemma":[0.9937751,0.0000361978,0.004098414,0.000198474,0.0009683913,0.00001869857,2.467358e-7,0.00007917805,0.00082532],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1794044,"threshold_uncertainty_score":0.8608081,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060399644","doi":"10.1016/j.jcta.2004.03.004","title":"The peak algebra and the Hecke–Clifford algebras at q=0","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":34,"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":"Clifford algebra; Mathematics; Noncommutative geometry; Algebra over a field; Formalism (music); Pure mathematics; Classification of Clifford algebras; Algebra representation; Division algebra; Hecke algebra; Hopf algebra","authors":[{"name":"Nantel Bergeron","is_ca":true},{"name":"Florent Hivert","is_ca":false},{"name":"Jean‐Yves Thibon","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01308376712112811,"gpt":0.266804676312924,"spread":0.2537209091917959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004342872,0.0003459319,0.0007416915,0.00006617069,0.00100265,0.000209718,0.0008902943,0.0001445143,0.00003199372],"category_scores_gemma":[0.005528657,0.0001770869,0.0003242787,0.0002532007,0.001160855,0.0004750261,0.000413332,0.0006166049,0.000009380812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002409683,"about_ca_system_score_gemma":0.0001647306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002316751,"about_ca_topic_score_gemma":0.000007715859,"domain_scores_codex":[0.9969053,0.0005245944,0.001156739,0.0001756865,0.00080278,0.000434865],"domain_scores_gemma":[0.9926634,0.004737882,0.001335076,0.0006576953,0.0004331647,0.0001727129],"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.002966635,0.0001072034,0.000006644109,0.00003854699,0.0001975511,0.00002580438,0.001918738,0.000005359891,0.00008762996,0.9936752,0.0006274988,0.0003432051],"study_design_scores_gemma":[0.007747306,0.0004771876,0.000009762633,0.0001040877,0.000171545,0.0006202036,0.001403366,0.000002005184,0.001806656,0.9709353,0.01651313,0.0002094575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9544025,0.003729364,0.003171799,0.009706094,0.02094661,0.001344456,0.000006610387,0.0001386189,0.006553969],"genre_scores_gemma":[0.9927463,0.0009092122,0.00309302,0.00018453,0.001738509,0.00002946617,5.115741e-7,0.0001073201,0.001191156],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03834379,"threshold_uncertainty_score":0.7711678,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164133693","doi":"10.1016/j.jcta.2016.08.003","title":"Sign variation, the Grassmannian, and total positivity","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Grassmannian; Linear subspace; Sign (mathematics); Mathematics; Combinatorics; Subspace topology; Matroid; Sequence (biology); Dimension (graph theory); Discrete mathematics; Pure mathematics; Mathematical analysis","authors":[{"name":"Steven N. Karp","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01444910264817937,"gpt":0.2663213028469291,"spread":0.2518722001987497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002520548,0.0002214564,0.0004662984,0.00007508288,0.0002199738,0.00007855923,0.0003408664,0.0001129495,0.00005365205],"category_scores_gemma":[0.004222612,0.0001146706,0.0001421483,0.0001668788,0.0002545138,0.0007229569,0.0001339935,0.000241871,0.000004175564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009565907,"about_ca_system_score_gemma":0.00009801397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.777555e-7,"about_ca_topic_score_gemma":4.152941e-7,"domain_scores_codex":[0.9979205,0.0005196736,0.0006871046,0.0001375997,0.000486695,0.0002484902],"domain_scores_gemma":[0.9942697,0.003882115,0.0008734049,0.0003610345,0.000493422,0.0001202692],"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.0004994996,0.0001316044,0.00003267733,0.00002426516,0.0001119278,0.00001688648,0.0008159736,4.809504e-7,0.003072805,0.9933974,0.0005497844,0.001346697],"study_design_scores_gemma":[0.001684895,0.0005858878,0.0002542676,0.0001205189,0.0001067254,0.0003798221,0.0002143609,0.000001552609,0.002660144,0.9922416,0.00158295,0.0001672781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8775228,0.0003581905,0.09518419,0.006223647,0.01638281,0.0007943733,0.00001765494,0.0001290131,0.003387359],"genre_scores_gemma":[0.9955516,0.00004500016,0.002784128,0.00003375835,0.0009876259,0.000006766002,9.290882e-8,0.00003787888,0.0005531425],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1180288,"threshold_uncertainty_score":0.5055166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067182672","doi":"10.1016/j.jcta.2008.01.009","title":"A bound on the size of separating hash families","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":33,"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":"Engineering and Physical Sciences Research Council","keywords":"Hash function; Upper and lower bounds; Perfect hash function; Collision resistance; Mathematics; Double hashing; Computer science; Combinatorics; Theoretical computer science; Discrete mathematics; Hash table; Computer security","authors":[{"name":"Simon R. Blackburn⋆","is_ca":false},{"name":"Tuvi Etzion","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true},{"name":"Gregory M. Zaverucha","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01494224395046279,"gpt":0.227555049188999,"spread":0.2126128052385362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001877823,0.0001421514,0.0003094018,0.0001015272,0.0003602147,0.00007850603,0.001058218,0.00005372113,0.0000381981],"category_scores_gemma":[0.0007263432,0.000091147,0.0002584741,0.0004421666,0.0003651017,0.0005030406,0.0001309023,0.0002920566,0.000002880271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001844944,"about_ca_system_score_gemma":0.0001332234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001245484,"about_ca_topic_score_gemma":2.468812e-7,"domain_scores_codex":[0.9982994,0.0004885188,0.0004771808,0.0001144471,0.0004393906,0.0001810219],"domain_scores_gemma":[0.9967788,0.001965481,0.0005484537,0.000394449,0.0002505934,0.00006215229],"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.0005068137,0.0001024589,0.0001013375,0.000006212364,0.00006511765,0.00002771623,0.002576081,0.00001940793,0.001383295,0.9939393,0.0006023612,0.0006698341],"study_design_scores_gemma":[0.0006305832,0.001412144,0.00036771,0.00007349633,0.00001367124,0.0002066726,0.0005687323,0.00001590851,0.01153825,0.9784373,0.006616938,0.0001185871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9843617,0.000194628,0.003216238,0.0006650588,0.003737237,0.00009455284,0.000001248275,0.00003011169,0.007699229],"genre_scores_gemma":[0.9985488,0.00006857831,0.0008129706,0.0001661127,0.0002907125,0.00000194296,4.611367e-8,0.000007446313,0.0001033667],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01550206,"threshold_uncertainty_score":0.3716867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037565534","doi":"10.1016/j.jcta.2012.05.003","title":"Weil sums of binomials, three-level cross-correlation, and a conjecture of Helleseth","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":32,"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; Combinatorics; Conjecture; Integer (computer science); Prime (order theory); Coprime integers; Discrete mathematics; Prime power; Sequence (biology); Character (mathematics); Binary number; Arithmetic","authors":[{"name":"Daniel J. Katz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01557876724366965,"gpt":0.2484302946345968,"spread":0.2328515273909271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002535318,0.0001527018,0.0004367862,0.0001962097,0.0001038216,0.00005890517,0.0005574602,0.0001209281,0.00003426862],"category_scores_gemma":[0.0002760637,0.0001215837,0.00018572,0.0003571805,0.0003586094,0.001084681,0.0001713349,0.0002347141,7.477718e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001493393,"about_ca_system_score_gemma":0.000106004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003495928,"about_ca_topic_score_gemma":8.4287e-7,"domain_scores_codex":[0.998475,0.0002536966,0.0006328741,0.0001081031,0.0003192624,0.000211102],"domain_scores_gemma":[0.9978396,0.0005227618,0.0008540121,0.0002952058,0.000362528,0.000125868],"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.0007243232,0.000110273,0.01156781,0.00003668543,0.00009295986,0.000002212237,0.001739837,0.00001659027,0.002039413,0.9813163,0.00007948805,0.002274113],"study_design_scores_gemma":[0.001581354,0.0008242209,0.01161949,0.0000875112,0.00004192306,0.0001261866,0.0001531064,0.00002296908,0.01654027,0.9667509,0.002097185,0.0001549517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9350047,0.001889577,0.05687139,0.0001273876,0.005440416,0.0001069885,0.000009308583,0.000016315,0.0005339013],"genre_scores_gemma":[0.9974052,0.00005730067,0.002147661,0.00002077619,0.0003295948,9.618319e-7,3.764066e-7,0.000008911074,0.00002924446],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06240046,"threshold_uncertainty_score":0.4958041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058306224","doi":"10.1016/j.jcta.2010.10.010","title":"A self paired Hopf algebra on double posets and a Littlewood–Richardson rule","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":29,"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":"Mathematics; Hopf algebra; Pure mathematics; Combinatorics; Algebra over a field","authors":[{"name":"Claudia Malvenuto","is_ca":false},{"name":"Christophe Reutenauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0366604297994211,"gpt":0.2733523688405685,"spread":0.2366919390411474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001821596,0.0004051435,0.0008826657,0.00021859,0.0001868669,0.00008249319,0.0005052956,0.0002323375,0.000121183],"category_scores_gemma":[0.001105255,0.0003336941,0.0002381982,0.0002769553,0.0001526166,0.0006655183,0.0001687773,0.0005514902,0.00001465107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001376242,"about_ca_system_score_gemma":0.0001381138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001980763,"about_ca_topic_score_gemma":4.727966e-7,"domain_scores_codex":[0.9973505,0.0003147934,0.0009970542,0.0002474912,0.0006646888,0.0004255089],"domain_scores_gemma":[0.9967341,0.0008701155,0.001114849,0.0005187463,0.0004760509,0.0002860752],"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.003500179,0.0009270555,0.00003798144,0.0001711984,0.0002415318,0.00009812634,0.005695191,1.841241e-7,0.0002108088,0.988189,0.0004726052,0.0004560952],"study_design_scores_gemma":[0.004647679,0.002183656,0.0000340159,0.0002269322,0.0001849557,0.0002831467,0.0007893883,0.000003866739,0.009946065,0.9782917,0.003067133,0.0003414215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9732336,0.0004164718,0.0008850042,0.0002190399,0.009764411,0.0007116126,0.000008996605,0.0002359724,0.01452487],"genre_scores_gemma":[0.9744492,0.000150397,0.02392129,0.0000674362,0.0009276916,0.00001910104,7.38593e-7,0.0001177074,0.0003464908],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02303629,"threshold_uncertainty_score":0.9999115,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039325744","doi":"10.1016/j.jcta.2005.09.007","title":"A combinatorial proof of the Rogers–Ramanujan and Schur identities","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorial proof; Ramanujan's sum; Mathematics; Pure mathematics; Combinatorics; Algebra over a field","authors":[{"name":"Cilanne Boulet","is_ca":false},{"name":"Igor Pak","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01583556312503055,"gpt":0.2794830966889912,"spread":0.2636475335639606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001609561,0.0002417661,0.0007084747,0.0001211494,0.0001962216,0.0001012893,0.0005628513,0.0001321098,0.0001167209],"category_scores_gemma":[0.002878092,0.0001661095,0.0002754122,0.0002012199,0.0006674083,0.001012351,0.0002646634,0.0004148269,0.000001688536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008683328,"about_ca_system_score_gemma":0.0001294777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001117061,"about_ca_topic_score_gemma":0.000002062145,"domain_scores_codex":[0.9974623,0.0003165123,0.001069653,0.0001326988,0.0007522834,0.0002665062],"domain_scores_gemma":[0.9968382,0.0009793394,0.001188823,0.0003824368,0.0005012071,0.0001100197],"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.0004348175,0.0002665841,0.00005036988,0.0002114963,0.00013978,0.000006224852,0.001487358,0.00000465219,0.0005216099,0.9958215,0.0008653799,0.0001901868],"study_design_scores_gemma":[0.001767505,0.0003557851,0.00002422405,0.0002622806,0.0001595467,0.0001757627,0.001481705,0.000004669351,0.03027365,0.9629954,0.002338037,0.0001614018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9782972,0.00097096,0.000792464,0.0008812172,0.008468147,0.0006099923,0.00001248867,0.00004567417,0.009921808],"genre_scores_gemma":[0.9951054,0.00005478399,0.001822381,0.00002236236,0.0009965412,0.000007113015,1.925259e-7,0.00004154912,0.001949685],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03282611,"threshold_uncertainty_score":0.6773748,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064723783","doi":"10.1016/j.jcta.2009.04.007","title":"Coloring axis-parallel rectangles","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"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":"Chromatic scale; Combinatorics; Point (geometry); Construct (python library); Mathematics; Plane (geometry); Computer science; Geometry","authors":[{"name":"János Pach","is_ca":false},{"name":"Gábor Tardos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00995740381703517,"gpt":0.238631023505456,"spread":0.2286736196884208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009851762,0.0001036312,0.0002030708,0.0001531185,0.0001320702,0.0001543854,0.0005109487,0.00005018532,0.00001667222],"category_scores_gemma":[0.0002153512,0.00009029229,0.000108572,0.0003732984,0.00002506374,0.001111991,0.00004675129,0.0001611168,0.000004992989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004991237,"about_ca_system_score_gemma":0.0001279556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.601573e-7,"about_ca_topic_score_gemma":1.190891e-7,"domain_scores_codex":[0.9988667,0.0001594265,0.0003727436,0.0001109733,0.0003400376,0.0001501115],"domain_scores_gemma":[0.9989658,0.0001691334,0.000301765,0.0001599041,0.0003122647,0.00009115142],"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.0002474339,0.00007535583,0.000007661634,0.000002070613,0.00001900717,0.00002758547,0.0002934763,0.0009719052,0.001494797,0.978479,0.0007019654,0.01767972],"study_design_scores_gemma":[0.0007466851,0.001201971,0.0004914741,0.00002261789,0.000008626427,0.0002121413,0.00004457011,0.0002585563,0.004192788,0.966961,0.02574052,0.0001191002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2320404,0.001601849,0.7296373,0.004889002,0.02010905,0.0002228468,0.000001164292,0.0001307854,0.01136755],"genre_scores_gemma":[0.9725551,0.00006036444,0.02577077,0.0002288817,0.001060179,9.305103e-7,5.825279e-7,0.000004274025,0.0003189089],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7405146,"threshold_uncertainty_score":0.3682013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040192988","doi":"10.1016/j.jcta.2015.01.005","title":"Simple recurrence formulas to count maps on orientable surfaces","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Agence Nationale de la Recherche","keywords":"Mathematics; Generating function; Bijection; Bipartite graph; Combinatorics; Simple (philosophy); Genus; Recurrence relation; Interpretation (philosophy); Discrete mathematics; Graph","authors":[{"name":"S. R. Carrell","is_ca":true},{"name":"Guillaume Chapuy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0453241027719853,"gpt":0.3252731553847049,"spread":0.2799490526127196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003145204,0.0003519195,0.0008264908,0.000185258,0.0001467007,0.0001228559,0.0007403415,0.000144402,0.00005920264],"category_scores_gemma":[0.00829253,0.0002876622,0.0001728497,0.000474789,0.00009432324,0.0007638286,0.000185527,0.000456683,0.00004958221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004266094,"about_ca_system_score_gemma":0.0003279329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002867831,"about_ca_topic_score_gemma":0.00000185696,"domain_scores_codex":[0.9967676,0.0003015411,0.001058451,0.0002215443,0.001180211,0.0004706199],"domain_scores_gemma":[0.9952409,0.001546481,0.0009415598,0.0005688765,0.001196318,0.0005058686],"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.002287871,0.0004132431,0.00003878208,0.00005340706,0.00006853669,0.00003678343,0.001642038,0.0001827325,0.0001241957,0.9740832,0.02086912,0.0002001348],"study_design_scores_gemma":[0.002017085,0.002952123,0.000002681356,0.000193397,0.00005483953,0.00006927909,0.001540873,0.000009544697,0.005234444,0.9020432,0.08559285,0.0002897137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9295831,0.0002633084,0.008360662,0.0006528751,0.04423751,0.001221116,0.00005254648,0.0001877221,0.01544113],"genre_scores_gemma":[0.9846623,0.00002740436,0.01278979,0.0001247785,0.001411865,0.00001857133,0.00000267117,0.0001005762,0.0008620342],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07203998,"threshold_uncertainty_score":0.9999576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}