{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":95,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":95,"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":"81ddb7b2a067","filters":{"venue":"International Journal of Algebra and Computation"}},"results":[{"id":"W2001772188","doi":"10.1142/s0218196705002761","title":"ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS","year":2005,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Automaton; Decidability; Class (philosophy); Discrete mathematics; ω-automaton; Finite-state machine; Group (periodic table); Automata theory; Quantum finite automata; Theoretical computer science; Algorithm; Computer science; Artificial intelligence","authors":[{"name":"Pedro V. Silva","is_ca":false},{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01168071292187287,"gpt":0.2636204136391523,"spread":0.2519397007172794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005730811,0.0006812461,0.0006066138,0.001240976,0.001751909,0.001924983,0.0006551335,0.001403401,0.005137525],"category_scores_gemma":[0.002021007,0.0002943478,0.0014551,0.0008128622,0.003120179,0.003628535,0.002234337,0.001514055,0.0007121212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008712822,"about_ca_system_score_gemma":0.0005278717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001093547,"about_ca_topic_score_gemma":0.0007670588,"domain_scores_codex":[0.9993661,0.0001233543,0.00003709207,0.0001896925,0.0001369731,0.0001468089],"domain_scores_gemma":[0.998689,0.0005868291,0.0002072618,0.0002243675,0.00009796377,0.000194593],"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.00005561687,0.0000382076,0.0007994998,0.0000502422,0.00001383199,0.0005174544,0.00115588,0.003513213,0.004008794,0.9840364,0.0005831164,0.005227702],"study_design_scores_gemma":[0.00004000408,0.0001102477,0.0006022619,0.00002404748,0.00001602563,0.000395745,0.0003034208,0.01300752,0.001264062,0.9749482,0.009262713,0.00002574967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6819102,0.001825151,0.2234877,0.001536979,0.0002741697,0.0002383523,0.0004211956,0.0006496263,0.08965667],"genre_scores_gemma":[0.9534869,0.0008002481,0.02226715,0.0003100738,0.0004071984,0.0002265811,0.0005282703,0.0001203686,0.02185328],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005137525,"threshold_uncertainty_score":0.01718676,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125612913","doi":"10.1142/s0218196707004219","title":"THE QUIVER OF THE SEMIGROUP ALGEBRA OF A LEFT REGULAR BAND","year":2007,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Quiver; Hyperplane; Semigroup; Pure mathematics; Regular semigroup; Bicyclic semigroup; Algebra over a field; Discrete mathematics; Combinatorics; Special classes of semigroups","authors":[{"name":"Franco Saliola","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01499375698230084,"gpt":0.309281680226039,"spread":0.2942879232437381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003949582,0.0002010847,0.0003075988,0.001062386,0.0008474753,0.001788705,0.0003531917,0.0002403421,0.005994798],"category_scores_gemma":[0.0006797428,0.0001675481,0.0004024006,0.0004108938,0.001351912,0.001726836,0.0005770365,0.0006189697,0.000770878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005266489,"about_ca_system_score_gemma":0.0004293159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008242151,"about_ca_topic_score_gemma":0.0006160987,"domain_scores_codex":[0.9997383,0.00005810913,0.00001075774,0.00004854515,0.00008952522,0.00005488801],"domain_scores_gemma":[0.9996655,0.00007646877,0.00004876228,0.00002948545,0.00007504633,0.0001046985],"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.00004008552,0.00002242939,0.0006224959,0.00003063747,0.000008508579,0.0001442137,0.0002931551,0.001313318,0.003667401,0.9857337,0.0007904783,0.007333612],"study_design_scores_gemma":[0.00002141373,0.00008469634,0.001685716,0.00001813758,0.000015974,0.0003330168,0.0001905403,0.01909197,0.003782441,0.9680547,0.006695606,0.00002576652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7935763,0.0005878353,0.1492219,0.000535621,0.0001899059,0.00006951535,0.0002768179,0.000287263,0.05525485],"genre_scores_gemma":[0.9740314,0.0002420731,0.01392206,0.0001316634,0.0001764638,0.00004086971,0.0002280333,0.00004683483,0.01118054],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005994798,"threshold_uncertainty_score":0.02005458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963602153","doi":"10.1142/s0218196709004956","title":"ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS","year":2009,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Distributivity; Idempotence; Congruence (geometry); EXPTIME; Variety (cybernetics); Modularity (biology); Congruence relation; Polynomial; Algebra over a field; Universal algebra; Time complexity; Pure mathematics; Discrete mathematics; Computational complexity theory; Distributive property; Algorithm; PSPACE","authors":[{"name":"Ralph Freese","is_ca":false},{"name":"Matthew Valeriote","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03230162631810712,"gpt":0.3002791238380374,"spread":0.2679774975199303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007630188,0.0009462459,0.002370891,0.00222955,0.003906732,0.007836657,0.003478548,0.003006822,0.01235722],"category_scores_gemma":[0.05636316,0.001407413,0.003713133,0.002397273,0.00793606,0.0245294,0.007594684,0.006103107,0.00113169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003204476,"about_ca_system_score_gemma":0.003301926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003474098,"about_ca_topic_score_gemma":0.002766184,"domain_scores_codex":[0.9880016,0.003269497,0.0009199802,0.002312862,0.003678835,0.001817248],"domain_scores_gemma":[0.8872479,0.09560525,0.004746938,0.007011375,0.002909829,0.002478674],"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.002181679,0.0006448163,0.01521858,0.0008315312,0.000227017,0.001026457,0.002000449,0.08416395,0.01190563,0.8164566,0.007841409,0.05750196],"study_design_scores_gemma":[0.0001935516,0.0001199406,0.001379761,0.0000500351,0.00007330412,0.0003009108,0.0004743826,0.1207653,0.006935331,0.8677043,0.001921058,0.00008209054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7355402,0.00091739,0.2282954,0.008698531,0.0001576467,0.0006221186,0.002402067,0.002357463,0.02100914],"genre_scores_gemma":[0.920575,0.0004684233,0.07163566,0.0005733709,0.0002515002,0.0002409569,0.002438933,0.0003954847,0.003420582],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01235722,"threshold_uncertainty_score":0.04133898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143684958","doi":"10.1142/s0218196706003116","title":"TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Hungarian Scientific Research Fund","keywords":"Mathematics; Constraint satisfaction problem; Polynomial; Algebra over a field; Complexity of constraint satisfaction; Pure mathematics; Discrete mathematics; Local consistency; Mathematical analysis","authors":[{"name":"Benoît Larose","is_ca":true},{"name":"László Zádori","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02582853523826426,"gpt":0.3013269032063554,"spread":0.2754983679680911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003319803,0.0006035279,0.001464784,0.001373658,0.002002897,0.004610668,0.002530825,0.001786563,0.007619266],"category_scores_gemma":[0.02810245,0.0005489254,0.001888011,0.00249288,0.004315468,0.01509075,0.003012585,0.005508652,0.0004862028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002942926,"about_ca_system_score_gemma":0.002320427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003310161,"about_ca_topic_score_gemma":0.003389307,"domain_scores_codex":[0.996954,0.0008351006,0.0001813246,0.0005269737,0.0008581278,0.0006444996],"domain_scores_gemma":[0.943981,0.04922445,0.00278896,0.001978515,0.001109543,0.0009175367],"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.0003615867,0.0003474432,0.006297461,0.0004073625,0.0001175954,0.000308159,0.001054824,0.09504974,0.003435334,0.8648851,0.003294596,0.02444079],"study_design_scores_gemma":[0.00004482822,0.00002979643,0.0005788991,0.00001413788,0.00002785163,0.00006509847,0.0001814049,0.1350585,0.001352621,0.861886,0.0007396791,0.00002117154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6381417,0.0008393106,0.3348867,0.007994781,0.0000788047,0.0002349383,0.0009461376,0.0004056367,0.01647195],"genre_scores_gemma":[0.9367484,0.0005902495,0.05684721,0.0003229715,0.0002145631,0.0001516744,0.0011111,0.00008179491,0.003932132],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007619266,"threshold_uncertainty_score":0.02548897,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993691575","doi":"10.1142/s0218196711006194","title":"AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Alphabet; Rank (graph theory); Automaton; Combinatorics; Binary number; Construct (python library); Finite-state machine; Free product; Discrete mathematics; Free group; Order (exchange); Deterministic finite automaton; Quantum finite automata; Group (periodic table); Automata theory; Arithmetic; Algorithm; Theoretical computer science; Computer science","authors":[{"name":"Benjamin Steinberg","is_ca":true},{"name":"Mariya Vorobets","is_ca":false},{"name":"Yaroslav Vorobets","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01727021681610744,"gpt":0.2528932198414351,"spread":0.2356230030253277,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005363589,0.0006961829,0.0004140915,0.0007843812,0.0009985998,0.001372275,0.0007102936,0.000520301,0.004855793],"category_scores_gemma":[0.001804552,0.0002575439,0.0009225752,0.0004327204,0.001382977,0.002152708,0.001687803,0.0006570344,0.0009981674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005824996,"about_ca_system_score_gemma":0.0006591251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006061069,"about_ca_topic_score_gemma":0.0008720979,"domain_scores_codex":[0.9993778,0.0001574857,0.00005488539,0.0001205427,0.0001469337,0.0001423266],"domain_scores_gemma":[0.9981899,0.0007780595,0.0002768751,0.0003077991,0.0001874151,0.0002599367],"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.0004390463,0.0002207693,0.002620639,0.0002147784,0.00003945298,0.000704168,0.002244134,0.02040221,0.02762349,0.902696,0.002606275,0.04018884],"study_design_scores_gemma":[0.0001727258,0.0003611448,0.0007340018,0.00007586095,0.00005659517,0.0003607559,0.0003942158,0.07900196,0.03868274,0.8607576,0.01928054,0.0001217422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6110942,0.0005009932,0.3469464,0.0005475613,0.0002669616,0.0002093391,0.0004587141,0.002124273,0.03785152],"genre_scores_gemma":[0.9249049,0.0001744647,0.06036758,0.0001140903,0.0000900236,0.0002199622,0.0004354295,0.0001228642,0.0135708],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004855793,"threshold_uncertainty_score":0.01624423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1528460097","doi":"10.1142/s0218196705002712","title":"KAZHDAN CONSTANTS FOR <font>SL</font><sub>n</sub>(ℤ)","year":2005,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Alberta; Clay Mathematics Institute; Yale University","keywords":"Mathematics; Bounded function; Constant (computer programming); Cayley graph; Abelian group; Combinatorics; Generating set of a group; Spectral gap; Upper and lower bounds; Product (mathematics); Graph; Infinity; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry","authors":[{"name":"Martin Kassabov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03566420325115901,"gpt":0.3677014432074088,"spread":0.3320372399562498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001983979,0.0008974082,0.0006328959,0.002659447,0.002392984,0.002195552,0.001709043,0.0007865881,0.01464398],"category_scores_gemma":[0.009229305,0.0003660237,0.0007608536,0.0015301,0.002909984,0.01174559,0.002115284,0.003712144,0.003355983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002296288,"about_ca_system_score_gemma":0.001293502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001080279,"about_ca_topic_score_gemma":0.001748763,"domain_scores_codex":[0.9986596,0.0002629943,0.00008567343,0.0002913587,0.0004428615,0.0002574716],"domain_scores_gemma":[0.9946573,0.002956506,0.0004925486,0.0009340915,0.0006418147,0.000317658],"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.00009248464,0.00003370898,0.0005733798,0.0001201225,0.00001291818,0.0000598361,0.0003670406,0.002827355,0.00243825,0.9706952,0.002503938,0.02027572],"study_design_scores_gemma":[0.00001423879,0.0000497976,0.0008290242,0.00004323224,0.0000404715,0.0002646703,0.0001134099,0.02040489,0.009431059,0.9534585,0.01528633,0.0000643088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2706278,0.007407134,0.5121055,0.003764041,0.001187832,0.0001386181,0.0004361206,0.001973937,0.202359],"genre_scores_gemma":[0.9042942,0.002041146,0.06628688,0.0005506279,0.0005123633,0.0001852927,0.0002234025,0.0007271916,0.02517886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01464398,"threshold_uncertainty_score":0.04898894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963210887","doi":"10.1142/s0218196710005662","title":"APERIODIC POINTLIKES AND BEYOND","year":2010,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Aperiodic graph; Decidability; Mathematics; Set (abstract data type); Discrete mathematics; Combinatorics; Pure mathematics; Computer science","authors":[{"name":"Karsten Henckell","is_ca":false},{"name":"John Rhodes","is_ca":false},{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004474427832064978,"gpt":0.2400935153321515,"spread":0.2356190875000865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001572634,0.0003425164,0.0004995377,0.0008452994,0.001378707,0.002741681,0.001046662,0.0008478804,0.003540501],"category_scores_gemma":[0.005163479,0.0003683915,0.001026522,0.0004611698,0.003694964,0.007500631,0.002012354,0.00255089,0.0004081715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008541978,"about_ca_system_score_gemma":0.0005271756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005031506,"about_ca_topic_score_gemma":0.000327989,"domain_scores_codex":[0.9985824,0.0002655415,0.00008699793,0.0004961552,0.0003703477,0.0001985546],"domain_scores_gemma":[0.9949321,0.003395927,0.0003653292,0.0006543671,0.0004235037,0.0002287334],"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.00004614105,0.00002116815,0.000522647,0.00005816817,0.000006897434,0.0001432487,0.000706493,0.001045226,0.00221246,0.9865409,0.0004743047,0.008222419],"study_design_scores_gemma":[0.00001416569,0.00004117105,0.0002083837,0.00003481657,0.00001471305,0.000197524,0.0002207805,0.006089179,0.004693794,0.9809073,0.007561899,0.00001644879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4479399,0.002245439,0.4527158,0.00254329,0.000286096,0.0001542464,0.0005331318,0.001203834,0.09237822],"genre_scores_gemma":[0.971126,0.000324629,0.02282285,0.0002872279,0.0001049306,0.00005399277,0.0001463148,0.00006552093,0.005068486],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003540501,"threshold_uncertainty_score":0.01184422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012184402","doi":"10.1142/s0218196703001304","title":"THE RENNER MONOIDS AND CELL DECOMPOSITIONS OF THE SYMPLECTIC ALGEBRAIC MONOIDS","year":2003,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Monoid; Section (typography); Lattice (music); Algebraic number; Group (periodic table); Symplectic geometry; Intersection (aeronautics); Combinatorics; Pure mathematics; Mathematical analysis","authors":[{"name":"Zhenheng Li","is_ca":true},{"name":"Lex E. Renner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01217869798766513,"gpt":0.2910119119142206,"spread":0.2788332139265555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007521141,0.0003749634,0.0003467184,0.001398462,0.0009971405,0.001785188,0.0005982313,0.0004241568,0.004776743],"category_scores_gemma":[0.001006204,0.0003023841,0.0005026322,0.0006270476,0.002026016,0.003478546,0.001723209,0.001289824,0.0008258746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005969691,"about_ca_system_score_gemma":0.0004009192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006080533,"about_ca_topic_score_gemma":0.0008389893,"domain_scores_codex":[0.9994339,0.0001176719,0.00004557394,0.0001077059,0.0001904627,0.0001044672],"domain_scores_gemma":[0.9994154,0.000121926,0.00009265037,0.0001021672,0.0001186744,0.0001491365],"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.00001435386,0.00000729053,0.0002190547,0.0000190108,0.000002758231,0.00005749022,0.0003610926,0.0004548606,0.001980542,0.9926319,0.0001699097,0.00408167],"study_design_scores_gemma":[0.00001606709,0.00005312441,0.0007100006,0.00002417676,0.0000113901,0.0002646044,0.0004904554,0.008069402,0.006940316,0.9678852,0.01550605,0.00002921655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7043965,0.001510652,0.2401664,0.0004307897,0.0002433052,0.0001010486,0.0003208984,0.0002015151,0.05262882],"genre_scores_gemma":[0.9132595,0.0006585885,0.06326146,0.0001617485,0.0001765921,0.0001364622,0.0003007524,0.00007572515,0.02196923],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004776743,"threshold_uncertainty_score":0.01597983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034376971","doi":"10.1142/s0218196706002998","title":"SUBVARIETIES OF THE VARIETY GENERATED BY THE FIVE-ELEMENT BRANDT SEMIGROUP","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subvariety; Mathematics; Semigroup; Variety (cybernetics); Element (criminal law); Pure mathematics; Set (abstract data type); Algebra over a field; Discrete mathematics; Computer science; Statistics","authors":[{"name":"Edmond W. H. Lee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004614855934500324,"gpt":0.216728865260425,"spread":0.2121140093259247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003845438,0.0002765932,0.0003502253,0.001203727,0.0008528925,0.002206118,0.0003799738,0.0002264244,0.004476144],"category_scores_gemma":[0.0005893877,0.0001907937,0.0005461122,0.0007198896,0.001328215,0.001934505,0.0008887969,0.000728217,0.0006313259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004991419,"about_ca_system_score_gemma":0.0002424683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003733197,"about_ca_topic_score_gemma":0.0002963346,"domain_scores_codex":[0.9996446,0.00004929776,0.00001987449,0.0000976496,0.0001171897,0.00007132434],"domain_scores_gemma":[0.9996728,0.0001055138,0.00004473209,0.00004661646,0.00004813147,0.00008223372],"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.0003126049,0.00006149014,0.003107575,0.00006816191,0.0000217807,0.0005464762,0.001113099,0.003131224,0.01893066,0.9482228,0.0009758382,0.02350837],"study_design_scores_gemma":[0.0000572414,0.0001619754,0.006971119,0.00003865036,0.00004042805,0.001725539,0.0009356173,0.02581569,0.02917335,0.9141309,0.02088769,0.00006177808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8317638,0.000431758,0.1344924,0.000189815,0.000045454,0.00005974331,0.0004267979,0.0003415182,0.03224881],"genre_scores_gemma":[0.970093,0.0001862597,0.02293237,0.0000295964,0.0000356193,0.00005167062,0.0007315103,0.0000438758,0.005896105],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004476144,"threshold_uncertainty_score":0.01497412,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075559395","doi":"10.1142/s0218196706003396","title":"A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Folding (DSP implementation); Finitely-generated abelian group; Process (computing); Group (periodic table); Word (group theory); Key (lock); Stallings theorem about ends of groups","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.020239153241068,"gpt":0.3284267487454681,"spread":0.3081875955044001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001227131,0.001006051,0.0009813107,0.0008898205,0.001321007,0.001354991,0.002102264,0.001132307,0.01193795],"category_scores_gemma":[0.003121456,0.0004943256,0.0009230478,0.001199615,0.000860382,0.002601632,0.002169616,0.001471793,0.005588046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009753178,"about_ca_system_score_gemma":0.001351323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001789445,"about_ca_topic_score_gemma":0.001577171,"domain_scores_codex":[0.9988692,0.0001904393,0.0001000274,0.0003612965,0.0002705172,0.0002084675],"domain_scores_gemma":[0.9982835,0.000414658,0.0000743964,0.0007254487,0.0004271541,0.00007496388],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006770332,0.0001439649,0.0018738,0.000271366,0.00006363782,0.0003058102,0.0007201841,0.04527568,0.03002833,0.1018731,0.02017634,0.7985908],"study_design_scores_gemma":[0.0001743788,0.0003058276,0.0007218702,0.00006618592,0.00007577406,0.0004284016,0.0003848733,0.5789037,0.05945383,0.2971695,0.06221869,0.00009693757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0147627,0.0001396139,0.9730465,0.0001824006,0.0000896002,0.0001204054,0.0001938006,0.007887541,0.00357736],"genre_scores_gemma":[0.1934687,0.0001454712,0.7942228,0.0001365099,0.00005785305,0.0003039417,0.00142279,0.0009210011,0.009321008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01193795,"threshold_uncertainty_score":0.03993642,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058703803","doi":"10.1142/s0218196711006169","title":"LIMIT VARIETIES GENERATED BY COMPLETELY 0-SIMPLE SEMIGROUPS","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Limit (mathematics); Semigroup; Simple (philosophy); Abelian group; Variety (cybernetics); Pure mathematics; Discrete mathematics; Mathematical analysis","authors":[{"name":"Edmond W. H. Lee","is_ca":true},{"name":"Mikhail V. Volkov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02425072893158624,"gpt":0.2427874665513728,"spread":0.2185367376197866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006305306,0.0003803174,0.0004256768,0.001618802,0.001382999,0.00218213,0.000528844,0.0003058912,0.002440983],"category_scores_gemma":[0.001181966,0.0002596024,0.000680963,0.0004725626,0.001963097,0.003053402,0.001607382,0.0006133521,0.000321914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006062178,"about_ca_system_score_gemma":0.000235388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001924276,"about_ca_topic_score_gemma":0.0002053681,"domain_scores_codex":[0.9995091,0.0001063245,0.0000495289,0.0001125954,0.0001547338,0.00006760913],"domain_scores_gemma":[0.9992307,0.0002405227,0.00009859499,0.00007310109,0.0001413293,0.0002157813],"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.0001737902,0.00005900509,0.002783438,0.00008560352,0.00002989223,0.001181807,0.002184812,0.001326305,0.0168205,0.9608102,0.000705078,0.01383951],"study_design_scores_gemma":[0.00007428485,0.0002658622,0.003952096,0.00006386677,0.00005419631,0.002837589,0.001310257,0.009967756,0.01977653,0.942271,0.01934983,0.00007675488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9190596,0.001054824,0.05097762,0.0002025039,0.00008899635,0.00004829359,0.0001431338,0.0003012741,0.02812376],"genre_scores_gemma":[0.9822129,0.0002155228,0.01040328,0.00003971106,0.00007292033,0.00004640167,0.0001988276,0.00002982828,0.006780672],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002440983,"threshold_uncertainty_score":0.008165896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086964854","doi":"10.1142/s0218196705002104","title":"RESIDUAL FINITENESS OF OUTER AUTOMORPHISM GROUPS OF FINITELY GENERATED NON-TRIANGLE FUCHSIAN GROUPS","year":2005,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Korea Science and Engineering Foundation","keywords":"Mathematics; Outer automorphism group; Automorphism; Group of Lie type; Pure mathematics; Grossman; Finitely-generated abelian group; Residual; Inner automorphism; Property (philosophy); Group (periodic table); Group isomorphism; Automorphism group; Group theory","authors":[{"name":"R. B. J. T. Allenby","is_ca":false},{"name":"Goansu Kim","is_ca":false},{"name":"C. Y. Tang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03148816624685013,"gpt":0.3073483424188482,"spread":0.2758601761719981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007611535,0.0003991931,0.0003781814,0.0006731136,0.0006672436,0.001203101,0.0005385448,0.0003630531,0.003129025],"category_scores_gemma":[0.002035373,0.000181935,0.0004417334,0.0002351529,0.003177509,0.003051455,0.001397746,0.0008198454,0.0002608693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004638214,"about_ca_system_score_gemma":0.000240906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004423264,"about_ca_topic_score_gemma":0.0002833015,"domain_scores_codex":[0.9995726,0.00006707798,0.00002781818,0.00008947105,0.000123378,0.0001198138],"domain_scores_gemma":[0.9985233,0.0006214744,0.0002304795,0.000291265,0.0001578328,0.0001757061],"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.0001647225,0.00003362497,0.00337035,0.0000800202,0.00001843294,0.0002810934,0.002404802,0.001878708,0.01116098,0.966444,0.000204603,0.01395867],"study_design_scores_gemma":[0.00002777571,0.0001804662,0.00233966,0.00001983239,0.00002194306,0.0004082207,0.0007809785,0.007460559,0.0199574,0.9640816,0.004692759,0.00002884617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9337838,0.0003104451,0.04957224,0.0002287959,0.0000301147,0.00002024721,0.00006089623,0.0001221219,0.01587136],"genre_scores_gemma":[0.9953093,0.00006228705,0.002571087,0.0000193252,0.00001843522,0.000008103679,0.00006788163,0.00001014452,0.001933358],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003129025,"threshold_uncertainty_score":0.01046765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008283002","doi":"10.1142/s0218196708004755","title":"COMBINATORIAL REES–SUSHKEVICH VARIETIES ARE FINITELY BASED","year":2008,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Variety (cybernetics); Finitely-generated abelian group; Pure mathematics; Simple (philosophy); Combinatorics; Algebra over a field","authors":[{"name":"Edmond W. H. Lee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01664893096638616,"gpt":0.2477881473012022,"spread":0.231139216334816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004548526,0.0004154448,0.0004918819,0.00144204,0.0008339543,0.002039273,0.0005667101,0.0003774507,0.00469018],"category_scores_gemma":[0.0009237526,0.0002958736,0.0005234224,0.0008597784,0.002339774,0.00253749,0.0009969301,0.0007854791,0.0007685184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004179553,"about_ca_system_score_gemma":0.0002432224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001943801,"about_ca_topic_score_gemma":0.0002220688,"domain_scores_codex":[0.9994839,0.0001047651,0.00004173523,0.000152638,0.0001413899,0.00007553376],"domain_scores_gemma":[0.9993039,0.000219167,0.0001384646,0.0001149843,0.000113452,0.0001100386],"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.00007713826,0.00002060475,0.0009555821,0.00005670574,0.00001833278,0.0002557938,0.0003466582,0.001634217,0.004572935,0.9827896,0.0004666927,0.008805742],"study_design_scores_gemma":[0.00005328509,0.0001424148,0.003524394,0.00003999136,0.00003494634,0.00110975,0.0004583286,0.006416498,0.006073588,0.9684601,0.01363744,0.00004916292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8465689,0.001017126,0.06439952,0.0002278608,0.00009530627,0.00005833054,0.0003681685,0.0002405911,0.08702412],"genre_scores_gemma":[0.9770771,0.0002898232,0.0119874,0.00004188128,0.00008492084,0.00004653571,0.0003781786,0.0000244045,0.01006978],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00469018,"threshold_uncertainty_score":0.01569021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570386222","doi":"10.1142/s0218196709005330","title":"A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS","year":2009,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Fibonacci number; Class (philosophy); Set (abstract data type); Discrete mathematics; Finite set; Automaton; Sequence (biology); Regular language; Decision problem; Algebra over a field; Arithmetic; Combinatorics; Pure mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Computer science","authors":[{"name":"Jason P. Bell","is_ca":true},{"name":"Émilie Charlier","is_ca":false},{"name":"Aviezri S. Fraenkel","is_ca":false},{"name":"Michel Rigo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01046059632410859,"gpt":0.2923544748404146,"spread":0.281893878516306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004313226,0.0005628604,0.001201223,0.0006395832,0.00217532,0.004909649,0.002015497,0.002500484,0.005828309],"category_scores_gemma":[0.01570758,0.0006874537,0.001687021,0.0007196293,0.004020792,0.006401354,0.002498228,0.002487742,0.0005389839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002220324,"about_ca_system_score_gemma":0.001983207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001714411,"about_ca_topic_score_gemma":0.001294593,"domain_scores_codex":[0.9957358,0.001259304,0.0003704535,0.001433498,0.0005337904,0.0006671337],"domain_scores_gemma":[0.9840243,0.01343584,0.0006141635,0.0005219236,0.0006586041,0.0007451064],"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.001598241,0.0004903894,0.002833349,0.0006995206,0.0001554047,0.001155982,0.001739051,0.08928922,0.01034395,0.8343298,0.005096115,0.05226893],"study_design_scores_gemma":[0.0002263824,0.0002227813,0.0004066884,0.000055057,0.00006476112,0.000218721,0.0005371308,0.2053373,0.007293093,0.7828643,0.002699684,0.00007408178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.458602,0.0004209786,0.5243186,0.003946393,0.0002013441,0.000470573,0.0007087445,0.0006032224,0.01072813],"genre_scores_gemma":[0.8132328,0.0002595073,0.1779748,0.0004274987,0.0001821186,0.0002953388,0.001004351,0.0001013346,0.006522243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005828309,"threshold_uncertainty_score":0.02281082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053952521","doi":"10.1142/s0218196707003652","title":"THE CONJUGACY PROBLEM IN AMALGAMATED PRODUCTS I: REGULAR ELEMENTS AND BLACK HOLES","year":2007,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Royal Society; Leverhulme Trust","keywords":"Mathematics; Conjugacy problem; Conjugacy class; Decidability; Word problem (mathematics education); Set (abstract data type); Generating set of a group; Word (group theory); Combinatorics; Group (periodic table); Discrete mathematics; Arithmetic; Computer science; Geometry","authors":[{"name":"Alexandre Borovik","is_ca":false},{"name":"Alexei Myasnikov","is_ca":true},{"name":"В. Н. Ремесленников","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02021959567896121,"gpt":0.3107638551989609,"spread":0.2905442595199997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003566301,0.0008422767,0.001796867,0.001079435,0.002973319,0.007426928,0.002464579,0.002664134,0.008946897],"category_scores_gemma":[0.01746581,0.001040906,0.003168886,0.001740743,0.00438931,0.02184401,0.00501344,0.003967449,0.0007550195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00350053,"about_ca_system_score_gemma":0.00199326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002154125,"about_ca_topic_score_gemma":0.001436328,"domain_scores_codex":[0.9971247,0.0006598097,0.0002952129,0.0008036027,0.0004597941,0.0006568281],"domain_scores_gemma":[0.981508,0.01447837,0.001077023,0.001819046,0.0004088101,0.0007087231],"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.00170503,0.0004279474,0.005798072,0.0007424147,0.0001565873,0.0007278957,0.002748686,0.03390832,0.01039012,0.8943965,0.005417951,0.04358034],"study_design_scores_gemma":[0.0001171136,0.00009055503,0.000492971,0.00003190939,0.00007474485,0.000220805,0.0004042929,0.04659241,0.00642821,0.9433016,0.002196034,0.00004937389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8021482,0.0008683277,0.1782181,0.003268506,0.0001255306,0.0002989474,0.000845899,0.0007651665,0.01346129],"genre_scores_gemma":[0.9195287,0.0004660791,0.07097524,0.0003086475,0.0001964921,0.0002335315,0.00126062,0.0002638512,0.006766787],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008946897,"threshold_uncertainty_score":0.02993035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133334995","doi":"10.1142/s021819670900524x","title":"OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT","year":2009,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Nemzeti Fejlesztési Ügynökség; Fonds Québécois de la Recherche sur la Nature et les Technologies; Hungarian Scientific Research Fund; Centre de Recherches Mathématiques","keywords":"Unary operation; Mathematics; Bounded function; Variety (cybernetics); Type (biology); Discrete mathematics; Affine transformation; Algebra over a field; Combinatorics; Pure mathematics; Mathematical analysis; Statistics","authors":[{"name":"Benoît Larose","is_ca":true},{"name":"Matthew Valeriote","is_ca":true},{"name":"László Zádori","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008600406006068288,"gpt":0.2718593373967384,"spread":0.2632589313906701,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004822434,0.0008458328,0.001416981,0.002498671,0.002414481,0.005742444,0.00396377,0.001884684,0.004963465],"category_scores_gemma":[0.02007883,0.001230191,0.002517884,0.002476347,0.009418509,0.02659203,0.009504126,0.004268155,0.0009056022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001516579,"about_ca_system_score_gemma":0.001265645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002076938,"about_ca_topic_score_gemma":0.001126079,"domain_scores_codex":[0.9927625,0.001370973,0.001104503,0.001708723,0.001512559,0.001540695],"domain_scores_gemma":[0.970704,0.01437289,0.00273133,0.007743304,0.002481814,0.001966671],"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.000174577,0.00004685775,0.002555418,0.0001041705,0.0000268718,0.000354754,0.001141541,0.003439557,0.001860066,0.9811973,0.000659458,0.008439371],"study_design_scores_gemma":[0.00003216059,0.00006242459,0.0004693678,0.00003038237,0.00003877129,0.0003378718,0.0002388542,0.009128131,0.002400792,0.9845093,0.002719218,0.00003279255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4592167,0.001249105,0.4926005,0.002716177,0.0001553756,0.0001525469,0.001017713,0.001463751,0.04142809],"genre_scores_gemma":[0.9650016,0.0002619134,0.02795844,0.0003001446,0.0001655752,0.0001297357,0.0005709818,0.000169482,0.005442105],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005742444,"threshold_uncertainty_score":0.02550375,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987022760","doi":"10.1142/s021819671000542x","title":"COMPRESSED WORDS AND AUTOMORPHISMS IN FULLY RESIDUALLY FREE GROUPS","year":2010,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Decidability; Automorphism; Word problem (mathematics education); Word (group theory); Finitely-generated abelian group; Group (periodic table); Free group; Polynomial; Combinatorics; Automorphism group; Discrete mathematics; Arithmetic; Mathematical analysis; Geometry","authors":[{"name":"Jeremy Macdonald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01691819568520715,"gpt":0.2988823422422948,"spread":0.2819641465570877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001149024,0.0005762453,0.0006903168,0.0008562017,0.001056284,0.002348999,0.001139247,0.0009877885,0.005440599],"category_scores_gemma":[0.00468795,0.0005144437,0.001335559,0.0008841138,0.003407937,0.008861038,0.002729364,0.002111735,0.0005812631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001191254,"about_ca_system_score_gemma":0.0008936513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001330301,"about_ca_topic_score_gemma":0.001106444,"domain_scores_codex":[0.9980711,0.0004671128,0.0001655021,0.0004870439,0.000453127,0.0003561731],"domain_scores_gemma":[0.9956385,0.002832153,0.0003646335,0.0006972495,0.0003005613,0.0001669697],"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.0002668958,0.00007274513,0.0006135483,0.0001826694,0.00003116918,0.0002800545,0.001162989,0.01257861,0.006804223,0.9556644,0.001847882,0.02049474],"study_design_scores_gemma":[0.00003599016,0.00004262287,0.00009521762,0.00001222815,0.00001872071,0.00008881414,0.0001305189,0.01842795,0.004390834,0.9739974,0.002740356,0.00001940163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6070295,0.000801609,0.3666109,0.00208838,0.0001984461,0.0001871479,0.0008157213,0.002111302,0.02015698],"genre_scores_gemma":[0.9485189,0.0002496632,0.04240602,0.0002528088,0.0001552535,0.000127728,0.0009914191,0.0002104923,0.007087721],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005440599,"threshold_uncertainty_score":0.01820058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1989241301","doi":"10.1142/s0218196707004098","title":"ON AUTOMORPHISMS OF CATEGORIES OF UNIVERSAL ALGEBRAS","year":2007,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Israel Science Foundation; Israel Academy of Sciences and Humanities; McMaster University","keywords":"Mathematics; Automorphism; Functor; Variety (cybernetics); Pure mathematics; Algebra over a field","authors":[{"name":"B. Plotkin","is_ca":false},{"name":"Grigori Zhitomirski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01822019773730268,"gpt":0.2988193715017433,"spread":0.2805991737644406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001903286,0.0005920502,0.0006747542,0.002624357,0.002204079,0.002601157,0.0007547113,0.001122011,0.003965207],"category_scores_gemma":[0.003903025,0.0005142873,0.001872981,0.001469114,0.005672398,0.006946716,0.004207,0.001910052,0.0006415332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001550896,"about_ca_system_score_gemma":0.0005536431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0014299,"about_ca_topic_score_gemma":0.001014448,"domain_scores_codex":[0.9984683,0.0005353733,0.0001107736,0.0002402588,0.0003696562,0.0002754675],"domain_scores_gemma":[0.9977124,0.0009823373,0.0001867318,0.000500189,0.0003614523,0.000256913],"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.00001269651,0.00000902869,0.0002267923,0.0000212178,0.000005382062,0.00008273527,0.0005774646,0.0004970942,0.0004610347,0.9952218,0.0003548066,0.002530017],"study_design_scores_gemma":[0.000004678276,0.00001295259,0.0002062783,0.00001104071,0.000005236368,0.00007531656,0.00009504884,0.001205633,0.0002089379,0.9948865,0.003280158,0.000008322862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4816849,0.005143337,0.3429648,0.00237209,0.0007483746,0.0001425366,0.0005476137,0.0008762157,0.1655201],"genre_scores_gemma":[0.9548774,0.001617003,0.02550905,0.0005527457,0.0005992695,0.0001195359,0.0004089228,0.0001925514,0.01612352],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003965207,"threshold_uncertainty_score":0.01326489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022032736","doi":"10.1142/s0218196707003330","title":"ON POSITIVE THEORIES OF GROUPS WITH REGULAR FREE LENGTH FUNCTIONS","year":2007,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Function (biology); Group (periodic table); Algebra over a field; Discrete mathematics; Pure mathematics; Combinatorics","authors":[{"name":"Bilal Khan","is_ca":false},{"name":"Alexei Myasnikov","is_ca":true},{"name":"Denis Serbin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01073579132989676,"gpt":0.2789840881832381,"spread":0.2682482968533413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001546812,0.0007869723,0.0007474494,0.001811247,0.001450707,0.002286524,0.00121289,0.00113427,0.00357502],"category_scores_gemma":[0.001637888,0.0002950677,0.0007550828,0.001060275,0.005970567,0.006288638,0.002164079,0.001827997,0.0005959541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009767574,"about_ca_system_score_gemma":0.0006368043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004418601,"about_ca_topic_score_gemma":0.0006104317,"domain_scores_codex":[0.9989358,0.0003226342,0.00004483761,0.0001079411,0.0004179092,0.0001708654],"domain_scores_gemma":[0.9990674,0.0004183882,0.0001137876,0.000123727,0.0001591904,0.0001175914],"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.000003903872,0.000005245704,0.00006091159,0.00001807302,0.000001619951,0.00005189806,0.0001214188,0.0004093664,0.0002956492,0.9977386,0.0001632017,0.001130248],"study_design_scores_gemma":[0.000005109758,0.00001338881,0.00005556991,0.00001113658,0.000003587033,0.00006916995,0.00007654991,0.002439062,0.0002510509,0.9948768,0.002192161,0.00000648036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.343344,0.004498282,0.4426453,0.004601181,0.0007234581,0.0001128517,0.0003070957,0.0003684433,0.2033993],"genre_scores_gemma":[0.9441099,0.001307211,0.02909123,0.0006442547,0.0007492568,0.0001363978,0.000181072,0.00008569893,0.023695],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00357502,"threshold_uncertainty_score":0.01195967,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997046888","doi":"10.1142/s0218196707003913","title":"GENERIC COMPLEXITY OF THE CONJUGACY PROBLEM IN HNN-EXTENSIONS AND ALGORITHMIC STRATIFICATION OF MILLER'S GROUPS","year":2007,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Undecidable problem; Conjugacy class; Conjugacy problem; Mathematics; Decidability; Miller; Stratification (seeds); Group (periodic table); Decision problem; Combinatorics; Discrete mathematics; Algorithm","authors":[{"name":"Alexandre Borovik","is_ca":false},{"name":"Alexei Myasnikov","is_ca":true},{"name":"В. Н. Ремесленников","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04876440810557002,"gpt":0.3200468513484381,"spread":0.271282443242868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002204119,0.0005896554,0.0009432233,0.0007535937,0.00202348,0.003769399,0.001953566,0.001277564,0.007626921],"category_scores_gemma":[0.00693142,0.0004753223,0.00187992,0.001334898,0.002604056,0.01093432,0.003218056,0.002602747,0.0004846354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004405322,"about_ca_system_score_gemma":0.002021355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003475766,"about_ca_topic_score_gemma":0.004287605,"domain_scores_codex":[0.9981101,0.0003978487,0.0001638659,0.0005411169,0.0003433106,0.0004438449],"domain_scores_gemma":[0.994378,0.003561444,0.000529577,0.0008436427,0.0002737941,0.0004134167],"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.001459954,0.0005328173,0.01530988,0.0009496865,0.0001528772,0.0009120668,0.002919198,0.08326325,0.01363068,0.8214265,0.008082734,0.05136041],"study_design_scores_gemma":[0.0001192043,0.00006859232,0.002056829,0.00003676665,0.00006310505,0.000282109,0.0005274402,0.0876812,0.00581315,0.8984867,0.004818349,0.00004664053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9026296,0.0003588007,0.07504315,0.002978139,0.00005399364,0.0001801871,0.001011838,0.0006008662,0.01714336],"genre_scores_gemma":[0.9612658,0.0002385021,0.03029381,0.000222497,0.0001020229,0.000149482,0.001955736,0.0001089682,0.005663285],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007626921,"threshold_uncertainty_score":0.03196299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126946720","doi":"10.1142/s0218196708004913","title":"EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM","year":2008,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Variety (cybernetics); Mathematics; Signature (topology); Function (biology); Algebra over a field; Finite-state machine; Discrete mathematics; Pure mathematics; Algorithm","authors":[{"name":"George F. McNulty","is_ca":false},{"name":"ZOLTÁN SZÉKELY","is_ca":false},{"name":"Ross Willard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04422240327387793,"gpt":0.2675585111768122,"spread":0.2233361079029342,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004606077,0.0004561191,0.001085261,0.001788527,0.002260334,0.007136316,0.00235414,0.001999235,0.005387171],"category_scores_gemma":[0.03735701,0.0005849476,0.001521114,0.002314687,0.007447686,0.02232748,0.004488453,0.005552286,0.0006072802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003092957,"about_ca_system_score_gemma":0.0014177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001188278,"about_ca_topic_score_gemma":0.0006785506,"domain_scores_codex":[0.9946994,0.001521113,0.0003418648,0.001299254,0.001531854,0.0006065514],"domain_scores_gemma":[0.9495215,0.04152457,0.001907519,0.003172011,0.002542343,0.001332033],"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.00007194095,0.00004260491,0.001908164,0.00007531678,0.00002032139,0.00008566533,0.0005756805,0.00952247,0.0007578971,0.9742639,0.000987792,0.0116881],"study_design_scores_gemma":[0.000006650325,0.00000861654,0.0003979609,0.000009070804,0.000008409541,0.00006470805,0.00008616495,0.02876346,0.0008607449,0.9688454,0.0009339489,0.00001493505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4614182,0.001263366,0.4855686,0.007879346,0.0001455949,0.000133835,0.0005538028,0.0003631432,0.04267412],"genre_scores_gemma":[0.9550781,0.0003748525,0.03849876,0.0002436427,0.0003290677,0.0001132542,0.0004177017,0.00007864278,0.00486585],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007136316,"threshold_uncertainty_score":0.02435958,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087031200","doi":"10.1142/s0218196713400171","title":"A SUPERCHARACTER TABLE DECOMPOSITION VIA POWER-SUM SYMMETRIC FUNCTIONS","year":2013,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Unipotent; Mathematics; Triangular matrix; Factorization; Noncommutative geometry; Combinatorics; Basis (linear algebra); Symmetric function; Character table; Matrix decomposition; Matrix (chemical analysis); Symmetric group; Discrete mathematics; Pure mathematics; Character (mathematics); Algorithm; Geometry","authors":[{"name":"Nantel Bergeron","is_ca":true},{"name":"Nathaniel Thiem","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01655339035006916,"gpt":0.3075558645255735,"spread":0.2910024741755043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004059194,0.0005249495,0.0006075864,0.001366628,0.0008781641,0.00170583,0.0007401811,0.0005336954,0.00776881],"category_scores_gemma":[0.0005426389,0.0002921754,0.0007128939,0.0005842333,0.001398721,0.001829297,0.001129965,0.001162998,0.001796184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006367008,"about_ca_system_score_gemma":0.0005439993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007074542,"about_ca_topic_score_gemma":0.0007419985,"domain_scores_codex":[0.9996861,0.00004548646,0.00001552492,0.00005511584,0.0001031494,0.00009455399],"domain_scores_gemma":[0.9997204,0.00003881994,0.00002793636,0.0000614228,0.00005975851,0.00009178989],"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.00006158387,0.00006504237,0.0004426214,0.00004211246,0.000009486655,0.0003218853,0.0003202719,0.006570835,0.01014757,0.9641846,0.001997829,0.01583623],"study_design_scores_gemma":[0.00001927809,0.00007238607,0.0003963962,0.00001807629,0.00001204543,0.0002900016,0.0002010707,0.06031948,0.008107993,0.9243941,0.006132041,0.00003716803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5546412,0.0004370467,0.3796316,0.0005484395,0.0005056752,0.0001171549,0.0002981171,0.0006152092,0.06320545],"genre_scores_gemma":[0.9380484,0.0002271771,0.03902352,0.000273936,0.0001939406,0.00008398047,0.0002558766,0.0002746021,0.02161864],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00776881,"threshold_uncertainty_score":0.02598923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027466518","doi":"10.1142/s021819670300150x","title":"CATEGORIES AS ALGEBRA, II","year":2003,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Semidirect product; Morphism; Product (mathematics); Algebra over a field; Variety (cybernetics); Wreath product; Pure mathematics; Enriched category; Monoidal category; Group (periodic table); Functor","authors":[{"name":"Benjamin Steinberg","is_ca":true},{"name":"Bret Tilson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01434129950801473,"gpt":0.2667221476711002,"spread":0.2523808481630855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001405488,0.0004905148,0.0005588234,0.0019509,0.001669829,0.008734321,0.0008741187,0.0009550697,0.009941458],"category_scores_gemma":[0.001720236,0.0002823715,0.0006853075,0.002137957,0.006379117,0.008088407,0.00221263,0.002435138,0.002585899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003507606,"about_ca_system_score_gemma":0.001816071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001976468,"about_ca_topic_score_gemma":0.001536974,"domain_scores_codex":[0.9987079,0.0005615875,0.00006479147,0.0002266776,0.0003196501,0.0001193578],"domain_scores_gemma":[0.9992762,0.0001939193,0.00007331449,0.0001752941,0.0001946416,0.00008666706],"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.000002161778,0.000001715195,0.00005847746,0.00001839012,0.000002097084,0.000008213729,0.0002359027,0.00008043987,0.00006321486,0.9922141,0.003671024,0.003644169],"study_design_scores_gemma":[0.000001873279,0.000005889603,0.0001497832,0.0000320842,0.00000247113,0.00006423756,0.000234069,0.000273411,0.0000533315,0.8683961,0.1307841,0.000002712318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01971735,0.1009669,0.1786947,0.01743471,0.004389792,0.0001230462,0.00142654,0.0006632881,0.6765836],"genre_scores_gemma":[0.676537,0.02911768,0.08382786,0.00588091,0.00407824,0.0005053001,0.001637083,0.0003931313,0.1980229],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009941458,"threshold_uncertainty_score":0.03325748,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079424204","doi":"10.1142/s0218196701000681","title":"A CHARACTERIZATION OF de MORGAN ALGEBRAS","year":2001,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Characterization (materials science); Combinatorics; Set (abstract data type); Ternary operation; Algebra over a field; Type (biology); Discrete mathematics; Pure mathematics; Physics","authors":[{"name":"Janusz Brzozowski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0108663446517115,"gpt":0.2641641481452289,"spread":0.2532978034935174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001393204,0.0005562978,0.0004880858,0.001634561,0.001618693,0.0040356,0.0007721242,0.0007710595,0.00553705],"category_scores_gemma":[0.003389632,0.0004382747,0.0008349196,0.001871345,0.002600207,0.008322828,0.002407462,0.002026188,0.0007030797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001302709,"about_ca_system_score_gemma":0.0008408405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001010073,"about_ca_topic_score_gemma":0.0004857437,"domain_scores_codex":[0.9979633,0.0004325918,0.0001801272,0.0004662788,0.0006751471,0.0002825455],"domain_scores_gemma":[0.9980385,0.0006247166,0.0002486974,0.0002863547,0.0005384051,0.0002635066],"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.00001822996,0.00001360859,0.000184049,0.00002489339,0.000007002985,0.00006183116,0.0002768674,0.0005193687,0.0008973122,0.992978,0.0003833873,0.00463548],"study_design_scores_gemma":[0.00001400852,0.00003366366,0.0002439262,0.00002962874,0.00001677626,0.0003282811,0.0002766657,0.00775488,0.002448763,0.9643298,0.02450358,0.00001989242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.205856,0.002607778,0.6456972,0.002289685,0.0003198944,0.0002210278,0.0006136231,0.0005473925,0.1418473],"genre_scores_gemma":[0.9173212,0.0008768131,0.06754236,0.000450297,0.0002621681,0.0001675967,0.0005261443,0.00008301084,0.01277039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00553705,"threshold_uncertainty_score":0.01852334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987579327","doi":"10.1142/s0218196707004189","title":"MINIMAL SEMIGROUPS GENERATING VARIETIES WITH COMPLEX SUBVARIETY LATTICES","year":2007,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subvariety; Mathematics; Semigroup; Lattice (music); Variety (cybernetics); Pure mathematics; Property (philosophy); Statistics","authors":[{"name":"Edmond W. H. Lee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01865502722225417,"gpt":0.2790667050779938,"spread":0.2604116778557397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005588122,0.0002673546,0.0003576971,0.001134714,0.0008044124,0.002367512,0.0003854671,0.0003230716,0.003345396],"category_scores_gemma":[0.001480512,0.0002619145,0.0005336208,0.0005426813,0.001917369,0.002397618,0.001431138,0.0007067894,0.0003710045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006338394,"about_ca_system_score_gemma":0.0003083654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003289322,"about_ca_topic_score_gemma":0.0003486834,"domain_scores_codex":[0.9995541,0.00008923088,0.00003571968,0.0001164216,0.0001369293,0.00006759238],"domain_scores_gemma":[0.9987865,0.0004619349,0.0001973326,0.0001383198,0.0001462464,0.000269734],"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.00007569296,0.00002508249,0.001166555,0.00003212888,0.000008278762,0.0003202232,0.0007244078,0.001235019,0.007055874,0.9835556,0.0003841444,0.005416961],"study_design_scores_gemma":[0.0000630115,0.00007625228,0.001905395,0.00002024686,0.00001785688,0.0008153778,0.0006216395,0.01349177,0.007537064,0.966388,0.009028505,0.00003474689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8664169,0.0004617843,0.107549,0.000358483,0.000076539,0.00007254429,0.0002438157,0.000229846,0.02459107],"genre_scores_gemma":[0.9773445,0.0001183864,0.01789046,0.00003835922,0.0000606723,0.00005735601,0.0001670172,0.00003101144,0.004292323],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003345396,"threshold_uncertainty_score":0.01119149,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142371518","doi":"10.1142/s0218196712500221","title":"KRONECKER COEFFICIENTS VIA SYMMETRIC FUNCTIONS AND CONSTANT TERM IDENTITIES","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Kronecker delta; Mathematics; Constant (computer programming); Term (time); Computation; Constant coefficients; Work (physics); Symmetric function; Function (biology); Algebra over a field; Pure mathematics; Mathematical analysis; Algorithm; Computer science; Quantum mechanics","authors":[{"name":"Adriano M. Garsia","is_ca":false},{"name":"Nolan R. Wallach","is_ca":false},{"name":"Guoce Xin","is_ca":false},{"name":"Mike Zabrocki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01627476781637522,"gpt":0.24335699623592,"spread":0.2270822284195448,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001792344,0.0006659831,0.0005760127,0.001806956,0.001107863,0.003247909,0.001226444,0.00103559,0.007309086],"category_scores_gemma":[0.004328706,0.0003692459,0.0007363904,0.001499983,0.003337502,0.006418732,0.001980117,0.002337074,0.002134106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001015157,"about_ca_system_score_gemma":0.001195034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00100016,"about_ca_topic_score_gemma":0.0008892362,"domain_scores_codex":[0.9987894,0.0003278722,0.00006979545,0.0001190684,0.0005135698,0.0001803642],"domain_scores_gemma":[0.9987031,0.0004608741,0.0001340911,0.0002661187,0.0003320357,0.0001037406],"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.000003502397,0.000003813873,0.00002651557,0.00001120855,0.00000104118,0.00001846253,0.00004955585,0.0004285433,0.0002176595,0.9970618,0.0003652315,0.001812782],"study_design_scores_gemma":[0.000003164114,0.000006106515,0.00004468677,0.00001139773,0.00000211314,0.00005000539,0.00002525845,0.004654238,0.0003664145,0.9925661,0.002262257,0.000008136699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1548748,0.003527632,0.5739778,0.002379153,0.001178959,0.00009496488,0.0003397718,0.0003527309,0.2632742],"genre_scores_gemma":[0.8428809,0.003524269,0.09717045,0.0007434814,0.0009036381,0.0001204207,0.0002470555,0.0003632624,0.05404643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007309086,"threshold_uncertainty_score":0.02445132,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040684427","doi":"10.1142/s0218196710005650","title":"A PROFINITE APPROACH TO STABLE PAIRS","year":2010,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Aperiodic graph; Mathematics; Decidability; Pure mathematics; Idempotence; Profinite group; Combinatorics; Algebra over a field; Discrete mathematics; Group (periodic table)","authors":[{"name":"Karsten Henckell","is_ca":false},{"name":"John Rhodes","is_ca":false},{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0103393737800693,"gpt":0.2517929097064542,"spread":0.2414535359263849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002903564,0.001103214,0.0006328841,0.002885276,0.00218707,0.003117426,0.001603564,0.001244102,0.01130007],"category_scores_gemma":[0.004249911,0.00079613,0.001829977,0.001330378,0.003909086,0.01026554,0.003642256,0.005198346,0.002679469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001129548,"about_ca_system_score_gemma":0.0006347286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000457326,"about_ca_topic_score_gemma":0.0004068614,"domain_scores_codex":[0.9982207,0.0004211962,0.0001574488,0.0004281326,0.0005888687,0.0001835828],"domain_scores_gemma":[0.9963334,0.002096274,0.0001858323,0.000441049,0.0007127969,0.0002306144],"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.00001465144,0.00002448248,0.00009965934,0.00009416202,0.000006189544,0.0001651113,0.000283421,0.0004448318,0.001474572,0.9850017,0.001155597,0.01123552],"study_design_scores_gemma":[0.000009879714,0.00004521151,0.00009347001,0.00003935258,0.00001520686,0.0004127419,0.00008231905,0.003885793,0.003069155,0.9707182,0.02160376,0.00002480748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01103388,0.001830536,0.9301217,0.001775583,0.0004406299,0.0001073308,0.0002969448,0.0007640292,0.05362936],"genre_scores_gemma":[0.5096229,0.004307759,0.4510483,0.002231378,0.002035984,0.0005662648,0.000706803,0.0004142131,0.02906643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01130007,"threshold_uncertainty_score":0.03780258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045705351","doi":"10.1142/s0218196706003141","title":"FULLY RESIDUALLY FREE GROUPS AND GRAPHS LABELED BY INFINITE WORDS","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Finitely-generated abelian group; Free group; Combinatorics; Group (periodic table); Integer (computer science); Stallings theorem about ends of groups; Limit (mathematics); Discrete mathematics; Representation (politics); Free product; Computer science","authors":[{"name":"Alexei Myasnikov","is_ca":true},{"name":"В. Н. Ремесленников","is_ca":false},{"name":"Denis Serbin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01152538206848925,"gpt":0.2712008804228564,"spread":0.2596754983543672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003752826,0.0002101731,0.000234072,0.000680482,0.0006267315,0.001107579,0.0005028726,0.0003996363,0.002531858],"category_scores_gemma":[0.001029529,0.0001550566,0.0003141263,0.0003802012,0.001865115,0.002712415,0.001157163,0.0005317967,0.0002739796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005330964,"about_ca_system_score_gemma":0.0002942398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006344643,"about_ca_topic_score_gemma":0.0005565088,"domain_scores_codex":[0.9997203,0.00007408593,0.0000166121,0.00007376846,0.00005953909,0.00005564254],"domain_scores_gemma":[0.9994198,0.0001818476,0.0001138685,0.0001147726,0.00008206572,0.00008762335],"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.00003033953,0.00000746035,0.0003634914,0.00001627147,0.00000265072,0.00008730942,0.0004923883,0.0009272248,0.001841928,0.9923855,0.0001671911,0.003678224],"study_design_scores_gemma":[0.00001099001,0.00003654593,0.0003067003,0.00001300053,0.000006701084,0.0001310936,0.0003512326,0.006702551,0.002216491,0.9856446,0.004569768,0.0000103619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8032866,0.0006643402,0.1655202,0.0006871853,0.00006191442,0.00003656151,0.0001403659,0.0003017504,0.02930097],"genre_scores_gemma":[0.9785932,0.0001430716,0.01434473,0.00009034984,0.00004840226,0.00003410578,0.0001401114,0.00002405269,0.006581935],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002531858,"threshold_uncertainty_score":0.00846988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018331071","doi":"10.1142/s0218196704001979","title":"MONOIDS AND COMPUTATIONS","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Computation; Boolean circuit; Algebraic number; Point (geometry); Algebra over a field; Theoretical computer science; Discrete mathematics; Boolean function; Pure mathematics; Computer science; Algorithm","authors":[{"name":"Pascal Tesson","is_ca":true},{"name":"Denis Thérien","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008367005775459506,"gpt":0.2585474552492811,"spread":0.2501804494738216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00179887,0.0005657373,0.0005954471,0.002082089,0.002049202,0.004682605,0.0007651763,0.001506741,0.008235522],"category_scores_gemma":[0.00317344,0.0003508707,0.0007224855,0.001771095,0.007890129,0.009707917,0.003013313,0.003026117,0.001335922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002196776,"about_ca_system_score_gemma":0.0009330044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001583616,"about_ca_topic_score_gemma":0.001235122,"domain_scores_codex":[0.9985594,0.0005775148,0.0001111602,0.0003258167,0.0003135313,0.0001125534],"domain_scores_gemma":[0.9973917,0.001806259,0.0001246206,0.0002559168,0.0002912636,0.000130165],"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.000004167237,0.000002721969,0.00004798845,0.00003884701,0.000002154717,0.00001742262,0.0002126097,0.0001237423,0.0000910278,0.9954258,0.0008193229,0.00321428],"study_design_scores_gemma":[0.000002576973,0.000006743801,0.00008463977,0.00003159136,0.00000262351,0.00006357364,0.00008448243,0.0003239204,0.00009153844,0.9766286,0.02267556,0.000004129045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.05926791,0.1436934,0.2977597,0.03649548,0.003194113,0.0001163626,0.0006574976,0.0005502286,0.4582653],"genre_scores_gemma":[0.8123293,0.04382835,0.08180247,0.005618078,0.00413528,0.0002274224,0.0006161058,0.0002113971,0.05123148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008235522,"threshold_uncertainty_score":0.02755052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974491064","doi":"10.1142/s021819670400189x","title":"ON TORSION IN FACTORS OF POLYNILPOTENT SERIES OF A GROUP WITH A SINGLE RELATION","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Central series; Modulo; Torsion (gastropod); Free group; Nilpotent; Combinatorics; Series (stratigraphy); Group (periodic table); Power series; Pure mathematics; Nilpotent group; Mathematical analysis; Physics","authors":[{"name":"Gupta Rk","is_ca":true},{"name":"N. S. ROMANOVSKI","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02111923075786912,"gpt":0.2776570392732161,"spread":0.2565378085153469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008615346,0.0008181347,0.0008026386,0.002071942,0.00153264,0.002045567,0.0007765926,0.0005630691,0.007196853],"category_scores_gemma":[0.003258921,0.0003615044,0.0007938808,0.001092196,0.003243698,0.004185295,0.00171633,0.001270936,0.001049319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009770255,"about_ca_system_score_gemma":0.0004121189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006137614,"about_ca_topic_score_gemma":0.0006544246,"domain_scores_codex":[0.999331,0.0001312952,0.0000400929,0.0001421406,0.0001684073,0.0001870451],"domain_scores_gemma":[0.9991115,0.0003613677,0.0001391758,0.00007871883,0.0001189175,0.0001903753],"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.0001675982,0.00004875465,0.001311825,0.00009389147,0.00001690417,0.000758195,0.001268578,0.00201811,0.004493877,0.9789137,0.0008501047,0.01005836],"study_design_scores_gemma":[0.00003964966,0.0001283852,0.0006820026,0.00004354123,0.00002378749,0.0006213926,0.0002847469,0.007892007,0.00364835,0.9802583,0.006346384,0.00003132905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8293754,0.001720315,0.1009904,0.0007317511,0.0003575618,0.00007669545,0.0002566088,0.0004433861,0.06604794],"genre_scores_gemma":[0.9764199,0.0005175931,0.01211635,0.0001076233,0.0004051341,0.00005808624,0.000183041,0.0001622848,0.01002993],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007196853,"threshold_uncertainty_score":0.02407587,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055307439","doi":"10.1142/s0218196712500464","title":"GROUP GRADINGS ON FINITARY SIMPLE LIE ALGEBRAS","year":2012,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Finitary; Algebraically closed field; Pure mathematics; Simple (philosophy); Simple Lie group; Abelian group; Lie algebra; Symplectic geometry; Isomorphism (crystallography); Algebra over a field","authors":[{"name":"Yuri Bahturin","is_ca":true},{"name":"Matej Brešar","is_ca":false},{"name":"Mikhail Kochetov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0415236511813588,"gpt":0.3444921501845859,"spread":0.3029684990032271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005697794,0.0005824116,0.0005513797,0.002418578,0.001124685,0.001788984,0.0005644159,0.0004728064,0.002089625],"category_scores_gemma":[0.00131035,0.0003003373,0.0005342507,0.0009634125,0.002621002,0.002567491,0.001358344,0.0007120774,0.0002754682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007610672,"about_ca_system_score_gemma":0.0003039739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007828257,"about_ca_topic_score_gemma":0.0009774733,"domain_scores_codex":[0.9994459,0.00007834631,0.00004127741,0.00009173476,0.0001605152,0.0001823216],"domain_scores_gemma":[0.998929,0.0001711784,0.0002667748,0.0001000907,0.0001558607,0.0003771457],"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.000344879,0.0002435925,0.019085,0.0001196713,0.00006600917,0.0009110898,0.003261197,0.004373634,0.02215931,0.927009,0.0008617437,0.0215649],"study_design_scores_gemma":[0.00009022185,0.0003517715,0.01431584,0.00004884904,0.00006772619,0.0009025829,0.0008982482,0.01167041,0.007572662,0.9606485,0.003361073,0.0000719863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9903101,0.00008303629,0.004558444,0.00006566769,0.00002014452,0.00001526587,0.00003975164,0.00005851349,0.004848915],"genre_scores_gemma":[0.9962793,0.00006791118,0.00124587,0.00001631568,0.00003307562,0.00001048113,0.00007961891,0.00001025888,0.002257111],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002418578,"threshold_uncertainty_score":0.006990492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008543934","doi":"10.1142/s021819671100673x","title":"THE LATTICE OF ALTER EGOS","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Galois connection; Mathematics; Duality (order theory); Lattice (music); Connection (principal bundle); Algebra over a field; Algebraic number; Pure mathematics; Complete lattice; Set (abstract data type); Universal algebra; Discrete mathematics; Computer science; Mathematical analysis","authors":[{"name":"Brian Davey","is_ca":false},{"name":"Jane G. Pitkethly","is_ca":false},{"name":"Ross Willard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02289300412731,"gpt":0.272628341209779,"spread":0.249735337082469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001205296,0.0002876222,0.0004328,0.001818688,0.002204837,0.004968344,0.0006393587,0.000527462,0.004847912],"category_scores_gemma":[0.002637014,0.0003610954,0.0004788474,0.0009062993,0.004168942,0.006510811,0.0038091,0.001402882,0.0007329101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001192454,"about_ca_system_score_gemma":0.0008449809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007997234,"about_ca_topic_score_gemma":0.0006909298,"domain_scores_codex":[0.9979225,0.0005103864,0.0001391235,0.0004064438,0.0007003021,0.0003213291],"domain_scores_gemma":[0.9981161,0.0003653801,0.0002180718,0.0003265447,0.0005100069,0.0004638522],"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.00001937312,0.000009244455,0.0002684029,0.0000113121,0.000003568993,0.0000345571,0.0002323589,0.000308072,0.0004209236,0.9949653,0.0002519283,0.00347509],"study_design_scores_gemma":[0.00001041301,0.00002314744,0.0002889279,0.00001245466,0.000008854945,0.0001612782,0.0003823389,0.00353436,0.0009615782,0.9787406,0.01586017,0.00001585172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5825431,0.001047741,0.2440172,0.002036758,0.0003015098,0.0001165442,0.0007719079,0.0004335244,0.1687317],"genre_scores_gemma":[0.9595411,0.0002905172,0.02340994,0.0001489168,0.0001145934,0.00006716837,0.000291091,0.00005034446,0.01608627],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004968344,"threshold_uncertainty_score":0.01621789,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992217715","doi":"10.1142/s0218196713500343","title":"COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONS","year":2013,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; York University","funders":"","keywords":"Mathematics; Idempotence; Arity; Class (philosophy); Universal algebra; Unary operation; Algebra over a field; Constraint satisfaction problem; Discrete mathematics; Combinatorics; Pure mathematics; Computer science","authors":[{"name":"Jonah Horowitz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02149111599408685,"gpt":0.2859370068847025,"spread":0.2644458908906157,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005790811,0.0006891359,0.001544122,0.001729405,0.002893285,0.006569352,0.003457545,0.002127541,0.009909406],"category_scores_gemma":[0.04204828,0.0009314172,0.002836172,0.001620133,0.003976247,0.01142429,0.004930622,0.004830928,0.0008606637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00326005,"about_ca_system_score_gemma":0.003665942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002879574,"about_ca_topic_score_gemma":0.003203462,"domain_scores_codex":[0.9902357,0.001946523,0.0007834484,0.001611193,0.003720349,0.001702787],"domain_scores_gemma":[0.947975,0.04042802,0.002674865,0.004475039,0.003277279,0.001169677],"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.001552028,0.0003653565,0.01383371,0.0008446687,0.000223172,0.0009259422,0.001016805,0.07657748,0.008795327,0.8054069,0.009746036,0.08071261],"study_design_scores_gemma":[0.0001344251,0.00009035091,0.002297124,0.00008809564,0.00009353115,0.0004637307,0.0006750341,0.2213671,0.01196898,0.7593509,0.003381266,0.00008946365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5106438,0.0007428292,0.4499573,0.007592934,0.0002612004,0.0007279945,0.002586124,0.001937459,0.02555031],"genre_scores_gemma":[0.8685217,0.0004048477,0.1243449,0.0006051017,0.0002388791,0.0002946308,0.002587192,0.0002790272,0.002723701],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009909406,"threshold_uncertainty_score":0.03315032,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979037305","doi":"10.1142/s0218196706003311","title":"THE SEMIGROUP OF CONJUGATES OF A WORD","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Simon Fraser University; Royal Society","keywords":"Mathematics; Semigroup; Conjugacy class; Bicyclic semigroup; Alphabet; Monoid; Word (group theory); Cancellative semigroup; Free monoid; Class (philosophy); Syntactic monoid; Word problem (mathematics education); Combinatorics on words; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Arithmetic; Computer science; Linguistics; Artificial intelligence","authors":[{"name":"Peter M. Higgins","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00472986314400044,"gpt":0.2338154422560715,"spread":0.229085579112071,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008301112,0.0005384096,0.0004583378,0.001151544,0.001679947,0.003356376,0.0005763221,0.0008045526,0.0069687],"category_scores_gemma":[0.002079279,0.000331219,0.0008174537,0.000552391,0.002382209,0.003765353,0.002365005,0.001032699,0.001682891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008318694,"about_ca_system_score_gemma":0.0007226288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002499283,"about_ca_topic_score_gemma":0.0001540331,"domain_scores_codex":[0.9989213,0.0002094564,0.0001003081,0.0003266648,0.0003015632,0.0001408546],"domain_scores_gemma":[0.9984823,0.0004851922,0.0001960888,0.0002344455,0.0002972806,0.0003046774],"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.00006732709,0.00003544506,0.0004435214,0.00004060232,0.000008712502,0.0006226547,0.0007184905,0.0004664627,0.006121605,0.9828075,0.0005661526,0.008101309],"study_design_scores_gemma":[0.00003908369,0.000193958,0.0005604685,0.00003083418,0.00002624445,0.001343458,0.0003556751,0.008949427,0.01122097,0.9449407,0.03229433,0.00004496747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5582774,0.001179137,0.3138367,0.001398778,0.001658996,0.0002393045,0.0004665914,0.0006574283,0.1222856],"genre_scores_gemma":[0.9291016,0.0004817889,0.03562367,0.0003011817,0.0006099227,0.0002000727,0.0002682745,0.0001751882,0.03323826],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0069687,"threshold_uncertainty_score":0.02331263,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035672135","doi":"10.1142/s0218196713500215","title":"CSP DICHOTOMY FOR SPECIAL POLYADS","year":2013,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Conjecture; Homomorphism; Bounded function; Class (philosophy); Discrete mathematics; Constraint satisfaction problem; Unanimity; Computer science","authors":[{"name":"Libor Barto","is_ca":true},{"name":"Jakub Bulín","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01457578811861931,"gpt":0.3106527086433813,"spread":0.296076920524762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001124528,0.0003889624,0.0007849173,0.0008762777,0.001972997,0.004173438,0.001193522,0.001228299,0.008576407],"category_scores_gemma":[0.008262782,0.0005455103,0.001339829,0.001330467,0.002261787,0.007217799,0.002541927,0.005724251,0.0005887665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002198055,"about_ca_system_score_gemma":0.001295534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001766251,"about_ca_topic_score_gemma":0.001568345,"domain_scores_codex":[0.9976427,0.0004470672,0.0001289047,0.0008342252,0.0005144703,0.0004325244],"domain_scores_gemma":[0.9919139,0.00547833,0.0005334742,0.000974455,0.000485845,0.0006139021],"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.0002398652,0.000166638,0.001479923,0.0002006342,0.00003674324,0.0002711628,0.000641477,0.01044011,0.00332251,0.9583949,0.00657671,0.01822932],"study_design_scores_gemma":[0.00005133521,0.0000299818,0.0005415261,0.00002250623,0.0000205802,0.0002475089,0.000228206,0.03412096,0.001495392,0.9573466,0.00587671,0.00001857214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5668229,0.001602459,0.359921,0.009001725,0.0002492155,0.0002372171,0.00345181,0.001718978,0.05699471],"genre_scores_gemma":[0.9538783,0.000462936,0.03590884,0.0008608482,0.0002190628,0.0002585166,0.00167931,0.0001598518,0.00657241],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008576407,"threshold_uncertainty_score":0.02869087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140489090","doi":"10.1142/s0218196711006704","title":"LINEAR ESTIMATES FOR SOLUTIONS OF QUADRATIC EQUATIONS IN FREE GROUPS","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Quadratic equation; Bounded function; Variable (mathematics); Free group; Group (periodic table); Value (mathematics); Combinatorics; Mathematical analysis; Applied mathematics; Statistics; Geometry","authors":[{"name":"Olga Kharlampovich","is_ca":false},{"name":"Alina Vdovina","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1003245134753511,"gpt":0.3431030567158565,"spread":0.2427785432405054,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00186445,0.001536502,0.0007562872,0.003305648,0.001269612,0.001966179,0.001469601,0.001265527,0.009386368],"category_scores_gemma":[0.008600377,0.0005361805,0.0009041719,0.0009494319,0.002406661,0.005067926,0.004169706,0.003023221,0.001255871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002025338,"about_ca_system_score_gemma":0.0007174453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001074192,"about_ca_topic_score_gemma":0.001326137,"domain_scores_codex":[0.9990538,0.0002300752,0.00004096707,0.0001276438,0.0003439355,0.0002036404],"domain_scores_gemma":[0.9950069,0.002619093,0.0006575367,0.0002121214,0.0008535482,0.0006508313],"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.0001317099,0.0000800303,0.001832313,0.0002512317,0.00005212332,0.0002349047,0.0008132669,0.007794429,0.006757076,0.9667576,0.002113129,0.0131823],"study_design_scores_gemma":[0.00005138798,0.0001219711,0.001458238,0.00009642399,0.00005026877,0.0001543635,0.0003284226,0.0902951,0.003803556,0.8989935,0.004584413,0.00006239515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5420885,0.002918733,0.3773363,0.004688611,0.0004931807,0.0001141299,0.0003442909,0.0006780508,0.07133816],"genre_scores_gemma":[0.9154278,0.001230638,0.04463157,0.0005351079,0.000816975,0.0002574478,0.0004462036,0.0003026608,0.03635172],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009386368,"threshold_uncertainty_score":0.0314005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075351895","doi":"10.1142/s0218196700000364","title":"POLYNOMIAL INDEX GROWTH GROUPS","year":2000,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Hebrew University of Jerusalem; University of Alberta; BG Group","keywords":"Mathematics; Polynomial; Exponent; Conjecture; Index (typography); Simple (philosophy); Bounded function; Combinatorics; Order (exchange); Classification of finite simple groups; Constant (computer programming); Pure mathematics; Discrete mathematics; Group of Lie type; Mathematical analysis; Group theory","authors":[{"name":"Antal Balog","is_ca":false},{"name":"László Pyber","is_ca":false},{"name":"Avinoam Mann","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01852455883171622,"gpt":0.3119271486007132,"spread":0.293402589768997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003107222,0.0003390232,0.000341261,0.0007390868,0.0006194108,0.00110709,0.0004830364,0.0003158076,0.00594859],"category_scores_gemma":[0.002123248,0.0001227431,0.0003102406,0.0003911343,0.002000764,0.001829815,0.001433412,0.001095039,0.001067227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006222436,"about_ca_system_score_gemma":0.0002263431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004293538,"about_ca_topic_score_gemma":0.0004016212,"domain_scores_codex":[0.9995858,0.00004886536,0.00001591225,0.00008855078,0.0001657924,0.00009508831],"domain_scores_gemma":[0.9986873,0.0004091721,0.000237903,0.0002453297,0.000182461,0.0002377694],"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.00008288522,0.000022691,0.001314203,0.000049072,0.000009049282,0.0002735602,0.0005358721,0.002949559,0.01015986,0.9742472,0.0006293893,0.009726763],"study_design_scores_gemma":[0.0000221407,0.0001043163,0.001411844,0.0000134952,0.00001399623,0.000379909,0.0001870953,0.01561496,0.01013044,0.9609491,0.01115443,0.00001826909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7991955,0.0005285899,0.1068793,0.001050996,0.0001122053,0.00004730864,0.0002838971,0.0003781262,0.09152409],"genre_scores_gemma":[0.9850237,0.0001271113,0.006121119,0.00004346117,0.0000680694,0.00001354222,0.0001099643,0.00002021226,0.008472675],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00594859,"threshold_uncertainty_score":0.01990008,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2563565570","doi":"10.1142/s0218196717500242","title":"A family of formulas with reversal of high avoidability index","year":2017,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Bounded function; Index (typography); Simple (philosophy); Combinatorics; Discrete mathematics; Mathematical analysis; Computer science","authors":[{"name":"James D. Currie","is_ca":true},{"name":"Lucas Mol","is_ca":true},{"name":"Narad Rampersad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01253582447417215,"gpt":0.2722826038183138,"spread":0.2597467793441416,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006536476,0.0006117183,0.0005648973,0.001431635,0.001480259,0.001261489,0.0009486466,0.0007495661,0.004160839],"category_scores_gemma":[0.004325739,0.0003651109,0.0009732475,0.0007258325,0.001741395,0.002017072,0.0008736161,0.001618718,0.0004976711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001156359,"about_ca_system_score_gemma":0.0006196162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001334611,"about_ca_topic_score_gemma":0.001162251,"domain_scores_codex":[0.9992836,0.00009314505,0.00006157451,0.0001597743,0.0002656603,0.0001362333],"domain_scores_gemma":[0.9975454,0.0009593294,0.0003084243,0.0003384398,0.0006701853,0.0001781487],"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.0008652282,0.0002341515,0.01321406,0.0005192287,0.0001340197,0.01119947,0.001707881,0.006508942,0.07499212,0.7901872,0.007450301,0.0929874],"study_design_scores_gemma":[0.0003387824,0.0003073354,0.00798887,0.0001318577,0.0002472384,0.009740528,0.0007110834,0.05558259,0.04823002,0.8281752,0.04832343,0.000223068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7081127,0.001341397,0.2434443,0.001338533,0.000234635,0.0001201761,0.0007860879,0.001900311,0.0427218],"genre_scores_gemma":[0.9300854,0.0003273672,0.05766591,0.0003712706,0.0001267303,0.0001274129,0.000793784,0.0002724698,0.01022955],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004160839,"threshold_uncertainty_score":0.01391941,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037840685","doi":"10.1142/s0218196706003177","title":"COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Semigroup; Type (biology); Pure mathematics; Discrete mathematics; Algebra over a field","authors":[{"name":"John Rhodes","is_ca":false},{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02678779521546516,"gpt":0.2609105961594294,"spread":0.2341228009439643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001361381,0.0005806922,0.001003584,0.001332449,0.002266017,0.003604788,0.0008569346,0.001076889,0.00638846],"category_scores_gemma":[0.005012843,0.000453593,0.001251416,0.0009496518,0.006480369,0.01185199,0.004280598,0.00345652,0.0006215693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001119314,"about_ca_system_score_gemma":0.0005526387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005906299,"about_ca_topic_score_gemma":0.0003913114,"domain_scores_codex":[0.9983206,0.0002466516,0.0001215764,0.0004428552,0.000511685,0.000356455],"domain_scores_gemma":[0.9924783,0.003769572,0.0007176478,0.001316694,0.0005836809,0.001134132],"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.0001339859,0.00003072749,0.001690324,0.00007468065,0.00001460364,0.0002439031,0.0007940285,0.001148085,0.002893354,0.9866219,0.000859458,0.005494892],"study_design_scores_gemma":[0.00006119864,0.0001356804,0.001970966,0.00002653104,0.00003686018,0.000457309,0.000698461,0.006311911,0.005989643,0.977053,0.00721273,0.00004568903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7102164,0.001186937,0.1903871,0.002621203,0.0003720274,0.0001176381,0.0003647451,0.0007054629,0.09402856],"genre_scores_gemma":[0.9839802,0.0002310051,0.008031934,0.0001641541,0.0001888633,0.0001005214,0.0001567189,0.00006046777,0.007086207],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00638846,"threshold_uncertainty_score":0.02137148,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009981653","doi":"10.1142/s0218196706002913","title":"NILPOTENT LINEAR SEMIGROUPS","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Vrije Universiteit Brussel","keywords":"Mathematics; Semigroup; Nilpotent; Pure mathematics; Nilpotent group; Generator (circuit theory); Finitely-generated abelian group; Bicyclic semigroup; Associative property; Special classes of semigroups; Locally nilpotent; Cancellative semigroup; Discrete mathematics; Type (biology); Algebra over a field","authors":[{"name":"Eric Jespers","is_ca":false},{"name":"David M. Riley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02247522680363738,"gpt":0.3256685299822861,"spread":0.3031933031786487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005893043,0.0002821035,0.0003097039,0.001008585,0.0007863719,0.001080737,0.0004378567,0.0002813296,0.004313287],"category_scores_gemma":[0.001383811,0.0001255247,0.0003287077,0.0003142851,0.001510281,0.001547784,0.001627996,0.0006020583,0.000681412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004864376,"about_ca_system_score_gemma":0.0003620835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001349643,"about_ca_topic_score_gemma":0.0001602514,"domain_scores_codex":[0.9994209,0.0001232988,0.00003727382,0.0001249434,0.0001937544,0.00009990013],"domain_scores_gemma":[0.9990294,0.000274648,0.00020805,0.00008606948,0.0002308082,0.0001710477],"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.00002799804,0.00001578046,0.0006044894,0.00005207131,0.000007123317,0.0003551638,0.0008632846,0.0007061982,0.007759292,0.9830063,0.0002998069,0.006302495],"study_design_scores_gemma":[0.00001815153,0.00007408202,0.0005313876,0.00002051024,0.000009157399,0.0006348853,0.0005668325,0.00843549,0.008616647,0.9722755,0.008801397,0.0000160716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7583178,0.000781819,0.1746707,0.0005533186,0.0001212773,0.00008616999,0.0002229593,0.0003273758,0.0649186],"genre_scores_gemma":[0.9736965,0.0002146436,0.01548391,0.00009082931,0.0001248771,0.0000819456,0.0001552256,0.00002143358,0.01013061],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004313287,"threshold_uncertainty_score":0.01442939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978172160","doi":"10.1142/s0218196713400122","title":"TABLEAUX FORMULAS FOR MACDONALD POLYNOMIALS","year":2013,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Macdonald polynomials; Koornwinder polynomials; Algebra over a field; Combinatorics; Pure mathematics; Work (physics); Orthogonal polynomials; Difference polynomials","authors":[{"name":"François Bergeron","is_ca":true},{"name":"Mark Haiman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03291276098670139,"gpt":0.3462712943777053,"spread":0.3133585333910039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000662531,0.0006744714,0.0005345991,0.001353353,0.000847326,0.002110008,0.001176325,0.000754056,0.006803377],"category_scores_gemma":[0.002210716,0.000313687,0.0007571699,0.0009234123,0.001521501,0.003097935,0.0009045476,0.001810521,0.00172363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00122346,"about_ca_system_score_gemma":0.0006169616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009222425,"about_ca_topic_score_gemma":0.001546395,"domain_scores_codex":[0.9995543,0.00008719929,0.0000285661,0.00005499412,0.0001968129,0.00007799271],"domain_scores_gemma":[0.9995304,0.0001763666,0.00004972921,0.00006096124,0.0001324707,0.00005010959],"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.000007592633,0.00001034926,0.00007355114,0.00004628256,0.000002522553,0.0001297342,0.0001814499,0.000808074,0.001626035,0.9907844,0.0006626759,0.005667338],"study_design_scores_gemma":[0.00001587974,0.00002174597,0.0001726423,0.00003426933,0.000009141152,0.0003538649,0.0000789882,0.01634355,0.003707436,0.9668384,0.01239136,0.00003266471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2780322,0.003223028,0.533363,0.001414351,0.001005576,0.0001884151,0.0006691449,0.001161179,0.1809431],"genre_scores_gemma":[0.851198,0.001917338,0.1011794,0.0006850089,0.0005789071,0.0001730857,0.0003678586,0.0005806268,0.04331987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006803377,"threshold_uncertainty_score":0.0227595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053694103","doi":"10.1142/s0218196708004688","title":"H-POLYNOMIALS AND ROOK POLYNOMIALS","year":2008,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Monoid; Macdonald polynomials; Combinatorics; Polynomial; Difference polynomials; Algebra over a field; Orthogonal polynomials; Discrete mathematics; Pure mathematics","authors":[{"name":"Mahir Bilen Can","is_ca":false},{"name":"Lex E. Renner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04353300645693595,"gpt":0.3332269725437086,"spread":0.2896939660867727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004780935,0.0003713587,0.0003020896,0.001443629,0.000780899,0.001019461,0.0005487909,0.0003063727,0.008893255],"category_scores_gemma":[0.002071805,0.0001485526,0.0004070544,0.0009192168,0.001809987,0.002975595,0.001519699,0.001089409,0.001565676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004692493,"about_ca_system_score_gemma":0.0003968145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009739849,"about_ca_topic_score_gemma":0.001188167,"domain_scores_codex":[0.9995931,0.00009095921,0.0000143422,0.00007928346,0.0001228798,0.00009955515],"domain_scores_gemma":[0.9993713,0.0002472604,0.00008481504,0.0001087785,0.0001096797,0.00007806392],"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.0001000257,0.00003143007,0.001285312,0.0001107169,0.00001442623,0.0001750024,0.0003428166,0.005022559,0.003896349,0.9368328,0.001492047,0.05069663],"study_design_scores_gemma":[0.00001912498,0.00008306577,0.001622087,0.00003247354,0.00001222237,0.0003097703,0.000279093,0.01090387,0.008035915,0.9638373,0.01481391,0.00005113397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4686331,0.002337401,0.439205,0.0009216489,0.0004102574,0.0001029792,0.0004766114,0.0008585135,0.08705442],"genre_scores_gemma":[0.9376593,0.0007627482,0.05052581,0.0001833905,0.0002374889,0.0000218913,0.0001987032,0.0001049876,0.01030572],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008893255,"threshold_uncertainty_score":0.02975088,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3176795680","doi":"10.1142/s0218196723500236","title":"Chordal graphs, higher independence and vertex decomposable complexes","year":2023,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Science and Engineering Research Board; Infosys Foundation; Department of Atomic Energy, Government of India; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Mathematics; Combinatorics; Chordal graph; Vertex (graph theory); Discrete mathematics; Simplicial complex; Graph","authors":[{"name":"Fred M. Abdelmalek","is_ca":true},{"name":"Priyavrat Deshpande","is_ca":false},{"name":"Shuchita Goyal","is_ca":false},{"name":"Amit Roy","is_ca":false},{"name":"Anurag K. Singh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04290915741864221,"gpt":0.3551525866719172,"spread":0.312243429253275,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003258693,0.0004253669,0.000341819,0.001235596,0.0009796666,0.001565567,0.0006054346,0.0003600584,0.004401318],"category_scores_gemma":[0.001387791,0.0002267409,0.0004469378,0.0007328225,0.002170561,0.002982317,0.001826538,0.001338979,0.0004510423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001010445,"about_ca_system_score_gemma":0.0002815242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000971162,"about_ca_topic_score_gemma":0.0008577053,"domain_scores_codex":[0.9996056,0.00005529408,0.00001867451,0.0001024351,0.0001473207,0.00007075728],"domain_scores_gemma":[0.9990228,0.0003131092,0.0001813425,0.0001208806,0.0001138457,0.0002479283],"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.00002984923,0.00001801268,0.0004551557,0.00003248165,0.00000529442,0.0001967845,0.0002672644,0.001364678,0.002057726,0.9890531,0.0005729379,0.005946699],"study_design_scores_gemma":[0.000008870456,0.00001628477,0.0005640342,0.0000117297,0.000006892992,0.0003282818,0.0001766449,0.00726986,0.002590365,0.9813091,0.007704241,0.00001375034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6755084,0.001311599,0.2130899,0.0008904036,0.0001333655,0.00008980202,0.0004028745,0.0002887869,0.1082849],"genre_scores_gemma":[0.9749411,0.0004177783,0.01623045,0.0001184985,0.00005516812,0.00004156785,0.0002543617,0.00004918617,0.007891812],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004401318,"threshold_uncertainty_score":0.0147239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033885916","doi":"10.1142/s0218196704001992","title":"PROFINITE TOPOLOGIES IN FREE PRODUCTS OF GROUPS","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Profinite group; Free product; Separable space; Quotient; Finitely-generated abelian group; Combinatorics; Topological group; Normal subgroup; Class (philosophy); Product (mathematics); Group (periodic table); Discrete mathematics; Pure mathematics; Topology (electrical circuits); Computer science","authors":[{"name":"Luis Ribes","is_ca":true},{"name":"Pavel Zalesskii","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01198601468043132,"gpt":0.2587075825680769,"spread":0.2467215678876456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001730045,0.0005835173,0.0005289365,0.001658634,0.00147533,0.004681327,0.0005799803,0.000795476,0.00506319],"category_scores_gemma":[0.002908509,0.0006039111,0.0007445528,0.001099989,0.003862608,0.01093398,0.002901807,0.001149354,0.0007998645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000880587,"about_ca_system_score_gemma":0.0003556101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000385019,"about_ca_topic_score_gemma":0.0003526531,"domain_scores_codex":[0.998673,0.0003711475,0.0001221744,0.0003192694,0.0003236422,0.0001907723],"domain_scores_gemma":[0.9975164,0.001127351,0.00032073,0.0002763684,0.0002641311,0.0004951071],"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.00007806526,0.00001656816,0.0004959839,0.00005293854,0.000008446983,0.0002597611,0.00167999,0.0005687083,0.001459533,0.9902559,0.0003622326,0.004762095],"study_design_scores_gemma":[0.00002971901,0.00006187238,0.0004672691,0.00002227565,0.00001317316,0.0003966025,0.0005289851,0.002739838,0.001466495,0.9813887,0.01286909,0.00001595481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7835842,0.00404817,0.1296042,0.001999309,0.0003148026,0.00009085955,0.0006196743,0.0004885757,0.07925014],"genre_scores_gemma":[0.9722334,0.0006144287,0.01688051,0.0001396871,0.000217477,0.00009090306,0.0003468858,0.00005936073,0.009417382],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00506319,"threshold_uncertainty_score":0.01693803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063858816","doi":"10.1142/s021819670400202x","title":"ON SEMIGROUPS WHOSE IDEMPOTENT-GENERATED SUBSEMIGROUP IS APERIODIC","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Centro de Matemática Universidade do Porto; Fundação para a Ciência e a Tecnologia","keywords":"Mathematics; Idempotence; Aperiodic graph; Semigroup; Wreath product; Iterated function; Combinatorics; Pure mathematics; Product (mathematics); Discrete mathematics; Geometry; Mathematical analysis","authors":[{"name":"Manuel Delgado","is_ca":false},{"name":"Vítor H. Fernandes","is_ca":false},{"name":"Stuart Margolis","is_ca":false},{"name":"Benjamin Steinberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009276668163932947,"gpt":0.2518130665495769,"spread":0.242536398385644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001109871,0.0005417087,0.0004377317,0.0009680497,0.001096838,0.001473956,0.0005704511,0.0004911085,0.002251071],"category_scores_gemma":[0.002918753,0.0003199476,0.000681438,0.0005511291,0.00298557,0.003014991,0.001536058,0.000871729,0.0007325553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006118125,"about_ca_system_score_gemma":0.0003689433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003881127,"about_ca_topic_score_gemma":0.0003990344,"domain_scores_codex":[0.9992093,0.0001432932,0.00006690317,0.0001836185,0.0002334393,0.0001633185],"domain_scores_gemma":[0.9970348,0.001237555,0.0006139509,0.0003742792,0.0003650498,0.0003743216],"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.000174533,0.00007910907,0.002082701,0.0001491544,0.00001764019,0.001337966,0.002617182,0.004175436,0.01835631,0.950591,0.0004219644,0.01999699],"study_design_scores_gemma":[0.00004259832,0.0003753673,0.001953464,0.00005465306,0.00002911321,0.001057584,0.0006436662,0.02645526,0.01648939,0.9421444,0.01070334,0.00005113739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7035862,0.0008849864,0.2676135,0.0002310969,0.0001277694,0.00006571515,0.0001238434,0.0002822068,0.02708477],"genre_scores_gemma":[0.9569407,0.0005513265,0.03350903,0.00006287055,0.0001435111,0.00006998736,0.0002076441,0.00006500759,0.008449981],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002251071,"threshold_uncertainty_score":0.00753057,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074624422","doi":"10.1142/s0218196705002141","title":"ON COMMUTATOR LENGTH OF CERTAIN CLASSES OF SOLVABLE GROUPS","year":2005,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Alzahra University; University of Alberta","keywords":"Mathematics; Commutator subgroup; Solvable group; Nilpotent group; Commutator; Nilpotent; Combinatorics; Rank (graph theory); Abelian group; Group (periodic table); Generator (circuit theory); Finite group; Corollary; Fitting subgroup; Normal subgroup; Subgroup; Discrete mathematics; Pure mathematics; Algebra over a field","authors":[{"name":"Mehri Akhavan-Malayeri","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04320609756760472,"gpt":0.3594686922316018,"spread":0.316262594663997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001929519,0.0003409159,0.0006296653,0.001639066,0.001292475,0.001990796,0.0007403349,0.0007455521,0.007371147],"category_scores_gemma":[0.007062855,0.0002564552,0.0006364329,0.0007498405,0.002177038,0.002960054,0.001517397,0.001031584,0.0004265078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001550774,"about_ca_system_score_gemma":0.0005998911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005750054,"about_ca_topic_score_gemma":0.0007579452,"domain_scores_codex":[0.998684,0.0002771559,0.00008450473,0.0002424638,0.0003404381,0.000371377],"domain_scores_gemma":[0.992574,0.004862181,0.001040484,0.0004294346,0.0003677233,0.0007260893],"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.0008328519,0.0002775925,0.01573088,0.0002618284,0.00006587568,0.0005593701,0.002792864,0.004851748,0.01807524,0.9304007,0.001911245,0.02423981],"study_design_scores_gemma":[0.0001658438,0.0003055887,0.006745263,0.00007213596,0.00005962974,0.0005620203,0.0006593416,0.04045844,0.0137037,0.9326227,0.004585794,0.00005962565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.968564,0.0003376898,0.0133572,0.0005154014,0.00002440789,0.00002967645,0.0001692335,0.0001265236,0.01687586],"genre_scores_gemma":[0.9937102,0.0001348504,0.00343043,0.00006104986,0.00007684978,0.000063382,0.0002205349,0.00003536659,0.002267449],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007371147,"threshold_uncertainty_score":0.02465898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1868260886","doi":"10.1142/s0218196715500265","title":"Existence of finite bases for quasi-equations of unary algebras with 0","year":2015,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Unary operation; Mathematics; Subalgebra; Ideal (ethics); Algebra over a field; Pure mathematics; Function (biology); Discrete mathematics","authors":[{"name":"David Casperson","is_ca":true},{"name":"Jennifer Hyndman","is_ca":true},{"name":"John Mason","is_ca":true},{"name":"J. B. Nation","is_ca":false},{"name":"B. Schaan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04309291382230111,"gpt":0.3062677646055899,"spread":0.2631748507832887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002385966,0.0005312873,0.0008420512,0.001382293,0.00142013,0.003343184,0.001390982,0.0007163863,0.003865377],"category_scores_gemma":[0.005489626,0.0007721396,0.001547224,0.0008314319,0.002697577,0.004021269,0.001835597,0.002383454,0.001077862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001364423,"about_ca_system_score_gemma":0.001823028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001396946,"about_ca_topic_score_gemma":0.001844754,"domain_scores_codex":[0.998192,0.0004378578,0.0001729771,0.0003126221,0.000487569,0.0003969315],"domain_scores_gemma":[0.995885,0.001650147,0.000399951,0.0003915442,0.001059338,0.0006140529],"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.00005959877,0.00006978482,0.000578883,0.00007245092,0.00002302809,0.00009336727,0.0004863087,0.0006110584,0.004274461,0.9850535,0.0005978241,0.008079717],"study_design_scores_gemma":[0.00005614568,0.00005981603,0.0005355969,0.00004818327,0.00002692841,0.0001411085,0.0002032057,0.006854343,0.005987257,0.9823962,0.003647326,0.00004380494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4630035,0.001157808,0.5055457,0.0007540603,0.0003089332,0.0002193148,0.0009328743,0.0005418501,0.02753605],"genre_scores_gemma":[0.8268898,0.0004464669,0.1602726,0.0003333843,0.0002911231,0.0002962174,0.001291232,0.0001946072,0.009984695],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003865377,"threshold_uncertainty_score":0.01293105,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036486445","doi":"10.1142/s0218196705002323","title":"HOW FINITE IS A THREE-ELEMENT UNARY ALGEBRA?","year":2005,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Unary operation; Mathematics; Duality (order theory); Connection (principal bundle); Class (philosophy); Element (criminal law); Rank (graph theory); Algebra over a field; Pure mathematics; Discrete mathematics; Combinatorics; Geometry; Computer science","authors":[{"name":"Jennifer Hyndman","is_ca":true},{"name":"Jane G. Pitkethly","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01619479617438863,"gpt":0.2693054178421257,"spread":0.2531106216677371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001862257,0.0002969387,0.0004850985,0.0008815238,0.001628563,0.005093991,0.0008627376,0.001218386,0.00444892],"category_scores_gemma":[0.004019919,0.0001969548,0.0008764902,0.0007721595,0.006971991,0.0109177,0.001734386,0.001709256,0.001051042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008881158,"about_ca_system_score_gemma":0.0006219794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001316231,"about_ca_topic_score_gemma":0.0007043331,"domain_scores_codex":[0.9989812,0.0002741807,0.00006906989,0.0002273248,0.000245024,0.0002031769],"domain_scores_gemma":[0.9982943,0.000816621,0.0001724343,0.000254358,0.0002581254,0.0002041741],"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.00001205194,0.000006760262,0.0002041016,0.00001983528,0.000005198425,0.00004638638,0.0003344368,0.00022507,0.0004075307,0.9955919,0.0002159338,0.002930688],"study_design_scores_gemma":[0.000003414181,0.00001248706,0.0001132619,0.00001637465,0.000008155854,0.0001195386,0.0002436381,0.001060778,0.0007154477,0.9938292,0.003866949,0.00001085006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3772221,0.003605568,0.4620749,0.008628979,0.0005931396,0.00006970477,0.0003643627,0.0005429019,0.1468984],"genre_scores_gemma":[0.9741566,0.0005166588,0.01980236,0.0005512265,0.0001007334,0.00002480317,0.0001012279,0.00003653832,0.004709913],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005093991,"threshold_uncertainty_score":0.0148831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104755092","doi":"10.1142/s0218196705002463","title":"UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS","year":2005,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Alphabet; Set (abstract data type); Word (group theory); Automaton; Discrete mathematics; Finite set; Set theory; Theoretical computer science; Computer science; Linguistics","authors":[{"name":"Jason P. Bell","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00804054867491937,"gpt":0.2612491853130127,"spread":0.2532086366380933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002554264,0.0006164725,0.0008378333,0.002004261,0.001675236,0.00246013,0.001994557,0.001012796,0.004850162],"category_scores_gemma":[0.02097143,0.0008680286,0.001242561,0.001382537,0.004391444,0.008632124,0.003351084,0.002310483,0.0004939549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001231554,"about_ca_system_score_gemma":0.0007244536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002612932,"about_ca_topic_score_gemma":0.0002898393,"domain_scores_codex":[0.9963224,0.0006565638,0.0003876361,0.0009090665,0.001266505,0.0004578434],"domain_scores_gemma":[0.9602569,0.027573,0.002895315,0.004850595,0.002533519,0.001890783],"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.000301882,0.00006794187,0.003961666,0.0002501393,0.00006407443,0.0003637919,0.0009629014,0.01075485,0.01203605,0.9569945,0.00105773,0.01318445],"study_design_scores_gemma":[0.00003165988,0.0001236317,0.002647711,0.00006121452,0.00005027965,0.0007949792,0.000361995,0.04273479,0.01108391,0.9366792,0.005370392,0.00006020263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6079125,0.001019193,0.3699156,0.0006780347,0.0001312091,0.00007975821,0.0008642448,0.0005708928,0.01882848],"genre_scores_gemma":[0.931856,0.0005010078,0.06126189,0.0002290268,0.0003735918,0.0003103154,0.000864307,0.0002024954,0.004401299],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004850162,"threshold_uncertainty_score":0.01622534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986453029","doi":"10.1142/s0218196715500162","title":"Time complexity of the conjugacy problem in relatively hyperbolic groups","year":2015,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Conjugacy class; Mathematics; Conjugacy problem; Hyperbolic group; Relatively hyperbolic group; Polynomial; Group (periodic table); Element (criminal law); Hyperbolic manifold; Time complexity; Bounded function; Hyperbolic function; Pure mathematics; Combinatorics; Mathematical analysis","authors":[{"name":"Inna Bumagin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07059615617374809,"gpt":0.3197716730652511,"spread":0.249175516891503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002470342,0.001347306,0.002500615,0.0009409094,0.00247326,0.006149535,0.003889631,0.002745245,0.01423415],"category_scores_gemma":[0.01485744,0.0008291553,0.002168796,0.002573989,0.002073281,0.01226721,0.003721329,0.002744305,0.00210435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003227227,"about_ca_system_score_gemma":0.004366559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007045314,"about_ca_topic_score_gemma":0.007170806,"domain_scores_codex":[0.9947371,0.001059569,0.0004017865,0.001501822,0.0009895439,0.001310175],"domain_scores_gemma":[0.9809939,0.01454173,0.001076491,0.00196395,0.0006240737,0.0007998536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.008808476,0.00154309,0.0212858,0.00315223,0.0007831618,0.001828112,0.003687378,0.3321063,0.0399599,0.2517207,0.05508307,0.2800417],"study_design_scores_gemma":[0.001055194,0.0003220433,0.002557873,0.00006484266,0.0003308318,0.000595983,0.0008412249,0.5961215,0.01054792,0.3808936,0.00658728,0.00008167244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.763455,0.001619153,0.1868332,0.009451057,0.0002829438,0.0005922056,0.00498548,0.003601717,0.02917922],"genre_scores_gemma":[0.8854634,0.0006869742,0.09557594,0.0006609843,0.0002669197,0.0004166612,0.006435864,0.0007440273,0.009749194],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01423415,"threshold_uncertainty_score":0.04761797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}