{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003389106,0.0001043828,0.0001643177,0.0002697112,0.00003765041,0.0001355481,0.0005467817,0.00004121897,0.00001096743],"category_scores_gemma":[0.00002722594,0.00008736652,0.00008551822,0.0001012913,0.0000336424,0.0007133456,0.0001083021,0.0001107291,0.000007217191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004830077,"about_ca_system_score_gemma":0.00003342123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000295502,"about_ca_topic_score_gemma":0.000001217678,"domain_scores_codex":[0.9987248,0.00005888066,0.000464335,0.0001433591,0.0005044935,0.0001041166],"domain_scores_gemma":[0.9989542,0.000167622,0.0004402192,0.0001025496,0.0002760836,0.00005926716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007457103,0.0002060423,0.0002508739,0.000009534238,0.0001394363,0.00003640293,0.001228403,0.004955966,0.003304305,0.7239259,0.00115597,0.2647126],"study_design_scores_gemma":[0.003025405,0.0007013214,0.01843213,0.0003279762,0.00002946632,0.0009249175,0.0001160108,0.6227397,0.008381891,0.342912,0.002058112,0.000351157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6408274,0.0001174547,0.3561606,0.002099011,0.0004937038,0.00002936854,0.000001690866,0.00002215338,0.0002485196],"genre_scores_gemma":[0.9751537,0.00003989147,0.02368766,0.0007789836,0.0003155497,8.080965e-7,0.000003240071,0.000006574133,0.00001361],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6177837,"threshold_uncertainty_score":0.3562703,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008401753,0.0000877479,0.0001853994,0.00007979319,0.00005962948,0.00002430665,0.0003603251,0.00004478676,0.000005586071],"category_scores_gemma":[0.0005155163,0.0000525962,0.0001154479,0.00008559419,0.0001303763,0.0001426964,0.00006624686,0.0001358655,3.476957e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004286779,"about_ca_system_score_gemma":0.00005304744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002570914,"about_ca_topic_score_gemma":0.000006184022,"domain_scores_codex":[0.9984241,0.00005501023,0.0007164008,0.0000634498,0.0006509266,0.00009007666],"domain_scores_gemma":[0.9967842,0.001149661,0.0011343,0.0001080233,0.0007908682,0.00003291879],"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.0003270944,0.0002677799,0.001944294,0.00008787368,0.000499316,0.00001332253,0.003886746,0.0003083112,0.009305886,0.9641088,0.0007778933,0.01847269],"study_design_scores_gemma":[0.0007235477,0.0001033505,0.003725422,0.0001943005,0.00004900794,0.0001446399,0.0004781299,0.0004538615,0.0222758,0.9715445,0.0002470274,0.0000604295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9072538,0.0001878628,0.09078462,0.0004136747,0.0009194606,0.00009875354,0.00000191948,0.000004687043,0.0003352385],"genre_scores_gemma":[0.9944282,0.00003580498,0.005300839,0.0000272632,0.0001413834,3.031259e-7,4.052519e-7,0.00001003265,0.00005572912],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08717446,"threshold_uncertainty_score":0.2144811,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001672348,0.00006764202,0.0001087002,0.0001265594,0.00006083825,0.0000617854,0.000436702,0.00002047791,0.000009821109],"category_scores_gemma":[0.00005171297,0.00004565755,0.00006285431,0.00009062862,0.0001013261,0.0004442495,0.00003361728,0.0001129403,0.000003443213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002037158,"about_ca_system_score_gemma":0.00003169125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.459046e-7,"about_ca_topic_score_gemma":2.034603e-7,"domain_scores_codex":[0.9991506,0.00004977693,0.000295979,0.00008469215,0.0003498283,0.00006907008],"domain_scores_gemma":[0.999047,0.0001967498,0.0003428756,0.00007140239,0.0003040287,0.00003793908],"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.00001887904,0.00007036714,0.00003811118,9.135228e-7,0.00002512899,0.00001051165,0.0001724434,0.001488993,0.0003985481,0.9814778,0.0002572506,0.01604104],"study_design_scores_gemma":[0.0003244134,0.0002988103,0.02786759,0.00003385733,0.000004292369,0.0001055406,0.00002956435,0.01095327,0.0007621691,0.9595235,0.00004762482,0.00004940194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.574016,0.00009819144,0.4086106,0.01630421,0.000444953,0.0000544228,0.000003339635,0.00001325431,0.0004550294],"genre_scores_gemma":[0.9934506,0.00002305025,0.004726863,0.001688639,0.00009873844,4.099641e-7,0.000002175036,0.000001713139,0.000007774279],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4194346,"threshold_uncertainty_score":0.1861861,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005051017,0.00008696827,0.0001594878,0.0002296277,0.00009341472,0.0001478538,0.0002580167,0.00003108686,0.00001005608],"category_scores_gemma":[0.0001147703,0.00006445596,0.0000674379,0.0001305677,0.0006641918,0.0005626209,0.0001095724,0.0001492012,8.976081e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003346166,"about_ca_system_score_gemma":0.00004613833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008854696,"about_ca_topic_score_gemma":0.00002681841,"domain_scores_codex":[0.9987114,0.0001477345,0.000452467,0.0001216597,0.0004710334,0.00009567237],"domain_scores_gemma":[0.9983196,0.0007226407,0.0004562711,0.0000769326,0.0003829214,0.00004167718],"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.0002436872,0.00005309426,0.004279794,0.000007038529,0.0001082486,0.00001074616,0.0006378638,0.003376781,0.001461652,0.9100031,0.00006072467,0.07975733],"study_design_scores_gemma":[0.002543076,0.0001022196,0.1628608,0.00002978184,0.00001444254,0.0001565054,0.00008174794,0.1206077,0.0005866674,0.7128932,0.00003657303,0.00008738854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3581145,0.0001083238,0.6395515,0.001786241,0.0002434559,0.00007794075,0.000006097001,0.000007626364,0.0001042385],"genre_scores_gemma":[0.988479,0.00002301439,0.01125906,0.00009015464,0.0001322002,0.000001749864,0.00000412164,0.000004050481,0.000006621727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6303645,"threshold_uncertainty_score":0.2628438,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004011136,0.00009462811,0.0001615298,0.0002227047,0.0000375925,0.00007348861,0.000774243,0.00003838892,0.00002179476],"category_scores_gemma":[0.00004762127,0.00008203304,0.0000795404,0.0001089168,0.00004008922,0.0008180003,0.0002271901,0.00009363253,0.00000183006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002277699,"about_ca_system_score_gemma":0.00005007836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001792076,"about_ca_topic_score_gemma":0.000001192645,"domain_scores_codex":[0.9988157,0.00006808317,0.0004683778,0.0001284552,0.0004261648,0.00009327224],"domain_scores_gemma":[0.9989042,0.0001030769,0.0005085789,0.0001289365,0.00030039,0.00005484767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003386153,0.0009080849,0.008951004,0.0000666015,0.0009329773,0.0004447791,0.01450054,0.002418571,0.03302903,0.4555389,0.004020097,0.4788508],"study_design_scores_gemma":[0.00302246,0.0006407399,0.1155439,0.0002442787,0.00003592039,0.000689483,0.0001846321,0.5826117,0.005639523,0.2910185,0.00009855119,0.000270245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6925459,0.0002060671,0.3061979,0.0002128139,0.0006025168,0.00003153914,0.000003157671,0.00002026422,0.000179856],"genre_scores_gemma":[0.9434476,0.00004583637,0.05614133,0.0001972714,0.0001527445,8.033316e-7,0.000002775298,0.000006012384,0.000005611387],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5801932,"threshold_uncertainty_score":0.334521,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004529223,0.0001383845,0.0002314357,0.0002377517,0.00008199774,0.0001229795,0.0002451815,0.00006369637,0.00001557018],"category_scores_gemma":[0.0004000215,0.0001251741,0.0001079819,0.00008197198,0.00007099404,0.0005313435,0.00005301193,0.000191136,0.000009020054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001468367,"about_ca_system_score_gemma":0.0001219541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.540887e-7,"about_ca_topic_score_gemma":0.00001091089,"domain_scores_codex":[0.9983959,0.00005417972,0.0005853901,0.0001531412,0.0006269698,0.0001844122],"domain_scores_gemma":[0.9977759,0.0004817137,0.0003743197,0.00006761774,0.001179223,0.0001212207],"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.0009159155,0.0004869676,0.0006974004,0.00006730121,0.0006528585,0.00007319758,0.001455392,0.001693155,0.03862405,0.1547646,0.004540536,0.7960286],"study_design_scores_gemma":[0.01025336,0.001105666,0.00402222,0.0004842115,0.0001432732,0.001414612,0.0007537539,0.05515644,0.1024638,0.8176743,0.005811019,0.0007173357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7591081,0.0001807037,0.238339,0.001640847,0.0003693287,0.0001756805,0.00001470423,0.00001745901,0.0001541623],"genre_scores_gemma":[0.971253,0.00008186726,0.02776669,0.0002218968,0.0006090889,0.000006844407,0.000007140373,0.00002348801,0.00002996861],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7953113,"threshold_uncertainty_score":0.5104454,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002270072,0.00006000537,0.00008181755,0.0001354041,0.00004349542,0.0002674564,0.0002713691,0.00002881371,0.0000111288],"category_scores_gemma":[0.000032353,0.00005001501,0.00002875746,0.00004848667,0.00004922915,0.0005834221,0.00008535377,0.0001306527,0.000002487629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006105644,"about_ca_system_score_gemma":0.00002837448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002401405,"about_ca_topic_score_gemma":0.000001480367,"domain_scores_codex":[0.9993984,0.00001936764,0.0002008447,0.00009244958,0.000228974,0.00005995866],"domain_scores_gemma":[0.9994397,0.00009631213,0.0001659909,0.00004700878,0.000192003,0.00005898747],"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.0000216525,0.00005368618,0.001761945,0.000004627444,0.00006402525,0.00005827559,0.001546485,0.00003485107,0.0128259,0.2776012,0.0003005906,0.7057268],"study_design_scores_gemma":[0.00205762,0.0003796896,0.1000338,0.00006446809,0.00002347023,0.005055394,0.0003486079,0.133627,0.003913956,0.75056,0.003596141,0.0003398824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8163926,0.0001504126,0.1796518,0.002455132,0.001036422,0.00001887839,6.904008e-7,0.0000153586,0.0002787193],"genre_scores_gemma":[0.9762048,0.00003529988,0.02304301,0.0005253511,0.0001766928,3.402255e-7,9.426988e-7,0.000002995959,0.00001062415],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7053869,"threshold_uncertainty_score":0.2579089,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003222463,0.00009996588,0.0001422765,0.0001048215,0.0001739214,0.00006887478,0.0001911316,0.00004055153,0.000007559007],"category_scores_gemma":[0.0002348177,0.00006077995,0.00008660987,0.0001439955,0.0001085962,0.0001739849,0.00004577151,0.0001661076,6.900077e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003075234,"about_ca_system_score_gemma":0.00005005833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001204866,"about_ca_topic_score_gemma":0.000004468551,"domain_scores_codex":[0.9989287,0.0001112569,0.0004456274,0.00009116893,0.0003226147,0.0001006689],"domain_scores_gemma":[0.998279,0.0007380494,0.0004735143,0.00008404723,0.0003769355,0.00004848404],"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.0001459141,0.0003651724,0.01073704,0.00006552074,0.000491608,0.00001408521,0.001860981,0.00133325,0.006528676,0.9432044,0.001333935,0.0339194],"study_design_scores_gemma":[0.0007925186,0.0001125438,0.009823174,0.00006350486,0.00006403241,0.0002633754,0.0003517456,0.0009501096,0.006069307,0.9811631,0.0002552469,0.00009130443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9574621,0.0007027337,0.03997831,0.0008618251,0.000491458,0.00008310388,0.000002777782,0.000005773102,0.0004118842],"genre_scores_gemma":[0.9960632,0.0001541856,0.003540676,0.00008899395,0.00007066003,0.000001876762,7.826141e-7,0.00000987212,0.00006977064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03860104,"threshold_uncertainty_score":0.2478534,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003754261,0.00007721133,0.0000991179,0.00004659214,0.00008748824,0.0001612061,0.000646313,0.00002746508,0.00000685281],"category_scores_gemma":[0.00001570987,0.00004371741,0.00007603339,0.0001226956,0.0000721013,0.0002833022,0.0001201819,0.00010272,6.269218e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002599607,"about_ca_system_score_gemma":0.00004496843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007129233,"about_ca_topic_score_gemma":0.000005070896,"domain_scores_codex":[0.9989063,0.00009479594,0.0003696198,0.00008977067,0.0004636039,0.0000759734],"domain_scores_gemma":[0.998993,0.0001449991,0.0004139541,0.00008938665,0.0003396672,0.00001895966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001588894,0.0005254154,0.008891813,0.00002702864,0.0006020037,0.00002225085,0.00470157,0.03011586,0.03291823,0.7181113,0.05906182,0.1448638],"study_design_scores_gemma":[0.003238899,0.0003609306,0.1061863,0.0001802936,0.00007949906,0.0007185233,0.0005146829,0.4457545,0.0580782,0.3775025,0.006992365,0.0003932163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6080452,0.000493778,0.3874446,0.003163848,0.0006362079,0.00005072243,0.000005240814,0.000009298306,0.0001511183],"genre_scores_gemma":[0.9976676,0.00002790309,0.001663228,0.0004045792,0.0001402735,9.916298e-7,0.000004544648,0.000003504272,0.00008739925],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4156387,"threshold_uncertainty_score":0.1782744,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002311239,0.00007825513,0.0001495107,0.0002569876,0.00004450321,0.00005938288,0.0001238617,0.00004167453,0.00001136007],"category_scores_gemma":[0.00009829389,0.00006844757,0.00007035185,0.00009122018,0.00002885211,0.0001707783,0.00001646586,0.00007222853,6.225126e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002833984,"about_ca_system_score_gemma":0.00003822058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004815064,"about_ca_topic_score_gemma":0.000001426327,"domain_scores_codex":[0.9991476,0.00001504457,0.0003860375,0.0000871501,0.0002671619,0.00009700881],"domain_scores_gemma":[0.998638,0.0003034784,0.00039436,0.00002241779,0.0006093968,0.00003234797],"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.0001232805,0.0004188329,0.001192454,0.00006915004,0.0003709341,0.00005379443,0.0008703241,0.001424527,0.0003921295,0.2254568,0.002458693,0.7671691],"study_design_scores_gemma":[0.001365629,0.0001842999,0.001005081,0.00005039508,0.00003999918,0.0002979944,0.0004224101,0.0231491,0.0005978745,0.9724208,0.0003636382,0.0001028553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.384249,0.00008766972,0.6147527,0.000370378,0.0003367205,0.00005859889,0.00000463757,0.000009308623,0.0001309315],"genre_scores_gemma":[0.9256434,0.000008203569,0.07365374,0.00004921705,0.0005479556,0.000002826315,0.000009229567,0.000009569055,0.00007583557],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7670662,"threshold_uncertainty_score":0.2791211,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002717672,0.0001081714,0.0001450153,0.0001504721,0.00006192189,0.0001931524,0.0005815866,0.00004252774,0.00003300722],"category_scores_gemma":[0.00002313048,0.00009484461,0.00006006302,0.0001086058,0.00004667695,0.0007181111,0.0001171515,0.0001161524,0.00000752216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002855394,"about_ca_system_score_gemma":0.00003805663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002502749,"about_ca_topic_score_gemma":0.000001352307,"domain_scores_codex":[0.9989263,0.00006568473,0.0003821641,0.0001427593,0.0003674889,0.0001155334],"domain_scores_gemma":[0.9990091,0.00008666966,0.000331338,0.00007802503,0.0004158141,0.00007909429],"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.0002535207,0.0006479445,0.005132785,0.00002169337,0.0008024128,0.0002846533,0.01136875,0.0005643959,0.01736042,0.4595378,0.03459983,0.4694258],"study_design_scores_gemma":[0.002984677,0.001100811,0.03904299,0.00009953245,0.00005627291,0.001916786,0.0006245541,0.2628793,0.02202051,0.6614323,0.007128976,0.0007133531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3831728,0.0003167592,0.615191,0.0003554529,0.0005408568,0.00002870696,0.000003716173,0.00003272739,0.0003580721],"genre_scores_gemma":[0.9813482,0.0000640975,0.01779838,0.0006199143,0.0001262071,9.692287e-7,0.00001156923,0.000006897558,0.00002372961],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5981755,"threshold_uncertainty_score":0.3867651,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004479862,0.0001263751,0.0003743128,0.000606653,0.00002967656,0.0000195705,0.0002410066,0.00008297333,0.00008668636],"category_scores_gemma":[0.0002460658,0.0001104084,0.0001145269,0.000229098,0.00009248139,0.0002279811,0.00005718211,0.0001464093,0.000003474801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003502388,"about_ca_system_score_gemma":0.00007899053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001118483,"about_ca_topic_score_gemma":0.00000646317,"domain_scores_codex":[0.9982874,0.00007906298,0.0009246862,0.0001182,0.0004724373,0.0001181807],"domain_scores_gemma":[0.9975681,0.0004895023,0.001001213,0.0000716982,0.0008067926,0.00006270217],"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.002702106,0.00431053,0.01913155,0.0005113549,0.004505593,0.0006754455,0.01458966,0.01364461,0.01908611,0.5058036,0.02224816,0.3927913],"study_design_scores_gemma":[0.01801222,0.002938081,0.1385087,0.0008261955,0.000609369,0.002950912,0.002865204,0.03904134,0.03966904,0.752035,0.001514219,0.00102981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9450018,0.000195968,0.0526457,0.001306241,0.000505338,0.00006990771,0.00001634875,0.000008889333,0.0002497458],"genre_scores_gemma":[0.9845687,0.00004981412,0.01472802,0.0001109712,0.0004562199,0.000001092754,0.00001565369,0.0000126791,0.0000568561],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3917615,"threshold_uncertainty_score":0.4502323,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002630656,0.00009396018,0.0001469262,0.0002000583,0.0000904861,0.0001420136,0.0004912802,0.00004391437,0.000008610984],"category_scores_gemma":[0.00006964948,0.0000834139,0.00007224559,0.0001199719,0.00005650958,0.0005739284,0.00007667537,0.0001298987,0.00000464301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003347487,"about_ca_system_score_gemma":0.00009729691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004906969,"about_ca_topic_score_gemma":4.08668e-7,"domain_scores_codex":[0.9988485,0.00007012273,0.0003384076,0.0001247288,0.0005256294,0.00009264298],"domain_scores_gemma":[0.9987527,0.0002255673,0.0003987022,0.0000771995,0.0004809567,0.00006487976],"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.0004612912,0.0007956272,0.02087302,0.00003649305,0.0004435275,0.001466491,0.004010419,0.008425876,0.0009073213,0.8197653,0.007106255,0.1357083],"study_design_scores_gemma":[0.004971451,0.0007135316,0.1320991,0.0002052301,0.000028353,0.002140453,0.0002829642,0.2956951,0.002327277,0.5584704,0.002596621,0.0004694859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4685681,0.000189243,0.5270657,0.001666881,0.002172977,0.00003301236,0.000001634238,0.00003402235,0.0002684266],"genre_scores_gemma":[0.9904706,0.00003485703,0.008594949,0.0005620539,0.0003175462,8.196673e-7,0.000003119584,0.000005387884,0.00001064634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5219025,"threshold_uncertainty_score":0.340152,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004933639,0.00008037644,0.0001395558,0.0002607676,0.00004680512,0.0003908044,0.0002788808,0.00003735544,0.000001289612],"category_scores_gemma":[0.00003899206,0.00006895597,0.00004851566,0.0001011857,0.0000120861,0.000767681,0.00002245565,0.00007000974,0.000001207966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007004935,"about_ca_system_score_gemma":0.00006327384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003524896,"about_ca_topic_score_gemma":0.000001325652,"domain_scores_codex":[0.9989624,0.00003632934,0.000436085,0.0001277207,0.0003455113,0.00009193771],"domain_scores_gemma":[0.9990992,0.0001422196,0.0002741985,0.00004826629,0.0003936037,0.00004254479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001985369,0.0001169735,0.0003588887,0.00000955675,0.00003120009,0.00004097138,0.001413481,0.01551996,0.001013356,0.0891314,0.000407539,0.8917581],"study_design_scores_gemma":[0.002129358,0.0005025954,0.009835095,0.000370834,0.000007066616,0.0005392336,0.0001199023,0.8327572,0.0002814325,0.1529477,0.0003635583,0.0001460039],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3123116,0.000236461,0.6859769,0.0007745665,0.0005318479,0.0001044469,0.000002461956,0.00001317375,0.00004848015],"genre_scores_gemma":[0.937106,0.00003363111,0.06259216,0.000165163,0.00008941122,0.000002570134,0.000004836206,0.000003068558,0.000003152239],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8916121,"threshold_uncertainty_score":0.3768536,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010741,0.00007763465,0.0001264812,0.0002469872,0.00004798236,0.00007050511,0.0001281881,0.00003704348,0.000004286659],"category_scores_gemma":[0.000325412,0.00005492714,0.00002107408,0.0001583812,0.0001637206,0.0001408902,0.00004463482,0.0001240727,0.000001158706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003169342,"about_ca_system_score_gemma":0.0000316291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003784758,"about_ca_topic_score_gemma":0.000006806804,"domain_scores_codex":[0.9988983,0.00004631309,0.0005488794,0.00009429104,0.0002893041,0.0001229171],"domain_scores_gemma":[0.9987373,0.0003923474,0.0004072713,0.000038954,0.0003841657,0.00004000596],"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.0005642835,0.0003917117,0.04264612,0.000088398,0.0004958899,0.0002141332,0.003620549,0.0001574147,0.001545942,0.6802056,0.002319576,0.2677503],"study_design_scores_gemma":[0.002254061,0.0002460537,0.1102873,0.0001181301,0.00003011239,0.0004132944,0.001563021,0.001102515,0.0009464633,0.8816447,0.001256406,0.0001379646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9856921,0.0002992302,0.01061269,0.002840749,0.0002256845,0.0001102525,7.202112e-7,0.000006865379,0.0002117398],"genre_scores_gemma":[0.9939842,0.0001233554,0.005643019,0.00006459637,0.0001233321,6.654033e-7,0.000001931782,0.000006296456,0.00005259773],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2676123,"threshold_uncertainty_score":0.2239864,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004562787,0.00006990897,0.0001165675,0.00007733065,0.00007883997,0.0002303101,0.0003088571,0.00002015318,0.000001252305],"category_scores_gemma":[0.0001057186,0.00004571656,0.0000355637,0.00009066043,0.00004793967,0.0004041207,0.00006057987,0.0001006207,0.00000184465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003196663,"about_ca_system_score_gemma":0.00003446869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003332989,"about_ca_topic_score_gemma":8.679955e-7,"domain_scores_codex":[0.9991818,0.00005573879,0.0002703064,0.0001185424,0.0002940077,0.00007957144],"domain_scores_gemma":[0.9992629,0.0001909745,0.0001926416,0.00006104781,0.000232358,0.00006005453],"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.0001913755,0.0000523915,0.0006265351,0.000002705769,0.00004354355,0.00002211906,0.0018247,0.002161696,0.0003356175,0.3938316,0.0001522425,0.6007555],"study_design_scores_gemma":[0.0016811,0.000261764,0.06436408,0.00003744925,0.0000113417,0.0003625318,0.00006378398,0.04438382,0.0001191894,0.8878348,0.0007667845,0.000113283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4579617,0.000268178,0.5298866,0.01131325,0.0003241421,0.00005971513,2.912382e-7,0.0000117774,0.0001742686],"genre_scores_gemma":[0.9731986,0.00003570603,0.02447761,0.002126228,0.0001525607,5.533095e-7,4.779512e-7,0.000001765909,0.000006506621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6006421,"threshold_uncertainty_score":0.2220886,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004156814,0.00009265287,0.0001909522,0.0004320554,0.00002981954,0.00006626932,0.0002239312,0.00007630406,0.00004812556],"category_scores_gemma":[0.0004240512,0.00008195436,0.00003475733,0.0001217263,0.00008793653,0.0001914376,0.00008584187,0.0002972402,0.000001245126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001576009,"about_ca_system_score_gemma":0.00004300458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001529602,"about_ca_topic_score_gemma":0.00006126324,"domain_scores_codex":[0.9989898,0.00004631612,0.0004366048,0.00010853,0.000317677,0.0001010514],"domain_scores_gemma":[0.9988537,0.0004799879,0.0003130989,0.00006263278,0.0002248616,0.00006568548],"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.0004672885,0.0005858232,0.03822173,0.00005963602,0.0003597145,0.000460239,0.00474165,0.0001999246,0.00533372,0.8272607,0.00385245,0.1184571],"study_design_scores_gemma":[0.002289308,0.0001683655,0.1270716,0.00004830859,0.00002134971,0.0007262214,0.0003304635,0.002308315,0.0002108406,0.866504,0.0002034239,0.0001177191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.980262,0.0001004517,0.01605136,0.002431363,0.0007408416,0.00005590333,0.00000343229,0.00001165566,0.0003429423],"genre_scores_gemma":[0.9862829,0.00002689499,0.01330901,0.0001217955,0.0002150567,0.000001042714,0.000002681238,0.000008125545,0.00003243396],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1183393,"threshold_uncertainty_score":0.3342002,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003181077,0.0000875547,0.0002157736,0.0002307882,0.00002040033,0.00001291169,0.0001742486,0.00005549351,0.00002319781],"category_scores_gemma":[0.0001236974,0.00007449275,0.00008522639,0.00008322957,0.00007888085,0.0001282851,0.00003141979,0.000101746,3.313554e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004052388,"about_ca_system_score_gemma":0.00005844631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001366794,"about_ca_topic_score_gemma":0.000002281619,"domain_scores_codex":[0.9987857,0.00002597177,0.0005343035,0.00007223348,0.0005065287,0.00007526484],"domain_scores_gemma":[0.9980925,0.0004487537,0.0007205965,0.00004982763,0.0006429208,0.00004541776],"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.0003008565,0.000090302,0.0003988285,0.00001634296,0.0001717383,0.0000171279,0.0008988034,0.000237859,0.0005385019,0.9890517,0.0001547406,0.008123212],"study_design_scores_gemma":[0.0009567293,0.0003812179,0.004112248,0.00007461583,0.00003511512,0.0000598645,0.000277834,0.0003234515,0.007578444,0.9861169,0.00002289837,0.00006063208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9429328,0.0000571666,0.05555449,0.0001437644,0.000942195,0.0000437653,0.000002432571,0.000006036934,0.0003173316],"genre_scores_gemma":[0.9966549,0.00001270535,0.003147136,0.00003097082,0.0001309946,1.265975e-7,0.00000194951,0.000007965882,0.00001330122],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05372203,"threshold_uncertainty_score":0.3037726,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003902689,0.00007793625,0.0001535484,0.0003406306,0.00003735782,0.00001739358,0.0001325861,0.00004013735,0.00003097714],"category_scores_gemma":[0.0002674175,0.00005735711,0.00005045477,0.0001269432,0.00009789903,0.0001020397,0.00002588074,0.0001163607,0.00000120612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002952244,"about_ca_system_score_gemma":0.00002920546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003972089,"about_ca_topic_score_gemma":0.000006831023,"domain_scores_codex":[0.9991024,0.00003307637,0.000338952,0.00007547997,0.0003717541,0.00007840119],"domain_scores_gemma":[0.9980935,0.0008390754,0.0004148613,0.00005498342,0.0005562267,0.00004139507],"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.0006219175,0.0001959896,0.001029826,0.000008856036,0.000344002,0.00004738238,0.0006950523,0.0001399286,0.0001025188,0.9792588,0.0005486938,0.01700699],"study_design_scores_gemma":[0.001241146,0.0009353741,0.02073929,0.00008298811,0.00005234337,0.0003734501,0.001202896,0.00007594959,0.001070198,0.9741113,0.00004220414,0.00007288427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7293782,0.0000494091,0.2683353,0.0004554188,0.000267234,0.00004519518,0.000005284218,0.000005965956,0.001458004],"genre_scores_gemma":[0.9945607,0.000008149223,0.005124029,0.00006966938,0.0001472425,4.947822e-7,0.000003723646,0.00000695943,0.00007900272],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2651825,"threshold_uncertainty_score":0.2338955,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005606131,0.00007154136,0.0001934738,0.0002849527,0.0000277935,0.00001110158,0.0001397171,0.00004573525,0.00001154078],"category_scores_gemma":[0.0001462397,0.00005288286,0.00004901924,0.000211953,0.0001959544,0.0001005232,0.00004529419,0.0001157516,1.472282e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002496515,"about_ca_system_score_gemma":0.00004436223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003234566,"about_ca_topic_score_gemma":0.00002881642,"domain_scores_codex":[0.9988186,0.00005782292,0.0006763609,0.00008189739,0.0002892841,0.00007604591],"domain_scores_gemma":[0.9984087,0.0003331355,0.0007294579,0.00005265748,0.0004435853,0.00003247935],"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.0002716928,0.0007773822,0.033131,0.0001431203,0.000347528,0.00002109664,0.004082653,0.0006463125,0.01042893,0.8371934,0.0003283217,0.1126285],"study_design_scores_gemma":[0.001054802,0.00014214,0.3657953,0.00009861279,0.00002994388,0.0002255064,0.0008726276,0.002778871,0.00167186,0.6272442,0.00001741464,0.00006871737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9508747,0.0001943058,0.04771921,0.0007413306,0.0002109372,0.0001063239,0.000003999479,0.000002633617,0.0001465575],"genre_scores_gemma":[0.9817652,0.00004620882,0.01808364,0.00003429638,0.0000548522,5.47594e-7,0.00000224238,0.000004552866,0.000008435392],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3326643,"threshold_uncertainty_score":0.2156501,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003533385,0.00008773961,0.0001393012,0.0001315703,0.00009294955,0.00005884573,0.0007216245,0.00003343766,0.00001997278],"category_scores_gemma":[0.00006990088,0.00006318977,0.00009089421,0.0001645731,0.0001822264,0.0005200636,0.0001572012,0.0001286056,0.000002748473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003210193,"about_ca_system_score_gemma":0.0001202814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008692124,"about_ca_topic_score_gemma":0.000001847627,"domain_scores_codex":[0.9985828,0.0001006735,0.0004549345,0.0001139044,0.0006596102,0.00008810229],"domain_scores_gemma":[0.9985175,0.000233698,0.000568134,0.00009527004,0.0005386823,0.00004676915],"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.0000552421,0.0001857536,0.004764925,0.00001554168,0.0001926195,0.00003180797,0.002880746,0.005786574,0.001092195,0.9525483,0.0006041524,0.0318422],"study_design_scores_gemma":[0.0009762024,0.000148017,0.08171263,0.0001117568,0.00001426682,0.0008395058,0.00007421819,0.1135614,0.002152755,0.8000589,0.0002121315,0.0001381612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4994945,0.0001469057,0.4953125,0.003722034,0.0006828959,0.00006808079,0.000004226296,0.00001643682,0.0005524849],"genre_scores_gemma":[0.9792928,0.00002009466,0.02015565,0.0003700028,0.0001281123,8.901483e-7,0.000002898514,0.000004181695,0.00002538878],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4797983,"threshold_uncertainty_score":0.2576804,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001673351,0.0001191634,0.0001963908,0.000325339,0.00006306589,0.00013788,0.0001670465,0.00005714331,0.0001180286],"category_scores_gemma":[0.0002106364,0.0001058714,0.00007427931,0.0001788579,0.00002847936,0.0007718308,0.00004924946,0.0001683283,0.00004048839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000100789,"about_ca_system_score_gemma":0.00003118286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008262329,"about_ca_topic_score_gemma":6.547922e-7,"domain_scores_codex":[0.9987421,0.00004921657,0.0005361701,0.0001047261,0.0004501196,0.0001176395],"domain_scores_gemma":[0.9979289,0.0004274373,0.0004135142,0.00006680662,0.001078853,0.00008446461],"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.0005119972,0.003700521,0.004549554,0.0002562706,0.002371001,0.0002156288,0.006035444,0.001370842,0.04145859,0.6962423,0.02220926,0.2210786],"study_design_scores_gemma":[0.0009434956,0.0002400617,0.003249942,0.00009018094,0.00004841572,0.000673015,0.0002219207,0.007275463,0.0006483542,0.9861547,0.0003064427,0.0001479611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6404455,0.00004376166,0.3571749,0.0007193261,0.001141207,0.0001096471,0.000002246388,0.00002073471,0.0003426218],"genre_scores_gemma":[0.9767415,0.00001821936,0.02280804,0.00009471997,0.0002351179,0.00000675371,0.00000899356,0.00001710786,0.00006953366],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.336296,"threshold_uncertainty_score":0.4317311,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000344831,0.00009235319,0.0001297472,0.0001605345,0.0001004687,0.0002591984,0.000363703,0.00004164659,0.00001721534],"category_scores_gemma":[0.00007811264,0.00007617784,0.0000642639,0.0001147772,0.00003542341,0.0006044109,0.00006601484,0.0001021183,0.00001626782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003508032,"about_ca_system_score_gemma":0.0001035406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001800221,"about_ca_topic_score_gemma":0.000002529056,"domain_scores_codex":[0.9989193,0.00007039168,0.00033951,0.0001303354,0.0004310409,0.0001093869],"domain_scores_gemma":[0.9989824,0.00006323453,0.0003124914,0.00006721612,0.0004977543,0.00007692075],"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.000009309842,0.00005695678,0.0008559839,0.000003558706,0.00007761566,0.00005530649,0.001309932,0.0001810242,0.00009199746,0.9542648,0.0003908556,0.04270267],"study_design_scores_gemma":[0.0009847307,0.0005211148,0.002455808,0.00001223409,0.00001484011,0.001952254,0.0002659746,0.004018311,0.001988683,0.9634129,0.02417879,0.0001943139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.166792,0.0006084813,0.8253537,0.001024086,0.002391233,0.00006009473,1.899232e-7,0.00003054925,0.003739617],"genre_scores_gemma":[0.9945978,0.00003734281,0.004759976,0.000256306,0.0001745636,0.000001248551,0.000001543321,0.000004642451,0.0001665882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8278058,"threshold_uncertainty_score":0.3106442,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001878587,0.00007540073,0.0001296265,0.0002079001,0.0000292159,0.00006790571,0.0003662179,0.00003436342,0.000008018345],"category_scores_gemma":[0.00003941933,0.00006794893,0.00005184274,0.0001616015,0.00003123609,0.0007181166,0.00006283299,0.00008175258,0.000001945987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003440998,"about_ca_system_score_gemma":0.00006295615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000262075,"about_ca_topic_score_gemma":5.056506e-7,"domain_scores_codex":[0.999098,0.00004266637,0.0003617293,0.00009929822,0.0003064706,0.00009182104],"domain_scores_gemma":[0.9989511,0.00005712694,0.0004379861,0.00005865467,0.0004345647,0.00006051272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001762978,0.0003448907,0.0239361,0.00001985843,0.000244133,0.0002591377,0.003651454,0.002048187,0.1978801,0.2341252,0.00006810469,0.5372465],"study_design_scores_gemma":[0.002922717,0.0008332505,0.4369838,0.0002178587,0.00004467808,0.004182128,0.0002129245,0.09399676,0.03921157,0.41934,0.001613319,0.0004409711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5103461,0.00003719534,0.4886667,0.0006342904,0.0002181377,0.00001982418,5.263878e-7,0.000008761253,0.00006850529],"genre_scores_gemma":[0.9844895,0.0001490476,0.01489633,0.0002881058,0.000150619,6.312478e-7,0.000004129621,0.000004532308,0.00001711702],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5368056,"threshold_uncertainty_score":0.2770877,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004224707,0.0001128534,0.0001385442,0.0001559315,0.00009700662,0.0002361278,0.0003823517,0.00003674567,0.000005025097],"category_scores_gemma":[0.00002871786,0.00008828599,0.00004433199,0.0001319117,0.00006162908,0.0006630963,0.00008725789,0.0001358057,0.000001532762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003103644,"about_ca_system_score_gemma":0.00004979297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004723177,"about_ca_topic_score_gemma":0.000007272017,"domain_scores_codex":[0.9987944,0.00003319533,0.0003808173,0.0001546532,0.0004944433,0.0001424282],"domain_scores_gemma":[0.9987453,0.0001809565,0.0004015186,0.00006224381,0.0005280589,0.00008188175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0007802121,0.0004328393,0.0448782,0.00004189465,0.0007324194,0.0008458824,0.008787017,0.03522382,0.01923313,0.4780099,0.0007848581,0.4102498],"study_design_scores_gemma":[0.005925443,0.003055156,0.50473,0.0002325283,0.00009278236,0.006845622,0.002034806,0.326183,0.007539533,0.1388415,0.003374879,0.001144679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4188344,0.00009563921,0.5802925,0.0003715006,0.0002254092,0.0000237918,4.054233e-7,0.00001454503,0.0001418499],"genre_scores_gemma":[0.8215675,0.00001555758,0.1776716,0.0004432556,0.0002792423,3.938425e-7,0.000003574723,0.000005138296,0.00001368762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4598519,"threshold_uncertainty_score":0.3600198,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001600353,0.00007493965,0.00009428328,0.0005748462,0.00007244135,0.0001974153,0.0002234157,0.00002734174,0.00002135327],"category_scores_gemma":[0.00001746158,0.00006547561,0.00004754255,0.0002097719,0.00006906357,0.0009969617,0.00007155607,0.00008083576,0.000009435294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001687243,"about_ca_system_score_gemma":0.00002960464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003950109,"about_ca_topic_score_gemma":6.898243e-7,"domain_scores_codex":[0.9991134,0.00002650324,0.0003510266,0.0000886054,0.0003422554,0.00007824932],"domain_scores_gemma":[0.9991149,0.00004483857,0.0002855656,0.00004846157,0.0004341328,0.00007212469],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00009686523,0.0002917273,0.01567841,0.00001999328,0.0003579717,0.00008479963,0.007311923,0.00009758373,0.0003344328,0.3784624,0.0006685384,0.5965954],"study_design_scores_gemma":[0.006317344,0.001587661,0.422094,0.0002816393,0.0001370924,0.007851069,0.002738683,0.2573142,0.001923177,0.2971524,0.001692498,0.0009102025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3466776,0.0001403135,0.6506829,0.0001196265,0.0007322748,0.00003047134,0.000001596202,0.00001188197,0.001603342],"genre_scores_gemma":[0.99386,0.00007508042,0.005847628,0.0001526285,0.00004044882,7.950525e-7,0.000002470259,0.000002672534,0.00001827548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6471824,"threshold_uncertainty_score":0.2670018,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003676996,0.00006749656,0.00009210326,0.0001968343,0.00003788949,0.0002416212,0.0004906846,0.00002888395,0.000005013787],"category_scores_gemma":[0.00004427283,0.00005635913,0.00003967392,0.00011886,0.00001831751,0.0005398307,0.0001037681,0.0001454161,0.000007128688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001272135,"about_ca_system_score_gemma":0.00004710991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004299786,"about_ca_topic_score_gemma":7.314142e-7,"domain_scores_codex":[0.9991961,0.00002624326,0.000238583,0.0001175546,0.0003346662,0.00008684103],"domain_scores_gemma":[0.9992812,0.00006999845,0.0001640787,0.00007076579,0.0003259946,0.00008800122],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006386173,0.0003122376,0.001592692,0.00001189591,0.000135338,0.00004293508,0.003276993,0.002123578,0.01239952,0.5669824,0.002127202,0.4109313],"study_design_scores_gemma":[0.002463693,0.0005912811,0.06099759,0.000119261,0.00002677891,0.00244007,0.0005051948,0.546223,0.006869798,0.3692866,0.009878741,0.0005979333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3926823,0.00002099709,0.6045505,0.001009796,0.0007743485,0.00003916348,7.975332e-7,0.00001877209,0.0009032906],"genre_scores_gemma":[0.8855762,0.000003775478,0.1137166,0.0004782634,0.000191607,0.00000157816,0.000001600876,0.000003850672,0.0000264558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5440995,"threshold_uncertainty_score":0.2329959,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003009946,0.0001085744,0.0001887012,0.0003573108,0.00005052481,0.00008714286,0.0001809139,0.0000661744,0.00002842438],"category_scores_gemma":[0.0002030198,0.00009532647,0.00004915531,0.0001546246,0.0000770495,0.0002003472,0.00006626503,0.0001452313,0.000001408492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002077353,"about_ca_system_score_gemma":0.00002893154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002661199,"about_ca_topic_score_gemma":0.00001551589,"domain_scores_codex":[0.9988694,0.00005476121,0.0004755989,0.0001128532,0.000376247,0.0001111771],"domain_scores_gemma":[0.9987383,0.0004225405,0.0004058807,0.00005338613,0.0003246058,0.00005527863],"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.0003000285,0.0004087831,0.01940848,0.000044196,0.0004770778,0.0001336872,0.0008574612,0.00008868833,0.001596084,0.8803079,0.0476863,0.04869131],"study_design_scores_gemma":[0.001726162,0.0001989325,0.02096686,0.00003605615,0.00003917879,0.0003600099,0.0001734536,0.0002483944,0.0001918194,0.9752867,0.0006593039,0.000113117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9718072,0.0007548329,0.02455438,0.001892346,0.0003298606,0.0000503195,0.0000104458,0.00001570611,0.0005848505],"genre_scores_gemma":[0.9927611,0.00008114989,0.0066755,0.0001358873,0.0001957914,0.000001011126,0.000009658103,0.00001002154,0.0001298832],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09497881,"threshold_uncertainty_score":0.38873,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001686819,0.00006524297,0.00009042837,0.0001675508,0.00005081729,0.0002075013,0.0002428304,0.00002390988,0.000001656857],"category_scores_gemma":[0.00002048878,0.00005784372,0.00003157944,0.00007901049,0.00003864015,0.0006081997,0.00008080162,0.00007701616,0.000002495661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002753125,"about_ca_system_score_gemma":0.0000456856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006831863,"about_ca_topic_score_gemma":7.988733e-7,"domain_scores_codex":[0.9993363,0.00002230183,0.0002405795,0.00009843086,0.0002377901,0.00006460557],"domain_scores_gemma":[0.9994084,0.00007624709,0.0001782449,0.00004082188,0.0002354279,0.00006087476],"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.00002191266,0.0001077589,0.001057311,0.000007246731,0.0001204629,0.00009261347,0.002326824,0.01225454,0.0009045498,0.6068761,0.0001255729,0.3761051],"study_design_scores_gemma":[0.001868398,0.0002411263,0.04700223,0.00009710537,0.00001391501,0.001497639,0.0001819778,0.0743482,0.0008056658,0.8735033,0.0002777823,0.0001626605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4209426,0.000209903,0.5762128,0.002210915,0.0003148646,0.00001827103,5.790606e-7,0.00001498797,0.00007506018],"genre_scores_gemma":[0.9478745,0.00006713259,0.05155872,0.000386272,0.0001039129,4.485817e-7,0.00000149204,0.000003211473,0.000004247026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5269319,"threshold_uncertainty_score":0.2358798,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008645545,0.00006094714,0.0001530871,0.0001850523,0.00001188074,0.000009982497,0.00005158011,0.00003046715,0.000003098978],"category_scores_gemma":[0.0000767544,0.0000439704,0.00003793552,0.00007845336,0.00002881472,0.0002001664,0.00001020331,0.00005870143,1.040485e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007122529,"about_ca_system_score_gemma":0.00001834844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002727968,"about_ca_topic_score_gemma":0.00002827131,"domain_scores_codex":[0.9991313,0.00002517199,0.0004273709,0.00005592856,0.0003188105,0.00004148486],"domain_scores_gemma":[0.9990942,0.0001203934,0.0005216203,0.00002787253,0.0002133792,0.00002252035],"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.001698706,0.001794793,0.01457714,0.0001101634,0.000214771,0.00001966272,0.004113995,0.06289043,0.02265447,0.8806495,0.000004634357,0.01127173],"study_design_scores_gemma":[0.003162939,0.002420713,0.08922346,0.001174919,0.00003466442,0.00006243522,0.0007819136,0.003009423,0.006184482,0.8938139,0.000003553362,0.0001275588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7152364,0.00001344713,0.2845238,0.00006183884,0.00008387749,0.00004681043,0.000002036492,0.000002259668,0.00002947872],"genre_scores_gemma":[0.9903628,0.000005071047,0.009592677,0.000004485827,0.00002038895,5.300764e-7,0.000005642498,0.000004965897,0.000003412513],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2751264,"threshold_uncertainty_score":0.1793061,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003492629,0.0001319898,0.0001823044,0.000214186,0.00005795926,0.00005079385,0.0002032889,0.00005708729,0.00005272363],"category_scores_gemma":[0.0002915412,0.0001173029,0.00008752787,0.00007392666,0.00004403435,0.0005381285,0.00005432446,0.0002214476,0.00001347542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008203716,"about_ca_system_score_gemma":0.0000173094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001701643,"about_ca_topic_score_gemma":8.562826e-7,"domain_scores_codex":[0.9987075,0.00005070474,0.0004592912,0.0001000645,0.0005174394,0.0001649604],"domain_scores_gemma":[0.9985688,0.0005776852,0.0004257475,0.0000673142,0.0002448551,0.0001155663],"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.0000880662,0.0002284417,0.002770417,0.0000135895,0.0001511826,0.00002189612,0.0007806445,0.00001298001,0.000264777,0.9587702,0.001880355,0.03501743],"study_design_scores_gemma":[0.00067224,0.0001815557,0.007220977,0.00006314884,0.00002852104,0.0002402671,0.0001483773,0.0001136244,0.0006193583,0.9892242,0.001363506,0.0001242018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9310197,0.0001922294,0.06630916,0.0006203204,0.001215974,0.00006163508,0.000003610128,0.00002358662,0.0005538134],"genre_scores_gemma":[0.9748309,0.00004452248,0.02355377,0.0005065612,0.001006086,0.000001691889,0.000008881049,0.00001939832,0.00002822546],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04381119,"threshold_uncertainty_score":0.4783472,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002210659,0.00005485128,0.0000811579,0.00007644102,0.00004817063,0.00005076531,0.0004952467,0.00001864241,0.000004002897],"category_scores_gemma":[0.00003949127,0.00003566062,0.00004884127,0.00007136021,0.00005348829,0.0004457622,0.00007916828,0.00007868007,0.000002593807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000011366,"about_ca_system_score_gemma":0.00003075594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003263466,"about_ca_topic_score_gemma":8.779375e-7,"domain_scores_codex":[0.9992381,0.00003874397,0.0003063627,0.00007110347,0.0002770066,0.00006873844],"domain_scores_gemma":[0.9989588,0.0001547014,0.0003583632,0.00006341812,0.000428847,0.00003591663],"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.0000862305,0.00009324629,0.001638049,0.000004847846,0.0001467757,0.00004056547,0.002639517,0.0002405763,0.0004544925,0.5978928,0.0001800453,0.3965829],"study_design_scores_gemma":[0.001025932,0.0004868531,0.05222605,0.00006366566,0.00002162017,0.0005645285,0.000265654,0.0194942,0.006787825,0.9177085,0.001197324,0.0001579054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2702995,0.0003245481,0.7270021,0.0006815605,0.0007879123,0.00003151727,4.027796e-7,0.000008226712,0.0008642263],"genre_scores_gemma":[0.9750649,0.00008274473,0.02458423,0.0001638132,0.00008273585,4.784225e-7,2.771702e-7,0.000002463065,0.00001840988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7047653,"threshold_uncertainty_score":0.1454198,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001481222,0.0001116884,0.0002007514,0.0002610255,0.00006675444,0.0001320901,0.000496199,0.00004118946,0.00005439864],"category_scores_gemma":[0.00004440754,0.0001001113,0.00008855105,0.0001569512,0.0001617843,0.001039455,0.0001135765,0.0001345668,0.00001640209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003794059,"about_ca_system_score_gemma":0.00008087112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002249075,"about_ca_topic_score_gemma":0.000001176469,"domain_scores_codex":[0.9986036,0.00006213423,0.0005621494,0.0001465362,0.0005110156,0.0001145866],"domain_scores_gemma":[0.9978876,0.0002076445,0.0005637724,0.00007654374,0.001173209,0.00009129967],"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.00002765228,0.0003068264,0.003198532,0.00001792635,0.0002464136,0.00004134882,0.001071426,0.0419537,0.001005278,0.891934,0.00112164,0.05907527],"study_design_scores_gemma":[0.0007526545,0.0001789332,0.09748842,0.00003955259,0.000009934128,0.0004142474,0.00007751169,0.1141496,0.0002098039,0.786491,0.00007431885,0.0001140519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3462052,0.00008374347,0.6510643,0.001790605,0.0004739323,0.00007310075,0.000004894558,0.00001831113,0.000285969],"genre_scores_gemma":[0.9175495,0.00001584125,0.08191811,0.0003816753,0.00009873116,0.000002438971,0.00001355971,0.000004873409,0.00001526558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5713443,"threshold_uncertainty_score":0.408242,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003280356,0.00005091552,0.000104597,0.00009058839,0.00003057678,0.0000649108,0.0004089801,0.0000187864,0.000001934362],"category_scores_gemma":[0.00002605918,0.0000347082,0.00005810738,0.00008370481,0.00006838972,0.0002592158,0.00006285407,0.00005285483,4.877678e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001078133,"about_ca_system_score_gemma":0.00003237628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000020884,"about_ca_topic_score_gemma":0.000002815529,"domain_scores_codex":[0.9991256,0.000039159,0.0004083925,0.00005871141,0.0003125478,0.00005557277],"domain_scores_gemma":[0.998686,0.0003140225,0.0005247211,0.00005595804,0.0004018166,0.00001747739],"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.00009199334,0.0001423005,0.003415773,0.00001450101,0.0001620197,0.00001856189,0.0007018514,0.002333035,0.0108757,0.6915638,0.000965689,0.2897147],"study_design_scores_gemma":[0.00149524,0.0003353093,0.08489105,0.0002339661,0.00002496572,0.0003921109,0.0002850321,0.1030781,0.02931048,0.7785565,0.00123644,0.0001607559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7711955,0.0007196825,0.2265822,0.0008458711,0.000392149,0.00002589213,0.00000138493,0.000006287402,0.0002309501],"genre_scores_gemma":[0.9947942,0.00005878908,0.004991772,0.00004444798,0.00009002872,3.358829e-7,0.000001058003,0.00000233035,0.00001703494],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.289554,"threshold_uncertainty_score":0.1415359,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002212376,0.0000663985,0.00009687231,0.0002366734,0.00005003254,0.0002464263,0.0005022543,0.000025458,0.00002588992],"category_scores_gemma":[0.00006812648,0.00005731087,0.00006571163,0.00009693964,0.00004066166,0.001015747,0.00008065395,0.00009195693,0.00001099989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003281912,"about_ca_system_score_gemma":0.0000469834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002915083,"about_ca_topic_score_gemma":5.901124e-7,"domain_scores_codex":[0.999096,0.00003460947,0.0002646075,0.0001098924,0.0003840598,0.0001108629],"domain_scores_gemma":[0.9986504,0.0002111663,0.0001946866,0.00005462505,0.0008107916,0.00007829766],"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.0000855101,0.00008780703,0.0009484732,0.000006989786,0.0001278034,0.0000187236,0.0006531645,0.0005777546,0.001830388,0.3113101,0.003387348,0.6809659],"study_design_scores_gemma":[0.001284593,0.000298524,0.0131983,0.00003082136,0.000005069279,0.0002166314,0.00006509595,0.04390624,0.001257411,0.9367406,0.002876575,0.0001201484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1775794,0.00006994885,0.8187626,0.002219661,0.0008904801,0.0001166823,0.000001188327,0.00001073857,0.0003493339],"genre_scores_gemma":[0.9455664,0.00002128205,0.05302443,0.0002588639,0.001046477,0.000006931153,0.00000198964,0.000005411252,0.00006817967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7679871,"threshold_uncertainty_score":0.2376294,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000359583,0.00006260251,0.0001666072,0.0004070026,0.00002501208,0.000007075075,0.0001631192,0.00004424153,0.00003048547],"category_scores_gemma":[0.001086719,0.00005739328,0.00006367457,0.000128915,0.00005868851,0.0001764498,0.00003497186,0.00007276699,7.863068e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002325321,"about_ca_system_score_gemma":0.00004898717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002361211,"about_ca_topic_score_gemma":0.00002143662,"domain_scores_codex":[0.9991449,0.00002753794,0.0005039613,0.00006428849,0.0001714008,0.00008788372],"domain_scores_gemma":[0.9983063,0.0008089622,0.0003831852,0.00004682549,0.0004234104,0.00003129838],"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.0001142955,0.0004933293,0.001991885,0.00005335311,0.0002129071,0.00001084788,0.002781952,0.0003600741,0.0001621623,0.9786598,0.0007379946,0.01442138],"study_design_scores_gemma":[0.001023868,0.0002163187,0.005807193,0.00006352511,0.00004153669,0.00005857147,0.0004331812,0.01534544,0.0002619406,0.9766807,0.00001243517,0.00005527999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3157607,0.0002508336,0.6827394,0.0006461078,0.0003967095,0.00008154532,0.00001374548,0.000005434346,0.0001055918],"genre_scores_gemma":[0.9111242,0.00001422414,0.08872717,0.00002313968,0.00008134008,0.000003442045,0.000004177584,0.000005759504,0.00001661002],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5953634,"threshold_uncertainty_score":0.234043,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001654967,0.00009166985,0.0001436169,0.0001370618,0.00003873343,0.00006306482,0.0001940103,0.00004777903,0.0001802729],"category_scores_gemma":[0.0001023682,0.00008358496,0.00006475255,0.00006051512,0.00004434397,0.0003363193,0.00002567521,0.0001618953,0.0000088171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005346086,"about_ca_system_score_gemma":0.00003126859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003197648,"about_ca_topic_score_gemma":0.000001670415,"domain_scores_codex":[0.9989795,0.00003579988,0.0004077118,0.00009270649,0.0003951609,0.00008910233],"domain_scores_gemma":[0.9991322,0.0001980405,0.0002529114,0.00004295842,0.0003146167,0.00005930548],"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.0009322871,0.0005273524,0.009194029,0.00004506263,0.0007015182,0.0002941587,0.002709366,0.0006586543,0.0005299238,0.2987768,0.01252929,0.6731015],"study_design_scores_gemma":[0.001386183,0.0001265463,0.01015476,0.00006217889,0.00002451059,0.0005868638,0.00007910803,0.001448004,0.0003781724,0.9842815,0.001337052,0.0001350873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9461752,0.00007095062,0.05049689,0.0009455427,0.0005816333,0.00004615673,0.000002100031,0.00001783665,0.001663741],"genre_scores_gemma":[0.9862369,0.00006511545,0.01264747,0.0002206886,0.0006729197,8.107713e-7,0.000002353735,0.0000118955,0.000141844],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6855047,"threshold_uncertainty_score":0.3408496,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002224896,0.00007495197,0.0001882787,0.0001174498,0.00005827096,0.00006936865,0.0006324119,0.00003130124,0.000001844598],"category_scores_gemma":[0.00007182971,0.00005655958,0.00005313601,0.00004607881,0.0001144175,0.0008832174,0.0001210338,0.00009506969,3.450171e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002353937,"about_ca_system_score_gemma":0.00008337441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004138548,"about_ca_topic_score_gemma":0.000004693564,"domain_scores_codex":[0.9989909,0.00002812666,0.0003696644,0.0001102537,0.0004321102,0.00006895631],"domain_scores_gemma":[0.9979572,0.00009482024,0.001009763,0.0001436521,0.0007515251,0.00004308127],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.001260942,0.0006367189,0.1368156,0.0001025761,0.0006595239,0.0001383749,0.002379374,0.01801748,0.005071933,0.3607444,0.0001509083,0.4740222],"study_design_scores_gemma":[0.001881403,0.0006899223,0.7404258,0.0001429158,0.00001691074,0.0001425485,0.00007468808,0.01660639,0.002889787,0.2369745,0.00004104729,0.0001140205],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.555552,0.00003179592,0.4437726,0.0003342617,0.0001864107,0.00002968981,0.000001342926,0.000003048979,0.00008891174],"genre_scores_gemma":[0.9727721,0.00001850613,0.02709076,0.0000522858,0.00005604365,5.048974e-7,7.674155e-7,0.000002926407,0.000006126858],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6036103,"threshold_uncertainty_score":0.2306433,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003891728,0.0001555405,0.0002555025,0.0002931988,0.0001003258,0.0002222746,0.0006365112,0.00006343795,0.000009805527],"category_scores_gemma":[0.00002637614,0.0001454234,0.00007556893,0.0002343327,0.0001830064,0.0005549995,0.0001928422,0.0002436447,0.000003025517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000112757,"about_ca_system_score_gemma":0.00008258164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000550468,"about_ca_topic_score_gemma":0.000491356,"domain_scores_codex":[0.9983806,0.0000939683,0.0005815012,0.0002123249,0.0005549034,0.0001766862],"domain_scores_gemma":[0.9987238,0.0001232537,0.0004831103,0.0001079342,0.0004945322,0.00006736913],"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.0003040918,0.000631224,0.01916131,0.00002912995,0.0001336142,0.0003307145,0.001977131,0.008700761,0.0009568371,0.9327061,0.001719986,0.03334917],"study_design_scores_gemma":[0.001232012,0.0001996418,0.3813749,0.0001135273,0.000009444737,0.0004040717,0.000229897,0.1357329,0.0006244855,0.4795975,0.00024794,0.0002335795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7584386,0.0001723299,0.2372339,0.003117968,0.0007052621,0.00005327315,0.000006981694,0.0000363428,0.0002353488],"genre_scores_gemma":[0.9864493,0.00002006087,0.01250948,0.0007743023,0.0002033174,9.194568e-7,0.00001600657,0.000008261948,0.00001833516],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4531085,"threshold_uncertainty_score":0.5930195,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001751546,0.00008105899,0.0001270276,0.0001285365,0.00003179506,0.0000397025,0.0001428389,0.00003854785,0.00001855452],"category_scores_gemma":[0.00009266543,0.00007174841,0.00006238438,0.00004998809,0.00003254046,0.0002082634,0.00003660038,0.0001273939,0.000003835626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005333263,"about_ca_system_score_gemma":0.00002318976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004428568,"about_ca_topic_score_gemma":0.000002912434,"domain_scores_codex":[0.9990033,0.00002655725,0.0004197948,0.0000808983,0.0003927116,0.00007676596],"domain_scores_gemma":[0.9989415,0.0001918676,0.00036883,0.00004242083,0.0004212173,0.00003417141],"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.0001070909,0.0002820421,0.002943592,0.00002446603,0.0001863898,0.0001546079,0.0003593995,0.002033418,0.001582817,0.946143,0.003437884,0.04274533],"study_design_scores_gemma":[0.0006302042,0.00006405037,0.003865447,0.00004905763,0.00001919651,0.0003325155,0.00004908456,0.002233311,0.001100776,0.9905474,0.001027418,0.0000815382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6925263,0.0001203943,0.3053601,0.0007369102,0.0005714034,0.00003712485,0.000001664173,0.00001536613,0.0006307242],"genre_scores_gemma":[0.9279442,0.00002125812,0.07102378,0.0001024446,0.0007726441,6.887128e-7,0.000004346122,0.0000104204,0.000120169],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2354179,"threshold_uncertainty_score":0.2925816,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002222276,0.00009861011,0.0002007309,0.0001298229,0.00004124767,0.0001018608,0.000183348,0.00004485399,0.00003597516],"category_scores_gemma":[0.0004344117,0.00008429263,0.00008564036,0.00004337206,0.00002351779,0.0004497486,0.00003732214,0.00007920722,0.000006016217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005791807,"about_ca_system_score_gemma":0.00004040263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003055509,"about_ca_topic_score_gemma":6.07602e-7,"domain_scores_codex":[0.9989569,0.00001998181,0.0005215756,0.00007985688,0.0003164247,0.0001052696],"domain_scores_gemma":[0.9977155,0.0007101992,0.0005397719,0.00004826827,0.0009237185,0.00006256665],"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.0001703229,0.0002879916,0.0002062634,0.0001021498,0.0004291875,0.000008820895,0.0008987586,0.000288158,0.003368977,0.8811847,0.01258791,0.1004668],"study_design_scores_gemma":[0.001133601,0.0001476121,0.0002130474,0.00006657338,0.00002844284,0.0001019812,0.0001158226,0.005811078,0.001304669,0.9903486,0.0006389184,0.00008959965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5552264,0.00007687983,0.4414089,0.001417575,0.001267786,0.0002759825,0.000004372715,0.00001831035,0.0003038133],"genre_scores_gemma":[0.9005617,0.00001626519,0.09870143,0.0001391491,0.0004566677,0.00001209656,0.000003048709,0.00001713974,0.00009251865],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3453353,"threshold_uncertainty_score":0.3437354,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002485698,0.0001068331,0.0002419022,0.0001548692,0.00006415787,0.00004442568,0.0001366213,0.00004892384,0.00001176939],"category_scores_gemma":[0.000375233,0.00009496813,0.00005245434,0.00004639558,0.00007122153,0.0003025359,0.0000572548,0.00010919,0.000002556079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004551479,"about_ca_system_score_gemma":0.0000512305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002120597,"about_ca_topic_score_gemma":5.803624e-7,"domain_scores_codex":[0.9988925,0.00004534877,0.0005246264,0.00009357557,0.0003561928,0.00008779296],"domain_scores_gemma":[0.9984715,0.0005124863,0.0005252383,0.00005058098,0.0003644244,0.00007577536],"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.000927181,0.001006216,0.006590859,0.00019235,0.001427623,0.0007146874,0.01275461,0.0005430014,0.01190916,0.8414338,0.01287578,0.1096247],"study_design_scores_gemma":[0.001609783,0.0001827268,0.002388376,0.000100926,0.00003960191,0.001928705,0.0001495149,0.0008542333,0.00219026,0.989974,0.0004310536,0.0001508754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9479435,0.0002455437,0.05003444,0.0005334315,0.0008283905,0.00007743797,0.000002215049,0.00001659551,0.0003184241],"genre_scores_gemma":[0.9720043,0.0001581235,0.02726014,0.00008770416,0.0004115498,0.000001238001,0.000001019372,0.00001369045,0.00006223887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1485401,"threshold_uncertainty_score":0.3872688,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002902253,0.00009905263,0.0001624396,0.000262798,0.00009176968,0.0001099637,0.0001824419,0.00004118885,0.00004182405],"category_scores_gemma":[0.00006874172,0.00008822581,0.00004865355,0.0001844825,0.00007195916,0.0002878685,0.00009071741,0.0001485016,0.00001004206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002252378,"about_ca_system_score_gemma":0.00003401491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009450877,"about_ca_topic_score_gemma":0.000006759024,"domain_scores_codex":[0.9989871,0.00004887175,0.0003552619,0.0001181403,0.0003886986,0.0001019752],"domain_scores_gemma":[0.998703,0.0005119333,0.0002558608,0.00005586962,0.0004017925,0.00007156577],"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.0001344216,0.0001782736,0.01592595,0.00004329699,0.0004798709,0.00005761978,0.00189951,0.0001879691,0.003275287,0.9065989,0.01238721,0.05883172],"study_design_scores_gemma":[0.000724047,0.00009148984,0.1173093,0.00005680092,0.00003030522,0.0001502071,0.0001863352,0.002635862,0.000303406,0.8775281,0.0008764379,0.0001076292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9836434,0.0001928159,0.01332095,0.00202673,0.0003521312,0.00008064273,0.000007721823,0.00003693777,0.0003387186],"genre_scores_gemma":[0.9955021,0.0001648269,0.004027351,0.0001277276,0.00008347417,0.000003422578,0.00001030919,0.00001108077,0.00006973584],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1013834,"threshold_uncertainty_score":0.3597744,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002835454,0.00005444633,0.0001057754,0.0002236955,0.00001171284,0.00004984018,0.0004654709,0.00002506932,0.000001374216],"category_scores_gemma":[0.0001028133,0.0000468426,0.00002788535,0.0001397517,0.00004442855,0.0005951931,0.0001108276,0.00007906512,8.011204e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003134726,"about_ca_system_score_gemma":0.00006580126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001596691,"about_ca_topic_score_gemma":0.000002711945,"domain_scores_codex":[0.9992488,0.00002910372,0.0003108016,0.00008973447,0.0002554127,0.00006617194],"domain_scores_gemma":[0.9993156,0.00006308674,0.0002556721,0.00007218107,0.000273446,0.00002006447],"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.00005786601,0.0002274672,0.001901958,0.00002539571,0.00006337016,0.0001201119,0.002534835,0.00556591,0.002530271,0.8646619,0.0001513064,0.1221596],"study_design_scores_gemma":[0.00130464,0.0002120995,0.03409672,0.0001483027,0.000003698357,0.0003134377,0.0001751449,0.002874677,0.007819365,0.952922,0.00005096863,0.00007890526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7408437,0.0004592717,0.2520452,0.005822774,0.0006949811,0.00003719568,9.786546e-7,0.00001063072,0.0000852279],"genre_scores_gemma":[0.9719042,0.00005477154,0.02782515,0.0001183064,0.00008868214,6.325883e-7,9.189167e-7,0.000002332766,0.000005044874],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2310605,"threshold_uncertainty_score":0.1910186,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003138222,0.0001496509,0.0001782835,0.0002835784,0.00008427229,0.0003446825,0.0006065567,0.00006149554,0.00001597136],"category_scores_gemma":[0.00004378751,0.0001284288,0.0001023538,0.0001813004,0.00004446601,0.0007405177,0.00009137594,0.0001822116,0.00002380579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009678778,"about_ca_system_score_gemma":0.00008605809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001337451,"about_ca_topic_score_gemma":0.000001405936,"domain_scores_codex":[0.9985697,0.00005080039,0.0004530896,0.0002137758,0.0005672601,0.0001453651],"domain_scores_gemma":[0.998929,0.0001087449,0.0003654975,0.0001128618,0.0003737127,0.0001101302],"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.000313084,0.0008128884,0.001157727,0.0000239259,0.0006353566,0.0008117178,0.008374622,0.0298731,0.02093987,0.5932717,0.004169541,0.3396164],"study_design_scores_gemma":[0.006805506,0.00142691,0.02067131,0.0005922991,0.00004948848,0.002541791,0.0003378046,0.1003399,0.02509468,0.8403169,0.001063612,0.0007598081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6330695,0.0002520363,0.3627487,0.002994983,0.0007684371,0.00003917947,0.000002383817,0.00003333303,0.00009137031],"genre_scores_gemma":[0.9882247,0.00009474719,0.00856549,0.002853738,0.0002255727,0.00000133521,0.000006251928,0.000009405881,0.00001872049],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3551552,"threshold_uncertainty_score":0.5237176,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005650175,0.00007707374,0.0002064033,0.0002801255,0.00002247654,0.00002362199,0.0002245079,0.00004029721,0.00005491337],"category_scores_gemma":[0.0003341174,0.0000661123,0.00007643476,0.00007708889,0.00007577641,0.0002005445,0.00004306012,0.000151428,0.000002796016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004970237,"about_ca_system_score_gemma":0.00005379536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004551215,"about_ca_topic_score_gemma":0.000004374062,"domain_scores_codex":[0.9986272,0.0001056021,0.0005418925,0.00006575166,0.0005778814,0.00008171302],"domain_scores_gemma":[0.9974892,0.001209688,0.000533562,0.0000622256,0.0006628473,0.00004246065],"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.001527077,0.00134832,0.002310341,0.0001572365,0.0007292336,0.00002946884,0.004087242,0.004477808,0.007136686,0.8828214,0.002210814,0.09316434],"study_design_scores_gemma":[0.002322071,0.001025332,0.003605632,0.0003551092,0.00003685626,0.0001514521,0.0008222783,0.01710619,0.01509724,0.959105,0.0002386255,0.0001341997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9794963,0.00007625503,0.01894259,0.0006275497,0.0001311948,0.00005756834,0.000007352345,0.000005102357,0.0006560878],"genre_scores_gemma":[0.9922684,0.00003013095,0.007477793,0.00005524053,0.0001175175,6.563467e-7,0.000003409802,0.00001019668,0.00003664077],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09303014,"threshold_uncertainty_score":0.2695981,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027633,0.00008701487,0.0001909129,0.0002181106,0.00002622356,0.00003400372,0.0003750313,0.00002778196,0.000001574352],"category_scores_gemma":[0.0002151021,0.00006823551,0.00006183883,0.0001640209,0.00007717344,0.0006496228,0.00005279096,0.00006115336,5.054653e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002436267,"about_ca_system_score_gemma":0.0001772083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005522697,"about_ca_topic_score_gemma":0.000002164024,"domain_scores_codex":[0.9988596,0.00004134579,0.0004578062,0.0001179166,0.0004427073,0.0000806107],"domain_scores_gemma":[0.9971691,0.000536154,0.0006813727,0.00007859213,0.001461151,0.00007361524],"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.0006292599,0.0006301093,0.003979257,0.0000634608,0.0003267846,0.0000402443,0.003508577,0.04737233,0.0007084249,0.8027993,0.0002399872,0.1397023],"study_design_scores_gemma":[0.004040872,0.004281583,0.006709493,0.0003619944,0.00006454491,0.0003136856,0.0008372678,0.2646089,0.005240847,0.7128642,0.0003865891,0.0002899999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.176015,0.0001921535,0.8227233,0.0006503212,0.0002431015,0.00007134317,0.000005738657,0.00000778438,0.00009128053],"genre_scores_gemma":[0.8675825,0.00001660685,0.1321996,0.0001126591,0.00006563032,0.000002307157,0.000005375753,0.000004320444,0.00001101267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6915675,"threshold_uncertainty_score":0.2782564,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002015673,0.0001423109,0.0001679874,0.000248589,0.00007460004,0.0003678421,0.0006071084,0.0000456863,0.00001705299],"category_scores_gemma":[0.0000372812,0.000121464,0.0001011906,0.0001460895,0.0000397191,0.001491402,0.0001551892,0.0001675819,0.00001220701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006823591,"about_ca_system_score_gemma":0.0000619401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001680165,"about_ca_topic_score_gemma":0.000003121338,"domain_scores_codex":[0.9986165,0.00003591167,0.0003842908,0.0002030134,0.0006016577,0.0001586895],"domain_scores_gemma":[0.9987839,0.0001329726,0.0004155724,0.0001021732,0.0004588891,0.0001064556],"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.00004937859,0.0001491466,0.001476086,0.000006743534,0.0001856939,0.0000915815,0.00113244,0.004885874,0.0002423448,0.1187607,0.001346939,0.8716731],"study_design_scores_gemma":[0.002909183,0.0007455261,0.01733103,0.0001367855,0.00003951532,0.0009711984,0.0001934966,0.3573389,0.002405138,0.5917764,0.02563501,0.0005177543],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09660362,0.000609755,0.8790284,0.02282992,0.0006180563,0.0000627622,0.000002361943,0.00003022347,0.0002148421],"genre_scores_gemma":[0.937254,0.0001045503,0.05994305,0.002094511,0.0005179697,0.000001841385,0.000003468752,0.000007097779,0.00007346734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8711553,"threshold_uncertainty_score":0.4953158,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003398672,0.00007624152,0.0001359018,0.000172226,0.00003919655,0.0001240236,0.0003073258,0.00003210474,0.00001092935],"category_scores_gemma":[0.00002765498,0.00006660946,0.00003808596,0.000101401,0.00004198467,0.0007718568,0.0001047681,0.00008729187,0.000002262934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002816382,"about_ca_system_score_gemma":0.00004913294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008963757,"about_ca_topic_score_gemma":0.000002454137,"domain_scores_codex":[0.9990995,0.00003957025,0.0003448267,0.0001089873,0.0003222873,0.00008480687],"domain_scores_gemma":[0.9991453,0.0001354363,0.0003185316,0.00005916306,0.0002814719,0.0000600417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008459593,0.00021651,0.002992008,0.00002408614,0.0002036014,0.00004227752,0.002851692,0.005563376,0.003866367,0.1142259,0.001126197,0.8688034],"study_design_scores_gemma":[0.003801099,0.0007417074,0.05010626,0.0004539162,0.00004958141,0.00197856,0.0006197356,0.6457763,0.01595817,0.2745612,0.005487597,0.0004659079],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7834022,0.0006353057,0.2131564,0.002074801,0.0003214279,0.00003799308,0.000002026788,0.00001332486,0.0003565655],"genre_scores_gemma":[0.972667,0.0001004989,0.02678083,0.0002951307,0.0001143762,5.418121e-7,0.000001548415,0.00000408806,0.00003592642],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8683375,"threshold_uncertainty_score":0.2716255,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004720822,0.0000674639,0.0001877933,0.0002054053,0.00001669861,0.00001454832,0.0002020905,0.0000399838,0.00002004372],"category_scores_gemma":[0.0003586127,0.00004714925,0.00005403153,0.0001822673,0.0001744157,0.000147144,0.0000665932,0.0001419425,0.00000319307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004810635,"about_ca_system_score_gemma":0.00007976332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001515977,"about_ca_topic_score_gemma":0.000004516173,"domain_scores_codex":[0.9989289,0.0001083131,0.0004777857,0.00006607961,0.0003484592,0.00007046442],"domain_scores_gemma":[0.998688,0.0002561182,0.0005307831,0.00004120819,0.000441756,0.00004213873],"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.000349324,0.0006597594,0.03207053,0.00004174279,0.000348171,0.00003801733,0.008747444,0.001200299,0.000502431,0.9349529,0.002903786,0.01818562],"study_design_scores_gemma":[0.001397593,0.0001305327,0.05239389,0.00006970573,0.00001680852,0.0002122102,0.0004531927,0.001972334,0.0001408718,0.9430616,0.00009440666,0.00005680406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.992373,0.00009528387,0.004054587,0.002008358,0.0002571842,0.00007748738,0.000002635317,0.000004409022,0.001127085],"genre_scores_gemma":[0.9940479,0.000006056185,0.005739755,0.00006447231,0.00007632552,6.14906e-7,0.000001288727,0.000005050504,0.00005857726],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02032336,"threshold_uncertainty_score":0.1922691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}