{"meta":{"query_hash":"81ddb7b2a067","filters":{"venue":"International Journal of Algebra and Computation"},"cohort_total":95,"direct_labels_cover":0,"predictions_cover":95,"exported":95,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/81ddb7b2a067","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Algebra+and+Computation"},"results":[{"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03566420325115901,"score_gpt":0.3677014432074088,"score_spread":0.3320372399562498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528460097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7591081,0.00018070369,0.23833896,0.0016408474,0.00036932866,0.0001756805,0.000014704229,0.000017459011,0.00015416226],"genre_scores_gemma":[0.97125304,0.00008186726,0.027766688,0.00022189684,0.00060908886,0.000006844407,0.0000071403733,0.00002348801,0.000029968607],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983959,0.000054179716,0.0005853901,0.00015314115,0.0006269698,0.00018441219],"domain_scores_gemma":[0.9977759,0.00048171368,0.00037431973,0.000067617744,0.0011792227,0.0001212207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045292228,0.00013838452,0.00023143568,0.0002377517,0.00008199774,0.00012297946,0.00024518147,0.000063696374,0.000015570178],"category_scores_gemma":[0.00040002147,0.00012517415,0.000107981934,0.00008197198,0.00007099404,0.0005313435,0.000053011932,0.00019113599,0.000009020054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091591553,0.0004869676,0.0006974004,0.00006730121,0.0006528585,0.00007319758,0.0014553925,0.0016931548,0.03862405,0.15476464,0.004540536,0.7960286],"study_design_scores_gemma":[0.010253363,0.0011056659,0.0040222197,0.00048421154,0.00014327321,0.0014146116,0.0007537539,0.055156436,0.102463804,0.8176743,0.0058110193,0.0007173357],"about_ca_topic_score_codex":9.540887e-7,"about_ca_topic_score_gemma":0.000010910887,"teacher_disagreement_score":0.7953113,"about_ca_system_score_codex":0.00014683667,"about_ca_system_score_gemma":0.000121954115,"threshold_uncertainty_score":0.51044536},"labels":[],"label_agreement":null},{"id":"W1799440065","doi":"10.1142/s0218196714500106","title":"The cogrowth series for<font>BS</font>(N, N) is D-finite","year":2014,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of British Columbia","funders":"","keywords":"Series (stratigraphy); Algebraic number; Algebra over a field; Neumann series; Function series; Alternating series","score_opus":0.018331782246690537,"score_gpt":0.31337857878051417,"score_spread":0.29504679653382365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1799440065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.335859,0.00024619425,0.657635,0.0046490976,0.0010429812,0.00010830525,0.000008303948,0.000018129023,0.00043305164],"genre_scores_gemma":[0.98797524,0.000114286064,0.010653539,0.0004556829,0.0005772989,0.0000039187166,0.000004641451,0.000014429007,0.00020095882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989201,0.000043820484,0.00044795845,0.00009946368,0.0003671748,0.00012150843],"domain_scores_gemma":[0.9974139,0.0013032786,0.0004673709,0.000063628046,0.00069492665,0.00005691563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004702926,0.000107900305,0.00017062349,0.00011262474,0.00015505592,0.00013980024,0.00022124505,0.000043041975,0.000008121122],"category_scores_gemma":[0.0005788383,0.000075358585,0.00010722099,0.000072966825,0.00006643042,0.00034507806,0.000038681384,0.000117647316,0.0000030281428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048129715,0.00009928226,0.0010472386,0.000045555546,0.00043802508,0.00000763745,0.0014134819,0.0003364344,0.00021175382,0.7894543,0.0049980218,0.20146699],"study_design_scores_gemma":[0.00089562876,0.0002486748,0.0012436669,0.000056587283,0.00003526246,0.000110805406,0.00026126235,0.0041389633,0.00068925234,0.98224694,0.009973604,0.00009937726],"about_ca_topic_score_codex":7.0484884e-7,"about_ca_topic_score_gemma":0.000004672548,"teacher_disagreement_score":0.65211624,"about_ca_system_score_codex":0.0000259037,"about_ca_system_score_gemma":0.000028378025,"threshold_uncertainty_score":0.30730337},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.043092913822301106,"score_gpt":0.30626776460558985,"score_spread":0.2631748507832887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1868260886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17601497,0.00019215347,0.8227233,0.0006503212,0.00024310149,0.00007134317,0.0000057386574,0.00000778438,0.000091280526],"genre_scores_gemma":[0.8675825,0.000016606848,0.13219956,0.00011265906,0.00006563032,0.0000023071566,0.0000053757526,0.0000043204436,0.000011012674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988596,0.000041345786,0.00045780616,0.00011791657,0.00044270727,0.0000806107],"domain_scores_gemma":[0.99716914,0.000536154,0.0006813727,0.00007859213,0.0014611509,0.000073615236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027632999,0.00008701487,0.00019091288,0.00021811061,0.000026223559,0.000034003722,0.00037503132,0.000027781956,0.0000015743519],"category_scores_gemma":[0.00021510213,0.00006823551,0.00006183883,0.0001640209,0.00007717344,0.00064962276,0.000052790958,0.00006115336,5.0546527e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062925986,0.0006301093,0.0039792573,0.0000634608,0.00032678465,0.0000402443,0.003508577,0.047372326,0.0007084249,0.8027993,0.00023998719,0.13970229],"study_design_scores_gemma":[0.0040408717,0.0042815832,0.006709493,0.00036199443,0.00006454491,0.00031368562,0.0008372678,0.2646089,0.0052408474,0.7128642,0.00038658912,0.00028999988],"about_ca_topic_score_codex":0.0000055226974,"about_ca_topic_score_gemma":0.0000021640242,"teacher_disagreement_score":0.69156754,"about_ca_system_score_codex":0.000024362675,"about_ca_system_score_gemma":0.00017720829,"threshold_uncertainty_score":0.27825636},"labels":[],"label_agreement":null},{"id":"W1924161485","doi":"10.1142/s0218196704001748","title":"DETERMINING WHETHER ${\\mathsf V}({\\bf A})$ HAS A MODEL COMPANION IS UNDECIDABLE","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Undecidable problem; Mathematics; Variety (cybernetics); Class (philosophy); Algebra over a field; Discrete mathematics; Pure mathematics; Combinatorics; Decidability; Computer science","score_opus":0.033980348212504216,"score_gpt":0.29141136943402707,"score_spread":0.25743102122152284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924161485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26700228,0.00011249484,0.72977203,0.0024621314,0.00038670131,0.00003965849,9.310222e-7,0.000024857127,0.0001988989],"genre_scores_gemma":[0.88940734,0.000033334094,0.10935539,0.0010508011,0.00011974585,0.0000012106935,0.0000014098813,0.000007627611,0.000023138387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998748,0.000025958889,0.0004084469,0.00018652799,0.00048800345,0.00014303827],"domain_scores_gemma":[0.99898905,0.00006489542,0.00037215077,0.000089509274,0.0003944945,0.00008993193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018618313,0.00012780174,0.00017161467,0.00021373271,0.00010601031,0.00033600256,0.0005137777,0.0000496036,0.0000053970493],"category_scores_gemma":[0.000023295745,0.00011207147,0.000083305036,0.00012357967,0.000050356433,0.0011496935,0.000118994954,0.0001538691,0.000009805704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070885726,0.00032829455,0.0011941127,0.00001639196,0.00022619257,0.00019478043,0.0079156635,0.5817773,0.002784339,0.22346514,0.00048926653,0.18153764],"study_design_scores_gemma":[0.0014367135,0.00016509727,0.0021971306,0.00009783977,0.0000108897675,0.00055376935,0.000088250155,0.42920163,0.0011099278,0.56477565,0.00019893625,0.00016415052],"about_ca_topic_score_codex":0.0000043978985,"about_ca_topic_score_gemma":0.0000015373475,"teacher_disagreement_score":0.62240505,"about_ca_system_score_codex":0.00009492644,"about_ca_system_score_gemma":0.00014314408,"threshold_uncertainty_score":0.4570142},"labels":[],"label_agreement":null},{"id":"W1926003511","doi":"10.1142/s0218196700000133","title":"FREE GROUP ROOTS OF a<sup>k</sup>b<sup>l</sup> AND [ a<sup>k</sup>,b]","year":2000,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Conjugacy class; Combinatorics; Group (periodic table); Closure (psychology); Physics","score_opus":0.017062935131293627,"score_gpt":0.27865723242999324,"score_spread":0.2615942972986996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1926003511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97814316,0.00072405656,0.017178908,0.0017870616,0.00018963743,0.00018602755,0.000049393682,0.00003274582,0.0017089873],"genre_scores_gemma":[0.99158543,0.00030388284,0.00676285,0.00030781399,0.00047900647,0.0000041885833,0.000029210642,0.000027859882,0.0004997724],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715,0.000175544,0.0012049128,0.00032528996,0.00084018824,0.00030406396],"domain_scores_gemma":[0.9974373,0.0009358294,0.0006179056,0.00019645935,0.00062962505,0.00018289384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006181821,0.0003133313,0.0006038732,0.00079559244,0.00012024645,0.00012601123,0.0005465515,0.00020879306,0.00055723364],"category_scores_gemma":[0.00044861768,0.00028383132,0.00020607235,0.00036735932,0.00020567572,0.00049633114,0.00015051532,0.00039356528,0.000012486829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001779743,0.0023858966,0.019977752,0.00052586215,0.0034449578,0.0004530054,0.01396654,0.10292339,0.00021770132,0.24058618,0.02620108,0.5875379],"study_design_scores_gemma":[0.008456263,0.0012628309,0.020555768,0.0006149581,0.00039823717,0.0019290335,0.003282466,0.18925817,0.00023449825,0.76958156,0.0037134427,0.00071274856],"about_ca_topic_score_codex":0.00005205395,"about_ca_topic_score_gemma":0.0000044388657,"teacher_disagreement_score":0.58682513,"about_ca_system_score_codex":0.00008086141,"about_ca_system_score_gemma":0.00010338001,"threshold_uncertainty_score":0.9999614},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.032301626318107124,"score_gpt":0.3002791238380374,"score_spread":0.2679774975199303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963602153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57401603,0.00009819144,0.40861058,0.01630421,0.00044495304,0.0000544228,0.000003339635,0.000013254315,0.00045502943],"genre_scores_gemma":[0.99345064,0.000023050252,0.0047268635,0.0016886389,0.00009873844,4.099641e-7,0.0000021750357,0.0000017131391,0.000007774279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915063,0.00004977693,0.000295979,0.00008469215,0.0003498283,0.00006907008],"domain_scores_gemma":[0.999047,0.00019674978,0.00034287563,0.00007140239,0.00030402865,0.000037939084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016723477,0.00006764202,0.000108700195,0.00012655942,0.00006083825,0.0000617854,0.00043670202,0.000020477906,0.0000098211085],"category_scores_gemma":[0.00005171297,0.000045657547,0.000062854306,0.00009062862,0.00010132614,0.0004442495,0.00003361728,0.000112940295,0.0000034432126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018879038,0.00007036714,0.000038111182,9.135228e-7,0.00002512899,0.000010511652,0.00017244335,0.0014889932,0.00039854806,0.9814778,0.00025725065,0.016041037],"study_design_scores_gemma":[0.00032441335,0.00029881028,0.02786759,0.000033857326,0.0000042923693,0.00010554062,0.000029564351,0.010953266,0.00076216913,0.9595235,0.000047624817,0.000049401944],"about_ca_topic_score_codex":9.459046e-7,"about_ca_topic_score_gemma":2.0346026e-7,"teacher_disagreement_score":0.41943464,"about_ca_system_score_codex":0.000020371584,"about_ca_system_score_gemma":0.000031691252,"threshold_uncertainty_score":0.18618608},"labels":[],"label_agreement":null},{"id":"W1964349168","doi":"10.1142/s021819671240005x","title":"THE MAGNUS EMBEDDING IS A QUASI-ISOMETRY","year":2012,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Wreath product; Isometry (Riemannian geometry); Embedding; Rank (graph theory); Combinatorics; Solvable group; Pure mathematics; Product (mathematics); Degree (music); Abelian group; Geometry","score_opus":0.030827957529112205,"score_gpt":0.3545952090840392,"score_spread":0.32376725155492697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964349168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9079332,0.0012632217,0.08541624,0.0030175638,0.0016868305,0.000044129636,0.0000016948494,0.000010470514,0.0006266964],"genre_scores_gemma":[0.9942074,0.00011073737,0.0047304137,0.0002244188,0.0005793533,6.678796e-7,7.462372e-7,0.0000073792203,0.00013888105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902046,0.000051295065,0.00036392116,0.000055961787,0.00036586865,0.00014248869],"domain_scores_gemma":[0.9984231,0.0008038231,0.00036959458,0.00004465224,0.0002868067,0.000072050185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005592063,0.000075838034,0.00012203366,0.0002166133,0.00009323626,0.00007431139,0.00018197272,0.000041221672,0.00004803815],"category_scores_gemma":[0.00036833406,0.00005108697,0.00006109217,0.00013579935,0.000052563006,0.00024490792,0.000048754802,0.00013794763,0.0000096092845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016916248,0.00050342374,0.021857286,0.000028018874,0.0007909828,0.000031713727,0.004935787,0.00003496332,0.00020493595,0.5122384,0.017392678,0.44181266],"study_design_scores_gemma":[0.0016878921,0.00043062537,0.03661074,0.00008130692,0.000115663424,0.002072954,0.0034464072,0.003287486,0.00062190735,0.9396738,0.011704416,0.00026681507],"about_ca_topic_score_codex":0.000002960099,"about_ca_topic_score_gemma":4.925812e-7,"teacher_disagreement_score":0.44154584,"about_ca_system_score_codex":0.00003495738,"about_ca_system_score_gemma":0.000024487726,"threshold_uncertainty_score":0.20832661},"labels":[],"label_agreement":null},{"id":"W1971727877","doi":"10.1142/s0218196711006789","title":"APPROXIMATION OF GEODESICS IN METABELIAN GROUPS","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Geodesic; Abelian group; Wreath product; Bounded function; Product (mathematics); Polynomial; Group (periodic table); Finitely generated group; Finitely-generated abelian group","score_opus":0.05927282058742664,"score_gpt":0.3090718711445997,"score_spread":0.24979905055717308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971727877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88743985,0.00010401175,0.1112858,0.0001413885,0.00029699443,0.000045629324,0.0000012009702,0.0000043731966,0.0006807613],"genre_scores_gemma":[0.97420293,0.000035236957,0.025661016,0.000027871192,0.000055081855,7.6011446e-7,0.0000018260604,0.000005237225,0.000010052918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905217,0.000048926235,0.00051572674,0.00006560106,0.0002499498,0.0000676231],"domain_scores_gemma":[0.99896914,0.00016271447,0.00049607694,0.00003484897,0.00030721803,0.00003002658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039784593,0.00006435723,0.00017859649,0.00047266396,0.000010456212,0.000009596006,0.00013441767,0.000044036027,0.000035500467],"category_scores_gemma":[0.0001805398,0.00005579353,0.00005010119,0.00016370276,0.000043397784,0.00019746614,0.000026516873,0.00009267146,0.0000010811415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025041364,0.00063599146,0.023641082,0.0000651174,0.00031594207,0.00005326358,0.0064730532,0.0001176574,0.00058599655,0.8404514,0.0001798335,0.12723026],"study_design_scores_gemma":[0.0009985683,0.00017074333,0.058407128,0.000054456486,0.000031976208,0.00013858953,0.00063300086,0.00166627,0.0014650353,0.9363425,0.000019034274,0.00007274337],"about_ca_topic_score_codex":0.000017815422,"about_ca_topic_score_gemma":0.0000050883245,"teacher_disagreement_score":0.12715751,"about_ca_system_score_codex":0.000021889788,"about_ca_system_score_gemma":0.000028515151,"threshold_uncertainty_score":0.22751941},"labels":[],"label_agreement":null},{"id":"W1972299658","doi":"10.1142/s0218196709005342","title":"THE DIMENSION OF A VARIETY AND THE KERNEL OF A HYPERSUBSTITUTION","year":2009,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Variety (cybernetics); Dimension (graph theory); Kernel (algebra); Pure mathematics; Cardinality (data modeling); Complex dimension; Dimension function; Type (biology); Class (philosophy); Connection (principal bundle); Algebra over a field; Discrete mathematics; Hausdorff dimension; Computer science; Geometry; Artificial intelligence","score_opus":0.007575781180236461,"score_gpt":0.25167290188888297,"score_spread":0.2440971207086465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972299658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52860916,0.0008408351,0.46749955,0.0026899267,0.00022977086,0.000044818036,3.3804537e-7,0.0000035962805,0.00008199185],"genre_scores_gemma":[0.99442536,0.0003064883,0.0050559714,0.00016137064,0.000045143257,3.0200098e-7,3.6541655e-7,0.0000010930262,0.0000039207926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992313,0.00004521465,0.0003125975,0.00006717907,0.00029284135,0.00005089472],"domain_scores_gemma":[0.99885136,0.00027085582,0.00042116403,0.000057449273,0.00037688436,0.000022312755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003769285,0.000053203774,0.000110114874,0.0000530527,0.000069593756,0.00004483982,0.00026164652,0.000019696741,3.3864177e-7],"category_scores_gemma":[0.00007207838,0.000028203105,0.000049756236,0.00008274643,0.00014520955,0.00027062974,0.000046929377,0.00007597455,1.502864e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022858691,0.000041541516,0.0002483924,0.0000027477047,0.000054046162,0.000004363256,0.0011093178,0.0017112697,0.0011747939,0.8153086,0.000028267732,0.18008812],"study_design_scores_gemma":[0.002868822,0.00040355686,0.058408543,0.00008123323,0.000028253644,0.00038747967,0.00019604445,0.10089005,0.0017037092,0.8348112,0.00013867528,0.00008244262],"about_ca_topic_score_codex":0.0000042878733,"about_ca_topic_score_gemma":6.0722795e-7,"teacher_disagreement_score":0.46581617,"about_ca_system_score_codex":0.000010516227,"about_ca_system_score_gemma":0.000031390035,"threshold_uncertainty_score":0.11500893},"labels":[],"label_agreement":null},{"id":"W1972975178","doi":"10.1142/s0218196703001316","title":"PRODUCTS OF COMMUTATORS IN FREE GROUPS","year":2003,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Rank (graph theory); Word (group theory); Combinatorics; Product (mathematics); Free product; Free group; Algebraic number; Infinity; Group (periodic table); Mathematical proof; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.009058940401390424,"score_gpt":0.24511721116582721,"score_spread":0.23605827076443678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972975178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8102909,0.0006754272,0.18643881,0.0014447217,0.0008646365,0.0000331078,8.8271713e-7,0.000007172163,0.00024435492],"genre_scores_gemma":[0.979327,0.00004252712,0.02046422,0.00011211851,0.00004352525,3.7645046e-7,6.978699e-7,0.0000029533423,0.00000657974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991494,0.00008360022,0.00033771503,0.00008262167,0.00028007964,0.00006658093],"domain_scores_gemma":[0.9992302,0.00010254772,0.0002706423,0.00008442302,0.0002839238,0.000028283519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046809347,0.00005655366,0.00011328911,0.0002285871,0.000012990122,0.00005106634,0.00041802033,0.00002328343,0.000003492964],"category_scores_gemma":[0.00012929308,0.000051264476,0.00003010262,0.00016414742,0.000034150675,0.0005222669,0.000058361085,0.0000860018,7.522973e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037999675,0.00030042557,0.0062137544,0.000024214218,0.000089744884,0.00010325467,0.0025912102,0.0017226514,0.001701216,0.86577326,0.0007880416,0.120654225],"study_design_scores_gemma":[0.002334098,0.000279001,0.04015616,0.00022292088,0.000009727851,0.0009929123,0.00032877325,0.018412383,0.011432461,0.92481655,0.0008278504,0.0001871862],"about_ca_topic_score_codex":0.0000067521332,"about_ca_topic_score_gemma":0.0000016144115,"teacher_disagreement_score":0.16903612,"about_ca_system_score_codex":0.000024320421,"about_ca_system_score_gemma":0.000055393924,"threshold_uncertainty_score":0.20905048},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021119230757869124,"score_gpt":0.27765703927321606,"score_spread":0.2565378085153469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974491064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7152364,0.00001344713,0.28452384,0.000061838844,0.00008387749,0.00004681043,0.000002036492,0.0000022596676,0.000029478715],"genre_scores_gemma":[0.9903628,0.0000050710473,0.009592677,0.000004485827,0.000020388949,5.300764e-7,0.000005642498,0.0000049658975,0.0000034125133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913126,0.000025171992,0.00042737095,0.00005592856,0.00031881052,0.000041484862],"domain_scores_gemma":[0.9990942,0.00012039338,0.0005216203,0.000027872526,0.00021337919,0.000022520353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008645545,0.000060947135,0.00015308705,0.0001850523,0.000011880738,0.0000099824965,0.000051580115,0.000030467148,0.000003098978],"category_scores_gemma":[0.0000767544,0.0000439704,0.000037935522,0.00007845336,0.000028814722,0.00020016637,0.000010203307,0.000058701433,1.0404853e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001698706,0.0017947928,0.014577138,0.00011016337,0.000214771,0.000019662717,0.004113995,0.06289043,0.022654474,0.8806495,0.0000046343566,0.011271729],"study_design_scores_gemma":[0.0031629389,0.0024207127,0.08922346,0.0011749193,0.000034664423,0.00006243522,0.00078191364,0.0030094231,0.0061844825,0.8938139,0.000003553362,0.00012755876],"about_ca_topic_score_codex":0.000027279684,"about_ca_topic_score_gemma":0.00002827131,"teacher_disagreement_score":0.27512643,"about_ca_system_score_codex":0.00007122529,"about_ca_system_score_gemma":0.000018348444,"threshold_uncertainty_score":0.1793061},"labels":[],"label_agreement":null},{"id":"W1974513041","doi":"10.1142/s0218196704001785","title":"INVOLUTED SEMILATTICES AND UNCERTAINTY IN TERNARY ALGEBRAS","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semilattice; Mathematics; Ternary operation; Involution (esoterism); Binary operation; Combinatorics; Pure mathematics; Discrete mathematics; Algebra over a field; Semigroup; Computer science","score_opus":0.012103922351947892,"score_gpt":0.2727965309903978,"score_spread":0.2606926086384499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974513041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74550575,0.00056909554,0.2513494,0.0020895086,0.0003572598,0.000040963307,6.6049455e-7,0.000015174702,0.0000721905],"genre_scores_gemma":[0.9779823,0.00019136856,0.021194661,0.00051458366,0.00010480214,0.0000010394025,0.0000019723625,0.000004377391,0.0000049051787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899817,0.00003756978,0.00037005253,0.00016780506,0.0003111071,0.00011528589],"domain_scores_gemma":[0.99930894,0.00010002011,0.00026150438,0.00005589256,0.00019769165,0.00007596346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020274585,0.00010456554,0.00014949772,0.00028503724,0.000038054346,0.00013528895,0.00034120277,0.000042935106,0.00000177748],"category_scores_gemma":[0.00004267943,0.00009081033,0.000034645134,0.00015408263,0.00005309115,0.0009649512,0.00012007852,0.00015507897,0.0000017295165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022202375,0.00042587763,0.031458087,0.000037355443,0.0002395255,0.0010779653,0.0071856705,0.11184753,0.0023116427,0.478149,0.000093943476,0.36695138],"study_design_scores_gemma":[0.002563536,0.00028912278,0.1444924,0.00017429353,0.0000092410655,0.001013149,0.00021977883,0.039897267,0.00023235704,0.810743,0.00015815739,0.0002077228],"about_ca_topic_score_codex":0.000025506037,"about_ca_topic_score_gemma":0.000013543649,"teacher_disagreement_score":0.36674365,"about_ca_system_score_codex":0.00007150262,"about_ca_system_score_gemma":0.000067405716,"threshold_uncertainty_score":0.3703138},"labels":[],"label_agreement":null},{"id":"W1975970681","doi":"10.1142/s0218196707003937","title":"LINEAR GROUPS OVER LOCALLY FINITE EXTENSIONS OF INFINITE FIELDS","year":2007,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Separable space; Field extension; Integer (computer science); Extension (predicate logic); Combinatorics; Field (mathematics); Finite field; Identity (music); Group (periodic table); Algebraic number; Zero (linguistics); Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.02404587016073457,"score_gpt":0.33837240877834807,"score_spread":0.3143265386176135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975970681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55689436,0.00007044218,0.442375,0.00014458825,0.0003067149,0.000026264044,0.0000022279826,0.0000056613803,0.00017470556],"genre_scores_gemma":[0.98101836,0.00005062802,0.018362382,0.0002445697,0.00028099446,2.3234887e-7,0.0000040184523,0.000008914868,0.000029917204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877495,0.00002171996,0.000606347,0.000082089355,0.00041718627,0.0000977268],"domain_scores_gemma":[0.99776095,0.0009281874,0.00051474053,0.000054819342,0.00067434914,0.000066971035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039924114,0.00009052307,0.00018414055,0.00030538507,0.00002983312,0.00001699046,0.00013501711,0.000067119756,0.00003703142],"category_scores_gemma":[0.00041870377,0.00007807248,0.00009131103,0.00013467854,0.00004801544,0.00022149074,0.000047131216,0.0001743148,0.000002026504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019188881,0.001331037,0.0238393,0.00019978224,0.0013488748,0.00065144757,0.0054763593,0.016689427,0.004930724,0.5512999,0.0020306932,0.39028355],"study_design_scores_gemma":[0.0018299916,0.00041698656,0.03748645,0.00027210554,0.00006225983,0.00026924844,0.00036632217,0.007970181,0.0021656356,0.9486141,0.00035965268,0.00018706021],"about_ca_topic_score_codex":0.0000017237325,"about_ca_topic_score_gemma":0.0000058150117,"teacher_disagreement_score":0.42412394,"about_ca_system_score_codex":0.000019733747,"about_ca_system_score_gemma":0.00003231667,"threshold_uncertainty_score":0.3183703},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.032912760986701387,"score_gpt":0.34627129437770526,"score_spread":0.3133585333910039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978172160","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5552264,0.00007687983,0.4414089,0.0014175746,0.0012677856,0.00027598246,0.000004372715,0.000018310355,0.00030381334],"genre_scores_gemma":[0.9005617,0.000016265187,0.09870143,0.00013914907,0.00045666774,0.0000120965615,0.0000030487085,0.000017139742,0.000092518654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989569,0.000019981813,0.0005215756,0.00007985688,0.0003164247,0.00010526955],"domain_scores_gemma":[0.9977155,0.0007101992,0.00053977186,0.000048268266,0.0009237185,0.00006256665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002222276,0.000098610115,0.00020073092,0.00012982287,0.000041247673,0.000101860765,0.00018334803,0.000044853994,0.00003597516],"category_scores_gemma":[0.00043441172,0.00008429263,0.00008564036,0.000043372063,0.000023517794,0.00044974862,0.00003732214,0.000079207224,0.000006016217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017032289,0.00028799163,0.00020626336,0.00010214977,0.0004291875,0.000008820895,0.0008987586,0.000288158,0.0033689768,0.8811847,0.012587906,0.10046675],"study_design_scores_gemma":[0.001133601,0.00014761207,0.00021304742,0.000066573375,0.00002844284,0.00010198122,0.000115822615,0.005811078,0.0013046688,0.99034864,0.0006389184,0.00008959965],"about_ca_topic_score_codex":0.000003055509,"about_ca_topic_score_gemma":6.0760203e-7,"teacher_disagreement_score":0.3453353,"about_ca_system_score_codex":0.00005791807,"about_ca_system_score_gemma":0.00004040263,"threshold_uncertainty_score":0.34373537},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.00472986314400044,"score_gpt":0.23381544225607148,"score_spread":0.22908557911207103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979037305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77119553,0.0007196825,0.22658223,0.00084587105,0.00039214903,0.000025892132,0.0000013849298,0.000006287402,0.00023095014],"genre_scores_gemma":[0.9947942,0.00005878908,0.004991772,0.00004444798,0.00009002872,3.358829e-7,0.0000010580026,0.0000023303496,0.000017034936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991256,0.000039158997,0.00040839246,0.00005871141,0.00031254784,0.000055572775],"domain_scores_gemma":[0.998686,0.0003140225,0.0005247211,0.00005595804,0.0004018166,0.000017477389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032803562,0.00005091552,0.00010459697,0.000090588386,0.000030576775,0.000064910804,0.00040898006,0.000018786397,0.0000019343624],"category_scores_gemma":[0.000026059175,0.000034708195,0.00005810738,0.00008370481,0.00006838972,0.00025921583,0.00006285407,0.000052854833,4.877678e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091993345,0.00014230052,0.003415773,0.000014501009,0.00016201974,0.000018561892,0.00070185144,0.0023330345,0.010875703,0.69156384,0.00096568896,0.28971472],"study_design_scores_gemma":[0.0014952398,0.00033530928,0.08489105,0.00023396606,0.000024965717,0.00039211087,0.00028503212,0.10307812,0.029310482,0.7785565,0.00123644,0.00016075585],"about_ca_topic_score_codex":0.000020883996,"about_ca_topic_score_gemma":0.0000028155291,"teacher_disagreement_score":0.28955397,"about_ca_system_score_codex":0.000010781332,"about_ca_system_score_gemma":0.000032376276,"threshold_uncertainty_score":0.14153591},"labels":[],"label_agreement":null},{"id":"W1981159076","doi":"10.1142/s0218196709005408","title":"PRIMITIVE POSITIVE FORMULAS PREVENTING A FINITE BASIS OF QUASI-EQUATIONS","year":2009,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mathematics; Unary operation; Finite graph; Basis (linear algebra); Graph; Algebra over a field; Pure mathematics; Discrete mathematics; Geometry","score_opus":0.013717427279730004,"score_gpt":0.2857477762662141,"score_spread":0.2720303489864841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981159076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17772268,0.00011646908,0.8203357,0.0012630197,0.00019978885,0.000055923614,0.0000024626452,0.000010838346,0.00029313326],"genre_scores_gemma":[0.95545685,0.000032853062,0.044108294,0.00029439633,0.000088241155,6.3799365e-7,0.0000042476545,0.0000027687208,0.000011692783],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989046,0.000055848403,0.00044418726,0.000121969424,0.0003783997,0.00009501714],"domain_scores_gemma":[0.9982264,0.0003591347,0.00058845896,0.000055477834,0.0007189723,0.00005155707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020997571,0.000088569286,0.00015727698,0.00024327301,0.000053207492,0.000074987605,0.00031582595,0.000032068383,0.000003270015],"category_scores_gemma":[0.00015738014,0.000078865545,0.00009178947,0.0001628312,0.000027081429,0.0009115781,0.000048949754,0.00010496876,0.0000014280765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076210796,0.0003684037,0.0006341344,0.0000067318497,0.0001624873,0.00004411674,0.0031257852,0.008619665,0.0016855279,0.34553385,0.00003086003,0.6397122],"study_design_scores_gemma":[0.0019912522,0.0018279278,0.10473573,0.00034634818,0.000044941025,0.00029498685,0.00032444426,0.23375574,0.009197631,0.6471298,0.00005591819,0.00029534046],"about_ca_topic_score_codex":0.0000020213604,"about_ca_topic_score_gemma":6.107557e-7,"teacher_disagreement_score":0.7777342,"about_ca_system_score_codex":0.000037330225,"about_ca_system_score_gemma":0.00006340257,"threshold_uncertainty_score":0.32160437},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07059615617374809,"score_gpt":0.31977167306525106,"score_spread":0.24917551689150297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986453029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.992373,0.00009528387,0.004054587,0.002008358,0.00025718423,0.00007748738,0.0000026353166,0.0000044090216,0.0011270846],"genre_scores_gemma":[0.9940479,0.000006056185,0.005739755,0.00006447231,0.00007632552,6.1490596e-7,0.0000012887268,0.0000050505037,0.000058577258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989289,0.000108313085,0.00047778565,0.00006607961,0.0003484592,0.00007046442],"domain_scores_gemma":[0.998688,0.0002561182,0.0005307831,0.000041208186,0.00044175598,0.000042138734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047208223,0.0000674639,0.00018779328,0.00020540535,0.000016698612,0.000014548321,0.00020209048,0.0000399838,0.000020043717],"category_scores_gemma":[0.00035861274,0.000047149253,0.000054031527,0.0001822673,0.00017441569,0.00014714403,0.0000665932,0.00014194248,0.00000319307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034932402,0.0006597594,0.032070532,0.000041742787,0.00034817102,0.00003801733,0.0087474445,0.0012002989,0.00050243095,0.93495286,0.0029037865,0.018185625],"study_design_scores_gemma":[0.001397593,0.00013053269,0.052393895,0.000069705726,0.000016808524,0.00021221016,0.00045319265,0.0019723342,0.00014087181,0.94306165,0.00009440666,0.000056804056],"about_ca_topic_score_codex":0.000015159766,"about_ca_topic_score_gemma":0.000004516173,"teacher_disagreement_score":0.020323364,"about_ca_system_score_codex":0.000048106354,"about_ca_system_score_gemma":0.00007976332,"threshold_uncertainty_score":0.19226907},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016918195685207152,"score_gpt":0.2988823422422948,"score_spread":0.2819641465570877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987022760","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98026204,0.00010045165,0.016051358,0.0024313633,0.00074084155,0.000055903325,0.0000034322895,0.00001165566,0.00034294228],"genre_scores_gemma":[0.98628294,0.000026894992,0.013309014,0.00012179549,0.00021505672,0.0000010427138,0.0000026812384,0.000008125545,0.00003243396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989898,0.00004631612,0.00043660478,0.00010852995,0.00031767698,0.00010105136],"domain_scores_gemma":[0.99885374,0.0004799879,0.00031309892,0.00006263278,0.0002248616,0.00006568548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004156814,0.00009265287,0.00019095224,0.00043205536,0.000029819535,0.00006626932,0.00022393117,0.00007630406,0.00004812556],"category_scores_gemma":[0.0004240512,0.000081954364,0.00003475733,0.00012172627,0.00008793653,0.00019143759,0.00008584187,0.00029724019,0.0000012451261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046728848,0.0005858232,0.03822173,0.000059636015,0.00035971447,0.00046023895,0.0047416496,0.0001999246,0.00533372,0.82726073,0.0038524498,0.118457064],"study_design_scores_gemma":[0.0022893082,0.00016836551,0.12707165,0.00004830859,0.000021349713,0.00072622136,0.0003304635,0.0023083151,0.00021084056,0.866504,0.00020342386,0.00011771912],"about_ca_topic_score_codex":0.000015296018,"about_ca_topic_score_gemma":0.00006126324,"teacher_disagreement_score":0.118339345,"about_ca_system_score_codex":0.000015760088,"about_ca_system_score_gemma":0.00004300458,"threshold_uncertainty_score":0.33420017},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subvariety; Mathematics; Semigroup; Lattice (music); Variety (cybernetics); Pure mathematics; Property (philosophy); Statistics","score_opus":0.01865502722225417,"score_gpt":0.2790667050779938,"score_spread":0.26041167785573965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987579327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4188344,0.00009563921,0.58029246,0.00037150062,0.00022540915,0.000023791803,4.0542326e-7,0.00001454503,0.00014184995],"genre_scores_gemma":[0.82156754,0.00001555758,0.17767161,0.00044325556,0.00027924226,3.9384253e-7,0.0000035747235,0.000005138296,0.000013687615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99879444,0.00003319533,0.00038081728,0.00015465323,0.0004944433,0.00014242824],"domain_scores_gemma":[0.9987453,0.00018095649,0.00040151857,0.00006224381,0.00052805885,0.00008188175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042247074,0.0001128534,0.00013854416,0.00015593154,0.000097006625,0.00023612785,0.00038235166,0.00003674567,0.000005025097],"category_scores_gemma":[0.000028717863,0.00008828599,0.000044331988,0.00013191174,0.00006162908,0.00066309626,0.00008725789,0.00013580575,0.0000015327622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007802121,0.00043283927,0.044878203,0.00004189465,0.0007324194,0.0008458824,0.008787017,0.035223823,0.019233126,0.47800994,0.0007848581,0.4102498],"study_design_scores_gemma":[0.0059254426,0.003055156,0.50473005,0.0002325283,0.000092782364,0.0068456223,0.0020348064,0.326183,0.0075395326,0.13884152,0.0033748785,0.0011446793],"about_ca_topic_score_codex":0.0000047231774,"about_ca_topic_score_gemma":0.0000072720172,"teacher_disagreement_score":0.45985186,"about_ca_system_score_codex":0.00003103644,"about_ca_system_score_gemma":0.000049792965,"threshold_uncertainty_score":0.3600198},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01822019773730268,"score_gpt":0.29881937150174326,"score_spread":0.2805991737644406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989241301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94293284,0.000057166602,0.055554487,0.00014376437,0.000942195,0.000043765296,0.000002432571,0.0000060369343,0.00031733158],"genre_scores_gemma":[0.99665487,0.000012705354,0.0031471362,0.000030970823,0.00013099458,1.2659751e-7,0.0000019495099,0.000007965882,0.000013301222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987857,0.000025971767,0.00053430354,0.00007223348,0.0005065287,0.00007526484],"domain_scores_gemma":[0.9980925,0.00044875374,0.00072059646,0.000049827628,0.00064292084,0.00004541776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031810772,0.000087554705,0.00021577362,0.00023078822,0.000020400334,0.000012911693,0.0001742486,0.000055493514,0.000023197807],"category_scores_gemma":[0.00012369738,0.00007449275,0.00008522639,0.00008322957,0.00007888085,0.00012828509,0.000031419786,0.000101746,3.3135538e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030085654,0.000090302,0.0003988285,0.000016342958,0.00017173834,0.000017127903,0.00089880335,0.00023785897,0.0005385019,0.9890517,0.00015474061,0.008123212],"study_design_scores_gemma":[0.00095672935,0.00038121786,0.004112248,0.00007461583,0.00003511512,0.0000598645,0.00027783404,0.00032345147,0.007578444,0.98611695,0.000022898368,0.000060632075],"about_ca_topic_score_codex":0.000013667938,"about_ca_topic_score_gemma":0.000002281619,"teacher_disagreement_score":0.053722028,"about_ca_system_score_codex":0.000040523875,"about_ca_system_score_gemma":0.000058446305,"threshold_uncertainty_score":0.30377263},"labels":[],"label_agreement":null},{"id":"W1991942795","doi":"10.1142/s0218196707004025","title":"COMMUTATOR SUBGROUPS OF FREE NILPOTENT GROUPS","year":2007,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Free group; Rank (graph theory); Commutator subgroup; Nilpotent; Normal subgroup; Quotient; Group (periodic table); Commutator; Algebra over a field; Physics; Pure mathematics","score_opus":0.03963353589987911,"score_gpt":0.3498614374257473,"score_spread":0.3102279015258682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991942795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8564003,0.00010765651,0.14220613,0.00039096552,0.00036550593,0.000060584596,0.000005447947,0.000008189163,0.0004552032],"genre_scores_gemma":[0.9879147,0.000019164092,0.011752921,0.00006040422,0.00021724743,4.0915327e-7,0.0000038669036,0.000012573957,0.000018729897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983225,0.00007777184,0.0006486145,0.00007862106,0.00075056264,0.000121966084],"domain_scores_gemma":[0.99750406,0.00095502305,0.0005111113,0.00009327,0.0008565271,0.00008000104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015162935,0.0000887571,0.00019481569,0.0003415395,0.000032827298,0.000046911453,0.00038991045,0.000051135023,0.000033127493],"category_scores_gemma":[0.00044362235,0.00007783272,0.00009091922,0.00010823412,0.00009369184,0.00020979061,0.00010901432,0.00019299195,0.000002329793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021511565,0.0010788648,0.015700001,0.00016113803,0.00098407,0.00039144378,0.00671292,0.0002086677,0.013709756,0.84414333,0.0027910345,0.11196764],"study_design_scores_gemma":[0.0018996084,0.00039058726,0.023589067,0.00013510259,0.00002786745,0.00049303094,0.00090804463,0.0011800571,0.004668491,0.9664612,0.00013298604,0.00011399107],"about_ca_topic_score_codex":0.0000065112254,"about_ca_topic_score_gemma":0.0000066604866,"teacher_disagreement_score":0.13151437,"about_ca_system_score_codex":0.000063100175,"about_ca_system_score_gemma":0.000038516402,"threshold_uncertainty_score":0.31739262},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021491115994086853,"score_gpt":0.2859370068847025,"score_spread":0.26444589089061565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992217715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34620517,0.00008374347,0.6510643,0.0017906049,0.00047393228,0.00007310075,0.0000048945576,0.000018311126,0.00028596897],"genre_scores_gemma":[0.9175495,0.000015841251,0.08191811,0.00038167535,0.00009873116,0.0000024389715,0.000013559708,0.000004873409,0.00001526558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986036,0.000062134226,0.00056214945,0.00014653616,0.0005110156,0.00011458657],"domain_scores_gemma":[0.99788755,0.0002076445,0.0005637724,0.00007654374,0.0011732093,0.00009129967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014812218,0.00011168838,0.0002007514,0.00026102547,0.000066754445,0.0001320901,0.000496199,0.00004118946,0.000054398643],"category_scores_gemma":[0.000044407545,0.000100111276,0.000088551045,0.00015695118,0.0001617843,0.0010394548,0.00011357655,0.00013456678,0.00001640209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002765228,0.00030682638,0.0031985322,0.000017926352,0.00024641358,0.000041348823,0.0010714256,0.0419537,0.0010052776,0.891934,0.0011216396,0.059075266],"study_design_scores_gemma":[0.0007526545,0.00017893322,0.09748842,0.000039552586,0.000009934128,0.00041424736,0.00007751169,0.11414961,0.0002098039,0.786491,0.00007431885,0.0001140519],"about_ca_topic_score_codex":0.000022490754,"about_ca_topic_score_gemma":0.0000011764687,"teacher_disagreement_score":0.5713443,"about_ca_system_score_codex":0.000037940586,"about_ca_system_score_gemma":0.00008087112,"threshold_uncertainty_score":0.40824196},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017270216816107443,"score_gpt":0.25289321984143515,"score_spread":0.2356230030253277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993691575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6925459,0.00020606707,0.3061979,0.00021281387,0.0006025168,0.000031539144,0.0000031576712,0.000020264219,0.000179856],"genre_scores_gemma":[0.9434476,0.000045836372,0.05614133,0.00019727142,0.00015274448,8.033316e-7,0.0000027752978,0.000006012384,0.0000056113868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881566,0.00006808317,0.0004683778,0.00012845524,0.00042616483,0.00009327224],"domain_scores_gemma":[0.99890417,0.00010307695,0.0005085789,0.00012893649,0.00030038998,0.00005484767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004011136,0.00009462811,0.00016152977,0.00022270468,0.000037592497,0.00007348861,0.00077424303,0.000038388916,0.000021794762],"category_scores_gemma":[0.000047621274,0.00008203304,0.0000795404,0.00010891677,0.00004008922,0.0008180003,0.00022719006,0.00009363253,0.0000018300597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033861527,0.0009080849,0.008951004,0.000066601504,0.0009329773,0.00044477909,0.014500536,0.002418571,0.03302903,0.45553887,0.004020097,0.47885084],"study_design_scores_gemma":[0.00302246,0.0006407399,0.11554394,0.00024427872,0.00003592039,0.000689483,0.00018463211,0.58261174,0.005639523,0.29101852,0.000098551194,0.000270245],"about_ca_topic_score_codex":0.000017920762,"about_ca_topic_score_gemma":0.0000011926445,"teacher_disagreement_score":0.58019316,"about_ca_system_score_codex":0.000022776994,"about_ca_system_score_gemma":0.000050078357,"threshold_uncertainty_score":0.33452103},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04876440810557002,"score_gpt":0.3200468513484381,"score_spread":0.27128244324286804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997046888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9508747,0.00019430577,0.047719214,0.0007413306,0.00021093717,0.00010632394,0.000003999479,0.0000026336168,0.0001465575],"genre_scores_gemma":[0.9817652,0.000046208825,0.018083641,0.000034296376,0.000054852204,5.47594e-7,0.0000022423799,0.000004552866,0.000008435392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988186,0.00005782292,0.0006763609,0.000081897386,0.0002892841,0.00007604591],"domain_scores_gemma":[0.9984087,0.00033313545,0.00072945794,0.00005265748,0.00044358533,0.000032479355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005606131,0.00007154136,0.00019347382,0.00028495272,0.000027793503,0.000011101575,0.00013971709,0.000045735247,0.00001154078],"category_scores_gemma":[0.00014623973,0.000052882864,0.00004901924,0.00021195304,0.00019595445,0.00010052318,0.000045294186,0.00011575162,1.4722818e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027169278,0.0007773822,0.033130996,0.00014312031,0.000347528,0.000021096641,0.004082653,0.0006463125,0.010428933,0.8371934,0.0003283217,0.11262853],"study_design_scores_gemma":[0.0010548017,0.00014214,0.3657953,0.00009861279,0.000029943882,0.0002255064,0.0008726276,0.0027788712,0.0016718598,0.6272442,0.000017414644,0.00006871737],"about_ca_topic_score_codex":0.00003234566,"about_ca_topic_score_gemma":0.000028816417,"teacher_disagreement_score":0.3326643,"about_ca_system_score_codex":0.000024965153,"about_ca_system_score_gemma":0.00004436223,"threshold_uncertainty_score":0.21565007},"labels":[],"label_agreement":null},{"id":"W2000843168","doi":"10.1142/s0218196708004445","title":"THE FOX PROBLEM FOR FREE RESTRICTED LIE ALGEBRAS","year":2008,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Subalgebra; Ideal (ethics); Associative property; Universal enveloping algebra; Algebra over a field; Lie algebra; Pure mathematics","score_opus":0.04224812579995701,"score_gpt":0.3313063555246964,"score_spread":0.2890582297247394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000843168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6492664,0.00047050416,0.3445665,0.003997459,0.0009429782,0.0002539669,0.000007852755,0.00002973833,0.0004645882],"genre_scores_gemma":[0.8764329,0.000275838,0.12229473,0.00016752834,0.0005521115,0.00001164248,0.0000054606085,0.000022614298,0.0002371811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987292,0.000041330244,0.0005364464,0.00010634601,0.00045988153,0.0001267726],"domain_scores_gemma":[0.99718887,0.0012448563,0.0005502013,0.0001004072,0.00086956256,0.00004611838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024072127,0.00010530793,0.00014914844,0.000110079956,0.00020927784,0.00006647326,0.00040564273,0.000050160186,0.0000044572416],"category_scores_gemma":[0.00080051366,0.00007632127,0.00009291795,0.00008085185,0.00009275038,0.00023947054,0.000071966046,0.0001578579,0.0000013202969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026198788,0.00011743988,0.00034963878,0.00001865091,0.00030059385,0.000044302447,0.0008045519,0.00010955797,0.00028263102,0.93970054,0.010953077,0.047057036],"study_design_scores_gemma":[0.0012460131,0.00015803293,0.0017518634,0.00004115531,0.000022743594,0.00045675933,0.00006802748,0.0006886581,0.00042740136,0.9902666,0.0047874125,0.000085322405],"about_ca_topic_score_codex":0.0000014497266,"about_ca_topic_score_gemma":0.000003259902,"teacher_disagreement_score":0.22716647,"about_ca_system_score_codex":0.00006107847,"about_ca_system_score_gemma":0.00008171697,"threshold_uncertainty_score":0.3112291},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011680712921872874,"score_gpt":0.2636204136391523,"score_spread":0.2519397007172794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001772188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6408274,0.00011745474,0.35616064,0.0020990113,0.0004937038,0.00002936854,0.000001690866,0.00002215338,0.0002485196],"genre_scores_gemma":[0.9751537,0.000039891474,0.023687664,0.0007789836,0.00031554967,8.080965e-7,0.0000032400706,0.0000065741333,0.000013609996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987248,0.00005888066,0.00046433497,0.00014335912,0.00050449354,0.0001041166],"domain_scores_gemma":[0.99895424,0.00016762204,0.00044021916,0.00010254959,0.00027608356,0.00005926716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033891056,0.00010438284,0.00016431767,0.00026971122,0.000037650407,0.0001355481,0.0005467817,0.000041218973,0.000010967433],"category_scores_gemma":[0.000027225944,0.00008736652,0.00008551822,0.00010129127,0.0000336424,0.0007133456,0.00010830209,0.00011072908,0.0000072171906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007457103,0.0002060423,0.0002508739,0.000009534238,0.00013943632,0.00003640293,0.0012284031,0.004955966,0.0033043046,0.7239259,0.0011559697,0.2647126],"study_design_scores_gemma":[0.003025405,0.0007013214,0.018432125,0.00032797625,0.000029466315,0.00092491746,0.00011601084,0.6227397,0.008381891,0.34291196,0.0020581123,0.00035115704],"about_ca_topic_score_codex":0.0000029550197,"about_ca_topic_score_gemma":0.0000012176778,"teacher_disagreement_score":0.61778367,"about_ca_system_score_codex":0.000048300768,"about_ca_system_score_gemma":0.000033421227,"threshold_uncertainty_score":0.35627034},"labels":[],"label_agreement":null},{"id":"W2007485755","doi":"10.1142/s0218196700000212","title":"DUALITY OF NORMALLY PRESENTED VARIETIES","year":2000,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Variety (cybernetics); Nilpotent; Duality (order theory); Type (biology); Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.01010103049099289,"score_gpt":0.270395409861572,"score_spread":0.26029437937057914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007485755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5259277,0.00015107477,0.47187775,0.00093201286,0.0002760181,0.000027890583,0.000001184601,0.000011731364,0.00079459365],"genre_scores_gemma":[0.983855,0.00009052584,0.015716782,0.00017094983,0.00009295888,4.3385637e-7,0.0000019417519,0.000002633909,0.00006875448],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898654,0.00005228226,0.00039188226,0.000094433984,0.00040050843,0.00007433473],"domain_scores_gemma":[0.9990764,0.000096994416,0.0002790531,0.000061796934,0.00043902177,0.00004670753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018897308,0.00006952371,0.00012923642,0.00011082103,0.000030287698,0.00006645327,0.00039095964,0.000028107876,0.000031057403],"category_scores_gemma":[0.000026824004,0.000058779107,0.00005860247,0.00010130226,0.000048992188,0.00070613134,0.0000524926,0.00008741894,0.0000032279124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024176543,0.00029959425,0.0045146323,0.000020704256,0.00025600576,0.000083820334,0.0023789995,0.016235406,0.0009957172,0.22097659,0.0004064703,0.7535903],"study_design_scores_gemma":[0.0028704607,0.00088837475,0.19287568,0.00012877739,0.00003544431,0.0010892767,0.00019085177,0.094344266,0.004400094,0.69902813,0.0037834544,0.0003651767],"about_ca_topic_score_codex":0.0000064124197,"about_ca_topic_score_gemma":7.0454615e-7,"teacher_disagreement_score":0.7532251,"about_ca_system_score_codex":0.000014765572,"about_ca_system_score_gemma":0.000044426157,"threshold_uncertainty_score":0.23969425},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01664893096638616,"score_gpt":0.24778814730120216,"score_spread":0.231139216334816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008283002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4685681,0.00018924302,0.5270657,0.0016668811,0.0021729767,0.00003301236,0.0000016342377,0.000034022352,0.0002684266],"genre_scores_gemma":[0.99047065,0.000034857032,0.008594949,0.0005620539,0.00031754622,8.1966726e-7,0.0000031195839,0.0000053878844,0.000010646337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988485,0.000070122725,0.00033840755,0.00012472876,0.00052562944,0.00009264298],"domain_scores_gemma":[0.9987527,0.00022556733,0.0003987022,0.0000771995,0.00048095675,0.00006487976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002630656,0.00009396018,0.00014692625,0.00020005832,0.0000904861,0.00014201357,0.00049128017,0.00004391437,0.000008610984],"category_scores_gemma":[0.000069649475,0.0000834139,0.00007224559,0.000119971926,0.000056509583,0.00057392835,0.000076675366,0.0001298987,0.00000464301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046129123,0.00079562725,0.020873023,0.00003649305,0.0004435275,0.0014664913,0.004010419,0.0084258765,0.0009073213,0.8197653,0.007106255,0.13570833],"study_design_scores_gemma":[0.0049714507,0.00071353157,0.1320991,0.00020523013,0.000028352995,0.002140453,0.00028296423,0.29569513,0.0023272773,0.5584704,0.0025966207,0.00046948594],"about_ca_topic_score_codex":0.000004906969,"about_ca_topic_score_gemma":4.0866797e-7,"teacher_disagreement_score":0.5219025,"about_ca_system_score_codex":0.000033474866,"about_ca_system_score_gemma":0.00009729691,"threshold_uncertainty_score":0.340152},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.022893004127309997,"score_gpt":0.272628341209779,"score_spread":0.24973533708246903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008543934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27029952,0.00032454808,0.7270021,0.00068156054,0.00078791234,0.00003151727,4.0277962e-7,0.000008226712,0.0008642263],"genre_scores_gemma":[0.9750649,0.00008274473,0.024584228,0.00016381315,0.000082735845,4.784225e-7,2.7717024e-7,0.0000024630651,0.000018409877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992381,0.00003874397,0.00030636272,0.00007110347,0.00027700665,0.00006873844],"domain_scores_gemma":[0.99895877,0.00015470135,0.0003583632,0.00006341812,0.00042884704,0.00003591663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022106593,0.000054851283,0.0000811579,0.00007644102,0.000048170627,0.000050765306,0.00049524667,0.000018642408,0.0000040028967],"category_scores_gemma":[0.000039491268,0.000035660618,0.000048841273,0.00007136021,0.00005348829,0.0004457622,0.00007916828,0.000078680074,0.000002593807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086230495,0.00009324629,0.0016380487,0.0000048478455,0.00014677574,0.000040565472,0.0026395174,0.00024057632,0.00045449255,0.59789276,0.00018004532,0.3965829],"study_design_scores_gemma":[0.0010259325,0.00048685313,0.052226048,0.000063665655,0.000021620168,0.0005645285,0.00026565403,0.019494196,0.0067878254,0.91770846,0.0011973239,0.00015790538],"about_ca_topic_score_codex":0.0000032634662,"about_ca_topic_score_gemma":8.7793745e-7,"teacher_disagreement_score":0.7047653,"about_ca_system_score_codex":0.000011366004,"about_ca_system_score_gemma":0.000030755942,"threshold_uncertainty_score":0.14541978},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02247522680363738,"score_gpt":0.3256685299822861,"score_spread":0.30319330317864873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009981653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69252634,0.00012039427,0.30536008,0.0007369102,0.0005714034,0.000037124846,0.0000016641732,0.00001536613,0.00063072424],"genre_scores_gemma":[0.92794424,0.000021258118,0.071023785,0.00010244464,0.00077264407,6.8871276e-7,0.0000043461223,0.000010420397,0.000120168974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990033,0.000026557247,0.00041979481,0.0000808983,0.00039271158,0.00007676596],"domain_scores_gemma":[0.9989415,0.00019186761,0.00036883002,0.00004242083,0.00042121732,0.000034171415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017515458,0.00008105899,0.00012702755,0.00012853646,0.00003179506,0.0000397025,0.0001428389,0.000038547845,0.00001855452],"category_scores_gemma":[0.00009266543,0.000071748414,0.00006238438,0.00004998809,0.000032540458,0.00020826336,0.000036600384,0.0001273939,0.0000038356256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010709095,0.0002820421,0.0029435924,0.000024466033,0.00018638978,0.00015460794,0.00035939948,0.0020334176,0.0015828168,0.946143,0.003437884,0.042745333],"study_design_scores_gemma":[0.0006302042,0.00006405037,0.003865447,0.00004905763,0.000019196512,0.00033251545,0.000049084563,0.002233311,0.001100776,0.9905474,0.0010274184,0.0000815382],"about_ca_topic_score_codex":0.0000044285684,"about_ca_topic_score_gemma":0.0000029124342,"teacher_disagreement_score":0.23541792,"about_ca_system_score_codex":0.000053332635,"about_ca_system_score_gemma":0.000023189761,"threshold_uncertainty_score":0.29258156},"labels":[],"label_agreement":null},{"id":"W2010786529","doi":"10.1142/s0218196708004792","title":"CORRIGENDUM: \"MINIMAL SEMIGROUPS GENERATING VARIETIES WITH COMPLEX SUBVARIETY LATTICES\"","year":2008,"lang":"en","type":"erratum","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subvariety; Mathematics; Pure mathematics; Algebra over a field; Variety (cybernetics); Statistics","score_opus":0.028872833159636967,"score_gpt":0.267831293975929,"score_spread":0.23895846081629202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010786529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011372521,0.001482564,0.9682522,0.00083196023,0.016297037,0.00012714206,0.000011894341,0.000061424136,0.0015632936],"genre_scores_gemma":[0.61768407,0.003534894,0.3526926,0.0035505036,0.010380833,0.00001523327,0.00056752097,0.00013386071,0.011440455],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972591,0.00011176126,0.00077482924,0.00040546592,0.0011923468,0.00025651348],"domain_scores_gemma":[0.99688816,0.00011978703,0.0014048493,0.00017116418,0.0012653163,0.00015072811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023945558,0.00036541352,0.00048287224,0.00034361734,0.00022110104,0.00047322715,0.0010596218,0.00021911973,0.000014603698],"category_scores_gemma":[0.0000507429,0.00029966803,0.00014774593,0.00021058098,0.00014965975,0.0008099257,0.00025461093,0.00079199753,0.0000053276312],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054814556,0.00058076676,0.002722448,0.00018108454,0.0022492167,0.002807388,0.0076822625,0.018540803,0.0005472532,0.06692549,0.78886795,0.10834721],"study_design_scores_gemma":[0.007072817,0.00510642,0.045996472,0.0013800574,0.00037749772,0.026739951,0.0008365475,0.61647457,0.0002650185,0.059718516,0.23270695,0.0033251927],"about_ca_topic_score_codex":0.000013845809,"about_ca_topic_score_gemma":0.000009374615,"teacher_disagreement_score":0.6155596,"about_ca_system_score_codex":0.00010473907,"about_ca_system_score_gemma":0.00044475755,"threshold_uncertainty_score":0.9999455},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012178697987665134,"score_gpt":0.2910119119142206,"score_spread":0.27883321392655547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012184402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95746213,0.0007027337,0.039978307,0.0008618251,0.00049145805,0.00008310388,0.0000027777824,0.0000057731017,0.00041188422],"genre_scores_gemma":[0.9960632,0.00015418562,0.0035406756,0.000088993955,0.00007066003,0.0000018767616,7.8261405e-7,0.00000987212,0.00006977064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892867,0.000111256864,0.0004456274,0.00009116893,0.00032261468,0.000100668854],"domain_scores_gemma":[0.998279,0.0007380494,0.0004735143,0.000084047235,0.00037693552,0.000048484042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003222463,0.00009996588,0.00014227649,0.00010482148,0.00017392142,0.000068874775,0.0001911316,0.00004055153,0.000007559007],"category_scores_gemma":[0.00023481766,0.00006077995,0.00008660987,0.0001439955,0.00010859623,0.00017398485,0.00004577151,0.00016610755,6.9000765e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014591409,0.0003651724,0.010737036,0.00006552074,0.000491608,0.000014085205,0.0018609809,0.0013332501,0.0065286765,0.9432044,0.0013339346,0.033919398],"study_design_scores_gemma":[0.0007925186,0.000112543756,0.009823174,0.000063504864,0.00006403241,0.00026337543,0.0003517456,0.00095010956,0.0060693067,0.98116314,0.00025524688,0.00009130443],"about_ca_topic_score_codex":0.000001204866,"about_ca_topic_score_gemma":0.000004468551,"teacher_disagreement_score":0.038601045,"about_ca_system_score_codex":0.000030752344,"about_ca_system_score_gemma":0.000050058326,"threshold_uncertainty_score":0.24785344},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008367005775459506,"score_gpt":0.25854745524928113,"score_spread":0.2501804494738216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018331071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42094263,0.00020990304,0.57621276,0.0022109146,0.0003148646,0.000018271028,5.7906055e-7,0.000014987968,0.00007506018],"genre_scores_gemma":[0.94787455,0.00006713259,0.05155872,0.00038627203,0.000103912855,4.4858172e-7,0.0000014920397,0.0000032114733,0.0000042470265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993363,0.000022301829,0.00024057945,0.000098430864,0.0002377901,0.00006460557],"domain_scores_gemma":[0.99940836,0.00007624709,0.00017824485,0.00004082188,0.00023542788,0.000060874758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016868186,0.00006524297,0.000090428366,0.00016755084,0.00005081729,0.0002075013,0.00024283037,0.000023909877,0.000001656857],"category_scores_gemma":[0.000020488782,0.000057843718,0.000031579435,0.00007901049,0.000038640148,0.00060819974,0.00008080162,0.00007701616,0.0000024956607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021912661,0.00010775888,0.0010573112,0.000007246731,0.00012046293,0.000092613474,0.0023268235,0.012254538,0.0009045498,0.6068761,0.00012557289,0.37610513],"study_design_scores_gemma":[0.0018683979,0.00024112625,0.04700223,0.00009710537,0.00001391501,0.001497639,0.00018197775,0.074348204,0.0008056658,0.87350327,0.00027778227,0.00016266046],"about_ca_topic_score_codex":0.000006831863,"about_ca_topic_score_gemma":7.988733e-7,"teacher_disagreement_score":0.52693194,"about_ca_system_score_codex":0.000027531254,"about_ca_system_score_gemma":0.000045685596,"threshold_uncertainty_score":0.23587984},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Function (biology); Group (periodic table); Algebra over a field; Discrete mathematics; Pure mathematics; Combinatorics","score_opus":0.010735791329896757,"score_gpt":0.2789840881832381,"score_spread":0.26824829685334134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022032736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7293782,0.000049409104,0.26833528,0.00045541883,0.000267234,0.000045195182,0.0000052842183,0.0000059659556,0.0014580035],"genre_scores_gemma":[0.9945607,0.000008149223,0.0051240292,0.00006966938,0.00014724246,4.9478217e-7,0.0000037236457,0.00000695943,0.00007900272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910235,0.00003307637,0.00033895203,0.00007547997,0.00037175414,0.00007840119],"domain_scores_gemma":[0.9980935,0.00083907536,0.0004148613,0.000054983422,0.0005562267,0.000041395073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039026886,0.000077936245,0.0001535484,0.00034063056,0.000037357822,0.000017393582,0.00013258612,0.00004013735,0.00003097714],"category_scores_gemma":[0.00026741752,0.000057357112,0.00005045477,0.00012694323,0.00009789903,0.00010203968,0.000025880741,0.000116360665,0.00000120612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062191754,0.00019598957,0.001029826,0.000008856036,0.000344002,0.00004738238,0.0006950523,0.00013992864,0.000102518825,0.97925884,0.0005486938,0.017006986],"study_design_scores_gemma":[0.0012411458,0.0009353741,0.020739287,0.00008298811,0.000052343366,0.0003734501,0.0012028962,0.00007594959,0.0010701981,0.97411126,0.00004220414,0.00007288427],"about_ca_topic_score_codex":0.0000039720885,"about_ca_topic_score_gemma":0.0000068310233,"teacher_disagreement_score":0.26518252,"about_ca_system_score_codex":0.000029522444,"about_ca_system_score_gemma":0.000029205465,"threshold_uncertainty_score":0.23389551},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014341299508014731,"score_gpt":0.2667221476711002,"score_spread":0.2523808481630855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027466518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16679204,0.0006084813,0.82535374,0.0010240861,0.002391233,0.000060094728,1.8992318e-7,0.000030549254,0.003739617],"genre_scores_gemma":[0.9945978,0.00003734281,0.0047599757,0.00025630597,0.00017456357,0.0000012485506,0.0000015433205,0.0000046424507,0.00016658817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989193,0.00007039168,0.00033951004,0.00013033544,0.00043104088,0.00010938692],"domain_scores_gemma":[0.99898237,0.000063234525,0.00031249144,0.00006721612,0.0004977543,0.000076920755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034483103,0.00009235319,0.0001297472,0.00016053447,0.000100468715,0.00025919836,0.00036370303,0.000041646592,0.000017215345],"category_scores_gemma":[0.000078112644,0.000076177836,0.0000642639,0.00011477721,0.000035423407,0.0006044109,0.00006601484,0.00010211829,0.000016267823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009309842,0.00005695678,0.00085598393,0.0000035587063,0.00007761566,0.00005530649,0.0013099315,0.00018102418,0.00009199746,0.9542648,0.00039085557,0.042702667],"study_design_scores_gemma":[0.0009847307,0.0005211148,0.002455808,0.000012234092,0.000014840112,0.0019522537,0.00026597464,0.0040183114,0.001988683,0.96341294,0.024178792,0.00019431389],"about_ca_topic_score_codex":0.000018002214,"about_ca_topic_score_gemma":0.0000025290556,"teacher_disagreement_score":0.82780576,"about_ca_system_score_codex":0.00003508032,"about_ca_system_score_gemma":0.00010354055,"threshold_uncertainty_score":0.3106442},"labels":[],"label_agreement":null},{"id":"W2031779562","doi":"10.1142/s0218196710005686","title":"WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY","year":2010,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Alexander von Humboldt-Stiftung","keywords":"Mathematics; Operand; Iterated function; Bracketing (phenomenology); Product (mathematics); Block (permutation group theory); Wreath product; Discrete mathematics; Order (exchange); Bounded function; Arithmetic; Combinatorics","score_opus":0.0204166035587952,"score_gpt":0.28292010656889227,"score_spread":0.26250350301009706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031779562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7756835,0.00011498932,0.21807027,0.005593717,0.00033245236,0.00009564195,0.0000025966306,0.000021709538,0.00008509436],"genre_scores_gemma":[0.9605591,0.000019503703,0.03861538,0.0005842254,0.00020225189,0.0000026302525,0.000002525391,0.000003314413,0.000011048908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993277,0.000025564004,0.00022185348,0.00015915312,0.00019413968,0.000071590635],"domain_scores_gemma":[0.99920356,0.00007543722,0.00015292231,0.000067103494,0.00041157144,0.0000893972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023194162,0.00007513103,0.000098835524,0.00015260545,0.00006776869,0.00028299313,0.00023945622,0.000027515207,0.0000025337604],"category_scores_gemma":[0.00003700848,0.00006422617,0.000014113003,0.00011850657,0.00005956888,0.00036292884,0.00012396742,0.00012343787,0.0000024042592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045390334,0.00014479856,0.0015983434,0.000019711633,0.00009204198,0.00002641238,0.001396301,0.00018049746,0.038971823,0.6154293,0.00047254053,0.34162286],"study_design_scores_gemma":[0.0015391754,0.0004804037,0.19181672,0.00009990349,0.000031184874,0.003876461,0.00015987219,0.088499926,0.0051301634,0.70050246,0.0074053057,0.000458402],"about_ca_topic_score_codex":0.0000047920157,"about_ca_topic_score_gemma":0.0000031774978,"teacher_disagreement_score":0.34116447,"about_ca_system_score_codex":0.000008087809,"about_ca_system_score_gemma":0.000027869597,"threshold_uncertainty_score":0.27289093},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011986014680431324,"score_gpt":0.2587075825680769,"score_spread":0.2467215678876456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033885916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7408437,0.00045927172,0.25204524,0.0058227736,0.00069498114,0.000037195678,9.786546e-7,0.000010630716,0.0000852279],"genre_scores_gemma":[0.97190416,0.000054771535,0.027825154,0.00011830642,0.000088682136,6.325883e-7,9.189167e-7,0.000002332766,0.0000050448743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992488,0.000029103725,0.00031080164,0.000089734465,0.00025541265,0.00006617194],"domain_scores_gemma":[0.99931556,0.000063086736,0.00025567214,0.00007218107,0.000273446,0.000020064466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028354538,0.00005444633,0.00010577539,0.00022369549,0.000011712843,0.000049840182,0.00046547086,0.000025069323,0.0000013742156],"category_scores_gemma":[0.000102813254,0.000046842604,0.00002788535,0.00013975166,0.00004442855,0.00059519307,0.00011082758,0.00007906512,8.011204e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005786601,0.00022746723,0.0019019581,0.00002539571,0.000063370164,0.00012011193,0.0025348354,0.0055659097,0.0025302712,0.86466193,0.00015130642,0.12215959],"study_design_scores_gemma":[0.0013046403,0.00021209946,0.03409672,0.00014830274,0.0000036983572,0.00031343766,0.00017514486,0.002874677,0.007819365,0.95292205,0.000050968625,0.00007890526],"about_ca_topic_score_codex":0.000015966907,"about_ca_topic_score_gemma":0.0000027119454,"teacher_disagreement_score":0.23106048,"about_ca_system_score_codex":0.000031347256,"about_ca_system_score_gemma":0.00006580126,"threshold_uncertainty_score":0.1910186},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.004614855934500324,"score_gpt":0.21672886526042498,"score_spread":0.21211400932592467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034376971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6080452,0.000493778,0.38744456,0.003163848,0.00063620793,0.00005072243,0.000005240814,0.000009298306,0.00015111834],"genre_scores_gemma":[0.99766755,0.000027903086,0.0016632276,0.0004045792,0.00014027349,9.916298e-7,0.000004544648,0.000003504272,0.000087399254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890625,0.00009479594,0.00036961975,0.00008977067,0.00046360388,0.000075973396],"domain_scores_gemma":[0.99899304,0.00014499911,0.00041395408,0.00008938665,0.00033966717,0.000018959658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003754261,0.00007721133,0.0000991179,0.000046592137,0.00008748824,0.0001612061,0.00064631295,0.000027465085,0.00000685281],"category_scores_gemma":[0.000015709875,0.00004371741,0.000076033386,0.00012269558,0.0000721013,0.00028330216,0.000120181925,0.000102720034,6.269218e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015888944,0.0005254154,0.0088918125,0.000027028644,0.00060200365,0.000022250846,0.0047015697,0.030115858,0.03291823,0.71811134,0.059061818,0.14486378],"study_design_scores_gemma":[0.0032388987,0.00036093057,0.10618634,0.00018029356,0.00007949906,0.00071852334,0.0005146829,0.44575453,0.058078196,0.37750253,0.0069923652,0.0003932163],"about_ca_topic_score_codex":0.00007129233,"about_ca_topic_score_gemma":0.0000050708963,"teacher_disagreement_score":0.41563866,"about_ca_system_score_codex":0.000025996065,"about_ca_system_score_gemma":0.000044968427,"threshold_uncertainty_score":0.17827442},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014575788118619308,"score_gpt":0.31065270864338135,"score_spread":0.29607692052476203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035672135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17757936,0.00006994885,0.8187626,0.0022196607,0.00089048006,0.00011668231,0.0000011883266,0.000010738574,0.00034933386],"genre_scores_gemma":[0.9455664,0.000021282052,0.053024426,0.0002588639,0.001046477,0.0000069311527,0.0000019896402,0.0000054112515,0.000068179674],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999096,0.000034609468,0.00026460752,0.00010989239,0.00038405982,0.000110862886],"domain_scores_gemma":[0.99865043,0.00021116635,0.00019468661,0.00005462505,0.0008107916,0.00007829766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022123764,0.0000663985,0.00009687231,0.00023667338,0.000050032537,0.00024642627,0.0005022543,0.000025457997,0.000025889918],"category_scores_gemma":[0.00006812648,0.000057310874,0.000065711625,0.000096939635,0.000040661656,0.0010157474,0.00008065395,0.00009195693,0.000010999888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085510095,0.00008780703,0.0009484732,0.0000069897856,0.00012780337,0.000018723602,0.0006531645,0.0005777546,0.0018303882,0.31131014,0.0033873478,0.6809659],"study_design_scores_gemma":[0.0012845926,0.00029852404,0.013198304,0.000030821357,0.000005069279,0.00021663142,0.00006509595,0.043906238,0.0012574109,0.9367406,0.0028765749,0.00012014842],"about_ca_topic_score_codex":0.000002915083,"about_ca_topic_score_gemma":5.901124e-7,"teacher_disagreement_score":0.7679871,"about_ca_system_score_codex":0.000032819116,"about_ca_system_score_gemma":0.0000469834,"threshold_uncertainty_score":0.23762943},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016194796174388626,"score_gpt":0.2693054178421257,"score_spread":0.25311062166773707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036486445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096603625,0.000609755,0.87902844,0.022829922,0.00061805634,0.0000627622,0.0000023619427,0.000030223473,0.0002148421],"genre_scores_gemma":[0.937254,0.00010455028,0.059943054,0.0020945114,0.0005179697,0.000001841385,0.0000034687516,0.000007097779,0.000073467345],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861646,0.00003591167,0.00038429082,0.0002030134,0.00060165767,0.00015868952],"domain_scores_gemma":[0.99878395,0.0001329726,0.0004155724,0.000102173166,0.00045888906,0.00010645563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020156728,0.00014231092,0.00016798738,0.00024858897,0.00007460004,0.00036784206,0.0006071084,0.0000456863,0.00001705299],"category_scores_gemma":[0.000037281196,0.00012146399,0.000101190584,0.00014608949,0.0000397191,0.0014914019,0.00015518925,0.0001675819,0.000012207014],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049378592,0.00014914658,0.001476086,0.000006743534,0.00018569392,0.000091581496,0.0011324397,0.004885874,0.00024234477,0.11876069,0.0013469395,0.8716731],"study_design_scores_gemma":[0.0029091833,0.0007455261,0.017331034,0.00013678553,0.00003951532,0.00097119843,0.00019349658,0.35733894,0.002405138,0.59177643,0.025635006,0.00051775435],"about_ca_topic_score_codex":0.0000016801652,"about_ca_topic_score_gemma":0.0000031213383,"teacher_disagreement_score":0.8711553,"about_ca_system_score_codex":0.00006823591,"about_ca_system_score_gemma":0.0000619401,"threshold_uncertainty_score":0.4953158},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02678779521546516,"score_gpt":0.2609105961594294,"score_spread":0.23412280094396426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037840685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75843865,0.00017232989,0.23723386,0.0031179676,0.00070526206,0.000053273154,0.0000069816942,0.000036342797,0.0002353488],"genre_scores_gemma":[0.9864493,0.000020060874,0.012509481,0.00077430235,0.00020331742,9.194568e-7,0.00001600657,0.000008261948,0.000018335159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983806,0.0000939683,0.00058150117,0.00021232494,0.0005549034,0.00017668624],"domain_scores_gemma":[0.9987238,0.00012325367,0.00048311029,0.00010793421,0.00049453217,0.00006736913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038917278,0.00015554053,0.0002555025,0.0002931988,0.00010032583,0.00022227458,0.00063651125,0.00006343795,0.000009805527],"category_scores_gemma":[0.00002637614,0.00014542343,0.00007556893,0.00023433266,0.00018300637,0.0005549995,0.0001928422,0.00024364471,0.0000030255167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030409175,0.000631224,0.019161308,0.00002912995,0.00013361424,0.00033071448,0.0019771308,0.008700761,0.0009568371,0.93270606,0.0017199859,0.033349168],"study_design_scores_gemma":[0.0012320121,0.00019964184,0.38137493,0.00011352728,0.000009444737,0.00040407173,0.00022989702,0.13573293,0.00062448555,0.47959754,0.00024793998,0.00023357947],"about_ca_topic_score_codex":0.00055046804,"about_ca_topic_score_gemma":0.00049135595,"teacher_disagreement_score":0.4531085,"about_ca_system_score_codex":0.00011275699,"about_ca_system_score_gemma":0.00008258164,"threshold_uncertainty_score":0.59301955},"labels":[],"label_agreement":null},{"id":"W2039977993","doi":"10.1142/s0218196715400056","title":"SLP compression for solutions of equations with constraints in free and hyperbolic groups","year":2015,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Free product; Upper and lower bounds; Abelian group; Group (periodic table); Pure mathematics; Mathematical analysis","score_opus":0.0804978267556539,"score_gpt":0.33485256570516164,"score_spread":0.2543547389495078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039977993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6176956,0.00030487202,0.38021377,0.0013918274,0.00019486109,0.00008382903,0.000016131644,0.0000037422194,0.00009533992],"genre_scores_gemma":[0.978274,0.00001779982,0.02158084,0.000031455565,0.0000710314,0.0000024670683,0.000004647305,0.0000049243176,0.000012852792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927294,0.00003729584,0.00033247072,0.000067534864,0.00021294708,0.00007680208],"domain_scores_gemma":[0.99856925,0.00055712584,0.0002975435,0.000036189893,0.00048367117,0.000056220488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003420358,0.000059953196,0.00016086754,0.000306765,0.000022237902,0.000013556266,0.000095527,0.000039032857,0.0000050755166],"category_scores_gemma":[0.00047720456,0.000048886846,0.000024639678,0.0000997959,0.0001314187,0.00015766668,0.0000368548,0.000072297786,1.7684897e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041103392,0.00050373876,0.0054755323,0.0000633474,0.00026346275,0.000022839971,0.003213652,0.0011742499,0.00033733578,0.90878356,0.0020273644,0.0777239],"study_design_scores_gemma":[0.004510581,0.0004641082,0.008175725,0.00016342037,0.000045779165,0.00036388918,0.0015651366,0.008322462,0.00010360567,0.9761145,0.00008212097,0.00008863189],"about_ca_topic_score_codex":0.000012690801,"about_ca_topic_score_gemma":0.000016821941,"teacher_disagreement_score":0.36057836,"about_ca_system_score_codex":0.000024010633,"about_ca_system_score_gemma":0.00007301236,"threshold_uncertainty_score":0.19935477},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.010339373780069298,"score_gpt":0.25179290970645424,"score_spread":0.24145353592638494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040684427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3926823,0.000020997088,0.60455054,0.001009796,0.0007743485,0.000039163482,7.975332e-7,0.000018772089,0.00090329064],"genre_scores_gemma":[0.88557625,0.0000037754776,0.11371665,0.0004782634,0.00019160696,0.0000015781595,0.0000016008757,0.000003850672,0.000026455797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991961,0.00002624326,0.00023858303,0.00011755456,0.0003346662,0.00008684103],"domain_scores_gemma":[0.99928117,0.00006999845,0.00016407866,0.00007076579,0.00032599462,0.00008800122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036769957,0.00006749656,0.000092103255,0.00019683434,0.000037889487,0.00024162121,0.00049068464,0.00002888395,0.0000050137874],"category_scores_gemma":[0.00004427283,0.000056359135,0.00003967392,0.00011886004,0.000018317513,0.0005398307,0.000103768056,0.00014541608,0.0000071286877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063861735,0.0003122376,0.0015926923,0.000011895913,0.00013533796,0.000042935077,0.003276993,0.0021235775,0.012399522,0.5669824,0.0021272018,0.41093135],"study_design_scores_gemma":[0.0024636928,0.0005912811,0.060997587,0.000119260956,0.000026778906,0.0024400696,0.00050519477,0.54622304,0.006869798,0.3692866,0.009878741,0.0005979333],"about_ca_topic_score_codex":0.000004299786,"about_ca_topic_score_gemma":7.3141416e-7,"teacher_disagreement_score":0.5440995,"about_ca_system_score_codex":0.000012721345,"about_ca_system_score_gemma":0.000047109912,"threshold_uncertainty_score":0.2329959},"labels":[],"label_agreement":null},{"id":"W2043052786","doi":"10.1142/s0218196702000754","title":"THE TRANSFER OF A COMMUTATOR IDENTITY IN A NIL-GENERATED ALGEBRA","year":2002,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Commutator; Mathematics; Multilinear map; Nilpotent; Identity (music); Pure mathematics; Algebra over a field; Commutator subgroup; Associative property; Field (mathematics); Group (periodic table); Nilpotent group; Transfer (computing); Lie algebra; Universal enveloping algebra; Lie conformal algebra; Normal subgroup; Computer science","score_opus":0.0385861756278908,"score_gpt":0.33583857900570396,"score_spread":0.29725240337781317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043052786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9196338,0.0004977,0.078074515,0.0010620878,0.00047337395,0.00008014641,0.0000033463139,0.0000071708496,0.00016785282],"genre_scores_gemma":[0.9951822,0.00023171591,0.0043571587,0.00007826404,0.000106180756,0.0000018318076,0.0000013774064,0.0000103416,0.00003092598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985852,0.00009978405,0.0006652206,0.000081125996,0.00047042596,0.00009819412],"domain_scores_gemma":[0.99865836,0.0005056971,0.00027295641,0.00007169207,0.0004526247,0.000038672973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039278305,0.00009298009,0.00018452588,0.00015925358,0.000051824078,0.000065434775,0.00029252155,0.00004508196,0.0000304851],"category_scores_gemma":[0.00022804241,0.00007140843,0.00007292388,0.00016148093,0.000089528476,0.00038425223,0.000035502035,0.00019708129,0.0000018341209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002366517,0.0005690762,0.0031456184,0.00005084473,0.00044762975,0.00010925487,0.0064012115,0.0006951746,0.0026827008,0.90706325,0.0008244334,0.07777416],"study_design_scores_gemma":[0.0015906898,0.00012495261,0.004167894,0.00012342643,0.000023207715,0.00018827574,0.00039075123,0.0077950815,0.002135475,0.9831005,0.00025056198,0.00010921005],"about_ca_topic_score_codex":0.000005292033,"about_ca_topic_score_gemma":0.00004257579,"teacher_disagreement_score":0.07766495,"about_ca_system_score_codex":0.000057083216,"about_ca_system_score_gemma":0.00002098017,"threshold_uncertainty_score":0.29119512},"labels":[],"label_agreement":null},{"id":"W2044752112","doi":"10.1142/s0218196713500434","title":"COUNTING FINE GRADINGS ON MATRIX ALGEBRAS AND ON CLASSICAL SIMPLE LIE ALGEBRAS","year":2013,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Lie algebra; Simple (philosophy); Algebraically closed field; Adjoint representation of a Lie algebra; Matrix (chemical analysis); Affine Lie algebra; Lie conformal algebra; Field (mathematics); Simple Lie group","score_opus":0.026052332314548867,"score_gpt":0.33269602333103504,"score_spread":0.3066436910164862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044752112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762081,0.00008278417,0.019144954,0.003429767,0.0005219354,0.00014873085,0.0000040213336,0.00003341788,0.0004262854],"genre_scores_gemma":[0.9850694,0.00003921472,0.013577971,0.0005760313,0.00058460864,0.000004712345,0.0000072914986,0.000029013821,0.000111746274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982302,0.000057549525,0.0006263509,0.00021953764,0.0006817417,0.00018458396],"domain_scores_gemma":[0.99775416,0.00097580877,0.00057712,0.000089758825,0.00047545147,0.00012770582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027440922,0.00020521744,0.00028488928,0.00028355175,0.0000987536,0.00021720747,0.00021851111,0.00009076977,0.0000864729],"category_scores_gemma":[0.00048511618,0.0001765539,0.00008222333,0.00009173684,0.0000908255,0.00044436989,0.00007667719,0.00035955536,0.000026964559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011724113,0.00020665179,0.001452394,0.00003310389,0.00019805081,0.000049507773,0.00047868356,0.000080540776,0.00075676065,0.9288503,0.0046489383,0.06312782],"study_design_scores_gemma":[0.0011120157,0.00040993025,0.0076239677,0.00015989675,0.000030251484,0.00022398082,0.00011440281,0.0024212115,0.000845125,0.9862396,0.00063701806,0.00018256449],"about_ca_topic_score_codex":0.0000051648994,"about_ca_topic_score_gemma":0.0000027043966,"teacher_disagreement_score":0.06294526,"about_ca_system_score_codex":0.000096033815,"about_ca_system_score_gemma":0.00003338121,"threshold_uncertainty_score":0.71996593},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011525382068489253,"score_gpt":0.2712008804228564,"score_spread":0.25967549835436715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045705351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97180724,0.0007548329,0.024554383,0.0018923463,0.0003298606,0.000050319504,0.000010445805,0.000015706106,0.0005848505],"genre_scores_gemma":[0.9927611,0.00008114989,0.0066755004,0.0001358873,0.0001957914,0.0000010111263,0.000009658103,0.000010021542,0.00012988324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886936,0.00005476121,0.00047559888,0.000112853166,0.000376247,0.00011117712],"domain_scores_gemma":[0.9987383,0.00042254047,0.0004058807,0.00005338613,0.00032460582,0.00005527863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030099464,0.00010857436,0.00018870117,0.00035731084,0.000050524814,0.00008714286,0.00018091386,0.0000661744,0.000028424382],"category_scores_gemma":[0.00020301978,0.00009532647,0.00004915531,0.00015462462,0.0000770495,0.00020034725,0.00006626503,0.0001452313,0.0000014084918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003000285,0.00040878315,0.01940848,0.000044196,0.00047707776,0.00013368724,0.0008574612,0.00008868833,0.0015960836,0.8803079,0.0476863,0.04869131],"study_design_scores_gemma":[0.0017261617,0.00019893252,0.020966861,0.000036056153,0.00003917879,0.0003600099,0.00017345362,0.00024839435,0.00019181945,0.9752867,0.00065930386,0.00011311697],"about_ca_topic_score_codex":0.000026611986,"about_ca_topic_score_gemma":0.000015515894,"teacher_disagreement_score":0.09497881,"about_ca_system_score_codex":0.000020773532,"about_ca_system_score_gemma":0.000028931538,"threshold_uncertainty_score":0.38873005},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.043533006456935947,"score_gpt":0.33322697254370864,"score_spread":0.28969396608677267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053694103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9479435,0.0002455437,0.05003444,0.0005334315,0.00082839053,0.00007743797,0.0000022150489,0.000016595513,0.0003184241],"genre_scores_gemma":[0.9720043,0.00015812347,0.02726014,0.00008770416,0.00041154976,0.0000012380006,0.0000010193722,0.000013690448,0.00006223887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988925,0.000045348774,0.0005246264,0.00009357557,0.00035619276,0.000087792956],"domain_scores_gemma":[0.9984715,0.0005124863,0.0005252383,0.000050580984,0.0003644244,0.00007577536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024856982,0.00010683314,0.0002419022,0.00015486915,0.000064157866,0.000044425677,0.00013662127,0.00004892384,0.000011769394],"category_scores_gemma":[0.000375233,0.000094968134,0.000052454343,0.000046395584,0.00007122153,0.00030253586,0.0000572548,0.00010919,0.0000025560792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092718104,0.0010062162,0.006590859,0.00019235,0.0014276232,0.0007146874,0.012754606,0.0005430014,0.011909158,0.8414338,0.012875781,0.109624736],"study_design_scores_gemma":[0.0016097828,0.00018272684,0.002388376,0.000100926016,0.00003960191,0.0019287053,0.00014951489,0.0008542333,0.00219026,0.98997396,0.00043105357,0.00015087536],"about_ca_topic_score_codex":0.000002120597,"about_ca_topic_score_gemma":5.803624e-7,"teacher_disagreement_score":0.14854014,"about_ca_system_score_codex":0.000045514786,"about_ca_system_score_gemma":0.000051230498,"threshold_uncertainty_score":0.38726884},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02021959567896121,"score_gpt":0.3107638551989609,"score_spread":0.2905442595199997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053952521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856921,0.0002992302,0.010612686,0.0028407485,0.00022568452,0.00011025254,7.202112e-7,0.0000068653785,0.00021173981],"genre_scores_gemma":[0.9939842,0.00012335536,0.0056430185,0.000064596374,0.00012333214,6.654033e-7,0.000001931782,0.0000062964564,0.000052597734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889827,0.000046313085,0.00054887944,0.00009429104,0.00028930412,0.00012291707],"domain_scores_gemma":[0.9987373,0.00039234737,0.00040727135,0.000038954004,0.00038416567,0.000040005958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010740996,0.00007763465,0.00012648116,0.0002469872,0.000047982365,0.000070505106,0.00012818811,0.000037043475,0.0000042866586],"category_scores_gemma":[0.00032541202,0.00005492714,0.00002107408,0.00015838117,0.00016372057,0.00014089019,0.000044634824,0.00012407267,0.0000011587064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056428346,0.00039171166,0.042646125,0.000088397996,0.0004958899,0.00021413322,0.0036205489,0.00015741469,0.0015459416,0.68020564,0.002319576,0.26775032],"study_design_scores_gemma":[0.0022540614,0.0002460537,0.11028732,0.000118130134,0.000030112386,0.0004132944,0.0015630214,0.0011025155,0.0009464633,0.88164467,0.0012564063,0.00013796455],"about_ca_topic_score_codex":0.000003784758,"about_ca_topic_score_gemma":0.000006806804,"teacher_disagreement_score":0.26761234,"about_ca_system_score_codex":0.00003169342,"about_ca_system_score_gemma":0.000031629097,"threshold_uncertainty_score":0.22398637},"labels":[],"label_agreement":null},{"id":"W2054539715","doi":"10.1142/s0218196710005625","title":"WHAT ARE MODULES? AN OVERVIEW OF BRET TILSON'S PAPER \"MODULES\" FROM A GEOMETRIC VIEWPOINT","year":2010,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Algebra over a field; Pure mathematics","score_opus":0.032511001445219526,"score_gpt":0.2970393193368077,"score_spread":0.2645283178915882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054539715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5426281,0.002655735,0.45017922,0.0010056806,0.0033896025,0.00007594659,0.0000024896017,0.000019020661,0.000044179294],"genre_scores_gemma":[0.9900168,0.00055481744,0.008659908,0.0003460019,0.0003953422,0.0000015365508,0.000008776505,0.0000070016517,0.000009781895],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984935,0.00008014751,0.0005062479,0.00019847609,0.0006105092,0.00011111836],"domain_scores_gemma":[0.998102,0.00010990672,0.0007871911,0.00015150396,0.0007417071,0.00010770661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042938974,0.00012077344,0.00024779583,0.00030957925,0.00003995214,0.00043719815,0.0006368885,0.00007461877,0.000026188187],"category_scores_gemma":[0.00005697144,0.00009829796,0.000105658764,0.00022174425,0.000041750427,0.0020499614,0.000110207366,0.00020218831,0.000006765813],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003840523,0.0002896645,0.0028828848,0.00003168567,0.00020608766,0.000066406225,0.0014263197,0.000350154,0.0019142384,0.18808916,0.00021869973,0.8044863],"study_design_scores_gemma":[0.0020621207,0.0006160293,0.3167343,0.0001991206,0.000054088745,0.00063273165,0.0004883063,0.055394802,0.0019288625,0.6155963,0.0058705816,0.0004227745],"about_ca_topic_score_codex":0.00006299759,"about_ca_topic_score_gemma":0.000037169855,"teacher_disagreement_score":0.8040635,"about_ca_system_score_codex":0.000024908019,"about_ca_system_score_gemma":0.000037560876,"threshold_uncertainty_score":0.4215912},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0415236511813588,"score_gpt":0.3444921501845859,"score_spread":0.3029684990032271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055307439","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93101966,0.00019222939,0.06630916,0.00062032044,0.0012159739,0.00006163508,0.0000036101283,0.00002358662,0.00055381336],"genre_scores_gemma":[0.97483087,0.000044522476,0.023553774,0.00050656125,0.0010060862,0.0000016918887,0.000008881049,0.000019398316,0.000028225457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870753,0.000050704744,0.0004592912,0.00010006446,0.0005174394,0.00016496037],"domain_scores_gemma":[0.99856883,0.0005776852,0.00042574745,0.0000673142,0.0002448551,0.00011556629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034926287,0.0001319898,0.00018230436,0.00021418605,0.00005795926,0.00005079385,0.0002032889,0.00005708729,0.000052723633],"category_scores_gemma":[0.00029154122,0.00011730286,0.00008752787,0.00007392666,0.000044034347,0.00053812854,0.00005432446,0.00022144755,0.000013475422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000880662,0.00022844166,0.0027704167,0.0000135895025,0.00015118263,0.000021896118,0.0007806445,0.0000129800055,0.00026477702,0.9587702,0.0018803552,0.035017435],"study_design_scores_gemma":[0.00067224,0.00018155569,0.007220977,0.00006314884,0.000028521037,0.00024026707,0.00014837731,0.000113624366,0.0006193583,0.9892242,0.0013635058,0.00012420176],"about_ca_topic_score_codex":0.0000017016431,"about_ca_topic_score_gemma":8.5628255e-7,"teacher_disagreement_score":0.043811187,"about_ca_system_score_codex":0.00008203716,"about_ca_system_score_gemma":0.000017309398,"threshold_uncertainty_score":0.47834718},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024250728931586245,"score_gpt":0.24278746655137284,"score_spread":0.2185367376197866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058703803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38317275,0.0003167592,0.615191,0.00035545285,0.0005408568,0.000028706958,0.0000037161726,0.000032727392,0.00035807208],"genre_scores_gemma":[0.9813482,0.000064097505,0.017798377,0.0006199143,0.00012620712,9.692287e-7,0.000011569227,0.0000068975583,0.000023729606],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892634,0.000065684726,0.00038216406,0.0001427593,0.00036748886,0.00011553343],"domain_scores_gemma":[0.9990091,0.00008666966,0.00033133803,0.000078025034,0.00041581405,0.000079094294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027176717,0.00010817142,0.00014501534,0.00015047214,0.00006192189,0.00019315236,0.00058158656,0.000042527736,0.00003300722],"category_scores_gemma":[0.00002313048,0.00009484461,0.000060063023,0.00010860581,0.000046676945,0.0007181111,0.000117151474,0.00011615239,0.0000075221596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025352073,0.00064794446,0.005132785,0.000021693368,0.0008024128,0.0002846533,0.011368748,0.00056439586,0.017360419,0.4595378,0.034599826,0.4694258],"study_design_scores_gemma":[0.0029846765,0.0011008111,0.039042987,0.00009953245,0.000056272915,0.0019167858,0.0006245541,0.26287928,0.022020508,0.66143227,0.0071289763,0.0007133531],"about_ca_topic_score_codex":0.000025027492,"about_ca_topic_score_gemma":0.0000013523072,"teacher_disagreement_score":0.59817547,"about_ca_system_score_codex":0.000028553935,"about_ca_system_score_gemma":0.00003805663,"threshold_uncertainty_score":0.3867651},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009276668163932947,"score_gpt":0.2518130665495769,"score_spread":0.24253639838564398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063858816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6330695,0.00025203632,0.36274874,0.0029949828,0.0007684371,0.00003917947,0.0000023838174,0.000033333028,0.00009137031],"genre_scores_gemma":[0.98822474,0.00009474719,0.00856549,0.0028537377,0.00022557269,0.00000133521,0.000006251928,0.0000094058805,0.000018720491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985697,0.000050800387,0.0004530896,0.00021377577,0.0005672601,0.00014536512],"domain_scores_gemma":[0.998929,0.000108744935,0.00036549752,0.000112861846,0.00037371265,0.00011013019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031382218,0.0001496509,0.00017828346,0.0002835784,0.000084272295,0.00034468254,0.0006065567,0.00006149554,0.000015971362],"category_scores_gemma":[0.000043787513,0.00012842883,0.000102353755,0.00018130036,0.000044466007,0.0007405177,0.00009137594,0.00018221162,0.000023805793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031308402,0.0008128884,0.0011577269,0.000023925904,0.00063535664,0.0008117178,0.008374622,0.029873105,0.020939866,0.59327173,0.0041695414,0.33961645],"study_design_scores_gemma":[0.006805506,0.0014269096,0.020671312,0.0005922991,0.00004948848,0.0025417907,0.00033780455,0.10033991,0.025094677,0.8403169,0.0010636118,0.00075980806],"about_ca_topic_score_codex":0.000013374511,"about_ca_topic_score_gemma":0.0000014059358,"teacher_disagreement_score":0.3551552,"about_ca_system_score_codex":0.00009678778,"about_ca_system_score_gemma":0.00008605809,"threshold_uncertainty_score":0.5237176},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04320609756760472,"score_gpt":0.35946869223160177,"score_spread":0.31626259466399703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074624422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9794963,0.00007625503,0.018942593,0.0006275497,0.00013119481,0.00005756834,0.0000073523447,0.000005102357,0.00065608777],"genre_scores_gemma":[0.99226844,0.000030130946,0.007477793,0.00005524053,0.00011751749,6.5634674e-7,0.0000034098018,0.00001019668,0.00003664077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986272,0.000105602114,0.00054189254,0.000065751665,0.0005778814,0.00008171302],"domain_scores_gemma":[0.9974892,0.0012096884,0.00053356204,0.0000622256,0.0006628473,0.000042460648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005650175,0.00007707374,0.00020640327,0.00028012553,0.000022476543,0.000023621991,0.00022450785,0.000040297215,0.000054913366],"category_scores_gemma":[0.00033411736,0.0000661123,0.00007643476,0.000077088895,0.000075776414,0.00020054447,0.000043060118,0.00015142797,0.0000027960161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015270774,0.00134832,0.0023103408,0.00015723651,0.00072923355,0.000029468838,0.0040872423,0.0044778083,0.007136686,0.88282144,0.0022108136,0.09316434],"study_design_scores_gemma":[0.0023220705,0.0010253319,0.0036056323,0.00035510922,0.00003685626,0.00015145208,0.00082227826,0.017106192,0.015097241,0.959105,0.0002386255,0.0001341997],"about_ca_topic_score_codex":0.0000045512147,"about_ca_topic_score_gemma":0.0000043740615,"teacher_disagreement_score":0.09303014,"about_ca_system_score_codex":0.000049702372,"about_ca_system_score_gemma":0.000053795364,"threshold_uncertainty_score":0.26959813},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018524558831716217,"score_gpt":0.31192714860071324,"score_spread":0.293402589768997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075351895","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94617516,0.00007095062,0.050496887,0.0009455427,0.0005816333,0.000046156732,0.0000021000308,0.000017836646,0.0016637412],"genre_scores_gemma":[0.98623693,0.00006511545,0.012647471,0.00022068864,0.0006729197,8.107713e-7,0.000002353735,0.000011895498,0.00014184398],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989795,0.00003579988,0.00040771178,0.00009270649,0.0003951609,0.00008910233],"domain_scores_gemma":[0.99913216,0.00019804046,0.00025291138,0.00004295842,0.00031461674,0.000059305483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016549672,0.00009166985,0.00014361694,0.00013706183,0.000038733426,0.00006306482,0.00019401028,0.000047779027,0.0001802729],"category_scores_gemma":[0.000102368234,0.000083584964,0.00006475255,0.000060515118,0.000044343968,0.0003363193,0.000025675214,0.00016189534,0.0000088171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009322871,0.00052735244,0.009194029,0.00004506263,0.0007015182,0.00029415867,0.002709366,0.0006586543,0.00052992377,0.2987768,0.012529295,0.67310154],"study_design_scores_gemma":[0.0013861828,0.00012654632,0.010154757,0.00006217889,0.000024510586,0.00058686384,0.00007910803,0.0014480037,0.0003781724,0.98428154,0.0013370524,0.00013508728],"about_ca_topic_score_codex":0.0000031976476,"about_ca_topic_score_gemma":0.0000016704155,"teacher_disagreement_score":0.68550473,"about_ca_system_score_codex":0.00005346086,"about_ca_system_score_gemma":0.00003126859,"threshold_uncertainty_score":0.34084958},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020239153241068,"score_gpt":0.3284267487454681,"score_spread":0.3081875955044001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075559395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38424903,0.00008766972,0.6147527,0.00037037797,0.00033672046,0.00005859889,0.00000463757,0.000009308623,0.00013093154],"genre_scores_gemma":[0.92564344,0.000008203569,0.07365374,0.000049217047,0.00054795557,0.0000028263153,0.000009229567,0.000009569055,0.00007583557],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991476,0.000015044574,0.00038603754,0.0000871501,0.00026716187,0.00009700881],"domain_scores_gemma":[0.998638,0.0003034784,0.00039436002,0.000022417795,0.00060939684,0.00003234797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023112392,0.00007825513,0.00014951067,0.00025698755,0.000044503206,0.000059382885,0.00012386171,0.00004167453,0.000011360066],"category_scores_gemma":[0.000098293895,0.00006844757,0.000070351845,0.00009122018,0.000028852111,0.0001707783,0.000016465861,0.000072228526,6.225126e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012328048,0.00041883293,0.0011924541,0.00006915004,0.00037093408,0.000053794432,0.0008703241,0.0014245268,0.00039212953,0.22545676,0.0024586932,0.7671691],"study_design_scores_gemma":[0.0013656293,0.00018429992,0.001005081,0.000050395076,0.000039999184,0.0002979944,0.00042241008,0.023149095,0.0005978745,0.97242075,0.00036363822,0.000102855345],"about_ca_topic_score_codex":0.000004815064,"about_ca_topic_score_gemma":0.0000014263275,"teacher_disagreement_score":0.76706624,"about_ca_system_score_codex":0.000028339844,"about_ca_system_score_gemma":0.000038220576,"threshold_uncertainty_score":0.27912107},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010866344651711499,"score_gpt":0.2641641481452289,"score_spread":0.25329780349351744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079424204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51034606,0.000037195343,0.4886667,0.0006342904,0.00021813772,0.000019824183,5.263878e-7,0.0000087612525,0.00006850529],"genre_scores_gemma":[0.9844895,0.00014904758,0.014896328,0.00028810577,0.00015061905,6.312478e-7,0.000004129621,0.000004532308,0.000017117021],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999098,0.000042666372,0.00036172927,0.000099298224,0.00030647058,0.000091821035],"domain_scores_gemma":[0.99895114,0.000057126937,0.00043798608,0.000058654667,0.00043456475,0.000060512724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018785868,0.000075400734,0.0001296265,0.00020790008,0.000029215897,0.00006790571,0.0003662179,0.00003436342,0.000008018345],"category_scores_gemma":[0.000039419327,0.00006794893,0.000051842737,0.0001616015,0.00003123609,0.00071811664,0.000062832994,0.00008175258,0.0000019459867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017629778,0.00034489072,0.023936102,0.000019858435,0.00024413303,0.00025913765,0.003651454,0.0020481867,0.1978801,0.23412521,0.00006810469,0.5372465],"study_design_scores_gemma":[0.0029227168,0.00083325047,0.43698382,0.00021785867,0.000044678083,0.004182128,0.0002129245,0.093996756,0.03921157,0.41933998,0.001613319,0.00044097105],"about_ca_topic_score_codex":0.0000026207504,"about_ca_topic_score_gemma":5.0565063e-7,"teacher_disagreement_score":0.53680557,"about_ca_system_score_codex":0.000034409975,"about_ca_system_score_gemma":0.00006295615,"threshold_uncertainty_score":0.27708772},"labels":[],"label_agreement":null},{"id":"W2085135455","doi":"10.1142/s0218196701000644","title":"SOLUTION TO A PROBLEM OF KUBLANOVSKY AND SAPIR","year":2001,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Congruence (geometry); Distributive property; Construct (python library); Variety (cybernetics); Finitely-generated abelian group; Simple (philosophy); Algebra over a field; Set (abstract data type); Pure mathematics; Computer science; Programming language","score_opus":0.012756864837683778,"score_gpt":0.2764957847873936,"score_spread":0.2637389199497098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085135455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.392477,0.0001400709,0.6052758,0.0017547777,0.00014805129,0.000037828675,4.2921783e-7,0.000007555223,0.00015849793],"genre_scores_gemma":[0.9220301,0.00008017308,0.07752436,0.0002618245,0.000083847015,8.146788e-7,8.428595e-7,0.0000027040621,0.0000153201],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992013,0.000025986856,0.0003034834,0.00011017508,0.0002801117,0.000078941266],"domain_scores_gemma":[0.9992032,0.00006158255,0.0002463737,0.000041817493,0.00037690994,0.00007011781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016969704,0.000067070636,0.000116475276,0.00020875252,0.000030860894,0.00006443336,0.00022738524,0.000024855803,0.0000025248166],"category_scores_gemma":[0.000021951366,0.000057666646,0.00003068289,0.00013484346,0.000026277035,0.00049597025,0.00009286972,0.00006420061,0.0000015882472],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013940853,0.00013175384,0.0060497345,0.0000142424415,0.00010073724,0.00006874347,0.0019658408,0.0044937236,0.0050557703,0.12658489,0.0002723633,0.8551228],"study_design_scores_gemma":[0.0033514847,0.0019802896,0.17536274,0.00038259686,0.000036559733,0.0036894847,0.0002717055,0.08729274,0.003111475,0.71956223,0.0044787787,0.0004798996],"about_ca_topic_score_codex":0.0000053270705,"about_ca_topic_score_gemma":0.0000016954548,"teacher_disagreement_score":0.85464287,"about_ca_system_score_codex":0.000022181595,"about_ca_system_score_gemma":0.000031087777,"threshold_uncertainty_score":0.23515776},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03148816624685013,"score_gpt":0.30734834241884823,"score_spread":0.2758601761719981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086964854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94500184,0.00019596801,0.052645702,0.0013062414,0.000505338,0.000069907706,0.000016348755,0.000008889333,0.00024974582],"genre_scores_gemma":[0.9845687,0.000049814123,0.014728016,0.00011097123,0.00045621986,0.0000010927545,0.00001565369,0.000012679101,0.000056856104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828744,0.00007906298,0.0009246862,0.000118199954,0.00047243727,0.00011818065],"domain_scores_gemma":[0.9975681,0.0004895023,0.0010012129,0.0000716982,0.0008067926,0.00006270217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044798624,0.00012637513,0.00037431277,0.000606653,0.000029676561,0.000019570498,0.00024100658,0.000082973325,0.00008668636],"category_scores_gemma":[0.00024606576,0.000110408386,0.00011452691,0.00022909799,0.00009248139,0.00022798109,0.000057182107,0.00014640931,0.0000034748007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027021063,0.00431053,0.019131549,0.00051135494,0.0045055933,0.00067544554,0.014589664,0.013644613,0.01908611,0.5058036,0.022248164,0.39279127],"study_design_scores_gemma":[0.018012218,0.0029380813,0.13850868,0.0008261955,0.000609369,0.002950912,0.0028652041,0.039041337,0.039669037,0.75203496,0.0015142185,0.0010298096],"about_ca_topic_score_codex":0.000011184834,"about_ca_topic_score_gemma":0.00000646317,"teacher_disagreement_score":0.39176148,"about_ca_system_score_codex":0.00003502388,"about_ca_system_score_gemma":0.00007899053,"threshold_uncertainty_score":0.45023233},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01655339035006916,"score_gpt":0.3075558645255735,"score_spread":0.29100247417550434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087031200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64044553,0.000043761658,0.3571749,0.00071932614,0.0011412071,0.000109647095,0.0000022463876,0.000020734706,0.00034262176],"genre_scores_gemma":[0.9767415,0.000018219358,0.02280804,0.00009471997,0.00023511786,0.00000675371,0.00000899356,0.000017107857,0.000069533664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987421,0.00004921657,0.0005361701,0.00010472611,0.00045011955,0.0001176395],"domain_scores_gemma":[0.9979289,0.00042743728,0.00041351424,0.00006680662,0.0010788527,0.00008446461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001673351,0.000119163444,0.00019639079,0.000325339,0.00006306589,0.00013788,0.00016704651,0.000057143312,0.000118028554],"category_scores_gemma":[0.0002106364,0.00010587141,0.00007427931,0.00017885785,0.00002847936,0.00077183085,0.00004924946,0.00016832833,0.00004048839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005119972,0.0037005206,0.004549554,0.00025627064,0.0023710008,0.00021562878,0.0060354443,0.0013708418,0.041458588,0.6962423,0.02220926,0.22107862],"study_design_scores_gemma":[0.0009434956,0.00024006166,0.0032499423,0.00009018094,0.00004841572,0.00067301496,0.00022192071,0.007275463,0.00064835424,0.98615474,0.00030644267,0.00014796111],"about_ca_topic_score_codex":0.000008262329,"about_ca_topic_score_gemma":6.5479225e-7,"teacher_disagreement_score":0.33629596,"about_ca_system_score_codex":0.000100789,"about_ca_system_score_gemma":0.00003118286,"threshold_uncertainty_score":0.43173108},"labels":[],"label_agreement":null},{"id":"W2091665273","doi":"10.1142/s0218196711006947","title":"ON ITERATED MAL'CEV PRODUCTS WITH A PSEUDOVARIETY OF GROUPS","year":2011,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Mathematics; Iterated function; Pure mathematics; Algebra over a field; Combinatorics; Mathematical analysis","score_opus":0.014421554238940155,"score_gpt":0.22727958137694076,"score_spread":0.21285802713800062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091665273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7217369,0.000042262294,0.27728993,0.00030186455,0.0003232762,0.000037483536,0.0000010550059,0.000013336994,0.00025388246],"genre_scores_gemma":[0.97205895,0.000009645031,0.027639113,0.00020715629,0.000067530425,6.7697846e-7,0.0000019201414,0.0000047204007,0.000010309142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911076,0.00004253724,0.0002899377,0.00012665495,0.00035823212,0.00007185369],"domain_scores_gemma":[0.9988262,0.00006677366,0.00037848565,0.00007966799,0.00060890545,0.00003998849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023088351,0.00008303903,0.0001231887,0.00017518572,0.000024004257,0.000065790635,0.000358768,0.000024793348,0.00000970884],"category_scores_gemma":[0.000027316784,0.0000605007,0.00003189208,0.00015322742,0.000040967545,0.0005071827,0.00004863569,0.000090690955,0.0000021704025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008786336,0.0006901948,0.002513023,0.00003611051,0.00045629774,0.00024848903,0.009782487,0.0009619334,0.0039014246,0.8606389,0.00049646274,0.11939602],"study_design_scores_gemma":[0.0059695565,0.005411785,0.19636005,0.00096016296,0.00008036986,0.0036232264,0.00051010336,0.12584475,0.051446237,0.608948,0.00016256457,0.000683218],"about_ca_topic_score_codex":0.000007395912,"about_ca_topic_score_gemma":5.473408e-7,"teacher_disagreement_score":0.25169095,"about_ca_system_score_codex":0.000017052615,"about_ca_system_score_gemma":0.000050990773,"threshold_uncertainty_score":0.2467147},"labels":[],"label_agreement":null},{"id":"W2094709030","doi":"10.1142/s0218196701000711","title":"ON THE ROOT OF LANGUAGES","year":2001,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università degli Studi di Milano; McMaster University","keywords":"Root (linguistics); Mathematics; Undecidable problem; Decidability; Context (archaeology); Regular language; Context-free language; Discrete mathematics; Linguistics; Automaton; Computer science; Natural language processing; Rule-based machine translation; Theoretical computer science","score_opus":0.009275104858219805,"score_gpt":0.2694619149082258,"score_spread":0.260186810050006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094709030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76839185,0.00012262764,0.2276249,0.002974947,0.00023722654,0.000016286209,4.3781992e-7,0.000006241067,0.000625462],"genre_scores_gemma":[0.9982521,0.00002395891,0.0012718261,0.00035022586,0.00008163269,2.6027848e-7,4.6540703e-7,0.0000018212304,0.000017714192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999432,0.00003687491,0.00017730353,0.000050219533,0.00026299528,0.00004056015],"domain_scores_gemma":[0.9993047,0.00025532555,0.00020206609,0.000050044895,0.00016930995,0.00001851701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023312248,0.000040148803,0.0000616014,0.000087213266,0.000021606505,0.000059517384,0.00035449382,0.000013145634,0.000012596748],"category_scores_gemma":[0.00004385384,0.000025160907,0.00003720416,0.00006573257,0.000022547849,0.00018654982,0.000041695967,0.000057572397,0.0000025536635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004293606,0.00008001215,0.0010968262,0.0000022238037,0.00008207893,0.00005684622,0.0008630273,0.0012161497,0.0009767177,0.77848977,0.0008440092,0.2162494],"study_design_scores_gemma":[0.00126631,0.0006029076,0.09000791,0.00023072417,0.000017142971,0.0011795646,0.0005384254,0.09632489,0.0063002245,0.8022301,0.0011172332,0.00018458074],"about_ca_topic_score_codex":0.0000036086462,"about_ca_topic_score_gemma":7.908728e-7,"teacher_disagreement_score":0.22986022,"about_ca_system_score_codex":0.000009466243,"about_ca_system_score_gemma":0.000015776413,"threshold_uncertainty_score":0.102603205},"labels":[],"label_agreement":null},{"id":"W2097107750","doi":"10.1142/s021819670000008x","title":"THE COMPLEX INDECOMPOSABLE REPRESENTATIONS OF Aut(F<sub>2</sub>) OF DEGREE LESS THAN SIX","year":2000,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Indecomposable module; Mathematics; Degree (music); Automorphism; Automorphism group; Combinatorics; Group (periodic table); Pure mathematics; Discrete mathematics","score_opus":0.049003521215516696,"score_gpt":0.3390675390609327,"score_spread":0.29006401784541597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097107750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9753582,0.00014853071,0.023027124,0.000531906,0.00021421735,0.00008351653,0.0000118839025,0.000007796393,0.00061682647],"genre_scores_gemma":[0.9957231,0.0001941849,0.0038811367,0.000031509164,0.0001156109,0.0000014126496,0.0000086037535,0.000010628903,0.000033756984],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984471,0.0000761298,0.0007501524,0.00009918359,0.0005218969,0.0001054986],"domain_scores_gemma":[0.99762577,0.00084395194,0.0007337112,0.00009730924,0.00064774306,0.000051509003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031346685,0.00010294052,0.00023066819,0.00016754166,0.00008553089,0.000039983846,0.000276868,0.00004283469,0.000030049836],"category_scores_gemma":[0.00014179348,0.00007847269,0.00011808046,0.00017044865,0.00013458266,0.00025440753,0.000039752584,0.0001352013,0.0000022431768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009203063,0.0007792475,0.013546265,0.00010922256,0.0011861167,0.00003549125,0.002743022,0.011044444,0.028700648,0.16613583,0.0022434862,0.77255595],"study_design_scores_gemma":[0.0019553844,0.00029425445,0.09648451,0.00020931878,0.00009411289,0.00027428727,0.0011204564,0.0065847,0.027905785,0.8646733,0.00021717048,0.00018671727],"about_ca_topic_score_codex":0.0000056036383,"about_ca_topic_score_gemma":0.000019720037,"teacher_disagreement_score":0.7723692,"about_ca_system_score_codex":0.000026360294,"about_ca_system_score_gemma":0.000054886943,"threshold_uncertainty_score":0.32000235},"labels":[],"label_agreement":null},{"id":"W2097354710","doi":"10.1142/s0218196704001967","title":"THE GLOBALS OF SOME SUBPSEUDOVARIETIES OF $\\mathsf{DA}$","year":2004,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Universidade do Porto; McGill University","keywords":"Mathematics; Semidirect product; Combinatorics; Pure mathematics; Group (periodic table); Physics","score_opus":0.0087214518467257,"score_gpt":0.25861110264183396,"score_spread":0.24988965079510825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097354710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70780855,0.0008861513,0.28851846,0.0020385527,0.0006222273,0.000029658651,0.000002060343,0.000007694467,0.00008664056],"genre_scores_gemma":[0.992406,0.00015392622,0.007252844,0.00009922997,0.00007953872,3.3369992e-7,6.791642e-7,0.0000024710596,0.000004944575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898994,0.000032983906,0.0004216025,0.00006659189,0.0004234943,0.00006541432],"domain_scores_gemma":[0.9987555,0.00016571862,0.0005284037,0.00007153574,0.00045026696,0.00002853806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003761781,0.000059839087,0.00012192972,0.000091337446,0.000040070034,0.00009677702,0.00054376235,0.000023934495,0.0000013359552],"category_scores_gemma":[0.000047088975,0.000041143987,0.00007098802,0.000086611115,0.00009402009,0.00046383834,0.000090967806,0.000059437287,8.587296e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004273316,0.000064383625,0.00021664336,0.000007807858,0.000107006665,0.000009654748,0.00082537736,0.0033199643,0.0019781878,0.9343948,0.00007949827,0.05895397],"study_design_scores_gemma":[0.0008567258,0.00021709148,0.013778628,0.0001098636,0.000011467752,0.00022052131,0.00019766725,0.006852691,0.010121714,0.96741724,0.00014528741,0.000071111164],"about_ca_topic_score_codex":0.000012431278,"about_ca_topic_score_gemma":8.207076e-7,"teacher_disagreement_score":0.28459746,"about_ca_system_score_codex":0.000023605326,"about_ca_system_score_gemma":0.00007912965,"threshold_uncertainty_score":0.16778031},"labels":[],"label_agreement":null},{"id":"W2097927392","doi":"10.1142/s0218196710005674","title":"A STRUCTURAL APPROACH TO THE LOCALITY OF PSEUDOVARIETIES OF THE FORM LH ⓜ V","year":2010,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monoid; Locality; Extension (predicate logic); Pure mathematics; Combinatorics; Algebra over a field; Linguistics","score_opus":0.009443461778471886,"score_gpt":0.24565702684049587,"score_spread":0.23621356506202398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097927392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72396374,0.000023097995,0.2737847,0.0013703215,0.0006770193,0.000041706306,0.0000019794297,0.0000031306197,0.00013430836],"genre_scores_gemma":[0.9892321,0.0000018949806,0.010454832,0.00020440777,0.00009780481,5.648941e-7,5.1780455e-7,0.0000019868128,0.0000058671126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991479,0.00003902062,0.00029653445,0.00006763627,0.0003961681,0.00005276628],"domain_scores_gemma":[0.9990459,0.00009769583,0.00034211282,0.00010719419,0.00038167537,0.000025397527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038777574,0.000053516746,0.00009455004,0.000059709935,0.00004279448,0.00006289396,0.000794939,0.000023758708,0.000002355825],"category_scores_gemma":[0.00005091098,0.00002830111,0.00006822149,0.000110170135,0.00007831247,0.00023497149,0.00016068782,0.00012615381,2.609449e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007847922,0.00010027415,0.0038268522,0.000022242237,0.0001636157,0.0000016184819,0.007853784,0.0059097856,0.0061997487,0.80668336,0.00042902527,0.16873123],"study_design_scores_gemma":[0.0007637381,0.00017383695,0.2523196,0.00006512892,0.000023807657,0.00054127164,0.0006013974,0.33498007,0.010348557,0.39975953,0.00028534082,0.00013771172],"about_ca_topic_score_codex":0.000017803995,"about_ca_topic_score_gemma":0.000003850713,"teacher_disagreement_score":0.40692383,"about_ca_system_score_codex":0.0000082882425,"about_ca_system_score_gemma":0.000046052734,"threshold_uncertainty_score":0.14772077},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00804054867491937,"score_gpt":0.2612491853130127,"score_spread":0.25320863663809334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104755092","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7834022,0.0006353057,0.21315637,0.0020748011,0.00032142785,0.000037993075,0.000002026788,0.000013324857,0.0003565655],"genre_scores_gemma":[0.97266704,0.00010049889,0.026780827,0.00029513065,0.000114376184,5.4181214e-7,0.0000015484145,0.0000040880605,0.00003592642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990995,0.00003957025,0.00034482672,0.00010898733,0.00032228726,0.00008480687],"domain_scores_gemma":[0.9991453,0.00013543628,0.00031853165,0.000059163056,0.0002814719,0.000060041704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033986723,0.00007624152,0.00013590185,0.00017222602,0.000039196548,0.00012402365,0.00030732583,0.000032104745,0.000010929353],"category_scores_gemma":[0.000027654982,0.00006660946,0.000038085956,0.00010140096,0.000041984673,0.0007718568,0.00010476807,0.00008729187,0.0000022629342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008459593,0.00021651,0.0029920079,0.000024086141,0.0002036014,0.00004227752,0.002851692,0.0055633765,0.0038663666,0.11422587,0.0011261968,0.86880344],"study_design_scores_gemma":[0.0038010986,0.0007417074,0.050106257,0.00045391623,0.000049581413,0.00197856,0.0006197356,0.64577633,0.015958173,0.27456117,0.005487597,0.00046590788],"about_ca_topic_score_codex":0.000008963757,"about_ca_topic_score_gemma":0.0000024541366,"teacher_disagreement_score":0.8683375,"about_ca_system_score_codex":0.000028163819,"about_ca_system_score_gemma":0.000049132945,"threshold_uncertainty_score":0.27162546},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014993756982300838,"score_gpt":0.30928168022603897,"score_spread":0.29428792324373815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125612913","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9072538,0.00018786284,0.090784624,0.0004136747,0.00091946055,0.00009875354,0.0000019194804,0.000004687043,0.00033523852],"genre_scores_gemma":[0.9944282,0.00003580498,0.0053008385,0.0000272632,0.00014138338,3.031259e-7,4.0525194e-7,0.00001003265,0.00005572912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984241,0.00005501023,0.0007164008,0.0000634498,0.0006509266,0.00009007666],"domain_scores_gemma":[0.9967842,0.0011496606,0.0011342998,0.00010802334,0.0007908682,0.00003291879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008401753,0.000087747896,0.0001853994,0.00007979319,0.00005962948,0.000024306646,0.00036032507,0.000044786764,0.000005586071],"category_scores_gemma":[0.00051551627,0.000052596202,0.00011544792,0.00008559419,0.00013037633,0.0001426964,0.00006624686,0.00013586548,3.476957e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032709437,0.00026777995,0.0019442942,0.00008787368,0.000499316,0.000013322532,0.003886746,0.00030831122,0.009305886,0.96410877,0.0007778933,0.018472688],"study_design_scores_gemma":[0.0007235477,0.00010335049,0.0037254218,0.00019430049,0.000049007936,0.00014463988,0.0004781299,0.00045386155,0.022275796,0.9715445,0.00024702743,0.0000604295],"about_ca_topic_score_codex":0.0000025709141,"about_ca_topic_score_gemma":0.000006184022,"teacher_disagreement_score":0.08717446,"about_ca_system_score_codex":0.000042867792,"about_ca_system_score_gemma":0.000053047443,"threshold_uncertainty_score":0.21448109},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04422240327387793,"score_gpt":0.2675585111768122,"score_spread":0.22333610790293423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126946720","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49949446,0.00014690572,0.49531245,0.0037220342,0.00068289594,0.000068080786,0.0000042262964,0.00001643682,0.00055248494],"genre_scores_gemma":[0.9792928,0.000020094662,0.020155646,0.00037000276,0.00012811227,8.9014827e-7,0.000002898514,0.000004181695,0.000025388776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985828,0.00010067346,0.00045493452,0.00011390436,0.0006596102,0.00008810229],"domain_scores_gemma":[0.99851745,0.00023369804,0.00056813395,0.000095270036,0.0005386823,0.000046769146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035333846,0.00008773961,0.0001393012,0.00013157034,0.00009294955,0.00005884573,0.00072162447,0.00003343766,0.000019972782],"category_scores_gemma":[0.00006990088,0.00006318977,0.00009089421,0.00016457308,0.00018222643,0.00052006356,0.00015720118,0.00012860564,0.0000027484732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000552421,0.0001857536,0.004764925,0.00001554168,0.00019261948,0.000031807966,0.0028807456,0.005786574,0.0010921946,0.95254827,0.0006041524,0.031842202],"study_design_scores_gemma":[0.0009762024,0.00014801702,0.08171263,0.00011175681,0.000014266824,0.00083950575,0.000074218195,0.11356143,0.0021527552,0.8000589,0.00021213146,0.00013816122],"about_ca_topic_score_codex":0.000008692124,"about_ca_topic_score_gemma":0.0000018476275,"teacher_disagreement_score":0.47979832,"about_ca_system_score_codex":0.000032101932,"about_ca_system_score_gemma":0.00012028137,"threshold_uncertainty_score":0.2576804},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008600406006068288,"score_gpt":0.2718593373967384,"score_spread":0.26325893139067014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133334995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45796174,0.00026817797,0.5298866,0.011313252,0.00032414208,0.00005971513,2.9123817e-7,0.000011777398,0.00017426856],"genre_scores_gemma":[0.9731986,0.000035706027,0.02447761,0.0021262283,0.0001525607,5.533095e-7,4.779512e-7,0.0000017659094,0.0000065066206],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991818,0.00005573879,0.00027030637,0.00011854245,0.00029400765,0.000079571444],"domain_scores_gemma":[0.9992629,0.00019097449,0.0001926416,0.00006104781,0.00023235797,0.000060054528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045627868,0.00006990897,0.00011656753,0.00007733065,0.00007883997,0.00023031014,0.00030885707,0.000020153178,0.000001252305],"category_scores_gemma":[0.00010571856,0.000045716562,0.000035563702,0.00009066043,0.000047939673,0.00040412068,0.00006057987,0.00010062073,0.00000184465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001913755,0.000052391504,0.0006265351,0.0000027057686,0.000043543547,0.000022119062,0.0018246998,0.0021616959,0.00033561754,0.39383164,0.0001522425,0.60075545],"study_design_scores_gemma":[0.0016811,0.00026176395,0.06436408,0.000037449252,0.000011341704,0.00036253178,0.000063783984,0.044383816,0.0001191894,0.88783485,0.0007667845,0.00011328297],"about_ca_topic_score_codex":0.0000033329889,"about_ca_topic_score_gemma":8.6799554e-7,"teacher_disagreement_score":0.60064214,"about_ca_system_score_codex":0.00003196663,"about_ca_system_score_gemma":0.000034468692,"threshold_uncertainty_score":0.22208859},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.10032451347535111,"score_gpt":0.3431030567158565,"score_spread":0.2427785432405054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140489090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31576067,0.00025083357,0.6827394,0.00064610783,0.00039670948,0.00008154532,0.000013745482,0.0000054343463,0.00010559184],"genre_scores_gemma":[0.91112417,0.000014224142,0.08872717,0.000023139679,0.00008134008,0.0000034420445,0.0000041775843,0.0000057595043,0.00001661002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991449,0.000027537943,0.0005039613,0.00006428849,0.0001714008,0.000087883716],"domain_scores_gemma":[0.99830633,0.0008089622,0.00038318522,0.000046825495,0.00042341044,0.000031298376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000359583,0.000062602514,0.00016660718,0.00040700258,0.000025012085,0.0000070750752,0.00016311923,0.000044241533,0.000030485466],"category_scores_gemma":[0.0010867192,0.000057393278,0.00006367457,0.00012891502,0.00005868851,0.00017644977,0.000034971865,0.00007276699,7.8630677e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114295464,0.0004933293,0.001991885,0.000053353113,0.00021290706,0.000010847877,0.0027819523,0.00036007407,0.00016216231,0.9786598,0.00073799456,0.014421376],"study_design_scores_gemma":[0.0010238684,0.00021631867,0.005807193,0.000063525105,0.00004153669,0.000058571466,0.00043318124,0.015345442,0.00026194064,0.9766807,0.000012435174,0.00005527999],"about_ca_topic_score_codex":0.000023612109,"about_ca_topic_score_gemma":0.000021436621,"teacher_disagreement_score":0.59536344,"about_ca_system_score_codex":0.000023253211,"about_ca_system_score_gemma":0.00004898717,"threshold_uncertainty_score":0.234043},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016274767816375216,"score_gpt":0.24335699623592,"score_spread":0.22708222841954478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142371518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34667757,0.00014031345,0.6506829,0.00011962648,0.0007322748,0.00003047134,0.0000015962019,0.000011881967,0.001603342],"genre_scores_gemma":[0.99386,0.000075080425,0.005847628,0.00015262855,0.00004044882,7.950525e-7,0.0000024702595,0.0000026725345,0.000018275485],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991134,0.00002650324,0.00035102657,0.0000886054,0.00034225543,0.000078249315],"domain_scores_gemma":[0.9991149,0.00004483857,0.0002855656,0.000048461574,0.00043413282,0.00007212469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016003527,0.00007493965,0.000094283285,0.00057484617,0.000072441355,0.00019741528,0.00022341574,0.000027341735,0.000021353275],"category_scores_gemma":[0.000017461582,0.00006547561,0.00004754255,0.00020977185,0.00006906357,0.0009969617,0.000071556075,0.00008083576,0.000009435294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009686523,0.00029172734,0.015678408,0.000019993284,0.00035797167,0.000084799634,0.0073119234,0.00009758373,0.00033443279,0.37846237,0.00066853844,0.5965954],"study_design_scores_gemma":[0.006317344,0.0015876611,0.42209405,0.0002816393,0.00013709243,0.007851069,0.002738683,0.25731418,0.0019231767,0.2971524,0.0016924976,0.0009102025],"about_ca_topic_score_codex":0.0000039501087,"about_ca_topic_score_gemma":6.898243e-7,"teacher_disagreement_score":0.6471824,"about_ca_system_score_codex":0.000016872435,"about_ca_system_score_gemma":0.000029604636,"threshold_uncertainty_score":0.26700178},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025828535238264255,"score_gpt":0.3013269032063554,"score_spread":0.27549836796809113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143684958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35811454,0.00010832382,0.6395515,0.0017862408,0.00024345593,0.00007794075,0.0000060970015,0.0000076263636,0.00010423854],"genre_scores_gemma":[0.988479,0.000023014387,0.011259061,0.00009015464,0.00013220018,0.0000017498643,0.0000041216404,0.0000040504815,0.000006621727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987114,0.00014773446,0.000452467,0.000121659716,0.00047103345,0.000095672374],"domain_scores_gemma":[0.99831957,0.00072264066,0.00045627108,0.0000769326,0.0003829214,0.000041677184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005051017,0.00008696827,0.00015948783,0.00022962772,0.000093414725,0.00014785379,0.0002580167,0.000031086856,0.000010056079],"category_scores_gemma":[0.000114770264,0.00006445596,0.000067437904,0.00013056769,0.0006641918,0.00056262093,0.000109572386,0.00014920117,8.976081e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024368722,0.000053094263,0.004279794,0.0000070385295,0.0001082486,0.000010746159,0.0006378638,0.0033767808,0.0014616515,0.91000307,0.00006072467,0.079757325],"study_design_scores_gemma":[0.0025430764,0.00010221955,0.16286075,0.000029781837,0.000014442537,0.0001565054,0.00008174794,0.12060767,0.0005866674,0.7128932,0.000036573027,0.000087388544],"about_ca_topic_score_codex":0.000088546956,"about_ca_topic_score_gemma":0.00002681841,"teacher_disagreement_score":0.6303645,"about_ca_system_score_codex":0.00003346166,"about_ca_system_score_gemma":0.000046138328,"threshold_uncertainty_score":0.2628438},"labels":[],"label_agreement":null},{"id":"W2154099120","doi":"10.1142/s0218196713400067","title":"THE FIRST HOCHSCHILD COHOMOLOGY GROUP OF A CLUSTER TILTED ALGEBRA REVISITED","year":2013,"lang":"en","type":"preprint","venue":"International Journal of Algebra and Computation","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Cohomology; Bimodule; Group (periodic table); Vector space; Extension (predicate logic); Cluster (spacecraft); Mathematics; Pure mathematics; Space (punctuation); Algebra over a field; Group cohomology; Combinatorics; Physics; Computer science; Quantum mechanics","score_opus":0.017814196254887376,"score_gpt":0.2918734764455674,"score_spread":0.27405928019068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154099120","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9611581,0.0013337,0.029589195,0.0030183636,0.0042848536,0.00040691617,0.000012238868,0.00002161707,0.00017501008],"genre_scores_gemma":[0.9951967,0.00039974827,0.0030814866,0.00024593994,0.0009872771,0.000010026086,0.0000222864,0.000029951052,0.000026568001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974786,0.00015990363,0.0012189649,0.0002322171,0.00074045896,0.0001698791],"domain_scores_gemma":[0.99536115,0.0009570959,0.002084354,0.00020443992,0.0013136058,0.000079349986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327089,0.00027155486,0.00054658507,0.00022664807,0.00011480017,0.00020820257,0.00073836814,0.00026764936,0.00002717829],"category_scores_gemma":[0.00031653847,0.00019107605,0.00027078897,0.00008060747,0.00015475856,0.00015131613,0.0005020241,0.0006233512,0.0000022608904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007225836,0.00024112673,0.0011195741,0.000274892,0.002467047,0.00002804392,0.0017384588,0.0012831684,0.00004198489,0.9652528,0.008717523,0.018112788],"study_design_scores_gemma":[0.0011790282,0.0001834763,0.003562868,0.00044894574,0.00014518111,0.00020909056,0.00006945255,0.004791235,0.00004590414,0.98853004,0.00065342494,0.00018136048],"about_ca_topic_score_codex":0.00003240635,"about_ca_topic_score_gemma":0.000008492916,"teacher_disagreement_score":0.03403861,"about_ca_system_score_codex":0.00008738499,"about_ca_system_score_gemma":0.00009678964,"threshold_uncertainty_score":0.7791855},"labels":[],"label_agreement":null},{"id":"W2261269916","doi":"10.1142/s0218196715500253","title":"Packing subgroups in solvable groups","year":2015,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Mathematics; Bounded function; Combinatorics; Solvable group; Group (periodic table); Finitely-generated abelian group; Property (philosophy); Nilpotent; Nilpotent group; Finitely generated group; Mathematical analysis","score_opus":0.05845439335433538,"score_gpt":0.33767210811704346,"score_spread":0.27921771476270807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261269916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9466741,0.0002093098,0.050584156,0.0009891072,0.0007338687,0.000036840516,6.6935814e-7,0.00000852431,0.00076340383],"genre_scores_gemma":[0.99341714,0.000021075892,0.006191524,0.00009516018,0.00023154117,6.70351e-7,0.0000020455598,0.000006756065,0.00003407435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990337,0.00005138105,0.0003975012,0.00007845746,0.0003396413,0.00009933847],"domain_scores_gemma":[0.99902153,0.00024119203,0.00028522394,0.000032192194,0.0003484323,0.00007144483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005553185,0.0000712493,0.00016180823,0.0004010001,0.000015191909,0.00004616462,0.00013941695,0.00004549934,0.000016136553],"category_scores_gemma":[0.00037471196,0.00006252654,0.000039203034,0.00015465383,0.000031138447,0.0002470738,0.00004189149,0.00013257015,0.0000041953554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048990763,0.0007383744,0.09449204,0.000044504668,0.00037862407,0.00064282684,0.008226662,0.0018384195,0.00027585722,0.74854094,0.006896479,0.13743536],"study_design_scores_gemma":[0.0018218752,0.00018174645,0.014632855,0.00005616443,0.000014442215,0.000528081,0.0013611085,0.0024116088,0.000106119165,0.9784877,0.00030129397,0.00009702063],"about_ca_topic_score_codex":0.000015521438,"about_ca_topic_score_gemma":0.000011211775,"teacher_disagreement_score":0.22994675,"about_ca_system_score_codex":0.000067217814,"about_ca_system_score_gemma":0.000056920733,"threshold_uncertainty_score":0.25497583},"labels":[],"label_agreement":null},{"id":"W2315867495","doi":"10.1142/s0218196716500612","title":"The subpower membership problem for semigroups","year":2016,"lang":"en","type":"preprint","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Semigroup; Mathematics; Commutative property; Direct product; Cancellative semigroup; Nilpotent; Polynomial; Combinatorics; Discrete mathematics","score_opus":0.015184544212072722,"score_gpt":0.2838025573647477,"score_spread":0.268618013152675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315867495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028834738,0.0010746542,0.95345086,0.012173844,0.0038075051,0.00021150033,0.000011790192,0.00003676998,0.0003983125],"genre_scores_gemma":[0.97594,0.00024435698,0.0224109,0.00036451124,0.00088573335,0.000015751843,0.000008113237,0.000014888442,0.00011576332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984599,0.00008613112,0.0005554379,0.00022727717,0.0005127624,0.00015849542],"domain_scores_gemma":[0.99719137,0.0008026327,0.00088378246,0.0001566599,0.0008939674,0.00007159962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009768734,0.00016667646,0.00019878506,0.000148892,0.00011576847,0.0006811547,0.0013344579,0.000105403415,0.0000034793543],"category_scores_gemma":[0.0000826075,0.000101383666,0.00018541265,0.000044852226,0.00006423514,0.00038094324,0.0004740475,0.00023378445,0.0000025240267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000157434,0.00007201595,0.00019579014,0.000048649355,0.00058056804,0.0000282591,0.0012705532,0.00071299286,0.0002669547,0.5589523,0.0073242043,0.4303903],"study_design_scores_gemma":[0.00065774814,0.00010416717,0.00064020645,0.00030318458,0.00002188369,0.00017328504,0.000049205195,0.026886169,0.00036823069,0.9661022,0.004528144,0.0001656084],"about_ca_topic_score_codex":0.0000024396677,"about_ca_topic_score_gemma":0.0000020342288,"teacher_disagreement_score":0.9471052,"about_ca_system_score_codex":0.00007948087,"about_ca_system_score_gemma":0.00015444147,"threshold_uncertainty_score":0.6568391},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Bounded function; Index (typography); Simple (philosophy); Combinatorics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.012535824474172154,"score_gpt":0.27228260381831376,"score_spread":0.2597467793441416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563565570","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.555552,0.000031795924,0.44377255,0.00033426168,0.00018641069,0.000029689807,0.0000013429255,0.0000030489794,0.000088911744],"genre_scores_gemma":[0.97277206,0.000018506129,0.027090764,0.000052285795,0.000056043653,5.048974e-7,7.674155e-7,0.0000029264072,0.000006126858],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989909,0.000028126662,0.00036966443,0.00011025373,0.00043211016,0.00006895631],"domain_scores_gemma":[0.99795717,0.00009482024,0.001009763,0.00014365214,0.0007515251,0.000043081272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022248965,0.000074951975,0.00018827875,0.00011744981,0.000058270958,0.000069368645,0.00063241186,0.00003130124,0.0000018445982],"category_scores_gemma":[0.00007182971,0.000056559584,0.000053136013,0.000046078814,0.00011441753,0.0008832174,0.0001210338,0.00009506969,3.4501713e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012609421,0.00063671893,0.13681558,0.000102576094,0.0006595239,0.00013837489,0.0023793736,0.018017478,0.0050719334,0.36074436,0.00015090831,0.47402224],"study_design_scores_gemma":[0.001881403,0.0006899223,0.7404258,0.00014291577,0.000016910739,0.00014254847,0.00007468808,0.016606394,0.002889787,0.23697452,0.00004104729,0.000114020455],"about_ca_topic_score_codex":0.000041385483,"about_ca_topic_score_gemma":0.0000046935643,"teacher_disagreement_score":0.6036103,"about_ca_system_score_codex":0.000023539375,"about_ca_system_score_gemma":0.00008337441,"threshold_uncertainty_score":0.23064329},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01046059632410859,"score_gpt":0.2923544748404146,"score_spread":0.281893878516306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570386222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31231165,0.00023646101,0.6859769,0.00077456655,0.0005318479,0.000104446946,0.0000024619558,0.000013173745,0.000048480146],"genre_scores_gemma":[0.937106,0.00003363111,0.06259216,0.00016516299,0.000089411216,0.0000025701338,0.000004836206,0.000003068558,0.0000031522388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989624,0.00003632934,0.00043608499,0.00012772069,0.0003455113,0.00009193771],"domain_scores_gemma":[0.9990992,0.00014221958,0.0002741985,0.000048266294,0.00039360372,0.00004254479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049336394,0.00008037644,0.00013955584,0.00026076764,0.000046805122,0.00039080443,0.00027888082,0.00003735544,0.0000012896115],"category_scores_gemma":[0.000038992064,0.00006895597,0.000048515663,0.00010118565,0.0000120861,0.000767681,0.00002245565,0.00007000974,0.000001207966],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019853695,0.00011697355,0.00035888868,0.00000955675,0.00003120009,0.00004097138,0.001413481,0.015519958,0.0010133564,0.0891314,0.00040753902,0.89175814],"study_design_scores_gemma":[0.0021293582,0.00050259545,0.009835095,0.000370834,0.000007066616,0.00053923356,0.00011990229,0.83275723,0.00028143247,0.1529477,0.00036355833,0.00014600386],"about_ca_topic_score_codex":0.0000035248956,"about_ca_topic_score_gemma":0.000001325652,"teacher_disagreement_score":0.8916121,"about_ca_system_score_codex":0.000070049355,"about_ca_system_score_gemma":0.000063273845,"threshold_uncertainty_score":0.37685362},"labels":[],"label_agreement":null},{"id":"W2727894299","doi":"10.1142/s021819671950019x","title":"Low-complexity computations for nilpotent subgroup problems","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Coset; Mathematics; Nilpotent; Centralizer and normalizer; Nilpotent group; Characteristic subgroup; Fitting subgroup; Bounded function; Conjugacy class; Commutator subgroup; Discrete mathematics; Computation; Combinatorics; Normal subgroup; Group (periodic table); Algorithm; p-group; Symmetric group; Mathematical analysis","score_opus":0.0311483277074883,"score_gpt":0.2916422187674985,"score_spread":0.2604938910600102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727894299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1408266,0.00038513137,0.85192287,0.0023669866,0.00398118,0.00035822354,0.000032929376,0.0000509974,0.000075077434],"genre_scores_gemma":[0.9174332,0.000093436814,0.08139892,0.00042612434,0.00049983873,0.000012816964,0.000089507805,0.000018446772,0.000027681877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787074,0.000093303584,0.0008302609,0.0003739631,0.00064459984,0.00018714085],"domain_scores_gemma":[0.9969228,0.00034402063,0.0011797203,0.00019465979,0.0012561542,0.00010268161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060597487,0.0002493041,0.00039650645,0.00040454252,0.00008320736,0.00064956077,0.0012344361,0.00014526409,0.000005654553],"category_scores_gemma":[0.000054397315,0.00023182713,0.00026755384,0.000093796276,0.00007151989,0.0005303863,0.00062115013,0.00037161124,0.000006952076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017348705,0.0007709504,0.00063803204,0.00068158144,0.0010411399,0.00005785025,0.0038566038,0.37540436,0.0006493467,0.31413496,0.0035148454,0.29907686],"study_design_scores_gemma":[0.0009766722,0.00017295999,0.004142043,0.00041638242,0.00003295161,0.00015697395,0.000045324985,0.5291997,0.00019644552,0.4641439,0.00027830273,0.00023833184],"about_ca_topic_score_codex":0.000012631677,"about_ca_topic_score_gemma":0.0000026336218,"teacher_disagreement_score":0.7766066,"about_ca_system_score_codex":0.00012526893,"about_ca_system_score_gemma":0.00023484444,"threshold_uncertainty_score":0.9453636},"labels":[],"label_agreement":null},{"id":"W2769089924","doi":"10.1142/s021819671850056x","title":"Two-dimensional systolic complexes satisfy property A","year":2018,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Property (philosophy); Cube (algebra); Quadric; Weight function; Function (biology)","score_opus":0.03320274974795927,"score_gpt":0.3359599765997186,"score_spread":0.3027572268517593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769089924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93202734,0.00004481174,0.06462056,0.0010891694,0.0005037588,0.00009282594,0.000005820384,0.000016571823,0.0015991083],"genre_scores_gemma":[0.9679723,0.0000038834423,0.031270288,0.00021657575,0.00043864892,0.0000011854703,0.0000032970734,0.000010551973,0.00008330056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988137,0.000047302983,0.00048270437,0.0000947929,0.00046890986,0.00009258571],"domain_scores_gemma":[0.9984312,0.00027368535,0.0003756173,0.000050169096,0.0007962536,0.000073049145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032697737,0.00009699943,0.000196686,0.00013466155,0.00005859919,0.00008616172,0.00015274412,0.000032826385,0.00009529316],"category_scores_gemma":[0.00019236702,0.00006233507,0.000066240864,0.00005690404,0.00009645068,0.00017424338,0.000055916928,0.000099460376,0.000013495713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036829535,0.0006116688,0.0012669777,0.000112712856,0.0007400497,0.00011539957,0.0019961142,0.00025611682,0.005781663,0.90058565,0.006023881,0.08214149],"study_design_scores_gemma":[0.0010928378,0.0002760354,0.0022770176,0.00023829192,0.00004240183,0.0009104638,0.00007092143,0.07945692,0.00031987202,0.914921,0.0002565189,0.00013770949],"about_ca_topic_score_codex":0.0000109240855,"about_ca_topic_score_gemma":0.000007686188,"teacher_disagreement_score":0.08200378,"about_ca_system_score_codex":0.000034890334,"about_ca_system_score_gemma":0.000042669297,"threshold_uncertainty_score":0.25419503},"labels":[],"label_agreement":null},{"id":"W2795834488","doi":"10.1142/s0218196718500285","title":"Birecurrent sets","year":2018,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Series (stratigraphy); Set (abstract data type); Automaton; Representation (politics); Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Theoretical computer science; Computer science","score_opus":0.01246235517186945,"score_gpt":0.2920277872573106,"score_spread":0.27956543208544116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795834488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44340605,0.00014011365,0.5530864,0.0013731616,0.0016505534,0.000016760147,6.1964226e-7,0.00001829896,0.00030806204],"genre_scores_gemma":[0.9841478,0.000026742287,0.015098251,0.00037668637,0.00033851786,2.6552152e-7,9.3294693e-7,0.0000026285754,0.000008160839],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993202,0.000030189682,0.00021717216,0.00008436526,0.0002843094,0.000063745465],"domain_scores_gemma":[0.9992361,0.000057848116,0.00019633604,0.000047159956,0.0004153997,0.000047124617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021026892,0.0000538966,0.000071409275,0.00014287833,0.000036624595,0.0001527585,0.00037198985,0.000018621,0.000011306679],"category_scores_gemma":[0.000022889844,0.00004451898,0.000036340713,0.0000754655,0.000039915943,0.00047462198,0.00008383044,0.000056138757,0.000014149531],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023129101,0.000058984107,0.0005279739,0.0000023869495,0.00006773324,0.000031276588,0.001014707,0.000046034937,0.00058072654,0.08894393,0.0015388456,0.9071643],"study_design_scores_gemma":[0.0019418303,0.0009338077,0.048415814,0.00020848808,0.000020616628,0.001875691,0.00016616334,0.3316643,0.0062839477,0.59964836,0.008505712,0.00033525727],"about_ca_topic_score_codex":0.0000019183026,"about_ca_topic_score_gemma":5.4655425e-7,"teacher_disagreement_score":0.906829,"about_ca_system_score_codex":0.000019936217,"about_ca_system_score_gemma":0.00003275067,"threshold_uncertainty_score":0.18154314},"labels":[],"label_agreement":null},{"id":"W2898795341","doi":"10.1142/s0218196720500125","title":"The complexity of properties of transformation semigroups","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semigroup; Mathematics; Semilattice; Idempotence; Transformation (genetics); Commutative property; Decidability; Discrete mathematics; Bicyclic semigroup; Cancellative semigroup; Polynomial; Pure mathematics; Combinatorics; Algebra over a field; Mathematical analysis","score_opus":0.03541922886832506,"score_gpt":0.26587798678265917,"score_spread":0.23045875791433412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898795341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59159034,0.0011457196,0.40407905,0.001664084,0.0012663242,0.000118479904,0.000007526091,0.000009658327,0.00011878771],"genre_scores_gemma":[0.99609613,0.00032624436,0.0034255628,0.000046675992,0.00008638963,0.0000013817715,0.000006083466,0.000005182938,0.0000063215416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826306,0.000108549866,0.0008110483,0.00011703158,0.0006209845,0.000079295525],"domain_scores_gemma":[0.99747694,0.00012810386,0.001316376,0.00014265993,0.00090710784,0.000028807888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006518948,0.000120893055,0.00026906806,0.00017411361,0.000040508596,0.00013995203,0.0009672939,0.000073816336,0.0000015588915],"category_scores_gemma":[0.00003593538,0.00008155293,0.00014818243,0.0000661915,0.00019351862,0.00040068536,0.00027106982,0.00023135818,8.0213357e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004360862,0.00032250915,0.00068124605,0.00064754975,0.0011520596,0.000009256177,0.016069302,0.036898457,0.010614013,0.6077174,0.0003322027,0.3251199],"study_design_scores_gemma":[0.0010998856,0.0002896191,0.010624584,0.0014086042,0.00005531375,0.00017905825,0.00061986607,0.50507593,0.026109695,0.4540987,0.00019268421,0.00024606325],"about_ca_topic_score_codex":0.000022077767,"about_ca_topic_score_gemma":0.0000025478776,"teacher_disagreement_score":0.46817747,"about_ca_system_score_codex":0.000036027806,"about_ca_system_score_gemma":0.00014216245,"threshold_uncertainty_score":0.3325632},"labels":[],"label_agreement":null},{"id":"W2921763576","doi":"10.1142/s021819671950036x","title":"Polynomial-time tests for difference terms in idempotent varieties","year":2019,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Idempotence; Variety (cybernetics); Idempotent matrix; Algebra over a field; Term (time); Incidence algebra","score_opus":0.010669204357749559,"score_gpt":0.2602329400250152,"score_spread":0.2495637356672656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921763576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7360181,0.000080390215,0.260808,0.0018323809,0.0010009562,0.00012879369,0.00000191172,0.000015554628,0.00011389921],"genre_scores_gemma":[0.9895141,0.000014345634,0.009886147,0.00029365707,0.00017416307,0.0000030855285,0.000004867529,0.0000057494203,0.00010385044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988703,0.000041408653,0.00045914805,0.00017963961,0.00031778772,0.00013169336],"domain_scores_gemma":[0.9989904,0.0003018317,0.00033358793,0.0000681512,0.00024684347,0.000059142014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028486855,0.00011118613,0.00019561913,0.00029847806,0.000028863486,0.00020600691,0.00045923045,0.000044209024,0.0000056285694],"category_scores_gemma":[0.000052353218,0.00009780486,0.00007639687,0.000110225716,0.000023055729,0.0005591606,0.00010480416,0.00010186376,0.000010273498],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004739498,0.0004286337,0.022726668,0.000053459356,0.0002343172,0.00005642841,0.0033330577,0.013284922,0.028022394,0.033431973,0.0021470112,0.8958072],"study_design_scores_gemma":[0.0038689296,0.00077688595,0.3506736,0.00019439757,0.00001420604,0.00029149954,0.00005539344,0.52125406,0.0014899567,0.12018203,0.0008371614,0.00036187065],"about_ca_topic_score_codex":0.000011205516,"about_ca_topic_score_gemma":0.0000024519804,"teacher_disagreement_score":0.8954453,"about_ca_system_score_codex":0.00006411916,"about_ca_system_score_gemma":0.0000835457,"threshold_uncertainty_score":0.39883664},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Aperiodic graph; Decidability; Mathematics; Set (abstract data type); Discrete mathematics; Combinatorics; Pure mathematics; Computer science","score_opus":0.004474427832064978,"score_gpt":0.2400935153321515,"score_spread":0.23561908750008653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963210887","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8163926,0.00015041258,0.1796518,0.0024551323,0.0010364215,0.000018878394,6.904008e-7,0.000015358602,0.00027871932],"genre_scores_gemma":[0.97620475,0.00003529988,0.023043009,0.00052535115,0.00017669282,3.4022554e-7,9.426988e-7,0.0000029959585,0.000010624146],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993984,0.000019367639,0.00020084468,0.000092449576,0.000228974,0.000059958664],"domain_scores_gemma":[0.9994397,0.000096312135,0.00016599095,0.000047008776,0.000192003,0.00005898747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022700716,0.000060005368,0.00008181755,0.0001354041,0.000043495416,0.00026745643,0.00027136906,0.00002881371,0.000011128795],"category_scores_gemma":[0.000032353,0.00005001501,0.000028757457,0.000048486665,0.00004922915,0.0005834221,0.00008535377,0.00013065268,0.0000024876288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021652499,0.000053686177,0.0017619448,0.000004627444,0.00006402525,0.00005827559,0.0015464852,0.00003485107,0.012825898,0.27760115,0.00030059056,0.7057268],"study_design_scores_gemma":[0.00205762,0.00037968956,0.10003382,0.00006446809,0.000023470231,0.0050553945,0.00034860792,0.13362698,0.003913956,0.75056,0.003596141,0.00033988242],"about_ca_topic_score_codex":0.0000024014055,"about_ca_topic_score_gemma":0.0000014803666,"teacher_disagreement_score":0.70538694,"about_ca_system_score_codex":0.000006105644,"about_ca_system_score_gemma":0.000028374481,"threshold_uncertainty_score":0.25790885},"labels":[],"label_agreement":null},{"id":"W2964149005","doi":"10.1142/s0218196717500084","title":"On the atoms of algebraic lattices arising in 𝔮-theory","year":2017,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Mathematics; Algebraic number; Algebra over a field; Pure mathematics; Algebraic theory; Mathematical analysis","score_opus":0.015634903759305544,"score_gpt":0.29598898408520485,"score_spread":0.2803540803258993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964149005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87063974,0.00011349308,0.12589197,0.0024622467,0.0004707231,0.000029132962,6.369582e-7,0.0000048049696,0.0003872235],"genre_scores_gemma":[0.99794555,0.000022701935,0.0016640123,0.0002869842,0.000067560606,4.4670654e-7,3.119267e-7,0.0000030229928,0.000009396879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999162,0.00008455759,0.00028979752,0.000086699874,0.00031182118,0.000065111715],"domain_scores_gemma":[0.9985549,0.00054073706,0.00059318385,0.0001309928,0.00015663306,0.0000235522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008307808,0.000061980245,0.00010766401,0.00014690789,0.000080206795,0.00025291982,0.00085749244,0.00002435226,0.000006605292],"category_scores_gemma":[0.00018226693,0.000042121635,0.000047595473,0.000037404763,0.00007578318,0.0005601344,0.00011692865,0.00011374159,0.0000020485718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040830917,0.000051951523,0.0013861952,0.0000033305178,0.00004646709,0.000025480656,0.0008450553,0.00030937587,0.00032747578,0.86919546,0.000042250784,0.1277261],"study_design_scores_gemma":[0.00046901332,0.000098269215,0.06682602,0.0001710821,0.000005056054,0.00006781204,0.000109209774,0.034724865,0.0014630394,0.8959792,0.00002666132,0.00005972017],"about_ca_topic_score_codex":0.0000083871255,"about_ca_topic_score_gemma":0.0000021163319,"teacher_disagreement_score":0.12766638,"about_ca_system_score_codex":0.00001813354,"about_ca_system_score_gemma":0.00003094829,"threshold_uncertainty_score":0.24389116},"labels":[],"label_agreement":null},{"id":"W2995707157","doi":"10.1142/s021819672050054x","title":"Distributive laws between the operads Lie and Com","year":2020,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Distributive property; Associative property; Commutative property; Associative algebra; Polynomial; Lie algebra; Algebra over a field; Algebraic number","score_opus":0.050163382115931104,"score_gpt":0.34496965339017316,"score_spread":0.2948062712742421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995707157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7204861,0.00016932748,0.2646613,0.014278646,0.00016520733,0.000061877465,0.000014485267,0.000010407864,0.00015264009],"genre_scores_gemma":[0.9933476,0.00005624683,0.0056648604,0.00047846037,0.00042878342,5.5480297e-7,0.0000063324865,0.000007530193,0.0000096653375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992502,0.000044952747,0.00029166232,0.000080089114,0.00027262757,0.00006050834],"domain_scores_gemma":[0.99896485,0.0004445333,0.0002520818,0.000031495078,0.00024233857,0.00006469563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011425397,0.00007486833,0.00013595747,0.000028972787,0.000060924718,0.000081577775,0.00017408509,0.000028873814,0.000009858095],"category_scores_gemma":[0.00022388395,0.000052741994,0.000035849716,0.000046475958,0.000070111375,0.00018013088,0.00008377272,0.0001758428,0.0000015989232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014690959,0.0000696506,0.0130898915,0.000034783494,0.0006236074,0.00006714015,0.0041617705,0.00009549109,0.00034913246,0.79908055,0.002435276,0.17984578],"study_design_scores_gemma":[0.0008526232,0.00017557219,0.012963362,0.00004946057,0.000056458644,0.00012030071,0.00027202925,0.0017298993,0.0005886053,0.98065424,0.002436456,0.00010101435],"about_ca_topic_score_codex":9.3009857e-7,"about_ca_topic_score_gemma":3.5400635e-7,"teacher_disagreement_score":0.27286148,"about_ca_system_score_codex":0.000021302218,"about_ca_system_score_gemma":0.000018307408,"threshold_uncertainty_score":0.21507561},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04290915741864221,"score_gpt":0.35515258667191724,"score_spread":0.31224342925327503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176795680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98364335,0.00019281592,0.0133209545,0.0020267302,0.00035213117,0.00008064273,0.000007721823,0.000036937767,0.00033871864],"genre_scores_gemma":[0.99550205,0.00016482688,0.0040273513,0.00012772763,0.000083474166,0.0000034225777,0.00001030919,0.000011080768,0.00006973584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989871,0.000048871745,0.00035526187,0.000118140255,0.00038869862,0.0001019752],"domain_scores_gemma":[0.998703,0.0005119333,0.0002558608,0.00005586962,0.0004017925,0.000071565766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002902253,0.00009905263,0.00016243955,0.000262798,0.00009176968,0.00010996371,0.00018244195,0.000041188854,0.00004182405],"category_scores_gemma":[0.00006874172,0.00008822581,0.000048653554,0.00018448246,0.00007195916,0.0002878685,0.00009071741,0.00014850155,0.0000100420575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013442156,0.00017827358,0.01592595,0.000043296994,0.00047987085,0.00005761978,0.0018995098,0.00018796905,0.0032752866,0.90659887,0.012387209,0.05883172],"study_design_scores_gemma":[0.00072404696,0.00009148984,0.11730932,0.00005680092,0.000030305218,0.00015020708,0.00018633518,0.0026358622,0.00030340604,0.87752813,0.00087643793,0.00010762921],"about_ca_topic_score_codex":0.000009450877,"about_ca_topic_score_gemma":0.0000067590236,"teacher_disagreement_score":0.10138337,"about_ca_system_score_codex":0.000022523782,"about_ca_system_score_gemma":0.00003401491,"threshold_uncertainty_score":0.3597744},"labels":[],"label_agreement":null},{"id":"W3202595936","doi":"10.1142/s0218196723500133","title":"Cogrowth series for free products of finite groups","year":2022,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Generating set of a group; Cayley graph; Alphabet; Symmetric group; Free product; Group (periodic table); Discrete mathematics; Graph","score_opus":0.010833698914913082,"score_gpt":0.24161646759643685,"score_spread":0.23078276868152375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202595936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38249394,0.00032379333,0.61216795,0.0036136087,0.0012299055,0.000083779094,0.000019362209,0.000015554337,0.000052082847],"genre_scores_gemma":[0.97382706,0.000015915479,0.025798744,0.00018036364,0.00014146137,0.0000044585186,0.000007150533,0.0000043437703,0.000020519767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991098,0.000048048954,0.000303112,0.00010205203,0.00037194762,0.00006505415],"domain_scores_gemma":[0.9989099,0.0001783907,0.00038799777,0.000076418386,0.00042240266,0.000024903744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004000127,0.00005834541,0.00011202205,0.00017075316,0.000070411545,0.000062681545,0.0006015475,0.000011605396,0.0000062172726],"category_scores_gemma":[0.00009835892,0.00005468342,0.000052159823,0.0001207756,0.000028912535,0.0004983243,0.00022636128,0.000073389165,2.1950699e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004598539,0.00034151506,0.0008352699,0.000061426115,0.00032942483,0.000051081697,0.004742694,0.011108933,0.005340435,0.81608194,0.0041599297,0.15648748],"study_design_scores_gemma":[0.0024049997,0.0014364216,0.0068122097,0.00005562129,0.000026779086,0.0008452457,0.00062809704,0.09679298,0.0075429697,0.8797295,0.0035165506,0.00020859204],"about_ca_topic_score_codex":0.0000021547958,"about_ca_topic_score_gemma":3.2853265e-7,"teacher_disagreement_score":0.5913331,"about_ca_system_score_codex":0.000023947834,"about_ca_system_score_gemma":0.000060387396,"threshold_uncertainty_score":0.22299251},"labels":[],"label_agreement":null},{"id":"W3211500601","doi":"10.1142/s0218196721500612","title":"Hierarchy for groups acting on hyperbolic ℤn-spaces","year":2021,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cégep de Saint-Laurent","funders":"","keywords":"Mathematics; Lexicographical order; Metric space; Abelian group; Hyperbolic group; Hierarchy; Group (periodic table); Algebra over a field; Combinatorics; Pure mathematics; Hyperbolic manifold; Hyperbolic function; Mathematical analysis","score_opus":0.044664916654907544,"score_gpt":0.34732197274257437,"score_spread":0.3026570560876668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211500601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91539496,0.00017821434,0.079270095,0.003544105,0.0008640746,0.000049160222,0.000003440178,0.0000104620485,0.00068548444],"genre_scores_gemma":[0.98532677,0.00004495445,0.013678929,0.0002880072,0.0005063153,0.0000015403807,0.0000054745706,0.0000091787215,0.00013881705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991966,0.000042952037,0.0003030792,0.00010044178,0.0002628478,0.000094088944],"domain_scores_gemma":[0.99814737,0.0009635722,0.00029554174,0.00003652885,0.00050875155,0.00004821151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022889665,0.00007691082,0.000161939,0.00021285584,0.000052949876,0.00007390083,0.000104568164,0.000043535507,0.000033625918],"category_scores_gemma":[0.0006302572,0.0000671933,0.0000863903,0.00009516106,0.000026174373,0.00010250701,0.000029700308,0.00011390725,0.0000023502869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034766193,0.00047162984,0.0015142373,0.000066716035,0.0007017028,0.00017032928,0.00222978,0.00041300984,0.0013013636,0.65820503,0.0048739063,0.32970464],"study_design_scores_gemma":[0.0019217747,0.00039328152,0.0038269826,0.00011009983,0.000055383647,0.00070075196,0.0015018475,0.0016167316,0.002562958,0.9834907,0.0036723767,0.00014710378],"about_ca_topic_score_codex":0.0000010619295,"about_ca_topic_score_gemma":0.0000017995653,"teacher_disagreement_score":0.32955754,"about_ca_system_score_codex":0.000031675183,"about_ca_system_score_gemma":0.000052479052,"threshold_uncertainty_score":0.27400634},"labels":[],"label_agreement":null},{"id":"W4226469167","doi":"10.1142/s0218196722500370","title":"Failure of the finitely generated intersection property for ascending HNN extensions of free groups","year":2022,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Intersection (aeronautics); Finitely-generated abelian group; Stallings theorem about ends of groups; Property (philosophy); Rank (graph theory); Context (archaeology); Class (philosophy); Free group; Group (periodic table); Pure mathematics; Combinatorics","score_opus":0.039603279517756974,"score_gpt":0.2984175173411997,"score_spread":0.2588142378234427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226469167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9399186,0.00005538782,0.057318103,0.0015448397,0.00096450927,0.00012481786,0.000021340678,0.000004693682,0.000047751557],"genre_scores_gemma":[0.99478686,0.0000049495497,0.004972405,0.00005727021,0.00010501076,0.000004264409,0.0000052683226,0.000007334094,0.000056619076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899024,0.000075690026,0.00046625754,0.00007472526,0.00032984684,0.00006326309],"domain_scores_gemma":[0.9983499,0.00030388014,0.00070725754,0.000061665174,0.00055677065,0.000020537349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003497289,0.00006410617,0.00016367668,0.00025981758,0.00008802065,0.000011486769,0.00025330402,0.00002718148,0.000043244654],"category_scores_gemma":[0.00041787126,0.000040782168,0.00011526711,0.000197704,0.00004831621,0.00008431962,0.00013206786,0.00013657221,9.089399e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023126057,0.0023786179,0.015560906,0.00039054107,0.0030125987,0.000042099797,0.014021136,0.026837373,0.07469413,0.7067103,0.0460972,0.10794253],"study_design_scores_gemma":[0.005243006,0.0016859137,0.019181006,0.0002150681,0.0002674557,0.0012108181,0.0072789704,0.031148419,0.012507531,0.9195974,0.0014043673,0.00026005317],"about_ca_topic_score_codex":0.00001097249,"about_ca_topic_score_gemma":0.0000063867656,"teacher_disagreement_score":0.21288714,"about_ca_system_score_codex":0.00004563889,"about_ca_system_score_gemma":0.000057653182,"threshold_uncertainty_score":0.16630486},"labels":[],"label_agreement":null},{"id":"W4239536472","doi":"10.1142/s0218196721920028","title":"Erratum: Fibers of word maps and the multiplicities of non-abelian composition factors","year":2021,"lang":"en","type":"erratum","venue":"International Journal of Algebra and Computation","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Correctness; Statement (logic); Abelian group; Mathematics; Composition (language); Word (group theory); Code (set theory); Affect (linguistics); Discrete mathematics; Pure mathematics; Algorithm; Computer science; Linguistics; Programming language; Geometry; Set (abstract data type)","score_opus":0.029236163740056883,"score_gpt":0.32403276395890007,"score_spread":0.2947966002188432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239536472","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785909,0.0018647508,0.008464236,0.0011612924,0.0070401817,0.00034785317,0.00014823789,0.000010065263,0.0023724916],"genre_scores_gemma":[0.99406004,0.0007153379,0.002985457,0.00004531935,0.00047403175,0.0000027945275,0.00019314015,0.00003300219,0.0014908628],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977717,0.00024177972,0.0008591353,0.00013811268,0.0008797284,0.000109572116],"domain_scores_gemma":[0.9958232,0.0013851254,0.0013239719,0.00010211053,0.0013127361,0.000052826024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006747436,0.00018772743,0.00056248537,0.00041347515,0.0000542729,0.00008975288,0.00031333647,0.00016877484,0.00001918174],"category_scores_gemma":[0.0002535406,0.00013501113,0.00018584906,0.00012420733,0.0003715086,0.00016372075,0.00013560547,0.0005651308,3.1359255e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00863316,0.0018684678,0.0039863205,0.0059281867,0.0140267825,0.00033581193,0.07976632,0.0012289028,0.0074475855,0.22016788,0.59457946,0.06203115],"study_design_scores_gemma":[0.009913518,0.00082448294,0.012676621,0.0067849252,0.0007028799,0.00059871556,0.010055078,0.013173459,0.0027398183,0.9405181,0.0013408934,0.0006715302],"about_ca_topic_score_codex":0.00003121237,"about_ca_topic_score_gemma":0.000010066693,"teacher_disagreement_score":0.7203502,"about_ca_system_score_codex":0.00005318381,"about_ca_system_score_gemma":0.0001515961,"threshold_uncertainty_score":0.5505594},"labels":[],"label_agreement":null},{"id":"W4386806925","doi":"10.1142/s0218196723500637","title":"Taking the high-edge route of rank-3 outer space","year":2023,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Space Satellite Systems and Control","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Automorphism; Corollary; Principal curvature; Geodesic; Pure mathematics; Rank (graph theory); Gravitational singularity; Invariant (physics); Space (punctuation); Surface (topology); Geometry; Combinatorics; Curvature; Mathematical analysis; Mean curvature; Mathematical physics","score_opus":0.009504525804319673,"score_gpt":0.2390400900580992,"score_spread":0.22953556425377952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386806925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95860934,0.00044158314,0.037615534,0.0011501812,0.0016198524,0.00005282906,0.000004179125,0.000028533203,0.0004779487],"genre_scores_gemma":[0.9992804,0.000110919165,0.00020115513,0.00003400081,0.0003228246,9.849946e-7,0.000003090551,0.00000860713,0.000038001795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999367,0.000020834928,0.00025813706,0.00004304833,0.00024596756,0.00006503853],"domain_scores_gemma":[0.9994691,0.000092687296,0.00017655268,0.00003500978,0.00020446538,0.00002218735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002032302,0.000060340488,0.000111892936,0.00013259413,0.000019358333,0.000052255335,0.000119962846,0.000025040566,0.000014472214],"category_scores_gemma":[0.00001918534,0.000042867774,0.000055552493,0.00009414989,0.000016413213,0.0001405577,0.000015857207,0.00007915502,0.0000066845714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017526998,0.000041620475,0.008382331,0.00009626636,0.0015426824,0.00015635295,0.0068421895,0.3175923,0.017910093,0.02627016,0.003372572,0.61761814],"study_design_scores_gemma":[0.0038516817,0.00021086771,0.3830731,0.00049029244,0.00011764065,0.00043418733,0.0016976432,0.57751995,0.005018772,0.021986539,0.0052402173,0.00035911013],"about_ca_topic_score_codex":0.000022443404,"about_ca_topic_score_gemma":0.000004810135,"teacher_disagreement_score":0.617259,"about_ca_system_score_codex":0.00002071056,"about_ca_system_score_gemma":0.000011053277,"threshold_uncertainty_score":0.17480971},"labels":[],"label_agreement":null},{"id":"W4389579579","doi":"10.1142/s0218196723500686","title":"Detecting similarities of rational plane curves using complex differential invariants","year":2023,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Plane curve; Differential (mechanical device); Plane (geometry); Complex plane; Differential geometry of curves; Mathematical analysis; Algebra over a field; Geometry; Differential equation; Ordinary differential equation","score_opus":0.031824736434836624,"score_gpt":0.3008329964118779,"score_spread":0.26900825997704125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389579579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61624765,0.000078111385,0.3833206,0.00010193828,0.00015786353,0.000023135997,0.000007752668,0.00003851542,0.000024422794],"genre_scores_gemma":[0.9920747,0.00020290248,0.007529823,0.00003867285,0.000115498435,5.545714e-7,0.000027625892,0.000008262601,0.000001945847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991932,0.00002322408,0.00036791764,0.00005195556,0.0003001674,0.0000635449],"domain_scores_gemma":[0.9994248,0.00012800843,0.00017063813,0.000022346076,0.0002270322,0.00002718468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009940182,0.00006870166,0.0001542771,0.00024189414,0.000025749283,0.000023484015,0.00009659661,0.000023995768,0.000023213614],"category_scores_gemma":[0.000050170787,0.00006609605,0.00005029559,0.00013486261,0.000029421088,0.00021263005,0.000028100858,0.00008470963,6.370902e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017030464,0.000114502756,0.0077356906,0.00036106887,0.0013660665,0.00009341934,0.0008882118,0.65938294,0.23679172,0.002699441,0.0018556294,0.08854099],"study_design_scores_gemma":[0.00045444147,0.000071470015,0.03247271,0.0003363674,0.00005065826,0.00011898914,0.00012889276,0.938987,0.0109748505,0.016214607,0.000050666185,0.00013935257],"about_ca_topic_score_codex":0.0000046194855,"about_ca_topic_score_gemma":0.0000015678521,"teacher_disagreement_score":0.37582704,"about_ca_system_score_codex":0.000028368057,"about_ca_system_score_gemma":0.000011533332,"threshold_uncertainty_score":0.26953188},"labels":[],"label_agreement":null},{"id":"W4396809627","doi":"10.1142/s0218196724500279","title":"The automorphism group of finite 2-groups associated to the Macdonald group","year":2024,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Group (periodic table); Outer automorphism group; Automorphism; Automorphism group; p-group; Alternating group; Inner automorphism; Combinatorics; Finite group; Pure mathematics","score_opus":0.033888224576484674,"score_gpt":0.33944314480177296,"score_spread":0.3055549202252883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396809627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8586244,0.0010418807,0.12513593,0.012472785,0.0018987013,0.00026015402,0.000033571196,0.00003984487,0.0004927262],"genre_scores_gemma":[0.998195,0.00008924151,0.0010523248,0.0001920318,0.00030855337,0.000005228344,0.0000084369885,0.000018262026,0.00013090689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980589,0.00022788614,0.0005664357,0.00011277465,0.00089292903,0.00014104568],"domain_scores_gemma":[0.99504054,0.0040263515,0.00027281966,0.00008594041,0.0005136819,0.000060651688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020949338,0.00010648842,0.00015898938,0.00021719612,0.00011217749,0.00026032954,0.00048276034,0.00004870008,0.000029133313],"category_scores_gemma":[0.0008534948,0.00006229792,0.00012493184,0.00025569543,0.000095643714,0.00018454266,0.00012179599,0.00030806818,0.000012925245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041025368,0.00021602066,0.00040455957,0.000056406694,0.0011824563,0.00011872472,0.0035973387,0.00079750596,0.0012792805,0.8767212,0.011469807,0.103746444],"study_design_scores_gemma":[0.0006864237,0.0004993847,0.0080489125,0.00043499045,0.000077004814,0.00020731041,0.00047747346,0.05416336,0.0001545509,0.92892104,0.006191553,0.00013797428],"about_ca_topic_score_codex":0.000007718741,"about_ca_topic_score_gemma":0.000025122612,"teacher_disagreement_score":0.13957061,"about_ca_system_score_codex":0.000088201465,"about_ca_system_score_gemma":0.000050569022,"threshold_uncertainty_score":0.25404355},"labels":[],"label_agreement":null},{"id":"W4401824721","doi":"10.1142/s0218196724500449","title":"Loose ear decompositions and their applications to right-angled Artin groups","year":2024,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Ocular Disorders and Treatments","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Artin group; Artin L-function; Pure mathematics; Combinatorics; Conductor; Geometry; Coxeter group","score_opus":0.004720313946614053,"score_gpt":0.27133910535585415,"score_spread":0.2666187914092401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401824721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83035445,0.0023652287,0.1658802,0.0010391012,0.00014057862,0.00007903718,0.000012445091,0.0000050146396,0.00012396096],"genre_scores_gemma":[0.99772733,0.0001337171,0.001703216,0.0001697504,0.00017611656,0.000006587349,0.00004741975,0.0000067472224,0.00002910019],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996051,0.00001616212,0.00014435324,0.000106287574,0.00007845696,0.00004960973],"domain_scores_gemma":[0.99973613,0.000014959323,0.000044066688,0.000032462358,0.000117853946,0.00005452688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000055990207,0.0000639404,0.000059564634,0.00008608114,0.000039850795,0.000091210335,0.000058180984,0.000028107264,0.000005952512],"category_scores_gemma":[0.000005074918,0.00005064328,0.00004392908,0.00004386697,0.000018804805,0.000011965971,0.000032964403,0.00003810011,0.0000045300976],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031505676,0.0006209877,0.0052162446,0.00004881912,0.0021416273,0.00009876771,0.0016837283,0.0012190217,0.18454365,0.018987926,0.0029075984,0.78221655],"study_design_scores_gemma":[0.010492322,0.005618718,0.14056182,0.00094673724,0.0006922325,0.00589161,0.0023545327,0.027408816,0.17737101,0.43345737,0.1931943,0.0020105266],"about_ca_topic_score_codex":0.000001623212,"about_ca_topic_score_gemma":0.000004543799,"teacher_disagreement_score":0.780206,"about_ca_system_score_codex":0.00000936043,"about_ca_system_score_gemma":0.000021759042,"threshold_uncertainty_score":0.20651731},"labels":[],"label_agreement":null},{"id":"W4402527419","doi":"10.1142/s0218196724500498","title":"A fast algorithm for Stallings foldings over virtually free groups","year":2024,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Algorithm","score_opus":0.019532224203268066,"score_gpt":0.3181054903268191,"score_spread":0.29857326612355106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402527419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.330833,0.00033693443,0.6664882,0.0010395077,0.0011035219,0.00006998775,0.000018535638,0.000023834811,0.00008650406],"genre_scores_gemma":[0.92338866,0.00006464897,0.07529876,0.00017986004,0.00083316595,0.000003977951,0.000009331418,0.000021228074,0.00020038456],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893415,0.000020064275,0.00043191493,0.00013457249,0.00036445443,0.000114841496],"domain_scores_gemma":[0.9986256,0.00068839296,0.00021581394,0.000043941553,0.00036629714,0.000059958198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003572139,0.000108131295,0.0001781309,0.00041357608,0.000038993287,0.00016280831,0.0002212786,0.000062784784,0.000045767178],"category_scores_gemma":[0.00020536213,0.00009210561,0.00013130692,0.0001318692,0.000040704384,0.00029920088,0.000059318623,0.00013612273,0.000002523865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065316526,0.00011168924,0.00007856831,0.000058038877,0.00053007534,0.00009068096,0.0013169585,0.00006561277,0.0002977983,0.37189502,0.009208566,0.6162817],"study_design_scores_gemma":[0.0011151884,0.00033696284,0.0005722295,0.00012901876,0.000074619544,0.00040622655,0.00031581667,0.04633228,0.00013305014,0.94829756,0.0021627445,0.00012429169],"about_ca_topic_score_codex":0.00000444113,"about_ca_topic_score_gemma":0.000001597116,"teacher_disagreement_score":0.61615735,"about_ca_system_score_codex":0.000052136216,"about_ca_system_score_gemma":0.00005754503,"threshold_uncertainty_score":0.3755958},"labels":[],"label_agreement":null},{"id":"W4403712557","doi":"10.1142/s021819672450053x","title":"LEF-groups and computability of reversible endomorphisms of symbolic varieties","year":2024,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Endomorphism; Mathematics; Computability; Pure mathematics; Discrete mathematics; Algebra over a field","score_opus":0.012361142524401288,"score_gpt":0.2646042031679031,"score_spread":0.2522430606435018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403712557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47633037,0.0010641611,0.52077824,0.0007659302,0.0008884694,0.00006407229,0.0000048123925,0.00001960719,0.00008436451],"genre_scores_gemma":[0.9706508,0.00010768228,0.029058482,0.00004273536,0.00012338115,7.333883e-7,0.0000024646665,0.0000058801165,0.000007847085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823505,0.000114426446,0.0007117004,0.00023578889,0.00059440616,0.00010863546],"domain_scores_gemma":[0.99807245,0.0006132083,0.0003636888,0.00011559359,0.00076067337,0.00007440062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007248784,0.00013174351,0.00032129095,0.00036081747,0.00003344036,0.00015369075,0.0004684129,0.00005587043,0.000009335984],"category_scores_gemma":[0.00008294779,0.0001175031,0.000114984854,0.00025143632,0.00019534556,0.0006419313,0.0002880841,0.00017150945,9.44819e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020028975,0.0006242142,0.012838465,0.00056638406,0.0008561281,0.00015212261,0.01081815,0.010230539,0.005441778,0.4544774,0.00046747617,0.5033271],"study_design_scores_gemma":[0.001185872,0.0007896062,0.055500053,0.0003187788,0.0000615831,0.0010607853,0.00022267237,0.46515507,0.003789158,0.47136423,0.00030675385,0.00024543735],"about_ca_topic_score_codex":0.000028288876,"about_ca_topic_score_gemma":0.0000022344527,"teacher_disagreement_score":0.5030816,"about_ca_system_score_codex":0.000054431894,"about_ca_system_score_gemma":0.0001347534,"threshold_uncertainty_score":0.47916374},"labels":[],"label_agreement":null}]}