{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002368761,0.0007013849,0.001561899,0.004023594,0.002903282,0.005714124,0.004194154,0.002414802,0.01261432],"category_scores_gemma":[0.01732864,0.001147418,0.0008980985,0.002825791,0.005938004,0.009762311,0.00291538,0.003138651,0.0008151376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001797423,"about_ca_system_score_gemma":0.0007655643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001289447,"about_ca_topic_score_gemma":0.001697016,"domain_scores_codex":[0.9982665,0.0004997781,0.000112605,0.0003381594,0.000505409,0.0002776447],"domain_scores_gemma":[0.976942,0.01604624,0.002218667,0.001063894,0.001111611,0.002617592],"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.000381979,0.00009935806,0.002738505,0.0001869207,0.00003353036,0.0001808328,0.0005772258,0.008688902,0.002141389,0.9689646,0.00334809,0.01265867],"study_design_scores_gemma":[0.00003472792,0.00003256552,0.000795874,0.00005959414,0.00002170494,0.0002765617,0.0002946335,0.01860777,0.0007467495,0.9775039,0.001600872,0.00002521369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.826439,0.002141166,0.06201335,0.004693399,0.0006334684,0.00006670086,0.000649228,0.0003280937,0.1030357],"genre_scores_gemma":[0.9732522,0.0009641152,0.01375234,0.000396316,0.0003796753,0.00009929352,0.0004492791,0.0001436525,0.01056316],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01261432,"threshold_uncertainty_score":0.04219908,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224001,0.0006461866,0.0009717025,0.001454805,0.002608176,0.00248558,0.001374854,0.001255754,0.008200183],"category_scores_gemma":[0.004039988,0.0006719771,0.0009223,0.001457131,0.003205997,0.004935931,0.001876582,0.002564515,0.0006217388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001174418,"about_ca_system_score_gemma":0.0009748019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001867024,"about_ca_topic_score_gemma":0.002548976,"domain_scores_codex":[0.9991149,0.0002633863,0.00004974188,0.0002181693,0.0001850774,0.0001685904],"domain_scores_gemma":[0.9951606,0.002481132,0.000727444,0.0004532607,0.0005423565,0.0006351782],"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.00003551448,0.00002110769,0.000189415,0.00001625002,0.00000573027,0.00006050701,0.000170919,0.0005643675,0.0008130841,0.9962915,0.0004454038,0.001386294],"study_design_scores_gemma":[0.00001534821,0.000009538709,0.0002183388,0.000004411948,0.000007214803,0.00005844533,0.0000615403,0.002886125,0.0003302957,0.9954953,0.0009030462,0.00001049227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.672363,0.0005241896,0.2380943,0.001823385,0.0002362466,0.00009980404,0.0004290769,0.000386594,0.08604349],"genre_scores_gemma":[0.9565206,0.0003648351,0.02272632,0.0004901736,0.0002406247,0.0001125254,0.0004638074,0.0001007556,0.01898036],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008200183,"threshold_uncertainty_score":0.02743232,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009619595,0.003273104,0.004046259,0.01369343,0.005410263,0.009967399,0.006953601,0.00451221,0.02351089],"category_scores_gemma":[0.04068348,0.002454647,0.003919853,0.01135753,0.007494284,0.03566505,0.01078083,0.0158968,0.002621583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006625045,"about_ca_system_score_gemma":0.001145132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001836769,"about_ca_topic_score_gemma":0.002389794,"domain_scores_codex":[0.994601,0.001296164,0.0003093819,0.001032283,0.001870501,0.0008907067],"domain_scores_gemma":[0.9557791,0.03536806,0.001434091,0.002154172,0.002186036,0.003078566],"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.0001226379,0.0001316716,0.0007945025,0.0002533524,0.00005088044,0.000146319,0.0008471211,0.003363383,0.0007502225,0.9673755,0.008318814,0.0178456],"study_design_scores_gemma":[0.00001807995,0.0000286268,0.0005381005,0.0001017478,0.00007451046,0.0001532886,0.0001548078,0.0133625,0.0003911336,0.978115,0.007019133,0.00004291776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.15816,0.02144791,0.4793305,0.0196805,0.002225186,0.0002735014,0.00223124,0.00150154,0.3151497],"genre_scores_gemma":[0.7699705,0.01791639,0.1358184,0.005734641,0.008688059,0.001246057,0.002677523,0.001718477,0.05622983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02351089,"threshold_uncertainty_score":0.07865179,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001266866,0.0006810166,0.001103512,0.002236592,0.002070104,0.00437149,0.0009077473,0.001609192,0.00716133],"category_scores_gemma":[0.004121486,0.0005636767,0.0007989659,0.002200048,0.005255343,0.007533314,0.001589488,0.00331664,0.000837767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001874281,"about_ca_system_score_gemma":0.000772335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008596232,"about_ca_topic_score_gemma":0.0006796035,"domain_scores_codex":[0.9993882,0.000236298,0.00003671918,0.0001024986,0.0001425933,0.00009369141],"domain_scores_gemma":[0.9976484,0.001614738,0.0001648946,0.0001992299,0.0002287663,0.0001439156],"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.00000626812,0.000004741552,0.00003202726,0.000008105556,0.000001490949,0.00001141289,0.0001130948,0.000147846,0.00008568072,0.9976518,0.0003840599,0.001553511],"study_design_scores_gemma":[0.000004322232,0.000003075028,0.00003062828,0.00000397161,0.000001871206,0.00002284759,0.00002718009,0.0006113013,0.00005207781,0.9977152,0.001523557,0.000003961019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3294743,0.02238379,0.3431525,0.02430198,0.002699758,0.0000622599,0.0004776497,0.0005924454,0.2768553],"genre_scores_gemma":[0.9425566,0.003425003,0.0168632,0.0008202863,0.001795436,0.00008821458,0.0001794268,0.00009344725,0.03417841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00716133,"threshold_uncertainty_score":0.02395701,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008147625,0.000914202,0.0007894205,0.002715284,0.002185631,0.003256118,0.0008190188,0.0009405965,0.01857393],"category_scores_gemma":[0.001914407,0.0004965561,0.0006825036,0.001472575,0.002729384,0.003930558,0.001700217,0.002573987,0.002454915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001340631,"about_ca_system_score_gemma":0.0006849034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006396049,"about_ca_topic_score_gemma":0.0008403322,"domain_scores_codex":[0.9993882,0.000129362,0.0000293317,0.00008938726,0.0002410445,0.0001226919],"domain_scores_gemma":[0.9989429,0.0002862896,0.0001204316,0.0001469428,0.0002606615,0.0002427469],"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.00001565182,0.000009253499,0.0000494312,0.000007989775,0.000001944363,0.00002955139,0.00004796202,0.00008706892,0.0004424019,0.9960707,0.00088749,0.002350529],"study_design_scores_gemma":[0.00001374602,0.00001524482,0.0002523617,0.000008604024,0.000007660317,0.0002514388,0.00006449395,0.001909923,0.0008296748,0.9910887,0.005541892,0.00001626306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4308173,0.00132011,0.09091924,0.003476167,0.00180396,0.0001046525,0.0005329772,0.0004565204,0.4705691],"genre_scores_gemma":[0.899812,0.0007830235,0.01001289,0.0006606349,0.001162764,0.0000624836,0.0003058626,0.0002072987,0.08699302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01857393,"threshold_uncertainty_score":0.06213599,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002961802,0.001196728,0.001712221,0.002649663,0.001768817,0.003497493,0.003604519,0.002767288,0.009374524],"category_scores_gemma":[0.02458485,0.00165148,0.001055755,0.00231667,0.003487666,0.01024763,0.002878957,0.002774013,0.0006754501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001596889,"about_ca_system_score_gemma":0.0006127715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008997297,"about_ca_topic_score_gemma":0.001759095,"domain_scores_codex":[0.9985878,0.0005880651,0.00008624289,0.0002794554,0.0002400438,0.0002184309],"domain_scores_gemma":[0.9625803,0.03137622,0.001949672,0.00156144,0.001025089,0.00150731],"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.001431124,0.0002556778,0.005881459,0.001206149,0.000155267,0.0003659037,0.0008183516,0.1941504,0.01480193,0.6875861,0.01256378,0.08078387],"study_design_scores_gemma":[0.0001122187,0.0001381743,0.001893171,0.0001512961,0.00007805262,0.0002729069,0.0003678942,0.2249952,0.003044816,0.7656209,0.003280341,0.00004494778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5614416,0.003814077,0.3874651,0.006788676,0.0004289515,0.0001815442,0.001369424,0.0005881273,0.0379224],"genre_scores_gemma":[0.8480338,0.002912715,0.1361016,0.0007879668,0.000460127,0.0002210634,0.001020943,0.0005274127,0.009934493],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009374524,"threshold_uncertainty_score":0.03136092,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006788378,0.0005987832,0.0008463032,0.002408407,0.001309068,0.002633255,0.00136628,0.0008384802,0.00523669],"category_scores_gemma":[0.004253549,0.0006305006,0.0008591441,0.002396939,0.001388739,0.002057267,0.002352775,0.00212822,0.001809659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006991982,"about_ca_system_score_gemma":0.0007569232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004294467,"about_ca_topic_score_gemma":0.0008064739,"domain_scores_codex":[0.9988417,0.0004809341,0.00008195023,0.0001227177,0.000385652,0.00008703148],"domain_scores_gemma":[0.9982419,0.0008581676,0.00008461745,0.0004575262,0.0002886737,0.00006909727],"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.00004179866,0.00004192513,0.0002069043,0.00008111486,0.00001179658,0.00008955149,0.0001264626,0.01486217,0.005333536,0.8961849,0.002629856,0.08039007],"study_design_scores_gemma":[0.00001032539,0.00004023586,0.0001580488,0.00005735361,0.00001163691,0.0003016317,0.00006431034,0.1360064,0.006049392,0.8402415,0.01701876,0.000040366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01058403,0.0003967365,0.9720909,0.0002665392,0.0001226232,0.00004319488,0.0001165104,0.0001479479,0.0162316],"genre_scores_gemma":[0.1339994,0.0009211207,0.8535154,0.0002782574,0.0002167995,0.0002092979,0.000366971,0.0001553979,0.01033736],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00523669,"threshold_uncertainty_score":0.01751846,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00134774,0.0008760334,0.001103639,0.002853775,0.002239123,0.004094734,0.001889705,0.001858618,0.007749799],"category_scores_gemma":[0.005997356,0.000855279,0.001131505,0.002470588,0.004067719,0.007948561,0.003541714,0.004121331,0.0008630197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001924189,"about_ca_system_score_gemma":0.0008768075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001276079,"about_ca_topic_score_gemma":0.001799147,"domain_scores_codex":[0.9990556,0.0002112978,0.00004037357,0.0002134314,0.0002435251,0.0002358403],"domain_scores_gemma":[0.9945993,0.003474504,0.0005045544,0.0004763784,0.0003312404,0.0006140268],"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.00005977829,0.0000232831,0.0004226536,0.00001719115,0.000005277788,0.00003587674,0.0002378534,0.0009508182,0.0008195178,0.9908081,0.0009371092,0.005682573],"study_design_scores_gemma":[0.00001848618,0.00002114378,0.0003796039,0.00001258177,0.00001377212,0.0001224313,0.0001038203,0.007173999,0.0005854253,0.9898071,0.001746343,0.00001533136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7283794,0.001044078,0.1863008,0.002122426,0.0004147942,0.0001134346,0.0004041904,0.0004047873,0.08081613],"genre_scores_gemma":[0.9446397,0.0008108477,0.03089753,0.0005493577,0.0003917189,0.00008484345,0.0004549831,0.0002499188,0.02192096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007749799,"threshold_uncertainty_score":0.02592564,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002191725,0.0005133384,0.001190519,0.002185499,0.002686518,0.00358381,0.000907346,0.0006235496,0.006936923],"category_scores_gemma":[0.004328656,0.0007292958,0.0008613351,0.001951118,0.005665614,0.00615082,0.001891815,0.002602814,0.0006127438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001947418,"about_ca_system_score_gemma":0.001024714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001237044,"about_ca_topic_score_gemma":0.001355661,"domain_scores_codex":[0.9989483,0.0001968322,0.00007443941,0.0002227324,0.0003339001,0.0002237987],"domain_scores_gemma":[0.9952216,0.002481866,0.0006209089,0.00031193,0.0007198845,0.0006438059],"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.00009443201,0.00003732144,0.0007761853,0.00003607654,0.00001444942,0.0001134293,0.0006136496,0.0003839906,0.002062263,0.9926668,0.0005224096,0.002679039],"study_design_scores_gemma":[0.0000475115,0.00003845325,0.00137487,0.0000118425,0.00002738073,0.0002685523,0.0002410492,0.00157526,0.002634825,0.9907879,0.00296345,0.00002872913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8416343,0.001882927,0.04463906,0.00281328,0.0002086178,0.00005107116,0.0003593009,0.0001648701,0.1082465],"genre_scores_gemma":[0.9872197,0.0004585648,0.004308483,0.0001492647,0.0003641695,0.00002563691,0.0001664879,0.00003700287,0.007270749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006936923,"threshold_uncertainty_score":0.02320635,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003734471,0.000383877,0.0006690106,0.002071189,0.001702602,0.003995789,0.0006943293,0.001438048,0.008497544],"category_scores_gemma":[0.00175801,0.0003950124,0.0004142847,0.001329875,0.001571384,0.002985397,0.001330783,0.001736599,0.001101633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007053965,"about_ca_system_score_gemma":0.0004965983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001225712,"about_ca_topic_score_gemma":0.001333752,"domain_scores_codex":[0.9995376,0.00008809243,0.00002373763,0.00006453812,0.0001508656,0.000135296],"domain_scores_gemma":[0.9986672,0.0004074765,0.0002970744,0.0001840287,0.0001502678,0.0002940202],"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.0001281008,0.00008982991,0.001357196,0.00003005418,0.000008456104,0.0001678325,0.0002129877,0.001297076,0.003633296,0.9839494,0.002334155,0.006791571],"study_design_scores_gemma":[0.00008079722,0.00003863406,0.001915955,0.00002625364,0.00001127383,0.0004374714,0.0003831073,0.0190709,0.001522712,0.9721686,0.004322226,0.00002203676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9197612,0.0002112808,0.01550261,0.0008710561,0.0001750312,0.00004193732,0.0002666505,0.0002502049,0.06291999],"genre_scores_gemma":[0.9793195,0.0002682098,0.004827468,0.0003196161,0.0002463107,0.00004176592,0.0005101163,0.0001648695,0.01430222],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008497544,"threshold_uncertainty_score":0.02842706,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00234335,0.0005858171,0.0009318871,0.001555543,0.001419797,0.004008056,0.001619696,0.001329565,0.009559363],"category_scores_gemma":[0.02991718,0.0007396667,0.0007625329,0.001549021,0.003611556,0.009077644,0.002267141,0.002463706,0.001407102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001639961,"about_ca_system_score_gemma":0.001330743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001521123,"about_ca_topic_score_gemma":0.001538665,"domain_scores_codex":[0.9980094,0.0005084398,0.0001114771,0.0003329636,0.0005388517,0.0004989889],"domain_scores_gemma":[0.9518539,0.03934684,0.002132128,0.00283785,0.002205938,0.001623409],"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.0007214127,0.00009463417,0.002551179,0.0001580408,0.0000143662,0.0003587131,0.001200227,0.01474925,0.005429684,0.9520447,0.002804898,0.01987289],"study_design_scores_gemma":[0.00005543729,0.00005962398,0.0007939847,0.00003339662,0.00002622051,0.0003381893,0.0001928121,0.05128794,0.003316225,0.9419506,0.001908406,0.00003705705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.834541,0.00150539,0.1137201,0.004347743,0.000226736,0.00007046659,0.0005966977,0.0008268174,0.04416498],"genre_scores_gemma":[0.9761676,0.0005575229,0.01011589,0.0002420352,0.000344716,0.00006228851,0.000230792,0.0002127888,0.01206647],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009559363,"threshold_uncertainty_score":0.03197926,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009372025,0.0007852838,0.001159492,0.002904392,0.003941575,0.005144187,0.001396987,0.002458956,0.01634664],"category_scores_gemma":[0.002203298,0.0006446774,0.001018738,0.002233286,0.002762966,0.008544913,0.003552619,0.005783487,0.003065287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001352341,"about_ca_system_score_gemma":0.0006264479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008960364,"about_ca_topic_score_gemma":0.0008200813,"domain_scores_codex":[0.9993085,0.0001434542,0.0000454307,0.0001822049,0.0001928669,0.0001276199],"domain_scores_gemma":[0.9993766,0.0002400802,0.00005645243,0.0000874933,0.0001315387,0.0001078156],"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.00001567791,0.000022585,0.00006163467,0.00002342865,0.000004267858,0.00005429632,0.0001471625,0.00006373239,0.0004359646,0.9893762,0.001582131,0.008213056],"study_design_scores_gemma":[0.00001924005,0.00001318002,0.0001074199,0.00001067045,0.000006904444,0.0001619646,0.00005880985,0.0004102981,0.0002824001,0.9908188,0.00809668,0.00001359195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2581511,0.004454564,0.1837913,0.008235923,0.003882195,0.0001624263,0.0006414089,0.000676188,0.5400048],"genre_scores_gemma":[0.8204325,0.003135967,0.06064017,0.003581014,0.002203803,0.0002354591,0.0006695487,0.0006119827,0.1084897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01634664,"threshold_uncertainty_score":0.05468494,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003087352,0.0007305107,0.0006865348,0.002014553,0.001209141,0.002100248,0.001014524,0.00106832,0.008949907],"category_scores_gemma":[0.00205639,0.0003086466,0.0005812955,0.0007108675,0.002054875,0.00211668,0.001497489,0.001741731,0.001156226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007935101,"about_ca_system_score_gemma":0.0002792549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008926475,"about_ca_topic_score_gemma":0.0005752718,"domain_scores_codex":[0.9996897,0.00005729172,0.00002212216,0.00005638208,0.00009092932,0.00008350186],"domain_scores_gemma":[0.9990927,0.000269894,0.0001918659,0.0001019752,0.000116282,0.000227288],"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.0001478521,0.00004518267,0.0006517893,0.00003399532,0.00001257358,0.0004797711,0.0001533928,0.002487467,0.002708699,0.984106,0.001295616,0.007877688],"study_design_scores_gemma":[0.00005348601,0.00006669386,0.001079936,0.0000322791,0.00001244352,0.0008964382,0.0003163224,0.02399196,0.001790566,0.9670752,0.004656869,0.00002770204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8312221,0.0006109383,0.04838664,0.001074134,0.0002966229,0.00004147697,0.0002205728,0.000289589,0.1178579],"genre_scores_gemma":[0.9656519,0.0003226021,0.007019208,0.000223747,0.0001747254,0.00002844222,0.0002258565,0.0001140342,0.02623944],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008949907,"threshold_uncertainty_score":0.02994043,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001376566,0.001085628,0.001642748,0.00203396,0.003660424,0.00353064,0.001686292,0.002049747,0.01622376],"category_scores_gemma":[0.008273549,0.001138367,0.001183102,0.002811829,0.004113085,0.009660034,0.006087188,0.004309326,0.001536011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002147168,"about_ca_system_score_gemma":0.0008077741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001259622,"about_ca_topic_score_gemma":0.00115221,"domain_scores_codex":[0.9986113,0.00041852,0.00005681402,0.0002761427,0.0003296088,0.0003076185],"domain_scores_gemma":[0.9939464,0.00333662,0.0004873761,0.001036652,0.0005023031,0.0006907214],"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.00008235095,0.00002170415,0.0002169777,0.00002555606,0.000007480901,0.00005638408,0.0002726479,0.001892547,0.0004403368,0.9899727,0.001590143,0.005421189],"study_design_scores_gemma":[0.0000169806,0.00001208566,0.0001197536,0.00001573669,0.000009998841,0.00007733173,0.0001061207,0.009783623,0.000317666,0.9874878,0.002039188,0.0000137251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5775653,0.001287207,0.2754969,0.00399569,0.0004826711,0.0001598898,0.0006472283,0.0005989652,0.1397662],"genre_scores_gemma":[0.9314954,0.0009631441,0.0247975,0.0007747939,0.0004475445,0.0001179546,0.000514889,0.0002960184,0.04059287],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01622376,"threshold_uncertainty_score":0.0542739,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001945779,0.000704269,0.001374768,0.004551953,0.002639571,0.005297441,0.001979156,0.001892508,0.00927216],"category_scores_gemma":[0.01113146,0.0008667483,0.0007941524,0.002944093,0.004395257,0.01218902,0.002397598,0.003166117,0.000776758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002567945,"about_ca_system_score_gemma":0.0010643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001060829,"about_ca_topic_score_gemma":0.0008036611,"domain_scores_codex":[0.999123,0.0002620461,0.00005599272,0.0002307195,0.0001923105,0.0001358817],"domain_scores_gemma":[0.9940892,0.003478858,0.0006815238,0.0004639778,0.000442089,0.0008442773],"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.00004956363,0.00001801383,0.0003744138,0.00005814926,0.000008990402,0.00002747148,0.0002176267,0.0008888568,0.0004192664,0.9914303,0.002538985,0.003968479],"study_design_scores_gemma":[0.000009608918,0.0000100662,0.00023956,0.00002816466,0.00001181437,0.00007900844,0.00008909815,0.004598029,0.0002768952,0.9925638,0.002079596,0.00001437072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6473043,0.00757454,0.1010221,0.010191,0.0009631848,0.0001291728,0.001038528,0.0006770337,0.2311001],"genre_scores_gemma":[0.9713265,0.002189501,0.01153359,0.0005931526,0.0007694398,0.0001965482,0.0002635166,0.0001253138,0.01300236],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00927216,"threshold_uncertainty_score":0.03101844,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00138046,0.0008122308,0.001279503,0.006452961,0.002380007,0.006028149,0.001138008,0.0008773266,0.01971597],"category_scores_gemma":[0.005035779,0.0006823989,0.0005958414,0.002738863,0.003823712,0.007016528,0.003300739,0.001748019,0.001571542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001482156,"about_ca_system_score_gemma":0.0007978023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009880089,"about_ca_topic_score_gemma":0.001549405,"domain_scores_codex":[0.9988808,0.0001633117,0.00006378615,0.0001625165,0.0003648349,0.0003646341],"domain_scores_gemma":[0.9959121,0.001427147,0.0006268048,0.000340914,0.0003995465,0.00129351],"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.0002329106,0.00006145969,0.00347209,0.00007244822,0.00001664846,0.0002091301,0.0008447898,0.001652193,0.00204419,0.9793808,0.001758721,0.01025475],"study_design_scores_gemma":[0.00005785233,0.00008487311,0.002968766,0.00005542976,0.00003154993,0.0003665279,0.0005421428,0.006134867,0.00166573,0.9842423,0.003793282,0.00005679313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.9312672,0.0004220057,0.01296473,0.0009490122,0.0001306858,0.00003727856,0.0005885112,0.00022652,0.05341405],"genre_scores_gemma":[0.9897652,0.0002210014,0.001563074,0.00004815685,0.0001958365,0.00001563961,0.00029799,0.00006643719,0.007826729],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01971597,"threshold_uncertainty_score":0.06595647,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002153048,0.0008810578,0.001577163,0.002434985,0.001626849,0.004122729,0.002179971,0.002649866,0.005732796],"category_scores_gemma":[0.004619577,0.0006093854,0.0009543265,0.001313975,0.003784968,0.003951975,0.001478078,0.00164315,0.0006228212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001618439,"about_ca_system_score_gemma":0.001335543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00112674,"about_ca_topic_score_gemma":0.0006985921,"domain_scores_codex":[0.9990458,0.0002636209,0.00005318739,0.0001668464,0.0002298152,0.0002405943],"domain_scores_gemma":[0.9960436,0.001666346,0.0007043576,0.0002455842,0.0004534016,0.00088669],"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.0001094608,0.00005337948,0.0005071614,0.00003230758,0.000019663,0.0002430513,0.0001243518,0.006925414,0.003374815,0.9862586,0.0007720761,0.001579706],"study_design_scores_gemma":[0.00007177328,0.00006615873,0.0009240556,0.0000183363,0.00001716514,0.0003928609,0.00009487716,0.1727588,0.001063548,0.8235521,0.0009708114,0.00006949515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7975141,0.0005272113,0.169705,0.001620954,0.0003423548,0.0000931114,0.000398354,0.0002762346,0.02952268],"genre_scores_gemma":[0.9815462,0.0002619194,0.007166739,0.0002023941,0.0003280859,0.00007605428,0.0002180764,0.00007093631,0.0101296],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005732796,"threshold_uncertainty_score":0.01917815,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004281021,0.0003370818,0.0005799226,0.001653771,0.001455929,0.002783493,0.0005155909,0.0008160835,0.009673486],"category_scores_gemma":[0.00463641,0.000503714,0.0005093215,0.001654285,0.00121668,0.003288327,0.000715214,0.001173329,0.0008048798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000659515,"about_ca_system_score_gemma":0.0004549562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001177873,"about_ca_topic_score_gemma":0.00181064,"domain_scores_codex":[0.9996525,0.00006023994,0.00002102752,0.00009195213,0.00009234099,0.00008191467],"domain_scores_gemma":[0.9967731,0.001701549,0.0004975504,0.00031278,0.0003847227,0.0003302916],"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.0001089904,0.00005176606,0.001118475,0.00008101919,0.00001266328,0.0002006878,0.0005455947,0.002875964,0.004736212,0.9737523,0.003237501,0.01327885],"study_design_scores_gemma":[0.00002236237,0.00002489928,0.0005968918,0.00002296894,0.00001336149,0.0002590055,0.0001727148,0.01186604,0.0009437001,0.9821708,0.003890711,0.00001651476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7173922,0.0009069123,0.1920814,0.001197691,0.0001648089,0.0001416498,0.001253229,0.0005558253,0.08630625],"genre_scores_gemma":[0.9634714,0.0005963068,0.0258499,0.0002208221,0.0001623674,0.0000790687,0.0008788088,0.0001565886,0.008584868],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009673486,"threshold_uncertainty_score":0.03236103,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004965248,0.0008941998,0.002184912,0.004930627,0.001267875,0.004341869,0.003635976,0.002847928,0.005229794],"category_scores_gemma":[0.05492614,0.001821156,0.00101735,0.00309929,0.005876262,0.006243247,0.002488136,0.002553837,0.0007045396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002417853,"about_ca_system_score_gemma":0.0008229656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002570291,"about_ca_topic_score_gemma":0.001930815,"domain_scores_codex":[0.998024,0.0008299145,0.00005967537,0.0004175749,0.000301524,0.000367381],"domain_scores_gemma":[0.9344511,0.05251523,0.004967988,0.003467608,0.00206582,0.002532213],"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.001585603,0.0002349732,0.02581957,0.0005210612,0.0002599146,0.0009285042,0.001202102,0.3602591,0.009453899,0.5716159,0.008705799,0.01941363],"study_design_scores_gemma":[0.0002417335,0.0001532616,0.01412394,0.0001170489,0.0001321723,0.0008670797,0.0005540288,0.6259894,0.003830039,0.3520354,0.001786599,0.000169199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9231532,0.001127628,0.06426205,0.002659961,0.00006621631,0.0001031328,0.001466624,0.0005162057,0.006645],"genre_scores_gemma":[0.9935254,0.000666866,0.002656008,0.0001058627,0.0001292553,0.00008060158,0.0005960173,0.0001031992,0.002136812],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005229794,"threshold_uncertainty_score":0.02625906,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001646239,0.001283491,0.0007974678,0.0007116178,0.002453503,0.002061903,0.001321046,0.001354873,0.04713961],"category_scores_gemma":[0.006122123,0.0008209007,0.002700454,0.0007416133,0.002835738,0.006208493,0.004886511,0.003278025,0.0145945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00099844,"about_ca_system_score_gemma":0.001951743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001493605,"about_ca_topic_score_gemma":0.003245684,"domain_scores_codex":[0.9983991,0.0002484345,0.0001568591,0.0005393938,0.0004700461,0.0001862283],"domain_scores_gemma":[0.9949552,0.002151518,0.0003417972,0.0008536972,0.001356051,0.0003416476],"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.0005666144,0.0003766718,0.001699476,0.001475648,0.0001986085,0.001785485,0.002551634,0.001389036,0.05913178,0.6622698,0.1519082,0.1166469],"study_design_scores_gemma":[0.0001769597,0.000278991,0.002156111,0.0002492419,0.0001616904,0.002475864,0.000649762,0.004255858,0.02847569,0.7575288,0.2034468,0.000144224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03068328,0.0008606575,0.7210879,0.01238762,0.004600397,0.000904555,0.003352564,0.003687001,0.2224359],"genre_scores_gemma":[0.4544552,0.001040955,0.3638878,0.00836513,0.002069672,0.00104051,0.003583799,0.001360967,0.1641959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04713961,"threshold_uncertainty_score":0.1576977,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002056399,0.001860306,0.001503963,0.005200507,0.004981901,0.00849164,0.001620726,0.00196138,0.01385063],"category_scores_gemma":[0.003187384,0.001735202,0.001719619,0.004730463,0.006824769,0.0165001,0.006639386,0.00580245,0.001656033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001913171,"about_ca_system_score_gemma":0.0008713751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004029198,"about_ca_topic_score_gemma":0.0006422807,"domain_scores_codex":[0.9978915,0.0004230101,0.0001383276,0.0003754937,0.0006795977,0.0004920842],"domain_scores_gemma":[0.9975369,0.0008935651,0.0003848104,0.0002734824,0.0002422063,0.0006690164],"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.00001483683,0.00001971746,0.00007141323,0.00001026001,0.000003413842,0.000114765,0.0003110011,0.0001214297,0.0004225336,0.9976531,0.0003106202,0.0009468311],"study_design_scores_gemma":[0.00001241071,0.0000182442,0.0001620962,0.000006948951,0.000006894025,0.0002583815,0.0002339817,0.0007560758,0.0004853031,0.9958211,0.002221489,0.00001694022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6017916,0.001485936,0.1413435,0.003992519,0.001673825,0.0001313388,0.000443745,0.0004707688,0.2486668],"genre_scores_gemma":[0.9173585,0.0009634462,0.01594259,0.000688889,0.00123038,0.0001342897,0.0003003814,0.000243907,0.06313751],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01385063,"threshold_uncertainty_score":0.04633498,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009208487,0.001033166,0.001246668,0.004449871,0.003711337,0.005478857,0.00223441,0.002884085,0.01776696],"category_scores_gemma":[0.002249491,0.0007126405,0.001022526,0.004296962,0.009753511,0.01612479,0.003928516,0.007303397,0.002508216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002493502,"about_ca_system_score_gemma":0.0005967191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001926398,"about_ca_topic_score_gemma":0.002471884,"domain_scores_codex":[0.9991535,0.0003101611,0.00005192311,0.0001763411,0.0001863541,0.0001216396],"domain_scores_gemma":[0.9986339,0.00059231,0.0001109944,0.0002104653,0.0002508792,0.0002015415],"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.000001960884,0.000001325044,0.00001039997,0.00001251828,6.411508e-7,0.00001178102,0.00006910262,0.0000834282,0.00003426205,0.997732,0.001037571,0.001004967],"study_design_scores_gemma":[0.000002888828,0.000003942652,0.00002543215,0.00001671285,0.000001883071,0.00007796135,0.000154476,0.0004744375,0.00003446033,0.9776216,0.02158173,0.000004554274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03817849,0.01725865,0.2644332,0.03226204,0.006561717,0.00005683406,0.0007935389,0.0002495688,0.6402061],"genre_scores_gemma":[0.6713147,0.02663228,0.1437211,0.00790713,0.01175964,0.0001937459,0.0008144513,0.0006540126,0.137003],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01776696,"threshold_uncertainty_score":0.05943638,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003292331,0.001931752,0.005084807,0.003075338,0.004352944,0.006388215,0.007046655,0.003965118,0.01371567],"category_scores_gemma":[0.01856753,0.002463494,0.002422311,0.001906783,0.006602398,0.01834079,0.005735103,0.008263993,0.001725173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002210844,"about_ca_system_score_gemma":0.0008077641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007707917,"about_ca_topic_score_gemma":0.00118187,"domain_scores_codex":[0.9962021,0.0006581579,0.0001976517,0.001611987,0.0005754705,0.0007546959],"domain_scores_gemma":[0.9336399,0.05056036,0.002006928,0.005710171,0.00134684,0.006735833],"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.001495859,0.0002581086,0.006476849,0.001061077,0.0002918576,0.0005801161,0.001885155,0.01087627,0.02156355,0.9158092,0.0189568,0.02074523],"study_design_scores_gemma":[0.0001398897,0.0002804347,0.003887776,0.0001794536,0.0003337714,0.0009578724,0.0005097265,0.03788089,0.007795164,0.9299141,0.01797578,0.0001450359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5771437,0.01092863,0.2331027,0.02188911,0.001655214,0.0001223032,0.002493736,0.002834625,0.1498299],"genre_scores_gemma":[0.9378843,0.003150054,0.03973372,0.002587435,0.002298738,0.0002887218,0.001581686,0.001051795,0.01142353],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01371567,"threshold_uncertainty_score":0.04588342,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009043916,0.0007832656,0.0008456555,0.002309461,0.002502374,0.003164768,0.001124949,0.001076868,0.0172132],"category_scores_gemma":[0.002984107,0.000514237,0.0008403455,0.00166572,0.003321244,0.005163384,0.002155406,0.002789218,0.003729948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001403153,"about_ca_system_score_gemma":0.0006583228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001323816,"about_ca_topic_score_gemma":0.001088165,"domain_scores_codex":[0.999241,0.0001588223,0.0000413763,0.0002539207,0.0001730356,0.000131889],"domain_scores_gemma":[0.9977086,0.001004235,0.0003880992,0.0002965962,0.0003333531,0.0002691068],"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.00002654884,0.00001004163,0.0002062469,0.00003558894,0.000009073781,0.0000392136,0.0001136296,0.0005809396,0.0004167929,0.9891788,0.003700987,0.005682152],"study_design_scores_gemma":[0.0000290085,0.00002172893,0.0005460135,0.00002302421,0.00002206503,0.0001415274,0.0001123687,0.003386962,0.0006626754,0.9783064,0.01673071,0.00001759052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2617804,0.00258606,0.3114328,0.009223275,0.0007680304,0.0001498569,0.00222943,0.0008352731,0.4109948],"genre_scores_gemma":[0.8794378,0.002853529,0.03676262,0.001639129,0.0007861985,0.0002669984,0.001942871,0.0002923315,0.07601855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0172132,"threshold_uncertainty_score":0.05758387,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007067167,0.0003273289,0.0007383603,0.001147639,0.002017431,0.00383035,0.0006996305,0.0009580079,0.01434001],"category_scores_gemma":[0.004223987,0.0006274129,0.0005880105,0.001091419,0.002952689,0.008068656,0.002287139,0.00259097,0.001452217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001217634,"about_ca_system_score_gemma":0.0008894429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00175704,"about_ca_topic_score_gemma":0.00217385,"domain_scores_codex":[0.9994276,0.0001369504,0.00004226147,0.0001098996,0.0001296273,0.0001535244],"domain_scores_gemma":[0.9964982,0.002058069,0.0002411867,0.0004240025,0.0004159399,0.0003626016],"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.00004296441,0.00001098261,0.0001758818,0.00001874407,0.000002081621,0.00003568777,0.0003427168,0.0002793827,0.0005572475,0.9949633,0.0009161311,0.002654887],"study_design_scores_gemma":[0.00001344018,0.000009766562,0.0001395859,0.000008873436,0.000004939164,0.00005985153,0.0001854686,0.001804882,0.0005846357,0.9935254,0.003651206,0.0000120754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4776945,0.001564364,0.3514828,0.005280449,0.0004789997,0.0001208994,0.001464362,0.001773041,0.1601406],"genre_scores_gemma":[0.9339766,0.0003409057,0.02361017,0.0005333175,0.0001947437,0.0001038178,0.0006340515,0.0004525217,0.04015384],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01434001,"threshold_uncertainty_score":0.04797214,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002099513,0.0005647821,0.0006606386,0.001208789,0.002017306,0.003632232,0.001324486,0.0008977725,0.008649418],"category_scores_gemma":[0.005249531,0.0004719945,0.001373413,0.0008983133,0.002587284,0.007428299,0.003295262,0.002803927,0.001378513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001290736,"about_ca_system_score_gemma":0.001468981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003116636,"about_ca_topic_score_gemma":0.002772632,"domain_scores_codex":[0.9980589,0.0004646867,0.0001704522,0.0003868394,0.0004118626,0.000507224],"domain_scores_gemma":[0.9965369,0.001298656,0.0002215711,0.0006280845,0.0005097783,0.0008050955],"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.00009067875,0.00004983949,0.0001892086,0.0000155343,0.00000708003,0.0001355022,0.0003554287,0.001118938,0.0008553151,0.9919891,0.0008551923,0.004338264],"study_design_scores_gemma":[0.0000369306,0.00004979984,0.0002599323,0.00001928069,0.00001503047,0.0002105588,0.0002496369,0.01100066,0.00132474,0.9774488,0.009360706,0.00002399401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4034362,0.0004143046,0.2703176,0.00146181,0.000301551,0.0002647134,0.0007597399,0.0004687262,0.3225753],"genre_scores_gemma":[0.9051988,0.0003188287,0.03177995,0.0002826771,0.0001172824,0.0002404349,0.0006540138,0.0001972999,0.06121066],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008649418,"threshold_uncertainty_score":0.02893513,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006441038,0.0009526024,0.0008362827,0.002467937,0.001334418,0.003527471,0.001176109,0.001293618,0.007347037],"category_scores_gemma":[0.003621773,0.000844296,0.001080164,0.002780183,0.001677219,0.00376167,0.001333674,0.002437232,0.0007746299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001404265,"about_ca_system_score_gemma":0.0009152366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00214236,"about_ca_topic_score_gemma":0.002162181,"domain_scores_codex":[0.999395,0.0001291394,0.00003390148,0.0001895344,0.0001329037,0.0001193949],"domain_scores_gemma":[0.9978651,0.0009297018,0.0003388634,0.000246694,0.0003345447,0.0002850281],"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.00006957311,0.00003519995,0.0003661841,0.0001065144,0.00002390607,0.0001053968,0.0002828653,0.005527225,0.001553818,0.9706423,0.004555373,0.01673164],"study_design_scores_gemma":[0.00002122704,0.000009983397,0.0002013409,0.00003410477,0.00001762283,0.0001088889,0.0001175725,0.01351463,0.0004667804,0.9802378,0.005259303,0.00001074043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.270788,0.004660422,0.5782939,0.002253173,0.0004813408,0.0005236294,0.002203923,0.0004411231,0.1403545],"genre_scores_gemma":[0.8009982,0.004236653,0.1436571,0.001025869,0.0005350745,0.0005738826,0.002726092,0.0003076463,0.04593943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007347037,"threshold_uncertainty_score":0.02457833,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005065526,0.0006472293,0.0005372823,0.001068862,0.001296085,0.001975273,0.0007371767,0.0009573801,0.01825853],"category_scores_gemma":[0.002514719,0.0005279933,0.0003885934,0.000955118,0.001061666,0.001975536,0.001357733,0.001747643,0.002270348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008918262,"about_ca_system_score_gemma":0.0004791401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003006571,"about_ca_topic_score_gemma":0.0005726271,"domain_scores_codex":[0.9991978,0.0002506428,0.00002892715,0.000244184,0.0001850959,0.00009337442],"domain_scores_gemma":[0.9976724,0.0008496526,0.0002338319,0.0006745082,0.0003506492,0.0002190535],"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.00005255284,0.00003664248,0.0002381975,0.00004059265,0.00001156974,0.00005428478,0.00007653418,0.00240028,0.002495259,0.9633554,0.003579695,0.02765898],"study_design_scores_gemma":[0.00002695654,0.00004111566,0.0002027937,0.00002904431,0.00001620886,0.000197518,0.00004416728,0.00966379,0.001869671,0.9597744,0.02812202,0.00001236551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1979418,0.0007988627,0.5575082,0.002113912,0.0005240494,0.0002270624,0.0005978243,0.0006688311,0.2396194],"genre_scores_gemma":[0.7718272,0.0007443617,0.1254693,0.001138711,0.0003247626,0.0002302681,0.0005690235,0.0002030941,0.0994933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01825853,"threshold_uncertainty_score":0.06108081,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004660973,0.0006391908,0.0006561086,0.001678965,0.002256551,0.003472609,0.001096013,0.001221239,0.01116204],"category_scores_gemma":[0.002673621,0.0006877931,0.0006809547,0.001683668,0.002234176,0.004216213,0.001966472,0.003109767,0.001244568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001588354,"about_ca_system_score_gemma":0.0005293236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009386748,"about_ca_topic_score_gemma":0.001455222,"domain_scores_codex":[0.999567,0.00009624224,0.00003042146,0.0001031367,0.0001001104,0.0001031605],"domain_scores_gemma":[0.9988782,0.0005229555,0.0001465644,0.0001252379,0.0001104685,0.0002165606],"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.000130136,0.00002594331,0.0004097819,0.00005362102,0.000008165121,0.0001439379,0.0002771623,0.001231831,0.001249478,0.9835789,0.001926778,0.01096425],"study_design_scores_gemma":[0.00003943516,0.0000236856,0.0003902481,0.00002877642,0.00002023585,0.0002747781,0.0002763871,0.004312674,0.002420983,0.9718798,0.02031557,0.00001749527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5760765,0.001770035,0.1166616,0.002853653,0.0006319502,0.000141317,0.001066372,0.0007102318,0.3000884],"genre_scores_gemma":[0.8881231,0.001108112,0.0516452,0.0003570347,0.0003032204,0.00007726204,0.0006883349,0.0003189791,0.05737878],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01116204,"threshold_uncertainty_score":0.03734076,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107929,0.0004633295,0.0007073797,0.0008288054,0.001787973,0.002481105,0.0007204466,0.0008043591,0.02779127],"category_scores_gemma":[0.001233088,0.0004207659,0.0004522316,0.0008189654,0.001312948,0.001726505,0.001391952,0.001867286,0.004986254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003752252,"about_ca_system_score_gemma":0.0004538744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009495206,"about_ca_topic_score_gemma":0.001453252,"domain_scores_codex":[0.9997379,0.00004059913,0.0000124022,0.00008154269,0.00007355529,0.0000539932],"domain_scores_gemma":[0.9996626,0.00008986976,0.00003096331,0.00006409992,0.0000694404,0.00008297338],"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.0005233211,0.000102123,0.001254737,0.0003075026,0.00002717219,0.0004686768,0.0004118275,0.002998454,0.01259989,0.8326873,0.03678687,0.111832],"study_design_scores_gemma":[0.00008902894,0.00009836155,0.001086224,0.00008710013,0.00004308584,0.0007698389,0.0007520666,0.008683192,0.00474275,0.8617042,0.1219083,0.0000358318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3880761,0.002002366,0.1067827,0.003761704,0.001477997,0.0001846883,0.001881536,0.001101899,0.4947309],"genre_scores_gemma":[0.8486823,0.0009392228,0.0451571,0.0008118597,0.0002916145,0.0001123048,0.001685796,0.0005634606,0.1017563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02779127,"threshold_uncertainty_score":0.09297103,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002076223,0.0007695738,0.0008176386,0.001214496,0.001083043,0.001277178,0.000957139,0.001394754,0.005037648],"category_scores_gemma":[0.008491158,0.0005831982,0.0004058878,0.001091488,0.001091867,0.001647571,0.001353584,0.0009702053,0.001062813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007971654,"about_ca_system_score_gemma":0.0009440226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002423973,"about_ca_topic_score_gemma":0.0004997272,"domain_scores_codex":[0.9986156,0.0006049575,0.00007897167,0.0001678438,0.0002289859,0.0003036243],"domain_scores_gemma":[0.9940032,0.002249466,0.001124479,0.0017212,0.0004813104,0.0004202577],"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.00593674,0.0004240086,0.009371364,0.0005081729,0.0001515111,0.0009434575,0.0007551299,0.05191537,0.09610306,0.6975933,0.005509319,0.1307886],"study_design_scores_gemma":[0.001547369,0.003937341,0.003831116,0.0002301656,0.0002589298,0.002860026,0.0003802516,0.1843678,0.1234907,0.6526418,0.02628937,0.0001651509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6738259,0.000566176,0.2791271,0.001034466,0.0001256922,0.0003204678,0.0003447176,0.001037252,0.04361825],"genre_scores_gemma":[0.9070809,0.000180291,0.08649848,0.0001796604,0.00005261729,0.000232243,0.0001127604,0.00005184938,0.005611176],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005037648,"threshold_uncertainty_score":0.01685256,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000508821,0.000692987,0.001102052,0.001377928,0.0009802436,0.001484979,0.001497131,0.001155192,0.008009728],"category_scores_gemma":[0.001459975,0.0004142895,0.0007821513,0.001249074,0.0008827098,0.002589925,0.00151,0.0009476295,0.001340104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008173375,"about_ca_system_score_gemma":0.0008328957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009169172,"about_ca_topic_score_gemma":0.002073253,"domain_scores_codex":[0.9997606,0.00004213475,0.000009337486,0.00005011984,0.00007799028,0.00005996329],"domain_scores_gemma":[0.9995689,0.0001603228,0.00002697982,0.0001173795,0.00006107933,0.00006535269],"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.0007501401,0.0005023503,0.003327545,0.0002969617,0.00009961629,0.000578675,0.0002963397,0.2220245,0.02081037,0.5001968,0.02136496,0.2297518],"study_design_scores_gemma":[0.00008015384,0.00008819429,0.0004031259,0.0000107711,0.00002447283,0.00009592692,0.00008632826,0.6460697,0.007159767,0.3440456,0.00190971,0.00002625672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5607535,0.0001886425,0.397645,0.0005523928,0.0002357126,0.0001643088,0.0007167061,0.003224041,0.0365197],"genre_scores_gemma":[0.8782394,0.00007871104,0.11593,0.0001569045,0.00005203772,0.00009395195,0.0008139642,0.0003785197,0.00425658],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008009728,"threshold_uncertainty_score":0.02679521,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007014681,0.0007200523,0.0007851331,0.003062916,0.003106422,0.005261588,0.0009512432,0.001356025,0.01155129],"category_scores_gemma":[0.002427643,0.0005591537,0.0009169866,0.003128592,0.006260103,0.009529382,0.00315649,0.003299752,0.001220353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001589965,"about_ca_system_score_gemma":0.0006998989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001194493,"about_ca_topic_score_gemma":0.0009403299,"domain_scores_codex":[0.9993105,0.0001415556,0.00005292326,0.0001453455,0.0001829399,0.0001667222],"domain_scores_gemma":[0.9983309,0.0008493842,0.0002163553,0.0001768928,0.0001868267,0.0002395949],"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.00002335205,0.00001241238,0.0001239537,0.00001358634,0.000003623059,0.00005047291,0.0003762029,0.0001395546,0.0002352467,0.9957802,0.0004932212,0.0027482],"study_design_scores_gemma":[0.000007973809,0.000008329238,0.0001582748,0.000006555562,0.000006538324,0.0000900071,0.0001704835,0.0003879889,0.0001995132,0.9962338,0.002722214,0.000008356449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5857089,0.006649171,0.09475059,0.007120184,0.001755055,0.00005896296,0.0005317254,0.0004416631,0.3029838],"genre_scores_gemma":[0.9614098,0.001888276,0.006885591,0.0003141893,0.000704047,0.00004204384,0.000190823,0.0000912518,0.02847408],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01155129,"threshold_uncertainty_score":0.03864294,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002266602,0.0007032842,0.00136878,0.002774227,0.003198256,0.007813918,0.002334214,0.001527369,0.006953393],"category_scores_gemma":[0.009104142,0.001424987,0.00132357,0.003494796,0.005674792,0.01703446,0.004887583,0.004259879,0.0006203378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001892545,"about_ca_system_score_gemma":0.0007256078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009615967,"about_ca_topic_score_gemma":0.0008519434,"domain_scores_codex":[0.9983571,0.0003686079,0.0001373968,0.0004463391,0.0002956175,0.0003949553],"domain_scores_gemma":[0.9930907,0.0037453,0.0007740724,0.0008876773,0.0004352132,0.001066887],"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.0002094574,0.00003236582,0.00102532,0.00003109864,0.000009821484,0.0000444773,0.0007944005,0.0008216472,0.0009186036,0.9920353,0.0003133419,0.003764165],"study_design_scores_gemma":[0.00003432347,0.00002407117,0.0004628078,0.00001846155,0.00003642349,0.0001111579,0.0004567085,0.004166037,0.0008454322,0.9924471,0.001377531,0.00001989358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8468094,0.0005549331,0.1253951,0.001271245,0.00009061332,0.00004499532,0.0005687977,0.0002396294,0.0250252],"genre_scores_gemma":[0.9787595,0.0002581423,0.01474973,0.0001256047,0.000145638,0.00006065882,0.0003203883,0.00008774478,0.005492618],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007813918,"threshold_uncertainty_score":0.02326143,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002061374,0.0007362591,0.001698286,0.002503899,0.001740515,0.003926714,0.002289975,0.002684245,0.007635552],"category_scores_gemma":[0.0114849,0.001022338,0.001012837,0.001154948,0.003215896,0.005709845,0.002458979,0.002736713,0.0005906944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001438293,"about_ca_system_score_gemma":0.0006593029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008931886,"about_ca_topic_score_gemma":0.0009519396,"domain_scores_codex":[0.9988189,0.0003989651,0.00005090086,0.0002373666,0.0002788159,0.0002149954],"domain_scores_gemma":[0.9933897,0.00370837,0.000502658,0.0008447822,0.0004783012,0.001076153],"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.000154322,0.00007885012,0.0006001556,0.00004905618,0.00004122695,0.00009367899,0.0001481279,0.01920704,0.002727677,0.9724146,0.0007989642,0.003686348],"study_design_scores_gemma":[0.00003620316,0.00004568127,0.0005254341,0.00002070733,0.00001861863,0.00007765217,0.0000659695,0.2395096,0.0008900623,0.7582654,0.0005069109,0.00003783422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7483317,0.0007635027,0.2187194,0.001455473,0.0002423926,0.0000718116,0.0003012212,0.0005936244,0.02952079],"genre_scores_gemma":[0.9831598,0.0002078221,0.01019827,0.0001597916,0.0001604478,0.00005495091,0.0001797426,0.0001296917,0.005749445],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007635552,"threshold_uncertainty_score":0.02554351,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00332286,0.0008466383,0.001892323,0.005957428,0.002702781,0.005447688,0.003685804,0.002675421,0.005763382],"category_scores_gemma":[0.03130154,0.001087649,0.00159935,0.00269155,0.006428657,0.009609157,0.003147692,0.003953311,0.0004543347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002718329,"about_ca_system_score_gemma":0.001141504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001993682,"about_ca_topic_score_gemma":0.00220651,"domain_scores_codex":[0.9987841,0.0004215883,0.00005540429,0.0002071331,0.0003095037,0.0002223426],"domain_scores_gemma":[0.9805351,0.01373782,0.001593797,0.001393387,0.001407402,0.001332455],"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.00002889723,0.00004213835,0.0009235616,0.00004747267,0.00001132784,0.00007534258,0.0003140936,0.005191996,0.0005727138,0.9889308,0.001271094,0.002590655],"study_design_scores_gemma":[0.00001127819,0.000007316922,0.0005157099,0.00002286587,0.00000835437,0.0001051741,0.00008483938,0.04555707,0.0001813908,0.9530302,0.0004619964,0.00001385632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7710266,0.001588183,0.1871379,0.004496631,0.0001502217,0.00007654648,0.000440931,0.0006428612,0.03444011],"genre_scores_gemma":[0.9679374,0.001207562,0.02065604,0.0005437831,0.000442918,0.0001807948,0.000673804,0.000401923,0.007955696],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005957428,"threshold_uncertainty_score":0.01972294,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009056355,0.001024773,0.0009177008,0.003355824,0.002142326,0.006638474,0.001052663,0.0009922141,0.05392944],"category_scores_gemma":[0.00356813,0.0005565253,0.0009038321,0.001916571,0.002948169,0.005823448,0.001681637,0.002542003,0.01289972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001694534,"about_ca_system_score_gemma":0.001040721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003672532,"about_ca_topic_score_gemma":0.004499108,"domain_scores_codex":[0.9989516,0.0001691961,0.00005844195,0.0002145585,0.0002948523,0.0003113688],"domain_scores_gemma":[0.9975369,0.0006853707,0.0003420689,0.0003495776,0.0005784016,0.0005075798],"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.0001808147,0.00004552969,0.0005830624,0.000093576,0.000015431,0.000179945,0.000500043,0.001132222,0.002371667,0.9517226,0.02545002,0.01772515],"study_design_scores_gemma":[0.00002686417,0.00006517136,0.001490613,0.00009262699,0.00003323305,0.0004212203,0.0005306019,0.008938789,0.004829797,0.9423151,0.04116141,0.00009448381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2967947,0.00274119,0.2121576,0.005388584,0.003569263,0.0001604715,0.00638678,0.002339267,0.4704621],"genre_scores_gemma":[0.8305182,0.001272332,0.02894742,0.0006829952,0.001168854,0.000108874,0.003436437,0.001783347,0.1320815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05392944,"threshold_uncertainty_score":0.180412,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004062635,0.0007152532,0.0006136313,0.002103874,0.0008773534,0.001952008,0.00133915,0.001036659,0.009849164],"category_scores_gemma":[0.002633632,0.0006112497,0.000729448,0.002245686,0.001509392,0.002059658,0.002436051,0.002023445,0.001241223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006005784,"about_ca_system_score_gemma":0.0003205607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003967592,"about_ca_topic_score_gemma":0.0005492226,"domain_scores_codex":[0.9995828,0.00008225119,0.00002791419,0.00009938271,0.0001601743,0.00004755596],"domain_scores_gemma":[0.9991906,0.0003263754,0.00007265799,0.0001697343,0.0001466969,0.00009390697],"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.00008920481,0.00009819653,0.0008538516,0.0001814841,0.00001926814,0.0001425231,0.0003924817,0.03350751,0.00983607,0.7724873,0.003024933,0.1793671],"study_design_scores_gemma":[0.00002848699,0.0001841281,0.0006648907,0.0001052731,0.00003226897,0.0005116177,0.0004349294,0.2006834,0.00841254,0.749411,0.03949522,0.00003636114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1700513,0.001949378,0.7615669,0.0006509197,0.0003402897,0.0001432503,0.0001519513,0.0005216683,0.06462435],"genre_scores_gemma":[0.6064259,0.00230098,0.3604041,0.0001753363,0.0002161942,0.0001045871,0.0003735755,0.0004557407,0.02954364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009849164,"threshold_uncertainty_score":0.03294873,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003842823,0.001222207,0.002237095,0.002168085,0.00156774,0.004328724,0.002215478,0.003361578,0.006297808],"category_scores_gemma":[0.0215225,0.0006921646,0.001059787,0.003371119,0.003758442,0.01074852,0.002453506,0.005893979,0.001231967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003345704,"about_ca_system_score_gemma":0.001681333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001504323,"about_ca_topic_score_gemma":0.001245689,"domain_scores_codex":[0.9983591,0.000539401,0.00007434345,0.0003083496,0.0005058609,0.0002129526],"domain_scores_gemma":[0.9893321,0.008399495,0.0004488375,0.0008015201,0.000666914,0.0003511437],"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.0001558819,0.00005021457,0.0003092811,0.0001524381,0.00001361225,0.0000527523,0.0001130892,0.0106013,0.0006484187,0.9439059,0.007003466,0.0369936],"study_design_scores_gemma":[0.00003073398,0.00002591931,0.0001103969,0.00003951318,0.000009565739,0.00007101792,0.0000364976,0.03895463,0.0003122588,0.952997,0.007397028,0.00001545603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1949219,0.03627871,0.5528519,0.0330765,0.002992794,0.0001324189,0.0006673949,0.0004716979,0.1786068],"genre_scores_gemma":[0.7407066,0.02241779,0.1892266,0.001694191,0.007993495,0.0001719129,0.000714446,0.000451864,0.03662311],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006297808,"threshold_uncertainty_score":0.02427483,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007061298,0.001936426,0.003256878,0.007502925,0.002998005,0.006069914,0.004584375,0.003406858,0.007948542],"category_scores_gemma":[0.04818857,0.001317081,0.001585484,0.00332519,0.007066946,0.008891234,0.006363166,0.007968596,0.0007949849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002991617,"about_ca_system_score_gemma":0.00103087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001112665,"about_ca_topic_score_gemma":0.00153377,"domain_scores_codex":[0.9962387,0.001831101,0.000126021,0.0003884803,0.0008381392,0.0005775552],"domain_scores_gemma":[0.9488464,0.0397453,0.002842627,0.002420669,0.002376545,0.003768384],"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.0001512092,0.00007654604,0.0008748375,0.0001929912,0.00005671448,0.0001391476,0.0002372117,0.02156081,0.0009896291,0.9672297,0.003884319,0.004606809],"study_design_scores_gemma":[0.00001813536,0.00002049186,0.0004731913,0.00007750351,0.00002555288,0.000102747,0.00007545276,0.137209,0.0003011354,0.8607705,0.0008958342,0.00003039965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.326648,0.01248647,0.5461357,0.01187211,0.000752298,0.000158954,0.001082788,0.001118367,0.09974525],"genre_scores_gemma":[0.9499368,0.003461397,0.03631241,0.001095589,0.001602567,0.0002825313,0.0007539231,0.0005151019,0.006039636],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007948542,"threshold_uncertainty_score":0.03734416,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004336929,0.0006039603,0.000765332,0.001539045,0.001835115,0.002684031,0.0009627866,0.0009851238,0.01265624],"category_scores_gemma":[0.001993744,0.0006510879,0.0005088273,0.001974005,0.001522193,0.00446358,0.001971438,0.002540347,0.001336588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008828969,"about_ca_system_score_gemma":0.0005276215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001415832,"about_ca_topic_score_gemma":0.001785785,"domain_scores_codex":[0.9995893,0.00007693319,0.00002994812,0.00009660282,0.0001235124,0.00008368726],"domain_scores_gemma":[0.998812,0.0005303251,0.0001338473,0.00009543753,0.0001564337,0.000272057],"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.0000445562,0.00002703646,0.0002320501,0.00003333473,0.00000578055,0.0002867087,0.0002179302,0.001106416,0.000892213,0.9918146,0.0009868625,0.004352448],"study_design_scores_gemma":[0.00002680198,0.0000138354,0.0001536715,0.00002531126,0.000008983893,0.0002433298,0.0002315137,0.005367519,0.0006838628,0.9866338,0.00660446,0.000006917418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5859346,0.0007181714,0.2442008,0.0014911,0.0002252259,0.0001617882,0.001427686,0.00036781,0.165473],"genre_scores_gemma":[0.8437166,0.0008607943,0.08212306,0.0003311099,0.00006005482,0.0001405322,0.001250629,0.0002376429,0.07127968],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01265624,"threshold_uncertainty_score":0.04233932,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001961162,0.0009482454,0.001315579,0.0009556017,0.002314043,0.005247293,0.002452212,0.003230033,0.0089239],"category_scores_gemma":[0.007480911,0.0007973737,0.001406557,0.0005675526,0.008083194,0.01423876,0.004916439,0.008221466,0.002555766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007418306,"about_ca_system_score_gemma":0.0007598741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004867477,"about_ca_topic_score_gemma":0.0005088511,"domain_scores_codex":[0.9987438,0.0003570201,0.00005710861,0.0003499512,0.0002870905,0.0002049697],"domain_scores_gemma":[0.9980277,0.0004665665,0.0001506889,0.0009662192,0.0001926488,0.0001960382],"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.00001201267,0.000006271692,0.00003286896,0.00001252552,0.00000285172,0.00003100497,0.00007854796,0.0002004334,0.0005617838,0.9968172,0.0007277521,0.001516775],"study_design_scores_gemma":[0.00001335487,0.000007826075,0.00003031641,0.000008606056,0.000002734664,0.00006163203,0.00004262796,0.001443618,0.0003251259,0.9958996,0.002157774,0.000006743025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1182359,0.0009956154,0.4805915,0.01335632,0.002073727,0.0000777898,0.000212807,0.0009198704,0.3835363],"genre_scores_gemma":[0.8244046,0.00119944,0.1105739,0.003511762,0.001657481,0.0001597226,0.0002399095,0.001331435,0.05692184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0089239,"threshold_uncertainty_score":0.0298534,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008500257,0.0005504959,0.0007619591,0.002667695,0.002916743,0.00370201,0.001383297,0.001316977,0.008820646],"category_scores_gemma":[0.001959112,0.000412929,0.0005765554,0.001708228,0.004074557,0.005388275,0.001573024,0.001980246,0.001051136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001485712,"about_ca_system_score_gemma":0.001682018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002837292,"about_ca_topic_score_gemma":0.002382004,"domain_scores_codex":[0.9996272,0.00005819495,0.00001281414,0.00006109712,0.0001054594,0.0001350954],"domain_scores_gemma":[0.9993126,0.0001671512,0.0001005755,0.0000743382,0.0001196445,0.0002257593],"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.00002922509,0.00001665999,0.0001357551,0.00001409366,0.00000287991,0.00005831341,0.0001067487,0.0003238103,0.0005530744,0.9960122,0.0005591135,0.002188203],"study_design_scores_gemma":[0.00001180294,0.000009860451,0.0002298709,0.000005547588,0.000002948896,0.00009247047,0.00009238382,0.001381206,0.0003671678,0.9967769,0.001017818,0.00001205989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6875529,0.002784317,0.0585264,0.003758529,0.0006782551,0.00006501032,0.0002864908,0.0004646411,0.2458834],"genre_scores_gemma":[0.9746369,0.0005358552,0.004047262,0.000288128,0.000474844,0.00002107438,0.0001159073,0.00005534622,0.01982461],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008820646,"threshold_uncertainty_score":0.02950799,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008980471,0.000534449,0.0007181123,0.001547645,0.00180848,0.002626374,0.0008837652,0.0008398131,0.007449346],"category_scores_gemma":[0.002956029,0.0003657792,0.0006569273,0.001169104,0.005781063,0.004617828,0.002198265,0.001940645,0.000532363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007136719,"about_ca_system_score_gemma":0.0007014096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007066733,"about_ca_topic_score_gemma":0.0009749922,"domain_scores_codex":[0.9994836,0.0001532429,0.00002746758,0.0001099004,0.0001296647,0.00009611626],"domain_scores_gemma":[0.9987815,0.0003577483,0.000214377,0.0001712447,0.0001974553,0.000277674],"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.00001687204,0.000006009625,0.0001213026,0.00001070262,0.000003409748,0.00003762006,0.0000705858,0.0002436464,0.0004228423,0.9961166,0.0005981902,0.002352103],"study_design_scores_gemma":[0.000004472751,0.000007056449,0.0001626552,0.000003105289,0.000002705229,0.0000659154,0.00002691345,0.0007105086,0.00008371046,0.9981172,0.0008106149,0.000005198639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6258894,0.002786029,0.1224929,0.004930384,0.001018789,0.00004248323,0.0002930327,0.0002484224,0.2422985],"genre_scores_gemma":[0.9753219,0.0007505433,0.005208496,0.0004005252,0.00052278,0.00002366107,0.00009140463,0.00008241388,0.01759828],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007449346,"threshold_uncertainty_score":0.02492058,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009476398,0.002751664,0.005011038,0.002992382,0.004319698,0.01038927,0.008009379,0.007275058,0.02190818],"category_scores_gemma":[0.08348447,0.003606633,0.003630741,0.004100776,0.008424032,0.03299,0.01336482,0.01073406,0.004093016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005698424,"about_ca_system_score_gemma":0.004540442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009388904,"about_ca_topic_score_gemma":0.0009104282,"domain_scores_codex":[0.9888356,0.002841709,0.0005804352,0.002074122,0.003655915,0.002012183],"domain_scores_gemma":[0.8155756,0.1467752,0.004217352,0.02367195,0.004100025,0.005659745],"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.008554377,0.001100564,0.009308026,0.001587764,0.0005879034,0.0007259562,0.001741743,0.1029024,0.03632971,0.6835085,0.0485697,0.1050834],"study_design_scores_gemma":[0.0005335941,0.0003681698,0.001671814,0.0002035416,0.000324705,0.0007546019,0.0002381341,0.1810315,0.0125914,0.7940586,0.008037274,0.0001866223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4635905,0.007037541,0.3825158,0.03238526,0.001410551,0.000667589,0.008011056,0.005704669,0.09867699],"genre_scores_gemma":[0.8937762,0.003115647,0.07309836,0.002990487,0.002155835,0.0007192748,0.003545407,0.001676155,0.01892259],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02190818,"threshold_uncertainty_score":0.07329011,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005587982,0.0009659412,0.002251015,0.002822589,0.004879433,0.006205837,0.001932357,0.003202806,0.00557193],"category_scores_gemma":[0.01885193,0.001097676,0.001785167,0.002567357,0.01041358,0.01011838,0.006605501,0.006705092,0.000810282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002062709,"about_ca_system_score_gemma":0.001473893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001053246,"about_ca_topic_score_gemma":0.00081057,"domain_scores_codex":[0.9969387,0.0008250598,0.0001696307,0.000478593,0.000819571,0.0007685505],"domain_scores_gemma":[0.9911028,0.005011207,0.0008027974,0.001283701,0.0007112662,0.001088189],"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.00003910248,0.00001967907,0.0003693845,0.0000160393,0.000007725567,0.00009205008,0.0001435527,0.0007106689,0.0001899967,0.9955485,0.001235831,0.001627431],"study_design_scores_gemma":[0.00001436903,0.000009491471,0.0001516878,0.00001050094,0.000007618542,0.00008617989,0.00003499533,0.002773766,0.0002036893,0.9960179,0.0006713448,0.00001850091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7407388,0.002075244,0.1245829,0.0146667,0.001297175,0.00005964407,0.0003578748,0.0004727221,0.1157489],"genre_scores_gemma":[0.982583,0.0004077086,0.007741286,0.0009863916,0.0007805506,0.00005201604,0.0001432051,0.00007398635,0.007231817],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006205837,"threshold_uncertainty_score":0.0295524,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008134317,0.0009363902,0.001355144,0.00319311,0.003540646,0.003700721,0.001082816,0.001404723,0.008515992],"category_scores_gemma":[0.001252301,0.0006751833,0.001181286,0.001577622,0.003845175,0.006061321,0.002747265,0.002656928,0.001224299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001009785,"about_ca_system_score_gemma":0.0006056727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006902428,"about_ca_topic_score_gemma":0.0008122958,"domain_scores_codex":[0.9993283,0.0001175769,0.00004179265,0.0001525733,0.0002107416,0.0001490663],"domain_scores_gemma":[0.9993945,0.0001297178,0.00009052002,0.0000693525,0.00009375038,0.0002220385],"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.00002618419,0.00002845801,0.00009429658,0.00001424241,0.000006567608,0.0002079061,0.00015689,0.0002461611,0.0008935069,0.9960542,0.0003377473,0.001933779],"study_design_scores_gemma":[0.0000177402,0.00003204175,0.0001659726,0.000007058528,0.0000110725,0.0002596103,0.0001267922,0.001411295,0.000719521,0.9951945,0.002032898,0.00002156355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6048144,0.001184309,0.1244273,0.001575018,0.001367179,0.00013158,0.0002735402,0.0004697788,0.265757],"genre_scores_gemma":[0.9429516,0.0004072352,0.01339099,0.0003355825,0.000589321,0.00005371853,0.0001425041,0.0001079449,0.04202098],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008515992,"threshold_uncertainty_score":0.02848881,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00153605,0.001259324,0.00141793,0.002879737,0.002616078,0.004083675,0.00227207,0.001733365,0.01444133],"category_scores_gemma":[0.005553429,0.0008851801,0.001497549,0.002032203,0.004111171,0.005704571,0.003990407,0.005911358,0.002492164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001651259,"about_ca_system_score_gemma":0.0009473654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008938902,"about_ca_topic_score_gemma":0.0008979573,"domain_scores_codex":[0.9989562,0.0002864445,0.00005771884,0.0001357884,0.0004578533,0.0001058998],"domain_scores_gemma":[0.9970148,0.001642182,0.0002440007,0.0003765077,0.0004773161,0.0002452841],"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.000006092294,0.0000143521,0.00003558007,0.00001872328,0.000003228097,0.00005780472,0.00005519896,0.0002025677,0.0002393712,0.9958583,0.001231004,0.002277837],"study_design_scores_gemma":[0.00001170118,0.00000705543,0.0001156452,0.00001394813,0.000007229601,0.0001592577,0.00003360595,0.001764352,0.0002339162,0.9917463,0.00589403,0.0000129313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1152538,0.005244072,0.2523123,0.01054455,0.002854081,0.0001208495,0.0005727097,0.0004616687,0.612636],"genre_scores_gemma":[0.8337961,0.004134937,0.08308787,0.002121515,0.003772037,0.0002185845,0.0004699718,0.0003516923,0.07204732],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01444133,"threshold_uncertainty_score":0.04831111,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003755082,0.0007820312,0.0006287867,0.0009100677,0.001121315,0.001668553,0.001412613,0.0006342984,0.02072809],"category_scores_gemma":[0.001389046,0.0007215092,0.0006391305,0.001597838,0.0006214091,0.001369446,0.001511423,0.001221606,0.003471413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007798928,"about_ca_system_score_gemma":0.0005214474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001921458,"about_ca_topic_score_gemma":0.003245305,"domain_scores_codex":[0.9994296,0.0001177628,0.00002827847,0.0001398341,0.0001396931,0.0001448163],"domain_scores_gemma":[0.9989141,0.0002752551,0.00008548067,0.0003627471,0.0002288216,0.0001335617],"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.001269295,0.0004410969,0.003073332,0.0005162228,0.00009670748,0.0005323332,0.0005851797,0.08077762,0.09116288,0.4648931,0.05369875,0.3029535],"study_design_scores_gemma":[0.0004013363,0.0004369902,0.003296336,0.0001342326,0.000137907,0.001086055,0.001095362,0.3514215,0.09172221,0.4507153,0.09945466,0.00009823114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2622142,0.0004681633,0.607197,0.000582297,0.0006456631,0.0003476252,0.00151354,0.002595162,0.1244364],"genre_scores_gemma":[0.5163757,0.0006491391,0.4395104,0.0002863965,0.0001078933,0.000245049,0.002330172,0.001209076,0.03928629],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02072809,"threshold_uncertainty_score":0.06934232,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001116574,0.001880631,0.001830057,0.005426655,0.002401954,0.005011732,0.003029344,0.002463294,0.01180218],"category_scores_gemma":[0.007391915,0.001139957,0.001522643,0.003813297,0.003108197,0.008627909,0.00285305,0.003807824,0.001644831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002158422,"about_ca_system_score_gemma":0.000644671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001395813,"about_ca_topic_score_gemma":0.00206323,"domain_scores_codex":[0.9990397,0.0002339526,0.00008464034,0.0001579394,0.0002946635,0.0001890868],"domain_scores_gemma":[0.9976957,0.00115956,0.0003645323,0.0001759341,0.0003413149,0.0002629152],"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.00002548637,0.00003749445,0.0001972329,0.00005235042,0.000009167788,0.000237321,0.0004112972,0.0006117676,0.0004893928,0.9900865,0.001630972,0.006211],"study_design_scores_gemma":[0.00001400248,0.00001061569,0.0001420548,0.00001847383,0.00001593519,0.0001345017,0.000109684,0.004793299,0.0002807585,0.9926848,0.001779351,0.00001636004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6234409,0.003585874,0.1950278,0.003386166,0.002196548,0.0002345408,0.0005170132,0.001138396,0.1704729],"genre_scores_gemma":[0.9195282,0.001628182,0.03052286,0.0009325561,0.001687167,0.0002460782,0.000493268,0.0006809309,0.04428062],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01180218,"threshold_uncertainty_score":0.03948218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}